| /external/chromium_org/third_party/protobuf/java/src/main/java/com/google/protobuf/ |
| SmallSortedMap.java | 50 * corresponding {@code Entry}s without the need to create an Iterator. The
58 * for (Map.Entry<K, V> entry : fieldMap.getOverflowEntries()) {
59 * process(entry);
94 * @param arraySize The size of the entry array containing the
106 final Map.Entry<FieldDescriptorType, Object> entry =
108 if (entry.getKey().isRepeated()) {
109 final List value = (List) entry.getValue();
110 entry.setValue(Collections.unmodifiableList(value))
490 final Map.Entry<K, V> entry = (Map.Entry<K, V>) o; local
514 final Map.Entry<K, V> entry = (Map.Entry<K, V>) o; local
[all...] |
| /external/clang/lib/AST/ |
| DeclTemplate.cpp | 171 EntryType *Entry = Specs.FindNodeOrInsertPos(ID, InsertPos);
172 return Entry ? SETraits::getMostRecentDecl(Entry) : 0;
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 187 IncludeStackInfo &Entry = IncludeMacroStack[i-1];
188 if (Entry.TheLexer)
189 Val = Entry.TheLexer->isNextPPTokenLParen();
190 else if (Entry.ThePTHLexer)
191 Val = Entry.ThePTHLexer->isNextPPTokenLParen();
193 Val = Entry.TheTokenLexer->isNextTokenLParen();
199 if (Entry.ThePPLexer)
[all...] |
| /external/clang/lib/Rewrite/Core/ |
| Rewriter.cpp | 480 const FileEntry *Entry =
482 AtomicallyMovedFile File(getSourceMgr().getDiagnostics(), Entry->getName(),
|
| /external/clang/lib/Sema/ |
| JumpDiagnostics.cpp | 90 // Add a scope entry for function scope.
575 IndirectGotoStmt *&Entry = JumpScopesMap[IGScope];
576 if (!Entry) Entry = IG;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| HTMLDiagnostics.cpp | 155 const FileEntry* Entry = SMgr.getFileEntryForID(FID);
163 if (llvm::sys::path::is_relative(Entry->getName())) {
178 << html::EscapeText(Entry->getName())
218 os << "\n<!-- BUGFILE " << DirName << Entry->getName() << " -->\n";
235 html::AddHeaderFooterInternalBuiltinCSS(R, FID, Entry->getName());
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| UnmodifiableCollectionTests.java | 36 import java.util.Map.Entry;
48 public static void assertMapEntryIsUnmodifiable(Entry<?, ?> entry) {
50 entry.setValue(null);
51 fail("setValue on unmodifiable Map.Entry succeeded");
236 multiset.entrySet(), new Multiset.Entry<E>() {
271 List<Entry<K, V>> originalEntries =
308 // Iterate over every element in the entry set
309 for (Entry<K, V> entry : multimap.entries())
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| AliasSetTracker.h | 251 void addPointer(AliasSetTracker &AST, PointerRec &Entry, uint64_t Size,
260 --i; --e; // Revisit the moved entry.
408 // entry for the pointer if it doesn't already exist.
410 AliasSet::PointerRec *&Entry = PointerMap[ASTCallbackVH(V, this)];
411 if (Entry == 0)
412 Entry = new AliasSet::PointerRec(V);
413 return *Entry;
|
| MemoryDependenceAnalysis.h | 171 /// removed from MemDep. In either case, the entry may include an
188 /// NonLocalDepEntry - This is an entry in the NonLocalDepInfo cache. For
189 /// each BasicBlock (the BB entry) it keeps a MemDepResult.
213 /// For each BasicBlock (the BB entry) it keeps a MemDepResult and the
216 NonLocalDepEntry Entry;
220 : Entry(bb, result), Address(address) {}
223 BasicBlock *getBB() const { return Entry.getBB(); }
226 Entry.setResult(R);
230 const MemDepResult &getResult() const { return Entry.getResult(); }
|
| /external/llvm/lib/AsmParser/ |
| LLParser.cpp | 368 std::pair<Type*, LocTy> &Entry = NumberedTypes[TypeID];
369 if (Entry.first)
371 Entry.first = Result;
372 Entry.second = SMLoc();
395 std::pair<Type*, LocTy> &Entry = NamedTypes[Name];
396 if (Entry.first)
398 Entry.first = Result;
399 Entry.second = SMLoc();
666 // See if this was a redefinition. If so, there is no entry in
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DIE.h | 106 /// DIE - A structured debug information entry. Has an abbreviation which
189 /// DIEValue - A debug information entry value.
383 /// DIEEntry - A pointer to another debug information entry. An instance of
384 /// this class can also be used as a proxy for a debug information entry not
387 DIE *const Entry;
389 explicit DIEEntry(DIE *E) : DIEValue(isEntry), Entry(E) {
393 DIE *getEntry() const { return Entry; }
395 /// EmitValue - Emit debug information entry offset.
399 /// SizeOf - Determine size of debug information entry in bytes.
406 /// Returns size of a ref_addr entry
[all...] |
| /external/llvm/lib/CodeGen/ |
| ExecutionDepsFix.cpp | 354 // This is the entry block.
366 DEBUG(dbgs() << "BB#" << MBB->getNumber() << ": entry\n");
677 MachineBasicBlock *Entry = MF->begin();
678 ReversePostOrderTraversal<MachineBasicBlock*> RPOT(Entry);
|
| LiveVariables.cpp | 102 VRInfo.Kills.erase(VRInfo.Kills.begin()+i); // Erase entry
149 assert(VRInfo.Kills[i]->getParent() != MBB && "entry should be at end!");
170 // Add a new kill entry for this basic block. If this virtual register is
525 MachineBasicBlock *Entry = MF->begin();
529 DFI = df_ext_begin(Entry, Visited), E = df_ext_end(Entry, Visited);
|
| MachineModuleInfo.cpp | 103 AddrLabelSymEntry &Entry = AddrLabelSymbols[BB];
105 // If we already had an entry for this block, just return it.
106 if (!Entry.Symbols.isNull()) {
107 assert(BB->getParent() == Entry.Fn && "Parent changed");
108 if (Entry.Symbols.is<MCSymbol*>())
109 return Entry.Symbols.get<MCSymbol*>();
110 return (*Entry.Symbols.get<std::vector<MCSymbol*>*>())[0];
113 // Otherwise, this is a new entry, create a new symbol for it and add an
114 // entry to BBCallbacks so we can be notified if the BB is deleted or RAUWd.
117 Entry.Index = BBCallbacks.size()-1
[all...] |
| PrologEpilogInserter.cpp | 100 // entry block, all restores in return blocks.
590 std::pair<int, int64_t> Entry = MFI->getLocalFrameObjectMap(i);
591 int64_t FIOffset = (StackGrowsDown ? -Offset : Offset) + Entry.second;
592 DEBUG(dbgs() << "alloc FI(" << Entry.first << ") at SP[" <<
594 MFI->setObjectOffset(Entry.first, FIOffset);
662 // immediately on entry to the current function, count it as part of the
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.cpp | 176 /// run - This is the main entry point for the type legalizer. This does a
770 std::pair<SDValue, SDValue> &Entry = ExpandedIntegers[Op];
771 RemapValue(Entry.first);
772 RemapValue(Entry.second);
773 assert(Entry.first.getNode() && "Operand isn't expanded");
774 Lo = Entry.first;
775 Hi = Entry.second;
789 std::pair<SDValue, SDValue> &Entry = ExpandedIntegers[Op];
790 assert(Entry.first.getNode() == 0 && "Node already expanded");
791 Entry.first = Lo
[all...] |
| /external/llvm/lib/IR/ |
| Metadata.cpp | 40 StringMapEntry<Value*> &Entry =
42 Value *&S = Entry.getValue();
44 S->setValueName(&Entry);
625 // Common case is removing the only entry.
637 assert(!Info.empty() && "Removing last entry should be handled above");
640 // Otherwise, removing an entry that doesn't exist on the instruction.
|
| /external/llvm/lib/Support/ |
| YAMLTraits.cpp | 290 HNode *Entry = this->createHNodes(i);
293 SQHNode->Entries.push_back(Entry);
|
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 733 // Find all of the alloca'd pointers in the entry block.
734 BasicBlock *Entry = BB.getParent()->begin();
735 for (BasicBlock::iterator I = Entry->begin(), E = Entry->end(); I != E; ++I) {
|
| /external/llvm/tools/yaml2obj/ |
| yaml2elf.cpp | 48 StringMapEntry<unsigned> &Entry = StringIndices.GetOrCreateValue(S);
49 unsigned &I = Entry.getValue();
104 StringMapEntry<int> &Entry = Map.GetOrCreateValue(SecName, -1);
105 if (Entry.getValue() != -1)
107 Entry.setValue((int)i);
264 Header.e_entry = Hdr.Entry;
275 // - SHT_NULL entry (placed first, i.e. 0'th entry)
294 // "+ 1" to take into account the SHT_NULL entry.
307 // Ensure SHN_UNDEF entry is present. An all-zero section header is
[all...] |
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
| AbstractSampleEncryptionBox.java | 27 List<Entry> entries = new LinkedList<Entry>();
65 Entry e = new Entry();
70 e.pairs = new LinkedList<Entry.Pair>();
85 public List<Entry> getEntries() {
89 public void setEntries(List<Entry> entries) {
152 for (Entry entry : entries) {
155 System.arraycopy(entry.iv, 0, ivFull, ivSize - entry.iv.length, entry.iv.length)
274 Entry entry = (Entry) o; local
[all...] |