1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274
|
% This file is part of the Stanford GraphBase (c) Stanford University 1993
@i boilerplate.w %<< legal stuff: PLEASE READ IT BEFORE MAKING ANY CHANGES!
@i gb_types.w
\def\title{TEST\_\,SAMPLE}
@* Introduction. This GraphBase program is intended to be used only
when the Stanford GraphBase is being installed. It invokes the
most critical subroutines and creates a file that can be checked
against the correct output.
The testing is not exhaustive by any means, but it is designed to detect
errors of portability---cases where different results might occur
on different systems. Thus, if nothing goes wrong, one can assume that
the GraphBase routines are probably installed satisfactorily.
The basic idea of {\sc TEST\_\,SAMPLE} is quite simple: We generate a graph,
then print out a few of its salient characteristics. Then we recycle
the graph and generate another, etc. The test is passed if the output
file matches a ``correct'' output file generated at Stanford by the author.
Actually there are two output files. The main one, containing samples of
graph characteristics, is the standard output. The other, called \.{test.gb},
is a graph that has been saved in ASCII format with |save_graph|.
@p
#include "gb_graph.h" /* we use the {\sc GB\_\,GRAPH} data structures */
#include "gb_io.h" /* and the GraphBase input/output routines */
@<Include headers for all of the GraphBase generation modules@>@;
@#
@<Private variables@>@;
@<Procedures@>@;
@t\4@>int main()
{@+Graph *g,*gg;@+long i;@+Vertex *v; /* temporary registers */
printf("GraphBase samples generated by test_sample:\n");
@<Save a graph to be restored later@>;
@<Print samples of generated graphs@>;
return 0; /* normal exit */
}
@ @<Include headers for all of the GraphBase generation modules@>=
#include "gb_basic.h" /* we test the basic graph operations */
#include "gb_books.h" /* and the graphs based on literature */
#include "gb_econ.h" /* and the graphs based on economic data */
#include "gb_games.h" /* and the graphs based on football scores */
#include "gb_gates.h" /* and the graphs based on logic circuits */
#include "gb_lisa.h" /* and the graphs based on Mona Lisa */
#include "gb_miles.h" /* and the graphs based on mileage data */
#include "gb_plane.h" /* and the planar graphs */
#include "gb_raman.h" /* and the Ramanujan graphs */
#include "gb_rand.h" /* and the random graphs */
#include "gb_roget.h" /* and the graphs based on Roget's Thesaurus */
#include "gb_save.h" /* and we save results in ASCII format */
#include "gb_words.h" /* and we also test five-letter-word graphs */
@ The subroutine |print_sample(g,n)| will be specified later. It prints global
characteristics of |g| and local characteristics of the |n|th vertex.
We begin the test cautiously by generating a graph that requires no input data
and no pseudo-random numbers. If this test fails, the fault must lie either in
{\sc GB\_\,GRAPH} or {\sc GB\_\,RAMAN}.
@<Print samples of generated graphs@>=
print_sample(raman(31L,3L,0L,4L),4);
@ Next we test part of {\sc GB\_\,BASIC} that relies on a particular
interpretation of the operation `|w>>=1|'. If this part of the test
fails, please look up `system dependencies' in the index to {\sc
GB\_\,BASIC}, and correct the problem on your system by making a change file
\.{gb\_basic.ch}. (See \.{queen\_wrap.ch} for an example of a change file.)
On the other hand, if {\sc TEST\_\,SAMPLE} fails only in this particular test
while passing all those that follow, chances are excellent that
you have a pretty good implementation of the GraphBase anyway,
because the bug detected here will rarely show up in practice. Ask
yourself: Can I live comfortably with such a bug?
@<Print samples of generated graphs@>=
print_sample(board(1L,1L,2L,-33L,1L,-0x40000000L-0x40000000L,1L),2000);
/* coordinates 32 and 33 (only) should wrap around */
@ Another system-dependent part of {\sc GB\_\,BASIC} is tested here,
this time involving character codes.
@<Print samples of generated graphs@>=
print_sample(subsets(32L,18L,16L,0L,999L,-999L,0x80000000L,1L),1);
@ If \.{test.gb} fails to match \.{test.correct}, the most likely culprit
is |vert_offset|, a ``pointer hack'' in {\sc GB\_\,BASIC}. That macro
absolutely must be made to work properly, because it is used heavily.
In particular, it is used in the |complement| routine tested here,
and in the |gunion| routine tested below.
@<Save a graph to be restored later@>=
g=random_graph(3L,10L,1L,1L,0L,NULL,dst,1L,2L,1L);
/* a random multigraph with 3 vertices, 10 edges */
gg=complement(g,1L,1L,0L); /* a copy of |g|, without multiple edges */
v=gb_typed_alloc(1,Vertex,gg->data); /* we create a stray vertex too */
v->name=gb_save_string("Testing");
gg->util_types[10]='V';
gg->ww.V=v; /* the stray vertex is now part of |gg| */
save_graph(gg,"test.gb"); /* so it will appear in \.{test.gb} (we hope) */
gb_recycle(g);@+gb_recycle(gg);
@ @<Private...@>=
static long dst[]={0x20000000,0x10000000,0x10000000};
/* a probability distribution with frequencies 50\%, 25\%, 25\% */
@ Now we try to reconstruct the graph we saved before, and we also randomize
its lengths.
@<Print samples...@>=
g=restore_graph("test.gb");
if (i=random_lengths(g,0L,10L,12L,dst,2L))
printf("\nFailure code %ld returned by random_lengths!\n",i);
else {
gg=random_graph(3L,10L,1L,1L,0L,NULL,dst,1L,2L,1L); /* same as before */
print_sample(gunion(g,gg,1L,0L),2);
gb_recycle(g);@+gb_recycle(gg);
}
@ Partial evaluation of a RISC circuit involves fairly intricate pointer
manipulation, so this step should help to test the portability of the author's
favorite programming tricks.
@<Print samples...@>=
print_sample(partial_gates(risc(0L),1L,43210L,98765L,NULL),79);
@ Now we're ready to test the mechanics of reading data files,
sorting with {\sc GB\_\,SORT}, and heavy randomization. Lots of computation
takes place in this section.
@<Print samp...@>=
print_sample(book("homer",500L,400L,2L,12L,10000L,-123456L,789L),81);
print_sample(econ(40L,0L,400L,-111L),11);
print_sample(games(60L,70L,80L,-90L,-101L,60L,0L,999999999L),14);
print_sample(miles(50L,-500L,100L,1L,500L,5L,314159L),20);
print_sample(plane_lisa(100L,100L,50L,1L,300L,1L,200L,
50L*299L*199L,200L*299L*199L),1294);
print_sample(plane_miles(50L,500L,-100L,1L,1L,40000L,271818L),14);
print_sample(random_bigraph(300L,3L,1000L,-1L,0L,dst,-500L,500L,666L),3);
print_sample(roget(1000L,3L,1009L,1009L),40);
@ Finally, here's a picky, picky test that is supposed to fail the first time,
succeed the second. (The weight vector just barely exceeds
the maximum weight threshold allowed by {\sc GB\_WORDS}. That test is
ultraconservative, but eminently reasonable nevertheless.)
@<Print samples...@>=
print_sample(words(100L,wt_vector,70000000L,69L),5);
wt_vector[1]++;
print_sample(words(100L,wt_vector,70000000L,69L),5);
print_sample(words(0L,NULL,0L,69L),5555);
@ @<Private...@>=
static long wt_vector[]=
{100,-80589,50000,18935,-18935,18935,18935,18935,18935};
@* Printing the sample data. Given a graph |g| in GraphBase format and
an integer~|n|, the subroutine |print_sample(g,n)| will output
global characteristics of~|g|, such as its name and size, together with
detailed information about its |n|th vertex. Then |g| will be shredded
and recycled; the calling routine should not refer to it again.
@<Procedures@>=
static void pr_vert();
/* a subroutine for printing a vertex is declared below */
static void pr_arc(); /* likewise for arcs */
static void pr_util(); /* and for utility fields in general */
static void print_sample(g,n)
Graph *g; /* graph to be sampled and destroyed */
int n; /* index to the sampled vertex */
{
printf("\n");
if (g==NULL) {
printf("Ooops, we just ran into panic code %ld!\n",panic_code);
if (io_errors)
printf("(The I/O error code is 0x%lx)\n",(unsigned long)io_errors);
}@+else {
@<Print global characteristics of |g|@>;
@<Print information about the |n|th vertex@>;
gb_recycle(g);
}
}
@ The graph's |util_types| are used to determine how much information
should be printed. A level parameter also helps control the verbosity of
printout. In the most verbose mode, each utility field that points to a
vertex or arc, or contains integer or string data, will be printed.
@<Procedures@>=
static void pr_vert(v,l,s)
Vertex *v; /* vertex to be printed */
int l; /* |<=0| if the output should be terse */
char *s; /* format for graph utility fields */
{
if (v==NULL) printf("NULL");
else if (is_boolean(v)) printf("ONE"); /* see {\sc GB\_\,GATES} */
else {
printf("\"%s\"",v->name);
pr_util(v->u,s[0],l-1,s);
pr_util(v->v,s[1],l-1,s);
pr_util(v->w,s[2],l-1,s);
pr_util(v->x,s[3],l-1,s);
pr_util(v->y,s[4],l-1,s);
pr_util(v->z,s[5],l-1,s);
if (l>0) {@+register Arc *a;
for (a=v->arcs;a;a=a->next) {
printf("\n ");
pr_arc(a,1,s);
}
}
}
}
@ @<Pro...@>=
static void pr_arc(a,l,s)
Arc *a; /* non-null arc to be printed */
int l; /* |<=0| if the output should be terse */
char *s; /* format for graph utility fields */
{
printf("->");
pr_vert(a->tip,0,s);
if (l>0) {
printf( ", %ld",a->len);
pr_util(a->a,s[6],l-1,s);
pr_util(a->b,s[7],l-1,s);
}
}
@ @<Procedures@>=
static void pr_util(u,c,l,s)
util u; /* a utility field to be printed */
char c; /* its type code */
int l; /* 0 if output should be terse, |-1| if pointers omitted */
char *s; /* utility types for overall graph */
{
switch (c) {
case 'I': printf("[%ld]",u.I);@+break;
case 'S': printf("[\"%s\"]",u.S?u.S:"(null)");@+break;
case 'A': if (l<0) break;
printf("[");
if (u.A==NULL) printf("NULL");
else pr_arc(u.A,l,s);
printf("]");
break;
case 'V': if (l<0) break; /* avoid infinite recursion */
printf("[");
pr_vert(u.V,l,s);
printf("]");
default: break; /* case |'Z'| does nothing, other cases won't occur */
}
}
@ @<Print information about the |n|th vertex@>=
printf("V%d: ",n);
if (n>=g->n || n<0) printf("index is out of range!\n");
else {
pr_vert(g->vertices+n,1,g->util_types);
printf("\n");
}
@ @<Print global characteristics of |g|@>=
printf("\"%s\"\n%ld vertices, %ld arcs, util_types %s",
g->id,g->n,g->m,g->util_types);
pr_util(g->uu,g->util_types[8],0,g->util_types);
pr_util(g->vv,g->util_types[9],0,g->util_types);
pr_util(g->ww,g->util_types[10],0,g->util_types);
pr_util(g->xx,g->util_types[11],0,g->util_types);
pr_util(g->yy,g->util_types[12],0,g->util_types);
pr_util(g->zz,g->util_types[13],0,g->util_types);
printf("\n");
@* Index. We end with the customary list of identifiers, showing where
they are used and where they are defined.
|