Home
last modified time | relevance | path

Searched refs:CurNode (Results 1 – 25 of 306) sorted by relevance

12345678910>>...13

/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/codetools/
H A Dpascalparsertool.pas710 while CurNode.NextBrother<>nil do CurNode:=CurNode.NextBrother;
713 if (CurNode=nil)
1474 Node:=CurNode;
1581 CurNode.EndPos:=CurNode.StartPos;
2815 ProcNode:=CurNode;
3405 CurNode.Parent.EndPos:=CurNode.EndPos;
3687 if (CurNode<>nil)
3714 and (CurNode<>nil) and (CurNode.Desc=ctnProcedure) then begin
4170 TypeNode:=CurNode;
4435 CurNode.StartPos:=CurNode.Parent.StartPos;
[all …]
H A Dccodeparsertool.pas217 CurNode: TCodeTreeNode;
1230 CurNode:=nil;
1242 CurNode:=NewNode;
1254 if CurNode.EndPos<=0 then
1255 CurNode.EndPos:=SrcPos;
1256 CurNode:=CurNode.Parent;
1263 Node:=CurNode;
1279 CurNode.EndPos:=SrcPos;
1358 MainNode:=CurNode;
1561 CurNode.EndPos:=SrcPos;
[all …]
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/codetools/
H A Dpascalparsertool.pas710 while CurNode.NextBrother<>nil do CurNode:=CurNode.NextBrother;
713 if (CurNode=nil)
1474 Node:=CurNode;
1581 CurNode.EndPos:=CurNode.StartPos;
2815 ProcNode:=CurNode;
3405 CurNode.Parent.EndPos:=CurNode.EndPos;
3687 if (CurNode<>nil)
3714 and (CurNode<>nil) and (CurNode.Desc=ctnProcedure) then begin
4170 TypeNode:=CurNode;
4435 CurNode.StartPos:=CurNode.Parent.StartPos;
[all …]
H A Dccodeparsertool.pas217 CurNode: TCodeTreeNode;
1230 CurNode:=nil;
1242 CurNode:=NewNode;
1254 if CurNode.EndPos<=0 then
1255 CurNode.EndPos:=SrcPos;
1256 CurNode:=CurNode.Parent;
1263 Node:=CurNode;
1279 CurNode.EndPos:=SrcPos;
1358 MainNode:=CurNode;
1561 CurNode.EndPos:=SrcPos;
[all …]
/dports/editors/lazarus/lazarus/components/codetools/
H A Dpascalparsertool.pas695 while CurNode.NextBrother<>nil do CurNode:=CurNode.NextBrother;
698 if (CurNode=nil)
1454 Node:=CurNode;
1561 CurNode.EndPos:=CurNode.StartPos;
2806 ProcNode:=CurNode;
3393 CurNode.Parent.EndPos:=CurNode.EndPos;
3671 if (CurNode<>nil)
3695 and (CurNode<>nil) and (CurNode.Desc=ctnProcedure) then begin
4150 TypeNode:=CurNode;
4414 CurNode.StartPos:=CurNode.Parent.StartPos;
[all …]
H A Dccodeparsertool.pas217 CurNode: TCodeTreeNode;
1230 CurNode:=nil;
1242 CurNode:=NewNode;
1254 if CurNode.EndPos<=0 then
1255 CurNode.EndPos:=SrcPos;
1256 CurNode:=CurNode.Parent;
1263 Node:=CurNode;
1279 CurNode.EndPos:=SrcPos;
1358 MainNode:=CurNode;
1561 CurNode.EndPos:=SrcPos;
[all …]
/dports/editors/lazarus-qt5/lazarus/components/codetools/
H A Dpascalparsertool.pas695 while CurNode.NextBrother<>nil do CurNode:=CurNode.NextBrother;
698 if (CurNode=nil)
1454 Node:=CurNode;
1561 CurNode.EndPos:=CurNode.StartPos;
2806 ProcNode:=CurNode;
3393 CurNode.Parent.EndPos:=CurNode.EndPos;
3671 if (CurNode<>nil)
3695 and (CurNode<>nil) and (CurNode.Desc=ctnProcedure) then begin
4150 TypeNode:=CurNode;
4414 CurNode.StartPos:=CurNode.Parent.StartPos;
[all …]
H A Dccodeparsertool.pas217 CurNode: TCodeTreeNode;
1230 CurNode:=nil;
1242 CurNode:=NewNode;
1254 if CurNode.EndPos<=0 then
1255 CurNode.EndPos:=SrcPos;
1256 CurNode:=CurNode.Parent;
1263 Node:=CurNode;
1279 CurNode.EndPos:=SrcPos;
1358 MainNode:=CurNode;
1561 CurNode.EndPos:=SrcPos;
[all …]
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/wiki/lazwiki/
H A Dwiki2fpdocconvert.pas186 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
190 Page.CurNode:=Node;
193 Page.CurNode:=Node;
199 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
209 Page.CurNode.ParentNode.InsertBefore(Node,Page.CurNode)
212 Page.CurNode:=Node;
221 Page.CurNode:=Node
223 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
250 Page.CurNode:=Node;
255 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
[all …]
/dports/editors/lazarus/lazarus/components/wiki/lazwiki/
H A Dwiki2fpdocconvert.pas186 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
190 Page.CurNode:=Node;
193 Page.CurNode:=Node;
199 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
209 Page.CurNode.ParentNode.InsertBefore(Node,Page.CurNode)
212 Page.CurNode:=Node;
221 Page.CurNode:=Node
223 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
250 Page.CurNode:=Node;
255 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
[all …]
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/wiki/lazwiki/
H A Dwiki2fpdocconvert.pas186 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
190 Page.CurNode:=Node;
193 Page.CurNode:=Node;
199 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
209 Page.CurNode.ParentNode.InsertBefore(Node,Page.CurNode)
212 Page.CurNode:=Node;
221 Page.CurNode:=Node
223 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
250 Page.CurNode:=Node;
255 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
[all …]
/dports/editors/lazarus-qt5/lazarus/components/wiki/lazwiki/
H A Dwiki2fpdocconvert.pas186 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
190 Page.CurNode:=Node;
193 Page.CurNode:=Node;
199 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
209 Page.CurNode.ParentNode.InsertBefore(Node,Page.CurNode)
212 Page.CurNode:=Node;
221 Page.CurNode:=Node
223 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
250 Page.CurNode:=Node;
255 Page.CurNode:=Page.CurNode.ParentNode as TDOMElement;
[all …]
/dports/editors/lazarus/lazarus/converter/
H A Dformfileconv.pas104 CurNode: TLFMTreeNode;
120 CurNode:=AProperty.FirstChild;
121 while CurNode<>nil do begin
123 if (CurNode.TheType=lfmnValue) and (TLFMValueNode(CurNode).ValueType=lfmvCollection) then
125 CurNode:=CurNode.NextSibling;
146 CurNode: TLFMTreeNode;
153 CurNode:=ObjectNode.FirstChild;
154 while CurNode<>nil do begin
155 case CurNode.TheType of
161 DoProperty(TLFMPropertyNode(CurNode), GrandParType, ParentType);
[all …]
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/converter/
H A Dformfileconv.pas104 CurNode: TLFMTreeNode;
120 CurNode:=AProperty.FirstChild;
121 while CurNode<>nil do begin
123 if (CurNode.TheType=lfmnValue) and (TLFMValueNode(CurNode).ValueType=lfmvCollection) then
125 CurNode:=CurNode.NextSibling;
146 CurNode: TLFMTreeNode;
153 CurNode:=ObjectNode.FirstChild;
154 while CurNode<>nil do begin
155 case CurNode.TheType of
161 DoProperty(TLFMPropertyNode(CurNode), GrandParType, ParentType);
[all …]
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/converter/
H A Dformfileconv.pas104 CurNode: TLFMTreeNode;
120 CurNode:=AProperty.FirstChild;
121 while CurNode<>nil do begin
123 if (CurNode.TheType=lfmnValue) and (TLFMValueNode(CurNode).ValueType=lfmvCollection) then
125 CurNode:=CurNode.NextSibling;
146 CurNode: TLFMTreeNode;
153 CurNode:=ObjectNode.FirstChild;
154 while CurNode<>nil do begin
155 case CurNode.TheType of
161 DoProperty(TLFMPropertyNode(CurNode), GrandParType, ParentType);
[all …]
/dports/editors/lazarus-qt5/lazarus/converter/
H A Dformfileconv.pas104 CurNode: TLFMTreeNode;
120 CurNode:=AProperty.FirstChild;
121 while CurNode<>nil do begin
123 if (CurNode.TheType=lfmnValue) and (TLFMValueNode(CurNode).ValueType=lfmvCollection) then
125 CurNode:=CurNode.NextSibling;
146 CurNode: TLFMTreeNode;
153 CurNode:=ObjectNode.FirstChild;
154 while CurNode<>nil do begin
155 case CurNode.TheType of
161 DoProperty(TLFMPropertyNode(CurNode), GrandParType, ParentType);
[all …]
/dports/editors/lazarus-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/ideintf/
H A Dtreeviewpropedit.pas172 CurNode, PrevNode: TTreeNode;
174 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
176 CurNode.MoveTo(PrevNode, naInsert);
182 CurNode, NextNode: TTreeNode;
184 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
186 CurNode.MoveTo(NextNode, naInsertBehind);
278 CurNode: TTreeNode;
280 CurNode := TreeView1.Selected;
281 MoveUpBtn.Enabled := Assigned(CurNode) and Assigned(CurNode.GetPrevSibling);
282 MoveDownBtn.Enabled:=Assigned(CurNode) and Assigned(CurNode.GetNextSibling);
[all …]
/dports/editors/lazarus/lazarus/components/ideintf/
H A Dtreeviewpropedit.pas172 CurNode, PrevNode: TTreeNode;
174 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
176 CurNode.MoveTo(PrevNode, naInsert);
182 CurNode, NextNode: TTreeNode;
184 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
186 CurNode.MoveTo(NextNode, naInsertBehind);
278 CurNode: TTreeNode;
280 CurNode := TreeView1.Selected;
281 MoveUpBtn.Enabled := Assigned(CurNode) and Assigned(CurNode.GetPrevSibling);
282 MoveDownBtn.Enabled:=Assigned(CurNode) and Assigned(CurNode.GetNextSibling);
[all …]
/dports/editors/lazarus-qt5/lazarus/components/ideintf/
H A Dtreeviewpropedit.pas172 CurNode, PrevNode: TTreeNode;
174 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
176 CurNode.MoveTo(PrevNode, naInsert);
182 CurNode, NextNode: TTreeNode;
184 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
186 CurNode.MoveTo(NextNode, naInsertBehind);
278 CurNode: TTreeNode;
280 CurNode := TreeView1.Selected;
281 MoveUpBtn.Enabled := Assigned(CurNode) and Assigned(CurNode.GetPrevSibling);
282 MoveDownBtn.Enabled:=Assigned(CurNode) and Assigned(CurNode.GetNextSibling);
[all …]
/dports/editors/lazarus-qt5-devel/lazarus-6df7e8756882f7d7f28f662011ee72f21746c580/components/ideintf/
H A Dtreeviewpropedit.pas172 CurNode, PrevNode: TTreeNode;
174 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
176 CurNode.MoveTo(PrevNode, naInsert);
182 CurNode, NextNode: TTreeNode;
184 CurNode := TreeView1.Selected; Assert(Assigned(CurNode));
186 CurNode.MoveTo(NextNode, naInsertBehind);
278 CurNode: TTreeNode;
280 CurNode := TreeView1.Selected;
281 MoveUpBtn.Enabled := Assigned(CurNode) and Assigned(CurNode.GetPrevSibling);
282 MoveDownBtn.Enabled:=Assigned(CurNode) and Assigned(CurNode.GetNextSibling);
[all …]
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/include/llvm/Analysis/
H A DAliasSetTracker.h168 PointerRec *CurNode; variable
170 explicit iterator(PointerRec *CN = 0) : CurNode(CN) {} in CurNode() function
173 return CurNode == x.CurNode;
178 CurNode = I.CurNode;
183 assert(CurNode && "Dereferencing AliasSet.end()!");
184 return *CurNode;
188 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
189 unsigned getSize() const { return CurNode->getSize(); } in getSize()
192 assert(CurNode && "Advancing past AliasSet.end()!");
193 CurNode = CurNode->getNext();
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/Analysis/
H A DAliasSetTracker.h239 PointerRec *CurNode; variable
242 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
245 return CurNode == x.CurNode;
250 assert(CurNode && "Dereferencing AliasSet.end()!");
251 return *CurNode;
255 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
256 LocationSize getSize() const { return CurNode->getSize(); } in getSize()
257 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
260 assert(CurNode && "Advancing past AliasSet.end()!");
261 CurNode = CurNode->getNext();
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/Analysis/
H A DAliasSetTracker.h233 PointerRec *CurNode; variable
236 explicit iterator(PointerRec *CN = nullptr) : CurNode(CN) {} in CurNode() function
239 return CurNode == x.CurNode;
244 assert(CurNode && "Dereferencing AliasSet.end()!");
245 return *CurNode;
249 Value *getPointer() const { return CurNode->getValue(); } in getPointer()
250 LocationSize getSize() const { return CurNode->getSize(); } in getSize()
251 AAMDNodes getAAInfo() const { return CurNode->getAAInfo(); } in getAAInfo()
254 assert(CurNode && "Advancing past AliasSet.end()!");
255 CurNode = CurNode->getNext();
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/clang/lib/Rewrite/
H A DRewriteRope.cpp680 CurNode = cast<RopePieceBTreeLeaf>(N); in RopePieceBTreeIterator()
684 while (CurNode && getCN(CurNode)->getNumPieces() == 0) in RopePieceBTreeIterator()
685 CurNode = getCN(CurNode)->getNextLeafInOrder(); in RopePieceBTreeIterator()
687 if (CurNode) in RopePieceBTreeIterator()
688 CurPiece = &getCN(CurNode)->getPiece(0); in RopePieceBTreeIterator()
695 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) { in MoveToNextPiece()
703 CurNode = getCN(CurNode)->getNextLeafInOrder(); in MoveToNextPiece()
704 while (CurNode && getCN(CurNode)->getNumPieces() == 0); in MoveToNextPiece()
706 if (CurNode) in MoveToNextPiece()
707 CurPiece = &getCN(CurNode)->getPiece(0); in MoveToNextPiece()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/clang/lib/Rewrite/
H A DRewriteRope.cpp680 CurNode = cast<RopePieceBTreeLeaf>(N); in RopePieceBTreeIterator()
684 while (CurNode && getCN(CurNode)->getNumPieces() == 0) in RopePieceBTreeIterator()
685 CurNode = getCN(CurNode)->getNextLeafInOrder(); in RopePieceBTreeIterator()
687 if (CurNode) in RopePieceBTreeIterator()
688 CurPiece = &getCN(CurNode)->getPiece(0); in RopePieceBTreeIterator()
695 if (CurPiece != &getCN(CurNode)->getPiece(getCN(CurNode)->getNumPieces()-1)) { in MoveToNextPiece()
703 CurNode = getCN(CurNode)->getNextLeafInOrder(); in MoveToNextPiece()
704 while (CurNode && getCN(CurNode)->getNumPieces() == 0); in MoveToNextPiece()
706 if (CurNode) in MoveToNextPiece()
707 CurPiece = &getCN(CurNode)->getPiece(0); in MoveToNextPiece()

12345678910>>...13