Lines Matching defs:ni

223   for (int ni = 0; ni < node_num; ni++) {  in propagate()  local
257 for (int ni = 0; ni < node_num; ni++) { in graph_reset_visited() local
288 for (int ni = 0; ni < node_num; ni++) { in propagate_estimate_amlify() local
296 for (int ni = 0; ni < node_num; ni++) { in init_graph() local
348 for (int ni = 0; ni < N / 2; ni++) { in gen_type1_graph() local
355 for (int ni = N / 2; ni < N; ni++) { in gen_type1_graph() local
366 for (int ni = 0; ni < N / 4; ni++) { in gen_type2_graph() local
371 for (int ni = N / 4; ni < N / 2; ni++) { in gen_type2_graph() local
378 for (int ni = N / 2; ni < N * 3 / 4; ni++) { in gen_type2_graph() local
385 for (int ni = N * 3 / 4; ni < N; ni++) { in gen_type2_graph() local
407 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
415 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
427 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
439 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
452 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
460 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
472 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
484 for (int ni = 0; ni < N_over_i / 4; ni++) { in gen_type3_graph() local
495 for (int ni = 0; ni < N; ni += B_size) { in gen_type4_graph() local
553 for (int ni = 0; ni < size / 2; ni++) { in gen_adst_B_graph() local
560 for (int ni = size / 2; ni < size; ni++) { in gen_adst_B_graph() local
572 for (int ni = 0; ni < adst_node_num; ni += size) { in gen_adst_U_graph() local
590 int ni = i * 2; in gen_adst_E_graph() local
601 int ni = i * size; in gen_adst_V_graph() local
610 int ni = i * 2; in gen_adst_VJ_graph() local
621 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_Q_graph() local
637 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_Ibar_graph() local
661 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_IbarQ_graph() local
672 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_D_graph() local
703 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_Ht_graph() local
712 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_HtD_graph() local
805 for (int ni = 0; ni < dct_node_num; ni++) { in gen_DCT_graph_2d() local
884 for (int ni = 0; ni < hybrid_node_num; ni++) { in gen_hybrid_graph_2d() local
903 for (int ni = 0; ni < hybrid_node_num1; ni++) { in gen_hybrid_graph_2d_new() local
908 for (int ni = 0; ni < hybrid_node_num0; ni++) { in gen_hybrid_graph_2d_new() local
925 for (int ni = inv_node_idx; ni < inv_node_idx + node_num; ni++) { in gen_inv_graph() local
932 for (int ni = 0; ni < node_num; ni++) { in gen_inv_graph() local