/external/syslinux/core/thread/ |
H A D | kill_thread.c | 18 * Muck with the stack so that the next time the thread is run then 28 block->list.next->prev = block->list.prev; 29 block->list.prev->next = block->list.next;
|
/external/libcxx/test/std/containers/associative/multimap/multimap.ops/ |
H A D | upper_bound.pass.cpp | 48 assert(r == next(m.begin(), 3)); 50 assert(r == next(m.begin(), 3)); 52 assert(r == next(m.begin(), 6)); 54 assert(r == next(m.begin(), 6)); 56 assert(r == next(m.begin(), 9)); 78 assert(r == next(m.begin(), 3)); 80 assert(r == next(m.begin(), 3)); 82 assert(r == next(m.begin(), 6)); 84 assert(r == next(m.begin(), 6)); 86 assert(r == next( [all...] |
/external/libxml2/doc/examples/ |
H A D | xpath1.c | 151 xmlChar* next; local 162 next = nsListDup; 163 while(next != NULL) { 165 while((*next) == ' ') next++; 166 if((*next) == '\0') break; 169 prefix = next; 170 next = (xmlChar*)xmlStrchr(next, '='); 171 if(next [all...] |
/external/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_util.cpp | 29 for (Item *next, *item = head.next; item != &head; item = next) { 30 next = item->next; 33 head.next = head.prev = &head; 43 pos = pos->next; 56 pos = pos->next; 67 ins->next = pos->next; [all...] |
/external/syslinux/com32/lib/syslinux/ |
H A D | zonelist.c | 63 sp->next = ep; 67 ep->next = NULL; 99 mpp = &mp->next; 112 range->next = mp; 113 mpp = &range->next; 121 mpp = &mp->next; 127 *mpp = mp->next; 141 range->next = mp; 146 *mpp = mp->next; 170 llast = list->next [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | PathProfileInfo.cpp | 126 for( BLEdgeIterator next = node->succBegin(), 127 end = node->succEnd(); next != end; next++ ) { 128 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges 129 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges 130 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber 131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 132 best = *next; 144 BallLarusEdge* next = getNextEdge(currentNode, increment); local 146 increment -= next 183 BallLarusEdge* next = getNextEdge(currentNode, increment); local [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | SelfIteratorNoPredicate.java | 66 * Returns the next node in the set and advances the position of the 70 * @return The next <code>Node</code> in the set being iterated over, or 78 int next; 80 m_lastFetched = next = (DTM.NULL == m_lastFetched) 84 // m_lastFetched = next; 85 if (DTM.NULL != next) 89 return next;
|
/external/e2fsprogs/lib/et/ |
H A D | error_table.h | 18 struct et_list *next; member in struct:et_list
|
/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 21 struct et_list *next; member in struct:et_list 42 for (end = list, et = *list; et; end = &et->next, et = et->next) 53 et->next = 0;
|
H A D | heimdal3.c | 22 struct et_list *next; member in struct:et_list 43 for (end = list, et = *list; et; end = &et->next, et = et->next) 54 et->next = 0;
|
/external/e2fsprogs/lib/ss/ |
H A D | ss_err.c | 32 struct et_list *next; member in struct:et_list 53 for (end = list, et = *list; et; end = &et->next, et = et->next) 64 et->next = 0;
|
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
H A D | CDL.java | 49 * Get the next value. The value can be wrapped in quotes. The value can 58 c = x.next(); 90 char c = x.next();
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | ValueIterator.java | 29 * while (iterator.next(result)) { 42 * <p>The return result container of each iteration. Stores the next 71 * <p>Returns the next result for this iteration and returns 79 public boolean next(Element element); method in interface:ValueIterator 90 * <p>If setRange(start, end) is not performed before next(element) is 95 * implementation, next(element) will always return false.
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
H A D | ValueIterator.java | 28 * while (iterator.next(result)) { 42 * <p>The return result container of each iteration. Stores the next 75 * <p>Returns the next result for this iteration and returns 84 public boolean next(Element element); method in interface:ValueIterator 97 * <p>If setRange(start, end) is not performed before next(element) is 102 * implementation, next(element) will always return false.
|
/external/iproute2/genl/ |
H A D | genl_utils.h | 9 struct genl_util *next; member in struct:genl_util
|
/external/ipsec-tools/src/racoon/ |
H A D | throttle.h | 39 TAILQ_ENTRY(throttle_entry) next; member in struct:throttle_entry
|
/external/javassist/src/main/javassist/convert/ |
H A D | TransformAfter.java | 23 public TransformAfter(Transformer next, argument 27 super(next, origMethod, afterMethod); 37 pos = iterator.next(); 44 return iterator.next();
|
/external/kmod/testsuite/ |
H A D | stripped-module.h | 11 struct list_head *next, *prev; member in struct:list_head
|
/external/libchrome/base/strings/ |
H A D | pattern.cc | 21 NEXT next) { 30 // next character. 33 next(pattern, pattern_end); 40 base_icu::UChar32 pattern_char = next(&pattern_next, pattern_end); 41 if (pattern_char == next(&string_next, string_end) && 62 static void EatWildcard(const CHAR** pattern, const CHAR* end, NEXT next) { argument 66 next(pattern, end); 74 NEXT next) { 80 EatSameChars(&pattern, pattern_end, &eval, eval_end, next); 85 EatWildcard(&pattern, pattern_end, next); 19 EatSameChars(const CHAR** pattern, const CHAR* pattern_end, const CHAR** string, const CHAR* string_end, NEXT next) argument 71 MatchPatternT(const CHAR* eval, const CHAR* eval_end, const CHAR* pattern, const CHAR* pattern_end, int depth, NEXT next) argument [all...] |
/external/libcxx/test/std/containers/associative/map/map.cons/ |
H A D | assign_initializer_list.pass.cpp | 45 assert(*next(m.begin()) == V(2, 1)); 46 assert(*next(m.begin(), 2) == V(3, 1)); 70 assert(*next(m.begin()) == V(2, 1)); 71 assert(*next(m.begin(), 2) == V(3, 1));
|
H A D | initializer_list.pass.cpp | 41 assert(*next(m.begin()) == V(2, 1)); 42 assert(*next(m.begin(), 2) == V(3, 1)); 62 assert(*next(m.begin()) == V(2, 1)); 63 assert(*next(m.begin(), 2) == V(3, 1));
|
/external/libcxx/test/std/containers/associative/map/map.modifiers/ |
H A D | insert_initializer_list.pass.cpp | 43 assert(*next(m.begin()) == V(2, 1)); 44 assert(*next(m.begin(), 2) == V(3, 1)); 66 assert(*next(m.begin()) == V(2, 1)); 67 assert(*next(m.begin(), 2) == V(3, 1));
|
/external/libcxx/test/std/containers/associative/set/ |
H A D | insert_iter_iter.pass.cpp | 45 assert(*next(m.begin()) == 2); 46 assert(*next(m.begin(), 2) == 3); 69 assert(*next(m.begin()) == 2); 70 assert(*next(m.begin(), 2) == 3);
|
/external/libcxx/test/std/containers/associative/set/set.cons/ |
H A D | iter_iter.pass.cpp | 44 assert(*next(m.begin()) == 2); 45 assert(*next(m.begin(), 2) == 3); 67 assert(*next(m.begin()) == 2); 68 assert(*next(m.begin(), 2) == 3);
|
/external/mesa3d/src/gallium/drivers/trace/ |
H A D | tr_screen.h | 15 * next paragraph) shall be included in all copies or substantial portions 42 struct tr_list *next; member in struct:tr_list
|