+ General Improvements:
[adns] / regress / hcommon.c.m4
1 m4_dnl hcommon.c
2 m4_dnl (part of complex test harness, not of the library)
3 m4_dnl - routines used for both record and playback
4
5 m4_dnl This file is
6 m4_dnl Copyright (C) 1997-2000 Ian Jackson <ian@davenant.greenend.org.uk>
7 m4_dnl
8 m4_dnl It is part of adns, which is
9 m4_dnl Copyright (C) 1997-2000 Ian Jackson <ian@davenant.greenend.org.uk>
10 m4_dnl Copyright (C) 1999 Tony Finch <dot@dotat.at>
11 m4_dnl
12 m4_dnl This program is free software; you can redistribute it and/or modify
13 m4_dnl it under the terms of the GNU General Public License as published by
14 m4_dnl the Free Software Foundation; either version 2, or (at your option)
15 m4_dnl any later version.
16 m4_dnl
17 m4_dnl This program is distributed in the hope that it will be useful,
18 m4_dnl but WITHOUT ANY WARRANTY; without even the implied warranty of
19 m4_dnl MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 m4_dnl GNU General Public License for more details.
21 m4_dnl
22 m4_dnl You should have received a copy of the GNU General Public License
23 m4_dnl along with this program; if not, write to the Free Software Foundation,
24 m4_dnl Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
25
26 m4_include(hmacros.i4)
27
28 #include <string.h>
29 #include <errno.h>
30 #include <stdlib.h>
31
32 #include <sys/types.h>
33 #include <sys/socket.h>
34 #include <netinet/in.h>
35 #include <arpa/inet.h>
36
37 #include <unistd.h>
38 #include <fcntl.h>
39
40 #include "harness.h"
41 #include "internal.h"
42
43 vbuf vb;
44 FILE *Toutputfile= 0;
45 struct timeval currenttime;
46
47 const struct Terrno Terrnos[]= {
48 { "EBADF", EBADF },
49 { "EAGAIN", EAGAIN },
50 { "EINPROGRESS", EINPROGRESS },
51 { "EINTR", EINTR },
52 { "EINVAL", EINVAL },
53 { "EMSGSIZE", EMSGSIZE },
54 { "ENOBUFS", ENOBUFS },
55 { "ENOENT", ENOENT },
56 { "ENOPROTOOPT", ENOPROTOOPT },
57 { "ENOSPC", ENOSPC },
58 { "EWOULDBLOCK", EWOULDBLOCK },
59 { "EHOSTUNREACH", EHOSTUNREACH },
60 { "ECONNRESET", ECONNRESET },
61 { "ECONNREFUSED", ECONNREFUSED },
62 { "EPIPE", EPIPE },
63 { 0, 0 }
64 };
65
66 static vbuf vbw;
67
68 int Hgettimeofday(struct timeval *tv, struct timezone *tz) {
69 Tmust("gettimeofday","tz",!tz);
70 *tv= currenttime;
71 return 0;
72 }
73
74 int Hwritev(int fd, const struct iovec *vector, size_t count) {
75 size_t i;
76
77 vbw.used= 0;
78 for (i=0; i<count; i++, vector++) {
79 if (!adns__vbuf_append(&vbw,vector->iov_base,vector->iov_len)) Tnomem();
80 }
81 return Hwrite(fd,vbw.buf,vbw.used);
82 }
83
84 m4_define(`hm_syscall', `
85 hm_create_proto_q
86 void Q$1(hm_args_massage($3,void)) {
87
88 vb.used= 0;
89 Tvba("$1");
90 m4_define(`hm_na',`')
91 m4_define(`hm_arg_nullptr',`')
92 m4_define(`hm_arg_int', `Tvbf(" $'`1=%d",$'`1);')
93 m4_define(`hm_arg_fdset_io', `Tvbf(" $'`1="); Tvbfdset($'`2,$'`1);')
94 m4_define(`hm_arg_pollfds_io', `Tvbf(" $'`1="); Tvbpollfds($'`1,$'`2);')
95 m4_define(`hm_arg_timeval_in_rel_null', `
96 if ($'`1) Tvbf(" $'`1=%ld.%06ld",(long)$'`1->tv_sec,(long)$'`1->tv_usec);
97 else Tvba(" $'`1=null");')
98 m4_define(`hm_arg_must', `')
99 m4_define(`hm_arg_socktype', `
100 Tvbf($'`1==SOCK_STREAM ? " $'`1=SOCK_STREAM" : " $'`1=SOCK_DGRAM");')
101 m4_define(`hm_arg_ign', `')
102 m4_define(`hm_arg_fd', `Tvbf(" $'`1=%d",$'`1);')
103 m4_define(`hm_arg_fcntl_cmd_arg', `
104 if ($'`1 == F_SETFL) {
105 Tvbf(" $'`1=F_SETFL %s",arg & O_NONBLOCK ? "O_NONBLOCK|..." : "~O_NONBLOCK&...");
106 } else if ($'`1 == F_GETFL) {
107 Tvba(" $'`1=F_GETFL");
108 } else {
109 Tmust("$'`1","F_GETFL/F_SETFL",0);
110 }')
111 m4_define(`hm_arg_addr_in', `Tvba(" $'`1="); Tvbaddr($'`1,$'`2);')
112 m4_define(`hm_arg_bytes_in', `')
113 m4_define(`hm_arg_bytes_out', `Tvbf(" $'`4=%lu",(unsigned long)$'`4);')
114 m4_define(`hm_arg_addr_out', `Tvbf(" *$'`2=%d",$'`2);')
115 $3
116
117 hm_create_nothing
118 m4_define(`hm_arg_bytes_in', `Tvbbytes($'`2,$'`4);')
119 $3
120
121 Q_vb();
122 }
123 ')
124
125 m4_define(`hm_specsyscall', `')
126
127 m4_include(`hsyscalls.i4')
128
129 void Tvbaddr(const struct sockaddr *addr, int len) {
130 const struct sockaddr_in *ai= (const struct sockaddr_in*)addr;
131
132 assert(len==sizeof(struct sockaddr_in));
133 assert(ai->sin_family==AF_INET);
134 Tvbf("%s:%u",inet_ntoa(ai->sin_addr),htons(ai->sin_port));
135 }
136
137 void Tvbbytes(const void *buf, int len) {
138 const byte *bp;
139 int i;
140
141 if (!len) { Tvba("\n ."); return; }
142 for (i=0, bp=buf; i<len; i++, bp++) {
143 if (!(i&31)) Tvba("\n ");
144 else if (!(i&3)) Tvba(" ");
145 Tvbf("%02x",*bp);
146 }
147 Tvba(".");
148 }
149
150 void Tvbfdset(int max, const fd_set *fds) {
151 int i;
152 const char *comma= "";
153
154 Tvba("[");
155 for (i=0; i<max; i++) {
156 if (!FD_ISSET(i,fds)) continue;
157 Tvba(comma);
158 Tvbf("%d",i);
159 comma= ",";
160 }
161 Tvba("]");
162 }
163
164 static void Tvbpollevents(int events) {
165 const char *delim= "";
166
167 events &= (POLLIN|POLLOUT|POLLPRI);
168 if (!events) { Tvba("0"); return; }
169 if (events & POLLIN) { Tvba("POLLIN"); delim= "|"; }
170 if (events & POLLOUT) { Tvba(delim); Tvba("POLLOUT"); delim= "|"; }
171 if (events & POLLPRI) { Tvba(delim); Tvba("POLLPRI"); }
172 }
173
174 void Tvbpollfds(const struct pollfd *fds, int nfds) {
175 const char *comma= "";
176
177 Tvba("[");
178 while (nfds>0) {
179 Tvba(comma);
180 Tvbf("{fd=%d, events=",fds->fd);
181 Tvbpollevents(fds->events);
182 Tvba(", revents=");
183 Tvbpollevents(fds->revents);
184 Tvba("}");
185 comma= ", ";
186 nfds--; fds++;
187 }
188 Tvba("]");
189 }
190
191 void Tvberrno(int e) {
192 const struct Terrno *te;
193
194 for (te= Terrnos; te->n && te->v != e; te++);
195 assert(te->n);
196 Tvba(te->n);
197 }
198
199 void Tvba(const char *str) {
200 if (!adns__vbuf_appendstr(&vb,str)) Tnomem();
201 }
202
203 void Tvbvf(const char *fmt, va_list al) {
204 char buf[1000];
205 buf[sizeof(buf)-2]= '\t';
206 vsnprintf(buf,sizeof(buf),fmt,al);
207 assert(buf[sizeof(buf)-2] == '\t');
208
209 Tvba(buf);
210 }
211
212 void Tvbf(const char *fmt, ...) {
213 va_list al;
214 va_start(al,fmt);
215 Tvbvf(fmt,al);
216 va_end(al);
217 }
218
219
220 void Tmust(const char *call, const char *arg, int cond) {
221 if (cond) return;
222 fprintf(stderr,"adns test harness: case not handled: system call %s, arg %s",call,arg);
223 exit(-1);
224 }
225
226 void Tfailed(const char *why) {
227 fprintf(stderr,"adns test harness: failure: %s: %s\n",why,strerror(errno));
228 exit(-1);
229 }
230
231 void Tnomem(void) {
232 Tfailed("unable to malloc/realloc");
233 }
234
235 void Toutputerr(void) {
236 Tfailed("write error on test harness output");
237 }
238
239 struct malloced {
240 struct malloced *next, *back;
241 size_t sz;
242 unsigned long count;
243 struct { double d; long ul; void *p; void (*fp)(void); } data;
244 };
245
246 static unsigned long malloccount, mallocfailat;
247 static struct { struct malloced *head, *tail; } mallocedlist;
248
249 #define MALLOCHSZ ((char*)&mallocedlist.head->data - (char*)mallocedlist.head)
250
251 void *Hmalloc(size_t sz) {
252 struct malloced *newnode;
253 const char *mfavar;
254 char *ep;
255
256 assert(sz);
257
258 newnode= malloc(MALLOCHSZ + sz); if (!newnode) Tnomem();
259
260 LIST_LINK_TAIL(mallocedlist,newnode);
261 newnode->sz= sz;
262 newnode->count= ++malloccount;
263 if (!mallocfailat) {
264 mfavar= getenv("ADNS_REGRESS_MALLOCFAILAT");
265 if (mfavar) {
266 mallocfailat= strtoul(mfavar,&ep,10);
267 if (!mallocfailat || *ep) Tfailed("ADNS_REGRESS_MALLOCFAILAT bad value");
268 } else {
269 mallocfailat= ~0UL;
270 }
271 }
272 assert(newnode->count != mallocfailat);
273 memset(&newnode->data,0xc7,sz);
274 return &newnode->data;
275 }
276
277 void Hfree(void *ptr) {
278 struct malloced *oldnode;
279
280 if (!ptr) return;
281
282 oldnode= (void*)((char*)ptr - MALLOCHSZ);
283 LIST_UNLINK(mallocedlist,oldnode);
284 memset(&oldnode->data,0x38,oldnode->sz);
285 free(oldnode);
286 }
287
288 void *Hrealloc(void *op, size_t nsz) {
289 struct malloced *oldnode;
290 void *np;
291 size_t osz;
292
293 if (op) { oldnode= (void*)((char*)op - MALLOCHSZ); osz= oldnode->sz; } else { osz= 0; }
294 np= Hmalloc(nsz);
295 memcpy(np,op, osz>nsz ? nsz : osz);
296 Hfree(op);
297 return np;
298 }
299
300 void Hexit(int rv) {
301 struct malloced *loopnode;
302
303 Tshutdown();
304 adns__vbuf_free(&vb);
305 adns__vbuf_free(&vbw);
306 if (mallocedlist.head) {
307 fprintf(stderr,"adns test harness: memory leaked:");
308 for (loopnode=mallocedlist.head; loopnode; loopnode=loopnode->next)
309 fprintf(stderr," %lu(%lu)",loopnode->count,(unsigned long)loopnode->sz);
310 putc('\n',stderr);
311 if (ferror(stderr)) exit(-1);
312 }
313 exit(rv);
314 }