Why does GCC use multiplication by a strange number in implementing integer division?

by

More Related Contents:

  1. Why does GCC allocate more space than necessary on the stack, beyond what’s needed for alignment?
  2. How can I multiply 64 bit operands and get 128 bit result portably?
  3. x86_64 : is stack frame pointer almost useless?
  4. Why do compilers insist on using a callee-saved register here?
  5. Assembly code fsqrt and fmul instructions
  6. Why does clang produce inefficient asm with -O0 (for this simple floating point sum)?
  7. How can I indicate that the memory *pointed* to by an inline ASM argument may be used?
  8. What is the difference between ‘asm’, ‘__asm’ and ‘__asm__’?
  9. Using GCC to produce readable assembly?
  10. Is there a 128 bit integer in gcc?
  11. Can I use Intel syntax of x86 assembly with GCC?
  12. Stack allocation, padding, and alignment
  13. When to use earlyclobber constraint in extended GCC inline assembly?
  14. How does GCC implement variable-length arrays?
  15. What does it mean to align the stack?
  16. Looping over arrays with inline assembly
  17. Why does GCC pad functions with NOPs?
  18. Why does the compiler allocate more than needed in the stack?
  19. Reading a register value into a C variable [duplicate]
  20. Compiler using local variables without adjusting RSP
  21. How to compile my own glibc C standard library from source and use it?
  22. Why does this memory address %fs:0x28 ( fs[0x28] ) have a random value?
  23. Why does gcc use movl instead of push to pass function args?
  24. execute binary machine code from C
  25. calling assembly function from c
  26. What kind of C11 data type is an array according to the AMD64 ABI
  27. Produce loops without cmp instruction in GCC
  28. Using condition flags as GNU C inline asm outputs
  29. What is the effect of second argument in _builtin_prefetch()?
  30. How do I compile the asm generated by GCC?

Leave a Comment