Guest User

Untitled

a guest
Mar 17th, 2018
87
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.05 KB | None | 0 0
  1. #include <stdio.h> /* for printf() and fprintf() */
  2. #include <sys/socket.h> /* for socket(), connect(), send(), and recv() */
  3. #include <arpa/inet.h> /* for sockaddr_in and inet_addr() */
  4. #include <stdlib.h> /* for atoi() and exit() */
  5. #include <string.h>
  6.  
  7.  
  8. typedef struct node{
  9. char *data;//char data[104];
  10. int order;
  11. struct node *next;
  12. }NODE;
  13.  
  14.  
  15. int main(int argc, char *argv[]){
  16. NODE *head = NULL;
  17. NODE *tail = NULL;
  18. char *message = argv[0];
  19. NODE *start = add(head, tail, message, 0);
  20. //start = add(head, message, order);
  21. }
  22.  
  23. NODE *node_make(int order, char *data)
  24. {
  25. NODE *node;
  26. if(!(node=malloc(sizeof(NODE))))
  27. return NULL;
  28. node->data = data;
  29. node->next = NULL;
  30. order++;
  31. (*node).order = order;
  32. return node;
  33. }
  34.  
  35. NODE* add(NODE *head, NODE *tail, char* data, int order){
  36. NODE *insert = node_make(order, data);
  37. if (!head){
  38. head = insert;
  39. }
  40. else {
  41. tail->next = insert;
  42. }
  43. tail = insert;
  44. return head;
  45. }
  46.  
  47. struct node* remove_node(struct node *head){
  48. char data_removed[104];
  49. if (head != NULL){
  50. strncpy(data_removed, head->data, strlen(head->data));
  51. struct node* tmp;
  52. tmp = head->next;
  53. head->next = NULL;
  54. head = tmp;
  55. }
  56. return head;
  57. }
  58.  
  59.  
  60. void print_ll(NODE* head, NODE* tail){
  61. NODE* tmp = tail;
  62. //tmp = head;
  63. while (tmp){
  64. printf("order: %d message: %s", tmp->order, tmp->data);
  65. tmp = tmp->next;
  66. }
  67. }
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76. /*
  77. //int order1;
  78. //char inside1[104];
  79.  
  80. int e_count = 0;
  81. //int n_count = 0;
  82. //int s_count = 0;
  83.  
  84. /*node *head = NULL;
  85. node *end = NULL;
  86. //node *temp = NULL;
  87. node *current = NULL;
  88. temp = (node*)malloc(sizeof(node));
  89. temp->order1 = order;
  90. temp->inside1 = inside;
  91. temp->next = current;
  92. current = temp;
  93.  
  94. node *head_eat = NULL;
  95. //node *head_networking;
  96. //node *head_sleep;
  97. node *end_eat;
  98. //node *end_networking;
  99. //node *end_sleep;
  100. node *temp_eat;
  101. //node *temp_networking;
  102. //node *temp_sleep;
  103. node *current_eat;
  104. //node *current_networking;
  105. //node *current_sleep;
  106. */
Add Comment
Please, Sign In to add comment