请解释此过程中发现最大指针的不正确之处

Question

Wouldn't the highest pointer be the one which can't be incremented through pointer arithmetic?

#include <iostream>

int main() 
{
    // Find the largest pointer
    int x = 0;
    int* px = &x;
    while ((px+1) != px)
      ++px;
    std::cout << "The largest pointer is: " << px;

    return 0;
} 

yields

Timeout

Answer 1

As already mentioned, you've got an infinite loop because the condition can never be false .

That being said, what you're doing is undefined behaviour, illegal C++. Pointer arithmetic is only legal with pointers pointing to the same array (and a single object is treated as an array of one element) and right past the end of it. You can't expect a reasonable outcome of your program even if you fix the loop.

I suspect the value of std::numeric_limits < uintptr_t >::max() is the theoretical maximum value of pointer (converted to integer), but it might not be avaliable to your program. There are things such as virtual address space and segmented memory model to consider. Anyway, exact values of pointers (except for nullptr ) is not something you should be concerned with. You get pointers by taking addresses of existing objects or by calling allocation functions and that's that.

NB I think you have a misconception that attempting to increment an integer type beyond its maximum value will just do nothing. That's incorrect - unsigned integers will wrap around to 0 and with signed integers you get undefined behaviour again (see signed integer overflow ).

Hope that helps.

Answer 2

这将永远是错误的，因此永远不会退出

while ((px+1) != px)

Answer 3

Look at this program:

#include <iostream>

int main()
{
  int *px = (int *) (~0);
  std::cout << "Value: " << px;
  ++px;
  std::cout << " Value: " << px << std::endl;  
}

whose output is:

Value: 0xffffffffffffffff Value: 0x3

As you can see, when you increment a pointer that is at its maximum, it values is reseted and begins again

Answer 4

You might want to look for the largest pointer value that occurs before wrap-around, ie:

while (px+1 > px)
    px++;

...which will not work, of course, without the proper casts:

while ((unsigned long long)(px + 1) > (unsigned long long)px)
    px++;