static inline void kernel_log(const A0& a0,
A0& dk,
A0& hfsq,
A0& s,
A0& R,
A0& f)
{
typedef typename meta::as_integer<A0, signed>::type int_type;
typedef typename meta::scalar_of<A0>::type sA0;
A0 x;
int_type k;
boost::fusion::vector_tie(x, k) = fast_frexp(a0);
// fast_frexp(a0, x, k);
const int_type x_lt_sqrthf = is_greater(Sqrt_2o_2<A0>(), x)?Mone<int_type>():Zero<int_type>();
k += x_lt_sqrthf;
f = minusone(x+b_and(x, genmask(x_lt_sqrthf)));
dk = tofloat(k);
s = f/add(Two<A0>(),f);
A0 z = sqr(s);
A0 w = sqr(z);
A0 t1= w*horner<NT2_HORNER_COEFF_T(sA0, 3,
(0x3fc39a09d078c69fll,
0x3fcc71c51d8e78afll,
0x3fd999999997fa04ll)
)> (w);
A0 t2= z*horner<NT2_HORNER_COEFF_T(sA0, 4,
(0x3fc2f112df3e5244ll,
0x3fc7466496cb03dell,
0x3fd2492494229359ll,
0x3fe5555555555593ll)
)> (w);
R = t2+t1;
hfsq = mul(Half<A0>(), sqr(f));
}
void bubble_sort_v0(int *in, int size) {
printf("\nbubble_sort_v0 -- basic version\n");
for (int i = 0; i < size - 1; i++)
for (int j = 0; j < size-1; j++)
if (is_greater(in[j], in[j+1])) swap(&in[j], &in[j+1]);
}
auto is_greater_by_than(F f, const X& x)
{
return [f, x](const auto& y)
{
return is_greater(internal::invoke(f, y), x);
};
}
auto is_greater_by_and_by(F f, G g)
{
return [f, g](const auto& x, const auto& y)
{
using FIn = decltype(x);
using GIn = decltype(y);
internal::check_compare_preprocessors_for_types<F, G, FIn, GIn>();
return is_greater(internal::invoke(f, x), internal::invoke(g, y));
};
}
void bubble_sort_v1(int *in, int size) {
printf("\nbubble_sort_v1 -- improved version introducing swap_flag\n");
for (int i = 0; i < size - 1; i++) {
bool swap_flag = false;
for (int j = 0; j < size-1; j++) {
if (is_greater(in[j], in[j+1])) {
swap(&in[j], &in[j+1]);
swap_flag = true;
}
}
if (false == swap_flag) break;
}
}
void bubble_sort_v2(int *in, int size) {
int input_size = size;
printf("\nbubble_sort_v2 -- improved version by ignoring sorted elements\n");
for (int i = 0; i < input_size - 1; i++) {
bool swap_flag = false;
for (int j = 0; j < size-1; j++) {
if (is_greater(in[j], in[j+1])) {
swap(&in[j], &in[j+1]);
swap_flag = true;
}
}
if (false == swap_flag) break;
--size;
}
}
char *get_token(char *lexeme , int mode){
char *token=(char*)calloc(strlen(lexeme)+50,sizeof(char));
//printf("Getting token\n");
if(is_long(lexeme)){
sprintf(token,"%d",LONG);
}
else if(is_static(lexeme)){
sprintf(token,"%d",STATIC);
}
else if(is_union(lexeme)){
sprintf(token,"%d",UNION);
}
else if(is_default(lexeme)){
sprintf(token,"%d",DEFAULT);
}
else if(is_break(lexeme)){
sprintf(token,"%d",BREAK);
}
else if(is_case(lexeme)){
sprintf(token,"%d",CASE);
}
else if(is_continue(lexeme)){
sprintf(token,"%d",CONTINUE);
}
else if(is_goto(lexeme)){
sprintf(token,"%d",GOTO);
}
else if(is_struct(lexeme)){
sprintf(token,"%d",STRUCT);
}
else if(is_const(lexeme)){
sprintf(token,"%d",CONST);
}
else if(is_void(lexeme)){
sprintf(token,"%d",VOID);
}
else if(is_switch(lexeme)){
sprintf(token,"%d",SWITCH);
}
else if(is_for(lexeme)){
sprintf(token,"%d",FOR);
}
else if(is_while(lexeme)){
sprintf(token,"%d",WHILE);
}
else if(is_do(lexeme)){
sprintf(token,"%d",DO);
}
else if(is_return(lexeme)){
sprintf(token,"%d",RETURN);
}
else if(is_bool(lexeme)){
sprintf(token,"%d",BOOL);
}
else if(is_char(lexeme)){
sprintf(token,"%d",CHAR);
}
else if(is_signed(lexeme)){
sprintf(token,"%d",SIGNED);
}
else if(is_unsigned(lexeme)){
sprintf(token,"%d",UNSIGNED);
}
else if(is_short(lexeme)){
sprintf(token,"%d",SHORT);
}
else if(is_int(lexeme)){
sprintf(token,"%d",INT);
}
else if(is_float(lexeme)){
sprintf(token,"%d",FLOAT);
}
else if(is_double(lexeme)){
sprintf(token,"%d",DOUBLE);
}
else if(is_l_square(lexeme)){
sprintf(token,"%d",L_SQUARE);
}
else if(is_r_square(lexeme)){
sprintf(token,"%d",R_SQUARE);
}
else if(is_l_paraen(lexeme)){
sprintf(token,"%d",L_PARAEN);
}
else if(is_r_paraen(lexeme)){
sprintf(token,"%d",R_PARAEN);
}
else if(is_l_cbrace(lexeme)){
sprintf(token,"%d",L_CBRACE);
}
else if(is_r_cbrace(lexeme)){
sprintf(token,"%d",R_CBRACE);
}
else if(is_comma(lexeme)){
sprintf(token,"%d",COMMA);
}
else if(is_semicol(lexeme)){
sprintf(token,"%d",SEMICOL);
}
else if(is_eq_eq(lexeme)){
sprintf(token,"%d",EQ_EQ);
}
else if(is_lesser(lexeme)){
sprintf(token,"%d",LESSER);
}
else if(is_less_eq(lexeme)){
sprintf(token,"%d",LESS_EQ);
}
else if(is_div(lexeme)){
sprintf(token,"%d",DIV);
}
else if(is_greater(lexeme)){
sprintf(token,"%d",GREATER);
}
else if(is_great_eq(lexeme)){
sprintf(token,"%d",GREAT_EQ);
}
else if(is_plus_eq(lexeme)){
sprintf(token,"%d",PLUS_EQ);
}
else if(is_minus_eq(lexeme)){
sprintf(token,"%d",MINUS_EQ);
}
else if(is_div_eq(lexeme)){
sprintf(token,"%d",DIV_EQ);
}
else if(is_mult_eq(lexeme)){
sprintf(token,"%d",MULT_EQ);
}
else if(is_minus_minus(lexeme)){
sprintf(token,"%d",MINUS_MINUS);
}
else if(is_plus_plus(lexeme)){
sprintf(token,"%d",PLUS_PLUS);
}
else if(is_percent(lexeme)){
sprintf(token,"%d",PERCENT);
}
else if(is_div(lexeme)){
sprintf(token,"%d",DIV);
}
else if(is_mult(lexeme)){
sprintf(token,"%d",MULT);
}
else if(is_minus(lexeme)){
sprintf(token,"%d",MINUS);
}
else if(is_plus(lexeme)){
sprintf(token,"%d",PLUS);
}
else if(is_int_const(lexeme)){
printf("int");
sprintf(token,"%d\t%s",INT_CONST,lexeme);
}
else if(is_flo_const(lexeme)){
printf("float");
sprintf(token,"%d\t%s",FLO_CONST,lexeme);
}
else if(is_comment_start(lexeme)){
sprintf(token,"$start");
}
else if(is_comment_end(lexeme)){
sprintf(token,"$end");
}
else if(is_identifier(lexeme)){
printf("Identifier");
if(mode==1) ht_set( symboltable, lexeme, "1");
sprintf(token,"%d\t%s",IDNTIFIER,lexeme);
}
else sprintf(token,"%d",NOTOK);
return token;
}
const value is_greater(::zval const& rhs) const {
return is_greater(rhs BOOST_PHP_TSRM_DIRECT_CC);
}
