forked from BennettDixon/simple_shell
-
Notifications
You must be signed in to change notification settings - Fork 0
/
history.c
94 lines (76 loc) · 1.26 KB
/
history.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include "shell.h"
#include <stdio.h>
#include <stdlib.h>
/**
* *create_history_t - Creates a history node
*
* @command: Input string
*
* @set_p_no: "Index" of the node
*
* Return: Pointer to new node
*/
history_t *create_history_t(char *command, int set_p_no)
{
int size = 0;
int i = 0;
char *input = NULL;
history_t *node = NULL;
size = _strlen(command);
input = malloc(sizeof(char) * size + 1);
if (!input)
return (NULL);
while (command[i])
{
input[i] = command[i];
i++;
}
input[i] = '\0';
node = malloc(sizeof(history_t));
if (!node)
{
free(input);
return (NULL);
}
node->command = input;
node->priority_number = set_p_no;
node->next = NULL;
return (node);
}
/**
* free_history_node - Frees node in history queue
*
* @node: Pointer to node
*
* Return: none
*/
void free_history_node(history_t *node)
{
if (!node)
return;
if (node->command)
free(node->command);
free(node);
}
/**
* free_history_queue - Frees node in history queue
*
* @q: Pointer to queue
*
* Return: none
*/
void free_history_queue(his_q_t *q)
{
history_t *store = NULL, *temp = NULL;
if (!q)
return;
temp = q->front;
while (temp)
{
store = temp->next;
free_history_node(temp);
temp = store;
}
q->front = q->rear = NULL;
free(q);
}