1/*
2 * Legal Notice
3 *
4 * This document and associated source code (the "Work") is a part of a
5 * benchmark specification maintained by the TPC.
6 *
7 * The TPC reserves all right, title, and interest to the Work as provided
8 * under U.S. and international laws, including without limitation all patent
9 * and trademark rights therein.
10 *
11 * No Warranty
12 *
13 * 1.1 TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THE INFORMATION
14 * CONTAINED HEREIN IS PROVIDED "AS IS" AND WITH ALL FAULTS, AND THE
15 * AUTHORS AND DEVELOPERS OF THE WORK HEREBY DISCLAIM ALL OTHER
16 * WARRANTIES AND CONDITIONS, EITHER EXPRESS, IMPLIED OR STATUTORY,
17 * INCLUDING, BUT NOT LIMITED TO, ANY (IF ANY) IMPLIED WARRANTIES,
18 * DUTIES OR CONDITIONS OF MERCHANTABILITY, OF FITNESS FOR A PARTICULAR
19 * PURPOSE, OF ACCURACY OR COMPLETENESS OF RESPONSES, OF RESULTS, OF
20 * WORKMANLIKE EFFORT, OF LACK OF VIRUSES, AND OF LACK OF NEGLIGENCE.
21 * ALSO, THERE IS NO WARRANTY OR CONDITION OF TITLE, QUIET ENJOYMENT,
22 * QUIET POSSESSION, CORRESPONDENCE TO DESCRIPTION OR NON-INFRINGEMENT
23 * WITH REGARD TO THE WORK.
24 * 1.2 IN NO EVENT WILL ANY AUTHOR OR DEVELOPER OF THE WORK BE LIABLE TO
25 * ANY OTHER PARTY FOR ANY DAMAGES, INCLUDING BUT NOT LIMITED TO THE
26 * COST OF PROCURING SUBSTITUTE GOODS OR SERVICES, LOST PROFITS, LOSS
27 * OF USE, LOSS OF DATA, OR ANY INCIDENTAL, CONSEQUENTIAL, DIRECT,
28 * INDIRECT, OR SPECIAL DAMAGES WHETHER UNDER CONTRACT, TORT, WARRANTY,
29 * OR OTHERWISE, ARISING IN ANY WAY OUT OF THIS OR ANY OTHER AGREEMENT
30 * RELATING TO THE WORK, WHETHER OR NOT SUCH AUTHOR OR DEVELOPER HAD
31 * ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES.
32 *
33 * Contributors:
34 * Gradient Systems
35 */
36#include "config.h"
37#include "porting.h"
38#include "scaling.h"
39#include "genrand.h"
40#include "sparse.h"
41#include "tdefs.h"
42#include "error_msg.h"
43
44/*
45 * Routine: initSparseKeys()
46 * Purpose: set up the set of valid key values for a sparse table.
47 * Algorithm:
48 * Data Structures:
49 *
50 * Params:
51 * Returns:
52 * Called By:
53 * Calls:
54 * Assumptions: The total population will fit in 32b
55 * Side Effects:
56 * TODO: None
57 */
58int initSparseKeys(int nTable) {
59 ds_key_t kRowcount, kOldSeed;
60 int k;
61 tdef *pTdef;
62
63 kRowcount = get_rowcount(nTable);
64 pTdef = getTdefsByNumber(nTable);
65
66 pTdef->arSparseKeys = (ds_key_t *)malloc((long)kRowcount * sizeof(ds_key_t));
67 MALLOC_CHECK(pTdef->arSparseKeys);
68 if (pTdef->arSparseKeys == NULL)
69 ReportError(QERR_NO_MEMORY, "initSparseKeys()", 1);
70 memset(pTdef->arSparseKeys, 0, (long)kRowcount * sizeof(ds_key_t));
71
72 kOldSeed = setSeed(0, nTable);
73 for (k = 0; k < kRowcount; k++)
74 genrand_key(&pTdef->arSparseKeys[k], DIST_UNIFORM, 1, pTdef->nParam, 0, 0);
75 setSeed(0, (int)kOldSeed);
76
77 return (0);
78}
79
80/*
81 * Routine: randomSparseKey()
82 * Purpose: randomly select one of the valid key values for a sparse table
83 * Algorithm:
84 * Data Structures:
85 *
86 * Params:
87 * Returns:
88 * Called By:
89 * Calls:
90 * Assumptions:
91 * Side Effects:
92 * TODO: None
93 */
94ds_key_t randomSparseKey(int nTable, int nColumn) {
95 int nKeyIndex;
96 ds_key_t kRowcount;
97 tdef *pTdef;
98
99 pTdef = getTdefsByNumber(nTable);
100 kRowcount = get_rowcount(nTable);
101 genrand_integer(&nKeyIndex, DIST_UNIFORM, 1, (long)kRowcount, 0, nColumn);
102
103 return (pTdef->arSparseKeys[nKeyIndex]);
104}
105