Searched refs:child (Results 1 - 25 of 840) sorted by last modified time

1234567891011>>

/linux-master/fs/btrfs/
H A Dioctl.c972 struct inode *dir, struct dentry *child)
974 if (d_really_is_positive(child))
971 btrfs_may_create(struct mnt_idmap *idmap, struct inode *dir, struct dentry *child) argument
/linux-master/drivers/spi/
H A Dspi.c741 dev_dbg(dev, "registered child %s\n", dev_name(&spi->dev));
2534 * of_register_spi_devices() - Register child devices onto the SPI bus
2537 * Registers an spi_device for each child node of controller node which
2971 struct device *child; local
2973 child = device_find_any_child(&ctlr->dev);
2974 return sysfs_emit(buf, "%s\n", child ? to_spi_device(child)->modalias : NULL);
2983 struct device *child; local
2991 child = device_find_any_child(&ctlr->dev);
2992 if (child) {
[all...]
/linux-master/drivers/net/dsa/mv88e6xxx/
H A Dchip.c3845 struct device_node *child; local
3852 child = of_get_child_by_name(np, "mdio");
3853 err = mv88e6xxx_mdio_register(chip, child, false);
3854 of_node_put(child);
3862 for_each_available_child_of_node(np, child) {
3864 child, "marvell,mv88e6xxx-mdio-external")) {
3865 err = mv88e6xxx_mdio_register(chip, child, true);
3868 of_node_put(child);
/linux-master/drivers/pinctrl/renesas/
H A Dpinctrl-rzg2l.c748 struct device_node *child; local
756 for_each_child_of_node(np, child) {
757 ret = rzg2l_dt_subnode_to_map(pctldev, child, np, map,
760 of_node_put(child);
1987 unsigned int child,
1997 gpioint = rzg2l_gpio_get_gpioint(child, pctrl);
2001 ret = rzg2l_gpio_interrupt_input_mode(gc, child);
2013 rzg2l_gpio_irq_endisable(pctrl, child, true);
2014 pctrl->hwirq[irq] = child;
2023 rzg2l_gpio_free(gc, child);
1986 rzg2l_gpio_child_to_parent_hwirq(struct gpio_chip *gc, unsigned int child, unsigned int child_type, unsigned int *parent, unsigned int *parent_type) argument
[all...]
/linux-master/kernel/sched/
H A Dfair.c338 * If parent is already on the list, we add the child
340 * the list, this means to put the child at the tail
4051 * Because list_add_leaf_cfs_rq always places a child cfs_rq on the list
4054 * is our child.
4055 * If cfs_rq is not on the list, test whether a child needs its to be added to
7196 sd = sd->child;
7202 sd = sd->child;
7209 sd = sd->child;
9363 * This needs to be done in a top-down fashion because the load of a child
9555 struct sched_domain *child local
[all...]
/linux-master/fs/erofs/
H A Dsuper.c562 static struct dentry *erofs_get_parent(struct dentry *child) argument
568 err = erofs_namei(d_inode(child), &dotdot_name, &nid, &d_type);
571 return d_obtain_alias(erofs_iget(child->d_sb, nid));
/linux-master/drivers/phy/marvell/
H A Dphy-mvebu-a3700-comphy.c1245 struct device_node *child; local
1305 for_each_available_child_of_node(pdev->dev.of_node, child) {
1311 ret = of_property_read_u32(child, "reg", &lane_id);
1325 of_node_put(child);
1329 phy = devm_phy_create(&pdev->dev, child,
1332 of_node_put(child);
/linux-master/tools/testing/selftests/mm/
H A Dprotection_keys.c452 /* in the child */
454 dprintf1("child sleeping...\n");
1198 /* in the child */
1388 * Fork a child which is an exact copy of this process, of course.
1393 dprintf1("[%d] child pid: %d\n", getpid(), child_pid);
1549 pid_t child; local
1562 child = fork();
1563 pkey_assert(child >= 0);
1564 dprintf3("[%d] fork() ret: %d\n", getpid(), child);
1565 if (!child) {
[all...]
/linux-master/tools/testing/selftests/
H A Dkselftest_harness.h383 pid_t child = 1; \
389 child = vfork(); \
390 if (child == 0) { \
397 } else if (child < 0 || child != waitpid(child, &status, 0)) { \
404 if (child == 0) { \
/linux-master/net/bluetooth/
H A Dhci_conn.c1053 struct hci_conn *child = link->conn; local
1055 hci_conn_unlink(child);
1065 hci_conn_cleanup_child(child, conn->abort_reason);
/linux-master/fs/ntfs3/
H A Dntfs_fs.h734 struct dentry *ntfs3_get_parent(struct dentry *child);
/linux-master/drivers/mtd/nand/raw/
H A Dqcom_nandc.c3322 struct device_node *dn = dev->of_node, *child; local
3326 for_each_available_child_of_node(dn, child) {
3329 of_node_put(child);
3333 ret = qcom_nand_host_init_and_register(nandc, host, child);
/linux-master/drivers/mtd/nand/raw/brcmnand/
H A Dbrcmnand.c3085 struct device_node *dn = dev->of_node, *child; local
3264 for_each_available_child_of_node(dn, child) {
3265 if (of_device_is_compatible(child, "brcm,nandcs")) {
3269 of_node_put(child);
3276 ret = of_property_read_u32(child, "reg", &host->cs);
3283 nand_set_flash_node(&host->chip, child);
3288 of_node_put(child);
/linux-master/arch/arc/kernel/
H A Dentry.S51 ; when the forked child comes here from the __switch_to function
/linux-master/fs/smb/server/
H A Dvfs.c53 * @child: child dentry
57 int ksmbd_vfs_lock_parent(struct dentry *parent, struct dentry *child) argument
60 if (child->d_parent != parent) {
/linux-master/fs/smb/client/
H A Dcifsfs.c862 struct dentry *child; local
880 child = lookup_positive_unlocked(p, dentry, s - p);
882 dentry = child;
/linux-master/fs/bcachefs/
H A Dfs.c1314 static struct dentry *bch2_get_parent(struct dentry *child) argument
1316 struct bch_inode_info *inode = to_bch_ei(child->d_inode);
1327 static int bch2_get_name(struct dentry *parent, char *name, struct dentry *child) argument
1329 struct bch_inode_info *inode = to_bch_ei(child->d_inode);
H A Dbtree_update_interior.c58 * Verify that child nodes correctly span parent node's range:
129 prt_str(&buf, "last child node doesn't end at end of parent node\n");
709 * to child nodes that weren't written yet: now, the child nodes have
906 struct btree_update *child)
912 child->b = NULL;
913 child->mode = BTREE_UPDATE_update;
915 bch2_journal_pin_copy(&c->journal, &as->journal, &child->journal,
1554 * nodes that were coalesced, and thus in the middle of a child node post
905 btree_update_reparent(struct btree_update *as, struct btree_update *child) argument
H A Dbtree_gc.c288 struct btree *child, struct bpos *pulled_from_scan)
293 if (bpos_eq(child->key.k.p, b->key.k.p))
300 prt_str(&buf, "\n child: ");
301 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&child->key));
308 bpos_successor(child->key.k.p), b->key.k.p);
315 ret = set_node_max(c, child, b->key.k.p);
976 struct btree *child; local
981 child = bch2_btree_node_get_noiter(trans, cur.k,
984 ret = PTR_ERR_OR_ZERO(child);
1016 ret = bch2_gc_btree_init_recurse(trans, child,
287 btree_repair_node_end(struct bch_fs *c, struct btree *b, struct btree *child, struct bpos *pulled_from_scan) argument
[all...]
/linux-master/drivers/usb/typec/tcpm/
H A Dtcpm.c7007 struct fwnode_handle *capabilities, *child, *caps = NULL; local
7073 fwnode_for_each_child_node(capabilities, child)
/linux-master/drivers/usb/core/
H A Dport.c134 if (disabled && port_dev->child)
135 usb_disconnect(&port_dev->child);
261 struct usb_device *udev = port_dev->child;
351 struct usb_device *udev = port_dev->child;
392 /* Force the child awake to revalidate after the power loss. */
452 if (port_dev->child) {
453 usb_disable_usb2_hardware_lpm(port_dev->child);
454 usb_unlocked_disable_lpm(port_dev->child);
672 peer_hdev = upstream->peer->child;
709 if (port_dev->child)
[all...]
/linux-master/drivers/interconnect/
H A Dcore.c1080 struct device_node *child; local
1083 for_each_available_child_of_node(np, child) {
1084 if (of_property_read_bool(child, "#interconnect-cells") &&
1085 likely(!of_match_node(ignore_list, child)))
1087 count += of_count_icc_providers(child);
/linux-master/drivers/clk/
H A Dclk.c389 struct clk_core *child; local
395 hlist_for_each_entry(child, &core->children, child_node) {
396 ret = __clk_lookup_subtree(name, child);
1321 struct clk_core *child; local
1324 hlist_for_each_entry(child, &core->children, child_node) {
1325 ret = clk_core_save_context(child);
1338 struct clk_core *child; local
1343 hlist_for_each_entry(child, &core->children, child_node)
1344 clk_core_restore_context(child);
1459 struct clk_core *child; local
1484 struct clk_core *child; local
1881 struct clk_core *child; local
1960 struct clk_core *child; local
2082 struct clk_core *child; local
2231 struct clk_core *child; local
2262 struct clk_core *child; local
2372 struct clk_core *child, *tmp_clk, *fail_clk = NULL; local
2409 struct clk_core *child; local
3341 struct clk_core *child; local
3401 struct clk_core *child; local
4530 struct clk_core *child; local
4589 struct clk_core *child; local
[all...]
/linux-master/block/
H A Dblk-iocost.c1113 struct ioc_gq *child = iocg->ancestors[lvl + 1]; local
1117 parent->child_active_sum += (s32)(active - child->active);
1118 parent->child_inuse_sum += (s32)(inuse - child->inuse);
1120 child->active = active;
1121 child->inuse = inuse;
1193 struct ioc_gq *child = iocg->ancestors[lvl + 1]; local
1196 u32 active = READ_ONCE(child->active);
1197 u32 inuse = READ_ONCE(child->inuse);
1235 struct ioc_gq *child = iocg->ancestors[lvl + 1]; local
1237 child_inuse_sum = parent->child_inuse_sum + inuse - child
[all...]
/linux-master/arch/x86/kvm/mmu/
H A Dmmu.c1838 struct kvm_mmu_page *child; local
1846 child = spte_to_child_sp(ent);
1848 if (child->unsync_children) {
1849 if (mmu_pages_add(pvec, child, i))
1852 ret = __mmu_unsync_walk(child, pvec);
1860 } else if (child->unsync) {
1862 if (mmu_pages_add(pvec, child, i))
2340 * bit 21 in the PTE (the child here), KVM propagates that bit to the
2474 struct kvm_mmu_page *child; local
2483 child
2497 struct kvm_mmu_page *child; local
2935 struct kvm_mmu_page *child; local
[all...]

Completed in 384 milliseconds

1234567891011>>