Tag
Hash :
5aa81393
Author :
Date :
2020-01-06T19:38:23
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167
/*
* Copyright (c) 2019, 2020 Stefan Sperling <stsp@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/queue.h>
#include <stdlib.h>
#include <string.h>
#include <sha1.h>
#include <stdio.h>
#include <zlib.h>
#include <limits.h>
#include <time.h>
#include "got_object.h"
#include "got_error.h"
#include "got_lib_delta.h"
#include "got_lib_inflate.h"
#include "got_lib_object.h"
#include "got_lib_delta_cache.h"
#ifndef nitems
#define nitems(_a) (sizeof(_a) / sizeof((_a)[0]))
#endif
struct got_delta_cache_element {
TAILQ_ENTRY(got_delta_cache_element) entry;
off_t delta_data_offset;
uint8_t *delta_data;
size_t delta_len;
};
TAILQ_HEAD(got_delta_cache_head, got_delta_cache_element);
struct got_delta_cache {
struct got_delta_cache_head entries;
int nelem;
int maxelem;
size_t maxelemsize;
int cache_search;
int cache_hit;
int cache_miss;
int cache_evict;
int cache_toolarge;
};
struct got_delta_cache *
got_delta_cache_alloc(int maxelem, size_t maxelemsize)
{
struct got_delta_cache *cache;
cache = calloc(1, sizeof(*cache));
if (cache == NULL)
return NULL;
TAILQ_INIT(&cache->entries);
cache->maxelem = maxelem;
cache->maxelemsize = maxelemsize;
return cache;
}
void
got_delta_cache_free(struct got_delta_cache *cache)
{
struct got_delta_cache_element *entry;
#ifdef GOT_OBJ_CACHE_DEBUG
fprintf(stderr, "%s: delta cache: %d elements, %d searches, %d hits, "
"%d missed, %d evicted, %d too large\n", getprogname(), cache->nelem,
cache->cache_search, cache->cache_hit, cache->cache_miss,
cache->cache_evict, cache->cache_toolarge);
#endif
while (!TAILQ_EMPTY(&cache->entries)) {
entry = TAILQ_FIRST(&cache->entries);
TAILQ_REMOVE(&cache->entries, entry, entry);
free(entry->delta_data);
free(entry);
}
free(cache);
}
#ifndef GOT_NO_OBJ_CACHE
static void
remove_least_used_element(struct got_delta_cache *cache)
{
struct got_delta_cache_element *entry;
if (cache->nelem == 0)
return;
entry = TAILQ_LAST(&cache->entries, got_delta_cache_head);
TAILQ_REMOVE(&cache->entries, entry, entry);
free(entry->delta_data);
free(entry);
cache->nelem--;
cache->cache_evict++;
}
#endif
const struct got_error *
got_delta_cache_add(struct got_delta_cache *cache,
off_t delta_data_offset, uint8_t *delta_data, size_t delta_len)
{
#ifdef GOT_NO_OBJ_CACHE
return got_error(GOT_ERR_NO_SPACE);
#else
struct got_delta_cache_element *entry;
if (delta_len > cache->maxelemsize) {
cache->cache_toolarge++;
return got_error(GOT_ERR_NO_SPACE);
}
if (cache->nelem >= cache->maxelem)
remove_least_used_element(cache);
entry = calloc(1, sizeof(*entry));
if (entry == NULL)
return got_error_from_errno("calloc");
entry->delta_data_offset = delta_data_offset;
entry->delta_data = delta_data;
entry->delta_len = delta_len;
TAILQ_INSERT_HEAD(&cache->entries, entry, entry);
cache->nelem++;
return NULL;
#endif
}
void
got_delta_cache_get(uint8_t **delta_data, size_t *delta_len,
struct got_delta_cache *cache, off_t delta_data_offset)
{
struct got_delta_cache_element *entry;
cache->cache_search++;
*delta_data = NULL;
*delta_len = 0;
TAILQ_FOREACH(entry, &cache->entries, entry) {
if (entry->delta_data_offset != delta_data_offset)
continue;
cache->cache_hit++;
if (entry != TAILQ_FIRST(&cache->entries)) {
TAILQ_REMOVE(&cache->entries, entry, entry);
TAILQ_INSERT_HEAD(&cache->entries, entry, entry);
}
*delta_data = entry->delta_data;
*delta_len = entry->delta_len;
return;
}
cache->cache_miss++;
}