path: root/util.c

/* Oort
 * Copyright 2007, Soren Sandmann Pedersen
 *
 * 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 "ast.h"
#include <glib.h>
#include <glib/gprintf.h>
#include <string.h>

struct set_t
{
    GPtrArray *elements;
};

set_t *
set_new_full (void)
{
    set_t *set = g_new0 (set_t, 1);

    set->elements = NULL;

    return set;
}

set_t *
set_new (void)
{
    set_t *set = g_new0 (set_t, 1);

    set->elements = g_ptr_array_new ();

    return set;
}

#define IS_FULL(set)	(set->elements == NULL)

set_t *
set_copy (set_t *orig)
{
    if (IS_FULL (orig))
    {
	return set_new_full ();
    }
    else
    {
	set_t *copy = set_new ();
	int i;

	for (i = 0; i < orig->elements->len; ++i)
	    g_ptr_array_add (copy->elements, orig->elements->pdata[i]);

	return copy;
    }
}


void
set_free (set_t *s)
{
    if (!IS_FULL (s))
	g_ptr_array_free (s->elements, TRUE);

    g_free (s);
}

gboolean
set_contains (set_t *set, gpointer element)
{
    if (IS_FULL (set))
    {
	return TRUE;
    }
    else
    {
	int i;

	for (i = 0; i < set->elements->len; ++i)
	{
	    if (set->elements->pdata[i] == element)
		return TRUE;
	}
    }

    return FALSE;
}

void
set_intersect (set_t *s1, set_t *s2)
{
    if (IS_FULL (s1))
    {
	set_t *tmp = set_copy (s2);

	s1->elements = tmp->elements;

	g_free (tmp);
    }
    else
    {
	int i;
	GPtrArray *new_elts = g_ptr_array_new ();

	for (i = 0; i < s1->elements->len; ++i)
	{
	    gpointer element = s1->elements->pdata[i];

	    if (set_contains (s2, element))
		g_ptr_array_add (new_elts, element);
	}

	g_ptr_array_free (s1->elements, TRUE);
	s1->elements = new_elts;
    }
}

gboolean
set_subset_eq (set_t *s1, set_t *s2)
{
    int i;

    if (IS_FULL (s1))
    {
	return IS_FULL (s2);
    }
    else
    {
	for (i = 0; i < s1->elements->len; ++i)
	{
	    if (!set_contains (s2, s1->elements->pdata[i]))
		return FALSE;
	}
    }

    return TRUE;
}

gboolean
set_equal (set_t *s1,
	   set_t *s2)
{
    return set_subset_eq (s1, s2) && set_subset_eq (s2, s1);
}

void
set_add (set_t *s1,
	 gpointer element)
{
    if (IS_FULL (s1))
	return;

    g_ptr_array_add (s1->elements, element);
}

/* Make up an internal name that contain a $ so it can't conflict
 * with a user name
 */
char *
unique_name (const char *prefix)
{
    static int count = 0;

    return g_strdup_printf ("%s$%d", prefix, count++);
}

/* Count the number of elements in a null terminated
 * array of pointers
 */
int
array_length (gpointer *arr)
{
    int i;

    for (i = 0; arr[i] != NULL; ++i)
	;

    return i;
}

/* Evaluate expressions
 */
void
evaluate_binary_operator (ast_binary_operator_t  op,
			  const ast_type_spec_t	*left_type,
			  const value_t		*left,
			  const ast_type_spec_t	*right_type,
			  const value_t		*right,
			  const ast_type_spec_t	*result_type,
			  value_t		*result)
{
#define INT32_OP(op)							\
    result->int32_val = left->int32_val op right->int32_val;

#define TYPED_BINOP(op)							\
    if (is_int32)							\
	result->int32_val = left->int32_val op right->int32_val;	\
    else								\
	result->double_val = left->double_val op right->double_val;

#define TYPED_COMPOUND(op)						\
    interprete_expression (expr.left, env, &left);			\
    interprete_expression (expr.right, env, result);			\
    if (is_int32)							\
	result->int32_val = left->int32_val op right->int32_val;	\
    else								\
	result->double_val = left->double_val op right->double_val;	\
    location = get_address (expr.left, env);				\
    write_value (location, expr.common.type_spec, result);

#define INT32_COMPOUND(op)						\
    interprete_expression (expr.left, env, &left);			\
    interprete_expression (expr.right, env, result);			\
    result->int32_val = left->int32_val op right->int32_val;		\
    location = get_address (expr.left, env);				\
    write_value (location, expr.common.type_spec, result);

#define RELATIONAL(op)							\
    if (left_type->common.type == AST_INT32_TYPE)			\
	result->bool_val = left->int32_val op right->int32_val;		\
    else								\
	result->bool_val = left->double_val op right->double_val;

#define EQUALITY(op)							\
    if (left_type->common.type == AST_INT32_TYPE)			\
	result->bool_val = left->int32_val op right->int32_val;		\
    else if (left_type->common.type == AST_DOUBLE_TYPE)			\
	result->bool_val = left->double_val op right->double_val;	\
    else if (left_type->common.type == AST_BOOL_TYPE)			\
	result->bool_val = left->bool_val op right->bool_val;		\
    else if (left_type->common.type == AST_FUNCTION_TYPE)		\
	result->bool_val = left->closure_val.function op right->closure_val.function; \
    else if (left_type->common.type == AST_OBJECT_TYPE)			\
	result->bool_val = left->pointer_val op right->pointer_val;	\
    else if (left_type->common.type == AST_ARRAY_TYPE)			\
	result->bool_val = left->pointer_val op right->pointer_val;	\
    else								\
    {									\
	g_print ("bad type: %d\n", left_type->common.type);		\
	g_assert_not_reached();						\
    }

    gboolean is_int32 = result_type->common.type == AST_INT32_TYPE;

    switch (op)
    {
    case AST_PLUS:
	TYPED_BINOP(+);
	break;

    case AST_MINUS:
	TYPED_BINOP(-);
	break;

    case AST_TIMES:
	TYPED_BINOP(*);
	break;

    case AST_DIVIDE:
	/* FIXME: divide by zero */
	TYPED_BINOP(/);
	break;

    case AST_MOD:
	/* FIXME: divide by zero */
	INT32_OP(%);
	break;

    case AST_LSHIFT:
	INT32_OP(<<);
	break;

    case AST_RSHIFT:
	INT32_OP(>>);
	break;

    case AST_LT:
	RELATIONAL(<);
	break;

    case AST_GT:
	RELATIONAL(>);
	break;

    case AST_LTE:
	RELATIONAL(<=);
	break;

    case AST_GTE:
	RELATIONAL(>=);
	break;

    case AST_EQUAL:
	EQUALITY(==);
	break;

    case AST_NOT_EQUAL:
	EQUALITY(!=);
	break;

    case AST_BOR:
	result->int32_val = left->int32_val | right->int32_val;
	break;

    case AST_BXOR:
	result->int32_val = left->int32_val ^ right->int32_val;
	break;

    case AST_BAND:
	result->int32_val = left->int32_val & right->int32_val;
	break;

    case AST_ASSIGN:
	*result = *right;
	break;

    case AST_OR:
	result->bool_val = left->bool_val || right->bool_val;
	break;

    case AST_AND:
	result->bool_val = left->bool_val && right->bool_val;
	break;
    }
}

void
evaluate_unary_operator (ast_unary_operator_t   op,
			 const ast_type_spec_t *child_type,
			 const value_t         *child,
			 const ast_type_spec_t *result_type,
			 value_t               *result)
{
    switch (op)
    {
    case AST_UNARY_NOT:
	result->bool_val = !child->bool_val;
	break;

    case AST_UNARY_MINUS:
	if (result_type->common.type == AST_INT32_TYPE)
	    result->int32_val = -child->int32_val;
	else
	    result->double_val = -child->double_val;
	break;

    case AST_POSTFIX_DEC:
    case AST_POSTFIX_INC:
    case AST_UNARY_PLUS:
	*result = *child;
	break;

    case AST_UNARY_BNEG:
	result->int32_val = ~child->int32_val;
	break;

    case AST_PREFIX_INC:
	result->int32_val = child->int32_val + 1;
	break;

    case AST_PREFIX_DEC:
	result->int32_val = child->int32_val - 1;
	break;
    }
}

gchar *
value_to_string (value_t *val, ast_type_spec_t *type)
{
    switch (type->common.type)
    {
    case AST_INT32_TYPE:
	return g_strdup_printf  ("%d", val->int32_val);
	break;

    case AST_LABEL_TYPE:
	return g_strdup_printf ("<label %p>\n", val->label_val.label);
	break;

    case AST_ARRAY_TYPE:
	return g_strdup_printf ("<array %p>", val->pointer_val);
	break;

    case AST_DOUBLE_TYPE:
	return g_strdup_printf ("%f", val->double_val);
	break;

    case AST_STRING_TYPE:
	return g_strdup_printf ("%s", (char *)val->pointer_val);
	break;

    case AST_BOOL_TYPE:
	return g_strdup_printf ("%s", val->bool_val ? "true" : "false");
	break;

    case AST_VOID_TYPE:
	return g_strdup_printf  ("<void>");
	break;

    case AST_OBJECT_TYPE:
	return g_strdup_printf  ("<object %p of type %s>",
				 val->pointer_val, type->object.class->name);
	break;

    case AST_NULL_TYPE:
	return g_strdup_printf  ("<null: %p>", val->pointer_val);
	break;

    case AST_FUNCTION_TYPE:
	return g_strdup_printf  (
	    "<function %s>", val->closure_val.function->name);
	break;

    case AST_IDENTIFIER_TYPE:
    case AST_INFERRED_TYPE:
	/* These shouldn't happen, so just fall through to the default return */
	break;
    }

    return g_strdup ("BUG: value has unknown type");
}

void
print_value (value_t *val, ast_type_spec_t *type_spec)
{
    char *s = value_to_string (val, type_spec);

    g_print ("%s\n", s);

    g_free (s);
}

gboolean
report_error (const char *fmt, ...)
{
    va_list ap;

    va_start (ap, fmt);

    g_vprintf (fmt, ap);

    va_end (ap);

    return FALSE;
}

void
program_breadth_first (ast_program_t   *program,
		       node_callback_t  callback,
		       gpointer	        data)
{
    int i;

    node_breadth_first (program->enter, callback, data);
    for (i = 0; program->functions[i]; ++i)
	node_breadth_first (program->functions[i]->enter, callback, data);
}