Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:SP_FBITS
(Results
1 - 25
of
30
) sorted by relevance
1
2
/kernel/linux/linux-5.10/arch/mips/math-emu/
H
A
D
ieee754sp.c
31
qbit = (SPMANT(x) & SP_MBIT(
SP_FBITS
- 1)) == SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_issnan()
46
SPMANT(r) |= SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_nanxcpt()
48
SPMANT(r) &= ~SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_nanxcpt()
50
SPMANT(r) |= SP_MBIT(
SP_FBITS
- 2);
in ieee754sp_nanxcpt()
91
assert((xm >> (
SP_FBITS
+ 1 + 3)) == 0); /* no excess */
in ieee754sp_format()
120
ieee754sp_get_rounding(sn, xm) >> (
SP_FBITS
+ 1 + 3))
in ieee754sp_format()
149
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_format()
158
assert((xm >> (
SP_FBITS
+ 1)) == 0); /* no excess */
in ieee754sp_format()
191
assert((xm >> (
SP_FBITS
in ieee754sp_format()
[all...]
H
A
D
sp_tlong.c
53
if (xe >
SP_FBITS
) {
in ieee754sp_tlong()
54
xm <<= xe -
SP_FBITS
;
in ieee754sp_tlong()
55
} else if (xe <
SP_FBITS
) {
in ieee754sp_tlong()
62
residue = xm << (32 -
SP_FBITS
+ xe);
in ieee754sp_tlong()
65
xm >>=
SP_FBITS
- xe;
in ieee754sp_tlong()
H
A
D
sp_flong.c
36
xe =
SP_FBITS
+ 3;
in ieee754sp_flong()
38
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_flong()
41
while (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_flong()
46
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_flong()
H
A
D
sp_fint.c
36
xe =
SP_FBITS
+ 3;
in ieee754sp_fint()
38
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_fint()
41
while (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_fint()
47
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_fint()
H
A
D
ieee754sp.h
20
#define
SP_FBITS
23
macro
24
#define SP_HIDDEN_BIT SP_MBIT(
SP_FBITS
)
42
((rs > (
SP_FBITS
+3))?1:((v) >> (rs)) | ((v) << (32-(rs)) != 0))
55
while ((m >>
SP_FBITS
) == 0) { m <<= 1; e--; }
67
assert(((m) >>
SP_FBITS
) == 0);
in buildsp()
H
A
D
sp_mul.c
112
xm <<= 32 - (
SP_FBITS
+ 1);
in ieee754sp_mul()
113
ym <<= 32 - (
SP_FBITS
+ 1);
in ieee754sp_mul()
144
rm = (rm >> (32 - (
SP_FBITS
+ 1 + 3))) |
in ieee754sp_mul()
145
((rm << (
SP_FBITS
+ 1 + 3)) != 0);
in ieee754sp_mul()
148
rm = (rm >> (32 - (
SP_FBITS
+ 1 + 3 + 1))) |
in ieee754sp_mul()
149
((rm << (
SP_FBITS
+ 1 + 3 + 1)) != 0);
in ieee754sp_mul()
H
A
D
sp_tint.c
53
if (xe >
SP_FBITS
) {
in ieee754sp_tint()
54
xm <<= xe -
SP_FBITS
;
in ieee754sp_tint()
66
residue <<= 31 -
SP_FBITS
;
in ieee754sp_tint()
69
xm >>=
SP_FBITS
- xe;
in ieee754sp_tint()
H
A
D
dp_fsp.c
16
xm << (DP_FBITS -
SP_FBITS
));
in ieee754dp_nan_fsp()
44
while ((xm >>
SP_FBITS
) == 0) {
in ieee754dp_fsp()
62
(u64) xm << (DP_FBITS -
SP_FBITS
));
in ieee754dp_fsp()
H
A
D
sp_fdp.c
16
xm >> (DP_FBITS -
SP_FBITS
));
in ieee754sp_nan_fdp()
67
* Convert from DP_FBITS to
SP_FBITS
+3 with sticky right shift.
in ieee754sp_fdp()
69
rm = (xm >> (DP_FBITS - (
SP_FBITS
+ 3))) |
in ieee754sp_fdp()
70
((xm << (64 - (DP_FBITS - (
SP_FBITS
+ 3)))) != 0);
in ieee754sp_fdp()
H
A
D
sp_rint.c
37
if (xe >=
SP_FBITS
)
in ieee754sp_rint()
47
residue <<= 31 -
SP_FBITS
;
in ieee754sp_rint()
50
xm >>=
SP_FBITS
- xe;
in ieee754sp_rint()
H
A
D
ieee754d.c
73
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
84
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
90
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
H
A
D
sp_add.c
141
if (xm >> (
SP_FBITS
+ 1 + 3)) { /* carry out */
in ieee754sp_add()
157
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_add()
H
A
D
sp_div.c
118
for (bm = SP_MBIT(
SP_FBITS
+ 2); bm; bm >>= 1) {
in ieee754sp_div()
136
while ((rm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_div()
H
A
D
sp_sub.c
143
if (xm >> (
SP_FBITS
+ 1 + 3)) { /* carry out */
in ieee754sp_sub()
161
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_sub()
/kernel/linux/linux-6.6/arch/mips/math-emu/
H
A
D
ieee754sp.c
31
qbit = (SPMANT(x) & SP_MBIT(
SP_FBITS
- 1)) == SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_issnan()
46
SPMANT(r) |= SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_nanxcpt()
48
SPMANT(r) &= ~SP_MBIT(
SP_FBITS
- 1);
in ieee754sp_nanxcpt()
50
SPMANT(r) |= SP_MBIT(
SP_FBITS
- 2);
in ieee754sp_nanxcpt()
91
assert((xm >> (
SP_FBITS
+ 1 + 3)) == 0); /* no excess */
in ieee754sp_format()
120
ieee754sp_get_rounding(sn, xm) >> (
SP_FBITS
+ 1 + 3))
in ieee754sp_format()
149
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_format()
158
assert((xm >> (
SP_FBITS
+ 1)) == 0); /* no excess */
in ieee754sp_format()
191
assert((xm >> (
SP_FBITS
in ieee754sp_format()
[all...]
H
A
D
sp_tlong.c
53
if (xe >
SP_FBITS
) {
in ieee754sp_tlong()
54
xm <<= xe -
SP_FBITS
;
in ieee754sp_tlong()
55
} else if (xe <
SP_FBITS
) {
in ieee754sp_tlong()
62
residue = xm << (32 -
SP_FBITS
+ xe);
in ieee754sp_tlong()
65
xm >>=
SP_FBITS
- xe;
in ieee754sp_tlong()
H
A
D
sp_flong.c
36
xe =
SP_FBITS
+ 3;
in ieee754sp_flong()
38
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_flong()
41
while (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_flong()
46
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_flong()
H
A
D
sp_fint.c
36
xe =
SP_FBITS
+ 3;
in ieee754sp_fint()
38
if (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_fint()
41
while (xm >> (
SP_FBITS
+ 1 + 3)) {
in ieee754sp_fint()
47
while ((xm >> (
SP_FBITS
+ 3)) == 0) {
in ieee754sp_fint()
H
A
D
ieee754sp.h
20
#define
SP_FBITS
23
macro
24
#define SP_HIDDEN_BIT SP_MBIT(
SP_FBITS
)
42
((rs > (
SP_FBITS
+3))?1:((v) >> (rs)) | ((v) << (32-(rs)) != 0))
55
while ((m >>
SP_FBITS
) == 0) { m <<= 1; e--; }
67
assert(((m) >>
SP_FBITS
) == 0);
in buildsp()
H
A
D
sp_mul.c
112
xm <<= 32 - (
SP_FBITS
+ 1);
in ieee754sp_mul()
113
ym <<= 32 - (
SP_FBITS
+ 1);
in ieee754sp_mul()
144
rm = (rm >> (32 - (
SP_FBITS
+ 1 + 3))) |
in ieee754sp_mul()
145
((rm << (
SP_FBITS
+ 1 + 3)) != 0);
in ieee754sp_mul()
148
rm = (rm >> (32 - (
SP_FBITS
+ 1 + 3 + 1))) |
in ieee754sp_mul()
149
((rm << (
SP_FBITS
+ 1 + 3 + 1)) != 0);
in ieee754sp_mul()
H
A
D
sp_tint.c
53
if (xe >
SP_FBITS
) {
in ieee754sp_tint()
54
xm <<= xe -
SP_FBITS
;
in ieee754sp_tint()
66
residue <<= 31 -
SP_FBITS
;
in ieee754sp_tint()
69
xm >>=
SP_FBITS
- xe;
in ieee754sp_tint()
H
A
D
dp_fsp.c
16
xm << (DP_FBITS -
SP_FBITS
));
in ieee754dp_nan_fsp()
44
while ((xm >>
SP_FBITS
) == 0) {
in ieee754dp_fsp()
62
(u64) xm << (DP_FBITS -
SP_FBITS
));
in ieee754dp_fsp()
H
A
D
sp_fdp.c
16
xm >> (DP_FBITS -
SP_FBITS
));
in ieee754sp_nan_fdp()
67
* Convert from DP_FBITS to
SP_FBITS
+3 with sticky right shift.
in ieee754sp_fdp()
69
rm = (xm >> (DP_FBITS - (
SP_FBITS
+ 3))) |
in ieee754sp_fdp()
70
((xm << (64 - (DP_FBITS - (
SP_FBITS
+ 3)))) != 0);
in ieee754sp_fdp()
H
A
D
sp_rint.c
37
if (xe >=
SP_FBITS
)
in ieee754sp_rint()
47
residue <<= 31 -
SP_FBITS
;
in ieee754sp_rint()
50
xm >>=
SP_FBITS
- xe;
in ieee754sp_rint()
H
A
D
ieee754d.c
73
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
84
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
90
for (i =
SP_FBITS
- 1; i >= 0; i--)
in ieee754sp_dump()
Completed in 5 milliseconds
1
2