HomeSort by: relevance | last modified time | path
    Searched defs:Entry (Results 1 - 25 of 250) sorted by relevancy

1 2 3 4 5 6 7 8 910

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonArch.h 30 auto Entry = ArchList.find(CPUString);
31 if (Entry != ArchList.end())
32 Res = Entry->second;
HexagonSelectionDAGInfo.cpp 35 TargetLowering::ArgListEntry Entry;
36 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
37 Entry.Node = Dst;
38 Args.push_back(Entry);
39 Entry.Node = Src;
40 Args.push_back(Entry);
41 Entry.Node = Size;
42 Args.push_back(Entry);
  /src/external/apache2/llvm/dist/llvm/lib/Target/XCore/
XCoreSelectionDAGInfo.cpp 28 TargetLowering::ArgListEntry Entry;
29 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
30 Entry.Node = Dst; Args.push_back(Entry);
31 Entry.Node = Src; Args.push_back(Entry);
32 Entry.Node = Size; Args.push_back(Entry);
  /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/LLJITWithOptimizingIRTransform/
LLJITWithOptimizingIRTransform.cpp 36 // It also contains an entry function which calls the factorial function with
40 // this into a non-recursive factorial function and an entry function that
47 entry:
51 if.then: ; preds = %entry
57 return: ; preds = %entry, %if.then
58 %final_result = phi i32 [ %result, %if.then ], [ 1, %entry ]
62 define i32 @entry() {
63 entry:
114 auto EntrySym = ExitOnErr(J->lookup("entry"));
115 auto *Entry = (int (*)())EntrySym.getAddress()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
LoopTraversal.cpp 28 MachineBasicBlock *Entry = &*MF.begin();
29 ReversePostOrderTraversal<MachineBasicBlock *> RPOT(Entry);
NonRelocatableStringpool.cpp 20 auto &Entry = I.first->second;
21 if (I.second || !Entry.isIndexed()) {
22 Entry.Index = NumEntries++;
23 Entry.Offset = CurrentEndOffset;
24 Entry.Symbol = nullptr;
31 DwarfStringPoolEntry Entry{nullptr, 0, DwarfStringPoolEntry::NotIndexed};
36 auto InsertResult = Strings.insert({S, Entry});
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/
DWARFDebugRangeList.cpp 38 RangeListEntry Entry;
39 Entry.SectionIndex = -1ULL;
42 Entry.StartAddress = data.getRelocatedAddress(offset_ptr);
43 Entry.EndAddress =
44 data.getRelocatedAddress(offset_ptr, &Entry.SectionIndex);
50 "invalid range list entry at offset 0x%" PRIx64,
53 if (Entry.isEndOfListEntry())
55 Entries.push_back(Entry);
74 // base address specifier entry - so use max-1.
88 // Base address of a range list entry is determined by the closest precedin
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Analysis/
CFGStmtMap.cpp 56 CFGBlock *&Entry = SM[CS->getStmt()];
57 // If 'Entry' is already initialized (e.g., a terminator was already),
59 if (Entry)
62 Entry = B;
  /src/external/apache2/llvm/dist/clang/lib/Frontend/Rewrite/
HTMLPrint.cpp 65 const FileEntry* Entry = R.getSourceMgr().getFileEntryForID(FID);
68 // there is no entry. Fall back to the memory buffer for a name in those
70 if (Entry)
71 Name = Entry->getName();
FixItRewriter.cpp 96 const FileEntry *Entry = Rewrite.getSourceMgr().getFileEntryForID(I->first);
99 FixItOpts->RewriteFilename(std::string(Entry->getName()), fd);
118 std::make_pair(std::string(Entry->getName()), Filename));
  /src/external/apache2/llvm/dist/clang/tools/diagtool/
ListWarnings.cpp 29 struct Entry {
33 Entry(llvm::StringRef diagN, llvm::StringRef flag)
36 bool operator<(const Entry &x) const { return DiagName < x.DiagName; }
40 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) {
41 for (const Entry &E : entries) {
50 std::vector<Entry> Flagged, Unflagged;
62 Entry entry(DR.getName(), DiagnosticIDs::getWarningOptionForDiag(diagID));
64 if (entry.Flag.empty())
65 Unflagged.push_back(entry);
    [all...]
  /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/LLJITWithLazyReexports/
LLJITWithLazyReexports.cpp 50 entry:
58 entry:
66 define i32 @entry(i32 %argc) {
67 entry:
72 if.then: ; preds = %entry
76 if.end: ; preds = %entry
155 auto EntrySym = ExitOnErr(J->lookup("entry"));
156 auto *Entry = (int (*)(int))EntrySym.getAddress();
158 int Result = Entry(argc);
160 << "entry(" << argc << ") = " << Result << "\n"
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
IndirectThunks.h 68 BasicBlock *Entry = BasicBlock::Create(Ctx, "entry", F);
69 IRBuilder<> Builder(Entry);
76 // A MachineBasicBlock must not be created for the Entry block; code
  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
PredIteratorCache.h 43 BasicBlock **&Entry = BlockToPredsMap[BB];
44 if (Entry)
45 return Entry;
52 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
53 std::copy(PredCache.begin(), PredCache.end(), Entry);
54 return Entry;
  /src/external/apache2/llvm/dist/llvm/lib/BinaryFormat/
AMDGPUMetadataVerifier.cpp 70 auto Entry = MapNode.find(Key);
71 if (Entry == MapNode.end())
73 return verifyNode(Entry->second);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
DwarfStringPool.cpp 28 auto &Entry = I.first->second;
30 Entry.Index = EntryTy::NotIndexed;
31 Entry.Offset = NumBytes;
32 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
61 // table. The header consists of an entry with the contribution's
95 for (const auto &Entry : Entries) {
96 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
97 "Mismatch between setting and entry");
101 Asm.OutStreamer->emitLabel(Entry->getValue().Symbol);
105 Twine(Entry->getValue().Offset))
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
DebugChecksumsSubsection.cpp 70 FileChecksumEntry Entry;
74 Entry.Checksum = makeArrayRef(Copy, Bytes.size());
77 Entry.FileNameOffset = Strings.insert(FileName);
78 Entry.Kind = Kind;
79 Checksums.push_back(Entry);
82 // of this checksum entry in the checksum buffer.
83 OffsetMap[Entry.FileNameOffset] = SerializedSize;
DebugInlineeLinesSubsection.cpp 70 // one header for each entry.
73 // If extra files are enabled, one count for each entry.
110 auto &Entry = Entries.back();
111 Entry.ExtraFiles.push_back(ulittle32_t(Offset));
121 auto &Entry = Entries.back();
122 Entry.Header.FileID = Offset;
123 Entry.Header.SourceLineNum = SourceLine;
124 Entry.Header.Inlinee = FuncId;
  /src/external/apache2/llvm/dist/llvm/lib/MCA/
Context.cpp 76 auto Entry = std::make_unique<EntryStage>(SrcMgr);
80 StagePipeline->appendStage(std::move(Entry));
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
AMDGPUMachineFunction.cpp 43 auto Entry = LocalMemoryObjects.insert(std::make_pair(&GV, 0));
44 if (!Entry.second)
45 return Entry.first->second;
55 Entry.first->second = Offset;
  /src/external/apache2/llvm/dist/llvm/lib/Target/WebAssembly/
WebAssemblyPrepareForLiveIntervals.cpp 82 MachineBasicBlock &Entry = *MF.begin();
92 // uses provide a definition. Insert IMPLICIT_DEFs in the entry block to
108 BuildMI(Entry, Entry.begin(), DebugLoc(),
113 // Move ARGUMENT_* instructions to the top of the entry block, so that their
115 for (auto MII = Entry.begin(), MIE = Entry.end(); MII != MIE;) {
119 Entry.insert(Entry.begin(), &MI);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
VPlanVerifier.cpp 96 const VPBlockBase *Entry = Region->getEntry();
99 // Entry and Exit shouldn't have any predecessor/successor, respectively.
100 assert(!Entry->getNumPredecessors() && "Region entry has predecessors.");
102 (void)Entry;
  /src/sys/external/bsd/gnu-efi/dist/inc/
efiui.h 22 entry contains all zeros.
54 UI_STRING_ENTRY *Entry;
  /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/LLJITWithObjectLinkingLayerPlugin/
LLJITWithObjectLinkingLayerPlugin.cpp 34 entry:
38 define i32 @entry() {
39 entry:
182 EntryPointName("entry", cl::desc("Symbol to call as main entry point"),
183 cl::init("entry"));
244 auto *Entry = (int (*)())EntrySym.getAddress();
246 int Result = Entry();
  /src/external/apache2/llvm/dist/llvm/examples/OrcV2Examples/LLJITWithTargetProcessControl/
LLJITWithTargetProcessControl.cpp 58 entry:
69 entry:
78 define i32 @entry(i32 %argc) {
79 entry:
84 if.then: ; preds = %entry
88 if.end: ; preds = %entry
188 auto EntrySym = ExitOnErr(J->lookup("entry"));
189 auto *Entry = (int (*)(int))EntrySym.getAddress();
191 int Result = Entry(argc);
193 << "entry(" << argc << ") = " << Result << "\n"
    [all...]

Completed in 25 milliseconds

1 2 3 4 5 6 7 8 910