Searched refs:limb (Results 1 - 25 of 70) sorted by relevance

123

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libgcrypt-1.5.0/mpi/
H A Dmpi-scan.c40 mpi_limb_t limb; local
44 limb = ap[i];
47 return (limb >> j*8) & 0xff;
62 mpi_limb_t limb, c; local
67 limb = ap[i];
72 limb = (limb & 0xffffff00) | c;
74 limb = (limb & 0xffff00ff) | (c<<8);
76 limb
[all...]
H A Dmpi-cmp.c29 mpi_limb_t limb = v; local
33 /* Handle the case that U contains no limb. */
35 return -(limb != 0);
43 /* Handle the case that U contains exactly one limb. */
45 if (u->d[0] > limb)
47 if (u->d[0] < limb)
52 /* Handle the case that U contains more than one limb. */
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libgcrypt-1.5.0/mpi/
H A Dmpi-scan.c40 mpi_limb_t limb; local
44 limb = ap[i];
47 return (limb >> j*8) & 0xff;
62 mpi_limb_t limb, c; local
67 limb = ap[i];
72 limb = (limb & 0xffffff00) | c;
74 limb = (limb & 0xffff00ff) | (c<<8);
76 limb
[all...]
H A Dmpi-cmp.c29 mpi_limb_t limb = v; local
33 /* Handle the case that U contains no limb. */
35 return -(limb != 0);
43 /* Handle the case that U contains exactly one limb. */
45 if (u->d[0] > limb)
47 if (u->d[0] < limb)
52 /* Handle the case that U contains more than one limb. */
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libgcrypt-1.5.0/mpi/power/
H A Dmpih-lshift.S49 mtctr 5 # put limb count in CTR loop register
50 lu 0,-4(4) # read most significant limb
51 sre 3,0,8 # compute carry out limb, and init MQ register
52 bdz Lend2 # if just one limb, skip loop
53 lu 0,-4(4) # read 2:nd most significant limb
54 sreq 7,0,8 # compute most significant limb of result
55 bdz Lend # if just two limb, skip loop
56 Loop: lu 0,-4(4) # load next lower limb
58 sreq 7,0,8 # compute result limb
60 Lend: stu 7,-4(9) # store 2:nd least significant limb
[all...]
H A Dmpih-mul1.S1 /* IBM POWER mul_1 -- Multiply a limb vector with a limb and store
2 * the result in a second limb vector.
35 # instruction, and add the appropriate compensation to the high limb of the
74 cax 10,10,6 # adjust high limb for negative limb from s1
83 cax 9,9,6 # adjust high limb for negative limb from s1
93 cax 10,10,0 # adjust high limb for negative s2_limb
97 cax 10,10,6 # adjust high limb fo
[all...]
H A Dmpih-rshift.S47 mtctr 5 # put limb count in CTR loop register
48 l 0,0(4) # read least significant limb
50 sle 3,0,8 # compute carry limb, and init MQ register
51 bdz Lend2 # if just one limb, skip loop
52 lu 0,4(4) # read 2:nd least significant limb
53 sleq 7,0,8 # compute least significant limb of result
54 bdz Lend # if just two limb, skip loop
55 Loop: lu 0,4(4) # load next higher limb
57 sleq 7,0,8 # compute result limb
59 Lend: stu 7,4(9) # store 2:nd most significant limb
[all...]
H A Dmpih-add1.S1 /* IBM POWER add_n -- Add two limb vectors of equal, non-zero length.
47 l 8,0(4) # load least significant s1 limb
48 l 0,0(5) # load least significant s2 limb
63 L1: lu 8,4(4) # load s1 limb and update s1_ptr
64 lu 0,4(5) # load s2 limb and update s2_ptr
67 Leven: lu 9,4(4) # load s1 limb and update s1_ptr
68 lu 10,4(5) # load s2 limb and update s2_ptr
71 Loop: lu 8,4(4) # load s1 limb and update s1_ptr
72 lu 0,4(5) # load s2 limb and update s2_ptr
75 lu 9,4(4) # load s1 limb an
[all...]
H A Dmpih-sub1.S1 /* IBM POWER sub_n -- Subtract two limb vectors of equal, non-zero length.
47 l 8,0(4) # load least significant s1 limb
48 l 0,0(5) # load least significant s2 limb
64 L1: lu 8,4(4) # load s1 limb and update s1_ptr
65 lu 0,4(5) # load s2 limb and update s2_ptr
68 Leven: lu 9,4(4) # load s1 limb and update s1_ptr
69 lu 10,4(5) # load s2 limb and update s2_ptr
72 Loop: lu 8,4(4) # load s1 limb and update s1_ptr
73 lu 0,4(5) # load s2 limb and update s2_ptr
76 lu 9,4(4) # load s1 limb an
[all...]
H A Dmpih-mul2.S1 /* IBM POWER addmul_1 -- Multiply a limb vector with a limb and add
2 * the result to a second limb vector.
37 # instruction, and add the appropriate compensation to the high limb of the
76 ae 8,0,9 # low limb + old_cy_limb + old cy
81 cax 10,10,6 # adjust high limb for negative limb from s1
93 cax 9,9,6 # adjust high limb for negative limb from s1
110 cax 10,10,6 # adjust high limb fo
[all...]
H A Dmpih-mul3.S1 /* IBM POWER submul_1 -- Multiply a limb vector with a limb and subtract
2 * the result from a second limb vector.
37 # instruction, and add the appropriate compensation to the high limb of the
77 ae 11,0,9 # low limb + old_cy_limb + old cy
83 cax 10,10,6 # adjust high limb for negative limb from s1
96 cax 9,9,6 # adjust high limb for negative limb from s1
114 cax 10,10,6 # adjust high limb fo
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libgcrypt-1.5.0/mpi/power/
H A Dmpih-lshift.S49 mtctr 5 # put limb count in CTR loop register
50 lu 0,-4(4) # read most significant limb
51 sre 3,0,8 # compute carry out limb, and init MQ register
52 bdz Lend2 # if just one limb, skip loop
53 lu 0,-4(4) # read 2:nd most significant limb
54 sreq 7,0,8 # compute most significant limb of result
55 bdz Lend # if just two limb, skip loop
56 Loop: lu 0,-4(4) # load next lower limb
58 sreq 7,0,8 # compute result limb
60 Lend: stu 7,-4(9) # store 2:nd least significant limb
[all...]
H A Dmpih-mul1.S1 /* IBM POWER mul_1 -- Multiply a limb vector with a limb and store
2 * the result in a second limb vector.
35 # instruction, and add the appropriate compensation to the high limb of the
74 cax 10,10,6 # adjust high limb for negative limb from s1
83 cax 9,9,6 # adjust high limb for negative limb from s1
93 cax 10,10,0 # adjust high limb for negative s2_limb
97 cax 10,10,6 # adjust high limb fo
[all...]
H A Dmpih-rshift.S47 mtctr 5 # put limb count in CTR loop register
48 l 0,0(4) # read least significant limb
50 sle 3,0,8 # compute carry limb, and init MQ register
51 bdz Lend2 # if just one limb, skip loop
52 lu 0,4(4) # read 2:nd least significant limb
53 sleq 7,0,8 # compute least significant limb of result
54 bdz Lend # if just two limb, skip loop
55 Loop: lu 0,4(4) # load next higher limb
57 sleq 7,0,8 # compute result limb
59 Lend: stu 7,4(9) # store 2:nd most significant limb
[all...]
H A Dmpih-add1.S1 /* IBM POWER add_n -- Add two limb vectors of equal, non-zero length.
47 l 8,0(4) # load least significant s1 limb
48 l 0,0(5) # load least significant s2 limb
63 L1: lu 8,4(4) # load s1 limb and update s1_ptr
64 lu 0,4(5) # load s2 limb and update s2_ptr
67 Leven: lu 9,4(4) # load s1 limb and update s1_ptr
68 lu 10,4(5) # load s2 limb and update s2_ptr
71 Loop: lu 8,4(4) # load s1 limb and update s1_ptr
72 lu 0,4(5) # load s2 limb and update s2_ptr
75 lu 9,4(4) # load s1 limb an
[all...]
H A Dmpih-sub1.S1 /* IBM POWER sub_n -- Subtract two limb vectors of equal, non-zero length.
47 l 8,0(4) # load least significant s1 limb
48 l 0,0(5) # load least significant s2 limb
64 L1: lu 8,4(4) # load s1 limb and update s1_ptr
65 lu 0,4(5) # load s2 limb and update s2_ptr
68 Leven: lu 9,4(4) # load s1 limb and update s1_ptr
69 lu 10,4(5) # load s2 limb and update s2_ptr
72 Loop: lu 8,4(4) # load s1 limb and update s1_ptr
73 lu 0,4(5) # load s2 limb and update s2_ptr
76 lu 9,4(4) # load s1 limb an
[all...]
H A Dmpih-mul2.S1 /* IBM POWER addmul_1 -- Multiply a limb vector with a limb and add
2 * the result to a second limb vector.
37 # instruction, and add the appropriate compensation to the high limb of the
76 ae 8,0,9 # low limb + old_cy_limb + old cy
81 cax 10,10,6 # adjust high limb for negative limb from s1
93 cax 9,9,6 # adjust high limb for negative limb from s1
110 cax 10,10,6 # adjust high limb fo
[all...]
H A Dmpih-mul3.S1 /* IBM POWER submul_1 -- Multiply a limb vector with a limb and subtract
2 * the result from a second limb vector.
37 # instruction, and add the appropriate compensation to the high limb of the
77 ae 11,0,9 # low limb + old_cy_limb + old cy
83 cax 10,10,6 # adjust high limb for negative limb from s1
96 cax 9,9,6 # adjust high limb for negative limb from s1
114 cax 10,10,6 # adjust high limb fo
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libgcrypt-1.5.0/mpi/mips3/
H A Dmpih-mul1.S1 /* mips3 mpih-mul1.S -- Multiply a limb vector with a limb and store
2 * the result in a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
59 daddu $10,$10,$2 # add old carry limb to low product limb
61 ld $8,0($5) # load new s1 limb as early as possible
67 daddu $2,$9,$2 # add high product limb and carry from addition
77 daddu $2,$9,$2 # add high product limb and carry from addition
86 daddu $2,$9,$2 # add high product limb an
[all...]
H A Dmpih-mul2.S1 /* MIPS3 addmul_1 -- Multiply a limb vector with a single limb and
2 * add the product to a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
60 daddu $3,$3,$2 # add old carry limb to low product limb
62 ld $8,0($5) # load new s1 limb as early as possible
71 daddu $2,$9,$2 # add high product limb and carry from addition
85 daddu $2,$9,$2 # add high product limb and carry from addition
98 daddu $2,$9,$2 # add high product limb an
[all...]
H A Dmpih-mul3.S1 /* MIPS3 submul_1 -- Multiply a limb vector with a single limb and
2 * subtract the product from a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
60 daddu $3,$3,$2 # add old carry limb to low product limb
62 ld $8,0($5) # load new s1 limb as early as possible
71 daddu $2,$9,$2 # add high product limb and carry from addition
85 daddu $2,$9,$2 # add high product limb and carry from addition
98 daddu $2,$9,$2 # add high product limb an
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libgcrypt-1.5.0/mpi/mips3/
H A Dmpih-mul1.S1 /* mips3 mpih-mul1.S -- Multiply a limb vector with a limb and store
2 * the result in a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
59 daddu $10,$10,$2 # add old carry limb to low product limb
61 ld $8,0($5) # load new s1 limb as early as possible
67 daddu $2,$9,$2 # add high product limb and carry from addition
77 daddu $2,$9,$2 # add high product limb and carry from addition
86 daddu $2,$9,$2 # add high product limb an
[all...]
H A Dmpih-mul2.S1 /* MIPS3 addmul_1 -- Multiply a limb vector with a single limb and
2 * add the product to a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
60 daddu $3,$3,$2 # add old carry limb to low product limb
62 ld $8,0($5) # load new s1 limb as early as possible
71 daddu $2,$9,$2 # add high product limb and carry from addition
85 daddu $2,$9,$2 # add high product limb and carry from addition
98 daddu $2,$9,$2 # add high product limb an
[all...]
H A Dmpih-mul3.S1 /* MIPS3 submul_1 -- Multiply a limb vector with a single limb and
2 * subtract the product from a second limb vector.
54 ld $8,0($5) # load new s1 limb as early as possible
60 daddu $3,$3,$2 # add old carry limb to low product limb
62 ld $8,0($5) # load new s1 limb as early as possible
71 daddu $2,$9,$2 # add high product limb and carry from addition
85 daddu $2,$9,$2 # add high product limb and carry from addition
98 daddu $2,$9,$2 # add high product limb an
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libgcrypt-1.5.0/mpi/powerpc32/
H A Dmpih-add1.S1 /* PowerPC-32 add_n -- Add two limb vectors of equal, non-zero length.
49 lwz 8,0(4) # load least significant s1 limb
50 lwz 0,0(5) # load least significant s2 limb
54 Loop: lwzu 8,4(4) # load s1 limb and update s1_ptr
55 lwzu 0,4(5) # load s2 limb and update s2_ptr
56 stwu 7,4(3) # store previous limb in load latency slot
59 Lend: stw 7,4(3) # store ultimate result limb
65 /* Add two limb vectors of equal, non-zero length for PowerPC.

Completed in 195 milliseconds

123