HomeSort by relevance Sort by last modified time
    Searched refs:Next (Results 1 - 25 of 1236) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/swiftshader/third_party/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;
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_list.c 15 * next paragraph) shall be included in all copies or substantial
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
    [all...]
radeon_program.c 15 * next paragraph) shall be included in all copies or substantial
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...]
  /external/swiftshader/third_party/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...]
  /system/core/init/parser/
tokenizer_test.cpp 30 ASSERT_TRUE(tokenizer.Next()); \
35 ASSERT_TRUE(tokenizer.Next()); \
40 ASSERT_FALSE(tokenizer.Next());
46 ASSERT_FALSE(tokenizer.Next());
52 ASSERT_FALSE(tokenizer.Next());
58 ASSERT_FALSE(tokenizer.Next());
65 ASSERT_FALSE(tokenizer.Next());
73 ASSERT_FALSE(tokenizer.Next());
84 ASSERT_FALSE(tokenizer.Next());
91 ASSERT_FALSE(tokenizer.Next());
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/Ip4Dxe/
Ip4Option.c 130 UINT32 Next;
137 Next = 0;
148 OptBuf[Next] = IP4_OPTION_NOP;
149 Next++;
163 CopyMem (OptBuf + Next, Option + Cur, Len);
164 Next += Len;
174 if (Next == 0) {
183 if ((Next % 4) != 0) {
184 OptBuf[Next] = IP4_OPTION_EOP;
185 Next++;
    [all...]
  /external/libchrome/base/files/
dir_reader_fallback.h 12 // Open a directory. If |IsValid| is true, then |Next| can be called to start
20 // Move to the next entry returning false if the iteration is complete.
21 bool Next() { return false; }
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Sample/Tools/Source/VfrCompile/
EfiVfr.h 52 struct _STRUCT_FIELD_DEFINITION *Next;
61 struct _STRUCT_DEFINITION *Next;
83 struct _UINT16_LIST *Next;
89 struct _GOTO_REFERENCE *Next;
95 struct _FORM_ID_VALUE *Next;
106 struct _PARSER_LINE_DEFINITION *Next;
138 struct _IFR_BYTE *Next;
  /external/llvm/include/llvm/IR/
Use.h 108 Use *getNext() const { return Next; }
127 Use *Next;
132 Next = *List;
133 if (Next)
134 Next->setPrev(&Next);
140 *StrippedPrev = Next;
141 if (Next)
142 Next->setPrev(StrippedPrev);
  /device/linaro/bootloader/edk2/Vlv2TbltDevicePkg/PlatformDxe/Observable/
Observable.c 104 Head = Head->Next;
125 if (Head->Next) {
129 Head->Next = DeleteAllSubscribers(Head->Next);
158 Head = Head->Next;
180 if (Head->Next) {
184 Head->Next = DeleteAllObservables(Head->Next);
232 Head->Next = FindAndDeleteObservable(Head->Next, ReferenceGuid);
    [all...]
  /external/clang/test/CodeGen/
2002-08-19-RecursiveLocals.c 7 struct list *Next;
  /external/flatbuffers/tests/FlatBuffers.Test/
Lcg.cs 32 public uint Next()
  /external/pdfium/xfa/fde/
ifx_chariter.h 16 virtual bool Next(bool bPrev = false) = 0;
  /frameworks/base/tools/aapt2/io/
Io.h 36 virtual bool Next(const void** data, size_t* size) = 0;
39 // from Next().
40 // Useful when the last block returned from Next() wasn't fully read.
73 virtual bool Next(void** data, size_t* size) = 0;
76 // from Next().
77 // Useful for when the last block returned from Next() wasn't fully written to.
  /prebuilts/misc/darwin-x86_64/protobuf2.5/include/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...]
  /prebuilts/misc/linux-x86_64/protobuf2.5/include/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...]
  /prebuilts/misc/windows/protobuf2.5/include/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...]
  /prebuilts/tools/linux-x86_64/protoc/include/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...]
  /prebuilts/go/darwin-x86/test/
torture.go 158 Next I
166 Next.(*T).
167 Next.(*T).
168 Next.(*T).
169 Next.(*T).
170 Next.(*T).
171 Next.(*T).
172 Next.(*T).
173 Next.(*T).
174 Next.(*T)
    [all...]
  /prebuilts/go/linux-x86/test/
torture.go 158 Next I
166 Next.(*T).
167 Next.(*T).
168 Next.(*T).
169 Next.(*T).
170 Next.(*T).
171 Next.(*T).
172 Next.(*T).
173 Next.(*T).
174 Next.(*T)
    [all...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Sample/Tools/Source/ProcessDsc/
MultiThread.c 74 NewBuildItem->Next = *BuildList;
117 NewSourceFile->Next = BuildItem->SourceFileList;
162 TempBuildItem = TempBuildItem->Next;
189 NewDependency->Next = BuildItem->DependencyList;
232 TempSourceFile = TempSourceFile->Next;
242 TempDependency = TempDependency->Next;
247 TempBuildItem = TempBuildItem->Next;
291 while (TempComponents->Next != NULL) {
292 TempComponents = TempComponents->Next;
294 TempComponents->Next = NewComponents;
    [all...]
  /external/clang/include/clang/AST/
Redeclarable.h 48 mutable llvm::PointerUnion<NotKnownLatest, KnownLatest> Next;
55 : Next(NotKnownLatest(reinterpret_cast<UninitializedLatest>(&Ctx))) {}
57 : Next(NotKnownLatest(Previous(D))) {}
60 return Next.is<NotKnownLatest>() &&
61 // FIXME: 'template' is required on the next line due to an
63 Next.get<NotKnownLatest>().template is<Previous>();
69 if (Next.is<NotKnownLatest>()) {
70 NotKnownLatest NKL = Next.get<NotKnownLatest>();
75 Next = KnownLatest(*reinterpret_cast<const ASTContext *>(
80 return static_cast<decl_type*>(Next.get<KnownLatest>().get(D))
    [all...]
  /external/swiftshader/third_party/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...]
  /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Sample/Tools/Source/HiiPack/
StringParse.c 34 struct _STRING_PACK_RECORD *Next;
77 for (Rec = mStringPacks; Rec != NULL; Rec = Rec->Next) {
176 for (TempRec = mStringPacks; TempRec->Next != NULL; TempRec = TempRec->Next)
178 TempRec->Next = Rec;
229 STRING_PACK_RECORD *Next;
238 Next = mStringPacks->Next;
240 mStringPacks = Next;
  /external/swiftshader/third_party/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);

Completed in 1358 milliseconds

1 2 3 4 5 6 7 8 91011>>