Home
last modified time | relevance | path

Searched full:element (Results 1 – 25 of 2677) sorted by relevance

12345678910>>...108

/kernel/linux/linux-5.10/mm/
Dmempool.c25 static void poison_error(mempool_t *pool, void *element, size_t size, in poison_error() argument
33 pr_err("BUG: mempool element poison mismatch\n"); in poison_error()
35 pr_err(" nr=%d @ %p: %s0x", nr, element, start > 0 ? "... " : ""); in poison_error()
37 pr_cont("%x ", *(u8 *)(element + i)); in poison_error()
42 static void __check_element(mempool_t *pool, void *element, size_t size) in __check_element() argument
44 u8 *obj = element; in __check_element()
51 poison_error(pool, element, size, i); in __check_element()
58 static void check_element(mempool_t *pool, void *element) in check_element() argument
62 __check_element(pool, element, ksize(element)); in check_element()
66 void *addr = kmap_atomic((struct page *)element); in check_element()
[all …]
/kernel/linux/linux-4.19/mm/
Dmempool.c25 static void poison_error(mempool_t *pool, void *element, size_t size, in poison_error() argument
33 pr_err("BUG: mempool element poison mismatch\n"); in poison_error()
35 pr_err(" nr=%d @ %p: %s0x", nr, element, start > 0 ? "... " : ""); in poison_error()
37 pr_cont("%x ", *(u8 *)(element + i)); in poison_error()
42 static void __check_element(mempool_t *pool, void *element, size_t size) in __check_element() argument
44 u8 *obj = element; in __check_element()
51 poison_error(pool, element, size, i); in __check_element()
58 static void check_element(mempool_t *pool, void *element) in check_element() argument
62 __check_element(pool, element, ksize(element)); in check_element()
67 void *addr = kmap_atomic((struct page *)element); in check_element()
[all …]
/kernel/linux/linux-5.10/security/tomoyo/
Dgc.c33 …* tomoyo_struct_used_by_io_buffer - Check whether the list element is used by /sys/kernel/security…
35 * @element: Pointer to "struct list_head".
37 * Returns true if @element is used by /sys/kernel/security/tomoyo/ users,
40 static bool tomoyo_struct_used_by_io_buffer(const struct list_head *element) in tomoyo_struct_used_by_io_buffer() argument
50 if (head->r.domain == element || head->r.group == element || in tomoyo_struct_used_by_io_buffer()
51 head->r.acl == element || &head->w.domain->list == element) in tomoyo_struct_used_by_io_buffer()
105 * @element: Pointer to "struct list_head".
109 static inline void tomoyo_del_transition_control(struct list_head *element) in tomoyo_del_transition_control() argument
112 container_of(element, typeof(*ptr), head.list); in tomoyo_del_transition_control()
121 * @element: Pointer to "struct list_head".
[all …]
/kernel/linux/linux-4.19/security/tomoyo/
Dgc.c33 …* tomoyo_struct_used_by_io_buffer - Check whether the list element is used by /sys/kernel/security…
35 * @element: Pointer to "struct list_head".
37 * Returns true if @element is used by /sys/kernel/security/tomoyo/ users,
40 static bool tomoyo_struct_used_by_io_buffer(const struct list_head *element) in tomoyo_struct_used_by_io_buffer() argument
50 if (head->r.domain == element || head->r.group == element || in tomoyo_struct_used_by_io_buffer()
51 head->r.acl == element || &head->w.domain->list == element) in tomoyo_struct_used_by_io_buffer()
103 * @element: Pointer to "struct list_head".
107 static inline void tomoyo_del_transition_control(struct list_head *element) in tomoyo_del_transition_control() argument
110 container_of(element, typeof(*ptr), head.list); in tomoyo_del_transition_control()
118 * @element: Pointer to "struct list_head".
[all …]
/kernel/linux/linux-5.10/include/uapi/linux/
Dchio.h9 /* changer element types */
10 #define CHET_MT 0 /* media transport element (robot) */
11 #define CHET_ST 1 /* storage element (media slots) */
12 #define CHET_IE 2 /* import/export element */
13 #define CHET_DT 3 /* data transfer element (tape/cdrom/whatever) */
25 * query vendor-specific element types
27 * accessing elements works by specifing type and unit of the element.
33 int cp_curpicker; /* current transport element */
54 * move a medium from one element to another
57 int cm_fromtype; /* type/unit of source element */
[all …]
/kernel/linux/linux-4.19/include/uapi/linux/
Dchio.h6 /* changer element types */
7 #define CHET_MT 0 /* media transport element (robot) */
8 #define CHET_ST 1 /* storage element (media slots) */
9 #define CHET_IE 2 /* import/export element */
10 #define CHET_DT 3 /* data transfer element (tape/cdrom/whatever) */
22 * query vendor-specific element types
24 * accessing elements works by specifing type and unit of the element.
30 int cp_curpicker; /* current transport element */
51 * move a medium from one element to another
54 int cm_fromtype; /* type/unit of source element */
[all …]
/kernel/linux/linux-4.19/drivers/net/ethernet/mellanox/mlxsw/
Dcore_acl_flex_keys.c70 int element_to_block[MLXSW_AFK_ELEMENT_MAX]; /* index is element, value
99 DECLARE_BITMAP(element, MLXSW_AFK_ELEMENT_MAX);
106 enum mlxsw_afk_element element) in mlxsw_afk_picker_count_hits() argument
118 if (elinst->info->element == element) { in mlxsw_afk_picker_count_hits()
119 __set_bit(element, picker->hits[i].element); in mlxsw_afk_picker_count_hits()
134 memcpy(&hits_element, &picker->hits[block_index].element, in mlxsw_afk_picker_subtract_hits()
139 if (__test_and_clear_bit(j, picker->hits[i].element)) in mlxsw_afk_picker_subtract_hits()
166 enum mlxsw_afk_element element; in mlxsw_afk_picker_key_info_add() local
171 for_each_set_bit(element, picker->hits[block_index].element, in mlxsw_afk_picker_key_info_add()
173 key_info->element_to_block[element] = key_info->blocks_count; in mlxsw_afk_picker_key_info_add()
[all …]
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlxsw/
Dcore_acl_flex_keys.c13 * that will be used to store key/mask values. For each defined element type
68 elinfo = &mlxsw_afk_element_infos[elinst->element]; in mlxsw_afk_blocks_check()
108 int element_to_block[MLXSW_AFK_ELEMENT_MAX]; /* index is element, value
137 DECLARE_BITMAP(element, MLXSW_AFK_ELEMENT_MAX);
144 enum mlxsw_afk_element element) in mlxsw_afk_picker_count_hits() argument
156 if (elinst->element == element) { in mlxsw_afk_picker_count_hits()
157 __set_bit(element, picker->hits[i].element); in mlxsw_afk_picker_count_hits()
172 memcpy(&hits_element, &picker->hits[block_index].element, in mlxsw_afk_picker_subtract_hits()
177 if (__test_and_clear_bit(j, picker->hits[i].element)) in mlxsw_afk_picker_subtract_hits()
204 enum mlxsw_afk_element element; in mlxsw_afk_picker_key_info_add() local
[all …]
Dcore_acl_flex_keys.h47 enum mlxsw_afk_element element; /* element ID */ member
49 struct mlxsw_item item; /* element geometry in internal storage */
54 .element = MLXSW_AFK_ELEMENT_##_element, \
74 struct mlxsw_afk_element_inst { /* element instance in actual block */
75 enum mlxsw_afk_element element; member
77 struct mlxsw_item item; /* element geometry in block */
87 .element = MLXSW_AFK_ELEMENT_##_element, \
131 #define mlxsw_afk_element_usage_for_each(element, elusage) \ argument
132 for_each_set_bit(element, (elusage)->usage, MLXSW_AFK_ELEMENT_MAX)
136 enum mlxsw_afk_element element) in mlxsw_afk_element_usage_add() argument
[all …]
/kernel/linux/linux-5.10/drivers/gpu/drm/nouveau/include/nvif/
Dlist.h45 * We need one list head in bar and a list element in all list_of_foos (both are of
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
73 * works with the element itself.
144 * Insert a new element after the given list head. The new element does not
147 * head → some element → ...
149 * head → new element → older element → ...
155 * @param entry The new element to prepend to the list.
165 * Append a new element to the end of the list given with this list head.
168 * head → some element → ... → lastelement
[all …]
/kernel/linux/linux-4.19/drivers/gpu/drm/nouveau/include/nvif/
Dlist.h45 * We need one list head in bar and a list element in all list_of_foos (both are of
66 * Then we create the first element and add it to this list:
72 * Repeat the above for each element you want to add to the list. Deleting
73 * works with the element itself.
144 * Insert a new element after the given list head. The new element does not
147 * head → some element → ...
149 * head → new element → older element → ...
155 * @param entry The new element to prepend to the list.
165 * Append a new element to the end of the list given with this list head.
168 * head → some element → ... → lastelement
[all …]
/kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/icelake/
Dfloating-point.json16 … FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
23 …DD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element."
27 … FM(N)ADD/SUB. FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
34 …DD/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element."
38element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB HA…
45element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB HA…
49element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB HA…
56element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
60element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB HA…
67element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB MU…
[all …]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
Duttrack.c15 * element contains the caller's component, module name, function name, and
17 * acpi_ut_track_allocation to add an element to the list; deletion
258 * 2) Element was found. Returns Allocation parameter.
259 * 3) Element was not found. Returns position where it should be
262 * DESCRIPTION: Searches for an element in the global allocation tracking list.
263 * If the element is not found, returns the location within the
264 * list where the element should be inserted.
281 struct acpi_debug_mem_block *element; in acpi_ut_find_allocation() local
283 element = acpi_gbl_global_list->list_head; in acpi_ut_find_allocation()
284 if (!element) { in acpi_ut_find_allocation()
[all …]
/kernel/linux/linux-4.19/drivers/acpi/acpica/
Duttrack.c15 * element contains the caller's component, module name, function name, and
17 * acpi_ut_track_allocation to add an element to the list; deletion
258 * 2) Element was found. Returns Allocation parameter.
259 * 3) Element was not found. Returns position where it should be
262 * DESCRIPTION: Searches for an element in the global allocation tracking list.
263 * If the element is not found, returns the location within the
264 * list where the element should be inserted.
281 struct acpi_debug_mem_block *element; in acpi_ut_find_allocation() local
283 element = acpi_gbl_global_list->list_head; in acpi_ut_find_allocation()
284 if (!element) { in acpi_ut_find_allocation()
[all …]
/kernel/linux/linux-5.10/scripts/
Dasn1_compiler.c414 /* Can be a directive, type name or element in tokenise()
432 * it's an element name in tokenise()
681 struct element { struct
686 struct element *children; argument
687 struct element *next; argument
688 struct element *render_next; argument
689 struct element *list_next; argument
708 struct element *element; argument
798 static struct element *parse_type(struct token **_cursor, struct token *stop,
819 type->element = parse_type(&cursor, type[1].name, NULL); in parse()
[all …]
/kernel/linux/linux-4.19/scripts/
Dasn1_compiler.c418 /* Can be a directive, type name or element in tokenise()
436 * it's an element name in tokenise()
685 struct element { struct
690 struct element *children; argument
691 struct element *next; argument
692 struct element *render_next; argument
693 struct element *list_next; argument
712 struct element *element; argument
802 static struct element *parse_type(struct token **_cursor, struct token *stop,
823 type->element = parse_type(&cursor, type[1].name, NULL); in parse()
[all …]
/kernel/linux/linux-5.10/include/linux/soc/ti/
Dk3-ringacc.h29 * stores credentials with each message, requiring the element size to be
43 * RA ring element's sizes in bytes.
63 * @elm_size: Ring element size
197 * k3_ringacc_ring_push - push element to the ring tail
199 * @elem: pointer on ring element buffer
201 * Push one ring element to the ring tail. Size of the ring element is
209 * k3_ringacc_ring_pop - pop element from the ring head
211 * @elem: pointer on ring element buffer
213 * Push one ring element from the ring head. Size of the ring element is
221 * k3_ringacc_ring_push_head - push element to the ring head
[all …]
/kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/base/circbuf/src/
Dcircbuf.c26 * @brief Read the oldest element from the circular buffer.
27 * Read the oldest element WITHOUT checking whehter the
28 * circular buffer is empty or not. The oldest element is
33 * @return the oldest element.
45 * @param chunk_src The position at which the first element in the chunk is.
46 * @param chunk_dest The position to which the first element in the chunk would be shift.
53 * @brief Get the "val" field in the element.
55 * @param elem The pointer to the element.
114 /* read an element from the buffer */ in ia_css_circbuf_pop()
137 * Step 1: When the target element is at the "start" position. in ia_css_circbuf_extract()
[all …]
/kernel/linux/linux-5.10/lib/
Dlru_cache.c92 struct lc_element **element = NULL; in lc_create() local
110 element = kcalloc(e_count, sizeof(struct lc_element *), GFP_KERNEL); in lc_create()
111 if (!element) in lc_create()
129 lc->lc_element = element; in lc_create()
143 element[i] = e; in lc_create()
150 void *p = element[i]; in lc_create()
155 kfree(element); in lc_create()
270 * lc_find - find element by label, if present in the hash table
272 * @enr: element number
274 * Returns the pointer to an element, if the element with the requested
[all …]
/kernel/linux/linux-4.19/lib/
Dlru_cache.c104 struct lc_element **element = NULL; in lc_create() local
122 element = kcalloc(e_count, sizeof(struct lc_element *), GFP_KERNEL); in lc_create()
123 if (!element) in lc_create()
141 lc->lc_element = element; in lc_create()
155 element[i] = e; in lc_create()
162 void *p = element[i]; in lc_create()
167 kfree(element); in lc_create()
282 * lc_find - find element by label, if present in the hash table
284 * @enr: element number
286 * Returns the pointer to an element, if the element with the requested
[all …]
/kernel/linux/linux-5.10/Documentation/mhi/
Dmhi.rst95 [Read Pointer (RP)] ----------->[Ring Element] } TD
96 [Write Pointer (WP)]- [Ring Element]
97 - [Ring Element]
98 --------->[Ring Element]
99 [Ring Element]
108 * RP indicates the next element to be serviced by the device.
109 * When the host has a new buffer to send, it updates the ring element with
110 buffer information, increments the WP to the next element and rings the
122 [Read Pointer (RP)] ----------->[Ring Element] } ED
123 [Write Pointer (WP)]- [Ring Element]
[all …]
/kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/cascadelakex/
Dfloating-point.json3 …D/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
12element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
21element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB MU…
30element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
39 …D/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
48element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
68element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB HA…
77element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB MU…
/kernel/linux/linux-5.10/tools/perf/pmu-events/arch/x86/skylakex/
Dfloating-point.json3element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB HA…
12element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB MU…
21 …D/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
30element. Applies to SSE* and AVX* packed double precision floating-point instructions: ADD SUB MU…
39element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
48element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
68 …D/SUB. DPP and FM(N)ADD/SUB instructions count twice as they perform 2 calculations per element.",
77element. Applies to SSE* and AVX* packed single precision floating-point instructions: ADD SUB MU…
/kernel/linux/linux-4.19/fs/xfs/
Dxfs_mru_cache.c12 * supplies an element lifetime in milliseconds and a group count, as well as a
23 * period in time. When the first element is added, time zero for the data
28 * If an element is accessed at any point, it is removed from its list and
32 * have elapsed since the first element was added. The reason for this is that
38 * (t + t/g) seconds, where t is the inactive element lifetime and g is the
50 * introduces a granularity to element lifetimes, so there's no point storing an
51 * individual timeout with each element that specifies a more precise reap time.
52 * The bonus is a saving of sizeof(long) bytes of memory per element stored.
57 * removing an element would involve walking large portions of the entire list,
61 * When an element is touched or deleted, it needs to be removed from its
[all …]
/kernel/linux/linux-5.10/fs/xfs/
Dxfs_mru_cache.c12 * supplies an element lifetime in milliseconds and a group count, as well as a
23 * period in time. When the first element is added, time zero for the data
28 * If an element is accessed at any point, it is removed from its list and
32 * have elapsed since the first element was added. The reason for this is that
38 * (t + t/g) seconds, where t is the inactive element lifetime and g is the
50 * introduces a granularity to element lifetimes, so there's no point storing an
51 * individual timeout with each element that specifies a more precise reap time.
52 * The bonus is a saving of sizeof(long) bytes of memory per element stored.
57 * removing an element would involve walking large portions of the entire list,
61 * When an element is touched or deleted, it needs to be removed from its
[all …]

12345678910>>...108