best 2367 src/dps8/dps8_sys.c int best = -1; best 2389 src/dps8/dps8_sys.c best = j; best 2394 src/dps8/dps8_sys.c if (best != -1) best 2399 src/dps8/dps8_sys.c * compname = book_components[best].compname; best 2401 src/dps8/dps8_sys.c * compoffset = offset - book_components[best].txt_start; best 2403 src/dps8/dps8_sys.c book_components[best].compname, best 2404 src/dps8/dps8_sys.c offset - book_components[best].txt_start); best 2608 src/dps8/dps8_sys.c int best = -1; best 2646 src/dps8/dps8_sys.c if (loc[n] > best && loc[n] <= (int) offset) best 2648 src/dps8/dps8_sys.c best = loc[n]; best 2653 src/dps8/dps8_sys.c if (best == (int) offset) best 2656 src/dps8/dps8_sys.c if (best == -1)