Lines Matching full:rows
17 // Rows must be an even number. This is enforced elsewhere.
19 // The transpose requires (cols_log2 * rows/2) row-pair blends.
23 uint32_t const rows, in hsg_transpose() argument
35 uint32_t * map_curr = ALLOCA_MACRO(rows * sizeof(*map_curr)); in hsg_transpose()
36 uint32_t * map_next = ALLOCA_MACRO(rows * sizeof(*map_next)); in hsg_transpose()
39 for (uint32_t ii=0; ii<rows; ii++) in hsg_transpose()
42 // successively transpose rows using blends in hsg_transpose()
47 for (uint32_t ii=0; ii<rows; ii++) in hsg_transpose()
54 for (uint32_t jj=0; jj<rows; jj++) in hsg_transpose()
59 map_next[ii] = stay + (rows << (cc-1)); in hsg_transpose()
76 for (uint32_t ii=0; ii<rows; ii++) in hsg_transpose()
125 hsg_debug_print(uint32_t const rows, in hsg_debug_print() argument
129 for (uint32_t rr=0; rr<rows; rr++) { in hsg_debug_print()
140 uint32_t const rows = (argc <= 2) ? 6 : strtoul(argv[2],NULL,0); in main() local
142 if (rows & 1) in main()
147 uint32_t * const b = ALLOCA_MACRO(cols * rows * sizeof(*b)); in main()
148 uint32_t * const r = ALLOCA_MACRO( rows * sizeof(*r)); in main()
150 for (uint32_t rr=0; rr<rows; rr++) { in main()
153 b[rr*cols+cc] = cc*rows+rr; in main()
156 hsg_debug_print(rows,b,r); in main()
158 hsg_transpose(cols_log2,rows, in main()
162 hsg_debug_print(rows,b,r); in main()