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

Change ASyncQueue to run in forward order (first in / first out)

Browse Source 
git-svn-id: trunk@25698 -
This commit is contained in:
martin 2010-05-27 15:29:53 +00:00
parent 19f9f16b28
commit 0da4663c8d
1 changed files with 15 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
lcl/include/application.inc
View File

@ -997,10 +997,13 @@ begin
begin begin
if Cur.Last<>nil then if Cur.Last<>nil then
begin begin
assert(Cur.Top <> nil, 'TApplication.ProcessAsyncCallQueue: Last entry found, while Top not assigned');
Cur.Last^.NextItem:=Next.Top; Cur.Last^.NextItem:=Next.Top;
Next.Top^.PrevItem:=Cur.Last; Next.Top^.PrevItem:=Cur.Last;
end else end else begin
assert(Cur.Top = nil, 'TApplication.ProcessAsyncCallQueue: Last entry found, while Top not assigned');
Cur.Top:=Next.Top; Cur.Top:=Next.Top;
end;
Cur.Last:=Next.Last; Cur.Last:=Next.Last;
Next.Top:=nil; Next.Top:=nil;
Next.Last:=nil; Next.Last:=nil;
@ -1010,14 +1013,14 @@ begin
// this can create new items, which are added to the next queue // this can create new items, which are added to the next queue
// or it can call ProcessAsyncCallQueue, for example via calling // or it can call ProcessAsyncCallQueue, for example via calling
// Application.ProcesssMessages // Application.ProcesssMessages
while Cur.Last <> nil do while Cur.Top <> nil do
begin begin
lItem:=Cur.Last; lItem:=Cur.Top;
Cur.Last:=lItem^.PrevItem; Cur.Top := lItem^.NextItem;
if Cur.Last=nil then if Cur.Top = nil then
Cur.Top:=nil Cur.Last := nil
else else
Cur.Last^.NextItem:=nil; Cur.Top^.PrevItem := nil;
Event:=lItem^.Method; Event:=lItem^.Method;
Data:=lItem^.Data; Data:=lItem^.Data;
Dispose(lItem); Dispose(lItem);
@ -2123,10 +2126,13 @@ begin
lItem^.NextItem := nil; lItem^.NextItem := nil;
with FAsyncCall.Next do begin with FAsyncCall.Next do begin
lItem^.PrevItem := Last; lItem^.PrevItem := Last;
if Last<>nil then if Last<>nil then begin
assert(Top <> nil, 'TApplication.QueueAsyncCall: Top entry missing (but last is assigned)');
Last^.NextItem := lItem Last^.NextItem := lItem
else end else begin
assert(Last = nil, 'TApplication.QueueAsyncCall: Last entry found, while Top not assigned');
Top := lItem; Top := lItem;
end;
Last := lItem; Last := lItem;
end; end;
end; end;