Lines Matching defs:len
55 #define MINDEX(len, m, k) \
57 len = M_LEN(m); \
58 while (k >= len) { \
59 k -= len; \
63 len = M_LEN(m); \
73 int len;
78 MINDEX(len, m, k);
80 if (len >= k + 4) {
85 if (m0 == 0 || M_LEN(m0) + len - k < 4) {
86 DTRACE_PROBE3(mblk_xword_fail, mblk_t *, m0, int, len, int, k);
91 switch (len - k) {
107 int len;
112 MINDEX(len, m, k);
114 if (len >= k + 2) {
120 DTRACE_PROBE3(mblk_xhalf_fail, mblk_t *, m0, int, len, int, k);
216 int len;
221 MINDEX(len, m, k);
282 int len;
287 MINDEX(len, m, k);
302 int len;
307 MINDEX(len, m, k);
472 bpf_validate(struct bpf_insn *f, int len)
477 if (len < 1 || len > BPF_MAXINSNS)
480 for (i = 0; i < len; ++i) {
544 * We know that len is <= BPF_MAXINSNS, and we
551 if (from + p->k < from || from + p->k >= len)
558 if (from + p->jt >= len || from + p->jf >= len)
574 return (BPF_CLASS(f[len - 1].code) == BPF_RET);