Searched refs:l1 (Results 1 – 3 of 3) sorted by relevance
| /lib/ |
| A D | string.c | 753 size_t l1, l2; in strstr() local
758 l1 = strlen(s1); in strstr()
759 while (l1 >= l2) { in strstr()
760 l1--; in strstr()
|
| A D | bch.c | 593 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
599 l1 = bch->a_log_tab[poly->c[1]]; in find_poly_deg2_roots()
603 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()
620 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
622 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
|
| A D | btree.c | 102 static int longcmp(const unsigned long *l1, const unsigned long *l2, size_t n) in longcmp() argument
107 if (l1[i] < l2[i]) in longcmp()
109 if (l1[i] > l2[i]) in longcmp()
|
Completed in 12 milliseconds