Reentrancy: Avoid reentrant callbacks
[adns] / src / check.c
1 /*
2 * check.c
3 * - consistency checks
4 */
5 /*
6 * This file is part of adns, which is
7 * Copyright (C) 1997-2000,2003,2006 Ian Jackson
8 * Copyright (C) 1999-2000,2003,2006 Tony Finch
9 * Copyright (C) 1991 Massachusetts Institute of Technology
10 * (See the file INSTALL for full details.)
11 *
12 * This program is free software; you can redistribute it and/or modify
13 * it under the terms of the GNU General Public License as published by
14 * the Free Software Foundation; either version 2, or (at your option)
15 * any later version.
16 *
17 * This program is distributed in the hope that it will be useful,
18 * but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License
23 * along with this program; if not, write to the Free Software Foundation,
24 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
25 */
26
27 #include "internal.h"
28
29 void adns_checkconsistency(adns_state ads, adns_query qu) {
30 adns__consistency(ads,qu,cc_user);
31 }
32
33 #define DLIST_CHECK(list, nodevar, part, body) \
34 if ((list).head) { \
35 assert(! (list).head->part back); \
36 for ((nodevar)= (list).head; \
37 (nodevar); \
38 (nodevar)= (nodevar)->part next) { \
39 assert((nodevar)->part next \
40 ? (nodevar) == (nodevar)->part next->part back \
41 : (nodevar) == (list).tail); \
42 body \
43 } \
44 }
45
46 #define DLIST_ASSERTON(node, nodevar, list, part) \
47 do { \
48 for ((nodevar)= (list).head; \
49 (nodevar) != (node); \
50 (nodevar)= (nodevar)->part next) { \
51 assert((nodevar)); \
52 } \
53 } while(0)
54
55 static void checkc_query_alloc(adns_state ads, adns_query qu) {
56 allocnode *an;
57
58 DLIST_CHECK(qu->allocations, an, , {
59 });
60 }
61
62 static void checkc_query(adns_state ads, adns_query qu) {
63 adns_query child;
64
65 assert(qu->udpnextserver < ads->nservers);
66 assert(!(qu->udpsent & (~0UL << ads->nservers)));
67 assert(qu->search_pos <= ads->nsearchlist);
68 if (qu->parent) DLIST_ASSERTON(qu, child, qu->parent->children, siblings.);
69 }
70
71 static void checkc_notcpbuf(adns_state ads) {
72 assert(!ads->tcpsend.used);
73 assert(!ads->tcprecv.used);
74 assert(!ads->tcprecv_skip);
75 }
76
77 static void checkc_global(adns_state ads) {
78 const struct sortlist *sl;
79 int i;
80
81 assert(ads->udpsocket >= 0);
82
83 for (i=0; i<ads->nsortlist; i++) {
84 sl= &ads->sortlist[i];
85 assert(adns__addr_match_p(sl->af,&sl->base, sl->af,&sl->base,&sl->mask));
86 }
87
88 assert(ads->tcpserver >= 0 && ads->tcpserver < ads->nservers);
89
90 switch (ads->tcpstate) {
91 case server_connecting:
92 assert(ads->tcpsocket >= 0);
93 checkc_notcpbuf(ads);
94 break;
95 case server_disconnected:
96 case server_broken:
97 assert(ads->tcpsocket == -1);
98 checkc_notcpbuf(ads);
99 break;
100 case server_ok:
101 assert(ads->tcpsocket >= 0);
102 assert(ads->tcprecv_skip <= ads->tcprecv.used);
103 break;
104 default:
105 assert(!"ads->tcpstate value");
106 }
107
108 assert(ads->searchlist || !ads->nsearchlist);
109 }
110
111 static void checkc_queue_udpw(adns_state ads) {
112 adns_query qu;
113
114 DLIST_CHECK(ads->udpw, qu, , {
115 assert(qu->state==query_tosend);
116 assert(qu->retries <= UDPMAXRETRIES);
117 assert(qu->udpsent);
118 assert(!qu->children.head && !qu->children.tail);
119 checkc_query(ads,qu);
120 checkc_query_alloc(ads,qu);
121 });
122 }
123
124 static void checkc_queue_tcpw(adns_state ads) {
125 adns_query qu;
126
127 DLIST_CHECK(ads->tcpw, qu, , {
128 assert(qu->state==query_tcpw);
129 assert(!qu->children.head && !qu->children.tail);
130 assert(qu->retries <= ads->nservers+1);
131 checkc_query(ads,qu);
132 checkc_query_alloc(ads,qu);
133 });
134 }
135
136 static void checkc_queue_childw(adns_state ads) {
137 adns_query parent, child;
138
139 DLIST_CHECK(ads->childw, parent, , {
140 assert(parent->state == query_childw);
141 assert(parent->children.head);
142 DLIST_CHECK(parent->children, child, siblings., {
143 assert(child->parent == parent);
144 assert(child->state != query_done);
145 });
146 checkc_query(ads,parent);
147 checkc_query_alloc(ads,parent);
148 });
149 }
150
151 static void checkc_query_done(adns_state ads, adns_query qu) {
152 assert(qu->state == query_done);
153 assert(!qu->children.head && !qu->children.tail);
154 checkc_query(ads,qu);
155 }
156
157 static void checkc_queue_output(adns_state ads) {
158 adns_query qu;
159
160 DLIST_CHECK(ads->output, qu, , {
161 assert(!qu->parent);
162 assert(!qu->allocations.head && !qu->allocations.tail);
163 checkc_query_done(ads,qu);
164 });
165 }
166
167 static void checkc_queue_intdone(adns_state ads) {
168 adns_query qu;
169
170 DLIST_CHECK(ads->intdone, qu, , {
171 assert(qu->parent);
172 assert(qu->ctx.callback);
173 checkc_query_done(ads,qu);
174 });
175 }
176
177 void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc) {
178 adns_query search;
179
180 switch (cc) {
181 case cc_user:
182 break;
183 case cc_entex:
184 if (!(ads->iflags & adns_if_checkc_entex)) return;
185 assert(!ads->intdone.head);
186 break;
187 case cc_freq:
188 if ((ads->iflags & adns_if_checkc_freq) != adns_if_checkc_freq) return;
189 break;
190 default:
191 abort();
192 }
193
194 checkc_global(ads);
195 checkc_queue_udpw(ads);
196 checkc_queue_tcpw(ads);
197 checkc_queue_childw(ads);
198 checkc_queue_output(ads);
199 checkc_queue_intdone(ads);
200
201 if (qu) {
202 switch (qu->state) {
203 case query_tosend:
204 DLIST_ASSERTON(qu, search, ads->udpw, );
205 break;
206 case query_tcpw:
207 DLIST_ASSERTON(qu, search, ads->tcpw, );
208 break;
209 case query_childw:
210 DLIST_ASSERTON(qu, search, ads->childw, );
211 break;
212 case query_done:
213 if (qu->parent)
214 DLIST_ASSERTON(qu, search, ads->intdone, );
215 else
216 DLIST_ASSERTON(qu, search, ads->output, );
217 break;
218 default:
219 assert(!"specific query state");
220 }
221 }
222 }