Home
last modified time | relevance | path

Searched refs:big (Results 126 – 150 of 41320) sorted by relevance

12345678910>>...1653

/dports/lang/gcc12-devel/gcc-12-20211205/libgo/go/crypto/elliptic/
H A Delliptic.go33 Add(x1, y1, x2, y2 *big.Int) (x, y *big.Int)
35 Double(x1, y1 *big.Int) (x, y *big.Int)
99 func zForAffine(x, y *big.Int) *big.Int {
111 return new(big.Int), new(big.Int)
125 func (curve *CurveParams) Add(x1, y1, x2, y2 *big.Int) (*big.Int, *big.Int) {
139 func (curve *CurveParams) addJacobian(x1, y1, z1, x2, y2, z2 *big.Int) (*big.Int, *big.Int, *big.In…
141 x3, y3, z3 := new(big.Int), new(big.Int), new(big.Int)
215 func (curve *CurveParams) Double(x1, y1 *big.Int) (*big.Int, *big.Int) {
228 func (curve *CurveParams) doubleJacobian(x, y, z *big.Int) (*big.Int, *big.Int, *big.Int) {
287 func (curve *CurveParams) ScalarMult(Bx, By *big.Int, k []byte) (*big.Int, *big.Int) {
[all …]
/dports/www/firefox-esr/firefox-91.8.0/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little)
19 return strstr(big, little);
37 bl = strlen(big);
41 p = &big[ bl - ll ];
43 for( ; p >= big; p-- )
71 for( ; max && *big; big++, max-- ) in get()
72 if( *little == *big ) in get()
74 return (char *)big; in get()
95 for( p = big; max && *p; p++, max-- )
99 if( p < big ) {
[all …]
H A Dstrcase.c97 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
110 for( ; *big; big++ ) in PL_strcasestr()
113 return (char *)big; in PL_strcasestr()
132 bl = strlen(big); in PL_strcaserstr()
137 p = &big[ bl - ll ]; in PL_strcaserstr()
139 for( ; p >= big; p-- ) in PL_strcaserstr()
167 for( ; max && *big; big++, max-- ) in PL_strncasestr()
170 return (char *)big; in PL_strncasestr()
191 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
195 if( p < big ) { in PL_strncaserstr()
[all …]
/dports/www/firefox/firefox-99.0/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
19 return strstr(big, little); in PL_strstr()
37 bl = strlen(big); in PL_strrstr()
41 p = &big[ bl - ll ]; in PL_strrstr()
43 for( ; p >= big; p-- ) in PL_strrstr()
71 for( ; max && *big; big++, max-- ) in PL_strnstr()
72 if( *little == *big ) in PL_strnstr()
74 return (char *)big; in PL_strnstr()
95 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
99 if( p < big ) { in PL_strnrstr()
[all …]
H A Dstrcase.c97 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
110 for( ; *big; big++ ) in PL_strcasestr()
113 return (char *)big; in PL_strcasestr()
132 bl = strlen(big); in PL_strcaserstr()
137 p = &big[ bl - ll ]; in PL_strcaserstr()
139 for( ; p >= big; p-- ) in PL_strcaserstr()
167 for( ; max && *big; big++, max-- ) in PL_strncasestr()
170 return (char *)big; in PL_strncasestr()
191 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
195 if( p < big ) { in PL_strncaserstr()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
15 return strstr(big, little); in PL_strstr()
29 bl = strlen(big); in PL_strrstr()
31 p = &big[ bl - ll ]; in PL_strrstr()
33 for( ; p >= big; p-- ) in PL_strrstr()
54 for( ; max && *big; big++, max-- ) in PL_strnstr()
55 if( *little == *big ) in PL_strnstr()
57 return (char *)big; in PL_strnstr()
73 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
77 if( p < big ) return (char *)0; in PL_strnrstr()
[all …]
H A Dstrcase.c91 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
100 for( ; *big; big++ ) in PL_strcasestr()
103 return (char *)big; in PL_strcasestr()
117 bl = strlen(big); in PL_strcaserstr()
120 p = &big[ bl - ll ]; in PL_strcaserstr()
122 for( ; p >= big; p-- ) in PL_strcaserstr()
143 for( ; max && *big; big++, max-- ) in PL_strncasestr()
146 return (char *)big; in PL_strncasestr()
162 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
166 if( p < big ) return (char *)0; in PL_strncaserstr()
[all …]
/dports/www/firefox-legacy/firefox-52.8.0esr/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
15 return strstr(big, little); in PL_strstr()
29 bl = strlen(big); in PL_strrstr()
31 p = &big[ bl - ll ]; in PL_strrstr()
33 for( ; p >= big; p-- ) in PL_strrstr()
54 for( ; max && *big; big++, max-- ) in PL_strnstr()
55 if( *little == *big ) in PL_strnstr()
57 return (char *)big; in PL_strnstr()
73 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
77 if( p < big ) return (char *)0; in PL_strnrstr()
[all …]
H A Dstrcase.c91 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
100 for( ; *big; big++ ) in PL_strcasestr()
103 return (char *)big; in PL_strcasestr()
117 bl = strlen(big); in PL_strcaserstr()
120 p = &big[ bl - ll ]; in PL_strcaserstr()
122 for( ; p >= big; p-- ) in PL_strcaserstr()
143 for( ; max && *big; big++, max-- ) in PL_strncasestr()
146 return (char *)big; in PL_strncasestr()
162 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
166 if( p < big ) return (char *)0; in PL_strncaserstr()
[all …]
/dports/devel/nspr/nspr-4.33/nspr/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
19 return strstr(big, little); in PL_strstr()
37 bl = strlen(big); in PL_strrstr()
41 p = &big[ bl - ll ]; in PL_strrstr()
43 for( ; p >= big; p-- ) in PL_strrstr()
71 for( ; max && *big; big++, max-- ) in PL_strnstr()
72 if( *little == *big ) in PL_strnstr()
74 return (char *)big; in PL_strnstr()
95 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
99 if( p < big ) { in PL_strnrstr()
[all …]
H A Dstrcase.c97 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
110 for( ; *big; big++ ) in PL_strcasestr()
113 return (char *)big; in PL_strcasestr()
132 bl = strlen(big); in PL_strcaserstr()
137 p = &big[ bl - ll ]; in PL_strcaserstr()
139 for( ; p >= big; p-- ) in PL_strcaserstr()
167 for( ; max && *big; big++, max-- ) in PL_strncasestr()
170 return (char *)big; in PL_strncasestr()
191 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
195 if( p < big ) { in PL_strncaserstr()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
19 return strstr(big, little); in PL_strstr()
37 bl = strlen(big); in PL_strrstr()
41 p = &big[ bl - ll ]; in PL_strrstr()
43 for( ; p >= big; p-- ) in PL_strrstr()
71 for( ; max && *big; big++, max-- ) in PL_strnstr()
72 if( *little == *big ) in PL_strnstr()
74 return (char *)big; in PL_strnstr()
95 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
99 if( p < big ) { in PL_strnrstr()
[all …]
H A Dstrcase.c97 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
110 for( ; *big; big++ ) in PL_strcasestr()
113 return (char *)big; in PL_strcasestr()
132 bl = strlen(big); in PL_strcaserstr()
137 p = &big[ bl - ll ]; in PL_strcaserstr()
139 for( ; p >= big; p-- ) in PL_strcaserstr()
167 for( ; max && *big; big++, max-- ) in PL_strncasestr()
170 return (char *)big; in PL_strncasestr()
191 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
195 if( p < big ) { in PL_strncaserstr()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/nsprpub/lib/libc/src/
H A Dstrstr.c10 PL_strstr(const char *big, const char *little) in PL_strstr() argument
19 return strstr(big, little); in PL_strstr()
37 bl = strlen(big); in PL_strrstr()
41 p = &big[ bl - ll ]; in PL_strrstr()
43 for( ; p >= big; p-- ) in PL_strrstr()
71 for( ; max && *big; big++, max-- ) in PL_strnstr()
72 if( *little == *big ) in PL_strnstr()
74 return (char *)big; in PL_strnstr()
95 for( p = big; max && *p; p++, max-- ) in PL_strnrstr()
99 if( p < big ) { in PL_strnrstr()
[all …]
H A Dstrcase.c97 PL_strcasestr(const char *big, const char *little) in PL_strcasestr() argument
110 for( ; *big; big++ ) in PL_strcasestr()
113 return (char *)big; in PL_strcasestr()
132 bl = strlen(big); in PL_strcaserstr()
137 p = &big[ bl - ll ]; in PL_strcaserstr()
139 for( ; p >= big; p-- ) in PL_strcaserstr()
167 for( ; max && *big; big++, max-- ) in PL_strncasestr()
170 return (char *)big; in PL_strncasestr()
191 for( p = big; max && *p; p++, max-- ) in PL_strncaserstr()
195 if( p < big ) { in PL_strncaserstr()
[all …]
/dports/multimedia/mkvtoolnix/mkvtoolnix-65.0.0/tests/unit/common/
H A Dfourcc.cpp13 uint32_t big = 0x31323334; variable
17 EXPECT_EQ(big, fourcc_c(big) .value()); in TEST()
18 EXPECT_EQ(big, fourcc_c(big, fourcc_c::byte_order_e::big_endian).value()); in TEST()
23 put_uint32_be(buffer, big); in TEST()
67 put_uint32_be(big_m, big); in TEST()
68 put_uint32_le(little_m, big); in TEST()
83 put_uint32_be(big_m, big); in TEST()
118 fourcc_c big_f{big}; in TEST()
150 fourcc_c big_f{big}; in TEST()
292 EXPECT_EQ(big, fourcc_c{big}.value()); in TEST()
[all …]
/dports/net-im/coyim/coyim-0.3.11/vendor/github.com/coyim/otr3/
H A Dbn_utils.go5 func modExp(g, x *big.Int) *big.Int {
6 return new(big.Int).Exp(g, x, p)
9 func modInverse(g, x *big.Int) *big.Int {
13 func mul(l, r *big.Int) *big.Int {
14 return new(big.Int).Mul(l, r)
17 func sub(l, r *big.Int) *big.Int {
18 return new(big.Int).Sub(l, r)
21 func mulMod(l, r, m *big.Int) *big.Int {
28 func divMod(l, r, m *big.Int) *big.Int {
32 func subMod(l, r, m *big.Int) *big.Int {
[all …]
/dports/net/croc/croc-9.5.0/vendor/github.com/tscholl2/siec/
H A Dsiec.go13 zero = big.NewInt(0)
14 two = big.NewInt(2)
15 three = big.NewInt(3)
16 eight = big.NewInt(8)
83 x3 = new(big.Int)
84 y3 = new(big.Int)
125 r := new(big.Int)
140 x, y = new(big.Int), new(big.Int)
164 x, y = new(big.Int), new(big.Int)
187 func (curve *SIEC255Params) liftX(X *big.Int) (x, y *big.Int) {
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/vendor/github.com/status-im/keycard-go/vendor/github.com/ethereum/go-ethereum/common/math/
H A Dbig.go29 tt256m1 = new(big.Int).Sub(tt256, big.NewInt(1))
32 MaxBig63 = new(big.Int).Sub(tt63, big.NewInt(1))
67 return new(big.Int), true
69 var bigint *big.Int
93 r := big.NewInt(a)
98 func BigMax(x, y *big.Int) *big.Int {
106 func BigMin(x, y *big.Int) *big.Int {
176 func U256(x *big.Int) *big.Int {
187 func S256(x *big.Int) *big.Int {
199 func Exp(base, exponent *big.Int) *big.Int {
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/core/
H A Dstate_processor_test.go45 ChainID: big.NewInt(1),
74 Value: big.NewInt(0),
107 makeTx(key1, 0, common.Address{}, big.NewInt(0), params.TxGas, big.NewInt(875000000), nil),
108 makeTx(key1, 0, common.Address{}, big.NewInt(0), params.TxGas, big.NewInt(875000000), nil),
114 makeTx(key1, 100, common.Address{}, big.NewInt(0), params.TxGas, big.NewInt(875000000), nil),
126 makeTx(key1, 0, common.Address{}, big.NewInt(0), 21000000, big.NewInt(875000000), nil),
160 mkDynamicTx(0, common.Address{}, params.TxGas, big.NewInt(0), big.NewInt(0)),
178 mkDynamicTx(0, common.Address{}, params.TxGas, big.NewInt(2), big.NewInt(1)),
189 mkDynamicTx(0, common.Address{}, params.TxGas, big.NewInt(1), big.NewInt(50000000000000)),
245 mkDynamicTx(0, common.Address{}, params.TxGas-1000, big.NewInt(0), big.NewInt(0)),
[all …]
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/crypto/elliptic/
H A Delliptic.go36 Add(x1, y1, x2, y2 *big.Int) (x, y *big.Int)
38 Double(x1, y1 *big.Int) (x, y *big.Int)
102 func zForAffine(x, y *big.Int) *big.Int {
114 return new(big.Int), new(big.Int)
128 func (curve *CurveParams) Add(x1, y1, x2, y2 *big.Int) (*big.Int, *big.Int) {
142 func (curve *CurveParams) addJacobian(x1, y1, z1, x2, y2, z2 *big.Int) (*big.Int, *big.Int, *big.In…
144 x3, y3, z3 := new(big.Int), new(big.Int), new(big.Int)
218 func (curve *CurveParams) Double(x1, y1 *big.Int) (*big.Int, *big.Int) {
231 func (curve *CurveParams) doubleJacobian(x, y, z *big.Int) (*big.Int, *big.Int, *big.Int) {
290 func (curve *CurveParams) ScalarMult(Bx, By *big.Int, k []byte) (*big.Int, *big.Int) {
[all …]
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/wuffs/src/lib/interval/
H A Dinterval_test.go61 i := IntRange{big.NewInt(0), big.NewInt(255)}
62 j := IntRange{big.NewInt(0), big.NewInt(3)}
63 four := IntRange{big.NewInt(4), big.NewInt(4)}
65 want := IntRange{big.NewInt(0), big.NewInt(1023)}
78 alternativeBigIntLsh := func(i *big.Int, j *big.Int) *big.Int {
86 alternativeBigIntRsh := func(i *big.Int, j *big.Int) *big.Int {
254 x = IntRange{big.NewInt(-1), big.NewInt(-2)}
256 x = IntRange{big.NewInt(00), big.NewInt(-2)}
258 x = IntRange{big.NewInt(+2), big.NewInt(-2)}
260 x = IntRange{big.NewInt(+2), big.NewInt(00)}
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/wuffs/src/lib/interval/
H A Dinterval_test.go61 i := IntRange{big.NewInt(0), big.NewInt(255)}
62 j := IntRange{big.NewInt(0), big.NewInt(3)}
63 four := IntRange{big.NewInt(4), big.NewInt(4)}
65 want := IntRange{big.NewInt(0), big.NewInt(1023)}
78 alternativeBigIntLsh := func(i *big.Int, j *big.Int) *big.Int {
86 alternativeBigIntRsh := func(i *big.Int, j *big.Int) *big.Int {
254 x = IntRange{big.NewInt(-1), big.NewInt(-2)}
256 x = IntRange{big.NewInt(00), big.NewInt(-2)}
258 x = IntRange{big.NewInt(+2), big.NewInt(-2)}
260 x = IntRange{big.NewInt(+2), big.NewInt(00)}
[all …]
/dports/converters/p5-Convert-Binary-C/Convert-Binary-C-0.84/tests/include/pdclib/functions/_PDCLIB/
H A D_PDCLIB_bigint_log2.c53 _PDCLIB_bigint_t big; in main() local
54 _PDCLIB_bigint2( &big, 0 ); in main()
55 TESTCASE( _PDCLIB_bigint_log2( &big ) == 0 ); in main()
56 _PDCLIB_bigint2( &big, 1 ); in main()
57 TESTCASE( _PDCLIB_bigint_log2( &big ) == 1 ); in main()
58 _PDCLIB_bigint2( &big, 31 ); in main()
59 TESTCASE( _PDCLIB_bigint_log2( &big ) == 31 ); in main()
60 _PDCLIB_bigint2( &big, 32 ); in main()
61 TESTCASE( _PDCLIB_bigint_log2( &big ) == 32 ); in main()
62 _PDCLIB_bigint2( &big, 63 ); in main()
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/cuelang.org/go/pkg/math/bits/
H A Dmanual.go29 func Lsh(x *big.Int, n uint) *big.Int {
30 var z big.Int
36 func Rsh(x *big.Int, n uint) *big.Int {
37 var z big.Int
53 func Set(x *big.Int, i int, bit uint) *big.Int {
54 var z big.Int
60 func And(a, b *big.Int) *big.Int {
61 var z big.Int
67 func Or(a, b *big.Int) *big.Int {
74 func Xor(a, b *big.Int) *big.Int {
[all …]

12345678910>>...1653