job_node.c

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <termios.h>
#include <string.h>
#include "job_node.h"

job_node* new_node(int index, int status, pid_t pid, pid_t gpid, char* original_input, job_node* next, job_node* prev){
  job_node* n = (struct job_node*)malloc(sizeof(job_node));
  n->index = index;
  n->status = status;
  n->pid = pid;
  n->gpid = gpid;
  n->original_input = (char*)malloc(sizeof(char) * (strlen(original_input) + 1));
  strcpy(n->original_input, original_input);
  n->next = next;
  n->prev = prev;
  return n;
}

char* get_input(job_node* node) {
  return node->original_input;
}

void insert_after(job_node* n, job_node* new_n){
  if(n->next){
    n->next->prev = new_n;
    new_n->next = n->next;
  }
  n->next = new_n;
  new_n->prev = n;
}

void insert_before(job_node* n, job_node* new_n){
  if(n->prev){
    n->prev->next = new_n;
    new_n->prev = n->prev;
  }
  n->prev = new_n;
  new_n->next = n;
}

void delete_node(job_node* n) {
  job_node* prev = n->prev;
  job_node* next = n->next;
  if(prev != NULL && next != NULL) {
    prev->next = next;
    next->prev = prev;
  } else if(prev != NULL) {
    prev->next = NULL;
  } else if(next != NULL) {
    next->prev = NULL;
  }
  free(n->original_input);
  free(n);
}

job_node* get_jobnode_bypid(job_node* head, pid_t pid){
  job_node* p = head;
  if (p){
    while (p){
      if (p->pid == pid){
        return p;
      }
      p = p->next;
    }
  }
  return NULL;
}

job_node* nth_job(job_node* head, int index){
  job_node* p = head;
  if(index ==length(head)){
    return NULL;
  }else{
    for(int i=0; i<index; p = p->next,i++)
      ;
  }
  return p;
}

job_node* nth_job_prev(job_node* tail, int index){
  int length =0;
  job_node* t = tail;
  for(;t;length++, t = t->prev){
    ;
  }
  t = tail;
  if(index==length){
    return NULL;
  }else{
    for(int i=0; i<index; t = t->prev, i++){
      ;
    }
  }
  return t;
}

job_node* jobnode_deepcopy(job_node* n){
  job_node* j = new_node(n->index, n->status, n->pid, n->gpid,n->original_input, NULL,NULL);
  j->jmode = n->jmode;
  return j;
}

void free_joblist(job_node* head){
  job_node* l = head;
  while(l){
    job_node* temp = l;
    free(l->original_input);
    l = l->next;
    free(temp);
  }
}

int length(job_node* head){
  job_node* n = head;
  int length = 0;
  while(n){
    length++;
    n = n->next;
  }
  return length;
}