catgirl/cache.c

227 lines
5.9 KiB
C
Raw Normal View History

/* Copyright (C) 2020, 2022 June McEnroe <june@causal.agency>
*
* This program 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, either version 3 of the License, or
* (at your option) any later version.
*
* This program 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 <https://www.gnu.org/licenses/>.
*
* Additional permission under GNU GPL version 3 section 7:
*
* If you modify this Program, or any covered work, by linking or
* combining it with OpenSSL (or a modified version of that library),
* containing parts covered by the terms of the OpenSSL License and the
* original SSLeay license, the licensors of this Program grant you
* additional permission to convey the resulting work. Corresponding
* Source for a non-source form of such a combination shall include the
* source code for the parts of OpenSSL used as well as that of the
* covered work.
*/
#include <err.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sysexits.h>
#include "chat.h"
struct Node {
uint id;
char *key;
struct Entry entry;
struct Node *prev;
struct Node *next;
};
static const struct Entry DefaultEntry = { .color = Default };
static uint gen;
static struct Node *head;
static struct Node *tail;
static struct Node *alloc(uint id, const char *key) {
struct Node *node = calloc(1, sizeof(*node));
if (!node) err(EX_OSERR, "calloc");
node->id = id;
node->key = strdup(key);
node->entry = DefaultEntry;
if (!node->key) err(EX_OSERR, "strdup");
return node;
}
static struct Node *detach(struct Node *node) {
if (node->prev) node->prev->next = node->next;
if (node->next) node->next->prev = node->prev;
if (head == node) head = node->next;
if (tail == node) tail = node->prev;
node->prev = NULL;
node->next = NULL;
return node;
}
static struct Node *prepend(struct Node *node) {
node->prev = NULL;
node->next = head;
if (head) head->prev = node;
head = node;
tail = (tail ?: node);
return node;
}
static struct Node *append(struct Node *node) {
node->next = NULL;
node->prev = tail;
if (tail) tail->next = node;
tail = node;
head = (head ?: node);
return node;
}
static struct Node *find(uint id, const char *key) {
for (struct Node *node = head; node; node = node->next) {
if (node->id != id) continue;
if (strcmp(node->key, key)) continue;
return node;
}
return NULL;
}
static struct Node *insert(bool touch, uint id, const char *key) {
struct Node *node = find(id, key);
if (node && touch) {
return prepend(detach(node));
} else if (node) {
return node;
} else if (touch) {
return prepend(alloc(id, key));
} else {
return append(alloc(id, key));
}
}
const struct Entry *cacheGet(uint id, const char *key) {
struct Node *node = find(id, key);
return (node ? &node->entry : &DefaultEntry);
}
struct Entry *cacheInsert(bool touch, uint id, const char *key) {
return &insert(touch, id, key)->entry;
}
void cacheReplace(bool touch, const char *old, const char *new) {
struct Node *next = NULL;
for (struct Node *node = head; node; node = next) {
next = node->next;
if (strcmp(node->key, old)) continue;
free(node->key);
node->key = strdup(new);
if (!node->key) err(EX_OSERR, "strdup");
if (touch) prepend(detach(node));
}
}
void cacheRemove(uint id, const char *key) {
gen++;
struct Node *next = NULL;
for (struct Node *node = head; node; node = next) {
next = node->next;
if (id && node->id != id) continue;
if (strcmp(node->key, key)) continue;
detach(node);
free(node->key);
free(node);
if (id) break;
}
}
void cacheClear(uint id) {
gen++;
struct Node *next = NULL;
for (struct Node *node = head; node; node = next) {
next = node->next;
if (node->id != id) continue;
detach(node);
free(node->key);
free(node);
}
}
const char *cacheComplete(struct Cursor *curs, uint id, const char *prefix) {
size_t len = strlen(prefix);
if (curs->gen != gen) curs->node = NULL;
for (
curs->gen = gen, curs->node = (curs->node ? curs->node->next : head);
curs->node;
curs->node = curs->node->next
) {
if (curs->node->id && curs->node->id != id) continue;
if (strncasecmp(curs->node->key, prefix, len)) continue;
curs->entry = &curs->node->entry;
return curs->node->key;
}
return NULL;
}
const char *cacheSearch(struct Cursor *curs, uint id, const char *substr) {
if (curs->gen != gen) curs->node = NULL;
for (
curs->gen = gen, curs->node = (curs->node ? curs->node->next : head);
curs->node;
curs->node = curs->node->next
) {
if (curs->node->id && curs->node->id != id) continue;
if (!strstr(curs->node->key, substr)) continue;
curs->entry = &curs->node->entry;
return curs->node->key;
}
return NULL;
}
const char *cacheNextKey(struct Cursor *curs, uint id) {
if (curs->gen != gen) curs->node = NULL;
for (
curs->gen = gen, curs->node = (curs->node ? curs->node->next : head);
curs->node;
curs->node = curs->node->next
) {
if (curs->node->id != id) continue;
curs->entry = &curs->node->entry;
return curs->node->key;
}
return NULL;
}
uint cacheNextID(struct Cursor *curs, const char *key) {
if (curs->gen != gen) curs->node = NULL;
for (
curs->gen = gen, curs->node = (curs->node ? curs->node->next : head);
curs->node;
curs->node = curs->node->next
) {
if (!curs->node->id) continue;
if (strcmp(curs->node->key, key)) continue;
curs->entry = &curs->node->entry;
return curs->node->id;
}
return None;
}
void cacheAccept(struct Cursor *curs) {
if (curs->gen == gen && curs->node) {
prepend(detach(curs->node));
}
curs->node = NULL;
}
void cacheReject(struct Cursor *curs) {
curs->node = NULL;
}