266 references to Children
System.Data.Entity (266)
System\Data\Query\InternalTrees\Command.cs (1)
1695
varDefListNode.
Children
.Add(varDefNode);
System\Data\Query\InternalTrees\Dump.cs (10)
166
foreach (Node chi in n.
Children
) {
176
if (n.
Children
.Count > 2) {
193
while (i < n.
Children
.Count) {
194
if ((i + 1) < n.
Children
.Count) {
196
VisitNode(n.
Children
[i++]);
199
VisitNode(n.
Children
[i++]);
204
VisitNode(n.
Children
[i++]);
282
foreach (Node chi in n.
Children
)
371
foreach (Node chi in n.
Children
) {
475
foreach (Node chi in n.
Children
) {
System\Data\Query\InternalTrees\NodeCounter.cs (1)
44
foreach (Node child in n.
Children
)
System\Data\Query\InternalTrees\NodeInfo.cs (13)
170
foreach (Node chi in n.
Children
)
414
foreach (Node chi in n.
Children
)
567
foreach (Node varDefNode in varDefListNode.
Children
)
620
foreach (Node chi in n.Child1.
Children
)
747
foreach (Node chi in n.Child1.
Children
)
762
for (int i = 2; i < n.
Children
.Count; i++)
764
foreach (Node chi in n.
Children
[i].
Children
)
810
foreach (Node chi in n.
Children
)
1062
for (int i = 0; i < n.
Children
.Count; i++)
1064
ExtendedNodeInfo childNodeInfo = n.
Children
[i].GetExtendedNodeInfo(m_command);
1276
foreach (Node chi in n.
Children
)
1330
foreach (Node chi in n.
Children
)
System\Data\Query\InternalTrees\Nodes.cs (5)
119
if (this.
Children
.Count != other.
Children
.Count)
128
for (int i = 0; i < this.
Children
.Count; i++)
130
if (!this.
Children
[i].IsEquivalent(other.
Children
[i]))
System\Data\Query\InternalTrees\OpCopier.cs (1)
252
foreach (Node chi in n.
Children
)
System\Data\Query\InternalTrees\Rule.cs (5)
167
if (pattern.
Children
.Count != original.
Children
.Count)
169
for (int i = 0; i < pattern.
Children
.Count; i++)
170
if (!Match(pattern.
Children
[i], original.
Children
[i]))
System\Data\Query\InternalTrees\RuleProcessor.cs (3)
124
for (int i = 0; i < subTreeRoot.
Children
.Count; i++)
126
subTreeRoot.
Children
[i] = ApplyRulesToSubtree(context, rules, subTreeRoot.
Children
[i], subTreeRoot, i);
System\Data\Query\InternalTrees\Visitors.cs (13)
32
foreach (Node chi in n.
Children
)
44
for (int i = n.
Children
.Count - 1; i >= 0; i--)
46
VisitNode(n.
Children
[i]);
777
for (int i = 0; i < n.
Children
.Count; i++)
779
VisitNode(n.
Children
[i]);
789
for (int i = n.
Children
.Count - 1; i >= 0; i--)
791
VisitNode(n.
Children
[i]);
1659
for (int i = 0; i < n.
Children
.Count; i++)
1661
n.
Children
[i] = VisitNode(n.
Children
[i]);
1671
for (int i = n.
Children
.Count - 1; i >= 0; i--)
1673
n.
Children
[i] = VisitNode(n.
Children
[i]);
System\Data\Query\PlanCompiler\AggregatePushdown.cs (12)
441
foreach (Node definitionNode in currentNode.Child1.
Children
)
572
List<Node> newChildren = new List<Node>(n.
Children
.Count);
574
for (int i = 0; i < n.
Children
.Count; i++)
576
Node processedChild = VisitNode(n.
Children
[i]);
581
if (!anyChildChanged && !Object.ReferenceEquals(n.
Children
[i], processedChild))
694
for (int i = 0; i < definingNode.
Children
.Count; i++)
696
Node argumentNode = definingNode.
Children
[i];
716
foreach (Node child in n.Child3.
Children
)
765
PlanCompiler.Assert(n.
Children
.Count == 1, "Aggregate Function must have one argument");
789
foreach (Node child in n.
Children
)
925
definingGroupNode.Child2.
Children
.Add(varDefNode);
942
candidate.Key.
Children
.Clear();
System\Data\Query\PlanCompiler\CTreeGenerator.cs (14)
550
EnterVarDefScope(varDefListNode.
Children
);
647
PlanCompiler.Assert(2 == n.
Children
.Count, string.Format(CultureInfo.InvariantCulture, "Non-Binary {0} encountered", n.Op.GetType().Name));
652
PlanCompiler.Assert(n.
Children
.Count > index, "VisitChild called with invalid index");
653
return VisitNode(n.
Children
[index]);
659
foreach (Node argNode in n.
Children
)
804
int caseCount = n.
Children
.Count;
813
if(0 == n.
Children
.Count % 2)
824
elseExpr = VisitChild(n, n.
Children
.Count - 1);
1451
if (n.
Children
.Count > 1)
1464
if (n.
Children
.Count > 1)
1738
foreach (Node aggVarDefNode in aggRootNode.
Children
)
1883
if (joinNode.
Children
.Count > 2)
1963
foreach (Node inputNode in n.
Children
)
2340
PlanCompiler.Assert(n.
Children
.Count == 1, "more than one input to physicalProjectOp?");
System\Data\Query\PlanCompiler\ITreeGenerator.cs (4)
178
if (sourceNode.
Children
.Count > 0)
180
MapCopiedNodeVars(sourceNode.
Children
, copyNode.
Children
, varMappings);
1289
retNode = instance.
Children
[memberIdx];
System\Data\Query\PlanCompiler\JoinGraph.cs (1)
713
foreach (Node chi in node.
Children
)
System\Data\Query\PlanCompiler\KeyPullup.cs (9)
86
foreach (Node chi in n.
Children
)
234
VarVec[] keyVarsMissingFromOutput = new VarVec[n.
Children
.Count];
236
for (int i = 0; i < n.
Children
.Count; i++)
238
Node branchNode = n.
Children
[i];
277
for (int i = 0; i < n.
Children
.Count; i++)
279
Node branchNode = n.
Children
[i];
367
n.
Children
[i] = m_command.CreateNode(m_command.CreateProjectOp(branchOutputVars),
373
m_command.RecomputeNodeInfo(n.
Children
[i]);
374
ExtendedNodeInfo projectNodeInfo = m_command.GetExtendedNodeInfo(n.
Children
[i]);
System\Data\Query\PlanCompiler\NestPullup.cs (45)
151
foreach (Node chi in n.
Children
)
334
foreach (Node chi in n.
Children
)
430
foreach (Node chi in n.
Children
)
461
foreach (Node chi in n.
Children
)
484
foreach (Node chi in n.
Children
)
511
for (int i = 1; i < chi.
Children
.Count; i++)
513
Node newNestChild = ApplyIsNotNullFilter(chi.
Children
[i], sentinelVar);
520
for (int i = 1; i < chi.
Children
.Count; i++)
522
newNestChildren.Add(chi.
Children
[i]);
725
PlanCompiler.Assert(n.HasChild3 && n.Child3.
Children
.Count > 0, "GroupByIntoOp with no group aggregates?");
732
foreach (Node chi in varDefListNode.
Children
)
922
for (int i = 1; i < nestedNestNode.
Children
.Count; i++)
928
newNestInputs.Add(nestedNestNode.
Children
[i]);
935
for (int i = 1; i < nestNode.
Children
.Count; i++)
939
newNestInputs.Add(nestNode.
Children
[i]);
994
foreach (Node chi in projectNode.Child1.
Children
)
1126
for (int j = 1; j < projectNode.Child0.
Children
.Count; j++)
1128
newNestedNestNodeInputs.Add(projectNode.Child0.
Children
[j]);
1381
newNestNodeChildren = new List<Node>(nestNode.
Children
);
1394
newNestNodeChildren.Add(nestNode.
Children
[i]);
1404
for (int i = 1; i < nestNode.
Children
.Count; i++)
1406
leftCorrelationVars.Or(nestNode.
Children
[i].GetExtendedNodeInfo(Command).ExternalReferences);
1416
List<Node> newProjectOpChildren = new List<Node>(projectNode.Child1.
Children
.Count);
1417
foreach (Node chi in projectNode.Child1.
Children
)
1896
foreach (Node chi in n.
Children
)
1927
PlanCompiler.Assert(n.
Children
.Count == 1, "multiple inputs to physicalProject?");
2126
for (int i = 1; i < nestNode.
Children
.Count; i++)
2128
Node chi = nestNode.
Children
[i];
2137
nestNode.
Children
[i] = ConvertToSingleStreamNest(chi, varRefReplacementMap, childFlattenedOutputVars, out childKeyColumnMaps);
2146
VarVec childKeys = Command.CreateVarVec(((SingleStreamNestOp)nestNode.
Children
[i].Op).Keys);
2262
for (int i = 1; i < nestNode.
Children
.Count; i++)
2364
for (int i = 1; i < nestNode.
Children
.Count; i++)
2366
Node inputNode = nestNode.
Children
[i];
2419
nestNode.
Children
[i] = augmentedInput;
2482
for (int i = 1; i < nestNode.
Children
.Count; i++)
2506
varRemapper.RemapSubtree(nestNode.
Children
[i]);
2526
Node applyNode = Command.CreateNode(op, newDrivingNode, nestNode.
Children
[i]);
2543
for (int j = 1; j < nestNode.
Children
.Count; j++)
2611
for (int i = 0; i < nestNode.
Children
.Count; i++)
2713
m_newCollectionVarDefinitions.Add(newOp.CollectionInfo[i].CollectionVar, result.
Children
[i + 1]);
2779
for (int i = 0; i < n.
Children
.Count; i++)
2781
Node originalChild = n.
Children
[i];
2782
n.
Children
[i] = VisitNode(n.
Children
[i]);
2783
if (!Object.ReferenceEquals(originalChild, n.
Children
[i]) || changedNodes.Contains(originalChild))
System\Data\Query\PlanCompiler\NominalTypeEliminator.cs (15)
301
return Copy(input.
Children
[fieldPos]);
778
foreach (Node chi in n.
Children
)
1492
n.
Children
[i] = FixupSetOpChild(n.
Children
[i], op.VarMap[i], newComputedVars);
1749
IEnumerator<Node> inputs = n.Child0.
Children
.GetEnumerator();
1750
int inputPropertyCount = n.Child0.
Children
.Count;
1875
PlanCompiler.Assert(n.
Children
.Count == 0, "Constant operations don't have children.");
2066
for (int i = 0; i < n.
Children
.Count - 1; )
2068
Node whenNode = Copy(n.
Children
[i]);
2072
Node propNode = BuildAccessorWithNulls(n.
Children
[i], property);
2076
Node elseNode = BuildAccessorWithNulls(n.
Children
[n.
Children
.Count - 1], property);
2733
Node discriminator = n.
Children
[0];
2775
Node fieldValue = n.
Children
[childrenIndex];
2819
Node fieldValue = n.
Children
[childrenIndex];
System\Data\Query\PlanCompiler\PlanCompilerUtil.cs (2)
44
if (n.
Children
.Count != 3)
81
return ((n.
Children
.Count == 1) &&
System\Data\Query\PlanCompiler\PreProcessor.cs (24)
1143
Node ret = functionImportMappingComposable.GetInternalTree(m_command, n.
Children
);
1611
PlanCompiler.Assert(n.
Children
.Count > pos, "invalid position " + pos + "; total count = " + n.
Children
.Count);
1612
keyFields.Add(n.
Children
[pos]);
1760
newChildren = n.
Children
;
1778
for (int i = n.
Children
.Count - 1; i >= entityType.Properties.Count; i--, j--)
1782
n.
Children
.RemoveAt(i);
1801
for (int i = entityType.Properties.Count; i < n.
Children
.Count; i++, j++)
1803
prebuiltRelPropertyExprs[copiedRelPropList[j]] = n.
Children
[i];
1812
newChildren.Add(n.
Children
[i]);
1861
int firstRelPropertyNodeOffset = n.
Children
.Count - op.RelationshipProperties.Count;
1864
newChildren.Add(n.
Children
[i]);
1870
for (int i = firstRelPropertyNodeOffset, j = 0; i < n.
Children
.Count; i++, j++)
1872
prebuiltRelPropertyExprs[op.RelationshipProperties[j]] = n.
Children
[i];
1955
else if (n.
Children
.Count == 1 || AreAllConstantsOrNulls(n.
Children
))
1959
foreach (Node chi in n.
Children
)
1986
for (int i = 0; i < n.
Children
.Count; i++)
2001
List<Node> caseArgNodes = new List<Node>(n.
Children
.Count * 2 + 1);
2002
for (int i = 0; i < n.
Children
.Count; i++)
2005
if (i != (n.
Children
.Count - 1))
2016
caseArgNodes.Add(n.
Children
[i]);
2354
for (int i = 1; i < n.Child0.
Children
.Count; i++)
2356
sortChildren.Add(n.Child0.
Children
[i]);
System\Data\Query\PlanCompiler\ProjectionPruner.cs (12)
299
foreach (Node chi in n.
Children
)
485
for (int i = n.
Children
.Count - 1; i >= 2; i--)
487
n.
Children
[i] = VisitNode(n.
Children
[i]);
500
n.
Children
[1] = VisitNode(n.
Children
[1]);
503
n.
Children
[0] = VisitNode(n.
Children
[0]);
532
List<Node> constantKeys = varDefListNode.
Children
.Where(d => d.Op.OpType == OpType.VarDef
544
varDefListNode.
Children
.RemoveAll(c => constantKeys.Contains(c) && constantKeyVars.IsSet(((VarDefOp)c.Op).Var));
553
varDefListNode.
Children
.Add(keyNode);
569
if (result.Op.OpType == OpType.GroupByInto && n.Child3.
Children
.Count == 0)
System\Data\Query\PlanCompiler\PropertyPushdownHelper.cs (6)
251
foreach (Node chi in n.
Children
)
317
for (int i = 1; i < n.
Children
.Count - 1; i += 2)
320
AddPropertyRefs(n.
Children
[i], cdProps);
322
AddPropertyRefs(n.
Children
[n.
Children
.Count - 1], pdProps.Clone());
364
foreach (Node chi in n.
Children
)
System\Data\Query\PlanCompiler\SubqueryTrackingVisitor.cs (3)
124
for (int i = 0; i < n.
Children
.Count; i++)
126
n.
Children
[i] = VisitNode(n.
Children
[i]);
System\Data\Query\PlanCompiler\TransformationRules.cs (61)
108
for (int i = 0; i < node.
Children
.Count; i++)
110
node.
Children
[i] = ReMap(node.
Children
[i], varMap);
248
foreach (Node child in n.
Children
)
294
foreach (Node chi in varDefListNode.
Children
)
574
foreach (Node chi in node.
Children
)
881
Node elseNode = caseOpNode.
Children
[caseOpNode.
Children
.Count - 1];
886
for (int i = 3; i < caseOpNode.
Children
.Count - 1; i += 2)
888
if (!caseOpNode.
Children
[i].IsEquivalent(firstThenNode))
919
for (int i = 0; i < caseOpNode.
Children
.Count; )
922
if (i == caseOpNode.
Children
.Count - 1)
930
if (OpType.SoftCast == caseOpNode.
Children
[i].Op.OpType)
937
newNodeArgs.Add(caseOpNode.
Children
[i]);
945
if (OpType.SoftCast == caseOpNode.
Children
[i + 1].Op.OpType)
951
if (caseOpNode.
Children
[i].Op.OpType != OpType.ConstantPredicate)
955
newNodeArgs.Add(caseOpNode.
Children
[i]);
956
newNodeArgs.Add(caseOpNode.
Children
[i + 1]);
963
ConstantPredicateOp constPred = (ConstantPredicateOp)caseOpNode.
Children
[i].Op;
970
newNodeArgs.Add(caseOpNode.
Children
[j]);
979
newNodeArgs.Add(caseOpNode.
Children
[i + 1]);
1038
Node elseChild = caseOpNode.
Children
[caseOpNode.
Children
.Count - 1];
1051
caseOpNode.
Children
.RemoveAt(caseOpNode.
Children
.Count - 1);
1052
caseOpNode.
Children
.AddRange(elseChild.
Children
);
1600
setOpNode.
Children
[branchId],
2122
foreach (Node varDefNode in varDefListNode.
Children
)
2140
foreach (Node varDefNode in varDefListNode.
Children
)
2145
newVarDefListNode.
Children
.Add(varDefNode);
2150
foreach (Node chi in subProjectNode.Child1.
Children
)
2155
newVarDefListNode.
Children
.Add(chi);
2225
if (n.Child1.
Children
.Count == 0)
2240
foreach (Node varDefNode in n.Child1.
Children
)
2268
foreach (Node varDefNode in n.Child1.
Children
)
2332
if (varDefListNode.
Children
.Where(c => c.Child0.Op.OpType == OpType.NullSentinel).Count() == 0)
2348
if (!canChangeNullSentinelValue || !TransformationRulesContext.TryGetInt32Var(n.Child1.
Children
.Where(child => child.Child0.Op.OpType == OpType.Constant || child.Child0.Op.OpType == OpType.InternalConstant).Select(child => ((VarDefOp)(child.Op)).Var), out inputSentinel))
2350
inputSentinel = n.Child1.
Children
.Where(child => child.Child0.Op.OpType == OpType.NullSentinel).Select(child => ((VarDefOp)(child.Op)).Var).FirstOrDefault();
2360
for (int i = n.Child1.
Children
.Count-1; i >= 0; i--)
2362
Node varDefNode = n.Child1.
Children
[i];
2376
n.Child1.
Children
.RemoveAt(i);
2719
varDefListNode.
Children
.Count == 1 &&
2741
foreach (Node varDefNode in varDefListNode.
Children
)
3043
foreach (Node child in n.
Children
)
3200
foreach (Node chi in subTree.
Children
)
3446
varDefNodes.AddRange(joinNode.Child0.Child1.
Children
);
3447
varDefNodes.AddRange(joinNode.Child1.Child1.
Children
);
3470
Node projectNode = joinNode.
Children
[projectNodeIdx];
3478
ExtendedNodeInfo otherChildInfo = command.GetExtendedNodeInfo(joinNode.
Children
[otherNodeIdx]);
3487
joinNode.
Children
[projectNodeIdx] = projectNode.Child0; // bypass the projectOp
3835
newNode = setOpNode.
Children
[indexToReturn];
3883
if (n.Child1.
Children
.Count == 0)
3899
foreach (Node varDefNode in n.Child1.
Children
)
3926
foreach (Node varDefNode in n.Child1.
Children
)
3985
if (keys.
Children
.Count > 0)
4003
for (int i = 0; i < projectNodeVarDefList.
Children
.Count; i++)
4005
Node varDefNode = projectNodeVarDefList.
Children
[i];
4026
Dictionary<Var, Node> varToDefiningNode = new Dictionary<Var, Node>(projectNodeVarDefList.
Children
.Count);
4027
for (int j = 0; j < projectNodeVarDefList.
Children
.Count; j++)
4029
Node varDefNode = projectNodeVarDefList.
Children
[j];
System\Data\Query\PlanCompiler\VarRefManager.cs (5)
54
for(int i=0; i< parent.
Children
.Count; i++)
57
m_nodeToParentMap[parent.
Children
[i]] = parent;
58
m_nodeToSiblingNumber[parent.
Children
[i]] = i;
88
for (int i = m_nodeToSiblingNumber[currentChild] + 1; i < parent.
Children
.Count; i++)
90
if (parent.
Children
[i].GetNodeInfo(m_command).ExternalReferences.Overlaps(keys))
System\Data\Query\PlanCompiler\VarRemapper.cs (1)
103
foreach (Node chi in subTree.
Children
)