• State
  • Locked Locked
  • Replies 1 reply
  • Subscribers 98 subscribers
  • Views 134 views
  • Users 0 members are here
Support feedback
Options
Options
Related

This thread has been locked.

If you have a related question, please click the "Ask a related question" button in the top right corner. The newly created question will be automatically linked to this question.

What is the efficient asm implementation of comparion, bit storage

Robert W
Mastermind 7100 points


Hi,

I want to know the efficient implemenation in assembly language on bit storage sequencially to a 32-bit word. The '0' or '1' bit value depends on a comparison result. Thus, one 32-bit can store 32 comparison results.

Thanks.

  • 0
    TI__Guru* 84110 points

    Robert,

    Write it in C and use the compiler/optimizer to generate an assembly implementation. There is a good chance that will be the best or close to the best, and then you will have to decide how much more work you want to do to optimize it further.

    We give you very good compilers and very fast processors so you can get a job done without having to spend a week trying to squeeze 1 more cycle out of a tight loop.

    Then you will have to add the target processor and what your cycle count goal is.

    Also, the C implementation will explain in perfect detail what you want to do.

    Regards,
    RandyP