Searched refs:Next (Results 126 - 150 of 481) sorted by relevance

1234567891011>>

/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_emulate_branches.c157 for(struct rc_instruction * inst = begin; inst != end; inst = inst->Next) {
215 allocate_and_insert_proxies(s, &IfProxies, branch->If->Next, branch->Else ? branch->Else : inst);
218 allocate_and_insert_proxies(s, &ElseProxies, branch->Else->Next, inst);
288 for(struct rc_instruction * inst = s->C->Program.Instructions.Next;
290 inst = inst->Next) {
318 ptr = c->Program.Instructions.Next;
321 ptr = ptr->Next;
H A Dradeon_variable.c74 for ( ; readers; readers = readers->Next) {
195 inst = inst->Next) {
299 for (list_ptr = *variable_list; list_ptr; list_ptr = list_ptr->Next) {
359 for (inst = c->Program.Instructions.Next;
361 inst = inst->Next) {
414 for (temp = list; temp; temp = temp->Next) {
480 for (list_ptr = var_list; list_ptr; list_ptr = list_ptr->Next) {
H A Dr3xx_vertprog.c372 for(rci = compiler->Base.Program.Instructions.Next; rci != &compiler->Base.Program.Instructions; rci = rci->Next) {
567 for(inst = compiler->Base.Program.Instructions.Next; inst != &compiler->Base.Program.Instructions; inst = inst->Next) {
590 for(inst = compiler->Base.Program.Instructions.Next; inst != &compiler->Base.Program.Instructions; inst = inst->Next) {
597 for(ptr = inst->Next;
599 ptr = ptr->Next){
625 for(inst = compiler->Base.Program.Instructions.Next; inst != &compiler->Base.Program.Instructions; inst = inst->Next) {
[all...]
H A Dradeon_pair_schedule.c47 /** Next instruction in the linked list of ready instructions. */
90 struct reg_value_reader *Next; member in struct:reg_value_reader
111 * of the instruction writing \ref Next is decremented.
115 struct reg_value *Next; /**< Pointer to the next value to be written to the same register */ member in struct:reg_value
129 struct remap_reg * Next; member in struct:remap_reg
289 for (r = v->Readers; r; r = r->Next) {
376 if (v->Next) {
377 decrease_dependencies(s, v->Next->Writer);
392 for(struct reg_value_reader * r = v->Readers; r; r = r->Next) {
402 if (v->Next)
[all...]
H A Dr3xx_fragprog.c56 for (rci = c->Base.Program.Instructions.Next; rci != &c->Base.Program.Instructions; rci = rci->Next) {
H A Dradeon_dataflow_swizzles.c94 for(inst = c->Program.Instructions.Next; inst != &c->Program.Instructions; inst = inst->Next) {
/external/llvm/include/llvm/CodeGen/
H A DDIE.h434 PointerIntPair<IntrusiveBackListNode *, 1> Next; member in struct:llvm::IntrusiveBackListNode
435 IntrusiveBackListNode() : Next(this, true) {}
438 return Next.getInt() ? nullptr : Next.getPointer();
448 assert(N.Next.getPointer() == &N && "Expected unlinked node");
449 assert(N.Next.getInt() == true && "Expected unlinked node");
452 N.Next = Last->Next;
453 Last->Next.setPointerAndInt(&N, false);
512 return Last ? iterator(static_cast<T *>(Last->Next
[all...]
/external/skia/src/core/
H A DSkTextBlob.cpp160 static const RunRecord* Next(const RunRecord* run) {
167 SkASSERT((uint8_t*)Next(this) <= storageTop);
169 SkASSERT(posBuffer() + fCount * ScalarsPerGlyph(fPositioning) <= (SkScalar*)Next(this));
182 SkASSERT((uint8_t*)posBuffer() + copySize <= (uint8_t*)Next(this));
214 const RunRecord* nextRun = RunRecord::Next(run);
317 fCurrentRun = SkTextBlob::RunRecord::Next(fCurrentRun);
410 SkASSERT((void*)glyphPosX <= SkTextBlob::RunRecord::Next(&run));
434 SkASSERT((void*)(glyphPos + run.glyphCount()) <= SkTextBlob::RunRecord::Next(&run));
448 SkASSERT((void*)(glyphPosPts + run.glyphCount()) <= SkTextBlob::RunRecord::Next(&run));
636 run = SkTextBlob::RunRecord::Next(ru
[all...]
/external/clang/lib/Sema/
H A DIdentifierResolver.cpp38 IdDeclInfoPool(IdDeclInfoPool *Next) : Next(Next) {} argument
40 IdDeclInfoPool *Next; member in struct:IdentifierResolver::IdDeclInfoMap::IdDeclInfoPool
53 Cur = Cur->Next;
/external/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h114 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 Dilist.h32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
63 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); } argument
558 NodeTy *Next = last.getNodePtrUnchecked(), *Last = this->getPrev(Next); local
560 this->setNext(Prev, Next);
562 L2.Head = Next;
563 this->setPrev(Next, Prev);
652 iterator Next = First2; local
653 transfer(First1, Right, First2, ++Next);
705 auto Next = std::next(N.getIterator()); local
[all...]
/external/v8/src/
H A Dv8threads.cc227 return in_use_anchor_->Next();
231 ThreadState* ThreadState::Next() { function in class:v8::internal::ThreadState
328 state = state->Next()) {
340 state = state->Next()) {
356 state = state->Next()) {
/external/v8/src/regexp/
H A Dregexp-parser.cc40 uc32 RegExpParser::Next() { function in class:v8::internal::RegExpParser
242 switch (Next()) {
258 if (Next() == '=') {
261 } else if (Next() == '!') {
292 switch (Next()) {
316 uc32 c = Next();
350 uc32 first_digit = Next();
396 uc32 controlLetter = Next();
578 DCHECK('1' <= Next() && Next() <
[all...]
/external/sfntly/cpp/src/sfntly/table/bitmap/
H A Dbitmap_size_table.cc379 info.Attach(it->Next());
503 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next() { function in class:sfntly::BitmapSizeTable::Builder::BitmapGlyphInfoIterator
508 return Next(sub_table_glyph_info_iter_);
558 BitmapGlyphInfo* BitmapSizeTable::Builder::BitmapGlyphInfoIterator::Next( function in class:sfntly::BitmapSizeTable::Builder::BitmapGlyphInfoIterator
566 return it->Next();
573 return it->Next();
580 return it->Next();
587 return it->Next();
594 return it->Next();
H A Dbitmap_size_table.h44 CALLER_ATTACH virtual BitmapGlyphInfo* Next();
48 CALLER_ATTACH BitmapGlyphInfo* Next(BitmapGlyphInfoIter* iterator_base);
/external/protobuf/src/google/protobuf/compiler/
H A Dparser.cc124 input_->Next();
152 input_->Next();
169 input_->Next();
200 input_->Next();
211 input_->Next();
222 input_->Next();
226 input_->Next();
230 input_->Next();
241 input_->Next();
245 input_->Next();
[all...]
/external/libchrome/base/metrics/
H A Dsparse_histogram.cc159 it->Next();
181 it->Next();
/external/llvm/include/llvm/Support/
H A DTimer.h84 Timer **Prev, *Next; // Doubly linked list of timers in the group. member in class:llvm::Timer
162 TimerGroup **Prev, *Next; // Doubly linked list of TimerGroup's. member in class:llvm::TimerGroup
/external/v8/src/heap/
H A Dstore-buffer.cc285 for (HeapObject* object = it.Next(); object != NULL; object = it.Next()) {
393 for (HeapObject* object = it.Next(); object != NULL; object = it.Next()) {
481 for (HeapObject* heap_object = iterator.Next(); heap_object != NULL;
482 heap_object = iterator.Next()) {
505 for (HeapObject* heap_object = iterator.Next();
506 heap_object != nullptr; heap_object = iterator.Next()) {
/external/webrtc/webrtc/modules/rtp_rtcp/source/
H A Drtp_header_extension_unittest.cc112 EXPECT_EQ(kRtpExtensionNone, map_.Next(kRtpExtensionTransmissionTimeOffset));
121 EXPECT_EQ(kRtpExtensionNone, map_.Next(kRtpExtensionTransmissionTimeOffset));
/external/pdfium/third_party/lcms2-2.6/src/
H A Dcmslut.c134 mpe = mpe ->Next;
145 mpe = mpe ->Next;
1214 return mpe -> Next;
1289 mpe = mpe ->Next) {
1315 mpe = mpe ->Next) {
1377 cmsStage *mpe, *Next; local
1383 mpe = Next) {
1385 Next = mpe ->Next;
1426 mpe = mpe ->Next) {
[all...]
/external/compiler-rt/lib/asan/
H A Dasan_linux.cc137 while (proc_maps.Next(nullptr, nullptr, nullptr, filename,
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_posix.cc61 while (proc_maps.Next(/*start*/nullptr, &end,
254 while (proc_maps.Next(&start, &end,
271 while (proc_maps.Next(&start, &end, /* file_offset */nullptr,
306 while (proc_maps.Next(&s, &e, &off, buff.data(), buff.size(), &prot)) {
H A Dsanitizer_procmaps_freebsd.cc51 bool MemoryMappingLayout::Next(uptr *start, uptr *end, uptr *offset, function in class:__sanitizer::MemoryMappingLayout
H A Dsanitizer_procmaps_linux.cc29 bool MemoryMappingLayout::Next(uptr *start, uptr *end, uptr *offset, function in class:__sanitizer::MemoryMappingLayout

Completed in 2627 milliseconds

1234567891011>>