Searched refs:vm (Results 1 - 25 of 31) sorted by relevance

12

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/opt/
H A Dvt1.C10 virtual void vm (void) {}; function in struct:S
H A Dpr45412.C9 virtual int vm ();
14 S::vm () function in class:S
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/
H A Dpr57584.c27 typedef SCM (*scm_t_vm_engine) (SCM vm, SCM program, SCM *argv, int nargs);
35 static SCM vm_regular_engine (SCM vm, SCM program, SCM *argv, int nargs) { argument
39 static SCM vm_debug_engine (SCM vm, SCM program, SCM *argv, int nargs) { argument
43 struct scm_vm *vp = ((struct scm_vm *) ((((scm_t_bits) (0? (*(SCM*)0=((((SCM *)((scm_t_cell *) (((scm_t_bits) (0? (*(SCM*)0=((((vm))))): (((vm)))))))) [((1))]))): (((SCM *)((scm_t_cell *) (((scm_t_bits) (0? (*(SCM*)0=((((vm))))): (((vm)))))))) [((1))]))))));
59 { if (__builtin_expect ((vp->trace_level > 0), 0)) { { vp->ip = ip; vp->sp = sp; vp->fp = fp; }; vm_dispatch_hook (vm, SCM_VM_NEXT_HOOK); } };
66 { { if (__builtin_expect ((vp->trace_level > 0), 0)) { { vp->ip = ip; vp->sp = sp; vp->fp = fp; }; vm_dispatch_hook (vm, SCM_VM_NEXT_HOOK); } }; ; goto *jump_table[(*ip++) & ((1<<8)-1)]; };
69 if (__builtin_expect ((vp->trace_level > 0), 0)) { { vp->ip = ip; vp->sp = sp; vp->fp = fp; }; vm_dispatch_hook (vm, SCM_VM_NEXT_HOO
75 scm_c_vm_run(SCM vm, SCM program, SCM *argv, int nargs) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Ddependency_19.f9012 integer, pointer :: vm(:,:,:) component in type:spot_t
29 rc% spots (k)% vm => NULL() ! gfortran didn't swallow this
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/ext/pb_ds/
H A Dpriority_queue_int_push.cc57 size_t vm = 2100; local
63 vec_t a_v(vm);
65 for (size_t i = 0; i < vm; ++i)
70 test_t tst(b, vn, vs, vm);
99 cerr << "usage: priority_queue_random_int_push_timing_test <vn> <vs> <vm>" <<
115 cerr << "vm = maximum size of the vector" << endl;
H A Dtree_text_lor_find.cc58 size_t vm = 2100; local
65 vec_t a_v(vm);
70 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
94 cerr << "usage: tree_text_lor_find_performance_test <f_name> <vn> <vs> <vm>"
114 cerr << "vm = maximum size of the vector" << endl;
H A Dall_int_subscript_find.cc58 size_t vm = 2100; local
65 vec_t a_v(vm);
67 for (size_t i = 0; i < vm; ++i)
72 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
107 cerr << "usage: hash_random_int_subscript_find_timing_test <vn> <vs> <vm>" <<
125 cerr << "vm = maximum size of the vector" << endl;
H A Dhash_zlob_int_find.cc57 size_t vm = 2100; local
63 vec_t a_v(vm);
66 for (size_t i = 0; i < vm; ++i)
76 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
100 cerr << "usage: hash_zlob_random_int_find_timing_test <vn> <vs> <vm>" <<
118 cerr << "vm = maximum size of the vector" << endl;
H A Dall_int_find.cc58 size_t vm = 2100; local
65 vec_t a_v(vm);
67 for (size_t i = 0; i < vm; ++i)
72 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
107 cerr << "usage: hash_random_int_find_timing_test <vn> <vs> <vm>" <<
125 cerr << "vm = maximum size of the vector" << endl;
H A Dall_int_subscript_insert.cc57 size_t vm = 2100; local
64 vec_t a_v(vm);
67 for (size_t i = 0; i < vm; ++i)
72 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
107 cerr << "usage: hash_random_int_subscript_insert_timing_test <vn> <vs> <vm>"
122 cerr << "vm = maximum size of the vector" << endl;
H A Dhash_int_erase_mem.cc65 size_t vm = 2100; local
71 vec_t a_v(vm);
73 for (size_t i = 0; i < vm; ++i)
77 erase_test<vec_t::const_iterator> tst(b, vn, vs, vm);
104 cerr << "usage: hash_random_int_erase_if_test <vn> <vs> <vm>"
117 cerr << "vm = maximum size of the vector" << endl;
H A Dpriority_queue_int_push_pop.cc57 size_t vm = 2100; local
64 vector_type a_v(vm);
67 for (size_t i = 0; i < vm; ++i)
72 test_type tst(b, vn, vs, vm);
100 std::cerr << "usage: priority_queue_random_int_push_pop_timing_test <vn> <vs> <vm>" <<
117 std::cerr << "vm = maximum size of the vector" << std::endl;
H A Dpriority_queue_text_join.cc51 cerr << "usage: priority_queue_text_join_timing_test <f_name> <vn> <vs> <vm>";
67 cerr << "vm = maximum size of the vector" << endl;
78 size_t vm = 2100; local
85 vec_t a_v(vm);
90 test_t tst(b, vn, vs, vm);
H A Dpriority_queue_text_push_pop.cc57 size_t vm = 2100; local
64 vec_t a_v(vm);
69 test_t tst(b, vn, vs, vm);
99 "<f_name> <vn> <vs> <vm>" << endl << endl;
115 cerr << "vm = maximum size of the vector" << endl;
H A Dpriority_queue_text_push.cc57 size_t vm = 2100; local
64 vec_t a_v(vm);
69 test_t tst(b, vn, vs, vm);
98 cerr << "usage: priority_queue_text_push_timing_test <f_name> <vn> <vs> <vm>"
116 cerr << "vm = maximum size of the vector" << endl;
H A Dtree_order_statistics.cc55 size_t vm = 2100; local
63 test_t tst(vn, vs, vm);
71 test_t tst(vn, vs, vm);
88 cerr << "usage: tree_order_statistics_timing_test.out <vn> <vs> <vm>" <<
104 cerr << "vm = maximum size of the tree" << endl;
H A Dtree_split_join.cc55 size_t vm = 2100; local
63 test_t tst(vn, vs, vm);
72 test_t tst(vn, vs, vm);
89 cerr << "usage: tree_split_join_test.cpp <vn> <vs> <vm>" <<
106 cerr << "vm = maximum size of the tree" << endl;
H A Dpriority_queue_text_pop_mem.cc59 size_t vm = 2100; local
69 vec_t a_v(vm);
74 test_t tst(b, vn, vs, vm);
105 cerr << "usage: priority_queue_text_pop_mem_usage_test <f_name> <vn> <vs> <vm>" <<
121 cerr << "vm = maximum size of the vector" << endl;
H A Dpriority_queue_text_modify.hpp61 size_t vm = 1100; local
71 vec_t a_v(vm);
76 test_t tst(b, vn, vs, vm, modify_up);
105 cerr << "usage: priority_queue_text_modify_timing_test <f_name> <vn> <vs> <vm> <modify_up>" <<
126 cerr << "vm = maximum size of the vector" << endl;
H A Dtree_text_insert.cc60 size_t vm = 2100; local
66 vec_t a_v(vm);
71 test_t tst(b, vn, vs, vm);
97 cerr << "usage: tree_text_insert_timing_test <f_name> <vn> <vs> <vm>" <<
115 cerr << "vm = maximum size of the vector" << endl;
H A Dall_text_find.cc59 size_t vm = 2100; local
66 vec_t a_v(vm);
70 test_t tst(b, b, vn, vs, vm, vn, vs, vm);
123 cerr << "usage: text_find_timing_test <f_name> <vn> <vs> <vm>" <<
144 cerr << "vm = maximum size of the vector" << endl;
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ken/
H A Dcplx5.go66 vm := m[complex(-5, 5)]
67 if vm != 5-5i {
68 panic(vm)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/util/performance/assoc/timing/
H A Dtree_split_join_test.hpp107 tree_split_join_test(size_t vn, size_t vs, size_t vm);
124 tree_split_join_test(size_t vn, size_t vs, size_t vm) : argument
127 m_vm(vm)
H A Dtree_order_statistics_test.hpp122 tree_order_statistics_test(size_t vn, size_t vs, size_t vm) argument
123 : m_vn(vn), m_vs(vs), m_vm(vm)
H A Dsubscript_find_test.hpp83 size_t ins_vm, size_t vn, size_t vs, size_t vm)
85 m_ins_vm(ins_vm), m_fnd_vn(vn), m_fnd_vs(vs), m_fnd_vm(vm)
82 subscript_find_test(It ins_b, It b, size_t ins_vn, size_t ins_vs, size_t ins_vm, size_t vn, size_t vs, size_t vm) argument

Completed in 187 milliseconds

12