Home
last modified time | relevance | path

Searched refs:ef (Results 1 – 3 of 3) sorted by relevance

/mOS-networking-stack/core/src/
H A Dtcp_rb.c670 struct _tcpfrag_t *ef, *nef; in tcprb_pwrite() local
688 for (ef = fnext; in tcprb_pwrite()
689 ef && ef->empty && ef->head < f->tail + len - uoff; in tcprb_pwrite()
690 ef = nef) { in tcprb_pwrite()
691 nef = TAILQ_NEXT(ef, link); in tcprb_pwrite()
696 ef->head = f->tail + len - uoff; in tcprb_pwrite()
721 ef && ef->empty && ef->tail < f->head; in tcprb_pwrite()
722 ef = nef) { in tcprb_pwrite()
723 nef = TAILQ_PREV(ef, flist, link); in tcprb_pwrite()
725 if (ef->head <= f->head) { in tcprb_pwrite()
[all …]
/mOS-networking-stack/core/src/include/bpf/
H A Dgencode.h247 struct edge ef; member
344 #define JF(b) ((b)->ef.succ)
/mOS-networking-stack/core/src/bpf/
H A Dsf_optimize.c313 SET_INTERSECT(ep->succ->ef.edom, ep->edom, edgewords);
334 memset(root->ef.edom, 0, edgewords * sizeof(*(uset) 0));
340 propedom(&b->ef);
1347 b->ef.code = -b->s.code;
1704 opt_j(&p->ef);
1745 link_inedge(&b->ef, JF(b));
1890 b0->s.k == b1->s.k && b0->et.succ == b1->et.succ && b0->ef.succ == b1->ef.succ)
2095 b->ef.edom = p;
2099 b->ef.id = n_blocks + i;
2100 edges[n_blocks + i] = &b->ef;
[all …]