Segmentation Fault and linked lists

[VitorTomaz]

Hello, this is my first submission at this forum, hope you'll help ; )
I wrote this program to see if I knew how to manipulate linked lists:

#include <stdio.h>
#include <stdlib.h>

typedef struct List {
    int number;
    struct Lista *next;
} list;

main () {
    int p, i;
    lista *begin, *new;
        inicio->prox = NULL;
        scanf("%d", &p);
        new = ( list * ) malloc( sizeof( list ) );
        new->next = NULL;
        begin = new;
        for ( i = 0; i < p; i++ ) {
            new = ( list * ) malloc( sizeof( lista ) );
            new->number = i;
            new->next = begin;
            begin = new;
        }
        while ( new->next != NULL ) {
            printf("%d\n", (*new).number);
            new = new->next;
        }
        for ( i = 0; i < p; i++ ) {
            new = begin;
            begin = begin->next;
            free(new);
        }
    return 0;
}

It simply reads an integer 'n' from the keyboard and then generates a linked list with 'n' elements, with each element receiving, progressively, a number (from 0 to 'n') to "number". Then it prints each "number" and frees the allocated memory.
When I try to compile it with gcc (I'm at a Fedora OS), it returns something like "Segmentation fault (kernel image recorded)" ("Falha de segmentacao (imagem do nucleo gravada).
Can you tell me what's wrong?
Thanks a lot!

[claudiu]

If you don't use code tags nobody will read your code.

[anduril462]

You aren't initializing inicio, so it's pointing to a garbage address. There is no valid object for which to set the prox pointer. Attempting to access invalid memory is causing your segmentation fault. Set inicio to NULL instead of inicio->prox at the top of the function.

A couple notes. Declare main to return an int and don't cast your malloc results.

Also, compile your programs with "gcc -ggdb ..." to generate debugging symbols. Then learn to use gdb to track down these problems. It's an amazing tool once you get a handle on it.