HomeSort by: relevance | last modified time | path
    Searched refs:AC (Results 1 - 25 of 221) sorted by relevancy

1 2 3 4 5 6 7 8 9

  /src/usr.bin/tip/aculib/
v831.c 63 if ((AC = open(acu, O_RDWR)) < 0) {
72 (void)close(AC);
101 (void)close(AC);
109 (void)close(AC);
153 (void)printf("[abort: AC=%d]\n", AC);
158 if (AC > 0)
160 (void)close(AC);
179 #define pc(x) (void)(c = x, write(AC,&c,1))
206 (void)tcgetattr(AC, &cntrl)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
AssumeBundleBuilder.h 42 void salvageKnowledge(Instruction *I, AssumptionCache *AC = nullptr,
49 AssumptionCache *AC = nullptr,
71 AssumptionCache *AC,
PromoteMemToReg.h 40 AssumptionCache *AC = nullptr);
SimplifyCFGOptions.h 33 AssumptionCache *AC = nullptr;
61 AC = Cache;
LoopRotationUtils.h 34 AssumptionCache *AC, DominatorTree *DT, ScalarEvolution *SE,
LoopPeel.h 24 DominatorTree *DT, AssumptionCache *AC, bool PreserveLCSSA);
LoopSimplify.h 65 AssumptionCache *AC, MemorySSAUpdater *MSSAU,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
Mem2Reg.cpp 36 AssumptionCache &AC) {
54 PromoteMemToReg(Allocas, DT, &AC);
63 auto &AC = AM.getResult<AssumptionAnalysis>(F);
64 if (!promoteMemoryToRegister(F, DT, AC))
89 AssumptionCache &AC =
91 return promoteMemoryToRegister(F, DT, AC);
AssumeBundleBuilder.cpp 108 AssumptionCache* AC = nullptr;
112 AssumptionCache *AC = nullptr, DominatorTree *DT = nullptr)
113 : M(M), InstBeingModified(I), AC(AC), DT(DT) {}
121 RK.WasOn, {RK.AttrKind}, AC,
293 void llvm::salvageKnowledge(Instruction *I, AssumptionCache *AC,
297 AssumeBuilderState Builder(I->getModule(), I, AC, DT);
301 if (AC)
302 AC->registerAssumption(Intr);
308 Instruction *CtxI, AssumptionCache *AC,
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
CheckSizeofPointer.cpp 27 AnalysisDeclContext* AC;
30 WalkAST(BugReporter &br, const CheckerBase *checker, AnalysisDeclContext *ac)
31 : BR(br), Checker(checker), AC(ac) {}
65 PathDiagnosticLocation::createBegin(E, BR.getSourceManager(), AC);
66 BR.EmitBasicReport(AC->getDecl(), Checker,
CastToStructChecker.cpp 29 AnalysisDeclContext *AC;
34 : BR(B), Checker(Checker), AC(A) {}
41 ASTContext &Ctx = AC->getASTContext();
64 PathDiagnosticLocation Loc(CE, BR.getSourceManager(), AC);
66 AC->getDecl(), Checker, "Cast from non-struct type to struct type",
96 PathDiagnosticLocation Loc(CE, BR.getSourceManager(), AC);
97 BR.EmitBasicReport(AC->getDecl(), Checker, "Widening cast to struct type",
ObjCContainersASTChecker.cpp 30 AnalysisDeclContext* AC;
73 WalkAST(BugReporter &br, const CheckerBase *checker, AnalysisDeclContext *ac)
74 : BR(br), Checker(checker), AC(ac), ASTC(AC->getASTContext()),
143 PathDiagnosticLocation::createBegin(CE, BR.getSourceManager(), AC);
144 BR.EmitBasicReport(AC->getDecl(), Checker, OsName.str(),
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
PHITransAddr.h 46 AssumptionCache *AC;
52 PHITransAddr(Value *addr, const DataLayout &DL, AssumptionCache *AC)
53 : Addr(addr), DL(DL), TLI(nullptr), AC(AC) {
CodeMetrics.h 83 static void collectEphemeralValues(const Loop *L, AssumptionCache *AC,
88 static void collectEphemeralValues(const Function *L, AssumptionCache *AC,
BasicAliasAnalysis.h 56 AssumptionCache &AC;
62 const TargetLibraryInfo &TLI, AssumptionCache &AC,
64 : AAResultBase(), DL(DL), F(F), TLI(TLI), AC(AC), DT(DT), PV(PV) {}
67 : AAResultBase(Arg), DL(Arg.DL), F(Arg.F), TLI(Arg.TLI), AC(Arg.AC),
71 AC(Arg.AC), DT(Arg.DT), PV(Arg.PV) {}
185 AssumptionCache *AC, DominatorTree *DT);
202 const APInt &BaseOffset, AssumptionCache *AC,
    [all...]
LazyValueInfo.h 33 AssumptionCache *AC = nullptr;
44 : AC(AC_), DL(DL_), TLI(TLI_) {}
46 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), PImpl(Arg.PImpl) {
51 AC = Arg.AC;
DemandedBits.h 42 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
43 F(F), AC(AC), DT(DT) {}
86 AssumptionCache &AC;
ValueTracking.h 60 AssumptionCache *AC = nullptr,
76 unsigned Depth = 0, AssumptionCache *AC = nullptr,
84 unsigned Depth = 0, AssumptionCache *AC = nullptr,
93 AssumptionCache *AC = nullptr,
108 AssumptionCache *AC = nullptr,
120 AssumptionCache *AC = nullptr,
134 AssumptionCache *AC = nullptr,
148 AssumptionCache *AC = nullptr,
156 AssumptionCache *AC = nullptr,
164 AssumptionCache *AC = nullptr
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/
Transformer.cpp 53 auto &AC = Iter->second;
57 AC.replace(*Result.SourceManager, T.Range, T.Replacement)) {
63 AC.addHeader(T.Replacement);
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.compile/
compile-cplus-member.cc 26 typedef enum {AA = 40, AB, AC, AD} ANON_E;
29 ANON_E g_e = AC;
68 if (g_e == AC) // +40
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.compile/
compile-cplus-member.cc 26 typedef enum {AA = 40, AB, AC, AD} ANON_E;
29 ANON_E g_e = AC;
68 if (g_e == AC) // +40
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/
InstCombiner.h 68 AssumptionCache &AC;
85 bool MinimizeSize, AAResults *AA, AssumptionCache &AC,
91 MinimizeSize(MinimizeSize), AA(AA), AC(AC), TLI(TLI), DT(DT), DL(DL),
92 SQ(DL, &TLI, &DT, &AC), ORE(ORE), BFI(BFI), PSI(PSI), LI(LI) {}
367 AssumptionCache &getAssumptionCache() const { return AC; }
458 llvm::computeKnownBits(V, Known, DL, Depth, &AC, CxtI, &DT);
463 return llvm::computeKnownBits(V, DL, Depth, &AC, CxtI, &DT);
469 return llvm::isKnownToBeAPowerOfTwo(V, DL, OrZero, Depth, &AC, CxtI, &DT);
474 return llvm::MaskedValueIsZero(V, Mask, DL, Depth, &AC, CxtI, &DT)
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/
ReachableCode.h 63 void FindUnreachableCode(AnalysisDeclContext &AC, Preprocessor &PP,
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Scalar/
AlignmentFromAssumptions.h 34 bool runImpl(Function &F, AssumptionCache &AC, ScalarEvolution *SE_,
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
InstSimplifyPass.cpp 107 AssumptionCache *AC =
112 const SimplifyQuery SQ(DL, TLI, DT, AC);
137 auto &AC = AM.getResult<AssumptionAnalysis>(F);
140 const SimplifyQuery SQ(DL, &TLI, &DT, &AC);

Completed in 87 milliseconds

1 2 3 4 5 6 7 8 9