| /lib/ |
| A D | errseq.c | 64 errseq_t cur, old; in errseq_set() local
91 cur = new; in errseq_set()
96 cur = cmpxchg(eseq, old, new); in errseq_set()
102 if (likely(cur == old || cur == new)) in errseq_set()
106 old = cur; in errseq_set()
108 return cur; in errseq_set()
148 errseq_t cur = READ_ONCE(*eseq); in errseq_check() local
150 if (likely(cur == since)) in errseq_check()
152 return -(cur & ERRNO_MASK); in errseq_check()
|
| A D | interval_tree.c | 36 struct interval_tree_node *cur = state->nodes[1]; in interval_tree_span_iter_next_gap() local
38 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
40 if (cur->last > state->nodes[0]->last) in interval_tree_span_iter_next_gap()
41 state->nodes[0] = cur; in interval_tree_span_iter_next_gap()
42 cur = interval_tree_iter_next(cur, state->first_index, 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()
46 state->nodes[1] = cur; in interval_tree_span_iter_next_gap()
|
| A D | cmdline.c | 58 char *cur = *str; in get_option() local
61 if (!cur || !(*cur)) in get_option()
63 if (*cur == '-') in get_option()
64 value = -simple_strtoull(++cur, str, 0); in get_option()
66 value = simple_strtoull(cur, str, 0); in get_option()
69 if (cur == *str) in get_option()
|
| A D | ts_fsm.c | 137 struct ts_fsm_token *cur = NULL, *next; in fsm_find() local
166 cur = &fsm->tokens[tok_idx]; in fsm_find()
173 switch (cur->recur) { in fsm_find()
178 if (!match_token(cur, data[block_idx])) in fsm_find()
184 !match_token(cur, data[block_idx])) in fsm_find()
192 if (!match_token(cur, data[block_idx])) in fsm_find()
206 if (!match_token(cur, data[block_idx])) in fsm_find()
229 if (!match_token(cur, data[block_idx])) in fsm_find()
|
| A D | scatterlist.c | 365 struct scatterlist *cur, in get_next_sg() argument
372 if (cur) { in get_next_sg()
373 next_sg = sg_next(cur); in get_next_sg()
384 if (cur) { in get_next_sg()
|
| A D | rbtree_test.c | 174 struct test_node *cur, *n; in check_postorder_foreach() local
176 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
|
| A D | kobject.c | 130 int cur = strlen(kobject_name(parent)); in fill_kobj_path() local
132 length -= cur; in fill_kobj_path()
135 memcpy(path + length, kobject_name(parent), cur); in fill_kobj_path()
|
| A D | debugobjects.c | 436 unsigned long cur, now = jiffies; in calc_usage() local
445 cur = READ_ONCE(pool_global.stats.cur_used) * ODEBUG_FREE_WORK_MAX; in calc_usage()
446 WRITE_ONCE(avg_usage, calc_load(avg_usage, EXP_5, cur)); in calc_usage()
|
| /lib/tests/ |
| A D | test_list_sort.c | 62 struct list_head *cur; in list_sort_test() local
84 for (cur = head.next; cur->next != &head; cur = cur->next) { in list_sort_test()
88 KUNIT_ASSERT_PTR_EQ_MSG(test, cur->next->prev, cur, in list_sort_test()
91 cmp_result = cmp(test, cur, cur->next); in list_sort_test()
94 el = container_of(cur, struct debug_el, list); in list_sort_test()
95 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test()
104 KUNIT_EXPECT_PTR_EQ_MSG(test, head.prev, cur, "list is corrupted"); in list_sort_test()
|
| A D | list-test.c | 404 list_for_each(cur, &list2) { in list_test_list_cut_position()
411 list_for_each(cur, &list1) { in list_test_list_cut_position()
434 list_for_each(cur, &list2) { in list_test_list_cut_before()
441 list_for_each(cur, &list1) { in list_test_list_cut_before()
466 list_for_each(cur, &list1) { in list_test_list_splice()
659 list_for_each(cur, &list) { in list_test_list_for_each()
1114 cur = &entries[0]; in hlist_test_for_each_entry_continue()
1118 cur->data = 42; in hlist_test_for_each_entry_continue()
1144 cur = &entries[0]; in hlist_test_for_each_entry_from()
1148 cur->data = 42; in hlist_test_for_each_entry_from()
[all …]
|
| /lib/zstd/compress/ |
| A D | zstd_opt.c | 1121 U32 cur, last_pos = 0; in ZSTD_compressBlock_opt_generic() local
1167 cur = 0; in ZSTD_compressBlock_opt_generic()
1201 for (cur = 1; cur <= last_pos; cur++) { in ZSTD_compressBlock_opt_generic()
1216 opt[cur-1].rep[0], opt[cur-1].rep[1], opt[cur-1].rep[2]); in ZSTD_compressBlock_opt_generic()
1217 opt[cur] = opt[cur-1]; in ZSTD_compressBlock_opt_generic()
1243 if (last_pos < cur+1) last_pos = cur+1; in ZSTD_compressBlock_opt_generic()
1256 assert(cur >= opt[cur].mlen); in ZSTD_compressBlock_opt_generic()
1259 U32 const prev = cur - opt[cur].mlen; in ZSTD_compressBlock_opt_generic()
1270 && (opt[cur+1].price <= opt[cur].price + (BITCOST_MULTIPLIER/2)) ) { in ZSTD_compressBlock_opt_generic()
1361 Repcodes_t const reps = ZSTD_newRep(opt[cur].rep, lastStretch.off, opt[cur].litlen==0); in ZSTD_compressBlock_opt_generic()
[all …]
|
| A D | zstd_ldm.c | 410 ldmEntry_t const* cur; in ZSTD_ldm_generateSequences_internal() local
425 for (cur = bucket; cur < bucket + entsPerBucket; cur++) { in ZSTD_ldm_generateSequences_internal()
428 if (cur->checksum != checksum || cur->offset <= lowestIndex) { in ZSTD_ldm_generateSequences_internal()
433 cur->offset < dictLimit ? dictBase : base; in ZSTD_ldm_generateSequences_internal()
434 BYTE const* const pMatch = curMatchBase + cur->offset; in ZSTD_ldm_generateSequences_internal()
436 cur->offset < dictLimit ? dictEnd : iend; in ZSTD_ldm_generateSequences_internal()
438 cur->offset < dictLimit ? dictStart : lowPrefixPtr; in ZSTD_ldm_generateSequences_internal()
447 BYTE const* const pMatch = base + cur->offset; in ZSTD_ldm_generateSequences_internal()
461 bestEntry = cur; in ZSTD_ldm_generateSequences_internal()
|