5 writes to Child2
System.Data.Entity (5)
System\Data\Query\PlanCompiler\ITreeGenerator.cs (1)
1360inputNode.Child2 = limitNode;
System\Data\Query\PlanCompiler\ProjectionPruner.cs (1)
604n.Child2 = VisitNode(n.Child2);
System\Data\Query\PlanCompiler\SubqueryTrackingVisitor.cs (1)
251n.Child2 = existsNode;
System\Data\Query\PlanCompiler\TransformationRules.cs (2)
3485joinNode.Child2 = joinConditionNode; 4034newNode.Child2 = VarRefReplacer.Replace(varToDefiningNode, aggregates, command);
33 references to Child2
System.Data.Entity (33)
System\Data\Query\InternalTrees\Dump.cs (1)
178VisitNode(n.Child2);
System\Data\Query\InternalTrees\NodeInfo.cs (3)
876NodeInfo predNodeInfo = GetNodeInfo(n.Child2); 1157OpType.Constant == n.Child2.Op.OpType && 1160ConstantBaseOp constOp = (ConstantBaseOp)n.Child2.Op;
System\Data\Query\PlanCompiler\AggregatePushdown.cs (1)
925definingGroupNode.Child2.Children.Add(varDefNode);
System\Data\Query\PlanCompiler\CTreeGenerator.cs (4)
1591bool nullLimit = (OpType.Null == n.Child2.Op.OpType); 1608retExpr = this.CreateLimitExpression(inputExpr, this.VisitNode(n.Child2), op.WithTies); 1736Node aggRootNode = n.Child2; 1893joinCond = VisitNode(joinNode.Child2);
System\Data\Query\PlanCompiler\ITreeGenerator.cs (1)
1352OpType.Null == inputNode.Child2.Op.OpType)
System\Data\Query\PlanCompiler\JoinGraph.cs (2)
639otherPredicateNode = joinNode.Child2; 649Predicate predicate = new Predicate(m_command, joinNode.Child2);
System\Data\Query\PlanCompiler\NestPullup.cs (1)
740Command.CreateGroupByOp(op.Keys, groupByOutputs), n.Child0, n.Child1, n.Child2);
System\Data\Query\PlanCompiler\NominalTypeEliminator.cs (1)
1996Node resultNode = thenClauseIsNull ? n.Child2 : n.Child1;
System\Data\Query\PlanCompiler\Normalizer.cs (2)
259n.Child2.Child0 = BuildDummyProjectForExists(n.Child2.Child0);
System\Data\Query\PlanCompiler\PlanCompilerUtil.cs (2)
50if (!n.Child1.Op.Type.EdmEquals(op.Type) || !n.Child2.Op.Type.EdmEquals(op.Type)) 61if (n.Child2.Op.OpType == OpType.Null)
System\Data\Query\PlanCompiler\ProjectionPruner.cs (2)
574result.Child0, result.Child1, result.Child2); 604n.Child2 = VisitNode(n.Child2);
System\Data\Query\PlanCompiler\PropertyPushdownHelper.cs (1)
666VisitNode(n.Child2); // the predicate first
System\Data\Query\PlanCompiler\SubqueryTrackingVisitor.cs (1)
244Node joinCondition = n.Child2;
System\Data\Query\PlanCompiler\TransformationRules.cs (11)
1743Node newGroupByNode = trc.Command.CreateNode(groupByNode.Op, subFilterNode, groupByNode.Child1, groupByNode.Child2); 1893newJoinPredicateNode = PlanCompilerUtil.CombinePredicates(joinNode.Child2, newJoinPredicateNode, command); 1898newJoinPredicateNode = (joinOp.OpType == OpType.CrossJoin) ? null : joinNode.Child2; 3306ConstantPredicateOp joinPredicate = (ConstantPredicateOp)joinNode.Child2.Op; 3397Node joinConditionNode = joinNode.HasChild2 ? joinNode.Child2 : (Node)null; 3599newJoinNode = command.CreateNode(joinNode.Op, newLeftInput, newRightInput, joinNode.Child2); 3982Node aggregates = n.Child2; 4243if (n.Child2 == null 4244|| n.Child2.Child0 == null 4245|| n.Child2.Child0.Child0 == null 4246|| n.Child2.Child0.Child0.Op.OpType != OpType.Aggregate)