| /lib/ |
| A D | interval_tree_test.c | 53 nodes[i].last = b; in init()
113 results += search(&root, start, last); in search_check()
133 unsigned long start, last; in intersection_range_check() local
164 last = ULONG_MAX; in intersection_range_check()
175 if (start <= node->last && last >= node->start) in intersection_range_check()
220 cur_last = mas->last > state->last_index ? in mas_cur_span()
221 state->last_index : mas->last; in mas_cur_span()
243 unsigned long start, last; in span_iteration_check() local
264 nodes[j].last, nodes + j, GFP_KERNEL)); in span_iteration_check()
271 last = ULONG_MAX; in span_iteration_check()
[all …]
|
| A D | interval_tree.c | 8 #define LAST(node) ((node)->last)
40 if (cur->last > state->nodes[0]->last) in interval_tree_span_iter_next_gap()
44 } while (cur && (state->nodes[0]->last >= cur->start || in interval_tree_span_iter_next_gap()
45 state->nodes[0]->last + 1 == cur->start)); in interval_tree_span_iter_next_gap()
79 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_first()
97 iter->last_used = iter->nodes[0]->last; in interval_tree_span_iter_next()
109 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()
117 iter->start_hole = iter->nodes[0]->last + 1; in interval_tree_span_iter_next()
|
| A 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()
386 if (!klist_dec_and_del(last)) in klist_next()
403 if (put && last) in klist_next()
[all …]
|
| A D | test_maple_tree.c | 573 last = mas.last; in check_find()
588 MT_BUG_ON(mt, last != mas.last); in check_find()
1684 mas.last = index; in check_gap_combining()
2030 mas.last = 929; in check_iteration()
2047 mas.last = 785; in check_iteration()
2064 mas.last = 765; in check_iteration()
2099 newmas.last = mas.last; in check_mas_store_gfp()
2313 mas.last = 5; in next_prev_test()
2783 newmas.last = mas.last; in check_dup_gaps()
3693 mas.last = 0x1200; in check_state_handling()
[all …]
|
| A D | maple_tree.c | 2772 last = next; in mtree_range_walk()
2805 mas->last = max; in mtree_range_walk()
3492 unsigned long last = wr_mas->mas->last; in mas_is_span_wr() local
3497 if (last < max) in mas_is_span_wr()
3502 if (last < max) in mas_is_span_wr()
3777 r_mas.last++; in mas_wr_spanning_store()
3781 r_mas.last = r_mas.index = mas->last; in mas_wr_spanning_store()
3791 mas->last = l_mas.last = r_mas.last; in mas_wr_spanning_store()
4947 mas->last = 0; in mas_walk()
5462 unsigned long last = mas->last; in mas_store_gfp() local
[all …]
|
| A D | test_min_heap.c | 32 int last; in pop_verify_heap() local
34 last = values[0]; in pop_verify_heap()
38 if (last > values[0]) { in pop_verify_heap()
39 pr_err("error: expected %d <= %d\n", last, 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 last = values[0]; in pop_verify_heap()
|
| A D | debugobjects.c | 162 last = obj->batch_last; in pool_move_batch()
163 next_batch = last->next; in pool_move_batch()
172 if (last->next) in pool_move_batch()
173 last->next->pprev = &last->next; in pool_move_batch()
184 struct hlist_node *last; in pool_push_batch() local
191 last = obj->batch_last; in pool_push_batch()
210 last = obj->batch_last; in pool_pop_batch()
211 next = last->next; in pool_pop_batch()
213 last->next = NULL; in pool_pop_batch()
378 if (!last) in kmem_alloc_batch()
[all …]
|
| A D | plist.c | 75 struct plist_node *first, *iter, *prev = NULL, *last, *reverse_iter; in plist_add() local
86 last = reverse_iter = list_entry(first->prio_list.prev, struct plist_node, prio_list); in plist_add()
96 if (likely(reverse_iter != last)) in plist_add()
|
| A D | alloc_tag.c | 377 end_tag = (struct alloc_tag *)(module_tags.start_addr + mas.last); in clean_unused_module_areas_locked()
512 mas.last = offset - 1; in reserve_module_tags()
519 mas.last = offset + size - 1; in reserve_module_tags()
527 mas.last = offset + size - 1; in reserve_module_tags()
579 end_tag = (struct alloc_tag *)(module_tags.start_addr + mas.last); in release_module_tags()
|
| A D | string.c | 382 const char *last = NULL; in strrchr() local
385 last = s; in strrchr()
387 return (char *)last; in strrchr()
|
| A D | xarray.c | 1824 unsigned long last) in xas_set_range() argument
1827 unsigned long sibs = last - first; in xas_set_range()
1847 if ((((first + sibs + 1) << shift) - 1) > last) in xas_set_range()
1873 unsigned long last, void *entry, gfp_t gfp) in xa_store_range() argument
1879 if (last < first) in xa_store_range()
1886 if (last + 1) in xa_store_range()
1887 order = __ffs(last + 1); in xa_store_range()
1888 xas_set_order(&xas, last, order); in xa_store_range()
1894 xas_set_range(&xas, first, last); in xa_store_range()
1899 } while (first <= last); in xa_store_range()
|
| A D | objpool.c | 39 slot->last = slot->tail; in objpool_init_percpu_slot()
|
| A D | dynamic_debug.c | 355 char *last = strchr(first, '-'); in parse_linerange() local
361 if (last) in parse_linerange()
362 *last++ = '\0'; in parse_linerange()
365 if (last) { in parse_linerange()
367 if (parse_lineno(last, &query->last_lineno) < 0) in parse_linerange()
|
| /lib/math/tests/ |
| A D | prime_numbers_kunit.c | 16 p->last, p->sz, p->primes[BITS_TO_LONGS(p->sz) - 1], buf); in dump_primes()
22 unsigned long x, last, next; in prime_numbers_test() local
24 for (last = 0, x = 2; x < max; x++) { in prime_numbers_test()
33 next = next_prime_number(last); in prime_numbers_test()
34 KUNIT_ASSERT_EQ_MSG(test, next, x, "next-prime(%lu)", last); in prime_numbers_test()
35 last = next; in prime_numbers_test()
|
| /lib/crypto/riscv/ |
| A D | sha512-riscv64-zvknhb-zvkb.S | 77 .macro sha512_4rounds last, w0, w1, w2, w3
83 .if !\last
89 .macro sha512_16rounds last
90 sha512_4rounds \last, W0, W1, W2, W3
91 sha512_4rounds \last, W1, W2, W3, W0
92 sha512_4rounds \last, W2, W3, W0, W1
93 sha512_4rounds \last, W3, W0, W1, W2
|
| A D | sha256-riscv64-zvknha_or_zvknhb-zvkb.S | 92 .macro sha256_4rounds last, k, w0, w1, w2, w3
96 .if !\last
102 .macro sha256_16rounds last, k0, k1, k2, k3
103 sha256_4rounds \last, \k0, W0, W1, W2, W3
104 sha256_4rounds \last, \k1, W1, W2, W3, W0
105 sha256_4rounds \last, \k2, W2, W3, W0, W1
106 sha256_4rounds \last, \k3, W3, W0, W1, W2
|
| /lib/math/ |
| A D | prime_numbers.c | 12 .last = 61,
37 .last = 31,
144 if (x < p->last) { in expand_to_next_prime()
156 new->last = clear_multiples(y, new->primes, p->sz, sz); in expand_to_next_prime()
159 BUG_ON(new->last <= x); in expand_to_next_prime()
203 while (x >= p->last) { in next_prime_number()
212 x = find_next_bit(p->primes, p->last, x + 1); in next_prime_number()
|
| A D | prime_numbers_private.h | 7 unsigned long last, sz; member
|
| /lib/zlib_inflate/ |
| A D | inflate.c | 43 state->last = 0; in zlib_inflateReset()
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()
599 DROPBITS(last.bits); in zlib_inflate()
634 last = this; in zlib_inflate()
636 this = state->distcode[last.val + in zlib_inflate()
637 (BITS(last.bits + last.op) >> last.bits)]; in zlib_inflate()
[all …]
|
| A 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()
|
| A D | inflate.h | 76 int last; /* true if processing last block */ member
|
| /lib/zlib_dfltcc/ |
| A D | dfltcc_inflate.c | 109 if (state->last) { in dfltcc_inflate()
141 state->last = cc == DFLTCC_CC_OK; in dfltcc_inflate()
|
| /lib/842/ |
| A 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()
538 if (next == last) /* reached max repeat bits */ in sw842_compress()
551 last = next; in sw842_compress()
|
| /lib/crc/x86/ |
| A D | crc32c-3way.S | 123 sub $5, %eax # 4 for 4x_loop, 1 for special last iter
|
| /lib/kunit/ |
| A D | Kconfig | 24 test suite, which allow users to see results of the last test suite
|