Home
last modified time | relevance | path

Searched refs:WE (Results 1 - 16 of 16) sorted by relevance

/kernel/linux/linux-5.10/arch/m68k/fpsp040/
H A Dsatan.S257 |--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
260 |--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
271 |--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
272 |--WE CHOSE F TO BE +-2^K * 1.BBBB1
276 |-- -ATAN(|F|), WE NEED TO STORE ONLY ATAN(|F|).
291 |--WHILE THE DIVISION IS TAKING ITS TIME, WE FETCH ATAN(|F|)
316 |--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
320 |--WHAT WE HAVE HERE IS MERELY A1 = A3, A2 = A1/A3, A3 = A2/A3.
H A Dstan.S292 |--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
376 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
H A Dslogn.S343 |--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
359 |--WHILE THE CONVERSION IS GOING ON, WE GET F AND ADDRESS OF 1/F
525 |--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE
526 |--TAKEN BECAUSE 1+Z CAN HAVE 67 BITS OF INFORMATION AND WE MUST
531 |--ON RETURNING TO LP1CONT1, WE MUST HAVE K IN FP1, ADDRESS OF
H A Dsetox.S512 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
514 |--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
679 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
681 |--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
H A Dssin.S232 |--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
287 |--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
350 |--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
445 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
/kernel/linux/linux-6.6/arch/m68k/fpsp040/
H A Dsatan.S257 |--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
260 |--A TABLE, ALL WE NEED IS TO APPROXIMATE ATAN(U) WHERE
271 |--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
272 |--WE CHOSE F TO BE +-2^K * 1.BBBB1
276 |-- -ATAN(|F|), WE NEED TO STORE ONLY ATAN(|F|).
291 |--WHILE THE DIVISION IS TAKING ITS TIME, WE FETCH ATAN(|F|)
316 |--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
320 |--WHAT WE HAVE HERE IS MERELY A1 = A3, A2 = A1/A3, A3 = A2/A3.
H A Dstan.S292 |--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
376 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
H A Dslogn.S343 |--WE DEFINE F = 1.XXXXXX1, I.E. FIRST 7 BITS OF Y AND ATTACH A 1.
359 |--WHILE THE CONVERSION IS GOING ON, WE GET F AND ADDRESS OF 1/F
525 |--HERE WE USE THE USUAL TABLE DRIVEN APPROACH. CARE HAS TO BE
526 |--TAKEN BECAUSE 1+Z CAN HAVE 67 BITS OF INFORMATION AND WE MUST
531 |--ON RETURNING TO LP1CONT1, WE MUST HAVE K IN FP1, ADDRESS OF
H A Dsetox.S512 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
514 |--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
679 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
681 |--TO FULLY UTILIZE THE PIPELINE, WE COMPUTE S = R*R
H A Dssin.S232 |--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
287 |--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
350 |--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
445 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
/kernel/linux/linux-5.10/drivers/mtd/devices/
H A Dspear_smi.c70 #define WE (0x1 << 11) /* Write Enable */ macro
392 writel((bank << BANK_SHIFT) | WE | TFIE, dev->io_base + SMI_CR2); in spear_smi_write_enable()
/kernel/linux/linux-6.6/drivers/mtd/devices/
H A Dspear_smi.c70 #define WE (0x1 << 11) /* Write Enable */ macro
392 writel((bank << BANK_SHIFT) | WE | TFIE, dev->io_base + SMI_CR2); in spear_smi_write_enable()
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/
H A Dfplsp.S5075 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5128 #--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
5192 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5535 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5876 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5966 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6258 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6261 #--A TABLE, ALL WE NEE
[all...]
H A Dfpsp.S5181 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5234 #--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
5298 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5641 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5982 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
6072 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6364 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6367 #--A TABLE, ALL WE NEE
[all...]
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/
H A Dfplsp.S5075 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5128 #--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
5192 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5535 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5876 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5966 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6258 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6261 #--A TABLE, ALL WE NEE
[all...]
H A Dfpsp.S5181 #--THEN WE RETURN SGN*SIN(R). SGN*SIN(R) IS COMPUTED BY
5234 #--THEN WE RETURN SGN*COS(R). SGN*COS(R) IS COMPUTED BY
5298 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
5641 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5982 #--IF |X| > 15PI, WE USE THE GENERAL ARGUMENT REDUCTION.
6072 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6364 #--THE MOST LIKELY CASE, |X| IN [1/16, 16). WE USE TABLE TECHNIQUE
6367 #--A TABLE, ALL WE NEE
[all...]

Completed in 48 milliseconds