/external/clang/test/CodeGen/ |
H A D | 2002-07-14-MiscListTests.c | 3 // Test list stuff 7 // Test opaque structure support. the list type is defined later 8 struct list; 10 struct list *PassThroughList(struct list *L) { 17 typedef struct list { struct 19 struct list *Next; 20 } list; typedef in typeref:struct:list 22 list *Data; 28 Data = (list*)mallo [all...] |
/external/curl/lib/ |
H A D | llist.c | 46 struct curl_llist *list; local 48 list = malloc(sizeof(struct curl_llist)); 49 if(!list) 52 llist_init(list, dtor); 54 return list; 60 * Inserts a new list element after the given one 'e'. If the given existing 61 * entry is NULL and the list already has elements, the new one will be 62 * inserted first in the list. 69 Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, argument 77 if(list 110 Curl_llist_remove(struct curl_llist *list, struct curl_llist_element *e, void *user) argument 145 Curl_llist_destroy(struct curl_llist *list, void *user) argument 156 Curl_llist_count(struct curl_llist *list) argument 164 Curl_llist_move(struct curl_llist *list, struct curl_llist_element *e, struct curl_llist *to_list, struct curl_llist_element *to_e) argument [all...] |
H A D | slist.c | 31 /* returns last node in linked list */ 32 static struct curl_slist *slist_get_last(struct curl_slist *list) argument 37 if(!list) 41 item = list; 49 * Curl_slist_append_nodup() appends a string to the linked list. Rather than 57 struct curl_slist *Curl_slist_append_nodup(struct curl_slist *list, char *data) argument 71 /* if this is the first item, then new_item *is* the list */ 72 if(!list) 75 last = slist_get_last(list); 77 return list; 87 curl_slist_append(struct curl_slist *list, const char *data) argument 127 curl_slist_free_all(struct curl_slist *list) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | HeaderSection.java | 29 /** {@code non-null;} the list of the one item in the section */ 30 private final List<HeaderItem> list; field in class:HeaderSection 43 this.list = Collections.singletonList(item); 55 return list;
|
/external/dng_sdk/source/ |
H A D | dng_string_list.cpp | 54 dng_string **list = (dng_string **) local 57 if (!list) 67 DoCopyBytes (fList, list, fCount * (uint32) sizeof (dng_string *)); 78 fList = list;
|
/external/e2fsprogs/e2fsck/ |
H A D | prof_err.c | 17 N_("Bad linked list in profile structures"), 60 void initialize_prof_error_table_r(struct et_list **list); 68 void initialize_prof_error_table_r(struct et_list **list) argument 72 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/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/libelf/ |
H A D | elf32_updatenull.c | 183 Elf_ScnList *list; local 199 list = &elf->state.ELFW(elf,LIBELFBITS).scns; 203 if (list->data[1].shdr.ELFW(e,LIBELFBITS) == NULL) 204 (void) __elfw2(LIBELFBITS,getshdr_wrlock) (&list->data[1]); 208 for (size_t cnt = first == true; cnt < list->cnt; ++cnt) 210 Elf_Scn *scn = &list->data[cnt]; 276 if (list->data[cnt].data_list_rear != NULL) 368 changed. Create the section data list. */ 409 assert (list->next == NULL || list [all...] |
H A D | elf_end.c | 78 /* Remove this structure from the children list. */ 131 Elf_ScnList *list = (elf->class == ELFCLASS32 local 140 size_t cnt = list->max; 146 Elf_Scn *scn = &list->data[cnt]; 172 /* Free the list of data buffers for the section. 186 Elf_ScnList *oldp = list; 187 list = list->next; 188 assert (list == NULL || oldp->cnt == oldp->max); 196 while (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...] |
H A D | tp.c | 20 static void tp_flush_work(struct flist_head *list) argument 24 while (!flist_empty(list)) { 27 work = flist_entry(list->next, struct tp_work, list); 28 flist_del(&work->list); 76 flist_add_tail(&work->list, &tdat->work);
|
H A D | tp.h | 10 struct flist_head list; member in struct:tp_work
|
/external/google-breakpad/src/client/mac/handler/testcases/ |
H A D | breakpad_nlist_test.cc | 8 // notice, this list of conditions and the following disclaimer. 10 // copyright notice, this list of conditions and the following disclaimer 66 breakpad_nlist &list = symbolList[0]; local 72 breakpad_nlist_64("/usr/lib/dyld", &list, symbolNames);
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | SortedListsTest.java | 37 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument 41 if (list.contains(key)) { 42 assertEquals(list.indexOf(key), answer); 47 if (list.contains(key)) { 48 assertEquals(list.lastIndexOf(key), answer); 53 if (list.contains(key)) { 54 assertEquals(key, list.get(answer)); 59 if (list.contains(key)) { 60 assertEquals(list.lastIndexOf(key) + 1, answer); 65 if (list [all...] |
/external/guava/guava-testlib/src/com/google/common/testing/ |
H A D | TestLogHandler.java | 58 /** We will keep a private list of all logged records */ 59 private final List<LogRecord> list = field in class:TestLogHandler 63 * Adds the most recently logged record to our list. 67 list.add(record); 77 list.clear(); 81 * Fetch the list of logged records 82 * @return unmodifiable LogRecord list of all logged records 85 List<LogRecord> result = new ArrayList<LogRecord>(list);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SortedListsTest.java | 39 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument 43 if (list.contains(key)) { 44 assertEquals(list.indexOf(key), answer); 49 if (list.contains(key)) { 50 assertEquals(list.lastIndexOf(key), answer); 55 if (list.contains(key)) { 56 assertEquals(key, list.get(answer)); 61 if (list.contains(key)) { 62 assertEquals(list.lastIndexOf(key) + 1, answer); 67 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/libbrillo/brillo/ |
H A D | value_conversion.h | 71 const base::ListValue* list = nullptr; local 72 if (!in_value.GetAsList(&list)) 75 out_value->reserve(list->GetSize()); 76 for (const base::Value* item : *list) { 119 std::unique_ptr<base::Value> ToValue(const std::vector<T, Alloc>& list) { argument 121 for (const auto& value : list) {
|