sexp.c 5.39 KB
Newer Older
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
/* sexp.c
 *
 * Parsing s-expressions.
 */

/* nettle, low-level cryptographics library
 *
 * Copyright (C) 2002 Niels Mller
 *  
 * The nettle library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or (at your
 * option) any later version.
 * 
 * The nettle library 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 Lesser General Public
 * License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License
 * along with the nettle library; see the file COPYING.LIB.  If not, write to
 * the Free Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 * MA 02111-1307, USA.
 */

#include "sexp.h"

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

void
sexp_iterator_init(struct sexp_iterator *iterator,
		   unsigned length, const uint8_t *input)
{
  iterator->length = length;
  iterator->buffer = input;
  iterator->pos = 0;
  iterator->level = 0;
  iterator->type = SEXP_START;
  iterator->display_length = 0;
  iterator->display = NULL;
  iterator->atom_length = 0;
  iterator->atom = NULL;

  /* FIXME: For other than canonical syntax,
   * skip white space here. */
}

#define EMPTY(i) ((i)->pos == (i)->length)
#define NEXT(i) ((i)->buffer[(i)->pos++])

static int
sexp_iterator_simple(struct sexp_iterator *iterator,
		     unsigned *size,
		     const uint8_t **string)
{
  unsigned length = 0;
  uint8_t c;
  
  if (EMPTY(iterator)) return 0;
  c = NEXT(iterator);
62
  if (EMPTY(iterator)) return 0;
63
64
65
66
67

  if (c >= '1' && c <= '9')
    do
      {
	length = length * 10 + (c - '0');
68
69
	if (length > (iterator->length - iterator->pos))
	  return 0;
70
71
72
73

	if (EMPTY(iterator)) return 0;
	c = NEXT(iterator);
      }
74
    while (c >= '0' && c <= '9');
75

76
77
78
79
  else if (c == '0')
    /* There can be only one */
    c = NEXT(iterator);
  else 
80
81
    return 0;

82
  if (c != ':')
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
    return 0;

  *size = length;
  *string = iterator->buffer + iterator->pos;
  iterator->pos += length;

  return 1;
}

/* All these functions return 1 on success, 0 on failure */
int
sexp_iterator_next(struct sexp_iterator *iterator)
{
  if (iterator->type == SEXP_END)
    return 1;
  
  if (EMPTY(iterator))
    {
      if (iterator->level)
	return 0;
      
      iterator->type = SEXP_END;
      return 1;
    }
  switch (iterator->buffer[iterator->pos])
    {
    case '(': /* A list */
110
111
      if (iterator->type == SEXP_LIST)
	/* Skip this list */
112
	return sexp_iterator_enter_list(iterator)
113
114
115
116
117
118
119
120
121
122
123
124
	  && sexp_iterator_exit_list(iterator)
	  && sexp_iterator_next(iterator);
      else
	{
	  iterator->type = SEXP_LIST;
	  return 1;
	}
    case ')':
      iterator->pos++;
      iterator->type = SEXP_END;
      return 1;
      
125
126
127
128
129
130
131
132
133
134
135
136
    case '[': /* Atom with display type */
      iterator->pos++;
      if (!sexp_iterator_simple(iterator,
				&iterator->display_length,
				&iterator->display))
	return 0;
      if (EMPTY(iterator) || NEXT(iterator) != ']')
	return 0;

      break;

    default:
137
138
      /* Must be either a decimal digit or a syntax error.
       * Errors are detected by sexp_iterator_simple. */
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
      iterator->display_length = 0;
      iterator->display = NULL;

      break;
    }

  iterator->type = SEXP_ATOM;
      
  return sexp_iterator_simple(iterator,
			      &iterator->atom_length,
			      &iterator->atom);
}

/* Current element must be a list. */
int
sexp_iterator_enter_list(struct sexp_iterator *iterator)
{
  if (iterator->type != SEXP_LIST)
    return 0;

  if (EMPTY(iterator) || NEXT(iterator) != '(')
    /* Internal error */
    abort();

  iterator->level++;
164
  iterator->type = SEXP_START;
165
166
167
168
169
170
171
172
173
174
  return 1;
}

/* Skips the rest of the current list */
int
sexp_iterator_exit_list(struct sexp_iterator *iterator)
{
  if (!iterator->level)
    return 0;

175
176
177
178
179
180
181
182
183
184
185
186
  for (;;)
    {
      if (!sexp_iterator_next(iterator))
	return 0;
      
      if (iterator->type == SEXP_END)
	{
	  iterator->type = SEXP_START;	  
	  iterator->level--;
	  return 1;
	}
    }
187
188
189
190
191
192
193
194
}

int
sexp_iterator_assoc(struct sexp_iterator *iterator,
		    unsigned nkeys,
		    const struct sexp_assoc_key *keys,
		    struct sexp_iterator *values)
{
195
196
197
198
  int *found;
  unsigned nfound;
  unsigned i;
  
199
200
201
  if (!sexp_iterator_enter_list(iterator))
    return 0;

202
203
204
205
206
207
  found = alloca(nkeys * sizeof(*found));
  for (i = 0; i<nkeys; i++)
    found[i] = 0;

  nfound = 0;
  
208
209
210
211
212
213
214
215
216
  for (;;)
    {
      if (!sexp_iterator_next(iterator))
	return 0;

      switch (iterator->type)
	{
	case SEXP_LIST:
	  
217
218
	  if (! (sexp_iterator_enter_list(iterator)
		 && sexp_iterator_next(iterator)))
219
220
221
222
223
224
225
226
227
228
229
230
	    return 0;
	  
	  if (iterator->type == SEXP_ATOM
	      && !iterator->display)
	    {
	      /* Compare to the given keys */
	      for (i = 0; i<nkeys; i++)
		{
		  if (keys[i].length == iterator->atom_length
		      && !memcmp(keys[i].name, iterator->atom,
				 keys[i].length))
		    {
231
232
233
234
235
236
237
		      if (found[i])
			/* We don't allow duplicates */
			return 0;

		      found[i] = 1;
		      nfound++;
		      
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
		      /* Record this position. */
		      values[i] = *iterator;

		      break;
		    }
		}
	    }
	  if (!sexp_iterator_exit_list(iterator))
	    return 0;
	  break;
	case SEXP_ATOM:
	  /* Just ignore */
	  break;
	  
	case SEXP_END:
253
254
	  return sexp_iterator_exit_list(iterator)
	    && (nfound == nkeys);
255
256
257
258
259
260

	default:
	  abort();
	}
    }
}