/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | hash.c | 55 struct HashEntry *Next; /**< pointer to next entry */ member in struct:HashEntry 106 struct HashEntry *next = entry->Next; 141 entry = entry->Next; 193 for (entry = table->Table[pos]; entry; entry = entry->Next) { 212 entry->Next = table->Table[pos]; 255 prev->Next = entry->Next; 258 table->Table[pos] = entry->Next; 265 entry = entry->Next; 296 next = entry->Next; [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | SimplifyInstructions.cpp | 55 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; variable 74 Next->insert(cast<Instruction>(U)); 92 std::swap(ToSimplify, Next); 93 Next->clear();
|
/external/mesa3d/src/mesa/main/ |
H A D | hash.c | 55 struct HashEntry *Next; /**< pointer to next entry */ member in struct:HashEntry 106 struct HashEntry *next = entry->Next; 141 entry = entry->Next; 193 for (entry = table->Table[pos]; entry; entry = entry->Next) { 212 entry->Next = table->Table[pos]; 255 prev->Next = entry->Next; 258 table->Table[pos] = entry->Next; 265 entry = entry->Next; 296 next = entry->Next; [all...] |
/external/chromium_org/components/content_settings/core/browser/ |
H A D | content_settings_rule.cc | 32 Rule EmptyRuleIterator::Next() { function in class:content_settings::EmptyRuleIterator 58 Rule ConcatenationIterator::Next() { function in class:content_settings::ConcatenationIterator 63 const Rule& to_return = (*current_iterator)->Next();
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
H A D | radeon_rename_regs.c | 56 for(inst = c->Program.Instructions.Next; 58 inst = inst->Next) { 70 for (var_ptr = variables; var_ptr; var_ptr = var_ptr->Next) {
|
H A D | radeon_emulate_loops.c | 72 struct rc_instruction * first = loop->BeginLoop->Next; 78 for(ptr = first; ptr != last->Next; ptr = ptr->Next){ 219 for(inst = c->Program.Instructions.Next; inst != loop->BeginLoop; 220 inst = inst->Next){ 236 for(inst = loop->BeginLoop->Next; end_loops > 0; inst = inst->Next){ 340 for(ptr = loop->BeginLoop->Next; !loop->EndLoop; ptr = ptr->Next) { 353 for(ptr = ptr->Next; pt [all...] |
/external/chromium_org/v8/src/ |
H A D | circular-queue-inl.h | 38 dequeue_pos_ = Next(dequeue_pos_); 55 enqueue_pos_ = Next(enqueue_pos_); 60 typename SamplingCircularQueue<T, L>::Entry* SamplingCircularQueue<T, L>::Next( function in class:v8::internal::SamplingCircularQueue
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_rename_regs.c | 56 for(inst = c->Program.Instructions.Next; 58 inst = inst->Next) { 70 for (var_ptr = variables; var_ptr; var_ptr = var_ptr->Next) {
|
H A D | radeon_emulate_loops.c | 72 struct rc_instruction * first = loop->BeginLoop->Next; 78 for(ptr = first; ptr != last->Next; ptr = ptr->Next){ 219 for(inst = c->Program.Instructions.Next; inst != loop->BeginLoop; 220 inst = inst->Next){ 236 for(inst = loop->BeginLoop->Next; end_loops > 0; inst = inst->Next){ 340 for(ptr = loop->BeginLoop->Next; !loop->EndLoop; ptr = ptr->Next) { 353 for(ptr = ptr->Next; pt [all...] |
/external/openfst/src/include/fst/ |
H A D | symbol-table-ops.h | 43 for (; !siter.Done(); siter.Next()) { 45 for (; !aiter.Done(); aiter.Next()) { 52 for (SymbolTableIterator stiter(syms); !stiter.Done(); stiter.Next()) {
|
/external/chromium_org/third_party/protobuf/src/google/protobuf/io/ |
H A D | zero_copy_stream_impl_lite.h | 64 // the stream is destroyed. If a block_size is given, calls to Next() 66 // first call to Next() returns the entire array. block_size is mainly 73 bool Next(const void** data, int* size); 85 int last_returned_size_; // How many bytes we returned last time Next() 98 // the stream is destroyed. If a block_size is given, calls to Next() 100 // first call to Next() returns the entire array. block_size is mainly 107 bool Next(void** data, int* size); 117 int last_returned_size_; // How many bytes we returned last time Next() 133 // the first call to Next() will return at least n bytes of buffer 139 bool Next(voi [all...] |
H A D | zero_copy_stream_impl.h | 67 // should be read and returned with each call to Next(). Otherwise, 91 bool Next(const void** data, int* size); 145 // that should be returned by Next(). Otherwise, a reasonable default 174 bool Next(void** data, int* size); 219 // should be read and returned with each call to Next(). Otherwise, 225 bool Next(const void** data, int* size); 263 // that should be returned by Next(). Otherwise, a reasonable default 269 bool Next(void** data, int* size); 312 bool Next(const void** data, int* size); 338 bool Next(cons [all...] |
H A D | zero_copy_stream_impl.cc | 89 bool FileInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::FileInputStream 90 return impl_.Next(data, size); 192 bool FileOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::FileOutputStream 193 return impl_.Next(data, size); 279 bool IstreamInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::IstreamInputStream 280 return impl_.Next(data, size); 323 bool OstreamOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::OstreamOutputStream 324 return impl_.Next(data, size); 359 bool ConcatenatingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::ConcatenatingInputStream 361 if (streams_[0]->Next(dat 423 bool LimitingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::LimitingInputStream [all...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | MachinePassRegistry.h | 54 MachinePassRegistryNode *Next; // Next function pass in list. member in class:llvm::MachinePassRegistryNode 62 : Next(nullptr) 69 MachinePassRegistryNode *getNext() const { return Next; } 70 MachinePassRegistryNode **getNextAddress() { return &Next; } 74 void setNext(MachinePassRegistryNode *N) { Next = N; }
|
/external/protobuf/src/google/protobuf/io/ |
H A D | zero_copy_stream_impl_lite.h | 64 // the stream is destroyed. If a block_size is given, calls to Next() 66 // first call to Next() returns the entire array. block_size is mainly 73 bool Next(const void** data, int* size); 85 int last_returned_size_; // How many bytes we returned last time Next() 98 // the stream is destroyed. If a block_size is given, calls to Next() 100 // first call to Next() returns the entire array. block_size is mainly 107 bool Next(void** data, int* size); 117 int last_returned_size_; // How many bytes we returned last time Next() 133 // the first call to Next() will return at least n bytes of buffer 139 bool Next(voi [all...] |
H A D | zero_copy_stream_impl.h | 67 // should be read and returned with each call to Next(). Otherwise, 91 bool Next(const void** data, int* size); 145 // that should be returned by Next(). Otherwise, a reasonable default 174 bool Next(void** data, int* size); 219 // should be read and returned with each call to Next(). Otherwise, 225 bool Next(const void** data, int* size); 263 // that should be returned by Next(). Otherwise, a reasonable default 269 bool Next(void** data, int* size); 312 bool Next(const void** data, int* size); 338 bool Next(cons [all...] |
H A D | zero_copy_stream_impl.cc | 88 bool FileInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::FileInputStream 89 return impl_.Next(data, size); 191 bool FileOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::FileOutputStream 192 return impl_.Next(data, size); 278 bool IstreamInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::IstreamInputStream 279 return impl_.Next(data, size); 322 bool OstreamOutputStream::Next(void** data, int* size) { function in class:google::protobuf::io::OstreamOutputStream 323 return impl_.Next(data, size); 358 bool ConcatenatingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::ConcatenatingInputStream 360 if (streams_[0]->Next(dat 422 bool LimitingInputStream::Next(const void** data, int* size) { function in class:google::protobuf::io::LimitingInputStream [all...] |
/external/clang/lib/Format/ |
H A D | FormatToken.cpp | 69 LBrace->Next->Type == TT_DesignatedInitializerPeriod) 139 FormatToken *ItemBegin = Token->Next; 149 ItemBegin = ItemBegin->Next; 162 while (ItemEnd->Next && !ItemEnd->Next->CanBreakBefore) 163 ItemEnd = ItemEnd->Next; 173 if (ItemEnd->Next && !ItemEnd->Next->HasUnescapedNewline && 174 ItemEnd->Next->isTrailingComment()) 175 ItemEnd = ItemEnd->Next; [all...] |
H A D | FormatToken.h | 114 MatchingParen(nullptr), Previous(nullptr), Next(nullptr), 301 (!ColonRequired || (Next && Next->is(tok::colon))); 308 return is(tok::at) && Next && (Next->isObjCAtKeyword(tok::objc_public) || 309 Next->isObjCAtKeyword(tok::objc_protected) || 310 Next->isObjCAtKeyword(tok::objc_package) || 311 Next->isObjCAtKeyword(tok::objc_private)); 353 return is(tok::comment) && (!Next || Next 393 FormatToken *Next; member in struct:clang::format::FormatToken [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineRegisterInfo.cpp | 179 // Next is NULL on the last list element. 185 MO->Contents.Reg.Next = nullptr; 202 MO->Contents.Reg.Next = Head; 206 MO->Contents.Reg.Next = nullptr; 207 Last->Contents.Reg.Next = MO; 219 MachineOperand *Next = MO->Contents.Reg.Next; local 224 HeadRef = Next; 226 Prev->Contents.Reg.Next = Next; 262 MachineOperand *Next = Src->Contents.Reg.Next; local [all...] |
/external/webrtc/src/system_wrappers/test/list/ |
H A D | list.cc | 48 list_item = list.Next(list_item); 68 item_iter = list.Next(item_iter); 110 // Test Next 111 ListItem* second_item = test_list.Next(first_item); 113 FailTest(test_list.Next(last_item) != NULL); 114 FailTest(test_list.Next(NULL) != NULL); 161 FailTest(test_list.Next(NULL) != NULL);
|
/external/llvm/include/llvm/Support/ |
H A D | ArrayRecycler.h | 34 FreeList *Next; member in struct:llvm::ArrayRecycler::FreeList 51 Bucket[Idx] = Entry->Next; 61 Entry->Next = Bucket[Idx];
|
/external/llvm/lib/Support/ |
H A D | Timer.cpp | 259 TimerGroupList->Prev = &Next; 260 Next = TimerGroupList; 273 *Prev = Next; 274 if (Next) 275 Next->Prev = Prev; 289 *T.Prev = T.Next; 290 if (T.Next) 291 T.Next->Prev = T.Prev; 308 FirstTimer->Prev = &T.Next; 309 T.Next [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | statesort.h | 53 siter.Next()) { 61 aiter.Next()) 70 aiter.Next())
|
/external/chromium_org/third_party/brotli/src/brotli/enc/ |
H A D | histogram.cc | 46 insert_and_copy_it.Next(); 50 literal_it.Next(); 60 dist_it.Next(); 81 literal_it.Next();
|