DaniWeb Forum Index > Software Development > C

about struct in C

Please support our C advertiser: Programming Forums - DaniWeb Sister Site

•

Join Date: May 2006

Posts: 43

Reputation: yuzhang is an unknown quantity at this point

Solved Threads: 0

yuzhang

Offline

Light Poster

about struct in C

May 25th, 2006

Hi all:

I am stuck in the middle of my programme, wishing you may help.

I am writing a "quene" structure in C, and it will copy the content of a string received from a server and display it on the client monitor.

Codes:

 Help with Code Tags 
 C Syntax (Toggle Plain Text) 
typedef struct Message_from_server message_from_server
 
void sqInitialise()
{
    struct Message_from_server
    {
        char *message;
        message_from_server *next_message;
    };
}
 
void sqEnqueue(const char *s)
{
    Message_from_server new_message_from_server;
    new_message_from_server.message=s;
    new_message_from_server.next_message=
typedef struct Message_from_server message_from_server

void sqInitialise()
{
    struct Message_from_server
    {
        char *message;
        message_from_server *next_message;
    };
}

void sqEnqueue(const char *s)
{
    Message_from_server new_message_from_server;
    new_message_from_server.message=s;
    new_message_from_server.next_message=

Here is where I got stuck, I do not really know what I should do once I create a new instance of Message_from_server. Ideally, the pointer *next_message should point to the next incoming message, but I do not know how to realize this concept.

Thanks

•

Join Date: Aug 2005

Posts: 15,625

Reputation: Ancient Dragon has a reputation beyond repute

Solved Threads: 1496

Ancient Dragon Ancient Dragon is offline

Offline

Still Learning

Re: about struct in C

May 25th, 2006

This looks like it should be a linked list of messages. You need to allocate an object that represents the head of the linked list, then add nodes to it. One way might be like this

 Help with Code Tags 
 C Syntax (Toggle Plain Text) 
void sqEnqueue(struct Message_from_server** head, const char *s)
{
    struct Message_from_server* new_node = malloc(sizeof(struct Message_from_server));
    new_node->s = malloc(strlen(s)+1);
    strcpy(new_node->s,s);
    new_node->next_message = NULL;
    if( *head == NULL)
    {
        *head = new_node;
    }
    else
    { // add new_node to the end of the linked list
              // locate end of list
            struct Message_from_server* tail = *head;
            while(tail->next_message != NULL)
                tail = tail->next_message;
            // found end of list, now add the new node to it
            tail->next_message = new_node;
     }
}
 
// this is how to call the above function
int main()
{
   struct Message_from_server* head = NULL; // top of linked list
   sqEnqueue( &head, "Hello");
   sqEnqueue( &head, "World");
 
// don't forget to delete the list when done with it.
}
void sqEnqueue(struct Message_from_server** head, const char *s)
{
    struct Message_from_server* new_node = malloc(sizeof(struct Message_from_server));
    new_node->s = malloc(strlen(s)+1);
    strcpy(new_node->s,s);
    new_node->next_message = NULL;
    if( *head == NULL)
    {
        *head = new_node;
    }
    else
    { // add new_node to the end of the linked list
              // locate end of list
            struct Message_from_server* tail = *head;
            while(tail->next_message != NULL)
                tail = tail->next_message;
            // found end of list, now add the new node to it
            tail->next_message = new_node;
     }
}

// this is how to call the above function
int main()
{
   struct Message_from_server* head = NULL; // top of linked list
   sqEnqueue( &head, "Hello");
   sqEnqueue( &head, "World");

// don't forget to delete the list when done with it.
}

•

Join Date: May 2006

Posts: 43

Reputation: yuzhang is an unknown quantity at this point

Solved Threads: 0

yuzhang

Offline

Light Poster

Re: about struct in C

May 25th, 2006

Thanks dragon. Would not have figured out without you.
:-)

•

Join Date: May 2006

Posts: 43

Reputation: yuzhang is an unknown quantity at this point

Solved Threads: 0

yuzhang

Offline

Light Poster

malloc()

May 25th, 2006

•

Originally Posted by Ancient Dragon

This looks like it should be a linked list of messages. You need to allocate an object that represents the head of the linked list, then add nodes to it. One way might be like this
Help with Code Tags

C Syntax (Toggle Plain Text)
void sqEnqueue(struct Message_from_server** head, const char *s)
{
    struct Message_from_server* new_node = malloc(sizeof(struct Message_from_server));
    new_node->s = malloc(strlen(s)+1);
    strcpy(new_node->s,s);
    new_node->next_message = NULL;
    if( *head == NULL)
    {
        *head = new_node;
    }
    else
    { // add new_node to the end of the linked list
              // locate end of list
            struct Message_from_server* tail = *head;
            while(tail->next_message != NULL)
                tail = tail->next_message;
            // found end of list, now add the new node to it
            tail->next_message = new_node;
     }
}
 
// this is how to call the above function
int main()
{
   struct Message_from_server* head = NULL; // top of linked list
   sqEnqueue( &head, "Hello");
   sqEnqueue( &head, "World");
 
// don't forget to delete the list when done with it.
}
void sqEnqueue(struct Message_from_server** head, const char *s) { struct Message_from_server* new_node = malloc(sizeof(struct Message_from_server)); new_node->s = malloc(strlen(s)+1); strcpy(new_node->s,s); new_node->next_message = NULL; if( *head == NULL) { *head = new_node; } else { // add new_node to the end of the linked list // locate end of list struct Message_from_server* tail = *head; while(tail->next_message != NULL) tail = tail->next_message; // found end of list, now add the new node to it tail->next_message = new_node; } } // this is how to call the above function int main() { struct Message_from_server* head = NULL; // top of linked list sqEnqueue( &head, "Hello"); sqEnqueue( &head, "World"); // don't forget to delete the list when done with it. }

Hi dragon:

You used two malloc() functions above, one is to allocate memory space for the struct, and another one is to allocate memory space for the string which is a member of the struct.
Just thinking: how does the first malloc() function know how much memory it needs to allocate for the struct before knowing the length of the string?

Thanks

•

Join Date: Apr 2004

Posts: 4,457

Reputation: Dave Sinkula has a brilliant future

Solved Threads: 251

Dave Sinkula Dave Sinkula is offline

Offline

long time no c

Re: malloc()

May 25th, 2006

•

Originally Posted by yuzhang

Just thinking: how does the first malloc() function know how much memory it needs to allocate for the struct before knowing the length of the string?

Because the struct does not contain a string, it contains a pointer, and the compiler knows how big a pointer is.

"One of the methods used by statists to destroy capitalism consists in establishing controls that tie a given industry hand and foot, making it unable to solve its problems, then declaring that freedom has failed and stronger controls are necessary." --Ayn Rand