Lines Matching refs:n1
20 const ebitmap_node_t *n1, *n2;
25 n1 = e1->node;
28 while (n1 || n2) {
34 if (n1 && n2 && n1->startbit == n2->startbit) {
35 new->startbit = n1->startbit;
36 new->map = n1->map | n2->map;
37 n1 = n1->next;
39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) {
40 new->startbit = n1->startbit;
41 new->map = n1->map;
42 n1 = n1->next;
76 const ebitmap_node_t *n1, *n2;
81 n1 = e1->node;
83 while (n1 && n2) {
84 if (n1->startbit == n2->startbit) {
85 if (n1->map & n2->map) {
91 new->startbit = n1->startbit;
92 new->map = n1->map & n2->map;
102 n1 = n1->next;
104 } else if (n1->startbit > n2->startbit) {
107 n1 = n1->next;
119 const ebitmap_node_t *n1, *n2;
126 n1 = e1->node;
128 while (n1 || n2) {
129 if (n1 && n2 && n1->startbit == n2->startbit) {
130 startbit = n1->startbit;
131 map = n1->map ^ n2->map;
132 n1 = n1->next;
134 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) {
135 startbit = n1->startbit;
136 map = n1->map;
137 n1 = n1->next;
259 const ebitmap_node_t *n1, *n2;
264 n1 = e1->node;
266 while (n1 && n2 &&
267 (n1->startbit == n2->startbit) && (n1->map == n2->map)) {
268 n1 = n1->next;
272 if (n1 || n2)
309 const ebitmap_node_t *n1, *n2;
314 n1 = e1->node;
316 while (n1 && n2 && (n1->startbit <= n2->startbit)) {
317 if (n1->startbit < n2->startbit) {
318 n1 = n1->next;
321 if ((n1->map & n2->map) != n2->map)
324 n1 = n1->next;
336 const ebitmap_node_t *n1 = e1->node;
339 while (n1 && n2) {
340 if (n1->startbit < n2->startbit) {
341 n1 = n1->next;
342 } else if (n2->startbit < n1->startbit) {
345 if (n1->map & n2->map) {
348 n1 = n1->next;