Home
last modified time | relevance | path

Searched refs:numPreds (Results 1 – 25 of 59) sorted by relevance

123

/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/
H A DEdgeMoveOptimizer.java132 int numPreds = block.getPredecessorCount(); in optimizeMovesAtBlockEnd() local
133 assert numPreds > 1 : "do not call otherwise"; in optimizeMovesAtBlockEnd()
168 for (int i = 1; i < numPreds; ++i) { in optimizeMovesAtBlockEnd()
179 for (int i = 0; i < numPreds; i++) { in optimizeMovesAtBlockEnd()
/dports/math/teyjus/teyjus-2.1-7-ge63f40a/source/compiler/
H A Dspitcode.ml242 let Codegen.PredList(predNames, numPreds) = predlist in
244 Bytecode.writeint2 numPreds;
255 let Codegen.PredList(predNames, numPreds) = defs in
256 Bytecode.writeint2 numPreds;
/dports/lang/ghc/ghc-8.10.7/compiler/cmm/
H A DCmmContFlowOpt.hs294 , likelyTrue l || (numPreds f > 1)
315 numPreds bid = mapLookup bid backEdges `orElse` 0 function
317 hasOnePredecessor b = numPreds b == 1
/dports/www/firefox-legacy/firefox-52.8.0esr/js/src/jit/
H A DScalarReplacement.cpp410 size_t numPreds = succ->numPredecessors();
413 if (!phi->reserveLength(numPreds))
418 for (size_t p = 0; p < numPreds; p++)
1108 size_t numPreds = succ->numPredecessors();
1111 if (!phi->reserveLength(numPreds))
1116 for (size_t p = 0; p < numPreds; p++)
H A DLIR.cpp107 size_t numPreds = block_->numPredecessors();
110 MOZ_ASSERT(phi->numOperands() == numPreds);
119 LAllocation* inputs = alloc.allocateArray<LAllocation>(numPreds);
/dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/mozjs-45/extract/js/src/jit/
H A DScalarReplacement.cpp406 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
409 if (!phi->reserveLength(numPreds)) in mergeIntoSuccessorState()
414 for (size_t p = 0; p < numPreds; p++) in mergeIntoSuccessorState()
1107 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
1110 if (!phi->reserveLength(numPreds)) in mergeIntoSuccessorState()
1115 for (size_t p = 0; p < numPreds; p++) in mergeIntoSuccessorState()
H A DLIR.cpp103 size_t numPreds = block_->numPredecessors(); in init() local
106 MOZ_ASSERT(phi->numOperands() == numPreds); in init()
110 LAllocation* inputs = alloc.allocateArray<LAllocation>(numPreds); in init()
H A DMIRGraph.cpp1125 for (size_t j = 0, numPreds = predecessors_.length(); j < numPreds; ++j) { in addPredecessorPopN() local
1299 size_t numPreds = numPredecessors(); in setLoopHeader() local
1300 MOZ_ASSERT(numPreds != 0); in setLoopHeader()
1302 size_t lastIndex = numPreds - 1; in setLoopHeader()
1305 MOZ_ASSERT(oldIndex < numPreds); in setLoopHeader()
/dports/lang/spidermonkey78/firefox-78.9.0/js/src/jit/
H A DScalarReplacement.cpp411 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
414 if (!phi || !phi->reserveLength(numPreds)) { in mergeIntoSuccessorState()
420 for (size_t p = 0; p < numPreds; p++) { in mergeIntoSuccessorState()
1059 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
1062 if (!phi || !phi->reserveLength(numPreds)) { in mergeIntoSuccessorState()
1068 for (size_t p = 0; p < numPreds; p++) { in mergeIntoSuccessorState()
/dports/www/firefox-esr/firefox-91.8.0/js/src/jit/
H A DMIRGraph.cpp861 for (size_t j = 0, numPreds = predecessors_.length(); j < numPreds; in addPredecessorPopN() local
1006 size_t numPreds = numPredecessors(); in setLoopHeader() local
1007 MOZ_ASSERT(numPreds != 0); in setLoopHeader()
1009 size_t lastIndex = numPreds - 1; in setLoopHeader()
1012 MOZ_ASSERT(oldIndex < numPreds); in setLoopHeader()
H A DLIR.cpp100 size_t numPreds = block_->numPredecessors(); in init() local
103 MOZ_ASSERT(phi->numOperands() == numPreds); in init()
118 LAllocation* inputs = alloc.allocateArray<LAllocation>(numPreds); in init()
H A DScalarReplacement.cpp424 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
427 if (!phi || !phi->reserveLength(numPreds)) { in mergeIntoSuccessorState()
433 for (size_t p = 0; p < numPreds; p++) { in mergeIntoSuccessorState()
1107 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
1110 if (!phi || !phi->reserveLength(numPreds)) { in mergeIntoSuccessorState()
1116 for (size_t p = 0; p < numPreds; p++) { in mergeIntoSuccessorState()
/dports/www/firefox/firefox-99.0/js/src/jit/
H A DMIRGraph.cpp859 for (size_t j = 0, numPreds = predecessors_.length(); j < numPreds; in addPredecessorPopN() local
1004 size_t numPreds = numPredecessors(); in setLoopHeader() local
1005 MOZ_ASSERT(numPreds != 0); in setLoopHeader()
1007 size_t lastIndex = numPreds - 1; in setLoopHeader()
1010 MOZ_ASSERT(oldIndex < numPreds); in setLoopHeader()
H A DLIR.cpp100 size_t numPreds = block_->numPredecessors(); in init() local
103 MOZ_ASSERT(phi->numOperands() == numPreds); in init()
118 LAllocation* inputs = alloc.allocateArray<LAllocation>(numPreds); in init()
/dports/mail/thunderbird/thunderbird-91.8.0/js/src/jit/
H A DMIRGraph.cpp861 for (size_t j = 0, numPreds = predecessors_.length(); j < numPreds; in addPredecessorPopN() local
1006 size_t numPreds = numPredecessors(); in setLoopHeader() local
1007 MOZ_ASSERT(numPreds != 0); in setLoopHeader()
1009 size_t lastIndex = numPreds - 1; in setLoopHeader()
1012 MOZ_ASSERT(oldIndex < numPreds); in setLoopHeader()
H A DLIR.cpp100 size_t numPreds = block_->numPredecessors(); in init() local
103 MOZ_ASSERT(phi->numOperands() == numPreds); in init()
118 LAllocation* inputs = alloc.allocateArray<LAllocation>(numPreds); in init()
/dports/lang/spidermonkey60/firefox-60.9.0/js/src/jit/
H A DScalarReplacement.cpp422 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
425 if (!phi || !phi->reserveLength(numPreds)) return false; in mergeIntoSuccessorState()
429 for (size_t p = 0; p < numPreds; p++) phi->addInput(undefinedVal_); in mergeIntoSuccessorState()
1126 size_t numPreds = succ->numPredecessors(); in mergeIntoSuccessorState() local
1129 if (!phi || !phi->reserveLength(numPreds)) return false; in mergeIntoSuccessorState()
1133 for (size_t p = 0; p < numPreds; p++) phi->addInput(undefinedVal_); in mergeIntoSuccessorState()
/dports/devel/intel-graphics-compiler/intel-graphics-compiler-igc-1.0.9636/IGC/Compiler/CISACodeGen/
H A Dlayout.cpp581 unsigned numPreds = 0; in LayoutBlocks() local
587 numPreds++; in LayoutBlocks()
620 if (allPredLoopExit && numPreds > 1) in LayoutBlocks()
/dports/math/teyjus/teyjus-2.1-7-ge63f40a/source/disassembler/
H A Dcontext.ml122 let numPreds = List.length preds in
123 printLine (header ^ (string_of_int numPreds));
124 if (numPreds = 0) then ()

123