Searched refs:l1 (Results 1 – 3 of 3) sorted by relevance
| /lib/ |
| D | string.c | 945 size_t l1, l2; in strstr() local
950 l1 = strlen(s1); in strstr()
951 while (l1 >= l2) { in strstr()
952 l1--; in strstr()
|
| D | bch.c | 573 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
579 l1 = bch->a_log_tab[poly->c[1]]; in find_poly_deg2_roots()
583 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()
600 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
602 roots[n++] = modulo(bch, 2*GF_N(bch)-l1- in find_poly_deg2_roots()
|
| D | btree.c | 103 static int longcmp(const unsigned long *l1, const unsigned long *l2, size_t n) in longcmp() argument
108 if (l1[i] < l2[i]) in longcmp()
110 if (l1[i] > l2[i]) in longcmp()
|