Home
last modified time | relevance | path

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

/lib/lwip/lwip/src/netif/ppp/
A Dpppoe.c786 l1 = strlen(sc->sc_service_name); in pppoe_send_padi()
787 len += l1; in pppoe_send_padi()
810 PPPOE_ADD_16(p, l1); in pppoe_send_padi()
812 p += l1; in pppoe_send_padi()
1002 size_t l1 = 0; /* XXX: gcc */ in pppoe_send_padr() local
1009 len += l1; in pppoe_send_padr()
1027 PPPOE_ADD_16(p, l1); in pppoe_send_padr()
1029 p += l1; in pppoe_send_padr()
1129 len += l1; in pppoe_send_pads()
1140 PPPOE_ADD_16(p, l1); in pppoe_send_pads()
[all …]
/lib/
A Dstring.c695 size_t l1, l2; in strnstr() local
697 l1 = strnlen(s1, len); in strnstr()
700 for (; l1 >= l2; --l1, ++s1) { in strnstr()
A Dbch.c612 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
618 l1 = bch->a_log_tab[poly->c[1]]; in find_poly_deg2_roots()
622 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()
639 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
641 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()

Completed in 14 milliseconds