/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonRemoveSZExtArgs.cpp | 71 Instruction* First = F.getEntryBlock().begin(); local 72 SI->insertBefore(First);
|
/external/clang/lib/AST/ |
H A D | DeclFriend.cpp | 68 Decl *First = data().FirstFriend.get(Source); local 69 return First ? cast<FriendDecl>(First) : 0;
|
H A D | TemplateBase.cpp | 390 bool First = true; local 393 if (First) 394 First = false;
|
H A D | APValue.cpp | 489 bool First = true; local 495 if (!First) 498 First = false; 503 if (!First) 508 First = false;
|
/external/clang/lib/Format/ |
H A D | TokenAnnotator.h | 42 : First(Line.Tokens.front()), Level(Line.Level), 47 FormatToken *Current = First; 58 FormatToken *First; member in class:clang::format::AnnotatedLine
|
/external/webrtc/src/system_wrappers/source/ |
H A D | map.cc | 58 while (Erase(First()) == 0) 74 MapItem* MapWrapper::First() const function in class:webrtc::MapWrapper
|
H A D | map_no_stl.cc | 59 if (First()) 63 while (Erase(First()) == 0) 117 MapNoStlItem* MapNoStl::First() const function in class:webrtc::MapNoStl
|
H A D | list_no_stl.cc | 63 while (Erase(First()) == 0) 121 ListItem* ListWrapper::First() const function in class:webrtc::ListWrapper
|
H A D | list_stl.cc | 56 while (Erase(First()) == 0) 119 ListItem* ListWrapper::First() const function in class:webrtc::ListWrapper
|
H A D | list_unittest.cc | 53 ListItem* First() const { function in class:ListWrapperSimple 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/chromium_org/third_party/libjingle/source/talk/base/ |
H A D | win32toolhelp.h | 28 // - implement bool First(HANDLE, T*) normally calls a 50 // Moves forward to the next object using the First and Next 51 // pointers. If either First or Next ever indicates an failure 63 incr_ok = Traits::First(snapshot_, ¤t_); 119 static bool First(HANDLE handle, Type* t) { function in class:talk_base::ToolhelpProcessTraits 143 static bool First(HANDLE handle, Type* t) { function in class:talk_base::ToolhelpModuleTraits
|
H A D | win32toolhelp_unittest.cc | 55 static bool First(HANDLE handle, TestData* d) { function in class:talk_base::Win32ToolhelpTest 153 static bool First(HANDLE handle, Type* t) { function in class:talk_base::TestTraits 154 return Win32ToolhelpTest::First(handle, t); 170 static bool First(HANDLE handle, Type* t) { function in class:talk_base::BadFirstTraits 189 static bool First(HANDLE handle, Type* t) { function in class:talk_base::BadNextTraits 190 return Win32ToolhelpTest::First(handle, t);
|
/external/clang/utils/TableGen/ |
H A D | ClangASTNodesEmitter.cpp | 80 Record *First = 0, *Last = 0; local 84 First = Last = Base; 106 if (!First && Result.first) 107 First = Result.first; 114 if (!First) 115 First = R; 122 if (First) { 128 OS << Base->getName() << ", " << First->getName() << ", " 132 return std::make_pair(First, Last); 145 << macroName(Root.getName()) << "_RANGE(Base, First, Las [all...] |
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | Store.h | 227 bool First; member in class:clang::ento::StoreManager::FindUniqueBinding 230 FindUniqueBinding(SymbolRef sym) : Sym(sym), Binding(0), First(true) {} 234 LLVM_EXPLICIT operator bool() { return First && Binding; }
|
/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
H A D | examples.cpp | 129 namespace First namespace in namespace:PR9668 145 typedef First::Bar<Second::Foo> Special; 148 First namespace in namespace:PR9668
|
/external/llvm/lib/CodeGen/ |
H A D | InterferenceCache.h | 34 SlotIndex First; member in struct:llvm::InterferenceCache::BlockInterference 207 return Current->First.isValid(); 213 return Current->First;
|
H A D | ExecutionDepsFix.cpp | 92 // First domain available. 416 bool First = LiveOuts.insert(std::make_pair(MBB, LiveRegs)).second; local 418 if (First) {
|
H A D | StackColoring.cpp | 735 // This is a simple greedy algorithm for merging allocas. First, sort the 759 LiveInterval *First = Intervals[FirstSlot]; local 761 assert (!First->empty() && !Second->empty() && "Found an empty range"); 764 if (!First->overlaps(*Second)) { 766 First->MergeRangesInAsValue(*Second, First->getValNumInfo(0));
|
/external/openfst/src/include/fst/ |
H A D | add-on.h | 84 A1 *First() const { return a1_; } function in class:fst::AddOnPair
|
/external/clang/include/clang/Lex/ |
H A D | PPCallbacks.h | 302 PPCallbacks *First, *Second; member in class:clang::PPChainedCallbacks 306 : First(_First), Second(_Second) {} 309 delete First; 315 First->FileChanged(Loc, Reason, FileType, PrevFID); 322 First->FileSkipped(ParentFile, FilenameTok, FileType); 328 return First->FileNotFound(FileName, RecoveryPath) || 341 First->InclusionDirective(HashLoc, IncludeTok, FileName, IsAngled, 352 First->moduleImport(ImportLoc, Path, Imported); 357 First->EndOfMainFile(); 362 First [all...] |
/external/clang/lib/Frontend/ |
H A D | InitHeaderSearch.cpp | 514 unsigned First, bool Verbose) { 519 for (unsigned i = First; i != SearchList.size(); ++i) { 513 RemoveDuplicates(std::vector<DirectoryLookup> &SearchList, unsigned First, bool Verbose) argument
|
/external/clang/lib/Lex/ |
H A D | PreprocessingRecord.cpp | 210 First = PreprocessedEntities.begin(); local 219 I = First; 223 First = I; 224 ++First; 230 return First - PreprocessedEntities.begin();
|
/external/clang/tools/driver/ |
H A D | cc1as_main.cpp | 196 bool First = true; local 198 ie = Args->filtered_end(); it != ie; ++it, First=false) { 200 if (First)
|
/external/llvm/utils/TableGen/ |
H A D | DAGISelMatcherEmitter.cpp | 530 unsigned First = E->getFirstResultSlot(); local 532 OS << " #" << First+i;
|
/external/clang/lib/Sema/ |
H A D | CodeCompleteConsumer.cpp | 299 bool First = true; local 301 if (First) 302 First = false;
|