Home
last modified time | relevance | path

Searched refs:i (Results 126 – 150 of 16010) sorted by path

12345678910>>...641

/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/aggs/
H A Derr.D_NORMALIZE_SCALAR.bad.d47 i = 0;
52 /i < 20/
54 @func[i % 5] = sum(i * 100);
55 i++;
59 /i == 20/
H A Derr.D_TRUNC_AGGARG.bad.d29 int i; variable
33 trunc(i);
H A Dtst.aggencoding.d21 /i++ < 320/
23 @ = lquantize(i, 0, 640, 1, i);
24 @ = lquantize(641 - i, 0, 640, 1, i);
28 /i == 320/
H A Dtst.aggpack.d31 i = 0;
36 @a[i] = quantize(0, i);
37 @a[i] = quantize(1, 100 - i);
38 i++;
42 /i > 100/
H A Dtst.aggpackbanner.ksh55 let i=0
57 while [[ $i -le $line ]]; do
58 printf "\tprinta(@letter%d);\n" $i
59 let i=i+1
H A Dtst.aggpackzoom.d20 /i++ < 30/
22 @[1] = lquantize(i, 0, 40, 1, 1000);
23 @[2] = lquantize(i, 0, 40, 1, 1000);
24 @[3] = lquantize(i, 0, 40, 1, 1000);
28 /i == 40/
31 @[1] = lquantize(i, 0, 40, 1, 2000);
33 @[2] = lquantize(i, 0, 40, 1, 2000);
35 @[3] = lquantize(i, 0, 40, 1, 2000);
H A Dtst.aggzoom.d20 /i++ < 90/
22 @ = lquantize(i, 0, 100, 1, 1000);
26 /i == 100/
28 @ = lquantize(i++, 0, 100, 1, 2000);
29 @ = lquantize(i++, 0, 100, 1, 3000);
H A Dtst.allquant.d31 int i; variable
35 @ = quantize(1LL << i);
36 @ = quantize((1LL << i) + 1);
37 @ = quantize(-(1LL << i));
38 @ = quantize(-(1LL << i) - 1);
39 i++;
43 /i == 64/
H A Dtst.avg.d43 i = 0;
47 /i < 1000/
49 @a = avg(i);
50 i += 100;
54 /i == 1000/
H A Dtst.clear.d44 i = 0;
49 /i < 20/
51 @func[i%5] = sum(i * 100);
52 i++;
56 /i == 10/
65 i++;
69 /i == 20/
H A Dtst.clearavg.d45 /i++ < 5/
51 /i == 5/
H A Dtst.cleardenormalize.d45 i = 0;
50 /i != 10 || i != 20/
52 @func[i%5] = sum(i * 100);
53 i++;
57 /i == 10/
67 i++
71 /i == 20/
H A Dtst.clearnormalize.d44 i = 0;
49 /i < 20/
51 @func[i % 5] = sum(i * 100);
52 i++;
56 /i == 10/
66 i++
70 /i == 20/
H A Dtst.clearstddev.d42 /i++ < 5/
48 /i == 5/
H A Dtst.count2.d40 i = 0;
44 /i != 10/
46 i++;
51 /i == 10/
H A Dtst.count3.d41 i = 0;
45 /i != 10/
47 i++;
53 /i == 10/
H A Dtst.denormalize.d43 i = 0;
48 /i < 20/
50 @func[i % 5] = sum(i * 100);
51 i++;
55 /i == 20/
H A Dtst.denormalizeonly.d44 i = 0;
49 /i < 20/
51 @func[i%5] = sum(i * 100);
52 i++;
56 /i == 20/
H A Dtst.fmtnormalize.d43 i = 0;
48 /i < 20/
50 @func[i % 5] = sum(i * 100);
51 i++;
55 /i == 20/
H A Dtst.goodkey.d40 i = 0;
44 /i != 5/
46 i++;
52 /i == 5/
H A Dtst.keysort.d33 i = 0;
36 @tour["Ghent", i++, j] = sum(5 - j);
39 @tour["Berlin", i++, j] = sum(5 - j);
42 @tour["London", i++, j] = sum(5 - j);
43 @tour["Dublin", i++, j] = sum(5 - j);
49 @tour["Zurich", i++, j] = sum(5 - j);
52 @tour["Regina", i++, j] = sum(5 - j);
55 @tour["Calgary", i++, j] = sum(5 - j);
60 @tour["Prague", i++, j] = sum(5 - j);
61 @tour["London", i++, j] = sum(5 - j);
[all …]
H A Dtst.lquantize.d43 i = 0;
47 /i < 1000/
49 @a[i] = lquantize(i, -100, 1100, 100 );
50 i += 100;
54 /i == 1000/
H A Dtst.lquantnormal.d32 /i++ < 10/
34 @ = lquantize(i, 0, 10);
35 @ = lquantize(i, 0, 10);
36 @ = lquantize(i, 0, 10);
37 @ = lquantize(i, 0, 10);
38 @ = lquantize(i, 0, 10);
42 /i == 10/
H A Dtst.lquantround.d36 /i++ >= 27/
42 /i > 8/
48 /i > 2 && i <= 8/
54 /i <= 2/
H A Dtst.lquantzero.d54 i++;
55 @one[i] = lquantize(0, 10, 20, 1, incr);
56 @two[i] = lquantize(0, 1, 20, 5, incr);
57 @three[i] = lquantize(0, 0, 20, 1, incr);
58 @four[i] = lquantize(0, -10, 10, 1, incr);
59 @five[i] = lquantize(0, -10, 0, 1, incr);
60 @six[i] = lquantize(0, -10, -1, 1, incr);
61 @seven[i] = lquantize(0, -10, -2, 1, incr);

12345678910>>...641