130 lines
4.6 KiB
C
130 lines
4.6 KiB
C
|
/*---
|
||
|
This software is copyrighted by the Regents of the University of
|
||
|
California, and other parties. The following terms apply to all files
|
||
|
associated with the software unless explicitly disclaimed in
|
||
|
individual files.
|
||
|
|
||
|
The authors hereby grant permission to use, copy, modify, distribute,
|
||
|
and license this software and its documentation for any purpose,
|
||
|
provided that existing copyright notices are retained in all copies
|
||
|
and that this notice is included verbatim in any distributions. No
|
||
|
written agreement, license, or royalty fee is required for any of the
|
||
|
authorized uses. Modifications to this software may be copyrighted by
|
||
|
their authors and need not follow the licensing terms described here,
|
||
|
provided that the new terms are clearly indicated on the first page of
|
||
|
each file where they apply.
|
||
|
|
||
|
IN NO EVENT SHALL THE AUTHORS OR DISTRIBUTORS BE LIABLE TO ANY PARTY
|
||
|
FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
|
||
|
ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
|
||
|
DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
|
||
|
POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
|
||
|
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
||
|
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
|
||
|
NON-INFRINGEMENT. THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, AND
|
||
|
THE AUTHORS AND DISTRIBUTORS HAVE NO OBLIGATION TO PROVIDE
|
||
|
MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
||
|
|
||
|
GOVERNMENT USE: If you are acquiring this software on behalf of the
|
||
|
U.S. government, the Government shall have only "Restricted Rights" in
|
||
|
the software and related documentation as defined in the Federal
|
||
|
Acquisition Regulations (FARs) in Clause 52.227.19 (c) (2). If you are
|
||
|
acquiring the software on behalf of the Department of Defense, the
|
||
|
software shall be classified as "Commercial Computer Software" and the
|
||
|
Government shall have only "Restricted Rights" as defined in Clause
|
||
|
252.227-7013 (c) (1) of DFARs. Notwithstanding the foregoing, the
|
||
|
authors grant the U.S. Government and others acting in its behalf
|
||
|
permission to use and distribute the software in accordance with the
|
||
|
terms specified in this license.
|
||
|
---*/
|
||
|
/*********************************
|
||
|
* $Id$
|
||
|
*
|
||
|
* testing with various strings
|
||
|
* *******************************/
|
||
|
#include <assert.h>
|
||
|
#include "test.h"
|
||
|
|
||
|
#define VERBOSE 0
|
||
|
#define SEED 5095
|
||
|
|
||
|
int test() {
|
||
|
int xid;
|
||
|
int NUM_TRIALS=100;
|
||
|
recordid rec;
|
||
|
|
||
|
/* counters */
|
||
|
int i;
|
||
|
char c;
|
||
|
|
||
|
/* used for making the random strings*/
|
||
|
double r;
|
||
|
int start, end;
|
||
|
|
||
|
/* used to make a long string */
|
||
|
char first_printable_ascii = ' ';
|
||
|
char last_printable_ascii = '~';
|
||
|
int ascii_length = (int)(last_printable_ascii - first_printable_ascii);
|
||
|
char *ASCII = (char *)malloc(sizeof(char) * ascii_length);
|
||
|
|
||
|
/* an array of strings */
|
||
|
char **strings = (char **)malloc(sizeof(char*) * NUM_TRIALS);
|
||
|
|
||
|
/* output buffer */
|
||
|
char *out_buffer = (char *)malloc(sizeof(char) * ascii_length);
|
||
|
|
||
|
|
||
|
srand(SEED);
|
||
|
|
||
|
/* create the long string from which random strings will be made */
|
||
|
for (c = 0; c < ascii_length; c++) {
|
||
|
ASCII[(int)c] = first_printable_ascii + c;
|
||
|
}
|
||
|
|
||
|
for (i = 0; i < NUM_TRIALS; i++) {
|
||
|
|
||
|
r = ((double)rand()/(double)((double)RAND_MAX+1)); /* returns [0, 1)*/
|
||
|
r = r*ascii_length;
|
||
|
start = (int)r; /* an int in the rand [0, ascii_length) */
|
||
|
|
||
|
r = ((double)rand()/(double)((double)RAND_MAX+1)); /* returns [0, 1)*/
|
||
|
r = r*ascii_length;
|
||
|
end = (int)r; /* an int in the rand [0, ascii_length) */
|
||
|
|
||
|
if (start == end) {
|
||
|
i--;
|
||
|
continue;
|
||
|
}
|
||
|
|
||
|
if (end < start) {
|
||
|
int swap = start;
|
||
|
start = end;
|
||
|
end = swap;
|
||
|
}
|
||
|
|
||
|
|
||
|
strings[i] = (char *)malloc(sizeof(char) * (end - start) + 1);
|
||
|
strncpy(strings[i], ASCII + start, end-start);
|
||
|
strings[i][end-start-1] = '\0'; /* make the string null terminated */
|
||
|
|
||
|
}
|
||
|
|
||
|
for (i = 0; i < NUM_TRIALS; i++) {
|
||
|
xid = Tbegin();
|
||
|
rec = Talloc(xid, sizeof(char)*(strlen(strings[i]) +1));
|
||
|
Tset(xid, rec, strings[i]);
|
||
|
|
||
|
Tread(xid, rec, out_buffer);
|
||
|
|
||
|
if (VERBOSE) {
|
||
|
printf("xid %d set rid (%d, %d) to [%s], and read [%s]\n", xid, rec.page, rec.slot, strings[i], out_buffer);
|
||
|
}
|
||
|
assert(strcmp(strings[i], out_buffer) == 0);
|
||
|
Tcommit(xid);
|
||
|
}
|
||
|
|
||
|
return 0;
|
||
|
}
|