// Copyright (c) 2011 The Chromium Authors. All rights reserved. // Use of this source code is governed by a BSD-style license that can be // found in the LICENSE file.
// For security and correctness, we check the arithmetic on ref counts. // // In an attempt to avoid binary bloat (from inlining the `CHECK`), we define // these functions out-of-line. However, compilers are wily. Further testing may // show that `NOINLINE` helps or hurts. // #ifdefined(ARCH_CPU_64_BITS) void RefCountedBase::AddRefImpl() const { // An attacker could induce use-after-free bugs, and potentially exploit them, // by creating so many references to a ref-counted object that the reference // count overflows. On 32-bit architectures, there is not enough address space // to succeed. But on 64-bit architectures, it might indeed be possible. // Therefore, we can elide the check for arithmetic overflow on 32-bit, but we // must check on 64-bit. // // Make sure the addition didn't wrap back around to 0. This form of check // works because we assert that `ref_count_` is an unsigned integer type.
CHECK(++ref_count_ != 0);
}
void RefCountedBase::ReleaseImpl() const { // Make sure the subtraction didn't wrap back around from 0 to the max value. // That could cause memory leaks, and may induce application-semantic // correctness or safety bugs. (E.g. what if we really needed that object to // be destroyed at the right time?) // // Note that unlike with overflow, underflow could also happen on 32-bit // architectures. Arguably, we should do this check on32-bit machines too.
CHECK(--ref_count_ != std::numeric_limits<decltype(ref_count_)>::max());
} #endif
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.