1 //===--- ASTDiagnostic.cpp - Diagnostic Printing Hooks for AST Nodes ------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 //
10 // This file implements a diagnostic formatting hook for AST elements.
11 //
12 //===----------------------------------------------------------------------===//
13 
14 #include "clang/AST/ASTDiagnostic.h"
15 #include "clang/AST/ASTContext.h"
16 #include "clang/AST/ASTLambda.h"
17 #include "clang/AST/Attr.h"
18 #include "clang/AST/DeclObjC.h"
19 #include "clang/AST/DeclTemplate.h"
20 #include "clang/AST/ExprCXX.h"
21 #include "clang/AST/TemplateBase.h"
22 #include "clang/AST/Type.h"
23 #include "llvm/Support/raw_ostream.h"
24 
25 using namespace clang;
26 
27 // Returns a desugared version of the QualType, and marks ShouldAKA as true
28 // whenever we remove significant sugar from the type.
29 static QualType Desugar(ASTContext &Context, QualType QT, bool &ShouldAKA) {
30   QualifierCollector QC;
31 
32   while (true) {
33     const Type *Ty = QC.strip(QT);
34 
35     // Don't aka just because we saw an elaborated type...
36     if (const ElaboratedType *ET = dyn_cast<ElaboratedType>(Ty)) {
37       QT = ET->desugar();
38       continue;
39     }
40     // ... or a paren type ...
41     if (const ParenType *PT = dyn_cast<ParenType>(Ty)) {
42       QT = PT->desugar();
43       continue;
44     }
45     // ...or a substituted template type parameter ...
46     if (const SubstTemplateTypeParmType *ST =
47           dyn_cast<SubstTemplateTypeParmType>(Ty)) {
48       QT = ST->desugar();
49       continue;
50     }
51     // ...or an attributed type...
52     if (const AttributedType *AT = dyn_cast<AttributedType>(Ty)) {
53       QT = AT->desugar();
54       continue;
55     }
56     // ...or an adjusted type...
57     if (const AdjustedType *AT = dyn_cast<AdjustedType>(Ty)) {
58       QT = AT->desugar();
59       continue;
60     }
61     // ... or an auto type.
62     if (const AutoType *AT = dyn_cast<AutoType>(Ty)) {
63       if (!AT->isSugared())
64         break;
65       QT = AT->desugar();
66       continue;
67     }
68 
69     // Desugar FunctionType if return type or any parameter type should be
70     // desugared. Preserve nullability attribute on desugared types.
71     if (const FunctionType *FT = dyn_cast<FunctionType>(Ty)) {
72       bool DesugarReturn = false;
73       QualType SugarRT = FT->getReturnType();
74       QualType RT = Desugar(Context, SugarRT, DesugarReturn);
75       if (auto nullability = AttributedType::stripOuterNullability(SugarRT)) {
76         RT = Context.getAttributedType(
77             AttributedType::getNullabilityAttrKind(*nullability), RT, RT);
78       }
79 
80       bool DesugarArgument = false;
81       SmallVector<QualType, 4> Args;
82       const FunctionProtoType *FPT = dyn_cast<FunctionProtoType>(FT);
83       if (FPT) {
84         for (QualType SugarPT : FPT->param_types()) {
85           QualType PT = Desugar(Context, SugarPT, DesugarArgument);
86           if (auto nullability =
87                   AttributedType::stripOuterNullability(SugarPT)) {
88             PT = Context.getAttributedType(
89                 AttributedType::getNullabilityAttrKind(*nullability), PT, PT);
90           }
91           Args.push_back(PT);
92         }
93       }
94 
95       if (DesugarReturn || DesugarArgument) {
96         ShouldAKA = true;
97         QT = FPT ? Context.getFunctionType(RT, Args, FPT->getExtProtoInfo())
98                  : Context.getFunctionNoProtoType(RT, FT->getExtInfo());
99         break;
100       }
101     }
102 
103     // Desugar template specializations if any template argument should be
104     // desugared.
105     if (const TemplateSpecializationType *TST =
106             dyn_cast<TemplateSpecializationType>(Ty)) {
107       if (!TST->isTypeAlias()) {
108         bool DesugarArgument = false;
109         SmallVector<TemplateArgument, 4> Args;
110         for (unsigned I = 0, N = TST->getNumArgs(); I != N; ++I) {
111           const TemplateArgument &Arg = TST->getArg(I);
112           if (Arg.getKind() == TemplateArgument::Type)
113             Args.push_back(Desugar(Context, Arg.getAsType(), DesugarArgument));
114           else
115             Args.push_back(Arg);
116         }
117 
118         if (DesugarArgument) {
119           ShouldAKA = true;
120           QT = Context.getTemplateSpecializationType(
121               TST->getTemplateName(), Args, QT);
122         }
123         break;
124       }
125     }
126 
127     // Don't desugar magic Objective-C types.
128     if (QualType(Ty,0) == Context.getObjCIdType() ||
129         QualType(Ty,0) == Context.getObjCClassType() ||
130         QualType(Ty,0) == Context.getObjCSelType() ||
131         QualType(Ty,0) == Context.getObjCProtoType())
132       break;
133 
134     // Don't desugar va_list.
135     if (QualType(Ty, 0) == Context.getBuiltinVaListType() ||
136         QualType(Ty, 0) == Context.getBuiltinMSVaListType())
137       break;
138 
139     // Otherwise, do a single-step desugar.
140     QualType Underlying;
141     bool IsSugar = false;
142     switch (Ty->getTypeClass()) {
143 #define ABSTRACT_TYPE(Class, Base)
144 #define TYPE(Class, Base) \
145 case Type::Class: { \
146 const Class##Type *CTy = cast<Class##Type>(Ty); \
147 if (CTy->isSugared()) { \
148 IsSugar = true; \
149 Underlying = CTy->desugar(); \
150 } \
151 break; \
152 }
153 #include "clang/AST/TypeNodes.def"
154     }
155 
156     // If it wasn't sugared, we're done.
157     if (!IsSugar)
158       break;
159 
160     // If the desugared type is a vector type, we don't want to expand
161     // it, it will turn into an attribute mess. People want their "vec4".
162     if (isa<VectorType>(Underlying))
163       break;
164 
165     // Don't desugar through the primary typedef of an anonymous type.
166     if (const TagType *UTT = Underlying->getAs<TagType>())
167       if (const TypedefType *QTT = dyn_cast<TypedefType>(QT))
168         if (UTT->getDecl()->getTypedefNameForAnonDecl() == QTT->getDecl())
169           break;
170 
171     // Record that we actually looked through an opaque type here.
172     ShouldAKA = true;
173     QT = Underlying;
174   }
175 
176   // If we have a pointer-like type, desugar the pointee as well.
177   // FIXME: Handle other pointer-like types.
178   if (const PointerType *Ty = QT->getAs<PointerType>()) {
179     QT = Context.getPointerType(Desugar(Context, Ty->getPointeeType(),
180                                         ShouldAKA));
181   } else if (const auto *Ty = QT->getAs<ObjCObjectPointerType>()) {
182     QT = Context.getObjCObjectPointerType(Desugar(Context, Ty->getPointeeType(),
183                                                   ShouldAKA));
184   } else if (const LValueReferenceType *Ty = QT->getAs<LValueReferenceType>()) {
185     QT = Context.getLValueReferenceType(Desugar(Context, Ty->getPointeeType(),
186                                                 ShouldAKA));
187   } else if (const RValueReferenceType *Ty = QT->getAs<RValueReferenceType>()) {
188     QT = Context.getRValueReferenceType(Desugar(Context, Ty->getPointeeType(),
189                                                 ShouldAKA));
190   } else if (const auto *Ty = QT->getAs<ObjCObjectType>()) {
191     if (Ty->getBaseType().getTypePtr() != Ty && !ShouldAKA) {
192       QualType BaseType = Desugar(Context, Ty->getBaseType(), ShouldAKA);
193       QT = Context.getObjCObjectType(BaseType, Ty->getTypeArgsAsWritten(),
194                                      llvm::makeArrayRef(Ty->qual_begin(),
195                                                         Ty->getNumProtocols()),
196                                      Ty->isKindOfTypeAsWritten());
197     }
198   }
199 
200   return QC.apply(Context, QT);
201 }
202 
203 /// \brief Convert the given type to a string suitable for printing as part of
204 /// a diagnostic.
205 ///
206 /// There are four main criteria when determining whether we should have an
207 /// a.k.a. clause when pretty-printing a type:
208 ///
209 /// 1) Some types provide very minimal sugar that doesn't impede the
210 ///    user's understanding --- for example, elaborated type
211 ///    specifiers.  If this is all the sugar we see, we don't want an
212 ///    a.k.a. clause.
213 /// 2) Some types are technically sugared but are much more familiar
214 ///    when seen in their sugared form --- for example, va_list,
215 ///    vector types, and the magic Objective C types.  We don't
216 ///    want to desugar these, even if we do produce an a.k.a. clause.
217 /// 3) Some types may have already been desugared previously in this diagnostic.
218 ///    if this is the case, doing another "aka" would just be clutter.
219 /// 4) Two different types within the same diagnostic have the same output
220 ///    string.  In this case, force an a.k.a with the desugared type when
221 ///    doing so will provide additional information.
222 ///
223 /// \param Context the context in which the type was allocated
224 /// \param Ty the type to print
225 /// \param QualTypeVals pointer values to QualTypes which are used in the
226 /// diagnostic message
227 static std::string
228 ConvertTypeToDiagnosticString(ASTContext &Context, QualType Ty,
229                             ArrayRef<DiagnosticsEngine::ArgumentValue> PrevArgs,
230                             ArrayRef<intptr_t> QualTypeVals) {
231   // FIXME: Playing with std::string is really slow.
232   bool ForceAKA = false;
233   QualType CanTy = Ty.getCanonicalType();
234   std::string S = Ty.getAsString(Context.getPrintingPolicy());
235   std::string CanS = CanTy.getAsString(Context.getPrintingPolicy());
236 
237   for (unsigned I = 0, E = QualTypeVals.size(); I != E; ++I) {
238     QualType CompareTy =
239         QualType::getFromOpaquePtr(reinterpret_cast<void*>(QualTypeVals[I]));
240     if (CompareTy.isNull())
241       continue;
242     if (CompareTy == Ty)
243       continue;  // Same types
244     QualType CompareCanTy = CompareTy.getCanonicalType();
245     if (CompareCanTy == CanTy)
246       continue;  // Same canonical types
247     std::string CompareS = CompareTy.getAsString(Context.getPrintingPolicy());
248     bool ShouldAKA = false;
249     QualType CompareDesugar = Desugar(Context, CompareTy, ShouldAKA);
250     std::string CompareDesugarStr =
251         CompareDesugar.getAsString(Context.getPrintingPolicy());
252     if (CompareS != S && CompareDesugarStr != S)
253       continue;  // The type string is different than the comparison string
254                  // and the desugared comparison string.
255     std::string CompareCanS =
256         CompareCanTy.getAsString(Context.getPrintingPolicy());
257 
258     if (CompareCanS == CanS)
259       continue;  // No new info from canonical type
260 
261     ForceAKA = true;
262     break;
263   }
264 
265   // Check to see if we already desugared this type in this
266   // diagnostic.  If so, don't do it again.
267   bool Repeated = false;
268   for (unsigned i = 0, e = PrevArgs.size(); i != e; ++i) {
269     // TODO: Handle ak_declcontext case.
270     if (PrevArgs[i].first == DiagnosticsEngine::ak_qualtype) {
271       void *Ptr = (void*)PrevArgs[i].second;
272       QualType PrevTy(QualType::getFromOpaquePtr(Ptr));
273       if (PrevTy == Ty) {
274         Repeated = true;
275         break;
276       }
277     }
278   }
279 
280   // Consider producing an a.k.a. clause if removing all the direct
281   // sugar gives us something "significantly different".
282   if (!Repeated) {
283     bool ShouldAKA = false;
284     QualType DesugaredTy = Desugar(Context, Ty, ShouldAKA);
285     if (ShouldAKA || ForceAKA) {
286       if (DesugaredTy == Ty) {
287         DesugaredTy = Ty.getCanonicalType();
288       }
289       std::string akaStr = DesugaredTy.getAsString(Context.getPrintingPolicy());
290       if (akaStr != S) {
291         S = "'" + S + "' (aka '" + akaStr + "')";
292         return S;
293       }
294     }
295 
296     // Give some additional info on vector types. These are either not desugared
297     // or displaying complex __attribute__ expressions so add details of the
298     // type and element count.
299     if (Ty->isVectorType()) {
300       const VectorType *VTy = Ty->getAs<VectorType>();
301       std::string DecoratedString;
302       llvm::raw_string_ostream OS(DecoratedString);
303       const char *Values = VTy->getNumElements() > 1 ? "values" : "value";
304       OS << "'" << S << "' (vector of " << VTy->getNumElements() << " '"
305          << VTy->getElementType().getAsString(Context.getPrintingPolicy())
306          << "' " << Values << ")";
307       return OS.str();
308     }
309   }
310 
311   S = "'" + S + "'";
312   return S;
313 }
314 
315 static bool FormatTemplateTypeDiff(ASTContext &Context, QualType FromType,
316                                    QualType ToType, bool PrintTree,
317                                    bool PrintFromType, bool ElideType,
318                                    bool ShowColors, raw_ostream &OS);
319 
320 void clang::FormatASTNodeDiagnosticArgument(
321     DiagnosticsEngine::ArgumentKind Kind,
322     intptr_t Val,
323     StringRef Modifier,
324     StringRef Argument,
325     ArrayRef<DiagnosticsEngine::ArgumentValue> PrevArgs,
326     SmallVectorImpl<char> &Output,
327     void *Cookie,
328     ArrayRef<intptr_t> QualTypeVals) {
329   ASTContext &Context = *static_cast<ASTContext*>(Cookie);
330 
331   size_t OldEnd = Output.size();
332   llvm::raw_svector_ostream OS(Output);
333   bool NeedQuotes = true;
334 
335   switch (Kind) {
336     default: llvm_unreachable("unknown ArgumentKind");
337     case DiagnosticsEngine::ak_qualtype_pair: {
338       TemplateDiffTypes &TDT = *reinterpret_cast<TemplateDiffTypes*>(Val);
339       QualType FromType =
340           QualType::getFromOpaquePtr(reinterpret_cast<void*>(TDT.FromType));
341       QualType ToType =
342           QualType::getFromOpaquePtr(reinterpret_cast<void*>(TDT.ToType));
343 
344       if (FormatTemplateTypeDiff(Context, FromType, ToType, TDT.PrintTree,
345                                  TDT.PrintFromType, TDT.ElideType,
346                                  TDT.ShowColors, OS)) {
347         NeedQuotes = !TDT.PrintTree;
348         TDT.TemplateDiffUsed = true;
349         break;
350       }
351 
352       // Don't fall-back during tree printing.  The caller will handle
353       // this case.
354       if (TDT.PrintTree)
355         return;
356 
357       // Attempting to do a template diff on non-templates.  Set the variables
358       // and continue with regular type printing of the appropriate type.
359       Val = TDT.PrintFromType ? TDT.FromType : TDT.ToType;
360       Modifier = StringRef();
361       Argument = StringRef();
362       // Fall through
363     }
364     case DiagnosticsEngine::ak_qualtype: {
365       assert(Modifier.empty() && Argument.empty() &&
366              "Invalid modifier for QualType argument");
367 
368       QualType Ty(QualType::getFromOpaquePtr(reinterpret_cast<void*>(Val)));
369       OS << ConvertTypeToDiagnosticString(Context, Ty, PrevArgs, QualTypeVals);
370       NeedQuotes = false;
371       break;
372     }
373     case DiagnosticsEngine::ak_declarationname: {
374       if (Modifier == "objcclass" && Argument.empty())
375         OS << '+';
376       else if (Modifier == "objcinstance" && Argument.empty())
377         OS << '-';
378       else
379         assert(Modifier.empty() && Argument.empty() &&
380                "Invalid modifier for DeclarationName argument");
381 
382       OS << DeclarationName::getFromOpaqueInteger(Val);
383       break;
384     }
385     case DiagnosticsEngine::ak_nameddecl: {
386       bool Qualified;
387       if (Modifier == "q" && Argument.empty())
388         Qualified = true;
389       else {
390         assert(Modifier.empty() && Argument.empty() &&
391                "Invalid modifier for NamedDecl* argument");
392         Qualified = false;
393       }
394       const NamedDecl *ND = reinterpret_cast<const NamedDecl*>(Val);
395       ND->getNameForDiagnostic(OS, Context.getPrintingPolicy(), Qualified);
396       break;
397     }
398     case DiagnosticsEngine::ak_nestednamespec: {
399       NestedNameSpecifier *NNS = reinterpret_cast<NestedNameSpecifier*>(Val);
400       NNS->print(OS, Context.getPrintingPolicy());
401       NeedQuotes = false;
402       break;
403     }
404     case DiagnosticsEngine::ak_declcontext: {
405       DeclContext *DC = reinterpret_cast<DeclContext *> (Val);
406       assert(DC && "Should never have a null declaration context");
407       NeedQuotes = false;
408 
409       // FIXME: Get the strings for DeclContext from some localized place
410       if (DC->isTranslationUnit()) {
411         if (Context.getLangOpts().CPlusPlus)
412           OS << "the global namespace";
413         else
414           OS << "the global scope";
415       } else if (DC->isClosure()) {
416         OS << "block literal";
417       } else if (isLambdaCallOperator(DC)) {
418         OS << "lambda expression";
419       } else if (TypeDecl *Type = dyn_cast<TypeDecl>(DC)) {
420         OS << ConvertTypeToDiagnosticString(Context,
421                                             Context.getTypeDeclType(Type),
422                                             PrevArgs, QualTypeVals);
423       } else {
424         assert(isa<NamedDecl>(DC) && "Expected a NamedDecl");
425         NamedDecl *ND = cast<NamedDecl>(DC);
426         if (isa<NamespaceDecl>(ND))
427           OS << "namespace ";
428         else if (isa<ObjCMethodDecl>(ND))
429           OS << "method ";
430         else if (isa<FunctionDecl>(ND))
431           OS << "function ";
432 
433         OS << '\'';
434         ND->getNameForDiagnostic(OS, Context.getPrintingPolicy(), true);
435         OS << '\'';
436       }
437       break;
438     }
439     case DiagnosticsEngine::ak_attr: {
440       const Attr *At = reinterpret_cast<Attr *>(Val);
441       assert(At && "Received null Attr object!");
442       OS << '\'' << At->getSpelling() << '\'';
443       NeedQuotes = false;
444       break;
445     }
446   }
447 
448   if (NeedQuotes) {
449     Output.insert(Output.begin()+OldEnd, '\'');
450     Output.push_back('\'');
451   }
452 }
453 
454 /// TemplateDiff - A class that constructs a pretty string for a pair of
455 /// QualTypes.  For the pair of types, a diff tree will be created containing
456 /// all the information about the templates and template arguments.  Afterwards,
457 /// the tree is transformed to a string according to the options passed in.
458 namespace {
459 class TemplateDiff {
460   /// Context - The ASTContext which is used for comparing template arguments.
461   ASTContext &Context;
462 
463   /// Policy - Used during expression printing.
464   PrintingPolicy Policy;
465 
466   /// ElideType - Option to elide identical types.
467   bool ElideType;
468 
469   /// PrintTree - Format output string as a tree.
470   bool PrintTree;
471 
472   /// ShowColor - Diagnostics support color, so bolding will be used.
473   bool ShowColor;
474 
475   /// FromTemplateType - When single type printing is selected, this is the
476   /// type to be be printed.  When tree printing is selected, this type will
477   /// show up first in the tree.
478   QualType FromTemplateType;
479 
480   /// ToTemplateType - The type that FromType is compared to.  Only in tree
481   /// printing will this type be outputed.
482   QualType ToTemplateType;
483 
484   /// OS - The stream used to construct the output strings.
485   raw_ostream &OS;
486 
487   /// IsBold - Keeps track of the bold formatting for the output string.
488   bool IsBold;
489 
490   /// DiffTree - A tree representation the differences between two types.
491   class DiffTree {
492   public:
493     /// DiffKind - The difference in a DiffNode.  Fields of
494     /// TemplateArgumentInfo needed by each difference can be found in the
495     /// Set* and Get* functions.
496     enum DiffKind {
497       /// Incomplete or invalid node.
498       Invalid,
499       /// Another level of templates
500       Template,
501       /// Type difference, all type differences except those falling under
502       /// the Template difference.
503       Type,
504       /// Expression difference, this is only when both arguments are
505       /// expressions.  If one argument is an expression and the other is
506       /// Integer or Declaration, then use that diff type instead.
507       Expression,
508       /// Template argument difference
509       TemplateTemplate,
510       /// Integer difference
511       Integer,
512       /// Declaration difference, nullptr arguments are included here
513       Declaration,
514       /// One argument being integer and the other being declaration
515       FromIntegerAndToDeclaration,
516       FromDeclarationAndToInteger
517     };
518 
519   private:
520     /// TemplateArgumentInfo - All the information needed to pretty print
521     /// a template argument.  See the Set* and Get* functions to see which
522     /// fields are used for each DiffKind.
523     struct TemplateArgumentInfo {
524       QualType ArgType;
525       Qualifiers Qual;
526       llvm::APSInt Val;
527       bool IsValidInt = false;
528       Expr *ArgExpr = nullptr;
529       TemplateDecl *TD = nullptr;
530       ValueDecl *VD = nullptr;
531       bool NeedAddressOf = false;
532       bool IsNullPtr = false;
533       bool IsDefault = false;
534     };
535 
536     /// DiffNode - The root node stores the original type.  Each child node
537     /// stores template arguments of their parents.  For templated types, the
538     /// template decl is also stored.
539     struct DiffNode {
540       DiffKind Kind = Invalid;
541 
542       /// NextNode - The index of the next sibling node or 0.
543       unsigned NextNode = 0;
544 
545       /// ChildNode - The index of the first child node or 0.
546       unsigned ChildNode = 0;
547 
548       /// ParentNode - The index of the parent node.
549       unsigned ParentNode = 0;
550 
551       TemplateArgumentInfo FromArgInfo, ToArgInfo;
552 
553       /// Same - Whether the two arguments evaluate to the same value.
554       bool Same = false;
555 
556       DiffNode(unsigned ParentNode = 0) : ParentNode(ParentNode) {}
557     };
558 
559     /// FlatTree - A flattened tree used to store the DiffNodes.
560     SmallVector<DiffNode, 16> FlatTree;
561 
562     /// CurrentNode - The index of the current node being used.
563     unsigned CurrentNode;
564 
565     /// NextFreeNode - The index of the next unused node.  Used when creating
566     /// child nodes.
567     unsigned NextFreeNode;
568 
569     /// ReadNode - The index of the current node being read.
570     unsigned ReadNode;
571 
572   public:
573     DiffTree() :
574         CurrentNode(0), NextFreeNode(1) {
575       FlatTree.push_back(DiffNode());
576     }
577 
578     // Node writing functions, one for each valid DiffKind element.
579     void SetTemplateDiff(TemplateDecl *FromTD, TemplateDecl *ToTD,
580                          Qualifiers FromQual, Qualifiers ToQual,
581                          bool FromDefault, bool ToDefault) {
582       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
583       FlatTree[CurrentNode].Kind = Template;
584       FlatTree[CurrentNode].FromArgInfo.TD = FromTD;
585       FlatTree[CurrentNode].ToArgInfo.TD = ToTD;
586       FlatTree[CurrentNode].FromArgInfo.Qual = FromQual;
587       FlatTree[CurrentNode].ToArgInfo.Qual = ToQual;
588       SetDefault(FromDefault, ToDefault);
589     }
590 
591     void SetTypeDiff(QualType FromType, QualType ToType, bool FromDefault,
592                      bool ToDefault) {
593       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
594       FlatTree[CurrentNode].Kind = Type;
595       FlatTree[CurrentNode].FromArgInfo.ArgType = FromType;
596       FlatTree[CurrentNode].ToArgInfo.ArgType = ToType;
597       SetDefault(FromDefault, ToDefault);
598     }
599 
600     void SetExpressionDiff(Expr *FromExpr, Expr *ToExpr, bool FromDefault,
601                            bool ToDefault) {
602       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
603       FlatTree[CurrentNode].Kind = Expression;
604       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
605       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
606       SetDefault(FromDefault, ToDefault);
607     }
608 
609     void SetTemplateTemplateDiff(TemplateDecl *FromTD, TemplateDecl *ToTD,
610                                  bool FromDefault, bool ToDefault) {
611       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
612       FlatTree[CurrentNode].Kind = TemplateTemplate;
613       FlatTree[CurrentNode].FromArgInfo.TD = FromTD;
614       FlatTree[CurrentNode].ToArgInfo.TD = ToTD;
615       SetDefault(FromDefault, ToDefault);
616     }
617 
618     void SetIntegerDiff(const llvm::APSInt &FromInt, const llvm::APSInt &ToInt,
619                         bool IsValidFromInt, bool IsValidToInt,
620                         QualType FromIntType, QualType ToIntType,
621                         Expr *FromExpr, Expr *ToExpr, bool FromDefault,
622                         bool ToDefault) {
623       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
624       FlatTree[CurrentNode].Kind = Integer;
625       FlatTree[CurrentNode].FromArgInfo.Val = FromInt;
626       FlatTree[CurrentNode].ToArgInfo.Val = ToInt;
627       FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;
628       FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;
629       FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;
630       FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;
631       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
632       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
633       SetDefault(FromDefault, ToDefault);
634     }
635 
636     void SetDeclarationDiff(ValueDecl *FromValueDecl, ValueDecl *ToValueDecl,
637                             bool FromAddressOf, bool ToAddressOf,
638                             bool FromNullPtr, bool ToNullPtr, Expr *FromExpr,
639                             Expr *ToExpr, bool FromDefault, bool ToDefault) {
640       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
641       FlatTree[CurrentNode].Kind = Declaration;
642       FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;
643       FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;
644       FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;
645       FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;
646       FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;
647       FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;
648       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
649       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
650       SetDefault(FromDefault, ToDefault);
651     }
652 
653     void SetFromDeclarationAndToIntegerDiff(
654         ValueDecl *FromValueDecl, bool FromAddressOf, bool FromNullPtr,
655         Expr *FromExpr, const llvm::APSInt &ToInt, bool IsValidToInt,
656         QualType ToIntType, Expr *ToExpr, bool FromDefault, bool ToDefault) {
657       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
658       FlatTree[CurrentNode].Kind = FromDeclarationAndToInteger;
659       FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;
660       FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;
661       FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;
662       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
663       FlatTree[CurrentNode].ToArgInfo.Val = ToInt;
664       FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;
665       FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;
666       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
667       SetDefault(FromDefault, ToDefault);
668     }
669 
670     void SetFromIntegerAndToDeclarationDiff(
671         const llvm::APSInt &FromInt, bool IsValidFromInt, QualType FromIntType,
672         Expr *FromExpr, ValueDecl *ToValueDecl, bool ToAddressOf,
673         bool ToNullPtr, Expr *ToExpr, bool FromDefault, bool ToDefault) {
674       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
675       FlatTree[CurrentNode].Kind = FromIntegerAndToDeclaration;
676       FlatTree[CurrentNode].FromArgInfo.Val = FromInt;
677       FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;
678       FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;
679       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
680       FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;
681       FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;
682       FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;
683       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
684       SetDefault(FromDefault, ToDefault);
685     }
686 
687     /// SetDefault - Sets FromDefault and ToDefault flags of the current node.
688     void SetDefault(bool FromDefault, bool ToDefault) {
689       assert((!FromDefault || !ToDefault) && "Both arguments cannot be default.");
690       FlatTree[CurrentNode].FromArgInfo.IsDefault = FromDefault;
691       FlatTree[CurrentNode].ToArgInfo.IsDefault = ToDefault;
692     }
693 
694     /// SetSame - Sets the same flag of the current node.
695     void SetSame(bool Same) {
696       FlatTree[CurrentNode].Same = Same;
697     }
698 
699     /// SetKind - Sets the current node's type.
700     void SetKind(DiffKind Kind) {
701       FlatTree[CurrentNode].Kind = Kind;
702     }
703 
704     /// Up - Changes the node to the parent of the current node.
705     void Up() {
706       assert(FlatTree[CurrentNode].Kind != Invalid &&
707              "Cannot exit node before setting node information.");
708       CurrentNode = FlatTree[CurrentNode].ParentNode;
709     }
710 
711     /// AddNode - Adds a child node to the current node, then sets that node
712     /// node as the current node.
713     void AddNode() {
714       assert(FlatTree[CurrentNode].Kind == Template &&
715              "Only Template nodes can have children nodes.");
716       FlatTree.push_back(DiffNode(CurrentNode));
717       DiffNode &Node = FlatTree[CurrentNode];
718       if (Node.ChildNode == 0) {
719         // If a child node doesn't exist, add one.
720         Node.ChildNode = NextFreeNode;
721       } else {
722         // If a child node exists, find the last child node and add a
723         // next node to it.
724         unsigned i;
725         for (i = Node.ChildNode; FlatTree[i].NextNode != 0;
726              i = FlatTree[i].NextNode) {
727         }
728         FlatTree[i].NextNode = NextFreeNode;
729       }
730       CurrentNode = NextFreeNode;
731       ++NextFreeNode;
732     }
733 
734     // Node reading functions.
735     /// StartTraverse - Prepares the tree for recursive traversal.
736     void StartTraverse() {
737       ReadNode = 0;
738       CurrentNode = NextFreeNode;
739       NextFreeNode = 0;
740     }
741 
742     /// Parent - Move the current read node to its parent.
743     void Parent() {
744       ReadNode = FlatTree[ReadNode].ParentNode;
745     }
746 
747     void GetTemplateDiff(TemplateDecl *&FromTD, TemplateDecl *&ToTD,
748                          Qualifiers &FromQual, Qualifiers &ToQual) {
749       assert(FlatTree[ReadNode].Kind == Template && "Unexpected kind.");
750       FromTD = FlatTree[ReadNode].FromArgInfo.TD;
751       ToTD = FlatTree[ReadNode].ToArgInfo.TD;
752       FromQual = FlatTree[ReadNode].FromArgInfo.Qual;
753       ToQual = FlatTree[ReadNode].ToArgInfo.Qual;
754     }
755 
756     void GetTypeDiff(QualType &FromType, QualType &ToType) {
757       assert(FlatTree[ReadNode].Kind == Type && "Unexpected kind");
758       FromType = FlatTree[ReadNode].FromArgInfo.ArgType;
759       ToType = FlatTree[ReadNode].ToArgInfo.ArgType;
760     }
761 
762     void GetExpressionDiff(Expr *&FromExpr, Expr *&ToExpr) {
763       assert(FlatTree[ReadNode].Kind == Expression && "Unexpected kind");
764       FromExpr = FlatTree[ReadNode].FromArgInfo.ArgExpr;
765       ToExpr = FlatTree[ReadNode].ToArgInfo.ArgExpr;
766     }
767 
768     void GetTemplateTemplateDiff(TemplateDecl *&FromTD, TemplateDecl *&ToTD) {
769       assert(FlatTree[ReadNode].Kind == TemplateTemplate && "Unexpected kind.");
770       FromTD = FlatTree[ReadNode].FromArgInfo.TD;
771       ToTD = FlatTree[ReadNode].ToArgInfo.TD;
772     }
773 
774     void GetIntegerDiff(llvm::APSInt &FromInt, llvm::APSInt &ToInt,
775                         bool &IsValidFromInt, bool &IsValidToInt,
776                         QualType &FromIntType, QualType &ToIntType,
777                         Expr *&FromExpr, Expr *&ToExpr) {
778       assert(FlatTree[ReadNode].Kind == Integer && "Unexpected kind.");
779       FromInt = FlatTree[ReadNode].FromArgInfo.Val;
780       ToInt = FlatTree[ReadNode].ToArgInfo.Val;
781       IsValidFromInt = FlatTree[ReadNode].FromArgInfo.IsValidInt;
782       IsValidToInt = FlatTree[ReadNode].ToArgInfo.IsValidInt;
783       FromIntType = FlatTree[ReadNode].FromArgInfo.ArgType;
784       ToIntType = FlatTree[ReadNode].ToArgInfo.ArgType;
785       FromExpr = FlatTree[ReadNode].FromArgInfo.ArgExpr;
786       ToExpr = FlatTree[ReadNode].ToArgInfo.ArgExpr;
787     }
788 
789     void GetDeclarationDiff(ValueDecl *&FromValueDecl, ValueDecl *&ToValueDecl,
790                             bool &FromAddressOf, bool &ToAddressOf,
791                             bool &FromNullPtr, bool &ToNullPtr, Expr *&FromExpr,
792                             Expr *&ToExpr) {
793       assert(FlatTree[ReadNode].Kind == Declaration && "Unexpected kind.");
794       FromValueDecl = FlatTree[ReadNode].FromArgInfo.VD;
795       ToValueDecl = FlatTree[ReadNode].ToArgInfo.VD;
796       FromAddressOf = FlatTree[ReadNode].FromArgInfo.NeedAddressOf;
797       ToAddressOf = FlatTree[ReadNode].ToArgInfo.NeedAddressOf;
798       FromNullPtr = FlatTree[ReadNode].FromArgInfo.IsNullPtr;
799       ToNullPtr = FlatTree[ReadNode].ToArgInfo.IsNullPtr;
800       FromExpr = FlatTree[ReadNode].FromArgInfo.ArgExpr;
801       ToExpr = FlatTree[ReadNode].ToArgInfo.ArgExpr;
802     }
803 
804     void GetFromDeclarationAndToIntegerDiff(
805         ValueDecl *&FromValueDecl, bool &FromAddressOf, bool &FromNullPtr,
806         Expr *&FromExpr, llvm::APSInt &ToInt, bool &IsValidToInt,
807         QualType &ToIntType, Expr *&ToExpr) {
808       assert(FlatTree[ReadNode].Kind == FromDeclarationAndToInteger &&
809              "Unexpected kind.");
810       FromValueDecl = FlatTree[ReadNode].FromArgInfo.VD;
811       FromAddressOf = FlatTree[ReadNode].FromArgInfo.NeedAddressOf;
812       FromNullPtr = FlatTree[ReadNode].FromArgInfo.IsNullPtr;
813       FromExpr = FlatTree[ReadNode].FromArgInfo.ArgExpr;
814       ToInt = FlatTree[ReadNode].ToArgInfo.Val;
815       IsValidToInt = FlatTree[ReadNode].ToArgInfo.IsValidInt;
816       ToIntType = FlatTree[ReadNode].ToArgInfo.ArgType;
817       ToExpr = FlatTree[ReadNode].ToArgInfo.ArgExpr;
818     }
819 
820     void GetFromIntegerAndToDeclarationDiff(
821         llvm::APSInt &FromInt, bool &IsValidFromInt, QualType &FromIntType,
822         Expr *&FromExpr, ValueDecl *&ToValueDecl, bool &ToAddressOf,
823         bool &ToNullPtr, Expr *&ToExpr) {
824       assert(FlatTree[ReadNode].Kind == FromIntegerAndToDeclaration &&
825              "Unexpected kind.");
826       FromInt = FlatTree[ReadNode].FromArgInfo.Val;
827       IsValidFromInt = FlatTree[ReadNode].FromArgInfo.IsValidInt;
828       FromIntType = FlatTree[ReadNode].FromArgInfo.ArgType;
829       FromExpr = FlatTree[ReadNode].FromArgInfo.ArgExpr;
830       ToValueDecl = FlatTree[ReadNode].ToArgInfo.VD;
831       ToAddressOf = FlatTree[ReadNode].ToArgInfo.NeedAddressOf;
832       ToNullPtr = FlatTree[ReadNode].ToArgInfo.IsNullPtr;
833       ToExpr = FlatTree[ReadNode].ToArgInfo.ArgExpr;
834     }
835 
836     /// FromDefault - Return true if the from argument is the default.
837     bool FromDefault() {
838       return FlatTree[ReadNode].FromArgInfo.IsDefault;
839     }
840 
841     /// ToDefault - Return true if the to argument is the default.
842     bool ToDefault() {
843       return FlatTree[ReadNode].ToArgInfo.IsDefault;
844     }
845 
846     /// NodeIsSame - Returns true the arguments are the same.
847     bool NodeIsSame() {
848       return FlatTree[ReadNode].Same;
849     }
850 
851     /// HasChildrend - Returns true if the node has children.
852     bool HasChildren() {
853       return FlatTree[ReadNode].ChildNode != 0;
854     }
855 
856     /// MoveToChild - Moves from the current node to its child.
857     void MoveToChild() {
858       ReadNode = FlatTree[ReadNode].ChildNode;
859     }
860 
861     /// AdvanceSibling - If there is a next sibling, advance to it and return
862     /// true.  Otherwise, return false.
863     bool AdvanceSibling() {
864       if (FlatTree[ReadNode].NextNode == 0)
865         return false;
866 
867       ReadNode = FlatTree[ReadNode].NextNode;
868       return true;
869     }
870 
871     /// HasNextSibling - Return true if the node has a next sibling.
872     bool HasNextSibling() {
873       return FlatTree[ReadNode].NextNode != 0;
874     }
875 
876     /// Empty - Returns true if the tree has no information.
877     bool Empty() {
878       return GetKind() == Invalid;
879     }
880 
881     /// GetKind - Returns the current node's type.
882     DiffKind GetKind() {
883       return FlatTree[ReadNode].Kind;
884     }
885   };
886 
887   DiffTree Tree;
888 
889   /// TSTiterator - a pair of iterators that walks the
890   /// TemplateSpecializationType and the desugared TemplateSpecializationType.
891   /// The deseguared TemplateArgument should provide the canonical argument
892   /// for comparisons.
893   class TSTiterator {
894     typedef const TemplateArgument& reference;
895     typedef const TemplateArgument* pointer;
896 
897     /// InternalIterator - an iterator that is used to enter a
898     /// TemplateSpecializationType and read TemplateArguments inside template
899     /// parameter packs in order with the rest of the TemplateArguments.
900     struct InternalIterator {
901       /// TST - the template specialization whose arguments this iterator
902       /// traverse over.
903       const TemplateSpecializationType *TST;
904 
905       /// Index - the index of the template argument in TST.
906       unsigned Index;
907 
908       /// CurrentTA - if CurrentTA is not the same as EndTA, then CurrentTA
909       /// points to a TemplateArgument within a parameter pack.
910       TemplateArgument::pack_iterator CurrentTA;
911 
912       /// EndTA - the end iterator of a parameter pack
913       TemplateArgument::pack_iterator EndTA;
914 
915       /// InternalIterator - Constructs an iterator and sets it to the first
916       /// template argument.
917       InternalIterator(const TemplateSpecializationType *TST)
918           : TST(TST), Index(0), CurrentTA(nullptr), EndTA(nullptr) {
919         if (isEnd()) return;
920 
921         // Set to first template argument.  If not a parameter pack, done.
922         TemplateArgument TA = TST->getArg(0);
923         if (TA.getKind() != TemplateArgument::Pack) return;
924 
925         // Start looking into the parameter pack.
926         CurrentTA = TA.pack_begin();
927         EndTA = TA.pack_end();
928 
929         // Found a valid template argument.
930         if (CurrentTA != EndTA) return;
931 
932         // Parameter pack is empty, use the increment to get to a valid
933         // template argument.
934         ++(*this);
935       }
936 
937       /// isEnd - Returns true if the iterator is one past the end.
938       bool isEnd() const {
939         return Index >= TST->getNumArgs();
940       }
941 
942       /// &operator++ - Increment the iterator to the next template argument.
943       InternalIterator &operator++() {
944         if (isEnd()) {
945           return *this;
946         }
947 
948         // If in a parameter pack, advance in the parameter pack.
949         if (CurrentTA != EndTA) {
950           ++CurrentTA;
951           if (CurrentTA != EndTA)
952             return *this;
953         }
954 
955         // Loop until a template argument is found, or the end is reached.
956         while (true) {
957           // Advance to the next template argument.  Break if reached the end.
958           if (++Index == TST->getNumArgs())
959             break;
960 
961           // If the TemplateArgument is not a parameter pack, done.
962           TemplateArgument TA = TST->getArg(Index);
963           if (TA.getKind() != TemplateArgument::Pack)
964             break;
965 
966           // Handle parameter packs.
967           CurrentTA = TA.pack_begin();
968           EndTA = TA.pack_end();
969 
970           // If the parameter pack is empty, try to advance again.
971           if (CurrentTA != EndTA)
972             break;
973         }
974         return *this;
975       }
976 
977       /// operator* - Returns the appropriate TemplateArgument.
978       reference operator*() const {
979         assert(!isEnd() && "Index exceeds number of arguments.");
980         if (CurrentTA == EndTA)
981           return TST->getArg(Index);
982         else
983           return *CurrentTA;
984       }
985 
986       /// operator-> - Allow access to the underlying TemplateArgument.
987       pointer operator->() const {
988         return &operator*();
989       }
990     };
991 
992     bool UseDesugaredIterator;
993     InternalIterator SugaredIterator;
994     InternalIterator DesugaredIterator;
995 
996   public:
997     TSTiterator(ASTContext &Context, const TemplateSpecializationType *TST)
998         : UseDesugaredIterator(TST->isSugared() && !TST->isTypeAlias()),
999           SugaredIterator(TST),
1000           DesugaredIterator(
1001               GetTemplateSpecializationType(Context, TST->desugar())) {}
1002 
1003     /// &operator++ - Increment the iterator to the next template argument.
1004     TSTiterator &operator++() {
1005       ++SugaredIterator;
1006       if (UseDesugaredIterator)
1007         ++DesugaredIterator;
1008       return *this;
1009     }
1010 
1011     /// operator* - Returns the appropriate TemplateArgument.
1012     reference operator*() const {
1013       return *SugaredIterator;
1014     }
1015 
1016     /// operator-> - Allow access to the underlying TemplateArgument.
1017     pointer operator->() const {
1018       return &operator*();
1019     }
1020 
1021     /// isEnd - Returns true if no more TemplateArguments are available.
1022     bool isEnd() const {
1023       return SugaredIterator.isEnd();
1024     }
1025 
1026     /// hasDesugaredTA - Returns true if there is another TemplateArgument
1027     /// available.
1028     bool hasDesugaredTA() const {
1029       return UseDesugaredIterator && !DesugaredIterator.isEnd();
1030     }
1031 
1032     /// getDesugaredTA - Returns the desugared TemplateArgument.
1033     reference getDesugaredTA() const {
1034       assert(UseDesugaredIterator &&
1035              "Desugared TemplateArgument should not be used.");
1036       return *DesugaredIterator;
1037     }
1038   };
1039 
1040   // These functions build up the template diff tree, including functions to
1041   // retrieve and compare template arguments.
1042 
1043   static const TemplateSpecializationType *GetTemplateSpecializationType(
1044       ASTContext &Context, QualType Ty) {
1045     if (const TemplateSpecializationType *TST =
1046             Ty->getAs<TemplateSpecializationType>())
1047       return TST;
1048 
1049     const RecordType *RT = Ty->getAs<RecordType>();
1050 
1051     if (!RT)
1052       return nullptr;
1053 
1054     const ClassTemplateSpecializationDecl *CTSD =
1055         dyn_cast<ClassTemplateSpecializationDecl>(RT->getDecl());
1056 
1057     if (!CTSD)
1058       return nullptr;
1059 
1060     Ty = Context.getTemplateSpecializationType(
1061              TemplateName(CTSD->getSpecializedTemplate()),
1062              CTSD->getTemplateArgs().asArray(),
1063              Ty.getLocalUnqualifiedType().getCanonicalType());
1064 
1065     return Ty->getAs<TemplateSpecializationType>();
1066   }
1067 
1068   /// Returns true if the DiffType is Type and false for Template.
1069   static bool OnlyPerformTypeDiff(ASTContext &Context, QualType FromType,
1070                                   QualType ToType,
1071                                   const TemplateSpecializationType *&FromArgTST,
1072                                   const TemplateSpecializationType *&ToArgTST) {
1073     if (FromType.isNull() || ToType.isNull())
1074       return true;
1075 
1076     if (Context.hasSameType(FromType, ToType))
1077       return true;
1078 
1079     FromArgTST = GetTemplateSpecializationType(Context, FromType);
1080     ToArgTST = GetTemplateSpecializationType(Context, ToType);
1081 
1082     if (!FromArgTST || !ToArgTST)
1083       return true;
1084 
1085     if (!hasSameTemplate(FromArgTST, ToArgTST))
1086       return true;
1087 
1088     return false;
1089   }
1090 
1091   /// DiffTypes - Fills a DiffNode with information about a type difference.
1092   void DiffTypes(const TSTiterator &FromIter, const TSTiterator &ToIter) {
1093     QualType FromType = GetType(FromIter);
1094     QualType ToType = GetType(ToIter);
1095 
1096     bool FromDefault = FromIter.isEnd() && !FromType.isNull();
1097     bool ToDefault = ToIter.isEnd() && !ToType.isNull();
1098 
1099     const TemplateSpecializationType *FromArgTST = nullptr;
1100     const TemplateSpecializationType *ToArgTST = nullptr;
1101     if (OnlyPerformTypeDiff(Context, FromType, ToType, FromArgTST, ToArgTST)) {
1102       Tree.SetTypeDiff(FromType, ToType, FromDefault, ToDefault);
1103       Tree.SetSame(!FromType.isNull() && !ToType.isNull() &&
1104                    Context.hasSameType(FromType, ToType));
1105     } else {
1106       assert(FromArgTST && ToArgTST &&
1107              "Both template specializations need to be valid.");
1108       Qualifiers FromQual = FromType.getQualifiers(),
1109                  ToQual = ToType.getQualifiers();
1110       FromQual -= QualType(FromArgTST, 0).getQualifiers();
1111       ToQual -= QualType(ToArgTST, 0).getQualifiers();
1112       Tree.SetTemplateDiff(FromArgTST->getTemplateName().getAsTemplateDecl(),
1113                            ToArgTST->getTemplateName().getAsTemplateDecl(),
1114                            FromQual, ToQual, FromDefault, ToDefault);
1115       DiffTemplate(FromArgTST, ToArgTST);
1116     }
1117   }
1118 
1119   /// DiffTemplateTemplates - Fills a DiffNode with information about a
1120   /// template template difference.
1121   void DiffTemplateTemplates(const TSTiterator &FromIter,
1122                              const TSTiterator &ToIter) {
1123     TemplateDecl *FromDecl = GetTemplateDecl(FromIter);
1124     TemplateDecl *ToDecl = GetTemplateDecl(ToIter);
1125     Tree.SetTemplateTemplateDiff(FromDecl, ToDecl, FromIter.isEnd() && FromDecl,
1126                                  ToIter.isEnd() && ToDecl);
1127     Tree.SetSame(FromDecl && ToDecl &&
1128                  FromDecl->getCanonicalDecl() == ToDecl->getCanonicalDecl());
1129   }
1130 
1131   /// InitializeNonTypeDiffVariables - Helper function for DiffNonTypes
1132   static void InitializeNonTypeDiffVariables(ASTContext &Context,
1133                                              const TSTiterator &Iter,
1134                                              NonTypeTemplateParmDecl *Default,
1135                                              llvm::APSInt &Value, bool &HasInt,
1136                                              QualType &IntType, bool &IsNullPtr,
1137                                              Expr *&E, ValueDecl *&VD,
1138                                              bool &NeedAddressOf) {
1139     if (!Iter.isEnd()) {
1140       switch (Iter->getKind()) {
1141         default:
1142           llvm_unreachable("unknown ArgumentKind");
1143         case TemplateArgument::Integral:
1144           Value = Iter->getAsIntegral();
1145           HasInt = true;
1146           IntType = Iter->getIntegralType();
1147           return;
1148         case TemplateArgument::Declaration: {
1149           VD = Iter->getAsDecl();
1150           QualType ArgType = Iter->getParamTypeForDecl();
1151           QualType VDType = VD->getType();
1152           if (ArgType->isPointerType() &&
1153               Context.hasSameType(ArgType->getPointeeType(), VDType))
1154             NeedAddressOf = true;
1155           return;
1156         }
1157         case TemplateArgument::NullPtr:
1158           IsNullPtr = true;
1159           return;
1160         case TemplateArgument::Expression:
1161           E = Iter->getAsExpr();
1162       }
1163     } else if (!Default->isParameterPack()) {
1164       E = Default->getDefaultArgument();
1165     }
1166 
1167     if (!Iter.hasDesugaredTA()) return;
1168 
1169     const TemplateArgument& TA = Iter.getDesugaredTA();
1170     switch (TA.getKind()) {
1171       default:
1172         llvm_unreachable("unknown ArgumentKind");
1173       case TemplateArgument::Integral:
1174         Value = TA.getAsIntegral();
1175         HasInt = true;
1176         IntType = TA.getIntegralType();
1177         return;
1178       case TemplateArgument::Declaration: {
1179         VD = TA.getAsDecl();
1180         QualType ArgType = TA.getParamTypeForDecl();
1181         QualType VDType = VD->getType();
1182         if (ArgType->isPointerType() &&
1183             Context.hasSameType(ArgType->getPointeeType(), VDType))
1184           NeedAddressOf = true;
1185         return;
1186       }
1187       case TemplateArgument::NullPtr:
1188         IsNullPtr = true;
1189         return;
1190       case TemplateArgument::Expression:
1191         // TODO: Sometimes, the desugared template argument Expr differs from
1192         // the sugared template argument Expr.  It may be useful in the future
1193         // but for now, it is just discarded.
1194         if (!E)
1195           E = TA.getAsExpr();
1196         return;
1197     }
1198   }
1199 
1200   /// DiffNonTypes - Handles any template parameters not handled by DiffTypes
1201   /// of DiffTemplatesTemplates, such as integer and declaration parameters.
1202   void DiffNonTypes(const TSTiterator &FromIter, const TSTiterator &ToIter,
1203                     NonTypeTemplateParmDecl *FromDefaultNonTypeDecl,
1204                     NonTypeTemplateParmDecl *ToDefaultNonTypeDecl) {
1205     Expr *FromExpr = nullptr, *ToExpr = nullptr;
1206     llvm::APSInt FromInt, ToInt;
1207     QualType FromIntType, ToIntType;
1208     ValueDecl *FromValueDecl = nullptr, *ToValueDecl = nullptr;
1209     bool HasFromInt = false, HasToInt = false, FromNullPtr = false,
1210          ToNullPtr = false, NeedFromAddressOf = false, NeedToAddressOf = false;
1211     InitializeNonTypeDiffVariables(
1212         Context, FromIter, FromDefaultNonTypeDecl, FromInt, HasFromInt,
1213         FromIntType, FromNullPtr, FromExpr, FromValueDecl, NeedFromAddressOf);
1214     InitializeNonTypeDiffVariables(Context, ToIter, ToDefaultNonTypeDecl, ToInt,
1215                                    HasToInt, ToIntType, ToNullPtr, ToExpr,
1216                                    ToValueDecl, NeedToAddressOf);
1217 
1218     bool FromDefault = FromIter.isEnd() &&
1219                        (FromExpr || FromValueDecl || HasFromInt || FromNullPtr);
1220     bool ToDefault = ToIter.isEnd() &&
1221                      (ToExpr || ToValueDecl || HasToInt || ToNullPtr);
1222 
1223     bool FromDeclaration = FromValueDecl || FromNullPtr;
1224     bool ToDeclaration = ToValueDecl || ToNullPtr;
1225 
1226     if (FromDeclaration && HasToInt) {
1227       Tree.SetFromDeclarationAndToIntegerDiff(
1228           FromValueDecl, NeedFromAddressOf, FromNullPtr, FromExpr, ToInt,
1229           HasToInt, ToIntType, ToExpr, FromDefault, ToDefault);
1230       Tree.SetSame(false);
1231       return;
1232 
1233     }
1234 
1235     if (HasFromInt && ToDeclaration) {
1236       Tree.SetFromIntegerAndToDeclarationDiff(
1237           FromInt, HasFromInt, FromIntType, FromExpr, ToValueDecl,
1238           NeedToAddressOf, ToNullPtr, ToExpr, FromDefault, ToDefault);
1239       Tree.SetSame(false);
1240       return;
1241     }
1242 
1243     if (HasFromInt || HasToInt) {
1244       Tree.SetIntegerDiff(FromInt, ToInt, HasFromInt, HasToInt, FromIntType,
1245                           ToIntType, FromExpr, ToExpr, FromDefault, ToDefault);
1246       if (HasFromInt && HasToInt) {
1247         Tree.SetSame(Context.hasSameType(FromIntType, ToIntType) &&
1248                      FromInt == ToInt);
1249       }
1250       return;
1251     }
1252 
1253     if (FromDeclaration || ToDeclaration) {
1254       Tree.SetDeclarationDiff(FromValueDecl, ToValueDecl, NeedFromAddressOf,
1255                               NeedToAddressOf, FromNullPtr, ToNullPtr, FromExpr,
1256                               ToExpr, FromDefault, ToDefault);
1257       bool BothNull = FromNullPtr && ToNullPtr;
1258       bool SameValueDecl =
1259           FromValueDecl && ToValueDecl &&
1260           NeedFromAddressOf == NeedToAddressOf &&
1261           FromValueDecl->getCanonicalDecl() == ToValueDecl->getCanonicalDecl();
1262       Tree.SetSame(BothNull || SameValueDecl);
1263       return;
1264     }
1265 
1266     assert((FromExpr || ToExpr) && "Both template arguments cannot be empty.");
1267     Tree.SetExpressionDiff(FromExpr, ToExpr, FromDefault, ToDefault);
1268     Tree.SetSame(IsEqualExpr(Context, FromExpr, ToExpr));
1269   }
1270 
1271   /// DiffTemplate - recursively visits template arguments and stores the
1272   /// argument info into a tree.
1273   void DiffTemplate(const TemplateSpecializationType *FromTST,
1274                     const TemplateSpecializationType *ToTST) {
1275     // Begin descent into diffing template tree.
1276     TemplateParameterList *ParamsFrom =
1277         FromTST->getTemplateName().getAsTemplateDecl()->getTemplateParameters();
1278     TemplateParameterList *ParamsTo =
1279         ToTST->getTemplateName().getAsTemplateDecl()->getTemplateParameters();
1280     unsigned TotalArgs = 0;
1281     for (TSTiterator FromIter(Context, FromTST), ToIter(Context, ToTST);
1282          !FromIter.isEnd() || !ToIter.isEnd(); ++TotalArgs) {
1283       Tree.AddNode();
1284 
1285       // Get the parameter at index TotalArgs.  If index is larger
1286       // than the total number of parameters, then there is an
1287       // argument pack, so re-use the last parameter.
1288       unsigned FromParamIndex = std::min(TotalArgs, ParamsFrom->size() - 1);
1289       unsigned ToParamIndex = std::min(TotalArgs, ParamsTo->size() - 1);
1290       NamedDecl *FromParamND = ParamsFrom->getParam(FromParamIndex);
1291       NamedDecl *ToParamND = ParamsTo->getParam(ToParamIndex);
1292 
1293       assert(FromParamND->getKind() == ToParamND->getKind() &&
1294              "Parameter Decl are not the same kind.");
1295 
1296       if (isa<TemplateTypeParmDecl>(FromParamND)) {
1297         DiffTypes(FromIter, ToIter);
1298       } else if (isa<TemplateTemplateParmDecl>(FromParamND)) {
1299         DiffTemplateTemplates(FromIter, ToIter);
1300       } else if (isa<NonTypeTemplateParmDecl>(FromParamND)) {
1301         NonTypeTemplateParmDecl *FromDefaultNonTypeDecl =
1302             cast<NonTypeTemplateParmDecl>(FromParamND);
1303         NonTypeTemplateParmDecl *ToDefaultNonTypeDecl =
1304             cast<NonTypeTemplateParmDecl>(ToParamND);
1305         DiffNonTypes(FromIter, ToIter, FromDefaultNonTypeDecl,
1306                      ToDefaultNonTypeDecl);
1307       } else {
1308         llvm_unreachable("Unexpected Decl type.");
1309       }
1310 
1311       ++FromIter;
1312       ++ToIter;
1313       Tree.Up();
1314     }
1315   }
1316 
1317   /// makeTemplateList - Dump every template alias into the vector.
1318   static void makeTemplateList(
1319       SmallVectorImpl<const TemplateSpecializationType *> &TemplateList,
1320       const TemplateSpecializationType *TST) {
1321     while (TST) {
1322       TemplateList.push_back(TST);
1323       if (!TST->isTypeAlias())
1324         return;
1325       TST = TST->getAliasedType()->getAs<TemplateSpecializationType>();
1326     }
1327   }
1328 
1329   /// hasSameBaseTemplate - Returns true when the base templates are the same,
1330   /// even if the template arguments are not.
1331   static bool hasSameBaseTemplate(const TemplateSpecializationType *FromTST,
1332                                   const TemplateSpecializationType *ToTST) {
1333     return FromTST->getTemplateName().getAsTemplateDecl()->getCanonicalDecl() ==
1334            ToTST->getTemplateName().getAsTemplateDecl()->getCanonicalDecl();
1335   }
1336 
1337   /// hasSameTemplate - Returns true if both types are specialized from the
1338   /// same template declaration.  If they come from different template aliases,
1339   /// do a parallel ascension search to determine the highest template alias in
1340   /// common and set the arguments to them.
1341   static bool hasSameTemplate(const TemplateSpecializationType *&FromTST,
1342                               const TemplateSpecializationType *&ToTST) {
1343     // Check the top templates if they are the same.
1344     if (hasSameBaseTemplate(FromTST, ToTST))
1345       return true;
1346 
1347     // Create vectors of template aliases.
1348     SmallVector<const TemplateSpecializationType*, 1> FromTemplateList,
1349                                                       ToTemplateList;
1350 
1351     makeTemplateList(FromTemplateList, FromTST);
1352     makeTemplateList(ToTemplateList, ToTST);
1353 
1354     SmallVectorImpl<const TemplateSpecializationType *>::reverse_iterator
1355         FromIter = FromTemplateList.rbegin(), FromEnd = FromTemplateList.rend(),
1356         ToIter = ToTemplateList.rbegin(), ToEnd = ToTemplateList.rend();
1357 
1358     // Check if the lowest template types are the same.  If not, return.
1359     if (!hasSameBaseTemplate(*FromIter, *ToIter))
1360       return false;
1361 
1362     // Begin searching up the template aliases.  The bottom most template
1363     // matches so move up until one pair does not match.  Use the template
1364     // right before that one.
1365     for (; FromIter != FromEnd && ToIter != ToEnd; ++FromIter, ++ToIter) {
1366       if (!hasSameBaseTemplate(*FromIter, *ToIter))
1367         break;
1368     }
1369 
1370     FromTST = FromIter[-1];
1371     ToTST = ToIter[-1];
1372 
1373     return true;
1374   }
1375 
1376   /// GetType - Retrieves the template type arguments, including default
1377   /// arguments.
1378   static QualType GetType(const TSTiterator &Iter) {
1379     if (!Iter.isEnd())
1380       return Iter->getAsType();
1381     if (Iter.hasDesugaredTA())
1382       return Iter.getDesugaredTA().getAsType();
1383     return QualType();
1384   }
1385 
1386   /// GetTemplateDecl - Retrieves the template template arguments, including
1387   /// default arguments.
1388   static TemplateDecl *GetTemplateDecl(const TSTiterator &Iter) {
1389     if (!Iter.isEnd())
1390       return Iter->getAsTemplate().getAsTemplateDecl();
1391     if (Iter.hasDesugaredTA())
1392       return Iter.getDesugaredTA().getAsTemplate().getAsTemplateDecl();
1393     return nullptr;
1394   }
1395 
1396   /// IsEqualExpr - Returns true if the expressions are the same in regards to
1397   /// template arguments.  These expressions are dependent, so profile them
1398   /// instead of trying to evaluate them.
1399   static bool IsEqualExpr(ASTContext &Context, Expr *FromExpr, Expr *ToExpr) {
1400     if (FromExpr == ToExpr)
1401       return true;
1402 
1403     if (!FromExpr || !ToExpr)
1404       return false;
1405 
1406     llvm::FoldingSetNodeID FromID, ToID;
1407     FromExpr->Profile(FromID, Context, true);
1408     ToExpr->Profile(ToID, Context, true);
1409     return FromID == ToID;
1410   }
1411 
1412   // These functions converts the tree representation of the template
1413   // differences into the internal character vector.
1414 
1415   /// TreeToString - Converts the Tree object into a character stream which
1416   /// will later be turned into the output string.
1417   void TreeToString(int Indent = 1) {
1418     if (PrintTree) {
1419       OS << '\n';
1420       OS.indent(2 * Indent);
1421       ++Indent;
1422     }
1423 
1424     // Handle cases where the difference is not templates with different
1425     // arguments.
1426     switch (Tree.GetKind()) {
1427       case DiffTree::Invalid:
1428         llvm_unreachable("Template diffing failed with bad DiffNode");
1429       case DiffTree::Type: {
1430         QualType FromType, ToType;
1431         Tree.GetTypeDiff(FromType, ToType);
1432         PrintTypeNames(FromType, ToType, Tree.FromDefault(), Tree.ToDefault(),
1433                        Tree.NodeIsSame());
1434         return;
1435       }
1436       case DiffTree::Expression: {
1437         Expr *FromExpr, *ToExpr;
1438         Tree.GetExpressionDiff(FromExpr, ToExpr);
1439         PrintExpr(FromExpr, ToExpr, Tree.FromDefault(), Tree.ToDefault(),
1440                   Tree.NodeIsSame());
1441         return;
1442       }
1443       case DiffTree::TemplateTemplate: {
1444         TemplateDecl *FromTD, *ToTD;
1445         Tree.GetTemplateTemplateDiff(FromTD, ToTD);
1446         PrintTemplateTemplate(FromTD, ToTD, Tree.FromDefault(),
1447                               Tree.ToDefault(), Tree.NodeIsSame());
1448         return;
1449       }
1450       case DiffTree::Integer: {
1451         llvm::APSInt FromInt, ToInt;
1452         Expr *FromExpr, *ToExpr;
1453         bool IsValidFromInt, IsValidToInt;
1454         QualType FromIntType, ToIntType;
1455         Tree.GetIntegerDiff(FromInt, ToInt, IsValidFromInt, IsValidToInt,
1456                             FromIntType, ToIntType, FromExpr, ToExpr);
1457         PrintAPSInt(FromInt, ToInt, IsValidFromInt, IsValidToInt, FromIntType,
1458                     ToIntType, FromExpr, ToExpr, Tree.FromDefault(),
1459                     Tree.ToDefault(), Tree.NodeIsSame());
1460         return;
1461       }
1462       case DiffTree::Declaration: {
1463         ValueDecl *FromValueDecl, *ToValueDecl;
1464         bool FromAddressOf, ToAddressOf;
1465         bool FromNullPtr, ToNullPtr;
1466         Expr *FromExpr, *ToExpr;
1467         Tree.GetDeclarationDiff(FromValueDecl, ToValueDecl, FromAddressOf,
1468                                 ToAddressOf, FromNullPtr, ToNullPtr, FromExpr,
1469                                 ToExpr);
1470         PrintValueDecl(FromValueDecl, ToValueDecl, FromAddressOf, ToAddressOf,
1471                        FromNullPtr, ToNullPtr, FromExpr, ToExpr,
1472                        Tree.FromDefault(), Tree.ToDefault(), Tree.NodeIsSame());
1473         return;
1474       }
1475       case DiffTree::FromDeclarationAndToInteger: {
1476         ValueDecl *FromValueDecl;
1477         bool FromAddressOf;
1478         bool FromNullPtr;
1479         Expr *FromExpr;
1480         llvm::APSInt ToInt;
1481         bool IsValidToInt;
1482         QualType ToIntType;
1483         Expr *ToExpr;
1484         Tree.GetFromDeclarationAndToIntegerDiff(
1485             FromValueDecl, FromAddressOf, FromNullPtr, FromExpr, ToInt,
1486             IsValidToInt, ToIntType, ToExpr);
1487         assert((FromValueDecl || FromNullPtr) && IsValidToInt);
1488         PrintValueDeclAndInteger(FromValueDecl, FromAddressOf, FromNullPtr,
1489                                  FromExpr, Tree.FromDefault(), ToInt, ToIntType,
1490                                  ToExpr, Tree.ToDefault());
1491         return;
1492       }
1493       case DiffTree::FromIntegerAndToDeclaration: {
1494         llvm::APSInt FromInt;
1495         bool IsValidFromInt;
1496         QualType FromIntType;
1497         Expr *FromExpr;
1498         ValueDecl *ToValueDecl;
1499         bool ToAddressOf;
1500         bool ToNullPtr;
1501         Expr *ToExpr;
1502         Tree.GetFromIntegerAndToDeclarationDiff(
1503             FromInt, IsValidFromInt, FromIntType, FromExpr, ToValueDecl,
1504             ToAddressOf, ToNullPtr, ToExpr);
1505         assert(IsValidFromInt && (ToValueDecl || ToNullPtr));
1506         PrintIntegerAndValueDecl(FromInt, FromIntType, FromExpr,
1507                                  Tree.FromDefault(), ToValueDecl, ToAddressOf,
1508                                  ToNullPtr, ToExpr, Tree.ToDefault());
1509         return;
1510       }
1511       case DiffTree::Template: {
1512         // Node is root of template.  Recurse on children.
1513         TemplateDecl *FromTD, *ToTD;
1514         Qualifiers FromQual, ToQual;
1515         Tree.GetTemplateDiff(FromTD, ToTD, FromQual, ToQual);
1516 
1517         PrintQualifiers(FromQual, ToQual);
1518 
1519         if (!Tree.HasChildren()) {
1520           // If we're dealing with a template specialization with zero
1521           // arguments, there are no children; special-case this.
1522           OS << FromTD->getNameAsString() << "<>";
1523           return;
1524         }
1525 
1526         OS << FromTD->getNameAsString() << '<';
1527         Tree.MoveToChild();
1528         unsigned NumElideArgs = 0;
1529         bool AllArgsElided = true;
1530         do {
1531           if (ElideType) {
1532             if (Tree.NodeIsSame()) {
1533               ++NumElideArgs;
1534               continue;
1535             }
1536             AllArgsElided = false;
1537             if (NumElideArgs > 0) {
1538               PrintElideArgs(NumElideArgs, Indent);
1539               NumElideArgs = 0;
1540               OS << ", ";
1541             }
1542           }
1543           TreeToString(Indent);
1544           if (Tree.HasNextSibling())
1545             OS << ", ";
1546         } while (Tree.AdvanceSibling());
1547         if (NumElideArgs > 0) {
1548           if (AllArgsElided)
1549             OS << "...";
1550           else
1551             PrintElideArgs(NumElideArgs, Indent);
1552         }
1553 
1554         Tree.Parent();
1555         OS << ">";
1556         return;
1557       }
1558     }
1559   }
1560 
1561   // To signal to the text printer that a certain text needs to be bolded,
1562   // a special character is injected into the character stream which the
1563   // text printer will later strip out.
1564 
1565   /// Bold - Start bolding text.
1566   void Bold() {
1567     assert(!IsBold && "Attempting to bold text that is already bold.");
1568     IsBold = true;
1569     if (ShowColor)
1570       OS << ToggleHighlight;
1571   }
1572 
1573   /// Unbold - Stop bolding text.
1574   void Unbold() {
1575     assert(IsBold && "Attempting to remove bold from unbold text.");
1576     IsBold = false;
1577     if (ShowColor)
1578       OS << ToggleHighlight;
1579   }
1580 
1581   // Functions to print out the arguments and highlighting the difference.
1582 
1583   /// PrintTypeNames - prints the typenames, bolding differences.  Will detect
1584   /// typenames that are the same and attempt to disambiguate them by using
1585   /// canonical typenames.
1586   void PrintTypeNames(QualType FromType, QualType ToType,
1587                       bool FromDefault, bool ToDefault, bool Same) {
1588     assert((!FromType.isNull() || !ToType.isNull()) &&
1589            "Only one template argument may be missing.");
1590 
1591     if (Same) {
1592       OS << FromType.getAsString(Policy);
1593       return;
1594     }
1595 
1596     if (!FromType.isNull() && !ToType.isNull() &&
1597         FromType.getLocalUnqualifiedType() ==
1598         ToType.getLocalUnqualifiedType()) {
1599       Qualifiers FromQual = FromType.getLocalQualifiers(),
1600                  ToQual = ToType.getLocalQualifiers();
1601       PrintQualifiers(FromQual, ToQual);
1602       FromType.getLocalUnqualifiedType().print(OS, Policy);
1603       return;
1604     }
1605 
1606     std::string FromTypeStr = FromType.isNull() ? "(no argument)"
1607                                                 : FromType.getAsString(Policy);
1608     std::string ToTypeStr = ToType.isNull() ? "(no argument)"
1609                                             : ToType.getAsString(Policy);
1610     // Switch to canonical typename if it is better.
1611     // TODO: merge this with other aka printing above.
1612     if (FromTypeStr == ToTypeStr) {
1613       std::string FromCanTypeStr =
1614           FromType.getCanonicalType().getAsString(Policy);
1615       std::string ToCanTypeStr = ToType.getCanonicalType().getAsString(Policy);
1616       if (FromCanTypeStr != ToCanTypeStr) {
1617         FromTypeStr = FromCanTypeStr;
1618         ToTypeStr = ToCanTypeStr;
1619       }
1620     }
1621 
1622     if (PrintTree) OS << '[';
1623     OS << (FromDefault ? "(default) " : "");
1624     Bold();
1625     OS << FromTypeStr;
1626     Unbold();
1627     if (PrintTree) {
1628       OS << " != " << (ToDefault ? "(default) " : "");
1629       Bold();
1630       OS << ToTypeStr;
1631       Unbold();
1632       OS << "]";
1633     }
1634   }
1635 
1636   /// PrintExpr - Prints out the expr template arguments, highlighting argument
1637   /// differences.
1638   void PrintExpr(const Expr *FromExpr, const Expr *ToExpr, bool FromDefault,
1639                  bool ToDefault, bool Same) {
1640     assert((FromExpr || ToExpr) &&
1641             "Only one template argument may be missing.");
1642     if (Same) {
1643       PrintExpr(FromExpr);
1644     } else if (!PrintTree) {
1645       OS << (FromDefault ? "(default) " : "");
1646       Bold();
1647       PrintExpr(FromExpr);
1648       Unbold();
1649     } else {
1650       OS << (FromDefault ? "[(default) " : "[");
1651       Bold();
1652       PrintExpr(FromExpr);
1653       Unbold();
1654       OS << " != " << (ToDefault ? "(default) " : "");
1655       Bold();
1656       PrintExpr(ToExpr);
1657       Unbold();
1658       OS << ']';
1659     }
1660   }
1661 
1662   /// PrintExpr - Actual formatting and printing of expressions.
1663   void PrintExpr(const Expr *E) {
1664     if (E) {
1665       E->printPretty(OS, nullptr, Policy);
1666       return;
1667     }
1668     OS << "(no argument)";
1669   }
1670 
1671   /// PrintTemplateTemplate - Handles printing of template template arguments,
1672   /// highlighting argument differences.
1673   void PrintTemplateTemplate(TemplateDecl *FromTD, TemplateDecl *ToTD,
1674                              bool FromDefault, bool ToDefault, bool Same) {
1675     assert((FromTD || ToTD) && "Only one template argument may be missing.");
1676 
1677     std::string FromName = FromTD ? FromTD->getName() : "(no argument)";
1678     std::string ToName = ToTD ? ToTD->getName() : "(no argument)";
1679     if (FromTD && ToTD && FromName == ToName) {
1680       FromName = FromTD->getQualifiedNameAsString();
1681       ToName = ToTD->getQualifiedNameAsString();
1682     }
1683 
1684     if (Same) {
1685       OS << "template " << FromTD->getNameAsString();
1686     } else if (!PrintTree) {
1687       OS << (FromDefault ? "(default) template " : "template ");
1688       Bold();
1689       OS << FromName;
1690       Unbold();
1691     } else {
1692       OS << (FromDefault ? "[(default) template " : "[template ");
1693       Bold();
1694       OS << FromName;
1695       Unbold();
1696       OS << " != " << (ToDefault ? "(default) template " : "template ");
1697       Bold();
1698       OS << ToName;
1699       Unbold();
1700       OS << ']';
1701     }
1702   }
1703 
1704   /// PrintAPSInt - Handles printing of integral arguments, highlighting
1705   /// argument differences.
1706   void PrintAPSInt(const llvm::APSInt &FromInt, const llvm::APSInt &ToInt,
1707                    bool IsValidFromInt, bool IsValidToInt, QualType FromIntType,
1708                    QualType ToIntType, Expr *FromExpr, Expr *ToExpr,
1709                    bool FromDefault, bool ToDefault, bool Same) {
1710     assert((IsValidFromInt || IsValidToInt) &&
1711            "Only one integral argument may be missing.");
1712 
1713     if (Same) {
1714       if (FromIntType->isBooleanType()) {
1715         OS << ((FromInt == 0) ? "false" : "true");
1716       } else {
1717         OS << FromInt.toString(10);
1718       }
1719       return;
1720     }
1721 
1722     bool PrintType = IsValidFromInt && IsValidToInt &&
1723                      !Context.hasSameType(FromIntType, ToIntType);
1724 
1725     if (!PrintTree) {
1726       OS << (FromDefault ? "(default) " : "");
1727       PrintAPSInt(FromInt, FromExpr, IsValidFromInt, FromIntType, PrintType);
1728     } else {
1729       OS << (FromDefault ? "[(default) " : "[");
1730       PrintAPSInt(FromInt, FromExpr, IsValidFromInt, FromIntType, PrintType);
1731       OS << " != " << (ToDefault ? "(default) " : "");
1732       PrintAPSInt(ToInt, ToExpr, IsValidToInt, ToIntType, PrintType);
1733       OS << ']';
1734     }
1735   }
1736 
1737   /// PrintAPSInt - If valid, print the APSInt.  If the expression is
1738   /// gives more information, print it too.
1739   void PrintAPSInt(const llvm::APSInt &Val, Expr *E, bool Valid,
1740                    QualType IntType, bool PrintType) {
1741     Bold();
1742     if (Valid) {
1743       if (HasExtraInfo(E)) {
1744         PrintExpr(E);
1745         Unbold();
1746         OS << " aka ";
1747         Bold();
1748       }
1749       if (PrintType) {
1750         Unbold();
1751         OS << "(";
1752         Bold();
1753         IntType.print(OS, Context.getPrintingPolicy());
1754         Unbold();
1755         OS << ") ";
1756         Bold();
1757       }
1758       if (IntType->isBooleanType()) {
1759         OS << ((Val == 0) ? "false" : "true");
1760       } else {
1761         OS << Val.toString(10);
1762       }
1763     } else if (E) {
1764       PrintExpr(E);
1765     } else {
1766       OS << "(no argument)";
1767     }
1768     Unbold();
1769   }
1770 
1771   /// HasExtraInfo - Returns true if E is not an integer literal, the
1772   /// negation of an integer literal, or a boolean literal.
1773   bool HasExtraInfo(Expr *E) {
1774     if (!E) return false;
1775 
1776     E = E->IgnoreImpCasts();
1777 
1778     if (isa<IntegerLiteral>(E)) return false;
1779 
1780     if (UnaryOperator *UO = dyn_cast<UnaryOperator>(E))
1781       if (UO->getOpcode() == UO_Minus)
1782         if (isa<IntegerLiteral>(UO->getSubExpr()))
1783           return false;
1784 
1785     if (isa<CXXBoolLiteralExpr>(E))
1786       return false;
1787 
1788     return true;
1789   }
1790 
1791   void PrintValueDecl(ValueDecl *VD, bool AddressOf, Expr *E, bool NullPtr) {
1792     if (VD) {
1793       if (AddressOf)
1794         OS << "&";
1795       OS << VD->getName();
1796       return;
1797     }
1798 
1799     if (NullPtr) {
1800       if (E && !isa<CXXNullPtrLiteralExpr>(E)) {
1801         PrintExpr(E);
1802         if (IsBold) {
1803           Unbold();
1804           OS << " aka ";
1805           Bold();
1806         } else {
1807           OS << " aka ";
1808         }
1809       }
1810 
1811       OS << "nullptr";
1812       return;
1813     }
1814 
1815     OS << "(no argument)";
1816   }
1817 
1818   /// PrintDecl - Handles printing of Decl arguments, highlighting
1819   /// argument differences.
1820   void PrintValueDecl(ValueDecl *FromValueDecl, ValueDecl *ToValueDecl,
1821                       bool FromAddressOf, bool ToAddressOf, bool FromNullPtr,
1822                       bool ToNullPtr, Expr *FromExpr, Expr *ToExpr,
1823                       bool FromDefault, bool ToDefault, bool Same) {
1824     assert((FromValueDecl || FromNullPtr || ToValueDecl || ToNullPtr) &&
1825            "Only one Decl argument may be NULL");
1826 
1827     if (Same) {
1828       PrintValueDecl(FromValueDecl, FromAddressOf, FromExpr, FromNullPtr);
1829     } else if (!PrintTree) {
1830       OS << (FromDefault ? "(default) " : "");
1831       Bold();
1832       PrintValueDecl(FromValueDecl, FromAddressOf, FromExpr, FromNullPtr);
1833       Unbold();
1834     } else {
1835       OS << (FromDefault ? "[(default) " : "[");
1836       Bold();
1837       PrintValueDecl(FromValueDecl, FromAddressOf, FromExpr, FromNullPtr);
1838       Unbold();
1839       OS << " != " << (ToDefault ? "(default) " : "");
1840       Bold();
1841       PrintValueDecl(ToValueDecl, ToAddressOf, ToExpr, ToNullPtr);
1842       Unbold();
1843       OS << ']';
1844     }
1845   }
1846 
1847   /// PrintValueDeclAndInteger - Uses the print functions for ValueDecl and
1848   /// APSInt to print a mixed difference.
1849   void PrintValueDeclAndInteger(ValueDecl *VD, bool NeedAddressOf,
1850                                 bool IsNullPtr, Expr *VDExpr, bool DefaultDecl,
1851                                 const llvm::APSInt &Val, QualType IntType,
1852                                 Expr *IntExpr, bool DefaultInt) {
1853     if (!PrintTree) {
1854       OS << (DefaultDecl ? "(default) " : "");
1855       Bold();
1856       PrintValueDecl(VD, NeedAddressOf, VDExpr, IsNullPtr);
1857       Unbold();
1858     } else {
1859       OS << (DefaultDecl ? "[(default) " : "[");
1860       Bold();
1861       PrintValueDecl(VD, NeedAddressOf, VDExpr, IsNullPtr);
1862       Unbold();
1863       OS << " != " << (DefaultInt ? "(default) " : "");
1864       PrintAPSInt(Val, IntExpr, true /*Valid*/, IntType, false /*PrintType*/);
1865       OS << ']';
1866     }
1867   }
1868 
1869   /// PrintIntegerAndValueDecl - Uses the print functions for APSInt and
1870   /// ValueDecl to print a mixed difference.
1871   void PrintIntegerAndValueDecl(const llvm::APSInt &Val, QualType IntType,
1872                                 Expr *IntExpr, bool DefaultInt, ValueDecl *VD,
1873                                 bool NeedAddressOf, bool IsNullPtr,
1874                                 Expr *VDExpr, bool DefaultDecl) {
1875     if (!PrintTree) {
1876       OS << (DefaultInt ? "(default) " : "");
1877       PrintAPSInt(Val, IntExpr, true /*Valid*/, IntType, false /*PrintType*/);
1878     } else {
1879       OS << (DefaultInt ? "[(default) " : "[");
1880       PrintAPSInt(Val, IntExpr, true /*Valid*/, IntType, false /*PrintType*/);
1881       OS << " != " << (DefaultDecl ? "(default) " : "");
1882       Bold();
1883       PrintValueDecl(VD, NeedAddressOf, VDExpr, IsNullPtr);
1884       Unbold();
1885       OS << ']';
1886     }
1887   }
1888 
1889   // Prints the appropriate placeholder for elided template arguments.
1890   void PrintElideArgs(unsigned NumElideArgs, unsigned Indent) {
1891     if (PrintTree) {
1892       OS << '\n';
1893       for (unsigned i = 0; i < Indent; ++i)
1894         OS << "  ";
1895     }
1896     if (NumElideArgs == 0) return;
1897     if (NumElideArgs == 1)
1898       OS << "[...]";
1899     else
1900       OS << "[" << NumElideArgs << " * ...]";
1901   }
1902 
1903   // Prints and highlights differences in Qualifiers.
1904   void PrintQualifiers(Qualifiers FromQual, Qualifiers ToQual) {
1905     // Both types have no qualifiers
1906     if (FromQual.empty() && ToQual.empty())
1907       return;
1908 
1909     // Both types have same qualifiers
1910     if (FromQual == ToQual) {
1911       PrintQualifier(FromQual, /*ApplyBold*/false);
1912       return;
1913     }
1914 
1915     // Find common qualifiers and strip them from FromQual and ToQual.
1916     Qualifiers CommonQual = Qualifiers::removeCommonQualifiers(FromQual,
1917                                                                ToQual);
1918 
1919     // The qualifiers are printed before the template name.
1920     // Inline printing:
1921     // The common qualifiers are printed.  Then, qualifiers only in this type
1922     // are printed and highlighted.  Finally, qualifiers only in the other
1923     // type are printed and highlighted inside parentheses after "missing".
1924     // Tree printing:
1925     // Qualifiers are printed next to each other, inside brackets, and
1926     // separated by "!=".  The printing order is:
1927     // common qualifiers, highlighted from qualifiers, "!=",
1928     // common qualifiers, highlighted to qualifiers
1929     if (PrintTree) {
1930       OS << "[";
1931       if (CommonQual.empty() && FromQual.empty()) {
1932         Bold();
1933         OS << "(no qualifiers) ";
1934         Unbold();
1935       } else {
1936         PrintQualifier(CommonQual, /*ApplyBold*/false);
1937         PrintQualifier(FromQual, /*ApplyBold*/true);
1938       }
1939       OS << "!= ";
1940       if (CommonQual.empty() && ToQual.empty()) {
1941         Bold();
1942         OS << "(no qualifiers)";
1943         Unbold();
1944       } else {
1945         PrintQualifier(CommonQual, /*ApplyBold*/false,
1946                        /*appendSpaceIfNonEmpty*/!ToQual.empty());
1947         PrintQualifier(ToQual, /*ApplyBold*/true,
1948                        /*appendSpaceIfNonEmpty*/false);
1949       }
1950       OS << "] ";
1951     } else {
1952       PrintQualifier(CommonQual, /*ApplyBold*/false);
1953       PrintQualifier(FromQual, /*ApplyBold*/true);
1954     }
1955   }
1956 
1957   void PrintQualifier(Qualifiers Q, bool ApplyBold,
1958                       bool AppendSpaceIfNonEmpty = true) {
1959     if (Q.empty()) return;
1960     if (ApplyBold) Bold();
1961     Q.print(OS, Policy, AppendSpaceIfNonEmpty);
1962     if (ApplyBold) Unbold();
1963   }
1964 
1965 public:
1966 
1967   TemplateDiff(raw_ostream &OS, ASTContext &Context, QualType FromType,
1968                QualType ToType, bool PrintTree, bool PrintFromType,
1969                bool ElideType, bool ShowColor)
1970     : Context(Context),
1971       Policy(Context.getLangOpts()),
1972       ElideType(ElideType),
1973       PrintTree(PrintTree),
1974       ShowColor(ShowColor),
1975       // When printing a single type, the FromType is the one printed.
1976       FromTemplateType(PrintFromType ? FromType : ToType),
1977       ToTemplateType(PrintFromType ? ToType : FromType),
1978       OS(OS),
1979       IsBold(false) {
1980   }
1981 
1982   /// DiffTemplate - Start the template type diffing.
1983   void DiffTemplate() {
1984     Qualifiers FromQual = FromTemplateType.getQualifiers(),
1985                ToQual = ToTemplateType.getQualifiers();
1986 
1987     const TemplateSpecializationType *FromOrigTST =
1988         GetTemplateSpecializationType(Context, FromTemplateType);
1989     const TemplateSpecializationType *ToOrigTST =
1990         GetTemplateSpecializationType(Context, ToTemplateType);
1991 
1992     // Only checking templates.
1993     if (!FromOrigTST || !ToOrigTST)
1994       return;
1995 
1996     // Different base templates.
1997     if (!hasSameTemplate(FromOrigTST, ToOrigTST)) {
1998       return;
1999     }
2000 
2001     FromQual -= QualType(FromOrigTST, 0).getQualifiers();
2002     ToQual -= QualType(ToOrigTST, 0).getQualifiers();
2003 
2004     // Same base template, but different arguments.
2005     Tree.SetTemplateDiff(FromOrigTST->getTemplateName().getAsTemplateDecl(),
2006                          ToOrigTST->getTemplateName().getAsTemplateDecl(),
2007                          FromQual, ToQual, false /*FromDefault*/,
2008                          false /*ToDefault*/);
2009 
2010     DiffTemplate(FromOrigTST, ToOrigTST);
2011   }
2012 
2013   /// Emit - When the two types given are templated types with the same
2014   /// base template, a string representation of the type difference will be
2015   /// emitted to the stream and return true.  Otherwise, return false.
2016   bool Emit() {
2017     Tree.StartTraverse();
2018     if (Tree.Empty())
2019       return false;
2020 
2021     TreeToString();
2022     assert(!IsBold && "Bold is applied to end of string.");
2023     return true;
2024   }
2025 }; // end class TemplateDiff
2026 }  // end anonymous namespace
2027 
2028 /// FormatTemplateTypeDiff - A helper static function to start the template
2029 /// diff and return the properly formatted string.  Returns true if the diff
2030 /// is successful.
2031 static bool FormatTemplateTypeDiff(ASTContext &Context, QualType FromType,
2032                                    QualType ToType, bool PrintTree,
2033                                    bool PrintFromType, bool ElideType,
2034                                    bool ShowColors, raw_ostream &OS) {
2035   if (PrintTree)
2036     PrintFromType = true;
2037   TemplateDiff TD(OS, Context, FromType, ToType, PrintTree, PrintFromType,
2038                   ElideType, ShowColors);
2039   TD.DiffTemplate();
2040   return TD.Emit();
2041 }
2042