Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7512809
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 29, 20262026-05-29T23:59:10+00:00 2026-05-29T23:59:10+00:00

Do pointer offsets take any extra time? Which is preferable? mov rcx, length dec

  • 0

Do pointer offsets take any extra time? Which is preferable?

mov rcx, length
dec rcx
mov rax, qword ptr [rsi+rcx*8]

or

mov rcx, length
mov rax, qword ptr [rsi+rcx*8-8]
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-29T23:59:11+00:00Added an answer on May 29, 2026 at 11:59 pm

    Using an offest should be preferred, on a modern architecture this can be faster, but never slower.

    • It is one instruction less. Instruction decoding is a limited resource.
    • The length of the code sequence is one byte shorter, becuase the offset is in the char range. This needs less cache memory.
    • The dependency chain is one instruction shorter. In your first sequence the address calculationj hast to wait for the result of the decrement.
    • Address calculation is done in separate units. There is no speed penalty when using complex addressing modes.

    On the other hand there is a chance the the decrement will be reordered to be executed earlier, so that is won’t make a difference speed wise.
    See more background information at http://www.agner.org/optimize/#manuals .

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

int bufferlength = 12488; int pointer = 1; int offset = 0; int length
I have a UINT8 pointer mArray, which is being assigned information via a *(UINT16
Take the typical demonstration of how pointer values can change through casting : struct
Is there any compiler independent and syntactically elegant way to set a vtable pointer
Using pointer arithmetic, it's possible to assign characters from one array to another. My
So I have a pointer to an array of pointers. If I delete it
What is a smart pointer and when should I use one?
Backgrounder: The PIMPL Idiom (Pointer to IMPLementation) is a technique for implementation hiding in
I have a function pointer defined by: typedef void (*EventFunction)(int nEvent); Is there a
What are Null Pointer Exceptions ( java.lang.NullPointerException ) and what causes them? What methods/tools

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.