usr.sbin/unbound/testcode/lock_verify.c

188

struct order_lock* o = calloc(1, sizeof(struct order_lock));

usr.sbin/unbound/testcode/lock_verify.c

199

struct order_lock* a = (struct order_lock*)rbtree_search(all,

usr.sbin/unbound/testcode/lock_verify.c

214

static struct order_lock*

usr.sbin/unbound/testcode/lock_verify.c

217

struct order_lock* o = calloc(1, sizeof(struct order_lock));

usr.sbin/unbound/testcode/lock_verify.c

232

struct order_lock* prev, *now;

usr.sbin/unbound/testcode/lock_verify.c

247

prev = (struct order_lock*)rbtree_search(all, &prev_id);

usr.sbin/unbound/testcode/lock_verify.c

248

now = (struct order_lock*)rbtree_search(all, &now_id);

usr.sbin/unbound/testcode/lock_verify.c

295

struct order_lock* next =

usr.sbin/unbound/testcode/lock_verify.c

352

static void check_order_lock(struct order_lock* lock)

usr.sbin/unbound/testcode/lock_verify.c

375

struct order_lock* lock;

usr.sbin/unbound/testcode/lock_verify.c

377

RBTREE_FOR(lock, struct order_lock*, all_locks) {

usr.sbin/unbound/testcode/lock_verify.c

404

struct order_lock* o = (struct order_lock*)node;

usr.sbin/unbound/testcode/lock_verify.c

94

struct order_lock* lock;