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.
This program has a segmentation fault as it enters the for loop in the estimatepi function. Does anyone know why? I think it might have to do something with the array. Anyone have any ideas. Thanks for any help.
Code:
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#define MAXARRAY 50000000
double estimatepi(int n);
int main (int argc, char * argv[]){
double MyPi = 0.0;
printf("I started with %f.\n", MyPi);
MyPi = estimatepi(10000000);
return(0);
}
double estimatepi( int n ){
int i;
int count = 0;
double numpair[MAXARRAY][2];
for (i = 0; i < n; i++){
numpair[i][0] = ((double) rand())/RAND_MAX;
numpair[i][1] = ((double) rand())/RAND_MAX;
}
for (i = 0 ; i < n; i++){
if( ((numpair[i][0] * numpair[i][0]) + (numpair[i][1] * numpair[i][1])) < 1.0) count++;
}
return((((double)count)/n) * 4.0);
}
1. Compile with -g, step into the code with gdb, and troubleshoot with the debugger
2. Compile with -S, and look at how the stack is being allocated (it should be exactly what you're expecting)
3. Compile with different combinations of gcc "-fstack-check", " -fstack-limit-symbol" and/or "-fno-stack-limit"
Thanks for the help guys. It's not my program. I was trying to determine the seg fault for someone else. I assumed it was the array size, and I had run it through gdb already, but it still seg faults.
LinuxQuestions.org is looking for people interested in writing
Editorials, Articles, Reviews, and more. If you'd like to contribute
content, let us know.