summaryrefslogtreecommitdiff
path: root/frontends/amiga/object.c
blob: 98e0b12b766ed5dd356f2ea0359ba865346f1154 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
/*
 * 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/>.
 */

#include "amiga/os3support.h"

#include <stdbool.h>
#include <stdlib.h>
#include <string.h>

#include <proto/exec.h>
#include <exec/lists.h>
#include <exec/nodes.h>

#include "amiga/object.h"

#ifdef __amigaos4__
#define nsList MinList
#define NewnsList NewMinList
#else
#define nsList List
#define NewnsList NewList
#endif

static 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 */
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 *)malloc(sizeof(struct nsList));
	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);
}

void ObjectCallback(struct nsObject *dtzo, void (*callback)(void *nso))
{
	dtzo->callback = callback;
}

static void DelObjectInternal(struct nsObject *dtzo, BOOL free_obj)
{
	Remove((struct Node *)dtzo);
	if(dtzo->callback != NULL) dtzo->callback(dtzo->objstruct);
	if(dtzo->objstruct && free_obj) free(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);

	do {
		nnode=(struct nsObject *)GetSucc((struct Node *)node);
		if(node->Type == AMINS_RECT) {
			DelObjectNoFree(node);
		} else {
			DelObject(node);
		}
	} while((node=nnode));

	free(objlist);
}