Searched refs:last (Results 1 – 9 of 9) sorted by relevance
73 const struct exception_table_entry *last, in search_extable() argument76 while (first <= last) { in search_extable()79 mid = ((last - first) >> 1) + first; in search_extable()87 last = mid - 1; in search_extable()
337 struct klist_node *last = i->i_cur; in klist_next() local342 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()
37 nodes[i].last = b; in init()40 nodes[i].last = a; in init()
7 #define LAST(node) ((node)->last)
342 char *last = strchr(first, '-'); in ddebug_parse_query() local347 if (last) in ddebug_parse_query()348 *last++ = '\0'; in ddebug_parse_query()351 if (last) { in ddebug_parse_query()353 if (parse_lineno(last, &query->last_lineno) < 0) in ddebug_parse_query()
1113 last reference count put is not predictable, and the kobject can1124 on the last reference count to improve the visibility of this
33 state->last = 0; in zlib_inflateReset()329 code last; /* parent table entry */ in zlib_inflate() local395 if (state->last) { in zlib_inflate()401 state->last = BITS(1); in zlib_inflate()570 last = this; in zlib_inflate()572 this = state->lencode[last.val + in zlib_inflate()573 (BITS(last.bits + last.op) >> last.bits)]; in zlib_inflate()574 if ((unsigned)(last.bits + this.bits) <= bits) break; in zlib_inflate()577 DROPBITS(last.bits); in zlib_inflate()610 last = this; in zlib_inflate()[all …]
92 const unsigned char *last; /* while in < last, enough input available */ in inflate_fast() local119 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()
74 int last; /* true if processing last block */ member