HomeSort by: relevance | last modified time | path
    Searched refs:M1 (Results 1 - 25 of 152) sorted by relevancy

1 2 3 4 5 6 7

  /src/external/gpl3/gcc/dist/libgcc/config/avr/libf7/
libf7-constdef.h 29 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
32 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO };
36 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
38 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO };
libf7-array.def 26 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
27 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO },
38 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
  /src/external/gpl3/gcc.old/dist/libgcc/config/avr/libf7/
libf7-constdef.h 29 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
32 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO };
36 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
38 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO };
libf7-array.def 26 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
27 { .flags = FLAGS, .mant = { M0, M1, M2, M3, M4, M5, M6 }, .expo = EXPO },
38 #define F7_CONST_DEF(NAME, FLAGS, M6, M5, M4, M3, M2, M1, M0, EXPO) \
  /src/external/lgpl3/gmp/dist/mpn/generic/
hgcd.c 43 computing M1, and hgcd_matrix_adjust and hgcd_matrix_mul calls that use M1
44 (after this, the storage needed for M1 can be recycled).
46 Let S(r) denote the required storage. For M1 we need 4 * (ceil(n1/2) + 1)
126 struct hgcd_matrix M1;
132 mpn_hgcd_matrix_init(&M1, n - p, tp);
137 nn = mpn_hgcd (ap + p, bp + p, n - p, &M1, tp + scratch);
140 /* We always have max(M) > 2^{-(GMP_NUMB_BITS + 1)} max(M1) */
141 ASSERT (M->n + 2 >= M1.n);
144 then either q or q + 1 is a correct quotient, and M1 wil
    [all...]
hgcd_matrix.c 128 /* Multiply M by M1 from the right. Since the M1 elements fit in
132 mpn_hgcd_matrix_mul_1 (struct hgcd_matrix *M, const struct hgcd_matrix1 *M1,
139 n0 = mpn_hgcd_mul_matrix1_vector (M1, M->p[0][0], tp, M->p[0][1], M->n);
141 n1 = mpn_hgcd_mul_matrix1_vector (M1, M->p[1][0], tp, M->p[1][1], M->n);
148 /* Multiply M by M1 from the right. Needs 3*(M->n + M1->n) + 5 limbs
151 mpn_hgcd_matrix_mul (struct hgcd_matrix *M, const struct hgcd_matrix *M1,
156 /* About the new size of M:s elements. Since M1's diagonal elements
158 M->n + M1->n, one limb more or less. The computation of th
    [all...]
hgcd_appr.c 175 struct hgcd_matrix1 M1;
178 if (mpn_hgcd2 (ap[1], ap[0], bp[1], bp[0], &M1))
180 /* Multiply M <- M * M1 */
181 mpn_hgcd_matrix_mul_1 (M, &M1, tp);
215 struct hgcd_matrix M1;
221 mpn_hgcd_matrix_init(&M1, n - p, tp);
222 if (mpn_hgcd_appr (ap + p, bp + p, n - p, &M1, tp + scratch))
224 /* We always have max(M) > 2^{-(GMP_NUMB_BITS + 1)} max(M1) */
225 ASSERT (M->n + 2 >= M1.n);
228 then either q or q + 1 is a correct quotient, and M1 wil
    [all...]
hgcd_step.c 79 struct hgcd_matrix1 M1;
113 if (mpn_hgcd2 (ah, al, bh, bl, &M1))
115 /* Multiply M <- M * M1 */
116 mpn_hgcd_matrix_mul_1 (M, &M1, tp);
120 /* Multiply M1^{-1} (a;b) */
121 return mpn_matrix22_mul1_inverse_vector (&M1, ap, tp, bp, n);
hgcd_jacobi.c 88 struct hgcd_matrix1 M1;
122 if (mpn_hgcd2_jacobi (ah, al, bh, bl, &M1, bitsp))
124 /* Multiply M <- M * M1 */
125 mpn_hgcd_matrix_mul_1 (M, &M1, tp);
129 /* Multiply M1^{-1} (a;b) */
130 return mpn_matrix22_mul1_inverse_vector (&M1, ap, tp, bp, n);
191 struct hgcd_matrix M1;
197 mpn_hgcd_matrix_init(&M1, n - p, tp);
198 nn = mpn_hgcd_jacobi (ap + p, bp + p, n - p, &M1, bitsp, tp + scratch);
201 /* We always have max(M) > 2^{-(GMP_NUMB_BITS + 1)} max(M1) */
    [all...]
  /src/external/gpl3/gdb/dist/sim/testsuite/bfin/
dsp_d0.s 15 M1 = R0;
18 R0 = [ I3 ++ M1 ];
21 R0 = [ I3 ++ M1 ];
dsp_d1.s 13 M1 = 8 (X);
14 R0 = [ I0 ++ M1 ];
18 R0 = [ I0 ++ M1 ];
23 R0 = [ I0 ++ M1 ];
32 M1 = -4 (X);
33 R0 = [ I0 ++ M1 ];
37 R0 = [ I0 ++ M1 ];
41 R0 = [ I0 ++ M1 ];
45 R0 = [ I0 ++ M1 ];
49 R0 = [ I0 ++ M1 ];
    [all...]
c_dagmodim_lz_inc_dec.s 17 imm32 m1, 0x00000006;
22 I1 += M1;
29 I0 += M1;
50 I3 -= M1;
57 I2 -= M1;
74 I2 += M1 (BREV);
83 I3 += M1 (BREV);
c_regmv_imlb_imlb.s 14 imm32 m1, 0x66666666;
33 M1 = M1;
41 M0 = M1;
42 M1 = M2;
51 R5 = M1;
69 M1 = M3;
71 M3 = M1;
78 R5 = M1;
96 M1 = M0
    [all...]
c_dagmodim_lnz_imgebl.s 27 imm32 m1, 0x00000016;
32 I1 += M1;
39 I0 += M1;
60 I3 -= M1;
67 I2 -= M1;
84 I2 += M1 (BREV);
93 I3 += M1 (BREV);
c_dagmodim_lnz_imltbl.s 27 imm32 m1, 0x00000004;
32 I1 += M1;
39 I0 += M1;
60 I3 -= M1;
67 I2 -= M1;
84 I2 += M1 (BREV);
93 I3 += M1 (BREV);
  /src/external/gpl3/gdb.old/dist/sim/testsuite/bfin/
dsp_d0.s 15 M1 = R0;
18 R0 = [ I3 ++ M1 ];
21 R0 = [ I3 ++ M1 ];
dsp_d1.s 13 M1 = 8 (X);
14 R0 = [ I0 ++ M1 ];
18 R0 = [ I0 ++ M1 ];
23 R0 = [ I0 ++ M1 ];
32 M1 = -4 (X);
33 R0 = [ I0 ++ M1 ];
37 R0 = [ I0 ++ M1 ];
41 R0 = [ I0 ++ M1 ];
45 R0 = [ I0 ++ M1 ];
49 R0 = [ I0 ++ M1 ];
    [all...]
c_dagmodim_lz_inc_dec.s 17 imm32 m1, 0x00000006;
22 I1 += M1;
29 I0 += M1;
50 I3 -= M1;
57 I2 -= M1;
74 I2 += M1 (BREV);
83 I3 += M1 (BREV);
c_regmv_imlb_imlb.s 14 imm32 m1, 0x66666666;
33 M1 = M1;
41 M0 = M1;
42 M1 = M2;
51 R5 = M1;
69 M1 = M3;
71 M3 = M1;
78 R5 = M1;
96 M1 = M0
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/clk/
pll.h 11 int *N1, int *M1, int *N2, int *M2, int *P);
nouveau_nvkm_subdev_clk_nv04.c 40 int N1, M1, N2, M2, P;
41 int ret = nv04_pll_calc(&clock->subdev, info, clk, &N1, &M1, &N2, &M2, &P);
45 pv->M1 = M1;
nouveau_nvkm_subdev_clk_nv40.c 69 int M1 = (coef & 0x000000ff) >> 0;
73 if ((ctrl & 0x80000000) && M1) {
74 khz = ref * N1 / M1;
130 int *N1, int *M1, int *N2, int *M2, int *log2P)
143 ret = nv04_pll_calc(subdev, &pll, khz, N1, M1, N2, M2, log2P);
156 int N1, M1, N2, M2, log2P;
161 &N1, &M1, &N2, &M2, &log2P);
167 clk->npll_coef = (N1 << 8) | M1;
170 clk->npll_coef = (N2 << 24) | (M2 << 16) | (N1 << 8) | M1;
176 &N1, &M1, NULL, NULL, &log2P)
    [all...]
nouveau_nvkm_subdev_clk_pllnv04.c 156 int M1, N1, M2, N2, log2P;
169 for (M1 = minM1; M1 <= maxM1; M1++) {
170 if (crystal/M1 < minU1)
172 if (crystal/M1 > maxU1)
176 calcclk1 = crystal * N1 / M1;
217 *pM1 = M1;
233 int *N1, int *M1, int *N2, int *M2, int *P)
238 ret = getMNP_single(subdev, info, freq, N1, M1, P)
    [all...]
  /src/external/gpl2/lvm2/dist/test/
t-metadata.sh 50 # some M1 metadata tests
51 pvcreate -M1 $dev1
52 pvcreate -M1 $dev2
53 pvcreate -M1 $dev3
54 vgcreate -M1 $vg $dev1 $dev2 $dev3
  /src/external/lgpl3/gmp/dist/
primesieve.c 100 #define SET_OFF1(m1, m2, M1, M2, off, BITS) \
103 m1 = (M1 >> off) | (M2 << (GMP_LIMB_BITS - off)); \
105 m2 = M1 << (BITS - GMP_LIMB_BITS - off) \
108 m1 |= M1 << (BITS - off); \
109 m2 = M1 >> (off + GMP_LIMB_BITS - BITS); \
112 m1 = M1 << (BITS - off)
    [all...]

Completed in 36 milliseconds

1 2 3 4 5 6 7