Function report

Linux Kernel

v5.5.9

Brick Technologies Co., Ltd

Source Code:lib\math\div64.c Create Date:2022-07-28 06:43:15
Last Modify:2020-03-12 14:18:49 Copyright©Brick
home page Tree
Annotation kernel can get tool activityDownload SCCTChinese

Name:div64_u64_rem - unsigned 64bit divide with 64bit divisor and remainder*@dividend: 64bit dividend*@divisor: 64bit divisor*@remainder: 64bit remainder* This implementation is a comparable to algorithm used by div64_u64

Proto:u64 div64_u64_rem(u64 dividend, u64 divisor, u64 *remainder)

Type:u64

Parameter:

TypeParameterName
u64dividend
u64divisor
u64 *remainder
104  high = divisor >> 32
107  If high == 0 Then
109  quot = div_u64_rem(dividend, divisor, & rem32)
110  remainder = rem32
111  Else
112  n = ls - find last set bit in word*@x: the word to search* This is defined in a similar way as the libc and compiler builtin* ffs, but returns the position of the most significant set bit.* fls(value) returns 0 if value is 0 or the position of the last
113  quot = div_u64 - unsigned 64bit divide with 32bit divisor*@dividend: unsigned 64bit dividend*@divisor: unsigned 32bit divisor* This is the most common 64bit divide and should be used if possible,* as many 32bit archs can optimize this variant better than a full
115  If quot != 0 Then quot--
118  remainder = dividend - quot * divisor
119  If remainder >= divisor Then
120  quot++
121  remainder -= divisor
125  Return quot
Caller
NameDescribe
___bpf_prog_run__bpf_prog_run - run eBPF program on a given context*@regs: is the array of MAX_BPF_EXT_REG eBPF pseudo-registers*@insn: is the array of eBPF instructions*@stack: is the eBPF storage stack* Decode and execute eBPF instructions.