Searched defs:Next (Results 1 - 25 of 306) sorted by relevance

1234567891011>>

/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.h36 struct rc_list * Next; member in struct:rc_list
/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/flatbuffers/tests/FlatBuffers.Test/
H A DLcg.cs32 public uint Next() method in class:FlatBuffers.Test.Lcg
/external/libchrome/base/files/
H A Ddir_reader_fallback.h12 // 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/perfetto/src/base/
H A Dstring_splitter.cc53 bool StringSplitter::Next() { function in class:perfetto::base::StringSplitter
/external/toolchain-utils/bestflags/
H A Dgeneration.py30 override the Next and IsImproved method to implement algorithm specific
121 def Next(self, _): member in class:Generation
H A Dhill_climb_best_neighbor.py42 # This variable will be used, by the Next method, to generate the tasks for
53 method Next to use.
79 def Next(self, cache): member in class:HillClimbingBestBranch
H A Diterative_elimination.py118 def Next(self, cache): member in class:IterativeEliminationGeneration
H A Dsteering_test.py36 It will output the next_generations when the method Next is called. The
51 def Next(self, _): member in class:MockGeneration
85 # output the next generation in reverse order of the list when the "Next"
/external/compiler-rt/lib/scudo/
H A Dscudo_utils.h44 u64 Next() { function in struct:__scudo::Xorshift128Plus
/external/perfetto/src/tracing/core/
H A Dsliced_protobuf_input_stream.cc30 bool SlicedProtobufInputStream::Next(const void** data, int* size) { function in class:perfetto::SlicedProtobufInputStream
/external/swiftshader/third_party/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/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A Dilist_node_base.h24 ilist_node_base *Next = nullptr; member in class:llvm::ilist_node_base
28 void setNext(ilist_node_base *Next) { this->Next = Next; } argument
30 ilist_node_base *getNext() const { return Next; }
38 ilist_node_base *Next = nullptr; member in class:llvm::ilist_node_base
42 void setNext(ilist_node_base *Next) { this->Next = Next; } argument
44 ilist_node_base *getNext() const { return Next; }
[all...]
H A Dilist_base.h25 static void insertBeforeImpl(node_base_type &Next, node_base_type &N) { argument
26 node_base_type &Prev = *Next.getPrev();
27 N.setNext(&Next);
30 Next.setPrev(&N);
35 node_base_type *Next = N.getNext(); local
36 Next->setPrev(Prev);
37 Prev->setNext(Next);
55 static void transferBeforeImpl(node_base_type &Next, node_base_type &First, argument
57 if (&Next == &Last || &First == &Last)
61 assert(&Next !
79 insertBefore(T &Next, T &N) argument
88 transferBefore(T &Next, T &First, T &Last) argument
[all...]
/external/v8/src/profiler/
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/compiler-rt/lib/sanitizer_common/
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
/external/llvm/include/llvm/ADT/
H A Dilist_node.h53 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) {}
/external/llvm/include/llvm/Support/
H A DManagedStatic.h46 mutable const ManagedStaticBase *Next; member in class:llvm::ManagedStaticBase
H A DRecycler.h38 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/lib/Fuzzer/
H A DFuzzerTracePC.cpp53 uintptr_t Next = (Prev << 5) ^ (PC & 4095); local
54 CurrentMap.Update(Next);
55 Prev = Next;
/external/swiftshader/third_party/LLVM/include/llvm/Support/
H A DManagedStatic.h44 mutable const ManagedStaticBase *Next; member in class:llvm::ManagedStaticBase
/external/swiftshader/third_party/LLVM/lib/Transforms/Utils/
H A DSimplifyInstructions.cpp48 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; local
67 Next->insert(cast<Instruction>(*UI));
77 std::swap(ToSimplify, Next);
78 Next->clear();
/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/
H A DManagedStatic.h46 mutable const ManagedStaticBase *Next; member in class:llvm::ManagedStaticBase

Completed in 1076 milliseconds

1234567891011>>