mirror of
https://github.com/netsurf-browser/netsurf
synced 2024-11-24 23:39:51 +03:00
6bced73998
Scheduled events are now in event time order, so schedule_run simply takes the top event off the heap and runs it (if we're polling, rather than having received a signal that the next event is due to be run, we check first that we have passed the scheduled time). This should provide performance benefits as we are no longer trawling the entire list of scheduled events (potentially hundreds) every time an event is signalled or the schedule list is polled. svn path=/trunk/netsurf/; revision=11703
85 lines
2.0 KiB
C
Executable File
85 lines
2.0 KiB
C
Executable File
/*
|
|
* Copyright 2005,2008 Chris Young <chris@unsatisfactorysoftware.co.uk>
|
|
*
|
|
* This file is part of NetSurf, http://www.netsurf-browser.org/
|
|
*
|
|
* NetSurf is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; version 2 of the License.
|
|
*
|
|
* NetSurf is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <proto/exec.h>
|
|
#include <exec/lists.h>
|
|
#include <exec/nodes.h>
|
|
#include "amiga/object.h"
|
|
#include "amiga/schedule.h"
|
|
|
|
struct MinList *NewObjList(void)
|
|
{
|
|
|
|
struct MinList *objlist;
|
|
|
|
objlist = (struct MinList *)AllocVec(sizeof(struct MinList),MEMF_PRIVATE | MEMF_CLEAR);
|
|
|
|
NewMinList(objlist);
|
|
|
|
return(objlist);
|
|
|
|
}
|
|
|
|
struct nsObject *AddObject(struct MinList *objlist,ULONG otype)
|
|
{
|
|
struct nsObject *dtzo;
|
|
|
|
dtzo = (struct nsObject *)AllocVec(sizeof(struct nsObject),MEMF_PRIVATE | MEMF_CLEAR);
|
|
|
|
AddTail((struct List *)objlist,(struct Node *)dtzo);
|
|
|
|
dtzo->Type = otype;
|
|
|
|
return(dtzo);
|
|
}
|
|
|
|
void DelObjectInternal(struct nsObject *dtzo, BOOL free_obj)
|
|
{
|
|
Remove((struct Node *)dtzo);
|
|
if(dtzo->objstruct && free_obj) FreeVec(dtzo->objstruct);
|
|
FreeVec(dtzo);
|
|
dtzo = NULL;
|
|
}
|
|
|
|
void DelObject(struct nsObject *dtzo)
|
|
{
|
|
DelObjectInternal(dtzo, TRUE);
|
|
}
|
|
|
|
void DelObjectNoFree(struct nsObject *dtzo)
|
|
{
|
|
DelObjectInternal(dtzo, FALSE);
|
|
}
|
|
|
|
void FreeObjList(struct MinList *objlist)
|
|
{
|
|
struct nsObject *node;
|
|
struct nsObject *nnode;
|
|
|
|
if(IsMinListEmpty(objlist)) return;
|
|
node = (struct nsObject *)GetHead((struct List *)objlist);
|
|
|
|
do
|
|
{
|
|
nnode=(struct nsObject *)GetSucc((struct Node *)node);
|
|
DelObject(node);
|
|
}while(node=nnode);
|
|
|
|
FreeVec(objlist);
|
|
}
|