Перейти к содержимому
View in the app

A better way to browse. Learn more.

Zloplay community

A full-screen app on your home screen with push notifications, badges and more.

To install this app on iOS and iPadOS
  1. Tap the Share icon in Safari
  2. Scroll the menu and tap Add to Home Screen.
  3. Tap Add in the top-right corner.
To install this app on Android
  1. Tap the 3-dot menu (⋮) in the top-right corner of the browser.
  2. Tap Add to Home screen or Install app.
  3. Confirm by tapping Install.

motherfucking STACK OVERFLOW, FUCK

Featured Replies

Опубликовано:

Not to pop your nice little meme's bubble but stack overflows only occur when you are dealing with arrays like strings. The overflow is caused by accessing a value of the array past the ammount allocated on the stack by the subroutine at the beginning of the function. So when calculating a mass using a recursive function you would get an integer overflow when you reach the INT_MAX value. Because integers dont change size you cant get a stack overflow that way.

Опубликовано:
Not to pop your nice little meme's bubble but stack overflows only occur when you are dealing with arrays like strings. The overflow is caused by accessing a value of the array past the ammount allocated on the stack by the subroutine at the beginning of the function. So when calculating a mass using a recursive function you would get an integer overflow when you reach the INT_MAX value. Because integers dont change size you cant get a stack overflow that way.

You just screwed all the fun with facts :lol:

Опубликовано:
Not to pop your nice little meme's bubble but stack overflows only occur when you are dealing with arrays like strings. The overflow is caused by accessing a value of the array past the ammount allocated on the stack by the subroutine at the beginning of the function. So when calculating a mass using a recursive function you would get an integer overflow when you reach the INT_MAX value. Because integers dont change size you cant get a stack overflow that way.

XiEex.jpg

It's a joke, not a meme.

Опубликовано:
Not to pop your nice little meme's bubble but stack overflows only occur when you are dealing with arrays like strings. The overflow is caused by accessing a value of the array past the ammount allocated on the stack by the subroutine at the beginning of the function. So when calculating a mass using a recursive function you would get an integer overflow when you reach the INT_MAX value. Because integers dont change size you cant get a stack overflow that way.

A stack overflow is something like this:

int CalcMomsMass()
{
   return CalcMomsMass();
}

If you compile this with GCC and start it in a linux terminal it will exit with a stack overflow. Its when you call too many functions and the stack pointer is out of the stack limits... So the meme is right(meh, is a meme with Denis Ritchie, the C language creator, no? For more info: http://en.wikipedia.org/wiki/Stack_overflow

The overflow you talk about is a buffer overflow, when you try to write/read out from the limits of a array or a pointer.

Опубликовано:
Not to pop your nice little meme's bubble but stack overflows only occur when you are dealing with arrays like strings. The overflow is caused by accessing a value of the array past the ammount allocated on the stack by the subroutine at the beginning of the function. So when calculating a mass using a recursive function you would get an integer overflow when you reach the INT_MAX value. Because integers dont change size you cant get a stack overflow that way.

A stack overflow is something like this:

int CalcMomsMass()
{
   return CalcMomsMass();
}

If you compile this with GCC and start it in a linux terminal it will exit with a stack overflow. Its when you call too many functions and the stack pointer is out of the stack limits... So the meme is right(meh, is a meme with Denis Ritchie, the C language creator, no? For more info: http://en.wikipedia.org/wiki/Stack_overflow

 

I understood that even though I can't code (well, I'm learning the basics) :o

Опубликовано:

Of course this is not an stack overflow:

int i = 0;

while(true)
{
   i ++;
}

 

its just a type limit overflow(which i think apadayo was talking about)and the variable, when arrives to the maximum number it can reach(2 ^ 32) it resets and gets the folowing next value, which is -2 ^ 32.

 

The other overflow apadayo was talking about is, as I said, a buffer overflow, for examploe:

   unsigned char* buffer = (unsigned char*)malloc( sizeof(unsigned char) * 24);
   unsigned char out = buffer[25];

You simply get out of the buffer limits, either writting or reading a array.

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Гость
Ответить в тему...

Сейчас на странице 0

  • Нет пользователей, просматривающих эту страницу

Важная информация

Используя этот сайт, вы соглашаетесь Условия использования.

Account

Navigation

Поиск

Поиск

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.