File: lst.c

package info (click to toggle)
abiword 0.7.7-1
  • links: PTS
  • area: main
  • in suites: potato
  • size: 20,604 kB
  • ctags: 18,358
  • sloc: cpp: 88,791; ansic: 66,296; sh: 7,777; makefile: 3,397; xml: 687; perl: 361; awk: 273; sed: 36; csh: 28
file content (192 lines) | stat: -rw-r--r-- 4,261 bytes parent folder | download
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
#include <stdlib.h>
#include <stdio.h>
#include "wv.h"

/*
Word writes out the rglst as the plcflst by writing out, first, a short integer 
containing the number of LST structures to be written. It then enumerates 
through the rglst, writing out each LSTF structure. It then enumerates through 
the rglst again, deciding, for each LST, whether it has one level 
(LSTF.fSimpleList) or nine levels (!LSTF.fSimpleList). It then writes the 
appropriate number of LVL structures
*/
int wvGetLST(LST **lst,U16 *noofLST,U32 offset,U32 len,FILE *fd)
	{
	U16 i,j;
	*lst = NULL;
	*noofLST = 0;

	if (len == 0)
		return(0);

	fseek(fd,offset,SEEK_SET);
	wvTrace(("offset is %x, len is %d\n",offset,len));

	*noofLST = read_16ubit(fd);
	wvTrace(("noofLST is %d\n",*noofLST));
	if (*noofLST == 0)
		return(0);

	*lst = (LST *) malloc(*noofLST * sizeof(LST));
	if (*lst== NULL)
		{
		wvError(("NO MEM 1, failed to alloc %d bytes\n",*noofLST * sizeof(LST)));
		return(1);
		}

	for (i=0;i<*noofLST;i++)
		{
		wvGetLSTF(&((*lst)[i].lstf),fd);
		if ((*lst)[i].lstf.fSimpleList)
			{
			(*lst)[i].lvl = (LVL *)malloc(sizeof(LVL));
			(*lst)[i].current_no = (U32 *)malloc(sizeof(U32));
			}
		else
			{
			(*lst)[i].lvl = (LVL *)malloc(9 * sizeof(LVL));
			(*lst)[i].current_no = (U32 *)malloc(9 * sizeof(U32));
			}
		}
	for (i=0;i<*noofLST;i++)
		{
		wvTrace(("getting lvl, the id is %x\n",(*lst)[i].lstf.lsid));
		if ((*lst)[i].lstf.fSimpleList)
			{
			wvTrace(("simple 1\n"));
			wvGetLVL(&((*lst)[i].lvl[0]),fd);
			(*lst)[i].current_no[0] = (*lst)[i].lvl[0].lvlf.iStartAt;
			}
		else
			{
			wvTrace(("complex 9\n"));
			for (j=0;j<9;j++)
				{
				wvGetLVL(&((*lst)[i].lvl[j]),fd);
				(*lst)[i].current_no[j] = (*lst)[i].lvl[j].lvlf.iStartAt;
				}
			}
		}
	return(0);
	}

void wvGetLSTF(LSTF *item,FILE *fd)
	{
	int i;
	U8 temp8;
#ifdef PURIFY
	wvInitLSTF(item);
#endif
    item->lsid = read_32ubit(fd);
	wvTrace(("lsid is %x\n",item->lsid));
	item->tplc = read_32ubit(fd);
    for (i=0;i<9;i++)
		item->rgistd[i]  = read_16ubit(fd);
	temp8 = getc(fd);
	item->fSimpleList = temp8 & 0x01;
    item->fRestartHdn = (temp8 & 0x02)>>1;
    item->reserved1 = (temp8 & 0xFC)>>2;
    item->reserved2 = getc(fd);
	}

void wvInitLSTF(LSTF *item)
	{
	int i;
    item->lsid = 0;
	item->tplc = 0;
    for (i=0;i<9;i++)
		item->rgistd[i]  = 0;
	item->fSimpleList = 0;
    item->fRestartHdn = 0;
    item->reserved1 = 0;
    item->reserved2 = 0;
	}


int wvGetLSTF_PLCF(LSTF **lstf,U32 **pos,U32 *nolstf,U32 offset,U32 len,FILE *fd)
	{
	U32 i;
	if (len == 0)
		{
		*lstf = NULL;
		*pos = NULL;
		*nolstf = 0;
		}
	else
        {
        *nolstf=(len-4)/(cbLSTF+4);
        *pos = (U32 *) malloc( (*nolstf+1) * sizeof(U32));
        if (*pos == NULL)
            {
            wvError(("NO MEM 1, failed to alloc %d bytes\n",(*nolstf+1) * sizeof(U32)));
            return(1);
            }

        *lstf= (LSTF *) malloc(*nolstf* sizeof(LSTF));
        if (*lstf== NULL)
            {
            wvError(("NO MEM 1, failed to alloc %d bytes\n",*nolstf* sizeof(LSTF)));
			free(pos);
            return(1);
            }
        fseek(fd,offset,SEEK_SET);
        for(i=0;i<=*nolstf;i++)
            (*pos)[i]=read_32ubit(fd);
        for(i=0;i<*nolstf;i++)
            wvGetLSTF(&((*lstf)[i]),fd);
        }
	return(0);
	}


void wvReleaseLST(LST **lst,U16 noofLST)
	{
	int i,j;
	if ((lst == NULL) || (*lst == NULL))
		return;
	for (i=0;i<noofLST;i++)
		{
		if ((*lst)[i].lstf.fSimpleList)
			wvReleaseLVL(&((*lst)[i].lvl[0]));
		else
			for (j=0;j<9;j++)
				wvReleaseLVL(&((*lst)[i].lvl[j]));
		wvFree((*lst)[i].current_no);
		wvFree((*lst)[i].lvl);
		}
	wvFree(*lst);
	}

/*
Using the LFO's List ID, search the rglst for the LST with that List ID.
*/
LST *wvSearchLST(U32 id,LST *lst,U16 noofLST)
	{
	int i;
	for(i=0;i<noofLST;i++)
		{
		if (lst[i].lstf.lsid == id)
			{
			wvTrace(("found id %x\n",id));
			return(&(lst[i]));
			}
		}
	wvWarning("Couldn't find list id %x\n",id);
	return(NULL);
	}


int wvInitLST(LST *lst)
	{
	U16 j;
	wvInitLSTF(&lst->lstf);
	lst->lvl = (LVL *)malloc(9 * sizeof(LVL));
	lst->current_no = (U32 *)malloc(9 * sizeof(U32));

	for (j=0;j<9;j++)
		{
		wvInitLVL(&(lst->lvl[j]));
		lst->current_no[j] = lst->lvl[j].lvlf.iStartAt;
		}
	return(0);
	}