| /src/sys/dev/nor/ |
| cfi.c | 795 const struct cfi_jedec_tab *jt = cfi_jedec_search(cfi); local in function:cfi_emulate
796 if (jt != NULL) {
799 cfi_jedec_fill(cfi, jt);
813 const struct cfi_jedec_tab *jt = &cfi_jedec_tab[i]; local in function:cfi_jedec_search
814 if ((jt->jt_mid == idp->id_mid) &&
815 (jt->jt_did == idp->id_did[0])) {
816 return jt;
826 cfi_jedec_fill(struct cfi *cfi, const struct cfi_jedec_tab *jt)
829 cfi->cfi_name = jt->jt_name;
833 qryp->id_pri = jt->jt_id_pri
[all...] |
| /src/usr.sbin/npf/npfctl/ |
| npf_bpf_comp.c | 93 * the jt and jf continuations in the first pass, and then, once
229 if (insn->jt == JUMP_MAGIC) {
230 insn->jt = fail_off;
239 uint8_t jt = insn->jt; local in function:fixup_jumps
240 insn->jt = insn->jf;
241 insn->jf = jt;
425 const uint8_t jt = ver ? 0 : JUMP_MAGIC; local in function:fetch_l3
445 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, ver, jt, jf),
479 const uint8_t jt = type ? 0 : JUMP_MAGIC local in function:fetch_ether_type
[all...] |
| /src/sys/net/ |
| bpfjit.c | 172 * jtf[0] - when coming from jt path,
1288 uint32_t jt, jf; local in function:optimize_pass1
1423 jt = jf = insns[i].k;
1425 jt = insns[i].jt;
1429 if (jt >= insn_count - (i + 1) ||
1434 if (jt > 0 && jf > 0)
1437 jt += i + 1;
1443 SLIST_INSERT_HEAD(&insn_dat[jt].bjumps,
1446 if (jf != jt) {
1715 uint32_t jt, jf; local in function:generate_insn_code
[all...] |
| bpf.h | 336 u_char jt; member in struct:bpf_insn
355 #define BPF_JUMP(code, k, jt, jf) { (uint16_t)(code), jt, jf, k }
|
