Searched refs:members (Results 1 – 8 of 8) sorted by relevance
| /net/netfilter/ipset/ |
| D | ip_set_list_set.c | 45 struct list_head members; /* the set members */ member
63 list_for_each_entry_rcu(e, &map->members, list) { in list_set_ktest()
82 list_for_each_entry(e, &map->members, list) { in list_set_kadd()
102 list_for_each_entry(e, &map->members, list) { in list_set_kdel()
179 list_for_each_entry_safe(e, n, &map->members, list) in set_cleanup_entries()
193 list_for_each_entry(e, &map->members, list) { in list_set_utest()
206 ret = !list_is_last(&e->list, &map->members) && in list_set_utest()
242 list_for_each_entry(e, &map->members, list) { in list_set_uadd()
276 n = list_empty(&map->members) ? NULL : in list_set_uadd()
277 list_last_entry(&map->members, struct set_elem, list); in list_set_uadd()
[all …]
|
| D | ip_set_bitmap_ipmac.c | 45 unsigned long *members; /* the set members */ member
88 if (!test_bit(e->id, map->members)) in bitmap_ipmac_do_test()
102 if (!test_bit(id, map->members)) in bitmap_ipmac_gc_test()
149 if (test_bit(e->id, map->members)) { in bitmap_ipmac_do_add()
155 clear_bit(e->id, map->members); in bitmap_ipmac_do_add()
164 clear_bit(e->id, map->members); in bitmap_ipmac_do_add()
184 return !test_and_clear_bit(e->id, map->members); in bitmap_ipmac_do_del()
302 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ipmac()
303 if (!map->members) in init_map_ipmac()
|
| D | ip_set_bitmap_port.c | 33 unsigned long *members; /* the set members */ member
61 return !!test_bit(e->id, map->members); in bitmap_port_do_test()
67 return !!test_bit(id, map->members); in bitmap_port_gc_test()
74 return !!test_bit(e->id, map->members); in bitmap_port_do_add()
81 return !test_and_clear_bit(e->id, map->members); in bitmap_port_do_del()
207 map->members = bitmap_zalloc(map->elements, GFP_KERNEL | __GFP_NOWARN); in init_map_port()
208 if (!map->members) in init_map_port()
|
| D | ip_set_bitmap_gen.h | 51 if (test_bit(id, map->members)) in mtype_ext_cleanup()
65 ip_set_free(map->members); in mtype_destroy()
78 bitmap_zero(map->members, map->elements); in mtype_flush()
144 set_bit(e->id, map->members); in mtype_add()
168 set_bit(e->id, map->members); in mtype_add()
222 if (!test_bit(id, map->members) || in mtype_list()
280 clear_bit(id, map->members); in mtype_gc()
|
| D | ip_set_bitmap_ip.c | 40 unsigned long *members; /* the set members */ member
70 return !!test_bit(e->id, map->members); in bitmap_ip_do_test()
76 return !!test_bit(id, map->members); in bitmap_ip_gc_test()
83 return !!test_bit(e->id, map->members); in bitmap_ip_do_add()
89 return !test_and_clear_bit(e->id, map->members); in bitmap_ip_do_del()
223 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ip()
224 if (!map->members) in init_map_ip()
|
| D | ip_set_core.c | 252 void *members = NULL; in ip_set_alloc() local
255 members = kzalloc(size, GFP_KERNEL | __GFP_NOWARN); in ip_set_alloc()
257 if (members) { in ip_set_alloc()
258 pr_debug("%p: allocated with kmalloc\n", members); in ip_set_alloc()
259 return members; in ip_set_alloc()
262 members = vzalloc(size); in ip_set_alloc()
263 if (!members) in ip_set_alloc()
265 pr_debug("%p: allocated with vmalloc\n", members); in ip_set_alloc()
267 return members; in ip_set_alloc()
272 ip_set_free(void *members) in ip_set_free() argument
[all …]
|
| /net/tipc/ |
| D | monitor.c | 60 u32 members[MAX_MON_DOMAIN]; member
111 return ((void *)&dom->members - (void *)dom) + (mcnt * sizeof(u32)); in dom_rec_len()
230 addr = dom->members[i]; in mon_apply_domain()
260 diff |= dom->members[i] != peer->addr; in mon_update_local_domain()
261 dom->members[i] = peer->addr; in mon_update_local_domain()
263 cache->members[i] = htonl(peer->addr); in mon_update_local_domain()
514 dom->members[i] = ntohl(arrv_dom->members[i]); in tipc_mon_rcv()
740 dom->member_cnt * sizeof(u32), &dom->members)) in __tipc_nl_add_monitor_peer()
|
| D | group.c | 80 struct rb_root members; member
178 grp->members = RB_ROOT; in tipc_group_create()
198 struct rb_root *tree = &grp->members; in tipc_group_join()
213 struct rb_root *tree = &grp->members; in tipc_group_delete()
234 struct rb_node *n = grp->members.rb_node; in tipc_group_find_member()
268 for (n = rb_first(&grp->members); n; n = rb_next(n)) { in tipc_group_find_node()
283 n = &grp->members.rb_node; in tipc_group_add_to_tree()
297 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree()
333 rb_erase(&m->tree_node, &grp->members); in tipc_group_delete_member()
395 for (n = rb_first(&grp->members); n; n = rb_next(n)) { in tipc_group_update_bc_members()
|