/external/chromium_org/third_party/sqlite/src/contrib/ |
H A D | sqlitecon.tcl | 120 bind Sqlitecon <Down> {sqlitecon::Next %W} 121 bind Sqlitecon <Control-n> {sqlitecon::Next %W} 411 proc sqlitecon::Next w {
|
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | pagemap.h | 114 void* Next(Number k) const { function in class:TCMalloc_PageMap1 309 void* Next(Number k) const { function in class:TCMalloc_PageMap1_LazyCommit 390 void* Next(Number k) const { function in class:TCMalloc_PageMap2 502 void* Next(Number k) const { function in class:TCMalloc_PageMap3
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | thread_cache.h | 207 void* Next() { function in class:tcmalloc::ThreadCache::FreeList 355 ASSERT(ptr != list->Next());
|
/external/chromium_org/third_party/webrtc/base/ |
H A D | fileutils.cc | 35 // to the first file in the directory, and can be advanecd with Next(). This 88 bool DirectoryIterator::Next() { function in class:rtc::DirectoryIterator 176 } while (di->Next()); 205 } while (di->Next());
|
H A D | win32toolhelp_unittest.cc | 54 static bool Next(HANDLE handle, TestData* d) { function in class:rtc::Win32ToolhelpTest 140 static bool Next(HANDLE handle, Type* t) { function in class:rtc::TestTraits 141 return Win32ToolhelpTest::Next(handle, t); 157 static bool Next(HANDLE handle, Type* t) { function in class:rtc::BadFirstTraits 176 static bool Next(HANDLE handle, Type* t) { function in class:rtc::BadNextTraits 194 EXPECT_FALSE(t.Next()); 198 // Tests that Next() returns false if the first-pointer 205 EXPECT_FALSE(t->Next()); 206 EXPECT_FALSE(t->Next()); 207 EXPECT_FALSE(t->Next()); [all...] |
/external/chromium_org/v8/src/ |
H A D | hashmap.h | 70 // for (Entry* p = map.Start(); p != NULL; p = map.Next(p)) { 75 // calling Next() is undefined. 77 Entry* Next(Entry* p) const; 220 return Next(map_ - 1); 226 TemplateHashMapImpl<AllocationPolicy>::Next(Entry* p) const { function in class:v8::TemplateHashMapImpl 311 entry_ = map_->Next(entry_);
|
H A D | lookup.cc | 16 void LookupIterator::Next() { function in class:v8::internal::LookupIterator
|
H A D | v8threads.cc | 232 return in_use_anchor_->Next(); 236 ThreadState* ThreadState::Next() { function in class:v8::internal::ThreadState 333 state = state->Next()) { 345 state = state->Next()) { 361 state = state->Next()) {
|
/external/chromium_org/v8/tools/ |
H A D | lexer-shell.cc | 95 Token::Value Next(int* beg_pos, int* end_pos) { function in class:BaselineScanner 96 Token::Value res = scanner_->Next(); 140 token = scanner.Next(&beg, &end);
|
/external/clang/include/clang/AST/ |
H A D | Redeclarable.h | 43 mutable llvm::PointerUnion<NotKnownLatest, KnownLatest> Next; member in class:clang::Redeclarable::DeclLink 50 : Next(NotKnownLatest(&Ctx)) {} 52 : Next(NotKnownLatest(Previous(D))) {} 55 return Next.is<NotKnownLatest>() && 58 Next.get<NotKnownLatest>().template is<Previous>(); 64 if (Next.is<NotKnownLatest>()) { 65 NotKnownLatest NKL = Next.get<NotKnownLatest>(); 70 Next = KnownLatest(*NKL.get<UninitializedLatest>(), 74 return static_cast<decl_type*>(Next.get<KnownLatest>().get(D)); 79 Next 207 decl_type *Next = Current->getNextRedeclaration(); local [all...] |
/external/clang/lib/ASTMatchers/Dynamic/ |
H A D | Diagnostics.cpp | 140 const char Next = Pieces.second.front(); local 142 if (Next >= '0' && Next <= '9') { 143 const unsigned Index = Next - '0';
|
/external/clang/lib/Parse/ |
H A D | ParseTentative.cpp | 1122 const Token &Next = NextToken(); local 1124 if (!getLangOpts().ObjC1 && Next.is(tok::identifier)) 1127 if (Next.isNot(tok::coloncolon) && Next.isNot(tok::less)) { 1134 TypoCorrection.WantTypeSpecifiers = Next.isNot(tok::arrow); 1178 const Token &Next = NextToken(); local 1179 if (Next.is(tok::kw_new) || // ::new 1180 Next.is(tok::kw_delete)) // ::delete 1578 const Token &Next = NextToken(); local 1579 if (Next [all...] |
/external/clang/lib/Sema/ |
H A D | IdentifierResolver.cpp | 38 IdDeclInfoPool(IdDeclInfoPool *Next) : Next(Next) {} argument 40 IdDeclInfoPool *Next; member in struct:IdentifierResolver::IdDeclInfoMap::IdDeclInfoPool 53 Cur = Cur->Next;
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | example-tuple.cpp | 183 typedef get_impl<I-1, tuple<Values...> > Next; typedef in class:get_impl 185 static RJ get(tuple<Head, Values...>& t) { return Next::get(t.tail()); } 186 static PJ get(const tuple<Head, Values...>& t) { return Next::get(t.tail()); }
|
/external/libnfc-nxp/src/ |
H A D | phFriNfc_NdefReg.h | 223 struct phFriNfc_NdefReg_Cb *Next; member in struct:phFriNfc_NdefReg_Cb
|
/external/libvpx/libvpx/test/ |
H A D | resize_test.cc | 108 virtual void Next() { function in class:__anon24791::ResizingVideoSource
|
H A D | video_source.h | 63 virtual void Next() = 0; 98 virtual void Next() { function in class:libvpx_test::DummyVideoSource 183 virtual void Next() = 0;
|
H A D | webm_video_source.h | 131 virtual void Next() { function in class:libvpx_test::WebMVideoSource
|
/external/lldb/tools/lldb-perf/lib/ |
H A D | Xcode.cpp | 125 Xcode::Next (SBThread thread) function in class:Xcode
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 114 NodeType *Next = *It++; local 116 if (Next && !this->Visited.count(Next)) { 118 this->Visited.insert(Next); 119 VisitStack.push_back(std::make_pair(PointerIntTy(Next, 0), 120 GT::child_begin(Next)));
|
H A D | EquivalenceClasses.h | 60 /// value itself, which provides the ordering that the set queries. Next, it 70 mutable const ECValue *Leader, *Next; member in class:llvm::EquivalenceClasses::ECValue 72 // ECValue ctor - Start out with EndOfList pointing to this node, Next is 75 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {} 90 Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader()); 93 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1), 101 bool isLeader() const { return (intptr_t)Next & 1; } 105 return (ECValue*)((intptr_t)Next & ~(intptr_t)1); 232 L2LV.Next = L2LV.getNext();
|
/external/llvm/include/llvm/IR/ |
H A D | ValueHandle.h | 56 ValueHandleBase *Next; member in class:llvm::ValueHandleBase 67 : PrevPair(nullptr, Kind), Next(nullptr), VP(nullptr, 0) {} 69 : PrevPair(nullptr, Kind), Next(nullptr), VP(V, 0) { 74 : PrevPair(nullptr, Kind), Next(nullptr), VP(RHS.VP) { 126 /// List is the address of either the head of the list or a Next node within
|
/external/llvm/include/llvm/Support/ |
H A D | Registry.h | 74 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) 90 node *Next; member in class:llvm::Registry::node 94 node(const entry& V) : Next(nullptr), Val(V) { 96 Tail->Next = this; 116 iterator &operator++() { Cur = Cur->Next; return *this; } 142 listener *Prev, *Next; member in class:llvm::Registry::listener 159 listener() : Prev(ListenerTail), Next(0) { 161 Prev->Next = this; 168 if (Next) 169 Next [all...] |
H A D | Timer.h | 86 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer 166 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
|
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugLocEntry.h | 104 /// \brief Attempt to merge this DebugLocEntry with Next and return 106 /// share the same Loc/Constant and if Next immediately follows this 108 bool Merge(const DebugLocEntry &Next) { argument 109 if ((End == Next.Begin && Values == Next.Values)) { 110 End = Next.End;
|