Lines Matching refs:i
66 int i, j; in lists_are_different() local
77 for (i = 0; i < acnt; i++) { in lists_are_different()
81 &a->sl_addr[i], &b->sl_addr[j])) { in lists_are_different()
99 int i; in list_has_addr() local
106 for (i = 0; i < a->sl_numsrc; i++) { in list_has_addr()
107 if (IN6_ARE_ADDR_EQUAL(&a->sl_addr[i], addr)) in list_has_addr()
122 int i, j; in l_intersection() local
132 for (i = 0; i < a->sl_numsrc; i++) { in l_intersection()
135 &a->sl_addr[i], &b->sl_addr[j])) { in l_intersection()
137 a->sl_addr[i]; in l_intersection()
152 int i, j; in l_difference() local
168 for (i = 0; i < a->sl_numsrc; i++) { in l_difference()
171 &a->sl_addr[i], &b->sl_addr[j])) { in l_difference()
177 target->sl_addr[target->sl_numsrc++] = a->sl_addr[i]; in l_difference()
193 int i, mvsize; in l_remove() local
200 for (i = 0; i < a->sl_numsrc; i++) { in l_remove()
201 if (IN6_ARE_ADDR_EQUAL(&a->sl_addr[i], addr)) { in l_remove()
203 mvsize = (a->sl_numsrc - i) * sizeof (in6_addr_t); in l_remove()
204 (void) memmove(&a->sl_addr[i], &a->sl_addr[i + 1], in l_remove()
268 int i, j; in l_union_in_a() local
279 for (i = 0; i < b->sl_numsrc; i++) { in l_union_in_a()
283 &b->sl_addr[i], &a->sl_addr[j])) { in l_union_in_a()
293 a->sl_addr[a->sl_numsrc++] = b->sl_addr[i]; in l_union_in_a()
309 int i, j, shift; in l_intersection_in_a() local
321 for (i = 0; i < a->sl_numsrc; i++) { in l_intersection_in_a()
325 &a->sl_addr[i], &b->sl_addr[j])) { in l_intersection_in_a()
333 a->sl_addr[i - shift] = a->sl_addr[i]; in l_intersection_in_a()
349 int i, j, shift; in l_difference_in_a() local
359 for (i = 0; i < a->sl_numsrc; i++) { in l_difference_in_a()
363 &a->sl_addr[i], &b->sl_addr[j])) { in l_difference_in_a()
371 a->sl_addr[i - shift] = a->sl_addr[i]; in l_difference_in_a()