Home
last modified time | relevance | path

Searched refs:nInputs (Results 1 – 3 of 3) sorted by relevance

/oneTBB/test/tbb/
H A Dtest_indexer_node.cpp174 for(int i=0; i < nInputs; ++i) { in add_input_nodes()
183 input_node_helper<ELEM-1, INT>::add_input_nodes(my_indexer, g, nInputs); in add_input_nodes()
198 static void remove_input_nodes(indexer_node_type& my_indexer, int nInputs) { in remove_input_nodes() argument
199 for(int i=0; i< nInputs; ++i) { in remove_input_nodes()
204 input_node_helper<ELEM-1, INT>::remove_input_nodes(my_indexer, nInputs); in remove_input_nodes()
220 for(int i=0; i < nInputs; ++i) { in add_input_nodes()
234 static void remove_input_nodes(indexer_node_type& my_indexer, int nInputs) { in remove_input_nodes() argument
235 for(int i=0; i < nInputs; ++i) { in remove_input_nodes()
258 for(int nInputs = 1; nInputs <= MaxNInputs; ++nInputs) { in test() local
268 input_node_helper<SIZE, IType>::add_input_nodes(my_indexer, g, nInputs); in test()
[all …]
H A Dtest_split_node.cpp234 for(int nInputs = 1; nInputs <= MaxNInputs; ++nInputs) { in test() local
243 for(int i = 0; i < nInputs; ++i) { in test()
245 input_type *s = new input_type(g, my_input_body<TType>(i, nInputs) ); in test()
258 for(int i = 0; i < nInputs; ++i) { in test()
H A Dtest_join_node.h1037 for(int i = 0; i < nInputs; ++i) {
1044 input_node_helper<ELEM-1, JNT>::add_input_nodes(my_join, g, nInputs);
1072 static void remove_input_nodes(join_node_type& my_join, int nInputs) {
1073 for(int i = 0; i< nInputs; ++i) {
1078 input_node_helper<ELEM-1, JNT>::remove_input_nodes(my_join, nInputs);
1104 for(int i = 0; i < nInputs; ++i) {
1132 static void remove_input_nodes(join_node_type& my_join, int nInputs) {
1133 for(int i = 0; i < nInputs; ++i) {
1178 for(int nInputs = 1; nInputs<=MaxNInputs; ++nInputs) {
1180 bool not_out_of_order = (nInputs==1)&&(!is_key_matching);
[all …]