| /dports/textproc/mdbook-linkcheck/mdbook-linkcheck-0.7.6/cargo-crates/openssl-src-300.0.2+3.0.0/openssl/crypto/whrlpool/ |
| H A D | wp_block.c | 182 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
183 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
200 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
201 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
202 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
203 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
204 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
205 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
206 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
207 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/lang/rust/rustc-1.58.1-src/vendor/openssl-src/openssl/crypto/whrlpool/ |
| H A D | wp_block.c | 176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
177 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
195 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
196 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
197 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
198 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
199 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
200 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
201 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl/openssl-1.1.1n/crypto/whrlpool/ |
| H A D | wp_block.c | 176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
177 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
195 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
196 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
197 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
198 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
199 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
200 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
201 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl-legacy-static/openssl-1.0.2u/crypto/whrlpool/ |
| H A D | wp_block.c | 157 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
158 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
175 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
176 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
177 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
178 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
179 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
180 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
181 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
182 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl-static/openssl-1.1.1l/crypto/whrlpool/ |
| H A D | wp_block.c | 176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
177 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
195 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
196 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
197 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
198 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
199 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
200 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
201 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl-quictls/openssl-7f2ab56a2b842b8e6fefc7b9d20eb5ff9c6ef151/crypto/whrlpool/ |
| H A D | wp_block.c | 182 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
183 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
200 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
201 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
202 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
203 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
204 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
205 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
206 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
207 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl-unsafe/openssl-c9ba19c/crypto/whrlpool/ |
| H A D | wp_block.c | 157 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
158 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
175 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
176 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
177 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
178 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
179 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
180 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
181 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
182 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/security/openssl-devel/openssl-3.0.2/crypto/whrlpool/ |
| H A D | wp_block.c | 182 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
183 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
200 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
201 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
202 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
203 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
204 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
205 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
206 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
207 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/sysutils/edk2/edk2-edk2-stable202102/CryptoPkg/Library/OpensslLib/openssl/crypto/whrlpool/ |
| H A D | wp_block.c | 162 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
163 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
180 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
181 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
182 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
183 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
184 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
185 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
186 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
187 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/sysutils/exa/exa-0.10.1/cargo-crates/openssl-src-111.15.0+1.1.1k/openssl/crypto/whrlpool/ |
| H A D | wp_block.c | 176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
177 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
195 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
196 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
197 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
198 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
199 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
200 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
201 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/www/node10/node-v10.24.1/deps/openssl/openssl/crypto/whrlpool/ |
| H A D | wp_block.c | 176 # define C0(K,i) (Cx.q[K.c[(i)*8+0]]) argument
177 # define C1(K,i) ROTATE(Cx.q[K.c[(i)*8+1]],8) argument
194 # define C0(K,i) (Cx.q[0+8*K.c[(i)*8+0]]) argument
195 # define C1(K,i) (Cx.q[1+8*K.c[(i)*8+1]]) argument
196 # define C2(K,i) (Cx.q[2+8*K.c[(i)*8+2]]) argument
197 # define C3(K,i) (Cx.q[3+8*K.c[(i)*8+3]]) argument
198 # define C4(K,i) (Cx.q[4+8*K.c[(i)*8+4]]) argument
199 # define C5(K,i) (Cx.q[5+8*K.c[(i)*8+5]]) argument
200 # define C6(K,i) (Cx.q[6+8*K.c[(i)*8+6]]) argument
201 # define C7(K,i) (Cx.q[7+8*K.c[(i)*8+7]]) argument
[all …]
|
| /dports/math/givaro/givaro-4.1.1/src/kernel/recint/ |
| H A D | rmsub.h | 130 inline rmint<K, MG>& sub(rmint<K, MG>& a, const rmint<K, MG>& b, const rmint<K, MG>& c) { in sub()
142 inline rmint<K, MG>& sub(rmint<K, MG>& a, const rmint<K, MG>& b) { in sub()
153 …inline __RECINT_IS_ARITH(T, rmint<K, MG>&) sub(rmint<K, MG>& a, const rmint<K, MG>& b, const T& c)… in __RECINT_IS_ARITH()
160 inline __RECINT_IS_ARITH(T, rmint<K, MG>&) sub(rmint<K, MG>& a, const T& b) { in __RECINT_IS_ARITH()
|
| /dports/math/cgal/CGAL-5.3/include/CGAL/Straight_skeleton_2/ |
| H A D | Polygon_iterators.h | 46 vertices_begin ( Polygon_2<K,C> const& aPoly ) in vertices_begin()
51 vertices_end( Polygon_2<K,C> const& aPoly ) in vertices_end()
55 …pename Polygon_2<K,C>::Vertex_const_iterator vertices_begin ( boost::shared_ptr<Polygon_2<K,C> > c… in vertices_begin()
59 inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_end( boost::shared_ptr<Polygon_2<K,C… in vertices_end()
65 vertices_begin ( Polygon_with_holes_2<K,C> const& aPoly ) in vertices_begin()
70 vertices_end( Polygon_with_holes_2<K,C> const& aPoly ) in vertices_end()
75 vertices_begin ( boost::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly ) in vertices_begin()
80 vertices_end( boost::shared_ptr<Polygon_with_holes_2<K,C> > const& aPoly ) in vertices_end()
|
| /dports/devel/rust-analyzer/rust-analyzer-2021-12-20/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/lang/gleam/gleam-0.18.2/cargo-crates/petgraph-0.6.0/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/devel/grex/grex-1.3.0/cargo-crates/petgraph-0.6.0/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/net-im/libsignal-client/libsignal-client-0.9.6/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/sysutils/vector/vector-0.10.0/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/games/abstreet/abstreet-0.2.9-49-g74aca40c0/cargo-crates/petgraph-0.5.0/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/petgraph/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/net/krill/krill-0.9.4/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/devel/texlab/texlab-3.3.0/cargo-crates/petgraph-0.6.0/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.5.1/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|
| /dports/security/cargo-audit/rustsec-cargo-audit-v0.15.2/cargo-audit/cargo-crates/petgraph-0.6.0/src/ |
| H A D | unionfind.rs | 30 unsafe fn get_unchecked<K>(xs: &[K], index: usize) -> &K { in get_unchecked()
36 unsafe fn get_unchecked_mut<K>(xs: &mut [K], index: usize) -> &mut K { in get_unchecked_mut()
56 pub fn find(&self, x: K) -> K { in find()
78 pub fn find_mut(&mut self, x: K) -> K { in find_mut()
83 unsafe fn find_mut_recursive(&mut self, mut x: K) -> K { in find_mut_recursive()
96 pub fn equiv(&self, x: K, y: K) -> bool { in equiv()
105 pub fn union(&mut self, x: K, y: K) -> bool { in union()
135 pub fn into_labeling(mut self) -> Vec<K> { in into_labeling()
|