proof of concept planner

This commit is contained in:
simon committed 2024-12-12 16:08:19 +01:00
1 parent 6c91fb7d60
commit 7c16f20bc2
5 files changed
+149 -26

No files matched your search

+103 -13
View File
@@ -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;
}