Searched refs:nodes (Results 1 – 7 of 7) sorted by relevance
/art/tools/ahat/src/main/com/android/ahat/dominators/ |
D | Dominators.java | 224 public NodeS[] nodes = new NodeS[4]; field in Dominators.NodeSet 227 if (size == nodes.length) { in add() 228 nodes = Arrays.copyOf(nodes, size * 2); in add() 230 nodes[size++] = nodeS; in add() 235 if (nodes[i] == nodeS) { in remove() 243 nodes[index] = nodes[--size]; in remove() 244 nodes[size] = null; in remove() 389 NodeSet nodes = oldDomS.revisit; in computeDominators() local 406 NodeS xS = oldDomS.dominated.nodes[i]; in computeDominators() 407 for (int j = 0; j < nodes.size; ++j) { in computeDominators() [all …]
|
/art/compiler/optimizing/ |
D | scheduler.h | 441 virtual SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes, 445 static void DeleteNodeAtIndex(ScopedArenaVector<SchedulingNode*>* nodes, size_t index) { in DeleteNodeAtIndex() argument 446 (*nodes)[index] = nodes->back(); in DeleteNodeAtIndex() 447 nodes->pop_back(); in DeleteNodeAtIndex() 461 SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes, in PopHighestPriorityNode() argument 464 DCHECK(!nodes->empty()); in PopHighestPriorityNode() 465 size_t select = rand_r(&seed_) % nodes->size(); in PopHighestPriorityNode() 466 SchedulingNode* select_node = (*nodes)[select]; in PopHighestPriorityNode() 467 DeleteNodeAtIndex(nodes, select); in PopHighestPriorityNode() 483 SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes, [all …]
|
D | register_allocator_graph_color.h | 145 void ColorSpillSlots(ArrayRef<LiveInterval* const> nodes, /* out */ size_t* num_stack_slots_used); 148 void AllocateSpillSlots(ArrayRef<InterferenceNode* const> nodes);
|
D | scheduler.cc | 479 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) const { in SelectMaterializedCondition() argument 508 ContainsElement(*nodes, condition_node)) { in SelectMaterializedCondition() 511 RemoveElement(*nodes, condition_node); in SelectMaterializedCondition() 519 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) { in PopHighestPriorityNode() argument 520 DCHECK(!nodes->empty()); in PopHighestPriorityNode() 524 select_node = SelectMaterializedCondition(nodes, graph); in PopHighestPriorityNode() 528 select_node = (*nodes)[0]; in PopHighestPriorityNode() 530 for (size_t i = 1, e = nodes->size(); i < e; i++) { in PopHighestPriorityNode() 531 SchedulingNode* check = (*nodes)[i]; in PopHighestPriorityNode() 532 SchedulingNode* candidate = (*nodes)[select]; in PopHighestPriorityNode() [all …]
|
D | register_allocator_graph_color.cc | 1915 void RegisterAllocatorGraphColor::AllocateSpillSlots(ArrayRef<InterferenceNode* const> nodes) { in AllocateSpillSlots() argument 1929 for (InterferenceNode* node : nodes) { in AllocateSpillSlots()
|
/art/test/913-heaps/src/art/ |
D | Test913.java | 570 HashMap<String, Node> nodes = new HashMap<>(); field in Test913.Verifier 576 if (!nodes.containsKey(referrer)) { in add() 577 nodes.put(referrer, new Node(referrer)); in add() 580 nodes.get(referrer).referrees.add(referree); in add()
|
/art/compiler/ |
D | Android.bp | 74 "optimizing/nodes.cc", 186 "optimizing/nodes.h",
|