HomeSort by: relevance | last modified time | path
    Searched defs:list1 (Results 1 - 22 of 22) sorted by relevancy

  /src/external/bsd/libarchive/dist/tar/test/
test_windows.c 98 static const char *list1[] = {"aaa/", "aaa/file1", "aaa/xxa/", "aaa/xxb/", variable
164 systemf("%s -tf ../archive1.tar > ../list1", testprog));
165 assertFileContainsLinesAnyOrder("../list1", list1);
  /src/external/cddl/osnet/dist/tools/ctf/common/
list.c 177 list_concat(list_t **list1, list_t *list2)
181 for (l = *list1, last = NULL; l; last = l, l = l->l_next)
185 *list1 = list2;
196 list_t *list1, *next2; local
204 list1 = *list1p;
206 if (cmp(list1->l_data, list2->l_data) > 0) {
212 list2->l_next = list1;
214 list2->l_next = list1;
222 last1 = list1;
223 list1 = list1->l_next
    [all...]
  /src/lib/libc/stdlib/
merge.c 118 u_char *list2, *list1, *p2, *p, *last, **p1; local
142 list1 = base;
143 setup(list1, list2, nmemb, size, cmp, cookie);
147 l2 = list1;
148 p1 = EVAL(list1);
152 f2 = l1 = list1 + (p2 - list2);
155 l2 = list1 + (p2 - list2);
248 tp2 = list1; /* swap list1, list2 */
249 list1 = list2
    [all...]
  /src/crypto/external/apache2/openssl/dist/crypto/
params_dup.c 148 const OSSL_PARAM *list1[OSSL_PARAM_MERGE_LIST_MAX + 1]; local
161 /* Copy p1 to list1 */
164 list1[list1_sz++] = p;
166 list1[list1_sz] = NULL;
180 qsort(list1, list1_sz, sizeof(OSSL_PARAM *), compare_params);
188 p1cur = list1;
191 /* If list1 is finished just tack list2 onto the end */
199 /* If list2 is finished just tack list1 onto the end */
210 /* If the keys are the same then throw away the list1 element */
  /src/crypto/external/bsd/heimdal/dist/lib/krb5/
test_config.c 89 char *list1[] = { "/tmp/foo", "/tmp/foo/bar", NULL }; variable
113 test[1].res = list1;
  /src/crypto/external/bsd/openssl/dist/crypto/
params_dup.c 149 const OSSL_PARAM *list1[OSSL_PARAM_MERGE_LIST_MAX + 1]; local
160 /* Copy p1 to list1 */
163 list1[list1_sz++] = p;
165 list1[list1_sz] = NULL;
177 qsort(list1, list1_sz, sizeof(OSSL_PARAM *), compare_params);
187 p1cur = list1;
190 /* If list1 is finished just tack list2 onto the end */
198 /* If list2 is finished just tack list1 onto the end */
209 /* If the keys are the same then throw away the list1 element */
  /src/external/mit/isl/dist/
isl_pw_union_opt.c 236 isl_set_list *list1 = data1->cell; local
257 set = isl_set_list_get_set(list1, i);
265 set = isl_set_union(isl_set_list_get_set(list1, i),
isl_fold.c 659 /* Combine "list1" and "list2" into a single list, eliminating
667 __isl_take isl_qpolynomial_list *list1,
673 n1 = isl_qpolynomial_list_size(list1);
684 qp1 = isl_qpolynomial_list_peek(list1, j);
700 list1 = isl_qpolynomial_list_drop(list1, j, 1);
709 return isl_qpolynomial_list_concat(list1, list2);
711 isl_qpolynomial_list_free(list1);
729 isl_qpolynomial_list *list1; local
752 list1 = isl_qpolynomial_fold_take_list(fold1)
811 isl_qpolynomial_list *list1, *list2; local
1085 isl_qpolynomial_list *list1, *list2; local
1294 isl_qpolynomial_list *list1, *list2; local
1361 isl_qpolynomial_list *list1, *list2; local
1508 isl_qpolynomial_list *list1, *list2; local
    [all...]
isl_input.c 1997 isl_pw_aff_list *list1 = NULL, *list2 = NULL; local
2002 list1 = accept_affine_list(s, isl_set_get_space(set), v);
2003 if (!list1)
2016 n1 = isl_pw_aff_list_n_pw_aff(list1);
2026 set = construct_constraints(set, type, list1, list2, rational);
2027 isl_pw_aff_list_free(list1);
2028 list1 = list2;
2036 isl_pw_aff_list_free(list1);
2040 isl_pw_aff_list_free(list1);
isl_schedule_tree.c 2145 isl_schedule_tree_list *list1, *list2; local
2163 list1 = isl_schedule_tree_list_copy(tree->children);
2164 list1 = isl_schedule_tree_list_drop(list1, pos, n - pos);
2167 list1 = isl_schedule_tree_list_concat(list1,
2169 list1 = isl_schedule_tree_list_concat(list1, list2);
2174 list1);
  /src/external/gpl3/gdb/dist/gdb/unittests/
intrusive_list-selftests.c 144 ListType list1; local
147 list1.push_back (a);
148 list1.push_back (b);
149 list1.push_back (c);
151 ListType list2 (std::move (list1));
154 verify_items (list1, expected);
163 ListType list1; local
166 list1.push_back (a);
168 ListType list2 (std::move (list1));
171 verify_items (list1, expected)
179 ListType list1; local
198 ListType list1; local
221 ListType list1; local
241 ListType list1; local
261 ListType list1; local
279 ListType list1; local
299 ListType list1; local
322 ListType list1; local
342 ListType list1; local
361 ListType list1; local
377 ListType list1; local
545 ListType list1; local
568 ListType list1; local
588 ListType list1; local
607 ListType list1; local
829 ListType list1; local
849 ListType list1; local
867 ListType list1; local
886 ListType list1; local
910 ListType list1; local
931 ListType list1; local
952 ListType list1; local
972 ListType list1; local
992 ListType list1; local
1016 ListType list1; local
1037 ListType list1; local
1058 ListType list1; local
1075 ListType list1; local
1356 ListType list1; local
1380 ListType list1; local
1401 ListType list1; local
1422 ListType list1; local
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/unittests/
intrusive_list-selftests.c 118 ListType list1; local
121 list1.push_back (a);
122 list1.push_back (b);
123 list1.push_back (c);
125 ListType list2 (std::move (list1));
128 verify_items (list1, expected);
137 ListType list1; local
140 list1.push_back (a);
142 ListType list2 (std::move (list1));
145 verify_items (list1, expected)
153 ListType list1; local
172 ListType list1; local
195 ListType list1; local
215 ListType list1; local
235 ListType list1; local
253 ListType list1; local
273 ListType list1; local
296 ListType list1; local
316 ListType list1; local
335 ListType list1; local
351 ListType list1; local
511 ListType list1; local
534 ListType list1; local
554 ListType list1; local
574 ListType list1; local
    [all...]
  /src/external/bsd/openldap/dist/servers/slapd/
at.c 155 AttributeType **list1; local
167 list1 = *listp;
168 while ( *list1 ) {
170 list1++;
173 list1 = ch_realloc(list, size*sizeof(AttributeType *));
174 if ( !list1 ) {
177 list = list1;
191 AttributeType **list1; local
209 list1 = ch_realloc(list, (i+1)*sizeof(AttributeType **));
210 if ( !list1 ) {
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
call-rt-st.c 552 struct array_rep_info_t *list1; local
571 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
575 init_array_rep(list1, 2);
579 print_one_large_struct(*list1);
call-ar-st.c 758 /* printf("Contents of linked list1: \n\n");
784 printf("Contents of linked list1: \n\n");
885 static struct array_rep_info_t *list1; local
950 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
957 init_array_rep(list1, 2);
967 sum_array_print(10, *list1, *list2, *list3, *list4); /* -tbreak5- */
968 print_array_rep(*list1, *list2, *list3);
969 print_one_large_struct(*list1);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
call-rt-st.c 552 struct array_rep_info_t *list1; local
571 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
575 init_array_rep(list1, 2);
579 print_one_large_struct(*list1);
call-ar-st.c 758 /* printf("Contents of linked list1: \n\n");
784 printf("Contents of linked list1: \n\n");
885 static struct array_rep_info_t *list1; local
950 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
957 init_array_rep(list1, 2);
967 sum_array_print(10, *list1, *list2, *list3, *list4); /* -tbreak5- */
968 print_array_rep(*list1, *list2, *list3);
969 print_one_large_struct(*list1);
  /src/external/gpl3/binutils.old/dist/opcodes/
aarch64-gen.c 287 opcode_node list0, list1, **ptr0, **ptr1; local
356 list1.next = NULL;
358 ptr1 = &list1.next;
383 opcode = list1.next;
386 else if (list1.next == NULL)
396 divide_table_1 (bittree->bits[1], list1.next);
  /src/external/gpl3/gdb/dist/opcodes/
aarch64-gen.c 287 opcode_node list0, list1, **ptr0, **ptr1; local
356 list1.next = NULL;
358 ptr1 = &list1.next;
383 opcode = list1.next;
386 else if (list1.next == NULL)
396 divide_table_1 (bittree->bits[1], list1.next);
  /src/external/gpl3/gdb.old/dist/opcodes/
aarch64-gen.c 268 opcode_node list0, list1, **ptr0, **ptr1; local
337 list1.next = NULL;
339 ptr1 = &list1.next;
364 opcode = list1.next;
367 else if (list1.next == NULL)
377 divide_table_1 (bittree->bits[1], list1.next);
  /src/external/gpl3/binutils/dist/opcodes/
aarch64-gen.c 294 opcode_node list0, list1, **ptr0, **ptr1; local
363 list1.next = NULL;
365 ptr1 = &list1.next;
390 opcode = list1.next;
393 else if (list1.next == NULL)
403 divide_table_1 (bittree->bits[1], list1.next);
  /src/external/gpl3/gcc.old/dist/gcc/cp/
pt.cc 3467 tree list1 = TREE_VALUE (p1); local
3470 if (TREE_VEC_LENGTH (list1) != TREE_VEC_LENGTH (list2))
3475 tree parm1 = TREE_VEC_ELT (list1, i);

Completed in 73 milliseconds