__ __ __ __ _____ _ _ _____ _ _ _ | \/ | \ \ / / | __ \ (_) | | / ____| | | | | | \ / |_ __\ V / | |__) | __ ___ ____ _| |_ ___ | (___ | |__ ___| | | | |\/| | '__|> < | ___/ '__| \ \ / / _` | __/ _ \ \___ \| '_ \ / _ \ | | | | | | |_ / . \ | | | | | |\ V / (_| | || __/ ____) | | | | __/ | | |_| |_|_(_)_/ \_\ |_| |_| |_| \_/ \__,_|\__\___| |_____/|_| |_|\___V 2.1 if you need WebShell for Seo everyday contact me on Telegram Telegram Address : @jackleetFor_More_Tools:
/* SPDX-License-Identifier: GPL-2.0 */
#ifndef _TOOLS_LINUX_REFCOUNT_H
#define _TOOLS_LINUX_REFCOUNT_H
/*
* Variant of atomic_t specialized for reference counts.
*
* The interface matches the atomic_t interface (to aid in porting) but only
* provides the few functions one should use for reference counting.
*
* It differs in that the counter saturates at UINT_MAX and will not move once
* there. This avoids wrapping the counter and causing 'spurious'
* use-after-free issues.
*
* Memory ordering rules are slightly relaxed wrt regular atomic_t functions
* and provide only what is strictly required for refcounts.
*
* The increments are fully relaxed; these will not provide ordering. The
* rationale is that whatever is used to obtain the object we're increasing the
* reference count on will provide the ordering. For locked data structures,
* its the lock acquire, for RCU/lockless data structures its the dependent
* load.
*
* Do note that inc_not_zero() provides a control dependency which will order
* future stores against the inc, this ensures we'll never modify the object
* if we did not in fact acquire a reference.
*
* The decrements will provide release order, such that all the prior loads and
* stores will be issued before, it also provides a control dependency, which
* will order us against the subsequent free().
*
* The control dependency is against the load of the cmpxchg (ll/sc) that
* succeeded. This means the stores aren't fully ordered, but this is fine
* because the 1->0 transition indicates no concurrency.
*
* Note that the allocator is responsible for ordering things between free()
* and alloc().
*
*/
#include <linux/atomic.h>
#include <linux/kernel.h>
#ifdef NDEBUG
#define REFCOUNT_WARN(cond, str) (void)(cond)
#define __refcount_check
#else
#define REFCOUNT_WARN(cond, str) BUG_ON(cond)
#define __refcount_check __must_check
#endif
typedef struct refcount_struct {
atomic_t refs;
} refcount_t;
#define REFCOUNT_INIT(n) { .refs = ATOMIC_INIT(n), }
static inline void refcount_set(refcount_t *r, unsigned int n)
{
atomic_set(&r->refs, n);
}
static inline unsigned int refcount_read(const refcount_t *r)
{
return atomic_read(&r->refs);
}
/*
* Similar to atomic_inc_not_zero(), will saturate at UINT_MAX and WARN.
*
* Provides no memory ordering, it is assumed the caller has guaranteed the
* object memory to be stable (RCU, etc.). It does provide a control dependency
* and thereby orders future stores. See the comment on top.
*/
static inline __refcount_check
bool refcount_inc_not_zero(refcount_t *r)
{
unsigned int old, new, val = atomic_read(&r->refs);
for (;;) {
new = val + 1;
if (!val)
return false;
if (unlikely(!new))
return true;
old = atomic_cmpxchg_relaxed(&r->refs, val, new);
if (old == val)
break;
val = old;
}
REFCOUNT_WARN(new == UINT_MAX, "refcount_t: saturated; leaking memory.\n");
return true;
}
/*
* Similar to atomic_inc(), will saturate at UINT_MAX and WARN.
*
* Provides no memory ordering, it is assumed the caller already has a
* reference on the object, will WARN when this is not so.
*/
static inline void refcount_inc(refcount_t *r)
{
REFCOUNT_WARN(!refcount_inc_not_zero(r), "refcount_t: increment on 0; use-after-free.\n");
}
/*
* Similar to atomic_dec_and_test(), it will WARN on underflow and fail to
* decrement when saturated at UINT_MAX.
*
* Provides release memory ordering, such that prior loads and stores are done
* before, and provides a control dependency such that free() must come after.
* See the comment on top.
*/
static inline __refcount_check
bool refcount_sub_and_test(unsigned int i, refcount_t *r)
{
unsigned int old, new, val = atomic_read(&r->refs);
for (;;) {
if (unlikely(val == UINT_MAX))
return false;
new = val - i;
if (new > val) {
REFCOUNT_WARN(new > val, "refcount_t: underflow; use-after-free.\n");
return false;
}
old = atomic_cmpxchg_release(&r->refs, val, new);
if (old == val)
break;
val = old;
}
return !new;
}
static inline __refcount_check
bool refcount_dec_and_test(refcount_t *r)
{
return refcount_sub_and_test(1, r);
}
#endif /* _ATOMIC_LINUX_REFCOUNT_H */
| Name | Type | Size | Permission | Actions |
|---|---|---|---|---|
| sched | Folder | 0755 |
|
|
| unaligned | Folder | 0755 |
|
|
| align.h | File | 339 B | 0644 |
|
| arm-smccc.h | File | 5.63 KB | 0644 |
|
| atomic.h | File | 363 B | 0644 |
|
| bitfield.h | File | 5.33 KB | 0644 |
|
| bitmap.h | File | 4.82 KB | 0644 |
|
| bitops.h | File | 2.15 KB | 0644 |
|
| bits.h | File | 1.17 KB | 0644 |
|
| btf_ids.h | File | 5.97 KB | 0644 |
|
| bug.h | File | 442 B | 0644 |
|
| build_bug.h | File | 3.04 KB | 0644 |
|
| compiler-gcc.h | File | 1.24 KB | 0644 |
|
| compiler.h | File | 5.82 KB | 0644 |
|
| compiler_types.h | File | 1.09 KB | 0644 |
|
| const.h | File | 421 B | 0644 |
|
| coresight-pmu.h | File | 2.32 KB | 0644 |
|
| ctype.h | File | 1.9 KB | 0644 |
|
| debug_locks.h | File | 288 B | 0644 |
|
| delay.h | File | 117 B | 0644 |
|
| err.h | File | 1.99 KB | 0644 |
|
| export.h | File | 129 B | 0644 |
|
| filter.h | File | 9.59 KB | 0644 |
|
| find.h | File | 5.77 KB | 0644 |
|
| ftrace.h | File | 120 B | 0644 |
|
| gfp.h | File | 322 B | 0644 |
|
| gfp_types.h | File | 46 B | 0644 |
|
| hardirq.h | File | 280 B | 0644 |
|
| hash.h | File | 2.93 KB | 0644 |
|
| hashtable.h | File | 4.44 KB | 0644 |
|
| interrupt.h | File | 129 B | 0644 |
|
| interval_tree_generic.h | File | 6.7 KB | 0644 |
|
| irqflags.h | File | 1.37 KB | 0644 |
|
| jhash.h | File | 4.46 KB | 0644 |
|
| kallsyms.h | File | 646 B | 0644 |
|
| kconfig.h | File | 2.39 KB | 0644 |
|
| kern_levels.h | File | 954 B | 0644 |
|
| kernel.h | File | 2.64 KB | 0644 |
|
| linkage.h | File | 123 B | 0644 |
|
| list.h | File | 22.48 KB | 0644 |
|
| list_sort.h | File | 374 B | 0644 |
|
| lockdep.h | File | 1.43 KB | 0644 |
|
| log2.h | File | 4.46 KB | 0644 |
|
| math.h | File | 764 B | 0644 |
|
| math64.h | File | 1.22 KB | 0644 |
|
| module.h | File | 270 B | 0644 |
|
| mutex.h | File | 117 B | 0644 |
|
| nmi.h | File | 0 B | 0644 |
|
| numa.h | File | 292 B | 0644 |
|
| objtool_types.h | File | 1.8 KB | 0644 |
|
| overflow.h | File | 4.11 KB | 0644 |
|
| poison.h | File | 2.5 KB | 0644 |
|
| proc_fs.h | File | 123 B | 0644 |
|
| rbtree.h | File | 9.32 KB | 0644 |
|
| rbtree_augmented.h | File | 9.34 KB | 0644 |
|
| rcu.h | File | 437 B | 0644 |
|
| refcount.h | File | 4.11 KB | 0644 |
|
| ring_buffer.h | File | 2.4 KB | 0644 |
|
| rwsem.h | File | 920 B | 0644 |
|
| seq_file.h | File | 126 B | 0644 |
|
| sizes.h | File | 1.12 KB | 0644 |
|
| slab.h | File | 1.17 KB | 0644 |
|
| spinlock.h | File | 1.24 KB | 0644 |
|
| stacktrace.h | File | 678 B | 0644 |
|
| static_call_types.h | File | 2.74 KB | 0644 |
|
| string.h | File | 1.4 KB | 0644 |
|
| stringify.h | File | 380 B | 0644 |
|
| time64.h | File | 347 B | 0644 |
|
| types.h | File | 1.72 KB | 0644 |
|
| zalloc.h | File | 252 B | 0644 |
|