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

1234567891011>>

/external/clang/include/clang/Sema/
H A DObjCMethodList.h24 ObjCMethodList *Next; member in struct:clang::ObjCMethodList
28 Next = 0;
32 Next = C;
/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(0) {}
81 NodeTy *Next = getNext(); local
84 if (!Next->getNext())
87 return Next;
92 const NodeTy *Next = getNext(); local
95 if (!Next
[all...]
/external/llvm/lib/Support/
H A DManagedStatic.cpp42 Next = StaticList;
48 assert(Ptr == 0 && DeleterFn == 0 && Next == 0 &&
54 Next = StaticList;
64 StaticList = Next;
65 Next = 0;
H A DTimer.cpp259 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/chromium/base/
H A Ddir_reader_fallback.h13 // Open a directory. If |IsValid| is true, then |Next| can be called to start
20 bool Next() { return false; } function in class:base::DirReaderFallback
/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/llvm/include/llvm/Support/
H A DRegistry.h69 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
85 node *Next; member in class:llvm::Registry::node
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; member in class:llvm::Registry::listener
153 listener() : Prev(ListenerTail), Next(0) {
155 Prev->Next = this;
162 if (Next)
163 Next
[all...]
/external/v8/src/
H A Ddateparser-inl.h101 token = scanner.Next()) {
114 if (scanner.Peek().IsSymbol('.')) scanner.Next();
119 int n = ReadMilliseconds(scanner.Next());
158 n = scanner.Next().number();
211 in_->Next();
230 DateToken sign_token = scanner->Next();
233 int year = scanner->Next().number();
237 day->Add(scanner->Next().number());
239 return scanner->Next();
243 !DayComposer::IsMonth(scanner->Peek().number())) return scanner->Next();
[all...]
/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/chromium/net/disk_cache/
H A Dcache_util_posix.cc31 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/include/llvm/
H A DUse.h112 Use *getNext() const { return Next; }
127 Use *Next; member in class:llvm::Use
134 Next = *List;
135 if (Next) Next->setPrev(&Next);
141 *StrippedPrev = Next;
142 if (Next) Next->setPrev(StrippedPrev);
/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...]
H A Dzero_copy_stream_impl_lite.h64 // 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 Dzero_copy_stream_impl.h67 // 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 Dzero_copy_stream_impl.cc88 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/llvm/lib/VMCore/
H A DValue.cpp480 Next = *List;
483 if (Next) {
484 Next->setPrevPtr(&Next);
485 assert(VP.getPointer() == Next->VP.getPointer() && "Added to wrong list?");
492 Next = List->Next;
493 setPrevPtr(&List->Next);
494 List->Next = this;
495 if (Next)
[all...]
/external/chromium/chrome/browser/policy/
H A Dconfig_dir_policy_provider.cc25 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/llvm/lib/Transforms/Utils/
H A DSimplifyInstructions.cpp51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
70 Next->insert(cast<Instruction>(*UI));
80 std::swap(ToSimplify, Next);
81 Next->clear();
/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/include/llvm/CodeGen/
H A DMachinePassRegistry.h54 MachinePassRegistryNode *Next; // Next function pass in list. member in class:llvm::MachinePassRegistryNode
62 : Next(NULL)
69 MachinePassRegistryNode *getNext() const { return Next; }
70 MachinePassRegistryNode **getNextAddress() { return &Next; }
74 void setNext(MachinePassRegistryNode *N) { Next = N; }
/external/webrtc/src/system_wrappers/test/list/
H A Dlist.cc48 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/lib/CodeGen/
H A DMachineRegisterInfo.cpp128 // Next is NULL on the last list element.
134 MO->Contents.Reg.Next = 0;
151 MO->Contents.Reg.Next = Head;
155 MO->Contents.Reg.Next = 0;
156 Last->Contents.Reg.Next = MO;
168 MachineOperand *Next = MO->Contents.Reg.Next; local
173 HeadRef = Next;
175 Prev->Contents.Reg.Next = Next;
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dstatesort.h53 siter.Next()) {
61 aiter.Next())
70 aiter.Next())

Completed in 680 milliseconds

1234567891011>>