HomeSort by: relevance | last modified time | path
    Searched refs:jt (Results 1 - 25 of 43) sorted by relevancy

1 2

  /src/external/bsd/ntp/dist/libntp/
caltontp.c 39 const struct calendar *jt
45 if (NULL == jt) {
50 if ( (jt->month > 13) /* permit month 0..13! */
51 || (jt->monthday > 32)
52 || (jt->yearday > 366)
53 || (jt->hour > 24)
54 || (jt->minute > MINSPERHR)
55 || (jt->second > SECSPERMIN))
64 if (jt->yearday)
65 eraday = ntpcal_year_to_ystart(jt->year
    [all...]
caljulian.c 26 struct calendar * jt
33 INSIST(NULL != jt);
42 ntpcal_daysplit_to_date(jt, &split, DAY_NTP_STARTS);
  /src/external/bsd/libpcap/dist/
bpf_dump.c 46 insn->jt, insn->jf, insn->k);
53 insn->code, insn->jt, insn->jf, insn->k);
bpf_filter.c 246 pc += (A > pc->k) ? pc->jt : pc->jf;
250 pc += (A >= pc->k) ? pc->jt : pc->jf;
254 pc += (A == pc->k) ? pc->jt : pc->jf;
258 pc += (A & pc->k) ? pc->jt : pc->jf;
262 pc += (A > X) ? pc->jt : pc->jf;
266 pc += (A >= X) ? pc->jt : pc->jf;
270 pc += (A == X) ? pc->jt : pc->jf;
274 pc += (A & X) ? pc->jt : pc->jf;
514 if (from + p->jt >= (u_int)len || from + p->jf >= (u_int)len)
rpcap-protocol.h 336 uint8 jt; /* relative offset to jump to in case of 'true' */ member in struct:rpcap_filterbpf_insn
optimize.c 392 if (JT(b)) {
393 find_levels_r(opt_state, ic, JT(b));
395 level = MAX(JT(b)->level, JF(b)->level) + 1;
451 if (JT(b) == 0)
453 SET_INTERSECT(JT(b)->dom, b->dom, opt_state->nodewords);
524 if (JT(b) == 0)
526 SET_UNION(JT(b)->closure, b->closure, opt_state->nodewords);
706 p->out_use |= JT(p)->in_use | JF(p)->in_use;
888 struct block *tmp = JT(b);
890 JT(b) = JF(b)
2771 int jt, jf; local
    [all...]
gencode.h 226 struct slist *jt; /* only for relative jump in block */ member in struct:stmt
279 u_int longjt; /* jt branch requires long jump */
284 struct edge et; /* edge corresponding to the jt branch */
419 #define JT(b) ((b)->et.succ)
gencode.c 938 * which of the jt and jf fields has been resolved and which is a pointer
949 next = JT(list);
950 JT(list) = target;
961 * which of jt and jf is the link.
970 p = !((*p)->sense) ? &JT(*p) : &JF(*p);
2569 sjeq_avs_cookie->s.jt = s2;
2876 sjset_data_frame_1->s.jt = sjset_data_frame_2 = new_stmt(cstate, JMP(BPF_JSET));
2886 sjset_data_frame_2->s.jt = snext;
2897 sjset_qos->s.jt = s2 = new_stmt(cstate, BPF_LD|BPF_MEM);
2950 sjset_radiotap_flags_present->s.jt = sjset_radiotap_ext_present
    [all...]
bpf_image.c 421 "(%03d) %-8s %-16s jt %d\tjf %d",
422 n, op, operand, n + 1 + p->jt, n + 1 + p->jf);
  /src/external/bsd/tcpdump/dist/
bpf_dump.c 47 insn->jt, insn->jf, insn->k);
54 insn->code, insn->jt, insn->jf, insn->k);
  /src/external/bsd/libpcap/dist/pcap/
bpf.h 248 u_char jt; member in struct:bpf_insn
270 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
  /src/sys/dev/nor/
cfi.c 795 const struct cfi_jedec_tab *jt = cfi_jedec_search(cfi); local
796 if (jt != NULL) {
799 cfi_jedec_fill(cfi, jt);
813 const struct cfi_jedec_tab *jt = &cfi_jedec_tab[i]; local
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/external/bsd/ipf/bin/ipftest/
bpf_filter.c 356 pc += (A > pc->k) ? pc->jt : pc->jf;
360 pc += (A >= pc->k) ? pc->jt : pc->jf;
364 pc += (A == pc->k) ? pc->jt : pc->jf;
368 pc += (A & pc->k) ? pc->jt : pc->jf;
372 pc += (A > X) ? pc->jt : pc->jf;
376 pc += (A >= X) ? pc->jt : pc->jf;
380 pc += (A == X) ? pc->jt : pc->jf;
384 pc += (A & X) ? pc->jt : pc->jf;
579 if (from + p->jt >= len || from + p->jf >= len)
bpf-ipf.h 407 u_char jt; member in struct:bpf_insn
416 #define BPF_JUMP(code, k, jt, jf) { (u_short)(code), jt, jf, k }
  /src/external/bsd/dhcpcd/dist/src/
bpf.c 69 (insn)->jt = 0; \
76 (insn)->jt = (t); \
363 uint8_t jt, jf; local
386 jt = (uint8_t)njmps;
389 jt = 0;
409 htonl(mac32), jt, jf);
416 htons(mac16), jt, jf);
422 *hwaddr, jt, jf);
424 if (jt)
425 jt = (uint8_t)(jt - 2)
    [all...]
  /src/sys/net/
bpf_filter.c 440 pc += (A > pc->k) ? pc->jt : pc->jf;
444 pc += (A >= pc->k) ? pc->jt : pc->jf;
448 pc += (A == pc->k) ? pc->jt : pc->jf;
452 pc += (A & pc->k) ? pc->jt : pc->jf;
456 pc += (A > X) ? pc->jt : pc->jf;
460 pc += (A >= X) ? pc->jt : pc->jf;
464 pc += (A == X) ? pc->jt : pc->jf;
468 pc += (A & X) ? pc->jt : pc->jf;
769 if (from + p->jt >= len || from + p->jf >= len)
776 mem[from + p->jt] |= invalid
    [all...]
bpfjit.c 172 * jtf[0] - when coming from jt path,
1288 uint32_t jt, jf; local
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
    [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 }
  /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
240 insn->jt = insn->jf;
241 insn->jf = jt;
425 const uint8_t jt = ver ? 0 : JUMP_MAGIC; local
445 BPF_JUMP(BPF_JMP+BPF_JEQ+BPF_K, ver, jt, jf),
479 const uint8_t jt = type ? 0 : JUMP_MAGIC local
    [all...]
  /src/external/bsd/ntp/dist/ntpd/
refclock_tsyncpci.c 394 struct calendar jt; local
631 jt.year = TimeContext.timeObj.year;
632 jt.yearday = 1;
633 jt.monthday = 1;
634 jt.month = 1;
635 jt.hour = 0;
636 jt.minute = 0;
637 jt.second = 0;
638 pp->yearstart = caltontp(&jt);
  /src/external/cddl/dtracetoolkit/dist/Bin/
rwtop 77 while getopts Cchn:p:jt:Z name
  /src/external/cddl/dtracetoolkit/dist/
rwtop 77 while getopts Cchn:p:jt:Z name
  /src/external/bsd/file/dist/src/
is_json.c 434 int jt; local
442 if ((jt = json_parse(&uc, ue, st, 0)) == 0)
449 jt == 1 ? "json" : "x-ndjson") == -1)
454 jt == 1 ? "" : "New Line Delimited ") == -1)
  /src/external/bsd/wpa/dist/src/drivers/
driver_nl80211_monitor.c 300 if (insn->jt == PASS)
301 insn->jt = msock_filter.len - idx - 2;
302 else if (insn->jt == FAIL)
303 insn->jt = msock_filter.len - idx - 3;
  /src/external/gpl3/gcc.old/dist/libphobos/src/std/internal/test/
dummyrange.d 502 foreach (jt; it)
504 assert(it[idx] == jt);

Completed in 102 milliseconds

1 2