1 /*
2 * calls.c - implements a call to lots of procedures.
3 *
4 * Copyright (c) 1997 Phil Maker
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 *
28 * Id: calls.c,v 1.1.1.1 1997/11/23 11:45:50 pjm Exp
29 */
30
31 #include <nana_error.h>
32 #include <stdlib.h>
33
34 #include <calls.h>
35
calls_add(CALL ** head,FUNC fp,void * arg)36 void calls_add(CALL **head, FUNC fp, void *arg) {
37 CALL *p;
38
39 if((p = ((CALL *)malloc(sizeof(CALL)))) != 0) {
40 p->func = fp;
41 p->arg = arg;
42 p->next = *head;
43 *head = p;
44 } else { /* malloc failed - uhm */
45 nana_error("calls_add: out of memory");
46 }
47 }
48
calls_exec(CALL ** head,FUNC fp,void * arg)49 void calls_exec(CALL **head, FUNC fp, void *arg) {
50 CALL *p;
51
52 for(p = *head; p != 0; p = p->next) {
53 if(((fp == 0) || (fp == p->func)) &&
54 ((arg == 0) || (arg == p->arg))) {
55 (*(p->func))(p->arg);
56 }
57 }
58 }
59
calls_delete(CALL ** head,FUNC fp,void * arg)60 void calls_delete(CALL **head, FUNC fp, void *arg) {
61 CALL *p, *q, *prev;
62
63 p = *head;
64 prev = 0;
65 while(p != 0) {
66 if(((fp == 0) || (fp == p->func)) &&
67 ((arg == 0) || (arg == p->arg))) { /* p should be deleted */
68 if(prev != 0) { /* we have a defined predecessor (not the first node) */
69 prev->next = p->next; /* relink over p */
70 q = p; /* save p away so we can free it later */
71 p = p->next;
72 /* prev = prev; */
73 free(q);
74 } else { /* first item in the list */
75 q = p;
76 *head = p->next;
77 p = p->next;
78 /* prev = prev; */
79 free(q);
80 }
81 } else { /* p should NOT be deleted */
82 prev = p;
83 p = p->next;
84 }
85 }
86 }
87
88
89