| /external/llvm/lib/Target/Hexagon/ |
| HexagonRemoveSZExtArgs.cpp | 65 Instruction* First = F.getEntryBlock().begin();
66 SI->insertBefore(First);
|
| /external/webrtc/src/system_wrappers/source/ |
| map.cc | 58 while (Erase(First()) == 0)
74 MapItem* MapWrapper::First() const
|
| list_no_stl.cc | 63 while (Erase(First()) == 0)
121 ListItem* ListWrapper::First() const
|
| list_stl.cc | 56 while (Erase(First()) == 0)
119 ListItem* ListWrapper::First() const
|
| map_no_stl.cc | 59 if (First())
63 while (Erase(First()) == 0)
90 // 1. Item should be inserted first.
117 MapNoStlItem* MapNoStl::First() const
|
| list_unittest.cc | 53 ListItem* First() const {
54 return list_.First();
100 ListItem* list_item = list_wrapper->First();
103 list_item = list_wrapper->First();
209 return Erase(list_.First());
299 ListItem* list_item = list->First();
318 ListItem* lhs_item = lhs->First();
319 ListItem* rhs_item = rhs->First();
367 for (ListItem* item = list_to_reverse->First(); item != NULL;
379 EXPECT_EQ(1U, ascending_list->GetUnsignedItem(ascending_list->First()));
[all...] |
| /external/clang/include/clang/Lex/ |
| PPCallbacks.h | 235 PPCallbacks *First, *Second;
239 : First(_First), Second(_Second) {}
242 delete First;
248 First->FileChanged(Loc, Reason, FileType, PrevFID);
255 First->FileSkipped(ParentFile, FilenameTok, FileType);
261 return First->FileNotFound(FileName, RecoveryPath) ||
273 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, File,
280 First->EndOfMainFile();
285 First->Ident(Loc, str);
291 First->PragmaComment(Loc, Kind, Str)
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| Store.h | 222 bool First;
225 FindUniqueBinding(SymbolRef sym) : Sym(sym), Binding(0), First(true) {}
229 operator bool() { return First && Binding; }
|
| /external/clang/lib/AST/ |
| TemplateBase.cpp | 383 bool First = true;
386 if (First)
387 First = false;
|
| APValue.cpp | 453 bool First = true;
459 if (!First)
462 First = false;
467 if (!First)
472 First = false;
|
| StmtDumper.cpp | 35 /// the first few levels of an AST. This keeps track of how many ast levels
347 bool First = true;
351 if (!First)
360 First = false;
|
| /external/clang/lib/Lex/ |
| PreprocessingRecord.cpp | 58 return std::make_pair(iterator(this, CachedRangeQuery.Result.first),
68 return std::make_pair(iterator(this, Res.first), iterator(this, Res.second));
139 return std::make_pair(Local.first, Local.second);
145 if (Loaded.first == Loaded.second)
146 return std::make_pair(Local.first, Local.second);
151 if (Local.first == Local.second)
152 return std::make_pair(int(Loaded.first)-TotalLoaded,
156 return std::make_pair(int(Loaded.first)-TotalLoaded, Local.second);
211 First = PreprocessedEntities.begin();
217 // whether we get the first macro expansion or its containing macro
[all...] |
| /external/clang/utils/TableGen/ |
| ClangASTNodesEmitter.cpp | 70 // Returns the first and last non-abstract subrecords
80 Record *First = 0, *Last = 0;
84 First = Last = Base;
106 if (!First && Result.first)
107 First = Result.first;
114 if (!First)
115 First = R;
122 if (First) {
[all...] |
| /external/clang/lib/Sema/ |
| CodeCompleteConsumer.cpp | 300 bool First = true;
302 if (First)
303 First = false;
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| examples.cpp | 129 namespace First
145 typedef First::Bar<Second::Foo> Special;
148 First
277 template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
291 extern template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
298 extern template class BasicStringPiece<int>; // expected-note {{explicit instantiation first required here}}
|
| /external/clang/tools/driver/ |
| cc1as_main.cpp | 187 bool First = true;
189 ie = Args->filtered_end(); it != ie; ++it, First=false) {
191 if (First)
|
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 34 SlotIndex First;
207 return Current->First.isValid();
210 /// first - Return the starting index of the first interfering range in the
212 SlotIndex first() { function in class:llvm::InterferenceCache::Cursor
213 return Current->First;
|
| ExecutionDepsFix.cpp | 92 // First domain available.
140 /// The first instruction in each basic block is 0.
252 assert(LiveRegs && "Must enter basic block first.");
264 assert(LiveRegs && "Must enter basic block first.");
275 assert(LiveRegs && "Must enter basic block first.");
361 // Treat function live-ins as if they were defined just before the first
413 assert(LiveRegs && "Must enter basic block first.");
416 bool First = LiveOuts.insert(std::make_pair(MBB, LiveRegs)).second;
418 if (First) {
439 if (DomP.first) {
[all...] |
| StackColoring.cpp | 453 const MDNode *Var = VI->first;
456 if (SlotRemap.count(VP.first)) {
458 VP.first = SlotRemap[VP.first];
467 const Value *From = MFI->getObjectAllocation(it->first);
629 // This is a simple greedy algorithm for merging allocas. First, sort the
630 // slots, placing the largest slots first. Next, perform an n^2 scan and look
651 LiveInterval *First = Intervals[FirstSlot];
653 assert (!First->empty() && !Second->empty() && "Found an empty range");
656 if (!First->overlaps(*Second))
[all...] |
| TwoAddressInstructionPass.cpp | 485 // instruction if the first one is coalesced. So it would be profitable to
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelMatcherEmitter.cpp | 530 unsigned First = E->getFirstResultSlot();
532 OS << " #" << First+i;
616 PFsByName[I->first->getName()] = I->second;
657 // first argument.
668 OS << ", Result[NextRes+" << i << "].first";
688 Record *SDNode = Entry.first;
|
| /external/openfst/src/include/fst/ |
| add-on.h | 84 A1 *First() const { return a1_; }
|
| /external/clang/lib/Serialization/ |
| ASTWriterDecl.cpp | 838 while (Result.first != Result.second) {
839 Writer.GetDeclRef(*Result.first);
840 ++Result.first;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist.h | 117 ilist_iterator<NodeTy> /*first*/,
307 /// of the first node in the list always points to the last node in the list,
317 // back to the first node in the list (to preserve assertions about going off
470 // [first, last) into position.
472 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
473 assert(first != last && "Should be checked by callers");
476 // Note: we have to be careful about the case when we move the first node
483 // Remove [first, last) from its old position.
484 NodeTy *First = &*first, *Prev = this->getPrev(First)
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGBuilder.h | 242 First(F), Last(L), SValue(SV), HeaderBB(H), Emitted(E) {}
243 APInt First;
268 First(F), Range(R), SValue(SV), Reg(Rg), RegVT(RgVT), Emitted(E),
270 APInt First;
417 void UpdateSplitBlock(MachineBasicBlock *First, MachineBasicBlock *Last);
|
