Searched refs:node_idx (Results 1 – 9 of 9) sorted by relevance
| /netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/ |
| H A D | PathTree.cc | 349 NodeIdx node_idx = nodes++; in new_Node() local 350 Node *node = NODE_IDX (node_idx); in new_Node() 356 fn_map->put (func, node_idx); in new_Node() 357 return node_idx; in new_Node() 377 NodeIdx node_idx; in find_path() local 381 node_idx = pathMap->get ((uint64_t) stackId); in find_path() 382 if (node_idx != 0) in find_path() 383 return node_idx; in find_path() 390 node_idx = root_idx; in find_path() 413 NodeIdx dsc_idx = find_desc_node (node_idx, cur_addr, leaf); in find_path() [all …]
|
| H A D | PathTree.h | 130 Vector<void*>* get_ftree_node_children (BaseMetric *bm, NodeIdx node_idx); 392 void depth_map_build (NodeIdx node_idx, int depth); 395 Vector<void*>* get_node_children (BaseMetric *bm, NodeIdx node_idx);
|
| /netbsd-src/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | PathTree.cc | 349 NodeIdx node_idx = nodes++; in new_Node() local 350 Node *node = NODE_IDX (node_idx); in new_Node() 356 fn_map->put (func, node_idx); in new_Node() 357 return node_idx; in new_Node() 377 NodeIdx node_idx; in find_path() local 381 node_idx = pathMap->get ((uint64_t) stackId); in find_path() 382 if (node_idx != 0) in find_path() 383 return node_idx; in find_path() 390 node_idx = root_idx; in find_path() 413 NodeIdx dsc_idx = find_desc_node (node_idx, cur_addr, leaf); in find_path() [all …]
|
| H A D | PathTree.h | 130 Vector<void*>* get_ftree_node_children (BaseMetric *bm, NodeIdx node_idx); 392 void depth_map_build (NodeIdx node_idx, int depth); 395 Vector<void*>* get_node_children (BaseMetric *bm, NodeIdx node_idx);
|
| /netbsd-src/external/gpl2/xcvs/dist/lib/ |
| H A D | regexec.c | 83 Idx node_idx, Idx str_idx, Idx max_str_idx) internal_function; 170 static int check_node_accept_bytes (re_dfa_t *dfa, Idx node_idx, 1923 Idx node_idx; in check_dst_limits_calc_pos_1() local 1927 for (node_idx = 0; node_idx < eclosures->nelem; ++node_idx) in check_dst_limits_calc_pos_1() 1929 Idx node = eclosures->elems[node_idx]; in check_dst_limits_calc_pos_1() 2035 Idx node_idx, lim_idx; in check_subexp_limits() local 2051 for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx) in check_subexp_limits() 2053 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits() 2075 for (node_idx = 0; node_idx < dest_nodes->nelem; ++node_idx) in check_subexp_limits() 2077 Idx node = dest_nodes->elems[node_idx]; in check_subexp_limits() [all …]
|
| H A D | regcomp.c | 943 first = dfa->str_tree->first->node_idx; in create_initial_state() 956 Idx node_idx = init_nodes.elems[i]; in create_initial_state() local 957 re_token_type_t type = dfa->nodes[node_idx].type; in create_initial_state() 967 && clexp_node->opr.idx == dfa->nodes[node_idx].opr.idx) in create_initial_state() 975 Idx dest_idx = dfa->edests[node_idx].elems[0]; in create_initial_state() 1319 node->node_idx = node->left->node_idx; in calc_first() 1324 node->node_idx = re_dfa_add_node (dfa, node->token); in calc_first() 1325 if (BE (node->node_idx == REG_MISSING, 0)) in calc_first() 1359 Idx idx = node->node_idx; in link_nfa_nodes() 1377 left = node->left->first->node_idx; in link_nfa_nodes() [all …]
|
| H A D | regex_internal.h | 548 Idx node_idx; member
|
| /netbsd-src/sys/dev/usb/ |
| H A D | if_athn_usb.h | 247 uint8_t node_idx; member 262 uint8_t node_idx; member
|
| H A D | if_athn_usb.c | 2522 txf->node_idx = sta_index; in athn_usb_tx() 2540 txm->node_idx = sta_index; in athn_usb_tx()
|