Home
last modified time | relevance | path

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

/lib/
A Dstring.c753 size_t l1, l2; in strstr() local
755 l2 = strlen(s2); in strstr()
756 if (!l2) in strstr()
759 while (l1 >= l2) { in strstr()
761 if (!memcmp(s1, s2, l2)) in strstr()
779 size_t l2; in strnstr() local
781 l2 = strlen(s2); in strnstr()
782 if (!l2) in strnstr()
784 while (len >= l2) { in strnstr()
786 if (!memcmp(s1, s2, l2)) in strnstr()
A Dbch.c593 int n = 0, i, l0, l1, l2; in find_poly_deg2_roots() local
600 l2 = bch->a_log_tab[poly->c[2]]; in find_poly_deg2_roots()
603 u = a_pow(bch, l0+l2+2*(GF_N(bch)-l1)); in find_poly_deg2_roots()
621 bch->a_log_tab[r]+l2); in find_poly_deg2_roots()
623 bch->a_log_tab[r^1]+l2); in find_poly_deg2_roots()
A Dbtree.c102 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 9 milliseconds