36#define DLIST_CHECK(list, nodevar, part, body) \
38 assert(! (list).head->part back); \
39 for ((nodevar)= (list).head; (nodevar); (nodevar)= (nodevar)->part next) { \
40 assert((nodevar)->part next \
41 ? (nodevar) == (nodevar)->part next->part back \
42 : (nodevar) == (list).tail); \
48#define DLIST_CHECK1(list, nodevar, body) \
50 assert(! (list).head->back); \
51 for ((nodevar)= (list).head; (nodevar); (nodevar)= (nodevar)->next) { \
52 assert((nodevar)->next \
53 ? (nodevar) == (nodevar)->next->back \
54 : (nodevar) == (list).tail); \
59#define DLIST_CHECK2(list, nodevar, part, body) \
61 assert(! (list).head->part.back); \
62 for ((nodevar)= (list).head; (nodevar); (nodevar)= (nodevar)->part.next) { \
63 assert((nodevar)->part.next \
64 ? (nodevar) == (nodevar)->part.next->part.back \
65 : (nodevar) == (list).tail); \
70#define DLIST_ASSERTON(node, nodevar, list, part) \
72 for ((nodevar)= (list).head; \
73 (nodevar) != (node); \
74 (nodevar)= (nodevar)->part next) { \
113 case server_connecting:
117 case server_disconnected:
127 assert(!
"ads->tcpstate value");
137 assert(qu->state==query_tosend);
138 assert(qu->retries <= UDPMAXRETRIES);
140 assert(!qu->children.head && !qu->children.tail);
141 checkc_query(ads,qu);
142 checkc_query_alloc(ads,qu);
150 assert(qu->state==query_tcpw);
151 assert(!qu->children.head && !qu->children.tail);
152 assert(qu->retries <= ads->nservers+1);
153 checkc_query(ads,qu);
154 checkc_query_alloc(ads,qu);
162 assert(parent->state == query_childw);
163 assert(parent->children.head);
164 DLIST_CHECK2(parent->children, child, siblings, {
165 assert(child->parent == parent);
166 assert(child->state != query_done);
177 assert(qu->state == query_done);
178 assert(!qu->children.head && !qu->children.tail);
180 assert(!qu->allocations.head && !qu->allocations.tail);
181 checkc_query(ads,qu);
222 assert(!
"specific query state");
#define DLIST_ASSERTON(node, nodevar, list, part)
static void checkc_queue_tcpw(adns_state ads)
static void checkc_notcpbuf(adns_state ads)
static void checkc_queue_childw(adns_state ads)
static void checkc_queue_udpw(adns_state ads)
static void checkc_query(adns_state ads, adns_query qu)
#define DLIST_CHECK1(list, nodevar, body)
static void checkc_query_alloc(adns_state ads, adns_query qu)
static void checkc_global(adns_state ads)
static void checkc_queue_output(adns_state ads)
void adns__consistency(adns_state ads, adns_query qu, consistency_checks cc)
void adns_checkconsistency(adns_state ads, adns_query qu)
void query_done(struct query_node *qun, adns_answer *answer)
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint i
static short search(int val, const short *table, int size)
struct adns__query::@4358 children
struct adns__query::@4360 allocations
enum adns__query::@4357 state
struct adns__state::sortlist sortlist[MAXSORTLIST]
enum adns__state::adns__tcpstate tcpstate
struct query_queue udpw tcpw childw output