Searched refs:grid (Results 1 – 5 of 5) sorted by relevance
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | grid.hpp | 76 } grid; typedef
101 static int cellbound(grid *g, gridindex *index, vector *cmin, vector *cmax);
103 void engrid_objlist(grid *g, object **list);
104 static int engrid_object(grid *g, object *obj);
106 static int engrid_objectlist(grid *g, objectlist **list);
107 static int engrid_cell(grid *, gridindex *);
109 static int pos2grid(grid *g, vector *pos, gridindex *index);
110 static void grid_intersect(grid *, ray *);
111 static void voxel_intersect(grid *g, ray *ry, int voxaddr);
112 static int grid_bounds_intersect(grid *g, ray *ry, flt *near, flt *far);
|
| H A D | grid.cpp | 77 grid *g; in newgrid()
79 g = (grid *)rt_getmem(sizeof(grid)); in newgrid()
80 memset(g, 0, sizeof(grid)); in newgrid()
106 grid *g = (grid *)obj; in grid_bbox()
116 grid *g = (grid *)v; in grid_free()
274 grid *g; in engrid_scene()
311 void engrid_objlist(grid *g, object **list) { in engrid_objlist()
336 grid *g; in engrid_cell()
366 g = (grid *)newgrid(xs, ys, zs, gmin, gmax); in engrid_cell()
409 static int engrid_object(grid *g, object *obj) { in engrid_object()
[all …]
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Odd-Even_Communication.rst | 25 follow this pattern. For example, for a 2D grid with only
26 nearest-neighbor communication, it may be possible to treat the grid
31 Another context is staggered grid ("leap frog") Finite Difference
|
| H A D | Agglomeration.rst | 96 computations form a 2D grid, and communicate only with nearest
100 four different ways to agglomerate an 8×8 grid. If doing such
103 when the block is square with respect to the underlying grid of cache
104 lines, not square with respect to the logical grid.
111 Four different agglomerations of an 8×8 grid. |image0|
|
| /oneTBB/examples/parallel_for/tachyon/ |
| H A D | CMakeLists.txt | 38 src/grid.cpp
|