Home
last modified time | relevance | path

Searched refs:adst_node_num (Results 1 – 2 of 2) sorted by relevance

/external/libaom/libaom/tools/txfm_analyzer/
Dtxfm_graph.cc570 int node_idx, int adst_idx, int adst_node_num) { in gen_adst_U_graph() argument
572 for (int ni = 0; ni < adst_node_num; ni += size) { in gen_adst_U_graph()
597 int node_idx, int adst_idx, int adst_node_num) { in gen_adst_V_graph() argument
599 for (int i = 0; i < adst_node_num / size; i++) { in gen_adst_V_graph()
608 int node_idx, int adst_node_num) { in gen_adst_VJ_graph() argument
609 for (int i = 0; i < adst_node_num / 2; i++) { in gen_adst_VJ_graph()
611 double fi = (1 + 4 * i) * 1.0 / (4 * adst_node_num); in gen_adst_VJ_graph()
616 int node_idx, int adst_node_num) { in gen_adst_Q_graph() argument
621 for (int ni = 0; ni < adst_node_num; ni++) { in gen_adst_Q_graph()
628 int in = node_idx + adst_node_num - ni; in gen_adst_Q_graph()
[all …]
Dtxfm_graph.h91 int node_idx, int adst_idx, int adst_node_num);
99 int node_idx, int adst_idx, int adst_node_num);
102 int node_idx, int adst_node_num);
104 int node_idx, int adst_node_num);
106 int node_idx, int adst_node_num);
109 int node_idx, int adst_node_num);
111 int get_hadamard_idx(int x, int adst_node_num);
113 int node_idx, int adst_node_num);
116 int node_idx, int adst_node_num);
118 int node_idx, int adst_node_num);
[all …]