/titanic_41/usr/src/lib/libsqlite/test/ |
H A D | sort.test | 50 execsql {SELECT n FROM t1 ORDER BY n} 53 execsql {SELECT n FROM t1 ORDER BY n ASC} 56 execsql {SELECT ALL n FROM t1 ORDER BY n ASC} 59 execsql {SELECT n FROM t1 ORDER BY n DESC} 62 execsql {SELECT v FROM t1 ORDER BY v} 65 execsql {SELECT n FROM t1 ORDER BY v} 68 execsql {SELECT n FROM t1 ORDER BY v DESC} 71 execsql {SELECT flt FROM t1 ORDER BY flt} 74 execsql {SELECT flt FROM t1 ORDER BY flt DESC} 77 execsql {SELECT roman FROM t1 ORDER BY roman} [all …]
|
H A D | select4.test | 38 execsql {SELECT DISTINCT log FROM t1 ORDER BY log} 54 ORDER BY log; 63 ORDER BY log; 74 ORDER BY log DESC; 101 ORDER BY log; 106 SELECT DISTINCT log FROM t1 ORDER BY log 109 ORDER BY log; 112 } {1 {ORDER BY clause should come after UNION ALL not before}} 121 ORDER BY log; 129 ORDER BY log; [all …]
|
H A D | update.test | 45 execsql {SELECT * FROM test1 ORDER BY f1} 69 execsql {SELECT * FROM test1 ORDER BY f1} 76 execsql {SELECT * FROM test1 ORDER BY f1} 82 execsql {SELECT * FROM test1 ORDER BY f1} 91 execsql {SELECT * FROM test1 ORDER BY F1} 98 execsql {SELECT * FROM test1 ORDER BY F1} 112 execsql {SELECT * FROM test1 ORDER BY f1,f2} 116 execsql {SELECT * FROM test1 ORDER BY f1,f2} 120 execsql {SELECT * FROM test1 ORDER BY f1,f2} 124 execsql {SELECT * FROM test1 ORDER BY f1,f2} [all …]
|
H A D | notnull.test | 39 SELECT * FROM t1 order by a; 46 SELECT * FROM t1 order by a; 53 SELECT * FROM t1 order by a; 60 SELECT * FROM t1 order by a; 67 SELECT * FROM t1 order by a; 74 SELECT * FROM t1 order by a; 81 SELECT * FROM t1 order by a; 88 SELECT * FROM t1 order by a; 95 SELECT * FROM t1 order by a; 102 SELECT * FROM t1 order by a; [all …]
|
H A D | where.test | 173 count {SELECT w FROM t1 WHERE w+1<=4 ORDER BY w} 284 SELECT * FROM t1 WHERE rowid IN (1,2,3,1234) order by 1; 289 SELECT * FROM t1 WHERE rowid+0 IN (1,2,3,1234) order by 1; 294 SELECT * FROM t1 WHERE w IN (-1,1,2,3) order by 1; 299 SELECT * FROM t1 WHERE w+0 IN (-1,1,2,3) order by 1; 306 ORDER BY 1; 313 ORDER BY 1; 320 ORDER BY 1; 327 ORDER BY 1; 332 SELECT * FROM t1 WHERE x IN (1,7) ORDER BY 1; [all …]
|
H A D | select3.test | 37 execsql {SELECT DISTINCT log FROM t1 ORDER BY log} 58 execsql {SELECT log, count(*) FROM t1 GROUP BY log ORDER BY log} 61 execsql {SELECT log, min(n) FROM t1 GROUP BY log ORDER BY log} 64 execsql {SELECT log, avg(n) FROM t1 GROUP BY log ORDER BY log} 67 execsql {SELECT log, avg(n)+1 FROM t1 GROUP BY log ORDER BY log} 70 execsql {SELECT log, avg(n)-min(n) FROM t1 GROUP BY log ORDER BY log} 73 execsql {SELECT log*2+1, avg(n)-min(n) FROM t1 GROUP BY log ORDER BY log} 77 SELECT log*2+1 as x, count(*) FROM t1 GROUP BY x ORDER BY x 82 SELECT log*2+1 AS x, count(*) AS y FROM t1 GROUP BY x ORDER BY y 87 SELECT log*2+1 AS x, count(*) AS y FROM t1 GROUP BY x ORDER BY 10-(x+y) [all …]
|
H A D | format3.test | 60 execsql {SELECT n FROM t1 ORDER BY n} 63 execsql {SELECT n FROM t1 ORDER BY n ASC} 66 execsql {SELECT ALL n FROM t1 ORDER BY n ASC} 69 execsql {SELECT n FROM t1 ORDER BY n DESC} 72 execsql {SELECT v FROM t1 ORDER BY v} 75 execsql {SELECT n FROM t1 ORDER BY v} 78 execsql {SELECT n FROM t1 ORDER BY v DESC} 81 execsql {SELECT flt FROM t1 ORDER BY flt} 84 execsql {SELECT flt FROM t1 ORDER BY flt DESC} 87 execsql {SELECT roman FROM t1 ORDER BY roman} [all …]
|
H A D | func.test | 29 execsql {SELECT t1 FROM tbl1 ORDER BY t1} 46 execsql {SELECT length(t1) FROM tbl1 ORDER BY t1} 49 set r [catch {execsql {SELECT length(*) FROM tbl1 ORDER BY t1}} msg] 53 set r [catch {execsql {SELECT length(t1,5) FROM tbl1 ORDER BY t1}} msg] 58 ORDER BY length(t1)} 67 execsql {SELECT substr(t1,1,2) FROM tbl1 ORDER BY t1} 70 execsql {SELECT substr(t1,2,1) FROM tbl1 ORDER BY t1} 73 execsql {SELECT substr(t1,3,3) FROM tbl1 ORDER BY t1} 76 execsql {SELECT substr(t1,-1,1) FROM tbl1 ORDER BY t1} 79 execsql {SELECT substr(t1,-1,2) FROM tbl1 ORDER BY t1} [all …]
|
H A D | select1.test | 269 # ORDER BY expressions 272 set v [catch {execsql {SELECT f1 FROM test1 ORDER BY f1}} msg] 276 set v [catch {execsql {SELECT f1 FROM test1 ORDER BY -f1}} msg] 280 set v [catch {execsql {SELECT f1 FROM test1 ORDER BY min(f1,f2)}} msg] 284 set v [catch {execsql {SELECT f1 FROM test1 ORDER BY min(f1)}} msg] 289 SELECT f1 FROM test1 ORDER BY 8.4; 291 } {1 {ORDER BY terms must not be non-integer constants}} 294 SELECT f1 FROM test1 ORDER BY '8.4'; 296 } {1 {ORDER BY terms must not be non-integer constants}} 299 SELECT f1 FROM test1 ORDER BY 'xyz'; [all …]
|
H A D | limit.test | 44 execsql {SELECT x FROM t1 ORDER BY x LIMIT 5} 47 execsql {SELECT x FROM t1 ORDER BY x LIMIT 5 OFFSET 2} 50 execsql {SELECT x FROM t1 ORDER BY x LIMIT 2, 5} 53 execsql {SELECT x FROM t1 ORDER BY x LIMIT 5 OFFSET 5} 56 execsql {SELECT x FROM t1 ORDER BY x LIMIT 50 OFFSET 30} 59 execsql {SELECT x FROM t1 ORDER BY x LIMIT 30, 50} 62 execsql {SELECT x FROM t1 ORDER BY x LIMIT 50 OFFSET 50} 65 execsql {SELECT * FROM t1 AS a, t1 AS b ORDER BY a.x, b.x LIMIT 5} 68 execsql {SELECT * FROM t1 AS a, t1 AS b ORDER BY a.x, b.x LIMIT 5 OFFSET 32} 91 SELECT z FROM (SELECT y*10+x AS z FROM t1 ORDER BY x LIMIT 10) [all …]
|
H A D | trans.test | 32 SELECT b FROM one ORDER BY a; 41 SELECT b FROM two ORDER BY a; 46 execsql {SELECT b FROM one ORDER BY a} altdb 49 execsql {SELECT b FROM two ORDER BY a} altdb 82 SELECT a FROM one ORDER BY a; 83 SELECT a FROM two ORDER BY a; 94 SELECT a FROM one ORDER BY a; 99 SELECT a FROM two ORDER BY a; 105 SELECT a FROM one ORDER BY a; 117 SELECT a FROM two ORDER BY a; [all …]
|
H A D | subselect.test | 85 execsql {SELECT x FROM t2 ORDER BY x} 92 SELECT (SELECT a FROM t1 ORDER BY a), (SELECT a FROM t1 ORDER BY a DESC) 97 SELECT 1 IN (SELECT a FROM t1 ORDER BY a); 102 SELECT 2 IN (SELECT a FROM t1 ORDER BY a DESC); 106 # Verify that the ORDER BY clause is honored in a subquery. 112 SELECT * FROM t3 ORDER BY x; 117 SELECT sum(x) FROM (SELECT x FROM t3 ORDER BY x LIMIT 2); 122 SELECT sum(x) FROM (SELECT x FROM t3 ORDER BY x DESC LIMIT 2); 127 SELECT (SELECT x FROM t3 ORDER BY x); 132 SELECT (SELECT x FROM t3 ORDER BY x DESC); [all …]
|
H A D | view.test | 35 SELECT * FROM v1 ORDER BY a; 41 SELECT * FROM v1 ORDER BY a; 47 SELECT * FROM v1 ORDER BY a; 54 SELECT * FROM v1 ORDER BY a; 60 SELECT * FROM v1 ORDER BY a; 66 SELECT * FROM v1 ORDER BY a; 72 SELECT * FROM v1 ORDER BY a; 81 SELECT * FROM v1 ORDER BY a; 88 SELECT * FROM v1 ORDER BY a; 118 SELECT * FROM v2 ORDER BY x; [all …]
|
H A D | index.test | 27 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 42 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 49 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 90 ORDER BY name} 100 ORDER BY name} 117 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 158 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 182 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 189 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} 194 execsql {SELECT name FROM sqlite_master WHERE type!='meta' ORDER BY name} [all …]
|
H A D | select6.test | 48 SELECT DISTINCT y FROM t1 ORDER BY y; 73 WHERE a.y=b.y ORDER BY a.y 81 WHERE a.y=b.y ORDER BY a.y 89 WHERE q=s ORDER BY s 97 WHERE q=s ORDER BY s 105 SELECT DISTINCT b FROM t2 ORDER BY b; 129 WHERE a.b=b.b ORDER BY a.b 137 WHERE a.b=b.b ORDER BY a.b 145 WHERE q=s ORDER BY s 153 WHERE a.q=b.s ORDER BY a.q [all …]
|
H A D | rowid.test | 30 SELECT x FROM t1 ORDER BY y; 34 set r [execsql {SELECT rowid FROM t1 ORDER BY x}] 76 set v [execsql {SELECT x, oid FROM t1 order by x}] 82 set v [execsql {SELECT x, RowID FROM t1 order by x}] 88 set v [execsql {SELECT x, _rowid_ FROM t1 order by x}] 139 execsql {SELECT x FROM t1 ORDER BY x} 145 execsql {SELECT x FROM t1 ORDER BY x} 176 SELECT * FROM t2 ORDER BY x; 180 execsql {SELECT * FROM t2 ORDER BY rowid} 183 execsql {SELECT rowid, x, y FROM t2 ORDER BY rowid} [all …]
|
/titanic_41/usr/src/cmd/audio/utilities/ |
H A D | Fir.cc | 93 if (size >= order) in updateState() 94 memcpy(state, data + size - order, order * sizeof (double)); in updateState() 96 int old = order - size; in updateState() 99 memcpy(state + order - size, data, size * sizeof (double)); in updateState() 117 for (int i = 0; i < order; i++) in resetState() 127 Fir(int order_in): order(order_in) // construct Fir object in Fir() 129 state = new double[order]; in Fir() 131 coef = new double[order + 1]; in Fir() 132 delay = (order + 1) >> 1; // assuming symmetric FIR in Fir() 143 getOrder(void) // returns filter order in getOrder() [all …]
|
H A D | Resample.cc | 62 int order, // LP FIR filter order in sinc_coef() argument 69 int half = order >> 1; in sinc_coef() 70 if (order & 1) { // order is odd, center = half + 0.5 in sinc_coef() 76 } else { // order is even, center = half in sinc_coef() 83 for (; i <= order; i++) // symmetric FIR in sinc_coef() 84 coef[i] = coef[order - i]; in sinc_coef() 93 * convolution of coef[order + 1] and data[length] up-sampled by a factor 100 int order, // filter order in poly_conv() argument 105 if ((order < 0) || (inc_coef < 1) || (length < 1)) in poly_conv() 109 double *coef_end = coef + order; in poly_conv() [all …]
|
/titanic_41/usr/src/cmd/ndmpd/include/ |
H A D | traverse.h | 42 * system hieratchy in post-order, pre-order and level-order ways. 54 * post-order, pre-order and level-order. 96 * POST-ORDER: 97 * Post-order means that the directory is processed after all 98 * its children are processed. Post-order traversing of the above 121 * In post-order the callback function returns 0 on success 124 * One of the applications of post-order traversing of a 128 * PRE-ORDER: 129 * Pre-order means that the directory is processed before 130 * any of its children are processed. Pre-order traversing of [all …]
|
/titanic_41/usr/src/cmd/audio/include/ |
H A D | Fir.h | 41 * coef[1] * state[order - 1] + 42 * coef[2] * state[order - 2] + 44 * coef[order] * state[0] 50 * state[order - 2] = state[order - 1] 51 * state[order - 1] = input 55 int order; // filter order, # taps = order + 1 56 double *coef; // (order + 1) filter coeffs. 57 double *state; // "order" filter states 68 virtual int getOrder(void); // get filter order value
|
/titanic_41/usr/src/common/crypto/ecc/ |
H A D | ecl.c | 78 MP_DIGITS(&group->order) = 0; in ECGroup_new() 89 MP_CHECKOK(mp_init(&group->order, kmflag)); in ECGroup_new() 103 const mp_int *geny, const mp_int *order, int cofactor) in ECGroup_consGFp() argument 121 MP_CHECKOK(mp_copy(order, &group->order)); in ECGroup_consGFp() 144 const mp_int *geny, const mp_int *order, int cofactor) in ECGroup_consGFp_mont() argument 164 MP_CHECKOK(mp_copy(order, &group->order)); in ECGroup_consGFp_mont() 189 const mp_int *order, int cofactor) in ECGroup_consGF2m() argument 207 MP_CHECKOK(mp_copy(order, &group->order)); in ECGroup_consGF2m() 232 mp_int irr, curvea, curveb, genx, geny, order; in ecgroup_fromNameAndHex() local 243 MP_DIGITS(&order) = 0; in ecgroup_fromNameAndHex() [all …]
|
H A D | ec2_test.c | 166 MP_CHECKOK(mp_sub(&group->order, &one, &order_1)); in ectest_curve_GF2m() 194 /* multiply base point by order - 1 and check for negative of base in ectest_curve_GF2m() 199 printf(" (order-1)*P (affine):\n"); in ectest_curve_GF2m() 214 /* multiply base point by order - 1 and check for negative of base in ectest_curve_GF2m() 219 printf(" (order-1)*P (montgomery):\n"); in ectest_curve_GF2m() 234 /* multiply base point by order - 1 and check for negative of base in ectest_curve_GF2m() 239 printf(" (order-1)*P (projective):\n"); in ectest_curve_GF2m() 254 /* multiply base point by order - 1 and check for negative of base in ectest_curve_GF2m() 258 printf(" (order-1)*P (ECPoint_mul):\n"); in ectest_curve_GF2m() 271 /* multiply base point by order - 1 and check for negative of base in ectest_curve_GF2m() [all …]
|
/titanic_41/usr/src/cmd/fs.d/ |
H A D | fssnapsup.c | 84 * options determine what data should be displayed and in what order. An 96 * Based on these parameters, an order list is created that tells 97 * fssnap_display_info() what info to display and in what order. 106 int *order, orderlen = MAX_INFO_DESCRIPTORS+1; in fssnap_show_status() local 139 order = (int *)malloc(orderlen * sizeof (int)); in fssnap_show_status() 140 if (order == NULL) { in fssnap_show_status() 142 gettext("cannot allocate order list.\n")); in fssnap_show_status() 151 order[i++] = getsubopt(&suboptions, infosubopts, &v); in fssnap_show_status() 153 order = (int *)realloc(order, in fssnap_show_status() 155 if (order == NULL) { in fssnap_show_status() [all …]
|
/titanic_41/usr/src/man/man9f/ |
H A D | csx_Parse_CISTPL_BYTEORDER.9f | 9 csx_Parse_CISTPL_BYTEORDER \- parse the Byte Order tuple 58 This function parses the Byte Order tuple, \fBCISTPL_BYTEORDER\fR, into a form 63 a memory-like partition. It specifies two parameters: the order for multi-byte 64 data, and the order in which bytes map into words for 16-bit cards. 72 uint32_t order; /* byte order code */ 83 \fB\fBorder\fR \fR 86 This field specifies the byte order for multi-byte numeric data. 93 Little endian order
|
/titanic_41/usr/src/uts/common/io/drm/ |
H A D | drm_bufs.c | 50 * Compute order. Can be made faster. 55 int order = 0; in drm_order() local 59 order ++; in drm_order() 61 if (size & ~(1 << order)) in drm_order() 62 ++order; in drm_order() 64 return (order); in drm_order() 404 int order; in drm_do_addbufs_agp() local 415 order = drm_order(request->size); in drm_do_addbufs_agp() 416 size = 1 << order; in drm_do_addbufs_agp() 420 page_order = order - PAGE_SHIFT > 0 ? order - PAGE_SHIFT : 0; in drm_do_addbufs_agp() [all …]
|