BOOL break_add_condition(int num, struct expr* exp)
{
if (num <= 0 || num >= dbg_curr_process->next_bp ||
!dbg_curr_process->bp[num].refcount)
{
dbg_printf("Invalid breakpoint number %d\n", num);
return FALSE;
}
if (dbg_curr_process->bp[num].condition != NULL)
{
expr_free(dbg_curr_process->bp[num].condition);
dbg_curr_process->bp[num].condition = NULL;
}
if (exp != NULL) dbg_curr_process->bp[num].condition = expr_clone(exp, NULL);
return TRUE;
}
struct expr *eval_binary_op(struct evaluator_state *state, struct expr* e, struct env_node *env) {
assert(e->type == EXPR_BINARY);
switch (e->binary_op.op) {
case BIN_MEMBER: {
// if left is union:
// return eval(x.right_ident for x in left_union)
// else:
// return lookup(left_obj, right_ident)
assert(e->binary_op.right->type == EXPR_IDENT);
struct expr *left = eval_footprint_expr(state, e->binary_op.left, env);
if (left->type == EXPR_UNION) {
char *loop_var_name = new_ident_not_in(env, "loop_var");
struct expr *loop_var_ident = expr_new_with(e->direction, EXPR_IDENT);
loop_var_ident->ident = loop_var_name;
struct expr *loop_body = expr_new();
memcpy(loop_body, e, sizeof(struct expr));
loop_body->binary_op.left = loop_var_ident;
struct expr *loop = expr_new_with(e->direction, EXPR_FOR);
loop->for_loop.body = loop_body;
loop->for_loop.ident = loop_var_name;
loop->for_loop.over = left;
return eval_footprint_expr(state, loop, env);
} else if (left->type == EXPR_OBJECT) {
return lookup_in_object(&left->object, e->binary_op.right->ident, e->direction);
} else {
assert(false);
}
}
break;
case BIN_APP: {
struct expr *left = eval_footprint_expr(state, e->binary_op.left, env);
struct expr *right = e->binary_op.right;
assert(left->type == EXPR_FUNCTION);
assert(right->type == EXPR_FUNCTION_ARGS);
struct function func = left->func;
struct env_node *function_env = env;
struct string_node *current_arg_name = func.args;
struct union_node *current_arg_value = e->binary_op.right->unioned;
while (current_arg_value != NULL) {
assert(current_arg_name != NULL); // not too many arguments
struct expr *e = eval_footprint_expr(state, current_arg_value->expr, env);
function_env = env_new_with(current_arg_name->value, e, function_env);
current_arg_name = current_arg_name->next;
current_arg_value = current_arg_value->next;
}
assert(current_arg_name == NULL); // not too few arguments
function_env = env_new_with(func.name, construct_function(func, e->direction), function_env);
struct expr *new_expr = expr_clone(func.expr);
set_direction_recursive(new_expr, e->direction);
return eval_footprint_expr(state, new_expr, function_env);
}
break;
default: {
int64_t left, right;
_Bool left_success, right_success;
struct expr *partial_left, *partial_right;
left_success = eval_to_value(state, e->binary_op.left, env, &partial_left, &left);
right_success = eval_to_value(state, e->binary_op.right, env, &partial_right, &right);
if (!left_success || !right_success) {
// cache miss, state modified
struct expr *new_expr = expr_clone(e);
if (left_success) {
new_expr->binary_op.left = construct_value(left, e->direction);
} else {
new_expr->binary_op.left = partial_left;
}
if (right_success) {
new_expr->binary_op.right = construct_value(right, e->direction);
} else {
new_expr->binary_op.right = partial_right;
}
return new_expr;
}
switch (e->binary_op.op) {
case BIN_GT: {
return construct_value(left > right ? 1 : 0, e->direction);
}
break;
case BIN_LT: {
return construct_value(left < right ? 1 : 0, e->direction);
}
break;
case BIN_GTE: {
return construct_value(left >= right ? 1 : 0, e->direction);
}
break;
case BIN_LTE: {
return construct_value(left <= right ? 1 : 0, e->direction);
}
break;
case BIN_EQ: {
return construct_value(left == right ? 1 : 0, e->direction);
}
break;
case BIN_NE: {
return construct_value(left != right ? 1 : 0, e->direction);
}
break;
case BIN_AND: {
return construct_value(!!left && !!right ? 1 : 0, e->direction);
}
break;
case BIN_OR: {
return construct_value(!!left || !!right ? 1 : 0, e->direction);
}
break;
case BIN_ADD: {
return construct_value(left + right, e->direction);
}
break;
case BIN_SUB: {
return construct_value(left - right, e->direction);
}
break;
case BIN_MUL: {
return construct_value(left * right, e->direction);
}
break;
case BIN_DIV: {
return construct_value(left / right, e->direction);
}
break;
case BIN_MOD: {
return construct_value(left % right, e->direction);
}
break;
case BIN_SHL: {
return construct_value(left << right, e->direction);
}
break;
case BIN_SHR: {
return construct_value(left >> right, e->direction);
}
break;
case BIN_BITAND: {
return construct_value(left & right, e->direction);
}
break;
case BIN_BITOR: {
return construct_value(left | right, e->direction);
}
break;
case BIN_BITXOR: {
return construct_value(left ^ right, e->direction);
}
break;
default:
assert(false);
break;
}
}
break;
}
}
