Home
last modified time | relevance | path

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

12345678910>>...24

/illumos-gate/usr/src/contrib/ast/src/cmd/ksh93/tests/
H A Dcubetype.sh150 cc[2]=(x=2 y=3 name=two colors+=([table]=white) items+=(pencil) z=6)
169 cc[two]=(x=2 y=3 name=two colors+=([table]=white) items+=(pencil) z=6)
172 [[ ${cc[two].y} == 3 ]] || err_exit '${cc[two].y} != 3'
173 (( cc[two].y == 3 )) || err_exit '(( cc[two].y != 3))'
174 [[ ${cc[two].colors[table]} == white ]] || err_exit '${cc[two].colors[table]} != white'
175 [[ ${cc[two].items[2]} == pencil ]] || err_exit '${cc[two].items[2]} != pencil'
176 (( cc[two].len == 7 )) || err_exit '(( cc[two].len != 7 ))'
177 [[ $(cc[two].len) == 7 ]] || err_exit '$(cc[two].len) != 7 ))'
178 [[ ${cc[two].len} == 7 ]] || err_exit '${cc[two].len} != 7 ))'
179 (( cc[two].count == 2 )) || err_exit 'cc[two].count != 2'
[all …]
H A Darrays.sh43 set -A x zero one two three four 'five six'
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
239 ( set -A list one two three four)
259 foo=( $foo two)
285 typeset -A foo=( [two]=1)
[all …]
/illumos-gate/usr/src/test/elf-tests/tests/groups/strip-groups/
H A Dstrip-two-sections.sh39 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 Dt-strl.c30 int one, two, k; variable
96 two = sm_snprintf(dst2, sizeof dst2, "%s/%s", src1[0], src1[1]);
97 SM_TEST(one == two);
100 two = sm_snprintf(dst2, 10, "%s/%s", src1[0], src1[1]);
101 SM_TEST(one == two);
104 two = sm_snprintf(dst2, 5, "%s/%s", src1[0], src1[1]);
105 SM_TEST(one == two);
108 two = sm_snprintf(dst2, 0, "%s/%s", src1[0], src1[1]);
109 SM_TEST(one == two);
112 two = sm_snprintf(dst2, sizeof dst2, "%s/%s/%s", src1[0], src1[1], src1[2]);
[all …]
/illumos-gate/usr/src/lib/fm/libdiagcode/common/tests/
H A DSAMPLE0.dict32 # here's a worked by hand example for key: "fault.one fault.two"
55 fault.one fault.three fault.two=2 "this is all three faults"
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
71 #TEST:key2code:0:fault.one fault.two fault.one: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
[all …]
H A DSAMPLE1.dict33 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 DMALFORMED.dict30 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 Dtst.relenum.d40 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 Dsmatch_slist.c250 static void copy_possibles(struct sm_state *to, struct sm_state *one, struct sm_state *two) in copy_possibles() argument
253 struct sm_state *small = two; in copy_possibles()
262 if (ptr_list_size((struct ptr_list *)two->possible) > in copy_possibles()
264 large = two; in copy_possibles()
453 struct sm_state *merge_sm_states(struct sm_state *one, struct sm_state *two) in merge_sm_states() argument
462 if (one == two) in merge_sm_states()
471 s = merge_states(one->owner, one->name, one->sym, one->state, two->state); in merge_sm_states()
475 result->right = two; in merge_sm_states()
477 copy_possibles(result, one, two); in merge_sm_states()
494 if (result->state == two->state) in merge_sm_states()
[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()
187 static struct bit_info *combine_bit_info(struct bit_info *one, struct bit_info *two) in combine_bit_info() argument
191 if ((one->set & two->possible) != one->set) in combine_bit_info()
193 if ((two->set & one->possible) != 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.h466 int expr_equiv(struct expression *one, struct expression *two);
493 int types_equiv(struct symbol *one, struct symbol *two);
519 struct var_sym_list *combine_var_sym_lists(struct var_sym_list *one, struct var_sym_list *two);
520 int var_sym_lists_equiv(struct var_sym_list *one, struct var_sym_list *two);
1119 int merge_comparisons(int one, int two);
1125 int get_comparison_strings(const char *one, const char *two);
1167 int sval_cmp_t(struct symbol *type, sval_t one, sval_t two);
1169 sval_t sval_min(sval_t one, sval_t two);
1170 sval_t sval_max(sval_t one, sval_t two);
1192 struct string_list *combine_string_lists(struct string_list *one, struct string_list *two);
[all …]
H A Dsmatch_ranges.c1034 struct range_list *rl_union(struct range_list *one, struct range_list *two) in rl_union() argument
1042 FOR_EACH_PTR(two, tmp) { in rl_union()
1091 int ranges_equiv(struct data_range *one, struct data_range *two) in ranges_equiv() argument
1093 if (!one && !two) in ranges_equiv()
1095 if (!one || !two) in ranges_equiv()
1097 if (sval_cmp(one->min, two->min) != 0) in ranges_equiv()
1099 if (sval_cmp(one->max, two->max) != 0) in ranges_equiv()
1104 int rl_equiv(struct range_list *one, struct range_list *two) in rl_equiv() argument
1109 if (one == two) in rl_equiv()
1113 PREPARE_PTR_LIST(two, two_range); in rl_equiv()
[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()
/illumos-gate/usr/src/lib/libsqlite/test/
H A Djoin4_28.test26 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 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/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/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/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()
/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/contrib/ast/src/lib/libast/vmalloc/
H A Dvmprofile.c256 reg Pfobj_t *one, *two, *next; local
263 one = two = NIL(Pfobj_t*);
271 pf->next = two;
272 two = pf;
279 two = pfsort(two);
282 if(PFLINE(one) == 0 && PFLINE(two) == 0)
283 cmp = PFVM(one) > PFVM(two) ? 1 : -1;
286 else if(PFLINE(two) == 0)
288 else if((cmp = strcmp(PFFILE(one),PFFILE(two))) == 0)
289 { cmp = PFLINE(one) - PFLINE(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>>...24