Home
last modified time | relevance | path

Searched +full:- +full:q (Results 1 – 25 of 1288) sorted by relevance

12345678910>>...52

/external/libvpx/libvpx/vpx_dsp/arm/
Didct32x32_add_neon.c4 * Use of this source code is governed by a BSD-style license
52 p2 -= stride; in store_combine_results()
71 p1 -= stride; in store_combine_results()
89 p2 -= stride; in highbd_store_combine_results_bd8()
108 p1 -= stride; in highbd_store_combine_results_bd8()
120 int32x4_t q[4]; in do_butterfly() local
132 q[0] = vmull_s16(d[0], d[4]); in do_butterfly()
133 q[1] = vmull_s16(d[1], d[4]); in do_butterfly()
134 q[0] = vmlsl_s16(q[0], d[2], d[5]); in do_butterfly()
135 q[1] = vmlsl_s16(q[1], d[3], d[5]); in do_butterfly()
[all …]
Dhighbd_idct32x32_1024_add_neon.c4 * Use of this source code is governed by a BSD-style license
23 q0->val[0] = vld1q_s32(trans_buf + first * 8); in load_from_transformed()
24 q0->val[1] = vld1q_s32(trans_buf + first * 8 + 4); in load_from_transformed()
25 q1->val[0] = vld1q_s32(trans_buf + second * 8); in load_from_transformed()
26 q1->val[1] = vld1q_s32(trans_buf + second * 8 + 4); in load_from_transformed()
32 q0->val[0] = vld1q_s32(out + first * 32); in load_from_output()
33 q0->val[1] = vld1q_s32(out + first * 32 + 4); in load_from_output()
34 q1->val[0] = vld1q_s32(out + second * 32); in load_from_output()
35 q1->val[1] = vld1q_s32(out + second * 32 + 4); in load_from_output()
58 p2 -= stride; in highbd_store_combine_results()
[all …]
/external/llvm-project/libc/docs/
Dheader_gen_scheme.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
Dredirectors_schematic.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/tensorflow/tensorflow/compiler/mlir/g3doc/images/
Dmlir-infra.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/mesa3d/src/compiler/glsl/
Dast_type.cpp30 structure->print(); in print()
36 array_specifier->print(); in print()
46 subroutine_only.flags.q.subroutine = 1; in has_qualifiers()
47 if (state->has_explicit_uniform_location()) { in has_qualifiers()
48 subroutine_only.flags.q.explicit_index = 1; in has_qualifiers()
50 return (this->qualifier.flags.i & ~subroutine_only.flags.i) != 0; in has_qualifiers()
55 return this->flags.q.smooth in has_interpolation()
56 || this->flags.q.flat in has_interpolation()
57 || this->flags.q.noperspective; in has_interpolation()
63 return this->flags.q.origin_upper_left in has_layout()
[all …]
/external/python/cpython3/Doc/library/
Dpathlib-inheritance.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/ImageMagick/PerlMagick/t/reference/write/read/
Dgradient.miff7 profile-icm=3144
9 …-HP �����������������������������������������������cprt��P���3desc������lwtpt������bkpt���…
10 �����#�(�-�2�7�;�@�E�J�O�T�Y�^�c�h�m�r�w�|��������������������������������������������������…
/external/python/cryptography/vectors/cryptography_vectors/asymmetric/DSA/FIPS_186-3/
DPQGGen.rsp3 # FIPS 186-3 Sections tested:
4 # A.1.1.2 Generation of the Probable Primes p and q Using an Approved Hash Function
5 # A.1.2.1 Construction of the Primes p and q Using the Shawe-Taylor Algorithm
8 …-1 :: L=1024, N=160, SHA-224 :: L=1024, N=160, SHA-256 :: L=1024, N=160, SHA-384 :: L=1024, N=160,…
11 [A.1.1.2 Generation of the Probable Primes p and q Using an Approved Hash Function]
13 [mod = L=1024, N=160, SHA-1]
16 Q = d6176bd352652861de08ee21a2d6597622e522b9
21 Q = ab1a788bce3c557a965a5bfa6908faa665fdeb7d
26 Q = fa0cd4b34387d320d483b3dc4728a9359b17992f
31 Q = f30876d39c441114685e3998776063aaa7f9c0d1
[all …]
DPQGVer.rsp3 …-1 :: L=1024, N=160, SHA-224 :: L=1024, N=160, SHA-256 :: L=1024, N=160, SHA-384 :: L=1024, N=160,…
6 [A.1.1.3 Validation of the Probable Primes p and q that were Generated Using an Approved Hash Funct…
8 [mod = L=1024, N=160, SHA-1]
11 Q = 8e43df1f8b76d9e97afbf3098d9238cfd2f33771
14 Result = F (Q doesn't div P-1)
17 Q = 9e9d6b2587d39727e87039fcb9b974f5fa424aa9
23 Q = fcbcb16ddbcfa42eb412349710d607e027734fdd
29 Q = e8532d022cbe946b85eb8d3b2db8dd73666472db
32 Result = F (Seed doesn't produce Q)
35 Q = bc42046aa266eba16ac06d427eab954108509a47
[all …]
/external/llvm-project/mlir/docs/includes/img/
DDefUseChains.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
DUse-list.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/llvm-project/libcxx/src/
Dhash.cpp1 //===-------------------------- hash.cpp ----------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
15 #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
135 // The algorithm creates a list of small primes, plus an open-ended list of
175 if (n <= small_primes[N-1]) in __next_prime()
183 // Known a-priori n >= L in __next_prime()
185 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
186 - indices); in __next_prime()
193 // It is known a-priori that n is not divisible by 2, 3, 5 or 7, in __next_prime()
[all …]
/external/libcxx/src/
Dhash.cpp1 //===-------------------------- hash.cpp ----------------------------------===//
8 //===----------------------------------------------------------------------===//
16 #pragma clang diagnostic ignored "-Wtautological-constant-out-of-range-compare"
136 // The algorithm creates a list of small primes, plus an open-ended list of
184 if (n <= small_primes[N-1]) in __next_prime()
192 // Known a-priori n >= L in __next_prime()
194 size_t in = static_cast<size_t>(std::lower_bound(indices, indices + M, n - k0 * L) in __next_prime()
195 - indices); in __next_prime()
202 // It is known a-priori that n is not divisible by 2, 3, 5 or 7, in __next_prime()
203 // so don't test those (j == 5 -> divide by 11 first). And the in __next_prime()
[all …]
/external/ImageMagick/MagickCore/
Dquantum-export.c7 % Q Q U U A A NN N T U U MM MM %
8 % Q Q U U AAAAA N N N T U U M M M %
9 % Q QQ U U A A N NN T U U M M %
25 % Copyright 1999-2021 ImageMagick Studio LLC, a non-profit organization %
50 #include "MagickCore/blob-private.h"
51 #include "MagickCore/color-private.h"
53 #include "MagickCore/exception-private.h"
64 #include "MagickCore/pixel-accessor.h"
66 #include "MagickCore/quantum-private.h"
79 + E x p o r t Q u a n t u m P i x e l s %
[all …]
/external/tensorflow/tensorflow/lite/g3doc/images/convert/
Dworkflow.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/grpc-grpc/doc/images/
Dload-balancing.svg3 …-linecap="square" stroke-miterlimit="10" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://ww…
/external/tensorflow/tensorflow/lite/g3doc/inference_with_metadata/task_library/images/
Dprebuilt_task_apis.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/llvm-project/clang-tools-extra/unittests/clang-query/
DQueryParserTest.cpp1 //===---- QueryParserTest.cpp - clang-query test --------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
27 QueryRef Q = parse(""); in TEST_F() local
28 EXPECT_TRUE(isa<NoOpQuery>(Q)); in TEST_F()
30 Q = parse("\n"); in TEST_F()
31 EXPECT_TRUE(isa<NoOpQuery>(Q)); in TEST_F()
35 QueryRef Q = parse("foo"); in TEST_F() local
36 ASSERT_TRUE(isa<InvalidQuery>(Q)); in TEST_F()
37 EXPECT_EQ("unknown command: foo", cast<InvalidQuery>(Q)->ErrStr); in TEST_F()
[all …]
/external/tensorflow/tensorflow/lite/g3doc/r1/images/convert/
Dworkflow.svg1 …-linecap="square" stroke-miterlimit="10" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns="http://…
/external/libchrome/base/containers/
Dcircular_deque_unittest.cc2 // Use of this source code is governed by a BSD-style license that can be
60 EXPECT_EQ(num_elts, static_cast<size_t>(buf.end() - buf.begin())); in TEST()
72 EXPECT_EQ(num_elts, static_cast<size_t>(buf.end() - buf.begin())); in TEST()
115 circular_deque<DestructorCounter> q; in TEST() local
116 q.resize(5, DestructorCounter(&destruct_count)); in TEST()
125 circular_deque<DestructorCounter> q; in TEST() local
126 q.reserve(7); in TEST()
127 q.resize(5, DestructorCounter(&destruct_count)); in TEST()
132 q.emplace_back(&destruct_count); in TEST()
133 q.pop_front(); in TEST()
[all …]
/external/skqp/site/dev/design/conical/
Dlemma3.2.svg8 xmlns:ev="http://www.w3.org/2001/xml-events"
17 <g stroke-linejoin="miter" stroke-dashoffset="0" stroke-dasharray="none" stroke-width="1" stroke-mi…
19 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#ffffff">
21 </g> <!-- drawing style -->
22 </g> <!-- transform -->
24 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#000000">
25 …Q 51.0302734375 232.359375 50.6396484375 233.109375 Q 50.2646484375 233.859375 50.2646484375 235.3…
26 </g> <!-- drawing style -->
27 </g> <!-- transform -->
29 <g stroke-linecap="butt" fill="none" stroke-opacity="1" stroke="#000000">
[all …]
Dlemma3.1.svg8 xmlns:ev="http://www.w3.org/2001/xml-events"
17 <g stroke-linejoin="miter" stroke-dashoffset="0" stroke-dasharray="none" stroke-width="1" stroke-mi…
19 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#ffffff">
21 </g> <!-- drawing style -->
22 </g> <!-- transform -->
24 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#000000">
25 …Q 51.0302734375 232.359375 50.6396484375 233.109375 Q 50.2646484375 233.859375 50.2646484375 235.3…
26 </g> <!-- drawing style -->
27 </g> <!-- transform -->
29 <g stroke-linecap="butt" fill="none" stroke-opacity="1" stroke="#000000">
[all …]
/external/skia/site/docs/dev/design/conical/
Dlemma3.2.svg8 xmlns:ev="http://www.w3.org/2001/xml-events"
17 <g stroke-linejoin="miter" stroke-dashoffset="0" stroke-dasharray="none" stroke-width="1" stroke-mi…
19 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#ffffff">
21 </g> <!-- drawing style -->
22 </g> <!-- transform -->
24 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#000000">
25 …Q 51.0302734375 232.359375 50.6396484375 233.109375 Q 50.2646484375 233.859375 50.2646484375 235.3…
26 </g> <!-- drawing style -->
27 </g> <!-- transform -->
29 <g stroke-linecap="butt" fill="none" stroke-opacity="1" stroke="#000000">
[all …]
Dlemma3.1.svg8 xmlns:ev="http://www.w3.org/2001/xml-events"
17 <g stroke-linejoin="miter" stroke-dashoffset="0" stroke-dasharray="none" stroke-width="1" stroke-mi…
19 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#ffffff">
21 </g> <!-- drawing style -->
22 </g> <!-- transform -->
24 <g fill-opacity="1" fill-rule="nonzero" stroke="none" fill="#000000">
25 …Q 51.0302734375 232.359375 50.6396484375 233.109375 Q 50.2646484375 233.859375 50.2646484375 235.3…
26 </g> <!-- drawing style -->
27 </g> <!-- transform -->
29 <g stroke-linecap="butt" fill="none" stroke-opacity="1" stroke="#000000">
[all …]

12345678910>>...52