| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 558 BasicBlock *BB = BasicBlock::Create(*Ctx, "entry", F);
709 BasicBlock *BB = BasicBlock::Create(*Ctx, "entry", WriteoutF);
759 BasicBlock *BB = BasicBlock::Create(*Ctx, "entry", Fn);
814 BasicBlock *Entry = BasicBlock::Create(*Ctx, "entry", FlushF);
820 IRBuilder<> Builder(Entry);
|
| /external/llvm/unittests/ExecutionEngine/JIT/ |
| JITTest.cpp | 43 BasicBlock *Entry = BasicBlock::Create(M->getContext(), "entry", F);
44 IRBuilder<> builder(Entry);
371 BasicBlock *Entry = BasicBlock::Create(Context, "entry", TestFunction);
372 IRBuilder<> Builder(Entry);
541 "entry: "
546 "entry:"
552 "entry:"
623 BasicBlock *Entry = BasicBlock::Create(Context, "entry", F)
[all...] |
| /external/okhttp/src/main/java/com/squareup/okhttp/internal/ |
| DiskLruCache.java | 49 * entry has a string key and a fixed number of values. Values are byte
65 * <p>Clients call {@link #edit} to create or update the values of an entry. An
66 * entry may have only one editor at one time; if a value is not available to be
69 * <li>When an entry is being <strong>created</strong> it is necessary to
72 * <li>When an entry is being <strong>edited</strong>, it is not necessary
80 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
122 // cache entry. Each line contains space-separated values: a state, a key,
124 // o DIRTY lines track that an entry is actively being created or updated.
128 // o CLEAN lines track a cache entry that has been successfully published
147 private final LinkedHashMap<String, Entry> lruEntries
276 Entry entry = lruEntries.get(key); local
302 Entry entry = i.next(); local
363 Entry entry = lruEntries.get(key); local
405 Entry entry = lruEntries.get(key); local
449 Entry entry = editor.entry; local
521 Entry entry = lruEntries.get(key); local
647 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /frameworks/compile/slang/BitWriter_2_9/ |
| BitcodeWriter.cpp | 297 // Emit an entry count so the reader can reserve space.
446 unsigned &Entry = SectionMap[GV->getSection()];
447 if (Entry != 0) continue;
450 Entry = SectionMap.size();
456 unsigned &Entry = SectionMap[F->getSection()];
457 if (!Entry) {
460 Entry = SectionMap.size();
465 unsigned &Entry = GCMap[F->getGC()];
466 if (!Entry) {
469 Entry = GCMap.size()
[all...] |
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| BitcodeWriter.cpp | 237 // Emit an entry count so the reader can reserve space.
400 unsigned &Entry = SectionMap[GV->getSection()];
401 if (Entry != 0) continue;
404 Entry = SectionMap.size();
410 unsigned &Entry = SectionMap[F->getSection()];
411 if (!Entry) {
414 Entry = SectionMap.size();
419 unsigned &Entry = GCMap[F->getGC()];
420 if (!Entry) {
423 Entry = GCMap.size()
[all...] |
| /frameworks/compile/slang/BitWriter_3_2/ |
| BitcodeWriter.cpp | 246 // Emit an entry count so the reader can reserve space.
419 unsigned &Entry = SectionMap[GV->getSection()];
420 if (!Entry) {
423 Entry = SectionMap.size();
431 unsigned &Entry = SectionMap[F->getSection()];
432 if (!Entry) {
435 Entry = SectionMap.size();
440 unsigned &Entry = GCMap[F->getGC()];
441 if (!Entry) {
444 Entry = GCMap.size()
[all...] |
| /libcore/luni/src/main/java/libcore/io/ |
| DiskLruCache.java | 48 * entry has a string key and a fixed number of values. Values are byte
64 * <p>Clients call {@link #edit} to create or update the values of an entry. An
65 * entry may have only one editor at one time; if a value is not available to be
68 * <li>When an entry is being <strong>created</strong> it is necessary to
71 * <li>When an entry is being <strong>edited</strong>, it is not necessary
79 * <p>Clients call {@link #get} to read a snapshot of an entry. The read will
122 * cache entry. Each line contains space-separated values: a state, a key,
124 * o DIRTY lines track that an entry is actively being created or updated.
128 * o CLEAN lines track a cache entry that has been successfully published
148 private final LinkedHashMap<String, Entry> lruEntrie
280 Entry entry = lruEntries.get(key); local
307 Entry entry = i.next(); local
374 Entry entry = lruEntries.get(key); local
418 Entry entry = lruEntries.get(key); local
464 Entry entry = editor.entry; local
537 Entry entry = lruEntries.get(key); local
677 private final Entry entry; field in class:DiskLruCache.Editor
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 999 /* cache entry. for simplicity, 'hash' and 'hlink' are inlined in this
1004 typedef struct Entry {
1006 struct Entry* hlink; /* next in collision chain */
1007 struct Entry* mru_prev;
1008 struct Entry* mru_next;
1014 time_t expires; /* time_t when the entry isn't valid any more */
1016 } Entry;
1116 entry_free( Entry* e )
1125 entry_mru_remove( Entry* e )
1132 entry_mru_add( Entry* e, Entry* list
[all...] |
| /external/chromium/chrome/browser/sync/syncable/ |
| syncable.cc | 65 // Max number of milliseconds to spend checking syncable entry invariants
96 // A ScopedIndexUpdater temporarily removes an entry from an index,
109 EntryKernel* entry,
111 : entry_(entry),
126 // The entry that was temporarily removed from the index.
134 void InitializeIndexEntry(EntryKernel* entry,
136 if (Indexer::ShouldInclude(entry)) {
137 index->insert(entry);
366 EntryKernel* entry = *it; local
367 InitializeIndexEntry<ParentIdAndHandleIndexer>(entry,
595 EntryKernel* entry = GetEntryByHandle(*i, &lock); local
655 EntryKernel* entry = (found == kernel_->metahandles_index->end() ? local
705 EntryKernel* entry = *it; local
1716 EntryKernel* entry = *candidate; local
1747 EntryKernel* entry = *candidate; local
[all...] |
| syncable.h | 44 class Entry;
46 std::ostream& operator<<(std::ostream& s, const Entry& e);
61 // Primary key into the table. Keep this as a handle to the meta entry
84 // entry is associated with. (such as bookmarks.js)
186 // Entry e = transaction.GetById(id);
188 // Entry e(transaction, GET_BY_ID, id);
191 // to enforce that an entry never outlived its transaction if there were a copy
222 // The EntryKernel class contains the actual data for an entry.
236 // Set the dirty bit, and optionally add this entry's metahandle to
238 // and will result only in setting the dirty bit of this entry
[all...] |
| /external/clang/include/clang/Basic/ |
| SourceManager.h | 100 /// \brief Reference to the file entry representing this ContentCache.
110 /// Can be different from 'Entry' if we overridden the contents of one file
128 /// When true, the original entry may be a virtual file that does not
432 /// \brief Read the source location entry with index ID, which will always be
436 /// entry from being loaded.
588 /// Positive FileIDs are indexes into this table. Entry 0 indicates an invalid
600 /// This is LocalSLocEntryTable.back().Offset + the size of that entry.
605 /// This is LoadedSLocEntryTable.back().Offset, except that that entry might
622 /// \brief A one-entry cache to speed up getFileID.
661 /// Return the cache entry for comparing the given file ID
[all...] |
| /external/clang/lib/AST/ |
| RecordLayoutBuilder.cpp | 2552 const CXXMethodDecl *&entry = KeyFunctions[RD]; local
[all...] |
| VTableBuilder.cpp | [all...] |
| /external/clang/lib/Basic/ |
| SourceManager.cpp | 107 // exists. Most likely, we were using a stat cache with an invalid entry but
112 // currently handle returning a null entry here. Ideally we should detect
136 // Check that the file's size is the same as in the file entry (which may
183 llvm::StringMapEntry<unsigned> &Entry =
185 if (Entry.getValue() != ~0U)
186 return Entry.getValue();
189 Entry.setValue(FilenamesByID.size());
190 FilenamesByID.push_back(&Entry);
225 /// presumed \#include stack. If it is 1, this is a file entry, if it is 2 then
260 /// FindNearestLineEntry - Find the line entry nearest to FID that is befor
[all...] |
| /external/clang/lib/Sema/ |
| SemaDeclObjC.cpp | [all...] |
| /external/clang/lib/Serialization/ |
| ASTReaderStmt.cpp | [all...] |
| /external/llvm/include/llvm/MC/ |
| MCAssembler.h | [all...] |
| /external/llvm/lib/Bitcode/Reader/ |
| BitcodeReader.cpp | 464 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
466 switch (Entry.Kind) {
479 switch (Stream.readRecord(Entry.ID, Record)) {
482 case bitc::PARAMATTR_CODE_ENTRY_OLD: { // ENTRY: [paramidx0, attr0, ...]
485 return Error("Invalid ENTRY record");
497 case bitc::PARAMATTR_CODE_ENTRY: { // ENTRY: [attrgrp0, attrgrp1, ...]
520 BitstreamEntry Entry = Stream.advanceSkippingSubblocks();
522 switch (Entry.Kind) {
535 switch (Stream.readRecord(Entry.ID, Record)) {
538 case bitc::PARAMATTR_GRP_CODE_ENTRY: { // ENTRY: [grpid, idx, a0, a1, ...
[all...] |
| /external/llvm/lib/Bitcode/Writer/ |
| BitcodeWriter.cpp | 290 // Emit an entry count so the reader can reserve space.
462 unsigned &Entry = SectionMap[GV->getSection()];
463 if (!Entry) {
466 Entry = SectionMap.size();
474 unsigned &Entry = SectionMap[F->getSection()];
475 if (!Entry) {
478 Entry = SectionMap.size();
483 unsigned &Entry = GCMap[F->getGC()];
484 if (!Entry) {
487 Entry = GCMap.size()
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfDebug.cpp | 125 Information Entry for the variable 'VarName'. 'VarName' will then
132 side, the Debug Information Entry for the variable VarName needs to
225 std::pair<MCSymbol*, unsigned> &Entry =
227 if (Entry.first) return Entry.first;
229 Entry.second = NextStringPoolNumber++;
230 return Entry.first = Asm->GetTempSymbol(StringPref, Entry.second);
234 std::pair<MCSymbol*, unsigned> &Entry =
236 if (Entry.first) return Entry.second
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| TargetLowering.cpp | 77 TargetLowering::ArgListEntry Entry;
79 Entry.Node = Ops[i];
80 Entry.Ty = Entry.Node.getValueType().getTypeForEVT(*DAG.getContext());
81 Entry.isSExt = isSigned;
82 Entry.isZExt = !isSigned;
83 Args.push_back(Entry);
200 /// getJumpTableEncoding - Return the entry encoding for a jump table in the
[all...] |
| /external/llvm/lib/IR/ |
| Constants.cpp | 316 /// getRelocationInfo - This method classifies the entry according to
317 /// whether or not it may generate a relocation entry. This must be
318 /// conservative, so if it might codegen to a relocatable entry, it should say
321 /// NoRelocation: This constant pool entry is guaranteed to never have a
324 /// LocalRelocation: This entry has relocations, but the entries are
327 /// GlobalRelocations: This entry may have arbitrary relocations.
[all...] |
| Verifier.cpp | 25 // * PHI nodes must have an entry for each predecessor, with no extras.
27 // * PHI nodes must have at least one entry
29 // * The entry node to a function must not have predecessors
[all...] |
| /external/llvm/lib/MC/ |
| ELFObjectWriter.cpp | 407 WriteWord(0); // e_entry, no entry point in .o file
418 Write16(0); // e_phentsize = prog header entry size
421 // e_shentsize = Section header entry size
574 // Write out the symbol table entry
590 // The first entry is the undefined symbol entry.
600 // Write out a symbol table entry for each regular section.
1065 ELFRelocationEntry entry = Relocs[e - i - 1]; local
[all...] |
| /external/llvm/lib/Target/XCore/ |
| XCoreISelLowering.cpp | 483 TargetLowering::ArgListEntry Entry;
485 Entry.Ty = IntPtrTy;
486 Entry.Node = BasePtr;
487 Args.push_back(Entry);
542 TargetLowering::ArgListEntry Entry;
544 Entry.Ty = IntPtrTy;
545 Entry.Node = BasePtr;
546 Args.push_back(Entry);
548 Entry.Node = Value;
549 Args.push_back(Entry);
[all...] |
