Searched refs:then (Results 1 - 25 of 77) sorted by path

1234

/linux-master/Documentation/trace/
H A Dfunction-graph-fold.vim4 " -S option to load from the command-line together with a trace. You can then
/linux-master/arch/arm/lib/
H A Ddiv64.S116 @ Otherwise, if lower part is also null then we are done.
141 @ If no bit position left then we are done.
148 @ then simply shift values around
/linux-master/arch/m68k/fpsp040/
H A Ddecbin.S196 | get the integer digit then skip down & get the rest of the
216 | then inc d1 (=2) to point to the next long word and reset d3 to 0
281 | routine is necessary. If so, then check the sign of the exponent
472 | same sign. If the exp was pos then multiply fp1*fp0;
H A Ddo_func.S310 beq ld_pzero |if pos then load +0
390 beq ld_pzero |if pos then load +0
460 beq ld_pzero |if pos then load +0
461 bra ld_mzero |if neg then load -0
464 beq ld_pinf |if pos then load +inf
H A Dfpsp.h56 | and then either "bra fpsp_done" if the exception was completely
H A Dgen_except.S376 | If trace mode enabled, then go to trace handler. This handler
378 | exception has been restored into the machine then the exception
394 | If the current frame is already a 6-word stack then all
397 | on an Unsupported data type exception), then we need to grow
H A Dget_op.S33 | and the instruction is then restored back into the '040. The
34 | '040 is then able to complete the instruction.
40 | then an frestore is done to restore the instruction back into
41 | the '040. The '040 then re-executes the fadd.x fpm,fpn with
50 | norm. The instruction is then restored back into the '040
227 beqs src_op_ck |if denorm then check source op.
257 beq end_getop |if denorm then exit, denorms are
361 beqs set_mon |if bit 5 = 0 then monadic
363 beqs set_dya |if bit 4 = 0 then dyadic
365 cmpiw #0x0038,%d0 |if extension = $38 then fcm
[all...]
H A Dres_func.S5 | stack frame. The function is then restored back into the
61 beqs monadic |then branch
733 rts |then ; it is either a zero of norm,
827 | precision. We can then call round with no sticky and the result
1002 | precision. We can then call round with no sticky and the result
H A Dround.S46 | If g=r=s=0 then result is exact and round is done, else set
78 | If sign of fp number = 0 (positive), then add 1 to l.
83 bmi truncate |if positive then truncate
91 | If sign of fp number = 1 (negative), then add 1 to l.
96 bpl truncate |if negative then truncate
112 | If (g=1), then add 1 to l and if (r=s=0), then clear l
118 bcc truncate |if (g=1) then
319 bmis greater |then exp will go past 0 (neg) if
330 lsrl %d5,%d6 |by the number in the exp, then
[all...]
H A Dsgetem.S90 | then load the exponent with +/1 $3fff.
112 bnes upper |then branch
115 bnes cont |if set then continue
H A Dsint.S202 | ;then return X to the user
H A Dsrem_mod.S29 | If (L < 0) then
37 | 3.2 If R > Y, then { R := R - Y, Q := Q + 1}
47 | 5.1 If R < Y/2, then R = MOD(X,Y) = REM(X,Y). Go to
49 | 5.2 If R > Y/2, then { set Last_Subtract := true,
52 | then { Q := Q + 1, signX := -signX }.
240 |..If Carry is set, then Y < (Carry,D1,D2) < 2Y. Otherwise, Carry = 0
H A Dsto_res.S6 | users destination register then fp0 is moved to the
8 | are then restored to the original contents.
H A Dutil.S98 | precision instruction, the rounding precision is then set to the force
329 | *case RndPr(from cmdreg3b{6:5} = 11 then RND_PREC = DBL
330 | *case RndPr(from cmdreg3b{6:5} = 10 then RND_PREC = SGL
333 | case 00 then RND_PREC = EXT
334 | case 01 then RND_PREC = SGL
335 | case 10 then RND_PREC = DBL
338 | case 00 then RND_PREC = EXT
339 | case 01 then RND_PREC = SGL
340 | case 10 then RND_PREC = DBL
H A Dx_operr.S9 | If the dest is a fp reg, then an extended precision non_signaling
11 | the source op is a NAN, then garbage is stored as the result (actually
14 | integer overflow, or the source op is inf, then the result stored is
37 | If the inst is move_out, then same as Note 1.
289 bnes true_operr |if not all 1's then was true operr
H A Dx_ovfl.S14 | If the instruction is move_out, then garbage is stored in the
15 | destination. If the instruction is not move_out, then the
H A Dx_snan.S10 | If the dest data format is s, d, or x, then the SNAN bit in the NAN
13 | or l, then garbage is written to the dest (actually the upper 32 bits
17 | If the inst is move_out, then the results are the same as for trap
53 bnes ena |If enabled, then branch
H A Dx_store.S92 beq dest_ext |then branch
94 beq dest_sgl |then branch
H A Dx_unfl.S8 | result, then store the result. Denormalization is accomplished
117 beqs e1_set |if set then branch
159 | Test for fsgldiv and fsglmul. If the inst was one of these, then
/linux-master/arch/m68k/ifpsp060/
H A Dfskeleton.S228 | The execution of the instruction then proceeds with an enabled floating-point
H A Diskeleton.S86 | and the operand was out of bounds, then _isp_unimp() creates
121 | integer divide where the source operand is a zero, then the _isp_unimp()
127 | then it create a Trace exception stack frame from the "chk" exception
163 | then this routine simply re-enters the package through _isp_cas.
174 | then this routine simply re-enters the package through _isp_cas2.
/linux-master/arch/m68k/ifpsp060/src/
H A Dfplsp.S7557 # then load the exponent with +/1 $3fff.
8321 # if the input is exactly equal to one, then exit through ld_pzero.
9249 # the src value. then, jump to the norm part of the routine.
9363 # If (L < 0) then #
9371 # 3.2 If R > Y, then { R := R - Y, Q := Q + 1} #
9381 # 5.1 If R < Y/2, then R = MOD(X,Y) = REM(X,Y). Go to #
9383 # 5.2 If R > Y/2, then { set Last_Subtract := true, #
9386 # then { Q := Q + 1, signX := -signX }. #
9563 #..If Carry is set, then Y < (Carry,D1,D2) < 2Y. Otherwise, Carry = 0
10122 # instruction of transcendental 060FPLSP emulation, then i
[all...]
H A Dfpsp.S617 # then stored in either the FP regfile, data regfile, or memory. #
620 # If the exception is enabled, then this handler must create the #
857 # then stored in either the FP regfile, data regfile, or memory. #
860 # If the exception is enabled, then this handler must create the #
963 # (0x00000000_80000000_00000000), then the machine will take an
996 # (0x00000000_80000000_00000000), then the machine will take an
1024 # (0x00000000_80000000_00000000), then the machine will take an
1027 # then we have to branch to real_inex.
1147 # from the FP register file. The instruction is then emulated by #
1150 # saved, then w
[all...]
H A Dilsp.S90 # zero, then perform a divide-by-zero using a 16-bit implemented #
186 # - is hi(dividend) >= divisor ? if yes, then overflow
283 # if the divisor msw is 0, use simpler algorithm then the full blown
340 # Now calculate an estimate of the quotient words (msw first, then lsw).
H A Dpfpsp.S616 # then stored in either the FP regfile, data regfile, or memory. #
619 # If the exception is enabled, then this handler must create the #
856 # then stored in either the FP regfile, data regfile, or memory. #
859 # If the exception is enabled, then this handler must create the #
962 # (0x00000000_80000000_00000000), then the machine will take an
995 # (0x00000000_80000000_00000000), then the machine will take an
1023 # (0x00000000_80000000_00000000), then the machine will take an
1026 # then we have to branch to real_inex.
1146 # from the FP register file. The instruction is then emulated by #
1149 # saved, then w
[all...]

Completed in 396 milliseconds

1234