| 2 |
7u83 |
1 |
/*
|
|
|
2 |
Crown Copyright (c) 1997
|
|
|
3 |
|
|
|
4 |
This TenDRA(r) Computer Program is subject to Copyright
|
|
|
5 |
owned by the United Kingdom Secretary of State for Defence
|
|
|
6 |
acting through the Defence Evaluation and Research Agency
|
|
|
7 |
(DERA). It is made available to Recipients with a
|
|
|
8 |
royalty-free licence for its use, reproduction, transfer
|
|
|
9 |
to other parties and amendment for any purpose not excluding
|
|
|
10 |
product development provided that any such use et cetera
|
|
|
11 |
shall be deemed to be acceptance of the following conditions:-
|
|
|
12 |
|
|
|
13 |
(1) Its Recipients shall ensure that this Notice is
|
|
|
14 |
reproduced upon any copies or amended versions of it;
|
|
|
15 |
|
|
|
16 |
(2) Any amended version of it shall be clearly marked to
|
|
|
17 |
show both the nature of and the organisation responsible
|
|
|
18 |
for the relevant amendment or amendments;
|
|
|
19 |
|
|
|
20 |
(3) Its onward transfer from a recipient to another
|
|
|
21 |
party shall be deemed to be that party's acceptance of
|
|
|
22 |
these conditions;
|
|
|
23 |
|
|
|
24 |
(4) DERA gives no warranty or assurance as to its
|
|
|
25 |
quality or suitability for any purpose and DERA accepts
|
|
|
26 |
no liability whatsoever in relation to any use to which
|
|
|
27 |
it may be put.
|
|
|
28 |
*/
|
|
|
29 |
|
|
|
30 |
|
|
|
31 |
/**********************************************************************
|
|
|
32 |
$Author: release $
|
|
|
33 |
$Date: 1998/03/16 11:25:34 $
|
|
|
34 |
$Revision: 1.2 $
|
|
|
35 |
$Log: config.h,v $
|
|
|
36 |
* Revision 1.2 1998/03/16 11:25:34 release
|
|
|
37 |
* Modifications prior to version 4.1.2.
|
|
|
38 |
*
|
|
|
39 |
* Revision 1.1.1.1 1998/01/17 15:56:04 release
|
|
|
40 |
* First version to be checked into rolling release.
|
|
|
41 |
*
|
|
|
42 |
* Revision 1.4 1995/09/20 08:26:49 currie
|
|
|
43 |
* isAlpha
|
|
|
44 |
*
|
|
|
45 |
* Revision 1.3 1995/06/22 09:33:03 currie
|
|
|
46 |
* Added has_rotate
|
|
|
47 |
*
|
|
|
48 |
* Revision 1.2 1995/05/18 16:29:54 currie
|
|
|
49 |
* Introduced has_bitfield_ops
|
|
|
50 |
*
|
|
|
51 |
* Revision 1.1 1995/04/13 09:33:41 currie
|
|
|
52 |
* Initial revision
|
|
|
53 |
*
|
|
|
54 |
***********************************************************************/
|
|
|
55 |
|
|
|
56 |
|
|
|
57 |
#ifndef config_key
|
|
|
58 |
#define config_key 1
|
|
|
59 |
|
|
|
60 |
#include "ossg_api.h"
|
|
|
61 |
#include "ossg.h"
|
|
|
62 |
|
|
|
63 |
#ifndef FS_LITTLE_ENDIAN
|
|
|
64 |
#define FS_LITTLE_ENDIAN 1
|
|
|
65 |
#endif
|
|
|
66 |
|
|
|
67 |
#define isvax 0
|
|
|
68 |
#define ismips 1
|
|
|
69 |
#define is68000 0
|
|
|
70 |
#define is80x86 0
|
|
|
71 |
#define ispower 0
|
|
|
72 |
#define issparc 0
|
|
|
73 |
#define isirix 0
|
|
|
74 |
#define isAlpha 0
|
|
|
75 |
|
|
|
76 |
#define issco 0
|
|
|
77 |
#define has64bits 0
|
|
|
78 |
|
|
|
79 |
#define has_setcc 0
|
|
|
80 |
#define little_end 1
|
|
|
81 |
#define has_byte_regs 0
|
|
|
82 |
#define has_byte_ops 0
|
|
|
83 |
#define only_lengthen_ops 1
|
|
|
84 |
#define has_neg_shift 0
|
|
|
85 |
#define regable_union 0
|
|
|
86 |
#define substitute_params 1
|
|
|
87 |
#define special_fns 1
|
|
|
88 |
#define shift_is_byte 1
|
|
|
89 |
#define only_inline_static 0
|
|
|
90 |
#define has_bitfield_ops 0
|
|
|
91 |
|
|
|
92 |
#define remove_zero_offsets 1
|
|
|
93 |
#define replace_compound 1
|
|
|
94 |
#define no_bitfield_ops 0
|
|
|
95 |
#define dont_unpad_apply 0
|
|
|
96 |
|
|
|
97 |
#define target_dbl_maxexp 308
|
|
|
98 |
|
|
|
99 |
#define check_shape 1
|
|
|
100 |
|
|
|
101 |
#define remove_unused_counters 1
|
|
|
102 |
#define remove_unused_index_counters 1
|
|
|
103 |
#define good_index_factor(f) 0
|
|
|
104 |
#define good_pointer_factor(f) 1
|
|
|
105 |
|
|
|
106 |
#define div0_implemented 1
|
|
|
107 |
#define do_case_transforms 0
|
|
|
108 |
/* Parameters for TDF->TDF case_optimisation */
|
|
|
109 |
|
|
|
110 |
#define jump_table_density 10 /* between 0 and 100 */
|
|
|
111 |
|
|
|
112 |
/* jump_table density is the percentage of entries which must be filled
|
|
|
113 |
* in a jump table in order for it to be created
|
|
|
114 |
* So 0 would try to make everything into a jump table whereas 100
|
|
|
115 |
* would mean only full jump tables could be put out
|
|
|
116 |
*/
|
|
|
117 |
|
|
|
118 |
#define non_default_entries 4 /* a positive integer */
|
|
|
119 |
|
|
|
120 |
/* non_default_entries is the minimum number of non default entries a
|
|
|
121 |
* jump table can contain
|
|
|
122 |
*/
|
|
|
123 |
|
|
|
124 |
#define non_default_destinations 2 /* a positive integer */
|
|
|
125 |
|
|
|
126 |
/* non_default_destinations is the minimum number of non default destinations
|
|
|
127 |
* a jump table can contain
|
|
|
128 |
*/
|
|
|
129 |
#define substitute_complex 1
|
|
|
130 |
#define temp_mips 0
|
|
|
131 |
#define value_of_null 0
|
|
|
132 |
#define has_rotate 0
|
|
|
133 |
|
|
|
134 |
#define HAS_MAGIC
|
|
|
135 |
|
|
|
136 |
#endif
|