1
0
mirror of https://gitlab.com/klmp200/fish.git synced 2024-11-14 12:53:20 +00:00
fish/fish_shell/fish_globbing.c

290 lines
5.2 KiB
C
Raw Normal View History

// Created by Arthur Amalvy
2017-05-15 12:32:41 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <dirent.h>
2017-05-16 05:32:19 +00:00
#include <string.h>
2017-05-15 12:32:41 +00:00
#include "fish_core.h"
#include "fish_globbing.h"
2017-05-16 05:32:19 +00:00
WordList * fishExpand(WordList *wordList) {
2017-05-15 12:32:41 +00:00
2017-05-28 15:25:04 +00:00
if(wordList->size > 1){
2017-05-15 12:32:41 +00:00
2017-05-27 15:36:55 +00:00
int i;
WordList* newWordList = createWordList();// creating the list to return
2017-05-15 12:32:41 +00:00
2017-05-27 15:36:55 +00:00
if(newWordList == NULL){//crash when the allocation is unsuccessful
2017-05-16 05:32:19 +00:00
crash();
2017-05-27 15:36:55 +00:00
}
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
addEndWordList(newWordList, wordList->first->word);//copy the command into the returning word list
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
WordListElement* tempElement = wordList->first->next; //temporary nav element
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
for(i=1; i<wordList->size; i++){
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
//TODO : optimize the stringContains() function to test for a list of characters
//test if we have to expand a string or not, for optimization purposes
if(stringContains(tempElement->word, '*') || stringContains(tempElement->word, '?')){
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
concatWordList(newWordList, expandWord(tempElement->word));
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
}
//If we dont have to expand, add the current word unchanged to the new list
else{
addEndWordList(newWordList, tempElement->word);
}
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
tempElement = tempElement->next;
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
}
freeWordList(wordList);
2017-05-29 13:19:52 +00:00
//TODO : move this in recursion in case multiples commands are in the same line
if(newWordList->size == 1){
addEndWordList(newWordList, (char*) ERROR_STRING);
}
2017-05-16 05:32:19 +00:00
return newWordList;
2017-05-27 15:36:55 +00:00
2017-05-16 05:32:19 +00:00
}
2017-05-28 15:25:04 +00:00
else return wordList;
2017-05-15 12:32:41 +00:00
2017-05-27 15:36:55 +00:00
}
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
WordList* expandWord(char* word){
2017-05-16 05:32:19 +00:00
2017-05-28 20:02:05 +00:00
if(!stringContains(word, '/')){
2017-05-28 15:25:04 +00:00
2017-05-28 20:02:05 +00:00
return getFiles((char*) "./", word);
}
else{
WordList* pathList = splitWordIntoList(word, '/');
WordList* expandedArgsList = createWordList();
if (expandedArgsList == NULL) crash();
WordListElement* tempElement;
int i;
2017-05-29 13:19:52 +00:00
if(pathList->size >= 1){
tempElement = pathList->first;
for(i=0; i < pathList->size; i++){
printf("\nBASE PATH %s\n", tempElement->word);
char* tempPath = getPath(tempElement->word);
printf("\nPATH : %s\n", tempPath);
char* tempFileName = getFileName(tempElement->word);
printf("\nFILENAME : %s\n", tempFileName);
concatWordList(expandedArgsList, getFiles(tempPath, tempFileName));
printWordList(expandedArgsList);
tempElement = tempElement->next;
free(tempPath);
free(tempFileName);
}
}
freeWordList(pathList);
return expandedArgsList;
//return getFiles(word, (char*) "*");//temporary
2017-05-28 20:02:05 +00:00
}
2017-05-28 15:25:04 +00:00
2017-05-16 05:32:19 +00:00
2017-05-27 15:36:55 +00:00
}
2017-05-16 05:32:19 +00:00
char* getFileName(char* string){
2017-05-16 05:32:19 +00:00
if(!stringContains(string, '/')){
return string;
}
else{
int i = 0;
while(string[i] != '/'){
i++;
}
return strndup(string + i + 1, strlen(string) - i);
}
}
//get path of a file
char* getPath(char* string){
if(!stringContains(string, '/')){
return string;
}
else{
int i = strlen(string) - 1;
while(i != -1 && string[i] != '/'){
i = i-1;
}
return strndup(string, i + 1);
}
}
2017-05-16 05:32:19 +00:00
2017-05-15 12:32:41 +00:00
2017-05-28 20:02:05 +00:00
WordList* getFiles(char* path, char* wildcardedString){
2017-05-15 12:32:41 +00:00
DIR* directory;
dirent* dir;
2017-05-16 05:32:19 +00:00
WordList* files = createWordList();
if(files == NULL) crash();
2017-05-15 12:32:41 +00:00
if((directory = opendir(path)) != NULL){
while((dir = readdir(directory)) != NULL){
2017-05-28 20:02:05 +00:00
if(strcmp(dir->d_name, ".") && strcmp(dir->d_name, "..") && wildcardedStringMatches(wildcardedString, dir->d_name)){//sorry strcmp but I dont like you :(
2017-05-15 12:32:41 +00:00
char* filePath = trueStrcat(path, dir->d_name);
2017-05-28 20:02:05 +00:00
addEndWordList(files, filePath);
free(filePath);
2017-05-15 17:10:46 +00:00
2017-05-16 05:32:19 +00:00
}
2017-05-15 12:32:41 +00:00
}
2017-05-28 15:25:04 +00:00
closedir(directory); //YY U LEAK MEMORY ? NOT ON MY WATCH
2017-05-15 12:32:41 +00:00
}
return files;
}
2017-05-28 20:02:05 +00:00
int wildcardedStringMatches(char* string1, char* string2){//TODO
int i = 0;
char tempIChar;
int j = 0;
if(string1 != NULL && string2 != NULL){
while(string1[i] != '\0' && string2[j] != '\0'){
if(string1[i] == '*'){
tempIChar = string1[i+1];
while(string2[j] != tempIChar){
j++;
if(string2[j] == '\0' && tempIChar == '\0'){
return 1;
}
}
i++;
}
if(string1[i] != string2[j] && string1[i] != '?'){
return 0;
}
i++;
j++;
}
if(string1[i] == '\0' && string2[j] == '\0'){
return 1;
}
else{
return 0;
}
}
else{
2017-05-29 13:19:52 +00:00
printf("fish : Warning : fuck you, strings are considered null");
2017-05-28 20:02:05 +00:00
crash();
return 0;
}
}
2017-05-29 13:19:52 +00:00
//beware : will purposedly ignore the first occurence of the character
WordList* splitWordIntoList(char* string, char splitChar){
if(stringContains(string, '/')){
int i = 0;
int mark = 0;
int finished = 0; //boolean
int firstEncounter = 0; //boolean
2017-05-29 13:19:52 +00:00
WordList* newWordList = createWordList();
if(newWordList == NULL) crash();
2017-05-29 13:19:52 +00:00
while(!finished){
if(string[i] == splitChar || string[i] == '\0'){
if(!firstEncounter){
firstEncounter = 1;
}
else{
char* tempStr = strndup(string + mark, i - mark);
2017-05-28 20:02:05 +00:00
2017-05-29 13:19:52 +00:00
if(tempStr == NULL){
crash();
}
addEndWordList(newWordList, tempStr);
free(tempStr);
mark = i;
if(string[i] == '\0'){
finished = 1;
}
}
}
i++;
}
return newWordList;
}
else{
WordList* newWordList = createWordList();
addEndWordList(newWordList, string);
return newWordList;
}
}