HomeSort by: relevance | last modified time | path
    Searched refs:grid (Results 1 - 25 of 97) sorted by relevancy

1 2 3 4

  /xsrc/external/mit/MesaGLUT/dist/src/glut/beos/
glut_teapot.c 139 teapot(GLint grid, GLdouble scale, GLenum type)
179 glMapGrid2f(grid, 0.0, 1.0, grid, 0.0, 1.0);
180 glEvalMesh2(type, 0, grid, 0, grid);
183 glEvalMesh2(type, 0, grid, 0, grid);
187 glEvalMesh2(type, 0, grid, 0, grid);
190 glEvalMesh2(type, 0, grid, 0, grid)
    [all...]
  /xsrc/external/mit/MesaGLUT/dist/src/glut/glx/
glut_teapot.c 139 teapot(GLint grid, GLdouble scale, GLenum type)
179 glMapGrid2f(grid, 0.0, 1.0, grid, 0.0, 1.0);
180 glEvalMesh2(type, 0, grid, 0, grid);
183 glEvalMesh2(type, 0, grid, 0, grid);
187 glEvalMesh2(type, 0, grid, 0, grid);
190 glEvalMesh2(type, 0, grid, 0, grid)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/clover/util/
factor.hpp 57 /// integer array \p grid subject to the constraints given by
63 const std::vector<T> &grid,
72 // We're done with this grid dimension, try the next.
73 return next_grid_factor(limits, grid, factors,
85 grid[d] % block.second[d] == 0) {
86 // We've found a valid grid divisor.
97 return next_grid_factor(limits, grid, factors,
105 /// Find the divisor of the integer array \p grid that gives the
113 const std::vector<T> &grid) {
115 map(find_integer_prime_factors<T>, grid, coord_limit)
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/clover/util/
factor.hpp 57 /// integer array \p grid subject to the constraints given by
63 const std::vector<T> &grid,
72 // We're done with this grid dimension, try the next.
73 return next_grid_factor(limits, grid, factors,
85 grid[d] % block.second[d] == 0) {
86 // We've found a valid grid divisor.
97 return next_grid_factor(limits, grid, factors,
105 /// Find the divisor of the integer array \p grid that gives the
113 const std::vector<T> &grid) {
115 map(find_integer_prime_factors<T>, grid, coord_limit)
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/iris/
iris_draw.c 184 const struct pipe_grid_info *grid)
191 // XXX: if the shader doesn't actually care about the grid info,
194 if (grid->indirect) {
195 pipe_resource_reference(&grid_ref->res, grid->indirect);
196 grid_ref->offset = grid->indirect_offset;
198 /* Zero out the grid size so that the next non-indirect grid launch will
204 if (memcmp(ice->state.last_grid, grid->grid, sizeof(grid->grid)) == 0
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/iris/
iris_draw.c 322 const struct pipe_grid_info *grid)
333 if (grid->indirect) {
334 pipe_resource_reference(&grid_ref->res, grid->indirect);
335 grid_ref->offset = grid->indirect_offset;
337 /* Zero out the grid size so that the next non-indirect grid launch will
342 } else if (memcmp(ice->state.last_grid, grid->grid, sizeof(grid->grid)) != 0)
    [all...]
  /xsrc/external/mit/xkbprint/dist/
xkbprint.h 42 int grid; member in struct:_XKBPrintArgs
  /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/
sampleCompBot.cc 113 gridWrap* grid,
128 tempTop[0] = grid->get_u_value(rightU);
129 tempTop[1] = grid->get_v_value(gridV);
142 //if there are grid points which are to the left of botVertex
146 if(botVertex[0] <= grid->get_u_value(leftU))
162 //find midU so that grid->get_u_value(midU) <= botVertex[0]
163 //and grid->get_u_value(midU) > botVertex[0]
165 while(grid->get_u_value(midU) <= botVertex[0])
173 grid->outputFanWithPoint(gridV, leftU, midU, botVertex, pStream);
174 stripOfFanRight(rightChain, segIndexMono, segIndexPass, grid, gridV, midU, rightU, pStream, 1);
751 gridWrap* grid = leftGridChain->getGrid(); local
    [all...]
sampleCompTop.cc 113 gridWrap* grid,
128 tempBot[0] = grid->get_u_value(rightU);
129 tempBot[1] = grid->get_v_value(gridV);
148 stripOfFanRight(rightChain, segIndexLarge, segIndexSmall, grid, gridV, leftU, rightU, pStream, 0);
150 tempBot[0] = grid->get_u_value(leftU);
151 tempBot[1] = grid->get_v_value(gridV);
154 else //the topVertex forms a fan with the grid points
155 grid->outputFanWithPoint(gridV, leftU, rightU, topVertex, pStream);
162 gridWrap* grid,
169 //if right chian is empty, then there is only one topVertex with one grid lin
926 gridWrap* grid = leftGridChain->getGrid(); local
    [all...]
sampleCompBot.h 59 gridWrap* grid,
70 gridWrap* grid,
83 gridWrap* grid,
94 gridWrap* grid,
gridWrap.cc 46 /*******************grid structure****************************/
148 if(vert[1] > v_values[v]) //vertex is above this grid line: notice the orientation
153 else //vertex is below the grid line
165 *V-lines within a grid.
166 *There is one grid vertex on each V-line.
169 * with respect to the grid, the index of the first V-line is
171 * So with respect to the grid, the index of the ith V-line is
173 * the grid-index of the uline at the ith vline (recall that each vline has one grid point)
175 * ulineValues[i] = grid->get_u_value(ulineIndices[i])
    [all...]
gridWrap.h 50 *the grid is uniform.
58 //uniform grid constructor
64 //nonuniform grid constructor.
97 gridWrap* grid;
105 Real2* vertices; /*one grid point at each grid V-line, cached for efficiency*/
125 Real getInner_u_value(Int i) {return grid->get_u_value(innerIndices[i]);}
128 gridWrap* getGrid() {return grid;}
sampleMonoPoly.cc 389 gridWrap* grid,
393 /*find the first(top) and the last (bottom) grid line which intersect the
396 Int firstGridIndex; /*the index in the grid*/
399 firstGridIndex = (Int) ((topV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1));
401 if(botV->head()[1] < grid->get_v_min())
404 lastGridIndex = (Int) ((botV->head()[1] - grid->get_v_min()) / (grid->get_v_max() - grid->get_v_min()) * (grid->get_n_vlines()-1)) + 1
2034 gridWrap* grid = leftGridChain->getGrid(); local
    [all...]
sampleMonoPoly.h 48 gridWrap* grid,
87 void findLeftGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid, Int* ret_indices, Int* ret_inner);
89 void findRightGridIndices(directedLine* topEdge, Int firstGridIndex, Int lastGridIndex, gridWrap* grid, Int* ret_indices, Int* ret_inner);
91 void sampleMonoPoly(directedLine* polygon, gridWrap* grid, Int ulinear, Int vlinear, primStream *pStream, rectBlockArray* rbArray);
158 gridWrap* grid,
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/crocus/
crocus_draw.c 449 const struct pipe_grid_info *grid)
455 if (grid->indirect) {
456 pipe_resource_reference(&grid_ref->res, grid->indirect);
457 grid_ref->offset = grid->indirect_offset;
459 /* Zero out the grid size so that the next non-indirect grid launch will
463 } else if (memcmp(ice->state.last_grid, grid->grid, sizeof(grid->grid)) != 0)
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/freedreno/computerator/
a4xx.c 203 uint32_t grid[3])
277 a4xx_emit_grid(struct kernel *kernel, uint32_t grid[3],
284 cs_const_emit(ring, kernel, grid);
288 const unsigned *num_groups = grid;
292 if (!grid[i])
315 OUT_RING(ring, CP_EXEC_CS_1_NGROUPS_X(grid[0]));
316 OUT_RING(ring, CP_EXEC_CS_2_NGROUPS_Y(grid[1]));
317 OUT_RING(ring, CP_EXEC_CS_3_NGROUPS_Z(grid[2]));
320 OUT_RING(ring, grid[0]); /* HLSQ_CL_KERNEL_GROUP_X */
321 OUT_RING(ring, grid[1]); /* HLSQ_CL_KERNEL_GROUP_Y *
    [all...]
main.c 207 uint32_t grid[3] = {0}; local
224 ret = sscanf(optarg, "%u,%u,%u", &grid[0], &grid[1], &grid[2]);
273 if (grid[0] == 0)
286 backend->emit_grid(kernel, grid, submit);
a6xx.c 241 uint32_t grid[3])
253 const_state->immediates[idx * 4 + 0] = grid[0];
254 const_state->immediates[idx * 4 + 1] = grid[1];
255 const_state->immediates[idx * 4 + 2] = grid[2];
379 a6xx_emit_grid(struct kernel *kernel, uint32_t grid[3],
388 cs_const_emit(ring, kernel, grid);
395 const unsigned *num_groups = grid;
399 if (!grid[i])
454 OUT_RING(ring, CP_EXEC_CS_1_NGROUPS_X(grid[0]));
455 OUT_RING(ring, CP_EXEC_CS_2_NGROUPS_Y(grid[1]))
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/radeonsi/
si_compute_blit.c 185 info.grid[0] = DIV_ROUND_UP(num_dwords, dwords_per_wave);
186 info.grid[1] = 1;
187 info.grid[2] = 1;
231 info.grid[0] = DIV_ROUND_UP(size_12, 64);
232 info.grid[1] = 1;
233 info.grid[2] = 1;
270 info.grid[0] = DIV_ROUND_UP(num_dwords, dwords_per_wave);
271 info.grid[1] = 1;
272 info.grid[2] = 1;
557 info.grid[i] = DIV_ROUND_UP(dim[i], info.block[i])
    [all...]
gfx10_query.c 348 /* Pre-fill the SSBOs and grid. */
350 struct pipe_grid_info grid = {}; local
358 grid.block[0] = 1;
359 grid.block[1] = 1;
360 grid.block[2] = 1;
361 grid.grid[0] = 1;
362 grid.grid[1] = 1;
363 grid.grid[2] = 1
    [all...]
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/radeonsi/
si_compute_blit.c 129 info.grid[0] = DIV_ROUND_UP(num_dwords, dwords_per_wave);
130 info.grid[1] = 1;
131 info.grid[2] = 1;
401 info.grid[0] = DIV_ROUND_UP(width, 64);
402 info.grid[1] = depth;
403 info.grid[2] = 1;
413 info.grid[0] = DIV_ROUND_UP(width, 8);
414 info.grid[1] = DIV_ROUND_UP(height, 8);
415 info.grid[2] = depth;
491 info.grid[0] = DIV_ROUND_UP(num_threads, 64); /* includes the partial block *
    [all...]
  /xsrc/external/mit/MesaLib/src/gallium/auxiliary/
u_tracepoints.c 99 fprintf(out, "work_dim=%u, block=%ux%ux%u, grid=%ux%ux%u\n"
124 __entry->grid_x = pgrid->grid[0];
125 __entry->grid_y = pgrid->grid[1];
126 __entry->grid_z = pgrid->grid[2];
  /xsrc/external/mit/glu/dist/src/libnurbs/internals/
slicer.h 57 void evalRBArray(rectBlockArray* rbArray, gridWrap* grid);
  /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/util/
u_compute.c 153 grid_info.grid[0] = DIV_ROUND_UP(width, 64);
154 grid_info.grid[1] = height;
155 grid_info.grid[2] = 1;
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/
u_compute.c 152 grid_info.grid[0] = DIV_ROUND_UP(width, 64);
153 grid_info.grid[1] = height;
154 grid_info.grid[2] = 1;

Completed in 26 milliseconds

1 2 3 4