Searched refs:Loop (Results 1 - 25 of 47) sorted by relevance

12

/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.common/src/org/graalvm/compiler/core/common/cfg/
H A DLoop.java29 public abstract class Loop<T extends AbstractBlockBase<T>> { class
31 private final Loop<T> parent;
32 private final List<Loop<T>> children;
40 protected Loop(Loop<T> parent, int index, T header) { method in class:Loop
62 public Loop<T> getParent() {
66 public List<Loop<T>> getChildren() {
102 public static <T extends AbstractBlockBase<T>> boolean transitiveParentLoop(Loop<T> childLoop, Loop<T> parentLoop) {
103 Loop<
[all...]
H A DCFGVerifier.java100 for (Loop<T> loop : cfg.getLoops()) {
106 Loop<?> blockLoop = block.getLoop();
115 assert false : "Loop " + loop + " does not contain " + pred;
125 Loop<?> blockLoop = block.getLoop();
H A DAbstractBlockBase.java152 public abstract Loop<T> getLoop();
H A DAbstractControlFlowGraph.java42 Collection<Loop<T>> getLoops();
/openjdk10/hotspot/test/testlibrary/jittester/src/jdk/test/lib/jittester/loops/
H A DLoop.java28 public class Loop { class
H A DDoWhile.java38 public Loop getLoop() {
46 private final Loop loop;
55 public DoWhile(int level, Loop loop, long thisLoopIterLimit, Block header,
H A DFor.java39 public Loop getLoop() {
51 private final Loop loop;
60 public For(int level, Loop loop, long thisLoopIterLimit,
H A DWhile.java33 public Loop getLoop() {
43 private final Loop loop;
54 public While(int level, Loop loop, long thisLoopIterLimit, Block header,
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.jtt/src/org/graalvm/compiler/jtt/loop/
H A DLoop13.java33 public static class Loop { class in class:Loop13
39 public Loop(int start) { method in class:Loop13.Loop
58 Loop loop = new Loop(arg);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/cfg/
H A DHIRLoop.java25 import org.graalvm.compiler.core.common.cfg.Loop;
29 public final class HIRLoop extends Loop<Block> {
33 protected HIRLoop(Loop<Block> parent, int index, Block header) {
54 for (Loop<Block> child : this.getChildren()) {
H A DBlock.java30 import org.graalvm.compiler.core.common.cfg.Loop;
53 private Loop<Block> loop;
88 public Loop<Block> getLoop() {
92 public void setLoop(Loop<Block> loop) {
H A DControlFlowGraph.java32 import org.graalvm.compiler.core.common.cfg.Loop;
67 private List<Loop<Block>> loops;
208 Loop<Block> outermostExited = b.getDominator().getLoop();
209 Loop<Block> exitBlockLoop = b.getLoop();
414 public List<Loop<Block>> getLoops() {
595 Loop<Block> loop = new HIRLoop(block.getLoop(), loops.size(), block);
646 Loop<Block> curr = b.getLoop();
667 assert !Loop.transitiveParentLoop(succ.getLoop(), b.getLoop());
668 Loop<Block> curr = b.getLoop();
683 private static void computeLoopBlocks(Block start, Loop<Bloc
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/
H A DNestedLoopTest.java25 import org.graalvm.compiler.core.common.cfg.Loop;
149 Loop<Block> rootLoop = cfg.getLoops().get(0);
150 Loop<Block> nestedLoop = cfg.getLoops().get(1);
151 Loop<Block> innerMostLoop = cfg.getLoops().get(2);
168 private static boolean contains(Loop<Block> loop, Invoke node, ControlFlowGraph cfg) {
174 private static boolean containsDirect(Loop<Block> loop, Invoke node, ControlFlowGraph cfg) {
175 for (Loop<Block> child : loop.getChildren()) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/
H A DLoopsData.java30 import org.graalvm.compiler.core.common.cfg.Loop;
56 for (Loop<Block> loop : cfg.getLoops()) {
66 private static boolean checkLoopOrder(Iterable<Loop<Block>> loops) {
67 EconomicSet<Loop<Block>> seen = EconomicSet.create(Equivalence.IDENTITY);
68 for (Loop<Block> loop : loops) {
77 public LoopEx loop(Loop<Block> loop) {
H A DLoopFragmentWhole.java25 import org.graalvm.compiler.core.common.cfg.Loop;
68 Loop<Block> loop = loop().loop();
/openjdk10/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp58 class Loop;
559 // Loop info
560 Loop* _loop; // nearest loop
602 Loop* lp = loop();
698 Loop* loop() const { return _loop; }
699 void set_loop(Loop* lp) { _loop = lp; }
707 bool is_clonable_exit(Loop* lp);
708 Block* looping_succ(Loop* lp); // Successor inside of loop
711 for (Loop* lp = loop(); lp != NULL && lp->head() == this; lp = lp->parent())
720 // Loop
721 class Loop : public ResourceObj { class in class:ciTypeFlow
732 Loop(Block* head, Block* tail) : function in class:ciTypeFlow::Loop
[all...]
H A DciTypeFlow.cpp1844 bool ciTypeFlow::Block::is_clonable_exit(ciTypeFlow::Loop* lp) {
1864 ciTypeFlow::Block* ciTypeFlow::Block::looping_succ(ciTypeFlow::Loop* lp) {
1901 Loop* lp = loop();
2205 bool ciTypeFlow::clone_loop_heads(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) {
2228 Loop* ch;
2274 ciTypeFlow::Block* ciTypeFlow::clone_loop_head(Loop* lp, StateVector* temp_vector, JsrSet* temp_set) {
2470 // ciTypeFlow::Loop::sorted_merge
2478 ciTypeFlow::Loop* ciTypeFlow::Loop::sorted_merge(Loop* l
[all...]
/openjdk10/hotspot/test/testlibrary/jittester/src/jdk/test/lib/jittester/factories/
H A DDoWhileFactory.java34 import jdk.test.lib.jittester.loops.Loop;
41 private final Loop loop;
53 loop = new Loop();
69 // Loop header parameters
73 // Loop body parameters
H A DWhileFactory.java33 import jdk.test.lib.jittester.loops.Loop;
41 private final Loop loop;
55 loop = new Loop();
70 // Loop header parameters
74 // Loop body parameters
H A DForFactory.java38 import jdk.test.lib.jittester.loops.Loop;
45 private final Loop loop;
62 loop = new Loop();
80 // Loop header parameters
86 // Loop body parameters
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.virtual/src/org/graalvm/compiler/virtual/phases/ea/
H A DEffectsClosure.java29 import org.graalvm.compiler.core.common.cfg.Loop;
90 * TODO: if it was possible to introduce your own subclasses of Block and Loop, these maps would
104 protected final EconomicMap<Loop<Block>, GraphEffectList> loopMergeEffects = EconomicMap.create(Equivalence.IDENTITY);
112 protected final EconomicMap<Loop<Block>, LoopKillCache> loopLocationKillCache = EconomicMap.create(Equivalence.IDENTITY);
179 protected List<Void> processLoop(Loop<Block> loop, Void initialState) {
295 protected final List<BlockT> processLoop(Loop<Block> loop, BlockT initialState) {
334 try (Indent i = debug.logAndIndent("================== Process Loop Effects Closure: block:%s begin node:%s", loop.getHeader(), loop.getHeader().getBeginNode())) {
368 protected BlockT stripKilledLoopLocations(Loop<Block> loop, BlockT initialState) {
373 protected void processKilledLoopLocations(Loop<Block> loop, BlockT initialState, BlockT mergedStates) {
378 protected void processInitialLoopState(Loop<Bloc
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/
H A DGuardLoweringPhase.java25 import org.graalvm.compiler.core.common.cfg.Loop;
110 Loop<Block> loop = block.getLoop();
H A DDeoptimizationGroupingPhase.java28 import org.graalvm.compiler.core.common.cfg.Loop;
111 Loop<Block> loop = block.getLoop();
H A DProfileCompiledMethodsPhase.java29 import org.graalvm.compiler.core.common.cfg.Loop;
98 for (Loop<Block> loop : cfg.getLoops()) {
122 private static void addSectionCounters(FixedWithNextNode start, Collection<Block> sectionBlocks, Collection<Loop<Block>> childLoops, ScheduleResult schedule, ControlFlowGraph cfg) {
124 for (Loop<?> loop : childLoops) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases/src/org/graalvm/compiler/phases/graph/
H A DReentrantBlockIterator.java33 import org.graalvm.compiler.core.common.cfg.Loop;
67 protected abstract List<StateT> processLoop(Loop<Block> loop, StateT initialState);
74 public static <StateT> LoopInfo<StateT> processLoop(BlockIteratorClosure<StateT> closure, Loop<Block> loop, StateT initialState) {
204 Loop<Block> loop = successor.getLoop();

Completed in 339 milliseconds

12