Home
last modified time | relevance | path

Searched refs:last (Results 1 – 8 of 8) sorted by relevance

/lib/
Dextable.c73 const struct exception_table_entry *last, in search_extable() argument
76 while (first <= last) { in search_extable()
79 mid = ((last - first) >> 1) + first; in search_extable()
87 last = mid - 1; in search_extable()
Dklist.c337 struct klist_node *last = i->i_cur; in klist_next() local
342 if (last) { in klist_next()
343 next = to_klist_node(last->n_node.next); in klist_next()
344 if (!klist_dec_and_del(last)) in klist_next()
361 if (put && last) in klist_next()
362 put(last); in klist_next()
Dinterval_tree.c6 #define LAST(node) ((node)->last)
Dinterval_tree_test_main.c37 nodes[i].last = b; in init()
40 nodes[i].last = a; in init()
Ddynamic_debug.c339 char *last = strchr(first, '-'); in ddebug_parse_query() local
344 if (last) in ddebug_parse_query()
345 *last++ = '\0'; in ddebug_parse_query()
350 if (last) { in ddebug_parse_query()
352 if (parse_lineno(last, &query->last_lineno) in ddebug_parse_query()
/lib/zlib_inflate/
Dinflate.c33 state->last = 0; in zlib_inflateReset()
344 code last; /* parent table entry */ in zlib_inflate() local
410 if (state->last) { in zlib_inflate()
416 state->last = BITS(1); in zlib_inflate()
585 last = this; in zlib_inflate()
587 this = state->lencode[last.val + in zlib_inflate()
588 (BITS(last.bits + last.op) >> last.bits)]; in zlib_inflate()
589 if ((unsigned)(last.bits + this.bits) <= bits) break; in zlib_inflate()
592 DROPBITS(last.bits); in zlib_inflate()
625 last = this; in zlib_inflate()
[all …]
Dinffast.c92 const unsigned char *last; /* while in < last, enough input available */ in inflate_fast() local
119 last = in + (strm->avail_in - 5); in inflate_fast()
330 } while (in < last && out < end); in inflate_fast()
341 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last)); in inflate_fast()
Dinflate.h74 int last; /* true if processing last block */ member