usr.sbin/unbound/testcode/lock_verify.c

231

struct lock_ref* ref;

usr.sbin/unbound/testcode/lock_verify.c

233

ref = (struct lock_ref*)calloc(1, sizeof(struct lock_ref));

usr.sbin/unbound/testcode/lock_verify.c

283

static void found_cycle(struct lock_ref* visit, int level)

usr.sbin/unbound/testcode/lock_verify.c

285

struct lock_ref* p;

usr.sbin/unbound/testcode/lock_verify.c

310

static int detect_cycle(struct lock_ref* visit, struct lock_ref* from)

usr.sbin/unbound/testcode/lock_verify.c

312

struct lock_ref* p = from;

usr.sbin/unbound/testcode/lock_verify.c

328

static void search_cycle(struct lock_ref* visit, int level,

usr.sbin/unbound/testcode/lock_verify.c

329

struct lock_ref* from)

usr.sbin/unbound/testcode/lock_verify.c

331

struct lock_ref* ref;

usr.sbin/unbound/testcode/lock_verify.c

344

RBTREE_FOR(ref, struct lock_ref*, visit->lock->smaller) {

usr.sbin/unbound/testcode/lock_verify.c

354

struct lock_ref start;

usr.sbin/unbound/testcode/lock_verify.c

395

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

usr.sbin/unbound/testcode/lock_verify.c

56

struct lock_ref;

usr.sbin/unbound/testcode/lock_verify.c

82

struct lock_ref* dfs_next;