mirror of
https://github.com/jerryscript-project/jerryscript.git
synced 2025-12-15 16:29:21 +00:00
4d2dd22ced
JerryScript-DCO-1.0-Signed-off-by: László Langó llango.u-szeged@partner.samsung.com JerryScript-DCO-1.0-Signed-off-by: Tamas Gergely tgergely.u-szeged@partner.samsung.com JerryScript-DCO-1.0-Signed-off-by: Zsolt Borbély zsborbely.u-szeged@partner.samsung.com JerryScript-DCO-1.0-Signed-off-by: Roland Takacs rtakacs.u-szeged@partner.samsung.com JerryScript-DCO-1.0-Signed-off-by: István Kádár ikadar@inf.u-szeged.hu JerryScript-DCO-1.0-Signed-off-by: Zoltan Herczeg zherczeg.u-szeged@partner.samsung.com
109 lines
3.0 KiB
C++
109 lines
3.0 KiB
C++
/* Copyright 2014-2016 Samsung Electronics Co., Ltd.
|
|
* Copyright 2015-2016 University of Szeged.
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#include "ecma-alloc.h"
|
|
#include "ecma-conversion.h"
|
|
#include "ecma-helpers.h"
|
|
#include "ecma-try-catch-macro.h"
|
|
#include "opcodes.h"
|
|
|
|
/** \addtogroup vm Virtual machine
|
|
* @{
|
|
*
|
|
* \addtogroup vm_opcodes Opcodes
|
|
* @{
|
|
*/
|
|
|
|
/**
|
|
* Perform ECMA number logic operation.
|
|
*
|
|
* The algorithm of the operation is following:
|
|
* leftNum = ToNumber (leftValue);
|
|
* rightNum = ToNumber (rightValue);
|
|
* result = leftNum BitwiseLogicOp rightNum;
|
|
*
|
|
* @return completion value
|
|
* Returned value must be freed with ecma_free_completion_value
|
|
*/
|
|
ecma_completion_value_t
|
|
do_number_bitwise_logic (number_bitwise_logic_op op, /**< number bitwise logic operation */
|
|
ecma_value_t left_value, /**< left value */
|
|
ecma_value_t right_value) /** right value */
|
|
{
|
|
ecma_completion_value_t ret_value = ecma_make_empty_completion_value ();
|
|
|
|
ECMA_OP_TO_NUMBER_TRY_CATCH (num_left, left_value, ret_value);
|
|
ECMA_OP_TO_NUMBER_TRY_CATCH (num_right, right_value, ret_value);
|
|
|
|
ecma_number_t* res_p = ecma_alloc_number ();
|
|
|
|
int32_t left_int32 = ecma_number_to_int32 (num_left);
|
|
|
|
uint32_t left_uint32 = ecma_number_to_uint32 (num_left);
|
|
uint32_t right_uint32 = ecma_number_to_uint32 (num_right);
|
|
|
|
switch (op)
|
|
{
|
|
case NUMBER_BITWISE_LOGIC_AND:
|
|
{
|
|
*res_p = ecma_int32_to_number ((int32_t) (left_uint32 & right_uint32));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_LOGIC_OR:
|
|
{
|
|
*res_p = ecma_int32_to_number ((int32_t) (left_uint32 | right_uint32));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_LOGIC_XOR:
|
|
{
|
|
*res_p = ecma_int32_to_number ((int32_t) (left_uint32 ^ right_uint32));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_SHIFT_LEFT:
|
|
{
|
|
*res_p = ecma_int32_to_number (left_int32 << (right_uint32 & 0x1F));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_SHIFT_RIGHT:
|
|
{
|
|
*res_p = ecma_int32_to_number (left_int32 >> (right_uint32 & 0x1F));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_SHIFT_URIGHT:
|
|
{
|
|
*res_p = ecma_uint32_to_number (left_uint32 >> (right_uint32 & 0x1F));
|
|
break;
|
|
}
|
|
case NUMBER_BITWISE_NOT:
|
|
{
|
|
*res_p = ecma_int32_to_number ((int32_t) ~right_uint32);
|
|
break;
|
|
}
|
|
}
|
|
|
|
ret_value = ecma_make_normal_completion_value (ecma_make_number_value (res_p));
|
|
|
|
ECMA_OP_TO_NUMBER_FINALIZE (num_right);
|
|
ECMA_OP_TO_NUMBER_FINALIZE (num_left);
|
|
|
|
return ret_value;
|
|
} /* do_number_bitwise_logic */
|
|
|
|
/**
|
|
* @}
|
|
* @}
|
|
*/
|