OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:reduction
(Results
1 - 25
of
327
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/frameworks/base/core/tests/coretests/res/raw/
v21_winmo_65.vcf
8
X-
REDUCTION
:
v30_simple.vcf
11
X-
REDUCTION
:0
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/
for_each.h
53
* @param
reduction
Reduction
functor.
54
* @param reduction_start Initial value for
reduction
.
64
Red
reduction
, Result reduction_start,
72
functionality,
reduction
,
78
reduction
,
84
reduction
,
91
reduction
,
/libcore/luni/src/main/java/java/security/spec/
ECFieldF2m.java
38
//
Reduction
polynomial
40
// Mid term(s) of
reduction
polynomial
63
* basis and the
reduction
polynomial based on {@code rp}.
65
* The
reduction
polynomial must be either <i>trinomial</i> or
71
* the base of the
reduction
polynomial with the n-th bit
72
* corresponding to the n-th coefficient of the
reduction
109
* a polynomial basis and the
reduction
polynomial based on {@code ks}.
111
* The
reduction
polynomial must be either <i>trinomial</i> or
117
* the base of the
reduction
polynomial with coefficients
120
* if {@code m <= zero} or the
reduction
polynomial is no
[
all
...]
/external/dropbear/libtommath/logs/
graphs.dem
13
plot 'expt.log' smooth bezier title "Exptmod (Montgomery)", 'expt_dr.log' smooth bezier title "Exptmod (Dimminished Radix)", 'expt_2k.log' smooth bezier title "Exptmod (2k
Reduction
)"
/external/dropbear/libtommath/
bn_mp_exptmod_fast.c
23
* Uses Montgomery or Diminished Radix
reduction
[whichever appropriate]
38
/* use a pointer to the
reduction
algorithm. This allows us to use
39
* one of many
reduction
algorithms without modding the guts of
85
/* determine and setup
reduction
code */
115
/* setup DR
reduction
for moduli of the form B**k - b */
124
/* setup DR
reduction
for moduli of the form 2**k - b */
294
/* fixup result if Montgomery
reduction
is used
bn_mp_exptmod.c
68
/* modified diminished radix
reduction
*/
97
/* otherwise use the generic Barrett
reduction
technique */
bn_mp_reduce_setup.c
18
/* pre-calculate the value required for Barrett
reduction
tommath.out
85
\BOOKMARK [0][-]{chapter.6}{Modular
Reduction
}{}
86
\BOOKMARK [1][-]{section.6.1}{Basics of Modular
Reduction
}{chapter.6}
87
\BOOKMARK [1][-]{section.6.2}{The Barrett
Reduction
}{chapter.6}
94
\BOOKMARK [1][-]{section.6.3}{The Montgomery
Reduction
}{chapter.6}
95
\BOOKMARK [2][-]{subsection.6.3.1}{Digit Based Montgomery
Reduction
}{section.6.3}
96
\BOOKMARK [2][-]{subsection.6.3.2}{Baseline Montgomery
Reduction
}{section.6.3}
97
\BOOKMARK [2][-]{subsection.6.3.3}{Faster ``Comba'' Montgomery
Reduction
}{section.6.3}
102
\BOOKMARK [2][-]{subsection.6.4.3}{Restricted Diminished Radix
Reduction
}{section.6.4}
103
\BOOKMARK [2][-]{subsection.6.4.4}{Unrestricted Diminished Radix
Reduction
}{section.6.4}
bn_mp_montgomery_reduce.c
18
/* computes xR**-1 == x (mod N) via Montgomery
Reduction
*/
25
/* can the fast
reduction
[comba] method be used?
bn_mp_montgomery_setup.c
18
/* setups the montgomery
reduction
stuff */
bn_fast_mp_montgomery_reduce.c
18
/* computes xR**-1 == x (mod N) via Montgomery
Reduction
22
*
reduction
.
86
* column since the Montgomery
reduction
requires digits of the
/external/bison/src/
reduce.h
1
/* Grammar
reduction
for Bison.
/bionic/libm/src/
s_cos.c
23
* __ieee754_rem_pio2 ... argument
reduction
routine
71
/* argument
reduction
needed */
s_sin.c
23
* __ieee754_rem_pio2 ... argument
reduction
routine
71
/* argument
reduction
needed */
s_tan.c
22
* __ieee754_rem_pio2 ... argument
reduction
routine
70
/* argument
reduction
needed */
/external/fdlibm/
s_cos.c
20
* __ieee754_rem_pio2 ... argument
reduction
routine
67
/* argument
reduction
needed */
s_sin.c
20
* __ieee754_rem_pio2 ... argument
reduction
routine
67
/* argument
reduction
needed */
s_tan.c
19
* __ieee754_rem_pio2 ... argument
reduction
routine
66
/* argument
reduction
needed */
/frameworks/base/opengl/libagl/
fp.cpp
62
// scale angle for easy argument
reduction
66
// Argument
reduction
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ada/gcc-interface/
ada-tree.def
44
/* Same as PLUS_EXPR, except that no modulo
reduction
is applied.
48
/* Same as MINUS_EXPR, except that no modulo
reduction
is applied.
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ada/gcc-interface/
ada-tree.def
44
/* Same as PLUS_EXPR, except that no modulo
reduction
is applied.
48
/* Same as MINUS_EXPR, except that no modulo
reduction
is applied.
/cts/tools/dasm/src/java_cup/
parse_action_row.java
41
/** Table of
reduction
counts (reused by compute_default()). */
64
* effect of replacing all errors by that
reduction
. This may cause
67
* be used to encode the fact that no
reduction
can be used as a
78
/* clear the
reduction
count table and maximums */
/external/bison/tests/
testsuite.at
31
# Testing grammar
reduction
.
/external/jpeg/
jdpostct.c
10
* quantization/
reduction
steps; specifically, it controls the buffering
11
* between upsample/color conversion and color quantization/
reduction
.
13
* If no color quantization/
reduction
is required, then this module has no
122
* This is used for color precision
reduction
as well as one-pass quantization.
Completed in 369 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>