168 lines
3.9 KiB
C
Executable File
168 lines
3.9 KiB
C
Executable File
/*
|
|
* Copyright 2006 Richard Wilson <info@tinct.net>
|
|
* Copyright 2008 Chris Young <chris@unsatisfactorysoftware.co.uk>
|
|
*
|
|
* This file is part of NetSurf, http://www.netsurf-browser.org/
|
|
*
|
|
* NetSurf is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; version 2 of the License.
|
|
*
|
|
* NetSurf is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
/** \file
|
|
* Cookies (implementation).
|
|
*/
|
|
|
|
#include <string.h>
|
|
#include "content/urldb.h"
|
|
#include "desktop/cookies.h"
|
|
#include "desktop/tree.h"
|
|
#include "utils/messages.h"
|
|
#include "utils/log.h"
|
|
#include "amiga/cookies.h"
|
|
#include <proto/exec.h>
|
|
#include <assert.h>
|
|
#include "utils/utils.h"
|
|
|
|
static bool cookies_init;
|
|
|
|
struct node *ami_cookies_find(const char *url);
|
|
|
|
/**
|
|
* Initialise cookies tree
|
|
*/
|
|
void ami_cookies_initialise(void)
|
|
{
|
|
if(cookies_tree) return;
|
|
|
|
/* Create an empty tree */
|
|
cookies_tree = AllocVec(sizeof(struct tree),MEMF_CLEAR | MEMF_PRIVATE);
|
|
if (!cookies_tree) {
|
|
warn_user("NoMemory", 0);
|
|
return;
|
|
}
|
|
cookies_tree->root = tree_create_folder_node(NULL, "Root");
|
|
if (!cookies_tree->root) {
|
|
warn_user("NoMemory", 0);
|
|
FreeVec(cookies_tree);
|
|
cookies_tree = NULL;
|
|
}
|
|
cookies_tree->root->expanded = true;
|
|
cookies_tree->movable = false;
|
|
cookies_tree->no_drag = true;
|
|
|
|
cookies_init = true;
|
|
urldb_iterate_cookies(cookies_update);
|
|
cookies_init = false;
|
|
tree_initialise(cookies_tree);
|
|
}
|
|
|
|
/**
|
|
* Perform cookie addition
|
|
*
|
|
* \param data Cookie data for a domain, or NULL
|
|
* \return true (for urldb_iterate_entries)
|
|
*/
|
|
bool cookies_update(const char *domain, const struct cookie_data *data)
|
|
{
|
|
struct node *parent;
|
|
struct node *node = NULL;
|
|
struct node *child;
|
|
struct node *add;
|
|
const struct cookie_data *cookie = NULL;
|
|
bool expanded;
|
|
|
|
assert(domain);
|
|
|
|
/* check if we're a domain, and add get the first cookie */
|
|
if (data)
|
|
for (cookie = data; cookie->prev; cookie = cookie->prev);
|
|
|
|
if (!cookies_init) {
|
|
node = ami_cookies_find(domain);
|
|
if (node) {
|
|
/* mark as deleted so we don't remove the cookies */
|
|
expanded = node->expanded;
|
|
for (child = node->child; child; child = child->next)
|
|
child->deleted = true;
|
|
if (node->child)
|
|
tree_delete_node(cookies_tree, node->child,
|
|
true);
|
|
/* deleting will have contracted our node */
|
|
node->expanded = expanded;
|
|
}
|
|
if (!data) {
|
|
if (!node)
|
|
return true;
|
|
tree_delete_node(cookies_tree, node, false);
|
|
tree_handle_node_changed(cookies_tree,
|
|
cookies_tree->root, true, false);
|
|
return true;
|
|
}
|
|
}
|
|
|
|
if (!node) {
|
|
for (parent = cookies_tree->root->child; parent;
|
|
parent = parent->next) {
|
|
if (strcmp(domain, parent->data.text) == 0)
|
|
break;
|
|
}
|
|
if (!parent) {
|
|
node = tree_create_folder_node(cookies_tree->root,
|
|
domain);
|
|
} else {
|
|
node = parent;
|
|
}
|
|
}
|
|
if (!node)
|
|
return true;
|
|
node->editable = false;
|
|
|
|
for (; cookie; cookie = cookie->next) {
|
|
add = tree_create_cookie_node(node, cookie);
|
|
if (add && !cookies_init)
|
|
tree_handle_node_changed(cookies_tree, add,
|
|
true, false);
|
|
}
|
|
if (!cookies_init) {
|
|
tree_handle_node_changed(cookies_tree, node,
|
|
true, false);
|
|
/*
|
|
tree_redraw_area(cookies_tree,
|
|
node->box.x - NODE_INSTEP,
|
|
0, NODE_INSTEP, 16384);
|
|
*/
|
|
}
|
|
return true;
|
|
}
|
|
|
|
/**
|
|
* Find an entry in the cookie tree
|
|
*
|
|
* \param url The URL to find
|
|
* \return Pointer to node, or NULL if not found
|
|
*/
|
|
struct node *ami_cookies_find(const char *url)
|
|
{
|
|
struct node *node;
|
|
|
|
for (node = cookies_tree->root->child; node; node = node->next) {
|
|
if (!strcmp(url, node->data.text))
|
|
return node;
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
void ami_cookies_free()
|
|
{
|
|
FreeVec(cookies_tree);
|
|
}
|