4 * The contents of this file are subject to the terms of the
5 * Common Development and Distribution License (the "License").
6 * You may not use this file except in compliance with the License.
8 * You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
9 * or http://www.opensolaris.org/os/licensing.
10 * See the License for the specific language governing permissions
11 * and limitations under the License.
13 * When distributing Covered Code, include this CDDL HEADER in each
14 * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
15 * If applicable, add the following below this CDDL HEADER, with the
16 * fields enclosed by brackets "[]" replaced with your own identifying
17 * information: Portions Copyright [yyyy] [name of copyright owner]
23 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
24 * Use is subject to license terms.
27 #pragma ident "%Z%%M% %I% %E% SMI"
29 #pragma D option quiet
33 @["j-church"] = lquantize(1, 0, 10, 1, 100);
34 @["j-church"] = lquantize(1, 0, 10, 1, -99);
35 @["j-church"] = lquantize(1, 0, 10, 1, -1);
41 @["k-ingleside"] = lquantize(1, 0, 10, 1, -val);
46 @["l-taraval"] = lquantize(0, 0, 10, 1, -val);
47 @["l-taraval"] = lquantize(-1, 0, 10, 1, -val);
48 @["l-taraval"] = lquantize(1, 0, 10, 1, val);
49 @["l-taraval"] = lquantize(1, 0, 10, 1, val);
54 @["m-oceanview"] = lquantize(1, 0, 10, 1, (1 << 63) - 1);
55 @["m-oceanview"] = lquantize(1, 0, 10, 1);
56 @["m-oceanview"] = lquantize(2, 0, 10, 1, (1 << 63) - 1);
57 @["m-oceanview"] = lquantize(8, 0, 10, 1, 400000);
62 @["n-judah"] = lquantize(1, 0, 10, 1, val);
63 @["n-judah"] = lquantize(2, 0, 10, 1, val);
64 @["n-judah"] = lquantize(2, 0, 10, 1, val);
65 @["n-judah"] = lquantize(2, 0, 10, 1);
71 this->val = (1 << 63) - 1;
73 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
75 this->val = ((1 << 63) - 1) / this->i;
77 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
79 this->val = ((1 << 63) - 1) / this->i;
81 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
83 this->val = ((1 << 63) - 1) / this->i;
85 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
87 this->val = ((1 << 63) - 1) / this->i;
89 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
91 this->val = ((1 << 63) - 1) / this->i;
93 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
95 this->val = ((1 << 63) - 1) / this->i;
97 @["f-market"] = lquantize(this->i, 0, 10, 1, this->val);
99 this->val = ((1 << 63) - 1) / this->i;
107 * We want to test the ability to sort very large quantizations
108 * that differ by a small amount. Ideally, they would differ only
109 * by 1 -- but that is smaller than the precision of long doubles of
110 * this magnitude on x86. To assure that the same test works on x86
111 * just as it does on SPARC, we pick a value that is just larger than
112 * the precision at this magnitude. It should go without saying that
113 * this robustness on new ISAs very much depends on the precision
114 * of the long double representation.
116 this->val = (1 << 63) - 7;
118 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
120 this->val = ((1 << 63) - 1) / this->i;
122 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
124 this->val = ((1 << 63) - 1) / this->i;
126 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
128 this->val = ((1 << 63) - 1) / this->i;
130 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
132 this->val = ((1 << 63) - 1) / this->i;
134 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
136 this->val = ((1 << 63) - 1) / this->i;
138 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
140 this->val = ((1 << 63) - 1) / this->i;
142 @["s-castro"] = lquantize(this->i, 0, 10, 1, this->val);
144 this->val = ((1 << 63) - 1) / this->i;