2 * Copyright (c) 2000 Doug Rabson
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * Forward declarations
35 typedef struct kobj *kobj_t;
36 typedef struct kobj_class *kobj_class_t;
37 typedef struct kobj_method kobj_method_t;
38 typedef int (*kobjop_t)(void);
39 typedef struct kobj_ops *kobj_ops_t;
40 typedef struct kobjop_desc *kobjop_desc_t;
49 * A class is simply a method table and a sizeof value. When the first
50 * instance of the class is created, the method table will be compiled
51 * into a form more suited to efficient method dispatch. This compiled
52 * method table is always the first field of the object.
54 #define KOBJ_CLASS_FIELDS \
55 const char *name; /* class name */ \
56 kobj_method_t *methods; /* method table */ \
57 size_t size; /* object size */ \
58 u_int refs; /* reference count */ \
59 kobj_ops_t ops /* compiled method table */
66 * Implementation of kobj.
76 * The ops table is used as a cache of results from kobj_lookup_method().
79 #define KOBJ_CACHE_SIZE 256
82 kobj_method_t cache[KOBJ_CACHE_SIZE];
87 unsigned int id; /* unique ID */
88 kobjop_t deflt; /* default implementation */
92 * Shorthand for constructing method tables.
94 #define KOBJMETHOD(NAME, FUNC) { &NAME##_desc, (kobjop_t) FUNC }
96 #define DEFINE_CLASS(name, methods, size) \
98 struct kobj_class name ## _class = { \
99 #name, methods, size \
103 * Compile the method table in a class.
105 void kobj_class_compile(kobj_class_t cls);
108 * Compile the method table, with the caller providing the space for
109 * the ops table.(for use before malloc is initialised).
111 void kobj_class_compile_static(kobj_class_t cls, kobj_ops_t ops);
114 * Free the compiled method table in a class.
116 void kobj_class_free(kobj_class_t cls);
119 * Allocate memory for and initialise a new object.
121 kobj_t kobj_create(kobj_class_t cls,
122 struct malloc_type *mtype,
126 * Initialise a pre-allocated object.
128 void kobj_init(kobj_t obj, kobj_class_t cls);
131 * Delete an object. If mtype is non-zero, free the memory.
133 void kobj_delete(kobj_t obj, struct malloc_type *mtype);
136 * Maintain stats on hits/misses in lookup caches.
139 extern int kobj_lookup_hits;
140 extern int kobj_lookup_misses;
141 #define KOBJOPHIT do { kobj_lookup_hits++; } while (0)
142 #define KOBJOPMISS do { kobj_lookup_misses++; } while (0)
144 #define KOBJOPHIT do { } while (0)
145 #define KOBJOPMISS do { } while (0)
149 * Lookup the method in the cache and if it isn't there look it up the
152 #define KOBJOPLOOKUP(OPS,OP) do { \
153 kobjop_desc_t _desc = &OP##_##desc; \
154 kobj_method_t *_ce = \
155 &OPS->cache[_desc->id & (KOBJ_CACHE_SIZE-1)]; \
156 if (_ce->desc != _desc) { \
158 kobj_lookup_method(OPS->cls->methods, _ce, _desc); \
165 void kobj_lookup_method(kobj_method_t *methods,
169 #endif /* !_SYS_KOBJ_H_ */