/freebsd-12-stable/usr.bin/ctags/ |
H A D | tree.c | 97 add_node(NODE *node, NODE *cur_node) argument 101 dif = strcoll(node->entry, cur_node->entry); 103 if (node->file == cur_node->file) { 108 if (!cur_node->been_warned) 110 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry); 111 cur_node->been_warned = YES; 114 if (cur_node->left) 115 add_node(node, cur_node->left); 117 cur_node->left = node; 118 else if (cur_node [all...] |
/freebsd-12-stable/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_deadlock_detector.h | 202 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { argument 204 uptr cur_idx = nodeToIndex(cur_node); 212 // Add cur_node to the set of locks held currently by dtls. 213 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) { argument 215 uptr cur_idx = nodeToIndex(cur_node); 220 // Returns true if all edges from the currently held locks to cur_node exist. 221 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { argument 224 if (cur_node && local_epoch == current_epoch_ && 225 local_epoch == nodeToEpoch(cur_node)) { 226 uptr cur_idx = nodeToIndexUnchecked(cur_node); 240 addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk, int unique_tid) argument 275 onLock(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) argument 288 onTryLock(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) argument 310 findPathToLock(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, uptr *path, uptr path_size) argument [all...] |
/freebsd-12-stable/contrib/binutils/binutils/ |
H A D | mcparse.y | 40 static mc_node *cur_node = NULL; 78 cur_node = mc_add_node (); 79 cur_node->user_text = $1; 179 cur_node = mc_add_node (); 180 cur_node->symbol = mc_last_symbol; 181 cur_node->facility = mc_cur_facility; 182 cur_node->severity = mc_cur_severity; 183 cur_node->id = ($1 & 0xffffUL); 184 cur_node->vid = ($1 & 0xffffUL) | mc_sefa_val; 270 h = mc_add_node_lang (cur_node, [all...] |
/freebsd-12-stable/contrib/ldns/ |
H A D | dnssec_zone.c | 931 ldns_rbnode_t *cur_node; local 950 cur_node = ldns_dnssec_zone_find_nsec3_original(zone, rr); 951 if (!cur_node) { 955 cur_node = ldns_rbtree_search(zone->names, ldns_rr_owner(rr)); 957 if (!cur_node) { 961 cur_node = LDNS_MALLOC(ldns_rbnode_t); 962 if(!cur_node) { 966 cur_node->key = ldns_rr_owner(rr); 967 cur_node->data = cur_name; 968 (void)ldns_rbtree_insert(zone->names, cur_node); 1046 ldns_rbnode_t *cur_node, *next_node, *new_node; local [all...] |
H A D | radix.c | 645 ldns_radix_node_t* cur_node, *next_node; local 652 cur_node = ldns_radix_first(tree2); 653 while (cur_node) { 656 if (cur_node->data) { 657 status = ldns_radix_insert(tree1, cur_node->key, 658 cur_node->klen, cur_node->data); 665 next_node = ldns_radix_next(cur_node); 667 (void) ldns_radix_delete(tree2, cur_node->key, 668 cur_node 685 ldns_radix_node_t* cur_node; local [all...] |
H A D | dnssec_sign.c | 796 ldns_rbnode_t *first_node, *cur_node, *next_node; local 819 cur_node = first_node; 820 if (cur_node) { 822 ldns_rbtree_next(cur_node)); 827 while (cur_node && next_node) { 828 cur_name = (ldns_dnssec_name *)cur_node->data; 839 cur_node = next_node; 840 if (cur_node) { 842 ldns_rbtree_next(cur_node)); 846 if (cur_node 1211 ldns_rbnode_t *cur_node; local [all...] |
H A D | rbtree.c | 624 ldns_rbnode_t *cur_node; local 630 cur_node = ldns_rbtree_first(tree); 631 while (count < elements && cur_node != LDNS_RBTREE_NULL) { 632 move_node = ldns_rbtree_delete(tree, cur_node->key); 634 cur_node = ldns_rbtree_first(tree);
|
/freebsd-12-stable/contrib/libgnuregex/ |
H A D | regexec.c | 62 regmatch_t *prev_idx_match, int cur_node, 1422 int idx, cur_node; 1443 cur_node = dfa->init_node; 1462 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch); 1464 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node) 1479 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch, 1492 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node, 1495 if (BE (cur_node < 0, 0)) 1497 if (BE (cur_node 1419 int idx, cur_node; local 1539 update_regs(const re_dfa_t *dfa, regmatch_t *pmatch, regmatch_t *prev_idx_match, int cur_node, int cur_idx, int nmatch) argument 1871 int cur_node = inv_eclosure->elems[ecl_idx]; local 1897 int cur_node = inv_eclosure->elems[ecl_idx]; local 3073 int cur_node = cur_nodes->elems[cur_idx]; local 3157 int cur_node = cur_nodes->elems[idx]; local 3196 int cur_node; local [all...] |
/freebsd-12-stable/sys/dev/aic7xxx/aicasm/ |
H A D | aicasm.c | 357 symbol_node_t *cur_node; local 400 for (cur_node = SLIST_FIRST(&patch_functions); 401 cur_node != NULL; 402 cur_node = SLIST_NEXT(cur_node,links)) { 413 cur_node->symbol->info.condinfo->func_num, 415 cur_node->symbol->info.condinfo->func_num, 417 cur_node->symbol->name);
|
/freebsd-12-stable/contrib/ofed/libibnetdisc/ |
H A D | ibnetdisc.c | 947 ibnd_node_t *cur_node; local 961 cur_node = fabric->from_node; 970 if (!cur_node->ports) 973 remote_port = cur_node->ports[path.p[i]]->remoteport; 978 cur_node = remote_port->node;
|