Home
last modified time | relevance | path

Searched refs:AG (Results 1 – 25 of 363) sorted by relevance

12345678910>>...15

/external/llvm-project/llvm/test/CodeGen/SystemZ/
Dmverify-optypes.mir27 %3:addr64bit = AG %3, %1, 0, %2, implicit-def dead $cc
28 %3:addr64bit = AG %3, %1, %0, %2, implicit-def dead $cc
29 %3:addr64bit = AG %3, %1, 0, 2, implicit-def dead $cc
56 # CHECK: - instruction: %3:addr64bit = AG %3:addr64bit(tied-def 0), %1:addr64bit, %0:gr64bit, %2:ad…
59 # CHECK: - instruction: %3:addr64bit = AG %3:addr64bit(tied-def 0), %1:addr64bit, 0, 2, implicit-de…
Dint-add-05.ll17 ; Check AG with no displacement.
27 ; Check the high end of the aligned AG range.
51 ; Check the high end of the negative aligned AG range.
62 ; Check the low end of the AG range.
86 ; Check that AG allows an index.
99 ; Check that additions of spilled values can use AG rather than AGR.
Dint-sadd-03.ll65 ; Check AG with no displacement.
82 ; Check the high end of the aligned AG range.
120 ; Check the high end of the negative aligned AG range.
138 ; Check the low end of the AG range.
176 ; Check that AG allows an index.
196 ; Check that additions of spilled values can use AG rather than AGR.
Dtls-01.ll9 ; matter whether we use LARL/AG or LGRL/AGR for the last part.
/external/rust/crates/chrono/src/naive/
Dinternals.rs42 pub const AG: YearFlags = YearFlags(0o05); constant
57 BA, G, F, E, DC, B, A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA,
58 G, F, E, DC, B, A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G,
59 F, E, DC, B, A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G, F,
60 E, DC, B, A, G, FE, D, C, B, AG, F, E, D, // 100
61 C, B, A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G, F, E, DC,
62 B, A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G, F, E, DC, B,
63 A, G, FE, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G, F, E, DC, B, A,
64 G, FE, D, C, B, AG, F, E, D, CB, A, G, F, // 200
65 E, D, C, B, AG, F, E, D, CB, A, G, F, ED, C, B, A, GF, E, D, C, BA, G, F, E, DC, B, A, G, FE,
[all …]
/external/llvm/test/CodeGen/SystemZ/
Dint-add-05.ll17 ; Check AG with no displacement.
27 ; Check the high end of the aligned AG range.
51 ; Check the high end of the negative aligned AG range.
62 ; Check the low end of the AG range.
86 ; Check that AG allows an index.
99 ; Check that additions of spilled values can use AG rather than AGR.
Dtls-01.ll9 ; matter whether we use LARL/AG or LGRL/AGR for the last part.
/external/llvm-project/llvm/unittests/Transforms/IPO/
DAttributorTest.cpp36 AnalysisGetter AG; in TEST_F() local
42 InformationCache InfoCache(M, AG, Allocator, nullptr); in TEST_F()
/external/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp347 static NodeType *getEntryNode(ArgumentGraph *AG) { in getEntryNode()
348 return AG->getEntryNode(); in getEntryNode()
350 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
351 return AG->begin(); in nodes_begin()
353 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
490 ArgumentGraph AG; in addArgumentAttrs() local
538 ArgumentGraphNode *Node = AG[&*A]; in addArgumentAttrs()
540 Node->Uses.push_back(AG[Use]); in addArgumentAttrs()
574 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp433 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
435 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
436 return AG->begin(); in nodes_begin()
439 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
688 ArgumentGraph AG; in addArgumentAttrs() local
734 ArgumentGraphNode *Node = AG[&*A]; in addArgumentAttrs()
736 Node->Uses.push_back(AG[Use]); in addArgumentAttrs()
765 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
/external/llvm-project/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp434 static NodeRef getEntryNode(ArgumentGraph *AG) { return AG->getEntryNode(); } in getEntryNode()
436 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin()
437 return AG->begin(); in nodes_begin()
440 static ChildIteratorType nodes_end(ArgumentGraph *AG) { return AG->end(); } in nodes_end()
689 ArgumentGraph AG; in addArgumentAttrs() local
735 ArgumentGraphNode *Node = AG[&*A]; in addArgumentAttrs()
737 Node->Uses.push_back(AG[Use]); in addArgumentAttrs()
766 for (scc_iterator<ArgumentGraph *> I = scc_begin(&AG); !I.isAtEnd(); ++I) { in addArgumentAttrs()
DAttributor.cpp1913 return AG.getAnalysis<AAManager>(F); in getAAResultsForFunction()
2277 AnalysisGetter &AG, in runAttributorOnFunctions() argument
2381 AnalysisGetter AG(FAM); in run() local
2389 InformationCache InfoCache(M, AG, Allocator, /* CGSCC */ nullptr); in run()
2390 if (runAttributorOnFunctions(InfoCache, Functions, AG, CGUpdater)) { in run()
2403 AnalysisGetter AG(FAM); in run() local
2416 InformationCache InfoCache(M, AG, Allocator, /* CGSCC */ &Functions); in run()
2417 if (runAttributorOnFunctions(InfoCache, Functions, AG, CGUpdater)) { in run()
2484 AnalysisGetter AG; in runOnModule() local
2491 InformationCache InfoCache(M, AG, Allocator, /* CGSCC */ nullptr); in runOnModule()
[all …]
/external/icu/icu4c/source/data/region/
Dzh_Hant_HK.txt11 AG{"安提瓜和巴布達"}
Dfa_AF.txt7 AG{"انتیگوا و باربودا"}
Dnus.txt8 AG{"Antiguaa kɛnɛ Barbuda"}
Dyi.txt30 AG{"אַנטיגוע און באַרבודע"}
Dzgh.txt9 AG{"ⴰⵏⵜⵉⴳⴰ ⴷ ⴱⵔⴱⵓⴷⴰ"}
/external/mp4parser/
DNOTICE8 CoreMedia AG (http://www.coremedia.com/).
/external/mp4parser/isoparser/src/main/resources/
DNOTICE.txt8 CoreMedia AG (http://www.coremedia.com/).
/external/ipsec-tools/
DREADME31 SUSE Linux AG, see http://www.suse.com/
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DLoopInfo.cpp567 auto ContainsAccessGroup = [&ParallelAccessGroups](MDNode *AG) -> bool { in isAnnotatedParallel() argument
568 if (AG->getNumOperands() == 0) { in isAnnotatedParallel()
569 assert(isValidAsAccessGroup(AG) && "Item must be an access group"); in isAnnotatedParallel()
570 return ParallelAccessGroups.count(AG); in isAnnotatedParallel()
573 for (const MDOperand &AccessListItem : AG->operands()) { in isAnnotatedParallel()
/external/llvm-project/llvm/lib/Analysis/
DLoopInfo.cpp589 auto ContainsAccessGroup = [&ParallelAccessGroups](MDNode *AG) -> bool { in isAnnotatedParallel() argument
590 if (AG->getNumOperands() == 0) { in isAnnotatedParallel()
591 assert(isValidAsAccessGroup(AG) && "Item must be an access group"); in isAnnotatedParallel()
592 return ParallelAccessGroups.count(AG); in isAnnotatedParallel()
595 for (const MDOperand &AccessListItem : AG->operands()) { in isAnnotatedParallel()
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Transforms/IPO/
DAttributor.h564 InformationCache(const Module &M, AnalysisGetter &AG)
565 : DL(M.getDataLayout()), Explorer(/* ExploreInterBlock */ true), AG(AG) {
567 CallGraph *CG = AG.getAnalysis<CallGraphAnalysis>(M);
603 return AG.getAnalysis<TargetLibraryAnalysis>(F);
608 return AG.getAnalysis<AAManager>(F);
614 return AG.getAnalysis<AP>(F);
648 AnalysisGetter &AG;
/external/llvm-project/llvm/include/llvm/Transforms/IPO/
DAttributor.h749 InformationCache(const Module &M, AnalysisGetter &AG,
756 [&](const Function &F) { return AG.getAnalysis<LoopAnalysis>(F); },
759 return AG.getAnalysis<DominatorTreeAnalysis>(F);
763 return AG.getAnalysis<PostDominatorTreeAnalysis>(F);
765 AG(AG), CGSCC(CGSCC) {
863 return AG.getAnalysis<TargetLibraryAnalysis>(F);
879 return AG.getAnalysis<AP>(F);
904 &From, &To, nullptr, AG.getAnalysis<DominatorTreeAnalysis>(F),
905 AG.getAnalysis<LoopAnalysis>(F));
966 AnalysisGetter &AG;
/external/cldr/tools/java/org/unicode/cldr/util/data/external/
Dalternate_locode_name.txt18 AGSJO ; St. John's # AG : Antigua and Barbuda

12345678910>>...15