628     unsigned CurrentNode;  member in __anonb797b9d50111::TemplateDiff::DiffTree
638     DiffTree() : CurrentNode(0), NextFreeNode(1), ReadNode(0) {  in DiffTree()
646       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetTemplateDiff()
647       FlatTree[CurrentNode].Kind = Template;  in SetTemplateDiff()
648       FlatTree[CurrentNode].FromArgInfo.TD = FromTD;  in SetTemplateDiff()
649       FlatTree[CurrentNode].ToArgInfo.TD = ToTD;  in SetTemplateDiff()
650       FlatTree[CurrentNode].FromArgInfo.Qual = FromQual;  in SetTemplateDiff()
651       FlatTree[CurrentNode].ToArgInfo.Qual = ToQual;  in SetTemplateDiff()
657       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetTypeDiff()
658       FlatTree[CurrentNode].Kind = Type;  in SetTypeDiff()
659       FlatTree[CurrentNode].FromArgInfo.ArgType = FromType;  in SetTypeDiff()
660       FlatTree[CurrentNode].ToArgInfo.ArgType = ToType;  in SetTypeDiff()
666       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetExpressionDiff()
667       FlatTree[CurrentNode].Kind = Expression;  in SetExpressionDiff()
668       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;  in SetExpressionDiff()
669       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;  in SetExpressionDiff()
675       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetTemplateTemplateDiff()
676       FlatTree[CurrentNode].Kind = TemplateTemplate;  in SetTemplateTemplateDiff()
677       FlatTree[CurrentNode].FromArgInfo.TD = FromTD;  in SetTemplateTemplateDiff()
678       FlatTree[CurrentNode].ToArgInfo.TD = ToTD;  in SetTemplateTemplateDiff()
687       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetIntegerDiff()
688       FlatTree[CurrentNode].Kind = Integer;  in SetIntegerDiff()
689       FlatTree[CurrentNode].FromArgInfo.Val = FromInt;  in SetIntegerDiff()
690       FlatTree[CurrentNode].ToArgInfo.Val = ToInt;  in SetIntegerDiff()
691       FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;  in SetIntegerDiff()
692       FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;  in SetIntegerDiff()
693       FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;  in SetIntegerDiff()
694       FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;  in SetIntegerDiff()
695       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;  in SetIntegerDiff()
696       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;  in SetIntegerDiff()
704       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetDeclarationDiff()
705       FlatTree[CurrentNode].Kind = Declaration;  in SetDeclarationDiff()
706       FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;  in SetDeclarationDiff()
707       FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;  in SetDeclarationDiff()
708       FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;  in SetDeclarationDiff()
709       FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;  in SetDeclarationDiff()
710       FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;  in SetDeclarationDiff()
711       FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;  in SetDeclarationDiff()
712       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;  in SetDeclarationDiff()
713       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;  in SetDeclarationDiff()
721       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetFromDeclarationAndToIntegerDiff()
722       FlatTree[CurrentNode].Kind = FromDeclarationAndToInteger;  in SetFromDeclarationAndToIntegerDiff()
723       FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;  in SetFromDeclarationAndToIntegerDiff()
724       FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;  in SetFromDeclarationAndToIntegerDiff()
725       FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;  in SetFromDeclarationAndToIntegerDiff()
726       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;  in SetFromDeclarationAndToIntegerDiff()
727       FlatTree[CurrentNode].ToArgInfo.Val = ToInt;  in SetFromDeclarationAndToIntegerDiff()
728       FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;  in SetFromDeclarationAndToIntegerDiff()
729       FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;  in SetFromDeclarationAndToIntegerDiff()
730       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;  in SetFromDeclarationAndToIntegerDiff()
738       assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");  in SetFromIntegerAndToDeclarationDiff()
739       FlatTree[CurrentNode].Kind = FromIntegerAndToDeclaration;  in SetFromIntegerAndToDeclarationDiff()
740       FlatTree[CurrentNode].FromArgInfo.Val = FromInt;  in SetFromIntegerAndToDeclarationDiff()
741       FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;  in SetFromIntegerAndToDeclarationDiff()
742       FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;  in SetFromIntegerAndToDeclarationDiff()
743       FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;  in SetFromIntegerAndToDeclarationDiff()
744       FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;  in SetFromIntegerAndToDeclarationDiff()
745       FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;  in SetFromIntegerAndToDeclarationDiff()
746       FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;  in SetFromIntegerAndToDeclarationDiff()
747       FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;  in SetFromIntegerAndToDeclarationDiff()
754       FlatTree[CurrentNode].FromArgInfo.IsDefault = FromDefault;  in SetDefault()
755       FlatTree[CurrentNode].ToArgInfo.IsDefault = ToDefault;  in SetDefault()
760       FlatTree[CurrentNode].Same = Same;  in SetSame()
765       FlatTree[CurrentNode].Kind = Kind;  in SetKind()
770       assert(FlatTree[CurrentNode].Kind != Invalid &&  in Up()
772       CurrentNode = FlatTree[CurrentNode].ParentNode;  in Up()
778       assert(FlatTree[CurrentNode].Kind == Template &&  in AddNode()
780       FlatTree.push_back(DiffNode(CurrentNode));  in AddNode()
781       DiffNode &Node = FlatTree[CurrentNode];  in AddNode()
794       CurrentNode = NextFreeNode;  in AddNode()
802       CurrentNode = NextFreeNode;  in StartTraverse()