/external/iproute2/tc/ |
H A D | m_pedit.h | 44 struct m_pedit_util *next; member in struct:m_pedit_util
|
/external/ipsec-tools/src/racoon/ |
H A D | sainfo.h | 68 struct sainfoalg *next; member in struct:sainfoalg
|
/external/javassist/src/main/javassist/bytecode/analysis/ |
H A D | IntQueue.java | 21 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 D | TransformWriteField.java | 23 public TransformWriteField(Transformer next, CtField field, argument 26 super(next, field, methodClassname, methodName); 58 pos = iterator.next();
|
/external/junit/src/org/junit/internal/runners/statements/ |
H A D | ExpectException.java | 13 public ExpectException(Statement next, Class<? extends Throwable> expected) { argument 14 fNext= next;
|
H A D | RunAfters.java | 20 public RunAfters(Statement next, List<FrameworkMethod> afters, Object target) { argument 21 fNext= next;
|
H A D | RunBefores.java | 18 public RunBefores(Statement next, List<FrameworkMethod> befores, Object target) { argument 19 fNext= next;
|
/external/libselinux/src/ |
H A D | avc_sidtab.h | 14 struct sidtab_node *next; member in struct:sidtab_node
|
/external/libsepol/include/sepol/policydb/ |
H A D | sidtab.h | 19 struct sidtab_node *next; member in struct:sidtab_node 33 unsigned int next_sid; /* next SID to allocate */
|
/external/libunwind/include/ |
H A D | mempool.h | 70 struct object *next; member in struct:mempool::object
|
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
H A D | types.h | 18 struct list_head *next, *prev; member in struct:list_head 26 struct hlist_node *next, **pprev; member in struct:hlist_node
|
/external/lldb/test/functionalities/recursion/ |
H A D | main.cpp | 17 node* next; member in struct:node 18 node () : value(1),next(NULL) {} 19 node (int v) : value(v), next(NULL) {} 30 root->next = new node(++countdown); 31 root = root->next;
|
/external/llvm/lib/CodeGen/ |
H A D | AllocationOrder.h | 45 /// Return the next physical register in the allocation order, or 0. 46 /// It is safe to call next() again after it returned 0, it will keep 48 unsigned next(unsigned Limit = 0) { function in class:llvm::AllocationOrder 61 /// As next(), but allow duplicates to be returned, and stop before the 76 /// Return true if the last register returned from next() was a preferred register.
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_vs_llvm.c | 15 * next paragraph) shall be included in all copies or substantial portions 72 struct draw_llvm_variant_list_item *next = next_elem(li); local 74 li = next;
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_mm.h | 38 struct mem_block *next, *prev; member in struct:mem_block
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | memory_pool.c | 11 * The above copyright notice and this permission notice (including the next 35 struct memory_block * next; member in struct:memory_block 48 pool->blocks = block->next; 62 newblock->next = pool->blocks; 90 block->next = pool->blocks;
|
/external/mesa3d/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.h | 9 * The above copyright notice and this permission notice (including the next 44 struct compute_memory_item* next; member in struct:compute_memory_item
|
/external/mesa3d/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.c | 11 * The above copyright notice and this permission notice (including the next 41 struct intel_resolve_map **tail = &head->next; 50 tail = &(*tail)->next; 55 (*tail)->next = NULL; 70 struct intel_resolve_map *item = head->next; 76 item = item->next; 89 elem->prev->next = elem->next; 90 if (elem->next) 91 elem->next 101 struct intel_resolve_map *next = head->next; local [all...] |
H A D | intel_resolve_map.h | 11 * The above copyright notice and this permission notice (including the next 80 struct intel_resolve_map *next; member in struct:intel_resolve_map
|
/external/mesa3d/src/mesa/main/ |
H A D | mm.h | 36 struct mem_block *next, *prev; member in struct:mem_block
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/analysis/ |
H A D | SmallSet.java | 75 public Object next() {
method in class:SmallSet
|
/external/mockito/src/org/mockito/internal/configuration/injection/filter/ |
H A D | NameBasedCandidateFilter.java | 15 private final MockCandidateFilter next;
field in class:NameBasedCandidateFilter 18 public NameBasedCandidateFilter(MockCandidateFilter next) {
argument 19 this.next = next;
30 return next.filterCandidate(mockNameMatches, field, fieldInstance);
32 return next.filterCandidate(mocks, field, fieldInstance);
|
H A D | TypeBasedCandidateFilter.java | 14 MockCandidateFilter next;
field in class:TypeBasedCandidateFilter 16 public TypeBasedCandidateFilter(MockCandidateFilter next) {
argument 17 this.next = next;
28 return next.filterCandidate(mockTypeMatches, field, fieldInstance);
|