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
|
/* $Id: test_ncbi_buffer.c,v 6.11 2011/03/19 03:04:33 kazimird Exp $
* ===========================================================================
*
* PUBLIC DOMAIN NOTICE
* National Center for Biotechnology Information
*
* This software/database is a "United States Government Work" under the
* terms of the United States Copyright Act. It was written as part of
* the author's official duties as a United States Government employee and
* thus cannot be copyrighted. This software/database is freely available
* to the public for use. The National Library of Medicine and the U.S.
* Government have not placed any restriction on its use or reproduction.
*
* Although all reasonable efforts have been taken to ensure the accuracy
* and reliability of the software and data, the NLM and the U.S.
* Government do not and cannot warrant the performance or results that
* may be obtained by using this software or data. The NLM and the U.S.
* Government disclaim all warranties, express or implied, including
* warranties of performance, merchantability or fitness for any particular
* purpose.
*
* Please cite the author in any work or product based on this material.
*
* ===========================================================================
*
* Author: Denis Vakatov
*
* File Description:
* Test suite for "ncbi_buffer.[ch]", a memory-resident FIFO storage area
*
*/
#include <connect/ncbi_buffer.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
/* This header must go last */
#include "test_assert.h"
/* a (primitive) uniform random number generator :-) */
static unsigned int s_Rand(void)
{
static unsigned int s_Random = 1;
s_Random = s_Random * 1103515245 + 12345;
return (s_Random / 65536) % 32768;
}
extern int main(void)
{
# define X_MAX_N_IO (unsigned) 4
# define X_MAX_READ (size_t) (3 * BUF_DEF_CHUNK_SIZE)
# define X_TIMES (unsigned) (s_Rand() % X_MAX_N_IO)
# define X_BYTES (size_t) (s_Rand() % X_MAX_READ)
BUF buf = 0;
BUF buf1 = 0;
int/*bool*/ do_loop = 1 /* true */;
/* a simple test */
{{
char charbuf[128];
assert(BUF_PushBack(&buf, (const char*) "0", 1));
assert(BUF_Write(&buf, (const char*) "1", 1));
assert(BUF_Peek(buf, charbuf, sizeof(charbuf)) == 2);
assert(BUF_PushBack(&buf, (const char*) "BB", 2));
assert(BUF_PushBack(&buf, (const char*) "aa", 2));
assert(BUF_Write(&buf, (const char*) "23\0", 3));
assert(BUF_Read(buf, charbuf, sizeof(charbuf)) == 9);
assert(strcmp(charbuf, (const char*) "aaBB0123") == 0);
assert(BUF_Prepend(&buf, "Hello World\0", 12));
assert(BUF_Read(buf, 0, 6) == 6);
assert(BUF_PushBack(&buf, "Goodbye ", 8));
assert(BUF_Read(buf, charbuf, sizeof(charbuf)) == 14);
assert(strcmp(charbuf, (const char*) "Goodbye World") == 0);
BUF_Destroy(buf);
buf = 0;
}}
/* usage */
fprintf(stderr, "Waiting for the data in STDIN...\n");
/* read up to the very end of input stream */
while ( do_loop ) {
char charbuf[X_MAX_READ];
unsigned i, n_times;
/* read from the input stream, write to the NCBI IO-buf */
n_times = X_TIMES;
for (i = 0; i < n_times; i++) {
size_t n_bytes = X_BYTES;
if ( !n_bytes )
continue;
n_bytes = fread(charbuf, 1, n_bytes, stdin);
fprintf(stderr, "STDIN %5lu\n", (unsigned long) n_bytes);
if ( !n_bytes ) {
do_loop = 0 /* false */; /* end of the input stream */
break;
}
assert(BUF_Write(&buf, charbuf, n_bytes));
assert(BUF_Write(&buf1, charbuf, n_bytes));
fprintf(stderr, "BUF_Write %5lu\n", (unsigned long) n_bytes);
}
/* peek & read from the NCBI IO-buf, write to the output stream */
n_times = X_TIMES;
for (i = 0; i < n_times && BUF_Size(buf); i++) {
int/*bool*/ do_peek = (s_Rand() % 2 == 0);
size_t n_peek = 0;
size_t n_bytes = X_BYTES;
if ( !n_bytes )
continue;
/* peek from the NCBI IO-buf */
if ( do_peek ) {
unsigned j, n_peek_times = s_Rand() % 3 + 1;
for (j = 0; j < n_peek_times; j++) {
n_peek = BUF_Peek(buf, charbuf, n_bytes);
fprintf(stderr, "\tBUF_Peek %5lu\n",(unsigned long)n_peek);
}
}
/* read (or just discard) the data */
if (do_peek && s_Rand() % 2 == 0)
n_bytes = BUF_Read(buf, 0, n_bytes);
else
n_bytes = BUF_Read(buf, charbuf, n_bytes);
fprintf(stderr, "\t\tBUF_Read %5lu\n", (unsigned long) n_bytes);
assert(!do_peek || n_bytes == n_peek);
/* push back & re-read */
if (s_Rand() % 3 == 0) {
size_t n_pushback = s_Rand() % n_bytes;
if (n_pushback == 0)
n_pushback = 1;
assert(BUF_PushBack
(&buf, charbuf + n_bytes - n_pushback, n_pushback));
assert(BUF_Read
( buf, charbuf + n_bytes - n_pushback, n_pushback));
}
/* write the read data to the output stream */
assert(n_bytes == fwrite(charbuf, 1, n_bytes, stdout));
fprintf(stderr, "\t\tSTDOUT %5lu\n", (unsigned long) n_bytes);
}
}
/* flush the IO-buf to the output stream */
while ( BUF_Size(buf) ) {
char charbuf[256];
size_t n_bytes = BUF_Read(buf, charbuf, sizeof(charbuf));
{{
char tmp[sizeof(charbuf)];
size_t n_pushback = s_Rand() % 64;
if (n_pushback > n_bytes)
n_pushback = n_bytes;
assert(BUF_PushBack
(&buf, charbuf + n_bytes - n_pushback, n_pushback));
assert(BUF_Read
( buf, tmp, n_pushback) == n_pushback);
memcpy(charbuf + n_bytes - n_pushback, tmp, n_pushback);
}}
fprintf(stderr, "\t\tBUF_Read/flush %5lu\n", (unsigned long) n_bytes);
assert(n_bytes);
assert(n_bytes == fwrite(charbuf, 1, n_bytes, stdout));
fprintf(stderr, "\t\tSTDOUT /flush %5lu\n", (unsigned long) n_bytes);
}
fflush(stdout);
/* Test for "BUF_PeekAt()" */
{{
size_t buf1_size = BUF_Size(buf1);
int n;
assert(buf1_size > 0);
for (n = 0; n < 20; n++) {
size_t pos;
size_t size;
/* Erratically copy "buf1" to "buf" */
for (pos = 0; pos < buf1_size; pos += size) {
char temp_buf[BUF_DEF_CHUNK_SIZE * 2];
size_t n_peeked;
size = s_Rand() % (BUF_DEF_CHUNK_SIZE * 2);
n_peeked = BUF_PeekAt(buf1, pos, temp_buf, size);
if (pos + size <= buf1_size) {
assert(n_peeked == size);
} else {
assert(n_peeked == buf1_size - pos);
}
assert(BUF_PeekAt(buf1, pos, temp_buf, size) == n_peeked);
assert(BUF_Write(&buf, temp_buf, n_peeked));
}
/* Compare "buf" and "buf1"; empty up "buf" in process */
assert(BUF_Size(buf1) == BUF_Size(buf));
for (pos = 0; pos < buf1_size; pos += size) {
char bb[1024];
char b1[1024];
assert(sizeof(bb) == sizeof(b1));
size = BUF_Read(buf, bb, sizeof(bb));
assert(BUF_PeekAt(buf1, pos, b1, size) == size);
assert(size <= sizeof(b1));
assert(memcmp(bb, b1, size) == 0);
}
assert(pos == buf1_size);
assert(BUF_Size(buf1) == buf1_size);
assert(BUF_Size(buf) == 0);
}
}}
/* cleanup & exit */
BUF_Destroy(buf1);
BUF_Destroy(buf);
return 0;
}
|
