test/performance/wisc/support.c

   1
   2 #include <stdio.h>
   3 #include <string.h>
   4 #include "support.h"
   5
   6 void
   7 convert(int unique, char* buf)
   8 {
   9     int i;
  10     int rem;
  11
  12     for (i=0; i<7; i++) buf[i] = 'A';
  13
  14     i = 6;
  15     while ( unique > 0 ) {
  16         rem = unique % 26;
  17         buf[i] = 'A' + rem;
  18         unique = unique / 26;
  19         i--;
  20     }
  21 }
  22
  23 int
  24 randNum(int seed, int limit, int generator, int prime)
  25 {
  26     do {
  27         seed = (generator * seed) % prime;
  28     } while (seed>limit);
  29
  30     return seed;
  31 }
  32
  33 static unsigned long initSelection  = 0xFFFFFFFFL;
  34 static unsigned long querySelection = 0xFFFFFFFFL;
  35
  36 int
  37 isQuery(int queryNum)
  38 {
  39     /* Check the (queryNum-1)th bit of the querySpec */
  40
  41     if ((1 << (queryNum - 1)) & querySelection)
  42         return 1;
  43     else
  44         return 0;
  45 }
  46
  47 #define MAX_TOKENS 40
  48
  49 int
  50 setQueries(char* queryString)
  51 {
  52     /* If never called then querySelection = all,
  53        if called, set query to none. and start processing
  54     */
  55     if (querySelection == initSelection)
  56         querySelection = 0;
  57
  58     /* Parse the string into comma separated tokens */
  59
  60     char*   tokens[MAX_TOKENS];
  61     int     numTokens;
  62     int     tokenPtr = 0;
  63     char*   dash;
  64     int     start;
  65     int     end;
  66     int     i;
  67     int     tokenValue;
  68
  69     numTokens = 0;
  70     tokens[numTokens] = strtok(queryString, ",");
  71     while (tokens[numTokens] != NULL) {
  72         if (numTokens < MAX_TOKENS) {
  73             tokens[++numTokens] = strtok(NULL, ",");
  74         }
  75         else {
  76             fprintf (stderr, "Too many queries specified.\n");
  77             return -1;
  78         }
  79     }
  80
  81     /* Check to see if you got any tokens (return if not) */
  82
  83     if (numTokens == 0) {
  84         return 0;
  85     }
  86
  87     /* Process each token, expanding ranges if present,
  88      * and adding the query numbers to the return value */
  89
  90     for (tokenPtr = 0; tokenPtr < numTokens; tokenPtr++) {
  91
  92         /* Check for a range '-' of tokens */
  93
  94         dash = strchr(tokens[tokenPtr], '-');
  95
  96         if (dash) {
  97             /* Get the start and end range specifiers (set the dash to null) */
  98             *dash = 0;
  99             if (sscanf(tokens[tokenPtr], "%d", &start) == -1 ||
 100                 sscanf(dash+1, "%d", &end) == -1) {
 101                 fprintf (stderr, "Invalid query range specified (%s-%s).\n",
 102                         tokens[tokenPtr], dash+1);
 103                 return -1;
 104             }
 105
 106             /* Make sure that the start and end values are in range
 107              * (return -1 to signal error in caller) */
 108             if ((start < 1) || (start > 32) || (end < 1) || (end > 32) || (start >= end)) {
 109                 fprintf (stderr, "Invalid query range specified (%d-%d).\n", start, end);
 110                 return -1;
 111             }
 112
 113             /* From start to end, set the bit in the querySpec */
 114             for (i = start; i < (end+1); i++) {
 115                 querySelection = querySelection | (1 << (i - 1));
 116             }
 117         }
 118         else {
 119             /* Set  the (tokenPtr) bit in the querySpec */
 120             if (sscanf(tokens[tokenPtr], "%d", &tokenValue) == -1) {
 121                 fprintf (stderr, "Invalid query specified (%s).\n", tokens[tokenPtr]);
 122                 return -1;
 123             }
 124             if (tokenValue < 1 || tokenValue > 32) {
 125                 fprintf (stderr, "Invalid query specified (%d).\n", tokenValue);
 126                 return -1;
 127             }
 128             querySelection = querySelection | (1 << (tokenValue - 1));
 129         }
 130     }
 131     return 0;
 132 }