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
|
/*
$Header: /cvs/src/tdl/io.c,v 1.5.2.1 2004/01/07 00:09:05 richard Exp $
tdl - A console program for managing to-do lists
Copyright (C) 2001-2004 Richard P. Curnow
This program 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; either version 2 of the License, or
(at your option) any later version.
This program 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, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA
*/
#include <string.h>
#include "tdl.h"
#define MAGIC1 0x99bb0001L
static unsigned int count_length(struct links *x)/*{{{*/
{
int n = 0;
struct node *y;
for (y = x->next; &y->chain != x; y = y->chain.next) n++;
return n;
}
/*}}}*/
static unsigned int count_kids(struct node *x)/*{{{*/
{
return count_length(&x->kids);
}
/*}}}*/
static void write_int(unsigned int n, FILE *out)/*{{{*/
{
unsigned int a, b, c, d;
a = (n >> 24) & 255;
b = (n >> 16) & 255;
c = (n >> 8) & 255;
d = (n ) & 255;
fputc(a, out);
fputc(b, out);
fputc(c, out);
fputc(d, out);
}
/*}}}*/
/*{{{ static unsigned int read_int(FILE *in)*/
static unsigned int read_int(FILE *in)
{
unsigned int a, b, c, d;
a = fgetc(in);
b = fgetc(in);
c = fgetc(in);
d = fgetc(in);
return ((a & 0xff) << 24) + ((b & 0xff) << 16) +
((c & 0xff) << 8) + (d & 0xff);
}
/*}}}*/
static void write_node(struct node *x, FILE *out)/*{{{*/
{
int len, n_kids;
struct node *kid;
len = strlen(x->text);
n_kids = count_kids(x);
write_int(x->arrived, out);
write_int(x->required_by, out);
write_int(x->done, out);
fputc(x->priority, out);
write_int(len, out);
fwrite(x->text, 1, len, out);
write_int(n_kids, out);
for (kid = x->kids.next; kid != (struct node *) &x->kids; kid = kid->chain.next)
{
write_node(kid, out);
}
}
/*}}}*/
void write_database(FILE *out, struct links *from)/*{{{*/
{
int n_kids;
struct node *kid;
n_kids = count_length(from);
write_int(MAGIC1, out);
write_int(n_kids, out);
for (kid = from->next; kid != (struct node *) from; kid = kid->chain.next)
{
write_node(kid, out);
}
}
/*}}}*/
/*{{{ static struct node *read_node(FILE *in)*/
static struct node *read_node(FILE *in)
{
struct node *r = new_node();
int len, n_kids, i;
r->arrived = read_int(in);
r->required_by = read_int(in);
r->done = read_int(in);
r->priority = fgetc(in);
if ((r->priority < PRI_UNKNOWN) || (r->priority > PRI_URGENT)) {
r->priority = PRI_NORMAL;
}
len = read_int(in);
r->text = new_array(char, len+1);
fread(r->text, 1, len, in);
r->text[len] = 0;
n_kids = read_int(in);
for (i=0; i<n_kids; i++) {
struct node *nn;
nn = read_node(in);
prepend_child(nn, r);
}
return r;
}
/*}}}*/
/*{{{ void read_database(FILE *in)*/
int read_database(FILE *in, struct links *to)
{
int n_kids, i;
unsigned int magic;
/* FIXME : Ought to clear any existing database. For initial version this
* won't happen (only one load per invocation), and even later, we might just
* take the memory leak. But for safety, ... */
to->prev = (struct node *) to;
to->next = (struct node *) to;
if (feof(in)) {
fprintf(stderr, "Can't read anything from database\n");
return -1;
}
magic = read_int(in);
if (magic != MAGIC1) {
fprintf(stderr, "Cannot parse database, wrong magic number\n");
return -1;
}
n_kids = read_int(in);
for (i=0; i<n_kids; i++) {
struct node *nn;
nn = read_node(in);
prepend_node(nn, to);
}
return 0;
}
/*}}}*/
|
