Searched refs:cur_node (Results 1 - 8 of 8) sorted by relevance
/freebsd-10.1-release/usr.bin/ctags/ |
H A D | tree.c | 95 add_node(NODE *node, NODE *cur_node) argument 99 dif = strcoll(node->entry, cur_node->entry); 101 if (node->file == cur_node->file) { 106 if (!cur_node->been_warned) 108 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry); 109 cur_node->been_warned = YES; 112 if (cur_node->left) 113 add_node(node, cur_node->left); 115 cur_node->left = node; 116 else if (cur_node [all...] |
/freebsd-10.1-release/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-10.1-release/contrib/ldns/ |
H A D | 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); 998 ldns_rbnode_t *cur_node, *next_node, *new_node; local [all...] |
H A D | dnssec_sign.c | 704 ldns_rbnode_t *first_node, *cur_node, *next_node; local 727 cur_node = first_node; 728 if (cur_node) { 730 ldns_rbtree_next(cur_node)); 735 while (cur_node && next_node) { 736 cur_name = (ldns_dnssec_name *)cur_node->data; 747 cur_node = next_node; 748 if (cur_node) { 750 ldns_rbtree_next(cur_node)); 754 if (cur_node 1068 ldns_rbnode_t *cur_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 | 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-10.1-release/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-10.1-release/sys/dev/aic7xxx/aicasm/ |
H A D | aicasm.c | 355 symbol_node_t *cur_node; local 398 for (cur_node = SLIST_FIRST(&patch_functions); 399 cur_node != NULL; 400 cur_node = SLIST_NEXT(cur_node,links)) { 411 cur_node->symbol->info.condinfo->func_num, 413 cur_node->symbol->info.condinfo->func_num, 415 cur_node->symbol->name);
|
Completed in 226 milliseconds