| /NextBSD/usr.bin/ctags/ |
| HD | tree.c | 95 add_node(NODE *node, NODE *cur_node) in add_node() argument
99 dif = strcoll(node->entry, cur_node->entry); in add_node()
101 if (node->file == cur_node->file) { in add_node()
106 if (!cur_node->been_warned) in add_node()
108 …fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->f… in add_node()
109 cur_node->been_warned = YES; in add_node()
112 if (cur_node->left) in add_node()
113 add_node(node, cur_node->left); in add_node()
115 cur_node->left = node; in add_node()
116 else if (cur_node->right) in add_node()
[all …]
|
| /NextBSD/contrib/compiler-rt/lib/sanitizer_common/ |
| HD | sanitizer_deadlock_detector.h | 206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in onLockBefore() argument
208 uptr cur_idx = nodeToIndex(cur_node); in onLockBefore()
217 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
219 uptr cur_idx = nodeToIndex(cur_node);
225 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) { in hasAllEdges() argument
228 if (cur_node && local_epoch == current_epoch_ && in hasAllEdges()
229 local_epoch == nodeToEpoch(cur_node)) { in hasAllEdges()
230 uptr cur_idx = nodeToIndexUnchecked(cur_node); in hasAllEdges()
244 uptr addEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk, in addEdges() argument
247 uptr cur_idx = nodeToIndex(cur_node); in addEdges()
[all …]
|
| /NextBSD/contrib/binutils/binutils/ |
| HD | mcparse.y | 40 static mc_node *cur_node = NULL; variable
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, $1, cur_node->vid);
|
| /NextBSD/contrib/ldns/ |
| HD | dnssec_zone.c | 884 ldns_rbnode_t *cur_node; local
903 cur_node = ldns_dnssec_zone_find_nsec3_original(zone, rr);
904 if (!cur_node) {
908 cur_node = ldns_rbtree_search(zone->names, ldns_rr_owner(rr));
910 if (!cur_node) {
914 cur_node = LDNS_MALLOC(ldns_rbnode_t);
915 if(!cur_node) {
919 cur_node->key = ldns_rr_owner(rr);
920 cur_node->data = cur_name;
921 (void)ldns_rbtree_insert(zone->names, cur_node);
[all …]
|
| HD | radix.c | 645 ldns_radix_node_t* cur_node, *next_node; in ldns_radix_join() local
652 cur_node = ldns_radix_first(tree2); in ldns_radix_join()
653 while (cur_node) { in ldns_radix_join()
656 if (cur_node->data) { in ldns_radix_join()
657 status = ldns_radix_insert(tree1, cur_node->key, in ldns_radix_join()
658 cur_node->klen, cur_node->data); in ldns_radix_join()
665 next_node = ldns_radix_next(cur_node); in ldns_radix_join()
667 (void) ldns_radix_delete(tree2, cur_node->key, in ldns_radix_join()
668 cur_node->klen); in ldns_radix_join()
670 cur_node = next_node; in ldns_radix_join()
[all …]
|
| HD | dnssec_sign.c | 704 ldns_rbnode_t *first_node, *cur_node, *next_node; in ldns_dnssec_zone_create_nsecs() local
727 cur_node = first_node; in ldns_dnssec_zone_create_nsecs()
728 if (cur_node) { in ldns_dnssec_zone_create_nsecs()
730 ldns_rbtree_next(cur_node)); in ldns_dnssec_zone_create_nsecs()
735 while (cur_node && next_node) { in ldns_dnssec_zone_create_nsecs()
736 cur_name = (ldns_dnssec_name *)cur_node->data; in ldns_dnssec_zone_create_nsecs()
747 cur_node = next_node; in ldns_dnssec_zone_create_nsecs()
748 if (cur_node) { in ldns_dnssec_zone_create_nsecs()
750 ldns_rbtree_next(cur_node)); in ldns_dnssec_zone_create_nsecs()
754 if (cur_node && !next_node) { in ldns_dnssec_zone_create_nsecs()
[all …]
|
| HD | rbtree.c | 624 ldns_rbnode_t *cur_node; in ldns_rbtree_split() local
630 cur_node = ldns_rbtree_first(tree); in ldns_rbtree_split()
631 while (count < elements && cur_node != LDNS_RBTREE_NULL) { in ldns_rbtree_split()
632 move_node = ldns_rbtree_delete(tree, cur_node->key); in ldns_rbtree_split()
634 cur_node = ldns_rbtree_first(tree); in ldns_rbtree_split()
|
| /NextBSD/contrib/libgnuregex/ |
| HD | regexec.c | 62 regmatch_t *prev_idx_match, int cur_node,
1419 int idx, cur_node; in set_regs() local
1440 cur_node = dfa->init_node; in set_regs()
1459 update_regs (dfa, pmatch, prev_idx_match, cur_node, idx, nmatch); in set_regs()
1461 if (idx == pmatch[0].rm_eo && cur_node == mctx->last_node) in set_regs()
1476 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch, in set_regs()
1489 cur_node = proceed_next_node (mctx, nmatch, pmatch, &idx, cur_node, in set_regs()
1492 if (BE (cur_node < 0, 0)) in set_regs()
1494 if (BE (cur_node == -2, 0)) in set_regs()
1503 cur_node = pop_fail_stack (fs, &idx, nmatch, pmatch, in set_regs()
[all …]
|
| /NextBSD/sys/dev/aic7xxx/aicasm/ |
| HD | aicasm.c | 355 symbol_node_t *cur_node; in output_code() local
398 for (cur_node = SLIST_FIRST(&patch_functions); in output_code()
399 cur_node != NULL; in output_code()
400 cur_node = SLIST_NEXT(cur_node,links)) { in output_code()
411 cur_node->symbol->info.condinfo->func_num, in output_code()
413 cur_node->symbol->info.condinfo->func_num, in output_code()
415 cur_node->symbol->name); in output_code()
|