I am reading a book and it mentions certain data type as being long pointer. Just curious about what that meant. Thanks.
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
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.
I am reading a book and it mentions certain data type as being long pointer. Just curious about what that meant. Thanks.
Some processors have two types of pointers, a near pointer and a far pointer. The near pointer is narrower (thus has a limited range) than a far pointer. A far pointer may also be a long pointer.
Some processors offer relative addressing for things nearby. A long pointer may indicate that the item is not close by and relative addressing cannot be used.
In any case, long pointers are a platform specific issue and may not be portable to other OSes or platforms.
Edit: (further explanation and usage of relative addressing)
Address distances are less of a high level concept and more of an assembly language concept. The distance is measured from the program counter (either the current address or the next address) and the start of the object (function or data). If the location is greater than the limit for a small, relative pointer, a longer pointer will be necessary.
Example: Given a system with 32 bit "long" addressing and 8-bit relative addressing. The relative distance would allow for at least 127 bytes in the forward (positive value) or previous (negative) direction. If the target is 1024 bytes away, a full 32-bit pointer must be used.
This is an optimization feature based on the concept that most instructions and data are nearby. The majority of loops have a small distance between the start of the loop and end of the loop. These employ relative addressing for execution.
Most data is nearby, whether a data constant or a variable. In more detail, the data is near a frame or reference point. Local variables are placed on the stack, relative to a frame or base address. This base address is the start of the stack before the function is executed. Thus the data can be accessed using addressing relative to the stack frame start.
The processors allow compilers to use specialized instructions for relative (near) addressing. On many processors, the instructions to use relative addressing are smaller than instructions using long addressing. Thus the processor requires less fetching from the instruction cache and the instruction cache can hold more instructions.
Long and short, near and far, addressing may depend on the scope of the data or function. There are other factors involved, such as position-independent code (PIC), virtual memory and paging.