/frameworks/base/core/java/android/os/ |
MessageQueue.java | 45 // Indicates whether next() is blocked waiting in pollOnce() with a non-zero timeout. 48 // The next barrier token. 128 Message next() { method in class:MessageQueue 141 // Try to retrieve the next message. Return if found. 146 // Stalled by a barrier. Find the next asynchronous message in the queue. 149 msg = msg.next; 154 // Next message is not ready. Set a timeout to wake up when it is ready. 160 prevMsg.next = msg.next; 162 mMessages = msg.next; [all...] |
/external/smack/src/org/xbill/DNS/ |
Tokenizer.java | 184 int next = is.read(); local 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 token in the stream, as a string 372 Token next = get(); local 381 Token next = get(); local 407 String next = _getIdentifier("an integer"); local 474 String next = _getIdentifier("a TTL value"); local 492 String next = _getIdentifier("a TTL-like value"); local 513 String next = _getIdentifier("a name"); local 535 String next = _getIdentifier("an address"); local 551 Token next = get(); local 661 String next = _getIdentifier("a hex string"); local 677 String next = _getIdentifier("a base32 string"); local [all...] |
/external/checkpolicy/ |
queue.c | 38 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 == NULL [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/draw/ |
draw_pipe_unfilled.c | 15 * 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->flush( stage->next, flags ) [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_pipe_unfilled.c | 15 * 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->flush( stage->next, flags ) [all...] |
/external/oprofile/libop/ |
op_alloc_counter.c | 24 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)->next == &ctr_arc[depth].next) [all...] |
/sdk/emulator/qtools/ |
hash_table.h | 16 entry *next; member in struct:HashTable::entry 67 entry_type *ptr, *next; local 70 // Save the next pointer before deleting each entry so that we 72 for (ptr = table_[ii]; ptr; ptr = next) { 73 next = ptr->next; 103 for (entry_type *ptr = table_[pos]; ptr; ptr = ptr->next) { 119 ptr->next = table_[pos]; 134 for (entry_type *ptr = table_[pos]; ptr; prev = ptr, ptr = ptr->next) { 137 table_[pos] = ptr->next; [all...] |
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
StringCharacterIteratorTest.java | 129 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/ |
i915_fpc_optimize.c | 15 * 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) 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], ¤t->FullInstruction.Dst[0]) && 208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) && 209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) && 212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask) [all...] |
/external/mesa3d/src/gallium/drivers/i915/ |
i915_fpc_optimize.c | 15 * 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) 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], ¤t->FullInstruction.Dst[0]) && 208 same_src_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Src[1]) && 209 !same_src_dst_reg(&next->FullInstruction.Src[0], ¤t->FullInstruction.Dst[0]) && 212 is_unswizzled(&next->FullInstruction.Src[0], next->FullInstruction.Dst[0].Register.WriteMask) [all...] |
/cts/tests/tests/graphics/src/android/graphics/cts/ |
RegionIteratorTest.java | 37 regionIterator.next(null); 41 assertTrue(regionIterator.next(rect)); 47 assertFalse(regionIterator.next(rect)); 58 assertTrue(regionIterator.next(rect)); 63 assertTrue(regionIterator.next(rect)); 68 assertTrue(regionIterator.next(rect)); 74 assertFalse(regionIterator.next(rect)); 85 assertTrue(regionIterator.next(rect)); 90 assertTrue(regionIterator.next(rect)); 96 assertFalse(regionIterator.next(rect)) [all...] |
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
stringpool.c | 22 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/ |
test_task_runner.cc | 41 // 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/ |
get_readline.c | 47 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/ |
ParameterizedAssertionError.java | 33 Object next = iter.next(); local 34 buffer.append(stringValueOf(next)); 42 private static String stringValueOf(Object next) { 44 return String.valueOf(next);
|
/external/mockito/src/org/mockito/internal/verification/checkers/ |
NonGreedyNumberOfInvocationsInOrderChecker.java | 39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context ); local 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/ |
ContactParser.java | 61 final char next = lexer.lookAhead(1); local 62 if (next == ' ' || next == '\t' || next == '\r' || next == '\n') {
|
/libcore/luni/src/main/java/java/util/ |
ListResourceBundle.java | 63 String next = pEnum.nextElement(); local 64 if (!table.containsKey(next)) { 65 nextElement = next; 81 return local.next(); 101 return it.next();
|
/libcore/luni/src/test/java/libcore/java/util/ |
ServiceLoaderTest.java | 35 assertTrue(it.next() instanceof Impl1); 37 assertTrue(it.next() instanceof Impl2); 44 ServiceLoader.load(ServiceLoaderTestInterfaceMissingClass.class).iterator().next(); 55 ServiceLoader.load(ServiceLoaderTestInterfaceWrongType.class).iterator().next(); 65 ServiceLoader.load(ServiceLoaderTestInterfaceParseError.class).iterator().next();
|
/ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/aux_/ |
iterator.hpp | 43 struct next< l_iter<Node> > struct in namespace:boost::mpl 45 typedef l_iter< typename Node::next > type; 56 typedef l_iter< typename mpl::next<Node>::type > next; 68 typedef l_iter next; typedef in struct:boost::mpl::l_iter
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
nv50_ir_bb.cpp | 60 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 = p 478 Instruction *insn, *next; local [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
nv50_ir_bb.cpp | 60 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 = p 478 Instruction *insn, *next; local [all...] |
/external/smack/src/org/jivesoftware/smack/util/ |
Cache.java | 233 public V next() { method 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. 414 // Next, delete the least recently used elements until 10% of the cache 508 head.next = head.previous = head; 517 LinkedListNode node = head.next; 544 node.next = head.next; [all...] |
/external/valgrind/main/coregrind/ |
m_stacks.c | 89 struct _Stack *next; member in struct:_Stack 93 static UWord next_id; /* Next id we hand out to a newly registered 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) [all...] |
/external/zlib/src/contrib/blast/ |
blast.c | 41 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, 0 for literals, 1 for length/distance [all...] |