Symbol: const_val
lib/libpcap/optimize.c
1010
s->k = vmap[v].const_val;
lib/libpcap/optimize.c
505
bpf_int32 const_val;
lib/libpcap/optimize.c
539
vmap[val].const_val = v0;
lib/libpcap/optimize.c
567
a = vmap[v0].const_val;
lib/libpcap/optimize.c
568
b = vmap[v1].const_val;
lib/libpcap/optimize.c
748
b->s.k += vmap[val].const_val;
lib/libpcap/optimize.c
805
bpf_int32 v = vmap[val].const_val;
lib/libpcap/optimize.c
863
s->k += vmap[v].const_val;
lib/libpcap/optimize.c
896
s->k = -vmap[val[A_ATOM]].const_val;
lib/libpcap/optimize.c
951
s->k = vmap[val[X_ATOM]].const_val;
lib/libpcap/optimize.c
966
&& vmap[val[A_ATOM]].const_val == 0) {
lib/libpcap/optimize.c
996
s->k = vmap[v].const_val;
usr.sbin/dhcpd/tree.c
105
nt->data.const_val.data = d;
usr.sbin/dhcpd/tree.c
106
nt->data.const_val.len = len;
usr.sbin/dhcpd/tree.c
130
buf = calloc(1, left->data.const_val.len
usr.sbin/dhcpd/tree.c
131
+ right->data.const_val.len);
usr.sbin/dhcpd/tree.c
135
memcpy(buf, left->data.const_val.data,
usr.sbin/dhcpd/tree.c
136
left->data.const_val.len);
usr.sbin/dhcpd/tree.c
137
memcpy(buf + left->data.const_val.len,
usr.sbin/dhcpd/tree.c
138
right->data.const_val.data, right->data.const_val.len);
usr.sbin/dhcpd/tree.c
139
free(left->data.const_val.data);
usr.sbin/dhcpd/tree.c
140
free(right->data.const_val.data);
usr.sbin/dhcpd/tree.c
141
left->data.const_val.data = buf;
usr.sbin/dhcpd/tree.c
142
left->data.const_val.len += right->data.const_val.len;
usr.sbin/dhcpd/tree.c
164
if (tree->data.const_val.len > limit)
usr.sbin/dhcpd/tree.c
165
tree->data.const_val.len = limit;
usr.sbin/dhcpd/tree.c
255
do_data_copy(bufix, bufp, bufcount, tree->data.const_val.data,
usr.sbin/dhcpd/tree.c
256
tree->data.const_val.len);
usr.sbin/dhcpd/tree.h
68
} const_val;