| /external/boringssl/src/ssl/test/runner/poly1305/ |
| sum_amd64.go | 15 // Sum generates an authenticator for m using a one-time key and puts the
18 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| sum_arm.go | 15 // Sum generates an authenticator for m using a one-time key and puts the
18 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/crypto/poly1305/ |
| sum_amd64.go | 13 // Sum generates an authenticator for m using a one-time key and puts the
16 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| sum_arm.go | 13 // Sum generates an authenticator for m using a one-time key and puts the
16 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| /prebuilts/go/darwin-x86/test/ddd2.dir/ |
| ddd2.go | 9 func Sum(args ...int) int {
|
| /prebuilts/go/darwin-x86/test/fixedbugs/ |
| bug298.go | 9 func Sum() int
|
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/crypto/poly1305/ |
| sum_amd64.go | 13 // Sum generates an authenticator for m using a one-time key and puts the
16 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| sum_arm.go | 13 // Sum generates an authenticator for m using a one-time key and puts the
16 func Sum(out *[16]byte, m []byte, key *[32]byte) {
|
| /prebuilts/go/linux-x86/test/ddd2.dir/ |
| ddd2.go | 9 func Sum(args ...int) int {
|
| /prebuilts/go/linux-x86/test/fixedbugs/ |
| bug298.go | 9 func Sum() int
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| armVCM4P10_PredictIntraDC4x4.c | 66 int x, y, Sum=0, Count = 0;
72 Sum += pSrcLeft[y*leftStep];
80 Sum += pSrcAbove[x];
86 Sum = 128;
90 Sum = (Sum + 2) >> 2;
94 Sum = (Sum + 4) >> 3;
100 pDst[y*dstStep+x] = (OMX_U8)Sum;
|
| /prebuilts/go/darwin-x86/test/method4.dir/ |
| method4a.go | 16 Sum([]int, int) int
20 Sum(a []int, b int) int
23 func (i T1) Sum(a []int, b int) int {
31 func (p *T2) Sum(a []int, b int) int {
|
| prog.go | 18 Sum([]int, int) int
22 Sum(a []int, b int) int
25 func (i T1) Sum(a []int, b int) int {
33 func (p *T2) Sum(a []int, b int) int {
52 eq(t1.Sum(a, 5), 15)
53 eq(t2.Sum(a, 6), 16)
55 eq(T1.Sum(t1, a, 7), 17)
56 eq((*T2).Sum(t2, a, 8), 18)
58 f1 := T1.Sum
60 f2 := (*T2).Sum
[all...] |
| /prebuilts/go/linux-x86/test/method4.dir/ |
| method4a.go | 16 Sum([]int, int) int
20 Sum(a []int, b int) int
23 func (i T1) Sum(a []int, b int) int {
31 func (p *T2) Sum(a []int, b int) int {
|
| prog.go | 18 Sum([]int, int) int
22 Sum(a []int, b int) int
25 func (i T1) Sum(a []int, b int) int {
33 func (p *T2) Sum(a []int, b int) int {
52 eq(t1.Sum(a, 5), 15)
53 eq(t2.Sum(a, 6), 16)
55 eq(T1.Sum(t1, a, 7), 17)
56 eq((*T2).Sum(t2, a, 8), 18)
58 f1 := T1.Sum
60 f2 := (*T2).Sum
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/hmac/ |
| hmac.go | 18 expectedMAC := mac.Sum(nil)
44 func (h *hmac) Sum(in []byte) []byte {
46 in = h.inner.Sum(in)
50 return h.outer.Sum(in[:origLen])
78 key = hm.outer.Sum(nil)
|
| /prebuilts/go/linux-x86/src/crypto/hmac/ |
| hmac.go | 18 expectedMAC := mac.Sum(nil)
44 func (h *hmac) Sum(in []byte) []byte {
46 in = h.inner.Sum(in)
50 return h.outer.Sum(in[:origLen])
78 key = hm.outer.Sum(nil)
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/BaseLib/ |
| CheckSum.c | 21 Calculate the sum of all elements in a buffer in unit of UINT8.
24 This function calculates the sum of all elements in a buffer
32 @param Buffer Pointer to the buffer to carry out the sum operation.
35 @return Sum The sum of Buffer with carry bits dropped during additions.
45 UINT8 Sum;
51 for (Sum = 0, Count = 0; Count < Length; Count++) {
52 Sum = (UINT8) (Sum + *(Buffer + Count));
55 return Sum;
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/ |
| CheckSum.c | 19 Returns the sum of all elements in a buffer in unit of UINT8.
22 This function calculates the sum of all elements in a buffer
30 @param Buffer The pointer to the buffer to carry out the sum operation.
33 @return Sum The sum of Buffer with carry bits dropped during additions.
43 UINT8 Sum;
49 for (Sum = 0, Count = 0; Count < Length; Count++) {
50 Sum = (UINT8) (Sum + *(Buffer + Count));
53 return Sum;
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorDevice.h | 42 typedef TensorCwiseBinaryOp<internal::scalar_sum_op<Scalar>, const ExpressionType, const OtherDerived> Sum;
43 Sum sum(m_expression, other);
44 typedef TensorAssignOp<ExpressionType, const Sum> Assign;
45 Assign assign(m_expression, sum);
|
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 132 unsigned Sum = 0;
134 Sum += NewSize[n] = PerNode + (n < Extra);
135 if (PosPair.first == Nodes && Sum > Position)
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n]));
138 assert(Sum == Elements + Grow && "Bad distribution sum");
148 Sum = 0;
151 Sum += NewSize[n];
153 assert(Sum == Elements && "Bad distribution sum");
[all...] |
| /external/llvm/unittests/ADT/ |
| VariadicFunctionTest.cpp | 38 // Defines a variadic function Sum(), whose arguments and return value
48 const VariadicFunction<long, int, SumImpl> Sum = {};
51 EXPECT_EQ(0, Sum());
52 EXPECT_EQ(1, Sum(1));
53 EXPECT_EQ(12, Sum(10, 2));
54 EXPECT_EQ(1234567, Sum(1000000, 200000, 30000, 4000, 500, 60, 7));
|
| /external/opencv/cv/src/ |
| cvcondens.cpp | 162 float Sum = 0;
179 Sum += ConDens->flConfidence[i];
180 ConDens->flCumulative[i] = Sum;
185 icvScaleVector_32f( ConDens->Temp, ConDens->Temp, ConDens->DP, 1.f / Sum );
188 Sum = Sum / ConDens->SamplesNum;
194 while( (ConDens->flCumulative[j] <= (float) i * Sum)&&(j<ConDens->SamplesNum-1))
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 31 uint32_t Sum = 0;
37 uint32_t PrevSum = Sum;
39 Sum += Weight;
40 assert(Sum > PrevSum); (void) PrevSum;
43 return Sum;
59 uint32_t Sum = getSumForBlock(Src);
63 return (uint64_t)Weight * 5 > (uint64_t)Sum * 4;
68 uint32_t Sum = 0;
76 uint32_t PrevSum = Sum;
78 Sum += Weight
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| IntervalMap.cpp | 132 unsigned Sum = 0;
134 Sum += NewSize[n] = PerNode + (n < Extra);
135 if (PosPair.first == Nodes && Sum > Position)
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n]));
138 assert(Sum == Elements + Grow && "Bad distribution sum");
148 Sum = 0;
151 Sum += NewSize[n];
153 assert(Sum == Elements && "Bad distribution sum");
[all...] |
