1
0
mirror of https://github.com/netsurf-browser/netsurf synced 2024-12-26 14:07:05 +03:00
netsurf/amiga/object.c

137 lines
3.2 KiB
C
Raw Normal View History

/*
* Copyright 2005, 2008, 2016 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/>.
*/
2015-01-19 00:11:00 +03:00
#include "amiga/os3support.h"
#include <stdbool.h>
2014-11-11 02:33:08 +03:00
#include <stdlib.h>
#include <string.h>
2014-11-11 02:33:08 +03:00
#include <proto/exec.h>
#include <exec/lists.h>
#include <exec/nodes.h>
2015-01-19 00:11:00 +03:00
#include "amiga/misc.h"
#include "amiga/object.h"
#ifdef __amigaos4__
#define nsList MinList
#define NewnsList NewMinList
#else
#define nsList List
#define NewnsList NewList
#endif
APTR pool_nsobj = NULL;
bool ami_object_init(void)
{
pool_nsobj = ami_misc_itempool_create(sizeof(struct nsObject));
if(pool_nsobj == NULL) return false;
else return true;
}
void ami_object_fini(void)
{
ami_misc_itempool_delete(pool_nsobj);
}
/* Slightly abstract MinList initialisation */
2016-02-14 18:42:58 +03:00
static void ami_NewMinList(struct MinList *list)
{
if(list == NULL) return;
NewnsList((struct nsList *)list);
}
/* Allocate and initialise a new MinList */
struct MinList *ami_AllocMinList(void)
{
struct MinList *objlist = (struct MinList *)AllocVecTagList(sizeof(struct nsList), NULL);
if(objlist == NULL) return NULL;
ami_NewMinList(objlist);
return objlist;
}
struct MinList *NewObjList(void)
{
struct MinList *objlist = ami_AllocMinList();
return(objlist);
}
struct nsObject *AddObject(struct MinList *objlist, ULONG otype)
{
struct nsObject *dtzo;
dtzo = (struct nsObject *)ami_misc_itempool_alloc(pool_nsobj, sizeof(struct nsObject));
if(dtzo == NULL) return NULL;
memset(dtzo, 0, sizeof(struct nsObject));
AddTail((struct List *)objlist,(struct Node *)dtzo);
dtzo->Type = otype;
return(dtzo);
}
2016-01-16 03:00:57 +03:00
void ObjectCallback(struct nsObject *dtzo, void (*callback)(void *nso))
{
dtzo->callback = callback;
}
2014-11-11 02:33:08 +03:00
static void DelObjectInternal(struct nsObject *dtzo, BOOL free_obj)
{
Remove((struct Node *)dtzo);
2016-01-16 03:00:57 +03:00
if(dtzo->callback != NULL) dtzo->callback(dtzo->objstruct);
if(dtzo->objstruct && free_obj) FreeVec(dtzo->objstruct);
if(dtzo->dtz_Node.ln_Name) free(dtzo->dtz_Node.ln_Name);
ami_misc_itempool_free(pool_nsobj, dtzo, sizeof(struct nsObject));
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((struct MinList *)objlist)) return;
node = (struct nsObject *)GetHead((struct List *)objlist);
2014-11-11 02:33:08 +03:00
do {
nnode=(struct nsObject *)GetSucc((struct Node *)node);
if(node->Type == AMINS_RECT) {
DelObjectNoFree(node);
} else {
DelObject(node);
}
2014-11-11 02:33:08 +03:00
} while((node=nnode));
FreeVec(objlist);
}