/opensolaris-onvv-gate/usr/src/lib/print/libprint/common/ |
H A D | list.c | 123 * the list of items from list1. The result is a list (type **). If 127 list_concatenate(void **list1, void **list2) argument 134 syslog(LOG_DEBUG, "list_concatenate(0x%x, 0x%x)", list1, list2); 136 if ((list1 == NULL) || (list2 == NULL)) 137 return ((list1 != NULL) ? list1 : list2); 139 for (size1 = 0; list1[size1] != NULL; size1++); 142 /* list1 + list2 padded to a multiple of _list_increment */ 151 for (size1 = 0; list1[size1] != NULL; size1++) 152 list[count++] = list1[size [all...] |
/opensolaris-onvv-gate/usr/src/tools/ctf/common/ |
H A D | list.c | 173 list_concat(list_t **list1, list_t *list2) argument 177 for (l = *list1, last = NULL; l; last = l, l = l->l_next) 181 *list1 = list2; 192 list_t *list1, *next2; local 200 list1 = *list1p; 202 if (cmp(list1->l_data, list2->l_data) > 0) { 208 list2->l_next = list1; 210 list2->l_next = list1; 218 last1 = list1; 219 list1 [all...] |
/opensolaris-onvv-gate/usr/src/lib/print/libpapi-common/common/ |
H A D | list.c | 83 * the list of items from list1. The result is a list (type **). If 89 void **list1; local 99 list1 = *result; 101 if (list1 != NULL) 102 for (size1 = 0; list1[size1] != NULL; size1++) 108 /* list1 + list2 padded to a multiple of _list_increment */ 114 if (list1 != NULL) 115 for (size1 = 0; list1[size1] != NULL; size1++) 116 (*result)[count++] = list1[size1]; 120 free(list1); [all...] |
/opensolaris-onvv-gate/usr/src/cmd/lvm/metassist/common/ |
H A D | volume_dlist.c | 315 * Appends list2 to the end of list1. 321 dlist_t *list1, 326 if (list1 == NULL) { 331 /* Find last element of list1 */ 332 for (iter = list1; iter->next != NULL; iter = iter->next); 338 return (list1); 320 dlist_append_list( dlist_t *list1, dlist_t *list2) argument
|
H A D | volume_dlist.h | 119 * Appends list2 to the end of list1. 124 dlist_t *list1,
|
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/t/op/ |
H A D | split.t | 126 @list1 = @list2 = split ('p',"a p b c p"); 127 ok(@list1 == @list2 && 128 "@list1" eq "@list2" && 129 @list1 == 2 && 130 "@list1" eq "a b c ");
|
H A D | pack.t | 984 my @list1 = @list; 985 @list1 = (@list1) x $c unless $type =~ /[XxAaZBbHhP]/; 990 my @list2 = (@list1) x $c;
|
/opensolaris-onvv-gate/usr/src/cmd/addbadsec/ |
H A D | ix_altsctr.c | 87 struct alts_ent list1[], 684 struct alts_ent list1[], 693 if (list1[j1].bad_start == (uint32_t)ALTS_ENT_EMPTY) { 701 if (list1[j1].bad_start < list2[j2].bad_start) 702 buf[i++] = list1[j1++]; 707 if (list1[j1].bad_start == (uint32_t)ALTS_ENT_EMPTY) 709 buf[i++] = list1[j1]; 682 ent_merge( struct alts_ent buf[], struct alts_ent list1[], int lcnt1, struct alts_ent list2[], int lcnt2) argument
|
/opensolaris-onvv-gate/usr/src/cmd/format/ |
H A D | ix_altsctr.c | 706 ent_merge(buf, list1, lcnt1, list2, lcnt2) 708 struct alts_ent list1[]; 717 if (list1[j1].bad_start == (uint32_t)ALTS_ENT_EMPTY) { 725 if (list1[j1].bad_start < list2[j2].bad_start) 726 buf[i++] = list1[j1++]; 731 if (list1[j1].bad_start == (uint32_t)ALTS_ENT_EMPTY) 733 buf[i++] = list1[j1];
|
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | pp_sort.c | 133 ** The array of elements at list1 will be organized into runs of length 2, 148 ** However, it may also address a singleton element at the end of list1, 149 ** or it may be equal to ``last'', the first element beyond list1. 181 dynprep(pTHX_ gptr *list1, gptr *list2, size_t nmemb, SVCOMPARE_t cmp) argument 189 b = list1; 283 * # merge $runs runs at offset $offset of list $list1 into $list2. 286 * my ($offset, $runs, $base, $list1, $list2) = @_; 289 * if ($list1 is $base) copy run to $list2 292 * $off2 = mgsort2($offset, $runs-($runs/2), $base, $list2, $list1) 293 * mgsort2($off2, $runs/2, $base, $list2, $list1) 345 gptr *aux, *list1, *list2; local 1304 S_qsortsv(pTHX_ gptr *list1, size_t nmemb, SVCOMPARE_t cmp) argument [all...] |
/opensolaris-onvv-gate/usr/src/cmd/ssh/libssh/common/ |
H A D | g11n.c | 415 char **list1, **list2, **list3, **p, **q, **r; local 420 list1 = xsplit(set1, ','); 423 for (n1 = 0, p = list1; p && *p; p++, n1++) 437 for (n3 = 0, p = list1; p && *p; p++) { 458 for (p = list1; p && *p; p++) { 486 xfree_split_list(list1);
|
/opensolaris-onvv-gate/usr/src/uts/common/inet/sctp/ |
H A D | sctp_addr.c | 555 sctp_compare_ipif_list(sctp_ipif_hash_t *list1, sctp_ipif_hash_t *list2) argument 563 rw_enter(&list1->ipif_hash_lock, RW_READER); 565 obj1 = list_head(&list1->sctp_ipif_list); 566 for (i = 0; i < list1->ipif_count; i++) { 578 obj1 = list_next(&list1->sctp_ipif_list, obj1); 580 rw_exit(&list1->ipif_hash_lock); 611 sctp_copy_ipifs(sctp_ipif_hash_t *list1, sctp_t *sctp2, int sleep) argument 617 rw_enter(&list1->ipif_hash_lock, RW_READER); 618 obj = list_head(&list1->sctp_ipif_list); 619 for (i = 0; i < list1 [all...] |
/opensolaris-onvv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
H A D | ProbeData.java | 595 List <Record> list1 = d1.getRecords(); 597 int len1 = list1.size(); 610 r1 = list1.get(i);
|
/opensolaris-onvv-gate/usr/src/lib/libdladm/common/ |
H A D | libdlstat.c | 1155 /* Append linked list list1 to linked list list2 and return resulting list */ 1157 i_dlstat_join_lists(dladm_stat_chain_t *list1, dladm_stat_chain_t *list2) argument 1161 if (list1 == NULL) 1164 /* list1 has at least one element, find last element in list1 */ 1165 curr = list1; 1170 return (list1);
|