1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565
|
//---------------------------------------------------------------------
// <copyright file="PlanCompiler.cs" company="Microsoft">
// Copyright (c) Microsoft Corporation. All rights reserved.
// </copyright>
//
// @owner Microsoft
// @backupOwner Microsoft
//---------------------------------------------------------------------
using System;
using System.Collections.Generic;
using System.Diagnostics; // Please use PlanCompiler.Assert instead of Debug.Assert in this class...
// It is fine to use Debug.Assert in cases where you assert an obvious thing that is supposed
// to prevent from simple mistakes during development (e.g. method argument validation
// in cases where it was you who created the variables or the variables had already been validated or
// in "else" clauses where due to code changes (e.g. adding a new value to an enum type) the default
// "else" block is chosen why the new condition should be treated separately). This kind of asserts are
// (can be) helpful when developing new code to avoid simple mistakes but have no or little value in
// the shipped product.
// PlanCompiler.Assert *MUST* be used to verify conditions in the trees. These would be assumptions
// about how the tree was built etc. - in these cases we probably want to throw an exception (this is
// what PlanCompiler.Assert does when the condition is not met) if either the assumption is not correct
// or the tree was built/rewritten not the way we thought it was.
// Use your judgment - if you rather remove an assert than ship it use Debug.Assert otherwise use
// PlanCompiler.Assert.
using cqt = System.Data.Common.CommandTrees;
using md = System.Data.Metadata.Edm;
using System.Data.Query.InternalTrees;
using System.Data.Query.PlanCompiler;
namespace System.Data.Query.PlanCompiler
{
/// <summary>
/// The PlanCompiler class is used by the BridgeCommand to produce an
/// execution plan - this execution plan is the plan object. The plan compilation
/// process takes as input a command tree (in C space), and then runs through a
/// set of changes before the final plan is produced. The final plan contains
/// one or more command trees (commands?) (in S space), with a set of assembly
/// instructions.
/// The compiler phases include
/// * Convert the command tree (CTree) into an internal tree (an ITree)
/// * Run initializations on the ITree.
/// * Eliminate structured types from the tree
/// * Eliminating named type references, refs and records from the tree
/// At the end of this phase, we still may have collections (and record
/// arguments to collections) in the tree.
/// * Projection pruning (ie) eliminating unused references
/// * Tree transformations. Various transformations are run on the ITree to
/// (ostensibly) optimize the tree. These transformations are represented as
/// rules, and a rule processor is invoked.
/// * Nest elimination. At this point, we try to get pull up nest operations
/// as high up the tree as possible
/// * Code Generation. This phase produces a plan object with various subpieces
/// of the ITree represented as commands (in S space).
/// * The subtrees of the ITree are then converted into the corresponding CTrees
/// and converted into S space as part of the CTree creation.
/// * A plan object is created and returned.
/// </summary>
internal class PlanCompiler
{
#region private state
/// <summary>
/// A boolean switch indicating whether we should apply transformation rules regardless of the size of the Iqt.
/// By default, the Enabled property of a boolean switch is set using the value specified in the configuration file.
/// Configuring the switch with a value of 0 sets the Enabled property to false; configuring the switch with a nonzero
/// value to set the Enabled property to true. If the BooleanSwitch constructor cannot find initial switch settings
/// in the configuration file, the Enabled property of the new switch is set to false by default.
/// </summary>
private static BooleanSwitch _applyTransformationsRegardlessOfSize = new BooleanSwitch("System.Data.EntityClient.IgnoreOptimizationLimit", "The Entity Framework should try to optimize the query regardless of its size");
/// <summary>
/// Determines the maximum size of the query in terms of Iqt nodes for which we attempt to do transformation rules.
/// This number is ignored if applyTransformationsRegardlessOfSize is enabled.
/// </summary>
private const int MaxNodeCountForTransformations = 100000;
/// <summary>
/// The CTree we're compiling a plan for.
/// </summary>
private cqt.DbCommandTree m_ctree;
/// <summary>
/// The ITree we're working on.
/// </summary>
private Command m_command;
/// <summary>
/// The phase of the process we're currently in.
/// </summary>
private PlanCompilerPhase m_phase;
/// <summary>
/// Set of phases we need to go through
/// </summary>
private int m_neededPhases;
/// <summary>
/// Keeps track of foreign key relationships. Needed by Join Elimination
/// </summary>
private ConstraintManager m_constraintManager;
/// <summary>
/// Can transformation rules be applied
/// </summary>
private Nullable<bool> m_mayApplyTransformationRules = null;
/// <summary>
/// Does the command include any sort key that represents a null sentinel
/// This may only be set to true in NominalTypeElimination and is used
/// in Transformation Rules
/// </summary>
private bool m_hasSortingOnNullSentinels = false;
#endregion
#region constructors
/// <summary>
/// private constructor
/// </summary>
/// <param name="ctree">the input cqt</param>
private PlanCompiler(cqt.DbCommandTree ctree)
{
m_ctree = ctree; // the input command tree
}
#endregion
#region public interfaces
/// <summary>
/// Retail Assertion code.
///
/// Provides the ability to have retail asserts.
/// </summary>
/// <param name="condition"></param>
/// <param name="message"></param>
internal static void Assert(bool condition, string message)
{
if (!condition)
{
System.Diagnostics.Debug.Fail(message);
// NOTE: I considered, at great length, whether to have the assertion message text
// included in the exception we throw; in the end, there really isn't a reliable
// equivalent to the C++ __LINE__ and __FILE__ macros in C# (at least not without
// using the C++ PreProcessor...ick) The StackTrace object comes close but
// doesn't handle inlined callers properly for our needs (MethodA() calls MethodB()
// calls us, but MethodB() is inlined, so we'll get MethodA() info instead), and
// since these are retail "Asserts" (as in: we're not supposed to get them in our
// shipping code, and we're doing this to avoid a null-ref which is even worse) I
// elected to simplify this by just including them as the additional info.
throw EntityUtil.InternalError(EntityUtil.InternalErrorCode.AssertionFailed, 0, message);
}
}
/// <summary>
/// Compile a query, and produce a plan
/// </summary>
/// <param name="ctree">the input CQT</param>
/// <param name="providerCommands">list of provider commands</param>
/// <param name="resultColumnMap">column map for result assembly</param>
/// <param name="entitySets">the entity sets referenced in this query</param>
/// <returns>a compiled plan object</returns>
internal static void Compile(cqt.DbCommandTree ctree, out List<ProviderCommandInfo> providerCommands, out ColumnMap resultColumnMap, out int columnCount, out Common.Utils.Set<md.EntitySet> entitySets)
{
PlanCompiler.Assert(ctree != null, "Expected a valid, non-null Command Tree input");
PlanCompiler pc = new PlanCompiler(ctree);
pc.Compile(out providerCommands, out resultColumnMap, out columnCount, out entitySets);
}
/// <summary>
/// Get the current command
/// </summary>
internal Command Command { get { return m_command; } }
/// <summary>
/// Does the command include any sort key that represents a null sentinel
/// This may only be set to true in NominalTypeElimination and is used
/// in Transformation Rules
/// </summary>
internal bool HasSortingOnNullSentinels
{
get { return m_hasSortingOnNullSentinels; }
set { m_hasSortingOnNullSentinels = value; }
}
/// <summary>
/// Keeps track of foreign key relationships. Needed by Join Elimination
/// </summary>
internal ConstraintManager ConstraintManager
{
get
{
if (m_constraintManager == null)
{
m_constraintManager = new ConstraintManager();
}
return m_constraintManager;
}
}
#if DEBUG
/// <summary>
/// Get the current plan compiler phase
/// </summary>
internal PlanCompilerPhase Phase { get { return m_phase; } }
/// <summary>
/// Sets the current plan compiler trace function to <paramref name="traceCallback"/>, enabling plan compiler tracing
/// </summary>
internal static void TraceOn(Action<string, object> traceCallback)
{
s_traceCallback = traceCallback;
}
/// <summary>
/// Sets the current plan compiler trace function to <c>null</c>, disabling plan compiler tracing
/// </summary>
internal static void TraceOff()
{
s_traceCallback = null;
}
private static Action<string, object> s_traceCallback;
#endif
/// <summary>
/// The MetadataWorkspace
/// </summary>
internal md.MetadataWorkspace MetadataWorkspace { get { return m_ctree.MetadataWorkspace; } }
/// <summary>
/// Is the specified phase needed for this query?
/// </summary>
/// <param name="phase">the phase in question</param>
/// <returns></returns>
internal bool IsPhaseNeeded(PlanCompilerPhase phase)
{
return ((m_neededPhases & (1 << (int)phase)) != 0);
}
/// <summary>
/// Mark the specified phase as needed
/// </summary>
/// <param name="phase">plan compiler phase</param>
internal void MarkPhaseAsNeeded(PlanCompilerPhase phase)
{
m_neededPhases = m_neededPhases | (1 << (int)phase);
}
#endregion
#region private methods
/// <summary>
/// The real driver.
/// </summary>
/// <param name="providerCommands">list of provider commands</param>
/// <param name="resultColumnMap">column map for the result</param>
/// <param name="entitySets">the entity sets exposed in this query</param>
private void Compile(out List<ProviderCommandInfo> providerCommands, out ColumnMap resultColumnMap, out int columnCount, out Common.Utils.Set<md.EntitySet> entitySets)
{
Initialize(); // initialize the ITree
string beforePreProcessor = String.Empty;
string beforeAggregatePushdown = String.Empty;
string beforeNormalization = String.Empty;
string beforeNTE = String.Empty;
string beforeProjectionPruning1 = String.Empty;
string beforeNestPullup = String.Empty;
string beforeProjectionPruning2 = String.Empty;
string beforeTransformationRules1 = String.Empty;
string beforeProjectionPruning3 = String.Empty;
string beforeTransformationRules2 = String.Empty;
string beforeJoinElimination1 = String.Empty;
string beforeTransformationRules3 = String.Empty;
string beforeJoinElimination2 = String.Empty;
string beforeTransformationRules4 = String.Empty;
string beforeCodeGen = String.Empty;
//
// We always need the pre-processor and the codegen phases.
// It is generally a good thing to run through the transformation rules, and
// the projection pruning phases.
// The "optional" phases are AggregatePushdown, Normalization, NTE, NestPullup and JoinElimination
//
m_neededPhases = (1 << (int)PlanCompilerPhase.PreProcessor) |
// (1 << (int)PlanCompilerPhase.AggregatePushdown) |
// (1 << (int)PlanCompilerPhase.Normalization) |
// (1 << (int)PlanCompilerPhase.NTE) |
(1 << (int)PlanCompilerPhase.ProjectionPruning) |
// (1 << (int)PlanCompilerPhase.NestPullup) |
(1 << (int)PlanCompilerPhase.Transformations) |
// (1 << (int)PlanCompilerPhase.JoinElimination) |
(1 << (int)PlanCompilerPhase.CodeGen);
// Perform any necessary preprocessing
StructuredTypeInfo typeInfo;
Dictionary<md.EdmFunction, md.EdmProperty[]> tvfResultKeys;
beforePreProcessor = SwitchToPhase(PlanCompilerPhase.PreProcessor);
PreProcessor.Process(this, out typeInfo, out tvfResultKeys);
entitySets = typeInfo.GetEntitySets();
if (IsPhaseNeeded(PlanCompilerPhase.AggregatePushdown))
{
beforeAggregatePushdown = SwitchToPhase(PlanCompilerPhase.AggregatePushdown);
AggregatePushdown.Process(this);
}
if (IsPhaseNeeded(PlanCompilerPhase.Normalization))
{
beforeNormalization = SwitchToPhase(PlanCompilerPhase.Normalization);
Normalizer.Process(this);
}
// Eliminate "structured" types.
if (IsPhaseNeeded(PlanCompilerPhase.NTE))
{
beforeNTE = SwitchToPhase(PlanCompilerPhase.NTE);
NominalTypeEliminator.Process(this, typeInfo, tvfResultKeys);
}
// Projection pruning - eliminate unreferenced expressions
if (IsPhaseNeeded(PlanCompilerPhase.ProjectionPruning))
{
beforeProjectionPruning1 = SwitchToPhase(PlanCompilerPhase.ProjectionPruning);
ProjectionPruner.Process(this);
}
// Nest Pull-up on the ITree
if (IsPhaseNeeded(PlanCompilerPhase.NestPullup))
{
beforeNestPullup = SwitchToPhase(PlanCompilerPhase.NestPullup);
NestPullup.Process(this);
//If we do Nest Pull-up, we should again do projection pruning
beforeProjectionPruning2 = SwitchToPhase(PlanCompilerPhase.ProjectionPruning);
ProjectionPruner.Process(this);
}
// Run transformations on the tree
if (IsPhaseNeeded(PlanCompilerPhase.Transformations))
{
bool projectionPrunningNeeded = ApplyTransformations(ref beforeTransformationRules1, TransformationRulesGroup.All);
if (projectionPrunningNeeded)
{
beforeProjectionPruning3 = SwitchToPhase(PlanCompilerPhase.ProjectionPruning);
ProjectionPruner.Process(this);
ApplyTransformations(ref beforeTransformationRules2, TransformationRulesGroup.Project);
}
}
// Join elimination
if (IsPhaseNeeded(PlanCompilerPhase.JoinElimination))
{
beforeJoinElimination1 = SwitchToPhase(PlanCompilerPhase.JoinElimination);
bool modified = JoinElimination.Process(this);
if (modified)
{
ApplyTransformations(ref beforeTransformationRules3, TransformationRulesGroup.PostJoinElimination);
beforeJoinElimination2 = SwitchToPhase(PlanCompilerPhase.JoinElimination);
modified = JoinElimination.Process(this);
if (modified)
{
ApplyTransformations(ref beforeTransformationRules4, TransformationRulesGroup.PostJoinElimination);
}
}
}
// Code generation
beforeCodeGen = SwitchToPhase(PlanCompilerPhase.CodeGen);
CodeGen.Process(this, out providerCommands, out resultColumnMap, out columnCount);
#if DEBUG
// GC.KeepAlive makes FxCop Grumpy.
int size = beforePreProcessor.Length;
size = beforeAggregatePushdown.Length;
size = beforeNormalization.Length;
size = beforeNTE.Length;
size = beforeProjectionPruning1.Length;
size = beforeNestPullup.Length;
size = beforeProjectionPruning2.Length;
size = beforeTransformationRules1.Length;
size = beforeProjectionPruning3.Length;
size = beforeTransformationRules2.Length;
size = beforeJoinElimination1.Length;
size = beforeTransformationRules3.Length;
size = beforeJoinElimination2.Length;
size = beforeTransformationRules4.Length;
size = beforeCodeGen.Length;
#endif
// All done
return;
}
/// <summary>
/// Helper method for applying transformation rules
/// </summary>
/// <param name="dumpString"></param>
/// <param name="rulesGroup"></param>
/// <returns></returns>
private bool ApplyTransformations(ref string dumpString, TransformationRulesGroup rulesGroup)
{
if (MayApplyTransformationRules)
{
dumpString = SwitchToPhase(PlanCompilerPhase.Transformations);
return TransformationRules.Process(this, rulesGroup);
}
return false;
}
/// <summary>
/// Logic to perform between each compile phase
/// </summary>
/// <param name="newPhase"></param>
/// <returns></returns>
private string SwitchToPhase(PlanCompilerPhase newPhase)
{
string iqtDumpResult = string.Empty;
m_phase = newPhase;
#if DEBUG
if (s_traceCallback != null)
{
s_traceCallback(Enum.GetName(typeof(PlanCompilerPhase), newPhase), m_command);
}
else
{
iqtDumpResult = Dump.ToXml(m_command);
}
Validator.Validate(this);
#endif
return iqtDumpResult;
}
/// <summary>
/// To avoid processing huge trees, transformation rules are applied only if the number of nodes
/// is less than MaxNodeCountForTransformations
/// or if it is specified that they should be applied regardless of the size of the query.
/// Whether to apply transformations is only computed the first time this property is requested,
/// and is cached afterwards. This is because we don't expect the tree to get larger
/// from applying transformations.
/// </summary>
private bool MayApplyTransformationRules
{
get
{
if (m_mayApplyTransformationRules == null)
{
m_mayApplyTransformationRules = ComputeMayApplyTransformations();
}
return m_mayApplyTransformationRules.Value;
}
}
/// <summary>
/// Compute whether transformations may be applied.
/// Transformation rules may be applied only if the number of nodes is less than
/// MaxNodeCountForTransformations or if it is specified that they should be applied
/// regardless of the size of the query.
/// </summary>
/// <returns></returns>
private bool ComputeMayApplyTransformations()
{
//
// If the nextNodeId is less than MaxNodeCountForTransformations then we don't need to
// calculate the acutal node count, it must be less than MaxNodeCountForTransformations
//
if (_applyTransformationsRegardlessOfSize.Enabled || this.m_command.NextNodeId < MaxNodeCountForTransformations)
{
return true;
}
//Compute the actual node count
int actualCount = NodeCounter.Count(this.m_command.Root);
return (actualCount < MaxNodeCountForTransformations);
}
/// <summary>
/// Converts the CTree into an ITree, and initializes the plan
/// </summary>
private void Initialize()
{
// Only support queries for now
cqt.DbQueryCommandTree cqtree = m_ctree as cqt.DbQueryCommandTree;
PlanCompiler.Assert(cqtree != null, "Unexpected command tree kind. Only query command tree is supported.");
// Generate the ITree
m_command = ITreeGenerator.Generate(cqtree);
PlanCompiler.Assert(m_command != null, "Unable to generate internal tree from Command Tree");
}
#endregion
}
/// <summary>
/// Enum describing which phase of plan compilation we're currently in
/// </summary>
internal enum PlanCompilerPhase
{
/// <summary>
/// Just entering the PreProcessor phase
/// </summary>
PreProcessor = 0,
/// <summary>
/// Entering the AggregatePushdown phase
/// </summary>
AggregatePushdown = 1,
/// <summary>
/// Entering the Normalization phase
/// </summary>
Normalization = 2,
/// <summary>
/// Entering the NTE (Nominal Type Eliminator) phase
/// </summary>
NTE = 3,
/// <summary>
/// Entering the Projection pruning phase
/// </summary>
ProjectionPruning = 4,
/// <summary>
/// Entering the Nest Pullup phase
/// </summary>
NestPullup = 5,
/// <summary>
/// Entering the Transformations phase
/// </summary>
Transformations = 6,
/// <summary>
/// Entering the JoinElimination phase
/// </summary>
JoinElimination = 7,
/// <summary>
/// Entering the codegen phase
/// </summary>
CodeGen = 8,
/// <summary>
/// We're almost done
/// </summary>
PostCodeGen = 9,
/// <summary>
/// Marker
/// </summary>
MaxMarker = 10
}
}
|