Searched defs:Entry (Results 1 - 25 of 343) sorted by relevance

1234567891011>>

/external/skia/src/effects/gradients/
H A DSkGradientBitmapCache.cpp12 struct SkGradientBitmapCache::Entry { struct in class:SkGradientBitmapCache
13 Entry* fPrev;
14 Entry* fNext;
20 Entry(const void* buffer, size_t size, const SkBitmap& bm) function in struct:SkGradientBitmapCache::Entry
29 ~Entry() { sk_free(fBuffer); }
46 Entry* entry = fHead;
48 Entry* next = entry->fNext;
54 SkGradientBitmapCache::Entry* SkGradientBitmapCache::detach(Entry* entry) const {
72 void SkGradientBitmapCache::attachToHead(Entry* entr
[all...]
/external/clang/test/CodeGen/
H A Dpointer-signext.c26 MEMORY_MAP *Entry; local
30 Entry = CR (Link, MEMORY_MAP, Link);
31 return (int) Entry->Signature;
/external/deqp/framework/common/
H A DtcuFunctionLibrary.hpp54 struct Entry struct in class:tcu::StaticFunctionLibrary
60 StaticFunctionLibrary (const Entry* entries, int numEntries);
/external/dng_sdk/source/
H A Ddng_opcode_list.h94 dng_opcode & Entry (uint32 index) function in class:dng_opcode_list
102 const dng_opcode & Entry (uint32 index) const function in class:dng_opcode_list
/external/guava/guava/src/com/google/common/collect/
H A DFilteredEntrySetMultimap.java22 import java.util.Map.Entry;
34 FilteredEntrySetMultimap(SetMultimap<K, V> unfiltered, Predicate<? super Entry<K, V>> predicate) { argument
59 Set<Entry<K, V>> createEntries() {
64 public Set<Entry<K, V>> entries() {
65 return (Set<Entry<K, V>>) super.entries();
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java20 private static class Entry { class in class:IntQueue
21 private IntQueue.Entry next;
23 private Entry(int value) { method in class:IntQueue.Entry
27 private IntQueue.Entry head;
29 private IntQueue.Entry tail;
32 IntQueue.Entry entry = new Entry(value);
/external/libweave/src/
H A Daccess_black_list_manager.h16 struct Entry { struct in class:weave::AccessBlackListManager
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/include/llvm/DebugInfo/DWARF/
H A DDWARFCompileUnit.h23 const DWARFUnitIndex::Entry *Entry)
25 Entry) {}
19 DWARFCompileUnit(DWARFContext &Context, const DWARFSection &Section, const DWARFDebugAbbrev *DA, StringRef RS, StringRef SS, StringRef SOS, StringRef AOS, StringRef LS, bool LE, const DWARFUnitSectionBase &UnitSection, const DWARFUnitIndex::Entry *Entry) argument
H A DDWARFDebugMacro.h24 struct Entry { struct in class:llvm::DWARFDebugMacro
44 typedef SmallVector<Entry, 4> MacroList;
H A DDWARFDebugLoc.h23 struct Entry { struct in class:llvm::DWARFDebugLoc
38 SmallVector<Entry, 2> Entries;
60 struct Entry { struct in class:llvm::DWARFDebugLocDWO
68 SmallVector<Entry, 2> Entries;
H A DDWARFTypeUnit.h26 const DWARFUnitIndex::Entry *Entry)
28 Entry) {}
22 DWARFTypeUnit(DWARFContext &Context, const DWARFSection &Section, const DWARFDebugAbbrev *DA, StringRef RS, StringRef SS, StringRef SOS, StringRef AOS, StringRef LS, bool LE, const DWARFUnitSectionBase &UnitSection, const DWARFUnitIndex::Entry *Entry) argument
/external/llvm/include/llvm/IR/
H A DPredIteratorCache.h44 BasicBlock **&Entry = BlockToPredsMap[BB]; local
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/CodeGen/AsmPrinter/
H A DDwarfStringPool.cpp26 auto &Entry = I.first->second; local
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) &&
58 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol);
62 Twine(Entry->getValue().Offset));
64 StringRef(Entry
[all...]
/external/regex-re2/re2/
H A Dprefilter_tree.h59 // Each unique node has a corresponding Entry that helps in
61 struct Entry { struct in class:re2::PrefilterTree
107 vector<Entry> entries_;
/external/v8/src/profiler/
H A Dcircular-queue.h50 struct V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry {
51 Entry() : marker(kEmpty) {} function
56 Entry* Next(Entry* entry);
58 Entry buffer_[Length];
59 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* enqueue_pos_;
60 V8_ALIGNED(PROCESSOR_CACHE_LINE_SIZE) Entry* dequeue_pos_;
/external/clang/lib/Analysis/
H A DCFGStmtMap.cpp57 CFGBlock *&Entry = SM[CS->getStmt()]; local
58 // If 'Entry' is already initialized (e.g., a terminator was already),
60 if (Entry)
63 Entry = B;
/external/clang/lib/Frontend/Rewrite/
H A DHTMLPrint.cpp68 const FileEntry* Entry = R.getSourceMgr().getFileEntryForID(FID); local
73 if (Entry)
74 Name = Entry->getName();
/external/clang/lib/Index/
H A DSimpleFormatContext.h51 const FileEntry *Entry = Files.getFile(Name); local
52 assert(Entry != nullptr);
53 return Sources.createFileID(Entry, SourceLocation(), SrcMgr::C_User);
/external/clang/tools/diagtool/
H A DListWarnings.cpp31 struct Entry { struct in namespace:__anon3018
35 Entry(llvm::StringRef diagN, llvm::StringRef flag) function in struct:__anon3018::Entry
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(),
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DTestEnumMapGenerator.java25 import java.util.Map.Entry;
37 public SampleElements<Entry<AnEnum, String>> samples() {
38 return new SampleElements<Entry<AnEnum, String>>(
50 Entry<AnEnum, String>[] array = new Entry[entries.length];
54 Entry<AnEnum, String> e = (Entry<AnEnum, String>) o;
61 Entry<AnEnum, String>[] entries);
65 public final Entry<AnEnum, String>[] createArray(int length) {
66 return new Entry[lengt
60 create( Entry<AnEnum, String>[] entries) argument
[all...]
H A DTestStringMapGenerator.java23 import java.util.Map.Entry;
38 public SampleElements<Map.Entry<String, String>> samples() {
39 return new SampleElements<Map.Entry<String, String>>(
51 Entry<String, String>[] array = new Entry[entries.length];
55 Entry<String, String> e = (Entry<String, String>) o;
62 Entry<String, String>[] entries);
66 public final Entry<String, String>[] createArray(int length) {
67 return new Entry[lengt
61 create( Entry<String, String>[] entries) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DTestStringBiMapGenerator.java26 import java.util.Map.Entry;
42 public SampleElements<Map.Entry<String, String>> samples() {
43 return new SampleElements<Map.Entry<String, String>>(
55 Entry<String, String>[] array = new Entry[entries.length];
59 Entry<String, String> e = (Entry<String, String>) o;
66 Entry<String, String>[] entries);
70 public final Entry<String, String>[] createArray(int length) {
71 return new Entry[lengt
65 create( Entry<String, String>[] entries) argument
[all...]
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/html/table/
H A DSortIndex.java30 private class Entry implements Comparable<Entry> { class in class:SortIndex
36 Entry(final int idx, final T item) { method in class:SortIndex.Entry
41 public int compareTo(final Entry o) {
47 private final List<Entry> list = new ArrayList<Entry>();
71 final Entry entry = new Entry(idx++, i);
79 for (final Entry e : this.list) {
/external/llvm/include/llvm/ADT/
H A DUniqueVector.h42 unsigned insert(const T &Entry) { argument
44 unsigned &Val = Map[Entry];
53 Vector.push_back(Entry);
59 unsigned idFor(const T &Entry) const {
61 typename std::map<T, unsigned>::const_iterator MI = Map.find(Entry);
/external/llvm/lib/Target/Hexagon/
H A DHexagonSelectionDAGInfo.cpp39 TargetLowering::ArgListEntry Entry; local
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);

Completed in 790 milliseconds

1234567891011>>