Subversion Repositories tendra.SVN

Rev

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

Rev 2 Rev 7
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 
*/
Line 39... Line 69...
39 
    These are associated with a sort number, giving the result sort,
 69 
    These are associated with a sort number, giving the result sort,
40 
    and an array of sort numbers, giving the argument sorts.
 70 
    and an array of sort numbers, giving the argument sorts.
41 
*/
 71 
*/
42 
 
 72 
 
43 
typedef struct {
 73 
typedef struct {
44 
    char *name ;
 74 
    char *name;
45 
    sortname id ;
 75 
    sortname id;
46 
    sortname res ;
 76 
    sortname res;
47 
    int no_args ;
 77 
    int no_args;
48 
    sortname *args ;
 78 
    sortname *args;
49 
} high_sort ;
 79 
} high_sort;
50 
 
 80 
 
51 
 
 81 
 
52 
/*
 82 
/*
53 
    STARTING POINT FOR HIGH LEVEL SORTS
 83 
    STARTING POINT FOR HIGH LEVEL SORTS
54 
 
 84 
 
Line 58... Line 88...
58 
    high level sort, and high_no is used to transform a high level
 88 
    high level sort, and high_no is used to transform a high level
59 
    sort number into an offset in the table high_sorts.
 89 
    sort number into an offset in the table high_sorts.
60 
*/
 90 
*/
61 
 
 91 
 
62 
#define high_start	100
 92 
#define high_start	100
63 
#define is_high( s )	( ( s ) >= high_start )
 93 
#define is_high(s)	((s) >= high_start)
64 
#define high_no( n )	( ( int ) ( ( n ) - high_start ) )
 94 
#define high_no(n)	((int)((n) - high_start))
65 
 
 95 
 
66 
 
 96 
 
67 
/*
 97 
/*
68 
    ROUTINES FOR MANIPULATING HIGH LEVEL SORTS
 98 
    ROUTINES FOR MANIPULATING HIGH LEVEL SORTS
69 
*/
 99 
*/
70 
 
 100 
 
71 
extern high_sort *high_sorts ;
 101 
extern high_sort *high_sorts;
72 
extern int crt_high_sort ;
 102 
extern int crt_high_sort;
73 
extern high_sort *new_high_sort PROTO_S ( ( high_sort * ) ) ;
 103 
extern high_sort *new_high_sort(high_sort *);
74 
extern void set_high_sort PROTO_S ( ( char *, tok_info * ) ) ;
 104 
extern void set_high_sort(char *, tok_info *);
75 
extern high_sort *unique_high_sort PROTO_S ( ( high_sort * ) ) ;
 105 
extern high_sort *unique_high_sort(high_sort *);
76 
extern sortname find_high_sort PROTO_S ( ( char * ) ) ;
 106 
extern sortname find_high_sort(char *);
77 
extern char *find_decode_string PROTO_S ( ( high_sort * ) ) ;
 107 
extern char *find_decode_string(high_sort *);
78 
extern char *find_sortname PROTO_S ( ( char *, sortname * ) ) ;
 108 
extern char *find_sortname(char *, sortname *);
79 
#define sprint_high_sort( p, s )\
 109 
#define sprint_high_sort(p, s)\
80 
	( void ) sprintf ( p, "T%d#", high_no ( s ) )
 110 
	(void)sprintf(p, "T%d#", high_no(s))
81 
 
 111 
 
82 
 
 112 
 
83 
#endif
 113 
#endif