Home
last modified time | relevance | path

Searched refs:cur_node (Results 1 – 8 of 8) sorted by relevance

/freebsd-14.2/usr.bin/ctags/
H A Dtree.c95 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()
109 cur_node->been_warned = true; 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()
117 add_node(node, cur_node->right); in add_node()
[all …]
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_deadlock_detector.h204 uptr cur_idx = nodeToIndex(cur_node); in onLockBefore()
215 uptr cur_idx = nodeToIndex(cur_node);
224 if (cur_node && local_epoch == current_epoch_ && in hasAllEdges()
225 local_epoch == nodeToEpoch(cur_node)) { in hasAllEdges()
243 uptr cur_idx = nodeToIndex(cur_node); in addEdges()
277 bool is_reachable = !isHeld(dtls, cur_node) && onLockBefore(dtls, cur_node);
278 addEdges(dtls, cur_node, stk, 0);
279 onLockAfter(dtls, cur_node, stk);
290 uptr cur_idx = nodeToIndex(cur_node);
313 uptr idx = nodeToIndex(cur_node); in findPathToLock()
[all …]
/freebsd-14.2/contrib/ldns/
H A Dradix.c652 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()
658 cur_node->klen, cur_node->data); in ldns_radix_join()
668 cur_node->klen); in ldns_radix_join()
670 cur_node = next_node; in ldns_radix_join()
685 ldns_radix_node_t* cur_node; in ldns_radix_split() local
699 cur_node = ldns_radix_first(tree1); in ldns_radix_split()
700 while (count < num && cur_node) { in ldns_radix_split()
701 if (cur_node->data) { in ldns_radix_split()
[all …]
H A Ddnssec_sign.c818 cur_node = first_node;
819 if (cur_node) {
821 ldns_rbtree_next(cur_node));
826 while (cur_node && next_node) {
838 cur_node = next_node;
839 if (cur_node) {
845 if (cur_node && !next_node) {
1226 ldns_rbnode_t *cur_node; local
1248 cur_node = ldns_rbtree_first(zone->names);
1249 while (cur_node != LDNS_RBTREE_NULL) {
[all …]
H A Ddnssec_zone.c1007 ldns_rbnode_t *cur_node; local
1027 if (!cur_node) {
1033 if (!cur_node) {
1037 cur_node = LDNS_MALLOC(ldns_rbnode_t);
1038 if(!cur_node) {
1042 cur_node->key = ldns_rr_owner(rr);
1043 cur_node->data = cur_name;
1138 while (cur_node != LDNS_RBTREE_NULL) {
1139 next_node = ldns_rbtree_next(cur_node);
1246 cur_node = next_node;
[all …]
H A Drbtree.c624 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()
/freebsd-14.2/sys/dev/aic7xxx/aicasm/
H A Daicasm.c355 symbol_node_t *cur_node; in output_code() local
397 for (cur_node = SLIST_FIRST(&patch_functions); in output_code()
398 cur_node != NULL; in output_code()
399 cur_node = SLIST_NEXT(cur_node,links)) { in output_code()
410 cur_node->symbol->info.condinfo->func_num, in output_code()
412 cur_node->symbol->info.condinfo->func_num, in output_code()
414 cur_node->symbol->name); in output_code()
/freebsd-14.2/contrib/ofed/libibnetdisc/
H A Dibnetdisc.c947 ibnd_node_t *cur_node; in ibnd_find_port_dr() local
961 cur_node = fabric->from_node; in ibnd_find_port_dr()
970 if (!cur_node->ports) in ibnd_find_port_dr()
973 remote_port = cur_node->ports[path.p[i]]->remoteport; in ibnd_find_port_dr()
978 cur_node = remote_port->node; in ibnd_find_port_dr()