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 "nulls.h"
39#include "genrand.h"
40#include "tdefs.h"
41
42/*
43 * Routine: nullCheck(int nColumn)
44 * Purpose:
45 * Algorithm:
46 * Data Structures:
47 *
48 * Params:
49 * Returns:
50 * Called By:
51 * Calls:
52 * Assumptions:
53 * Side Effects:
54 * TODO: None
55 */
56int nullCheck(int nColumn) {
57 static int nLastTable = 0;
58 tdef *pTdef;
59 ds_key_t kBitMask = 1;
60
61 nLastTable = getTableFromColumn(nColumn);
62 pTdef = getSimpleTdefsByNumber(nLastTable);
63
64 kBitMask <<= nColumn - pTdef->nFirstColumn;
65
66 return ((pTdef->kNullBitMap & kBitMask) != 0);
67}
68
69/*
70* Routine: nullSet(int *pDest, int nStream)
71* Purpose: set the kNullBitMap for a particular table
72* Algorithm:
73* 1. if random[1,100] >= table's NULL pct, clear map and return
74* 2. set map
75
76* Data Structures:
77*
78* Params:
79* Returns:
80* Called By:
81* Calls:
82* Assumptions:
83* Side Effects: uses 2 RNG calls
84* TODO: None
85*/
86void nullSet(ds_key_t *pDest, int nStream) {
87 int nThreshold;
88 ds_key_t kBitMap;
89 static int nLastTable = 0;
90 tdef *pTdef;
91
92 nLastTable = getTableFromColumn(nStream);
93 pTdef = getSimpleTdefsByNumber(nLastTable);
94
95 /* burn the RNG calls */
96 genrand_integer(&nThreshold, DIST_UNIFORM, 0, 9999, 0, nStream);
97 genrand_key(&kBitMap, DIST_UNIFORM, 1, MAXINT, 0, nStream);
98
99 /* set the bitmap based on threshold and NOT NULL definitions */
100 *pDest = 0;
101 if (nThreshold < pTdef->nNullPct) {
102 *pDest = kBitMap;
103 *pDest &= ~pTdef->kNotNullBitMap;
104 }
105
106 return;
107}
108