Searched refs:multiplicity (Results 1 - 7 of 7) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gfortran.fortran-torture/compile/
H A Dpr40413.f9023 integer :: multiplicity = 0 component in type:polarization_t
35 pol%multiplicity = pol_in%multiplicity
/haiku-buildtools/legacy/gcc/gcc/
H A Dgenattr.c56 int multiplicity; /* Number of units of this type. */ member in struct:function_unit
150 write_units (num_units, multiplicity, simultaneity,
153 struct range *multiplicity;
168 printf (" int multiplicity;\n");
179 printf ("#define MIN_MULTIPLICITY %d\n", multiplicity->min);
180 printf ("#define MAX_MULTIPLICITY %d\n", multiplicity->max);
349 int multiplicity = XINT (desc, 1);
366 unit->multiplicity = multiplicity;
374 extend_range (&all_multiplicity, multiplicity, multiplicit
348 int multiplicity = XINT (desc, 1); local
[all...]
H A Dgenattrtab.c227 int multiplicity; /* Number of units of this type. */ member in struct:function_unit
4411 int multiplicity = XINT (def, 1);
4418 the multiplicity and simultaneity values are the same. If not, make
4423 if (unit->multiplicity != multiplicity
4434 unit->multiplicity = multiplicity;
5580 unit->name, 1 << unit->num, unit->multiplicity,
4377 int multiplicity = XINT (def, 1); local
H A Dhaifa-sched.c2994 for (i = function_units[unit].multiplicity - 1; i > 0; i--)
3031 for (i = function_units[unit].multiplicity - 1; i > 0; i--)
5775 for (i = 0; i < function_units[unit].multiplicity; i++)
6452 for (i = 0; i < function_units[unit].multiplicity; i++)
6459 for (i = 0; i < function_units[unit].multiplicity; i++)
6497 for (i = 0; i < function_units[unit].multiplicity; i++)
H A Dsched.c720 for (i = function_units[unit].multiplicity - 1; i > 0; i--)
757 for (i = function_units[unit].multiplicity - 1; i > 0; i--)
/haiku-buildtools/gcc/gmp/
H A Dgen-psqr.c106 int multiplicity; member in struct:rawfactor_t
266 int multiplicity; local
293 multiplicity = 0;
298 multiplicity++;
306 rawfactor[nrawfactor].multiplicity = multiplicity;
346 rawfactor[nrawfactor].multiplicity = 1;
362 rawfactor[i].multiplicity++;
382 for (j = 0; j < rawfactor[i].multiplicity; j++)
468 if (rawfactor[i].multiplicity !
[all...]
/haiku-buildtools/gcc/gmp/demos/perl/
H A DGMP.pm212 returns a remainder/multiplicity pair. C<root> returns the nth root, and

Completed in 87 milliseconds