| /system/core/libutils/ |
| D | LinearTransform.cpp | 31 uint32_t N, in scale_u64_to_u64() argument
55 tmp2 = (val >> 32) * N; in scale_u64_to_u64()
56 tmp1 = (val & UINT32_MAX) * N; in scale_u64_to_u64()
115 int32_t N, in linear_transform_s64_to_s64() argument
137 if (N < 0) in linear_transform_s64_to_s64()
141 invert_frac ? D : ABS(N), in linear_transform_s64_to_s64()
142 invert_frac ? ABS(N) : D, in linear_transform_s64_to_s64()
213 template <class T> void LinearTransform::reduce(T* N, T* D) { in reduce() argument
215 if (!N || !D || !(*D)) { in reduce()
220 a = *N; in reduce()
[all …]
|
| D | String16.cpp | 177 const size_t N = other.size(); in setTo() local
178 if (begin >= N) { in setTo()
183 if ((begin+len) > N) len = N-begin; in setTo()
184 if (begin == 0 && len == N) { in setTo()
344 const size_t N = size(); in makeLower() local
347 for (size_t i=0; i<N; i++) { in makeLower()
366 const size_t N = size(); in replaceAll() local
369 for (size_t i=0; i<N; i++) { in replaceAll()
387 const size_t N = size(); in remove() local
388 if (begin >= N) { in remove()
[all …]
|
| /system/keymaster/include/keymaster/ |
| D | android_keymaster_utils.h | 53 template <typename T, size_t N> inline size_t array_size(const T(&a)[N]) { in array_size() argument
60 template <typename T, size_t N> inline size_t array_length(const T(&)[N]) { in array_length() argument
61 return N; in array_length()
81 template <typename T, size_t N> inline T* dup_array(const T(&a)[N]) { in dup_array() argument
82 return dup_array(a, N); in dup_array()
94 template <typename T, size_t N> inline void copy_array(const T(&arr)[N], T* dest) { in copy_array() argument
95 for (size_t i = 0; i < N; ++i) in copy_array()
104 template <typename T, size_t N> inline bool array_contains(const T(&a)[N], T val) { in array_contains() argument
105 for (size_t i = 0; i < N; ++i) { in array_contains()
150 template <size_t N> explicit Eraser(uint8_t(&arr)[N]) : buf_(arr), size_(N) {} in Eraser() argument
|
| D | android_keymaster_messages.h | 171 template <size_t N> void SetResults(const T(&arr)[N]) { SetResults(arr, N); } in SetResults()
|
| /system/core/include/utils/ |
| D | Flattenable.h | 31 template<int N>
33 COMPILE_TIME_ASSERT_FUNCTION_SCOPE( !(N & (N-1)) ); in align()
34 return (size + (N-1)) & ~(N-1); in align()
37 template<int N>
39 COMPILE_TIME_ASSERT_FUNCTION_SCOPE( !(N & (N-1)) ); in align()
41 buffer = (void*)((intptr_t(buffer) + (N-1)) & ~(N-1)); in align()
45 template<int N>
47 return align<N>( const_cast<void const*&>(buffer) ); in align()
|
| D | LinearTransform.h | 57 template <class T> static void reduce(T* N, T* D);
58 static void reduce(int32_t* N, uint32_t* D);
|
| /system/extras/perfprofd/quipper/base/ |
| D | macros.h | 63 template <typename T, size_t N>
64 char (&ArraySizeHelper(T (&array)[N]))[N];
70 template <typename T, size_t N>
71 char (&ArraySizeHelper(const T (&array)[N]))[N];
|
| /system/gatekeeper/include/gatekeeper/ |
| D | gatekeeper_utils.h | 43 template <typename T, size_t N> inline size_t array_length(const T (&)[N]) { in array_length() argument
44 return N; in array_length()
|
| /system/core/libmincrypt/tools/ |
| D | DumpPublicKey.java | 109 BigInteger N = key.getModulus(); in printRSA() local
113 int nwords = N.bitLength() / 32; // # of 32 bit integers in modulus in printRSA()
125 BigInteger N0inv = B.subtract(N.modInverse(B)); // -1 / N[0] mod 2^32 in printRSA()
130 BigInteger R = BigInteger.valueOf(2).pow(N.bitLength()); in printRSA()
131 BigInteger RR = R.multiply(R).mod(N); // 2^4096 mod N in printRSA()
136 long n = N.mod(B).longValue(); in printRSA()
143 N = N.divide(B); in printRSA()
|
| /system/core/base/include/base/ |
| D | macros.h | 81 template <typename T, size_t N>
82 char(&ArraySizeHelper(T(&array)[N]))[N]; // NOLINT(readability/casting)
|
| /system/core/libutils/tests/ |
| D | BasicHashtable_test.cpp | 242 const size_t N = 11; in TEST_F() local
245 for (size_t i = 0; i < N; i++) { in TEST_F()
260 for (size_t i = N; --i > 0; ) { in TEST_F()
270 const size_t N = 11; in TEST_F() local
274 for (size_t i = 0; i < N; i++) { in TEST_F()
299 for (size_t i = N; --i > 0; ) { in TEST_F()
388 const int N = 88; in TEST_F() local
391 for (int i = 0; i < N; i++) { in TEST_F()
395 bool set[N]; in TEST_F()
396 memset(set, 0, sizeof(bool) * N); in TEST_F()
[all …]
|
| /system/core/gatekeeperd/ |
| D | SoftGateKeeper.h | 45 static const uint64_t N = 16384; variable
84 sizeof(salt), N, r, p, signature, signature_length); in ComputePasswordSignature()
|
| /system/vold/ |
| D | cryptfs.c | 1270 int N = 1 << ftr->N_factor; local
1277 salt, SALT_LEN, N, r, p, ikey,
1293 int N = 1 << ftr->N_factor; local
1298 salt, SALT_LEN, N, r, p, ikey,
1313 N, r, p, ikey, KEY_LEN_BYTES + IV_LEN_BYTES);
1391 int N = 1 << crypt_ftr->N_factor; local
1396 crypt_ftr->salt, sizeof(crypt_ftr->salt), N, r, p,
1870 int N = 1 << crypt_ftr->N_factor; local
1876 N, r, p, scrypted_intermediate_key,
3741 int N = 1 << ftr->N_factor; local
[all …]
|
| /system/keymaster/ |
| D | android_keymaster_test_utils.h | 146 template <size_t N> std::string make_string(const uint8_t(&a)[N]) { in make_string() argument
147 return make_string(a, N); in make_string()
|
| /system/extras/tests/workloads/ |
| D | defs.sh | 147 if [ "$2" = N ]; then
|
| /system/bt/doc/ |
| D | style_guide.md | 296 // Notice the space between "//" and "N".
|