Lines Matching defs:alloc_worklist
106 GrowableArray<Node*> alloc_worklist;
204 // scalar replaceable allocations on alloc_worklist for processing
213 alloc_worklist.append(ptn->ideal_node());
247 bool has_scalar_replaceable_candidates = (alloc_worklist.length() > 0);
250 int alloc_length = alloc_worklist.length();
252 Node* n = alloc_worklist.at(next);
264 split_unique_types(alloc_worklist);
2616 // We start with allocations (and calls which may be allocations) on alloc_worklist.
2619 // Phase 1: Process possible allocations from alloc_worklist. Create instance
2622 // casts and Phi: push users on alloc_worklist
2624 // push any AddP users on alloc_worklist and push any memnode
2700 void ConnectionGraph::split_unique_types(GrowableArray<Node *> &alloc_worklist) {
2710 // Phase 1: Process possible allocations from alloc_worklist.
2714 // the alloc_worklist if the order of the worklist processing is changed,
2717 while (alloc_worklist.length() != 0) {
2718 Node *n = alloc_worklist.pop();
2805 alloc_worklist.append_if_missing(addp2);
2807 alloc_worklist.append_if_missing(use);
2813 // on alloc_worklist.
2822 alloc_worklist.append_if_missing(addp2);
2824 alloc_worklist.append_if_missing(use);
2908 alloc_worklist.append_if_missing(addp2);
2910 alloc_worklist.append_if_missing(use);
2916 alloc_worklist.append_if_missing(use);