/*
* generate a particular table
*/
void
gen_tbl (int tnum, long start, long count, long upd_num)
{
static order_t o;
supplier_t supp;
customer_t cust;
part_t part;
#ifdef SSBM
date_t dt;
#else
code_t code;
#endif
static int completed = 0;
static int init = 0;
long i;
int rows_per_segment=0;
int rows_this_segment=-1;
int residual_rows=0;
if (insert_segments)
{
rows_per_segment = count / insert_segments;
residual_rows = count - (rows_per_segment * insert_segments);
}
if (init == 0)
{
INIT_HUGE(o.okey);
for (i=0; i < O_LCNT_MAX; i++)
#ifdef SSBM
INIT_HUGE(o.lineorders[i].okey);
#else
INIT_HUGE(o.l[i].okey);
#endif
init = 1;
}
for (i = start; count; count--, i++)
{
LIFENOISE (1000, i);
row_start(tnum);
switch (tnum)
{
case LINE:
#ifdef SSBM
#else
case ORDER:
case ORDER_LINE:
#endif
mk_order (i, &o, upd_num % 10000);
if (insert_segments && (upd_num > 0))
if((upd_num / 10000) < residual_rows)
{
if((++rows_this_segment) > rows_per_segment)
{
rows_this_segment=0;
upd_num += 10000;
}
}
else
{
if((++rows_this_segment) >= rows_per_segment)
{
rows_this_segment=0;
upd_num += 10000;
}
}
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&o, 0);
else
tdefs[tnum].loader[direct] (&o, upd_num);
break;
case SUPP:
mk_supp (i, &supp);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&supp, 0);
else
tdefs[tnum].loader[direct] (&supp, upd_num);
break;
case CUST:
mk_cust (i, &cust);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&cust, 0);
else
tdefs[tnum].loader[direct] (&cust, upd_num);
break;
#ifdef SSBM
case PART:
#else
case PSUPP:
case PART:
case PART_PSUPP:
#endif
mk_part (i, &part);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&part, 0);
else
tdefs[tnum].loader[direct] (&part, upd_num);
break;
#ifdef SSBM
case DATE:
mk_date (i, &dt);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&dt, 0);
else
tdefs[tnum].loader[direct] (&dt, 0);
break;
#else
case NATION:
mk_nation (i, &code);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&code, 0);
else
tdefs[tnum].loader[direct] (&code, 0);
break;
case REGION:
mk_region (i, &code);
if (set_seeds == 0)
if (validate)
tdefs[tnum].verify(&code, 0);
else
tdefs[tnum].loader[direct] (&code, 0);
break;
#endif
}
row_stop(tnum);
if (set_seeds && (i % tdefs[tnum].base) < 2)
{
printf("\nSeeds for %s at rowcount %ld\n", tdefs[tnum].comment, i);
dump_seeds(tnum);
}
}
completed |= 1 << tnum;
}
/*
* generate a particular table
*/
void
gen_tbl (int tnum, DSS_HUGE start, DSS_HUGE count, long upd_num)
{
static order_t o;
supplier_t supp;
customer_t cust;
part_t part;
code_t code;
static int completed = 0;
DSS_HUGE i;
DSS_HUGE rows_per_segment=0;
DSS_HUGE rows_this_segment=-1;
DSS_HUGE residual_rows=0;
if (insert_segments)
{
rows_per_segment = count / insert_segments;
residual_rows = count - (rows_per_segment * insert_segments);
}
for (i = start; count; count--, i++)
{
LIFENOISE (1000, i);
row_start(tnum);
switch (tnum)
{
case LINE:
case ORDER:
case ORDER_LINE:
mk_order (i, &o, upd_num % 10000);
if (insert_segments && (upd_num > 0))
if((upd_num / 10000) < residual_rows)
{
if((++rows_this_segment) > rows_per_segment)
{
rows_this_segment=0;
upd_num += 10000;
}
}
else
{
if((++rows_this_segment) >= rows_per_segment)
{
rows_this_segment=0;
upd_num += 10000;
}
}
if (set_seeds == 0)
tdefs[tnum].loader(&o, upd_num);
break;
case SUPP:
mk_supp (i, &supp);
if (set_seeds == 0)
tdefs[tnum].loader(&supp, upd_num);
break;
case CUST:
mk_cust (i, &cust);
if (set_seeds == 0)
tdefs[tnum].loader(&cust, upd_num);
break;
case PSUPP:
case PART:
case PART_PSUPP:
mk_part (i, &part);
if (set_seeds == 0)
tdefs[tnum].loader(&part, upd_num);
break;
case NATION:
mk_nation (i, &code);
if (set_seeds == 0)
tdefs[tnum].loader(&code, 0);
break;
case REGION:
mk_region (i, &code);
if (set_seeds == 0)
tdefs[tnum].loader(&code, 0);
break;
}
row_stop(tnum);
if (set_seeds && (i % tdefs[tnum].base) < 2)
{
printf("\nSeeds for %s at rowcount %ld\n", tdefs[tnum].comment, i);
dump_seeds(tnum);
}
}
completed |= 1 << tnum;
}