ProgrammingThis forum is for all programming questions.
The question does not have to be directly related to Linux and any language is fair game.
Notices
Welcome to LinuxQuestions.org, a friendly and active Linux Community.
You are currently viewing LQ as a guest. By joining our community you will have the ability to post topics, receive our newsletter, use the advanced search, subscribe to threads and access many other special features. Registration is quick, simple and absolutely free. Join our community today!
Note that registered members see fewer ads, and ContentLink is completely disabled once you log in.
If you have any problems with the registration process or your account login, please contact us. If you need to reset your password, click here.
Having a problem logging in? Please visit this page to clear all LQ-related cookies.
Get a virtual cloud desktop with the Linux distro that you want in less than five minutes with Shells! With over 10 pre-installed distros to choose from, the worry-free installation life is here! Whether you are a digital nomad or just looking for flexibility, Shells can put your Linux machine on the device that you want to use.
Exclusive for LQ members, get up to 45% off per month. Click here for more info.
I am inventing wheel here. If anybody else is hitting similar problem, hopefully this post helps.
I am sure that this is some sort of size limit related. The code below compiles, but runs into SegFault.
Code:
int main(int argc, char** argv, char** envv){
struct rStr {
long i1l;
long i2l;
long j1l;
long j2l;
int k1;
char s1[400];
char s2[400];
char s3[50];
} qu[10000];
return;
}
When array size of "qu" is small (100 ish), it runs. If memory is allocated dynamically using pointer and malloc, it runs also. I guess the problem is not physical memory related.
My system is Debian squeeze, gcc version 4.4.5 (Debian 4.4.5-8). It took quite a while for me to figure out, so I am posting here.
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.