Geforce File Manager

NAME	SIZE	ACTIONS
📁 bitops		[ DEL ]
📁 vdso		[ DEL ]
📄 4level-fixup.h	1,098 B	[ EDIT ] \| [ DEL ]
📄 5level-fixup.h	1,273 B	[ EDIT ] \| [ DEL ]
📄 asm-offsets.h	35 B	[ EDIT ] \| [ DEL ]
📄 asm-prototypes.h	507 B	[ EDIT ] \| [ DEL ]
📄 atomic-instrumented.h	13,623 B	[ EDIT ] \| [ DEL ]
📄 atomic-long.h	8,048 B	[ EDIT ] \| [ DEL ]
📄 atomic.h	4,391 B	[ EDIT ] \| [ DEL ]
📄 atomic64.h	1,797 B	[ EDIT ] \| [ DEL ]
📄 audit_change_attr.h	484 B	[ EDIT ] \| [ DEL ]
📄 audit_dir_write.h	528 B	[ EDIT ] \| [ DEL ]
📄 audit_read.h	241 B	[ EDIT ] \| [ DEL ]
📄 audit_signal.h	36 B	[ EDIT ] \| [ DEL ]
📄 audit_write.h	461 B	[ EDIT ] \| [ DEL ]
📄 barrier.h	6,868 B	[ EDIT ] \| [ DEL ]
📄 bitops-instrumented.h	7,909 B	[ EDIT ] \| [ DEL ]
📄 bitops.h	1,119 B	[ EDIT ] \| [ DEL ]
📄 bitsperlong.h	592 B	[ EDIT ] \| [ DEL ]
📄 bug.h	6,720 B	[ EDIT ] \| [ DEL ]
📄 bugs.h	267 B	[ EDIT ] \| [ DEL ]
📄 cache.h	384 B	[ EDIT ] \| [ DEL ]
📄 cacheflush.h	1,340 B	[ EDIT ] \| [ DEL ]
📄 checksum.h	2,329 B	[ EDIT ] \| [ DEL ]
📄 cmpxchg-local.h	1,464 B	[ EDIT ] \| [ DEL ]
📄 cmpxchg.h	2,286 B	[ EDIT ] \| [ DEL ]
📄 compat.h	658 B	[ EDIT ] \| [ DEL ]
📄 current.h	256 B	[ EDIT ] \| [ DEL ]
📄 delay.h	1,157 B	[ EDIT ] \| [ DEL ]
📄 device.h	245 B	[ EDIT ] \| [ DEL ]
📄 div64.h	7,458 B	[ EDIT ] \| [ DEL ]
📄 dma-contiguous.h	238 B	[ EDIT ] \| [ DEL ]
📄 dma-mapping.h	248 B	[ EDIT ] \| [ DEL ]
📄 dma.h	553 B	[ EDIT ] \| [ DEL ]
📄 early_ioremap.h	1,696 B	[ EDIT ] \| [ DEL ]
📄 emergency-restart.h	248 B	[ EDIT ] \| [ DEL ]
📄 error-injection.h	1,178 B	[ EDIT ] \| [ DEL ]
📄 exec.h	667 B	[ EDIT ] \| [ DEL ]
📄 export.h	2,002 B	[ EDIT ] \| [ DEL ]
📄 extable.h	802 B	[ EDIT ] \| [ DEL ]
📄 fb.h	271 B	[ EDIT ] \| [ DEL ]
📄 fixmap.h	2,904 B	[ EDIT ] \| [ DEL ]
📄 ftrace.h	460 B	[ EDIT ] \| [ DEL ]
📄 futex.h	2,964 B	[ EDIT ] \| [ DEL ]
📄 getorder.h	1,487 B	[ EDIT ] \| [ DEL ]
📄 gpio.h	4,558 B	[ EDIT ] \| [ DEL ]
📄 hardirq.h	532 B	[ EDIT ] \| [ DEL ]
📄 hugetlb.h	1,326 B	[ EDIT ] \| [ DEL ]
📄 hw_irq.h	270 B	[ EDIT ] \| [ DEL ]
📄 hyperv-tlfs.h	20,696 B	[ EDIT ] \| [ DEL ]
📄 ide_iops.h	791 B	[ EDIT ] \| [ DEL ]
📄 int-ll64.h	863 B	[ EDIT ] \| [ DEL ]
📄 io.h	24,167 B	[ EDIT ] \| [ DEL ]
📄 ioctl.h	506 B	[ EDIT ] \| [ DEL ]
📄 iomap.h	4,033 B	[ EDIT ] \| [ DEL ]
📄 irq.h	403 B	[ EDIT ] \| [ DEL ]
📄 irq_regs.h	980 B	[ EDIT ] \| [ DEL ]
📄 irq_work.h	194 B	[ EDIT ] \| [ DEL ]
📄 irqflags.h	1,543 B	[ EDIT ] \| [ DEL ]
📄 kdebug.h	182 B	[ EDIT ] \| [ DEL ]
📄 kmap_size.h	263 B	[ EDIT ] \| [ DEL ]
📄 kprobes.h	868 B	[ EDIT ] \| [ DEL ]
📄 kvm_para.h	549 B	[ EDIT ] \| [ DEL ]
📄 kvm_types.h	113 B	[ EDIT ] \| [ DEL ]
📄 linkage.h	225 B	[ EDIT ] \| [ DEL ]
📄 local.h	2,282 B	[ EDIT ] \| [ DEL ]
📄 local64.h	3,887 B	[ EDIT ] \| [ DEL ]
📄 mcs_spinlock.h	260 B	[ EDIT ] \| [ DEL ]
📄 memory_model.h	2,209 B	[ EDIT ] \| [ DEL ]
📄 mm-arch-hooks.h	388 B	[ EDIT ] \| [ DEL ]
📄 mm_hooks.h	854 B	[ EDIT ] \| [ DEL ]
📄 mmiowb.h	1,731 B	[ EDIT ] \| [ DEL ]
📄 mmiowb_types.h	249 B	[ EDIT ] \| [ DEL ]
📄 mmu.h	449 B	[ EDIT ] \| [ DEL ]
📄 mmu_context.h	881 B	[ EDIT ] \| [ DEL ]
📄 module.h	1,118 B	[ EDIT ] \| [ DEL ]
📄 mshyperv.h	8,592 B	[ EDIT ] \| [ DEL ]
📄 msi.h	1,053 B	[ EDIT ] \| [ DEL ]
📄 numa.h	1,544 B	[ EDIT ] \| [ DEL ]
📄 page.h	2,454 B	[ EDIT ] \| [ DEL ]
📄 param.h	367 B	[ EDIT ] \| [ DEL ]
📄 parport.h	604 B	[ EDIT ] \| [ DEL ]
📄 pci.h	401 B	[ EDIT ] \| [ DEL ]
📄 pci_iomap.h	1,775 B	[ EDIT ] \| [ DEL ]
📄 percpu.h	13,026 B	[ EDIT ] \| [ DEL ]
📄 pgalloc.h	342 B	[ EDIT ] \| [ DEL ]
📄 pgtable-nop4d-hack.h	1,965 B	[ EDIT ] \| [ DEL ]
📄 pgtable-nop4d.h	1,772 B	[ EDIT ] \| [ DEL ]
📄 pgtable-nopmd.h	1,944 B	[ EDIT ] \| [ DEL ]
📄 pgtable-nopud.h	2,071 B	[ EDIT ] \| [ DEL ]
📄 pgtable.h	33,765 B	[ EDIT ] \| [ DEL ]
📄 pgtable_uffd.h	1,052 B	[ EDIT ] \| [ DEL ]
📄 preempt.h	1,994 B	[ EDIT ] \| [ DEL ]
📄 ptrace.h	1,615 B	[ EDIT ] \| [ DEL ]
📄 qrwlock.h	4,315 B	[ EDIT ] \| [ DEL ]
📄 qrwlock_types.h	682 B	[ EDIT ] \| [ DEL ]
📄 qspinlock.h	3,816 B	[ EDIT ] \| [ DEL ]
📄 qspinlock_types.h	2,590 B	[ EDIT ] \| [ DEL ]
📄 resource.h	1,100 B	[ EDIT ] \| [ DEL ]
📄 seccomp.h	1,328 B	[ EDIT ] \| [ DEL ]
📄 sections.h	5,306 B	[ EDIT ] \| [ DEL ]
📄 segment.h	249 B	[ EDIT ] \| [ DEL ]
📄 serial.h	345 B	[ EDIT ] \| [ DEL ]
📄 set_memory.h	362 B	[ EDIT ] \| [ DEL ]
📄 signal.h	308 B	[ EDIT ] \| [ DEL ]
📄 simd.h	436 B	[ EDIT ] \| [ DEL ]
📄 sizes.h	78 B	[ EDIT ] \| [ DEL ]
📄 spinlock.h	329 B	[ EDIT ] \| [ DEL ]
📄 statfs.h	169 B	[ EDIT ] \| [ DEL ]
📄 string.h	281 B	[ EDIT ] \| [ DEL ]
📄 switch_to.h	962 B	[ EDIT ] \| [ DEL ]
📄 syscall.h	6,389 B	[ EDIT ] \| [ DEL ]
📄 syscalls.h	739 B	[ EDIT ] \| [ DEL ]
📄 termios-base.h	2,164 B	[ EDIT ] \| [ DEL ]
📄 termios.h	2,877 B	[ EDIT ] \| [ DEL ]
📄 timex.h	508 B	[ EDIT ] \| [ DEL ]
📄 tlb.h	19,685 B	[ EDIT ] \| [ DEL ]
📄 tlbflush.h	485 B	[ EDIT ] \| [ DEL ]
📄 topology.h	2,234 B	[ EDIT ] \| [ DEL ]
📄 trace_clock.h	391 B	[ EDIT ] \| [ DEL ]
📄 uaccess.h	5,272 B	[ EDIT ] \| [ DEL ]
📄 unaligned.h	1,078 B	[ EDIT ] \| [ DEL ]
📄 unistd.h	318 B	[ EDIT ] \| [ DEL ]
📄 user.h	242 B	[ EDIT ] \| [ DEL ]
📄 vga.h	587 B	[ EDIT ] \| [ DEL ]
📄 vmlinux.lds.h	28,848 B	[ EDIT ] \| [ DEL ]
📄 vtime.h	52 B	[ EDIT ] \| [ DEL ]
📄 word-at-a-time.h	2,817 B	[ EDIT ] \| [ DEL ]
📄 xor.h	13,961 B	[ EDIT ] \| [ DEL ]

[ CLOSE ]

EDIT: div64.h

/* SPDX-License-Identifier: GPL-2.0 */
#ifndef _ASM_GENERIC_DIV64_H
#define _ASM_GENERIC_DIV64_H
/*
 * Copyright (C) 2003 Bernardo Innocenti <bernie@develer.com>
 * Based on former asm-ppc/div64.h and asm-m68knommu/div64.h
 *
 * Optimization for constant divisors on 32-bit machines:
 * Copyright (C) 2006-2015 Nicolas Pitre
 *
 * The semantics of do_div() are:
 *
 * uint32_t do_div(uint64_t *n, uint32_t base)
 * {
 * 	uint32_t remainder = *n % base;
 * 	*n = *n / base;
 * 	return remainder;
 * }
 *
 * NOTE: macro parameter n is evaluated multiple times,
 *       beware of side effects!
 */

#include <linux/types.h>
#include <linux/compiler.h>

#if BITS_PER_LONG == 64

/**
 * do_div - returns 2 values: calculate remainder and update new dividend
 * @n: pointer to uint64_t dividend (will be updated)
 * @base: uint32_t divisor
 *
 * Summary:
 * ``uint32_t remainder = *n % base;``
 * ``*n = *n / base;``
 *
 * Return: (uint32_t)remainder
 *
 * NOTE: macro parameter @n is evaluated multiple times,
 * beware of side effects!
 */
# define do_div(n,base) ({					\
	uint32_t __base = (base);				\
	uint32_t __rem;						\
	__rem = ((uint64_t)(n)) % __base;			\
	(n) = ((uint64_t)(n)) / __base;				\
	__rem;							\
 })

#elif BITS_PER_LONG == 32

#include <linux/log2.h>

/*
 * If the divisor happens to be constant, we determine the appropriate
 * inverse at compile time to turn the division into a few inline
 * multiplications which ought to be much faster. And yet only if compiling
 * with a sufficiently recent gcc version to perform proper 64-bit constant
 * propagation.
 *
 * (It is unfortunate that gcc doesn't perform all this internally.)
 */

#ifndef __div64_const32_is_OK
#define __div64_const32_is_OK (__GNUC__ >= 4)
#endif

#define __div64_const32(n, ___b)					\
({									\
	/*								\
	 * Multiplication by reciprocal of b: n / b = n * (p / b) / p	\
	 *								\
	 * We rely on the fact that most of this code gets optimized	\
	 * away at compile time due to constant propagation and only	\
	 * a few multiplication instructions should remain.		\
	 * Hence this monstrous macro (static inline doesn't always	\
	 * do the trick here).						\
	 */								\
	uint64_t ___res, ___x, ___t, ___m, ___n = (n);			\
	uint32_t ___p, ___bias;						\
									\
	/* determine MSB of b */					\
	___p = 1 << ilog2(___b);					\
									\
	/* compute m = ((p << 64) + b - 1) / b */			\
	___m = (~0ULL / ___b) * ___p;					\
	___m += (((~0ULL % ___b + 1) * ___p) + ___b - 1) / ___b;	\
									\
	/* one less than the dividend with highest result */		\
	___x = ~0ULL / ___b * ___b - 1;					\
									\
	/* test our ___m with res = m * x / (p << 64) */		\
	___res = ((___m & 0xffffffff) * (___x & 0xffffffff)) >> 32;	\
	___t = ___res += (___m & 0xffffffff) * (___x >> 32);		\
	___res += (___x & 0xffffffff) * (___m >> 32);			\
	___t = (___res < ___t) ? (1ULL << 32) : 0;			\
	___res = (___res >> 32) + ___t;					\
	___res += (___m >> 32) * (___x >> 32);				\
	___res /= ___p;							\
									\
	/* Now sanitize and optimize what we've got. */			\
	if (~0ULL % (___b / (___b & -___b)) == 0) {			\
		/* special case, can be simplified to ... */		\
		___n /= (___b & -___b);					\
		___m = ~0ULL / (___b / (___b & -___b));			\
		___p = 1;						\
		___bias = 1;						\
	} else if (___res != ___x / ___b) {				\
		/*							\
		 * We can't get away without a bias to compensate	\
		 * for bit truncation errors.  To avoid it we'd need an	\
		 * additional bit to represent m which would overflow	\
		 * a 64-bit variable.					\
		 *							\
		 * Instead we do m = p / b and n / b = (n * m + m) / p.	\
		 */							\
		___bias = 1;						\
		/* Compute m = (p << 64) / b */				\
		___m = (~0ULL / ___b) * ___p;				\
		___m += ((~0ULL % ___b + 1) * ___p) / ___b;		\
	} else {							\
		/*							\
		 * Reduce m / p, and try to clear bit 31 of m when	\
		 * possible, otherwise that'll need extra overflow	\
		 * handling later.					\
		 */							\
		uint32_t ___bits = -(___m & -___m);			\
		___bits |= ___m >> 32;					\
		___bits = (~___bits) << 1;				\
		/*							\
		 * If ___bits == 0 then setting bit 31 is  unavoidable.	\
		 * Simply apply the maximum possible reduction in that	\
		 * case. Otherwise the MSB of ___bits indicates the	\
		 * best reduction we should apply.			\
		 */							\
		if (!___bits) {						\
			___p /= (___m & -___m);				\
			___m /= (___m & -___m);				\
		} else {						\
			___p >>= ilog2(___bits);			\
			___m >>= ilog2(___bits);			\
		}							\
		/* No bias needed. */					\
		___bias = 0;						\
	}								\
									\
	/*								\
	 * Now we have a combination of 2 conditions:			\
	 *								\
	 * 1) whether or not we need to apply a bias, and		\
	 *								\
	 * 2) whether or not there might be an overflow in the cross	\
	 *    product determined by (___m & ((1 << 63) | (1 << 31))).	\
	 *								\
	 * Select the best way to do (m_bias + m * n) / (1 << 64).	\
	 * From now on there will be actual runtime code generated.	\
	 */								\
	___res = __arch_xprod_64(___m, ___n, ___bias);			\
									\
	___res /= ___p;							\
})

#ifndef __arch_xprod_64
/*
 * Default C implementation for __arch_xprod_64()
 *
 * Prototype: uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias)
 * Semantic:  retval = ((bias ? m : 0) + m * n) >> 64
 *
 * The product is a 128-bit value, scaled down to 64 bits.
 * Assuming constant propagation to optimize away unused conditional code.
 * Architectures may provide their own optimized assembly implementation.
 */
static inline uint64_t __arch_xprod_64(const uint64_t m, uint64_t n, bool bias)
{
	uint32_t m_lo = m;
	uint32_t m_hi = m >> 32;
	uint32_t n_lo = n;
	uint32_t n_hi = n >> 32;
	uint64_t res, tmp;

if (!bias) {
		res = ((uint64_t)m_lo * n_lo) >> 32;
	} else if (!(m & ((1ULL << 63) | (1ULL << 31)))) {
		/* there can't be any overflow here */
		res = (m + (uint64_t)m_lo * n_lo) >> 32;
	} else {
		res = m + (uint64_t)m_lo * n_lo;
		tmp = (res < m) ? (1ULL << 32) : 0;
		res = (res >> 32) + tmp;
	}

if (!(m & ((1ULL << 63) | (1ULL << 31)))) {
		/* there can't be any overflow here */
		res += (uint64_t)m_lo * n_hi;
		res += (uint64_t)m_hi * n_lo;
		res >>= 32;
	} else {
		tmp = res += (uint64_t)m_lo * n_hi;
		res += (uint64_t)m_hi * n_lo;
		tmp = (res < tmp) ? (1ULL << 32) : 0;
		res = (res >> 32) + tmp;
	}

res += (uint64_t)m_hi * n_hi;

return res;
}
#endif

#ifndef __div64_32
extern uint32_t __div64_32(uint64_t *dividend, uint32_t divisor);
#endif

/* The unnecessary pointer compare is there
 * to check for type safety (n must be 64bit)
 */
# define do_div(n,base) ({				\
	uint32_t __base = (base);			\
	uint32_t __rem;					\
	(void)(((typeof((n)) *)0) == ((uint64_t *)0));	\
	if (__builtin_constant_p(__base) &&		\
	    is_power_of_2(__base)) {			\
		__rem = (n) & (__base - 1);		\
		(n) >>= ilog2(__base);			\
	} else if (__div64_const32_is_OK &&		\
		   __builtin_constant_p(__base) &&	\
		   __base != 0) {			\
		uint32_t __res_lo, __n_lo = (n);	\
		(n) = __div64_const32(n, __base);	\
		/* the remainder can be computed with 32-bit regs */ \
		__res_lo = (n);				\
		__rem = __n_lo - __res_lo * __base;	\
	} else if (likely(((n) >> 32) == 0)) {		\
		__rem = (uint32_t)(n) % __base;		\
		(n) = (uint32_t)(n) / __base;		\
	} else 						\
		__rem = __div64_32(&(n), __base);	\
	__rem;						\
 })

#else /* BITS_PER_LONG == ?? */

# error do_div() does not yet support the C64

#endif /* BITS_PER_LONG */

#endif /* _ASM_GENERIC_DIV64_H */