| /aosp_15_r20/external/brotli/tests/testdata/ |
| H A D | plrabn12.txt | 153 Breaking the horrid silence, thus began:--
197 And him thus answered soon his bold compeer:--
207 In horrible destruction laid thus low,
262 Thus Satan, talking to his nearest mate,
336 Lie thus astonished on th' oblivious pool,
342 Thus answered:--"Leader of those armies bright
398 Thus drooping, or with linked thunderbolts
629 From mortal or immortal minds. Thus they,
657 By Fontarabbia. Thus far these beyond
816 On Lemnos, th' Aegaean isle. Thus they relate,
[all …]
|
| /aosp_15_r20/external/oj-libjdwp/src/share/classes/com/sun/jdi/request/ |
| H A D | EventRequestManager.java | 241 * after the first step is detected. Thus a next line method
406 * This list is a live view of these requests and thus changes as requests
414 * This list is a live view of these requests and thus changes as requests
422 * This list is a live view of these requests and thus changes as requests
430 * This list is a live view of these requests and thus changes as requests
438 * This list is a live view of these requests and thus changes as requests
446 * This list is a live view of these requests and thus changes as requests
454 * This list is a live view of these requests and thus changes as requests
463 * This list is a live view of these requests and thus changes as requests
472 * This list is a live view of these requests and thus changes as requests
[all …]
|
| /aosp_15_r20/art/runtime/ |
| H A D | mutator_gc_coord.md | 41 ensure that such code, which does not execute "suspend points", and can thus not
63 When a Java thread starts to execute native code, and may thus not respond
84 rules of our normal static thread-safety analysis. Thus a function that is
97 `ReaderWriterMutex` in shared mode. Thus any thread acquiring the lock in exclusive mode
106 the explicit mutator mutex in shared mode, thus blocking others from acquiring it
179 release. This may also prevent higher level mutexes from getting released. Thus
202 reenabled, and threads have been notified. Thus the waiting thread's inability
211 cannot yet be waiting for weak-reference access. Thus there is no danger of
227 running the garbage collector and conceivably thus cause it to block. This
232 Thus we ensure that the GC, together with anything else that can block GCs,
[all …]
|
| /aosp_15_r20/external/webrtc/modules/rtp_rtcp/source/ |
| H A D | flexfec_header_reader_writer.cc | 98 "support this, thus discarding the packet."; in ReadFecHeader()
105 "not yet support this, thus discarding packet."; in ReadFecHeader()
112 "yet support this, thus discarding packet."; in ReadFecHeader()
124 // the packed packet masks out-of-band, thus leaving the FlexFEC header as is. in ReadFecHeader()
140 // The first K-bit is set, and the packet mask is thus only 2 bytes long. in ReadFecHeader()
150 // to the left, thus removing K-bit 0. We will now shift the next four bytes in ReadFecHeader()
161 // mask is thus 6 bytes long. We have now read the entire FEC header, in ReadFecHeader()
172 // The packet mask is thus 14 bytes long. We have now read the entire in ReadFecHeader()
277 tmp_mask_part0 >>= 1; // Shift, thus clearing K-bit 0. in FinalizeFecHeader()
280 tmp_mask_part1 >>= 2; // Shift, thus clearing K-bit 1 and bit 15. in FinalizeFecHeader()
[all …]
|
| /aosp_15_r20/frameworks/av/media/codec2/vndk/include/util/ |
| H A D | C2InterfaceUtils.h | 669 * Restrict (and thus define) the supported values to none.
677 * Restrict (and thus define) the supported values to |value| alone.
682 * Restrict (and thus define) the supported values to values greater than |value|.
689 * Restrict (and thus define) the supported values to values greater than or equal to |value|.
696 * Restrict (and thus define) the supported values to values greater than or equal to |value|.
703 * Restrict (and thus define) the supported values to values less than or equal to |value|.
710 * Restrict (and thus define) the supported values to values less than or equal to |value|.
717 * Restrict (and thus define) the supported values to values less than |value|.
724 * Restrict (and thus define) the supported values to values in the range of [ |min|, |max| ]
733 * Restrict (and thus define) the supported values to values in the geometric series starting
[all …]
|
| /aosp_15_r20/external/cronet/third_party/boringssl/src/crypto/fipsmodule/ |
| H A D | FIPS.md | 34 …break-hash.go` can be used to corrupt the FIPS module inside a binary and thus trigger a failure o…
46 …suggesting that there is any security advantage at all to doing this, and thus recommend that Andr…
48 The CTR-DRBG is reseeded every 4096 calls to `RAND_bytes`. Thus the process will randomly crash abo…
54 …to stop all other threads from using the RNG once this process has begun. Thus the main thread exi…
60 …ibraries and ASLR, some relocations can only be resolved at run-time, and thus targets of those re…
74 …that causes them is when we have a static `EVP_MD` or `EVP_CIPHER` object thus, inside the module,…
80 The static build cannot depend on the shared-object link to resolve relocations and thus must take …
90 …Thus calls to these functions are rewritten into an IP-relative jump to a redirector function. The…
106 …dule and thus not hashed. A relocation record is emitted to instruct the linker to poke the final …
|
| /aosp_15_r20/external/boringssl/src/crypto/fipsmodule/ |
| H A D | FIPS.md | 35 …break-hash.go` can be used to corrupt the FIPS module inside a binary and thus trigger a failure o…
47 …suggesting that there is any security advantage at all to doing this, and thus recommend that Andr…
49 The CTR-DRBG is reseeded every 4096 calls to `RAND_bytes`. Thus the process will randomly crash abo…
55 …to stop all other threads from using the RNG once this process has begun. Thus the main thread exi…
61 …ibraries and ASLR, some relocations can only be resolved at run-time, and thus targets of those re…
75 …that causes them is when we have a static `EVP_MD` or `EVP_CIPHER` object thus, inside the module,…
81 The static build cannot depend on the shared-object link to resolve relocations and thus must take …
91 …Thus calls to these functions are rewritten into an IP-relative jump to a redirector function. The…
107 …dule and thus not hashed. A relocation record is emitted to instruct the linker to poke the final …
|
| /aosp_15_r20/external/cpuinfo/deps/clog/src/ |
| H A D | clog.c | 56 …/* The first call to vsnprintf will clobber args, thus need a copy in case a second vsnprintf call… in clog_vlog_fatal()
74 * Prefix + suffix alone would overflow the on-stack buffer, thus need to use on-heap buffer. in clog_vlog_fatal()
134 …/* The first call to vsnprintf will clobber args, thus need a copy in case a second vsnprintf call… in clog_vlog_error()
152 * Prefix + suffix alone would overflow the on-stack buffer, thus need to use on-heap buffer. in clog_vlog_error()
212 …/* The first call to vsnprintf will clobber args, thus need a copy in case a second vsnprintf call… in clog_vlog_warning()
230 * Prefix + suffix alone would overflow the on-stack buffer, thus need to use on-heap buffer. in clog_vlog_warning()
290 …/* The first call to vsnprintf will clobber args, thus need a copy in case a second vsnprintf call… in clog_vlog_info()
308 * Prefix + suffix alone would overflow the on-stack buffer, thus need to use on-heap buffer. in clog_vlog_info()
368 …/* The first call to vsnprintf will clobber args, thus need a copy in case a second vsnprintf call… in clog_vlog_debug()
386 * Prefix + suffix alone would overflow the on-stack buffer, thus need to use on-heap buffer. in clog_vlog_debug()
|
| /aosp_15_r20/external/pytorch/aten/src/ATen/native/quantized/cpu/qnnpack/deps/clog/src/ |
| H A D | clog.c | 61 /* The first call to vsnprintf will clobber args, thus need a copy in case a in clog_vlog_fatal()
82 * Prefix + suffix alone would overflow the on-stack buffer, thus need to in clog_vlog_fatal()
155 /* The first call to vsnprintf will clobber args, thus need a copy in case a in clog_vlog_error()
176 * Prefix + suffix alone would overflow the on-stack buffer, thus need to in clog_vlog_error()
249 /* The first call to vsnprintf will clobber args, thus need a copy in case a in clog_vlog_warning()
273 * Prefix + suffix alone would overflow the on-stack buffer, thus need to in clog_vlog_warning()
346 /* The first call to vsnprintf will clobber args, thus need a copy in case a in clog_vlog_info()
367 * Prefix + suffix alone would overflow the on-stack buffer, thus need to in clog_vlog_info()
440 /* The first call to vsnprintf will clobber args, thus need a copy in case a in clog_vlog_debug()
461 * Prefix + suffix alone would overflow the on-stack buffer, thus need to in clog_vlog_debug()
|
| /aosp_15_r20/external/tensorflow/tensorflow/core/api_def/base_api/ |
| H A D | api_def_LoadAllTPUEmbeddingParameters.pbtxt | 17 training loop updates. The shape of each entry is ignored (and thus can be
27 embedding training loop updates. The shape of each entry is ignored (and thus
37 training loop updates. The shape of each entry is ignored (and thus can be
47 embedding training loop updates. The shape of each entry is ignored (and thus
57 training loop updates. The shape of each entry is ignored (and thus can be
67 embedding training loop updates. The shape of each entry is ignored (and thus
77 training loop updates. The shape of each entry is ignored (and thus can be
|
| /aosp_15_r20/external/gemmlowp/doc/ |
| H A D | less-than-8-bit.md | 52 becomes very low). Thus, no particular work would be needed in the packing
100 data to less-than-8-bit depths by scaling them, thus shrinking the range of the
103 GEMM kernel to use narrower accumulators without risking overflow, thus
151 to be smaller than 2^M, each product is thus guaranteed to be smaller than
152 2^(M+N). Thus, one may accumulate 2^(16-(M+N)) such products and still be
153 guaranteed that such an accumulator will be smaller than 2^16, and thus can be
157 entries are on 5 bits (M=5), so each product fits in 12 bits and one can thus
253 occurs many times, the mean requantized value will thus tend to 3.8.
276 Thus, for fixed input values and bit depths, we expect that probabilistic
299 that minimizes the "clumpiness" of the random offsets (Thus, for example,
|
| /aosp_15_r20/external/google-cloud-java/java-billing/proto-google-cloud-billing-v1/src/main/java/com/google/cloud/billing/v1/ |
| H A D | UpdateProjectBillingInfoRequest.java | 133 * thus, you can leave empty all fields except `billing_account_name`.
149 * thus, you can leave empty all fields except `billing_account_name`.
167 * thus, you can leave empty all fields except `billing_account_name`.
684 * thus, you can leave empty all fields except `billing_account_name`.
699 * thus, you can leave empty all fields except `billing_account_name`.
720 * thus, you can leave empty all fields except `billing_account_name`.
743 * thus, you can leave empty all fields except `billing_account_name`.
764 * thus, you can leave empty all fields except `billing_account_name`.
791 * thus, you can leave empty all fields except `billing_account_name`.
811 * thus, you can leave empty all fields except `billing_account_name`.
[all …]
|
| /aosp_15_r20/external/rust/android-crates-io/crates/quiche/deps/boringssl/src/crypto/fipsmodule/ec/ |
| D | util.c | 132 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
156 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
166 // terms thus far were zero.)
180 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
192 // Divide n into n_H + n_M + n_L similarly. We thus have:
214 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
221 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
229 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| /aosp_15_r20/external/boringssl/src/crypto/fipsmodule/ec/ |
| H A D | util.c | 132 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
156 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
166 // terms thus far were zero.)
180 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
192 // Divide n into n_H + n_M + n_L similarly. We thus have:
214 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
221 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
229 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| /aosp_15_r20/external/rust/android-crates-io/crates/ring/crypto/fipsmodule/ec/ |
| D | util.h | 135 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
159 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
169 // terms thus far were zero.)
183 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
195 // Divide n into n_H + n_M + n_L similarly. We thus have:
217 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
224 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
232 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| D | ecp_nistz.h | 138 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
162 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
172 // terms thus far were zero.)
186 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
198 // Divide n into n_H + n_M + n_L similarly. We thus have:
220 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
227 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
235 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| /aosp_15_r20/external/cronet/third_party/boringssl/src/crypto/fipsmodule/ec/ |
| H A D | util.c | 132 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
156 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
166 // terms thus far were zero.)
180 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
192 // Divide n into n_H + n_M + n_L similarly. We thus have:
214 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
221 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
229 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| /aosp_15_r20/external/rust/crates/quiche/deps/boringssl/src/crypto/fipsmodule/ec/ |
| D | util.c | 132 // Thus a_j = t_j ≠ 0 (mod n). Note a_i and t_i may not be reduced mod n. t_i is
156 // This is compensated by t_(i-w)'s subtraction term. Thus, a_i may be computed
166 // terms thus far were zero.)
180 // n is much larger than 2^w, so this is impossible. Thus, j = 0: only the final
192 // Divide n into n_H + n_M + n_L similarly. We thus have:
214 // Contradiction (n_M + n_L is the bottom w bits of n). Thus k_H < n_H. Suppose
221 // Contradiction. Thus, k_H = n_H - 2^w. (Note 2^w divides n_H and k_H.) Thus,
229 // Thus n_M + n_L < 2^(w-1), so n_M is zero, proving our condition.
|
| /aosp_15_r20/external/guava/guava/src/com/google/common/util/concurrent/ |
| H A D | SmoothRateLimiter.java | 75 * a request actually arrives; this is also related to the point made in the last paragraph), thus
88 * deal with overflow, then stored permits could be given out /slower/ than fresh ones. Thus, we
95 * "permits / time", thus "1 / rate = time / permits". Thus, "1/rate" (time / permits) times
118 * of the function, thus time. Thus, the RateLimiter becomes /faster/ after a period of
120 * line, then it means that the area (time) is increased, thus storedPermits are more costly than
121 * fresh permits, thus the RateLimiter becomes /slower/ after a period of underutilization.
128 * task immediately, and postpone by 100 seconds future requests, thus we allow for work to get
|
| /aosp_15_r20/external/guava/android/guava/src/com/google/common/util/concurrent/ |
| H A D | SmoothRateLimiter.java | 75 * a request actually arrives; this is also related to the point made in the last paragraph), thus
88 * deal with overflow, then stored permits could be given out /slower/ than fresh ones. Thus, we
95 * "permits / time", thus "1 / rate = time / permits". Thus, "1/rate" (time / permits) times
118 * of the function, thus time. Thus, the RateLimiter becomes /faster/ after a period of
120 * line, then it means that the area (time) is increased, thus storedPermits are more costly than
121 * fresh permits, thus the RateLimiter becomes /slower/ after a period of underutilization.
128 * task immediately, and postpone by 100 seconds future requests, thus we allow for work to get
|
| /aosp_15_r20/cts/tests/tests/text/src/android/text/cts/ |
| H A D | PaintRunFlagTest.kt | 259 // In case of no flags, no letter space adjustment is applied, thus all advances should have in getTextRunAdvances_Latin()
269 // In case of left edge, the left most character should start from drawing origin 0, thus in getTextRunAdvances_Latin()
281 // In case of right edge, the right most character should not have right margin, thus the in getTextRunAdvances_Latin()
294 // origin 0 and the right most character should not have right margin, thus the half of in getTextRunAdvances_Latin()
322 // In case of no flags, no letter space adjustment is applied, thus all advances should have in getTextRunAdvances_Hebrew()
332 // In case of left edge, the left most character should start from drawing origin 0, thus in getTextRunAdvances_Hebrew()
345 // In case of right edge, the right most character should not have right margin, thus the in getTextRunAdvances_Hebrew()
359 // origin 0 and the right most character should not have right margin, thus the half of in getTextRunAdvances_Hebrew()
|
| /aosp_15_r20/external/google-cloud-java/java-datacatalog/proto-google-cloud-datacatalog-v1beta1/src/main/java/com/google/cloud/datacatalog/v1beta1/ |
| H A D | UpdatePolicyTagRequest.java | 129 * parent_policy_tag can be updated and thus can be listed in the mask. If
150 * parent_policy_tag can be updated and thus can be listed in the mask. If
171 * parent_policy_tag can be updated and thus can be listed in the mask. If
772 * parent_policy_tag can be updated and thus can be listed in the mask. If
792 * parent_policy_tag can be updated and thus can be listed in the mask. If
818 * parent_policy_tag can be updated and thus can be listed in the mask. If
846 * parent_policy_tag can be updated and thus can be listed in the mask. If
871 * parent_policy_tag can be updated and thus can be listed in the mask. If
902 * parent_policy_tag can be updated and thus can be listed in the mask. If
927 * parent_policy_tag can be updated and thus can be listed in the mask. If
[all …]
|
| /aosp_15_r20/external/google-cloud-java/java-containeranalysis/proto-google-cloud-containeranalysis-v1beta1/src/main/java/io/grafeas/v1beta1/vulnerability/ |
| H A D | Vulnerability.java | 3179 * vulnerability. Note that there may be multiple hotfixes (and thus
3195 * vulnerability. Note that there may be multiple hotfixes (and thus
3211 * vulnerability. Note that there may be multiple hotfixes (and thus
3226 * vulnerability. Note that there may be multiple hotfixes (and thus
3244 * vulnerability. Note that there may be multiple hotfixes (and thus
4425 * vulnerability. Note that there may be multiple hotfixes (and thus
4445 * vulnerability. Note that there may be multiple hotfixes (and thus
4466 * vulnerability. Note that there may be multiple hotfixes (and thus
4484 * vulnerability. Note that there may be multiple hotfixes (and thus
4503 * vulnerability. Note that there may be multiple hotfixes (and thus
[all …]
|
| /aosp_15_r20/cts/hostsidetests/devicepolicy/src/com/android/cts/devicepolicy/ |
| H A D | MixedManagedProfileOwnerTest.java | 141 /** VPN tests don't require physical device for managed profile, thus overriding. */
149 /** VPN tests don't require physical device for managed profile, thus overriding. */
156 /** VPN tests don't require physical device for managed profile, thus overriding. */
164 /** VPN tests don't require physical device for managed profile, thus overriding. */
171 /** VPN tests don't require physical device for managed profile, thus overriding. */
178 /** VPN tests don't require physical device for managed profile, thus overriding. */
|
| /aosp_15_r20/frameworks/rs/driver/runtime/ |
| H A D | rs_structs.h | 19 * information, we would not be able to inline the bitcode, thus resulting in
98 * information, we would not be able to inline the bitcode, thus resulting in
132 * information, we would not be able to inline the bitcode, thus resulting in
161 * information, we would not be able to inline the bitcode, thus resulting in
197 * information, we would not be able to inline the bitcode, thus resulting in
239 * information, we would not be able to inline the bitcode, thus resulting in
282 * information, we would not be able to inline the bitcode, thus resulting in
|