blob: a5bdc7f384a7bd6180eb5230858a60a18865d295 (
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
|
/*
* 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/font.h"
#include "amiga/object.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->Type == AMINS_FONT) ami_font_close(dtzo->objstruct);
if(dtzo->objstruct && free_obj) FreeVec(dtzo->objstruct);
if(dtzo->dtz_Node.ln_Name) free(dtzo->dtz_Node.ln_Name);
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);
}
|