Home
last modified time | relevance | path

Searched full:members (Results 1 – 25 of 1463) sorted by relevance

12345678910>>...59

/kernel/linux/linux-6.6/include/linux/
Dstddef.h39 * @MEMBERS: The member declarations for the mirrored structs
45 * struct members.
47 #define struct_group(NAME, MEMBERS...) \ argument
48 __struct_group(/* no tag */, NAME, /* no attrs */, MEMBERS)
55 * @MEMBERS: The member declarations for the mirrored structs
61 * struct members. Includes structure attributes argument.
63 #define struct_group_attr(NAME, ATTRS, MEMBERS...) \ argument
64 __struct_group(/* no tag */, NAME, ATTRS, MEMBERS)
71 * @MEMBERS: The member declarations for the mirrored structs
77 * struct members. Includes struct tag argument for the named copy,
[all …]
/kernel/linux/linux-5.10/include/linux/
Dstddef.h43 * @MEMBERS: The member declarations for the mirrored structs
49 * struct members.
51 #define struct_group(NAME, MEMBERS...) \ argument
52 __struct_group(/* no tag */, NAME, /* no attrs */, MEMBERS)
59 * @MEMBERS: The member declarations for the mirrored structs
65 * struct members. Includes structure attributes argument.
67 #define struct_group_attr(NAME, ATTRS, MEMBERS...) \ argument
68 __struct_group(/* no tag */, NAME, ATTRS, MEMBERS)
75 * @MEMBERS: The member declarations for the mirrored structs
81 * struct members. Includes struct tag argument for the named copy,
[all …]
/kernel/linux/linux-6.6/tools/include/uapi/linux/
Dstddef.h24 * @MEMBERS: The member declarations for the mirrored structs
27 * and size: one anonymous and one named. The former's members can be used
29 * reason about the start, end, and size of the group of struct members.
33 #define __struct_group(TAG, NAME, ATTRS, MEMBERS...) \ argument
35 struct { MEMBERS } ATTRS; \
36 struct __struct_group_tag(TAG) { MEMBERS } ATTRS NAME; \
/kernel/linux/linux-5.10/include/uapi/linux/
Dstddef.h17 * @MEMBERS: The member declarations for the mirrored structs
20 * and size: one anonymous and one named. The former's members can be used
22 * reason about the start, end, and size of the group of struct members.
26 #define __struct_group(TAG, NAME, ATTRS, MEMBERS...) \ argument
28 struct { MEMBERS } ATTRS; \
29 struct TAG { MEMBERS } ATTRS NAME; \
Dsignalfd.h45 * pad size when you add new members. We use a fixed
48 * members. We use fixed size members because this strcture
/kernel/linux/linux-6.6/include/uapi/linux/
Dstddef.h24 * @MEMBERS: The member declarations for the mirrored structs
27 * and size: one anonymous and one named. The former's members can be used
29 * reason about the start, end, and size of the group of struct members.
33 #define __struct_group(TAG, NAME, ATTRS, MEMBERS...) \ argument
35 struct { MEMBERS } ATTRS; \
36 struct __struct_group_tag(TAG) { MEMBERS } ATTRS NAME; \
Dsignalfd.h45 * pad size when you add new members. We use a fixed
48 * members. We use fixed size members because this strcture
/kernel/linux/linux-6.6/net/netfilter/ipset/
Dip_set_list_set.c45 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_rcu(e, &map->members, list) { in list_set_kadd()
102 list_for_each_entry_rcu(e, &map->members, list) { in list_set_kdel()
179 list_for_each_entry_safe(e, n, &map->members, list) in set_cleanup_entries()
194 list_for_each_entry_rcu(e, &map->members, list) { in list_set_utest()
208 ret = !list_is_last(&e->list, &map->members) && in list_set_utest()
246 list_for_each_entry_rcu(e, &map->members, list) { in list_set_uadd()
280 n = list_empty(&map->members) ? NULL : in list_set_uadd()
281 list_last_entry(&map->members, struct set_elem, list); in list_set_uadd()
[all …]
Dip_set_bitmap_port.c33 unsigned long *members; /* the set members */ member
37 size_t memsize; /* members size */
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()
234 map->members = bitmap_zalloc(map->elements, GFP_KERNEL | __GFP_NOWARN); in init_map_port()
235 if (!map->members) in init_map_port()
Dip_set_bitmap_ipmac.c45 unsigned long *members; /* the set members */ member
49 size_t memsize; /* members size */
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()
Dip_set_bitmap_ip.c40 unsigned long *members; /* the set members */ member
45 size_t memsize; /* members size */
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()
220 map->members = bitmap_zalloc(elements, GFP_KERNEL | __GFP_NOWARN); in init_map_ip()
221 if (!map->members) in init_map_ip()
Dip_set_bitmap_gen.h52 if (test_bit(id, map->members)) in mtype_ext_cleanup()
63 ip_set_free(map->members); in mtype_destroy()
76 bitmap_zero(map->members, map->elements); in mtype_flush()
142 set_bit(e->id, map->members); in mtype_add()
166 set_bit(e->id, map->members); in mtype_add()
220 if (!test_bit(id, map->members) || in mtype_list()
278 clear_bit(id, map->members); in mtype_gc()
/kernel/linux/linux-5.10/net/netfilter/ipset/
Dip_set_list_set.c45 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 …]
Dip_set_bitmap_port.c33 unsigned long *members; /* the set members */ member
37 size_t memsize; /* members size */
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()
234 map->members = bitmap_zalloc(map->elements, GFP_KERNEL | __GFP_NOWARN); in init_map_port()
235 if (!map->members) in init_map_port()
Dip_set_bitmap_ipmac.c45 unsigned long *members; /* the set members */ member
49 size_t memsize; /* members size */
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()
Dip_set_bitmap_ip.c40 unsigned long *members; /* the set members */ member
45 size_t memsize; /* members size */
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()
Dip_set_bitmap_gen.h52 if (test_bit(id, map->members)) in mtype_ext_cleanup()
63 ip_set_free(map->members); in mtype_destroy()
76 bitmap_zero(map->members, map->elements); in mtype_flush()
142 set_bit(e->id, map->members); in mtype_add()
166 set_bit(e->id, map->members); in mtype_add()
220 if (!test_bit(id, map->members) || in mtype_list()
278 clear_bit(id, map->members); in mtype_gc()
/kernel/linux/linux-6.6/Documentation/netlink/specs/
Dovs_flow.yaml17 members:
27 members:
39 members:
53 members:
61 members:
88 members:
120 members:
144 members:
156 members:
168 members:
[all …]
/kernel/linux/linux-5.10/drivers/isdn/mISDN/
Ddsp_cmx.c14 * There is a chain of struct dsp_conf which has one or more members in a chain
34 * Two members will also exchange their data so they are crossconnected.
35 * Three or more members will be added in a conference and will hear each
39 * - Crossconnecting or even conference, if more than two members are together.
40 * - Force mixing of transmit data with other crossconnect/conference members.
135 * by using conference even with two members
503 /* conf gets updated (all members) */ in dsp_cmx_hardware()
509 printk(KERN_ERR "%s: conference without members\n", in dsp_cmx_hardware()
516 /* check all members in our conference */ in dsp_cmx_hardware()
647 /* determine if members are on the same hfc chip */ in dsp_cmx_hardware()
[all …]
/kernel/linux/linux-6.6/drivers/isdn/mISDN/
Ddsp_cmx.c14 * There is a chain of struct dsp_conf which has one or more members in a chain
34 * Two members will also exchange their data so they are crossconnected.
35 * Three or more members will be added in a conference and will hear each
39 * - Crossconnecting or even conference, if more than two members are together.
40 * - Force mixing of transmit data with other crossconnect/conference members.
135 * by using conference even with two members
492 /* conf gets updated (all members) */ in dsp_cmx_hardware()
498 printk(KERN_ERR "%s: conference without members\n", in dsp_cmx_hardware()
505 /* check all members in our conference */ in dsp_cmx_hardware()
636 /* determine if members are on the same hfc chip */ in dsp_cmx_hardware()
[all …]
/kernel/linux/linux-6.6/net/tipc/
Dmonitor.c51 * @up_map: bit map indicating which of the members the sender considers up
52 * @members: identity of the domain members
60 u32 members[MAX_MON_DOMAIN]; member
69 * @applied: number of reported domain members applied on this monitor list
141 return (offsetof(struct tipc_mon_domain, members)) + (mcnt * sizeof(u32)); in dom_rec_len()
209 /* mon_identify_lost_members() : - identify amd mark potentially lost members
256 /* Scan across domain members and match against monitor list */ in mon_apply_domain()
260 addr = dom->members[i]; in mon_apply_domain()
290 diff |= dom->members[i] != peer->addr; in mon_update_local_domain()
291 dom->members[i] = peer->addr; in mon_update_local_domain()
[all …]
/kernel/linux/linux-5.10/net/tipc/
Dmonitor.c51 * @up_map: bit map indicating which of the members the sender considers up
52 * @members: identity of the domain members
60 u32 members[MAX_MON_DOMAIN]; member
69 * @applied: number of reported domain members applied on this monitor list
111 return ((void *)&dom->members - (void *)dom) + (mcnt * sizeof(u32)); in dom_rec_len()
179 /* mon_identify_lost_members() : - identify amd mark potentially lost members
226 /* Scan across domain members and match against monitor list */ in mon_apply_domain()
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()
[all …]
/kernel/linux/linux-5.10/Documentation/block/
Drequest.rst14 2.0 Struct request members classification
16 2.1 struct request members explanation
25 Short explanation of request members
37 this member. Some members may contain D classifications, but should only be
/kernel/linux/linux-6.6/Documentation/admin-guide/device-mapper/
Dswitch.rst20 consists of a number of distinct storage arrays ("members") each having
22 is created it is spread across multiple members. The details of the
25 how many members are being used. When iSCSI sessions are created, each
39 members forward it as necessary, but there is a performance advantage to
58 non-preferred priority group containing paths to other array members for
/kernel/linux/linux-5.10/Documentation/admin-guide/device-mapper/
Dswitch.rst20 consists of a number of distinct storage arrays ("members") each having
22 is created it is spread across multiple members. The details of the
25 how many members are being used. When iSCSI sessions are created, each
39 members forward it as necessary, but there is a performance advantage to
58 non-preferred priority group containing paths to other array members for

12345678910>>...59