Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/arch/m68k/fpsp040/
H A Dsatan.S262 |--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
271 |--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
283 movel #0x00000000,XFRACLO(%a6) | ...LOCATION OF X IS NOW F
307 movel (%a1)+,ATANFLO(%a6) | ...ATANF IS NOW ATAN(|F|)
310 orl %d0,ATANF(%a6) | ...ATANF IS NOW SIGN(F)*ATAN(|F|)
313 |--THAT'S ALL I HAVE TO DO FOR NOW,
316 |--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
H A Dstan.S195 |--FP1 IS NOW READY
309 |--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
376 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
H A Dssin.S208 |--FP1 IS NOW READY
244 |--FP0 IS NOW READY
252 eorl %d0,X(%a6) | ...X IS NOW R'= SGN*R
273 |--FP3 RELEASED, RESTORE NOW AND TAKE SOME ADVANTAGE OF HIDING
274 |--FP2 RELEASED, RESTORE NOW AND TAKE FULL ADVANTAGE OF HIDING
300 |--FP0 IS NOW READY
311 eorl %d0,X(%a6) | ...X IS NOW S'= SGN*S
335 |--FP3 RELEASED, RESTORE NOW AND TAKE SOME ADVANTAGE OF HIDING
379 |--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
445 |--WE MUST NOW FIN
[all...]
H A Dslogn.S360 movel #0x3FFF0000,X(%a6) | ...X IS NOW Y, I.E. 2^(-K)*X
435 |--REGISTERS SAVED ARE NOW FPCR,FP1,FP2,FP3
H A Dsetox.S512 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
679 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
/kernel/linux/linux-6.6/arch/m68k/fpsp040/
H A Dstan.S195 |--FP1 IS NOW READY
309 |--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
376 |--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
H A Dsatan.S262 |--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
271 |--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
283 movel #0x00000000,XFRACLO(%a6) | ...LOCATION OF X IS NOW F
307 movel (%a1)+,ATANFLO(%a6) | ...ATANF IS NOW ATAN(|F|)
310 orl %d0,ATANF(%a6) | ...ATANF IS NOW SIGN(F)*ATAN(|F|)
313 |--THAT'S ALL I HAVE TO DO FOR NOW,
316 |--U IN FP0, WE ARE NOW READY TO COMPUTE ATAN(U) AS
H A Dssin.S208 |--FP1 IS NOW READY
244 |--FP0 IS NOW READY
252 eorl %d0,X(%a6) | ...X IS NOW R'= SGN*R
273 |--FP3 RELEASED, RESTORE NOW AND TAKE SOME ADVANTAGE OF HIDING
274 |--FP2 RELEASED, RESTORE NOW AND TAKE FULL ADVANTAGE OF HIDING
300 |--FP0 IS NOW READY
311 eorl %d0,X(%a6) | ...X IS NOW S'= SGN*S
335 |--FP3 RELEASED, RESTORE NOW AND TAKE SOME ADVANTAGE OF HIDING
379 |--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
445 |--WE MUST NOW FIN
[all...]
H A Dslogn.S360 movel #0x3FFF0000,X(%a6) | ...X IS NOW Y, I.E. 2^(-K)*X
435 |--REGISTERS SAVED ARE NOW FPCR,FP1,FP2,FP3
H A Dsetox.S512 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
679 |--WE NOW COMPUTE EXP(R)-1 BY A POLYNOMIAL
/kernel/linux/linux-5.10/drivers/block/drbd/
H A Ddrbd_int.h650 enum which_state { NOW, OLD = NOW, NEW }; enumerator
/kernel/linux/linux-6.6/drivers/block/drbd/
H A Ddrbd_int.h580 enum which_state { NOW, OLD = NOW, NEW }; enumerator
/kernel/linux/linux-5.10/arch/m68k/ifpsp060/src/
H A Dfplsp.S5097 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5154 eor.l %d1,X(%a6) # X IS NOW S'= SGN*S
5464 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5535 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5895 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5966 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6263 #--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
6272 #--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
6283 mov.l &0x00000000,XFRACLO(%a6) # LOCATION OF X IS NOW F
6307 mov.l (%a1)+,ATANFLO(%a6) # ATANF IS NOW ATA
[all...]
H A Dfpsp.S5203 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5260 eor.l %d1,X(%a6) # X IS NOW S'= SGN*S
5570 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5641 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6001 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
6072 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6369 #--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
6378 #--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
6389 mov.l &0x00000000,XFRACLO(%a6) # LOCATION OF X IS NOW F
6413 mov.l (%a1)+,ATANFLO(%a6) # ATANF IS NOW ATA
[all...]
/kernel/linux/linux-6.6/arch/m68k/ifpsp060/src/
H A Dfplsp.S5097 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5154 eor.l %d1,X(%a6) # X IS NOW S'= SGN*S
5464 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5535 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
5895 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5966 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6263 #--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
6272 #--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
6283 mov.l &0x00000000,XFRACLO(%a6) # LOCATION OF X IS NOW F
6307 mov.l (%a1)+,ATANFLO(%a6) # ATANF IS NOW ATA
[all...]
H A Dfpsp.S5203 eor.l %d1,X(%a6) # X IS NOW R'= SGN*R
5260 eor.l %d1,X(%a6) # X IS NOW S'= SGN*S
5570 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
5641 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6001 #--THE REMAINDER INSTRUCTION WHICH IS NOW IN SOFTWARE.
6072 #--WE MUST NOW FIND INT(FP2). SINCE WE NEED THIS VALUE IN
6369 #--TRUE THAT A DIVIDE IS NOW NEEDED, BUT THE APPROXIMATION FOR
6378 #--NOW WE SEE X AS +-2^K * 1.BBBBBBB....B <- 1. + 63 BITS
6389 mov.l &0x00000000,XFRACLO(%a6) # LOCATION OF X IS NOW F
6413 mov.l (%a1)+,ATANFLO(%a6) # ATANF IS NOW ATA
[all...]

Completed in 59 milliseconds