diff --git a/dfs.c b/dfs.c index fafd1830a7ccb9b6e2b86db6b811ec76ccbcb62e..28ddaed99bc83a29b541037edece010aef671a6b 100644 --- a/dfs.c +++ b/dfs.c @@ -1,29 +1,29 @@ #include "dfs.h" -void enqueue(struct directory *dr, struct list_head *stack) +void enqueue(struct directory *dr, struct list_head *list) { - if (list_empty(stack)) - INIT_LIST_HEAD(stack); - list_add(&dr->list, stack); + if (list_empty(list)) + INIT_LIST_HEAD(list); + list_add(&dr->list, list); } -struct directory *dequeue(struct list_head *stack) +struct directory *dequeue(struct list_head *list) { struct directory *dr; - if (list_empty(stack)) + if (list_empty(list)) return NULL; - dr = list_first_entry(stack, struct directory, list); + dr = list_first_entry(list, struct directory, list); list_del(&dr->list); return dr; } -bool search(char *path, struct list_head *visited) +bool search(char *path, struct list_head *list) { struct directory *dr; - list_for_each_entry(dr, visited, list) { + list_for_each_entry(dr, list, list) { if (strncmp(dr->path, path, 1024) == 0) return true; } diff --git a/dfs.h b/dfs.h index e37636fc725b5c4ca2018b5c1fc77cccb68dbc12..68cf79be9d58e3a2c4625c6d8c605eef73fc241a 100644 --- a/dfs.h +++ b/dfs.h @@ -7,9 +7,9 @@ struct directory { char *path; }; -void enqueue(struct directory *n, struct list_head *stack); -struct directory *dequeue(struct list_head *stack); -bool search(char *path, struct list_head *visited); -void clear_list(struct list_head *visited); -void print_list_dfs(struct list_head *collection_of_nodes_and_stuff); +void enqueue(struct directory *n, struct list_head *list); +struct directory *dequeue(struct list_head *list); +bool search(char *path, struct list_head *list); +void clear_list(struct list_head *list); +void print_list_dfs(struct list_head *list); #endif \ No newline at end of file