Home
last modified time | relevance | path

Searched full:simplification (Results 1 – 25 of 137) sorted by relevance

123456

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DInstSimplifyPass.h10 /// Defines passes for running instruction simplification across chunks of IR.
21 /// Run instruction simplification across each instruction in the function.
23 /// Instruction simplification has useful constraints in some contexts:
27 /// Many passes use instruction simplification as a library facility, but it may
H A DIndVarSimplify.h1 //===- IndVarSimplify.h - Induction Variable Simplification -----*- C++ -*-===//
10 // Simplification pass.
H A DLoopInstSimplify.h9 // This pass performs lightweight instruction simplification on loop bodies.
H A DLoopSimplifyCFG.h1 //===- LoopSimplifyCFG.cpp - Loop CFG Simplification Pass -------*- C++ -*-===//
H A DLowerConstantIntrinsics.h35 /// This complements the Instruction Simplification and
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h13 // ("and i32 %x, %x" -> "%x"). If the simplification is also an instruction
232 /// simplification succeeds that the intrinsic is side effect free. As a result,
233 /// successful simplification can be used to delete the intrinsic not just
257 /// AllowRefinement specifies whether the simplification can be a refinement
H A DDependenceAnalysis.h883 /// Return true if some simplification occurs.
884 /// If the simplification isn't exact (that is, if it is conservative
894 /// Return true if some simplification occurs.
895 /// If the simplification isn't exact (that is, if it is conservative
904 /// Return true if some simplification occurs.
911 /// Return true if some simplification occurs.
912 /// If the simplification isn't exact (that is, if it is conservative
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DCNFFormula.cpp70 // Simplification made the clause empty, which is equivalent to `false`. in addClause()
278 // considered for the simplification of earlier clauses. Do a final in buildCNF()
279 // pass to find more opportunities for simplification. in buildCNF()
/freebsd/contrib/llvm-project/llvm/include/llvm/Passes/
H A DPassBuilder.h180 /// Construct the core LLVM function canonicalization and simplification
198 /// Construct the core LLVM module canonicalization and simplification
202 /// of IR. Much like the function simplification pipeline above, it is
415 /// simplification passes. This is the last point in the loop optimization
449 /// main CallGraphSCC passes and before any function simplification passes run
480 /// basic simplification of the input IR.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopInstSimplify.cpp1 //===- LoopInstSimplify.cpp - Loop Instruction Simplification Pass --------===//
9 // This pass performs lightweight instruction simplification on loop bodies.
H A DIndVarSimplify.cpp564 // Simplification of IV users based on SCEV evaluation.
591 /// Iteratively perform simplification on a worklist of IV users. Each
592 /// successive simplification may push more users which may themselves be
593 /// candidates for simplification.
595 /// Sign/Zero extend elimination is interleaved with IV simplification.
609 // Each round of simplification iterates through the SimplifyIVUsers worklist in simplifyAndExtend()
612 // simplification on the wide IVs. in simplifyAndExtend()
1895 // IndVarSimplify driver. Manage several subpasses of IV simplification.
1928 // Simplification works best when run before other consumers of SCEV. We in run()
H A DSimplifyCFGPass.cpp1 //===- SimplifyCFGPass.cpp - CFG Simplification Pass ----------------------===//
245 assert(IterCnt++ < 1000 && "Iterative simplification didn't converge!"); in iterativelySimplifyCFG()
/freebsd/contrib/libxo/xopo/
H A Dxopo.151 for simplification and the resulting strings are replaced into the
/freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DArrayBoundCheckerV2.cpp226 // practical) to integrate this kind of simplification into the resolution of
232 // NOTE: the simplification preserves the order of the two operands in a
237 // comparison is false for all values of "X".) However, the simplification may
284 // simplification algorithm defined for this checker. Return a pair of states,
289 // the default BO_LT after consistently applying the same simplification steps.
/freebsd/contrib/llvm-project/llvm/lib/Passes/
H A DPassBuilderPipelines.cpp437 // Add the primary loop simplification pipeline. in buildO1FunctionSimplificationPipeline()
618 // Add the primary loop simplification pipeline. in buildFunctionSimplificationPipeline()
948 // simplification pipeline, so this only needs to run when it could affect the in buildInlinerPipeline()
949 // function simplification pipeline, which is only the case with recursive in buildInlinerPipeline()
965 // Add the core function simplification pipeline nested inside the in buildInlinerPipeline()
1300 // Cleanup after loop vectorization, etc. Simplification passes like CVP and in addVectorPasses()
1482 // in the simplification pipeline. in buildModuleOptimizationPipeline()
1589 // Add the core simplification pipeline. in buildPerModuleDefaultPipeline()
1658 // in ThinLTO. Because there is another canonicalization and simplification in buildThinLTOPreLinkDefaultPipeline()
1724 // Add the core simplification pipeline. in buildThinLTODefaultPipeline()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/bugpoint/
H A DExtractFunction.cpp85 unsigned Simplification) { in deleteInstructionFromProgram() argument
114 if (Simplification > 1 && !NoDCE) in deleteInstructionFromProgram()
116 if (Simplification && !DisableSimplifyCFG) in deleteInstructionFromProgram()
H A DCrashDebugger.cpp1091 unsigned Simplification = 2; in ReduceInsts() local
1096 --Simplification; in ReduceInsts()
1098 << "tions: Simplification Level #" << Simplification << '\n'; in ReduceInsts()
1135 BD.deleteInstructionFromProgram(&*I, Simplification); in ReduceInsts()
1153 } while (Simplification); in ReduceInsts()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonTargetMachine.cpp116 cl::desc("Bit simplification"));
420 // Rotate loops to expose bit-simplification opportunities. in addInstSelector()
426 // Bit simplification. in addInstSelector()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSimplifyIndVar.h9 // This file defines in interface for induction variable simplification. It does
H A DInstructionWorklist.h24 /// InstCombine and other simplification passes.
/freebsd/tools/test/stress2/misc/
H A Dforce10.sh30 # "mdconfig -o force" test scenario. Simplification of force7.sh
/freebsd/sys/contrib/device-tree/Bindings/sound/
H A Dfsl-asoc-card.txt13 from the simplification of a new card support and the capability of the wide
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyIndVar.cpp1 //===-- SimplifyIndVar.cpp - Induction variable simplification ------------===//
9 // This file implements induction variable simplification. It does
72 assert(LI && "IV simplification requires LoopInfo"); in SimplifyIndvar()
78 /// Iteratively perform simplification on a worklist of users of the
899 /// Iteratively perform simplification on a worklist of users
900 /// of the specified induction variable. Each successive simplification may push
901 /// more users which may themselves be candidates for simplification.
1539 /// Is this instruction potentially interesting for further simplification after
1912 // further simplification. We don't need to directly inform SimplifyIVUsers in widenIVUse()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DDependenceGraphBuilder.cpp381 LLVM_DEBUG(dbgs() << "==== Start of Graph Simplification ===\n"); in simplify()
478 LLVM_DEBUG(dbgs() << "=== End of Graph Simplification ===\n"); in simplify()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSetWavePriority.cpp197 // place or the loop simplification/canonicalization pass should have in runOnMachineFunction()

123456