iter_hints_stub
struct iter_hints_stub* node = (struct iter_hints_stub*)malloc(
sizeof(struct iter_hints_stub));
struct iter_hints_stub *stub;
stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,
struct iter_hints_stub*
struct iter_hints_stub *r;
r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname,
struct iter_hints_stub* p;
RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) {
struct iter_hints_stub *z;
if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
struct iter_hints_stub *z;
if(!(z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
static void hints_stub_free(struct iter_hints_stub* s)
struct iter_hints_stub* node = (struct iter_hints_stub*)n;
struct iter_hints_stub* hints_lookup_stub(struct iter_hints* hints,
struct iter_hints_stub *stub;
struct iter_hints_stub* stub;
struct iter_hints_stub* stub;
struct iter_hints_stub* stub;
struct iter_hints_stub* z;
RBTREE_FOR(z, struct iter_hints_stub*, &worker->env.hints->tree) {
struct iter_hints_stub* node = (struct iter_hints_stub*)malloc(
sizeof(struct iter_hints_stub));
struct iter_hints_stub *stub;
stub = (struct iter_hints_stub*)name_tree_find(&hints->tree,
struct iter_hints_stub*
struct iter_hints_stub *r;
r = (struct iter_hints_stub*)name_tree_lookup(&hints->tree, qname,
struct iter_hints_stub* p;
RBTREE_FOR(p, struct iter_hints_stub*, &hints->tree) {
struct iter_hints_stub *z;
if((z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
struct iter_hints_stub *z;
if(!(z=(struct iter_hints_stub*)name_tree_find(&hints->tree,
static void hints_stub_free(struct iter_hints_stub* s)
struct iter_hints_stub* node = (struct iter_hints_stub*)n;
struct iter_hints_stub* hints_lookup_stub(struct iter_hints* hints,
struct iter_hints_stub *stub;
struct iter_hints_stub* stub;
struct iter_hints_stub* stub;