Searched refs:PA (Results 1 - 25 of 161) sorted by relevance

1234567

/freebsd-13-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAnalysisManager.cpp31 Function &F, const PreservedAnalyses &PA,
48 auto PAC = PA.getChecker<LoopAnalysisManagerFunctionProxy>();
51 invalidateMemorySSAAnalysis = Inv.invalidate<MemorySSAAnalysis>(F, PA);
53 Inv.invalidate<AAManager>(F, PA) ||
54 Inv.invalidate<AssumptionAnalysis>(F, PA) ||
55 Inv.invalidate<DominatorTreeAnalysis>(F, PA) ||
56 Inv.invalidate<LoopAnalysis>(F, PA) ||
57 Inv.invalidate<ScalarEvolutionAnalysis>(F, PA) ||
86 PA.allAnalysesInSetPreserved<AllAnalysesOn<Loop>>();
106 if (Inv.invalidate(OuterAnalysisID, F, PA)) {
30 invalidate( Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &Inv) argument
140 PreservedAnalyses PA; local
[all...]
H A DCGSCCPassManager.cpp62 PreservedAnalyses PA = PreservedAnalyses::all(); local
119 PA.intersect(std::move(PassPA));
132 UR.CrossSCCPA.intersect(PA);
138 PA.preserveSet<AllAnalysesOn<LazyCallGraph::SCC>>();
143 return PA;
147 Module &M, const PreservedAnalyses &PA,
150 if (PA.areAllPreserved())
161 auto PAC = PA.getChecker<CGSCCAnalysisManagerModuleProxy>();
163 Inv.invalidate<LazyCallGraphAnalysis>(M, PA) ||
164 Inv.invalidate<FunctionAnalysisManagerModuleProxy>(M, PA)) {
146 invalidate( Module &M, const PreservedAnalyses &PA, ModuleAnalysisManager::Invalidator &Inv) argument
254 invalidate( LazyCallGraph::SCC &C, const PreservedAnalyses &PA, CGSCCAnalysisManager::Invalidator &Inv) argument
355 auto PA = PreservedAnalyses::all(); local
416 PreservedAnalyses PA; local
706 auto PA = PreservedAnalyses::allInSet<AllAnalysesOn<Function>>(); local
[all...]
H A DDominanceFrontier.cpp70 bool DominanceFrontier::invalidate(Function &F, const PreservedAnalyses &PA, argument
74 auto PAC = PA.getChecker<DominanceFrontierAnalysis>();
H A DPostDominators.cpp45 bool PostDominatorTree::invalidate(Function &F, const PreservedAnalyses &PA, argument
49 auto PAC = PA.getChecker<PostDominatorTreeAnalysis>();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/IR/
H A DPassManager.cpp30 Module &M, const PreservedAnalyses &PA,
33 if (PA.areAllPreserved())
44 auto PAC = PA.getChecker<FunctionAnalysisManagerModuleProxy>();
52 PA.allAnalysesInSetPreserved<AllAnalysesOn<Function>>();
68 if (Inv.invalidate(OuterAnalysisID, M, PA)) {
70 FunctionPA = PA;
76 // Check if we needed a custom PA set, and if so we'll need to run the
83 // Otherwise we only need to do invalidation if the original PA set didn't
86 InnerAM->invalidate(F, PA);
29 invalidate( Module &M, const PreservedAnalyses &PA, ModuleAnalysisManager::Invalidator &Inv) argument
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DDependencyAnalysis.h58 ProvenanceAnalysis &PA);
62 ProvenanceAnalysis &PA);
66 bool CanUse(const Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA,
72 ProvenanceAnalysis &PA, ARCInstKind Class);
77 ProvenanceAnalysis &PA, ARCInstKind Class);
81 ProvenanceAnalysis &PA) {
82 return CanDecrementRefCount(Inst, Ptr, PA, GetARCInstKind(Inst));
79 CanDecrementRefCount(const Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA) argument
H A DDependencyAnalysis.cpp35 ProvenanceAnalysis &PA,
50 FunctionModRefBehavior MRB = PA.getAA()->getModRefBehavior(Call);
56 if (IsPotentialRetainableObjPtr(Op, *PA.getAA()) &&
57 PA.related(Ptr, Op, DL))
69 ProvenanceAnalysis &PA,
76 return CanAlterRefCount(Inst, Ptr, PA, Class);
82 ProvenanceAnalysis &PA, ARCInstKind Class) {
96 if (!IsPotentialRetainableObjPtr(ICI->getOperand(1), *PA.getAA()))
102 if (IsPotentialRetainableObjPtr(Op, *PA.getAA()) &&
103 PA
34 CanAlterRefCount(const Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
67 CanDecrementRefCount(const Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
81 CanUse(const Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
130 Depends(DependenceKind Flavor, Instruction *Inst, const Value *Arg, ProvenanceAnalysis &PA) argument
218 FindDependencies(DependenceKind Flavor, const Value *Arg, BasicBlock *StartBB, Instruction *StartInst, SmallPtrSetImpl<Instruction *> &DependingInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument
[all...]
H A DProvenanceAnalysisEvaluator.cpp67 ProvenanceAnalysis PA; local
68 PA.setAA(&getAnalysis<AAResultsWrapperPass>().getAAResults());
78 if (PA.related(V1, V2, DL))
H A DPtrState.h184 ProvenanceAnalysis &PA, ARCInstKind Class);
186 ProvenanceAnalysis &PA, ARCInstKind Class);
202 ProvenanceAnalysis &PA, ARCInstKind Class);
205 ProvenanceAnalysis &PA, ARCInstKind Class);
H A DPtrState.cpp230 ProvenanceAnalysis &PA,
235 if (!CanAlterRefCount(Inst, Ptr, PA, Class))
258 ProvenanceAnalysis &PA,
289 if (CanUse(Inst, Ptr, PA, Class)) {
299 if (CanUse(Call, Ptr, PA, GetBasicARCInstKind(Call))) {
307 if (CanUse(Inst, Ptr, PA, Class)) {
382 ProvenanceAnalysis &PA,
386 if (!CanAlterRefCount(Inst, Ptr, PA, Class) &&
416 ProvenanceAnalysis &PA,
421 if (!CanUse(Inst, Ptr, PA, Clas
228 HandlePotentialAlterRefCount(Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
256 HandlePotentialUse(BasicBlock *BB, Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
380 HandlePotentialAlterRefCount(Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
415 HandlePotentialUse(Instruction *Inst, const Value *Ptr, ProvenanceAnalysis &PA, ARCInstKind Class) argument
[all...]
/freebsd-13-stable/contrib/libdivsufsort/lib/
H A Dsssort.c167 ss_insertionsort(const sauchar_t *T, const saidx_t *PA, argument
174 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) {
192 ss_fixdown(const sauchar_t *Td, const saidx_t *PA, argument
198 for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {
199 d = Td[PA[SA[k = j++]]];
200 if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; }
209 ss_heapsort(const sauchar_t *Td, const saidx_t *PA, saidx_t *SA, saidx_t size) { argument
216 if(Td[PA[SA[m / 2]]] < Td[PA[S
234 ss_median3(const sauchar_t *Td, const saidx_t *PA, saidx_t *v1, saidx_t *v2, saidx_t *v3) argument
248 ss_median5(const sauchar_t *Td, const saidx_t *PA, saidx_t *v1, saidx_t *v2, saidx_t *v3, saidx_t *v4, saidx_t *v5) argument
263 ss_pivot(const sauchar_t *Td, const saidx_t *PA, saidx_t *first, saidx_t *last) argument
291 ss_partition(const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument
310 ss_mintrosort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t depth) argument
502 ss_inplacemerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t depth) argument
545 ss_mergeforward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument
595 ss_mergebackward(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t depth) argument
654 ss_swapmerge(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *middle, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth) argument
747 sssort(const sauchar_t *T, const saidx_t *PA, saidx_t *first, saidx_t *last, saidx_t *buf, saidx_t bufsize, saidx_t depth, saidx_t n, saint_t lastsuffix) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DSCCP.cpp27 PreservedAnalyses PA;
28 PA.preserve<DominatorTreeAnalysis>();
29 PA.preserve<PostDominatorTreeAnalysis>();
30 PA.preserve<FunctionAnalysisManagerModuleProxy>();
31 return PA;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopPassManager.cpp28 PreservedAnalyses PA = PreservedAnalyses::all(); local
59 PA.intersect(std::move(PassPA));
76 PA.intersect(std::move(PassPA));
92 PA.preserveSet<AllAnalysesOn<Loop>>();
97 return PA;
H A DInstSimplifyPass.cpp143 PreservedAnalyses PA;
144 PA.preserveSet<CFGAnalyses>();
145 return PA;
H A DLoopRotation.cpp59 auto PA = getLoopPassPreservedAnalyses(); local
61 PA.preserve<MemorySSAAnalysis>();
62 return PA;
H A DBDCE.cpp171 PreservedAnalyses PA;
172 PA.preserveSet<CFGAnalyses>();
173 PA.preserve<GlobalsAA>();
174 return PA;
H A DDCE.cpp184 PreservedAnalyses PA;
185 PA.preserveSet<CFGAnalyses>();
186 return PA;
H A DLowerConstantIntrinsics.cpp142 PreservedAnalyses PA; local
143 PA.preserve<GlobalsAA>();
144 return PA;
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DLoopPassManager.h250 PreservedAnalyses PA = PreservedAnalyses::all(); local
254 PA = LoopCanonicalizationFPM.run(F, AM);
263 return PA;
345 PA.intersect(std::move(PassPA));
352 PA.preserveSet<AllAnalysesOn<Loop>>();
353 PA.preserve<LoopAnalysisManagerFunctionProxy>();
355 PA.preserve<DominatorTreeAnalysis>();
356 PA.preserve<LoopAnalysis>();
357 PA.preserve<ScalarEvolutionAnalysis>();
359 PA
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DPassManager.h147 /// auto PAC = PA.getChecker<MyAnalysisType>();
161 PreservedAnalyses PA; local
162 PA.PreservedIDs.insert(&AllAnalysesKey);
163 return PA;
169 PreservedAnalyses PA; local
170 PA.preserveSet<AnalysisSetT>();
171 return PA;
271 const PreservedAnalyses &PA; member in class:llvm::PreservedAnalyses::PreservedAnalysisChecker
278 PreservedAnalysisChecker(const PreservedAnalyses &PA, AnalysisKey *ID) argument
279 : PA(P
491 PreservedAnalyses PA = PreservedAnalyses::all(); local
672 invalidate(IRUnitT &IR, const PreservedAnalyses &PA) argument
686 invalidate(AnalysisKey *ID, IRUnitT &IR, const PreservedAnalyses &PA) argument
694 invalidateImpl(AnalysisKey *ID, IRUnitT &IR, const PreservedAnalyses &PA) argument
806 PreservedAnalyses PA = PreservedAnalyses::none(); local
1098 invalidate( IRUnitT &IRUnit, const PreservedAnalyses &PA, typename AnalysisManager<IRUnitT, ExtraArgTs...>::Invalidator &Inv) argument
1224 PreservedAnalyses PA = PreservedAnalyses::all(); local
1318 auto PA = PreservedAnalyses::all(); local
1356 auto PA = PreservedAnalyses::all(); local
[all...]
/freebsd-13-stable/sys/contrib/zstd/lib/dictBuilder/
H A Ddivsufsort.c257 ss_insertionsort(const unsigned char *T, const int *PA, argument
264 for(t = *i, j = i + 1; 0 < (r = ss_compare(T, PA + t, PA + *j, depth));) {
282 ss_fixdown(const unsigned char *Td, const int *PA, argument
288 for(v = SA[i], c = Td[PA[v]]; (j = 2 * i + 1) < size; SA[i] = SA[k], i = k) {
289 d = Td[PA[SA[k = j++]]];
290 if(d < (e = Td[PA[SA[j]]])) { k = j; d = e; }
299 ss_heapsort(const unsigned char *Td, const int *PA, int *SA, int size) { argument
306 if(Td[PA[SA[m / 2]]] < Td[PA[S
324 ss_median3(const unsigned char *Td, const int *PA, int *v1, int *v2, int *v3) argument
338 ss_median5(const unsigned char *Td, const int *PA, int *v1, int *v2, int *v3, int *v4, int *v5) argument
353 ss_pivot(const unsigned char *Td, const int *PA, int *first, int *last) argument
381 ss_partition(const int *PA, int *first, int *last, int depth) argument
400 ss_mintrosort(const unsigned char *T, const int *PA, int *first, int *last, int depth) argument
592 ss_inplacemerge(const unsigned char *T, const int *PA, int *first, int *middle, int *last, int depth) argument
635 ss_mergeforward(const unsigned char *T, const int *PA, int *first, int *middle, int *last, int *buf, int depth) argument
685 ss_mergebackward(const unsigned char *T, const int *PA, int *first, int *middle, int *last, int *buf, int depth) argument
744 ss_swapmerge(const unsigned char *T, const int *PA, int *first, int *middle, int *last, int *buf, int bufsize, int depth) argument
836 sssort(const unsigned char *T, const int *PA, int *first, int *last, int *buf, int bufsize, int depth, int n, int lastsuffix) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DMem2Reg.cpp67 PreservedAnalyses PA;
68 PA.preserveSet<CFGAnalyses>();
69 return PA;
H A DLCSSA.cpp487 PreservedAnalyses PA;
488 PA.preserveSet<CFGAnalyses>();
489 PA.preserve<BasicAA>();
490 PA.preserve<GlobalsAA>();
491 PA.preserve<SCEVAA>();
492 PA.preserve<ScalarEvolutionAnalysis>();
495 PA.preserve<BranchProbabilityAnalysis>();
496 PA.preserve<MemorySSAAnalysis>();
497 return PA;
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBasicBlockInfo.h92 const Align PA = std::max(PostAlign, Alignment); local
93 if (PA == Align(1))
96 return PO + UnknownPadding(PA, internalKnownBits());
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DCGSCCPassManager.h190 bool invalidate(Module &M, const PreservedAnalyses &PA,
393 bool invalidate(LazyCallGraph::SCC &C, const PreservedAnalyses &PA,
489 PreservedAnalyses PA = PreservedAnalyses::all(); local
518 PA.intersect(std::move(PassPA));
523 auto PAC = PA.getChecker<LazyCallGraphAnalysis>();
537 PA.preserveSet<AllAnalysesOn<Function>>();
538 PA.preserve<FunctionAnalysisManagerCGSCCProxy>();
541 PA.preserve<LazyCallGraphAnalysis>();
543 return PA;
583 PreservedAnalyses PA local
790 PreservedAnalyses PA = PreservedAnalyses::all(); local
[all...]

Completed in 226 milliseconds

1234567