-
Notifications
You must be signed in to change notification settings - Fork 0
/
history.c
138 lines (115 loc) · 3.36 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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
#include "header.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdbool.h>
int get(Node* arr, int id, char** token) {
int i = 0;
while (arr[i].command != NULL) {
if (arr[i].id == id) {
for (int j = 0; j < arr[i].no_token; j++) {
if (token[j] != NULL) {
strcpy(token[j], arr[i].command[j]);
} else {
token[j] = arr[i].command[j];
}
}
int tokenCount = arr[i].no_token;
char *tempNewToken[512];
recheck_aliases(token, tempNewToken, tokenCount);
return 1;
}
i++;
}
printf("Error. ID %d is not found in history\n", id);
return 0;
}
void addNode(Node* arr, int id, int pos, char **token, int no_token) {
char **command = malloc(sizeof(char*) * no_token);
for (int i = 0; i < no_token; i++) {
command[i] = malloc(sizeof(char) * strlen(token[i]));
strcpy(command[i], token[i]);
}
Node next = {id, command, no_token};
arr[pos] = next;
}
void printNodes(Node* arr) {
int count = 0;
int index = getEarliest(arr);
printf("History:\n\n");
while (arr[index].command != NULL && count < 20) {
printf("%d\t", arr[index].id);
for (int j = 0; j < arr[index].no_token; j++) {
printf("%s ", arr[index].command[j]);
}
printf("\n");
count++;
index = (index + 1) % 20;
}
}
int getEarliest(Node* arr) {
int i = 1;
int earliest = arr[0].id;
int index = 0;
while (arr[i].command != NULL && i < 20) {
if (arr[i].id < earliest) {
earliest = arr[i].id;
index = i;
}
i++;
}
return index;
}
void saveHistory(Node* arr) {
FILE *historyFile;
char *historyFilePath = getenv("HOME");
char historyFilePathCopy[256];
strcpy(historyFilePathCopy, historyFilePath);
strcat(historyFilePathCopy, "/.hist_list");
historyFile = fopen(historyFilePathCopy, "w");
if (historyFile == NULL) {
return;
}
int count = 0;
int index = getEarliest(arr);
while (arr[index].command != NULL && count < 20) {
fprintf(historyFile, "%d ", arr[index].id);
for (int j = 0; j < arr[index].no_token; j++) {
fprintf(historyFile, "%s ", arr[index].command[j]);
}
fprintf(historyFile, "\n");
count++;
index = (index + 1) % 20;
}
fclose(historyFile);
}
void loadHistory(Node* arr, int *count, int *pos) {
char input[256];
int id = 0;
char command[256];
FILE *historyFile;
bool check = true;
historyFile = fopen(".hist_list", "r");
if (historyFile == NULL) {
return;
}
const char delims[] = "\t|><&; ";
while (fgets(input, sizeof input, historyFile)) {
sscanf(input, "%d %[^\n]", &id, command);
int tokenCount = 0;
char *token[512];
token[tokenCount] = strtok(command, delims);
while (token[tokenCount] != NULL) {
tokenCount++;
token[tokenCount] = strtok(NULL, delims);
}
if (check) {
*count = id;
check = false;
}
addNode(arr, *count, *pos, token, tokenCount);
*count = *count + 1;
*pos = (*pos + 1) % 20;
}
fclose(historyFile);
}