File: obj.c

package info (click to toggle)
notion 4.0.2%2Bdfsg-5
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 4,676 kB
  • sloc: ansic: 47,508; sh: 2,096; makefile: 603; perl: 270
file content (297 lines) | stat: -rw-r--r-- 5,168 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
/*
 * libtu/obj.c
 *
 * Copyright (c) Tuomo Valkonen 1999-2004.
 *
 * You may distribute and modify this library under the terms of either
 * the Clarified Artistic License or the GNU LGPL, version 2.1 or later.
 */

#include <string.h>

#include "types.h"
#include "obj.h"
#include "objp.h"
#include "misc.h"
#include "dlist.h"


ClassDescr CLASSDESCR(Obj)={"Obj", NULL, 0, NULL, NULL};


static void do_watches(Obj *obj, bool call);


/*{{{ Destroy */


void destroy_obj(Obj *obj)
{
    ClassDescr *d;

    if(OBJ_IS_BEING_DESTROYED(obj))
        return;

    obj->flags|=OBJ_DEST;

    do_watches(obj, TRUE);

    d=obj->obj_type;

    while(d!=NULL){
        if(d->destroy_fn!=NULL){
            d->destroy_fn(obj);
            break;
        }
        d=d->ancestor;
    }

    do_watches(obj, FALSE);

    free(obj);
}


/*}}}*/


/*{{{ is/cast */


bool obj_is(const Obj *obj, const ClassDescr *descr)
{
    ClassDescr *d;

    if(obj==NULL)
        return FALSE;

    d=obj->obj_type;

    while(d!=NULL){
        if(d==descr)
            return TRUE;
        d=d->ancestor;
    }
    return FALSE;
}


bool obj_is_str(const Obj *obj, const char *str)
{
    ClassDescr *d;

    if(obj==NULL || str==NULL)
        return FALSE;

    d=obj->obj_type;

    while(d!=NULL){
        if(strcmp(d->name, str)==0)
            return TRUE;
        d=d->ancestor;
    }
    return FALSE;
}


const void *obj_cast(const Obj *obj, const ClassDescr *descr)
{
    ClassDescr *d;

    if(obj==NULL)
        return NULL;

    d=obj->obj_type;

    while(d!=NULL){
        if(d==descr)
            return (void*)obj;
        d=d->ancestor;
    }
    return NULL;
}


/*}}}*/


/*{{{ Dynamic functions */


/* This function is called when no handler is found.
 */
static void dummy_dyn()
{
}


static int comp_fun(const void *a, const void *b)
{
    void *af=(void*)((DynFunTab*)a)->func;
    void *bf=(void*)((DynFunTab*)b)->func;

    return (af<bf ? -1 : (af==bf ? 0 : 1));
}


DynFun *lookup_dynfun(const Obj *obj, DynFun *func,
                      bool *funnotfound)
{
    ClassDescr *descr;
    DynFunTab *df;
    /*DynFunTab dummy={NULL, NULL};*/
    /*dummy.func=func;*/

    if(obj==NULL)
        return NULL;

    descr=obj->obj_type;

    for(; descr!=&Obj_classdescr; descr=descr->ancestor){
        if(descr->funtab==NULL)
            continue;

        if(descr->funtab_n==-1){
            /* Need to sort the table. */
            descr->funtab_n=0;
            df=descr->funtab;
            while(df->func!=NULL){
                descr->funtab_n++;
                df++;
            }

            if(descr->funtab_n>0){
                qsort(descr->funtab, descr->funtab_n, sizeof(DynFunTab),
                      comp_fun);
            }
        }

        /*
        if(descr->funtab_n==0)
            continue;

        df=(DynFunTab*)bsearch(&dummy, descr->funtab, descr->funtab_n,
                               sizeof(DynFunTab), comp_fun);
        if(df!=NULL){
            *funnotfound=FALSE;
            return df->handler;
        }
        */

        /* Using custom bsearch instead of the one in libc is probably
         * faster as the overhead of calling a comparison function would
         * be significant given that the comparisons are simple and
         * funtab_n not that big.
         */
        {
            int min=0, max=descr->funtab_n-1;
            int ndx;
            df=descr->funtab;
            while(max>=min){
                ndx=(max+min)/2;
                if((void*)df[ndx].func==(void*)func){
                    *funnotfound=FALSE;
                    return df[ndx].handler;
                }
                if((void*)df[ndx].func<(void*)func)
                    min=ndx+1;
                else
                    max=ndx-1;
            }
        }
    }

    *funnotfound=TRUE;
    return dummy_dyn;
}


bool has_dynfun(const Obj *obj, DynFun *func)
{
    bool funnotfound;
    lookup_dynfun(obj, func, &funnotfound);
    return !funnotfound;
}


/*}}}*/


/*{{{ Watches */


bool watch_setup(Watch *watch, Obj *obj, WatchHandler *handler)
{
    if(OBJ_IS_BEING_DESTROYED(obj))
        return FALSE;

    watch_reset(watch);

    watch->handler=handler;
    LINK_ITEM(obj->obj_watches, watch, next, prev);
    watch->obj=obj;

    return TRUE;
}

void do_watch_reset(Watch *watch, bool call)
{
    WatchHandler *handler=watch->handler;
    Obj *obj=watch->obj;

    watch->handler=NULL;

    if(obj==NULL)
        return;

    UNLINK_ITEM(obj->obj_watches, watch, next, prev);
    watch->obj=NULL;

    if(call && handler!=NULL)
        handler(watch, obj);
}


void watch_reset(Watch *watch)
{
    do_watch_reset(watch, FALSE);
}


bool watch_ok(Watch *watch)
{
    return watch->obj!=NULL;
}


static void do_watches(Obj *obj, bool call)
{
    Watch *watch, *next;

    watch=obj->obj_watches;

    while(watch!=NULL){
        next=watch->next;
        do_watch_reset(watch, call);
        watch=next;
    }
}


void watch_call(Obj *obj)
{
    do_watches(obj, FALSE);
}


void watch_init(Watch *watch)
{
    watch->obj=NULL;
    watch->next=NULL;
    watch->prev=NULL;
    watch->handler=NULL;
}


/*}}}*/