/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/tests/ |
H A D | cubetype.sh | 169 cc[two]=(x=2 y=3 name=two colors+=([table]=white) items+=(pencil) z=6) 173 (( cc[two].y == 3 )) || err_exit '(( cc[two].y != 3))' 180 unset cc[two].x cc[two].y cc[two].z 183 unset cc[two].name unset cc[two].colors cc[two].items 185 cc[two].count=0 189 [two]=(x=2 y=3 name=two colors+=([table]=white) z=6) 193 (( cc[two].y == 3 )) || err_exit '(( cc[two].y != 3))' 199 unset cc[two].x cc[two].y cc[two].z 202 cc[three]=cc[two] 208 unset cc[two].name unset cc[two].colors [all …]
|
H A D | arrays.sh | 56 if [[ ${x[2]} != two ]] 59 if [[ ${x[@]:2:1} != two ]] 72 if [[ ${y[2]} != two ]] 76 if [[ ${y[2]} != two ]] 189 foo=(one two) 191 foo[two]=3 259 foo=( $foo two) 285 typeset -A foo=( [two]=1) 303 (x[two]=8) 343 foo[1]=two [all …]
|
/illumos-gate/usr/src/test/elf-tests/tests/groups/strip-groups/ |
H A D | strip-two-sections.sh | 39 gas -c ${TESTDIR}/strip-two-sections.s -o strip-two-obj1.o 45 /bin/ld -s strip-two-obj1.o -o strip-two 51 if [[ $(elfdump -cN.debug_stuff strip-two) != "" ]]; then 56 if [[ $(elfdump -cN.test_code strip-two) == "" || 57 $(elfdump -cN.test_data strip-two) == "" ]]; then 64 /bin/ld -r -s strip-two-obj1.o -o strip-two.o 71 if [[ $(elfdump -cN.group strip-two.o) == "" ]]; then 76 find_in_group .group1 .test_data strip-two.o 77 find_in_group .group1 .test_code strip-two.o
|
/illumos-gate/usr/src/cmd/sendmail/libsm/ |
H A D | t-strl.c | 30 int one, two, k; variable 97 SM_TEST(one == two); 101 SM_TEST(one == two); 105 SM_TEST(one == two); 109 SM_TEST(one == two); 113 SM_TEST(one == two); 117 SM_TEST(one == two); 121 SM_TEST(one == two); 130 SM_TEST(one == two); 132 two = sm_snprintf(dst2, 2, "%s", src1[0]); [all …]
|
/illumos-gate/usr/src/lib/fm/libdiagcode/common/tests/ |
H A D | SAMPLE0.dict | 58 fault.two=6 59 fault.one fault.two=5 61 fault.three fault.two=3 69 #TEST:key2code:0:fault.two fault.one:SAMPLE0-8000-5V 70 #TEST:key2code:0:fault.one fault.two:SAMPLE0-8000-5V 72 #TEST:key2code:0:fault.one fault.two fault.one fault.one fault.two:SAMPLE0-8000-5V 77 #TEST:code2key:EINVAL:SAMPLE0-7000-5S:fault.one fault.two 78 #TEST:code2key:EINVAL:SAMPLE0-8010-5S:fault.one fault.two 79 #TEST:code2key:EINVAL:SAMPLE0-8000-5T:fault.one fault.two 80 #TEST:code2key:EINVAL:SAMPLE0-8000-S5:fault.one fault.two [all …]
|
H A D | SAMPLE1.dict | 33 fault.y.two=2097151 34 fault.y.two fault.z.one=2097152 36 fault.x.three fault.y.two=274880004090 37 fault.x.three fault.y.two fault.z.one=1928 44 #TEST:key2code:0:fault.y.two:SAMPLE1-9YYY-YT 46 #TEST:key2code:0:fault.x.three fault.y.two:SAMPLE1-CYYY-YYYX-M4 47 #TEST:key2code:0:fault.x.three fault.y.two fault.z.one:SAMPLE1-801V-89 51 #TEST:code2key:0:SAMPLE1-9YYY-YT:fault.y.two 53 #TEST:code2key:0:SAMPLE1-CYYY-YYYX-M4:fault.x.three fault.y.two 54 #TEST:code2key:0:SAMPLE1-801V-89:fault.x.three fault.y.two fault.z.one
|
H A D | MALFORMED.dict | 30 fault.one fault.three fault.two 2 33 fault.two=6 34 fault.one fault.two=5 36 fault.three fault.two=3 39 #TEST:key2code:0:fault.two fault.three:MALFORMED-8000-3N
|
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/types/ |
H A D | tst.relenum.d | 40 two enumerator 53 printf("zero = %d; one = %d; two = %d", zero, one, two); 59 /second < one || two > second || null == first/ 62 printf("zero = %d; one = %d; two = %d", zero, one, two); 68 /first < two && second > one && one != two && zero != first/
|
/illumos-gate/usr/src/tools/smatch/src/ |
H A D | smatch_slist.c | 264 large = two; in copy_possibles() 462 if (one == two) in merge_sm_states() 475 result->right = two; in merge_sm_states() 495 result->line = two->line; in merge_sm_states() 506 show_state(two->state), two->line, in merge_sm_states() 741 avl_insert(two, sm); in match_states_stree() 757 FOR_EACH_SM(*two, sm) { in call_pre_merge_hooks() 861 two = two_iter.sm; in __merge_stree() 863 if (one == two) { in __merge_stree() 954 avl_insert(&two, sm); in merge_fake_stree() [all …]
|
H A D | smatch_bits.c | 157 static int binfo_equiv(struct bit_info *one, struct bit_info *two) in binfo_equiv() argument 159 if (one->set == two->set && in binfo_equiv() 160 one->possible == two->possible) in binfo_equiv() 167 struct bit_info *one, *two; in merge_bstates() local 170 two = two_state->data; in merge_bstates() 172 if (binfo_equiv(one, two)) in merge_bstates() 175 return alloc_bstate(one->set & two->set, one->possible | two->possible); in merge_bstates() 191 if ((one->set & two->possible) != one->set) in combine_bit_info() 193 if ((two->set & one->possible) != two->set) in combine_bit_info() 196 ret->set = one->set | two->set; in combine_bit_info() [all …]
|
H A D | smatch_estate.c | 210 static int rlists_equiv(struct related_list *one, struct related_list *two) in rlists_equiv() argument 216 PREPARE_PTR_LIST(two, two_rel); in rlists_equiv() 235 int estates_equiv(struct smatch_state *one, struct smatch_state *two) in estates_equiv() argument 237 if (!one || !two) in estates_equiv() 239 if (one == two) in estates_equiv() 241 if (!rlists_equiv(estate_related(one), estate_related(two))) in estates_equiv() 243 if (estate_capped(one) != estate_capped(two)) in estates_equiv() 245 if (estate_treat_untagged(one) != estate_treat_untagged(two)) in estates_equiv() 247 if (estate_has_hard_max(one) != estate_has_hard_max(two)) in estates_equiv() 249 if (estate_new(one) != estate_new(two)) in estates_equiv() [all …]
|
H A D | smatch.h | 1379 type = type_bits(one.type) > type_bits(two.type) ? one.type : two.type; in fp_cmp() 1383 type = two.type; in fp_cmp() 1386 two = sval_cast(type, two); in fp_cmp() 1389 if (one.fvalue < two.fvalue) in fp_cmp() 1396 if (one.dvalue < two.dvalue) in fp_cmp() 1418 return fp_cmp(one, two); in sval_cmp() 1422 type = two.type; in sval_cmp() 1427 two = sval_cast(type, two); in sval_cmp() 1430 if (one.uvalue < two.uvalue) in sval_cmp() 1437 if (one.value < two.value) in sval_cmp() [all …]
|
H A D | smatch_var_sym.c | 191 struct var_sym_list *combine_var_sym_lists(struct var_sym_list *one, struct var_sym_list *two) in combine_var_sym_lists() argument 196 merge_var_sym_list(&to_vsl, two); in combine_var_sym_lists() 200 int var_sym_lists_equiv(struct var_sym_list *one, struct var_sym_list *two) in var_sym_lists_equiv() argument 204 if (one == two) in var_sym_lists_equiv() 207 if (ptr_list_size((struct ptr_list *)one) != ptr_list_size((struct ptr_list *)two)) in var_sym_lists_equiv() 211 PREPARE_PTR_LIST(two, two_tmp); in var_sym_lists_equiv()
|
H A D | smatch_ranges.c | 1093 if (!one && !two) in ranges_equiv() 1095 if (!one || !two) in ranges_equiv() 1109 if (one == two) in rl_equiv() 1544 if (!one || !two) in do_intersection() 1561 add_range(&ret, two->min, two->max); in do_intersection() 1562 NEXT_PTR_LIST(two); in do_intersection() 1567 NEXT_PTR_LIST(two); in do_intersection() 1574 NEXT_PTR_LIST(two); in do_intersection() 1577 FINISH_PTR_LIST(two); in do_intersection() 1590 if (!one || !two) in rl_intersection() [all …]
|
/illumos-gate/usr/src/lib/libsqlite/test/ |
H A D | join4_28.test | 26 insert into t1 values(2,'two'); 37 } {2 two 2 niban ok} 42 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}} 50 } {2 two 2 niban ok} 55 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}} 60 } {2 two 2 niban ok} 65 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}} 70 } {2 two 2 niban ok} 75 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}}
|
/illumos-gate/usr/src/tools/smatch/src/validation/ |
H A D | sm_rosenberg.c | 30 struct aa_policy two; in main() local 41 memset(&two, 0, sizeof(two)); in main() 55 copy_to_user(ptr, &two, sizeof(two)); in main()
|
H A D | sm_equiv1.c | 6 int *two; variable 10 two = one; in func() 12 if (two == 1) { in func()
|
/illumos-gate/usr/src/lib/libm/common/C/ |
H A D | tanh.c | 64 two = 2.0, variable 83 z = one - two / (expm1(t + t) + two); in tanh() 86 z = -y / (y + two); in tanh()
|
/illumos-gate/usr/src/lib/libm/common/Q/ |
H A D | tanhl.c | 63 static const long double small = 1.0e-20L, one = 1.0, two = 2.0, variable 84 z = one - two / (expm1l(t + t) + two); in tanhl() 87 z = -y / (y + two); in tanhl()
|
/illumos-gate/usr/src/lib/libm/common/LD/ |
H A D | tanhl.c | 63 static const long double small = 1.0e-20L, one = 1.0, two = 2.0, variable 84 z = one - two / (expm1l(t + t) + two); in tanhl() 87 z = -y / (y + two); in tanhl()
|
/illumos-gate/usr/src/lib/libm/common/complex/ |
H A D | catanl.c | 112 two = 2.0L, variable 180 LD_IM(ans) = half * log1pl(two / (-t)); in catanl() 217 LD_IM(ans) = t * (one - two * t); in catanl() 222 LD_RE(ans) = half * atan2l(two, (one - ax) * (one + in catanl() 254 LD_RE(ans) = half * atan2l(two, -ax); in catanl() 258 t = two / ax; in catanl() 294 LD_IM(ans) = half * log1pl(two / (ay - one)); in catanl()
|
H A D | catan.c | 86 two = 2.0, variable 149 D_IM(ans) = half * log1p(two / (-t)); in catan() 175 D_RE(ans) = half * atan2(two, (one - ax) * (one + in catan() 217 D_RE(ans) = half * atan2(two, -ax); in catan() 221 t = two / ax; in catan() 257 D_IM(ans) = half * log1p(two / (ay - one)); in catan()
|
/illumos-gate/usr/src/lib/libm/common/m9x/ |
H A D | tgammaf.c | 165 #define two c[1] macro 325 ss = T1[m - 3] + T2[j] + u * (two + A1 * (u * u)); in large_gam() 426 rr = (x + one) * (x + two) * yy; in gam_n() 430 rr = (x + one) * (x + two) * ((x + 3.0) * yy); in gam_n() 433 z1 = (x + two) * (x + 3.0) * yy; in gam_n() 438 z1 = (x + two) * (x + 3.0); in gam_n() 440 rr = z1 * (z1 - two) * z2; in gam_n() 443 z1 = (x + two) * (x + 3.0); in gam_n() 445 rr = z1 * (z1 - two) * z2; in gam_n()
|
/illumos-gate/usr/src/contrib/ast/src/lib/libast/vmalloc/ |
H A D | vmprofile.c | 263 one = two = NIL(Pfobj_t*); 271 pf->next = two; 272 two = pf; 279 two = pfsort(two); 286 else if(PFLINE(two) == 0) 300 { if(two) 301 next->next = two; 307 pf = two; 308 else next->next = two; 309 next = two; [all …]
|
/illumos-gate/usr/src/cmd/ast/libshell/common/tests/ |
H A D | sun_solaris_cr_6805792_varmovetest1.sh | 109 node.two="dummy2" 117 nameref nodetwo=node.two 137 node.two="world"
|