| /kernel/linux/linux-5.10/fs/afs/ |
| D | cell.c | 2 /* AFS cell and server record management
33 * Set the cell timer to fire after a given delay, assuming it's not already
48 * Look up and get an activation reference on a cell record. The caller must
55 struct afs_cell *cell = NULL; in afs_find_cell_locked() local
67 cell = net->ws_cell; in afs_find_cell_locked()
68 if (!cell) in afs_find_cell_locked()
75 cell = rb_entry(p, struct afs_cell, net_node); in afs_find_cell_locked()
77 n = strncasecmp(cell->name, name, in afs_find_cell_locked()
78 min_t(size_t, cell->name_len, namesz)); in afs_find_cell_locked()
80 n = cell->name_len - namesz; in afs_find_cell_locked()
[all …]
|
| D | vl_alias.c | 2 /* AFS cell alias detection
17 static struct afs_volume *afs_sample_volume(struct afs_cell *cell, struct key *key, in afs_sample_volume() argument
25 .net = cell->net, in afs_sample_volume()
26 .cell = cell, in afs_sample_volume()
154 * Compare root.cell volumes.
156 static int afs_compare_cell_roots(struct afs_cell *cell) in afs_compare_cell_roots() argument
164 hlist_for_each_entry_rcu(p, &cell->net->proc_cells, proc_link) { in afs_compare_cell_roots()
165 if (p == cell || p->alias_of) in afs_compare_cell_roots()
168 continue; /* Ignore cells that don't have a root.cell volume. */ in afs_compare_cell_roots()
170 if (afs_compare_volume_slists(cell->root_volume, p->root_volume) != 0) in afs_compare_cell_roots()
[all …]
|
| D | vl_rotate.c | 17 bool afs_begin_vlserver_operation(struct afs_vl_cursor *vc, struct afs_cell *cell, in afs_begin_vlserver_operation() argument
21 vc->cell = cell; in afs_begin_vlserver_operation()
41 struct afs_cell *cell = vc->cell; in afs_start_vl_iteration() local
44 if (cell->dns_source == DNS_RECORD_UNAVAILABLE || in afs_start_vl_iteration()
45 cell->dns_expiry <= ktime_get_real_seconds()) { in afs_start_vl_iteration()
46 dns_lookup_count = smp_load_acquire(&cell->dns_lookup_count); in afs_start_vl_iteration()
47 set_bit(AFS_CELL_FL_DO_LOOKUP, &cell->flags); in afs_start_vl_iteration()
48 afs_queue_cell(cell, afs_cell_trace_get_queue_dns); in afs_start_vl_iteration()
50 if (cell->dns_source == DNS_RECORD_UNAVAILABLE) { in afs_start_vl_iteration()
52 &cell->dns_lookup_count, in afs_start_vl_iteration()
[all …]
|
| /kernel/linux/linux-6.6/fs/afs/ |
| D | cell.c | 2 /* AFS cell and server record management
33 * Set the cell timer to fire after a given delay, assuming it's not already
48 * Look up and get an activation reference on a cell record. The caller must
55 struct afs_cell *cell = NULL; in afs_find_cell_locked() local
67 cell = net->ws_cell; in afs_find_cell_locked()
68 if (!cell) in afs_find_cell_locked()
75 cell = rb_entry(p, struct afs_cell, net_node); in afs_find_cell_locked()
77 n = strncasecmp(cell->name, name, in afs_find_cell_locked()
78 min_t(size_t, cell->name_len, namesz)); in afs_find_cell_locked()
80 n = cell->name_len - namesz; in afs_find_cell_locked()
[all …]
|
| D | vl_alias.c | 2 /* AFS cell alias detection
17 static struct afs_volume *afs_sample_volume(struct afs_cell *cell, struct key *key, in afs_sample_volume() argument
25 .net = cell->net, in afs_sample_volume()
26 .cell = cell, in afs_sample_volume()
154 * Compare root.cell volumes.
156 static int afs_compare_cell_roots(struct afs_cell *cell) in afs_compare_cell_roots() argument
164 hlist_for_each_entry_rcu(p, &cell->net->proc_cells, proc_link) { in afs_compare_cell_roots()
165 if (p == cell || p->alias_of) in afs_compare_cell_roots()
168 continue; /* Ignore cells that don't have a root.cell volume. */ in afs_compare_cell_roots()
170 if (afs_compare_volume_slists(cell->root_volume, p->root_volume) != 0) in afs_compare_cell_roots()
[all …]
|
| D | vl_rotate.c | 17 bool afs_begin_vlserver_operation(struct afs_vl_cursor *vc, struct afs_cell *cell, in afs_begin_vlserver_operation() argument
21 vc->cell = cell; in afs_begin_vlserver_operation()
41 struct afs_cell *cell = vc->cell; in afs_start_vl_iteration() local
44 if (cell->dns_source == DNS_RECORD_UNAVAILABLE || in afs_start_vl_iteration()
45 cell->dns_expiry <= ktime_get_real_seconds()) { in afs_start_vl_iteration()
46 dns_lookup_count = smp_load_acquire(&cell->dns_lookup_count); in afs_start_vl_iteration()
47 set_bit(AFS_CELL_FL_DO_LOOKUP, &cell->flags); in afs_start_vl_iteration()
48 afs_queue_cell(cell, afs_cell_trace_get_queue_dns); in afs_start_vl_iteration()
50 if (cell->dns_source == DNS_RECORD_UNAVAILABLE) { in afs_start_vl_iteration()
52 &cell->dns_lookup_count, in afs_start_vl_iteration()
[all …]
|
| /kernel/linux/linux-5.10/drivers/nvmem/ |
| D | core.c | 339 static void nvmem_cell_drop(struct nvmem_cell *cell) in nvmem_cell_drop() argument
341 blocking_notifier_call_chain(&nvmem_notifier, NVMEM_CELL_REMOVE, cell); in nvmem_cell_drop()
343 list_del(&cell->node); in nvmem_cell_drop()
345 of_node_put(cell->np); in nvmem_cell_drop()
346 kfree_const(cell->name); in nvmem_cell_drop()
347 kfree(cell); in nvmem_cell_drop()
352 struct nvmem_cell *cell, *p; in nvmem_device_remove_all_cells() local
354 list_for_each_entry_safe(cell, p, &nvmem->cells, node) in nvmem_device_remove_all_cells()
355 nvmem_cell_drop(cell); in nvmem_device_remove_all_cells()
358 static void nvmem_cell_add(struct nvmem_cell *cell) in nvmem_cell_add() argument
[all …]
|
| /kernel/linux/linux-5.10/drivers/md/ |
| D | dm-bio-prison-v2.c | 73 struct dm_bio_prison_cell_v2 *cell) in dm_bio_prison_free_cell_v2() argument
75 mempool_free(cell, &prison->cell_pool); in dm_bio_prison_free_cell_v2()
80 struct dm_bio_prison_cell_v2 *cell) in __setup_new_cell() argument
82 memset(cell, 0, sizeof(*cell)); in __setup_new_cell()
83 memcpy(&cell->key, key, sizeof(cell->key)); in __setup_new_cell()
84 bio_list_init(&cell->bios); in __setup_new_cell()
123 struct dm_bio_prison_cell_v2 *cell = in __find_or_insert() local
126 r = cmp_keys(key, &cell->key); in __find_or_insert()
136 *result = cell; in __find_or_insert()
154 struct dm_bio_prison_cell_v2 **cell) in __get() argument
[all …]
|
| D | dm-bio-prison-v1.c | 70 struct dm_bio_prison_cell *cell) in dm_bio_prison_free_cell() argument
72 mempool_free(cell, &prison->cell_pool); in dm_bio_prison_free_cell()
78 struct dm_bio_prison_cell *cell) in __setup_new_cell() argument
80 memcpy(&cell->key, key, sizeof(cell->key)); in __setup_new_cell()
81 cell->holder = holder; in __setup_new_cell()
82 bio_list_init(&cell->bios); in __setup_new_cell()
119 struct dm_bio_prison_cell *cell = in __bio_detain() local
122 r = cmp_keys(key, &cell->key); in __bio_detain()
131 bio_list_add(&cell->bios, inmate); in __bio_detain()
132 *cell_result = cell; in __bio_detain()
[all …]
|
| /kernel/linux/linux-6.6/drivers/md/ |
| D | dm-bio-prison-v2.c | 74 struct dm_bio_prison_cell_v2 *cell) in dm_bio_prison_free_cell_v2() argument
76 mempool_free(cell, &prison->cell_pool); in dm_bio_prison_free_cell_v2()
81 struct dm_bio_prison_cell_v2 *cell) in __setup_new_cell() argument
83 memset(cell, 0, sizeof(*cell)); in __setup_new_cell()
84 memcpy(&cell->key, key, sizeof(cell->key)); in __setup_new_cell()
85 bio_list_init(&cell->bios); in __setup_new_cell()
124 struct dm_bio_prison_cell_v2 *cell = in __find_or_insert() local
127 r = cmp_keys(key, &cell->key); in __find_or_insert()
137 *result = cell; in __find_or_insert()
155 struct dm_bio_prison_cell_v2 **cell) in __get() argument
[all …]
|
| D | dm-bio-prison-v1.c | 23 struct rb_root cell; member
54 prison->regions[i].cell = RB_ROOT; in dm_bio_prison_create()
81 struct dm_bio_prison_cell *cell) in dm_bio_prison_free_cell() argument
83 mempool_free(cell, &prison->cell_pool); in dm_bio_prison_free_cell()
89 struct dm_bio_prison_cell *cell) in __setup_new_cell() argument
91 memcpy(&cell->key, key, sizeof(cell->key)); in __setup_new_cell()
92 cell->holder = holder; in __setup_new_cell()
93 bio_list_init(&cell->bios); in __setup_new_cell()
148 struct dm_bio_prison_cell *cell = in __bio_detain() local
151 r = cmp_keys(key, &cell->key); in __bio_detain()
[all …]
|
| /kernel/linux/linux-6.6/sound/core/seq/ |
| D | seq_prioq.c | 130 /* enqueue cell to prioq */
132 struct snd_seq_event_cell * cell) in snd_seq_prioq_cell_in() argument
139 if (snd_BUG_ON(!f || !cell)) in snd_seq_prioq_cell_in()
143 prior = (cell->event.flags & SNDRV_SEQ_PRIORITY_MASK); in snd_seq_prioq_cell_in()
151 if (compare_timestamp(&cell->event, &f->tail->event)) { in snd_seq_prioq_cell_in()
152 /* add new cell to tail of the fifo */ in snd_seq_prioq_cell_in()
153 f->tail->next = cell; in snd_seq_prioq_cell_in()
154 f->tail = cell; in snd_seq_prioq_cell_in()
155 cell->next = NULL; in snd_seq_prioq_cell_in()
161 /* traverse list of elements to find the place where the new cell is in snd_seq_prioq_cell_in()
[all …]
|
| D | seq_fifo.c | 85 struct snd_seq_event_cell *cell; in snd_seq_fifo_clear() local
93 while ((cell = fifo_cell_out(f)) != NULL) { in snd_seq_fifo_clear()
94 snd_seq_cell_free(cell); in snd_seq_fifo_clear()
104 struct snd_seq_event_cell *cell; in snd_seq_fifo_event_in() local
112 err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL, NULL); /* always non-blocking */ in snd_seq_fifo_event_in()
123 f->tail->next = cell; in snd_seq_fifo_event_in()
124 f->tail = cell; in snd_seq_fifo_event_in()
126 f->head = cell; in snd_seq_fifo_event_in()
127 cell->next = NULL; in snd_seq_fifo_event_in()
141 /* dequeue cell from fifo */
[all …]
|
| D | seq_memory.c | 49 * ext.data.ptr = the additiona cell head
50 * -> cell.next -> cell.next -> ..
71 struct snd_seq_event_cell *cell; in dump_var_event() local
104 cell = (struct snd_seq_event_cell *)event->data.ext.ptr; in dump_var_event()
105 for (; len > 0 && cell; cell = cell->next) { in dump_var_event()
107 char *curptr = (char *)&cell->event; in dump_var_event()
222 * release this cell, free extended data if available
226 struct snd_seq_event_cell *cell) in free_cell() argument
228 cell->next = pool->free; in free_cell()
229 pool->free = cell; in free_cell()
[all …]
|
| /kernel/linux/linux-5.10/sound/core/seq/ |
| D | seq_prioq.c | 130 /* enqueue cell to prioq */
132 struct snd_seq_event_cell * cell) in snd_seq_prioq_cell_in() argument
139 if (snd_BUG_ON(!f || !cell)) in snd_seq_prioq_cell_in()
143 prior = (cell->event.flags & SNDRV_SEQ_PRIORITY_MASK); in snd_seq_prioq_cell_in()
151 if (compare_timestamp(&cell->event, &f->tail->event)) { in snd_seq_prioq_cell_in()
152 /* add new cell to tail of the fifo */ in snd_seq_prioq_cell_in()
153 f->tail->next = cell; in snd_seq_prioq_cell_in()
154 f->tail = cell; in snd_seq_prioq_cell_in()
155 cell->next = NULL; in snd_seq_prioq_cell_in()
161 /* traverse list of elements to find the place where the new cell is in snd_seq_prioq_cell_in()
[all …]
|
| D | seq_fifo.c | 85 struct snd_seq_event_cell *cell; in snd_seq_fifo_clear() local
93 while ((cell = fifo_cell_out(f)) != NULL) { in snd_seq_fifo_clear()
94 snd_seq_cell_free(cell); in snd_seq_fifo_clear()
104 struct snd_seq_event_cell *cell; in snd_seq_fifo_event_in() local
112 err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL, NULL); /* always non-blocking */ in snd_seq_fifo_event_in()
123 f->tail->next = cell; in snd_seq_fifo_event_in()
124 f->tail = cell; in snd_seq_fifo_event_in()
126 f->head = cell; in snd_seq_fifo_event_in()
127 cell->next = NULL; in snd_seq_fifo_event_in()
141 /* dequeue cell from fifo */
[all …]
|
| D | seq_memory.c | 49 * ext.data.ptr = the additiona cell head
50 * -> cell.next -> cell.next -> ..
70 struct snd_seq_event_cell *cell; in snd_seq_dump_var_event() local
95 cell = (struct snd_seq_event_cell *)event->data.ext.ptr; in snd_seq_dump_var_event()
96 for (; len > 0 && cell; cell = cell->next) { in snd_seq_dump_var_event()
100 err = func(private_data, &cell->event, size); in snd_seq_dump_var_event()
163 * release this cell, free extended data if available
167 struct snd_seq_event_cell *cell) in free_cell() argument
169 cell->next = pool->free; in free_cell()
170 pool->free = cell; in free_cell()
[all …]
|
| /kernel/linux/linux-6.6/drivers/nvmem/ |
| D | core.c | 416 static void nvmem_cell_entry_drop(struct nvmem_cell_entry *cell) in nvmem_cell_entry_drop() argument
418 blocking_notifier_call_chain(&nvmem_notifier, NVMEM_CELL_REMOVE, cell); in nvmem_cell_entry_drop()
420 list_del(&cell->node); in nvmem_cell_entry_drop()
422 of_node_put(cell->np); in nvmem_cell_entry_drop()
423 kfree_const(cell->name); in nvmem_cell_entry_drop()
424 kfree(cell); in nvmem_cell_entry_drop()
429 struct nvmem_cell_entry *cell, *p; in nvmem_device_remove_all_cells() local
431 list_for_each_entry_safe(cell, p, &nvmem->cells, node) in nvmem_device_remove_all_cells()
432 nvmem_cell_entry_drop(cell); in nvmem_device_remove_all_cells()
435 static void nvmem_cell_entry_add(struct nvmem_cell_entry *cell) in nvmem_cell_entry_add() argument
[all …]
|
| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/ |
| D | isp2400_support.h | 25 #define hrt_isp_vamem1_store_16(cell, addr, val) hrt_mem_store_16(cell, HRT_PROC_TYPE_PROP(cell, _s… argument
26 #define hrt_isp_vamem2_store_16(cell, addr, val) hrt_mem_store_16(cell, HRT_PROC_TYPE_PROP(cell, _s… argument
28 #define hrt_isp_dmem(cell) HRT_PROC_TYPE_PROP(cell, _base_dmem) argument
29 #define hrt_isp_vmem(cell) HRT_PROC_TYPE_PROP(cell, _simd_vmem) argument
31 #define hrt_isp_dmem_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_dmem(cell)) argument
32 #define hrt_isp_vmem_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_vmem(cell)) argument
35 #define hrt_isp_hist(cell) HRT_PROC_TYPE_PROP(cell, _simd_histogram) argument
36 #define hrt_isp_hist_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_hist(cell)) argument
|
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/ |
| D | isp2400_support.h | 25 #define hrt_isp_vamem1_store_16(cell, addr, val) hrt_mem_store_16(cell, HRT_PROC_TYPE_PROP(cell, _s… argument
26 #define hrt_isp_vamem2_store_16(cell, addr, val) hrt_mem_store_16(cell, HRT_PROC_TYPE_PROP(cell, _s… argument
28 #define hrt_isp_dmem(cell) HRT_PROC_TYPE_PROP(cell, _base_dmem) argument
29 #define hrt_isp_vmem(cell) HRT_PROC_TYPE_PROP(cell, _simd_vmem) argument
31 #define hrt_isp_dmem_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_dmem(cell)) argument
32 #define hrt_isp_vmem_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_vmem(cell)) argument
35 #define hrt_isp_hist(cell) HRT_PROC_TYPE_PROP(cell, _simd_histogram) argument
36 #define hrt_isp_hist_master_port_address(cell) hrt_mem_master_port_address(cell, hrt_isp_hist(cell)) argument
|
| /kernel/linux/linux-5.10/drivers/mfd/ |
| D | mfd-core.c | 38 const struct mfd_cell *cell = mfd_get_cell(pdev); in mfd_cell_enable() local
40 if (!cell->enable) { in mfd_cell_enable()
45 return cell->enable(pdev); in mfd_cell_enable()
51 const struct mfd_cell *cell = mfd_get_cell(pdev); in mfd_cell_disable() local
53 if (!cell->disable) { in mfd_cell_disable()
58 return cell->disable(pdev); in mfd_cell_disable()
63 static void mfd_acpi_add_device(const struct mfd_cell *cell, in mfd_acpi_add_device() argument
66 const struct mfd_cell_acpi_match *match = cell->acpi_match; in mfd_acpi_add_device()
114 static inline void mfd_acpi_add_device(const struct mfd_cell *cell, in mfd_acpi_add_device() argument
122 const struct mfd_cell *cell) in mfd_match_of_node_to_dev() argument
[all …]
|
| /kernel/linux/linux-6.6/drivers/mfd/ |
| D | mfd-core.c | 54 static void mfd_acpi_add_device(const struct mfd_cell *cell, in mfd_acpi_add_device() argument
57 const struct mfd_cell_acpi_match *match = cell->acpi_match; in mfd_acpi_add_device()
93 static inline void mfd_acpi_add_device(const struct mfd_cell *cell, in mfd_acpi_add_device() argument
101 const struct mfd_cell *cell) in mfd_match_of_node_to_dev() argument
112 if (!cell->use_of_reg) in mfd_match_of_node_to_dev()
121 if (cell->of_reg != of_node_addr) in mfd_match_of_node_to_dev()
141 const struct mfd_cell *cell, in mfd_add_device() argument
157 platform_id = id + cell->id; in mfd_add_device()
159 pdev = platform_device_alloc(cell->name, platform_id); in mfd_add_device()
163 pdev->mfd_cell = kmemdup(cell, sizeof(*cell), GFP_KERNEL); in mfd_add_device()
[all …]
|
| /kernel/linux/linux-5.10/drivers/clk/mmp/ |
| D | reset.c | 16 struct mmp_clk_reset_cell *cell; in mmp_of_reset_xlate() local
23 cell = &unit->cells[i]; in mmp_of_reset_xlate()
24 if (cell->clk_id == reset_spec->args[0]) in mmp_of_reset_xlate()
38 struct mmp_clk_reset_cell *cell; in mmp_clk_reset_assert() local
42 cell = &unit->cells[id]; in mmp_clk_reset_assert()
43 if (cell->lock) in mmp_clk_reset_assert()
44 spin_lock_irqsave(cell->lock, flags); in mmp_clk_reset_assert()
46 val = readl(cell->reg); in mmp_clk_reset_assert()
47 val |= cell->bits; in mmp_clk_reset_assert()
48 writel(val, cell->reg); in mmp_clk_reset_assert()
[all …]
|
| /kernel/linux/linux-6.6/drivers/clk/mmp/ |
| D | reset.c | 16 struct mmp_clk_reset_cell *cell; in mmp_of_reset_xlate() local
23 cell = &unit->cells[i]; in mmp_of_reset_xlate()
24 if (cell->clk_id == reset_spec->args[0]) in mmp_of_reset_xlate()
38 struct mmp_clk_reset_cell *cell; in mmp_clk_reset_assert() local
42 cell = &unit->cells[id]; in mmp_clk_reset_assert()
43 if (cell->lock) in mmp_clk_reset_assert()
44 spin_lock_irqsave(cell->lock, flags); in mmp_clk_reset_assert()
46 val = readl(cell->reg); in mmp_clk_reset_assert()
47 val |= cell->bits; in mmp_clk_reset_assert()
48 writel(val, cell->reg); in mmp_clk_reset_assert()
[all …]
|
| /kernel/linux/linux-5.10/net/core/ |
| D | gro_cells.c | 15 struct gro_cell *cell; in gro_cells_receive() local
27 cell = this_cpu_ptr(gcells->cells); in gro_cells_receive()
29 if (skb_queue_len(&cell->napi_skbs) > READ_ONCE(netdev_max_backlog)) { in gro_cells_receive()
37 __skb_queue_tail(&cell->napi_skbs, skb); in gro_cells_receive()
38 if (skb_queue_len(&cell->napi_skbs) == 1) in gro_cells_receive()
39 napi_schedule(&cell->napi); in gro_cells_receive()
52 struct gro_cell *cell = container_of(napi, struct gro_cell, napi); in gro_cell_poll() local
57 skb = __skb_dequeue(&cell->napi_skbs); in gro_cell_poll()
78 struct gro_cell *cell = per_cpu_ptr(gcells->cells, i); in gro_cells_init() local
80 __skb_queue_head_init(&cell->napi_skbs); in gro_cells_init()
[all …]
|