0 
#define MAX_SEQUENCE 10 // Max values to store in shared memory
#define MIN_SEQUENCE 2 // Min value the user can enter

//shared memory:
// 1) holds an array of numbers
// 2) holds how many numbers are in the array
typedef struct {
    int fib_seq[MAX_SEQUENCE];
    int sequence_size;
} shared_data;

//MAIN function
int main(int argc, char *argv[]) {

    pid_t pid; //process ID
    int segment_id; //Shared Memory ID
    shared_data *mem; //Shared Memory Pointer

    //check to validate atleast two arguments
    if(argc != 2) {
        printf("USAGE ERROR: [0-9]\n");
        exit(0);
    }

    //validate the input is not larger then the MAX
    if(atoi(argv[1]) > MAX_SEQUENCE) {
        printf("Max Input Size: %d\n", MAX_SEQUENCE);
        exit(0);
    }

    //validate the input is not smaller then the MIN
    if(atoi(argv[1]) < MIN_SEQUENCE) {
        printf("Min Input Size: %d\n", MIN_SEQUENCE);
        exit(0);
    }

    // 1) create a new shared memory location 'IPC_PRIVATE'
    // 2) the size of our shared memory structure 'sizeof(shared_data)'
    // 3) Set Modes S_IRUSR and S_IWUSR so the owner can read and write to the shared memory 'S_IRUSR|S_IWUSR'
    segment_id = shmget(IPC_PRIVATE, sizeof(shared_data), S_IRUSR|S_IWUSR);

    //attach the shared memory and get the pointer to the beginning location in memory
    mem = (shared_data *) shmat(segment_id,NULL,0);

    //set the size of the sequence to the argument that was passed in via command line
    mem->sequence_size = atoi(argv[1]);

    // fork a child process
    pid = fork();

    if(pid < 0) { /* error occured */
        fprintf(stderr, "Fork Failed\n");
        return 1;
    }
    else if(pid == 0) { /* child process */
        int counter = 0;
        printf("Child Fibonacci Sequence: ");

        while(counter < mem->sequence_size) {
            if(counter == 0){
                //FIB of zero is always zero
                mem->fib_seq[counter] = 0;
            }
            else if(counter == 1){
                //FIB of one is always one
                mem->fib_seq[counter] = 1;
            }
            else {
                //The Fibonacci Sequence formula 'R = fib(n-1) + fib(n-2)'
                //The first two numbers in the sequence are always 0 and 1.
                //To get a value in the sequence you will want to take the previous
                //two numbers and add them together. For example:
                // b + a = c
                // [fib(d-1) = c] + [fib(d-2) = b] = R
                // fib(0) = 0
                // fib(1) = 1
                // fib(2): 1 + 0 = 1
                // fib(3): 1 + 1 = 2
                // fib(4): 2 + 1 = 3
                // fib(5): 3 + 2 = 5
                // The next Fibonacci number in the sequence will be '8'
                mem->fib_seq[counter] = mem->fib_seq[counter - 1] + mem->fib_seq[counter - 2];
            }
            printf("%d ", mem->fib_seq[(counter)]);
            counter++;
        }
    }
    else { /* parent process */

        /* parent will wait for the child process to complete */
        wait(NULL);

        //Print out shared memory
        int count = 0;
        printf("\nParent Fibonacci Sequence: ");
        while(count < mem->sequence_size){
            printf("%d ", mem->fib_seq[count]);
            count++;
        }

        //detach shared memory
        shmdt(mem);
        //remove shared memory segment
        shmctl(segment_id,IPC_RMID,NULL);
        printf("\nComplete\n");
    }

    return 0;
}

好的，我有这个程序，我已经研究了一段时间了，问题是数字序列偏离了 1，我似乎找不到它在哪里。它没有为 fib(0) 打印 0。所以当我做 Fib(2) 时，它给了我 0 1 而不是 0 1 1，有人有什么建议吗？

4

4 回答 4

1

一个经典的欧比万错误（一个接一个）。你需要做：

mem->sequence_size = atoi(argv[1]) + 1;

（已编辑，之前的帖子导致数组越界访问）

于 2011-02-10T16:57:49.873 回答
1

你的代码似乎工作......

如果您希望 Fib(2) 打印出三个数字，您可能需要查看这一行：

while(counter < mem->sequence_size) {

但是，如果您这样做，您需要注意您将需要 11 块内存来计算 Fib(10)。你目前只会给自己 10 条内存。

如果这没有意义，则设置MIN_SEQUENCE为 0，并在计算时问问自己代码做了什么Fib(0)。

于 2011-02-10T16:58:28.303 回答
1

根据您的代码，序列大小设置为您传递的参数

mem->sequence_size = atoi(argv[1]);

在 while 循环中，您正确检查为：

while(counter < mem->sequence_size).

所以Fib 2应该只打印0 1斐波那契数列中的 2 个元素。如果您需要0 1 1then 的输出，您不会将程序作为 运行fib 3吗？

于 2011-02-10T16:58:59.067 回答
0

您正在打印counter项目数量。即，当 counter == 2 时，您正在打印两个数字，而当 counter == 0 时，您正在打印零数字。

于 2011-02-10T17:06:11.640 回答