Simon Brooke
e41ae1aa8b
about how to implement namespaces. There are probably regressions in this, but progress nevertheless!
70 lines
2.7 KiB
C
70 lines
2.7 KiB
C
/*
|
|
* intern.h
|
|
*
|
|
* For now this implements an oblist and shallow binding; local environments can
|
|
* be consed onto the front of the oblist. Later, this won't do; bindings will happen
|
|
* in namespaces, which will probably be implemented as hash tables.
|
|
*
|
|
* Doctrine is that cons cells are immutable, and life is a lot more simple if they are;
|
|
* so when a symbol is rebound in the master oblist, what in fact we do is construct
|
|
* a new oblist without the previous binding but with the new binding. Anything which,
|
|
* prior to this action, held a pointer to the old oblist (as all current threads'
|
|
* environments must do) continues to hold a pointer to the old oblist, and consequently
|
|
* doesn't see the change. This is probably good but does mean you cannot use bindings
|
|
* on the oblist to signal between threads.
|
|
*
|
|
* (c) 2017 Simon Brooke <simon@journeyman.cc>
|
|
* Licensed under GPL version 2.0, or, at your option, any later version.
|
|
*/
|
|
|
|
#ifndef __intern_h
|
|
#define __intern_h
|
|
|
|
extern struct cons_pointer oblist;
|
|
|
|
uint32_t get_hash( struct cons_pointer ptr );
|
|
|
|
void free_hashmap( struct cons_pointer ptr );
|
|
|
|
void dump_map( URL_FILE * output, struct cons_pointer pointer );
|
|
|
|
struct cons_pointer hashmap_get( struct cons_pointer mapp,
|
|
struct cons_pointer key );
|
|
|
|
struct cons_pointer hashmap_put( struct cons_pointer mapp,
|
|
struct cons_pointer key,
|
|
struct cons_pointer val );
|
|
|
|
struct cons_pointer hashmap_put_all( struct cons_pointer mapp,
|
|
struct cons_pointer assoc );
|
|
|
|
struct cons_pointer hashmap_keys( struct cons_pointer map );
|
|
|
|
struct cons_pointer make_hashmap( uint32_t n_buckets,
|
|
struct cons_pointer hash_fn,
|
|
struct cons_pointer write_acl );
|
|
|
|
struct cons_pointer c_assoc( struct cons_pointer key,
|
|
struct cons_pointer store );
|
|
|
|
struct cons_pointer internedp( struct cons_pointer key,
|
|
struct cons_pointer environment );
|
|
|
|
struct cons_pointer hashmap_get( struct cons_pointer mapp,
|
|
struct cons_pointer key );
|
|
|
|
struct cons_pointer hashmap_put( struct cons_pointer mapp,
|
|
struct cons_pointer key,
|
|
struct cons_pointer val );
|
|
|
|
struct cons_pointer set( struct cons_pointer key,
|
|
struct cons_pointer value,
|
|
struct cons_pointer store );
|
|
|
|
struct cons_pointer deep_bind( struct cons_pointer key,
|
|
struct cons_pointer value );
|
|
|
|
struct cons_pointer intern( struct cons_pointer key,
|
|
struct cons_pointer environment );
|
|
|
|
#endif
|