Searched refs:n2 (Results 1 – 2 of 2) sorted by relevance
24 struct ebitmap_node *n1, *n2; in ebitmap_cmp() local30 n2 = e2->node; in ebitmap_cmp()31 while ( n1 && n2 && (n1->startbit == n2->startbit) && in ebitmap_cmp()35 n2 = n2->next; in ebitmap_cmp()38 if ( n1 || n2 ) in ebitmap_cmp()76 struct ebitmap_node *n1, *n2; in ebitmap_contains() local83 n2 = e2->node; in ebitmap_contains()84 while ( n1 && n2 && (n1->startbit <= n2->startbit) ) in ebitmap_contains()93 if ( (n1->maps[i] & n2->maps[i]) != n2->maps[i] ) in ebitmap_contains()98 n2 = n2->next; in ebitmap_contains()[all …]
29 and n2 = Store.Path.get_node root2 path in30 match n1, n2 with31 | Some n1, Some n2 ->32 not (Perms.equiv (Store.Node.get_perms n1) (Store.Node.get_perms n2)) || acc
Completed in 3 milliseconds