Lines Matching refs:j
74 for (int j = 0; j < p; ++j) { in create_tile_array() local
75 tile[j] = (double **)calloc(sizeof(double *), p); in create_tile_array()
78 for (int j = 0; j < p; ++j) { in create_tile_array() local
82 for (int A_j = j * b, T_j = 0; T_j < b; ++A_j, ++T_j) { in create_tile_array()
88 tile[j][i] = temp_block; in create_tile_array()
97 for (int j = 0; j < p; ++j) { in collapse_tile_array() local
99 double *temp_block = tile[j][i]; in collapse_tile_array()
101 for (int A_j = j * b, T_j = 0; T_j < b; ++A_j, ++T_j) { in collapse_tile_array()
108 tile[j][i] = nullptr; in collapse_tile_array()
111 free(tile[j]); in collapse_tile_array()
130 for (int j = i + 1; j < n; ++j) { in check_if_valid() local
131 A0[j * n + i] = 0.; in check_if_valid()
137 for (int j = 0; j < n; ++j) { in check_if_valid() local
139 const double epsilon = std::abs(A[j * n + i] * 0.1); in check_if_valid()
141 if (std::abs(C[j * n + i] - A[j * n + i]) > epsilon) { in check_if_valid()
145 j, in check_if_valid()
146 C[j * n + i], in check_if_valid()
148 j, in check_if_valid()
149 A[j * n + i]); in check_if_valid()
152 A[j * n + i] - epsilon, in check_if_valid()
153 C[j * n + i], in check_if_valid()
154 A[j * n + i] + epsilon); in check_if_valid()
236 static void call_dtrsm(double ***tile, int b, int k, int j) { in call_dtrsm() argument
237 double *A_block = tile[k][j]; in call_dtrsm()
245 static void call_dsyr2k(double ***tile, int b, int k, int j, int i) { in call_dsyr2k() argument
246 double *A_block = tile[i][j]; in call_dsyr2k()
252 if (i == j) { // Diagonal block in call_dsyr2k()
258 double *L1_block = tile[k][j]; in call_dsyr2k()
276 for (int j = k + 1; j < p; ++j) { in func() local
277 call_dtrsm(tile, b, k, j); in func()
279 for (int i = k + 1; i <= j; ++i) { in func()
280 call_dsyr2k(tile, b, k, j, i); in func()
344 for (int j = k + 1; j < p; ++j) { in operator ()() local
345 t.a[1] = j; in operator ()()
362 int j = in0.first.a[1]; in operator ()() local
373 t.a[1] = j; in operator ()()
374 for (int i = k + 1; i <= j; ++i) { in operator ()()
380 t.a[2] = j; in operator ()()
381 for (int i = j; i < p; ++i) { in operator ()()
407 int j = in2.first.a[1]; in operator ()() local
411 if (i == j) { // Diagonal block in operator ()()
435 t.a[1] = j; in operator ()()
437 if (k != p - 1 && j == k + 1 && i == k + 1) { in operator ()()
442 if (i == k + 1 && j > i) { in operator ()()
444 t.a[1] = j; in operator ()()
448 if (j != k + 1 && i != k + 1) { in operator ()()
450 t.a[1] = j; in operator ()()
509 for (int j = 1; j < p; ++j) { in func() local
510 t.a[1] = j; in func()
511 input_port<1>(dtrsm_join).try_put(std::make_pair(t, tile[0][j])); in func()
519 for (int j = i; j < p; ++j) { in func() local
520 t.a[1] = j; in func()
521 input_port<2>(dsyr2k_join).try_put(std::make_pair(t, tile[i][j])); in func()
561 for (int j = k + 1; j < p; ++j) { in func() local
562 t[k][j] = new continue_type(g, [=](const oneapi::tbb::flow::continue_msg &) { in func()
563 call_dtrsm(tile, b, k, j); in func()
565 make_edge(*c[k], *t[k][j]); in func()
566 u[k][j] = new continue_ptr_type[p]; in func()
568 for (int i = k + 1; i <= j; ++i) { in func()
569 u[k][j][i] = new continue_type(g, [=](const oneapi::tbb::flow::continue_msg &) { in func()
570 call_dsyr2k(tile, b, k, j, i); in func()
573 if (k < p - 2 && k + 1 != j && k + 1 != i) { in func()
574 make_edge(*u[k][j][i], *u[k + 1][j][i]); in func()
577 make_edge(*t[k][j], *u[k][j][i]); in func()
579 if (i != j) { in func()
580 make_edge(*t[k][i], *u[k][j][i]); in func()
583 if (k < p - 2 && j > i && i == k + 1) { in func()
584 make_edge(*u[k][j][i], *t[i][j]); in func()
598 for (int j = k + 1; j < p; ++j) { in func() local
599 for (int i = k + 1; i <= j; ++i) { in func()
600 delete u[k][j][i]; in func()
602 delete t[k][j]; in func()
603 delete[] u[k][j]; in func()