working game

snake/snake.c

@@ -1,8 +1,70 @@
 #include <stdio.h>
 #include <stdlib.h>
+#include <stdbool.h>
 #include "snake.h"
 
 extern char board[BRD_SIZE_Y][BRD_SIZE_X];
+extern char SNAKE_VIS;
+
+void mvSnakeParts(snakePart* head) { 
+  snakePart* part = head;
+  while (1) {
+
+    order* orderHead = part->order;
+
+    if (orderHead->next != NULL) {
+      if (orderHead->next->delay == 0) {
+        part->dir = orderHead->next->dir;
+        removeOrder(orderHead);
+      }
+    }
+
+    if (orderHead->next != NULL) {
+      order* current = orderHead->next;
+      while (1) {
+        if (current->delay > 0)
+          current->delay--;
+        if (current->next == NULL)
+          break;
+        current = current->next;
+      }
+    }
+
+    int x = part->x;
+    int y = part->y;
+
+    board[y][x] = ' ';
+
+    switch (part->dir) {
+      case 'w':
+        y = y - 1 < PL_BRD_YS ? PL_BRD_YE : y - 1;
+        break;
+      case 's':
+        y = y + 1 > PL_BRD_YE ? PL_BRD_YS : y + 1;
+        break;
+      case 'a':
+        x = x - 2 < PL_BRD_XS ? PL_BRD_XE - 1 : x - 2;
+        break;
+      case 'd':
+        x = x + 2 > PL_BRD_XE ? PL_BRD_XS : x + 2;
+        break;
+      default:
+        printf("ERROR in func mvSnakeParts\n");
+        printf("dir: %c\n", part->dir);
+        exit(1);
+    }
+
+    part->x = x;
+    part->y = y;
+
+    board[y][x] = part->visChar;
+
+    if (part->next == NULL)
+      return;
+
+    part = part->next;
+  }
+}
 
 void addSnakePart(snakePart* head) {
   snakePart* tail = head;
@@ -11,7 +73,7 @@ void addSnakePart(snakePart* head) {
     tail = tail->next;
 
   snakePart* newTail = (snakePart*) malloc(sizeof(snakePart));
-  newTail->visChar = '#';
+  newTail->visChar = SNAKE_VIS;
   newTail->dir = tail->dir;
   // Order head
   newTail->order = (order*) malloc(sizeof(order));
@@ -105,3 +167,18 @@ void copyOrders(order* srcHead, order* destHead) {
     destCurrent->next = NULL;
   }
 }
+
+bool checkCollision(snakePart* head, int x, int y) {
+  snakePart* current = head;
+  while (1) {
+    if (current->x == x && current->y == y)
+      return true;
+
+    if (current->next == NULL)
+      break;
+
+    current = current->next;
+  }
+
+  return false;
+}