Lots of man pages.
This commit is contained in:
parent
08df2a433e
commit
cfa37a7b11
152 changed files with 25407 additions and 148 deletions
31
man/man3/muldiv.3
Normal file
31
man/man3/muldiv.3
Normal file
|
|
@ -0,0 +1,31 @@
|
|||
.TH MULDIV 3
|
||||
.SH NAME
|
||||
muldiv, umuldiv \- high-precision multiplication and division
|
||||
.SH SYNOPSIS
|
||||
.B #include <u.h>
|
||||
.br
|
||||
.B #include <libc.h>
|
||||
.PP
|
||||
.B
|
||||
long muldiv(long a, long b, long c)
|
||||
.PP
|
||||
.B
|
||||
ulong umuldiv(ulong a, ulong b, ulong c)
|
||||
.SH DESCRIPTION
|
||||
.I Muldiv
|
||||
returns
|
||||
.BR a*b/c ,
|
||||
using a
|
||||
.B vlong
|
||||
to hold the intermediate result.
|
||||
.I Umuldiv
|
||||
is the equivalent for unsigned integers.
|
||||
They can be used to scale integer values without worry about
|
||||
overflowing the intermediate result.
|
||||
.PP
|
||||
On some architectures, these routines can generate a trap if the
|
||||
final result does not fit in a
|
||||
.B long
|
||||
or
|
||||
.BR ulong ;
|
||||
on others they will silently truncate.
|
||||
Loading…
Add table
Add a link
Reference in a new issue