fs_node
fs_node *node;
fs_node *newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *node;
fs_node *rootNode;
rootNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *next = ns->first->next;
fs_node *node;
fs_node *node;
fs_node *node;
fs_node *node;
fs_node *dir;
fs_node *newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *newNode;
newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *dir;
fs_node *newNode;
fs_node *dummy;
newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *node = _node->private_node;
fs_node *dir;
fs_node *newNode;
newNode=(fs_node *)malloc(sizeof(fs_node));
fs_node *olddir;
fs_node *newdir;
fs_node *dir;
fs_node *newNode;
fs_node *dummy;
newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *node;
fs_node *dir;
fs_node *newNode;
newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *current;
insert_node(fs_nspace *ns, fs_node *node)
fs_node *current;
fs_node *current;
fs_node *previous;
fs_node *current;
fs_node *dummy;
fs_node *base;
fs_node *newNode = (fs_node *)malloc(sizeof(fs_node));
fs_node *node;
extern void insert_node(fs_nspace *ns, fs_node *node);
struct fs_node *next;
struct fs_node *first;
typedef struct fs_node fs_node;
status_t duckduckgo_request_open(const char *query_string, struct fs_volume *volume, struct fs_node *query_node, struct duckduckgo_request **req)
struct fs_node *query_node; /* root folder for that query */
extern status_t duckduckgo_request_open(const char *query_string, struct fs_volume *volume, struct fs_node *query_node, struct duckduckgo_request **req);
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
static int compare_fs_node_by_recent_query_string(fs_node *node, char *query)
fs_node *qn, *dummy;
fs_node *root;
fs_node *q;
fs_node *q;
fs_node *n = NULL;
fs_node *node = cookie->node;
fs_node *qn = request->query_node;
fs_node *n;
root = malloc(sizeof(fs_node));
memset(root, 0, sizeof(fs_node));
struct fs_node *node;
static int compare_fs_node_by_vnid(fs_node *node, ino_t *id)
static int websearchfs_free_vnode(fs_volume *_volume, fs_node *node)
fs_node *node = (fs_node *)_node->private_node;
fs_node *n;
n = (fs_node *)SLL_FIND(ns->nodes, nlnext, (sll_compare_func)compare_fs_node_by_vnid, (void *)&vnid);
fs_node *node = (fs_node *)_node->private_node;
static int compare_fs_node_by_name(fs_node *node, char *name)
fs_node *node = (fs_node *)_node->private_node;
fs_node *base = _base->private_node;
fs_node *n, *dummy;
n = (fs_node *)SLL_FIND(base->children, next,
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *n = NULL;
fs_node *parent = node->parent;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
static int websearchfs_create_gen(fs_volume *_volume, fs_node *dir, const char *name, int omode, int perms, ino_t *vnid, fs_node **node, struct attr_entry *iattrs, bool mkdir, bool uniq);
static int websearchfs_free_vnode(fs_volume *_volume, fs_node *node);
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
static int websearchfs_create_gen(fs_volume *_volume, fs_node *dir, const char *name, int omode, int perms, ino_t *vnid, fs_node **node, struct attr_entry *iattrs, bool mkdir, bool uniq)
fs_node *n;
n = (fs_node *)SLL_FIND(dir->children, next,
n = (fs_node *)SLL_FIND(dir->children, next,
n = malloc(sizeof(fs_node));
memset(n, 0, sizeof(fs_node));
fs_node *dir = (fs_node *)_dir->private_node;
fs_node *n;
static int websearchfs_unlink_gen(fs_volume *_volume, fs_node *dir, const char *name)
fs_node *n;
n = (fs_node *)SLL_FIND(dir->children, next,
return websearchfs_unlink_gen(_volume, (fs_node *)_dir->private_node, name);
fs_node *dir = (fs_node *)_dir->private_node;
static int websearchfs_unlink_node_rec(fs_volume *_volume, fs_node *node)
fs_node *n;
fs_node *dir = ns->root;
fs_node *node = (fs_node *)_node->private_node;
fs_node *n;// *dummy;
fs_node *dir = (fs_node *)_dir->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
fs_node *node = (fs_node *)_node->private_node;
struct fs_node *node;
typedef struct fs_node fs_node;
int websearchfs_event(fs_nspace *ns, fs_node *node, int flags);
struct fs_node *nlnext; /* node list */
struct fs_node *qnext; /* query list */
struct fs_node *next; /* next in folder */
struct fs_node *parent, *children;
struct fs_node *root; /* fast access for stat time change */
struct fs_node *nodes;
struct fs_node *queries;