+/*
+ * This file is part of cparser.
+ * Copyright (C) 2007-2008 Matthias Braun <matze@braunis.de>
+ *
+ * This program is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU General Public License
+ * as published by the Free Software Foundation; either version 2
+ * of the License, or (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
+ * 02111-1307, USA.
+ */
#include <config.h>
#include <assert.h>
#include "adt/error.h"
#include "adt/array.h"
+#include "symbol_t.h"
#include "token_t.h"
#include "type_t.h"
#include "ast_t.h"
static const declaration_t *current_function_decl;
static ir_node *current_function_name;
+static ir_node *current_funcsig;
static struct obstack asm_obst;
typedef enum declaration_kind_t {
DECLARATION_KIND_UNKNOWN,
DECLARATION_KIND_FUNCTION,
+ DECLARATION_KIND_VARIABLE_LENGTH_ARRAY,
DECLARATION_KIND_GLOBAL_VARIABLE,
DECLARATION_KIND_LOCAL_VARIABLE,
DECLARATION_KIND_LOCAL_VARIABLE_ENTITY,
return res;
}
-static ir_mode *_atomic_modes[ATOMIC_TYPE_LAST];
+static ir_mode *_atomic_modes[ATOMIC_TYPE_LAST+1];
static ir_mode *mode_int, *mode_uint;
+static ir_node *expression_to_firm(const expression_t *expression);
+static inline ir_mode *get_ir_mode(type_t *type);
+
/**
* Initialises the atomic modes depending on the machine size.
*/
_atomic_modes[ATOMIC_TYPE_LONG_DOUBLE] = mode_E;
_atomic_modes[ATOMIC_TYPE_BOOL] = get_umode(int_size);
-#ifdef PROVIDE_COMPLEX
_atomic_modes[ATOMIC_TYPE_BOOL] = _atomic_modes[ATOMIC_TYPE_INT];
_atomic_modes[ATOMIC_TYPE_FLOAT_IMAGINARY] = _atomic_modes[ATOMIC_TYPE_FLOAT];
_atomic_modes[ATOMIC_TYPE_DOUBLE_IMAGINARY] = _atomic_modes[ATOMIC_TYPE_DOUBLE];
_atomic_modes[ATOMIC_TYPE_LONG_DOUBLE_IMAGINARY] = _atomic_modes[ATOMIC_TYPE_LONG_DOUBLE];
-#endif
/* Hmm, pointers should be machine size */
set_modeP_data(get_ptrmode(machine_size >> 3, NULL));
static ir_mode *get_atomic_mode(const atomic_type_t* atomic_type)
{
ir_mode *res = NULL;
- if ((unsigned)atomic_type->akind < (unsigned)ATOMIC_TYPE_LAST)
+ if ((unsigned)atomic_type->akind <= (unsigned)ATOMIC_TYPE_LAST)
res = _atomic_modes[(unsigned)atomic_type->akind];
if (res == NULL)
panic("Encountered unknown atomic type");
return res;
}
-static unsigned get_type_size(type_t *type);
-
-static unsigned get_atomic_type_size(const atomic_type_t *type)
-{
- switch(type->akind) {
- case ATOMIC_TYPE_CHAR:
- case ATOMIC_TYPE_SCHAR:
- case ATOMIC_TYPE_UCHAR:
- return 1;
-
- case ATOMIC_TYPE_SHORT:
- case ATOMIC_TYPE_USHORT:
- return 2;
-
- case ATOMIC_TYPE_BOOL:
- case ATOMIC_TYPE_INT:
- case ATOMIC_TYPE_UINT:
- return machine_size >> 3;
-
- case ATOMIC_TYPE_LONG:
- case ATOMIC_TYPE_ULONG:
- return machine_size > 16 ? machine_size >> 3 : 4;
-
- case ATOMIC_TYPE_LONGLONG:
- case ATOMIC_TYPE_ULONGLONG:
- return machine_size > 16 ? 8 : 4;
-
- case ATOMIC_TYPE_FLOAT:
- return 4;
-
- case ATOMIC_TYPE_DOUBLE:
- return 8;
-
- case ATOMIC_TYPE_LONG_DOUBLE:
- return 12;
-
- case ATOMIC_TYPE_VOID:
- return 1;
-
- case ATOMIC_TYPE_INVALID:
- case ATOMIC_TYPE_LAST:
- break;
- }
- panic("Trying to determine size of invalid atomic type");
-}
-
static unsigned get_compound_type_size(compound_type_t *type)
{
ir_type *irtype = get_ir_type((type_t*) type);
static unsigned get_array_type_size(array_type_t *type)
{
+ assert(!type->is_vla);
ir_type *irtype = get_ir_type((type_t*) type);
return get_type_size_bytes(irtype);
}
-static unsigned get_type_size(type_t *type)
+static unsigned get_type_size_const(type_t *type)
{
type = skip_typeref(type);
case TYPE_ERROR:
panic("error type occured");
case TYPE_ATOMIC:
- return get_atomic_type_size(&type->atomic);
+ return get_atomic_type_size(type->atomic.akind);
case TYPE_ENUM:
return get_mode_size_bytes(mode_int);
case TYPE_COMPOUND_UNION:
case TYPE_ARRAY:
return get_array_type_size(&type->array);
case TYPE_BUILTIN:
- return get_type_size(type->builtin.real_type);
+ return get_type_size_const(type->builtin.real_type);
case TYPE_BITFIELD:
panic("type size of bitfield request");
case TYPE_TYPEDEF:
panic("Trying to determine size of invalid type");
}
+static ir_node *get_type_size(type_t *type)
+{
+ type = skip_typeref(type);
+
+ if(is_type_array(type) && type->array.is_vla) {
+ ir_node *size_node = type->array.size_node;
+ if(size_node == NULL) {
+ size_node = expression_to_firm(type->array.size_expression);
+ assert(!is_Const(size_node));
+ type->array.size_node = size_node;
+ }
+
+ ir_node *elem_size = get_type_size(type->array.element_type);
+ ir_mode *mode = get_irn_mode(size_node);
+ ir_node *real_size = new_d_Mul(NULL, size_node, elem_size, mode);
+ return real_size;
+ }
+
+ ir_mode *mode = get_ir_mode(type_size_t);
+ symconst_symbol sym;
+ sym.type_p = get_ir_type(type);
+ return new_SymConst(mode, sym, symconst_type_size);
+}
+
static unsigned count_parameters(const function_type_t *function_type)
{
unsigned count = 0;
ident *id = get_mode_ident(mode);
ir_type *irtype = new_d_type_primitive(id, mode, dbgi);
+ /* TODO: this is x86 specific, we should fiddle this into
+ * lang_features.h somehow... */
if(type->akind == ATOMIC_TYPE_LONG_DOUBLE
- || type->akind == ATOMIC_TYPE_DOUBLE) {
+ || type->akind == ATOMIC_TYPE_DOUBLE
+ || type->akind == ATOMIC_TYPE_LONGLONG
+ || type->akind == ATOMIC_TYPE_ULONGLONG) {
set_type_alignment_bytes(irtype, 4);
}
return irtype;
}
-static ir_node *expression_to_firm(const expression_t *expression);
-static inline ir_mode *get_ir_mode(type_t *type);
-
static ir_type *create_enum_type(enum_type_t *const type)
{
type->type.firm_type = ir_type_int;
return new_d_Const(dbgi, mode, tv);
}
-static ir_node *char_const_to_firm(const const_expression_t *cnst)
+static ir_node *character_constant_to_firm(const const_expression_t *cnst)
{
dbg_info *dbgi = get_dbg_info(&cnst->base.source_position);
ir_mode *mode = get_ir_mode(cnst->base.type);
long long int v = 0;
- for (size_t i = 0; i < cnst->v.chars.size; ++i) {
- v = (v << 8) | ((unsigned char)cnst->v.chars.begin[i]);
+ for (size_t i = 0; i < cnst->v.character.size; ++i) {
+ v = (v << 8) | ((unsigned char)cnst->v.character.begin[i]);
}
char buf[128];
size_t len = snprintf(buf, sizeof(buf), "%lld", v);
return new_d_Const(dbgi, mode, tv);
}
+static ir_node *wide_character_constant_to_firm(const const_expression_t *cnst)
+{
+ dbg_info *dbgi = get_dbg_info(&cnst->base.source_position);
+ ir_mode *mode = get_ir_mode(cnst->base.type);
+
+ long long int v = cnst->v.wide_character.begin[0];
+
+ char buf[128];
+ size_t len = snprintf(buf, sizeof(buf), "%lld", v);
+ tarval *tv = new_tarval_from_str(buf, len, mode);
+
+ return new_d_Const(dbgi, mode, tv);
+}
+
static ir_node *create_symconst(dbg_info *dbgi, ir_mode *mode,
ir_entity *entity)
{
return deref_address(irtype, sel, dbgi);
}
+ case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
+ return declaration->v.vla_base;
+
case DECLARATION_KIND_COMPOUND_MEMBER:
case DECLARATION_KIND_LABEL_BLOCK:
panic("not implemented reference type");
return sel;
}
+ case DECLARATION_KIND_VARIABLE_LENGTH_ARRAY:
+ return declaration->v.vla_base;
+
case DECLARATION_KIND_ENUM_ENTRY:
panic("trying to reference enum entry");
ir_node *offset;
if(is_type_pointer(type)) {
pointer_type_t *pointer_type = &type->pointer;
- unsigned elem_size = get_type_size(pointer_type->points_to);
- offset = new_Const_long(mode_int, elem_size);
+ offset = get_type_size(pointer_type->points_to);
} else {
assert(is_type_arithmetic(type));
offset = new_Const(mode, get_mode_one(mode));
node = do_strict_conv(dbgi, node);
return node;
} else {
+ /* make sure firm type is constructed */
+ (void) get_ir_type(type);
return value_node;
}
}
panic("invalid UNEXPR type found");
}
-static ir_node *create_lazy_op(const binary_expression_t *expression)
+static ir_node *produce_condition_result(const expression_t *expression,
+ dbg_info *dbgi)
{
- dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
- type_t *type = expression->base.type;
- ir_mode *mode = get_ir_mode(type);
-
- if(is_constant_expression(expression->left)) {
- long val = fold_constant(expression->left);
- expression_kind_t ekind = expression->base.kind;
- if((ekind == EXPR_BINARY_LOGICAL_AND && val != 0)
- || (ekind == EXPR_BINARY_LOGICAL_OR && val == 0)) {
- return expression_to_firm(expression->right);
- } else {
- assert((ekind == EXPR_BINARY_LOGICAL_AND && val == 0)
- || (ekind == EXPR_BINARY_LOGICAL_OR && val != 0));
- return new_Const(mode, get_mode_one(mode));
- }
- }
-
+ ir_mode *mode = get_ir_mode(expression->base.type);
ir_node *cur_block = get_cur_block();
ir_node *one_block = new_immBlock();
ir_node *jmp_zero = new_d_Jmp(dbgi);
set_cur_block(cur_block);
- create_condition_evaluation((const expression_t*) expression,
- one_block, zero_block);
+ create_condition_evaluation(expression, one_block, zero_block);
mature_immBlock(one_block);
mature_immBlock(zero_block);
return val;
}
+static ir_node *create_lazy_op(const binary_expression_t *expression)
+{
+ dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
+ type_t *type = expression->base.type;
+ ir_mode *mode = get_ir_mode(type);
+
+ if(is_constant_expression(expression->left)) {
+ long val = fold_constant(expression->left);
+ expression_kind_t ekind = expression->base.kind;
+ if((ekind == EXPR_BINARY_LOGICAL_AND && val != 0)
+ || (ekind == EXPR_BINARY_LOGICAL_OR && val == 0)) {
+ return expression_to_firm(expression->right);
+ } else {
+ assert((ekind == EXPR_BINARY_LOGICAL_AND && val == 0)
+ || (ekind == EXPR_BINARY_LOGICAL_OR && val != 0));
+ return new_Const(mode, get_mode_one(mode));
+ }
+ }
+
+ return produce_condition_result((const expression_t*) expression, dbgi);
+}
+
typedef ir_node * (*create_arithmetic_func)(dbg_info *dbgi, ir_node *left,
ir_node *right, ir_mode *mode);
{
pointer_type_t *const pointer_type = &type->pointer;
type_t *const points_to = pointer_type->points_to;
- const unsigned elem_size = get_type_size(points_to);
+ const unsigned elem_size = get_type_size_const(points_to);
assert(elem_size >= 1);
if (elem_size > 1) {
return new_d_Sub(dbgi, left, right, mode);
} else if (is_type_pointer(type_left) && is_type_pointer(type_right)) {
const pointer_type_t *const ptr_type = &type_left->pointer;
- const unsigned elem_size = get_type_size(ptr_type->points_to);
- ir_mode *const mode = get_ir_mode(type);
- ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
- ir_node *const cnst = new_Const_long(mode_int, (long)elem_size);
- ir_node *const no_mem = new_NoMem();
- ir_node *const div = new_d_Div(dbgi, no_mem, sub, cnst, mode,
- op_pin_state_floats);
+
+ ir_node *const elem_size = get_type_size(ptr_type->points_to);
+ ir_mode *const mode = get_ir_mode(type);
+ ir_node *const conv_size = new_d_Conv(dbgi, elem_size, mode);
+ ir_node *const sub = new_d_Sub(dbgi, left, right, mode);
+ ir_node *const no_mem = new_NoMem();
+ ir_node *const div = new_d_DivRL(dbgi, no_mem, sub, conv_size, mode,
+ op_pin_state_floats);
return new_d_Proj(dbgi, div, mode, pn_Div_res);
}
assert(is_type_pointer(ref_type));
pointer_type_t *pointer_type = &ref_type->pointer;
- unsigned elem_size = get_type_size(pointer_type->points_to);
- ir_node *elem_size_const = new_Const_long(mode_uint, elem_size);
+ ir_node *elem_size_const = get_type_size(pointer_type->points_to);
ir_node *real_offset = new_d_Mul(dbgi, offset, elem_size_const,
mode_uint);
ir_node *result = new_d_Add(dbgi, base_addr, real_offset, mode_P_data);
assert(type != NULL);
}
- ir_mode *const mode = get_ir_mode(expression->base.type);
- symconst_symbol sym;
- sym.type_p = get_ir_type(type);
- return new_SymConst(mode, sym, symconst_type_size);
+ type = skip_typeref(type);
+ /* § 6.5.3.4 (2) if the type is a VLA, evaluate the expression. */
+ if(is_type_array(type) && type->array.is_vla
+ && expression->tp_expression != NULL) {
+ expression_to_firm(expression->tp_expression);
+ }
+
+ return get_type_size(type);
}
/**
static ir_node *classify_type_to_firm(const classify_type_expression_t *const expr)
{
- const type_t *const type = expr->type_expression->base.type;
+ const type_t *const type = skip_typeref(expr->type_expression->base.type);
gcc_type_class tc;
switch (type->kind)
{
case TYPE_ATOMIC: {
const atomic_type_t *const atomic_type = &type->atomic;
- switch (atomic_type->akind) {
+ switch ((atomic_type_kind_t) atomic_type->akind) {
/* should not be reached */
case ATOMIC_TYPE_INVALID:
tc = no_type_class;
- break;
+ goto make_const;
/* gcc cannot do that */
case ATOMIC_TYPE_VOID:
tc = void_type_class;
- break;
+ goto make_const;
case ATOMIC_TYPE_CHAR: /* gcc handles this as integer */
case ATOMIC_TYPE_SCHAR: /* gcc handles this as integer */
case ATOMIC_TYPE_ULONGLONG:
case ATOMIC_TYPE_BOOL: /* gcc handles this as integer */
tc = integer_type_class;
- break;
+ goto make_const;
case ATOMIC_TYPE_FLOAT:
case ATOMIC_TYPE_DOUBLE:
case ATOMIC_TYPE_LONG_DOUBLE:
tc = real_type_class;
- break;
+ goto make_const;
-#ifdef PROVIDE_COMPLEX
case ATOMIC_TYPE_FLOAT_COMPLEX:
case ATOMIC_TYPE_DOUBLE_COMPLEX:
case ATOMIC_TYPE_LONG_DOUBLE_COMPLEX:
tc = complex_type_class;
- break;
+ goto make_const;
case ATOMIC_TYPE_FLOAT_IMAGINARY:
case ATOMIC_TYPE_DOUBLE_IMAGINARY:
case ATOMIC_TYPE_LONG_DOUBLE_IMAGINARY:
tc = complex_type_class;
- break;
-#endif
-
- default:
- panic("Unimplemented case in classify_type_to_firm().");
+ goto make_const;
}
- break;
+ panic("Unexpected atomic type in classify_type_to_firm().");
}
+ case TYPE_BITFIELD: tc = integer_type_class; goto make_const;
case TYPE_ARRAY: /* gcc handles this as pointer */
case TYPE_FUNCTION: /* gcc handles this as pointer */
- case TYPE_POINTER: tc = pointer_type_class; break;
- case TYPE_COMPOUND_STRUCT: tc = record_type_class; break;
- case TYPE_COMPOUND_UNION: tc = union_type_class; break;
+ case TYPE_POINTER: tc = pointer_type_class; goto make_const;
+ case TYPE_COMPOUND_STRUCT: tc = record_type_class; goto make_const;
+ case TYPE_COMPOUND_UNION: tc = union_type_class; goto make_const;
/* gcc handles this as integer */
- case TYPE_ENUM: tc = integer_type_class; break;
-
- default:
- panic("Unimplemented case in classify_type_to_firm().");
+ case TYPE_ENUM: tc = integer_type_class; goto make_const;
+
+ case TYPE_BUILTIN:
+ /* typedef/typeof should be skipped already */
+ case TYPE_TYPEDEF:
+ case TYPE_TYPEOF:
+ case TYPE_INVALID:
+ case TYPE_ERROR:
+ break;
}
+ panic("unexpected TYPE classify_type_to_firm().");
+make_const: ;
dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
ir_mode *const mode = mode_int;
tarval *const tv = new_tarval_from_long(tc, mode);
return current_function_name;
}
+static ir_node *funcsig_to_firm(
+ const string_literal_expression_t *const expr)
+{
+ if (current_funcsig == NULL) {
+ const source_position_t *const src_pos = &expr->base.source_position;
+ ir_entity *ent = get_irg_entity(current_ir_graph);
+ const char *const name = get_entity_ld_name(ent);
+ const string_t string = { name, strlen(name) + 1 };
+ current_funcsig = string_to_firm(src_pos, "__FUNCSIG__", &string);
+ }
+
+ return current_funcsig;
+}
+
static ir_node *statement_expression_to_firm(const statement_expression_t *expr)
{
statement_t *statement = expr->statement;
ir_node *const arg_sel =
new_d_simpleSel(dbgi, no_mem, arg_base, parm_ent);
- size_t const parm_size = get_type_size(expr->parameter->type);
- ir_node *const cnst = new_Const_long(mode_uint, parm_size);
+ ir_node *const cnst = get_type_size(expr->parameter->type);
ir_node *const add = new_d_Add(dbgi, arg_sel, cnst, mode_P_data);
set_value_for_expression(expr->ap, add);
dbg_info *const dbgi = get_dbg_info(&expr->base.source_position);
ir_node *const res = deref_address(irtype, ap, dbgi);
- size_t const parm_size = get_type_size(expr->base.type);
- ir_node *const cnst = new_Const_long(mode_uint, parm_size);
+ ir_node *const cnst = get_type_size(expr->base.type);
ir_node *const add = new_d_Add(dbgi, ap, cnst, mode_P_data);
set_value_for_expression(expr->ap, add);
static ir_node *_expression_to_firm(const expression_t *expression)
{
switch(expression->kind) {
- case EXPR_CHAR_CONST:
- return char_const_to_firm(&expression->conste);
+ case EXPR_CHARACTER_CONSTANT:
+ return character_constant_to_firm(&expression->conste);
+ case EXPR_WIDE_CHARACTER_CONSTANT:
+ return wide_character_constant_to_firm(&expression->conste);
case EXPR_CONST:
return const_to_firm(&expression->conste);
case EXPR_STRING_LITERAL:
return classify_type_to_firm(&expression->classify_type);
case EXPR_FUNCTION:
case EXPR_PRETTY_FUNCTION:
+ case EXPR_FUNCDNAME:
return function_name_to_firm(&expression->string);
+ case EXPR_FUNCSIG:
+ return funcsig_to_firm(&expression->string);
case EXPR_STATEMENT:
return statement_expression_to_firm(&expression->statement);
case EXPR_VA_START:
if(res != NULL && get_irn_mode(res) == mode_b) {
ir_mode *mode = get_ir_mode(expression->base.type);
- res = create_conv(NULL, res, mode);
+ if(is_Const(res)) {
+ if(is_Const_null(res)) {
+ return new_Const_long(mode, 0);
+ } else {
+ assert(is_Const_one(res));
+ return new_Const_long(mode, 1);
+ }
+ }
+
+ dbg_info *dbgi = get_dbg_info(&expression->base.source_position);
+ return produce_condition_result(expression, dbgi);
}
return res;
if(is_type_compound(type)) {
fprintf(stderr, ".%s", entry->compound_entry->symbol->string);
} else if(is_type_array(type)) {
- fprintf(stderr, "[%u]", entry->index);
+ fprintf(stderr, "[%zd]", entry->index);
} else {
fprintf(stderr, "-INVALID-");
}
top->compound_entry = entry;
top->index = 0;
- path->top_type = entry->type;
len = get_compound_size(&top_type->compound);
+ if(entry != NULL)
+ path->top_type = entry->type;
} else {
assert(is_type_array(top_type));
assert(top_type->array.size > 0);
static ir_initializer_t *create_ir_initializer_string(
const initializer_string_t *initializer, type_t *type)
{
+ type = skip_typeref(type);
+
size_t string_len = initializer->string.size;
assert(type->kind == TYPE_ARRAY && type->array.size_constant);
size_t len = type->array.size;
{
switch(get_initializer_kind(initializer)) {
case IR_INITIALIZER_NULL: {
- ir_mode *mode = get_type_mode(type);
/* TODO: implement this for compound types... */
assert(type != NULL);
+
+ ir_mode *mode = get_type_mode(type);
tarval *zero = get_mode_null(mode);
ir_node *cnst = new_d_Const(dbgi, mode, zero);
}
}
+static void create_variable_length_array(declaration_t *declaration)
+{
+ dbg_info *dbgi = get_dbg_info(&declaration->source_position);
+ type_t *type = declaration->type;
+ ir_node *mem = get_store();
+ ir_type *el_type = get_ir_type(type->array.element_type);
+
+ /* make sure size_node is calculated */
+ get_type_size(type);
+ ir_node *elems = type->array.size_node;
+ ir_node *alloc = new_d_Alloc(dbgi, mem, elems, el_type, stack_alloc);
+
+ ir_node *proj_m = new_d_Proj(dbgi, alloc, mode_M, pn_Alloc_M);
+ ir_node *addr = new_d_Proj(dbgi, alloc, mode_P_data, pn_Alloc_res);
+ set_store(proj_m);
+
+ /* initializers are not allowed for VLAs */
+ assert(declaration->init.initializer == NULL);
+
+ declaration->declaration_kind = DECLARATION_KIND_VARIABLE_LENGTH_ARRAY;
+ declaration->v.vla_base = addr;
+
+ /* TODO: record VLA somewhere so we create the free node when we leave
+ * it's scope */
+}
+
/**
* Creates a Firm local variable from a declaration.
*/
bool needs_entity = declaration->address_taken;
type_t *type = skip_typeref(declaration->type);
- if(is_type_array(type) || is_type_compound(type)) {
+ /* is it a variable length array? */
+ if(is_type_array(type) && !type->array.size_constant) {
+ create_variable_length_array(declaration);
+ return;
+ } else if(is_type_array(type) || is_type_compound(type)) {
needs_entity = true;
}
switch(statement->kind) {
case STATEMENT_INVALID:
panic("invalid statement found");
+ return;
+ case STATEMENT_EMPTY:
+ /* nothing */
+ return;
case STATEMENT_COMPOUND:
compound_statement_to_firm(&statement->compound);
return;
}
static int count_decls_in_expression(const expression_t *expression) {
+ int count = 0;
+
if(expression == NULL)
return 0;
- switch(expression->base.kind) {
+ switch((expression_kind_t) expression->base.kind) {
case EXPR_STATEMENT:
return count_decls_in_stmts(expression->statement.statement);
EXPR_BINARY_CASES {
EXPR_UNARY_CASES
return count_decls_in_expression(expression->unary.value);
case EXPR_CALL: {
- int count = 0;
call_argument_t *argument = expression->call.arguments;
for( ; argument != NULL; argument = argument->next) {
count += count_decls_in_expression(argument->expression);
return count;
}
- default:
+ case EXPR_UNKNOWN:
+ case EXPR_INVALID:
+ panic("unexpected expression kind");
+
+ case EXPR_COMPOUND_LITERAL:
+ /* TODO... */
+ break;
+
+ case EXPR_CONDITIONAL:
+ count += count_decls_in_expression(expression->conditional.condition);
+ count += count_decls_in_expression(expression->conditional.true_expression);
+ count += count_decls_in_expression(expression->conditional.false_expression);
+ return count;
+
+ case EXPR_BUILTIN_PREFETCH:
+ count += count_decls_in_expression(expression->builtin_prefetch.adr);
+ count += count_decls_in_expression(expression->builtin_prefetch.rw);
+ count += count_decls_in_expression(expression->builtin_prefetch.locality);
+ return count;
+
+ case EXPR_BUILTIN_CONSTANT_P:
+ count += count_decls_in_expression(expression->builtin_constant.value);
+ return count;
+
+ case EXPR_SELECT:
+ count += count_decls_in_expression(expression->select.compound);
+ return count;
+
+ case EXPR_ARRAY_ACCESS:
+ count += count_decls_in_expression(expression->array_access.array_ref);
+ count += count_decls_in_expression(expression->array_access.index);
+ return count;
+
+ case EXPR_CLASSIFY_TYPE:
+ count += count_decls_in_expression(expression->classify_type.type_expression);
+ return count;
+
+ case EXPR_SIZEOF:
+ case EXPR_ALIGNOF: {
+ expression_t *tp_expression = expression->typeprop.tp_expression;
+ if (tp_expression != NULL) {
+ count += count_decls_in_expression(tp_expression);
+ }
+ return count;
+ }
+
+ case EXPR_OFFSETOF:
+ case EXPR_REFERENCE:
+ case EXPR_CONST:
+ case EXPR_CHARACTER_CONSTANT:
+ case EXPR_WIDE_CHARACTER_CONSTANT:
+ case EXPR_STRING_LITERAL:
+ case EXPR_WIDE_STRING_LITERAL:
+ case EXPR_FUNCTION:
+ case EXPR_PRETTY_FUNCTION:
+ case EXPR_FUNCSIG:
+ case EXPR_FUNCDNAME:
+ case EXPR_BUILTIN_SYMBOL:
+ case EXPR_VA_START:
+ case EXPR_VA_ARG:
break;
}
int count = 0;
for (; stmt != NULL; stmt = stmt->base.next) {
switch (stmt->kind) {
+ case STATEMENT_EMPTY:
+ break;
+
case STATEMENT_DECLARATION: {
const declaration_statement_t *const decl_stmt = &stmt->declaration;
count += count_local_declarations(decl_stmt->declarations_begin,
current_function_decl = declaration;
current_function_name = NULL;
+ current_funcsig = NULL;
assert(imature_blocks == NULL);
imature_blocks = NEW_ARR_F(ir_node*, 0);