Home
last modified time | relevance | path

Searched refs:list1 (Results 1 – 24 of 24) sorted by relevance

/openbsd/gnu/llvm/compiler-rt/lib/tsan/tests/unit/
H A Dtsan_ilist_test.cpp85 IList<Node, &Node::node1> list1; in TEST() local
89 list1.PushBack(&nodes[2]); in TEST()
90 list1.PushBack(&nodes[1]); in TEST()
91 list1.PushBack(&nodes[0]); in TEST()
95 EXPECT_EQ(list1.Size(), (size_t)3); in TEST()
96 EXPECT_TRUE(list1.Queued(&nodes[0])); in TEST()
97 EXPECT_TRUE(list1.Queued(&nodes[1])); in TEST()
98 EXPECT_TRUE(list1.Queued(&nodes[2])); in TEST()
111 list1.Remove(&nodes[1]); in TEST()
112 EXPECT_EQ(list1.Size(), (size_t)2); in TEST()
[all …]
/openbsd/lib/libc/stdlib/
H A Dmerge.c118 list1 = base; in mergesort()
123 l2 = list1; in mergesort()
124 p1 = EVAL(list1); in mergesort()
128 f2 = l1 = list1 + (p2 - list2); in mergesort()
131 l2 = list1 + (p2 - list2); in mergesort()
213 list1 = list2; in mergesort()
218 memmove(list2, list1, nmemb*size); in mergesort()
219 list2 = list1; in mergesort()
259 insertionsort(list1, n, size, cmp); in setup()
269 last = list1 + size * (n - i); in setup()
[all …]
/openbsd/usr.bin/dig/lib/isc/include/isc/
H A Dlist.h146 #define ISC_LIST_APPENDLIST(list1, list2, link) \ argument
148 if (ISC_LIST_EMPTY(list1)) \
149 (list1) = (list2); \
151 (list1).tail->link.next = (list2).head; \
152 (list2).head->link.prev = (list1).tail; \
153 (list1).tail = (list2).tail; \
161 if (ISC_LIST_EMPTY(list1)) \
162 (list1) = (list2); \
164 (list2).tail->link.next = (list1).head; \
165 (list1).head->link.prev = (list2).tail; \
[all …]
H A Dutil.h110 #define APPENDLIST(list1, list2, link) ISC_LIST_APPENDLIST(list1, list2, link) argument
/openbsd/gnu/usr.bin/gcc/gcc/testsuite/gcc.dg/cpp/
H A Dmacro5.c13 #define _CAT_LIST(argc,list1,list2) \ argument
14 _L_##argc list1 _R_##argc list2
16 #define _VA_ARGLIST(argc,list1,list2) \ argument
18 _CAT_LIST(argc, list1, list2))
/openbsd/gnu/usr.bin/perl/
H A Dpp_sort.c175 dynprep(pTHX_ gptr *list1, gptr *list2, size_t nmemb, const SVCOMPARE_t cmp) in dynprep() argument
182 b = list1; in dynprep()
366 gptr *list1, *list2; in S_sortsv_flags_impl() local
368 list1 = which[iwhich]; /* area where runs are now */ in S_sortsv_flags_impl()
373 f1 = p1 = list1 + offset; /* start of first run */ in S_sortsv_flags_impl()
376 f2 = l1 = POTHER(t, list2, list1); /* ... on the other side */ in S_sortsv_flags_impl()
378 l2 = POTHER(t, list2, list1); /* ... on the other side */ in S_sortsv_flags_impl()
464 p1 = NEXT(p1) = POTHER(tp2, list2, list1); in S_sortsv_flags_impl()
468 t = list1; list1 = list2; list2 = t; /* swap lists */ in S_sortsv_flags_impl()
/openbsd/gnu/usr.bin/binutils/gdb/testsuite/gdb.base/
H A Dcall-rt-st.c701 struct array_rep_info_t *list1; in main() local
719 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t)); in main()
723 init_array_rep(list1, 2); in main()
727 print_one_large_struct(*list1); in main()
H A Dcall-ar-st.c1161 static struct array_rep_info_t *list1; in main() local
1224 list1 = (struct array_rep_info_t *)malloc(sizeof(struct array_rep_info_t)); in main()
1231 init_array_rep(list1, 2); in main()
1241 sum_array_print(10, *list1, *list2, *list3, *list4); in main()
1242 print_array_rep(*list1, *list2, *list3); in main()
1243 print_one_large_struct(*list1); in main()
/openbsd/gnu/usr.bin/perl/os2/OS2/OS2-Process/t/
H A Dos2_process.t250 my (@list, $next, @list1);
256 @list1 = ChildWindows;
260 is_deeply \@list, \@list1, 'Manual list same as by ChildWindows()';
268 is_deeply \@list, \@list1, 'Other ChildWindows(), same result';
/openbsd/gnu/usr.bin/gcc/gcc/cp/
H A Dtree.c796 hash_chainon (list1, list2) in hash_chainon() argument
797 tree list1, list2; in hash_chainon()
800 return list1;
801 if (list1 == 0)
803 if (TREE_CHAIN (list1) == NULL_TREE)
804 return hash_tree_chain (TREE_VALUE (list1), list2);
805 return hash_tree_chain (TREE_VALUE (list1),
806 hash_chainon (TREE_CHAIN (list1), list2));
/openbsd/gnu/usr.bin/perl/t/op/
H A Dsplit.t205 @list1 = @list2 = split ('p',"a p b c p");
206 ok(@list1 == @list2 &&
208 @list1 == 2 &&
H A Dpack.t1303 my @list1 = @list;
1304 @list1 = (@list1) x $c unless $type =~ /[XxAaZBbHhP]/;
1309 my @list2 = (@list1) x $c;
/openbsd/gnu/usr.bin/cvs/diff/
H A Ddiff3.c1050 compare_line_list (list1, lengths1, list2, lengths2, nl) in compare_line_list() argument
1051 char * const list1[], * const list2[]; in compare_line_list()
1056 * const *l1 = list1,
/openbsd/gnu/llvm/lldb/third_party/Python/module/unittest2/unittest2/
H A Dcase.py809 def assertListEqual(self, list1, list2, msg=None): argument
819 self.assertSequenceEqual(list1, list2, msg, seq_type=list)
/openbsd/sbin/unwind/libunbound/util/
H A Dconfig_file.h1261 int taglist_intersect(uint8_t* list1, size_t list1len, const uint8_t* list2,
H A Dconfig_file.c2362 int taglist_intersect(uint8_t* list1, size_t list1len, const uint8_t* list2, in taglist_intersect() argument
2366 if(!list1 || !list2) in taglist_intersect()
2369 if((list1[i] & list2[i]) != 0) in taglist_intersect()
/openbsd/usr.sbin/unbound/util/
H A Dconfig_file.h1261 int taglist_intersect(uint8_t* list1, size_t list1len, const uint8_t* list2,
H A Dconfig_file.c2362 int taglist_intersect(uint8_t* list1, size_t list1len, const uint8_t* list2, in taglist_intersect() argument
2366 if(!list1 || !list2) in taglist_intersect()
2369 if((list1[i] & list2[i]) != 0) in taglist_intersect()
/openbsd/gnu/usr.bin/binutils/gdb/config/djgpp/
H A Dfnchange.lst219 @V@/gdb/testsuite/gdb.gdbtk/list1.c @V@/gdb/testsuite/gdb.tk/list1.c
/openbsd/gnu/llvm/llvm/docs/TableGen/
H A DProgRef.rst1739 ``!listconcat(``\ *list1*\ ``,`` *list2*\ ``, ...)``
1740 This operator concatenates the list arguments *list1*, *list2*, etc., and
1743 ``!listremove(``\ *list1*\ ``,`` *list2*\ ``)``
1744 This operator returns a copy of *list1* removing all elements that also occur in
/openbsd/gnu/usr.bin/perl/pod/
H A Dperlsub.pod193 @newlist = upcase(@list1, @list2);
198 (@x, @y) = upcase(@list1, @list2);
/openbsd/gnu/usr.bin/perl/lib/
H A Dlocale_threads.t1152 # @set1{@list1} = ();
/openbsd/gnu/usr.bin/binutils/gdb/testsuite/
H A DChangeLog6686 jump.c, langs0.c, langs1.c, langs2.c, list0.c, list1.c,
10591 * gdb.base/list1.c (long_line): Add additional statement at start
10853 to reflect changes in list1.c.
10878 list1.c.
10880 * gdb.base/list1.c (long_line): New function, has long source line.
11232 gdb.base/list1.c, gdb.base/mips_pro.c, gdb.base/nodebug.c,
/openbsd/sys/dev/pci/
H A Dif_ice.c16928 ice_match_prop_lst(struct ice_vsig_prof_head *list1, in ice_match_prop_lst() argument
16936 TAILQ_FOREACH(tmp1, list1, list) in ice_match_prop_lst()
16943 tmp1 = TAILQ_FIRST(list1); in ice_match_prop_lst()