| /lib/math/ |
| D | prime_numbers.c | 13 unsigned long last, sz; member
19 .last = 61,
44 .last = 31,
135 if (x < p->last) { in expand_to_next_prime()
147 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
150 BUG_ON(new->last <= x); in expand_to_next_prime()
194 while (x >= p->last) { in next_prime_number()
203 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
257 p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf); in dump_primes()
266 unsigned long x, last; in selftest() local
[all …]
|
| /lib/ |
| D | klist.c | 336 struct klist_node *last = i->i_cur; in klist_prev() local
342 if (last) { in klist_prev()
343 prev = to_klist_node(last->n_node.prev); in klist_prev()
344 if (!klist_dec_and_del(last)) in klist_prev()
361 if (put && last) in klist_prev()
362 put(last); in klist_prev()
378 struct klist_node *last = i->i_cur; in klist_next() local
384 if (last) { in klist_next()
385 next = to_klist_node(last->n_node.next); in klist_next()
386 if (!klist_dec_and_del(last)) in klist_next()
[all …]
|
| D | test_min_heap.c | 38 int last; in pop_verify_heap() local
40 last = values[0]; in pop_verify_heap()
44 if (last > values[0]) { in pop_verify_heap()
45 pr_err("error: expected %d <= %d\n", last, in pop_verify_heap()
50 if (last < values[0]) { in pop_verify_heap()
51 pr_err("error: expected %d >= %d\n", last, in pop_verify_heap()
56 last = values[0]; in pop_verify_heap()
|
| D | interval_tree_test.c | 30 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search() argument
35 for (node = interval_tree_iter_first(root, start, last); node; in search()
36 node = interval_tree_iter_next(node, start, last)) in search()
50 nodes[i].last = b; in init()
110 unsigned long last = search_all ? max_endpoint : queries[j]; in interval_tree_test_init() local
112 results += search(&root, start, last); in interval_tree_test_init()
|
| D | interval_tree.c | 8 #define LAST(node) ((node)->last)
|
| D | dynamic_debug.c | 309 char *last = strchr(first, '-'); in parse_linerange() local
315 if (last) in parse_linerange()
316 *last++ = '\0'; in parse_linerange()
319 if (last) { in parse_linerange()
321 if (parse_lineno(last, &query->last_lineno) < 0) in parse_linerange()
|
| D | xarray.c | 1667 unsigned long last) in xas_set_range() argument
1670 unsigned long sibs = last - first; in xas_set_range()
1690 if ((((first + sibs + 1) << shift) - 1) > last) in xas_set_range()
1716 unsigned long last, void *entry, gfp_t gfp) in xa_store_range() argument
1722 if (last < first) in xa_store_range()
1729 if (last + 1) in xa_store_range()
1730 order = __ffs(last + 1); in xa_store_range()
1731 xas_set_order(&xas, last, order); in xa_store_range()
1737 xas_set_range(&xas, first, last); in xa_store_range()
1742 } while (first <= last); in xa_store_range()
|
| D | string.c | 484 const char *last = NULL; in strrchr() local
487 last = s; in strrchr()
489 return (char *)last; in strrchr()
|
| D | test_xarray.c | 1521 unsigned long last) in __check_store_range() argument
1524 xa_store_range(xa, first, last, xa_mk_index(first), GFP_KERNEL); in __check_store_range()
1527 XA_BUG_ON(xa, xa_load(xa, last) != xa_mk_index(first)); in __check_store_range()
1529 XA_BUG_ON(xa, xa_load(xa, last + 1) != NULL); in __check_store_range()
1531 xa_store_range(xa, first, last, NULL, GFP_KERNEL); in __check_store_range()
|
| D | Kconfig.debug | 1603 last reference count put is not predictable, and the kobject can
1614 on the last reference count to improve the visibility of this
|
| /lib/zlib_inflate/ |
| D | inflate.c | 43 state->last = 0; in zlib_inflateReset()
343 code last; /* parent table entry */ in zlib_inflate() local
413 if (state->last) { in zlib_inflate()
419 state->last = BITS(1); in zlib_inflate()
592 last = this; in zlib_inflate()
594 this = state->lencode[last.val + in zlib_inflate()
595 (BITS(last.bits + last.op) >> last.bits)]; in zlib_inflate()
596 if ((unsigned)(last.bits + this.bits) <= bits) break; in zlib_inflate()
599 DROPBITS(last.bits); in zlib_inflate()
634 last = this; in zlib_inflate()
[all …]
|
| D | inffast.c | 71 const unsigned char *last; /* while in < last, enough input available */ in inflate_fast() local
98 last = in + (strm->avail_in - 5); in inflate_fast()
308 } while (in < last && out < end); in inflate_fast()
319 strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last)); in inflate_fast()
|
| D | inflate.h | 76 int last; /* true if processing last block */ member
|
| /lib/vdso/ |
| D | gettimeofday.c | 14 u64 vdso_calc_delta(u64 cycles, u64 last, u64 mask, u32 mult) in vdso_calc_delta() argument
16 return ((cycles - last) & mask) * mult; in vdso_calc_delta()
55 u64 cycles, last, ns; in do_hres_timens() local
77 last = vd->cycle_last; in do_hres_timens()
78 ns += vdso_calc_delta(cycles, last, vd->mask, vd->mult); in do_hres_timens()
114 u64 cycles, last, sec, ns; in do_hres() local
148 last = vd->cycle_last; in do_hres()
149 ns += vdso_calc_delta(cycles, last, vd->mask, vd->mult); in do_hres()
|
| /lib/zlib_dfltcc/ |
| D | dfltcc_inflate.c | 103 if (state->last) { in dfltcc_inflate()
137 state->last = cc == DFLTCC_CC_OK; in dfltcc_inflate()
|
| /lib/842/ |
| D | 842_compress.c | 482 u64 last, next, pad, total; in sw842_compress() local
514 last = ~get_unaligned((u64 *)p->in); in sw842_compress()
528 if (next == last) { in sw842_compress()
536 if (next == last) /* reached max repeat bits */ in sw842_compress()
549 last = next; in sw842_compress()
|
| /lib/kunit/ |
| D | Kconfig | 24 test suite, which allow users to see results of the last test suite
|