Searched refs:Children (Results 1 - 25 of 26) sorted by relevance

12

/macosx-10.10.1/Security-57031.1.35/Security/include/security_utilities/
H A Dunixchild.h125 struct Children : public Mutex, public std::map<pid_t, Child *> { struct in class:Security::UnixPlusPlus::Child
126 Children() : shared(false) { } function in struct:Security::UnixPlusPlus::Child::Children
129 static ModuleNexus<Children> mChildren;
H A Dunixchild.cpp53 ModuleNexus<Child::Children> Child::mChildren;
57 // Make and break Children
290 Children::iterator it = mChildren().find(pid);
416 for (Children::iterator it = mChildren().begin(); it != mChildren().end(); it++)
/macosx-10.10.1/Security-57031.1.35/Security/libsecurity_utilities/lib/
H A Dunixchild.h125 struct Children : public Mutex, public std::map<pid_t, Child *> { struct in class:Security::UnixPlusPlus::Child
126 Children() : shared(false) { } function in struct:Security::UnixPlusPlus::Child::Children
129 static ModuleNexus<Children> mChildren;
H A Dunixchild.cpp53 ModuleNexus<Child::Children> Child::mChildren;
57 // Make and break Children
290 Children::iterator it = mChildren().find(pid);
416 for (Children::iterator it = mChildren().begin(); it != mChildren().end(); it++)
/macosx-10.10.1/llvmCore-3425.0.34/unittests/ADT/
H A DSCCIteratorTest.cpp166 /// Children - Set of nodes which are children of this one and that haven't
168 NodeSubset Children;
172 ChildIterator(NodeType *F, NodeSubset C) : FirstNode(F), Children(C) {}
177 Children(other.Children) {}
182 other.Children == this->Children;
192 if (Children.count(i)) {
194 Children.DeleteNode(i);
212 if (Children
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/
H A DLexicalScopes.cpp221 const SmallVector<LexicalScope *, 4> &Children = WS->getChildren(); local
223 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children.begin(),
224 SE = Children.end(); SI != SE; ++SI) {
328 if (!Children.empty())
329 err << "Children ...\n";
330 for (unsigned i = 0, e = Children.size(); i != e; ++i)
331 if (Children[i] != this)
332 Children[i]->dump();
H A DMachineCSE.cpp607 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local
608 unsigned NumChildren = Children.size();
611 MachineDomTreeNode *Child = Children[i];
H A DLiveDebugVariables.cpp536 const std::vector<MachineDomTreeNode*> &Children = local
538 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
539 MachineBasicBlock *MBB = Children[i]->getBlock();
H A DMachineLICM.cpp714 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local
715 unsigned NumChildren = Children.size();
728 MachineDomTreeNode *Child = Children[i];
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/CodeGen/
H A DLexicalScopes.h177 SmallVector<LexicalScope *, 4> &getChildren() { return Children; }
181 void addChild(LexicalScope *S) { Children.push_back(S); }
239 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in class:llvm::LexicalScope
/macosx-10.10.1/llvmCore-3425.0.34/include/llvm/Analysis/
H A DDominators.h67 std::vector<DomTreeNodeBase<NodeT> *> Children; member in class:llvm::DomTreeNodeBase
77 iterator begin() { return Children.begin(); }
78 iterator end() { return Children.end(); }
79 const_iterator begin() const { return Children.begin(); }
80 const_iterator end() const { return Children.end(); }
85 return Children;
92 Children.push_back(C);
97 return Children.size();
101 Children.clear();
126 std::find(IDom->Children
[all...]
/macosx-10.10.1/tcl-105/tcl_ext/tclsoap/tclsoap/
H A Dutils.tcl227 foreach node [Children $domNode] {
325 set dataNodes [Children $domElement]
343 set dataNodes [Children $domElement]
404 set children [Children $base]
564 foreach node [Children $domNode] {
580 proc ::SOAP::Utils::Children {domNode} {
/macosx-10.10.1/llvmCore-3425.0.34/utils/TableGen/
H A DDAGISelMatcher.h189 SmallVector<Matcher*, 4> Children; member in class:llvm::ScopeMatcher
192 : Matcher(Scope), Children(children, children+numchildren) {
196 unsigned getNumChildren() const { return Children.size(); }
198 Matcher *getChild(unsigned i) { return Children[i]; }
199 const Matcher *getChild(unsigned i) const { return Children[i]; }
202 delete Children[i];
203 Children[i] = N;
207 Matcher *Res = Children[i];
208 Children[i] = 0;
213 if (NC < Children
[all...]
H A DCodeGenDAGPatterns.h324 std::vector<TreePatternNode*> Children;
328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) {
365 unsigned getNumChildren() const { return Children.size(); }
366 TreePatternNode *getChild(unsigned N) const { return Children[N]; }
368 Children[i] = N;
373 for (unsigned i = 0, e = Children.size(); i != e; ++i)
374 if (Children[i] == N) return true;
H A DCodeGenDAGPatterns.cpp1125 CChildren.reserve(Children.size());
1201 if (Frag->getNumArgs() != Children.size())
1831 std::vector<TreePatternNode*> Children; local
1835 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i)));
1855 Children.insert(Children.begin(), IIDNode);
1859 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults);
2710 std::vector<TreePatternNode*> Children; local
2711 Children.push_back(OpNode);
2712 OpNode = new TreePatternNode(Xform, Children, OpNod
3126 std::vector<TreePatternNode*> Children; local
3247 GatherChildrenOfAssociativeOpcode(TreePatternNode *N, std::vector<TreePatternNode *> &Children) argument
[all...]
H A DDAGISelMatcher.cpp83 for (unsigned i = 0, e = Children.size(); i != e; ++i)
84 delete Children[i];
/macosx-10.10.1/llvmCore-3425.0.34/lib/CodeGen/AsmPrinter/
H A DDIE.cpp111 for (unsigned i = 0, N = Children.size(); i < N; ++i)
112 delete Children[i];
155 for (unsigned j = 0, M = Children.size(); j < M; ++j) {
156 Children[j]->print(O, 4);
H A DDIE.h128 /// Children DIEs.
130 std::vector<DIE *> Children; member in class:llvm::DIE
152 const std::vector<DIE *> &getChildren() const { return Children; }
174 Children.push_back(Child);
H A DDwarfDebug.cpp502 SmallVector<DIE *, 8> Children;
511 Children.push_back(Arg);
520 Children.push_back(Variable);
526 Children.push_back(Nested);
544 if (Children.empty())
552 for (SmallVector<DIE *, 8>::iterator I = Children.begin(),
553 E = Children.end(); I != E; ++I)
1225 const SmallVector<LexicalScope *, 4> &Children = S->getChildren(); local
1226 if (!Children.empty())
1227 for (SmallVector<LexicalScope *, 4>::const_iterator SI = Children
1565 const std::vector<DIE *> &Children = Die->getChildren(); local
1728 const std::vector<DIE *> &Children = Die->getChildren(); local
[all...]
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp172 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
173 for (SmallVector<DomTreeNode*, 8>::iterator DI = Children.begin(),
174 DE = Children.end(); DI != DE; ++DI)
302 std::vector<DomTreeNode *> Children; local
305 Children.push_back(*I);
308 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
309 E = Children.end(); I != E; ++I)
H A DLoopSimplify.cpp342 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children = local
344 while (!Children.empty()) {
345 DomTreeNode *Child = Children.front();
H A DCodeExtractor.cpp272 SmallVector<DomTreeNode*, 8> Children; local
275 Children.push_back(*DI);
279 for (SmallVector<DomTreeNode*, 8>::iterator I = Children.begin(),
280 E = Children.end(); I != E; ++I)
/macosx-10.10.1/llvmCore-3425.0.34/lib/Transforms/Scalar/
H A DLICM.cpp309 const std::vector<DomTreeNode*> &Children = N->getChildren(); local
310 for (unsigned i = 0, e = Children.size(); i != e; ++i)
311 SinkRegion(Children[i]);
382 const std::vector<DomTreeNode*> &Children = N->getChildren(); local
383 for (unsigned i = 0, e = Children.size(); i != e; ++i)
384 HoistRegion(Children[i]);
/macosx-10.10.1/llvmCore-3425.0.34/lib/Support/
H A DDwarf.cpp105 const char *llvm::dwarf::ChildrenString(unsigned Children) { argument
106 switch (Children) {
/macosx-10.10.1/misc_cmds-33/calendar/calendars/
H A Dcalendar.holiday19 01/06 Children's Day in Uruguay
161 05/05 Children's Day in Japan and South Korea
548 12/25 Children's Day in Congo

Completed in 284 milliseconds

12