best             2363 src/dps8/dps8_sys.c     int best = -1;
best             2385 src/dps8/dps8_sys.c             best = j;
best             2390 src/dps8/dps8_sys.c     if (best != -1)
best             2395 src/dps8/dps8_sys.c           * compname = book_components[best].compname;
best             2397 src/dps8/dps8_sys.c           * compoffset = offset - book_components[best].txt_start;
best             2399 src/dps8/dps8_sys.c                        book_components[best].compname,
best             2400 src/dps8/dps8_sys.c                        offset - book_components[best].txt_start);
best             2604 src/dps8/dps8_sys.c                     int best = -1;
best             2642 src/dps8/dps8_sys.c                             if (loc[n] > best && loc[n] <= (int) offset)
best             2644 src/dps8/dps8_sys.c                                 best = loc[n];
best             2649 src/dps8/dps8_sys.c                         if (best == (int) offset)
best             2652 src/dps8/dps8_sys.c                     if (best == -1)