Home
last modified time | relevance | path

Searched refs:curr (Results 1 – 25 of 109) sorted by relevance

12345

/dragonfly/crypto/libressl/crypto/x509/
H A Dpcy_tree.c106 if (!curr) in tree_print()
109 curr++; in tree_print()
434 nodes = curr->nodes; in tree_prune()
448 --curr; in tree_prune()
449 nodes = curr->nodes; in tree_prune()
458 if (curr->anyPolicy && !curr->anyPolicy->nchild) { in tree_prune()
520 curr = tree->levels; in tree_calculate_authority_set()
527 curr++; in tree_calculate_authority_set()
644 for (i = 0, curr = tree->levels; i < tree->nlevel; i++, curr++) { in X509_policy_tree_free()
646 if (curr->nodes) in X509_policy_tree_free()
[all …]
/dragonfly/bin/cp/
H A Dcp.c262 FTSENT *curr; in copy() local
278 switch (curr->fts_info) { in copy()
283 curr->fts_path, strerror(curr->fts_errno)); in copy()
331 p = &curr->fts_path[base]; in copy()
355 if (!curr->fts_number) in copy()
411 if (copy_file(curr, dne)) in copy()
421 curr->fts_path); in copy()
455 if (copy_file(curr, dne)) in copy()
461 curr->fts_path); in copy()
468 if (copy_file(curr, dne)) in copy()
[all …]
/dragonfly/crypto/libressl/ssl/
H A Dssl_ciph.c612 curr->prev->next = curr->next; in ll_append_tail()
614 curr->next->prev = curr->prev; in ll_append_tail()
630 curr->next->prev = curr->prev; in ll_append_head()
632 curr->prev->next = curr->next; in ll_append_head()
822 next = reverse ? curr->prev : curr->next; in ssl_cipher_apply_rule()
879 curr->prev->next = curr->next; in ssl_cipher_apply_rule()
884 curr->next->prev = curr->prev; in ssl_cipher_apply_rule()
886 curr->prev->next = curr->next; in ssl_cipher_apply_rule()
913 curr = curr->next; in ssl_cipher_strength_sort()
929 curr = curr->next; in ssl_cipher_strength_sort()
[all …]
H A Dpqueue.c107 pitem *curr, *next; in pqueue_insert() local
114 for (curr = NULL, next = pq->items; next != NULL; in pqueue_insert()
115 curr = next, next = next->next) { in pqueue_insert()
123 if (curr == NULL) in pqueue_insert()
126 curr->next = item; in pqueue_insert()
134 curr->next = item; in pqueue_insert()
/dragonfly/games/backgammon/common_source/
H A Dfancy.c404 realr = curr; in curmove()
407 curr = r; in curmove()
430 curr = realr; in newpos()
449 if (r >= curr) { in newpos()
467 if (r < curr) { in newpos()
571 curr = r; in newpos()
615 curmove(curr, sp); in fancyc()
635 linect[curr]--; in fancyc()
656 curmove(i = curr, 0); in clend()
682 linect[curr]--; in cline()
[all …]
/dragonfly/contrib/grep/src/
H A Dkwset.c439 for (curr = last = kwset->trie; curr; curr = curr->next) in kwsprep()
447 curr = curr->next; in kwsprep()
465 for (curr = last = kwset->trie; curr; curr = curr->next) in kwsprep()
471 treedelta (curr->links, curr->depth, delta); in kwsprep()
506 for (curr = kwset->trie->next; curr; curr = curr->next) in kwsprep()
508 if (curr->maxshift > curr->parent->maxshift) in kwsprep()
509 curr->maxshift = curr->parent->maxshift; in kwsprep()
510 if (curr->shift > curr->maxshift) in kwsprep()
511 curr->shift = curr->maxshift; in kwsprep()
556 curr = curr->next; in kwsprep()
[all …]
/dragonfly/contrib/gdb-7/gdb/
H A Dregistry.c30 struct registry_data_registration **curr; in register_data_with_cleanup() local
33 for (curr = &registry->registrations; in register_data_with_cleanup()
34 *curr != NULL; in register_data_with_cleanup()
35 curr = &(*curr)->next) in register_data_with_cleanup()
38 *curr = XMALLOC (struct registry_data_registration); in register_data_with_cleanup()
39 (*curr)->next = NULL; in register_data_with_cleanup()
40 (*curr)->data = XMALLOC (struct registry_data); in register_data_with_cleanup()
41 (*curr)->data->index = registry->num_registrations++; in register_data_with_cleanup()
42 (*curr)->data->save = save; in register_data_with_cleanup()
43 (*curr)->data->free = free; in register_data_with_cleanup()
[all …]
/dragonfly/stand/lib/
H A Denvironment.c71 struct env_var *ev, *curr, *last; in env_setenv() local
96 for (last = NULL, curr = environ; in env_setenv()
97 curr != NULL; in env_setenv()
98 last = curr, curr = curr->ev_next) { in env_setenv()
100 if (strcmp(ev->ev_name, curr->ev_name) < 0) { in env_setenv()
101 if (curr->ev_prev) { in env_setenv()
102 curr->ev_prev->ev_next = ev; in env_setenv()
106 ev->ev_next = curr; in env_setenv()
107 ev->ev_prev = curr->ev_prev; in env_setenv()
108 curr->ev_prev = ev; in env_setenv()
[all …]
/dragonfly/sys/vfs/hammer2/zlib/
H A Dhammer2_zlib_inftrees.c42 unsigned curr; /* number of index bits for current table */ in inflate_table() local
202 curr = root; /* current table index bits */ in inflate_table()
232 fill = 1U << curr; in inflate_table()
267 curr = len - drop; in inflate_table()
268 left = (int)(1 << curr); in inflate_table()
269 while (curr + drop < max) { in inflate_table()
270 left -= count[curr + drop]; in inflate_table()
272 curr++; in inflate_table()
277 used += 1U << curr; in inflate_table()
284 (*table)[low].op = (unsigned char)curr; in inflate_table()
/dragonfly/contrib/zlib-1.2/
H A Dinftrees.c44 unsigned curr; /* number of index bits for current table */ local
202 curr = root; /* current table index bits */
232 fill = 1U << curr;
267 curr = len - drop;
268 left = (int)(1 << curr);
269 while (curr + drop < max) {
270 left -= count[curr + drop];
272 curr++;
277 used += 1U << curr;
284 (*table)[low].op = (unsigned char)curr;
/dragonfly/usr.sbin/makefs/hammer2/zlib/
H A Dhammer2_zlib_inftrees.c42 unsigned curr; /* number of index bits for current table */ in inflate_table() local
202 curr = root; /* current table index bits */ in inflate_table()
232 fill = 1U << curr; in inflate_table()
267 curr = len - drop; in inflate_table()
268 left = (int)(1 << curr); in inflate_table()
269 while (curr + drop < max) { in inflate_table()
270 left -= count[curr + drop]; in inflate_table()
272 curr++; in inflate_table()
277 used += 1U << curr; in inflate_table()
284 (*table)[low].op = (unsigned char)curr; in inflate_table()
/dragonfly/sbin/hammer2/zlib/
H A Dhammer2_zlib_inftrees.c42 unsigned curr; /* number of index bits for current table */ in inflate_table() local
202 curr = root; /* current table index bits */ in inflate_table()
232 fill = 1U << curr; in inflate_table()
267 curr = len - drop; in inflate_table()
268 left = (int)(1 << curr); in inflate_table()
269 while (curr + drop < max) { in inflate_table()
270 left -= count[curr + drop]; in inflate_table()
272 curr++; in inflate_table()
277 used += 1U << curr; in inflate_table()
284 (*table)[low].op = (unsigned char)curr; in inflate_table()
/dragonfly/contrib/zstd/lib/compress/
H A Dzstd_lazy.c77 const BYTE* const ip = (curr>=dictLimit) ? base + curr : dictBase + curr; in ZSTD_insertDUBT1()
88 U32 const windowLow = (curr - windowValid > maxDistance) ? curr - maxDistance : windowValid; in ZSTD_insertDUBT1()
93 assert(curr >= btLow); in ZSTD_insertDUBT1()
99 assert(matchIndex < curr); in ZSTD_insertDUBT1()
250 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_DUBT_findBestMatch()
612 const U32 curr = (U32)(ip-base); in ZSTD_HcFindBestMatch_generic() local
615 …const U32 withinMaxDistance = (curr - lowestValid > maxDistance) ? curr - maxDistance : lowestVali… in ZSTD_HcFindBestMatch_generic()
618 const U32 minChain = curr > chainSize ? curr - chainSize : 0; in ZSTD_HcFindBestMatch_generic()
1245 U32 curr = (U32)(ip-base); in ZSTD_compressBlock_lazy_extDict_generic() local
1276 curr++; in ZSTD_compressBlock_lazy_extDict_generic()
[all …]
H A Dzstd_fast.c32 U32 const curr = (U32)(ip - base); in ZSTD_fillHashTable() local
34 hashTable[hash0] = curr; in ZSTD_fillHashTable()
41 hashTable[hash] = curr + p; in ZSTD_fillHashTable()
75 { U32 const curr = (U32)(ip0 - base); in ZSTD_compressBlock_fast_generic() local
77 U32 const maxRep = curr - windowLow; in ZSTD_compressBlock_fast_generic()
261 U32 const curr = (U32)(ip-base); in ZSTD_compressBlock_fast_dictMatchState_generic() local
264 const U32 repIndex = curr + 1 - offset_1; in ZSTD_compressBlock_fast_dictMatchState_generic()
320 …hashTable[ZSTD_hashPtr(base+curr+2, hlog, mls)] = curr+2; /* here because curr+2 could be > iend-… in ZSTD_compressBlock_fast_dictMatchState_generic()
413 const U32 curr = (U32)(ip-base); in ZSTD_compressBlock_fast_extDict_generic() local
414 const U32 repIndex = curr + 1 - offset_1; in ZSTD_compressBlock_fast_extDict_generic()
[all …]
H A Dzstd_double_fast.c34 U32 const curr = (U32)(ip - base); in ZSTD_fillDoubleHashTable() local
40 hashSmall[smHash] = curr + i; in ZSTD_fillDoubleHashTable()
42 hashLarge[lgHash] = curr + i; in ZSTD_fillDoubleHashTable()
111 U32 const curr = (U32)(ip - base); in ZSTD_compressBlock_doubleFast_generic() local
113 U32 const maxRep = curr - windowLow; in ZSTD_compressBlock_doubleFast_generic()
132 U32 const curr = (U32)(ip-base); in ZSTD_compressBlock_doubleFast_generic() local
137 const U32 repIndex = curr + 1 - offset_1; in ZSTD_compressBlock_doubleFast_generic()
212 hashLong[hl3] = curr + 1; in ZSTD_compressBlock_doubleFast_generic()
239 offset = (U32)(curr - matchIndexS); in ZSTD_compressBlock_doubleFast_generic()
404 const U32 curr = (U32)(ip-base); in ZSTD_compressBlock_doubleFast_extDict_generic() local
[all …]
H A Dzstd_opt.c389 const U32 curr = (U32)(ip-base); in ZSTD_insertBt1() local
390 const U32 btLow = btMask >= curr ? 0 : curr - btMask; in ZSTD_insertBt1()
395 U32 matchEndIdx = curr+8+1; in ZSTD_insertBt1()
414 assert(matchIndex < curr); in ZSTD_insertBt1()
522 U32 const curr = (U32)(ip-base); in ZSTD_insertBtAndGetAllMatches() local
536 U32 const btLow = (btMask >= curr) ? 0 : curr - btMask; in ZSTD_insertBtAndGetAllMatches()
570 assert(curr >= dictLimit); in ZSTD_insertBtAndGetAllMatches()
646 assert(curr > matchIndex); in ZSTD_insertBtAndGetAllMatches()
663 (U32)matchLength, curr - matchIndex, curr - matchIndex + ZSTD_REP_MOVE); in ZSTD_insertBtAndGetAllMatches()
711 (U32)matchLength, curr - matchIndex, curr - matchIndex + ZSTD_REP_MOVE); in ZSTD_insertBtAndGetAllMatches()
[all …]
/dragonfly/sys/tools/
H A Dfw_stub.awk108 split(ARGV[i], curr, ":");
109 filenames[num_files] = curr[1];
110 if (length(curr[2]) > 0)
111 shortnames[num_files] = curr[2];
113 shortnames[num_files] = curr[1];
114 if (length(curr[3]) > 0)
115 versions[num_files] = int(curr[3]);
/dragonfly/games/backgammon/teachgammon/
H A Dtutor.c63 if (tflag && curr == 23) in tutor()
72 if ((!tflag) || curr == 19) { in tutor()
76 curmove(curr > 19 ? curr - 2 : curr + 4, 25); in tutor()
132 r = curr; in clrest()
/dragonfly/sbin/fsck/
H A Dmemzone.c53 if ((chunk = zone->curr) != NULL) { in mzalloc()
57 zone->curr = NULL; in mzalloc()
73 zone->curr = chunk; in mzalloc()
91 if ((chunk = zone->curr) != NULL) { in mzpurge()
94 zone->curr = NULL; in mzpurge()
/dragonfly/contrib/mpfr/src/
H A Dvasprintf.c526 b->curr = b->start; in buffer_init()
545 b->curr = b->start + pos; in buffer_widen()
563 b->curr += len; in buffer_cat()
580 *b->curr = c; in buffer_pad()
582 memset (b->curr, c, n); in buffer_pad()
583 b->curr += n; in buffer_pad()
584 *b->curr = '\0'; in buffer_pad()
617 b->curr += r; in buffer_sandwich()
624 *b->curr++ = c; in buffer_sandwich()
645 b->curr += step; in buffer_sandwich()
[all …]
/dragonfly/contrib/binutils-2.34/gold/
H A Dstringpool.cc415 curr = v.begin(); in set_string_offsets() local
416 curr != v.end(); in set_string_offsets()
417 last = curr++) in set_string_offsets()
420 if (this->zero_null_ && (*curr)->first.string[0] == 0) in set_string_offsets()
423 && ((((*curr)->first.length - (*last)->first.length) in set_string_offsets()
425 && is_suffix((*curr)->first.string, in set_string_offsets()
426 (*curr)->first.length, in set_string_offsets()
430 + (((*last)->first.length - (*curr)->first.length) in set_string_offsets()
435 offset = this_offset + ((*curr)->first.length + 1) * charsize; in set_string_offsets()
437 this->key_to_offset_[(*curr)->second - 1] = this_offset; in set_string_offsets()
/dragonfly/contrib/binutils-2.27/gold/
H A Dstringpool.cc415 curr = v.begin(); in set_string_offsets() local
416 curr != v.end(); in set_string_offsets()
417 last = curr++) in set_string_offsets()
420 if (this->zero_null_ && (*curr)->first.string[0] == 0) in set_string_offsets()
423 && ((((*curr)->first.length - (*last)->first.length) in set_string_offsets()
425 && is_suffix((*curr)->first.string, in set_string_offsets()
426 (*curr)->first.length, in set_string_offsets()
430 + (((*last)->first.length - (*curr)->first.length) in set_string_offsets()
435 offset = this_offset + ((*curr)->first.length + 1) * charsize; in set_string_offsets()
437 this->key_to_offset_[(*curr)->second - 1] = this_offset; in set_string_offsets()
/dragonfly/usr.bin/top/
H A Dhash.c528 pos->curr = 0; in hash_first_uint()
535 if (++pos->curr >= pos->num_buckets) in hash_first_uint()
565 if (pos->curr >= pos->num_buckets) in hash_next_uint()
866 pos->curr = 0; in hash_first_pid()
903 if (pos->curr >= pos->num_buckets) in hash_next_pid()
1204 pos->curr = 0; in hash_first_string()
1241 if (pos->curr >= pos->num_buckets) in hash_next_string()
1542 pos->curr = 0; in hash_first_pidthr()
1579 if (pos->curr >= pos->num_buckets) in hash_next_pidthr()
1881 pos->curr = 0; in hash_first_lwpid()
[all …]
/dragonfly/sys/dev/drm/
H A Dlinux_wait.c52 wait_queue_entry_t *curr, *next; in __wake_up_core() local
55 list_for_each_entry_safe(curr, next, &q->head, entry) { in __wake_up_core()
56 if (curr->func(curr, mode, 0, NULL)) in __wake_up_core()
/dragonfly/contrib/ee/
H A Dnew_curse.c3275 struct _line *curr; in doupdate() local
3317 …for (from_top = 0, curr = curscr->first_line; from_top < curscr->Num_lines; from_top++, curr = cur… in doupdate()
3322 Char_out(curr->row[j], curr->attributes[j], curr->row, curr->attributes, j); in doupdate()
3347 curr = curr->next_screen; in doupdate()
3353 curr = top_of_win; in doupdate()
3436 curr = curr->next_screen; in doupdate()
3501 curr = curr->next_screen; in doupdate()
3517 curr = curr->next_screen; in doupdate()
3529 curr = curr->next_screen; in doupdate()
3530 top_of_win = curr; in doupdate()
[all …]

12345