Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 7 of 7) sorted by relevance

/art/compiler/optimizing/
Dscheduler.h380 virtual SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes,
384 static void DeleteNodeAtIndex(ScopedArenaVector<SchedulingNode*>* nodes, size_t index) { in DeleteNodeAtIndex() argument
385 (*nodes)[index] = nodes->back(); in DeleteNodeAtIndex()
386 nodes->pop_back(); in DeleteNodeAtIndex()
400 SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes, in PopHighestPriorityNode() argument
403 DCHECK(!nodes->empty()); in PopHighestPriorityNode()
404 size_t select = rand_r(&seed_) % nodes->size(); in PopHighestPriorityNode()
405 SchedulingNode* select_node = (*nodes)[select]; in PopHighestPriorityNode()
406 DeleteNodeAtIndex(nodes, select); in PopHighestPriorityNode()
421 SchedulingNode* PopHighestPriorityNode(ScopedArenaVector<SchedulingNode*>* nodes,
[all …]
Dregister_allocator_graph_color.h145 void ColorSpillSlots(ArrayRef<LiveInterval* const> nodes, /* out */ size_t* num_stack_slots_used);
148 void AllocateSpillSlots(ArrayRef<InterferenceNode* const> nodes);
Dscheduler.cc466 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) const { in SelectMaterializedCondition() argument
495 ContainsElement(*nodes, condition_node)) { in SelectMaterializedCondition()
498 RemoveElement(*nodes, condition_node); in SelectMaterializedCondition()
506 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) { in PopHighestPriorityNode() argument
507 DCHECK(!nodes->empty()); in PopHighestPriorityNode()
511 select_node = SelectMaterializedCondition(nodes, graph); in PopHighestPriorityNode()
515 select_node = (*nodes)[0]; in PopHighestPriorityNode()
517 for (size_t i = 1, e = nodes->size(); i < e; i++) { in PopHighestPriorityNode()
518 SchedulingNode* check = (*nodes)[i]; in PopHighestPriorityNode()
519 SchedulingNode* candidate = (*nodes)[select]; in PopHighestPriorityNode()
[all …]
Dregister_allocator_graph_color.cc1915 void RegisterAllocatorGraphColor::AllocateSpillSlots(ArrayRef<InterferenceNode* const> nodes) { in AllocateSpillSlots() argument
1929 for (InterferenceNode* node : nodes) { in AllocateSpillSlots()
/art/tools/ahat/src/main/com/android/ahat/dominators/
DDominatorsComputation.java163 List<NodeS> nodes = new ArrayList<NodeS>(); in computeDominators() local
199 nodes.add(dstS); in computeDominators()
277 for (NodeS nodeS : nodes) { in computeDominators()
/art/test/913-heaps/src/art/
DTest913.java570 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/
DAndroid.bp74 "optimizing/nodes.cc",