proof of concept planner

src/llist.c

@@ -1,5 +1,7 @@
 #include "llist.h"
+#include <asm-generic/errno.h>
 #include <stdlib.h>
+#include <string.h>
 
 /* create new linked list
  * use llistFree after use
@@ -8,7 +10,7 @@
  * only use to initialize
  * To insert into list use llistAppend
  */
-llist *llistNew(void *data, int (*cmpFN)(void *a, void *b)) {
+llist *llistNew(void *data, int (*cmpFN)(const void *a, const void *b)) {
   llist *r = (llist *)malloc(sizeof(llist));
   if (r != NULL) {
     r->cmpFn = cmpFN;
@@ -71,3 +73,15 @@ void llistFree(llist *head) {
     head = tmp;
   }
 }
+/*
+ * get linked list length
+ */
+int llistLen(llist *head) {
+  int len = 0;
+  llist *c = head;
+  while (c != NULL) {
+    len += 1;
+    c = c->next;
+  }
+  return len;
+}

src/llist.h

@@ -7,11 +7,11 @@ typedef struct llist {
   struct llist *next;
   struct llist *prev;
   struct llist *tail;
-  int (*cmpFn)(void *a, void *b); // function that compares data
+  int (*cmpFn)(const void *a, const void *b); // function that compares data
 } llist;
 
 // create new linked list with content(void* data) and cmpFN
-llist *llistNew(void *data, int (*cmpFN)(void *a, void *b));
+llist *llistNew(void *data, int (*cmpFN)(const void *a, const void *b));
 // create new node with data and append to tail of head
 llist *llistAppend(llist *head, void *data);
 // return llistNode that contains key or NULL
@@ -20,5 +20,10 @@ llist *llistGet(llist *head, void *key);
 bool llistContains(llist *head, void *key);
 // free llist node (Does Not free data it contains!!)
 void llistFree(llist *head);
+// count llistLen
+int llistLen(llist *head);
+
+void llistPrintT(llist *head);
+void llistPrintH(llist *head);
 
 #endif

src/planner.c

@@ -7,35 +7,60 @@
  */
 
 #include "planner.h" // for subject and event structs
-#include "config.h"
+#include "llist.h"
+#include <stdbool.h>
+#include <stddef.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
+#include <time.h>
 
 const char taskFormat[] =
     "Task { %.64s = {\n created={%lu},\n deadline={%lu},\n "
     "priority={%d},\n spare={%lu}\n}\n";
 
 const char eventFormat[] =
-    "Event { %s = {\n start={%lu},\n end={%lu},\n spare={%lu}\n}\n";
+    "Event { %s = {\n start={%s},\n end={%s},\n spare={%lu}\n}\n";
+void llistPrintT(llist *head) {
+  llist *c = head;
+  while (c != NULL) {
+    printTask((Task *)c->data);
+    c = c->next;
+  }
+}
+// print Event to stdout
+void printEvent(Event *s) {
+  char st[26];
+  char e[26];
+  ctime_r(&s->plannedStartTime, st);
+  ctime_r(&s->plannedEndTime, e);
+  printf(eventFormat, s->task->name, st, e, s->spare);
+}
+void llistPrintE(llist *head) {
+  llist *c = head;
+  while (c != NULL) {
+    printEvent((Event *)c->data);
+    c = c->next;
+  }
+}
+void planLog(char *msg, bool e) {
+  if (!e)
+    printf("[Planner][log]  %s\n", msg);
+  else
+    fprintf(stderr, "====  [Planner][Err]  %s\n", msg);
+}
 
 Event *newEvent(Task *t, time_t s, time_t e, uint64_t sp) {
   Event *r = (Event *)malloc(sizeof(Event));
   if (r != NULL) {
     r->task = t;
-    r->plannedEndTime = s;
+    r->plannedStartTime = s;
     r->plannedEndTime = e;
     r->spare = sp;
   }
   return r;
 }
 
-// print Event to stdout
-void printEvent(Event *s) {
-  printf(eventFormat, s->task->name, s->plannedStartTime, s->plannedEndTime,
-         s->spare);
-}
-
 /*
  * creat new task with name n created c deadline d priority p spare sp
  */
@@ -87,22 +112,87 @@ char *taskToStr(Task *t) {
 // for llist
 
 // compare task by name
-int cmpTaskN(void *a, void *b) {
+int cmpTaskN(const void *a, const void *b) {
   Task *aa = (Task *)a;
   Task *bb = (Task *)b;
   return strcmp(aa->name, bb->name);
 }
 
 // compare task by priority
-int cmpTaskP(void *a, void *b) {
+int cmpTaskP(const void *a, const void *b) {
   Task *aa = (Task *)a;
   Task *bb = (Task *)b;
-  return aa->priority - bb->priority;
+  return bb->priority - aa->priority;
 }
 
 // cmp event by task name
-int cmpEvent(void *a, void *b) {
+int cmpEvent(const void *a, const void *b) {
   Event *aa = (Event *)a;
   Event *bb = (Event *)b;
   return cmpTaskN(aa->task, bb->task);
 }
+
+llist *genPlan(llist *head) {
+
+  // map llist to pointer arr & sort by priority
+  // second arr sorted bby name
+  int lLen = llistLen(head);
+  planLog("genpla: got llist\n", false);
+  printf("len: %d\n", lLen);
+  llistPrintT(head);
+
+  Task *sortedNames = calloc(lLen, sizeof(Task));
+  Task *sortedPrio = calloc(lLen, sizeof(Task));
+  if (sortedNames == NULL || sortedPrio == NULL) {
+    planLog("gen plan : calloc failed!!\n", true);
+    return NULL;
+  }
+
+  // add Tasks from llist to arr
+  llist *c = head;
+  for (int i = 0; c != NULL; i++) {
+    sortedNames[i] = *(Task *)c->data;
+    sortedPrio[i] = *(Task *)c->data;
+    c = c->next;
+  }
+
+  // sort
+  qsort(sortedNames, lLen, sizeof(Task), cmpTaskN);
+  qsort(sortedPrio, lLen, sizeof(Task), cmpTaskP);
+
+  // test print
+  planLog("sortendName", 0);
+  for (int i = 0; i < lLen; i++) {
+    printTask(sortedNames + i);
+  }
+
+  planLog("sortendPrio", 0);
+  for (int i = 0; i < lLen; i++) {
+    printTask(sortedPrio + i);
+  }
+
+  planLog("creating eventList", false);
+
+  time_t now = time(NULL);
+  struct tm *lc = localtime(&now);
+  llist *events_ll = llistNew(NULL, cmpEvent);
+  for (int i = 0; i < lLen; i++) {
+    time_t start = mktime(lc);
+
+    printf("start:: %s\n", ctime(&start));
+    lc->tm_min += 45;
+    time_t end = mktime(lc);
+    printf("end:: %s\n", ctime(&end));
+
+    Event *c = newEvent(sortedPrio + i, start, end, 0);
+    printEvent(c);
+    lc->tm_min += 15;
+    llistAppend(events_ll, c);
+  }
+
+  llistPrintE(events_ll->next);
+
+  planLog("END GEN PLAN", 0);
+
+  return events_ll;
+}

src/planner.h

@@ -1,11 +1,12 @@
 #ifndef PLANNER
 #define PLANNER
+#include "llist.h"
 #include <stdint.h>
 #include <time.h>
 
 /*
  * task subject struct used to track different tasks
- * create new task with taskNew(name, time_t created, time_t deadline, int
+ d* create new task with taskNew(name, time_t created, time_t deadline, int
  * priority, uint64_t spare)
  *
  * should be freed by user
@@ -29,8 +30,8 @@ Task *newTask(char *n, time_t c, time_t d, int p, uint64_t sp);
 /*
  * compare function for Task
  */
-int cmpTaskN(void *a, void *b);
+int cmpTaskN(const void *a, const void *b);
-int cmpTaskP(void *a, void *b);
+int cmpTaskP(const void *a, const void *b);
 
 /*
  * return allocated string representation of Task
@@ -73,8 +74,10 @@ Event *newEvent(Task *t, time_t s, time_t e, uint64_t sp);
 /*
  * compare function for Event
  */
-int cmpEvent(void *a, void *b);
+int cmpEvent(const void *a, const void *b);
-
+/*
-int genPlan(Task *head);
+ * takes llist of tasks and returns llist of events
+ */
+llist *genPlan(llist *head);
 
 #endif // !PLANNER

src/test.c

@@ -4,6 +4,7 @@
 #include "llist.h"
 #include "planner.h" // for subject and event structs
 #include "ui.h"
+#include <assert.h>
 #include <stdio.h>
 #include <stdlib.h>
 
@@ -14,20 +15,29 @@ int main() {
   // create new task named LinAlg with priority 3, created now with deadline in
   // 5 days sp is currently unused spare var
   Task *t1 = newTask("LinAlg", now, now + days(5), 3, 0);
+  assert(t1 != NULL);
 
   // Stack Allocated vars only for local use!
-  Task t2 = {
+  Task *t2 = newTask("Phys", now, now + days(2), 7, 0);
-      .name = "Phys", .created = now, .deadline = now + days(2), .priority = 7};
+  assert(t2 != NULL);
+  Task *t3 = newTask("Analysis", now, now + days(10), 5, 0);
+  assert(t3 != NULL);
+  Task *t4 = newTask("TM1", now, now + days(1), 9, 0);
+  assert(t4 != NULL);
 
   printf("%s\n", ctime(&now));
 
   // new llist test
   llist *list1 = llistNew(t1, cmpTaskN);
-  llistAppend(list1, &t2);
+  llistAppend(list1, t2);
+  llistAppend(list1, t3);
+  llistAppend(list1, t4);
+
+  genPlan(list1);
 
   // print test tasks
   printTask(t1);
-  printTask(&t2);
+  printTask(t2);
 
   // find in list & modify
   Task search = {.name = "Phys"}; // key to look for. cmpTask only compares
@@ -46,6 +56,7 @@ int main() {
   free(t1Str);
 
   free(t1);
+  free(t2);
 
   return 0;
 }