Correctly disassemble method functions.
[sbcl.git] / src / runtime / vars.c
blob62a4fb2e387eb13bb2fb5d16948d203e9799f8ad
1 /*
2 * This software is part of the SBCL system. See the README file for
3 * more information.
5 * This software is derived from the CMU CL system, which was
6 * written at Carnegie Mellon University and released into the
7 * public domain. The software is in the public domain and is
8 * provided with absolutely no warranty. See the COPYING and CREDITS
9 * files for more information.
12 #include <stdio.h>
13 #include <string.h>
14 #include <sys/types.h>
15 #include <stdlib.h>
17 #include "genesis/sbcl.h"
18 #include "runtime.h"
19 #include "vars.h"
20 #include "os.h"
22 #define NAME_BUCKETS 31
23 #define OBJ_BUCKETS 31
25 static struct var *NameHash[NAME_BUCKETS], *ObjHash[OBJ_BUCKETS];
26 static int tempcntr = 1;
28 struct var {
29 lispobj obj;
30 lispobj (*update_fn)(struct var *var);
31 char *name;
32 sword_t clock;
33 bool map_back, permanent;
35 struct var *nnext; /* Next in name list */
36 struct var *onext; /* Next in object list */
39 static int hash_name(char *name)
41 uword_t value = 0;
43 while (*name != '\0') {
44 value = (value << 1) ^ *(unsigned char *)(name++);
45 value = (value & (1-(1<<24))) ^ (value >> 24);
48 return value % NAME_BUCKETS;
51 static int hash_obj(lispobj obj)
53 return (uword_t)obj % OBJ_BUCKETS;
56 void flush_vars()
58 int index;
59 struct var *var, *next, *perm = NULL;
61 /* Note: all vars in the object hash table also appear in the name hash
62 * table, so if we free everything in the name hash table, we free
63 * everything in the object hash table. */
65 for (index = 0; index < NAME_BUCKETS; index++)
66 for (var = NameHash[index]; var != NULL; var = next) {
67 next = var->nnext;
68 if (var->permanent) {
69 var->nnext = perm;
70 perm = var;
72 else {
73 free(var->name);
74 free(var);
77 memset(NameHash, 0, sizeof(NameHash));
78 memset(ObjHash, 0, sizeof(ObjHash));
79 tempcntr = 1;
81 for (var = perm; var != NULL; var = next) {
82 next = var->nnext;
83 index = hash_name(var->name);
84 var->nnext = NameHash[index];
85 NameHash[index] = var;
86 if (var->map_back) {
87 index = hash_obj(var->obj);
88 var->onext = ObjHash[index];
89 ObjHash[index] = var;
94 struct var *lookup_by_name(char *name)
96 struct var *var;
98 for (var = NameHash[hash_name(name)]; var != NULL; var = var->nnext)
99 if (strcmp(var->name, name) == 0)
100 return var;
101 return NULL;
104 struct var *lookup_by_obj(lispobj obj)
106 struct var *var;
108 for (var = ObjHash[hash_obj(obj)]; var != NULL; var = var->onext)
109 if (var->obj == obj)
110 return var;
111 return NULL;
114 static struct var *make_var(char *name, bool perm)
116 struct var *var = (struct var *)malloc(sizeof(struct var));
117 char buffer[256];
118 int index;
120 if (name == NULL) {
121 sprintf(buffer, "%d", tempcntr++);
122 name = buffer;
124 var->name = (char *)malloc(strlen(name)+1);
125 strcpy(var->name, name);
126 var->clock = 0;
127 var->permanent = perm;
128 var->map_back = 0;
130 index = hash_name(name);
131 var->nnext = NameHash[index];
132 NameHash[index] = var;
134 return var;
137 struct var *define_var(char *name, lispobj obj, bool perm)
139 struct var *var = make_var(name, perm);
140 int index;
142 var->obj = obj;
143 var->update_fn = NULL;
145 if (lookup_by_obj(obj) == NULL) {
146 var->map_back = 1;
147 index = hash_obj(obj);
148 var->onext = ObjHash[index];
149 ObjHash[index] = var;
152 return var;
155 char *var_name(struct var *var)
157 return var->name;
160 lispobj var_value(struct var *var)
162 if (var->update_fn != NULL)
163 var->obj = (*var->update_fn)(var);
164 return var->obj;
167 sword_t var_clock(struct var *var)
169 return var->clock;
172 void var_setclock(struct var *var, sword_t val)
174 var->clock = val;