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

  /src/external/gpl3/gcc/dist/gcc/
ipa-ref.cc 34 struct ipa_ref_list *list2 = referring_ref_list (); local
68 last = &list2->references.last ();
77 list2->references.pop ();
symtab.cc 619 ipa_ref_list *list, *list2; local
630 list2 = &referred_node->ref_list;
635 list2->referring.safe_insert (0, ref);
638 for (unsigned int i = 1; i < list2->referring.length (); i++)
639 list2->referring[i]->referred_index = i;
643 list2->referring.safe_push (ref);
644 ref->referred_index = list2->referring.length () - 1;
dwarf2out.cc 21563 dw_loc_list_ref list2 = loc_list_from_tree (value, 0, context);
21564 if (list2 && single_element_loc_list_p (list2))
21571 if (!resolve_args_picking (list2->expr, 1, &dpi))
21574 add_AT_loc (die, attr, list2->expr);
21549 dw_loc_list_ref list2 = loc_list_from_tree (value, 0, context); local
  /src/external/gpl3/gcc.old/dist/gcc/
ipa-ref.cc 34 struct ipa_ref_list *list2 = referring_ref_list (); local
68 last = &list2->references.last ();
77 list2->references.pop ();
symtab.cc 619 ipa_ref_list *list, *list2; local
630 list2 = &referred_node->ref_list;
635 list2->referring.safe_insert (0, ref);
638 for (unsigned int i = 1; i < list2->referring.length (); i++)
639 list2->referring[i]->referred_index = i;
643 list2->referring.safe_push (ref);
644 ref->referred_index = list2->referring.length () - 1;
dwarf2out.cc 21466 dw_loc_list_ref list2 = loc_list_from_tree (value, 0, context);
21467 if (list2 && single_element_loc_list_p (list2))
21474 if (!resolve_args_picking (list2->expr, 1, &dpi))
21477 add_AT_loc (die, attr, list2->expr);
21452 dw_loc_list_ref list2 = loc_list_from_tree (value, 0, context); local
  /src/external/bsd/libarchive/dist/tar/test/
test_windows.c 101 static const char *list2[] = {"bbb/", "bbb/file1", "bbb/xxa/", "bbb/xxb/", variable
170 systemf("%s -tf ../archive2.tar > ../list2", testprog));
171 assertFileContainsLinesAnyOrder("../list2", list2);
  /src/lib/libc/stdlib/
merge.c 118 u_char *list2, *list1, *p2, *p, *last, **p1; local
139 if ((list2 = malloc(nmemb * size + PSIZE)) == NULL)
143 setup(list1, list2, nmemb, size, cmp, cookie);
144 last = list2 + nmemb * size;
146 while (*EVAL(list2) != last) {
149 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
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 149 const OSSL_PARAM *list2[OSSL_PARAM_MERGE_LIST_MAX + 1]; local
168 /* copy p2 to a list2 */
171 list2[list2_sz++] = p;
173 list2[list2_sz] = NULL;
181 qsort(list2, list2_sz, sizeof(OSSL_PARAM *), compare_params);
189 p2cur = list2;
191 /* If list1 is finished just tack list2 onto the end */
199 /* If list2 is finished just tack list1 onto the end */
  /src/crypto/external/bsd/heimdal/dist/lib/krb5/
test_config.c 90 char *list2[] = { "", NULL }; variable
114 test[2].res = list2;
  /src/crypto/external/bsd/openssl/dist/crypto/
params_dup.c 150 const OSSL_PARAM *list2[OSSL_PARAM_MERGE_LIST_MAX + 1]; local
167 /* copy p2 to a list2 */
170 list2[list2_sz++] = p;
172 list2[list2_sz] = NULL;
178 qsort(list2, list2_sz, sizeof(OSSL_PARAM *), compare_params);
188 p2cur = list2;
190 /* If list1 is finished just tack list2 onto the end */
198 /* If list2 is finished just tack list1 onto the end */
  /src/external/mit/isl/dist/
isl_pw_union_opt.c 237 isl_set_list *list2 = data2->cell; local
261 set = isl_set_list_get_set(list2, j);
266 isl_set_list_get_set(list2, j));
isl_fold.c 659 /* Combine "list1" and "list2" into a single list, eliminating
668 __isl_take isl_qpolynomial_list *list2, int better)
674 n2 = isl_qpolynomial_list_size(list2);
685 qp2 = isl_qpolynomial_list_peek(list2, i);
705 list2 = isl_qpolynomial_list_drop(list2, i, 1);
709 return isl_qpolynomial_list_concat(list1, list2);
712 isl_qpolynomial_list_free(list2);
730 isl_qpolynomial_list *list2; local
753 list2 = isl_qpolynomial_fold_take_list(fold2)
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
2015 list2 = accept_affine_list(s, isl_set_get_space(set), v);
2017 n2 = isl_pw_aff_list_n_pw_aff(list2);
2026 set = construct_constraints(set, type, list1, list2, rational);
2028 list1 = list2;
2041 isl_pw_aff_list_free(list2);
isl_schedule_tree.c 2145 isl_schedule_tree_list *list1, *list2; local
2165 list2 = isl_schedule_tree_list_copy(tree->children);
2166 list2 = isl_schedule_tree_list_drop(list2, 0, pos + 1);
2169 list1 = isl_schedule_tree_list_concat(list1, list2);
  /src/external/gpl3/gdb/dist/gdb/unittests/
intrusive_list-selftests.c 151 ListType list2 (std::move (list1));
157 verify_items (list2, expected);
168 ListType list2 (std::move (list1));
174 verify_items (list2, expected);
182 ListType list2 (std::move (list1));
188 verify_items (list2, expected);
199 ListType list2; local
206 list2.push_back (d);
207 list2.push_back (e);
209 list2 = std::move (list1)
222 ListType list2; local
242 ListType list2; local
262 ListType list2; local
280 ListType list2; local
300 ListType list2; local
323 ListType list2; local
343 ListType list2; local
362 ListType list2; local
378 ListType list2; local
546 ListType list2; local
569 ListType list2; local
589 ListType list2; local
608 ListType list2; local
887 ListType list2; local
911 ListType list2; local
932 ListType list2; local
953 ListType list2; local
973 ListType list2; local
993 ListType list2; local
1017 ListType list2; local
1038 ListType list2; local
1059 ListType list2; local
1076 ListType list2; local
1357 ListType list2; local
1381 ListType list2; local
1402 ListType list2; local
1423 ListType list2; local
    [all...]
  /src/external/gpl3/gdb.old/dist/gdb/unittests/
intrusive_list-selftests.c 125 ListType list2 (std::move (list1));
131 verify_items (list2, expected);
142 ListType list2 (std::move (list1));
148 verify_items (list2, expected);
156 ListType list2 (std::move (list1));
162 verify_items (list2, expected);
173 ListType list2; local
180 list2.push_back (d);
181 list2.push_back (e);
183 list2 = std::move (list1)
196 ListType list2; local
216 ListType list2; local
236 ListType list2; local
254 ListType list2; local
274 ListType list2; local
297 ListType list2; local
317 ListType list2; local
336 ListType list2; local
352 ListType list2; local
512 ListType list2; local
535 ListType list2; local
555 ListType list2; local
575 ListType list2; local
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.base/
call-ar-st.c 794 printf("Contents of linked list2: \n\n");
886 static struct array_rep_info_t *list2; local
951 list2 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
958 init_array_rep(list2, 4);
967 sum_array_print(10, *list1, *list2, *list3, *list4); /* -tbreak5- */
968 print_array_rep(*list1, *list2, *list3);
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.base/
call-ar-st.c 794 printf("Contents of linked list2: \n\n");
886 static struct array_rep_info_t *list2; local
951 list2 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t));
958 init_array_rep(list2, 4);
967 sum_array_print(10, *list1, *list2, *list3, *list4); /* -tbreak5- */
968 print_array_rep(*list1, *list2, *list3);
  /src/external/gpl3/gcc.old/dist/gcc/cp/
pt.cc 3468 tree list2 = TREE_VALUE (p2); local
3470 if (TREE_VEC_LENGTH (list1) != TREE_VEC_LENGTH (list2))
3473 for (int i = 0; i < TREE_VEC_LENGTH (list2); ++i)
3476 tree parm2 = TREE_VEC_ELT (list2, i);
  /src/external/gpl3/gcc/dist/gcc/cp/
pt.cc 3439 tree list2 = TREE_VALUE (parms2); local
3441 if (TREE_VEC_LENGTH (list1) != TREE_VEC_LENGTH (list2))
3444 for (int i = 0; i < TREE_VEC_LENGTH (list2); ++i)
3447 tree parm2 = TREE_VEC_ELT (list2, i);

Completed in 127 milliseconds