Searched refs:successor (Results 1 - 9 of 9) sorted by relevance
/barrelfish-master/usr/bench/rcce/bt/ |
H A D | copy_faces.c | 182 RCCE_recv((char*)(&in_buffer(sr(0))), b_size(0)*sizeof(double), successor(1)); 186 RCCE_send((char*)(&out_buffer(ss(0))), b_size(0)*sizeof(double), successor(1)); 196 RCCE_recv((char*)(&in_buffer(sr(2))), b_size(2)*sizeof(double), successor(2)); 200 RCCE_send((char*)(&out_buffer(ss(2))), b_size(2)*sizeof(double),successor(2)); 210 RCCE_recv((char*)(&in_buffer(sr(4))), b_size(4)*sizeof(double), successor(3)); 214 RCCE_send((char*)(&out_buffer(ss(4))), b_size(4)*sizeof(double),successor(3));
|
H A D | make_set.c | 79 // fill the predecessor and successor entries, using the indices 91 successor(1) = mod(i+1,p) + p*j; 92 successor(2) = i + p*mod(j+1,p); 93 successor(3) = mod(i-1+p,p) + p*mod(j+1,p);
|
H A D | header.h | 65 #define successor(m) successor[m-1] macro 115 grid_size[3], successor[3], variable 174 grid_size[3], successor[3], 251 #pragma omp threadprivate (predecessor, slice, grid_size, successor)
|
H A D | x_solve.c | 121 RCCE_send((char*)in_buffer, buffer_size*sizeof(double), successor(1)); 191 RCCE_recv((char*)out_buffer, buffer_size*sizeof(double), successor(1));
|
H A D | y_solve.c | 109 RCCE_send((char*)in_buffer, buffer_size*sizeof(double), successor(2)); 174 RCCE_recv((char*)out_buffer, buffer_size*sizeof(double), successor(2));
|
H A D | z_solve.c | 143 RCCE_send((char*)in_buffer, buffer_size*sizeof(double), successor(3)); 208 RCCE_recv((char*)out_buffer, buffer_size*sizeof(double), successor(3));
|
/barrelfish-master/doc/015-disk-driver-arch/ |
H A D | libahci.tex | 120 successor in order to prevent excessive fragmentation of the buffer pool
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | search.tex | 1166 (Thus no successor takes the same value as E). 1181 (Thus no successor takes a value between Ek-K+1 and Ek+K-1.)
|
/barrelfish-master/usr/eclipseclp/documents/userman/ |
H A D | exthsusp.tex | 660 because an integer cannot be equal to its successor. However, the above
|
Completed in 44 milliseconds