/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 30 void initialize_ovk_error_table_r(struct et_list **list); 38 void initialize_ovk_error_table_r(struct et_list **list) argument 42 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal.c | 111 void initialize_krb_error_table_r(struct et_list **list); 119 void initialize_krb_error_table_r(struct et_list **list) argument 123 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal2.c | 97 void initialize_kadm_error_table_r(struct et_list **list); 105 void initialize_kadm_error_table_r(struct et_list **list) argument 109 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal3.c | 31 void initialize_h3test_error_table_r(struct et_list **list); 39 void initialize_h3test_error_table_r(struct et_list **list) argument 43 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | imap_err.c | 59 void initialize_imap_error_table_r(struct et_list **list); 67 void initialize_imap_error_table_r(struct et_list **list) argument 71 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | simple.c | 51 void initialize_krb_error_table_r(struct et_list **list); 59 void initialize_krb_error_table_r(struct et_list **list) argument 63 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext2_err.c | 23 N_( "Wrong magic number for directory block list structure"), 117 N_( "Ext2fs directory block list is empty"), 185 void initialize_ext2_error_table_r(struct et_list **list); 193 void initialize_ext2_error_table_r(struct et_list **list) argument 197 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/external/eigen/Eigen/src/StlSupport/ |
H A D | StdList.h | 17 #define EIGEN_EXPLICIT_STL_LIST_INSTANTIATION(...) template class std::list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >; 24 * std::list such that for data types with alignment issues the correct allocator 32 class list<__VA_ARGS__, _Ay> \ 33 : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ 35 typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \ 41 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \ 43 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \ 44 list(const list& c) : list_base(c) {} \ 45 explicit list(size_typ 80 class list<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std [all...] |
/external/elfutils/0.153/libelf/ |
H A D | elf32_updatenull.c | 31 Inc. may make changes or additions to the list of Approved Interfaces. 192 Elf_ScnList *list; local 208 list = &elf->state.ELFW(elf,LIBELFBITS).scns; 212 if (list->data[1].shdr.ELFW(e,LIBELFBITS) == NULL) 213 (void) __elfw2(LIBELFBITS,getshdr_wrlock) (&list->data[1]); 217 for (size_t cnt = first == true; cnt < list->cnt; ++cnt) 219 Elf_Scn *scn = &list->data[cnt]; 280 if (list->data[cnt].data_list_rear != NULL) 373 changed. Create the section data list. */ 399 assert (list [all...] |
H A D | elf_end.c | 31 Inc. may make changes or additions to the list of Approved Interfaces. 100 /* Remove this structure from the children list. */ 153 Elf_ScnList *list = (elf->class == ELFCLASS32 local 162 size_t cnt = list->max; 168 Elf_Scn *scn = &list->data[cnt]; 187 /* Free the list of data buffers for the section. 201 Elf_ScnList *oldp = list; 202 list = list->next; 203 assert (list [all...] |
/external/fio/lib/ |
H A D | flist_sort.c | 9 * Returns a list organized in an intermediate format suited 36 * Combine final list merge with restoration of standard doubly-linked 37 * list structure. This approach duplicates code from merge(), but 83 * list_sort - sort a list 85 * @head: the list to sort 104 struct flist_head *list; local 112 list = head->next; 114 while (list) { 115 struct flist_head *cur = list; 116 list [all...] |
/external/guava/guava-testlib/src/com/google/common/testing/ |
H A D | TestLogHandler.java | 56 /** We will keep a private list of all logged records */ 57 private final List<LogRecord> list = field in class:TestLogHandler 61 * Adds the most recently logged record to our list. 65 list.add(record); 75 list.clear(); 79 * Fetch the list of logged records 80 * @return unmodifiable LogRecord list of all logged records 83 List<LogRecord> result = new ArrayList<LogRecord>(list);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SortedListsTest.java | 41 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument 45 if (list.contains(key)) { 46 assertEquals(list.indexOf(key), answer); 51 if (list.contains(key)) { 52 assertEquals(list.lastIndexOf(key), answer); 57 if (list.contains(key)) { 58 assertEquals(key, list.get(answer)); 63 if (list.contains(key)) { 64 assertEquals(list.lastIndexOf(key) + 1, answer); 69 if (list [all...] |
/external/icu/icu4c/source/common/ |
H A D | bmpset.h | 90 * inclusive, such that c < list[i] 137 * Inversion list indexes for restricted binary searches in 147 * The inversion list of the parent set, for the slower contains() implementation 149 * The list is terminated with list[listLength-1]=0x110000. 151 const int32_t *list; member in class:BMPSet
|
/external/libunwind/src/mi/ |
H A D | Gfind_dynamic_proc_info.c | 43 unw_dyn_info_list_t *list; local 52 list = (unw_dyn_info_list_t *) (uintptr_t) _U_dyn_info_list_addr (); 53 for (di = list->first; di; di = di->next)
|
/external/libvpx/libvpx/vp9/common/ |
H A D | vp9_frame_buffers.c | 16 int vp9_alloc_internal_frame_buffers(InternalFrameBufferList *list) { argument 17 assert(list != NULL); 18 vp9_free_internal_frame_buffers(list); 20 list->num_internal_frame_buffers = 22 list->int_fb = 23 (InternalFrameBuffer *)vpx_calloc(list->num_internal_frame_buffers, 24 sizeof(*list->int_fb)); 25 return (list->int_fb == NULL); 28 void vp9_free_internal_frame_buffers(InternalFrameBufferList *list) { argument 31 assert(list ! [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | pmu.h | 22 struct list_head list; member in struct:perf_pmu 35 void perf_pmu_error(struct list_head *list, char *name, char const *msg); 37 int perf_pmu__new_format(struct list_head *list, char *name,
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) argument 49 if (*list == NULL) { 50 *list = new_value; 54 for (temp = *list; temp->Next; temp = temp->Next); 60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) argument 62 if (*list == rm_value) { 63 *list = rm_value->Next; 73 unsigned int rc_list_count(struct rc_list * list) argument 76 while (list) { 78 list 83 rc_list_print(struct rc_list * list) argument [all...] |
/external/mesa3d/src/gallium/drivers/trace/ |
H A D | tr_texture.h | 45 struct tr_list list; member in struct:trace_resource 55 struct tr_list list; member in struct:trace_surface 74 struct tr_list list; member in struct:trace_transfer
|
/external/mesa3d/src/glsl/ |
H A D | ir_import_prototypes.cpp | 45 import_prototype_visitor(exec_list *list, glsl_symbol_table *symbols, argument 49 this->list = list; 62 list->push_tail(this->function); 96 exec_list *list; member in class:import_prototype_visitor
|
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
H A D | CollectionUtils.java | 67 public static Map getIndexMap(List list) { argument 70 for (Iterator it = list.iterator(); it.hasNext();) {
|
/external/oprofile/daemon/ |
H A D | opd_anon.h | 40 /** hash list */ 41 struct list_head list; member in struct:anon_mapping 42 /** lru list */
|
/external/proguard/src/proguard/util/ |
H A D | ListUtil.java | 37 public static String commaSeparatedString(List list, boolean quoteStrings) argument 39 if (list == null) 46 for (int index = 0; index < list.size(); index++) 53 String string = (String)list.get(index); 77 List list = new ArrayList(); 93 list.add(string.substring(index + 1, nextIndex)); 107 list.add(substring); 114 return list; 157 List list = commaSeparatedList(args[0]); 159 System.out.println("Resulting list [all...] |
/external/qemu/android/utils/ |
H A D | list.h | 21 /* Encapsulates a double-linked, circular list. 22 * The list is organized in the following way: 24 * list. 25 * - The list is circular, i.e. the "last" list entry references the "list head" 26 * in its 'next' reference, and the "list head" references the "last" entry in 28 * - The list is empty if its 'next' and 'previous' references are addressing the 29 * head of the list. 33 /* Next entry in the list */ 41 alist_init(ACList* list) argument 48 alist_is_empty(const ACList* list) argument 55 alist_insert_head(ACList* list, ACList* entry) argument 65 alist_insert_tail(ACList* list, ACList* entry) argument 89 alist_remove_head(ACList* list) argument 104 alist_remove_tail(ACList* list) argument [all...] |
/external/qemu/util/ |
H A D | notify.c | 19 void notifier_list_init(NotifierList *list) argument 21 QLIST_INIT(&list->notifiers); 24 void notifier_list_add(NotifierList *list, Notifier *notifier) argument 26 QLIST_INSERT_HEAD(&list->notifiers, notifier, node); 34 void notifier_list_notify(NotifierList *list, void *data) argument 38 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) { 43 void notifier_with_return_list_init(NotifierWithReturnList *list) argument 45 QLIST_INIT(&list->notifiers); 48 void notifier_with_return_list_add(NotifierWithReturnList *list, argument 51 QLIST_INSERT_HEAD(&list 59 notifier_with_return_list_notify(NotifierWithReturnList *list, void *data) argument [all...] |