Searched refs:Next (Results 1 - 25 of 479) sorted by relevance

1234567891011>>

/external/llvm/include/llvm/ADT/
H A Dilist_node.h46 NodeTy *Next; member in class:llvm::ilist_node
47 NodeTy *getNext() { return Next; }
48 const NodeTy *getNext() const { return Next; }
49 void setNext(NodeTy *N) { Next = N; }
51 ilist_node() : Next(nullptr) {}
81 NodeTy *Next = getNext(); local
84 if (!Next->getNext())
87 return Next;
92 const NodeTy *Next = getNext(); local
95 if (!Next
[all...]
H A DSparseMultiSet.h85 /// 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/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c39 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 Dradeon_program.c57 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 Dradeon_list.h36 struct rc_list * Next; member in struct:rc_list
H A Dradeon_rename_regs.c56 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 DManagedStatic.cpp53 Next = StaticList;
57 assert(!Ptr && !DeleterFn && !Next &&
63 Next = StaticList;
73 StaticList = Next;
74 Next = nullptr;
/external/clang/test/CodeGen/
H A D2002-08-19-RecursiveLocals.c7 struct list *Next; member in struct:list
H A D2002-07-14-MiscListTests.c19 struct list *Next; member in struct:list
43 L = &(*L)->Next;
46 (*L)->Next = 0;
53 return FindData(L->Next, Data);
/external/clang/include/clang/AST/
H A DRedeclarable.h43 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 DRegistry.h73 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
89 node *Next; member in class:llvm::Registry::node
93 node(const entry& V) : Next(nullptr), Val(V) {
95 Tail->Next = this;
115 iterator &operator++() { Cur = Cur->Next; return *this; }
145 listener *Prev, *Next; member in class:llvm::Registry::listener
162 listener() : Prev(ListenerTail), Next(0) {
164 Prev->Next = this;
171 if (Next)
172 Next
[all...]
/external/llvm/include/llvm/IR/
H A DUse.h117 Use *getNext() const { return Next; }
136 Use *Next; member in class:llvm::Use
141 Next = *List;
142 if (Next)
143 Next->setPrev(&Next);
149 *StrippedPrev = Next;
150 if (Next)
151 Next->setPrev(StrippedPrev);
H A DValue.h512 /// \param[out] Next the first element in the list.
514 static void mergeUseListsImpl(Use *L, Use *R, Use **Next, Compare Cmp);
533 if (!UseList || !UseList->Next)
546 Use *Next = UseList->Next; local
547 UseList->Next = nullptr;
552 while (Next->Next) {
553 Use *Current = Next;
554 Next
600 mergeUseListsImpl(Use *L, Use *R, Use **Next, Compare Cmp) argument
[all...]
/external/v8/src/base/utils/
H A Drandom-number-generator.h44 return Next(32);
61 return Next(1) != 0;
84 int Next(int bits) WARN_UNUSED_RESULT;
H A Drandom-number-generator.cc86 return static_cast<int>((max * static_cast<int64_t>(Next(31))) >> 31);
90 int rnd = Next(31);
100 return ((static_cast<int64_t>(Next(26)) << 27) + Next(27)) /
107 static_cast<uint8_t*>(buffer)[n] = static_cast<uint8_t>(Next(8));
112 int RandomNumberGenerator::Next(int bits) { function in class:v8::base::RandomNumberGenerator
/external/v8/src/
H A Ddateparser-inl.h79 token = scanner.Next()) {
92 if (scanner.Peek().IsSymbol('.')) scanner.Next();
97 int n = ReadMilliseconds(scanner.Next());
139 n = scanner.Next().number();
192 in_->Next();
211 DateToken sign_token = scanner->Next();
214 int year = scanner->Next().number();
218 day->Add(scanner->Next().number());
220 return scanner->Next();
224 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...]
H A Dcircular-queue-inl.h38 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/regex-re2/util/
H A Drandom.cc11 int32 ACMRandom::Next() { function in class:re2::ACMRandom
31 return Next() % n;
H A Drandom.h18 int32 Next();
/external/mesa3d/src/egl/main/
H A Degldisplay.c230 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 Dzero_copy_stream.h60 // 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 DSimplifyInstructions.cpp59 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 Dhash.c55 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/openfst/src/include/fst/
H A Dsymbol-table-ops.h43 for (; !siter.Done(); siter.Next()) {
45 for (; !aiter.Done(); aiter.Next()) {
52 for (SymbolTableIterator stiter(syms); !stiter.Done(); stiter.Next()) {
/external/llvm/lib/IR/
H A DValue.cpp622 if (!UseList || !UseList->Next)
627 Use *Current = UseList->Next;
628 Head->Next = nullptr;
630 Use *Next = Current->Next; local
631 Current->Next = Head;
632 Head->setPrev(&Current->Next);
634 Current = Next;
648 Next = *List;
651 if (Next) {
[all...]

Completed in 4258 milliseconds

1234567891011>>