/external/valgrind/main/memcheck/tests/ |
H A D | leak-cases.c | 42 struct _Node* next; member in struct:_Node 48 Node* mk(Node* next) argument 53 x->next = next; 82 (p6->next)++; // 16/1 possibly lost 88 (p8->next)++; // 16/1 possibly lost 92 (p9->next)++; // 32(16d,16i)/1 definitely lost (double count!)
|
/external/smack/src/org/xbill/DNS/ |
H A D | NXTRecord.java | 21 private Name next; field in class:NXTRecord 33 * @param next The following name in an ordered list of the zone 37 NXTRecord(Name name, int dclass, long ttl, Name next, BitSet bitmap) { argument 39 this.next = checkName("next", next); 45 next = new Name(in); 58 next = st.getName(origin); 76 sb.append(next); 86 /** Returns the next nam [all...] |
/external/llvm/test/CodeGen/SystemZ/Large/ |
H A D | branch-range-01.py | 79 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 84 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 87 print '%s:' % next
|
H A D | branch-range-03.py | 79 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 85 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 88 print '%s:' % next
|
H A D | branch-range-04.py | 44 # ...as mentioned above, the next one could be a CGRJE instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 89 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 92 print '%s:' % next
|
H A D | branch-range-05.py | 44 # ...as mentioned above, the next one could be a CIJL instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 88 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 91 print '%s:' % next
|
H A D | branch-range-06.py | 44 # ...as mentioned above, the next one could be a CGIJL instead... 83 next = 'before%d' % (i + 1) if i + 1 < branch_blocks else 'main' variable 88 print ' br i1 %%btest%d, label %%after0, label %%%s' % (i, next) 91 print '%s:' % next
|
/external/srec/seti/sltsEngine/src/ |
H A D | 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) [all...] |
/external/chromium_org/third_party/mesa/src/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/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/llvm/lib/Analysis/ |
H A D | 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 182 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/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/common/ |
H A D | lru_cache.py | 31 self.next = None 60 self._last = self._last.next 64 self._first.next = node 81 next_last = self._last.next 85 next_first.next = None 86 self._first.next = next_first 92 node.next.prev = node.prev 93 node.prev.next = node.next 95 node.next [all...] |
/external/chromium_org/third_party/mesa/src/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
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkAddIntersections.h | 14 bool AddIntersectTs(SkOpContour* test, SkOpContour* next);
|
/external/chromium_org/tools/perf/clear_system_cache/ |
H A D | clear_system_cache_main.cc | 45 for (base::FilePath next = enumerator.Next(); !next.empty(); 46 next = enumerator.Next()) { 47 ClearCacheForFile(next);
|
/external/e2fsprogs/e2fsck/ |
H A D | prof_err.c | 49 struct et_list *next; member in struct:et_list 70 for (end = list, et = *list; et; end = &et->next, et = et->next) 81 et->next = 0;
|
/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 19 struct et_list *next; member in struct:et_list 40 for (end = list, et = *list; et; end = &et->next, et = et->next) 51 et->next = 0;
|
H A D | heimdal.c | 100 struct et_list *next; member in struct:et_list 121 for (end = list, et = *list; et; end = &et->next, et = et->next) 132 et->next = 0;
|
H A D | heimdal2.c | 86 struct et_list *next; member in struct:et_list 107 for (end = list, et = *list; et; end = &et->next, et = et->next) 118 et->next = 0;
|
H A D | heimdal3.c | 20 struct et_list *next; member in struct:et_list 41 for (end = list, et = *list; et; end = &et->next, et = et->next) 52 et->next = 0;
|
H A D | imap_err.c | 48 struct et_list *next; member in struct:et_list 69 for (end = list, et = *list; et; end = &et->next, et = et->next) 80 et->next = 0;
|
H A D | simple.c | 40 struct et_list *next; member in struct:et_list 61 for (end = list, et = *list; et; end = &et->next, et = et->next) 72 et->next = 0;
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext2_err.c | 42 "Can't read next inode", 133 "No 'next' extent", 155 struct et_list *next; member in struct:et_list 176 for (end = list, et = *list; et; end = &et->next, et = et->next) 187 et->next = 0;
|
/external/guava/guava/src/com/google/common/base/ |
H A D | AbstractIterator.java | 40 private T next; field in class:AbstractIterator 64 next = computeNext(); 73 public final T next() { method in class:AbstractIterator 78 return next;
|