Subversion Repositories tendra.SVN

Rev

Rev 5 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 5 Rev 6
Line -... Line 1...
-
 
1
/*
-
 
2
 * Copyright (c) 2002-2005 The TenDRA Project <http://www.tendra.org/>.
-
 
3
 * All rights reserved.
-
 
4
 *
-
 
5
 * Redistribution and use in source and binary forms, with or without
-
 
6
 * modification, are permitted provided that the following conditions are met:
-
 
7
 *
-
 
8
 * 1. Redistributions of source code must retain the above copyright notice,
-
 
9
 *    this list of conditions and the following disclaimer.
-
 
10
 * 2. Redistributions in binary form must reproduce the above copyright notice,
-
 
11
 *    this list of conditions and the following disclaimer in the documentation
-
 
12
 *    and/or other materials provided with the distribution.
-
 
13
 * 3. Neither the name of The TenDRA Project nor the names of its contributors
-
 
14
 *    may be used to endorse or promote products derived from this software
-
 
15
 *    without specific, prior written permission.
-
 
16
 *
-
 
17
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
-
 
18
 * IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
-
 
19
 * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-
 
20
 * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR
-
 
21
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-
 
22
 * EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-
 
23
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
-
 
24
 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-
 
25
 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
-
 
26
 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
-
 
27
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
 
28
 *
-
 
29
 * $Id$
-
 
30
 */
1
/*
31
/*
2
    		 Crown Copyright (c) 1997
32
    		 Crown Copyright (c) 1997
3
    
33
 
4
    This TenDRA(r) Computer Program is subject to Copyright
34
    This TenDRA(r) Computer Program is subject to Copyright
5
    owned by the United Kingdom Secretary of State for Defence
35
    owned by the United Kingdom Secretary of State for Defence
6
    acting through the Defence Evaluation and Research Agency
36
    acting through the Defence Evaluation and Research Agency
7
    (DERA).  It is made available to Recipients with a
37
    (DERA).  It is made available to Recipients with a
8
    royalty-free licence for its use, reproduction, transfer
38
    royalty-free licence for its use, reproduction, transfer
9
    to other parties and amendment for any purpose not excluding
39
    to other parties and amendment for any purpose not excluding
10
    product development provided that any such use et cetera
40
    product development provided that any such use et cetera
11
    shall be deemed to be acceptance of the following conditions:-
41
    shall be deemed to be acceptance of the following conditions:-
12
    
42
 
13
        (1) Its Recipients shall ensure that this Notice is
43
        (1) Its Recipients shall ensure that this Notice is
14
        reproduced upon any copies or amended versions of it;
44
        reproduced upon any copies or amended versions of it;
15
    
45
 
16
        (2) Any amended version of it shall be clearly marked to
46
        (2) Any amended version of it shall be clearly marked to
17
        show both the nature of and the organisation responsible
47
        show both the nature of and the organisation responsible
18
        for the relevant amendment or amendments;
48
        for the relevant amendment or amendments;
19
    
49
 
20
        (3) Its onward transfer from a recipient to another
50
        (3) Its onward transfer from a recipient to another
21
        party shall be deemed to be that party's acceptance of
51
        party shall be deemed to be that party's acceptance of
22
        these conditions;
52
        these conditions;
23
    
53
 
24
        (4) DERA gives no warranty or assurance as to its
54
        (4) DERA gives no warranty or assurance as to its
25
        quality or suitability for any purpose and DERA accepts
55
        quality or suitability for any purpose and DERA accepts
26
        no liability whatsoever in relation to any use to which
56
        no liability whatsoever in relation to any use to which
27
        it may be put.
57
        it may be put.
28
*/
58
*/
29
 
59
 
30
 
60
 
31
/*** action.c --- Action ADT.
61
/*** action.c --- Action ADT.
32
 *
62
 *
33
 ** Author: Steve Folkes <smf@hermes.mod.uk>
63
 ** Author: Steve Folkes <smf@hermes.mod.uk>
34
 *
64
 *
35
 *** Commentary:
65
 *** Commentary:
36
 *
66
 *
37
 * This file implements the action manipulation routines.
67
 * This file implements the action manipulation routines.
38
 *
68
 *
39
 *** Change Log:
69
 *** Change Log:
Line 57... Line 87...
57
#include "name.h"
87
#include "name.h"
58
#include "rule.h"
88
#include "rule.h"
59
#include "type.h"
89
#include "type.h"
60
 
90
 
61
/*--------------------------------------------------------------------------*/
91
/*--------------------------------------------------------------------------*/
-
 
92
 
-
 
93
#if FS_WEAK_PROTOTYPES
-
 
94
#pragma TenDRA keyword KW_WEAK_PROTOTYPE for weak
-
 
95
#else
-
 
96
#define KW_WEAK_PROTOTYPE
-
 
97
#endif
62
 
98
 
63
ActionP
99
ActionP
64
action_create PROTO_Z ()
100
action_create(void)
65
{
101
{
66
    ActionP action = ALLOCATE (ActionT);
102
    ActionP action = ALLOCATE(ActionT);
67
 
103
 
68
    types_init (action_param (action));
104
    types_init(action_param(action));
69
    types_init (action_result (action));
105
    types_init(action_result(action));
70
    action->code = NIL (GenericP);
106
    action->code = NIL(GenericP);
71
    return (action);
107
    return(action);
72
}
108
}
73
 
109
 
74
#ifdef FS_FAST
110
#ifdef FS_FAST
75
#undef action_param
111
#undef action_param
76
#endif /* defined (FS_FAST) */
112
#endif /* defined (FS_FAST) */
77
TypeTupleP
113
TypeTupleP
78
action_param PROTO_N ((action))
114
action_param(ActionP action)
79
	     PROTO_T (ActionP action)
-
 
80
{
115
{
81
    return (&(action->param));
116
    return(&(action->param));
82
}
117
}
83
#ifdef FS_FAST
118
#ifdef FS_FAST
84
#define action_param(a) (&((a)->param))
119
#define action_param(a)	(&((a)->param))
85
#endif /* defined (FS_FAST) */
120
#endif /* defined (FS_FAST) */
86
 
121
 
87
#ifdef FS_FAST
122
#ifdef FS_FAST
88
#undef action_result
123
#undef action_result
89
#endif /* defined (FS_FAST) */
124
#endif /* defined (FS_FAST) */
90
TypeTupleP
125
TypeTupleP
91
action_result PROTO_N ((action))
126
action_result(ActionP action)
92
	      PROTO_T (ActionP action)
-
 
93
{
127
{
94
    return (&(action->result));
128
    return(&(action->result));
95
}
129
}
96
#ifdef FS_FAST
130
#ifdef FS_FAST
97
#define action_result(a) (&((a)->result))
131
#define action_result(a)	(&((a)->result))
98
#endif /* defined (FS_FAST) */
132
#endif /* defined (FS_FAST) */
99
 
133
 
100
#ifdef FS_FAST
134
#ifdef FS_FAST
101
#undef action_get_code
135
#undef action_get_code
102
#endif /* defined (FS_FAST) */
136
#endif /* defined (FS_FAST) */
103
GenericP
137
GenericP
104
action_get_code PROTO_N ((action))
138
action_get_code(ActionP action)
105
		PROTO_T (ActionP action)
-
 
106
{
139
{
107
    return (action->code);
140
    return(action->code);
108
}
141
}
109
#ifdef FS_FAST
142
#ifdef FS_FAST
110
#define action_get_code(a) ((a)->code)
143
#define action_get_code(a)	((a)->code)
111
#endif /* defined (FS_FAST) */
144
#endif /* defined (FS_FAST) */
112
 
145
 
113
#ifdef FS_FAST
146
#ifdef FS_FAST
114
#undef action_set_code
147
#undef action_set_code
115
#endif /* defined (FS_FAST) */
148
#endif /* defined (FS_FAST) */
116
void
149
void
117
action_set_code PROTO_N ((action, code))
150
action_set_code(ActionP action, GenericP code)
118
		PROTO_T (ActionP  action X
-
 
119
			 GenericP code)
-
 
120
{
151
{
121
    action->code = code;
152
    action->code = code;
122
}
153
}
123
#ifdef FS_FAST
154
#ifdef FS_FAST
124
#define action_set_code(a, c) ((a)->code = (c))
155
#define action_set_code(a, c)	((a)->code = (c))
125
#endif /* defined (FS_FAST) */
156
#endif /* defined (FS_FAST) */
126
 
157
 
127
void
158
void
128
action_iter_for_table PROTO_N ((action, full, proc, closure))
159
action_iter_for_table(ActionP action, BoolT full,
129
		      PROTO_T (ActionP  action X
-
 
130
			       BoolT    full X
-
 
131
			       void   (*proc) PROTO_S ((EntryP, GenericP)) X
160
		      void(*proc)KW_WEAK_PROTOTYPE(EntryP, GenericP),
132
			       GenericP closure)
161
		      GenericP closure)
133
{
162
{
134
    if (full) {
163
    if (full) {
135
	types_iter_for_table (action_param (action), proc, closure);
164
	types_iter_for_table(action_param(action), proc, closure);
136
	types_iter_for_table (action_result (action), proc, closure);
165
	types_iter_for_table(action_result(action), proc, closure);
137
    }
166
    }
138
}
167
}
139

168

140
/*
169
/*
141
 * Local variables(smf):
170
 * Local variables(smf):