• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /freebsd-13-stable/contrib/llvm-project/clang/lib/AST/

Lines Matching refs:CurrentNode

595     /// CurrentNode - The index of the current node being used.
596 unsigned CurrentNode;
606 DiffTree() : CurrentNode(0), NextFreeNode(1), ReadNode(0) {
614 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
615 FlatTree[CurrentNode].Kind = Template;
616 FlatTree[CurrentNode].FromArgInfo.TD = FromTD;
617 FlatTree[CurrentNode].ToArgInfo.TD = ToTD;
618 FlatTree[CurrentNode].FromArgInfo.Qual = FromQual;
619 FlatTree[CurrentNode].ToArgInfo.Qual = ToQual;
625 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
626 FlatTree[CurrentNode].Kind = Type;
627 FlatTree[CurrentNode].FromArgInfo.ArgType = FromType;
628 FlatTree[CurrentNode].ToArgInfo.ArgType = ToType;
634 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
635 FlatTree[CurrentNode].Kind = Expression;
636 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
637 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
643 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
644 FlatTree[CurrentNode].Kind = TemplateTemplate;
645 FlatTree[CurrentNode].FromArgInfo.TD = FromTD;
646 FlatTree[CurrentNode].ToArgInfo.TD = ToTD;
655 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
656 FlatTree[CurrentNode].Kind = Integer;
657 FlatTree[CurrentNode].FromArgInfo.Val = FromInt;
658 FlatTree[CurrentNode].ToArgInfo.Val = ToInt;
659 FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;
660 FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;
661 FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;
662 FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;
663 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
664 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
672 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
673 FlatTree[CurrentNode].Kind = Declaration;
674 FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;
675 FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;
676 FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;
677 FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;
678 FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;
679 FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;
680 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
681 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
689 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
690 FlatTree[CurrentNode].Kind = FromDeclarationAndToInteger;
691 FlatTree[CurrentNode].FromArgInfo.VD = FromValueDecl;
692 FlatTree[CurrentNode].FromArgInfo.NeedAddressOf = FromAddressOf;
693 FlatTree[CurrentNode].FromArgInfo.IsNullPtr = FromNullPtr;
694 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
695 FlatTree[CurrentNode].ToArgInfo.Val = ToInt;
696 FlatTree[CurrentNode].ToArgInfo.IsValidInt = IsValidToInt;
697 FlatTree[CurrentNode].ToArgInfo.ArgType = ToIntType;
698 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
706 assert(FlatTree[CurrentNode].Kind == Invalid && "Node is not empty.");
707 FlatTree[CurrentNode].Kind = FromIntegerAndToDeclaration;
708 FlatTree[CurrentNode].FromArgInfo.Val = FromInt;
709 FlatTree[CurrentNode].FromArgInfo.IsValidInt = IsValidFromInt;
710 FlatTree[CurrentNode].FromArgInfo.ArgType = FromIntType;
711 FlatTree[CurrentNode].FromArgInfo.ArgExpr = FromExpr;
712 FlatTree[CurrentNode].ToArgInfo.VD = ToValueDecl;
713 FlatTree[CurrentNode].ToArgInfo.NeedAddressOf = ToAddressOf;
714 FlatTree[CurrentNode].ToArgInfo.IsNullPtr = ToNullPtr;
715 FlatTree[CurrentNode].ToArgInfo.ArgExpr = ToExpr;
722 FlatTree[CurrentNode].FromArgInfo.IsDefault = FromDefault;
723 FlatTree[CurrentNode].ToArgInfo.IsDefault = ToDefault;
728 FlatTree[CurrentNode].Same = Same;
733 FlatTree[CurrentNode].Kind = Kind;
738 assert(FlatTree[CurrentNode].Kind != Invalid &&
740 CurrentNode = FlatTree[CurrentNode].ParentNode;
746 assert(FlatTree[CurrentNode].Kind == Template &&
748 FlatTree.push_back(DiffNode(CurrentNode));
749 DiffNode &Node = FlatTree[CurrentNode];
762 CurrentNode = NextFreeNode;
770 CurrentNode = NextFreeNode;