| /phasta/phSolver/common/ |
| H A D | phIO.f | 9 type(c_ptr), value :: handle
16 type(c_ptr), value :: handle
24 type(c_ptr), value :: handle
26 type(c_ptr), value :: vals
37 type(c_ptr), value :: handle
39 type(c_ptr), value :: vals
51 type(c_ptr), value :: handle
53 type(c_ptr), value :: vals
64 type(c_ptr), value :: handle
66 type(c_ptr), value :: vals
[all …]
|
| H A D | syncio.f | 7 integer(c_int), value :: nfiles
13 integer(c_int), value :: nfiles
14 integer(c_int), value :: nfields
15 integer(c_int), value :: nppf
|
| H A D | new_interface.c | 36 double *value = (double*)malloc(sizeof(double)); in igetMinMaxAvg() local
37 *value = 1.0*(*ivalue); in igetMinMaxAvg()
38 rgetMinMaxAvg(value,stats,statRanks); in igetMinMaxAvg()
39 free(value); in igetMinMaxAvg()
42 void rgetMinMaxAvg(double *value, double *stats, int *statRanks) { in rgetMinMaxAvg() argument
46 MPI_Allreduce(value,&stats[0],1,MPI_DOUBLE,MPI_MIN,MPI_COMM_WORLD); in rgetMinMaxAvg()
48 if(*value==stats[0]) in rgetMinMaxAvg()
52 MPI_Allreduce(value,&stats[1],1,MPI_DOUBLE,MPI_MAX,MPI_COMM_WORLD); in rgetMinMaxAvg()
54 if(*value==stats[1]) in rgetMinMaxAvg()
58 MPI_Allreduce(value,&stats[2],1,MPI_DOUBLE,MPI_SUM,MPI_COMM_WORLD); in rgetMinMaxAvg()
[all …]
|
| H A D | phStr.f | 8 integer(c_int), value, intent(in) :: val
17 real(c_double), value, intent(in) :: val
|
| H A D | streamio.f | 12 type(c_ptr), value :: stream
20 type(c_ptr), value :: stream
|
| H A D | posixio.f | 7 character(c_char), value :: mode
|
| H A D | genbc.f | 543 integer :: value component
568 sidlist % value = iBCB2 ! record its value
574 if((sidelt % value).eq.iBCB2) then
585 sidelt % value = iBCB2 ! record the new sid
597 sidmapl(j)=sidelt%value
|
| H A D | new_interface.h | 24 void rgetMinMaxAvg(double *value, double *stats, int *statRanks);
|
| H A D | input.config | 239 …Tau C Scale Factor: 1.0 # taucfct best value depends …
301 # negative values to the two previous entries make their value ISTEP in code
302 # Anil...leave as any negative value
306 # that feature and holds value
317 Number of Father Nodes: 0 # value of SONFATH
426 …AMG Truncation Set: 0.5 # Interpolation/Prolongation truncate if less than value time…
|
| /phasta/phastaIO/phiotimer_empty/ |
| H A D | phiotimer_empty.f | 9 integer(c_int), intent(in), value:: fileidx
|
| /phasta/phSolver/AMG/ |
| H A D | amgread.txt | 66 the highest value out from the array. So heap sort is a natural choice.
102 variable for coarsening. Coarsening is stopped if this value is true.
103 How do we decide it? When every processor has true value. Otherwise,
105 value, the result of coarsening will be trivial identity matrix as
221 This will result the G_bb value for two such nodes slightly smaller,
225 don't worry about it. (slightly different value of G_bb only).
|
| /phasta/phSolver/Test_IC/ |
| H A D | solver.inp | 72 # negative values to the two previous entries make their value ISTEP in code
73 # Anil...leave as any negative value
|
| /phasta/phSolver/testIC-DSIM/ |
| H A D | solver.inp | 72 # negative values to the two previous entries make their value ISTEP in code
73 # Anil...leave as any negative value
|
| /phasta/phSolver/Test_C/ |
| H A D | solver.inp | 73 Tau C Scale Factor: 1 # taucfct best value depends #}
|
| /phasta/phSolver/ |
| H A D | CHANGES | 123 specify a value of PARALLEL and potentially an MPICOMM(ch_shmem/ch_p4)
460 value). Now it is only distributed to vertices.
|
| /phasta/phSolver/incompressible/e3source/ |
| H A D | e3source.fimplicit | 503 do jj = 1, nshl ! first find the value of levelset at point ii
|
| H A D | e3source.fRHSonly | 489 do jj = 1, nshl ! first find the value of levelset at point ii
|