/*
* This file is part of cparser.
- * Copyright (C) 2007-2009 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.
+ * Copyright (C) 2012 Matthias Braun <matze@braunis.de>
*/
#include <config.h>
#include "type_t.h"
#include "parser.h"
#include "lang_features.h"
-#include "entity_t.h"
#include "printer.h"
#include "separator_t.h"
#include "types.h"
-#include <assert.h>
-#include <stdio.h>
-#include <stdlib.h>
#include <ctype.h>
-#if defined(__INTEL_COMPILER)
-#include <mathimf.h>
-#elif defined(__CYGWIN__)
-#include "win32/cygwin_math_ext.h"
-#else
-#include <math.h>
-#endif
-
#include "adt/error.h"
#include "adt/util.h"
[EXPR_UNARY_DELETE] = PREC_UNARY,
[EXPR_UNARY_DELETE_ARRAY] = PREC_UNARY,
[EXPR_UNARY_THROW] = PREC_ASSIGNMENT,
+ [EXPR_UNARY_IMAG] = PREC_UNARY,
+ [EXPR_UNARY_REAL] = PREC_UNARY,
[EXPR_BINARY_ADD] = PREC_ADDITIVE,
[EXPR_BINARY_SUB] = PREC_ADDITIVE,
{
unsigned prec = get_expression_precedence(unexpr->base.kind);
switch (unexpr->base.kind) {
- case EXPR_UNARY_NEGATE: print_char ('-' ); break;
- case EXPR_UNARY_PLUS: print_char ('+' ); break;
- case EXPR_UNARY_NOT: print_char ('!' ); break;
- case EXPR_UNARY_COMPLEMENT: print_char ('~' ); break;
- case EXPR_UNARY_PREFIX_INCREMENT: print_string("++"); break;
- case EXPR_UNARY_PREFIX_DECREMENT: print_string("--"); break;
- case EXPR_UNARY_DEREFERENCE: print_char ('*' ); break;
- case EXPR_UNARY_TAKE_ADDRESS: print_char ('&' ); break;
- case EXPR_UNARY_DELETE: print_string("delete "); break;
+ case EXPR_UNARY_NEGATE: print_char ('-' ); break;
+ case EXPR_UNARY_PLUS: print_char ('+' ); break;
+ case EXPR_UNARY_NOT: print_char ('!' ); break;
+ case EXPR_UNARY_COMPLEMENT: print_char ('~' ); break;
+ case EXPR_UNARY_PREFIX_INCREMENT: print_string("++"); break;
+ case EXPR_UNARY_PREFIX_DECREMENT: print_string("--"); break;
+ case EXPR_UNARY_DEREFERENCE: print_char ('*' ); break;
+ case EXPR_UNARY_TAKE_ADDRESS: print_char ('&' ); break;
+ case EXPR_UNARY_DELETE: print_string("delete "); break;
case EXPR_UNARY_DELETE_ARRAY: print_string("delete [] "); break;
+ case EXPR_UNARY_REAL: print_string("__real__ "); break;
+ case EXPR_UNARY_IMAG: print_string("__imag__ "); break;
case EXPR_UNARY_POSTFIX_INCREMENT:
print_expression_prec(unexpr->value, prec);
print_assignment_expression(unexpr->value);
print_char(')');
return;
-
case EXPR_UNARY_THROW:
if (unexpr->value == NULL) {
print_string("throw");
if (designator->symbol == NULL) {
print_char('[');
print_expression(designator->array_index);
+ if (designator->range_last) {
+ print_string(" ... ");
+ print_expression(designator->range_last);
+ }
print_char(']');
} else {
print_char('.');
for (size_t i = 0; i < initializer->list.len; ++i) {
initializer_t *sub_initializer = initializer->list.initializers[i];
expression_classification_t const cur = is_constant_initializer(sub_initializer);
- if (all > cur) {
- all = cur;
- }
+ all = MIN(all, cur);
}
return all;
}
case EXPR_ARRAY_ACCESS: {
expression_classification_t const ref = is_linker_constant(expression->array_access.array_ref);
expression_classification_t const idx = is_constant_expression(expression->array_access.index);
- return ref < idx ? ref : idx;
+ return MIN(ref, idx);
}
case EXPR_REFERENCE: {
if (is_type_pointer(ltype)) {
expression_classification_t const l = is_linker_constant(left);
expression_classification_t const r = is_constant_expression(right);
- return l < r ? l : r;
+ return MIN(l, r);
} else if (is_type_pointer(rtype)) {
expression_classification_t const l = is_constant_expression(left);
expression_classification_t const r = is_linker_constant(right);
- return l < r ? l : r;
+ return MIN(l, r);
} else if (!is_type_valid(ltype) || !is_type_valid(rtype)) {
return EXPR_CLASS_ERROR;
} else {
case EXPR_CONDITIONAL: {
expression_t *const c = expression->conditional.condition;
expression_classification_t const cclass = is_constant_expression(c);
- if (cclass != EXPR_CLASS_CONSTANT)
+ if (cclass < EXPR_CLASS_CONSTANT)
return cclass;
if (fold_constant_to_bool(c)) {
array_access_expression_t const* const array_access =
&expression->array_access;
expression_classification_t const idx_class = is_constant_expression(array_access->index);
- if (idx_class != EXPR_CLASS_CONSTANT)
+ if (idx_class < EXPR_CLASS_CONSTANT)
return idx_class;
expression_classification_t const ref_addr = is_object_with_constant_address(array_access->array_ref);
expression_classification_t const ref_ptr = is_constant_pointer(array_access->array_ref);
- return ref_addr > ref_ptr ? ref_addr : ref_ptr;
+ return MAX(ref_addr, ref_ptr);
}
case EXPR_UNARY_DEREFERENCE:
case EXPR_ENUM_CONSTANT:
case EXPR_LITERAL_BOOLEAN:
case EXPR_LITERAL_MS_NOOP:
- return EXPR_CLASS_CONSTANT;
+ return EXPR_CLASS_INTEGER_CONSTANT;
{
type_t *type;
goto check_type;
case EXPR_LITERAL_INTEGER:
- case EXPR_LITERAL_FLOATINGPOINT:
type = skip_typeref(expression->base.type);
goto check_type;
goto check_type;
check_type:
+ return is_type_valid(type) ? EXPR_CLASS_INTEGER_CONSTANT : EXPR_CLASS_ERROR;
+ }
+
+ case EXPR_LITERAL_FLOATINGPOINT: {
+ type_t *const type = skip_typeref(expression->base.type);
return is_type_valid(type) ? EXPR_CLASS_CONSTANT : EXPR_CLASS_ERROR;
}
case EXPR_BUILTIN_CONSTANT_P: {
expression_classification_t const c = is_constant_expression(expression->builtin_constant.value);
- return c != EXPR_CLASS_ERROR ? EXPR_CLASS_CONSTANT : EXPR_CLASS_ERROR;
+ return c != EXPR_CLASS_ERROR ? EXPR_CLASS_INTEGER_CONSTANT : EXPR_CLASS_ERROR;
}
case EXPR_STRING_LITERAL:
case EXPR_UNARY_NOT:
return is_constant_expression(expression->unary.value);
+ case EXPR_UNARY_IMAG:
+ case EXPR_UNARY_REAL: {
+ type_t *type = skip_typeref(expression->base.type);
+ if (!is_type_valid(type))
+ return EXPR_CLASS_ERROR;
+ return is_constant_expression(expression->unary.value);
+ }
+
case EXPR_UNARY_CAST: {
type_t *const type = skip_typeref(expression->base.type);
+ if (is_type_integer(type)) {
+ expression_t *const val = expression->unary.value;
+ if (is_type_arithmetic(skip_typeref(val->base.type))) {
+ return val->kind == EXPR_LITERAL_FLOATINGPOINT
+ ? EXPR_CLASS_INTEGER_CONSTANT
+ : is_constant_expression(val);
+ }
+ }
if (is_type_scalar(type))
return is_constant_expression(expression->unary.value);
if (!is_type_valid(type))
case EXPR_BINARY_ISUNORDERED: {
expression_classification_t const l = is_constant_expression(expression->binary.left);
expression_classification_t const r = is_constant_expression(expression->binary.right);
- return l < r ? l : r;
+ return MIN(l, r);
}
case EXPR_BINARY_LOGICAL_AND: {
- expression_t const *const left = expression->binary.left;
- expression_classification_t const lclass = is_constant_expression(left);
- if (lclass != EXPR_CLASS_CONSTANT)
- return lclass;
+ expression_t const *const left = expression->binary.left;
+ expression_classification_t const lcls = is_constant_expression(left);
+ if (lcls < EXPR_CLASS_CONSTANT)
+ return lcls;
+ expression_classification_t const rcls = is_constant_expression(expression->binary.right);
+ if (lcls == EXPR_CLASS_INTEGER_CONSTANT && rcls == EXPR_CLASS_INTEGER_CONSTANT)
+ return EXPR_CLASS_INTEGER_CONSTANT;
if (!fold_constant_to_bool(left))
return EXPR_CLASS_CONSTANT;
- return is_constant_expression(expression->binary.right);
+ return MIN(rcls, EXPR_CLASS_CONSTANT);
}
case EXPR_BINARY_LOGICAL_OR: {
- expression_t const *const left = expression->binary.left;
- expression_classification_t const lclass = is_constant_expression(left);
- if (lclass != EXPR_CLASS_CONSTANT)
- return lclass;
+ expression_t const *const left = expression->binary.left;
+ expression_classification_t const lcls = is_constant_expression(left);
+ if (lcls < EXPR_CLASS_CONSTANT)
+ return lcls;
+ expression_classification_t const rcls = is_constant_expression(expression->binary.right);
+ if (lcls == EXPR_CLASS_INTEGER_CONSTANT && rcls == EXPR_CLASS_INTEGER_CONSTANT)
+ return EXPR_CLASS_INTEGER_CONSTANT;
if (fold_constant_to_bool(left))
return EXPR_CLASS_CONSTANT;
- return is_constant_expression(expression->binary.right);
+ return MIN(rcls, EXPR_CLASS_CONSTANT);
}
case EXPR_COMPOUND_LITERAL:
return is_constant_initializer(expression->compound_literal.initializer);
case EXPR_CONDITIONAL: {
- expression_t *const condition = expression->conditional.condition;
- expression_classification_t const cclass = is_constant_expression(condition);
- if (cclass != EXPR_CLASS_CONSTANT)
- return cclass;
-
- if (fold_constant_to_bool(condition)) {
- expression_t const *const t = expression->conditional.true_expression;
- return t == NULL ? EXPR_CLASS_CONSTANT : is_constant_expression(t);
- } else {
- return is_constant_expression(expression->conditional.false_expression);
- }
+ expression_t *const cond = expression->conditional.condition;
+ expression_classification_t const ccls = is_constant_expression(cond);
+ if (ccls < EXPR_CLASS_CONSTANT)
+ return ccls;
+ expression_t const *const t = expression->conditional.true_expression;
+ expression_classification_t const tcls = t == NULL ? ccls : is_constant_expression(t);
+ expression_classification_t const fcls = is_constant_expression(expression->conditional.false_expression);
+ if (ccls == EXPR_CLASS_INTEGER_CONSTANT &&
+ tcls == EXPR_CLASS_INTEGER_CONSTANT &&
+ fcls == EXPR_CLASS_INTEGER_CONSTANT)
+ return EXPR_CLASS_INTEGER_CONSTANT;
+ expression_classification_t const cls = fold_constant_to_bool(cond) ? tcls : fcls;
+ return MIN(cls, EXPR_CLASS_CONSTANT);
}
case EXPR_ERROR:
projects / cparser / blobdiff