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#ifndef USE_STDLIB_H
39#include <malloc.h>
40#endif
41#include <stdio.h>
42#include "genrand.h"
43
44/*
45 * Routine: MakePermutation(int nSize)
46 * Purpose: Permute the integers in [1..nSize]
47 * Algorithm:
48 * Data Structures:
49 *
50 * Params:
51 * Returns:
52 * Called By:
53 * Calls:
54 * Assumptions:
55 * Side Effects:
56 * TODO: None
57 */
58int *makePermutation(int *nNumberSet, int nSize, int nStream) {
59 int i, nTemp, nIndex, *pInt;
60
61 if (nSize <= 0)
62 return (NULL);
63
64 if (!nNumberSet) {
65 nNumberSet = (int *)malloc(nSize * sizeof(int));
66 MALLOC_CHECK(nNumberSet);
67 pInt = nNumberSet;
68 for (i = 0; i < nSize; i++)
69 *pInt++ = i;
70 }
71
72 for (i = 0; i < nSize; i++) {
73 nIndex = genrand_integer(NULL, DIST_UNIFORM, 0, nSize - 1, 0, nStream);
74 nTemp = nNumberSet[i];
75 nNumberSet[i] = nNumberSet[nIndex];
76 nNumberSet[nIndex] = nTemp;
77 }
78
79 return (nNumberSet);
80}
81
82/*
83 * Routine: MakePermutation(int nSize)
84 * Purpose: Permute the integers in [1..nSize]
85 * Algorithm:
86 * Data Structures:
87 *
88 * Params:
89 * Returns:
90 * Called By:
91 * Calls:
92 * Assumptions:
93 * Side Effects:
94 * TODO: None
95 */
96ds_key_t *makeKeyPermutation(ds_key_t *nNumberSet, ds_key_t nSize, int nStream) {
97 ds_key_t i, nTemp, nIndex, *pInt;
98 if (nSize <= 0)
99 return (NULL);
100
101 if (!nNumberSet) {
102 nNumberSet = (ds_key_t *)malloc(nSize * sizeof(ds_key_t));
103 MALLOC_CHECK(nNumberSet);
104 pInt = nNumberSet;
105 for (i = 0; i < nSize; i++)
106 *pInt++ = i;
107 }
108
109 for (i = 0; i < nSize; i++) {
110 nIndex = genrand_key(NULL, DIST_UNIFORM, 0, nSize - 1, 0, nStream);
111 nTemp = nNumberSet[i];
112 nNumberSet[i] = nNumberSet[nIndex];
113 nNumberSet[nIndex] = nTemp;
114 }
115
116 return (nNumberSet);
117}
118