| /external/clang/include/clang/Sema/ |
| ObjCMethodList.h | 24 ObjCMethodList *Next;
28 Next = 0;
32 Next = C;
|
| /external/llvm/lib/Support/ |
| ManagedStatic.cpp | 35 Next = StaticList;
41 assert(Ptr == 0 && DeleterFn == 0 && Next == 0 &&
47 Next = StaticList;
57 StaticList = Next;
58 Next = 0;
|
| 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 = FirstTimer
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 39 /// ilist_node - Base class that provides next/prev services for nodes
46 NodeTy *Next;
47 NodeTy *getNext() { return Next; }
48 const NodeTy *getNext() const { return Next; }
49 void setNext(NodeTy *N) { Next = N; }
51 ilist_node() : Next(0) {}
79 /// \brief Get the next node, or 0 for the list tail.
81 NodeTy *Next = getNext();
84 if (!Next->getNext())
87 return Next;
[all...] |
| /external/chromium/base/ |
| dir_reader_fallback.h | 13 // Open a directory. If |IsValid| is true, then |Next| can be called to start
19 // Move to the next entry returning false if the iteration is complete.
20 bool Next() { return false; }
|
| /external/clang/test/CodeGen/ |
| 2002-08-19-RecursiveLocals.c | 7 struct list *Next;
|
| 2002-07-14-MiscListTests.c | 19 struct list *Next;
43 L = &(*L)->Next;
46 (*L)->Next = 0;
53 return FindData(L->Next, Data);
|
| /external/protobuf/src/google/protobuf/io/ |
| 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()
[all...] |
| 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(void** data, int* size)
[all...] |
| 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(const void** data, int* size)
[all...] |
| zero_copy_stream_impl.cc | 88 bool FileInputStream::Next(const void** data, int* size) {
89 return impl_.Next(data, size);
191 bool FileOutputStream::Next(void** data, int* size) {
192 return impl_.Next(data, size);
278 bool IstreamInputStream::Next(const void** data, int* size) {
279 return impl_.Next(data, size);
322 bool OstreamOutputStream::Next(void** data, int* size) {
323 return impl_.Next(data, size);
358 bool ConcatenatingInputStream::Next(const void** data, int* size) {
360 if (streams_[0]->Next(data, size)) return true
[all...] |
| /external/llvm/include/llvm/Support/ |
| Registry.h | 69 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
85 node *Next;
89 node(const entry& V) : Next(0), Val(V) {
91 Tail->Next = this;
111 iterator &operator++() { Cur = Cur->Next; return *this; }
136 listener *Prev, *Next;
153 listener() : Prev(ListenerTail), Next(0) {
155 Prev->Next = this;
162 if (Next)
163 Next->Prev = Prev
[all...] |
| Recycler.h | 31 /// next/prev pointers.
33 RecyclerStruct *Prev, *Next;
40 static RecyclerStruct *getNext(const RecyclerStruct *t) { return t->Next; }
42 static void setNext(RecyclerStruct *t, RecyclerStruct *n) { t->Next = n; }
|
| /external/llvm/include/llvm/ |
| Use.h | 112 Use *getNext() const { return Next; }
127 Use *Next;
134 Next = *List;
135 if (Next) Next->setPrev(&Next);
141 *StrippedPrev = Next;
142 if (Next) Next->setPrev(StrippedPrev);
|
| /development/host/windows/usb/api/ |
| adb_interface_enum.h | 62 /** \brief Gets next enumerated interface information
76 bool Next(AdbInterfaceInfo* info, ULONG* size);
|
| /external/chromium/net/disk_cache/ |
| cache_util_posix.cc | 31 for (FilePath name = iter.Next(); !name.value().empty(); name = iter.Next()) {
48 for (FilePath file = iter.Next(); !file.value().empty(); file = iter.Next()) {
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 48 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2;
64 // Mark all uses for resimplification next time round the loop.
67 Next->insert(cast<Instruction>(*UI));
75 // Place the list of instructions to simplify on the next loop iteration
77 std::swap(ToSimplify, Next);
78 Next->clear();
|
| /external/llvm/include/llvm/CodeGen/ |
| MachinePassRegistry.h | 53 MachinePassRegistryNode *Next; // Next function pass in list.
61 : Next(NULL)
68 MachinePassRegistryNode *getNext() const { return Next; }
69 MachinePassRegistryNode **getNextAddress() { return &Next; }
73 void setNext(MachinePassRegistryNode *N) { Next = N; }
|
| /external/v8/src/ |
| lithium-allocator-inl.h | 72 LOperand* TempIterator::Next() {
100 LOperand* InputIterator::Next() {
126 LOperand* UseIterator::Next() {
129 ? input_iterator_.Next()
130 : env_iterator_.Next();
|
| /external/llvm/lib/VMCore/ |
| Value.cpp | 423 Next = *List;
426 if (Next) {
427 Next->setPrevPtr(&Next);
428 assert(VP == Next->VP && "Added to wrong list?");
435 Next = List->Next;
436 setPrevPtr(&List->Next);
437 List->Next = this;
438 if (Next)
[all...] |
| /external/chromium/chrome/browser/policy/ |
| config_dir_policy_provider.cc | 25 for (FilePath config_file_path = file_enumerator.Next();
26 !config_file_path.empty(); config_file_path = file_enumerator.Next())
67 for (FilePath config_file = file_enumerator.Next();
69 config_file = file_enumerator.Next()) {
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rmfinalepsilon.h | 46 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
50 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
65 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) {
70 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
72 // is next state in the list of finals
|
| statesort.h | 53 siter.Next()) {
61 aiter.Next())
70 aiter.Next())
|
| dfs-visit.h | 117 piter.Next();
125 aiter.Next();
140 aiter.Next();
144 aiter.Next();
148 // Find next tree root
|
| /external/protobuf/src/google/protobuf/testing/ |
| zcgunzip.cc | 62 ok = in.Next(&inptr, &inlen);
|
