Searched refs:list1 (Results 1 - 22 of 22) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/operations/
H A D35969.cc29 std::list<int> list1; local
34 list1.push_back(i);
38 list1.sort();
43 list1.splice(list1.begin(), list2, node_of_interest);
44 list2.splice(list2.begin(), list1, node_of_interest);
46 list1.merge(list2);
48 list2.splice(list2.begin(), list1, node_of_interest);
52 std::list<int> list1; local
57 list1
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr29254.c7 list_compare (int * list1) argument
9 if (list1)
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/cpp/
H A Dmacro5.c13 #define _CAT_LIST(argc,list1,list2) \
14 _L_##argc list1 _R_##argc list2
16 #define _VA_ARGLIST(argc,list1,list2) \
18 _CAT_LIST(argc, list1, list2))
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/list/modifiers/insert/
H A D25288.h39 list_type list1(alloc1);
42 list1.push_back(value_type(-(k + 1)));
47 list1.insert(list1.begin(), 10, 99);
59 VERIFY( list1.size() == size_type(j) );
60 VERIFY( list1.size() == 0 || list1.back() == -j );
61 VERIFY( list1.size() == 0 || list1.front() == -1 );
/haiku-buildtools/isl/
H A Disl_ast_graft.c1095 * "list1" may be the result of a previous call to isl_ast_graft_list_merge
1098 * The elements in "list2" need to be executed after those in "list1",
1100 * of some final elements in "list1", then it can be moved up to before
1104 * and move it up beyond elements of "list1" that would be sorted
1111 * from that of the previous element in "list1".
1114 __isl_take isl_ast_graft_list *list1,
1120 if (!list1 || !list2 || !build)
1124 return list1;
1126 if (list1->n == 0) {
1127 isl_ast_graft_list_free(list1);
1113 isl_ast_graft_list_merge( __isl_take isl_ast_graft_list *list1, __isl_take isl_ast_graft_list *list2, __isl_keep isl_ast_build *build) argument
[all...]
H A Disl_list_templ.c464 __isl_give LIST(EL) *FN(LIST(EL),concat)(__isl_take LIST(EL) *list1,
471 if (!list1 || !list2)
474 ctx = FN(LIST(EL),get_ctx)(list1);
475 res = FN(LIST(EL),alloc)(ctx, list1->n + list2->n);
476 for (i = 0; i < list1->n; ++i)
477 res = FN(LIST(EL),add)(res, FN(EL,copy)(list1->p[i]));
481 FN(LIST(EL),free)(list1);
485 FN(LIST(EL),free)(list1);
H A Disl_ast_graft_private.h60 __isl_take isl_ast_graft_list *list1,
H A Disl_aff.c2512 * of the elements of list1 and list2 where each element in list1
2515 static __isl_give isl_set *pw_aff_list_set(__isl_take isl_pw_aff_list *list1, argument
2524 if (!list1 || !list2)
2527 ctx = isl_pw_aff_list_get_ctx(list1);
2528 if (list1->n < 1 || list2->n < 1)
2532 set = isl_set_universe(isl_pw_aff_get_domain_space(list1->p[0]));
2533 for (i = 0; i < list1->n; ++i)
2537 set_ij = fn(isl_pw_aff_copy(list1->p[i]),
2542 isl_pw_aff_list_free(list1);
2555 isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
2561 isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
2571 isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
2577 isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
2583 isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
2589 isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1, __isl_take isl_pw_aff_list *list2) argument
[all...]
H A Disl_input.c1263 isl_pw_aff_list *list1 = NULL, *list2 = NULL; local
1267 list1 = accept_affine_list(s, isl_set_get_space(set), v);
1268 if (!list1)
1283 set = construct_constraints(set, tok->type, list1, list2,
1286 isl_pw_aff_list_free(list1);
1287 list1 = list2;
1296 isl_pw_aff_list_free(list1);
1302 isl_pw_aff_list_free(list1);
/haiku-buildtools/isl/include/isl/
H A Dlist.h41 __isl_take isl_##EL##_list *list1, \
H A Daff.h285 __isl_give isl_set *isl_pw_aff_list_eq_set(__isl_take isl_pw_aff_list *list1,
287 __isl_give isl_set *isl_pw_aff_list_ne_set(__isl_take isl_pw_aff_list *list1,
289 __isl_give isl_set *isl_pw_aff_list_le_set(__isl_take isl_pw_aff_list *list1,
291 __isl_give isl_set *isl_pw_aff_list_lt_set(__isl_take isl_pw_aff_list *list1,
293 __isl_give isl_set *isl_pw_aff_list_ge_set(__isl_take isl_pw_aff_list *list1,
295 __isl_give isl_set *isl_pw_aff_list_gt_set(__isl_take isl_pw_aff_list *list1,
/haiku-buildtools/binutils/opcodes/
H A Daarch64-gen.c231 opcode_node list0, list1, **ptr0, **ptr1; local
300 list1.next = NULL;
302 ptr1 = &list1.next;
327 opcode = list1.next;
330 else if (list1.next == NULL)
340 divide_table_1 (bittree->bits[1], list1.next);
/haiku-buildtools/gcc/gcc/
H A Dira-emit.c258 eq_move_lists_p (move_t list1, move_t list2)
260 for (; list1 != NULL && list2 != NULL;
261 list1 = list1->next, list2 = list2->next)
262 if (list1->from != list2->from || list1->to != list2->to)
264 return list1 == list2;
257 eq_move_lists_p(move_t list1, move_t list2) argument
H A Dipa-icf.c550 tree list1 = TYPE_ARG_TYPES (TREE_TYPE (decl)),
552 for (unsigned i = 0; list1 && list2;
553 list1 = TREE_CHAIN (list1), list2 = TREE_CHAIN (list2), i++)
555 tree parm1 = TREE_VALUE (list1);
575 if (list1 || list2)
H A Dgenautomata.c5129 unit_usage_t list1, list2;
5135 for (list1 = cycle_alt_unit_usages[i + alt1],
5137 list1 = list1->next, list2 = list2->next)
5139 while (list1 != NULL
5140 && list1->unit_decl->automaton_decl == excluded_automaton_decl)
5141 list1 = list1->next;
5145 if (list1 == NULL || list2 == NULL)
5147 if (list1 !
5108 unit_usage_t list1, list2; local
[all...]
/haiku-buildtools/legacy/gcc/gcc/cp/
H A Dtree.c1065 hash_chainon (list1, list2)
1066 tree list1, list2;
1069 return list1;
1070 if (list1 == 0)
1072 if (TREE_CHAIN (list1) == NULL_TREE)
1073 return hash_tree_chain (TREE_VALUE (list1), list2);
1074 return hash_tree_chain (TREE_VALUE (list1),
1075 hash_chainon (TREE_CHAIN (list1), list2));
/haiku-buildtools/binutils/binutils/doc/
H A DMakefile.in542 @list1=''; \
545 && test -n "`echo $$list1$$list2`" \
549 { for i in $$list1; do echo "$$i"; done; \
/haiku-buildtools/binutils/gas/doc/
H A DMakefile.in570 @list1=''; \
573 && test -n "`echo $$list1$$list2`" \
577 { for i in $$list1; do echo "$$i"; done; \
/haiku-buildtools/cloog/source/
H A Dclast.c1920 /* Concatenates all elements of list2 that are not in list1;
1922 int concat_if_new(void **list1, int num1, void *list2, int num2, int size) argument
1927 ret = add_if_new(list1, num1, (char *)list2 + i*size, size);
1934 /* Compares list1 to list2
1936 * list1 are strictly contained in list2; 1 otherwise
1938 int list_compare(const int *list1, int num1, const int *list2, int num2) argument
1944 if (list1[i] == list2[j]) break;
/haiku-buildtools/binutils/gprof/
H A DMakefile.in680 @list1=''; \
683 && test -n "`echo $$list1$$list2`" \
687 { for i in $$list1; do echo "$$i"; done; \
/haiku-buildtools/legacy/gcc/gcc/
H A Dhaifa-sched.c2808 find_insn_mem_list (insn, x, list, list1)
2810 rtx list, list1;
2815 && XEXP (list1, 0) == x)
2818 list1 = XEXP (list1, 1);
/haiku-buildtools/binutils/ld/
H A DMakefile.in1749 @list1=''; \
1752 && test -n "`echo $$list1$$list2`" \
1756 { for i in $$list1; do echo "$$i"; done; \

Completed in 181 milliseconds