reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
601 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 602 FlatTree[CurrentNode].Kind = Template; 603 FlatTree[CurrentNode].FromArgInfo.TD = FromTD; 604 FlatTree[CurrentNode].ToArgInfo.TD = ToTD; 605 FlatTree[CurrentNode].FromArgInfo.Qual = FromQual; 606 FlatTree[CurrentNode].ToArgInfo.Qual = ToQual; 612 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 613 FlatTree[CurrentNode].Kind = Type; 614 FlatTree[CurrentNode].FromArgInfo.ArgType = FromType; 615 FlatTree[CurrentNode].ToArgInfo.ArgType = ToType; 621 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 622 FlatTree[CurrentNode].Kind = Expression; 623 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr; 624 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr; 630 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 631 FlatTree[CurrentNode].Kind = TemplateTemplate; 632 FlatTree[CurrentNode].FromArgInfo.TD = FromTD; 633 FlatTree[CurrentNode].ToArgInfo.TD = ToTD; 642 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 643 FlatTree[CurrentNode].Kind = Integer; 644 FlatTree[CurrentNode].FromArgInfo.Val = FromInt; 645 FlatTree[CurrentNode].ToArgInfo.Val = ToInt; 646 FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt; 647 FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt; 648 FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType; 649 FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType; 650 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr; 651 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr; 659 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 660 FlatTree[CurrentNode].Kind = Declaration; 661 FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl; 662 FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl; 663 FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf; 664 FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf; 665 FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr; 666 FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr; 667 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr; 668 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr; 676 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 677 FlatTree[CurrentNode].Kind = FromDeclarationAndToInteger; 678 FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl; 679 FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf; 680 FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr; 681 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr; 682 FlatTree[CurrentNode].ToArgInfo.Val = ToInt; 683 FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt; 684 FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType; 685 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr; 693 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty."); 694 FlatTree[CurrentNode].Kind = FromIntegerAndToDeclaration; 695 FlatTree[CurrentNode].FromArgInfo.Val = FromInt; 696 FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt; 697 FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType; 698 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr; 699 FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl; 700 FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf; 701 FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr; 702 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr; 709 FlatTree[CurrentNode].FromArgInfo.IsDefault = FromDefault; 710 FlatTree[CurrentNode].ToArgInfo.IsDefault = ToDefault; 715 FlatTree[CurrentNode].Same = Same; 720 FlatTree[CurrentNode].Kind = Kind; 725 assert(FlatTree[CurrentNode].Kind != Invalid && 727 CurrentNode = FlatTree[CurrentNode].ParentNode; 727 CurrentNode = FlatTree[CurrentNode].ParentNode; 733 assert(FlatTree[CurrentNode].Kind == Template && 735 FlatTree.push_back(DiffNode(CurrentNode)); 736 DiffNode &Node = FlatTree[CurrentNode]; 749 CurrentNode = NextFreeNode; 757 CurrentNode = NextFreeNode;