| /external/cronet/base/allocator/partition_allocator/src/partition_alloc/ |
| D | partition_ref_count.h | 2 // Use of this source code is governed by a BSD-style license that can be
36 // * No-op everywhere else.
53 // Special-purpose atomic reference count class used by RawPtrBackupRefImpl.
60 // 2 * k for an allocation with k dangling references after Free()
62 // This protects against double-free's, as we check whether the reference count
63 // is odd in |ReleaseFromAllocator()|, and if not we have a double-free.
69 // ----- --------------------- ---------------------------------------- in PA_COMPONENT_EXPORT()
72 // - 1 at construction time. in PA_COMPONENT_EXPORT()
73 // - Decreased in ReleaseFromAllocator(); in PA_COMPONENT_EXPORT()
75 // 1-31 ptr_count Number of raw_ptr<T>. in PA_COMPONENT_EXPORT()
[all …]
|
| /external/zucchini/ |
| D | address_translator.h | 2 // Use of this source code is governed by a BSD-style license that can be
19 // - Offset: Position relative to start of image.
20 // - VA (Virtual Address): Virtual memory address of a loaded image. This is
22 // - RVA (Relative Virtual Address): VA relative to some base address. This is
31 // have zero-filled statically-allocated data that have no corresponding bytes
33 // addresses as offsets: now we'd have "dangling RVAs" that don't map to
35 // 1. Ignore all dangling RVAs. This simplifies the algorithm, but also means
36 // some reference targets would escape detection and processing.
37 // 2. Create distinct "fake offsets" to accommodate dangling RVAs. Image data
39 // addresses for reference matching.
[all …]
|
| /external/zucchini/aosp/include/components/zucchini/ |
| D | address_translator.h | 2 // Use of this source code is governed by a BSD-style license that can be
19 // - Offset: Position relative to start of image.
20 // - VA (Virtual Address): Virtual memory address of a loaded image. This is
22 // - RVA (Relative Virtual Address): VA relative to some base address. This is
31 // have zero-filled statically-allocated data that have no corresponding bytes
33 // addresses as offsets: now we'd have "dangling RVAs" that don't map to
35 // 1. Ignore all dangling RVAs. This simplifies the algorithm, but also means
36 // some reference targets would escape detection and processing.
37 // 2. Create distinct "fake offsets" to accommodate dangling RVAs. Image data
39 // addresses for reference matching.
[all …]
|
| /external/clang/test/Analysis/ |
| D | stackaddrleak.c | 1 // RUN: %clang_cc1 -analyze -analyzer-checker=core -verify -std=c99 -Dbool=_Bool -Wno-bool-conversi…
2 // RUN: %clang_cc1 -analyze -analyzer-checker=core -verify -x c++ -Wno-bool-conversion %s
10 …-warning{{Address of stack memory associated with local variable 'str' is still referred to by the… in f0()
15 p = 0; // no-warning in f1()
20 …-warning{{Address of stack memory allocated by call to alloca() on line 19 is still referred to by… in f2()
22 // PR 7383 - previously the stack address checker would crash on this example
36 …ected-warning{{Address of stack memory associated with local variable 'x' is still referred to by … in test_multi_return()
40 …return (intptr_t)&x; // expected-warning{{Address of stack memory associated with local variable '… in returnAsNonLoc()
45 return &x; // no-warning in returnAsBool()
52 } // expected-warning{{Address of stack memory associated with local variable 'x' is still referred… in assignAsNonLoc()
[all …]
|
| /external/cronet/base/functional/ |
| D | bind.h | 2 // Use of this source code is governed by a BSD-style license that can be
18 // -----------------------------------------------------------------------------
20 // -----------------------------------------------------------------------------
26 // For a runnable object of n-arity, the base::Bind*() family allows partial
27 // application of the first m arguments. The remaining n - m arguments must be
42 // std::move(cb).Run(); // Identical to instance->F()
46 // -----------------------------------------------------------------------------
48 // -----------------------------------------------------------------------------
74 // reference to the fact that `&` is being used on an overloaded function.
82 // - a standard conversion sequence is a better conversion sequence than a
[all …]
|
| D | bind_internal.h | 2 // Use of this source code is governed by a BSD-style license that can be
32 #include "third_party/abseil-cpp/absl/functional/function_ref.h"
38 // Functor -- A movable type representing something that should be called.
41 // RunType -- A function type (as opposed to function _pointer_ type) for
43 // (Bound)Args -- A set of types that stores the arguments.
46 // ForceVoidReturn<> -- Helper class for translating function signatures to
48 // FunctorTraits<> -- Type traits used to determine the correct RunType and
51 // StorageTraits<> -- Type traits that determine how a bound argument is
53 // InvokeHelper<> -- Take a Functor + arguments and actually invokes it.
57 // Invoker<> -- Unwraps the curried parameters and executes the Functor.
[all …]
|
| /external/cronet/base/allocator/partition_allocator/src/partition_alloc/starscan/ |
| D | pcscan_unittest.cc | 2 // Use of this source code is governed by a BSD-style license that can be
12 #include "partition_alloc/partition_alloc-inl.h"
70 allocator_.root()->UncapEmptySlotSpanMemoryForTesting();
71 allocator_.root()->SwitchToDenserBucketDistribution();
77 allocator_.root()->PurgeMemory(PurgeFlags::kDecommitEmptySlotSpans | in ~PartitionAllocPCScanTestBase()
101 return StateBitmapFromAddr(slot_start)->IsQuarantined(slot_start); in IsInQuarantine()
108 // Leverage the already-templated version outside `internal::`.
152 } else if (i == num_slots - 1) { in GetFullSlotSpan()
161 // different MTE-tag. in GetFullSlotSpan()
165 EXPECT_EQ(num_slots, bucket.active_slot_spans_head->num_allocated_slots); in GetFullSlotSpan()
[all …]
|
| /external/cronet/third_party/libc++/src/include/__algorithm/ |
| D | iterator_operations.h | 1 //===----------------------------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
106 …rt(is_same<__deref_t<_Iter>, typename iterator_traits<__remove_cvref_t<_Iter> >::reference>::value,
107 …"It looks like your iterator's `iterator_traits<It>::reference` does not match the return type of "
109 "and can lead to dangling reference issues at runtime, so we are flagging this.");
115 …// If the result of dereferencing `_Iter` is a reference type, deduce the result of calling `std::…
127 …// value -- otherwise, after `operator*` returns a temporary, this function would return a danglin…
|
| /external/cronet/base/ |
| D | barrier_callback.h | 2 // Use of this source code is governed by a BSD-style license that can be
41 --num_callbacks_left_; in Run()
72 // nor copyable.) If T is a reference, the reference is removed, and the
74 // Beware of creating dangling references. Types that contain references but are
76 // `std::pair<int, const Foo&>`. Dangling references will be passed to
84 // BarrierCallback is thread-safe - the internals are protected by a
|
| /external/kotlinx.serialization/formats/json-okio/commonMain/src/kotlinx/serialization/json/okio/ |
| D | OkioStreams.kt | 2 …* Copyright 2017-2022 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen…
17 * Serializes the [value] with [serializer] into a [sink] using JSON format and UTF-8 encoding.
37 …* Serializes given [value] to a [sink] using UTF-8 encoding and serializer retrieved from the reif…
50 * Deserializes JSON from [source] using UTF-8 encoding to a value of type [T] using [deserializer]. in encodeToBufferedSink()
53 * and throws an exception if there are any dangling bytes after an object. in encodeToBufferedSink()
67 * Deserializes the contents of given [source] to the value of type [T] using UTF-8 encoding and
71 * and throws an exception if there are any dangling bytes after an object.
82 …[source] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and [deser… in decodeFromBufferedSource()
90 …* It is a caller responsibility to hold a reference to a source and close it. Moreover, because so… in decodeFromBufferedSource()
106 …[source] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and deseri…
[all …]
|
| /external/kotlinx.serialization/formats/json/jvmMain/src/kotlinx/serialization/json/ |
| D | JvmStreams.kt | 2 …* Copyright 2017-2021 JetBrains s.r.o. Use of this source code is governed by the Apache 2.0 licen…
12 * Serializes the [value] with [serializer] into a [stream] using JSON format and UTF-8 encoding.
32 …* Serializes given [value] to [stream] using UTF-8 encoding and serializer retrieved from the reif…
45 * Deserializes JSON from [stream] using UTF-8 encoding to a value of type [T] using [deserializer]. in encodeToStream()
48 * and throws an exception if there are any dangling bytes after an object. in encodeToStream()
68 * Deserializes the contents of given [stream] to the value of type [T] using UTF-8 encoding and
72 * and throws an exception if there are any dangling bytes after an object.
84 …[stream] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and [deser… in decodeFromStream()
92 …* It is a caller responsibility to hold a reference to a stream and close it. Moreover, because st… in decodeFromStream()
109 …[stream] into lazily deserialized sequence of elements of type [T] using UTF-8 encoding and deseri…
[all …]
|
| /external/cronet/base/allocator/ |
| D | partition_alloc_features.h | 2 // Use of this source code is governed by a BSD-style license that can be
33 // Crash immediately after detecting a dangling raw_ptr.
41 // 3. The function which released the raw_ptr reference.
50 // Act on any dangling raw_ptr released after being freed.
53 // Detect when freeing memory and releasing the dangling raw_ptr happens in
97 // BRP is enabled in the main partition, as well as certain Renderer-only
111 // Decides the amount of memory uses for BRP ref-count. The actual ref-count may
227 // 32-bit pointers.
|
| /external/python/cpython3/Lib/test/support/ |
| D | threading_helper.py | 13 # Threading support to prevent reporting refleaks when running regrtest.py -R
20 # __bootstrap() method has returned, which gives us reliable reference counts
41 f"{values[0] - original_values[0]} threads "
43 f"dangling: {len(dangling_threads)})")
45 support.print_warning(f"Dangling thread: {thread!r}")
72 bpo-31234: Context manager to wait until all threads created in the with
97 dt = time.monotonic() - start_time
98 msg = (f"wait_threads() failed to cleanup {count - old_count} "
142 t.join(max(endtime - time.monotonic(), 0.01))
184 # (to avoid reference cycles)
[all …]
|
| /external/cronet/third_party/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/tensorflow/third_party/absl/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/webrtc/third_party/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
49 // mis-uses as errors.
56 // int Minus(int a, int b) { return a - b; }
58 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
59 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
60 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
87 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/private-join-and-compute/third_party/abseil-cpp-20230125.2/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
55 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
63 // int Minus(int a, int b) { return a - b; }
65 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
66 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
67 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
94 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/functional/ |
| D | bind_front.h | 7 // https://www.apache.org/licenses/LICENSE-2.0
15 // -----------------------------------------------------------------------------
17 // -----------------------------------------------------------------------------
24 // `absl::bind_front()` is meant as a drop-in replacement for C++20's upcoming
53 // mis-uses as errors. In C++20, `absl::bind_front` is replaced by
61 // int Minus(int a, int b) { return a - b; }
63 // assert(absl::bind_front(Minus)(3, 2) == 3 - 2);
64 // assert(absl::bind_front(Minus, 3)(2) == 3 - 2);
65 // assert(absl::bind_front(Minus, 3, 2)() == 3 - 2);
92 // Executor::DefaultExecutor()->Schedule(
[all …]
|
| /external/cronet/third_party/libc++/src/include/__functional/ |
| D | invoke.h | 1 // -*- C++ -*-
2 //===----------------------------------------------------------------------===//
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
8 //===----------------------------------------------------------------------===//
47 "Returning from invoke_r would bind a temporary object to the reference return type, " in invoke_r()
48 "which would result in a dangling reference."); in invoke_r()
|
| /external/grpc-grpc/doc/ |
| D | security_audit.md | 3 A third-party security audit of gRPC C++ stack was performed by [Cure53](https://cure53.de) in Octo…
9 ## GRP-01-001 DoS through uninitialized pointer dereference
11 GRP-01-001 was fixed in version 1.24.0 and above with https://github.com/grpc/grpc/pull/20351. The …
13 ## GRP-01-002 Refs to freed memory not automatically nulled
14 …-01-002 describes a programming pattern in gRPC Core where `gpr_free` is called and then the point…
16 …-related bugs. gRPC is also in the process of moving to c++ and the standard library, enabling the…
33 … pattern would help protect gRPC from the potential exploits and latent dangling pointer bugs ment…
37 …-time check if the member is taking ownership of something that was passed in by argument or alloc…
39 Another concern is readability - this `gpr_free` interface is less intuitive than the current one.
41 Yet another concern is that the use of non-smart pointers doesn’t imply ownership - it doesn’t prot…
[all …]
|
| /external/rust/crates/bytemuck/src/ |
| D | allocation.rs | 26 pub fn cast_box<A: NoUninit, B: AnyBitPattern>(input: Box<A>) -> Box<B> { in cast_box()
42 ) -> Result<Box<B>, (PodCastError, Box<A>)> { in try_cast_box()
65 pub fn try_zeroed_box<T: Zeroable>() -> Result<Box<T>, ()> { in try_zeroed_box()
67 // This will not allocate but simply create a dangling pointer. in try_zeroed_box()
68 let dangling = core::ptr::NonNull::dangling().as_ptr(); in try_zeroed_box() localVariable
69 return Ok(unsafe { Box::from_raw(dangling) }); in try_zeroed_box()
83 pub fn zeroed_box<T: Zeroable>() -> Box<T> { in zeroed_box()
94 pub fn try_zeroed_vec<T: Zeroable>(length: usize) -> Result<Vec<T>, ()> { in try_zeroed_vec()
104 pub fn zeroed_vec<T: Zeroable>(length: usize) -> Vec<T> { in zeroed_vec()
122 ) -> Result<Box<[T]>, ()> { in try_zeroed_slice_box()
[all …]
|