type.h 24.6 KB
Newer Older
Götz Lindenmaier's avatar
Götz Lindenmaier committed
1
/****h* libfirm/type6 2002/03/19 13:08:33
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
 *
 * NAME
 *   file type.h - datastructure to hold type information.
 * COPYRIGHT
 *  (C) 2001 by Universitaet Karlsruhe
 * AUTHORS
 *  Goetz Lindenmaier
 *
 * NOTES
 *  This module supplies a datastructure to represent all types
 *  known in the compiled program.  This includes types specified
 *  in the program as well as types defined by the language.  In the
 *  view of the intermediate representation there is no difference
 *  between these types.
 *
 *  There exist several kinds of types, arranged by the structure of
 *  the type.  A type is described by a set of attributes.  Some of
 *  these attributes are common to all types, others depend on the
 *  kind of the type.
 *
 *  Types are different from the modes defined in irmode:  Types are
 *  on the level of the programming language, modes at the level of
 *  the target processor.
 *
 * SEE ALSO
 *   tpop.h
 *****
 */
Boris Boesler's avatar
Boris Boesler committed
30
31
32

/* $Id$ */

Christian Schäfer's avatar
Christian Schäfer committed
33
34
35
# ifndef _TYPE_H_
# define _TYPE_H_

36
# include "tpop.h"
37
# include "firm_common.h"
Christian Schäfer's avatar
Christian Schäfer committed
38
39
# include "ident.h"
# include "irmode.h"
40
# include <stdbool.h>
41
# include "dbginfo.h"
Christian Schäfer's avatar
Christian Schäfer committed
42

Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
43

44
/* to resolve recursion between entity.h and type.h */
Christian Schäfer's avatar
Christian Schäfer committed
45
46
47
48
#ifndef _ENTITY_TYPEDEF_
#define _ENTITY_TYPEDEF_
typedef struct entity entity;
#endif
Christian Schäfer's avatar
Christian Schäfer committed
49

50
51
52
53
54
#ifndef _IR_NODE_TYPEDEF_
#define _IR_NODE_TYPEDEF_
typedef struct ir_node ir_node;
#endif

55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/****s* type/type
 *
 * NAME
 *   type - An abstract data type to represent types.
 * NOTE
 *  This is the abstract data type with which any type known in the
 *  compiled program can be represented.  This includes types specified
 *  in the program as well as types defined by the language.  In the
 *  view of the intermediate representation there is no difference
 *  between these types.
 *
 *  There exist several kinds of types, arranged by the structure of
 *  the type.  These are distinguished by a type opcode.
 *  A type is described by a set of attributes.  Some of these attributes
 *  are common to all types, others depend on the kind of the type.
 *
 *  The following describes the common attributes.  They can only be
 *  accessed by the functions given below.
 *
 * ATTRIBUTES
 *  The common fields are:
 *
 *  firm_kind    A firm_kind tag containing k_type.  This is useful
 *               for dynamically checking whether a node is a type node.
 *  type_op      A tp_op specifying the kind of the type.
 *  mode         The mode to be used to represent the type on a machine.
 *               @@@ maybe not global field??
 *  name         An identifier specifying the name of the type.  To be
 *               set by the frontend.
 *  size         The size of the type, i.e. an entity of this type will
 *               occupy size bytes in memory.  In several cases this is
 *               determined when fixing the layout of this type (class,
 *               struct, union, array, enumeration).
Götz Lindenmaier's avatar
Götz Lindenmaier committed
88
89
90
91
92
93
94
95
96
 *  state        The state of the type.  The state represents whether the
 *               layout of the type is undefined or fixed (values: layout_undefined
 *               or layout_fixed).  Compound types can have an undefined
 *               layout.  The layout of the basic types primitive and pointer
 *               is always layout_fixed.  If the layout of
 *               compound types is fixed all entities must have an offset
 *               and the size of the type must be set.
 *               A fixed layout for enumeration types means that each enumeration
 *               is associated with an implementation value.
97
 *  visit        A counter for walks of the type information.
98
 *  link         A void* to associate some additional information with the type.
99
100
101
102
103
104
105
106
107
 *
 *  These fields can only be accessed via access functions.
 *
 *  Depending on the value of type_op, i.e., depending on the kind of the
 *  type the adt contains further attributes.  These are documented below.
 * SEE ALSO
 *   class, struct, method, union, array, enumeration, pointer, primitive
 * SOURCE
 */
108
109
#ifndef _TYPE_TYPEDEF_
#define _TYPE_TYPEDEF_
110
typedef struct type type;
111
#endif
112

Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
113
114
# include "type_or_entity.h"

115
116
117
118
/* Frees the memory used by the type.   Does not free the entities
   belonging to the type, except for the array element entity.  */
void        free_type(type *tp);

119
120
121
122
123
tp_op*      get_type_tpop(type *tp);
ident*      get_type_tpop_nameid(type *tp);
const char* get_type_tpop_name(type *tp);
tp_opcode   get_type_tpop_code(type *tp);

124
125
ident*      get_type_ident(type *tp);
void        set_type_ident(type *tp, ident* id);
126
127
const char* get_type_name(type *tp);

128
129
130
typedef enum {
  layout_undefined,    /* The layout of this type is not defined.
			  Address computation to access fields is not
131
132
133
			  possible, fields must be accessed by Sel
			  nodes.  This is the default value except for
			  pointer, primitive and method types. */
134
135
136
  layout_fixed         /* The layout is fixed, all component/member entities
			  have an offset assigned.  Size of the type is known.
			  Arrays can be accessed by explicit address
137
138
			  computation. Default for pointer, primitive ane method
			  types.  */
139
140
} type_state;
type_state  get_type_state(type *tp);
Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
141
/* For primitives, pointer and method types the layout is always fixed.
142
143
144
   This call is legal but has no effect. */
void        set_type_state(type *tp, type_state state);

145
146
147
148
149
150
151
152
153
154
155
/* Returns NULL for all non atomic types. */
ir_mode*    get_type_mode(type *tp);
/* Only has an effect on primitive and enumeration types */
void        set_type_mode(type *tp, ir_mode* m);

int         get_type_size(type *tp);
/* For primitive, enumeration, pointer and method types the size
   is always fixed. This call is legal but has no effect. */
void        set_type_size(type *tp, int size);


156
unsigned long get_type_visited(type *tp);
157
void          set_type_visited(type *tp, unsigned long num);
158
/* Sets visited field in type to type_visited. */
159
void          mark_type_visited(type *tp);
160

161
162
void*         get_type_link(type *tp);
void          set_type_link(type *tp, void *l);
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
/*****/

/****v* type/visited
 *
 * NAME
 *   type_visited -  visited flag to traverse the type information
 * PURPOSE
 *   Increase this flag by one before traversing the type information.
 *   Mark type nodes as visited by set_type_visited(type, type_visited).
 *   Check whether node was already visited by comparing get_type_visited(type)
 *   and type_visited.
 *   Or use the function to walk all types.
 * SEE ALSO
 *   typewalk
 * SOURCE
 */
Christian Schäfer's avatar
Christian Schäfer committed
179
extern unsigned long type_visited;
180
void          set_master_type_visited(unsigned long val);
181
unsigned long get_master_type_visited();
182
void          inc_master_type_visited();
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
/*****/

/****f* type/is_type
 *
 * NAME
 *   is_type - Checks whether a pointer points to a type.
 * SYNOPSIS
 *   bool is_type            (void *thing);
 * INPUTS
 *   thing - a pointer
 * RESULT
 *   true if the thing is a type, else false
 ***
 */
int is_type            (void *thing);
Christian Schäfer's avatar
Christian Schäfer committed
198

199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
/****f* type/equal_types
 *
 * NAME
 *   equal_type - Checks whether two types are structural equal.
 * SYNOPSIS
 *   bool equal_types   (type *typ1, type *typ2);
 * INPUTS
 *   two pointer types
 * RESULT
 *   true if the types are equal, else false.
 *   Types are equal if
 *    - they are the same type kind
 *    - they have the same name
 *    - they have the same mode (if applicable)
 *    - they have the same type_state and, ev., the same size
 *    - they are class types and have
 *      - the same members (see same_entity in entity.h)
 *      - the same supertypes -- the C-pointers are compared --> no recursive call.
 *      - the same number of subtypes.  Subtypes are not compared,
 *        as this could cause a cyclic test.
 *      - the same peculiarity
 *    - they are structure types and have the same members
 *    - they are method types and have
 *      - the same parameter types
 *      - the same result types
 *    - they are union types and have the same members
 *    - they are array types and have
 *      - the same number of dimensions
 *      - the same dimension bounds
 *      - the same dimension order
 *      - the same element type
 *    - they are enumeration types and have the same enumerator names
 *    - they are pointer types and have the identical points_to type
 *      (i.e., the same C-struct to represent the type, type_id is skipped.
 *       This is to avoid endless recursions; with pointer types circlic
 *       type graphs are possible.)
 *
 ***
 */
bool equal_type(type *tpy1, type *typ2);

/****f* type/smaller_type
 *
 * NAME
 *   smaller_type - Checks whether two types are structural comparable.
 * SYNOPSIS
 *   bool smaller_type   (type *st, type *lt);
 * INPUTS
 *   two pointer type
 * RESULT
 *   true if type st is smaller than type lt, i.e. whenever
 *   lt is expected a st can be used.
 *   This is true if
 *    - they are the same type kind
 *    - mode(st) < mode (lt)  (if applicable)
 *    - they are class types and st is (transitive) subtype of lt,
 *    - they are structure types and
 *       - the members of st have exactly one counterpart in lt with the same name,
 *       - the counterpart has a bigger type.
 *    - they are method types and have
 *      - the same number of parameter and result types,
 *      - the parameter types of st are smaller than those of lt,
 *      - the result types of st are smaller than those of lt
 *    - they are union types and have the members of st have exactly one
 *      counterpart in lt and the type is smaller
 *    - they are array types and have
 *      - the same number of dimensions
 *      - all bounds of lt are bound of st
 *      - the same dimension order
 *      - the same element type
 *      or
 *      - the element type of st is smaller than that of lt
 *      - the element types have the same size and fixed layout.
 *    - they are enumeration types and have the same enumerator names
 *    - they are pointer types and have the points_to type of st is
 *      smaller than the points_to type of lt.
 ***
 */
bool smaller_type (type *st, type *lt);

279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
/****** type/class
 * NAME
 *  Representation of a class type.
 * NOTE
 *  If the type opcode is set to type_class the type represents class
 *  types.  A list of fields and methods is associated with a class.
 *  Further a class can inherit from and bequest to other classes.
 *  @@@ value class???
 * ATTRIBUTES
 *  The following attributes are private to this type kind.
 *  member     All entities belonging to this class.  This are methode entities
 *             which have type_method or fields that can have any of the
 *             following type kinds: type_class, type_struct, type_union,
 *             type_array, type_enumeration, type_pointer, type_primitive.
 *
 *  subtypes   A list of direct subclasses.
 *
 *  supertypes A list of direct superclasses.
 *
 *  These are dynamic lists that can be grown with an "add_" function,
 *  but not shrinked.
300
301
302
303
 *
 *  peculiarity The peculiarity of this class.  If the class is of peculiarity
 *             "description" it only is a description of requirememts to a class,
 *             as, e.g., a Java interface.  The class will never be allocated.
304
305
306
307
308
 *             Peculiatity inherited is only possible for entities.  An entity
 *             is of peculiarity inherited if the compiler generated the entity
 *             to explicitly resolve inheritance.  An inherited method entity has
 *             no value for irg.
 *             Values: description, existent, inherited.  Default: existent.
309
 *
310
311
312
313
 * SOURCE
 */
/* create a new class type */
type   *new_type_class (ident *name);
314
type   *new_d_type_class (ident *name, dbg_info *db);
315

316
317
/** manipulate private fields of class type  **/
/* Adds the entity as member of the class.  */
318
void    add_class_member   (type *clss, entity *member);
319
/* Returns the number of members of this class. */
320
int     get_class_n_members (type *clss);
321
/* Returns the member at position pos, 0 <= pos < n_member */
322
entity *get_class_member   (type *clss, int pos);
323
324
/* Overwrites the member at position pos, 0 <= pos < n_member with
   the passed entity. */
325
void    set_class_member   (type *clss, entity *member, int pos);
Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
326
327
328
329
/* Replaces complete member list in class type by the list passed.  Copies the
   list passed. This function is necessary to reduce the number of members.
   members is an array of entities, num the size of this array.  Sets all
   owners of the members passed to clss. */
330
void    set_class_members  (type *clss, entity *members[], int arity);
331
332
333
/* Finds member in the list of members and removes it.
   Shrinks the member list, so iterate from the end!!!
   Does not deallocate the entity.  */
334
void    remove_class_member(type *clss, entity *member);
335

336

Götz Lindenmaier's avatar
Götz Lindenmaier committed
337
338
339
/* Adds subtype as subtype to clss.
   Checks whether clss is a supertype of subtype.  If not
   adds also clss as supertype to subtype.  */
340
void    add_class_subtype   (type *clss, type *subtype);
341
/* Returns the number of subtypes */
342
int     get_class_n_subtypes (type *clss);
343
/* Gets the subtype at position pos, 0 <= pos < n_subtype. */
344
type   *get_class_subtype   (type *clss, int pos);
345
346
347
/* Sets the subtype at positioin pos, 0 <= pos < n_subtype.  Does not
   set the corresponding supertype relation for subtype: this might
   be a different position! */
348
void    set_class_subtype   (type *clss, type *subtype, int pos);
349
/* Finds subtype in the list of subtypes and removes it  */
350
351
void    remove_class_subtype(type *clss, type *subtype);

352

Götz Lindenmaier's avatar
Götz Lindenmaier committed
353
354
355
/* Adds supertype as supertype to class.
   Checks whether clss is a subtype of supertype.  If not
   adds also clss as subtype to supertype.  */
356
void    add_class_supertype   (type *clss, type *supertype);
357
/* Returns the number of supertypes */
358
int     get_class_n_supertypes (type *clss);
359
/* Gets the supertype at position pos,  0 <= pos < n_supertype. */
360
type   *get_class_supertype   (type *clss, int pos);
361
362
363
/* Sets the supertype at postition pos, 0 <= pos < n_subtype.  Does not
   set the corresponding subtype relation for supertype: this might
   be a different position! */
364
void    set_class_supertype   (type *clss, type *supertype, int pos);
365
/* Finds supertype in the list of supertypes and removes it */
366
void    remove_class_supertype(type *clss, type *supertype);
367

368
/* This enumeration flags the peculiarity of entities and types. */
Götz Lindenmaier's avatar
Götz Lindenmaier committed
369
typedef enum peculiarity {
370
371
  description,     /* Represents only a description.  The entity/type is never
	  	      allocated, no code/data exists for this entity/type. */
372
373
374
375
376
377
  inherited,       /* Describes explicitly that other entities are
 		      inherited to the owner of this entity.
 		      Overwrites must refer to at least one other
 		      entity.  If this is a method entity there exists
 		      no irg for this entity, only for one of the
 		      overwritten ones. */
378
379
380
381
382
  existent         /* The entity/type (can) exist. */
} peculiarity;

/* The peculiarity of the class.  The enumeration peculiarity is defined
   in entity.h */
383
384
INLINE peculiarity get_class_peculiarity (type *clss);
INLINE void        set_class_peculiarity (type *clss, peculiarity pec);
385

386
387
/* Set and get a class' dfn --
   @@@ This is an undocumented field, subject to change! */
388
389
void set_class_dfn (type *clss, int dfn);
int  get_class_dfn (type *clss);
390

391
/* typecheck */
392
393
394
bool is_class_type(type *clss);
/* Returns true if low is subclass of high. */
bool is_subclass_of(type *low, type *high);
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
/*****/

/****** type/struct
 * NAME
 *  Representation of a struct type.
 * NOTE
 *  Type_strct represents aggregate types that consist of a list
 *  of fields.
 * ATTRIBUTES
 *  member   All entities belonging to this class.  This are the fields
 *           that can have any of the following types:  type_class,
 *           type_struct, type_union, type_array, type_enumeration,
 *  	     type_pointer, type_primitive.
 *           This is a dynamic list that can be grown with an "add_" function,
 *           but not shrinked.
410
411
 *           This is a dynamic list that can be grown with an "add_" function,
 *           but not shrinked.
412
413
414
415
 * SOURCE
 */
/* create a new type struct */
type   *new_type_struct (ident *name);
416
type   *new_d_type_struct (ident *name, dbg_info* db);
417
418
419

/* manipulate private fields of struct */
void    add_struct_member   (type *strct, entity *member);
420
int     get_struct_n_members (type *strct);
421
422
entity *get_struct_member   (type *strct, int pos);
void    set_struct_member   (type *strct, int pos, entity *member);
423
/* Finds member in the list of memberss and removees it */
424
void    remove_struct_member (type *strct, entity *member);
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462

/* typecheck */
bool    is_struct_type(type *strct);
/*****/

/****** type/method
 * NAME
 *  Representation of a method type.
 * NOTE
 *  A method type represents a method, function or procedure type.
 *  It contains a list of the parameter and result types, as these
 *  are part of the type description.  These lists should not
 *  be changed by a optimization, as a change creates a new method
 *  type.  Therefore optimizations should allocated new method types.
 *  The set_ routines are only for construction by a frontend.
 * ATTRIBUTES
 *  n_params    Number of parameters to the procedure.
 *              A procedure in FIRM has only call by value parameters.
 *
 *  param_type  A list with the types of parameters.  This list is ordered.
 *              The nth type in this list corresponds to the nth element
 *              in the parameter tuple that is a result of the start node.
 *  	        (See ircons.h for more information.)
 *
 *  n_res       The number of results of the method.  In general, procedures
 *              have zero results, functions one.
 *
 *  res_type    A list with the types of parameters.  This list is ordered.
 *              The nth type in this list corresponds to the nth input to
 *  	        Return nodes.  (See ircons.h for more information.)
 * SOURCE
 */

/* Create a new method type.
   N_param is the number of parameters, n_res the number of results.
   The arrays for the parameter and result types are not initialized by
   the constructor. */
type *new_type_method (ident *name, int n_param, int n_res);
463
type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db);
464
465
466
467

/* manipulate private fields of method. */
int   get_method_n_params  (type *method);
type *get_method_param_type(type *method, int pos);
468
void  set_method_param_type(type *method, int pos, type* tp);
469

470
int   get_method_n_ress   (type *method);
471
type *get_method_res_type(type *method, int pos);
472
void  set_method_res_type(type *method, int pos, type* tp);
473
474
475
476
477
478
479
480
481
482
483
484

/* typecheck */
bool  is_method_type     (type *method);
/*****/

/****** type/union
 * NAME
 *   Representation of a union type.
 * NOTE
 *   The union type represents union types.
 * ATTRIBUTES
 *   n_types        Number of unioned types.
485
 *   members        Entities for unioned types.  Fixed length array.
486
487
 *                  This is a dynamic list that can be grown with an "add_" function,
 *                  but not shrinked.
488
489
 * SOURCE
 */
490
/* create a new type union  */
491
type   *new_type_union (ident *name);
492
type   *new_d_type_union (ident *name, dbg_info* db);
493
494

/* manipulate private fields of struct */
495
496
497
498
int     get_union_n_members      (type *uni);
void    add_union_member (type *uni, entity *member);
entity *get_union_member (type *uni, int pos);
void    set_union_member (type *uni, int pos, entity *member);
499
/* Finds member in the list of members and removes it. */
500
void    remove_union_member (type *uni, entity *member);
501

502
503
504
505
/* typecheck */
bool    is_union_type          (type *uni);
/*****/

506
507
508
509
510
/****** type/array
 * NAME
 *   Representation of an array type.
 * NOTE
 *   The array type represents rectangular multi dimensional arrays.
511
512
 *   The constants representing the bounds must be allocated to
 *   get_const_code_irg() by setting current_ir_graph accordingly.
513
514
515
516
517
 * ATTRIBUTES
 *   n_dimensions     Number of array dimensions.
 *   *lower_bound     Lower bounds of dimensions.  Usually all 0.
 *   *upper_bound     Upper bounds or dimensions.
 *   *element_type    The type of the array elements.
518
519
 *   *element_ent     An entity for the array elements to be used for
 *                    element selection with Sel.
520
521
522
 *                    @@@ Do we need several entities?  One might want
 *                    to select a dimension and not a single element in
 *                    case of multidim arrays.
523
524
 * SOURCE
 */
525
/* create a new type array --
Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
526
527
   Sets n_dimension to dimension and all dimension entries to NULL.
   Initializes order to the order of the dimensions.
528
   The entity for array elements is built automatically.
Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
529
   Set dimension sizes after call to constructor with set_* routines. */
530
type *new_type_array         (ident *name, int n_dimensions,
531
			      type *element_type);
532
533
type *new_d_type_array         (ident *name, int n_dimensions,
			      type *element_type, dbg_info* db);
534
535
536

/* manipulate private fields of array type */
int   get_array_n_dimensions (type *array);
537
538
539
/* Allocates Const nodes of mode_I for the array dimensions */
void  set_array_bounds_int   (type *array, int dimension, int lower_bound,
                                                          int upper_bound);
540
541
542
void  set_array_bounds       (type *array, int dimension, ir_node *lower_bound,
                                                          ir_node *upper_bound);
void  set_array_lower_bound  (type *array, int dimension, ir_node *lower_bound);
543
void  set_array_lower_bound_int (type *array, int dimension, int lower_bound);
544
void  set_array_upper_bound  (type *array, int dimension, ir_node *upper_bound);
545
void  set_array_upper_bound_int (type *array, int dimension, int lower_bound);
546
547
ir_node * get_array_lower_bound  (type *array, int dimension);
ir_node * get_array_upper_bound  (type *array, int dimension);
548

Götz Lindenmaier's avatar
a    
Götz Lindenmaier committed
549
550
551
void set_array_order (type *array, int dimension, int order);
int  get_array_order (type *array, int dimension);

552
void  set_array_element_type (type *array, type *tp);
553
554
type *get_array_element_type (type *array);

555
556
557
void  set_array_element_entity (type *array, entity *ent);
entity *get_array_element_entity (type *array);

558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
/* typecheck */
bool   is_array_type         (type *array);
/*****/

/****** type/enumeration
 * NAME
 *  Representation of an enumeration type.
 * NOTE
 *  Enumeration types need not necessarily be represented explicitly
 *  by Firm types, as the frontend can lower them to integer constants as
 *  well.  For debugging purposes or similar tasks this information is useful.
 * ATTRIBUTES
 *   *enum           The target values representing the constants used to
 *                   represent individual enumerations.
 *   *enum_nameid    Idents containing the source program name of the enumeration
 *  		     constants
 *
*****
Christian Schäfer's avatar
Christian Schäfer committed
576
577
*/
/* create a new type enumeration -- set the enumerators independently */
578
type   *new_type_enumeration    (ident *name, int n_enums);
579
type   *new_d_type_enumeration    (ident *name, int n_enums, dbg_info* db);
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605

/* manipulate fields of enumeration type. */
int     get_enumeration_n_enums (type *enumeration);

void    set_enumeration_enum    (type *enumeration, int pos, tarval *con);
tarval *get_enumeration_enum    (type *enumeration, int pos);

void    set_enumeration_nameid  (type *enumeration, int pos, ident *id);
ident  *get_enumeration_nameid  (type *enumeration, int pos);
const char *get_enumeration_name(type *enumeration, int pos);

/* typecheck */
bool    is_enumeration_type     (type *enumeration);
/*****/

/****** type/pointer
 * NAME
 *   Representation of a pointer type.
 * NOTE
 *   Pointer types.
 * ATTRIBUTES
 *   points_to       The type of the entity this pointer points to.
 * SOURCE
 */
/* Create a new type pointer */
type *new_type_pointer           (ident *name, type *points_to);
606
type *new_d_type_pointer           (ident *name, type *points_to, dbg_info* db);
Christian Schäfer's avatar
Christian Schäfer committed
607
608

/* manipulate fields of type_pointer */
609
void  set_pointer_points_to_type (type *pointer, type *tp);
610
611
612
613
614
615
616
617
618
619
620
621
622
623
type *get_pointer_points_to_type (type *pointer);

/* typecheck */
bool  is_pointer_type            (type *pointer);
/*****/

/****** type/primitive
 * NAME
 *   Representation of a primitive type.
 * NOTE
 *   Primitive types are types that represent indivisible data values that
 *   map directly to modes.  They don't have a private attribute.  The
 *   important information they carry is held in the common mode field.
 * SOURCE
Christian Schäfer's avatar
Christian Schäfer committed
624
625
*/
/* create a new type primitive */
626
type *new_type_primitive (ident *name, ir_mode *mode);
627
type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db);
Christian Schäfer's avatar
Christian Schäfer committed
628

629
630
631
/* typecheck */
bool  is_primitive_type  (type *primitive);
/*****/
Christian Schäfer's avatar
Christian Schäfer committed
632

633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662


/****f* type/is_atomic_type
 *
 * NAME
 *   is_atomic_type - Checks whether a type is atomic.
 * SYNOPSIS
 *   int is_atomic_type(type *tp);
 * INPUTS
 *   tp - any type
 * RESULT
 *   true if type is primitive, pointer or enumeration
 ***
 */
int is_atomic_type(type *tp);

/****f* type/is_compound_type
 *
 * NAME
 *   is_compound_type - Checks whether a type is compound.
 * SYNOPSIS
 *   int is_compound_type(type *tp)
 * INPUTS
 *   tp - any type
 * RESULT
 *   true if the type is class, structure, union or array type.
 ***
 */
int is_compound_type(type *tp);

Christian Schäfer's avatar
Christian Schäfer committed
663
# endif /* _TYPE_H_ */