dfs.c

#include "dfs.h"

void enqueue(struct directory *dr, struct list_head *stack)
{
	if (list_empty(stack))
		INIT_LIST_HEAD(stack);
	list_add(&dr->list, stack);
}

struct directory *dequeue(struct list_head *stack)
{
	struct directory *dr;

	if (list_empty(stack))
		return NULL;
	dr = list_first_entry(stack, struct directory, list);
	list_del(&dr->list);

	return dr;
}

bool search(char *path, struct list_head *visited)
{
	struct directory *dr;

	list_for_each_entry(dr, visited, list) {
		if (strncmp(dr->path, path, 1024) == 0)
			return true;
	}

	return false;
}

void clear_list(struct list_head *list)
{
	struct directory *dr, *tmp;
	print_list_dfs(list);

	if (list_empty(list))
		return;

	list_for_each_entry_safe(dr, tmp, list, list) {
		free(dr->path);
		list_del(&dr->list);
		free(dr);
	}
}

void print_list_dfs(struct list_head *list)
{
	struct directory *dr;

	if (list_empty(list))
		return;

	list_for_each_entry(dr, list, list) {
		printf("path: %s\n", dr->path);
	}
}