Searched refs:child (Results 226 - 250 of 843) sorted by relevance

1234567891011>>

/linux-master/drivers/usb/dwc3/
H A Ddwc3-st.c200 struct device_node *node = dev->of_node, *child; local
254 child = of_get_compatible_child(node, "snps,dwc3");
255 if (!child) {
268 child_pdev = of_find_device_by_node(child);
276 of_node_put(child);
298 of_node_put(child);
/linux-master/drivers/gpio/
H A Dgpio-ixp4xx.c184 unsigned int child,
193 if (child == 0) {
197 if (child == 1) {
201 if (child >= 2 && child <= 12) {
202 *parent = child + 17;
183 ixp4xx_gpio_child_to_parent_hwirq(struct gpio_chip *gc, unsigned int child, unsigned int child_type, unsigned int *parent, unsigned int *parent_type) argument
/linux-master/drivers/mfd/
H A Dqcom-spmi-pmic.c87 struct device_node *child; local
111 for_each_child_of_node(spmi_bus, child) {
112 ret = of_property_read_u32_index(child, "reg", 0, &pmic_addr);
114 of_node_put(child);
120 sdev = spmi_find_device_by_of_node(child);
128 of_node_put(child);
225 * This function takes a struct device for a driver which is a child of a PMIC.
237 * Make sure the device is actually a child of a PMIC
/linux-master/drivers/pinctrl/intel/
H A Dpinctrl-intel-platform.c61 struct fwnode_handle *child,
70 ret = fwnode_property_read_string(child, "intc-gpio-group-name", &name);
74 ret = fwnode_property_read_u32(child, "intc-gpio-pad-count", &size);
93 struct fwnode_handle *child; local
134 device_for_each_child_node(dev, child) {
139 ret = intel_platform_pinctrl_prepare_group(dev, child, gpp, pins);
60 intel_platform_pinctrl_prepare_group(struct device *dev, struct fwnode_handle *child, struct intel_padgroup *gpp, struct intel_platform_pins *pins) argument
/linux-master/drivers/phy/marvell/
H A Dphy-berlin-sata.c191 struct device_node *child; local
232 for_each_available_child_of_node(dev->of_node, child) {
235 if (of_property_read_u32(child, "reg", &phy_id)) {
237 child);
243 dev_err(dev, "invalid reg in node %pOFn\n", child);
276 of_node_put(child);
/linux-master/drivers/phy/socionext/
H A Dphy-uniphier-usb2.c109 struct device_node *parent, *child; local
132 for_each_child_of_node(dev->of_node, child) {
149 priv->phy = devm_phy_create(dev, child, &uniphier_u2phy_ops);
156 ret = of_property_read_u32(child, "reg", &data_idx);
166 child->full_name);
179 of_node_put(child);
/linux-master/fs/bcachefs/
H A Deytzinger.h32 static inline unsigned eytzinger1_child(unsigned i, unsigned child) argument
34 EYTZINGER_BUG_ON(child > 1);
36 return (i << 1) + child;
175 static inline unsigned eytzinger0_child(unsigned i, unsigned child) argument
177 EYTZINGER_BUG_ON(child > 1);
179 return (i << 1) + 1 + child;
/linux-master/drivers/firewire/
H A Dcore-topology.c131 * the hop count is the sum of the two biggest child depths plus 2.
133 * containted in a child tree, in which case the max hop count is just
134 * the max hop count of this child.
175 struct fw_node *node, *child, *local_node, *irm_node; local
214 * start of the child nodes for this node.
222 child = fw_node(h);
256 node->ports[i] = child;
259 * child node.
261 child->ports[child
318 struct fw_node *node, *next, *child, *parent; local
[all...]
/linux-master/include/linux/
H A Dof.h57 struct device_node *child; member in struct:device_node
1462 #define for_each_child_of_node(parent, child) \
1463 for (child = of_get_next_child(parent, NULL); child != NULL; \
1464 child = of_get_next_child(parent, child))
1466 #define for_each_child_of_node_scoped(parent, child) \
1467 for (struct device_node *child __free(device_node) = \
1469 child != NULL; \
1470 child
1495 struct device_node *child; local
1506 struct device_node *child; local
[all...]
/linux-master/drivers/leds/flash/
H A Dleds-lm3601x.c359 struct fwnode_handle *child = NULL; local
362 child = device_get_next_child_node(&led->client->dev, child);
363 if (!child) {
368 ret = fwnode_property_read_u32(child, "reg", &led->led_mode);
381 ret = fwnode_property_read_u32(child, "led-max-microamp",
389 ret = fwnode_property_read_u32(child, "flash-max-microamp",
397 ret = fwnode_property_read_u32(child, "flash-max-timeout-us",
405 *fwnode = child;
408 fwnode_handle_put(child);
[all...]
/linux-master/arch/powerpc/kernel/
H A Deeh_pe.c92 list_add_tail(&pe->child, &eeh_phb_pe);
162 list_for_each_entry(pe, &eeh_phb_pe, child) {
191 next = pe->child.next;
198 return list_entry(next, struct eeh_pe, child);
208 * child PEs. The traversing is to be terminated once the
233 * PE and its child PEs.
301 * a new PE is created and inserted into the PE tree as a child of
380 list_add_tail(&pe->child, &new_pe_parent->child_list);
383 * Put the newly created PE into the child list and
405 struct eeh_pe *pe, *parent, *child; local
[all...]
/linux-master/net/sched/
H A Dsch_sfb.c78 u32 childdrop; /* drops in child qdisc */
285 struct Qdisc *child = q->qdisc; local
405 ret = qdisc_enqueue(skb, child, to_free);
429 struct Qdisc *child = q->qdisc; local
432 skb = child->dequeue(q->qdisc);
447 struct Qdisc *child = q->qdisc; local
449 return child->ops->peek(child);
452 /* No sfb_drop -- impossible since the child doesn't return the dropped skb. */
494 struct Qdisc *child, *ol local
[all...]
/linux-master/drivers/of/
H A Dplatform.c333 * recursively create devices for all the child nodes.
341 struct device_node *child; local
385 for_each_child_of_node(bus, child) {
386 pr_debug(" create child: %pOF\n", child);
387 rc = of_platform_bus_create(child, matches, lookup, &dev->dev, strict);
389 of_node_put(child);
410 struct device_node *child; local
423 } else for_each_child_of_node(root, child) {
424 if (!of_match_node(matches, child))
462 struct device_node *child; local
[all...]
/linux-master/drivers/input/gameport/
H A Dgameport.c424 * Destroy child gameport port (if any) that has not been fully registered yet.
426 * Note that we rely on the fact that port can have only one child and therefore
427 * only one child registration request can be pending. Additionally, children
429 * pending registration together with a child.
434 struct gameport *gameport, *child = NULL; local
443 child = gameport;
450 return child;
583 gameport->parent->child = gameport;
611 struct gameport *child; local
613 child
[all...]
/linux-master/tools/testing/selftests/x86/
H A Damx.c498 pid_t parent, child, grandchild; local
513 /* fork() succeeded. Now in the child . */
517 printf("\tFork a child.\n");
518 child = fork();
519 if (child < 0) {
521 } else if (child > 0) {
526 fatal_error("arch_prctl test child exit");
534 printf("\tTest XCOMP_PERM at child.\n");
541 printf("\tTest dynamic sigaltstack at child:\n");
545 printf("\tTest XCOMP_PERM again at child
626 pid_t child, grandchild; local
887 pid_t child; local
[all...]
/linux-master/Documentation/sphinx/
H A DrstFlatTable.py322 for child in rowItem:
323 if (isinstance(child , nodes.comment)
324 or isinstance(child, nodes.system_message)):
326 elif isinstance(child , nodes.target):
327 target = child
328 elif isinstance(child, nodes.bullet_list):
330 cell = child
/linux-master/drivers/gpu/drm/pl111/
H A Dpl111_versatile.c384 struct device_node *child; local
404 for_each_available_child_of_node(root, child) {
405 if (of_device_is_compatible(child, "arm,pl111")) {
407 ct_clcd = child;
408 of_node_put(child);
411 if (of_device_is_compatible(child, "arm,hdlcd")) {
413 of_node_put(child);
/linux-master/drivers/input/keyboard/
H A Diqs62x-keys.c48 struct fwnode_handle *child; local
71 child = device_get_named_child_node(&pdev->dev,
73 if (!child)
76 ret = fwnode_property_read_u32(child, "linux,code", &val);
80 fwnode_handle_put(child);
86 if (fwnode_property_present(child, "azoteq,use-prox"))
95 fwnode_handle_put(child);
137 * corresponding child nodes are present.
/linux-master/tools/testing/selftests/devices/
H A Dtest_discoverable_devices.py203 def fill_meta_keys(child, parent=None):
204 child["meta"] = {}
207 child["meta"]["type"] = parent["type"].replace("controller", "device")
209 pathname = generate_pathname(child)
212 child["meta"]["pathname"] = pathname
249 for child in device["devices"]:
250 parse_node(child)
/linux-master/drivers/hwmon/
H A Dltc2991.c287 struct fwnode_handle *child; local
297 device_for_each_child_node(dev, child) {
298 ret = fwnode_property_read_u32(child, "reg", &addr);
300 fwnode_handle_put(child);
305 fwnode_handle_put(child);
309 ret = fwnode_property_read_u32(child,
337 ret = fwnode_property_read_bool(child,
/linux-master/net/ipv4/
H A Dinet_connection_sock.c704 * NULL to signify that the child socket is taken
948 * because the child socket is locked in inet_csk_listen_stop().
1299 struct sock *child)
1301 sk->sk_prot->disconnect(child, O_NONBLOCK);
1303 sock_orphan(child);
1308 BUG_ON(rcu_access_pointer(tcp_sk(child)->fastopen_rsk) != req);
1312 * an inbound pkt destined for child is
1317 RCU_INIT_POINTER(tcp_sk(child)->fastopen_rsk, NULL);
1319 inet_csk_destroy_sock(child);
1324 struct sock *child)
1298 inet_child_forget(struct sock *sk, struct request_sock *req, struct sock *child) argument
1322 inet_csk_reqsk_queue_add(struct sock *sk, struct request_sock *req, struct sock *child) argument
1347 inet_csk_complete_hashdance(struct sock *sk, struct sock *child, struct request_sock *req, bool own_req) argument
1412 struct sock *child = req->sk, *nsk; local
[all...]
/linux-master/drivers/pci/
H A Dof_property.c23 * Each entry in the ranges table is a tuple containing the child address,
24 * the parent address, and the size of the region in the child address space.
26 * side and the child address is the corresponding address on the secondary
137 * For endpoint device, the lower 64-bits of child
194 struct pci_dev *child; local
224 list_for_each_entry(child, &pdev->subordinate->devices, bus_list) {
226 i = pci_swizzle_interrupt_pin(child, pin) - 1;
245 list_for_each_entry(child, &pdev->subordinate->devices, bus_list) {
247 i = pci_swizzle_interrupt_pin(child, pin) - 1;
251 *mapp = (child
[all...]
/linux-master/drivers/md/persistent-data/
H A Ddm-btree-remove.c53 * Once this rebalancing has occurred we can then step into the child node
155 struct child { struct
163 unsigned int index, struct child *result)
187 static void exit_child(struct dm_btree_info *info, struct child *c)
237 struct child *l, struct child *r)
245 * Ensure the number of entries in each child will be greater
247 * child is used for removal, the number will still be not
284 struct child left, right;
312 struct child *
492 struct dm_block *child; local
[all...]
/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/arch/sparc/kernel/
H A Dptrace_32.c37 void ptrace_disable(struct task_struct *child) argument
360 long arch_ptrace(struct task_struct *child, long request, argument
375 ret = copy_regset_to_user(child, &ptrace32_view,
383 ret = copy_regset_from_user(child, &ptrace32_view,
391 ret = copy_regset_to_user(child, &ptrace32_view,
399 ret = copy_regset_from_user(child, &ptrace32_view,
408 ret = ptrace_readdata(child, addr, addr2p, data);
418 ret = ptrace_writedata(child, addr2p, addr, data);
429 ret = ptrace_request(child, request, addr, data);

Completed in 282 milliseconds

1234567891011>>