database.c

/*
 * File: database.c
 * Authors: Gabriel Graells, Arnau Blanco, Asfandyar Abbasi.
 * 
 * 
 * 
 * This file contains the "movedisk", "encapsulate" and "push" function which are 
 * used to create a new node edit data in new node and add the node in the list.
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#include "database.h"
#include "main.h"

void movedisk(int towerorg, int towerdest,stack *list, int depth){
    int n=list->disk;
    node_t* newnode=encapsulateinfo(n); //encapsulateinfo returns the node as a pointer.
    int aux;
    //copying the matrix of last move and storing it in the current move. 
    for(int c = 0; c < list->disk; c++){
        for(int i = 0; i < NTOWERS; i++){
            newnode->matrix[c][i]=list->top->matrix[c][i];
        }
    }
    //Making changes required in the matrix.
    for(int c = 0; c < list->disk; c++){
        //finding the disk to move
        if(list->top->matrix[c][towerorg]!=0){
            newnode->matrix[c][towerorg]=0;
            aux=list->top->matrix[c][towerorg]; //
            newnode->disk_moved = aux+1; //Disk to be moved stored in aux
            break;
        }  
    }
    for(int i = list->disk-1; i >= 0; i--){
        if(list->top->matrix[i][towerdest]==0){
            newnode->matrix[i][towerdest] = aux;
            break;
        }
    }
    newnode->tdest = towerdest;
    newnode->torg = towerorg;
    newnode->depth = depth;
    push(list,newnode);
}

void push(stack *l,node_t *newnode){  
    newnode->prev = l->top; //Newnode points now to old node
    l->top = newnode; //Top points now to new node
    newnode->move_num = l->num;
    l->num++;
    printf(LOGLISTOPS,newnode->move_num);
}


void createFirstNode(node_t *newnode, stack *list){
    for(int i=0; i< list->disk; i++){
        for(int j=0; j<NTOWERS; j++){
            if(j==0){
                newnode->matrix[i][j] = i+1;
            }else{
                newnode->matrix[i][j] = 0;
            }
        }
    }
    newnode->move_num=0;
    list->top=newnode;
    
}
node_t* encapsulateinfo(int n){
    node_t *newnode=(node_t *)malloc(sizeof(node_t));
    newnode->depth=0;
    newnode->prev=NULL;
    newnode->tdest=0;
    newnode->torg=0;
    newnode->matrix=(int **)malloc(n * sizeof(int *));
    for (int i=0; i<n; i++)
        newnode->matrix[i]= (int *)malloc(NTOWERS * sizeof(int));
    return newnode;
    
}