| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/ |
| radeon_rename_regs.c | 15 * next paragraph) shall be included in all copies or substantial
56 for(inst = c->Program.Instructions.Next;
58 inst = inst->Next) {
70 for (var_ptr = variables; var_ptr; var_ptr = var_ptr->Next) {
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/svgadump/ |
| svga_dump.py | 214 const uint8_t *next = body + size;
235 print ' while(body + sizeof(%s) <= next) {' % footer
241 print ' (unsigned)(next - body)/sizeof(uint32_t),'
243 print ' body = next;'
251 while(body + sizeof(uint32_t) <= next) {
255 while(body + sizeof(uint32_t) <= next)
263 const uint8_t *next = commands;
264 const uint8_t *last = next + size;
268 while(next < last) {
269 const uint32_t cmd_id = *(const uint32_t *)next;
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| ralloc.c | 11 * The above copyright notice and this permission notice (including the next
66 struct ralloc_header *next; member in struct:ralloc_header
92 info->next = parent->child;
95 if (info->next != NULL)
96 info->next->prev = info;
148 info->prev->next = info;
150 if (info->next != NULL)
151 info->next->prev = info;
155 for (child = info->child; child != NULL; child = child->next)
217 info->parent->child = info->next;
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/engine/ |
| eng_list.c | 73 * engine_list_head, and each non-null "next" pointer account for
111 iterator = iterator->next;
138 (engine_list_tail->next != NULL))
144 engine_list_tail->next = e;
153 e->next = NULL;
170 iterator = iterator->next;
178 if(e->next)
179 e->next->prev = e->prev;
181 e->prev->next = e->next;
[all...] |
| /external/chromium_org/third_party/re2/util/ |
| random.h | 18 int32 Next();
|
| /external/chromium_org/third_party/skia/include/effects/ |
| Sk2DPathEffect.h | 28 next() will receive u and v values within these bounds,
32 virtual void next(const SkPoint& loc, int u, int v, SkPath* dst) const;
36 The default implementation calls next() repeatedly with each
96 virtual void next(const SkPoint&, int u, int v, SkPath*) const SK_OVERRIDE;
|
| /external/chromium_org/third_party/skia/src/images/ |
| SkImageEncoder_Factory.cpp | 25 curr = curr->next();
|
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkPathOpsSimplify.cpp | 47 SkOpSegment* next = current->findNextWinding(&chaseArray, &nextStart, &nextEnd, local
49 if (!next) {
64 current = next;
112 SkOpSegment* next = current->findNextXor(&nextStart, &nextEnd, &unsortable); local
113 if (!next) {
128 current = next;
180 SkOpContour* next; local
182 next = *nextPtr++;
183 } while (AddIntersectTs(current, next) && nextPtr != listEnd);
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| free_list.h | 68 inline void EnsureNonLoop(void* node, void* next) {
71 if (node != next) return;
72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next);
92 // Returns value of the |next| pointer w/out running a sanity check.
116 void *next = FL_Next_No_Check(t); local
117 if (next) {
118 FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__);
120 return next;
124 // |*list|, and updates |*list| to point to the next element in the
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 75 // Next two fields: in unallocated blocks: freelist skiplist data
78 AllocList *next[kMaxLevel]; // actually has levels elements. member in struct:low_level_alloc_internal::AllocList
121 // level<kMaxLevel and next[level-1] will fit in the node.
127 int max_fit = (size-OFFSETOF_MEMBER(AllocList, next)) / sizeof (AllocList *);
143 for (AllocList *n; (n = p->next[level]) != 0 && n < e; p = n) {
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
160 e->next[i] = prev[i]->next[i];
161 prev[i]->next[i] = e;
172 for (int i = 0; i != e->levels && prev[i]->next[i] == e; i++)
363 AllocList *next = prev->next[i]; local
[all...] |
| /external/chromium_org/tools/gn/ |
| file_template.cc | 95 size_t next = str.find("{{", cur); local
98 if (next == std::string::npos) {
102 } else if (next > cur) {
104 Subrange(Subrange::LITERAL, str.substr(cur, next - cur)));
108 if (str.compare(next, arraysize(kSource) - 1, kSource) == 0) {
111 cur = next + arraysize(kSource) - 1;
112 } else if (str.compare(next, arraysize(kSourceNamePart) - 1,
116 cur = next + arraysize(kSourceNamePart) - 1;
122 cur = next + 1;
|
| /external/chromium_org/tools/gyp/test/mac/postbuild-defaults/ |
| postbuild-defaults.sh | 12 # This is the source Info.plist next to this script file.
|
| /external/chromium_org/tools/valgrind/gtest_exclude/ |
| base_unittests.gtest-drmemory_win32.txt | 10 # Next test creates a child that crashes, which naturally generates an
|
| /external/chromium_org/ui/base/test/data/ |
| resource.h | 18 // Next default values for new objects
|
| /external/chromium_org/ui/views/ime/ |
| mock_input_method.h | 71 // Composition information for the next key event. It'll be cleared
72 // automatically after dispatching the next key event.
76 // Result text for the next key event. It'll be cleared automatically after
77 // dispatching the next key event.
|
| /external/chromium_org/webkit/browser/fileapi/ |
| file_system_file_util.cc | 9 base::FilePath FileSystemFileUtil::EmptyFileEnumerator::Next() {
|
| /external/clang/lib/Format/ |
| FormatToken.h | 88 Next(NULL) {}
164 /// \brief The length of following tokens until the next natural split point,
165 /// or the next token that can be broken.
228 (!ColonRequired || (Next && Next->is(tok::colon)));
232 return is(tok::at) && Next && (Next->isObjCAtKeyword(tok::objc_public) ||
233 Next->isObjCAtKeyword(tok::objc_protected) ||
234 Next->isObjCAtKeyword(tok::objc_package) ||
235 Next->isObjCAtKeyword(tok::objc_private))
[all...] |
| /external/clang/test/CodeCompletion/ |
| using-namespace.cpp | 20 // CHECK-CC1-NEXT: N4
|
| using.cpp | 23 // CHECK-CC1-NEXT: N4
|
| /external/clang/test/CodeGen/ |
| 2002-08-19-RecursiveLocals.c | 7 struct list *Next;
|
| debug-info-line2.c | 13 // CHECK-NEXT: store i32 %{{[a-zA-Z0-9]+}}
|
| /external/clang/test/CodeGenCXX/ |
| return.cpp | 8 // CHECK-NEXT: unreachable
|
| /external/clang/test/CodeGenObjC/ |
| complex-double-abi.m | 13 // CHECK-NEXT: [[I:%.*]] = phi double [ [[I1:%.*]], [[MSGCALL]] ], [ 0.000000e+00, [[NULLINIT]] ]
|
| /external/clang/test/Index/ |
| complete-categories.m | 28 // CHECK-CC2-NEXT: ObjCCategoryDecl:{TypedText Cat3}
35 // CHECK-CC4-NEXT: ObjCCategoryDecl:{TypedText Cat3}
38 // CHECK-CC5-NEXT: ObjCCategoryDecl:{TypedText Cat2}
39 // CHECK-CC5-NEXT: ObjCCategoryDecl:{TypedText Cat3}
|
