valerio wrote:
>
Hello all
I would like to dinamically allocate an array of array of structures.
To explain this:
struct file{ char* fileName,int inode) myfiles[];
struct file{ char* fileName,int inode) mydirs[][];
but I would like to do it dinamically with linked list.
/* BEGIN list_of_lists.c output */
Person number 1
Initials: O.
Age : 32
Phone numbers:
163-4945
434-9890
785-6541
432-9672
Person number 2
Initials: B.L.
Age : 36
Phone numbers:
945-4349
890-7856
541-4329
672-3216
Person number 3
Initials: J.
Age : 24
Phone numbers:
349-8907
Person number 4
Initials: S.F.G.
Age : 24
Phone numbers:
907-8565
414-3296
723-2165
238-3036
381-0527
Person number 5
Initials: F.G.
Age : 20
Phone numbers:
565-4143
296-7232
165-2383
/* END list_of_lists.c output */
/* BEGIN list_of_lists.c */
#include <stdio.h>
#include <stdlib.h>
#define PEOPLE_MAX 5
#define NUMBERS_MAX 3
#define INITIALS 3
#define UPPER "ABCDEFGHIJKLMN OPQRSTUVWXYZ"
#define LU_RAND_SEED 123456789LU
#define LU_RAND(S) ((S) * 69069LU + 362437 & 0xffffffff)
struct list_node {
struct list_node *next;
void *data;
};
typedef struct list_node list_type;
struct person {
char name[2 * INITIALS + 1];
int age;
list_type *phone_numbers;
};
list_type *list_make(long unsigned count);
list_type *person_init(li st_type *node, long unsigned seed);
list_type *number_init(li st_type *node, long unsigned seed);
void make_name(char *name, size_t length, long unsigned seed);
void person_print(li st_type *node);
void number_print(li st_type *node);
void list_free(list_ type *node, void (*free_data)(vo id *));
void person_free(voi d *data);
int main(void)
{
list_type *head;
long unsigned seed = LU_RAND_SEED;
puts("/* BEGIN list_of_lists.c output */");
head = list_make(1 + seed % PEOPLE_MAX);
if (head == NULL) {
fputs("No list\n", stderr);
}
seed = LU_RAND(seed);
if (person_init(he ad, seed) != NULL) {
person_print(he ad);
}
list_free(head, person_free);
puts("\n/* END list_of_lists.c output */");
return 0;
}
list_type *list_make(long unsigned count)
{
list_type *node, *list;
list = count != 0 ? malloc(sizeof *list) : NULL;
if (list != NULL) {
node = list;
while (--count != 0) {
node -data = NULL;
node -next = malloc(sizeof *node -next);
if (node -next == NULL) {
list_free(list, free);
return NULL;
} else {
node = node -next;
}
}
node -data = NULL;
node -next = NULL;
}
return list;
}
list_type *person_init(li st_type *node, long unsigned seed)
{
list_type *head;
struct person person;
head = node;
while (node != NULL) {
node -data = malloc(sizeof person);
if (node -data == NULL) {
fputs("person_i nit malloc problem\n", stderr);
head = NULL;
break;
}
seed = LU_RAND(seed);
make_name(perso n.name, INITIALS, seed);
seed = LU_RAND(seed);
person.age = 20 + seed % 20;
seed = LU_RAND(seed);
person.phone_nu mbers = list_make(1 + seed % PEOPLE_MAX);
if (person.phone_n umbers == NULL) {
fputs("person.p hone_numbers == NULL\n", stderr);
head = NULL;
break;
}
seed = LU_RAND(seed);
if (number_init(pe rson.phone_numb ers, seed) == NULL) {
fputs("person_i nit(person.phon e_numbers, seed) == NULL\n",
stderr);
head = NULL;
break;
}
*(struct person *)node -data = person;
node = node -next;
}
return head;
}
list_type *number_init(li st_type *node, long unsigned seed)
{
list_type *head;
size_t count;
char *string;
head = node;
while (node != NULL) {
node -data = malloc(sizeof "xxx-xxxx");
if (node -data == NULL) {
fputs("number_i nit malloc problem\n", stderr);
head = NULL;
break;
}
string = node -data;
count = sizeof "xxx-xxxx" - 1;
while (count-- != sizeof "-xxxx" - 1) {
seed = LU_RAND(seed);
*string++ = (char)('0' + seed % 10);
}
*string++ = '-';
while (count-- != 0) {
seed = LU_RAND(seed);
*string++ = (char)('0' + seed % 10);
}
*string = '\0';
node = node -next;
}
return head;
}
void person_print(li st_type *node)
{
long unsigned count;
struct person *person;
for (count = 1; node != NULL; ++count) {
person = node -data;
printf(
"\nPerson number %lu\n"
"Initials: %s\n"
"Age : %d\nPhone numbers:\n",
count, person -name, person -age
);
number_print(pe rson -phone_numbers);
node = node -next;
}
}
void number_print(li st_type *node)
{
while (node != NULL) {
printf(" %s\n", (char *)node -data);
node = node -next;
}
}
void make_name(char *name, size_t length, long unsigned seed)
{
length -= seed % length ;
while (length-- != 0) {
seed = LU_RAND(seed);
*name++ = UPPER[seed % sizeof UPPER];
*name++ = '.';
}
*name = '\0';
}
void list_free(list_ type *node, void (*free_data)(vo id *))
{
list_type *next_node;
while (node != NULL) {
next_node = node -next;
free_data(node -data);
free(node);
node = next_node;
}
}
void person_free(voi d *data)
{
list_free(((str uct person *)data) -phone_numbers, free);
free(data);
}
/* END list_of_lists.c */
--
pete
