[gaby_creed]

How do I get rid of warnings following the compilation?

pawn Код:

Header size:           8436 bytes
Code size:          1372348 bytes
Data size:          4706332 bytes
Stack/heap size:      16384 bytes; estimated max. usage=4125 cells (16500 bytes)
Total requirements: 6103500 bytes

[Shadow_]

#pragma unused 12000

Just below your includes.

[gaby_creed]

But some ways I found that not using this

and it

pawn Код:

#pragma dynamic 140000

[Vince]

Optimize your code. #pragma dynamic is a workaround, not a fix. Read:
https://sampforum.blast.hk/showthread.php?tid=55261
https://sampforum.blast.hk/showthread.php?tid=57018

[MP2]

Quote:

Originally Posted by Vince Optimize your code. #pragma dynamic is a workaround, not a fix. Read: https://sampforum.blast.hk/showthread.php?tid=55261 https://sampforum.blast.hk/showthread.php?tid=57018

I think there is a time that a gamemode gets so big this is unavoidable.

[MP2]

There must be a time when you'll run out of memory - it's not limitless. No matter how efficient you are it's only a matter of time.

[gaby_creed]

Quote:

Originally Posted by ****** That's not true, it just means you are using too many large locals.

I do not really understand tele codes are complicated. In short you have to make shorter the string?

[TheArcher]

Quote:

Originally Posted by gaby_creed I do not really understand tele codes are complicated. In short you have to make shorter the string?

Yes could be. Just to do an example if you want to return a player name the max length is 24 if you create a variable with 256 cells, it's just useless you're just wasing memory.

[gaby_creed]

Quote:

Originally Posted by ****** There is nothing to suggest that that problem stems from teleports, it is just a result of general code.

I understand.

[MP2]

Quote:

Originally Posted by ****** No, memory is not limitless, but we're not talking about ALL memory, we're only talking about stack and heap memory. This is allocated when a function begins and destroyed when a function ends, as long as you know what functions are called and what variables are in functions, you should never run out of memory because it is constantly being freed and there is a static upper bound. The issue here is that the upper bound is higher than the default, but can be very easilly reduced by, as I say, using smaller arrays and fixing recursion (which is not an issue here).

But what about global variables?