HomeSort by: relevance | last modified time | path
    Searched refs:Invariant (Results 1 - 17 of 17) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
SimpleLoopUnswitch.cpp 1 ///===- SimpleLoopUnswitch.cpp - Hoist loop-invariant control flow ---------===//
107 /// Collect all of the loop invariant input values transitively used by the
112 /// invariant. For some operations these can be re-associated and unswitched out
118 "Only need to walk the graph if root itself is not invariant.");
136 // Add it to our result if loop invariant.
157 static void replaceLoopInvariantUses(Loop &L, Value *Invariant,
159 assert(!isa<Constant>(Invariant) && "Why are we unswitching on a constant?");
163 for (Use &U : llvm::make_early_inc_range(Invariant->uses())) {
182 // If the incoming value for this edge isn't loop invariant the unswitch
190 /// Insert code to test a set of loop invariant values, and conditionally branc
    [all...]
LoopUnswitch.cpp 1 //===- LoopUnswitch.cpp - Hoist loop-invariant conditionals in loop -------===//
9 // This pass transforms loops that contain branches on loop-invariant conditions
23 // This pass expects LICM to be run before it to hoist invariant conditions out
279 /// Given that the Invariant is not equal to Val. Simplify instructions
281 Value *simplifyInstructionWithNotEqual(Instruction *Inst, Value *Invariant,
424 /// Cond is a condition that occurs in L. If it is invariant in the loop, or has
425 /// an invariant piece, return the invariant. Otherwise, return null.
453 // TODO: Handle: br (VARIANT|INVARIANT).
461 // Walk up the operator chain to find partial invariant conditions
    [all...]
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/gc/
pooltable.d 159 void Invariant() const nothrow @nogc
  /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/core/internal/gc/impl/conservative/
gc.d 26 //debug = INVARIANT; // enable invariants
1493 debug(INVARIANT) bool initialized;
1494 debug(INVARIANT) bool inCollection;
1539 debug(INVARIANT) initialized = true;
1594 debug(INVARIANT) initialized = false;
1612 void Invariant() const { }
1614 debug(INVARIANT)
1615 invariant()
1619 //printf("Gcx.invariant(): this = %p\n", &this);
1620 pooltable.Invariant();
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/
divrem_1.asm 50 C The method and nomenclature follow part 8 of "Division by Invariant
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
DynamicTypePropagation.cpp 654 // invariant. In such cases, forget any existing information inferred
656 // type here because the invariant the programmer specifies in the cast
821 // If the method is declared on a class that has a non-invariant
830 // invariant):
848 if (TypeParam->getVariance() != ObjCTypeParamVariance::Invariant)
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyIndVar.cpp 222 // Rewrite the comparison to a loop invariant comparison if it can be done
604 // of immediate IV against sext/zext of the invariant argument. If we can
679 /// Replace the UseInst with a loop invariant expression if it is safe.
690 // Do not generate something ridiculous even if S is loop invariant.
698 << " with non-speculable loop invariant: " << *S << '\n');
702 auto *Invariant = Rewriter.expandCodeFor(S, I->getType(), IP);
704 I->replaceAllUsesWith(Invariant);
706 << " with loop invariant: " << *S << '\n');
912 // Try to replace UseInst with a loop invariant before any other
1232 // invariant and will be folded or hoisted. If it actually comes from
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 566 /// instruction (shuffle) for loop invariant values and for the induction
642 /// node, and \p Step is the loop-invariant step. If \p EntryVal is a
1281 /// Holds the number of loop invariant values that are used in the loop.
1704 /// Store: scalar store + (loop invariant value stored? 0 : extract of last
2238 // We need to place the broadcast of invariant variables outside the loop,
2245 // Place the code for broadcasting invariant variables in the new preheader.
2404 // required to be loop-invariant
2407 "Induction step should be loop invariant");
4224 // FIXME: Loop invariant values do not form recurrences. We should deal with
4343 // any loop invariant values
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/
divrem_1.asm 51 C The method and nomenclature follow part 8 of "Division by Invariant
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaDeclObjC.cpp 857 if (newTypeParam->getVariance() == ObjCTypeParamVariance::Invariant &&
859 // When the new type parameter is invariant and is not part
863 == ObjCTypeParamVariance::Invariant &&
867 // When the old parameter is invariant and was not part of the
884 case ObjCTypeParamVariance::Invariant:
895 == ObjCTypeParamVariance::Invariant) {
  /src/external/apache2/llvm/dist/clang/lib/AST/
DeclPrinter.cpp 1251 case ObjCTypeParamVariance::Invariant:
JSONNodeDumper.cpp 942 case ObjCTypeParamVariance::Invariant:
TextNodeDumper.cpp 2164 case ObjCTypeParamVariance::Invariant:
DeclObjC.cpp 566 // be made invariant by reusing the canonical decl. Take this into account
1441 ObjCTypeParamVariance::Invariant,
1798 // categories on error. This breaks an AST invariant, and should not be
ASTContext.cpp 9129 case ObjCTypeParamVariance::Invariant:
  /src/external/apache2/llvm/dist/clang/lib/Parse/
ParseObjc.cpp 437 getCurScope(), ObjCTypeParamVariance::Invariant, SourceLocation(),
453 ObjCTypeParamVariance variance = ObjCTypeParamVariance::Invariant;
  /src/external/apache2/llvm/dist/clang/include/clang/AST/
DeclObjC.h 555 /// The parameter is invariant: must match exactly.
556 Invariant,

Completed in 108 milliseconds