/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_list.c | 39 new->Next = NULL; 54 for (temp = *list; temp->Next; temp = temp->Next); 56 temp->Next = new_value; 63 *list = rm_value->Next; 67 rm_value->Prev->Next = rm_value->Next; 68 if (rm_value->Next) { 69 rm_value->Next->Prev = rm_value->Prev; 78 list = list->Next; [all...] |
H A D | radeon_program.c | 57 struct rc_instruction * inst = c->Program.Instructions.Next; 63 inst = inst->Next; 114 for(inst = c->Program.Instructions.Next; 115 inst != &c->Program.Instructions; inst = inst->Next) { 187 inst->Next = after->Next; 189 inst->Prev->Next = inst; 190 inst->Next->Prev = inst; 204 inst->Prev->Next = inst->Next; [all...] |
H A D | radeon_list.h | 36 struct rc_list * Next; member in struct:rc_list
|
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) {
|
/external/llvm/lib/Support/ |
H A D | ManagedStatic.cpp | 54 Next = StaticList; 58 assert(!Ptr && !DeleterFn && !Next && 64 Next = StaticList; 74 StaticList = Next; 75 Next = nullptr;
|
/external/clang/test/CodeGen/ |
H A D | 2002-08-19-RecursiveLocals.c | 7 struct list *Next; member in struct:list
|
H A D | 2002-07-14-MiscListTests.c | 19 struct list *Next; member in struct:list 43 L = &(*L)->Next; 46 (*L)->Next = 0; 53 return FindData(L->Next, Data);
|
/external/libchrome/base/files/ |
H A D | dir_reader_fallback.h | 12 // Open a directory. If |IsValid| is true, then |Next| can be called to start 21 bool Next() { return false; } function in class:base::DirReaderFallback
|
/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 205 decl_type *Next = Current->getNextRedeclaration(); local [all...] |
/external/llvm/include/llvm/Support/ |
H A D | Registry.h | 72 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next) 88 node *Next; member in class:llvm::Registry::node 92 node(const entry& V) : Next(nullptr), Val(V) { 94 Tail->Next = this; 113 iterator &operator++() { Cur = Cur->Next; return *this; } 142 listener *Prev, *Next; member in class:llvm::Registry::listener 159 listener() : Prev(ListenerTail), Next(nullptr) { 161 Prev->Next = this; 168 if (Next) 169 Next [all...] |
H A D | Recycler.h | 38 FreeNode *Next; member in struct:llvm::Recycler::FreeNode 46 FreeList = FreeList->Next; 51 N->Next = FreeList; 107 for (auto *I = FreeList; I; I = I->Next)
|
/external/llvm/include/llvm/IR/ |
H A D | Use.h | 116 Use *getNext() const { return Next; } 135 Use *Next; member in class:llvm::Use 140 Next = *List; 141 if (Next) 142 Next->setPrev(&Next); 148 *StrippedPrev = Next; 149 if (Next) 150 Next->setPrev(StrippedPrev);
|
H A D | Value.h | 552 Use **Next = &Merged; local 556 *Next = R; 560 *Next = L; 564 *Next = R; 565 Next = &R->Next; 566 R = R->Next; 568 *Next = L; 569 Next = &L->Next; 613 Use *Next = UseList->Next; local [all...] |
/external/v8/src/ |
H A D | dateparser-inl.h | 81 token = scanner.Next()) { 94 if (scanner.Peek().IsSymbol('.')) scanner.Next(); 99 int n = ReadMilliseconds(scanner.Next()); 142 DateToken token = scanner.Next(); 206 in_->Next(); 214 Next(); 228 Next(); 246 DateToken sign_token = scanner->Next(); 249 int year = scanner->Next().number(); 253 day->Add(scanner->Next() [all...] |
/external/regex-re2/util/ |
H A D | random.cc | 11 int32 ACMRandom::Next() { function in class:re2::ACMRandom 31 return Next() % n;
|
H A D | random.h | 18 int32 Next();
|
/external/pdfium/xfa/src/fee/src/fx_wordbreak/ |
H A D | fx_wordbreak_impl.cpp | 24 FX_BOOL CFX_CharIter::Next(FX_BOOL bPrev) {
function in class:CFX_CharIter 79 FX_BOOL CFX_WordBreak::Next(FX_BOOL bPrev) {
function in class:CFX_WordBreak 84 pIter->Next(bPrev);
92 m_pCurIter->Next(TRUE);
97 m_pPreIter->Next();
129 FX_BOOL bEnd = pTempIter->Next();
150 pIter->Next(!bPrev);
153 pIter->Next(bPrev);
159 pIter->Next(bPrev);
166 pIter->Next(!bPre [all...] |
/external/llvm/include/llvm/ADT/ |
H A D | ilist_node.h | 53 NodeTy *Next; member in class:llvm::ilist_node 54 NodeTy *getNext() { return Next; } 55 const NodeTy *getNext() const { return Next; } 56 void setNext(NodeTy *N) { Next = N; } 58 ilist_node() : Next(nullptr) {}
|
H A D | SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This 94 unsigned Next; member in struct:llvm::SparseMultiSet::SMSNode 96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 100 return Next == INVALID; 157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { argument 159 Dense.push_back(SMSNode(V, Prev, Next)); 165 unsigned NextFree = Dense[Idx].Next; 168 Dense[Idx] = SMSNode(V, Prev, Next); 177 Dense[Idx].Next = FreelistIdx; 241 unsigned Next() cons function in class:llvm::SparseMultiSet::iterator_base [all...] |
/external/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DebugLocEntry.h | 92 /// \brief If this and Next are describing different pieces of the same 93 /// variable, merge them by appending Next's values to the current 96 bool MergeValues(const DebugLocEntry &Next) { argument 97 if (Begin == Next.Begin) { 99 auto *NextExpr = cast_or_null<DIExpression>(Next.Values[0].Expression); 101 addValues(Next.Values); 102 End = Next.End; 109 /// \brief Attempt to merge this DebugLocEntry with Next and return 111 /// share the same Loc/Constant and if Next immediately follows this 113 bool MergeRanges(const DebugLocEntry &Next) { argument [all...] |
/external/mesa3d/src/egl/main/ |
H A D | egldisplay.c | 230 dpyList = dpyList->Next; 264 dpy = dpy->Next; 276 dpy->Next = _eglGlobal.DisplayList; 298 list = list->Next; 308 list = list->Next; 346 cur = cur->Next; 370 list = list->Next; 422 res->Next = res->Display->ResourceLists[type]; 439 if (prev->Next == res) 441 prev = prev->Next; [all...] |
/external/protobuf/src/google/protobuf/io/ |
H A D | zero_copy_stream.h | 60 // input->Next(&buffer, &size); 78 // while (input->Next(&buffer, &size)) { 94 // while (output->Next(&buffer, &size)) { 143 // as repeatedly calling Next() eventually yields a buffer with non-zero 145 virtual bool Next(const void** data, int* size) = 0; 147 // Backs up a number of bytes, so that the next call to Next() returns 148 // data again that was already returned by the last call to Next(). This 150 // to a certain point in the input, then return. If Next() returns a 155 // * The last method called must have been Next(). 157 // returned by Next() [all...] |
/external/llvm/lib/Transforms/Utils/ |
H A D | SimplifyInstructions.cpp | 59 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; variable 78 Next->insert(cast<Instruction>(U)); 96 std::swap(ToSimplify, Next); 97 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/clang/lib/Format/ |
H A D | FormatToken.cpp | 85 LBrace->Next->Type == TT_DesignatedInitializerPeriod) 161 FormatToken *ItemBegin = Token->Next; 163 ItemBegin = ItemBegin->Next; 174 ItemBegin = ItemBegin->Next; 190 while (ItemEnd->Next && !ItemEnd->Next->CanBreakBefore) 191 ItemEnd = ItemEnd->Next; 202 if (ItemEnd->Next && !ItemEnd->Next->HasUnescapedNewline && 203 ItemEnd->Next [all...] |