Searched refs:forcing (Results 1 - 6 of 6) sorted by relevance
/barrelfish-master/usr/bench/rcce/bt/ |
H A D | exact_rhs.c | 33 forcing(m,i,j,k,c) = 0.0e0; 73 forcing(1,i,j,k,c) = forcing(1,i,j,k,c) - 77 forcing(2,i,j,k,c) = forcing(2,i,j,k,c) - tx2 * ( 83 forcing(3,i,j,k,c) = forcing(3,i,j,k,c) - tx2 * ( 88 forcing(4,i,j,k,c) = forcing(4,i,j,k,c) - tx2*( 93 forcing( [all...] |
H A D | header.h | 74 #define forcing(m,i,j,k,c) forcing[(m-1)+5*(i+IMAX*(j+JMAX*(k+KMAX*(c-1))))] macro 125 forcing [5*IMAX*JMAX*KMAX*MAXCELLS], variable 184 forcing [5*IMAX*JMAX*KMAX*MAXCELLS], 270 #pragma omp threadprivate (us, vs, ws, qs, rho_i, square, forcing, \
|
H A D | rhs.c | 42 // copy the exact forcing term to the right hand side; because 43 // this forcing term is known, we can store it on the whole of every 51 rhs(m,i,j,k,c) = forcing(m,i,j,k,c);
|
/barrelfish-master/usr/eclipseclp/icparc_solvers/ |
H A D | ic_probe_search.pl | 97 add_biv_cstr adds a constraint forcing these tasks apart. When 100 It first tries forcing the first 297 A search routine which fixes resource bottlenecks by forcing tasks not to overlap.
|
H A D | probe_search.pl | 98 add_biv_cstr adds a constraint forcing these tasks apart. When 101 It first tries forcing the first 298 A search routine which fixes resource bottlenecks by forcing tasks not to overlap.
|
/barrelfish-master/usr/eclipseclp/documents/internal/kernel/ |
H A D | kernel.tex | 502 engine events (by forcing TG_SL to zero).
|
Completed in 94 milliseconds