163     algorithm(const std::string &alg_name, bool t) : name(alg_name), is_tiled(t) {}  in algorithm()  argument
334         tag_t t;  in operator ()()  local
335         t.tag = 0;  in operator ()()
336         t.a[0] = k;  in operator ()()
343         t.a[2] = k;  in operator ()()
345             t.a[1] = j;  in operator ()()
346             std::get<0>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
365         tag_t t;  in operator ()()  local
366         t.tag = 0;  in operator ()()
367         t.a[0] = k;  in operator ()()
373         t.a[1] = j;  in operator ()()
375             t.a[2] = i;  in operator ()()
376             std::get<0>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
380         t.a[2] = j;  in operator ()()
382             t.a[1] = i;  in operator ()()
383             std::get<1>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
396         tag_t t;  in operator ()()  local
397         t.tag = 0;  in operator ()()
434         t.a[0] = k + 1;  in operator ()()
435         t.a[1] = j;  in operator ()()
436         t.a[2] = i;  in operator ()()
438             std::get<0>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
443                 t.a[0] = k + 1;  in operator ()()
444                 t.a[1] = j;  in operator ()()
445                 std::get<1>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
449                 t.a[0] = k + 1;  in operator ()()
450                 t.a[1] = j;  in operator ()()
451                 t.a[2] = i;  in operator ()()
452                 std::get<2>(ports).try_put(std::make_pair(t, A_block));  in operator ()()
459     std::size_t operator()(const tagged_tile_t &t) {  in operator ()()
460         return t.first.tag;  in operator ()()
497         tag_t t;  in func()  local
498         t.tag = 0;  in func()
499         t.a[0] = 0;  in func()
500         t.a[1] = 0;  in func()
501         t.a[2] = 0;  in func()
505         dpotf2_node.try_put(std::make_pair(t, tile[0][0]));  in func()
510             t.a[1] = j;  in func()
511             input_port<1>(dtrsm_join).try_put(std::make_pair(t, tile[0][j]));  in func()
517             t.a[2] = i;  in func()
520                 t.a[1] = j;  in func()
521                 input_port<2>(dsyr2k_join).try_put(std::make_pair(t, tile[i][j]));  in func()
550         continue_ptr_type **t = new continue_ptr_type *[p];  in func()  local
558             t[k] = new continue_ptr_type[p];  in func()
562                 t[k][j] = new continue_type(g, [=](const oneapi::tbb::flow::continue_msg &) {  in func()
565                 make_edge(*c[k], *t[k][j]);  in func()
577                     make_edge(*t[k][j], *u[k][j][i]);  in func()
580                         make_edge(*t[k][i], *u[k][j][i]);  in func()
584                         make_edge(*u[k][j][i], *t[i][j]);  in func()
602                 delete t[k][j];  in func()
606             delete[] t[k];  in func()
610         delete[] t;  in func()