Home
last modified time | relevance | path

Searched full:children (Results 1 – 25 of 1269) sorted by relevance

12345678910>>...51

/freebsd/tests/sys/kern/
H A Dsysctl_security_jail_children.sh36 origin_max=$(sysctl -n security.jail.children.max)
37 origin_cur=$(sysctl -n security.jail.children.cur)
43 # - maxallowed.family wants to set children.max=4
44 # - it means that its parent (maxallowed) should have at least children.max=5
45 # - it makes the origin (parent of maxallowed) provide children.max=6 minimum
49 test $origin_max -ge 6 || atf_skip "Not high enough children.max limit for the test."
52 atf_check_equal "$((origin_cur + 1))" "$(sysctl -n security.jail.children.cur)"
53 atf_check_equal "0" "$(jexec childfree sysctl -n security.jail.children.max)"
54 atf_check_equal "0" "$(jexec childfree sysctl -n security.jail.children.cur)"
56 jail -c name=maxallowed children.max=$((origin_max - 1)) persist
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/synctask_core/
H A Dtst.list_children.ksh21 # Listing zfs children should work correctly.
26 log_assert "Listing zfs children should work correctly."
43 # 0 children handled correctly
46 for s in zfs.list.children("$TESTPOOL/$TESTFS") do
55 for s in zfs.list.children("$TESTPOOL") do
68 for s in zfs.list.children("$TESTPOOL/$TESTFS") do
80 # All children appear exactly once
88 for s in zfs.list.children("$TESTPOOL/$TESTFS") do
103 zfs.list.children("$TESTPOOL/not-a-fs")
108 zfs.list.children("not-a-pool/$TESTFS")
[all …]
/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DNodes.cpp112 std::vector<syntax::NameSpecifier *> Children; in getSpecifiers() local
114 Children.push_back(llvm::cast<syntax::NameSpecifier>(Element)); in getSpecifiers()
116 return Children; in getSpecifiers()
123 Children; in getSpecifiersAndDoubleColons() local
125 Children.push_back( in getSpecifiersAndDoubleColons()
129 return Children; in getSpecifiersAndDoubleColons()
134 std::vector<syntax::Expression *> Children; in getArguments() local
136 Children.push_back(llvm::cast<syntax::Expression>(ArgumentAsNode)); in getArguments()
138 return Children; in getArguments()
144 std::vector<syntax::List::ElementAndDelimiter<syntax::Expression>> Children; in getArgumentsAndCommas() local
[all …]
/freebsd/tools/test/stress2/misc/
H A Dgraid1_11.sh22 local children
24 children=$(pgrep -P "$1")
25 for pid in $children ; do
28 echo "$children"
49 children=""
62 children="${children:+${children},}$!"
68 pkill -P ${children} -x dd
70 # Reap background children
H A Dcontext.sh58 * Pass a token thru pipes to CHILDREN+1 processes in a circular list
71 #define CHILDREN 64
74 int fds[CHILDREN +1 ][2];
75 pid_t pid[CHILDREN];
90 for (i = 0; i < CHILDREN + 1; i++) {
97 for (i = 0; i < CHILDREN; i++) {
121 if (read(fds[CHILDREN][0], &token, sizeof(token))
126 for (i = 0; i < CHILDREN; i++)
/freebsd/contrib/llvm-project/lldb/include/lldb/Core/
H A DFormatEntity.h114 /// The number of children of this node in the tree of format strings.
117 const Definition *children = nullptr;
134 const Definition *children,
136 : name(name), type(t), num_children(num_children), children(children),
143 const Definition (&children)[N],
145 return Definition(name, t, N, children, keep_separator);
161 void AppendEntry(const Entry &&entry) { children.push_back(entry); }
166 children.clear(); in Clear()
182 const size_t n = children
118 const Definition *children = nullptr; global() member
202 std::vector<Entry> children; global() member
[all...]
/freebsd/contrib/llvm-project/clang/lib/Tooling/
H A DFileMatchTrie.cpp52 /// - If the node has a path 'p2' but no children, take the last path segment
69 if (Children.empty()) { in insert()
76 Children[Element].Path = Path; in insert()
80 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert()
94 /// - .. have children. In this case it is checked
98 /// - .. a child matching the next path segment. In this case, all children of
99 /// 'n' are an equally good match for 'p'. All children are of 'n' are found
109 if (Children.empty()) { in findEquivalent()
121 Children.find(Element); in findEquivalent()
122 if (MatchingChild != Children.end()) { in findEquivalent()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/cmd/
H A Ddraid.c45 #define MAP_CHILDREN "children"
129 * which are indexed by the number of children. The caller is responsible
339 " children: %llu\n" in dump_map()
406 alloc_new_map(uint64_t children, uint64_t nperms, uint64_t seed, in alloc_new_map() argument
416 map->dm_children = children; in alloc_new_map()
433 * Allocate the fixed permutation map for N children.
436 alloc_fixed_map(uint64_t children, draid_map_t **mapp) in alloc_fixed_map() argument
442 error = vdev_draid_lookup_map(children, &fixed_map); in alloc_fixed_map()
496 uint64_t children = map->dm_children; in eval_resilver() local
498 uint64_t ndisks = children - nspares; in eval_resilver()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Rewrite/
H A DDeltaTree.cpp32 /// former and adds children pointers. Each node knows the full delta of all
83 /// all children nodes.
126 DeltaTreeNode *Children[2*WidthFactor]; member in __anon5fc690450111::DeltaTreeInteriorNode
130 Children[i]->Destroy(); in ~DeltaTreeInteriorNode()
138 Children[0] = IR.LHS; in DeltaTreeInteriorNode()
139 Children[1] = IR.RHS; in DeltaTreeInteriorNode()
147 return Children[i]; in getChild()
152 return Children[i]; in getChild()
219 // the value into one of the children, and return the result. in DoInsertion()
232 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zpool_create/
H A Dzpool_create_draid_003_pos.ksh34 # 1) Test valid stripe/spare combinations given the number of children.
35 # 2) Test invalid stripe/spare/children combinations outside the allow limits.
61 children=$(random_int_between $min_children 32)
63 draid="draid${parity}:${data}d:${children}c:${spares}s"
65 draid_vdevs=$(echo $TESTDIR/file.{01..$children})
75 children=32
76 draid_vdevs=$(echo $TESTDIR/file.{01..$children})
89 # Exceeds maximum data disks (limited by total children)
101 # Spares are limited: spares < children - (parity + data).
106 # The required children argument is enforced.
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp63 Parent.Children[Edge] = N; in insertLeaf()
77 Parent->Children[Edge] = N; in insertInternalNode()
103 for (auto &ChildPair : InternalNode->Children) { in setSuffixIndices()
109 // No children, so we are at the end of the string. in setSuffixIndices()
124 // This keeps track of nodes whose children have been added to the stack. in setLeafNodes()
125 // The value is a pair, representing a node's first and last children. in setLeafNodes()
138 // Its children have not been added to the stack yet. in setLeafNodes()
139 // We add current node back, and add its children to the stack. in setLeafNodes()
140 // We keep track of the first and last children of the current node. in setLeafNodes()
141 auto J = CurrInternalNode->Children.begin(); in setLeafNodes()
[all …]
/freebsd/sys/contrib/openzfs/cmd/zpool/
H A Dzpool_vdev.c494 uint_t c, children; in get_replication() local
532 &child, &children) != 0) { in get_replication()
572 for (c = 0; c < children; c++) { in get_replication()
814 uint_t children; in check_replication() local
832 * for spares there may be no children, and therefore no in check_replication()
836 &child, &children) != 0) || (children == 0)) { in check_replication()
844 if (num_logs(newroot) == children) { in check_replication()
966 uint_t c, children; in make_disks() local
979 &child, &children) != 0) { in make_disks()
1117 for (c = 0; c < children; c++) in make_disks()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DNodes.td51 let children = [
66 let children = [
78 let children = [
86 let children = [
101 let children = [
109 let children = [
117 let children = [
135 let children = [
143 let children = [
151 let children = [
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DOpenMPClause.h92 child_range children();
93 const_child_range children() const { in children() function
94 auto Children = const_cast<OMPClause *>(this)->children(); in children() local
95 return const_child_range(Children.begin(), Children.end()); in children()
99 /// expressions include only the children that must be evaluated at the
103 auto Children = const_cast<OMPClause *>(this)->children(); in used_children() local
104 return const_child_range(Children.begin(), Children.end()); in used_children()
123 child_range children() { in children() function
127 const_child_range children() const { in children() function
176 child_range children() { return child_range(&S, &S + 1); } in children() function
[all …]
H A DOpenACCClause.h48 child_range children();
49 const_child_range children() const { in children() function
50 auto Children = const_cast<OpenACCClause *>(this)->children(); in children() local
51 return const_child_range(Children.begin(), Children.end()); in children()
71 child_range children() { in children() function
74 const_child_range children() const { in children() function
93 child_range children() { in children() function
96 const_child_range children() const { in children() function
114 child_range children() { in children() function
117 const_child_range children() const { in children() function
[all …]
H A DStmtObjC.h67 child_range children() { in children() function
71 const_child_range children() const { in children() function
119 child_range children() { return child_range(&Body, &Body + 1); } in children() function
121 const_child_range children() const { in children() function
155 child_range children() { in children() function
159 const_child_range children() const { in children() function
264 child_range children() { in children() function
269 const_child_range children() const { in children() function
270 return const_child_range(const_cast<ObjCAtTryStmt *>(this)->children()); in children()
348 child_range children() { in children() function
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_user/zfs_list/
H A Dzfs_list_003_pos.ksh36 # Verify 'zfs list -r' could recursively display any children
55 log_assert "Verify 'zfs list -r' could display any children recursively."
58 children="$TESTPOOL/$TESTFS"
61 children="$children $TESTPOOL/$TESTFS/$fs"
68 for fs in $children ; do
73 log_pass "'zfs list -r' could display any children recursively."
/freebsd/contrib/llvm-project/clang/lib/Format/
H A DMacroCallReconstructor.cpp38 for (const auto &Child : N.Children) in forEachToken()
63 Result.Tokens.front()->Children.size() == 1); in takeResult()
65 *Result.Tokens.front()->Children.front(), Result.Level); in takeResult()
118 // tokens. The tokens to be pushed are children of ExpandedParent in the
174 ActiveReconstructedLines.back()->Tokens.back()->Children.push_back( in prepareParent()
177 &*ActiveReconstructedLines.back()->Tokens.back()->Children.back()); in prepareParent()
201 // needs to have its children formatted. in getParentInResult()
235 // token as the parent of the hidden token's children. in reconstruct()
410 // if the arguments produce new unwrapped lines, they will become children in processNextReconstructed()
416 // All tokens that are children of the previous line's last token in the in processNextReconstructed()
[all …]
H A DTokenAnnotator.h77 // FIXME: if we add children, previous will point to the token before in AnnotatedLine()
78 // the children; changing this requires significant changes across in AnnotatedLine()
86 Current->Children.clear(); in addChildren()
87 for (const auto &Child : Node.Children) { in addChildren()
88 Children.push_back(new AnnotatedLine(Child)); in addChildren()
89 if (Children.back()->ContainsMacroCall) in addChildren()
91 Current->Children.push_back(Children.back()); in addChildren()
97 for (const auto *Child : Children) in size()
103 for (AnnotatedLine *Child : Children) in ~AnnotatedLine()
107 Current->Children.clear(); in ~AnnotatedLine()
[all …]
/freebsd/contrib/llvm-project/lldb/source/Plugins/Language/ObjC/
H A DObjCLanguage.cpp283 "Class synthetic children", "Class", class_synth_flags); in LoadObjCFormatters()
479 "NSArray synthetic children", "__NSArrayM", in LoadObjCFormatters()
483 "NSArray synthetic children", "__NSArrayI", in LoadObjCFormatters()
487 "NSArray synthetic children", "__NSArray0", in LoadObjCFormatters()
491 "NSArray synthetic children", "__NSSingleObjectArrayI", in LoadObjCFormatters()
495 "NSArray synthetic children", "NSArray", in LoadObjCFormatters()
499 "NSArray synthetic children", "NSConstantArray", in LoadObjCFormatters()
503 "NSArray synthetic children", "NSMutableArray", in LoadObjCFormatters()
507 "NSArray synthetic children", "__NSCFArray", in LoadObjCFormatters()
511 "NSArray synthetic children", "_NSCallStackArra in LoadObjCFormatters()
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DCFGDiff.h30 // a non-inversed graph, the children are naturally the successors when
53 // a getChildren method to get a Node's children based on the additional updates
68 // and inserted edges are considered deleted when returning children.
138 auto R = children<DirectedNodeT>(N); in getChildren()
141 // Remove nullptr children for clang. in getChildren()
144 auto &Children = (InverseEdge != InverseGraph) ? Pred : Succ; in getChildren() local
145 auto It = Children.find(N); in getChildren()
146 if (It == Children.end()) in getChildren()
149 // Remove children present in the CFG but not in the snapshot. in getChildren()
153 // Add children presen in getChildren()
[all...]
/freebsd/sys/contrib/ck/src/
H A Dck_barrier_mcs.c60 /* Leaf threads do not have any children. */ in ck_barrier_mcs_init()
61 barrier[i].children[0] = ((i << 1) + 1 >= nthr) ? in ck_barrier_mcs_init()
65 barrier[i].children[1] = ((i << 1) + 2 >= nthr) ? in ck_barrier_mcs_init()
117 * Wait until all children have reached the barrier and are done waiting in ck_barrier_mcs()
118 * for their children. in ck_barrier_mcs()
126 /* Inform parent thread and its children have arrived at the barrier. */ in ck_barrier_mcs()
135 /* Inform children of successful barrier. */ in ck_barrier_mcs()
136 ck_pr_store_uint(barrier[state->vpid].children[0], state->sense); in ck_barrier_mcs()
137 ck_pr_store_uint(barrier[state->vpid].children[1], state->sense); in ck_barrier_mcs()
/freebsd/tests/sys/cddl/zfs/tests/cli_user/zfs_list/
H A Dzfs_list_003_pos.ksh36 # Verify 'zfs list -r' could recursively display any children
64 log_assert "Verify 'zfs list -r' could display any children recursively."
67 children="$TESTPOOL/$TESTFS"
70 children="$children $TESTPOOL/$TESTFS/$fs"
77 for fs in $children ; do
86 log_pass "'zfs list -r' could display any children recursively."
/freebsd/contrib/ntp/html/
H A Dorphan.html18 …er can simulate the UTC source and all direct dependents, called orphan children, must select the …
19 …children, can be enabled for orphan mode using the <tt>orphan <em>stratum</em></tt> option of the …
24 and dispersion, orphan children use a metric computed from the IP
27 …sources should operate at the same stratum. All core servers and orphan children should include th…
31 …ock using the other servers as backup. Only the core servers and orphan children need to be enable…
35 …children operate as broadcast clients of all core servers. As in peer networks, the core servers b…
36 …ll UTC sources are lost, all core servers become orphans and the orphan children will select the s…
/freebsd/contrib/bmake/
H A Dmake.c256 * must be considered out-of-date since at least one of its children
291 * it has no children, was on the lhs of an operator and doesn't in GNode_IsOODate()
311 * always out of date if no children and :: target in GNode_IsOODate()
320 * out-of-date if any of its children was out-of-date. in GNode_IsOODate()
367 * have their mtime stay below their children's mtime to keep parents in GNode_IsOODate()
384 for (ln = pgn->children.first; ln != NULL; ln = ln->next) { in PretendAllChildrenAreMade()
397 * flags and children to the parent node.
411 GNodeListNode *ln; /* An element in the children list */ in Make_HandleUse()
433 for (ln = cgn->children.first; ln != NULL; ln = ln->next) { in Make_HandleUse()
455 Lst_Append(&pgn->children, gn); in Make_HandleUse()
[all …]

12345678910>>...51