1/*  This file is part of the program psim.
2
3    Copyright 1994, 1995, 1996, 1997, 2003, Andrew Cagney
4
5    This program is free software; you can redistribute it and/or modify
6    it under the terms of the GNU General Public License as published by
7    the Free Software Foundation; either version 3 of the License, or
8    (at your option) any later version.
9
10    This program is distributed in the hope that it will be useful,
11    but WITHOUT ANY WARRANTY; without even the implied warranty of
12    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
13    GNU General Public License for more details.
14
15    You should have received a copy of the GNU General Public License
16    along with this program; if not, see <http://www.gnu.org/licenses/>.
17
18    */
19
20/* Instruction unpacking:
21
22   Once the instruction has been decoded, the register (and other)
23   fields within the instruction need to be extracted.
24
25   The table that follows determines how each field should be treated.
26   Importantly it considers the case where the extracted field is to
27   be used immediately or stored in an instruction cache.
28
29   <type>
30
31   Indicates what to do with the cache entry.  If a cache is to be
32   used.  SCRATCH and CACHE values are defined when a cache entry is
33   being filled while CACHE and COMPUTE values are defined in the
34   semantic code.
35
36   Zero marks the end of the table.  More importantly 1. indicates
37   that the entry is valid and can be cached. 2. indicates that that
38   the entry is valid but can not be cached.
39
40   <field_name>
41
42   The field name as given in the instruction spec.
43
44   <derived_name>
45
46   A new name for <field_name> once it has been extracted from the
47   instruction (and possibly stored in the instruction cache).
48
49   <type>
50
51   String specifying the storage type for <new_name> (the extracted
52   field>.
53
54   <expression>
55
56   Specifies how to get <new_name> from <old_name>.  If null, old and
57   new name had better be the same. */
58
59
60typedef enum {
61  scratch_value,
62  cache_value,
63  compute_value,
64} cache_rule_type;
65
66typedef struct _cache_table cache_table;
67struct _cache_table {
68  cache_rule_type type;
69  const char *field_name;
70  const char *derived_name;
71  const char *type_def;
72  const char *expression;
73  table_entry *file_entry;
74  cache_table *next;
75};
76
77
78extern cache_table *load_cache_table
79(const char *file_name,
80 int hi_bit_nr);
81
82extern void append_cache_rule
83(cache_table **table,
84 const char *type,
85 const char *field_name,
86 const char *derived_name,
87 const char *type_def,
88 const char *expression,
89 table_entry *file_entry);
90
91