Lines Matching defs:len
107 #define MINDEX(len, _m, _k) \
109 len = M_LEN(m); \
110 while ((_k) >= len) { \
111 (_k) -= len; \
115 len = M_LEN(m); \
124 register int len;
128 MINDEX(len, m, k);
130 if (len - k >= 4) {
135 if (m0 == NULL || M_LEN(m0) + len - k < 4)
139 switch (len - k) {
160 register int len;
164 MINDEX(len, m, k);
166 if (len - k >= 2) {
199 int len;
260 MINDEX(len, n, k);
307 MINDEX(len, n, k);
320 MINDEX(len, n, k);
481 bpf_validate(f, len)
483 int len;
488 if (len == 0)
491 if (len < 1 || len > BPF_MAXINSNS)
494 for (i = 0; i < len; ++i) {
565 * We know that len is <= BPF_MAXINSNS, and we
572 if (from + p->k < from || from + p->k >= len)
579 if (from + p->jt >= len || from + p->jf >= len)
594 return BPF_CLASS(f[len - 1].code) == BPF_RET;