HomeSort by relevance Sort by last modified time
    Searched defs:Entry (Results 1 - 25 of 774) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/lib/CodeGen/AsmPrinter/
DwarfStringPool.cpp 26 auto &Entry = I.first->second;
27 Entry.Index = Pool.size() - 1;
28 Entry.Offset = NumBytes;
29 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr;
32 assert(NumBytes > Entry.Offset && "Unexpected overflow");
52 for (const auto &Entry : Entries) {
53 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) &&
54 "Mismatch between setting and entry");
58 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol);
62 Twine(Entry->getValue().Offset))
    [all...]
  /external/llvm/lib/Target/XCore/
XCoreSelectionDAGInfo.cpp 32 TargetLowering::ArgListEntry Entry;
33 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
34 Entry.Node = Dst; Args.push_back(Entry);
35 Entry.Node = Src; Args.push_back(Entry);
36 Entry.Node = Size; Args.push_back(Entry);
  /system/keymaster/
operation_table.cpp 28 OperationTable::Entry::~Entry() {
37 table_.reset(new (std::nothrow) Entry[table_size_]);
operation_table.h 32 struct Entry {
33 Entry() {
37 ~Entry();
47 UniquePtr<Entry[]> table_;
  /external/clang/test/CodeGen/
pointer-signext.c 26 MEMORY_MAP *Entry;
30 Entry = CR (Link, MEMORY_MAP, Link);
31 return (int) Entry->Signature;
  /external/libweave/src/
access_black_list_manager.h 16 struct Entry {
38 virtual std::vector<Entry> GetEntries() const = 0;
43 inline bool operator==(const AccessBlackListManager::Entry& l,
44 const AccessBlackListManager::Entry& r) {
49 inline bool operator!=(const AccessBlackListManager::Entry& l,
50 const AccessBlackListManager::Entry& r) {
  /external/llvm/lib/Target/Hexagon/
HexagonSelectionDAGInfo.cpp 39 TargetLowering::ArgListEntry Entry;
40 Entry.Ty = DAG.getDataLayout().getIntPtrType(*DAG.getContext());
41 Entry.Node = Dst;
42 Args.push_back(Entry);
43 Entry.Node = Src;
44 Args.push_back(Entry);
45 Entry.Node = Size;
46 Args.push_back(Entry);
  /frameworks/base/core/java/com/android/internal/os/
KernelWakelockStats.java 23 public class KernelWakelockStats extends HashMap<String, KernelWakelockStats.Entry> {
24 public static class Entry {
29 Entry(int count, long totalTime, int version) {
  /frameworks/base/libs/hwui/
LayerUpdateQueue.h 34 struct Entry {
35 Entry(RenderNode* renderNode, const Rect& damage)
45 const std::vector<Entry>& entries() const { return mEntries; }
47 std::vector<Entry> mEntries;
AssetAtlas.h 46 * Entry representing the texture and uvMapper of a PixelRef in the
49 class Entry {
53 * this entry belongs to. This texture should never be
60 * correct range to sample this entry from the atlas.
72 ~Entry() {
78 * The pixel ref that generated this atlas entry.
83 * Atlas this entry belongs to.
87 Entry(SkPixelRef* pixelRef, Texture* texture, const UvMapper& mapper,
148 * Returns the entry in the atlas associated with the specified
151 Entry* getEntry(const SkPixelRef* pixelRef) const
    [all...]
  /external/skia/src/effects/gradients/
SkGradientBitmapCache.cpp 12 struct SkGradientBitmapCache::Entry {
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm)
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead; local
47 while (entry) {
48 Entry* next = entry->fNext
86 Entry* entry = fHead; local
111 Entry* entry = new Entry(buffer, len, bm); local
133 Entry* entry = fHead; local
    [all...]
  /frameworks/compile/mclinker/include/mcld/Target/
GOT.h 34 class Entry : public TargetFragment {
39 Entry(uint64_t pValue, SectionData* pParent)
42 virtual ~Entry() {}
PLT.h 22 * \brief PLTEntryDefaultBase provides the default interface for PLT Entry
51 class Entry : public EntryBase {
56 explicit Entry(SectionData& pParent) : EntryBase(pParent) {}
58 virtual ~Entry() {}
  /external/clang/lib/Analysis/
CFGStmtMap.cpp 57 CFGBlock *&Entry = SM[CS->getStmt()];
58 // If 'Entry' is already initialized (e.g., a terminator was already),
60 if (Entry)
63 Entry = B;
  /external/clang/lib/Frontend/Rewrite/
HTMLPrint.cpp 68 const FileEntry* Entry = R.getSourceMgr().getFileEntryForID(FID);
71 // there is no entry. Fall back to the memory buffer for a name in those
73 if (Entry)
74 Name = Entry->getName();
  /external/clang/lib/Index/
SimpleFormatContext.h 51 const FileEntry *Entry = Files.getFile(Name);
52 assert(Entry != nullptr);
53 return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);
  /external/clang/tools/diagtool/
ListWarnings.cpp 31 struct Entry {
35 Entry(llvm::StringRef diagN, llvm::StringRef flag)
38 bool operator<(const Entry &x) const { return DiagName < x.DiagName; }
42 static void printEntries(std::vector<Entry> &entries, llvm::raw_ostream &out) {
43 for (std::vector<Entry>::iterator it = entries.begin(), ei = entries.end();
53 std::vector<Entry> Flagged, Unflagged;
69 Entry entry(di->getName(),
72 if (entry.Flag.empty())
73 Unflagged.push_back(entry);
    [all...]
  /external/deqp/framework/common/
tcuFunctionLibrary.hpp 54 struct Entry
60 StaticFunctionLibrary (const Entry* entries, int numEntries);
  /external/dng_sdk/source/
dng_opcode_list.h 94 dng_opcode & Entry (uint32 index)
102 const dng_opcode & Entry (uint32 index) const
  /external/javassist/src/main/javassist/bytecode/analysis/
IntQueue.java 20 private static class Entry {
21 private IntQueue.Entry next;
23 private Entry(int value) {
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value); local
34 tail.next = entry;
35 tail = entry;
    [all...]
  /external/llvm/include/llvm/DebugInfo/DWARF/
DWARFDebugLoc.h 23 struct Entry {
38 SmallVector<Entry, 2> Entries;
60 struct Entry {
68 SmallVector<Entry, 2> Entries;
DWARFDebugMacro.h 23 /// A single macro entry within a macro list.
24 struct Entry {
25 /// The type of the macro entry.
35 /// The string (name, value) of the macro entry.
44 typedef SmallVector<Entry, 4> MacroList;
  /external/llvm/include/llvm/IR/
PredIteratorCache.h 44 BasicBlock **&Entry = BlockToPredsMap[BB];
45 if (Entry)
46 return Entry;
53 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
54 std::copy(PredCache.begin(), PredCache.end(), Entry);
55 return Entry;
  /external/llvm/lib/Target/AArch64/
AArch64SelectionDAGInfo.cpp 23 // Check to see if there is a specialized entry-point for memory zeroing.
38 TargetLowering::ArgListEntry Entry;
39 Entry.Node = Dst;
40 Entry.Ty = IntPtrTy;
41 Args.push_back(Entry);
42 Entry.Node = Size;
43 Args.push_back(Entry);
  /external/regex-re2/re2/
prefilter_tree.h 59 // Each unique node has a corresponding Entry that helps in
61 struct Entry {
107 vector<Entry> entries_;
119 // Atom index in returned strings to entry id mapping.

Completed in 1985 milliseconds

1 2 3 4 5 6 7 8 91011>>