HomeSort by: relevance | last modified time | path
    Searched defs:children (Results 1 - 12 of 12) sorted by relevancy

  /src/usr.bin/audiocfg/
drvctl.c 39 size_t children; local in function:drvctl_list
45 children = laa->l_children;
46 laa->l_childname = malloc(children * sizeof(laa->l_childname[0]));
  /src/tests/lib/librt/
t_sem.c 125 pid_t children[NCHILDREN]; local in function:ATF_TC_BODY
151 children[i] = pid;
163 ATF_REQUIRE_EQ(waitpid(children[i], &status, 0), children[i]);
235 pid_t pid, children[NCHILDREN]; local in function:ATF_TC_BODY
254 children[i] = pid;
270 ATF_REQUIRE_EQ(waitpid(children[i], &status, 0), children[i]);
  /src/sbin/devpubd/
devpubd.c 163 size_t len, children, n; local in function:devpubd_probe
181 /* If this device has no children, return */
187 children = laa.l_children;
189 len = children * sizeof(laa.l_childname[0]);
205 if (children != laa.l_children)
  /src/sys/arch/arm/broadcom/
bcm53xx_cca.c 213 bool children = false; local in function:bcmcca_uart_attach
218 children = true;
227 children = true;
234 if (children) {
236 * If we configured children, enable interrupts for the UART(s).
  /src/sbin/drvctl/
drvctl.c 296 size_t children; local in function:list_children
310 children = laa.l_children;
312 laa.l_childname = malloc(children * sizeof(laa.l_childname[0]));
317 if (laa.l_children > children)
318 err(EXIT_FAILURE, "DRVLISTDEV: number of children grew");
  /src/dist/pf/sbin/pfctl/
pfctl_qstats.c 64 struct pf_altq_node *children; member in struct:pf_altq_node
187 node->next = node->children = NULL;
203 if (parent->children == NULL)
204 parent->children = node;
206 struct pf_altq_node *prev = parent->children;
226 if (node->children != NULL) {
227 child = pfctl_find_altq_node(node->children, qname,
247 if (node->children != NULL) {
249 for (child = node->children; child != NULL;
267 for (child = node->children; child != NULL
    [all...]
  /src/usr.sbin/usbdevs/
usbdevs.c 343 size_t children; local in function:get_highest_usb_device_unit
350 * Look for children that match "usb[0-9]*". The high
366 children = laa.l_children;
368 laa.l_childname = calloc(children, sizeof(laa.l_childname[0]));
373 if (laa.l_children > children)
374 err(EXIT_FAILURE, "DRVLISTDEV: number of children grew");
  /src/sys/fs/hfs/
hfs_vnops.c 861 hfs_catalog_keyed_record_t *children; local in function:hfs_vop_readdir
874 children = NULL;
900 &children, &childnames, &numchildren, &cbargs) != 0) {
936 curent.d_fileno = children[curchild].file.cnid;
937 switch (hfs_catalog_keyed_record_vtype(children+curchild)) {
979 if (children != NULL)
980 free(children, M_TEMP);
  /src/usr.sbin/ofctl/
ofctl.c 165 prop_array_t children; local in function:of_tree_fill
178 children = prop_dictionary_get(dict, "children");
179 if (children) {
180 count = prop_array_count(children);
184 prop_array_get(children, i),
241 prop_array_t children; local in function:of_proplib_tree_fill
281 children = NULL;
283 if (children == NULL)
284 children = prop_array_create()
    [all...]
  /src/usr.bin/make/
suff.c 185 SuffixList children; member in struct:Suffix
217 * Count of existing children, only used for memory management, so we
384 Lst_Done(&suff->children);
438 SuffixList_Insert(&targSuff->children, srcSuff);
450 Lst_Init(&suff->children);
591 Lst_Done(&gn->children);
592 Lst_Init(&gn->children);
617 * If the node has no commands or children, the children and parents lists
635 if (!Lst_IsEmpty(&gn->commands) || !Lst_IsEmpty(&gn->children)) {
    [all...]
make.h 268 * its children are up-to-date.
307 * Target is out-of-date only if any of its children was out-of-date.
310 /* Assume the children of the node have been already made. */
332 * made first, including its children. Once that is finished,
333 * source2 is made, including its children. The .WAIT keyword may
387 /* children of this target were made */
389 /* children don't exist, and we pretend made */
443 /* The number of unmade children */
466 GNodeList children; member in struct:GNode
  /src/sys/dist/pf/net/
pfvar.h 911 struct pf_anchor_node children; member in struct:pf_anchor

Completed in 21 milliseconds