Lines Matching defs:dir
25 int p, i, j, c, dir, size, excess, ierr,ierrcode;
61 for (dir = 1; dir <= 3; dir++) {
63 cell_coord(dir,c) = cell_coord(dir,c) + 1;
68 // slice(dir,n) contains the sequence number of the cell that is in
69 // coordinate plane n in the dir direction
71 for (dir = 1; dir <= 3; dir++) {
73 slice(dir,cell_coord(dir,c)) = c;
100 for (dir = 1; dir <= 3; dir++) {
104 size = grid_points(dir)/p;
105 excess = mod(grid_points(dir),p);
107 if (cell_coord(dir,c) <= excess) {
108 cell_size(dir,c) = size+1;
109 cell_low(dir,c) = (cell_coord(dir,c)-1)*(size+1);
110 cell_high(dir,c) = cell_low(dir,c)+size;
112 cell_size(dir,c) = size;
113 cell_low(dir,c) = excess*(size+1)+
114 (cell_coord(dir,c)-excess-1)*size;
115 cell_high(dir,c) = cell_low(dir,c)+size-1;
117 if (cell_size(dir, c) <= 2) {
143 int p, i, j, dir, node_loc, comm_color, node_min, length, start_found;
157 for (dir = 0; dir<6; dir++) {
164 switch (dir) {
184 send_color[dir] = comm_color;
185 recv_color[dir] = !send_color[dir];
189 if (node == node_min) recv_color[dir] = 2;
192 switch (dir) {
200 if (node_loc == node_min) send_color[dir] = 2;