should be it

external/duckdb/extension/tpcds/dsdgen/dsdgen-c/parallel.cpp

@@ -0,0 +1,210 @@
+/*
+ * Legal Notice
+ *
+ * This document and associated source code (the "Work") is a part of a
+ * benchmark specification maintained by the TPC.
+ *
+ * The TPC reserves all right, title, and interest to the Work as provided
+ * under U.S. and international laws, including without limitation all patent
+ * and trademark rights therein.
+ *
+ * No Warranty
+ *
+ * 1.1 TO THE MAXIMUM EXTENT PERMITTED BY APPLICABLE LAW, THE INFORMATION
+ *     CONTAINED HEREIN IS PROVIDED "AS IS" AND WITH ALL FAULTS, AND THE
+ *     AUTHORS AND DEVELOPERS OF THE WORK HEREBY DISCLAIM ALL OTHER
+ *     WARRANTIES AND CONDITIONS, EITHER EXPRESS, IMPLIED OR STATUTORY,
+ *     INCLUDING, BUT NOT LIMITED TO, ANY (IF ANY) IMPLIED WARRANTIES,
+ *     DUTIES OR CONDITIONS OF MERCHANTABILITY, OF FITNESS FOR A PARTICULAR
+ *     PURPOSE, OF ACCURACY OR COMPLETENESS OF RESPONSES, OF RESULTS, OF
+ *     WORKMANLIKE EFFORT, OF LACK OF VIRUSES, AND OF LACK OF NEGLIGENCE.
+ *     ALSO, THERE IS NO WARRANTY OR CONDITION OF TITLE, QUIET ENJOYMENT,
+ *     QUIET POSSESSION, CORRESPONDENCE TO DESCRIPTION OR NON-INFRINGEMENT
+ *     WITH REGARD TO THE WORK.
+ * 1.2 IN NO EVENT WILL ANY AUTHOR OR DEVELOPER OF THE WORK BE LIABLE TO
+ *     ANY OTHER PARTY FOR ANY DAMAGES, INCLUDING BUT NOT LIMITED TO THE
+ *     COST OF PROCURING SUBSTITUTE GOODS OR SERVICES, LOST PROFITS, LOSS
+ *     OF USE, LOSS OF DATA, OR ANY INCIDENTAL, CONSEQUENTIAL, DIRECT,
+ *     INDIRECT, OR SPECIAL DAMAGES WHETHER UNDER CONTRACT, TORT, WARRANTY,
+ *     OR OTHERWISE, ARISING IN ANY WAY OUT OF THIS OR ANY OTHER AGREEMENT
+ *     RELATING TO THE WORK, WHETHER OR NOT SUCH AUTHOR OR DEVELOPER HAD
+ *     ADVANCE NOTICE OF THE POSSIBILITY OF SUCH DAMAGES.
+ *
+ * Contributors:
+ * Gradient Systems
+ */
+#include "config.h"
+#include "porting.h"
+#include "init.h"
+#include <stdio.h>
+#include "r_params.h"
+#include "scaling.h"
+#include "tdefs.h"
+#include "genrand.h"
+
+/*
+ * Routine: split_work(int tnum, worker_t *w)
+ * Purpose: allocate work between processes and threads
+ * Algorithm:
+ * Data Structures:
+ *
+ * Params:
+ * Returns:
+ * Called By:
+ * Calls:
+ * Assumptions:
+ * Side Effects:
+ * TODO: None
+ */
+int split_work(int tnum, ds_key_t *pkFirstRow, ds_key_t *pkRowCount) {
+	ds_key_t kTotalRows, kRowsetSize, kExtraRows;
+	int nParallel, nChild;
+
+	kTotalRows = get_rowcount(tnum);
+	nParallel = get_int("PARALLEL");
+	nChild = get_int("CHILD");
+
+	/*
+	 * 1. small tables aren't paralelized
+	 * 2. nothing is parallelized unless a command line arg is supplied
+	 */
+	*pkFirstRow = 1;
+	*pkRowCount = kTotalRows;
+
+	if (kTotalRows < 1000000) {
+		if (nChild > 1) /* small table; only build it once */
+		{
+			*pkFirstRow = 1;
+			*pkRowCount = 0;
+			return (0);
+		}
+		return (1);
+	}
+
+	if (!is_set("PARALLEL")) {
+		return (1);
+	}
+
+	/*
+	 * at this point, do the calculation to set the rowcount for this part of a
+	 * parallel build
+	 */
+	kExtraRows = kTotalRows % nParallel;
+	kRowsetSize = (kTotalRows - kExtraRows) / nParallel;
+
+	/* start the starting row id */
+	*pkFirstRow += (nChild - 1) * kRowsetSize;
+	if (kExtraRows && (nChild - 1))
+		*pkFirstRow += ((nChild - 1) < kExtraRows) ? (nChild - 1) : kExtraRows;
+
+	/* set the rowcount for this child */
+	*pkRowCount = kRowsetSize;
+	if (kExtraRows && (nChild <= kExtraRows))
+		*pkRowCount += 1;
+
+	return (1);
+}
+
+/*
+ * Routine:
+ * Purpose:
+ * Algorithm:
+ * Data Structures:
+ *
+ * Params:
+ * Returns:
+ * Called By:
+ * Calls:
+ * Assumptions:
+ * Side Effects:
+ * TODO: None
+ */
+int checkSeeds(tdef *pTdef) {
+	int i, res, nReturnCode = 0;
+	static int bSetSeeds = 0;
+
+	if (!InitConstants::checkSeeds_init) {
+		bSetSeeds = is_set("CHKSEEDS");
+		InitConstants::checkSeeds_init = 1;
+	}
+
+	for (i = pTdef->nFirstColumn; i <= pTdef->nLastColumn; i++) {
+		while (Streams[i].nUsed < Streams[i].nUsedPerRow)
+			genrand_integer(&res, DIST_UNIFORM, 1, 100, 0, i);
+		if (bSetSeeds) {
+			if (Streams[i].nUsed > Streams[i].nUsedPerRow) {
+				fprintf(stderr, "Seed overrun on column %d. Used: %d\n", i, Streams[i].nUsed);
+				Streams[i].nUsedPerRow = Streams[i].nUsed;
+				nReturnCode = 1;
+			}
+		}
+		Streams[i].nUsed = 0; /* reset for the next time */
+	}
+
+	return (nReturnCode);
+}
+
+/*
+ * Routine:
+ * Purpose:
+ * Algorithm:
+ * Data Structures:
+ *
+ * Params:
+ * Returns:
+ * Called By:
+ * Calls:
+ * Assumptions:
+ * Side Effects:
+ * TODO: None
+ */
+int row_stop(int tbl) {
+	tdef *pTdef;
+
+	pTdef = getSimpleTdefsByNumber(tbl);
+	checkSeeds(pTdef);
+	if (pTdef->flags & FL_PARENT) {
+		pTdef = getSimpleTdefsByNumber(pTdef->nParam);
+		checkSeeds(pTdef);
+		if (pTdef->flags & FL_PARENT) {
+			pTdef = getSimpleTdefsByNumber(pTdef->nParam);
+			checkSeeds(pTdef);
+		}
+	}
+
+	return (0);
+}
+
+/*
+ * Routine: row_skip
+ * Purpose: skip over un-used rows in a table
+ * Algorithm:
+ * Data Structures:
+ *
+ * Params:
+ * Returns:
+ * Called By:
+ * Calls:
+ * Assumptions:
+ * Side Effects:
+ * TODO: 20020816 jms The second parameter should really be a ds_key_t to allow
+ * BIG skips
+ */
+int row_skip(int tbl, ds_key_t count) {
+	int i;
+
+	for (i = 0; Streams[i].nColumn != -1; i++) {
+		if (Streams[i].nTable == tbl) {
+			skip_random(i, count * Streams[i].nUsedPerRow);
+			Streams[i].nUsed = 0;
+			Streams[i].nTotal = count * Streams[i].nUsedPerRow;
+		}
+		if (Streams[i].nDuplicateOf && (Streams[i].nDuplicateOf != i)) {
+			skip_random(Streams[i].nDuplicateOf, count * Streams[Streams[i].nDuplicateOf].nUsedPerRow);
+			Streams[Streams[i].nDuplicateOf].nUsed = 0;
+			Streams[Streams[i].nDuplicateOf].nTotal = count * Streams[i].nUsedPerRow;
+		}
+	}
+
+	return (0);
+}