|
428
|
1 /* XEmacs routines to deal with range tables.
|
|
|
2 Copyright (C) 1995 Sun Microsystems, Inc.
|
|
800
|
3 Copyright (C) 1995, 2002 Ben Wing.
|
|
428
|
4
|
|
|
5 This file is part of XEmacs.
|
|
|
6
|
|
|
7 XEmacs is free software; you can redistribute it and/or modify it
|
|
|
8 under the terms of the GNU General Public License as published by the
|
|
|
9 Free Software Foundation; either version 2, or (at your option) any
|
|
|
10 later version.
|
|
|
11
|
|
|
12 XEmacs is distributed in the hope that it will be useful, but WITHOUT
|
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
15 for more details.
|
|
|
16
|
|
|
17 You should have received a copy of the GNU General Public License
|
|
|
18 along with XEmacs; see the file COPYING. If not, write to
|
|
|
19 the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
|
|
20 Boston, MA 02111-1307, USA. */
|
|
|
21
|
|
|
22 /* Synched up with: Not in FSF. */
|
|
|
23
|
|
|
24 /* Written by Ben Wing, August 1995. */
|
|
|
25
|
|
|
26 #include <config.h>
|
|
|
27 #include "lisp.h"
|
|
|
28 #include "rangetab.h"
|
|
|
29
|
|
|
30 Lisp_Object Qrange_tablep;
|
|
|
31 Lisp_Object Qrange_table;
|
|
|
32
|
|
|
33
|
|
|
34 /************************************************************************/
|
|
|
35 /* Range table object */
|
|
|
36 /************************************************************************/
|
|
|
37
|
|
|
38 /* We use a sorted array of ranges.
|
|
|
39
|
|
|
40 #### We should be using the gap array stuff from extents.c. This
|
|
|
41 is not hard but just requires moving that stuff out of that file. */
|
|
|
42
|
|
|
43 static Lisp_Object
|
|
|
44 mark_range_table (Lisp_Object obj)
|
|
|
45 {
|
|
440
|
46 Lisp_Range_Table *rt = XRANGE_TABLE (obj);
|
|
428
|
47 int i;
|
|
|
48
|
|
|
49 for (i = 0; i < Dynarr_length (rt->entries); i++)
|
|
|
50 mark_object (Dynarr_at (rt->entries, i).val);
|
|
|
51 return Qnil;
|
|
|
52 }
|
|
|
53
|
|
|
54 static void
|
|
|
55 print_range_table (Lisp_Object obj, Lisp_Object printcharfun, int escapeflag)
|
|
|
56 {
|
|
440
|
57 Lisp_Range_Table *rt = XRANGE_TABLE (obj);
|
|
428
|
58 int i;
|
|
|
59
|
|
826
|
60 write_c_string (printcharfun, "#s(range-table data (");
|
|
428
|
61 for (i = 0; i < Dynarr_length (rt->entries); i++)
|
|
|
62 {
|
|
|
63 struct range_table_entry *rte = Dynarr_atp (rt->entries, i);
|
|
|
64 if (i > 0)
|
|
826
|
65 write_c_string (printcharfun, " ");
|
|
428
|
66 if (rte->first == rte->last)
|
|
800
|
67 write_fmt_string (printcharfun, "%ld ", (long) (rte->first));
|
|
428
|
68 else
|
|
800
|
69 write_fmt_string (printcharfun, "(%ld %ld) ", (long) (rte->first),
|
|
|
70 (long) (rte->last));
|
|
428
|
71 print_internal (rte->val, printcharfun, 1);
|
|
|
72 }
|
|
826
|
73 write_c_string (printcharfun, "))");
|
|
428
|
74 }
|
|
|
75
|
|
|
76 static int
|
|
|
77 range_table_equal (Lisp_Object obj1, Lisp_Object obj2, int depth)
|
|
|
78 {
|
|
440
|
79 Lisp_Range_Table *rt1 = XRANGE_TABLE (obj1);
|
|
|
80 Lisp_Range_Table *rt2 = XRANGE_TABLE (obj2);
|
|
428
|
81 int i;
|
|
|
82
|
|
|
83 if (Dynarr_length (rt1->entries) != Dynarr_length (rt2->entries))
|
|
|
84 return 0;
|
|
|
85
|
|
|
86 for (i = 0; i < Dynarr_length (rt1->entries); i++)
|
|
|
87 {
|
|
|
88 struct range_table_entry *rte1 = Dynarr_atp (rt1->entries, i);
|
|
|
89 struct range_table_entry *rte2 = Dynarr_atp (rt2->entries, i);
|
|
|
90
|
|
|
91 if (rte1->first != rte2->first
|
|
|
92 || rte1->last != rte2->last
|
|
|
93 || !internal_equal (rte1->val, rte2->val, depth + 1))
|
|
|
94 return 0;
|
|
|
95 }
|
|
|
96
|
|
|
97 return 1;
|
|
|
98 }
|
|
|
99
|
|
|
100 static unsigned long
|
|
|
101 range_table_entry_hash (struct range_table_entry *rte, int depth)
|
|
|
102 {
|
|
|
103 return HASH3 (rte->first, rte->last, internal_hash (rte->val, depth + 1));
|
|
|
104 }
|
|
|
105
|
|
|
106 static unsigned long
|
|
|
107 range_table_hash (Lisp_Object obj, int depth)
|
|
|
108 {
|
|
440
|
109 Lisp_Range_Table *rt = XRANGE_TABLE (obj);
|
|
428
|
110 int i;
|
|
|
111 int size = Dynarr_length (rt->entries);
|
|
|
112 unsigned long hash = size;
|
|
|
113
|
|
|
114 /* approach based on internal_array_hash(). */
|
|
|
115 if (size <= 5)
|
|
|
116 {
|
|
|
117 for (i = 0; i < size; i++)
|
|
|
118 hash = HASH2 (hash,
|
|
|
119 range_table_entry_hash (Dynarr_atp (rt->entries, i),
|
|
|
120 depth));
|
|
|
121 return hash;
|
|
|
122 }
|
|
|
123
|
|
|
124 /* just pick five elements scattered throughout the array.
|
|
|
125 A slightly better approach would be to offset by some
|
|
|
126 noise factor from the points chosen below. */
|
|
|
127 for (i = 0; i < 5; i++)
|
|
|
128 hash = HASH2 (hash, range_table_entry_hash (Dynarr_atp (rt->entries,
|
|
|
129 i*size/5),
|
|
|
130 depth));
|
|
|
131 return hash;
|
|
|
132 }
|
|
|
133
|
|
|
134 static const struct lrecord_description rte_description_1[] = {
|
|
440
|
135 { XD_LISP_OBJECT, offsetof (range_table_entry, val) },
|
|
428
|
136 { XD_END }
|
|
|
137 };
|
|
|
138
|
|
|
139 static const struct struct_description rte_description = {
|
|
440
|
140 sizeof (range_table_entry),
|
|
428
|
141 rte_description_1
|
|
|
142 };
|
|
|
143
|
|
|
144 static const struct lrecord_description rted_description_1[] = {
|
|
440
|
145 XD_DYNARR_DESC (range_table_entry_dynarr, &rte_description),
|
|
428
|
146 { XD_END }
|
|
|
147 };
|
|
|
148
|
|
|
149 static const struct struct_description rted_description = {
|
|
440
|
150 sizeof (range_table_entry_dynarr),
|
|
428
|
151 rted_description_1
|
|
|
152 };
|
|
|
153
|
|
|
154 static const struct lrecord_description range_table_description[] = {
|
|
440
|
155 { XD_STRUCT_PTR, offsetof (Lisp_Range_Table, entries), 1, &rted_description },
|
|
428
|
156 { XD_END }
|
|
|
157 };
|
|
|
158
|
|
934
|
159 #ifdef USE_KKCC
|
|
|
160 DEFINE_LRECORD_IMPLEMENTATION ("range-table", range_table,
|
|
|
161 1, /*dumpable-flag*/
|
|
|
162 mark_range_table, print_range_table, 0,
|
|
|
163 range_table_equal, range_table_hash,
|
|
|
164 range_table_description,
|
|
|
165 Lisp_Range_Table);
|
|
|
166 #else /* not USE_KKCC */
|
|
428
|
167 DEFINE_LRECORD_IMPLEMENTATION ("range-table", range_table,
|
|
|
168 mark_range_table, print_range_table, 0,
|
|
|
169 range_table_equal, range_table_hash,
|
|
|
170 range_table_description,
|
|
440
|
171 Lisp_Range_Table);
|
|
934
|
172 #endif /* not USE_KKCC */
|
|
428
|
173
|
|
|
174 /************************************************************************/
|
|
|
175 /* Range table operations */
|
|
|
176 /************************************************************************/
|
|
|
177
|
|
800
|
178 #ifdef ERROR_CHECK_STRUCTURES
|
|
428
|
179
|
|
|
180 static void
|
|
440
|
181 verify_range_table (Lisp_Range_Table *rt)
|
|
428
|
182 {
|
|
|
183 int i;
|
|
|
184
|
|
|
185 for (i = 0; i < Dynarr_length (rt->entries); i++)
|
|
|
186 {
|
|
|
187 struct range_table_entry *rte = Dynarr_atp (rt->entries, i);
|
|
|
188 assert (rte->last >= rte->first);
|
|
|
189 if (i > 0)
|
|
|
190 assert (Dynarr_at (rt->entries, i - 1).last < rte->first);
|
|
|
191 }
|
|
|
192 }
|
|
|
193
|
|
|
194 #else
|
|
|
195
|
|
|
196 #define verify_range_table(rt)
|
|
|
197
|
|
|
198 #endif
|
|
|
199
|
|
|
200 /* Look up in a range table without the Dynarr wrapper.
|
|
|
201 Used also by the unified range table format. */
|
|
|
202
|
|
|
203 static Lisp_Object
|
|
|
204 get_range_table (EMACS_INT pos, int nentries, struct range_table_entry *tab,
|
|
|
205 Lisp_Object default_)
|
|
|
206 {
|
|
|
207 int left = 0, right = nentries;
|
|
|
208
|
|
|
209 /* binary search for the entry. Based on similar code in
|
|
|
210 extent_list_locate(). */
|
|
|
211 while (left != right)
|
|
|
212 {
|
|
|
213 /* RIGHT might not point to a valid entry (i.e. it's at the end
|
|
|
214 of the list), so NEWPOS must round down. */
|
|
647
|
215 int newpos = (left + right) >> 1;
|
|
428
|
216 struct range_table_entry *entry = tab + newpos;
|
|
|
217 if (pos > entry->last)
|
|
|
218 left = newpos+1;
|
|
|
219 else if (pos < entry->first)
|
|
|
220 right = newpos;
|
|
|
221 else
|
|
|
222 return entry->val;
|
|
|
223 }
|
|
|
224
|
|
|
225 return default_;
|
|
|
226 }
|
|
|
227
|
|
|
228 DEFUN ("range-table-p", Frange_table_p, 1, 1, 0, /*
|
|
|
229 Return non-nil if OBJECT is a range table.
|
|
|
230 */
|
|
|
231 (object))
|
|
|
232 {
|
|
|
233 return RANGE_TABLEP (object) ? Qt : Qnil;
|
|
|
234 }
|
|
|
235
|
|
|
236 DEFUN ("make-range-table", Fmake_range_table, 0, 0, 0, /*
|
|
|
237 Return a new, empty range table.
|
|
|
238 You can manipulate it using `put-range-table', `get-range-table',
|
|
|
239 `remove-range-table', and `clear-range-table'.
|
|
|
240 */
|
|
|
241 ())
|
|
|
242 {
|
|
440
|
243 Lisp_Range_Table *rt = alloc_lcrecord_type (Lisp_Range_Table,
|
|
|
244 &lrecord_range_table);
|
|
428
|
245 rt->entries = Dynarr_new (range_table_entry);
|
|
793
|
246 return wrap_range_table (rt);
|
|
428
|
247 }
|
|
|
248
|
|
|
249 DEFUN ("copy-range-table", Fcopy_range_table, 1, 1, 0, /*
|
|
444
|
250 Return a new range table which is a copy of RANGE-TABLE.
|
|
|
251 It will contain the same values for the same ranges as RANGE-TABLE.
|
|
|
252 The values will not themselves be copied.
|
|
428
|
253 */
|
|
444
|
254 (range_table))
|
|
428
|
255 {
|
|
440
|
256 Lisp_Range_Table *rt, *rtnew;
|
|
428
|
257
|
|
444
|
258 CHECK_RANGE_TABLE (range_table);
|
|
|
259 rt = XRANGE_TABLE (range_table);
|
|
428
|
260
|
|
440
|
261 rtnew = alloc_lcrecord_type (Lisp_Range_Table, &lrecord_range_table);
|
|
428
|
262 rtnew->entries = Dynarr_new (range_table_entry);
|
|
|
263
|
|
|
264 Dynarr_add_many (rtnew->entries, Dynarr_atp (rt->entries, 0),
|
|
|
265 Dynarr_length (rt->entries));
|
|
793
|
266 return wrap_range_table (rtnew);
|
|
428
|
267 }
|
|
|
268
|
|
|
269 DEFUN ("get-range-table", Fget_range_table, 2, 3, 0, /*
|
|
444
|
270 Find value for position POS in RANGE-TABLE.
|
|
428
|
271 If there is no corresponding value, return DEFAULT (defaults to nil).
|
|
|
272 */
|
|
444
|
273 (pos, range_table, default_))
|
|
428
|
274 {
|
|
440
|
275 Lisp_Range_Table *rt;
|
|
428
|
276
|
|
444
|
277 CHECK_RANGE_TABLE (range_table);
|
|
|
278 rt = XRANGE_TABLE (range_table);
|
|
428
|
279
|
|
|
280 CHECK_INT_COERCE_CHAR (pos);
|
|
|
281
|
|
|
282 return get_range_table (XINT (pos), Dynarr_length (rt->entries),
|
|
|
283 Dynarr_atp (rt->entries, 0), default_);
|
|
|
284 }
|
|
|
285
|
|
|
286 void
|
|
|
287 put_range_table (Lisp_Object table, EMACS_INT first,
|
|
|
288 EMACS_INT last, Lisp_Object val)
|
|
|
289 {
|
|
|
290 int i;
|
|
|
291 int insert_me_here = -1;
|
|
440
|
292 Lisp_Range_Table *rt = XRANGE_TABLE (table);
|
|
428
|
293
|
|
|
294 /* Now insert in the proper place. This gets tricky because
|
|
|
295 we may be overlapping one or more existing ranges and need
|
|
|
296 to fix them up. */
|
|
|
297
|
|
|
298 /* First delete all sections of any existing ranges that overlap
|
|
|
299 the new range. */
|
|
|
300 for (i = 0; i < Dynarr_length (rt->entries); i++)
|
|
|
301 {
|
|
|
302 struct range_table_entry *entry = Dynarr_atp (rt->entries, i);
|
|
|
303 /* We insert before the first range that begins at or after the
|
|
|
304 new range. */
|
|
|
305 if (entry->first >= first && insert_me_here < 0)
|
|
|
306 insert_me_here = i;
|
|
|
307 if (entry->last < first)
|
|
|
308 /* completely before the new range. */
|
|
|
309 continue;
|
|
|
310 if (entry->first > last)
|
|
|
311 /* completely after the new range. No more possibilities of
|
|
|
312 finding overlapping ranges. */
|
|
|
313 break;
|
|
|
314 if (entry->first < first && entry->last <= last)
|
|
|
315 {
|
|
|
316 /* looks like:
|
|
|
317
|
|
|
318 [ NEW ]
|
|
|
319 [ EXISTING ]
|
|
|
320
|
|
|
321 */
|
|
|
322 /* truncate the end off of it. */
|
|
|
323 entry->last = first - 1;
|
|
|
324 }
|
|
|
325 else if (entry->first < first && entry->last > last)
|
|
|
326 /* looks like:
|
|
|
327
|
|
|
328 [ NEW ]
|
|
|
329 [ EXISTING ]
|
|
|
330
|
|
|
331 */
|
|
|
332 /* need to split this one in two. */
|
|
|
333 {
|
|
|
334 struct range_table_entry insert_me_too;
|
|
|
335
|
|
|
336 insert_me_too.first = last + 1;
|
|
|
337 insert_me_too.last = entry->last;
|
|
|
338 insert_me_too.val = entry->val;
|
|
|
339 entry->last = first - 1;
|
|
|
340 Dynarr_insert_many (rt->entries, &insert_me_too, 1, i + 1);
|
|
|
341 }
|
|
|
342 else if (entry->last > last)
|
|
|
343 {
|
|
|
344 /* looks like:
|
|
|
345
|
|
|
346 [ NEW ]
|
|
|
347 [ EXISTING ]
|
|
|
348
|
|
|
349 */
|
|
|
350 /* truncate the start off of it. */
|
|
|
351 entry->first = last + 1;
|
|
|
352 }
|
|
|
353 else
|
|
|
354 {
|
|
|
355 /* existing is entirely within new. */
|
|
|
356 Dynarr_delete_many (rt->entries, i, 1);
|
|
|
357 i--; /* back up since everything shifted one to the left. */
|
|
|
358 }
|
|
|
359 }
|
|
|
360
|
|
|
361 /* Someone asked us to delete the range, not insert it. */
|
|
|
362 if (UNBOUNDP (val))
|
|
|
363 return;
|
|
|
364
|
|
|
365 /* Now insert the new entry, maybe at the end. */
|
|
|
366
|
|
|
367 if (insert_me_here < 0)
|
|
|
368 insert_me_here = i;
|
|
|
369
|
|
|
370 {
|
|
|
371 struct range_table_entry insert_me;
|
|
|
372
|
|
|
373 insert_me.first = first;
|
|
|
374 insert_me.last = last;
|
|
|
375 insert_me.val = val;
|
|
|
376
|
|
|
377 Dynarr_insert_many (rt->entries, &insert_me, 1, insert_me_here);
|
|
|
378 }
|
|
|
379
|
|
|
380 /* Now see if we can combine this entry with adjacent ones just
|
|
|
381 before or after. */
|
|
|
382
|
|
|
383 if (insert_me_here > 0)
|
|
|
384 {
|
|
|
385 struct range_table_entry *entry = Dynarr_atp (rt->entries,
|
|
|
386 insert_me_here - 1);
|
|
|
387 if (EQ (val, entry->val) && entry->last == first - 1)
|
|
|
388 {
|
|
|
389 entry->last = last;
|
|
|
390 Dynarr_delete_many (rt->entries, insert_me_here, 1);
|
|
|
391 insert_me_here--;
|
|
|
392 /* We have morphed into a larger range. Update our records
|
|
|
393 in case we also combine with the one after. */
|
|
|
394 first = entry->first;
|
|
|
395 }
|
|
|
396 }
|
|
|
397
|
|
|
398 if (insert_me_here < Dynarr_length (rt->entries) - 1)
|
|
|
399 {
|
|
|
400 struct range_table_entry *entry = Dynarr_atp (rt->entries,
|
|
|
401 insert_me_here + 1);
|
|
|
402 if (EQ (val, entry->val) && entry->first == last + 1)
|
|
|
403 {
|
|
|
404 entry->first = first;
|
|
|
405 Dynarr_delete_many (rt->entries, insert_me_here, 1);
|
|
|
406 }
|
|
|
407 }
|
|
|
408 }
|
|
|
409
|
|
|
410 DEFUN ("put-range-table", Fput_range_table, 4, 4, 0, /*
|
|
444
|
411 Set the value for range (START, END) to be VALUE in RANGE-TABLE.
|
|
428
|
412 */
|
|
444
|
413 (start, end, value, range_table))
|
|
428
|
414 {
|
|
|
415 EMACS_INT first, last;
|
|
|
416
|
|
444
|
417 CHECK_RANGE_TABLE (range_table);
|
|
428
|
418 CHECK_INT_COERCE_CHAR (start);
|
|
|
419 first = XINT (start);
|
|
|
420 CHECK_INT_COERCE_CHAR (end);
|
|
|
421 last = XINT (end);
|
|
|
422 if (first > last)
|
|
563
|
423 invalid_argument_2 ("start must be <= end", start, end);
|
|
428
|
424
|
|
444
|
425 put_range_table (range_table, first, last, value);
|
|
|
426 verify_range_table (XRANGE_TABLE (range_table));
|
|
428
|
427 return Qnil;
|
|
|
428 }
|
|
|
429
|
|
|
430 DEFUN ("remove-range-table", Fremove_range_table, 3, 3, 0, /*
|
|
444
|
431 Remove the value for range (START, END) in RANGE-TABLE.
|
|
428
|
432 */
|
|
444
|
433 (start, end, range_table))
|
|
428
|
434 {
|
|
444
|
435 return Fput_range_table (start, end, Qunbound, range_table);
|
|
428
|
436 }
|
|
|
437
|
|
|
438 DEFUN ("clear-range-table", Fclear_range_table, 1, 1, 0, /*
|
|
444
|
439 Flush RANGE-TABLE.
|
|
428
|
440 */
|
|
444
|
441 (range_table))
|
|
428
|
442 {
|
|
444
|
443 CHECK_RANGE_TABLE (range_table);
|
|
|
444 Dynarr_reset (XRANGE_TABLE (range_table)->entries);
|
|
428
|
445 return Qnil;
|
|
|
446 }
|
|
|
447
|
|
|
448 DEFUN ("map-range-table", Fmap_range_table, 2, 2, 0, /*
|
|
444
|
449 Map FUNCTION over entries in RANGE-TABLE, calling it with three args,
|
|
428
|
450 the beginning and end of the range and the corresponding value.
|
|
442
|
451
|
|
|
452 Results are guaranteed to be correct (i.e. each entry processed
|
|
|
453 exactly once) if FUNCTION modifies or deletes the current entry
|
|
444
|
454 \(i.e. passes the current range to `put-range-table' or
|
|
442
|
455 `remove-range-table'), but not otherwise.
|
|
428
|
456 */
|
|
444
|
457 (function, range_table))
|
|
428
|
458 {
|
|
442
|
459 Lisp_Range_Table *rt;
|
|
|
460 int i;
|
|
|
461
|
|
444
|
462 CHECK_RANGE_TABLE (range_table);
|
|
442
|
463 CHECK_FUNCTION (function);
|
|
|
464
|
|
444
|
465 rt = XRANGE_TABLE (range_table);
|
|
442
|
466
|
|
|
467 /* Do not "optimize" by pulling out the length computation below!
|
|
|
468 FUNCTION may have changed the table. */
|
|
|
469 for (i = 0; i < Dynarr_length (rt->entries); i++)
|
|
|
470 {
|
|
|
471 struct range_table_entry *entry = Dynarr_atp (rt->entries, i);
|
|
|
472 EMACS_INT first, last;
|
|
|
473 Lisp_Object args[4];
|
|
|
474 int oldlen;
|
|
|
475
|
|
|
476 again:
|
|
|
477 first = entry->first;
|
|
|
478 last = entry->last;
|
|
|
479 oldlen = Dynarr_length (rt->entries);
|
|
|
480 args[0] = function;
|
|
|
481 args[1] = make_int (first);
|
|
|
482 args[2] = make_int (last);
|
|
|
483 args[3] = entry->val;
|
|
|
484 Ffuncall (countof (args), args);
|
|
|
485 /* Has FUNCTION removed the entry? */
|
|
|
486 if (oldlen > Dynarr_length (rt->entries)
|
|
|
487 && i < Dynarr_length (rt->entries)
|
|
|
488 && (first != entry->first || last != entry->last))
|
|
|
489 goto again;
|
|
|
490 }
|
|
|
491
|
|
428
|
492 return Qnil;
|
|
|
493 }
|
|
|
494
|
|
|
495
|
|
|
496 /************************************************************************/
|
|
|
497 /* Range table read syntax */
|
|
|
498 /************************************************************************/
|
|
|
499
|
|
|
500 static int
|
|
|
501 rangetab_data_validate (Lisp_Object keyword, Lisp_Object value,
|
|
578
|
502 Error_Behavior errb)
|
|
428
|
503 {
|
|
|
504 Lisp_Object rest;
|
|
|
505
|
|
|
506 /* #### should deal with errb */
|
|
|
507 EXTERNAL_LIST_LOOP (rest, value)
|
|
|
508 {
|
|
|
509 Lisp_Object range = XCAR (rest);
|
|
|
510 rest = XCDR (rest);
|
|
|
511 if (!CONSP (rest))
|
|
563
|
512 sferror ("Invalid list format", value);
|
|
428
|
513 if (!INTP (range) && !CHARP (range)
|
|
|
514 && !(CONSP (range) && CONSP (XCDR (range))
|
|
|
515 && NILP (XCDR (XCDR (range)))
|
|
|
516 && (INTP (XCAR (range)) || CHARP (XCAR (range)))
|
|
|
517 && (INTP (XCAR (XCDR (range))) || CHARP (XCAR (XCDR (range))))))
|
|
563
|
518 sferror ("Invalid range format", range);
|
|
428
|
519 }
|
|
|
520
|
|
|
521 return 1;
|
|
|
522 }
|
|
|
523
|
|
|
524 static Lisp_Object
|
|
|
525 rangetab_instantiate (Lisp_Object data)
|
|
|
526 {
|
|
|
527 Lisp_Object rangetab = Fmake_range_table ();
|
|
|
528
|
|
|
529 if (!NILP (data))
|
|
|
530 {
|
|
|
531 data = Fcar (Fcdr (data)); /* skip over 'data keyword */
|
|
|
532 while (!NILP (data))
|
|
|
533 {
|
|
|
534 Lisp_Object range = Fcar (data);
|
|
|
535 Lisp_Object val = Fcar (Fcdr (data));
|
|
|
536
|
|
|
537 data = Fcdr (Fcdr (data));
|
|
|
538 if (CONSP (range))
|
|
|
539 Fput_range_table (Fcar (range), Fcar (Fcdr (range)), val,
|
|
|
540 rangetab);
|
|
|
541 else
|
|
|
542 Fput_range_table (range, range, val, rangetab);
|
|
|
543 }
|
|
|
544 }
|
|
|
545
|
|
|
546 return rangetab;
|
|
|
547 }
|
|
|
548
|
|
|
549
|
|
|
550 /************************************************************************/
|
|
|
551 /* Unified range tables */
|
|
|
552 /************************************************************************/
|
|
|
553
|
|
|
554 /* A "unified range table" is a format for storing range tables
|
|
|
555 as contiguous blocks of memory. This is used by the regexp
|
|
|
556 code, which needs to use range tables to properly handle []
|
|
|
557 constructs in the presence of extended characters but wants to
|
|
|
558 store an entire compiled pattern as a contiguous block of memory.
|
|
|
559
|
|
|
560 Unified range tables are designed so that they can be placed
|
|
|
561 at an arbitrary (possibly mis-aligned) place in memory.
|
|
|
562 (Dealing with alignment is a pain in the ass.)
|
|
|
563
|
|
|
564 WARNING: No provisions for garbage collection are currently made.
|
|
|
565 This means that there must not be any Lisp objects in a unified
|
|
|
566 range table that need to be marked for garbage collection.
|
|
|
567 Good candidates for objects that can go into a range table are
|
|
|
568
|
|
|
569 -- numbers and characters (do not need to be marked)
|
|
|
570 -- nil, t (marked elsewhere)
|
|
|
571 -- charsets and coding systems (automatically marked because
|
|
|
572 they are in a marked list,
|
|
|
573 and can't be removed)
|
|
|
574
|
|
|
575 Good but slightly less so:
|
|
|
576
|
|
|
577 -- symbols (could be uninterned, but that is not likely)
|
|
|
578
|
|
|
579 Somewhat less good:
|
|
|
580
|
|
|
581 -- buffers, frames, devices (could get deleted)
|
|
|
582
|
|
|
583
|
|
|
584 It is expected that you work with range tables in the normal
|
|
|
585 format and then convert to unified format when you are done
|
|
|
586 making modifications. As such, no functions are provided
|
|
|
587 for modifying a unified range table. The only operations
|
|
|
588 you can do to unified range tables are
|
|
|
589
|
|
|
590 -- look up a value
|
|
|
591 -- retrieve all the ranges in an iterative fashion
|
|
|
592
|
|
|
593 */
|
|
|
594
|
|
|
595 /* The format of a unified range table is as follows:
|
|
|
596
|
|
|
597 -- The first byte contains the number of bytes to skip to find the
|
|
|
598 actual start of the table. This deals with alignment constraints,
|
|
|
599 since the table might want to go at any arbitrary place in memory.
|
|
|
600 -- The next three bytes contain the number of bytes to skip (from the
|
|
|
601 *first* byte) to find the stuff after the table. It's stored in
|
|
|
602 little-endian format because that's how God intended things. We don't
|
|
|
603 necessarily start the stuff at the very end of the table because
|
|
|
604 we want to have at least ALIGNOF (EMACS_INT) extra space in case
|
|
|
605 we have to move the range table around. (It appears that some
|
|
|
606 architectures don't maintain alignment when reallocing.)
|
|
|
607 -- At the prescribed offset is a struct unified_range_table, containing
|
|
|
608 some number of `struct range_table_entry' entries. */
|
|
|
609
|
|
|
610 struct unified_range_table
|
|
|
611 {
|
|
|
612 int nentries;
|
|
|
613 struct range_table_entry first;
|
|
|
614 };
|
|
|
615
|
|
|
616 /* Return size in bytes needed to store the data in a range table. */
|
|
|
617
|
|
|
618 int
|
|
|
619 unified_range_table_bytes_needed (Lisp_Object rangetab)
|
|
|
620 {
|
|
|
621 return (sizeof (struct range_table_entry) *
|
|
|
622 (Dynarr_length (XRANGE_TABLE (rangetab)->entries) - 1) +
|
|
|
623 sizeof (struct unified_range_table) +
|
|
|
624 /* ALIGNOF a struct may be too big. */
|
|
|
625 /* We have four bytes for the size numbers, and an extra
|
|
|
626 four or eight bytes for making sure we get the alignment
|
|
|
627 OK. */
|
|
|
628 ALIGNOF (EMACS_INT) + 4);
|
|
|
629 }
|
|
|
630
|
|
|
631 /* Convert a range table into unified format and store in DEST,
|
|
|
632 which must be able to hold the number of bytes returned by
|
|
|
633 range_table_bytes_needed(). */
|
|
|
634
|
|
|
635 void
|
|
|
636 unified_range_table_copy_data (Lisp_Object rangetab, void *dest)
|
|
|
637 {
|
|
|
638 /* We cast to the above structure rather than just casting to
|
|
|
639 char * and adding sizeof(int), because that will lead to
|
|
|
640 mis-aligned data on the Alpha machines. */
|
|
|
641 struct unified_range_table *un;
|
|
|
642 range_table_entry_dynarr *rted = XRANGE_TABLE (rangetab)->entries;
|
|
|
643 int total_needed = unified_range_table_bytes_needed (rangetab);
|
|
826
|
644 void *new_dest = ALIGN_PTR ((char *) dest + 4, EMACS_INT);
|
|
428
|
645
|
|
|
646 * (char *) dest = (char) ((char *) new_dest - (char *) dest);
|
|
|
647 * ((unsigned char *) dest + 1) = total_needed & 0xFF;
|
|
|
648 total_needed >>= 8;
|
|
|
649 * ((unsigned char *) dest + 2) = total_needed & 0xFF;
|
|
|
650 total_needed >>= 8;
|
|
|
651 * ((unsigned char *) dest + 3) = total_needed & 0xFF;
|
|
|
652 un = (struct unified_range_table *) new_dest;
|
|
|
653 un->nentries = Dynarr_length (rted);
|
|
|
654 memcpy (&un->first, Dynarr_atp (rted, 0),
|
|
|
655 sizeof (struct range_table_entry) * Dynarr_length (rted));
|
|
|
656 }
|
|
|
657
|
|
|
658 /* Return number of bytes actually used by a unified range table. */
|
|
|
659
|
|
|
660 int
|
|
|
661 unified_range_table_bytes_used (void *unrangetab)
|
|
|
662 {
|
|
|
663 return ((* ((unsigned char *) unrangetab + 1))
|
|
|
664 + ((* ((unsigned char *) unrangetab + 2)) << 8)
|
|
|
665 + ((* ((unsigned char *) unrangetab + 3)) << 16));
|
|
|
666 }
|
|
|
667
|
|
|
668 /* Make sure the table is aligned, and move it around if it's not. */
|
|
|
669 static void
|
|
|
670 align_the_damn_table (void *unrangetab)
|
|
|
671 {
|
|
|
672 void *cur_dest = (char *) unrangetab + * (char *) unrangetab;
|
|
826
|
673 if (cur_dest != ALIGN_PTR (cur_dest, EMACS_INT))
|
|
428
|
674 {
|
|
|
675 int count = (unified_range_table_bytes_used (unrangetab) - 4
|
|
|
676 - ALIGNOF (EMACS_INT));
|
|
|
677 /* Find the proper location, just like above. */
|
|
826
|
678 void *new_dest = ALIGN_PTR ((char *) unrangetab + 4, EMACS_INT);
|
|
428
|
679 /* memmove() works in the presence of overlapping data. */
|
|
|
680 memmove (new_dest, cur_dest, count);
|
|
|
681 * (char *) unrangetab = (char) ((char *) new_dest - (char *) unrangetab);
|
|
|
682 }
|
|
|
683 }
|
|
|
684
|
|
|
685 /* Look up a value in a unified range table. */
|
|
|
686
|
|
|
687 Lisp_Object
|
|
|
688 unified_range_table_lookup (void *unrangetab, EMACS_INT pos,
|
|
|
689 Lisp_Object default_)
|
|
|
690 {
|
|
|
691 void *new_dest;
|
|
|
692 struct unified_range_table *un;
|
|
|
693
|
|
|
694 align_the_damn_table (unrangetab);
|
|
|
695 new_dest = (char *) unrangetab + * (char *) unrangetab;
|
|
|
696 un = (struct unified_range_table *) new_dest;
|
|
|
697
|
|
|
698 return get_range_table (pos, un->nentries, &un->first, default_);
|
|
|
699 }
|
|
|
700
|
|
|
701 /* Return number of entries in a unified range table. */
|
|
|
702
|
|
|
703 int
|
|
|
704 unified_range_table_nentries (void *unrangetab)
|
|
|
705 {
|
|
|
706 void *new_dest;
|
|
|
707 struct unified_range_table *un;
|
|
|
708
|
|
|
709 align_the_damn_table (unrangetab);
|
|
|
710 new_dest = (char *) unrangetab + * (char *) unrangetab;
|
|
|
711 un = (struct unified_range_table *) new_dest;
|
|
|
712 return un->nentries;
|
|
|
713 }
|
|
|
714
|
|
|
715 /* Return the OFFSETth range (counting from 0) in UNRANGETAB. */
|
|
|
716 void
|
|
|
717 unified_range_table_get_range (void *unrangetab, int offset,
|
|
|
718 EMACS_INT *min, EMACS_INT *max,
|
|
|
719 Lisp_Object *val)
|
|
|
720 {
|
|
|
721 void *new_dest;
|
|
|
722 struct unified_range_table *un;
|
|
|
723 struct range_table_entry *tab;
|
|
|
724
|
|
|
725 align_the_damn_table (unrangetab);
|
|
|
726 new_dest = (char *) unrangetab + * (char *) unrangetab;
|
|
|
727 un = (struct unified_range_table *) new_dest;
|
|
|
728
|
|
|
729 assert (offset >= 0 && offset < un->nentries);
|
|
|
730 tab = (&un->first) + offset;
|
|
|
731 *min = tab->first;
|
|
|
732 *max = tab->last;
|
|
|
733 *val = tab->val;
|
|
|
734 }
|
|
|
735
|
|
|
736
|
|
|
737 /************************************************************************/
|
|
|
738 /* Initialization */
|
|
|
739 /************************************************************************/
|
|
|
740
|
|
|
741 void
|
|
|
742 syms_of_rangetab (void)
|
|
|
743 {
|
|
442
|
744 INIT_LRECORD_IMPLEMENTATION (range_table);
|
|
|
745
|
|
563
|
746 DEFSYMBOL_MULTIWORD_PREDICATE (Qrange_tablep);
|
|
|
747 DEFSYMBOL (Qrange_table);
|
|
428
|
748
|
|
|
749 DEFSUBR (Frange_table_p);
|
|
|
750 DEFSUBR (Fmake_range_table);
|
|
|
751 DEFSUBR (Fcopy_range_table);
|
|
|
752 DEFSUBR (Fget_range_table);
|
|
|
753 DEFSUBR (Fput_range_table);
|
|
|
754 DEFSUBR (Fremove_range_table);
|
|
|
755 DEFSUBR (Fclear_range_table);
|
|
|
756 DEFSUBR (Fmap_range_table);
|
|
|
757 }
|
|
|
758
|
|
|
759 void
|
|
|
760 structure_type_create_rangetab (void)
|
|
|
761 {
|
|
|
762 struct structure_type *st;
|
|
|
763
|
|
|
764 st = define_structure_type (Qrange_table, 0, rangetab_instantiate);
|
|
|
765
|
|
|
766 define_structure_type_keyword (st, Qdata, rangetab_data_validate);
|
|
|
767 }
|
