lib/libpcap/gencode.h

115

struct edge *next; /* link list of incoming edges for a node */

lib/libpcap/gencode.h

128

struct edge et;

lib/libpcap/gencode.h

129

struct edge ef;

lib/libpcap/gencode.h

134

struct edge *in_edges;

lib/libpcap/optimize.c

101

static void opt_j(struct edge *);

lib/libpcap/optimize.c

105

static __inline void link_inedge(struct edge *, struct block *);

lib/libpcap/optimize.c

1074

struct edge *p;

lib/libpcap/optimize.c

1158

fold_edge(struct block *child, struct edge *ep)

lib/libpcap/optimize.c

118

static void opt_j(struct edge *);

lib/libpcap/optimize.c

119

static struct block *fold_edge(struct block *, struct edge *);

lib/libpcap/optimize.c

1202

opt_j(struct edge *ep)

lib/libpcap/optimize.c

1262

struct edge *ep;

lib/libpcap/optimize.c

133

struct edge **edges;

lib/libpcap/optimize.c

1354

struct edge *ep;

lib/libpcap/optimize.c

1473

link_inedge(struct edge *parent, struct block *child)

lib/libpcap/optimize.c

272

propedom(struct edge *ep)

lib/libpcap/optimize.c

89

static void propedom(struct edge *);

regress/lib/libssl/handshake/handshake_table.c

182

void edge(enum tls13_message_type start,

regress/lib/libssl/handshake/handshake_table.c

364

edge(start, end, forced_flag);

regress/lib/libssl/handshake/handshake_table.c

387

edge(start, end, flag);

sys/dev/fdt/bcmstbgpio.c

313

int edge = 0;

sys/dev/fdt/bcmstbgpio.c

333

edge = 1;

sys/dev/fdt/bcmstbgpio.c

336

edge = 1;

sys/dev/fdt/bcmstbgpio.c

340

edge = 1;

sys/dev/fdt/bcmstbgpio.c

358

ih->ih_edge = edge;

sys/dev/fdt/mvicu.c

206

int edge = 0;

sys/dev/fdt/mvicu.c

213

edge = ((flags & 0xf) == 0x1);

sys/dev/fdt/mvicu.c

217

edge = ((flags & 0xf) == 0x1);

sys/dev/fdt/mvicu.c

221

edge = 1;

sys/dev/fdt/mvicu.c

252

(sn->sn_group << ICU_INT_GROUP_SHIFT) | (edge ? ICU_INT_EDGE : 0));

sys/dev/fdt/mvicu.c

258

(edge ? ICU_INT_EDGE : 0));

sys/dev/fdt/mvicu.c

261

(edge ? ICU_INT_EDGE : 0));

sys/dev/wscons/wstpad.c

1149

if (t->y >= tp->edge.low || (NORTH(t->dir) &&

sys/dev/wscons/wstpad.c

1174

if (t->y >= tp->edge.low)

sys/dev/wscons/wstpad.c

1656

tp->edge.left = (offset ? input->hw.x_min + offset : INT_MIN);

sys/dev/wscons/wstpad.c

1658

tp->edge.right = (offset ? input->hw.x_max - offset : INT_MAX);

sys/dev/wscons/wstpad.c

1660

tp->edge.bottom = (offset ? input->hw.y_min + offset : INT_MIN);

sys/dev/wscons/wstpad.c

1661

tp->edge.low = tp->edge.bottom + offset / 2;

sys/dev/wscons/wstpad.c

1663

tp->edge.top = (offset ? input->hw.y_max - offset : INT_MAX);

sys/dev/wscons/wstpad.c

1666

tp->edge.center = input->hw.x_min + width / 2;

sys/dev/wscons/wstpad.c

1667

tp->edge.center_left = tp->edge.center - offset;

sys/dev/wscons/wstpad.c

1668

tp->edge.center_right = tp->edge.center + offset;

sys/dev/wscons/wstpad.c

193

} edge;

sys/dev/wscons/wstpad.c

405

if (x < tp->edge.left)

sys/dev/wscons/wstpad.c

407

else if (x >= tp->edge.right)

sys/dev/wscons/wstpad.c

409

if (y < tp->edge.bottom)

sys/dev/wscons/wstpad.c

411

else if (y >= tp->edge.top)

sys/dev/wscons/wstpad.c

595

if (y >= tp->edge.bottom)

sys/dev/wscons/wstpad.c

598

&& x >= tp->edge.center_left

sys/dev/wscons/wstpad.c

599

&& x < tp->edge.center_right)

sys/dev/wscons/wstpad.c

601

return ((x < tp->edge.center ? LEFTBTN : RIGHTBTN) ^ tp->sbtnswap);

sys/dev/wscons/wstpad.c

607

if (y < tp->edge.top)

sys/dev/wscons/wstpad.c

609

if (x < tp->edge.center_left)

sys/dev/wscons/wstpad.c

611

return (x > tp->edge.center_right

usr.bin/tmux/window.c

1411

u_int edge, left, right, end, size;

usr.bin/tmux/window.c

1425

edge = yoff;

usr.bin/tmux/window.c

1427

if (edge == 1)

usr.bin/tmux/window.c

1428

edge = w->sy + 1;

usr.bin/tmux/window.c

1430

if (edge == 0)

usr.bin/tmux/window.c

1431

edge = w->sy;

usr.bin/tmux/window.c

1433

if (edge == 0)

usr.bin/tmux/window.c

1434

edge = w->sy + 1;

usr.bin/tmux/window.c

1444

if (yoff + sy + 1 != edge)

usr.bin/tmux/window.c

1472

u_int edge, left, right, end, size;

usr.bin/tmux/window.c

1486

edge = yoff + sy + 1;

usr.bin/tmux/window.c

1488

if (edge >= w->sy)

usr.bin/tmux/window.c

1489

edge = 1;

usr.bin/tmux/window.c

1491

if (edge >= w->sy - 1)

usr.bin/tmux/window.c

1492

edge = 0;

usr.bin/tmux/window.c

1494

if (edge >= w->sy)

usr.bin/tmux/window.c

1495

edge = 0;

usr.bin/tmux/window.c

1505

if (yoff != edge)

usr.bin/tmux/window.c

1533

u_int edge, top, bottom, end, size;

usr.bin/tmux/window.c

1546

edge = xoff;

usr.bin/tmux/window.c

1547

if (edge == 0)

usr.bin/tmux/window.c

1548

edge = w->sx + 1;

usr.bin/tmux/window.c

1557

if (xoff + sx + 1 != edge)

usr.bin/tmux/window.c

1585

u_int edge, top, bottom, end, size;

usr.bin/tmux/window.c

1598

edge = xoff + sx + 1;

usr.bin/tmux/window.c

1599

if (edge >= w->sx)

usr.bin/tmux/window.c

1600

edge = 0;

usr.bin/tmux/window.c

1609

if (xoff != edge)

usr.bin/yacc/lalr.c

292

short *edge, *rp, **reads;

usr.bin/yacc/lalr.c

300

edge = NEW2(ngotos + 1, short);

usr.bin/yacc/lalr.c

321

edge[nedges++] = map_goto(stateno, symbol);

usr.bin/yacc/lalr.c

328

rp[j] = edge[j];

usr.bin/yacc/lalr.c

345

free(edge);

usr.bin/yacc/lalr.c

357

short *shortp, *edge, *states;

usr.bin/yacc/lalr.c

361

edge = NEW2(ngotos + 1, short);

usr.bin/yacc/lalr.c

397

edge[nedges++] = map_goto(stateno, *rp);

usr.bin/yacc/lalr.c

407

shortp[j] = edge[j];

usr.bin/yacc/lalr.c

421

free(edge);

usr.sbin/unbound/daemon/remote.c

1840

addrtree_traverse_visit_edge(struct addredge* edge, addrkey_t* addr,

usr.sbin/unbound/daemon/remote.c

1847

if(!edge || !edge->node)

usr.sbin/unbound/daemon/remote.c

1849

addrlen = edge->len;

usr.sbin/unbound/daemon/remote.c

1855

memcpy(addr, edge->str, n);

usr.sbin/unbound/daemon/remote.c

1856

addrtree_traverse_visit_node(edge->node, addr, addr_size, is_ipv6,

usr.sbin/unbound/daemon/remote.c

1873

addrtree_traverse_visit_edge(n->edge[0], addr, addr_size, is_ipv6,

usr.sbin/unbound/daemon/remote.c

1875

addrtree_traverse_visit_edge(n->edge[1], addr, addr_size, is_ipv6,

usr.sbin/unbound/edns-subnet/addrtree.c

101

node->edge[0] = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

102

node->edge[1] = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

219

int keep = node->edge[0] && node->edge[1];

usr.sbin/unbound/edns-subnet/addrtree.c

226

child_edge = node->edge[!node->edge[0]];

usr.sbin/unbound/edns-subnet/addrtree.c

231

parent_edge->parent_node->edge[index] = child_edge;

usr.sbin/unbound/edns-subnet/addrtree.c

252

children = (n->edge[0] != NULL) + (n->edge[1] != NULL);

usr.sbin/unbound/edns-subnet/addrtree.c

264

children = (p->edge[0] != NULL) + (p->edge[1] != NULL);

usr.sbin/unbound/edns-subnet/addrtree.c

366

struct addredge *edge;

usr.sbin/unbound/edns-subnet/addrtree.c

394

edge = node->edge[index];

usr.sbin/unbound/edns-subnet/addrtree.c

395

while (edge) {

usr.sbin/unbound/edns-subnet/addrtree.c

397

if (!edge->node->elem || edge->node->ttl >= now)

usr.sbin/unbound/edns-subnet/addrtree.c

399

purge_node(tree, edge->node);

usr.sbin/unbound/edns-subnet/addrtree.c

400

edge = node->edge[index];

usr.sbin/unbound/edns-subnet/addrtree.c

403

if (!edge) {

usr.sbin/unbound/edns-subnet/addrtree.c

419

common = bits_common(edge->str, edge->len, addr, sourcemask,

usr.sbin/unbound/edns-subnet/addrtree.c

421

if (common == edge->len) {

usr.sbin/unbound/edns-subnet/addrtree.c

426

depth = edge->len;

usr.sbin/unbound/edns-subnet/addrtree.c

427

node = edge->node;

usr.sbin/unbound/edns-subnet/addrtree.c

433

node->edge[index] = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

435

node->edge[index] = edge;

usr.sbin/unbound/edns-subnet/addrtree.c

443

index = getbit(edge->str, edge->len, common);

usr.sbin/unbound/edns-subnet/addrtree.c

444

newnode->edge[index] = edge;

usr.sbin/unbound/edns-subnet/addrtree.c

445

edge->parent_node = newnode;

usr.sbin/unbound/edns-subnet/addrtree.c

446

edge->parent_index = (int)index;

usr.sbin/unbound/edns-subnet/addrtree.c

482

struct addredge *edge = NULL;

usr.sbin/unbound/edns-subnet/addrtree.c

508

edge = node->edge[getbit(addr, sourcemask, depth)];

usr.sbin/unbound/edns-subnet/addrtree.c

509

if (!edge || !edge->node)

usr.sbin/unbound/edns-subnet/addrtree.c

511

if (edge->len > sourcemask )

usr.sbin/unbound/edns-subnet/addrtree.c

513

if (!issub(edge->str, edge->len, addr, sourcemask, depth))

usr.sbin/unbound/edns-subnet/addrtree.c

515

log_assert(depth < edge->len);

usr.sbin/unbound/edns-subnet/addrtree.c

516

depth = edge->len;

usr.sbin/unbound/edns-subnet/addrtree.c

517

node = edge->node;

usr.sbin/unbound/edns-subnet/addrtree.c

59

struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) );

usr.sbin/unbound/edns-subnet/addrtree.c

60

if (!edge)

usr.sbin/unbound/edns-subnet/addrtree.c

62

edge->node = node;

usr.sbin/unbound/edns-subnet/addrtree.c

63

edge->len = addrlen;

usr.sbin/unbound/edns-subnet/addrtree.c

64

edge->parent_index = parent_index;

usr.sbin/unbound/edns-subnet/addrtree.c

65

edge->parent_node = parent_node;

usr.sbin/unbound/edns-subnet/addrtree.c

68

edge->str = (addrkey_t *)calloc(n, sizeof (addrkey_t));

usr.sbin/unbound/edns-subnet/addrtree.c

69

if (!edge->str) {

usr.sbin/unbound/edns-subnet/addrtree.c

70

free(edge);

usr.sbin/unbound/edns-subnet/addrtree.c

73

memcpy(edge->str, addr, n * sizeof (addrkey_t));

usr.sbin/unbound/edns-subnet/addrtree.c

75

node->parent_edge = edge;

usr.sbin/unbound/edns-subnet/addrtree.c

76

log_assert(parent_node->edge[parent_index] == NULL);

usr.sbin/unbound/edns-subnet/addrtree.c

77

parent_node->edge[parent_index] = edge;

usr.sbin/unbound/edns-subnet/addrtree.c

78

return edge;

usr.sbin/unbound/edns-subnet/addrtree.h

103

struct addredge *edge[2];

usr.sbin/unbound/testcode/unitecs.c

101

childcount = (node->edge[0] != NULL) + (node->edge[1] != NULL);

usr.sbin/unbound/testcode/unitecs.c

105

edge = node->edge[i];

usr.sbin/unbound/testcode/unitecs.c

106

if (!edge) continue;

usr.sbin/unbound/testcode/unitecs.c

107

if (!edge->node) return 11;

usr.sbin/unbound/testcode/unitecs.c

108

if (!edge->str) return 12;

usr.sbin/unbound/testcode/unitecs.c

109

if (edge->len <= parent_edge->len) return 13;

usr.sbin/unbound/testcode/unitecs.c

111

parent_edge->len, edge->str, edge->len, 0))

usr.sbin/unbound/testcode/unitecs.c

113

if ((r = addrtree_inconsistent_subtree(tree, edge, depth+1)) != 0)

usr.sbin/unbound/testcode/unitecs.c

121

struct addredge* edge;

usr.sbin/unbound/testcode/unitecs.c

128

edge = tree->root->edge[i];

usr.sbin/unbound/testcode/unitecs.c

129

if (!edge) continue;

usr.sbin/unbound/testcode/unitecs.c

130

if (!edge->node) return 3;

usr.sbin/unbound/testcode/unitecs.c

131

if (!edge->str) return 4;

usr.sbin/unbound/testcode/unitecs.c

132

if ((r = addrtree_inconsistent_subtree(tree, edge, 1)) != 0)

usr.sbin/unbound/testcode/unitecs.c

97

struct addredge* edge;