paweld/lazarus
1
0
Fork 0
mirror of https://gitlab.com/freepascal.org/lazarus/lazarus.git synced 2025-08-09 09:55:53 +02:00
Code Issues Packages Projects Releases Wiki Activity

FPDebug: some optimizations

Browse Source 
git-svn-id: trunk@43415 -
This commit is contained in:
martin 2013-11-10 12:05:05 +00:00
parent f0787433ea
commit 15cbda1171
1 changed files with 17 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
components/fpdebug/fpdbgdwarf.pas
View File

@ -206,7 +206,7 @@ type
Link: Integer;
Entry: Pointer;
end;
//PDwarfScopeInfoRec = ^TDwarfScopeInfoRec;
PDwarfScopeInfoRec = ^TDwarfScopeInfoRec;
TDwarfScopeArray = Array of TDwarfScopeInfoRec;
TDwarfScopeList = record
@ -229,11 +229,11 @@ type
function GetParent: TDwarfScopeInfo; inline;
function GetParentIndex: Integer;
procedure SetIndex(AIndex: Integer);
function CreateScopeForEntry(AEntry: Pointer; ALink: Integer): Integer;
function CreateScopeForEntry(AEntry: Pointer; ALink: Integer): Integer; inline;
public
procedure Init(AScopeList: PDwarfScopeList);
function CreateNextForEntry(AEntry: Pointer): Integer;
function CreateChildForEntry(AEntry: Pointer): Integer;
function CreateNextForEntry(AEntry: Pointer): Integer; inline;
function CreateChildForEntry(AEntry: Pointer): Integer; inline;
function IsValid: Boolean; inline;
property Index: Integer read FIndex write SetIndex;
@ -1964,15 +1964,18 @@ end;
function TDwarfScopeInfo.GetNextIndex: Integer;
var
l: Integer;
p: PDwarfScopeInfoRec;
begin
Result := -1;
if (not IsValid) or (FScopeList^.HighestKnown = FIndex) then exit;
Result := FScopeList^.List[FIndex + 1].Link;
// Use pointer, to avoid calculating the index twice
p := @FScopeList^.List[FIndex + 1];
Result := p^.Link;
assert(Result <= FScopeList^.HighestKnown);
if (Result > FIndex + 1) then // Index+1 is First Child, with pointer to Next
exit;
l := FScopeList^.List[FIndex].Link; // GetParent (or -1 for toplevel)
l := (p-1)^.Link; // GetParent (or -1 for toplevel)
assert(l <= FScopeList^.HighestKnown);
if l > Index then l := Index - 1; // This is a first child, make l = parent
if (Result = l) then begin // Index + 1 has same parent
@ -2056,8 +2059,10 @@ begin
Result := FScopeList^.HighestKnown;
if Result >= Length(FScopeList^.List) then
SetLength(FScopeList^.List, Result + SCOPE_ALLOC_BLOCK_SIZE);
FScopeList^.List[Result].Entry := AEntry;
FScopeList^.List[Result].Link := ALink;
with FScopeList^.List[Result] do begin
Entry := AEntry;
Link := ALink;
end;
end;
function TDwarfScopeInfo.HasParent: Boolean;
@ -2099,21 +2104,20 @@ begin
assert(l <= FScopeList^.HighestKnown);
if l > Index then
l := Index - 1; // This is a first child, make l = parent
Index := l;
FIndex := l;
end;
procedure TDwarfScopeInfo.GoNext;
begin
if IsValid then
Index := GetNextIndex;
FIndex := GetNextIndex;
end;
procedure TDwarfScopeInfo.GoChild;
begin
if HasChild then
Index := FIndex + 1
FIndex := FIndex + 1
else
Index := -1;
FIndex := -1;
end;
function TDwarfScopeInfo.CreateNextForEntry(AEntry: Pointer): Integer;
@ -2361,7 +2365,6 @@ begin
Continue;
end;
GoNext;
end;