Home
last modified time | relevance | path

Searched refs:N (Results 1 – 25 of 115) sorted by relevance

12345

/system/keymaster/include/keymaster/
Dmem.h32 template <typename T, size_t N> inline size_t array_size(const T (&a)[N]) { in array_size() argument
39 template <typename T, size_t N> inline size_t array_length(const T (&)[N]) { in array_length() argument
40 return N; in array_length()
60 template <typename T, size_t N> inline T* dup_array(const T (&a)[N]) { in dup_array() argument
61 return dup_array(a, N); in dup_array()
73 template <typename T, size_t N> inline void copy_array(const T (&arr)[N], T* dest) { in copy_array() argument
74 for (size_t i = 0; i < N; ++i) in copy_array()
83 template <typename T, size_t N> inline bool array_contains(const T (&a)[N], T val) { in array_contains() argument
84 for (size_t i = 0; i < N; ++i) { in array_contains()
127 template <size_t N> explicit Eraser(uint8_t (&arr)[N]) : buf_(arr), size_(N) {} in Eraser() argument
/system/keymint/common/src/keyblob/
Dsdd_mem.rs22 pub struct InMemorySlotManager<const N: usize> {
24 slots: [Option<SecureDeletionData>; N],
27 impl<const N: usize> Default for InMemorySlotManager<N> {
32 slots: [(); N].map(|_| Option::<SecureDeletionData>::default()), in default()
37 impl<const N: usize> SecureDeletionSecretManager for InMemorySlotManager<N> {
66 for idx in 0..N { in new_secret()
79 if !(0..N).contains(&idx) { in get_secret()
97 for idx in 0..N { in delete_all()
/system/core/libutils/include/utils/
DFlattenable.h37 template<size_t N>
39 static_assert(!(N & (N - 1)), "Can only align to a power of 2."); in align()
40 return (size + (N-1)) & ~(N-1); in align()
43 template<size_t N>
45 static_assert(!(N & (N - 1)), "Can only align to a power of 2."); in align()
47 buffer = reinterpret_cast<void*>((uintptr_t(buffer) + (N-1)) & ~(N-1)); in align()
51 template<size_t N>
53 static_assert(!(N & (N - 1)), "Can only align to a power of 2."); in align()
55 buffer = reinterpret_cast<void*>((uintptr_t(buffer) + (N-1)) & ~(N-1)); in align()
DString16.h42 template <size_t N>
174 template <size_t N>
177 static_assert(N - 1 < kIsSharedBufferAllocated, "StaticString16 too long!");
178 constexpr StaticData() : size(N - 1), data{0} {} in StaticData()
180 char16_t data[N];
182 constexpr StaticData(const StaticData<N>&) = default;
188 template <size_t N>
189 static constexpr const StaticData<N> makeStaticData(const char16_t (&s)[N]) { in makeStaticData() argument
190 StaticData<N> r; in makeStaticData()
194 for (size_t i = 0; i < N - 1; ++i) r.data[i] = s[i]; in makeStaticData()
[all …]
/system/tools/aidl/tests/golden_output/aidl-test-extras-java-source/gen/android/aidl/tests/map/
DFoo.java117 int N = _aidl_parcel.readInt(); in readFromParcel() local
118 intEnumArrayMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
119 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
128 int N = _aidl_parcel.readInt(); in readFromParcel() local
129 intArrayMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
130 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
139 int N = _aidl_parcel.readInt(); in readFromParcel() local
140 barMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
141 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
150 int N = _aidl_parcel.readInt(); in readFromParcel() local
[all …]
DIMapTest.java140 int N = data.readInt(); in onTransact() local
141 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
142 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
178 int N = data.readInt(); in onTransact() local
179 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
180 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
216 int N = data.readInt(); in onTransact() local
217 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
218 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
254 int N = data.readInt(); in onTransact() local
[all …]
/system/tools/aidl/tests/golden_output/frozen/aidl-test-extras-java-source/gen/android/aidl/tests/map/
DFoo.java117 int N = _aidl_parcel.readInt(); in readFromParcel() local
118 intEnumArrayMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
119 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
128 int N = _aidl_parcel.readInt(); in readFromParcel() local
129 intArrayMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
130 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
139 int N = _aidl_parcel.readInt(); in readFromParcel() local
140 barMap = N < 0 ? null : new java.util.HashMap<>(); in readFromParcel()
141 java.util.stream.IntStream.range(0, N).forEach(i -> { in readFromParcel()
150 int N = _aidl_parcel.readInt(); in readFromParcel() local
[all …]
DIMapTest.java140 int N = data.readInt(); in onTransact() local
141 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
142 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
178 int N = data.readInt(); in onTransact() local
179 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
180 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
216 int N = data.readInt(); in onTransact() local
217 _arg0 = N < 0 ? null : new java.util.HashMap<>(); in onTransact()
218 java.util.stream.IntStream.range(0, N).forEach(i -> { in onTransact()
254 int N = data.readInt(); in onTransact() local
[all …]
/system/sepolicy/reqd_mask/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/microdroid/reqd_mask/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/32.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/30.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/33.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/202404/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/31.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/29.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/prebuilts/api/34.0/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/sepolicy/microdroid/system/private/
Dmls_macros3 # gen_cats(N)
5 # declares categores c0 to c(N-1)
16 # gen_sens(N)
18 # declares sensitivites s0 to s(N-1) with dominance
19 # in increasing numeric order with s0 lowest, s(N-1) highest
38 # gen_levels(N,M)
40 # levels from s0 to (N-1) with categories c0 to (M-1)
/system/core/libutils/binder/include/utils/
DString16.h42 template <size_t N>
174 template <size_t N>
177 static_assert(N - 1 < kIsSharedBufferAllocated, "StaticString16 too long!");
178 constexpr StaticData() : size(N - 1), data{0} {} in StaticData()
180 char16_t data[N];
182 constexpr StaticData(const StaticData<N>&) = default;
188 template <size_t N>
189 static constexpr const StaticData<N> makeStaticData(const char16_t (&s)[N]) { in makeStaticData() argument
190 StaticData<N> r; in makeStaticData()
194 for (size_t i = 0; i < N - 1; ++i) r.data[i] = s[i]; in makeStaticData()
[all …]
/system/chre/apps/test/chqts/src/shared/
Darray_length.h30 template <typename T, size_t N>
31 constexpr size_t arrayLength(T (&)[N]) { in arrayLength() argument
32 return N; in arrayLength()
/system/tools/aidl/
Dast_java.cpp74 size_t N = arguments.size(); in WriteArgumentList() local
75 for (size_t i = 0; i < N; i++) { in WriteArgumentList()
77 if (i != N - 1) { in WriteArgumentList()
144 int N = this->statements.size(); in Write() local
145 for (int i = 0; i < N; i++) { in Write()
296 int N = this->cases.size(); in Write() local
297 if (N > 0) { in Write()
298 for (int i = 0; i < N; i++) { in Write()
319 int N = this->cases.size(); in Write() local
320 for (int i = 0; i < N; i++) { in Write()
[all …]
/system/libhwbinder/
DStatic.cpp41 virtual status_t writeLines(const struct iovec& vec, size_t N) in writeLines() argument
44 if (N != 1) ALOGI("WARNING: writeLines N=%zu\n", N); in writeLines()
/system/extras/boottime_tools/io_analysis/
Dcheck_verity.py31 N = len(l)
38 average_io = sum_io / N
39 average_verity = sum_verity / N
40 average_total = sum_total / N
48 sigma_io = math.sqrt(var_io / N)
49 sigma_verity = math.sqrt(var_verity / N)
50 sigma_total = math.sqrt(var_total / N)
/system/media/audio_utils/include/audio_utils/
DStatistics.h261 template <size_t N>
262 explicit constexpr Statistics(const T (&a)[N], A alpha = A(1.))
366 const int64_t N = getN();
367 if (N == 0) return "unavail";
371 if (N > 1) {
513 const auto N = getN();
514 if (N == 0) return "unavail";
518 if (N > 1) {
750 template <typename T, size_t N>
751 constexpr T max(const T (&a)[N]) {
[all …]

12345