entry.S 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. /*
  2. NetWinder Floating Point Emulator
  3. (c) Rebel.COM, 1998
  4. (c) 1998, 1999 Philip Blundell
  5. Direct questions, comments to Scott Bambrough <scottb@netwinder.org>
  6. This program is free software; you can redistribute it and/or modify
  7. it under the terms of the GNU General Public License as published by
  8. the Free Software Foundation; either version 2 of the License, or
  9. (at your option) any later version.
  10. This program is distributed in the hope that it will be useful,
  11. but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. GNU General Public License for more details.
  14. You should have received a copy of the GNU General Public License
  15. along with this program; if not, write to the Free Software
  16. Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  17. */
  18. #include <asm/opcodes.h>
  19. /* This is the kernel's entry point into the floating point emulator.
  20. It is called from the kernel with code similar to this:
  21. sub r4, r5, #4
  22. ldrt r0, [r4] @ r0 = instruction
  23. adrsvc al, r9, ret_from_exception @ r9 = normal FP return
  24. adrsvc al, lr, fpundefinstr @ lr = undefined instr return
  25. get_current_task r10
  26. mov r8, #1
  27. strb r8, [r10, #TSK_USED_MATH] @ set current->used_math
  28. add r10, r10, #TSS_FPESAVE @ r10 = workspace
  29. ldr r4, .LC2
  30. ldr pc, [r4] @ Call FP emulator entry point
  31. The kernel expects the emulator to return via one of two possible
  32. points of return it passes to the emulator. The emulator, if
  33. successful in its emulation, jumps to ret_from_exception (passed in
  34. r9) and the kernel takes care of returning control from the trap to
  35. the user code. If the emulator is unable to emulate the instruction,
  36. it returns via _fpundefinstr (passed via lr) and the kernel halts the
  37. user program with a core dump.
  38. On entry to the emulator r10 points to an area of private FP workspace
  39. reserved in the thread structure for this process. This is where the
  40. emulator saves its registers across calls. The first word of this area
  41. is used as a flag to detect the first time a process uses floating point,
  42. so that the emulator startup cost can be avoided for tasks that don't
  43. want it.
  44. This routine does three things:
  45. 1) The kernel has created a struct pt_regs on the stack and saved the
  46. user registers into it. See /usr/include/asm/proc/ptrace.h for details.
  47. 2) It calls EmulateAll to emulate a floating point instruction.
  48. EmulateAll returns 1 if the emulation was successful, or 0 if not.
  49. 3) If an instruction has been emulated successfully, it looks ahead at
  50. the next instruction. If it is a floating point instruction, it
  51. executes the instruction, without returning to user space. In this
  52. way it repeatedly looks ahead and executes floating point instructions
  53. until it encounters a non floating point instruction, at which time it
  54. returns via _fpreturn.
  55. This is done to reduce the effect of the trap overhead on each
  56. floating point instructions. GCC attempts to group floating point
  57. instructions to allow the emulator to spread the cost of the trap over
  58. several floating point instructions. */
  59. #include <asm/asm-offsets.h>
  60. .globl nwfpe_enter
  61. nwfpe_enter:
  62. mov r4, lr @ save the failure-return addresses
  63. mov sl, sp @ we access the registers via 'sl'
  64. ldr r5, [sp, #S_PC] @ get contents of PC;
  65. mov r6, r0 @ save the opcode
  66. emulate:
  67. ldr r1, [sp, #S_PSR] @ fetch the PSR
  68. bl arm_check_condition @ check the condition
  69. cmp r0, #ARM_OPCODE_CONDTEST_PASS @ condition passed?
  70. @ if condition code failed to match, next insn
  71. bne next @ get the next instruction;
  72. mov r0, r6 @ prepare for EmulateAll()
  73. bl EmulateAll @ emulate the instruction
  74. cmp r0, #0 @ was emulation successful
  75. moveq pc, r4 @ no, return failure
  76. next:
  77. .Lx1: ldrt r6, [r5], #4 @ get the next instruction and
  78. @ increment PC
  79. and r2, r6, #0x0F000000 @ test for FP insns
  80. teq r2, #0x0C000000
  81. teqne r2, #0x0D000000
  82. teqne r2, #0x0E000000
  83. movne pc, r9 @ return ok if not a fp insn
  84. str r5, [sp, #S_PC] @ update PC copy in regs
  85. mov r0, r6 @ save a copy
  86. b emulate @ check condition and emulate
  87. @ We need to be prepared for the instructions at .Lx1 and .Lx2
  88. @ to fault. Emit the appropriate exception gunk to fix things up.
  89. @ ??? For some reason, faults can happen at .Lx2 even with a
  90. @ plain LDR instruction. Weird, but it seems harmless.
  91. .pushsection .fixup,"ax"
  92. .align 2
  93. .Lfix: mov pc, r9 @ let the user eat segfaults
  94. .popsection
  95. .pushsection __ex_table,"a"
  96. .align 3
  97. .long .Lx1, .Lfix
  98. .popsection