Home
last modified time | relevance | path

Searched refs:node (Results 76 - 100 of 6932) sorted by relevance

12345678910>>...278

/kernel/linux/linux-5.10/drivers/gpu/drm/selftests/
H A Dtest-drm_mm.c70 pr_err("Hole follows node, expected none!\n"); in assert_no_holes()
109 struct drm_mm_node *node, *check, *found; in assert_continuous() local
118 drm_mm_for_each_node(node, mm) { in assert_continuous()
119 if (node->start != addr) { in assert_continuous()
120 pr_err("node[%ld] list out of order, expected %llx found %llx\n", in assert_continuous()
121 n, addr, node->start); in assert_continuous()
125 if (node->size != size) { in assert_continuous()
126 pr_err("node[%ld].size incorrect, expected %llx, found %llx\n", in assert_continuous()
127 n, size, node->size); in assert_continuous()
131 if (drm_mm_hole_follows(node)) { in assert_continuous()
158 misalignment(struct drm_mm_node *node, u64 alignment) misalignment() argument
169 assert_node(struct drm_mm_node *node, struct drm_mm *mm, u64 size, u64 alignment, unsigned long color) assert_node() argument
300 set_node(struct drm_mm_node *node, u64 start, u64 size) set_node() argument
308 expect_reserve_fail(struct drm_mm *mm, struct drm_mm_node *node) expect_reserve_fail() argument
376 struct drm_mm_node tmp, *nodes, *node, *next; __igt_reserve() local
526 expect_insert(struct drm_mm *mm, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, const struct insert_mode *mode) expect_insert() argument
574 struct drm_mm_node *nodes, *node, *next; __igt_insert() local
763 expect_insert_in_range(struct drm_mm *mm, struct drm_mm_node *node, u64 size, u64 alignment, unsigned long color, u64 range_start, u64 range_end, const struct insert_mode *mode) expect_insert_in_range() argument
821 struct drm_mm_node *node; assert_contiguous_in_range() local
881 struct drm_mm_node *nodes, *node, *next; __igt_insert_range() local
1087 struct drm_mm_node *nodes, *node, *next; igt_frag() local
1158 struct drm_mm_node *nodes, *node, *next; igt_align() local
1210 struct drm_mm_node *node, *next; igt_align_pot() local
1300 struct drm_mm_node node; global() member
1334 struct drm_mm_node *node; evict_nodes() local
1358 struct drm_mm_node *node; evict_nothing() local
1525 struct drm_mm_node *node, *next; igt_evict() local
1638 struct drm_mm_node *node, *next; igt_evict_range() local
1725 node_index(const struct drm_mm_node *node) node_index() argument
1738 struct drm_mm_node *nodes, *node, *next; igt_topdown() local
1852 struct drm_mm_node *nodes, *node, *next; igt_bottomup() local
1947 struct drm_mm_node rsvd_lo, rsvd_hi, node; __igt_once() local
2004 separate_adjacent_colors(const struct drm_mm_node *node, unsigned long color, u64 *start, u64 *end) separate_adjacent_colors() argument
2017 colors_abutt(const struct drm_mm_node *node) colors_abutt() argument
2037 struct drm_mm_node *node, *nn; igt_color() local
2266 struct drm_mm_node *node, *next; igt_color_evict() local
2369 struct drm_mm_node *node, *next; igt_color_evict_range() local
[all...]
/kernel/linux/linux-5.10/drivers/acpi/acpica/
H A Ddsargs.c23 acpi_ds_execute_arguments(struct acpi_namespace_node *node,
31 * PARAMETERS: node - Object NS node
32 * scope_node - Parent NS node
43 acpi_ds_execute_arguments(struct acpi_namespace_node *node, in acpi_ds_execute_arguments() argument
62 op->common.node = scope_node; in acpi_ds_execute_arguments()
82 walk_state->deferred_node = node; in acpi_ds_execute_arguments()
93 op->common.node = node; in acpi_ds_execute_arguments()
103 op->common.node in acpi_ds_execute_arguments()
149 struct acpi_namespace_node *node; acpi_ds_get_buffer_field_arguments() local
194 struct acpi_namespace_node *node; acpi_ds_get_bank_field_arguments() local
244 struct acpi_namespace_node *node; acpi_ds_get_buffer_arguments() local
288 struct acpi_namespace_node *node; acpi_ds_get_package_arguments() local
334 struct acpi_namespace_node *node; acpi_ds_get_region_arguments() local
[all...]
/kernel/linux/linux-6.6/drivers/acpi/acpica/
H A Ddsargs.c23 acpi_ds_execute_arguments(struct acpi_namespace_node *node,
31 * PARAMETERS: node - Object NS node
32 * scope_node - Parent NS node
43 acpi_ds_execute_arguments(struct acpi_namespace_node *node, in acpi_ds_execute_arguments() argument
62 op->common.node = scope_node; in acpi_ds_execute_arguments()
82 walk_state->deferred_node = node; in acpi_ds_execute_arguments()
93 op->common.node = node; in acpi_ds_execute_arguments()
103 op->common.node in acpi_ds_execute_arguments()
149 struct acpi_namespace_node *node; acpi_ds_get_buffer_field_arguments() local
194 struct acpi_namespace_node *node; acpi_ds_get_bank_field_arguments() local
244 struct acpi_namespace_node *node; acpi_ds_get_buffer_arguments() local
288 struct acpi_namespace_node *node; acpi_ds_get_package_arguments() local
334 struct acpi_namespace_node *node; acpi_ds_get_region_arguments() local
[all...]
/kernel/linux/linux-6.6/kernel/trace/
H A Drethook.c24 struct llist_node *node; in rethook_flush_task() local
26 node = __llist_del_all(&tk->rethooks); in rethook_flush_task()
27 while (node) { in rethook_flush_task()
28 rhn = container_of(node, struct rethook_node, llist); in rethook_flush_task()
29 node = node->next; in rethook_flush_task()
40 struct freelist_node *node; in rethook_free_rcu() local
43 node = rh->pool.head; in rethook_free_rcu()
44 while (node) { in rethook_free_rcu()
45 rhn = container_of(node, struc in rethook_free_rcu()
126 rethook_add_node(struct rethook *rh, struct rethook_node *node) rethook_add_node() argument
135 struct rethook_node *node = container_of(head, struct rethook_node, rcu); free_rethook_node_rcu() local
149 rethook_recycle(struct rethook_node *node) rethook_recycle() argument
207 rethook_hook(struct rethook_node *node, struct pt_regs *regs, bool mcount) rethook_hook() argument
219 struct llist_node *node = *cur; __rethook_find_ret_addr() local
292 struct llist_node *first, *node = NULL; rethook_trampoline_handler() local
[all...]
/kernel/linux/linux-5.10/lib/
H A Dtimerqueue.c21 * @node: timer node to be added
23 * Adds the timer node to the timerqueue, sorted by the node's expires
27 bool timerqueue_add(struct timerqueue_head *head, struct timerqueue_node *node) in timerqueue_add() argument
35 WARN_ON_ONCE(!RB_EMPTY_NODE(&node->node)); in timerqueue_add()
39 ptr = rb_entry(parent, struct timerqueue_node, node); in timerqueue_add()
40 if (node->expires < ptr->expires) { in timerqueue_add()
47 rb_link_node(&node in timerqueue_add()
63 timerqueue_del(struct timerqueue_head *head, struct timerqueue_node *node) timerqueue_del() argument
83 timerqueue_iterate_next(struct timerqueue_node *node) timerqueue_iterate_next() argument
[all...]
H A Drbtree.c18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
92 * Loop invariant: node is red. in __rb_insert()
96 * The inserted node is root. Either this is the in __rb_insert()
97 * first node, or we recursed at Case 1 below and in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
119 * Case 1 - node' in __rb_insert()
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; ____rb_erase_color() local
424 dummy_propagate(struct rb_node *node, struct rb_node *stop) dummy_propagate() argument
434 rb_insert_color(struct rb_node *node, struct rb_root *root) rb_insert_color() argument
440 rb_erase(struct rb_node *node, struct rb_root *root) rb_erase() argument
456 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) __rb_insert_augmented() argument
492 rb_next(const struct rb_node *node) rb_next() argument
524 rb_prev(const struct rb_node *node) rb_prev() argument
592 rb_left_deepest_node(const struct rb_node *node) rb_left_deepest_node() argument
604 rb_next_postorder(const struct rb_node *node) rb_next_postorder() argument
[all...]
/kernel/linux/linux-5.10/drivers/block/drbd/
H A Ddrbd_interval.c7 * interval_end - return end of @node
10 sector_t interval_end(struct rb_node *node) in interval_end() argument
12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); in interval_end()
16 #define NODE_END(node) ((node)->sector + ((node)->size >> 9))
62 * Returns if the tree contains the node @interval with start sector @start.
71 struct rb_node *node = root->rb_node; in drbd_contains_interval() local
73 while (node) { in drbd_contains_interval()
75 rb_entry(node, struc in drbd_contains_interval()
114 struct rb_node *node = root->rb_node; drbd_find_overlap() local
145 struct rb_node *node; drbd_next_overlap() local
[all...]
/kernel/linux/linux-6.6/drivers/block/drbd/
H A Ddrbd_interval.c7 * interval_end - return end of @node
10 sector_t interval_end(struct rb_node *node) in interval_end() argument
12 struct drbd_interval *this = rb_entry(node, struct drbd_interval, rb); in interval_end()
16 #define NODE_END(node) ((node)->sector + ((node)->size >> 9))
63 * Returns if the tree contains the node @interval with start sector @start.
72 struct rb_node *node = root->rb_node; in drbd_contains_interval() local
74 while (node) { in drbd_contains_interval()
76 rb_entry(node, struc in drbd_contains_interval()
120 struct rb_node *node = root->rb_node; drbd_find_overlap() local
151 struct rb_node *node; drbd_next_overlap() local
[all...]
/kernel/linux/linux-6.6/drivers/scsi/elx/libefc/
H A Defc_els.h17 struct efc_node *node; member
33 efc_els_io_alloc(struct efc_node *node, u32 reqlen);
35 efc_els_io_alloc_size(struct efc_node *node, u32 reqlen, u32 rsplen);
39 typedef void (*els_cb_t)(struct efc_node *node,
42 efc_send_plogi(struct efc_node *node);
44 efc_send_flogi(struct efc_node *node);
46 efc_send_fdisc(struct efc_node *node);
48 efc_send_prli(struct efc_node *node);
50 efc_send_prlo(struct efc_node *node);
52 efc_send_logo(struct efc_node *node);
[all...]
/kernel/linux/linux-5.10/drivers/acpi/arm64/
H A Diort.c47 * @iort_node: IORT table node associated with the IOMMU
48 * @fwnode: fwnode associated with the IORT node
75 * iort_get_fwnode() - Retrieve fwnode associated with an IORT node
77 * @node: IORT table node to be looked-up
82 struct acpi_iort_node *node) in iort_get_fwnode()
89 if (curr->iort_node == node) { in iort_get_fwnode()
100 * iort_delete_fwnode() - Delete fwnode associated with an IORT node
102 * @node: IORT table node associate
81 iort_get_fwnode( struct acpi_iort_node *node) iort_get_fwnode() argument
104 iort_delete_fwnode(struct acpi_iort_node *node) iort_delete_fwnode() argument
260 iort_match_node_callback(struct acpi_iort_node *node, void *context) iort_match_node_callback() argument
369 iort_node_get_id(struct acpi_iort_node *node, u32 *id_out, int index) iort_node_get_id() argument
405 iort_get_id_mapping_index(struct acpi_iort_node *node) iort_get_id_mapping_index() argument
446 iort_node_map_id(struct acpi_iort_node *node, u32 id_in, u32 *id_out, u8 type_mask) iort_node_map_id() argument
512 iort_node_map_platform_id( struct acpi_iort_node *node, u32 *id_out, u8 type_mask, int index) iort_node_map_platform_id() argument
544 struct acpi_iort_node *node; iort_find_dev_node() local
577 struct acpi_iort_node *node; iort_msi_map_id() local
598 struct acpi_iort_node *node; iort_pmsi_get_dev_id() local
651 struct acpi_iort_node *node; iort_dev_find_its_id() local
697 iort_set_device_domain(struct device *dev, struct acpi_iort_node *node) iort_set_device_domain() argument
749 struct acpi_iort_node *node, *msi_parent = NULL; iort_get_platform_device_domain() local
915 iort_pci_rc_supports_ats(struct acpi_iort_node *node) iort_pci_rc_supports_ats() argument
923 iort_iommu_xlate(struct device *dev, struct acpi_iort_node *node, u32 streamid) iort_iommu_xlate() argument
954 struct acpi_iort_node *node; global() member
968 iort_named_component_init(struct device *dev, struct acpi_iort_node *node) iort_named_component_init() argument
982 iort_nc_iommu_map(struct device *dev, struct acpi_iort_node *node) iort_nc_iommu_map() argument
1001 iort_nc_iommu_map_id(struct device *dev, struct acpi_iort_node *node, const u32 *in_id) iort_nc_iommu_map_id() argument
1028 struct acpi_iort_node *node; iort_iommu_configure_id() local
1100 struct acpi_iort_node *node; nc_dma_get_range() local
1123 struct acpi_iort_node *node; rc_dma_get_range() local
1179 arm_smmu_v3_count_resources(struct acpi_iort_node *node) arm_smmu_v3_count_resources() argument
1233 arm_smmu_v3_init_resources(struct resource *res, struct acpi_iort_node *node) arm_smmu_v3_init_resources() argument
1277 arm_smmu_v3_dma_configure(struct device *dev, struct acpi_iort_node *node) arm_smmu_v3_dma_configure() argument
1300 arm_smmu_v3_set_proximity(struct device *dev, struct acpi_iort_node *node) arm_smmu_v3_set_proximity() argument
1323 arm_smmu_count_resources(struct acpi_iort_node *node) arm_smmu_count_resources() argument
1341 arm_smmu_init_resources(struct resource *res, struct acpi_iort_node *node) arm_smmu_init_resources() argument
1375 arm_smmu_dma_configure(struct device *dev, struct acpi_iort_node *node) arm_smmu_dma_configure() argument
1394 arm_smmu_v3_pmcg_count_resources(struct acpi_iort_node *node) arm_smmu_v3_pmcg_count_resources() argument
1408 arm_smmu_v3_pmcg_init_resources(struct resource *res, struct acpi_iort_node *node) arm_smmu_v3_pmcg_init_resources() argument
1495 iort_get_dev_cfg( struct acpi_iort_node *node) iort_get_dev_cfg() argument
1517 iort_add_platform_device(struct acpi_iort_node *node, const struct iort_dev_config *ops) iort_add_platform_device() argument
1715 struct acpi_iort_node *node, *end; acpi_iort_dma_get_max_cpu_address() local
[all...]
/kernel/linux/linux-5.10/tools/lib/
H A Drbtree.c18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
92 * Loop invariant: node is red. in __rb_insert()
96 * The inserted node is root. Either this is the in __rb_insert()
97 * first node, or we recursed at Case 1 below and in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
119 * Case 1 - node' in __rb_insert()
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; ____rb_erase_color() local
423 dummy_propagate(struct rb_node *node, struct rb_node *stop) dummy_propagate() argument
433 rb_insert_color(struct rb_node *node, struct rb_root *root) rb_insert_color() argument
438 rb_erase(struct rb_node *node, struct rb_root *root) rb_erase() argument
453 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) __rb_insert_augmented() argument
486 rb_next(const struct rb_node *node) rb_next() argument
517 rb_prev(const struct rb_node *node) rb_prev() argument
561 rb_left_deepest_node(const struct rb_node *node) rb_left_deepest_node() argument
573 rb_next_postorder(const struct rb_node *node) rb_next_postorder() argument
[all...]
/kernel/linux/linux-6.6/tools/lib/
H A Drbtree.c18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
92 * Loop invariant: node is red. in __rb_insert()
96 * The inserted node is root. Either this is the in __rb_insert()
97 * first node, or we recursed at Case 1 below and in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
119 * Case 1 - node' in __rb_insert()
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; ____rb_erase_color() local
423 dummy_propagate(struct rb_node *node, struct rb_node *stop) dummy_propagate() argument
433 rb_insert_color(struct rb_node *node, struct rb_root *root) rb_insert_color() argument
438 rb_erase(struct rb_node *node, struct rb_root *root) rb_erase() argument
453 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) __rb_insert_augmented() argument
486 rb_next(const struct rb_node *node) rb_next() argument
517 rb_prev(const struct rb_node *node) rb_prev() argument
561 rb_left_deepest_node(const struct rb_node *node) rb_left_deepest_node() argument
573 rb_next_postorder(const struct rb_node *node) rb_next_postorder() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Drbtree.c18 * 1) A node is either red or black
21 * 4) Both children of every red node are black
26 * consecutive red nodes in a path and every red node is therefore followed by
85 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
88 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
92 * Loop invariant: node is red. in __rb_insert()
96 * The inserted node is root. Either this is the in __rb_insert()
97 * first node, or we recursed at Case 1 below and in __rb_insert()
100 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
119 * Case 1 - node' in __rb_insert()
230 struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; ____rb_erase_color() local
424 dummy_propagate(struct rb_node *node, struct rb_node *stop) dummy_propagate() argument
434 rb_insert_color(struct rb_node *node, struct rb_root *root) rb_insert_color() argument
440 rb_erase(struct rb_node *node, struct rb_root *root) rb_erase() argument
456 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) __rb_insert_augmented() argument
492 rb_next(const struct rb_node *node) rb_next() argument
524 rb_prev(const struct rb_node *node) rb_prev() argument
592 rb_left_deepest_node(const struct rb_node *node) rb_left_deepest_node() argument
604 rb_next_postorder(const struct rb_node *node) rb_next_postorder() argument
[all...]
H A Dmaple_tree.c12 * Each node type has a number of slots for entries and a number of slots for
14 * and are simply the slot index + the minimum of the node.
43 * a slot, but the last offset has an implied pivot from the node above (or
44 * UINT_MAX for the root node.
137 * dead node and restart on updates.
175 struct maple_node *node = container_of(head, struct maple_node, rcu); in mt_free_rcu() local
177 kmem_cache_free(maple_node_cache, node); in mt_free_rcu()
181 * ma_free_rcu() - Use rcu callback to free a maple node
182 * @node: The node t
187 ma_free_rcu(struct maple_node *node) ma_free_rcu() argument
331 mt_mk_node(const struct maple_node *node, enum maple_type type) mt_mk_node() argument
338 mte_mk_root(const struct maple_enode *node) mte_mk_root() argument
343 mte_safe_root(const struct maple_enode *node) mte_safe_root() argument
348 mte_set_full(const struct maple_enode *node) mte_set_full() argument
353 mte_clear_full(const struct maple_enode *node) mte_clear_full() argument
358 mte_has_null(const struct maple_enode *node) mte_has_null() argument
363 ma_is_root(struct maple_node *node) ma_is_root() argument
368 mte_is_root(const struct maple_enode *node) mte_is_root() argument
549 ma_dead_node(const struct maple_node *node) ma_dead_node() argument
567 struct maple_node *parent, *node; mte_dead_node() local
646 ma_pivots(struct maple_node *node, enum maple_type type) ma_pivots() argument
668 ma_gaps(struct maple_node *node, enum maple_type type) ma_gaps() argument
691 struct maple_node *node = mas_mn(mas); mas_pivot() local
757 struct maple_node *node = mte_to_node(mn); mte_set_pivot() local
1014 struct maple_node *node; mas_mat_destroy() local
1036 struct maple_node *node; mas_descend() local
1165 struct maple_alloc *ret, *node = mas->alloc; mas_pop_node() local
1247 struct maple_alloc *node; mas_alloc_nodes() local
1428 ma_data_end(struct maple_node *node, enum maple_type type, unsigned long *pivots, unsigned long max) ma_data_end() argument
1463 struct maple_node *node; mas_data_end() local
1574 ma_max_gap(struct maple_node *node, unsigned long *gaps, enum maple_type mt, unsigned char *off) ma_max_gap() argument
1603 struct maple_node *node; mas_max_gap() local
1708 struct maple_node *node = mte_to_node(parent); mas_adopt_children() local
1777 struct maple_node *node; global() variable
1947 struct maple_node *node; mas_mab_cp() local
2000 mas_leaf_set_meta(struct ma_state *mas, struct maple_node *node, unsigned long *pivots, enum maple_type mt, unsigned char end) mas_leaf_set_meta() argument
2028 struct maple_node *node = mte_to_node(mas->node); mab_mas_cp() local
2787 struct maple_node *node; mtree_range_walk() local
3052 struct maple_node reuse, *newnode, *parent, *new_left, *left, *node; mas_destroy_rebalance() local
3470 struct maple_node *node; mas_commit_b_node() local
3510 struct maple_node *node; mas_root_expand() local
3728 struct maple_node *node; mtree_lookup_walk() local
3780 struct maple_node *node; mas_new_root() local
4340 mas_rewalk_if_dead(struct ma_state *mas, struct maple_node *node, const unsigned long index) mas_rewalk_if_dead() argument
4364 struct maple_node *node; mas_prev_node() local
4447 struct maple_node *node; mas_prev_slot() local
4519 mas_next_node(struct ma_state *mas, struct maple_node *node, unsigned long max) mas_next_node() argument
4610 struct maple_node *node; mas_next_slot() local
4725 struct maple_node *node = mas_mn(mas); mas_rev_awalk() local
4815 struct maple_node *node; mas_anode_descend() local
5143 struct maple_node *node; mte_dead_leaves() local
5173 struct maple_node *node, *next; mte_dead_walk() local
5198 struct maple_node *node, *start; mt_free_walk() local
5238 struct maple_node *node; mte_destroy_descend() local
5269 struct maple_node *node = mte_to_node(enode); mt_destroy_walk() local
5330 struct maple_node *node = mte_to_node(enode); mte_destroy_walk() local
5555 struct maple_alloc *node; mas_destroy() local
6761 struct maple_range_64 *node = &mte_to_node(entry)->mr64; mt_dump_range64() local
6816 struct maple_arange_64 *node = &mte_to_node(entry)->ma64; mt_dump_arange64() local
6875 struct maple_node *node = mte_to_node(entry); mt_dump_node() local
6926 struct maple_node *p_mn, *node = mte_to_node(mte); mas_validate_gaps() local
7017 struct maple_enode *node; mas_validate_parent_slot() local
[all...]
/kernel/liteos_m/arch/arm/cortex-m33/gcc/TZ/secure/
H A Dlos_secure_heap.c54 #define OS_SECURE_HEAP_NEXT_NODE(node) \
55 ((struct OsSecureHeapNode *)((UINT8 *)(node) + (node)->size))
65 STATIC INLINE VOID OsSecureHeapListDelete(LOS_DL_LIST *node) in OsSecureHeapListDelete() argument
67 node->pstNext->pstPrev = node->pstPrev; in OsSecureHeapListDelete()
68 node->pstPrev->pstNext = node->pstNext; in OsSecureHeapListDelete()
69 node->pstNext = NULL; in OsSecureHeapListDelete()
70 node in OsSecureHeapListDelete()
73 OsSecureHeapListAdd(LOS_DL_LIST *listNode, LOS_DL_LIST *node) OsSecureHeapListAdd() argument
95 OsSecureHeapClearNode(struct OsSecureHeapNode *node) OsSecureHeapClearNode() argument
104 OsSecureHeapMergeNode(struct OsSecureHeapNode *node) OsSecureHeapMergeNode() argument
134 OsSecureHeapFreeNode(struct OsSecureHeapNode *node) OsSecureHeapFreeNode() argument
216 struct OsSecureHeapNode *node = NULL; HalSecureFree() local
[all...]
/kernel/liteos_m/arch/arm/cortex-m33/iar/TZ/secure/
H A Dlos_secure_heap.c55 #define OS_SECURE_HEAP_NEXT_NODE(node) \
56 ((struct OsSecureHeapNode *)((UINT8 *)(node) + (node)->size))
66 STATIC INLINE VOID OsSecureHeapListDelete(LOS_DL_LIST *node) in OsSecureHeapListDelete() argument
68 node->pstNext->pstPrev = node->pstPrev; in OsSecureHeapListDelete()
69 node->pstPrev->pstNext = node->pstNext; in OsSecureHeapListDelete()
70 node->pstNext = NULL; in OsSecureHeapListDelete()
71 node in OsSecureHeapListDelete()
74 OsSecureHeapListAdd(LOS_DL_LIST *listNode, LOS_DL_LIST *node) OsSecureHeapListAdd() argument
96 OsSecureHeapClearNode(struct OsSecureHeapNode *node) OsSecureHeapClearNode() argument
105 OsSecureHeapMergeNode(struct OsSecureHeapNode *node) OsSecureHeapMergeNode() argument
135 OsSecureHeapFreeNode(struct OsSecureHeapNode *node) OsSecureHeapFreeNode() argument
217 struct OsSecureHeapNode *node = NULL; HalSecureFree() local
[all...]
/kernel/liteos_m/arch/arm/cortex-m55/gcc/TZ/secure/
H A Dlos_secure_heap.c54 #define OS_SECURE_HEAP_NEXT_NODE(node) \
55 ((struct OsSecureHeapNode *)((UINT8 *)(node) + (node)->size))
65 STATIC INLINE VOID OsSecureHeapListDelete(LOS_DL_LIST *node) in OsSecureHeapListDelete() argument
67 node->pstNext->pstPrev = node->pstPrev; in OsSecureHeapListDelete()
68 node->pstPrev->pstNext = node->pstNext; in OsSecureHeapListDelete()
69 node->pstNext = NULL; in OsSecureHeapListDelete()
70 node in OsSecureHeapListDelete()
73 OsSecureHeapListAdd(LOS_DL_LIST *listNode, LOS_DL_LIST *node) OsSecureHeapListAdd() argument
95 OsSecureHeapClearNode(struct OsSecureHeapNode *node) OsSecureHeapClearNode() argument
104 OsSecureHeapMergeNode(struct OsSecureHeapNode *node) OsSecureHeapMergeNode() argument
134 OsSecureHeapFreeNode(struct OsSecureHeapNode *node) OsSecureHeapFreeNode() argument
216 struct OsSecureHeapNode *node = NULL; HalSecureFree() local
[all...]
/kernel/liteos_m/arch/arm/cortex-m55/iar/TZ/secure/
H A Dlos_secure_heap.c55 #define OS_SECURE_HEAP_NEXT_NODE(node) \
56 ((struct OsSecureHeapNode *)((UINT8 *)(node) + (node)->size))
66 STATIC INLINE VOID OsSecureHeapListDelete(LOS_DL_LIST *node) in OsSecureHeapListDelete() argument
68 node->pstNext->pstPrev = node->pstPrev; in OsSecureHeapListDelete()
69 node->pstPrev->pstNext = node->pstNext; in OsSecureHeapListDelete()
70 node->pstNext = NULL; in OsSecureHeapListDelete()
71 node in OsSecureHeapListDelete()
74 OsSecureHeapListAdd(LOS_DL_LIST *listNode, LOS_DL_LIST *node) OsSecureHeapListAdd() argument
96 OsSecureHeapClearNode(struct OsSecureHeapNode *node) OsSecureHeapClearNode() argument
105 OsSecureHeapMergeNode(struct OsSecureHeapNode *node) OsSecureHeapMergeNode() argument
135 OsSecureHeapFreeNode(struct OsSecureHeapNode *node) OsSecureHeapFreeNode() argument
217 struct OsSecureHeapNode *node = NULL; HalSecureFree() local
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/
H A Dcore.c47 seq_puts(s, " node tag avg peak\n"); in icc_summary_show()
169 struct icc_node *node = dst; in path_init() local
180 node->provider->users++; in path_init()
181 hlist_add_head(&path->reqs[i].req_node, &node->req_list); in path_init()
182 path->reqs[i].node = node; in path_init()
185 /* reference to previous node was saved during path traversal */ in path_init()
186 node = node->reverse; in path_init()
196 struct icc_node *n, *node in path_find() local
265 aggregate_requests(struct icc_node *node) aggregate_requests() argument
326 icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw, u32 peak_bw, u32 *agg_avg, u32 *agg_peak) icc_std_aggregate() argument
373 struct icc_node *node = ERR_PTR(-EPROBE_DEFER); of_icc_get_from_provider() local
690 struct icc_node *node; icc_set_bw() local
783 struct icc_node *node; icc_put() local
810 struct icc_node *node; icc_node_create_nolock() local
841 struct icc_node *node; icc_node_create() local
859 struct icc_node *node; icc_node_destroy() local
892 icc_link_create(struct icc_node *node, const int dst_id) icc_link_create() argument
936 icc_node_add(struct icc_node *node, struct icc_provider *provider) icc_node_add() argument
980 icc_node_del(struct icc_node *node) icc_node_del() argument
[all...]
/kernel/linux/linux-6.6/arch/ia64/mm/
H A Ddiscontig.c34 * Track per-node information needed to setup the boot memory allocator, the
35 * per-node areas, and the real VM.
51 * To prevent cache aliasing effects, align per-node structures so that they
52 * start at addresses that are strided by node number.
55 #define NODEDATA_ALIGN(addr, node) \
57 (((node)*PERCPU_PAGE_SIZE) & (MAX_NODE_ALIGN_OFFSET - 1)))
60 * build_node_maps - callback to setup mem_data structs for each node
63 * @node: node where this range resides
66 * treat as a virtually contiguous block (i.e. each node)
71 build_node_maps(unsigned long start, unsigned long len, int node) build_node_maps() argument
98 early_nr_cpus_node(int node) early_nr_cpus_node() argument
113 compute_pernodesize(int node) compute_pernodesize() argument
136 per_cpu_node_setup(void *cpu_data, int node) per_cpu_node_setup() argument
189 int node, prev_node, unit, nr_units; setup_per_cpu_areas() local
259 fill_pernode(int node, unsigned long pernode, unsigned long pernodesize) fill_pernode() argument
313 find_pernode_space(unsigned long start, unsigned long len, int node) find_pernode_space() argument
357 int node; reserve_pernode_space() local
373 int node; scatter_node_data() local
400 int cpu, node; initialize_pernode_data() local
434 int bestnode = NUMA_NO_NODE, node, anynode = 0; memory_less_node_alloc() local
469 int node; memory_less_nodes() local
488 int node; find_memory() local
625 vmemmap_populate(unsigned long start, unsigned long end, int node, struct vmem_altmap *altmap) vmemmap_populate() argument
[all...]
/kernel/linux/linux-6.6/include/drm/
H A Ddrm_vma_manager.h72 struct drm_vma_offset_node *node, unsigned long pages);
74 struct drm_vma_offset_node *node);
76 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
77 int drm_vma_node_allow_once(struct drm_vma_offset_node *node, struct drm_file *tag);
78 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
80 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
84 * drm_vma_offset_exact_lookup_locked() - Look up node by exact address
89 * Same as drm_vma_offset_lookup_locked() but does not allow any offset into the node.
100 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
102 node in drm_vma_offset_exact_lookup_locked()
148 drm_vma_node_reset(struct drm_vma_offset_node *node) drm_vma_node_reset() argument
169 drm_vma_node_start(const struct drm_vma_offset_node *node) drm_vma_node_start() argument
186 drm_vma_node_size(struct drm_vma_offset_node *node) drm_vma_node_size() argument
203 drm_vma_node_offset_addr(struct drm_vma_offset_node *node) drm_vma_node_offset_addr() argument
220 drm_vma_node_unmap(struct drm_vma_offset_node *node, struct address_space *file_mapping) drm_vma_node_unmap() argument
241 drm_vma_node_verify_access(struct drm_vma_offset_node *node, struct drm_file *tag) drm_vma_node_verify_access() argument
[all...]
/kernel/linux/linux-5.10/drivers/interconnect/
H A Dcore.c47 seq_puts(s, " node tag avg peak\n"); in icc_summary_show()
154 struct icc_node *node = dst; in path_init() local
165 node->provider->users++; in path_init()
166 hlist_add_head(&path->reqs[i].req_node, &node->req_list); in path_init()
167 path->reqs[i].node = node; in path_init()
170 /* reference to previous node was saved during path traversal */ in path_init()
171 node = node->reverse; in path_init()
181 struct icc_node *n, *node in path_find() local
250 aggregate_requests(struct icc_node *node) aggregate_requests() argument
311 icc_std_aggregate(struct icc_node *node, u32 tag, u32 avg_bw, u32 peak_bw, u32 *agg_avg, u32 *agg_peak) icc_std_aggregate() argument
358 struct icc_node *node = ERR_PTR(-EPROBE_DEFER); of_icc_get_from_provider() local
627 struct icc_node *node; icc_set_bw() local
768 struct icc_node *node; icc_put() local
795 struct icc_node *node; icc_node_create_nolock() local
826 struct icc_node *node; icc_node_create() local
844 struct icc_node *node; icc_node_destroy() local
877 icc_link_create(struct icc_node *node, const int dst_id) icc_link_create() argument
967 icc_node_add(struct icc_node *node, struct icc_provider *provider) icc_node_add() argument
1003 icc_node_del(struct icc_node *node) icc_node_del() argument
[all...]
/kernel/linux/linux-5.10/drivers/clk/ti/
H A Ddpll.c155 * @node: device node for the clock
162 struct device_node *node) in _register_dpll()
171 clk = of_clk_get(node, 0); in _register_dpll()
174 node); in _register_dpll()
175 if (!ti_clk_retry_init(node, hw, _register_dpll)) in _register_dpll()
183 clk = of_clk_get(node, 1); in _register_dpll()
187 node); in _register_dpll()
188 if (!ti_clk_retry_init(node, hw, _register_dpll)) in _register_dpll()
197 name = ti_dt_clk_name(node); in _register_dpll()
161 _register_dpll(void *user, struct device_node *node) _register_dpll() argument
225 _register_dpll_x2(struct device_node *node, const struct clk_ops *ops, const struct clk_hw_omap_ops *hw_ops) _register_dpll_x2() argument
287 of_ti_dpll_setup(struct device_node *node, const struct clk_ops *ops, const struct dpll_data *ddt) of_ti_dpll_setup() argument
376 of_ti_omap4_dpll_x2_setup(struct device_node *node) of_ti_omap4_dpll_x2_setup() argument
385 of_ti_am3_dpll_x2_setup(struct device_node *node) of_ti_am3_dpll_x2_setup() argument
394 of_ti_omap3_dpll_setup(struct device_node *node) of_ti_omap3_dpll_setup() argument
419 of_ti_omap3_core_dpll_setup(struct device_node *node) of_ti_omap3_core_dpll_setup() argument
438 of_ti_omap3_per_dpll_setup(struct device_node *node) of_ti_omap3_per_dpll_setup() argument
458 of_ti_omap3_per_jtype_dpll_setup(struct device_node *node) of_ti_omap3_per_jtype_dpll_setup() argument
481 of_ti_omap4_dpll_setup(struct device_node *node) of_ti_omap4_dpll_setup() argument
500 of_ti_omap5_mpu_dpll_setup(struct device_node *node) of_ti_omap5_mpu_dpll_setup() argument
521 of_ti_omap4_core_dpll_setup(struct device_node *node) of_ti_omap4_core_dpll_setup() argument
542 of_ti_omap4_m4xen_dpll_setup(struct device_node *node) of_ti_omap4_m4xen_dpll_setup() argument
563 of_ti_omap4_jtype_dpll_setup(struct device_node *node) of_ti_omap4_jtype_dpll_setup() argument
585 of_ti_am3_no_gate_dpll_setup(struct device_node *node) of_ti_am3_no_gate_dpll_setup() argument
604 of_ti_am3_jtype_dpll_setup(struct device_node *node) of_ti_am3_jtype_dpll_setup() argument
624 of_ti_am3_no_gate_jtype_dpll_setup(struct device_node *node) of_ti_am3_no_gate_jtype_dpll_setup() argument
645 of_ti_am3_dpll_setup(struct device_node *node) of_ti_am3_dpll_setup() argument
663 of_ti_am3_core_dpll_setup(struct device_node *node) of_ti_am3_core_dpll_setup() argument
682 of_ti_omap2_core_dpll_setup(struct device_node *node) of_ti_omap2_core_dpll_setup() argument
[all...]
/kernel/linux/linux-6.6/drivers/interconnect/imx/
H A Dimx.c31 static int imx_icc_get_bw(struct icc_node *node, u32 *avg, u32 *peak) in imx_icc_get_bw() argument
39 static int imx_icc_node_set(struct icc_node *node) in imx_icc_node_set() argument
41 struct device *dev = node->provider->dev; in imx_icc_node_set()
42 struct imx_icc_node *node_data = node->data; in imx_icc_node_set()
47 if (node_data->setting && node->peak_bw) { in imx_icc_node_set()
70 freq = (node->avg_bw + node->peak_bw) * node_data->desc->adj->bw_mul; in imx_icc_node_set()
72 dev_dbg(dev, "node %s device %s avg_bw %ukBps peak_bw %ukBps min_freq %llukHz\n", in imx_icc_node_set()
73 node->name, dev_name(node_data->qos_dev), in imx_icc_node_set()
74 node in imx_icc_node_set()
99 imx_icc_node_destroy(struct icc_node *node) imx_icc_node_destroy() argument
117 imx_icc_node_init_qos(struct icc_provider *provider, struct icc_node *node) imx_icc_node_init_qos() argument
169 struct icc_node *node; imx_icc_node_add() local
210 struct icc_node *node, *tmp; imx_icc_unregister_nodes() local
227 struct icc_node *node; imx_icc_register_nodes() local
[all...]
/kernel/linux/linux-5.10/include/drm/
H A Ddrm_vma_manager.h72 struct drm_vma_offset_node *node, unsigned long pages);
74 struct drm_vma_offset_node *node);
76 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
77 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
79 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
83 * drm_vma_offset_exact_lookup_locked() - Look up node by exact address
88 * Same as drm_vma_offset_lookup_locked() but does not allow any offset into the node.
99 struct drm_vma_offset_node *node; in drm_vma_offset_exact_lookup_locked() local
101 node = drm_vma_offset_lookup_locked(mgr, start, pages); in drm_vma_offset_exact_lookup_locked()
102 return (node in drm_vma_offset_exact_lookup_locked()
147 drm_vma_node_reset(struct drm_vma_offset_node *node) drm_vma_node_reset() argument
168 drm_vma_node_start(const struct drm_vma_offset_node *node) drm_vma_node_start() argument
185 drm_vma_node_size(struct drm_vma_offset_node *node) drm_vma_node_size() argument
202 drm_vma_node_offset_addr(struct drm_vma_offset_node *node) drm_vma_node_offset_addr() argument
219 drm_vma_node_unmap(struct drm_vma_offset_node *node, struct address_space *file_mapping) drm_vma_node_unmap() argument
240 drm_vma_node_verify_access(struct drm_vma_offset_node *node, struct drm_file *tag) drm_vma_node_verify_access() argument
[all...]

Completed in 17 milliseconds

12345678910>>...278