Searched refs:NodeIdx (Results 1 – 7 of 7) sorted by relevance
| /netbsd-src/external/gpl3/binutils.old/dist/gprofng/src/ |
| H A D | PathTree.h | 85 typedef long NodeIdx; typedef
98 NodeIdx ancestor;
99 Vector<NodeIdx> *descendants;
101 NodeIdx funclist;
107 NODE_IDX (NodeIdx idx) in NODE_IDX()
118 NodeIdx
121 return fn_map == NULL ? (NodeIdx) 0 : fn_map->get (func); in get_func_nodeidx()
130 Vector<void*>* get_ftree_node_children (BaseMetric *bm, NodeIdx node_idx);
143 NodeIdx nd;
174 Map<Function*, NodeIdx> *fn_map;
[all …]
|
| H A D | PathTree.cc | 102 fn_map = new DefaultMap<Function*, NodeIdx>; in init()
109 pathMap = new CacheMap<uint64_t, NodeIdx>; in init()
315 PathTree::NodeIdx
316 PathTree::new_Node (NodeIdx anc, Histable *instr, bool leaf) in new_Node()
349 NodeIdx node_idx = nodes++; in new_Node()
352 node->descendants = leaf ? (Vector<NodeIdx>*)NULL : new Vector<NodeIdx>(2); in new_Node()
360 PathTree::NodeIdx
369 NodeIdx dsc_idx = find_in_desc_htable (root_idx, cur_obj, true); in find_path()
377 NodeIdx node_idx; in find_path()
413 NodeIdx dsc_idx = find_desc_node (node_idx, cur_addr, leaf); in find_path()
[all …]
|
| H A D | Dbe.cc | 5834 PathTree::NodeIdx nodeIdx = node_idxs->get (ii); // upcasted from int in dbeGetCallTreeChildren()
|
| /netbsd-src/external/gpl3/binutils/dist/gprofng/src/ |
| H A D | PathTree.h | 85 typedef long NodeIdx; typedef
98 NodeIdx ancestor;
99 Vector<NodeIdx> *descendants;
101 NodeIdx funclist;
107 NODE_IDX (NodeIdx idx) in NODE_IDX()
118 NodeIdx
121 return fn_map == NULL ? (NodeIdx) 0 : fn_map->get (func); in get_func_nodeidx()
130 Vector<void*>* get_ftree_node_children (BaseMetric *bm, NodeIdx node_idx);
143 NodeIdx nd;
174 Map<Function*, NodeIdx> *fn_map;
[all …]
|
| H A D | PathTree.cc | 102 fn_map = new DefaultMap<Function*, NodeIdx>; in init()
109 pathMap = new CacheMap<uint64_t, NodeIdx>; in init()
315 PathTree::NodeIdx
316 PathTree::new_Node (NodeIdx anc, Histable *instr, bool leaf) in new_Node()
349 NodeIdx node_idx = nodes++; in new_Node()
352 node->descendants = leaf ? (Vector<NodeIdx>*)NULL : new Vector<NodeIdx>(2); in new_Node()
360 PathTree::NodeIdx
369 NodeIdx dsc_idx = find_in_desc_htable (root_idx, cur_obj, true); in find_path()
377 NodeIdx node_idx; in find_path()
413 NodeIdx dsc_idx = find_desc_node (node_idx, cur_addr, leaf); in find_path()
[all …]
|
| H A D | Dbe.cc | 5834 PathTree::NodeIdx nodeIdx = node_idxs->get (ii); // upcasted from int in dbeGetCallTreeChildren()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | SparseMultiSet.h | 423 unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID); in insert() local
427 Sparse[Idx] = NodeIdx; in insert()
428 Dense[NodeIdx].Prev = NodeIdx; in insert()
429 return iterator(this, NodeIdx, Idx); in insert()
435 Dense[TailIdx].Next = NodeIdx; in insert()
436 Dense[HeadIdx].Prev = NodeIdx; in insert()
437 Dense[NodeIdx].Prev = TailIdx; in insert()
439 return iterator(this, NodeIdx, Idx); in insert()
|