int main () { Vector3 garbage; // makes it usable with other primitives in crazy unions and shit Vector3 init{}; // zero-initialization: what we want for vector<> and friends Vector3 arf( 1, 2, 3 ); // still constructors fine, individual elements float some_data[2] = { 4, 5 }; Vector3 woof(some_data, 6); // 4, 5, 6 float more_data[3] = { 7, 8, 9 }; Vector3 double_woof(more_data); // 7, 8, 9 float extra_data[2] = { 14, 15 }; Vector3 triple_woof(13, extra_data); // 13, 14, 15 print( garbage ); std::cout << '\n'; print( init ); std::cout << '\n'; print( arf ); std::cout << '\n'; print( woof ); std::cout << '\n'; print( double_woof ); std::cout << '\n'; print( triple_woof ); std::cout << '\n'; union { float f[3]; Vector3 g; }; }
sss (rtx insn, int code1, int code2, int code3) { _Bool D1562; struct rtx_def * body; int i; int n_sets; int D1544; body = insn->u.fld[5].rt_rtx; D1544 = body->code; n_sets = 1; if (D1544 == 55) goto L7; else goto L1; L1: n_sets = 0; if (code3 == 99) goto L2; else goto L11; L2: D1562 = code1 == 10; n_sets = (int) D1562; if (n_sets > 0) goto L7; else goto L11; L37: if (code2 == 42) goto L8; else goto L9; L8: arf (); L9: i = i + 1; if (i < n_sets) goto L37; else goto L32; L32: L11: if (n_sets > 1) goto L12; else goto L15; L12: nit (); L14: i = 0; goto L38; L15: if (n_sets > 0) goto L14; else goto L16; L38: frob (); i = i + 1; if (n_sets > i) goto L38; else goto L16; L16: return; L7: i = 0; goto L37; }
void insert_debug_temp_for_var_def (gimple stmt) { gimple def_stmt = ((void *) 0); int usecount = 0; tree value = ((void *) 0); for (; arf ();) { if (!gimple_debug_bind_p (stmt)) continue; if (usecount++) break; unsigned char no_value = 0; if (!gimple_bb (def_stmt)) no_value = 1; if (!no_value) value = gimple_assign_rhs_to_tree (); } if (value) { if ((tree_code_type[(int) (((value)->code))] == 42) || (usecount == 1 && (is_gimple_min_invariant (value)))) value = unshare_expr (value); } }
void init_alias_analysis (void) { unsigned int maxreg = max_reg_num (); (VEC_rtx_gc_safe_grow_cleared (&(reg_base_value), maxreg, "../../../gcc-4.6.0/gcc/alias.c", 2755, __FUNCTION__, arf ())); }
rtx try_combine (rtx i1, rtx newpat) { rtx temp; if (i1 && (temp = ((((((newpat->rt_rtx, ((((temp)->code) == 42))))))))) && ((temp = (((((((((((newpat)->rt_rtx), ((((temp)->code) == 42) && arf ()))))))))))))) ; else if (i1 && foo ()); }
tree convert (tree type, tree expr) { tree e = expr; int code = (type)->base.code; const char *invalid_conv_diag; tree ret; if (tree_contains_struct[expr->base.code][(42)] != 1) abort (); if (type->type_common.main_variant == expr->typed.type->type_common.main_variant && (expr->typed.type->base.code != 123 || e->base.code == 456)) return arf (); if (expr->typed.type->base.code == 42) error ("void value not ignored as it ought to be"); }
unsigned char propagate_with_phi () { gimple use_stmt; unsigned char phi_inserted; phi_inserted = 0; for (; !end_imm_use_stmt_p (); next_imm_use_stmt ()) { if (!(arf () == 10 && boo () == 20)) continue; if (!phi_inserted) phi_inserted = 1; else update_stmt (); } }
void blah (int code1) { unsigned char D18670; if (code1 != 53) goto L0; else goto L1; L0: abort (); L1: D18670 = tree_code_length[53]; if (D18670 <= 1) goto L2; else goto L3; L2: abort (); L3: if (D18670 == 2) goto L4; else goto L5; L4: abort (); L5: arf (); if (code1 != 53) goto L6; else goto L7; L6: abort (); L7: if (D18670 <= 2) goto L8; else goto L9; L8: abort (); L9: return; }
int mention_regs (rtx x) { enum rtx_code code; int i, j; const char *fmt; int changed = 0; code = ((x)->code); if (code == SUBREG && ((((((x)->u.fld[0]).rt_rtx))->code) == REG)) { (get_cse_reg_info (i)->reg_in_table) = (get_cse_reg_info (i)->reg_tick); (get_cse_reg_info (i)->subreg_ticked) = (rhs_regno ((((x)->u.fld[0]).rt_rtx))); } if ((((rtx_class[(int) (((x)->code))]) & (~1)) == (RTX_COMPARE & (~1)))) { if (((((((x)->u.fld[0]).rt_rtx))->code) == REG)) foop (); } for (i = (rtx_length[(int) (code)]) - 1; i >= 0; i--) arf (); }
/***********************************************************************//** * @brief Test GArf class **************************************************************************/ void TestGXspec::test_GArf(void) { // Test void constructor test_try("GArf void constructor"); try { GArf arf; test_try_success(); } catch (std::exception &e) { test_try_failure(e); } // Test energy boundary constructor test_try("GArf energy boundary constructor"); try { GEbounds ebds(10, GEnergy(0.1, "TeV"), GEnergy(10.0, "TeV")); GArf arf(ebds); test_try_success(); } catch (std::exception &e) { test_try_failure(e); } // Test filling and accessing GEbounds ebds(9, GEnergy(1.0, "TeV"), GEnergy(10.0, "TeV")); GArf arf(ebds); for (int i = 0; i < 9; i += 2) { arf[i] = 1.0; } for (int i = 0; i < 9; i += 2) { test_value(arf.at(i), 1.0); test_value(arf[i], 1.0); } for (int i = 1; i < 9; i += 2) { test_value(arf.at(i), 0.0); test_value(arf[i], 0.0); } arf[0] = 5.0; arf[1] = 3.7; test_value(arf[0], 5.0); test_value(arf[1], 3.7); // Test saving and loading arf.save("arf.fits", true); test_assert(arf.filename() == "arf.fits", "Unexpected filename \""+arf.filename()+"\"."); arf.load("arf.fits"); test_assert(arf.filename() == "arf.fits", "Unexpected filename \""+arf.filename()+"\"."); test_value(arf[0], 5.0, 1.0e-6); test_value(arf[1], 3.7, 1.0e-6); for (int i = 2; i < 9; i += 2) { test_value(arf.at(i), 1.0); test_value(arf[i], 1.0); } for (int i = 3; i < 9; i += 2) { test_value(arf.at(i), 0.0); test_value(arf[i], 0.0); } // Test constructing GArf arf2("arf.fits"); test_assert(arf2.filename() == "arf.fits", "Unexpected filename \""+arf2.filename()+"\"."); test_value(arf2[0], 5.0, 1.0e-6); test_value(arf2[1], 3.7, 1.0e-6); for (int i = 2; i < 9; i += 2) { test_value(arf2.at(i), 1.0); test_value(arf2[i], 1.0); } for (int i = 3; i < 9; i += 2) { test_value(arf2.at(i), 0.0); test_value(arf2[i], 0.0); } //std::cout << arf << std::endl; //std::cout << arf2 << std::endl; // Return return; }