Searched refs:next (Results 176 - 200 of 4746) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/WebKit/Source/core/rendering/style/
H A DFillLayer.cpp174 for (curr = this; curr && curr->isXPositionSet(); curr = curr->next()) { }
177 for (FillLayer* pattern = this; curr; curr = curr->next()) {
183 pattern = pattern->next();
189 for (curr = this; curr && curr->isYPositionSet(); curr = curr->next()) { }
192 for (FillLayer* pattern = this; curr; curr = curr->next()) {
198 pattern = pattern->next();
204 for (curr = this; curr && curr->isAttachmentSet(); curr = curr->next()) { }
207 for (FillLayer* pattern = this; curr; curr = curr->next()) {
209 pattern = pattern->next();
215 for (curr = this; curr && curr->isClipSet(); curr = curr->next()) { }
296 FillLayer* next; local
[all...]
/external/smack/src/org/xbill/DNS/
H A DTokenizer.java184 int next = is.read();
185 if (next != '\n')
186 is.unread(next);
225 * Gets the next token from a tokenizer.
229 * @return The next token in the stream.
339 * Gets the next token from a tokenizer, ignoring whitespace and comments.
340 * @return The next token in the stream.
350 * Returns a token to the stream, so that it will be returned by the next call
365 * Gets the next token from a tokenizer and converts it to a string.
366 * @return The next toke
[all...]
/external/checkpolicy/
H A Dqueue.c38 newnode->next = NULL;
43 q->tail->next = newnode;
62 newnode->next = NULL;
67 newnode->next = q->head;
86 q->head = q->head->next;
117 p = p->next;
137 p = p->next;
158 last->next = p->next;
159 if (last->next
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/
H A Ddraw_pipe_unfilled.c15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next
[all...]
/external/mesa3d/src/gallium/auxiliary/draw/
H A Ddraw_pipe_unfilled.c15 * next paragraph) shall be included in all copies or substantial portions
65 stage->next->point( stage->next, &tmp );
75 stage->next->line( stage->next, &tmp );
100 stage->next->reset_stipple_counter( stage->next );
145 stage->next->tri( stage->next, header );
177 stage->next
[all...]
/external/oprofile/libop/
H A Dop_alloc_counter.c24 struct list_head next; member in struct:counter_arc_head
31 /** the next counter allowed for this event */
32 struct list_head next; member in struct:counter_arc
56 list_init(&ctr_arc[i].next);
69 list_add_tail(&arc->next, &ctr_arc[i].next);
90 list_for_each_safe(pos, pos2, &ctr_arc[i].next) {
91 counter_arc * arc = list_entry(pos, counter_arc, next);
92 list_del(&arc->next);
135 if((&ctr_arc[depth].next)
[all...]
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DStringCharacterIteratorTest.java129 sci1.next();
131 sci0.next();
167 fixture.next();
181 fixture.next();
192 assertEquals("Wrong next char", 't', it1.next());
254 fixture.next();
266 * @tests java.text.StringCharacterIterator.next()
271 assertEquals('i', fixture.next());
273 assertEquals('x', fixture.next());
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/i915/
H A Di915_fpc_optimize.c15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next) argument
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], &current->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next
282 i915_fpc_optimize_useless_mov_after_inst(union i915_full_token* current, union i915_full_token* next) argument
[all...]
/external/mesa3d/src/gallium/drivers/i915/
H A Di915_fpc_optimize.c15 * next paragraph) shall be included in all copies or substantial portions
200 static void i915_fpc_optimize_mov_after_alu(union i915_full_token* current, union i915_full_token* next) argument
203 next->Token.Type == TGSI_TOKEN_TYPE_INSTRUCTION &&
205 current->FullInstruction.Instruction.Saturate == next->FullInstruction.Instruction.Saturate &&
206 next->FullInstruction.Instruction.Opcode == TGSI_OPCODE_MOV &&
207 same_dst_reg(&next->FullInstruction.Dst[0], &current->FullInstruction.Dst[0]) &&
208 same_src_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Src[1]) &&
209 !same_src_dst_reg(&next->FullInstruction.Src[0], &current->FullInstruction.Dst[0]) &&
212 is_unswizzled(&next->FullInstruction.Src[0], next
282 i915_fpc_optimize_useless_mov_after_inst(union i915_full_token* current, union i915_full_token* next) argument
[all...]
/external/chromium_org/native_client_sdk/src/libraries/xray/
H A Dstringpool.c22 struct XRayStringPoolNode* next; member in struct:XRayStringPoolNode
37 s->next = NULL;
60 pool->current->next = XRayStringPoolAllocNode();
61 pool->current = pool->current->next;
87 n = n->next;
/external/chromium_org/net/quic/test_tools/
H A Dtest_task_runner.cc41 // Find the next task to run, advance the time to the correct time
43 std::vector<PostedTask>::iterator next = FindNextTask(); local
44 DCHECK(next != tasks_.end());
46 (next->GetTimeToRun() - clock_->NowInTicks()).InMicroseconds()));
47 PostedTask task = *next;
48 tasks_.erase(next);
/external/e2fsprogs/lib/ss/
H A Dget_readline.c47 char *tmp, *cp, *next; local
63 for (cp = tmp; cp; cp = next) {
64 next = strchr(cp, ':');
65 if (next)
66 *next++ = 0;
/external/junit/src/org/junit/experimental/theories/internal/
H A DParameterizedAssertionError.java33 Object next = iter.next();
34 buffer.append(stringValueOf(next));
42 private static String stringValueOf(Object next) { argument
44 return String.valueOf(next);
/external/mockito/src/org/mockito/internal/verification/checkers/
H A DNonGreedyNumberOfInvocationsInOrderChecker.java39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context );
40 if( next == null ){
43 marker.markVerified( next, wanted );
44 context.markVerified( next );
45 lastLocation = next.getLocation();
/external/nist-sip/java/gov/nist/javax/sip/parser/
H A DContactParser.java61 final char next = lexer.lookAhead(1);
62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
/external/v8/test/mjsunit/regress/
H A Dregress-1713.js46 function Node(v, next) { this.v = v; this.next = next; }
50 while (n.next !== null) n = n.next;
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_bb.cpp60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next
478 Instruction *insn, *next; local
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_bb.cpp60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next
478 Instruction *insn, *next; local
[all...]
/external/smack/src/org/jivesoftware/smack/util/
H A DCache.java233 public V next() {
234 return it.next().object;
300 public Entry<K, V> next() {
301 Map.Entry<K, CacheObject<V>> entry = it.next();
391 // Get the next node.
508 head.next = head.previous = head;
517 LinkedListNode node = head.next;
544 node.next = head.next;
546 node.previous.next
629 public LinkedListNode next; field in class:Cache.LinkedListNode
652 LinkedListNode(Object object, LinkedListNode next, LinkedListNode previous) argument
[all...]
/external/valgrind/main/coregrind/
H A Dm_stacks.c89 struct _Stack *next; member in struct:_Stack
118 st0 = st0->next;
126 vg_assert(st2->next == st1);
127 vg_assert(st1->next == st0);
128 tmp = st0->next;
129 st2->next = st0;
130 st0->next = st1;
131 st1->next = tmp;
137 vg_assert(st1->next == st0);
138 st1->next
[all...]
/external/zlib/src/contrib/blast/
H A Dblast.c41 unsigned char *in; /* next input location */
52 unsigned next; /* index of next write location in out[] */ member in struct:state
133 int left; /* bits left in next or left to process */
134 short *next; /* next number of codes */ local
140 next = h->count + 1;
145 count = *next++;
151 index += count; /* else update for next length */
256 * next,
[all...]
/external/bison/src/
H A Dsymlist.c53 res->next = NULL;
72 res->next = NULL;
90 res->next = NULL;
108 res->next = NULL;
121 for (/* Nothing. */; l && l->content.sym; l = l->next)
138 node->next = list;
150 symbol_list *node, *next; local
151 for (node = list; node; node = next)
153 next = node->next;
[all...]
/external/javassist/src/main/javassist/bytecode/analysis/
H A DIntQueue.java21 private IntQueue.Entry next; field in class:IntQueue.Entry
34 tail.next = entry;
50 head = head.next;
/external/javassist/src/main/javassist/convert/
H A DTransformer.java34 private Transformer next; field in class:Transformer
37 next = t;
40 public Transformer getNext() { return next; }
/external/valgrind/main/callgrind/
H A Dcosts.c51 cc->next = 0;
54 cost_chunk_current->next = cc;
74 cc_next = cc->next;

Completed in 5237 milliseconds

1234567891011>>