/freebsd-11.0-release/usr.bin/tip/libacu/ |
H A D | v831.c | 68 if ((AC = open(acu, O_RDWR)) < 0) { 77 close(AC); 106 close(AC); 114 close(AC); 156 printf("[abort: AC=%d]\n", AC); 163 close(AC); 182 #define pc(x) (c = x, write(AC,&c,1)) 209 tcgetattr(AC, &cntrl); 214 tcsetattr(AC, TCSANO [all...] |
/freebsd-11.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | InstructionSimplify.h | 55 AssumptionCache *AC = nullptr, 64 AssumptionCache *AC = nullptr, 73 AssumptionCache *AC = nullptr, 82 AssumptionCache *AC = nullptr, 91 AssumptionCache *AC = nullptr, 99 AssumptionCache *AC = nullptr, 107 AssumptionCache *AC = nullptr, 115 AssumptionCache *AC = nullptr, 124 AssumptionCache *AC = nullptr, 132 AssumptionCache *AC [all...] |
H A D | PHITransAddr.h | 47 AssumptionCache *AC; member in class:llvm::PHITransAddr 53 PHITransAddr(Value *addr, const DataLayout &DL, AssumptionCache *AC) argument 54 : Addr(addr), DL(DL), TLI(nullptr), AC(AC) {
|
H A D | ValueTracking.h | 47 AssumptionCache *AC = nullptr, 57 AssumptionCache *AC = nullptr, 65 AssumptionCache *AC = nullptr, 76 AssumptionCache *AC = nullptr, 85 AssumptionCache *AC = nullptr, 91 AssumptionCache *AC = nullptr, 98 AssumptionCache *AC = nullptr, 112 unsigned Depth = 0, AssumptionCache *AC = nullptr, 125 unsigned Depth = 0, AssumptionCache *AC = nullptr, 320 AssumptionCache *AC, [all...] |
H A D | CodeMetrics.h | 96 static void collectEphemeralValues(const Loop *L, AssumptionCache *AC, 101 static void collectEphemeralValues(const Function *L, AssumptionCache *AC,
|
H A D | BasicAliasAnalysis.h | 43 AssumptionCache &AC; member in class:llvm::BasicAAResult 49 AssumptionCache &AC, DominatorTree *DT = nullptr, 51 : AAResultBase(TLI), DL(DL), AC(AC), DT(DT), LI(LI) {} 54 : AAResultBase(Arg), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), LI(Arg.LI) {} 56 : AAResultBase(std::move(Arg)), DL(Arg.DL), AC(Arg.AC), DT(Arg.DT), 137 const DataLayout &DL, unsigned Depth, AssumptionCache *AC, 144 AssumptionCache *AC, DominatorTre 48 BasicAAResult(const DataLayout &DL, const TargetLibraryInfo &TLI, AssumptionCache &AC, DominatorTree *DT = nullptr, LoopInfo *LI = nullptr) argument [all...] |
H A D | DemandedBits.h | 60 AssumptionCache *AC; member in struct:llvm::DemandedBits
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Utils/ |
H A D | PromoteMemToReg.h | 46 AssumptionCache *AC = nullptr);
|
H A D | UnrollLoop.h | 35 AssumptionCache *AC, bool PreserveLCSSA);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/ |
H A D | CheckSizeofPointer.cpp | 28 AnalysisDeclContext* AC; member in class:__anon4145::WalkAST 32 : BR(br), Checker(checker), AC(ac) {} 66 PathDiagnosticLocation::createBegin(E, BR.getSourceManager(), AC); 67 BR.EmitBasicReport(AC->getDecl(), Checker,
|
H A D | IdenticalExprChecker.cpp | 40 AnalysisDeclContext *AC; member in class:__anon4169::FindIdenticalExprVisitor 45 : BR(B), Checker(Checker), AC(A) {} 72 BR.EmitBasicReport(AC->getDecl(), Checker, 92 if (isIdenticalStmt(AC->getASTContext(), RHS, B2->getRHS())) { 100 if (isIdenticalStmt(AC->getASTContext(), RHS, LHS)) { 119 if (InnerIf && isIdenticalStmt(AC->getASTContext(), I->getCond(), InnerIf->getCond(), /*ignoreSideEffects=*/ false)) { 120 PathDiagnosticLocation ELoc(InnerIf->getCond(), BR.getSourceManager(), AC); 121 BR.EmitBasicReport(AC->getDecl(), Checker, "Identical conditions", 141 if (isIdenticalStmt(AC->getASTContext(), Cond1, Cond2, false)) { 143 PathDiagnosticLocation ELoc(Cond2, BR.getSourceManager(), AC); [all...] |
H A D | ObjCContainersASTChecker.cpp | 31 AnalysisDeclContext* AC; member in class:__anon4194::WalkAST 75 : BR(br), Checker(checker), AC(ac), ASTC(AC->getASTContext()), 144 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC); 145 BR.EmitBasicReport(AC->getDecl(), Checker, OsName.str(),
|
H A D | VirtualCallChecker.cpp | 33 AnalysisDeclContext *AC; member in class:__anon4233::WalkAST 64 : Checker(checker), BR(br), AC(ac), visitingCallExpr(nullptr) {} 191 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC); 197 BR.EmitBasicReport(AC->getDecl(), Checker, 206 BR.EmitBasicReport(AC->getDecl(), Checker,
|
H A D | CheckSecuritySyntaxOnly.cpp | 64 AnalysisDeclContext* AC; member in class:__anon4142::WalkAST 74 : BR(br), AC(ac), II_setid(), 293 PathDiagnosticLocation::createBegin(FS, BR.getSourceManager(), AC); 294 BR.EmitBasicReport(AC->getDecl(), filter.checkName_FloatLoopCounter, 328 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC); 329 BR.EmitBasicReport(AC->getDecl(), filter.checkName_gets, 368 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC); 369 BR.EmitBasicReport(AC->getDecl(), filter.checkName_getpw, 409 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC); 410 BR.EmitBasicReport(AC [all...] |
H A D | VforkChecker.cpp | 89 ASTContext &AC = C.getASTContext(); local 90 II_vfork = &AC.Idents.get("vfork"); 113 ASTContext &AC = C.getASTContext(); local 115 VforkWhitelist.insert(&AC.Idents.get(*id));
|
H A D | CStringSyntaxChecker.cpp | 36 AnalysisDeclContext* AC; member in class:__anon4135::WalkAST 86 : Checker(checker), BR(br), AC(ac) {} 145 PathDiagnosticLocation::createBegin(LenArg, BR.getSourceManager(), AC);
|
/freebsd-11.0-release/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/ |
H A D | ReachableCode.h | 64 void FindUnreachableCode(AnalysisDeclContext &AC, Preprocessor &PP,
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 130 AssumptionCache *AC, 139 if (SimplifyCFG(&*BBIt++, TTI, BonusInstThreshold, AC)) { 150 AssumptionCache *AC, int BonusInstThreshold) { 153 EverChanged |= iterativelySimplifyCFG(F, TTI, AC, BonusInstThreshold); 167 EverChanged = iterativelySimplifyCFG(F, TTI, AC, BonusInstThreshold); 183 auto &AC = AM->getResult<AssumptionAnalysis>(F); local 185 if (!simplifyFunctionCFG(F, TTI, &AC, BonusInstThreshold)) 210 AssumptionCache *AC = 214 return simplifyFunctionCFG(F, TTI, AC, BonusInstThreshold); 129 iterativelySimplifyCFG(Function &F, const TargetTransformInfo &TTI, AssumptionCache *AC, unsigned BonusInstThreshold) argument 149 simplifyFunctionCFG(Function &F, const TargetTransformInfo &TTI, AssumptionCache *AC, int BonusInstThreshold) argument
|
/freebsd-11.0-release/contrib/llvm/include/llvm/Transforms/Scalar/ |
H A D | SROA.h | 57 AssumptionCache *AC; member in class:llvm::SROA 102 SROA() : C(nullptr), DT(nullptr), AC(nullptr) {}
|
/freebsd-11.0-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | Mem2Reg.cpp | 72 AssumptionCache &AC = local 87 PromoteMemToReg(Allocas, DT, nullptr, &AC);
|
H A D | SimplifyInstructions.cpp | 57 AssumptionCache *AC = variable 75 if (Value *V = SimplifyInstruction(I, DL, TLI, DT, AC)) {
|
/freebsd-11.0-release/contrib/llvm/lib/Analysis/ |
H A D | CodeMetrics.cpp | 65 const Loop *L, AssumptionCache *AC, 69 for (auto &AssumeVH : AC->assumptions()) { 87 const Function *F, AssumptionCache *AC, 91 for (auto &AssumeVH : AC->assumptions()) { 64 collectEphemeralValues( const Loop *L, AssumptionCache *AC, SmallPtrSetImpl<const Value *> &EphValues) argument 86 collectEphemeralValues( const Function *F, AssumptionCache *AC, SmallPtrSetImpl<const Value *> &EphValues) argument
|
H A D | InstructionSimplify.cpp | 52 AssumptionCache *AC; member in struct:__anon2396::Query 58 : DL(DL), TLI(tli), DT(dt), AC(ac), CxtI(cxti) {} 586 const DominatorTree *DT, AssumptionCache *AC, 588 return ::SimplifyAddInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), 779 const DominatorTree *DT, AssumptionCache *AC, 781 return ::SimplifySubInst(Op0, Op1, isNSW, isNUW, Query(DL, TLI, DT, AC, CxtI), 959 const DominatorTree *DT, AssumptionCache *AC, 961 return ::SimplifyFAddInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, CxtI), 968 const DominatorTree *DT, AssumptionCache *AC, 970 return ::SimplifyFSubInst(Op0, Op1, FMF, Query(DL, TLI, DT, AC, Cxt 584 SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 777 SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 956 SimplifyFAddInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 965 SimplifyFSubInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 974 SimplifyFMulInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 983 SimplifyMulInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1087 SimplifySDivInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1105 SimplifyUDivInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1147 SimplifyFDivInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1227 SimplifySRemInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1245 SimplifyURemInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1272 SimplifyFRemInst(Value *Op0, Value *Op1, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1396 SimplifyShlInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1420 SimplifyLShrInst(Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1454 SimplifyAShrInst(Value *Op0, Value *Op1, bool isExact, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1655 SimplifyAndInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1843 SimplifyOrInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 1900 SimplifyXorInst(Value *Op0, Value *Op1, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3091 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3216 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3437 SimplifySelectInst(Value *Cond, Value *TrueVal, Value *FalseVal, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3530 SimplifyGEPInst(ArrayRef<Value *> Ops, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3568 SimplifyInsertValueInst( Value *Agg, Value *Val, ArrayRef<unsigned> Idxs, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3601 SimplifyExtractValueInst(Value *Agg, ArrayRef<unsigned> Idxs, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3636 SimplifyExtractElementInst( Value *Vec, Value *Idx, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3683 SimplifyTruncInst(Value *Op, Type *Ty, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3779 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3787 SimplifyFPBinOp(unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3804 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3918 SimplifyCall(Value *V, User::op_iterator ArgBegin, User::op_iterator ArgEnd, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3926 SimplifyCall(Value *V, ArrayRef<Value *> Args, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC, const Instruction *CxtI) argument 3936 SimplifyInstruction(Instruction *I, const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC) argument 4106 replaceAndRecursivelySimplifyImpl(Instruction *I, Value *SimpleV, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC) argument 4160 recursivelySimplifyInstruction(Instruction *I, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC) argument 4167 replaceAndRecursivelySimplify(Instruction *I, Value *SimpleV, const TargetLibraryInfo *TLI, const DominatorTree *DT, AssumptionCache *AC) argument [all...] |
/freebsd-11.0-release/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 143 AssumptionCache *AC; member in class:llvm::InstCombineIRInserter 146 InstCombineIRInserter(InstCombineWorklist &WL, AssumptionCache *AC) argument 147 : Worklist(WL), AC(AC) {} 156 AC->registerAssumption(cast<CallInst>(I)); 185 AssumptionCache *AC; member in class:llvm::InstCombiner 199 AssumptionCache *AC, TargetLibraryInfo *TLI, 202 AA(AA), AC(AC), TLI(TLI), DT(DT), DL(DL), LI(LI), MadeIRChange(false) {} 209 AssumptionCache *getAssumptionCache() const { return AC; } 197 InstCombiner(InstCombineWorklist &Worklist, BuilderTy *Builder, bool MinimizeSize, AliasAnalysis *AA, AssumptionCache *AC, TargetLibraryInfo *TLI, DominatorTree *DT, const DataLayout &DL, LoopInfo *LI) argument [all...] |
/freebsd-11.0-release/contrib/elftoolchain/ar/ |
H A D | ar.h | 62 #define AC(CALL) do { \ macro 73 #define ACV(CALL) AC(CALL)
|