Searched refs:cur (Results 1 – 8 of 8) sorted by relevance
/lib/zstd/ |
D | zstd_opt.h | 440 U32 cur, match_num, last_pos, litlen, price; in ZSTD_compressBlock_opt_generic() local 457 cur = 0; in ZSTD_compressBlock_opt_generic() 482 cur = 0; in ZSTD_compressBlock_opt_generic() 515 for (cur = 1; cur <= last_pos; cur++) { in ZSTD_compressBlock_opt_generic() 516 inr = ip + cur; in ZSTD_compressBlock_opt_generic() 518 if (opt[cur - 1].mlen == 1) { in ZSTD_compressBlock_opt_generic() 519 litlen = opt[cur - 1].litlen + 1; in ZSTD_compressBlock_opt_generic() 520 if (cur > litlen) { in ZSTD_compressBlock_opt_generic() 521 price = opt[cur - litlen].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - litlen); in ZSTD_compressBlock_opt_generic() 526 price = opt[cur - 1].price + ZSTD_getLiteralPrice(seqStorePtr, litlen, inr - 1); in ZSTD_compressBlock_opt_generic() [all …]
|
/lib/ |
D | errseq.c | 60 errseq_t cur, old; in errseq_set() local 89 cur = new; in errseq_set() 94 cur = cmpxchg(eseq, old, new); in errseq_set() 100 if (likely(cur == old || cur == new)) in errseq_set() 104 old = cur; in errseq_set() 106 return cur; in errseq_set() 146 errseq_t cur = READ_ONCE(*eseq); in errseq_check() local 148 if (likely(cur == since)) in errseq_check() 150 return -(cur & MAX_ERRNO); in errseq_check()
|
D | test_list_sort.c | 74 struct list_head *cur; in list_sort_test() local 100 for (cur = head.next; cur->next != &head; cur = cur->next) { in list_sort_test() 104 if (cur->next->prev != cur) { in list_sort_test() 109 cmp_result = cmp(NULL, cur, cur->next); in list_sort_test() 115 el = container_of(cur, struct debug_el, list); in list_sort_test() 116 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test() 129 if (head.prev != cur) { in list_sort_test()
|
D | cmdline.c | 52 char *cur = *str; in get_option() local 54 if (!cur || !(*cur)) in get_option() 56 *pint = simple_strtol(cur, str, 0); in get_option() 57 if (cur == *str) in get_option()
|
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()
|
D | vsprintf.c | 1182 int cur, rbot, rtop; in bitmap_list_string() local 1188 rbot = cur = find_first_bit(bitmap, nr_bits); in bitmap_list_string() 1189 while (cur < nr_bits) { in bitmap_list_string() 1190 rtop = cur; in bitmap_list_string() 1191 cur = find_next_bit(bitmap, nr_bits, cur + 1); in bitmap_list_string() 1192 if (cur < nr_bits && cur <= rtop + 1) in bitmap_list_string() 1211 rbot = cur; in bitmap_list_string()
|
D | rbtree_test.c | 173 struct test_node *cur, *n; in check_postorder_foreach() local 175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
|
D | kobject.c | 153 int cur = strlen(kobject_name(parent)); in fill_kobj_path() local 155 length -= cur; in fill_kobj_path() 156 memcpy(path + length, kobject_name(parent), cur); in fill_kobj_path()
|