Home
last modified time | relevance | path

Searched refs:two (Results 1 – 25 of 573) sorted by relevance

12345678910>>...23

/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/tests/
H A Dcubetype.sh169 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 Darrays.sh56 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/cmd/sendmail/libsm/
H A Dt-strl.c32 int one, two, k; variable
99 SM_TEST(one == two);
103 SM_TEST(one == two);
107 SM_TEST(one == two);
111 SM_TEST(one == two);
115 SM_TEST(one == two);
119 SM_TEST(one == two);
123 SM_TEST(one == two);
132 SM_TEST(one == two);
134 two = sm_snprintf(dst2, 2, "%s", src1[0]);
[all …]
/illumos-gate/usr/src/lib/fm/libdiagcode/common/tests/
H A DSAMPLE0.dict61 fault.two=6
62 fault.one fault.two=5
64 fault.three fault.two=3
72 #TEST:key2code:0:fault.two fault.one:SAMPLE0-8000-5V
73 #TEST:key2code:0:fault.one fault.two:SAMPLE0-8000-5V
75 #TEST:key2code:0:fault.one fault.two fault.one fault.one fault.two:SAMPLE0-8000-5V
80 #TEST:code2key:EINVAL:SAMPLE0-7000-5S:fault.one fault.two
81 #TEST:code2key:EINVAL:SAMPLE0-8010-5S:fault.one fault.two
82 #TEST:code2key:EINVAL:SAMPLE0-8000-5T:fault.one fault.two
83 #TEST:code2key:EINVAL:SAMPLE0-8000-S5:fault.one fault.two
[all …]
H A DSAMPLE1.dict36 fault.y.two=2097151
37 fault.y.two fault.z.one=2097152
39 fault.x.three fault.y.two=274880004090
40 fault.x.three fault.y.two fault.z.one=1928
47 #TEST:key2code:0:fault.y.two:SAMPLE1-9YYY-YT
49 #TEST:key2code:0:fault.x.three fault.y.two:SAMPLE1-CYYY-YYYX-M4
50 #TEST:key2code:0:fault.x.three fault.y.two fault.z.one:SAMPLE1-801V-89
54 #TEST:code2key:0:SAMPLE1-9YYY-YT:fault.y.two
56 #TEST:code2key:0:SAMPLE1-CYYY-YYYX-M4:fault.x.three fault.y.two
57 #TEST:code2key:0:SAMPLE1-801V-89:fault.x.three fault.y.two fault.z.one
H A DMALFORMED.dict33 fault.one fault.three fault.two 2
36 fault.two=6
37 fault.one fault.two=5
39 fault.three fault.two=3
42 #TEST:key2code:0:fault.two fault.three:MALFORMED-8000-3N
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/types/
H A Dtst.relenum.d42 two enumerator
55 printf("zero = %d; one = %d; two = %d", zero, one, two);
61 /second < one || two > second || null == first/
64 printf("zero = %d; one = %d; two = %d", zero, one, two);
70 /first < two && second > one && one != two && zero != first/
/illumos-gate/usr/src/tools/smatch/src/
H A Dsmatch_slist.c264 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 Dsmatch_bits.c157 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 Dsmatch_estate.c210 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 Dsmatch.h1379 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 Dsmatch_var_sym.c191 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 Dsmatch_ranges.c1093 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 Djoin4_28.test28 insert into t1 values(2,'two');
39 } {2 two 2 niban ok}
44 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}}
52 } {2 two 2 niban ok}
57 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}}
62 } {2 two 2 niban ok}
67 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}}
72 } {2 two 2 niban ok}
77 } {1 one {} {} {} 2 two 2 niban ok 3 three {} {} {} 4 four {} {} {}}
/illumos-gate/usr/src/tools/smatch/src/validation/
H A Dsm_rosenberg.c30 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 Dsm_equiv1.c6 int *two; variable
10 two = one; in func()
12 if (two == 1) { in func()
/illumos-gate/usr/src/lib/libm/common/C/
H A Dtanh.c64 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/LD/
H A Dtanhl.c63 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/Q/
H A Dtanhl.c63 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()
H A Dexpm1l.c107 two = +2.0L, variable
152 return (x + (x * r) / (two - r)); in expm1l()
162 r = (s + s) / (two - r); in expm1l()
180 r = (x - t * (T1 + t * (T2 + t * (T3 + t * (T4 + t * T5))))) - two; in expm1l()
/illumos-gate/usr/src/lib/libm/common/complex/
H A Dcatanl.c112 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 Dcatan.c86 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 Dtgammaf.c165 #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 Dvmprofile.c263 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 Dsun_solaris_cr_6805792_varmovetest1.sh109 node.two="dummy2"
117 nameref nodetwo=node.two
137 node.two="world"

12345678910>>...23