| /external/clang/test/Analysis/ |
| D | NewDeleteLeaks-PR19102.cpp | 25 new int; // expected-warning@+1 {{Potential memory leak}} in test()
26 new A0; // expected-warning@+1 {{Potential memory leak}} in test()
27 new A1(0); // expected-warning@+1 {{Potential memory leak}} in test()
28 new A2; // expected-warning@+1 {{Potential memory leak}} in test()
32 new A2(s); // expected-warning@+1 {{Potential memory leak}} in test()
33 new A2(&(s.i)); // expected-warning@+1 {{Potential memory leak}} in test()
39 A2 *a2p1 = new A2; // expected-warning@+1 {{Potential leak of memory}} in test()
40 A2 *a2p2 = new A2(ps); // expected-warning@+1 {{Potential leak of memory}} in test()
41 A2 *a2p3 = new A2(*ps, 1); // expected-warning@+1 {{Potential leak of memory}} in test()
42 A2 *a2p4 = new A2(1, &ps); // expected-warning@+1 {{Potential leak of memory}} in test()
|
| D | coverage.c | 36 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage1()
43 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage2()
49 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage3()
55 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage4()
69 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage6()
81 } // expected-warning {{Potential leak of memory pointed to by 'm'}} in coverage8()
|
| D | NewDelete-custom.cpp | 30 // expected-warning@-2{{Potential leak of memory pointed to by 'c3'}}
41 // expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
54 // expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
63 // expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
70 // expected-warning@-2{{Potential leak of memory pointed to by 'p'}}
|
| D | cstring-syntax.c | 9 …strncat(dest, "AAAAAAAAAAAAAAAAAAAAAAAAAAAAA", sizeof(dest) - 1); // expected-warning {{Potential … in testStrncat()
10 …strncat(dest, "AAAAAAAAAAAAAAAAAAAAAAAAAAA", sizeof(dest)); // expected-warning {{Potential buffer… in testStrncat()
11 …AAAAAAAAAAAAAAAAA", sizeof(dest) - strlen(dest)); // expected-warning {{Potential buffer overflow.… in testStrncat()
12 strncat(dest, src, sizeof(src)); // expected-warning {{Potential buffer overflow. Replace with}} in testStrncat()
|
| D | simple-stream-checks.c | 23 if (Data) // expected-warning {{Opened file is never closed; potential resource leak}} in checkLeak()
48 } // expected-warning {{Opened file is never closed; potential resource leak}} in leakOnEnfOfPath1()
52 return; // expected-warning {{Opened file is never closed; potential resource leak}} in leakOnEnfOfPath2()
77 return; // expected-warning {{Opened file is never closed; potential resource leak}} in SymbolDoesNotEscapeThoughStringAPIs()
84 return; // expected-warning {{Opened file is never closed; potential resource leak}} in testPassConstPointer()
|
| D | malloc-annotations.c | 29 return; // expected-warning{{Potential leak of memory pointed to by}} in f1()
57 return; // expected-warning{{Potential leak of memory pointed to by}} in n2af1()
62 return; // expected-warning{{Potential leak of memory pointed to by}} in af1()
67 } // expected-warning{{Potential leak of memory pointed to by}} in af1_b()
76 } // expected-warning{{Potential leak of memory pointed to by}} in af1_d()
242 return; // expected-warning{{Potential leak of memory pointed to by}} in callocNoFree()
261 return result; // expected-warning{{Potential leak of memory pointed to by}} in callocZeroesBad()
|
| D | malloc.c | 46 return; // expected-warning{{Potential leak of memory pointed to by 'p'}} in f1()
71 char x = *q; // expected-warning {{Potential leak of memory pointed to by 'q'}} in reallocNotNullPtr()
142 } // expected-warning {{Potential leak of memory pointed to by 'r'}} in reallocPtrZero1()
159 return;// expected-warning {{Potential leak of memory pointed to by}} in reallocRadar6337483_1()
172 } // expected-warning {{Potential leak of memory pointed to by}} in reallocRadar6337483_2()
190 return; // expected-warning {{Potential leak of memory pointed to by}} in reallocRadar6337483_4()
226 } // expected-warning {{Potential leak of memory pointed to by}} in reallocfPtrZero1()
690 return; // expected-warning{{Potential leak of memory pointed to by 'buf'}} in callocNoFree()
709 return result; // expected-warning{{Potential leak of memory pointed to by 'buf'}} in callocZeroesBad()
784 } // expected-warning{{Potential leak of memory pointed to by}} in mallocEscapeMalloc()
[all …]
|
| /external/bcc/man/man8/ |
| D | deadlock.8 | 3 deadlock \- Find potential deadlocks (lock order inversions)
11 deadlock finds potential deadlocks in a running process. The program
22 inversion (potential deadlock). If the program finds a lock order inversion, the
26 This program can only find potential deadlocks that occur while the program is
73 Find potential deadlocks in PID 181. The --binary argument is not needed for \
78 Find potential deadlocks in PID 181. If the process was created from a \
84 Find potential deadlocks in PID 181. If the process was created from a \
93 Find potential deadlocks in PID 181 and dump the mutex wait graph to a file:
97 Find potential deadlocks in PID 181 and print mutex wait graph statistics:
101 Find potential deadlocks in PID 181 with custom mutexes:
[all …]
|
| /external/libcxx/src/ |
| D | hash.cpp | 76 // potential primes = 210*k + indices[i], k >= 1
137 // potential primes. All prime numbers are potential prime numbers. However
138 // some potential prime numbers are not prime. In an ideal world, all potential
140 // highest potential prime. Then this number is tested for prime by dividing it
141 // by all potential prime numbers less than the sqrt of the candidate.
143 // This implementation defines potential primes as those numbers not divisible
144 // by 2, 3, 5, and 7. Other (common) implementations define potential primes
145 // as those not divisible by 2. A few other implementations define potential
147 // primes which the potential prime is not divisible by, the set of potential
149 // are fewer potential primes to search, and fewer potential primes to divide
[all …]
|
| /external/cronet/third_party/libc++/src/src/ |
| D | hash.cpp | 73 // potential primes = 210*k + indices[i], k >= 1
134 // potential primes. All prime numbers are potential prime numbers. However
135 // some potential prime numbers are not prime. In an ideal world, all potential
137 // highest potential prime. Then this number is tested for prime by dividing it
138 // by all potential prime numbers less than the sqrt of the candidate.
140 // This implementation defines potential primes as those numbers not divisible
141 // by 2, 3, 5, and 7. Other (common) implementations define potential primes
142 // as those not divisible by 2. A few other implementations define potential
144 // primes which the potential prime is not divisible by, the set of potential
146 // are fewer potential primes to search, and fewer potential primes to divide
[all …]
|
| /external/tensorflow/tensorflow/tools/android/test/src/org/tensorflow/demo/tracking/ |
| D | MultiBoxTracker.java | 282 for (final Pair<Float, Recognition> potential : rectsToTrack) { in processResults()
284 trackedRecognition.detectionConfidence = potential.first; in processResults()
285 trackedRecognition.location = new RectF(potential.second.getLocation()); in processResults()
287 trackedRecognition.title = potential.second.getTitle(); in processResults()
299 for (final Pair<Float, Recognition> potential : rectsToTrack) { in processResults()
300 handleDetection(originalFrame, timestamp, potential); in processResults()
305 final byte[] frameCopy, final long timestamp, final Pair<Float, Recognition> potential) { in handleDetection() argument
307 objectTracker.trackObject(potential.second.getLocation(), timestamp, frameCopy); in handleDetection()
312 potential.second, potentialObject.getTrackedPositionInPreviewFrame(), potentialCorrelation); in handleDetection()
344 if (potential.first < trackedRecognition.detectionConfidence in handleDetection()
[all …]
|
| /external/zxing/core/src/main/java/com/google/zxing/ |
| D | Reader.java | 40 * @throws NotFoundException if no potential barcode is found
41 * @throws ChecksumException if a potential barcode is found but does not pass its checksum
42 * @throws FormatException if a potential barcode is found but format is invalid
56 * @throws NotFoundException if no potential barcode is found
57 * @throws ChecksumException if a potential barcode is found but does not pass its checksum
58 * @throws FormatException if a potential barcode is found but format is invalid
|
| /external/mockito/subprojects/android/src/main/java/org/mockito/android/internal/creation/ |
| D | AndroidTempFileLocator.java | 51 for (String potential : splitPathList(input)) { in guessPath()
52 if (!potential.startsWith("/data/app/")) { in guessPath()
56 int end = potential.lastIndexOf(".apk"); in guessPath()
57 if (end != potential.length() - 4) { in guessPath()
60 int dash = potential.indexOf("-"); in guessPath()
64 String packageName = potential.substring(start, end); in guessPath()
|
| /external/rust/crates/clap/3.2.23/src/error/ |
| D | context.rs | 25 /// Potential fix for the user
27 /// Potential fix for the user
29 /// Potential fix for the user
31 /// Potential fix for the user
|
| /external/dexmaker/dexmaker/src/main/java/com/android/dx/ |
| D | AppDataDirGuesser.java | 140 for (String potential : splitPathList(input)) { in guessPath()
141 if (!potential.startsWith(apkPathRoot)) { in guessPath()
144 int end = potential.lastIndexOf(".apk"); in guessPath()
145 if (end != potential.length() - 4) { in guessPath()
148 int endSlash = potential.lastIndexOf("/", end); in guessPath()
153 int startSlash = potential.lastIndexOf("/", endSlash - 1); in guessPath()
158 int dash = potential.indexOf("-", startSlash); in guessPath()
163 String packageName = potential.substring(startSlash + 1, end); in guessPath()
|
| /external/rust/crates/clap/src/error/ |
| D | context.rs | 24 /// Potential fix for the user
26 /// Potential fix for the user
28 /// Potential fix for the user
30 /// Potential fix for the user
34 /// Potential fix for the user
|
| /external/junit/src/main/java/org/junit/experimental/theories/ |
| D | DataPoint.java | 12 * or the value returned by the method to be used as a potential parameter for
16 * A DataPoint is only considered as a potential value for parameters for
21 * which named set to consider as potential values for each parameter using the
28 * assignable to the parameter type as potential values, including named sets of
|
| D | DataPoints.java | 12 * will cause the values in the array or iterable given to be used as potential
16 * DataPoints will only be considered as potential values for parameters for
21 * which named set to consider as potential values for each parameter using the
28 * assignable to the parameter type as potential values, including named sets of
|
| /external/cronet/base/functional/ |
| D | function_ref_nocompile.nc | 22 …: non-owning function references may not be bound as the functor due to potential lifetime issues\…
30 …: non-owning function references may not be bound as the functor due to potential lifetime issues\…
38 …: non-owning function references may not be bound as the functor due to potential lifetime issues\…
46 …: non-owning function references may not be bound as the functor due to potential lifetime issues\…
|
| /external/rust/crates/ring/include/ring-core/ |
| D | check.h | 19 // assertion does not have any potential to leak a secret. |NDEBUG| controls this
24 // really does not have potential to leak a secret.
38 // assertion operates on secret data in a way that has the potential to leak
45 // does have the potential to leak a secret.
|
| /external/guice/core/src/com/google/inject/internal/ |
| D | CycleDetectingLock.java | 36 * Takes a lock in a blocking fashion in case no potential deadlocks are detected. If the lock was
37 * successfully owned, returns an empty map indicating no detected potential deadlocks.
39 * <p>Otherwise, a map indicating threads involved in a potential deadlock are returned. Map is
88 * Lists locks that thread owns. Used only to populate locks in a potential cycle when it is
121 /** Underlying lock used for actual waiting when no potential deadlocks are detected. */
157 // potential deadlock is found, we don't try to take this lock in lockOrDetectPotentialLocksCycle()
238 * Algorithm to detect a potential lock cycle.
241 * current thread is found a potential cycle is detected.
262 // lock that is a part of a potential locks cycle, starts with current lock in detectPotentialLocksCycle()
|
| /external/grpc-grpc/doc/ |
| D | security_audit.md | 14 …002 can be split into two concerns: 1) dangling pointer bugs and 2) the potential vulnerability of…
33 This defensive programming pattern would help protect gRPC from the potential exploits and latent d…
61 ## GRP-01-003 Calls to malloc suffer from potential integer overflows
62 …potential integer overflow in cases where we multiply the array element size by the size of the ar…
|
| /external/googleapis/google/cloud/recommender/v1/ |
| D | recommendation.proto | 288 // Potential service downtime.
291 // Potential data loss.
294 // Potential access denial. The service is still up but some or all clients
313 // Indicates a potential increase or decrease in cost.
316 // Indicates a potential increase or decrease in security.
319 // Indicates a potential increase or decrease in performance.
322 // Indicates a potential increase or decrease in manageability.
325 // Indicates a potential increase or decrease in sustainability.
328 // Indicates a potential increase or decrease in reliability.
|
| /external/google-cloud-java/java-recaptchaenterprise/proto-google-cloud-recaptchaenterprise-v1/src/main/java/com/google/recaptchaenterprise/v1/ |
| D | PrivatePasswordLeakVerificationOrBuilder.java | 61 * Output only. List of prefixes of the encrypted potential password leaks
77 * Output only. List of prefixes of the encrypted potential password leaks
93 * Output only. List of prefixes of the encrypted potential password leaks
112 * `encrypted_user_credentials_hash` field. It is used to match potential
|
| /external/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | fuzzer_pass_replace_loads_stores_with_copy_memories.cpp | 37 // OpStore within the same block. Potential instructions OpLoad to be matched in Apply()
49 // A hash map storing potential OpLoad instructions. in Apply()
52 // Add a potential OpLoad instruction. in Apply()
92 // potential pairs. in Apply()
|