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

/lib/
H A Dextable.c73 const struct exception_table_entry *last,
76 while (first <= last) {
79 mid = ((last - first) >> 1) + first;
87 last = mid - 1;
72 search_extable(const struct exception_table_entry *first, const struct exception_table_entry *last, unsigned long value) argument
H A Dinterval_tree.c7 #define LAST(node) ((node)->last)
H A Dklist.c337 struct klist_node *last = i->i_cur; local
342 if (last) {
343 next = to_klist_node(last->n_node.next);
344 if (!klist_dec_and_del(last))
361 if (put && last)
362 put(last);
H A Dinterval_tree_test.c37 nodes[i].last = b;
40 nodes[i].last = a;
H A Ddynamic_debug.c306 * line <first-lineno>-<last-lineno> // where either may be empty
342 char *last = strchr(first, '-'); local
347 if (last)
348 *last++ = '\0';
351 if (last) {
352 /* range <first>-<last> */
353 if (parse_lineno(last, &query->last_lineno) < 0)
357 pr_err("last-line:%d < 1st-line:%d\n",
446 /* check flags 1st (last arg) so query is pairs of spec,val */
463 last erro
[all...]
/lib/zlib_inflate/
H A Dinflate.c33 state->last = 0;
89 Update the window with the last wsize (normally 32K) bytes written before
96 advantage, since only the last 32K of output is copied to the sliding window
301 When there is a window, goto inf_leave will update the window with the last
329 code last; /* parent table entry */ local
395 if (state->last) {
401 state->last = BITS(1);
570 last = this;
572 this = state->lencode[last.val +
573 (BITS(last
[all...]
H A Dinflate.h27 TYPE, /* i: waiting for type bits, including last-flag bit */
74 int last; /* true if processing last block */ member in struct:inflate_state
H A Dinffast.c92 const unsigned char *last; /* while in < last, enough input available */ local
119 last = in + (strm->avail_in - 5);
330 } while (in < last && out < end);
341 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));

Completed in 63 milliseconds