Home
last modified time | relevance | path

Searched full:cell (Results 1 – 25 of 1002) sorted by relevance

12345678910>>...41

/linux/fs/afs/
H A Dcell.c2 /* AFS cell and server record management
33 static void afs_set_cell_state(struct afs_cell *cell, enum afs_cell_state state) in afs_set_cell_state() argument
35 smp_store_release(&cell->state, state); /* Commit cell changes before state */ in afs_set_cell_state()
36 smp_wmb(); /* Set cell state before task state */ in afs_set_cell_state()
37 wake_up_var(&cell->state); in afs_set_cell_state()
41 * Look up and get an activation reference on a cell record. The caller must
48 struct afs_cell *cell = NULL; in afs_find_cell_locked() local
60 cell = rcu_dereference_protected(net->ws_cell, in afs_find_cell_locked()
62 if (!cell) in afs_find_cell_locked()
69 cell = rb_entry(p, struct afs_cell, net_node); in afs_find_cell_locked()
[all …]
H A Dvl_alias.c2 /* 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()
105 * Compare root.cell volumes.
107 static int afs_compare_cell_roots(struct afs_cell *cell) in afs_compare_cell_roots() argument
115 hlist_for_each_entry_rcu(p, &cell->net->proc_cells, proc_link) { in afs_compare_cell_roots()
116 if (p == cell || p->alias_of) in afs_compare_cell_roots()
119 continue; /* Ignore cells that don't have a root.cell volume. */ in afs_compare_cell_roots()
121 if (afs_compare_volume_slists(cell->root_volume, p->root_volume) != 0) in afs_compare_cell_roots()
[all …]
H A Ddynroot.c13 #define AFS_MIN_DYNROOT_CELL_INO 4 /* Allow for ., .., @cell, .@cell */
96 struct afs_cell *cell = NULL; in afs_dynroot_lookup_cell() local
111 cell = afs_lookup_cell(net, name, len, NULL, in afs_dynroot_lookup_cell()
114 if (IS_ERR(cell)) { in afs_dynroot_lookup_cell()
115 ret = PTR_ERR(cell); in afs_dynroot_lookup_cell()
119 inode = afs_iget_pseudo_dir(dir->i_sb, cell->dynroot_ino * 2 + dotted); in afs_dynroot_lookup_cell()
125 dentry->d_fsdata = cell; in afs_dynroot_lookup_cell()
129 afs_unuse_cell(cell, afs_cell_trace_unuse_lookup_dynroot); in afs_dynroot_lookup_cell()
153 memcmp(dentry->d_name.name, "@cell", 5) == 0) in afs_dynroot_lookup()
157 memcmp(dentry->d_name.name, ".@cell", 6) == 0) in afs_dynroot_lookup()
[all …]
H A Dserver.c35 * cell->fs_lock.
37 static struct afs_server *afs_find_server_by_uuid(struct afs_cell *cell, const uuid_t *uuid) in afs_find_server_by_uuid() argument
45 p = cell->fs_servers.rb_node; in afs_find_server_by_uuid()
66 * Install a server record in the cell tree. The caller must hold an exclusive
67 * lock on cell->fs_lock.
69 static struct afs_server *afs_install_server(struct afs_cell *cell, in afs_install_server() argument
73 struct afs_net *net = cell->net; in afs_install_server()
80 pp = &cell->fs_servers.rb_node; in afs_install_server()
98 rb_insert_color(&server->uuid_rb, &cell->fs_servers); in afs_install_server()
103 afs_get_cell(cell, afs_cell_trace_get_server); in afs_install_server()
[all …]
H A Dsuper.c160 struct afs_cell *cell = as->cell; in afs_show_devname() local
183 seq_printf(m, "%c%s:%s%s", pref, cell->name, volume->name, suf); in afs_show_devname()
211 * Parse the source name to get cell name, volume name, volume type and R/W
215 * "%[cell:]volume[.]" R/W volume
216 * "#[cell:]volume[.]" R/O or R/W volume (R/O parent),
218 * "%[cell:]volume.readonly" R/O volume
219 * "#[cell:]volume.readonly" R/O volume
220 * "%[cell:]volume.backup" Backup volume
221 * "#[cell:]volume.backup" Backup volume
226 struct afs_cell *cell; in afs_parse_source() local
[all …]
H A Dvolume.c18 * Insert a volume into a cell. If there's an existing volume record, that is
21 static struct afs_volume *afs_insert_volume_into_cell(struct afs_cell *cell, in afs_insert_volume_into_cell() argument
27 write_seqlock(&cell->volume_lock); in afs_insert_volume_into_cell()
29 pp = &cell->volumes.rb_node; in afs_insert_volume_into_cell()
44 rb_replace_node_rcu(&p->cell_node, &volume->cell_node, &cell->volumes); in afs_insert_volume_into_cell()
49 rb_insert_color(&volume->cell_node, &cell->volumes); in afs_insert_volume_into_cell()
50 hlist_add_head_rcu(&volume->proc_link, &cell->proc_volumes); in afs_insert_volume_into_cell()
53 write_sequnlock(&cell->volume_lock); in afs_insert_volume_into_cell()
60 struct afs_cell *cell = volume->cell; in afs_remove_volume_from_cell() local
65 write_seqlock(&cell->volume_lock); in afs_remove_volume_from_cell()
[all …]
H A Dproc.c37 struct afs_cell *cell; in afs_proc_cells_show() local
45 cell = list_entry(v, struct afs_cell, proc_link); in afs_proc_cells_show()
46 vllist = rcu_dereference(cell->vl_servers); in afs_proc_cells_show()
48 /* display one cell per line on subsequent lines */ in afs_proc_cells_show()
50 refcount_read(&cell->ref), in afs_proc_cells_show()
51 atomic_read(&cell->active), in afs_proc_cells_show()
52 cell->dns_expiry - ktime_get_real_seconds(), in afs_proc_cells_show()
54 cell->state, in afs_proc_cells_show()
55 cell->name); in afs_proc_cells_show()
123 struct afs_cell *cell; in afs_proc_cells_write() local
[all …]
H A Dsecurity.c24 static int afs_alloc_anon_key(struct afs_cell *cell) in afs_alloc_anon_key() argument
29 key = cell->anonymous_key; in afs_alloc_anon_key()
31 key = rxrpc_get_null_key(cell->key_desc); in afs_alloc_anon_key()
33 cell->anonymous_key = key; in afs_alloc_anon_key()
41 cell->anonymous_key, key_serial(cell->anonymous_key)); in afs_alloc_anon_key()
48 struct key *afs_request_key(struct afs_cell *cell) in afs_request_key() argument
53 _enter("{%s}", cell->key_desc); in afs_request_key()
55 _debug("key %s", cell->key_desc); in afs_request_key()
56 key = request_key_net(&key_type_rxrpc, cell->key_desc, in afs_request_key()
57 cell->net->net, NULL); in afs_request_key()
[all …]
H A Dmntpt.c46 static const char afs_root_volume[] = "root.cell";
76 struct afs_cell *cell; in afs_mntpt_set_params() local
89 if (ctx->cell) { in afs_mntpt_set_params()
90 afs_unuse_cell(ctx->cell, afs_cell_trace_unuse_mntpt); in afs_mntpt_set_params()
91 ctx->cell = NULL; in afs_mntpt_set_params()
110 cell = afs_lookup_cell(ctx->net, p, size, NULL, in afs_mntpt_set_params()
113 if (IS_ERR(cell)) { in afs_mntpt_set_params()
114 pr_err("kAFS: unable to lookup cell '%pd'\n", mntpt); in afs_mntpt_set_params()
115 return PTR_ERR(cell); in afs_mntpt_set_params()
117 ctx->cell = cell; in afs_mntpt_set_params()
[all …]
/linux/drivers/md/
H A Ddm-bio-prison-v2.c74 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 …]
H A Ddm-bio-prison-v1.c23 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 …]
H A Ddm-bio-prison-v2.h25 * where they can't cause any mischief. Bios are put in a cell identified
26 * by a key, multiple bios can be in the same cell. When the cell is
62 * Eventually all bio prison clients should manage their own cell memory.
70 struct dm_bio_prison_cell_v2 *cell);
79 * cell, and later given to the holder of the exclusive lock.
97 * returning ownership of the cell (ie. you should free it).
100 struct dm_bio_prison_cell_v2 *cell);
103 * Locks a cell. No associated bio. Exclusive locks get priority. These
123 struct dm_bio_prison_cell_v2 *cell,
135 struct dm_bio_prison_cell_v2 *cell,
[all …]
/linux/drivers/nvmem/
H A Dcore.c344 struct nvmem_cell *cell = NULL; in nvmem_cell_attr_read() local
349 cell = nvmem_create_cell(entry, entry->name, 0); in nvmem_cell_attr_read()
350 if (IS_ERR(cell)) in nvmem_cell_attr_read()
351 return PTR_ERR(cell); in nvmem_cell_attr_read()
353 if (!cell) in nvmem_cell_attr_read()
356 content = nvmem_cell_read(cell, &cell_sz); in nvmem_cell_attr_read()
367 kfree_const(cell->id); in nvmem_cell_attr_read()
368 kfree(cell); in nvmem_cell_attr_read()
486 /* Initialize each attribute to take the name and size of the cell */ in nvmem_populate_sysfs_cells()
551 static void nvmem_cell_entry_drop(struct nvmem_cell_entry *cell) in nvmem_cell_entry_drop() argument
[all …]
/linux/sound/core/seq/
H A Dseq_prioq.c130 /* enqueue cell to prioq */
132 struct snd_seq_event_cell * cell) in snd_seq_prioq_cell_in() argument
138 if (snd_BUG_ON(!f || !cell)) in snd_seq_prioq_cell_in()
142 prior = (cell->event.flags & SNDRV_SEQ_PRIORITY_MASK); in snd_seq_prioq_cell_in()
150 if (compare_timestamp(&cell->event, &f->tail->event)) { in snd_seq_prioq_cell_in()
151 /* add new cell to tail of the fifo */ in snd_seq_prioq_cell_in()
152 f->tail->next = cell; in snd_seq_prioq_cell_in()
153 f->tail = cell; in snd_seq_prioq_cell_in()
154 cell->next = NULL; in snd_seq_prioq_cell_in()
159 /* traverse list of elements to find the place where the new cell is in snd_seq_prioq_cell_in()
[all …]
H A Dseq_fifo.c85 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()
103 struct snd_seq_event_cell *cell; in snd_seq_fifo_event_in() local
110 err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL, NULL); /* always non-blocking */ in snd_seq_fifo_event_in()
120 f->tail->next = cell; in snd_seq_fifo_event_in()
121 f->tail = cell; in snd_seq_fifo_event_in()
123 f->head = cell; in snd_seq_fifo_event_in()
124 cell->next = NULL; in snd_seq_fifo_event_in()
136 /* dequeue cell from fifo */
[all …]
H A Dseq_memory.c49 * 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 …]
/linux/drivers/clk/mmp/
H A Dreset.c16 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 …]
/linux/net/core/
H A Dgro_cells.c18 struct gro_cell *cell; in gro_cells_receive() local
32 cell = this_cpu_ptr(gcells->cells); in gro_cells_receive()
34 if (skb_queue_len(&cell->napi_skbs) > READ_ONCE(net_hotdata.max_backlog)) { in gro_cells_receive()
42 __skb_queue_tail(&cell->napi_skbs, skb); in gro_cells_receive()
43 if (skb_queue_len(&cell->napi_skbs) == 1) in gro_cells_receive()
44 napi_schedule(&cell->napi); in gro_cells_receive()
59 struct gro_cell *cell = container_of(napi, struct gro_cell, napi); in gro_cell_poll() local
64 __local_lock_nested_bh(&cell->bh_lock); in gro_cell_poll()
65 skb = __skb_dequeue(&cell->napi_skbs); in gro_cell_poll()
66 __local_unlock_nested_bh(&cell->bh_lock); in gro_cell_poll()
[all …]
/linux/Documentation/devicetree/bindings/net/
H A Dibm,emac.txt24 - mal-tx-channel : 1 cell, index of the tx channel on McMAL associated
26 - mal-rx-channel : 1 cell, index of the rx channel on McMAL associated
28 - cell-index : 1 cell, hardware index of the EMAC cell on a given
31 - max-frame-size : 1 cell, maximum frame size supported in bytes
32 - rx-fifo-size : 1 cell, Rx fifo size in bytes for 10 and 100 Mb/sec
35 - tx-fifo-size : 1 cell, Tx fifo size in bytes for 10 and 100 Mb/sec
38 - fifo-entry-size : 1 cell, size of a fifo entry (used to calculate
41 - mal-burst-size : 1 cell, MAL burst size (used to calculate thresholds)
48 - mdio-device : 1 cell, required iff using shared MDIO registers
51 - zmii-device : 1 cell, required iff connected to a ZMII. phandle of
[all …]
H A Dfsl,fman.yaml26 cell-index:
31 The cell-index value may be used by the SoC, to identify the
33 there's a description of the cell-index use in each SoC:
36 register[bit] FMan unit cell-index
41 register[bit] FMan unit cell-index
48 register[bit] FMan unit cell-index
91 channels in the FMan. The first cell specifies the beginning
92 of the range and the second cell specifies the number of
95 - description: The first cell specifies the beginning of the range.
97 The second cell specifies the number of channels.
[all …]
/linux/Documentation/devicetree/bindings/mips/cavium/
H A Dbootbus.txt13 - #address-cells: Must be <2>. The first cell is the chip select
14 within the bootbus. The second cell is the offset from the chip select.
29 - cavium,cs-index: A single cell indicating the chip select that
32 - cavium,t-adr: A cell specifying the ADR timing (in nS).
34 - cavium,t-ce: A cell specifying the CE timing (in nS).
36 - cavium,t-oe: A cell specifying the OE timing (in nS).
38 - cavium,t-we: A cell specifying the WE timing (in nS).
40 - cavium,t-rd-hld: A cell specifying the RD_HLD timing (in nS).
42 - cavium,t-wr-hld: A cell specifying the WR_HLD timing (in nS).
44 - cavium,t-pause: A cell specifying the PAUSE timing (in nS).
[all …]
/linux/arch/arm64/boot/dts/freescale/
H A Dqoriq-qman-portals.dtsi22 cell-index = <0>;
29 cell-index = <1>;
36 cell-index = <2>;
43 cell-index = <3>;
50 cell-index = <4>;
57 cell-index = <5>;
64 cell-index = <6>;
71 cell-index = <7>;
78 cell-index = <8>;
85 cell-index = <9>;
/linux/rust/pin-init/examples/
H A Dstatic_init.rs9 cell::{Cell, UnsafeCell},
27 cell: UnsafeCell<MaybeUninit<T>>, field
28 init: Cell<Option<I>>,
30 present: Cell<bool>,
39 cell: UnsafeCell::new(MaybeUninit::uninit()), in new()
40 init: Cell::new(Some(init)), in new()
42 present: Cell::new(false), in new()
51 unsafe { (*self.cell.get()).assume_init_ref() } in deref()
58 return unsafe { (*self.cell.get()).assume_init_ref() }; in deref()
61 let ptr = self.cell.get().cast::<T>(); in deref()
[all …]
/linux/Documentation/driver-api/
H A Dnvmem.rst62 Device drivers can define and register an nvmem cell using the nvmem_cell_info
75 Additionally it is possible to create nvmem cell lookup entries and register
93 3. NVMEM cell based consumer APIs
102 void nvmem_cell_put(struct nvmem_cell *cell);
103 void devm_nvmem_cell_put(struct device *dev, struct nvmem_cell *cell);
105 void *nvmem_cell_read(struct nvmem_cell *cell, ssize_t *len);
106 int nvmem_cell_write(struct nvmem_cell *cell, void *buf, ssize_t len);
108 `*nvmem_cell_get()` apis will get a reference to nvmem cell for a given id,
109 and nvmem_cell_read/write() can then read or write to the cell.
110 Once the usage of the cell is finished the consumer should call
[all …]
/linux/arch/powerpc/boot/dts/fsl/
H A Dt4240si-post.dtsi171 cell-index = <1>;
177 cell-index = <2>;
578 cell-index = <0x0>;
584 cell-index = <0x1>;
590 cell-index = <0x2>;
596 cell-index = <0x3>;
602 cell-index = <0x4>;
608 cell-index = <0x5>;
614 cell-index = <0x6>;
620 cell-index = <0x7>;
[all …]

12345678910>>...41