| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 58 n->next = n->prev = 0;
74 (g_LNodeAllocArray[i].node).next = NULL;
134 (list->head)->next = NULL;
152 newnode->next = NULL;
153 (list->curr)->next = newnode;
162 newnode->next = list->head;
175 newnode->next = (list->curr)->next;
176 (list->curr)->next = newnode;
177 (newnode->next)->prev = newnode
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| BasicTestIterator.java | 31 * Base for iterators that handle predicates. Does the basic next
33 * next node.
120 * Get the next node via getNextXXX. Bottlenecked for derived class override.
121 * @return The next node on the axis, or DTM.NULL.
126 * Returns the next node in the set and advances the position of the
130 * @return The next <code>Node</code> in the set being iterated over, or
146 int next; local
170 next = getNextNode();
172 if (DTM.NULL != next)
174 if(DTMIterator.FILTER_ACCEPT == acceptNode(next))
[all...] |
| /external/chromium/base/ |
| linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers).
19 // Next, to keep track of the list's head/tail, use a LinkedList instance:
38 // node = node->next()) {
72 // A. Doubly-linked lists are made up of nodes that contain "next" and
76 // space for the "next" and "previous" pointers (base::LinkNode<T>*).
78 // needs to glue on the "next" and "previous" pointers using
87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next)
88 : previous_(previous), next_(next) {}
116 LinkNode<T>* next() const { function in class:base::LinkNode
132 void set(LinkNode<T>* prev, LinkNode<T>* next) {
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| ptw32_tkAssocDestroy.c | 65 ThreadKeyAssoc * prev, * next; local
69 next = assoc->nextKey;
72 prev->nextKey = next;
74 if (next != NULL)
76 next->prevKey = prev;
82 assoc->thread->keys = next;
87 * Thread is exiting and we're deleting the assoc to be processed next.
90 assoc->thread->nextAssoc = next;
95 next = assoc->nextThread;
98 prev->nextThread = next;
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| RenderTableCol.cpp | 146 // If |this| is a column-group, the next column is the colgroup's first child column.
150 // Otherwise it's the next column along.
151 RenderObject* next = nextSibling();
153 // Failing that, the child is the last column in a column-group, so the next column is the next column/column-group after its column-group.
154 if (!next && parent()->isRenderTableCol())
155 next = parent()->nextSibling();
157 for (; next && !next->isRenderTableCol(); next = next->nextSibling())
[all...] |
| /external/llvm/include/llvm/Support/ |
| Registry.h | 71 for (listener *Cur = ListenerHead; Cur; Cur = Cur->Next)
87 node *Next;
91 node(const entry& V) : Next(0), Val(V) {
93 Tail->Next = this;
113 iterator &operator++() { Cur = Cur->Next; return *this; }
139 listener *Prev, *Next;
156 listener() : Prev(ListenerTail), Next(0) {
158 Prev->Next = this;
165 if (Next)
166 Next->Prev = Prev
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2013-05-05-IfConvertBug.ll | 86 ; CHECK-NEXT: itt le
87 ; CHECK-NEXT: suble r0, r2, #1
88 ; CHECK-NEXT: bxle lr
89 ; CHECK-NEXT: subs [[REG:r[0-9]+]], #120
90 ; CHECK-NEXT: cmp [[REG]], r1
92 ; CHECK-NEXT: bge [[LABEL:.+]]
93 ; Next BB
96 ; CHECK-NEXT: itt le
97 ; CHECK-NEXT: addle r0, r1, #1
98 ; CHECK-NEXT: bxle l
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| 2011-06-14-mmx-inlineasm.ll | 15 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
16 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
17 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
18 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
19 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
20 ; CHECK-NEXT: movq [[MMXR]] {{%mm[0-7]}}
30 ; CHECK-NEXT: movq {{%mm[0-7]}},
31 ; CHECK-NEXT: movq {{%mm[0-7]}},
32 ; CHECK-NEXT: movq {{%mm[0-7]}},
33 ; CHECK-NEXT: movq {{%mm[0-7]}}
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| store.ll | 9 ; CHECK-NEXT: store i32 123, i32* undef
10 ; CHECK-NEXT: store i32 undef, i32* null
11 ; CHECK-NEXT: ret void
20 ; CHECK-NEXT: ret void
44 ; CHECK-NEXT: %storemerge = phi i32 [ 47, %Cond2 ], [ -987654321, %Cond ]
45 ; CHECK-NEXT: ret i32 %storemerge
64 ; CHECK-NEXT: %storemerge = phi i32 [ -987654321, %Cond ], [ 47, %0 ]
65 ; CHECK-NEXT: ret i32 %storemerge
81 ; CHECK-NEXT: %storemerge = phi i32
82 ; CHECK-NEXT: store i32 %storemerge, i32* %P, align
[all...] |
| icmp.ll | 13 ; CHECK-NEXT: ret i32
23 ; CHECK-NEXT: xor i32
24 ; CHECK-NEXT: ret i32
34 ; CHECK-NEXT: ret i32
44 ; CHECK-NEXT: xor i32
45 ; CHECK-NEXT: ret i32
64 ; CHECK-NEXT: ashr i32 %a, 31
65 ; CHECK-NEXT: %f = and i32 %e, %b
66 ; CHECK-NEXT: ret i32 %f
124 ; CHECK-NEXT: = xor i1 %A, tru
[all...] |
| vec_shuffle.ll | 28 ; CHECK-NEXT: extractelement
29 ; CHECK-NEXT: ret
37 ; CHECK-NEXT: extractelement
38 ; CHECK-NEXT: ret
46 ; CHECK-NEXT: extractelement
47 ; CHECK-NEXT: ret
57 ; CHECK-NEXT: ret <4 x float> %tmp45.i
65 ; CHECK-NEXT: shufflevector
66 ; CHECK-NEXT: ret
81 ; CHECK-NEXT: shufflevecto
[all...] |
| /external/llvm/lib/Analysis/ |
| PathProfileInfo.cpp | 125 for( BLEdgeIterator next = node->succBegin(),
126 end = node->succEnd(); next != end; next++ ) {
127 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges
128 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges
129 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber
130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one?
131 best = *next;
143 BallLarusEdge* next = getNextEdge(currentNode, increment); local
145 increment -= next->getWeight()
182 BallLarusEdge* next = getNextEdge(currentNode, increment); local
[all...] |
| /external/chromium_org/net/disk_cache/simple/ |
| simple_index_file_win.cc | 24 for (base::FilePath file_path = enumerator.Next(); !file_path.empty();
25 file_path = enumerator.Next()) {
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| scrollbar-crash-on-hide-scrolled-area.html | 31 Manual repro: scroll down and click on <b>Next step</b>
33 <a href="#" class="nextStepButton" onclick="document.getElementById('toHide').style.display='none'">Next step</a>
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
| shell.js | 28 var ch = stream.next();
68 var next, end = false, escaped = false;
69 while ((next = stream.next()) != null) {
70 if (next === quote && !escaped) {
74 if (next === '$' && !escaped && quote !== '\'') {
80 escaped = !escaped && next === '\\';
91 var ch = stream.next(), hungry = /\w/;
|
| /external/chromium_org/third_party/libjingle/source/talk/base/ |
| win32toolhelp.h | 31 // - implement bool Next(HANDLE, T*) normally calls a
50 // Moves forward to the next object using the First and Next
51 // pointers. If either First or Next ever indicates an failure
54 bool Next() {
66 incr_ok = Traits::Next(snapshot_, ¤t_);
123 static bool Next(HANDLE handle, Type* t) {
147 static bool Next(HANDLE handle, Type* t) {
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
| draw_pipe_util.c | 15 * next paragraph) shall be included in all copies or substantial portions
42 stage->next->point(stage->next, header);
48 stage->next->line(stage->next, header);
54 stage->next->tri(stage->next, header);
122 stage = stage->next;
|
| /external/chromium_org/third_party/re2/util/ |
| random.cc | 11 int32 ACMRandom::Next() {
31 return Next() % n;
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkTextToPathIter.h | 33 bool next(const SkPath** path, SkScalar* xpos);
44 SkScalar fXPos; // accumulated xpos, returned in next
|
| /external/clang/lib/Basic/ |
| VersionTuple.cpp | 42 char next = input[0]; local
44 if (next < '0' || next > '9') return true;
45 value = (unsigned) (next - '0');
48 next = input[0];
49 if (next < '0' || next > '9') return false;
51 value = value * 10 + (unsigned) (next - '0');
|
| /external/clang/test/CodeGen/ |
| pointer-signext.c | 7 // CHECK-NEXT: [[Q:%.*]] = inttoptr i64 [[P]] to [[R:%.*\*]]
8 // CHECK-NEXT: {{%.*}} = getelementptr inbounds [[R]] [[Q]], i64 0, i32 0
|
| /external/clang/test/CodeGenCXX/ |
| 2009-12-23-MissingSext.cpp | 12 // CHECK-NEXT: ashr i32 %[[val]]
16 // CHECK-NEXT: ashr i32 %[[val]]
|
| apple-kext-indirect-virtual-dtor-call.cpp | 5 // CHECK-NEXT: call void [[T1]](%struct.B1* [[T2:%.*]])
8 // CHECK-NEXT: call void [[T3]](%struct.B1* [[T4:%.*]])
|
| /external/clang/test/CodeGenObjC/ |
| constant-strings.m | 2 // RUN: FileCheck --check-prefix=CHECK-NEXT < %t %s
6 // CHECK-NEXT: @.str = {{.*}}constant [13 x i8] c"Hello World!\00", align 1
|
| /external/clang/test/CodeGenObjCXX/ |
| nrvo.mm | 18 // CHECK-NEXT: ret void
28 // CHECK-NEXT: ret void
|
