Lines Matching defs:entry
47 struct rl_entry *entry;
51 entry = CIRCLEQ_FIRST(rangelist);
53 if (CIRCLEQ_NEXT(entry, rl_link) == entry) panic("rl_verify: circular rangelist?!");
54 if ((limit > 0) && (entry->rl_start <= limit)) panic("rl_verify: bad entry start?!");
55 if (entry->rl_end < entry->rl_start) panic("rl_verify: bad entry end?!");
56 limit = entry->rl_end;
57 if (entry == CIRCLEQ_LAST(rangelist)) return;
58 entry = CIRCLEQ_NEXT(entry, rl_link);
105 * if the search hit a non-overlapping entry PAST the start of the
107 * to that entry:
121 preceding range entry)
216 * Now link the new entry into the range list after the range from which it was split:
226 next_range = CIRCLEQ_NEXT(overlap, rl_link); /* Check before discarding overlap entry */
262 * Scan a range list for an entry in a specified range (if any):
285 * Walk the list of ranges for an entry to
323 /* Case 0 (RL_NOOVERLAP), at least with the current entry: */