/linux/include/linux/ |
H A D | stddef.h | 39 * @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 80 struct_group_tagged(TAG,NAME,MEMBERS...) global() argument 107 TRAILING_OVERLAP(TYPE,NAME,FAM,MEMBERS) global() argument [all...] |
/linux/tools/include/uapi/linux/ |
H A D | stddef.h | 24 * @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; \
|
/linux/include/uapi/linux/ |
H A D | stddef.h | 24 * @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; \
|
H A D | signalfd.h | 45 * pad size when you add new members. We use a fixed 48 * members. We use fixed size members because this strcture
|
/linux/Documentation/netlink/specs/ |
H A D | tc.yaml | 17 members: 79 members: 115 members: 138 members: 151 members: 159 members: 186 members: 209 members: 269 members: 289 members [all...] |
H A D | ovs_flow.yaml | 17 members: 27 members: 39 members: 53 members: 61 members: 88 members: 120 members: 145 members: 157 members: 169 members [all...] |
H A D | rt-link.yaml | 71 members: 78 members: 103 members: 115 members: 131 members: 207 members: 286 members: 598 members: 608 members: 625 members [all...] |
H A D | rt-rule.yaml | 15 members: 26 members: 74 members: 84 members:
|
H A D | rt-neigh.yaml | 15 members: 41 members: 103 members: 119 members: 150 members:
|
H A D | ovs_datapath.yaml | 15 members: 40 members: 56 members:
|
/linux/Documentation/kbuild/ |
H A D | gendwarfksyms.rst | 234 members. In this situation, it's possible to append new members to the 236 members remains unchanged. 238 To append new members, we can hide them from symbol versioning as 239 described in section :ref:`Hiding members <hiding_members>`, but we can't 259 /* Unchanged original members */ 263 /* Appended new members */ 310 Adding structure members 321 reserved space in data structures and hiding members that don't change 324 Reserving space and replacing members argument 363 hiding_membersReserving space and replacing members global() argument 365 Hiding membersAdding structure members global() argument [all...] |
/linux/net/netfilter/ipset/ |
H A D | ip_set_bitmap_port.c | 33 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()
|
H A D | ip_set_bitmap_ipmac.c | 45 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 in init_map_ipmac() [all...] |
H A D | ip_set_bitmap_ip.c | 40 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()
|
H A D | ip_set_bitmap_gen.h | 54 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()
|
/linux/Documentation/driver-api/cxl/platform/example-configurations/ |
H A D | flexible.rst | 47 Interleave Members (2^n) : 01 62 Interleave Members (2^n) : 00 76 Interleave Members (2^n) : 00 90 Interleave Members (2^n) : 00 104 Interleave Members (2^n) : 00 118 Interleave Members (2^n) : 00 132 Interleave Members (2^n) : 00
|
/linux/include/linux/sched/ |
H A D | sd_flags.h | 85 * Domain members have different CPU capacities 94 * Domain members have different CPU capacities spanning all unique CPU 104 * Domain members share CPU capacity (i.e. SMT) 113 * Domain members share CPU cluster (LLC tags or L2 cache) 120 * Domain members share CPU Last Level Caches
|
/linux/scripts/ |
H A D | kernel-doc.pl | 619 print ".SH Members\n"; 957 print $lineprefix . "**Members**\n\n"; 1047 my $members; 1049 # For capturing struct/union definition body, i.e. "{members*}qualifiers*" 1057 $members = $3; 1061 $members = $2; 1064 if ($members) { 1070 # ignore members marked private: 1071 $members =~ s/\/\*\s*private:.*?\/\*\s*public:.*?\*\///gosi; 1072 $members [all...] |
/linux/net/tipc/ |
H A D | monitor.c | 51 * @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[ in mon_update_local_domain() [all...] |
H A D | group.c | 81 struct rb_root members; member 128 /* Limit simultaneous reception from other members */ in tipc_group_rcvbuf_limit() 133 /* Reserve blocks for active and idle members */ in tipc_group_rcvbuf_limit() 179 grp->members = RB_ROOT; in tipc_group_create() 199 struct rb_root *tree = &grp->members; in tipc_group_join() 214 struct rb_root *tree = &grp->members; in tipc_group_delete() 235 struct rb_node *n = grp->members.rb_node; in tipc_group_find_member() 269 for (n = rb_first(&grp->members); n; n = rb_next(n)) { in tipc_group_find_node() 284 n = &grp->members.rb_node; in tipc_group_add_to_tree() 298 rb_insert_color(&m->tree_node, &grp->members); in tipc_group_add_to_tree() [all...] |
/linux/Documentation/process/ |
H A D | code-of-conduct-interpretation.rst | 125 Committee. The exact members receiving these emails at any given time 126 are listed at https://kernel.org/code-of-conduct.html. Members can not 130 The Code of Conduct Committee consists of volunteer community members 149 in the scope of the ban by two-thirds of the members voting for the 151 measures. Any Code of Conduct Committee members serving on the TAB will 187 and community members who are observers of unacceptable behaviors. The 233 the ban by two-thirds of the members voting for the measures, the Code of 236 administrators. Any Code of Conduct Committee members serving on the TAB
|
/linux/scripts/lib/kdoc/ |
H A D | kdoc_parser.py | 542 members = None 550 members = r.group(3) 557 members = r.group(2) 559 if not members: 588 # __struct_group(TAG, NAME, ATTRS, MEMBERS...) 589 # which has variants like: struct_group(NAME, MEMBERS...) 590 # Only MEMBERS arguments require documentation. 594 # 1. drop struct group arguments that aren't at MEMBERS, 595 # storing them as STRUCT_GROUP(MEMBERS) 653 members [all...] |
/linux/Documentation/admin-guide/device-mapper/ |
H A D | switch.rst | 20 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
|
/linux/security/tomoyo/ |
H A D | gc.c | 103 * tomoyo_del_transition_control - Delete members in "struct tomoyo_transition_control". 119 * tomoyo_del_aggregator - Delete members in "struct tomoyo_aggregator". 135 * tomoyo_del_manager - Delete members in "struct tomoyo_manager". 150 * tomoyo_del_acl - Delete members in "struct tomoyo_acl_info". 243 * tomoyo_del_domain - Delete members in "struct tomoyo_domain_info". 271 * tomoyo_del_condition - Delete members in "struct tomoyo_condition". 311 * tomoyo_del_name - Delete members in "struct tomoyo_name". 323 * tomoyo_del_path_group - Delete members in "struct tomoyo_path_group". 353 * tomoyo_del_address_group - Delete members in "struct tomoyo_address_group". 365 * tomoyo_del_number_group - Delete members i [all...] |
/linux/Documentation/kernel-hacking/ |
H A D | false-sharing.rst | 65 members could be purposely put in the same cache line to make them 79 * data members of a big data structure randomly sitting together 128 pahole's decoding to locate the exact data members. For global 152 * Reorganize the data structure, separate the interfering members to 154 sharing of other members. 201 line sharing among data members.
|