Mercurial > hg > xemacs-beta
annotate src/blocktype.c @ 5327:d1b17a33450b
Move the heavy lifting from cl-seq.el to C.
src/ChangeLog addition:
2010-12-30 Aidan Kehoe <kehoea@parhasard.net>
Move the heavy lifting from cl-seq.el to C, finally making those
functions first-class XEmacs citizens, with circularity checking,
built-in support for tests other than #'eql, and as much
compatibility with current Common Lisp as Paul Dietz' tests require.
* fns.c (check_eq_nokey, check_eq_key, check_eql_nokey)
(check_eql_key, check_equal_nokey, check_equal_key)
(check_equalp_nokey, check_equalp_key, check_string_match_nokey)
(check_string_match_key, check_other_nokey, check_other_key)
(check_if_nokey, check_if_key, check_match_eq_key)
(check_match_eql_key, check_match_equal_key)
(check_match_equalp_key, check_match_other_key): New. These are
basically to provide function pointers to be used by Lisp
functions that take TEST, TEST-NOT and KEY arguments.
(get_check_match_function_1, get_check_test_function)
(get_check_match_function): These functions work out which of the
previous list of functions to use, given the keywords supplied by
the user.
(count_with_tail): New. This is the bones of #'count.
(list_count_from_end, string_count_from_end): Utility functions
for #'count.
(Fcount): New, moved from cl-seq.el.
(list_position_cons_before): New. The implementation of #'member*,
and important in implementing various other functions.
(FmemberX, Fadjoin, FassocX, FrassocX, Fposition, Ffind)
(FdeleteX, FremoveX, Fdelete_duplicates, Fremove_duplicates)
(Fnsubstitute, Fsubstitute, Fsublis, Fnsublis, Fsubst, Fnsubst)
(Ftree_equal, Fmismatch, Fsearch, Fintersection, Fnintersection)
(Fsubsetp, Fset_difference, Fnset_difference, Fnunion, Funion)
(Fset_exclusive_or, Fnset_exclusive_or): New, moved here from
cl-seq.el.
(position): New. The implementation of #'find and #'position.
(list_delete_duplicates_from_end, subst, sublis, nsublis)
(tree_equal, mismatch_from_end, mismatch_list_list)
(mismatch_list_string, mismatch_list_array)
(mismatch_string_array, mismatch_string_string)
(mismatch_array_array, get_mismatch_func): Helper C functions for
the Lisp-visible functions.
(venn, nvenn): New. The implementation of the main Lisp functions that
treat lists as sets.
lisp/ChangeLog addition:
2010-12-30 Aidan Kehoe <kehoea@parhasard.net>
* cl-seq.el:
Move the heavy lifting from this file to C. Dump the
cl-parsing-keywords macro, but don't use defun* for the functions
we define that do take keywords, dynamic scope lossage makes that
not practical.
* subr.el (sort, fillarray): Move these aliases here.
(map-plist): #'nsublis is now built-in, but at this point #'eql
isn't necessarily available as a test; use #'eq.
* obsolete.el (cl-delete-duplicates): Make this available for old
compiler macros and old code.
(memql): Document that this is equivalent to #'member*, and worse.
* cl.el (adjoin, subst): Removed. These are in C.
author | Aidan Kehoe <kehoea@parhasard.net> |
---|---|
date | Thu, 30 Dec 2010 01:59:52 +0000 |
parents | fdefd0186b75 |
children | 308d34e9f07d |
rev | line source |
---|---|
428 | 1 /* Fixed-size block allocator. |
2 Copyright (C) 1994 Free Software Foundation, Inc. | |
3 | |
4 This file is part of XEmacs. | |
5 | |
6 XEmacs is free software; you can redistribute it and/or modify it | |
7 under the terms of the GNU General Public License as published by the | |
8 Free Software Foundation; either version 2, or (at your option) any | |
9 later version. | |
10 | |
11 XEmacs is distributed in the hope that it will be useful, but WITHOUT | |
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
14 for more details. | |
15 | |
16 You should have received a copy of the GNU General Public License | |
17 along with XEmacs; see the file COPYING. If not, write to | |
18 the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
19 Boston, MA 02111-1307, USA. | |
20 */ | |
21 | |
22 /* Synched up with: Not in FSF. */ | |
23 | |
24 /* Authorship: | |
25 | |
26 Ben Wing: December 1994, for 19.12. | |
27 */ | |
28 | |
29 /* | |
30 | |
31 ------------------------------------------------------------------------------ | |
32 | |
33 A "block-type object" is used to efficiently allocate and free blocks | |
34 of a particular size. Freed blocks are remembered in a free list and | |
35 are reused as necessary to allocate new blocks, so as to avoid as | |
36 much as possible making calls to malloc() and free(). | |
37 | |
38 This is a container object. Declare a block-type object of a specific type | |
39 as follows: | |
40 | |
41 struct mytype_blocktype { | |
42 Blocktype_declare (mytype); | |
43 }; | |
44 | |
45 Use the following functions/macros: | |
46 | |
47 structype *Blocktype_new(structype) | |
48 [MACRO] Create a new block-type object of the specified type. | |
49 The argument to this call should be the type of object to be | |
50 created, e.g. foobar_blocktype. | |
51 type *Blocktype_alloc(b) | |
52 [MACRO] Allocate a block of the proper type for the specified | |
53 block-type object and return a pointer to it. | |
54 Blocktype_free(b, block) | |
55 Free a block of the type corresponding to the specified block-type | |
56 object. | |
57 Blocktype_delete(b) | |
58 Destroy a block-type object and the memory allocated to it. | |
59 | |
60 */ | |
61 | |
62 /* This file has been Mule-ized. */ | |
63 | |
64 #include <config.h> | |
65 #include "lisp.h" | |
66 | |
67 #include "blocktype.h" | |
68 | |
69 typedef struct blocktype | |
70 { | |
71 Blocktype_declare (void); | |
72 } Blocktype; | |
73 | |
74 struct block_internal | |
75 { | |
76 void *next; | |
77 }; | |
78 | |
79 void * | |
665 | 80 Blocktype_newf (Bytecount elsize) |
428 | 81 { |
82 Blocktype *b = xnew (Blocktype); | |
665 | 83 b->elsize = max (elsize, (Bytecount) sizeof (void *)); |
428 | 84 b->free = 0; |
85 return (void *) b; | |
86 } | |
87 | |
88 void | |
89 Blocktype_allocf (void *bbb) | |
90 { | |
91 Blocktype *b = (Blocktype *) bbb; | |
92 if (b->free) | |
93 { | |
94 b->tempel = b->free; | |
95 b->free = ((struct block_internal *) (b->free))->next; | |
96 } | |
97 else | |
98 b->tempel = (void *) xmalloc (b->elsize); | |
99 } | |
100 | |
101 void | |
102 Blocktype_free (void *bbb, void *el) | |
103 { | |
104 Blocktype *b = (Blocktype *) bbb; | |
105 ((struct block_internal *) el)->next = b->free; | |
106 b->free = el; | |
107 } |