/external/protobuf/src/google/protobuf/io/ |
H A D | gzip_stream.cc | 95 bool ok = sub_stream_->Next(&in, &in_size); 124 bool GzipInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::GzipInputStream 154 // The underlying stream's Next returned false inside Inflate. 172 bool ok = Next(&data, &size); 175 ok = Next(&data, &size); 252 bool ok = sub_stream_->Next(&sub_data_, &sub_data_size_); 275 bool GzipOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::GzipOutputStream
|
/external/protobuf/src/google/protobuf/util/ |
H A D | json_util_test.cc | 188 virtual bool Next(void** buffer, int* length) { function in class:google::protobuf::util::__anon16522::SegmentedZeroCopyOutputStream
|
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
H A D | MachinePassRegistry.h | 53 MachinePassRegistryNode *Next; // Next function pass in list. member in class:llvm::MachinePassRegistryNode 61 : Next(NULL) 68 MachinePassRegistryNode *getNext() const { return Next; } 69 MachinePassRegistryNode **getNextAddress() { return &Next; } 73 void setNext(MachinePassRegistryNode *N) { Next = N; }
|
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
H A D | Recycler.h | 33 RecyclerStruct *Prev, *Next; member in struct:llvm::RecyclerStruct 40 static RecyclerStruct *getNext(const RecyclerStruct *t) { return t->Next; } 42 static void setNext(RecyclerStruct *t, RecyclerStruct *n) { t->Next = n; }
|
H A D | Timer.h | 90 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer 170 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
|
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/ |
H A D | LoopInstSimplify.cpp | 72 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local 112 Next->insert(cast<Instruction>(*UI)); 163 std::swap(ToSimplify, Next); 164 Next->clear();
|
/external/v8/src/heap/ |
H A D | mark-compact-inl.h | 134 HeapObject* LiveObjectIterator<T>::Next() { function in class:v8::internal::LiveObjectIterator
|
/external/clang/include/clang/AST/ |
H A D | Redeclarable.h | 48 mutable llvm::PointerUnion<NotKnownLatest, KnownLatest> Next; member in class:clang::Redeclarable::DeclLink 55 : Next(NotKnownLatest(reinterpret_cast<UninitializedLatest>(&Ctx))) {} 57 : Next(NotKnownLatest(Previous(D))) {} 60 return Next.is<NotKnownLatest>() && 63 Next.get<NotKnownLatest>().template is<Previous>(); 69 if (Next.is<NotKnownLatest>()) { 70 NotKnownLatest NKL = Next.get<NotKnownLatest>(); 75 Next = KnownLatest(*reinterpret_cast<const ASTContext *>( 80 return static_cast<decl_type*>(Next.get<KnownLatest>().get(D)); 85 Next 213 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/Format/ |
H A D | FormatTokenLexer.cpp | 351 FormatToken *Next = Tokens.back(); local 360 Tokens.push_back(Next);
|
/external/clang/lib/Parse/ |
H A D | ParseTentative.cpp | 1081 TentativeParseCCC(const Token &Next) { argument 1083 WantTypeSpecifiers = Next.isOneOf(tok::l_paren, tok::r_paren, tok::greater, 1215 const Token &Next = NextToken(); local 1217 if (!getLangOpts().ObjC1 && Next.is(tok::identifier)) 1220 if (Next.isNot(tok::coloncolon) && Next.isNot(tok::less)) { 1226 llvm::make_unique<TentativeParseCCC>(Next))) { 1268 const Token &Next = NextToken(); local 1269 if (Next.isOneOf(tok::kw_new, // ::new 1677 const Token &Next local [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/libchrome/base/metrics/ |
H A D | persistent_sample_map.cc | 32 void Next() override; 57 void PersistentSampleMapIterator::Next() { function in class:base::__anon9944::PersistentSampleMapIterator 184 for (; !iter->Done(); iter->Next()) {
|
/external/libchrome/base/trace_event/ |
H A D | heap_profiler_allocation_register.h | 122 KVIndex Next(KVIndex index) const { function in class:base::trace_event::internal::FixedHashMap
|
/external/libvpx/libvpx/test/ |
H A D | video_source.h | 112 virtual void Next() = 0; 148 virtual void Next() { function in class:libvpx_test::DummyVideoSource 247 virtual void Next() = 0;
|
/external/llvm/include/llvm/ADT/ |
H A D | DepthFirstIterator.h | 114 NodeType *Next = *It++; local 116 if (Next && this->Visited.insert(Next).second) { 119 std::make_pair(PointerIntTy(Next, 0), GT::child_begin(Next)));
|
H A D | EquivalenceClasses.h | 61 /// value itself, which provides the ordering that the set queries. Next, it 71 mutable const ECValue *Leader, *Next; member in class:llvm::EquivalenceClasses::ECValue 73 // ECValue ctor - Start out with EndOfList pointing to this node, Next is 76 : Leader(this), Next((ECValue*)(intptr_t)1), Data(Elt) {} 91 Next = (const ECValue*)((intptr_t)NewNext | (intptr_t)isLeader()); 94 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1), 102 bool isLeader() const { return (intptr_t)Next & 1; } 106 return (ECValue*)((intptr_t)Next & ~(intptr_t)1); 233 L2LV.Next = L2LV.getNext();
|
H A D | MapVector.h | 136 auto Next = Vector.erase(Iterator); local 137 if (Next == Vector.end()) 138 return Next; 141 size_t Index = Next - Vector.begin(); 147 return Next;
|
/external/llvm/include/llvm/IR/ |
H A D | ValueHandle.h | 59 : PrevPair(nullptr, Kind), Next(nullptr), V(RHS.V) { 66 ValueHandleBase *Next; member in class:llvm::ValueHandleBase 72 : PrevPair(nullptr, Kind), Next(nullptr), V(nullptr) {} 74 : PrevPair(nullptr, Kind), Next(nullptr), V(V) { 125 /// 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 | 65 node *Next; member in class:llvm::Registry::node 69 node(const entry &V) : Next(nullptr), Val(V) {} 74 Tail->Next = N; 90 iterator &operator++() { Cur = Cur->Next; return *this; }
|
H A D | Timer.h | 86 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer 174 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
|
/external/llvm/include/llvm/Transforms/Scalar/ |
H A D | GVN.h | 120 LeaderTableEntry *Next; member in struct:llvm::GVN::LeaderTableEntry 151 Node->Next = Curr.Next; 152 Curr.Next = Node; 163 Curr = Curr->Next; 170 Prev->Next = Curr->Next; 172 if (!Curr->Next) { 176 LeaderTableEntry *Next = Curr->Next; local [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugLocEntry.h | 106 /// \brief If this and Next are describing different pieces of the same 107 /// variable, merge them by appending Next's values to the current 110 bool MergeValues(const DebugLocEntry &Next); 112 /// \brief Attempt to merge this DebugLocEntry with Next and return 114 /// share the same Loc/Constant and if Next immediately follows this 116 bool MergeRanges(const DebugLocEntry &Next) { argument 117 // If this and Next are describing the same variable, merge them. 118 if ((End == Next.Begin && Values == Next.Values)) { 119 End = Next [all...] |
/external/llvm/lib/CodeGen/ |
H A D | CriticalAntiDepBreaker.cpp | 130 const SDep *Next = nullptr; local 143 Next = &*P; 146 return Next;
|