mirror of
https://github.com/Rockbox/rockbox.git
synced 2026-01-22 01:30:35 -05:00
969a2b65c7
This is a tool written in C which does basically the same job as regtools' headergen_v2, but using a new input format which is less verbose than XML. In the interests of simplicity it omits some features that regtools does support, like variant registers or the SoC selector stuff so it cannot completely replace regtools on the i.MX platforms that use these features. RegGen doesn't generate API macros like regtools does; instead these are expected to be maintained by hand, since it's arguably easier to do that way. Since RegGen has no dependencies beyond a C compiler it can be integrated with the build system without adding any new build time dependencies. This will allow generating headers automatically, which is a substantial improvement over running headergen_v2 by hand and committing the generated output. The RegGen tool itself is licensed as GPLv3+, but generated headers can be licensed as the user chooses. Change-Id: If18f9577f8f4df6e2c97c1665b725773dd5466f0
123 lines
3 KiB
C
123 lines
3 KiB
C
/*
|
|
* This file is part of RegGen -- register definition generator
|
|
* Copyright (C) 2025 Aidan MacDonald
|
|
*
|
|
* 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/>.
|
|
*/
|
|
#include "hashmap.h"
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
static size_t hash_string(const char *str)
|
|
{
|
|
/* DJB hash */
|
|
size_t hash = 5381;
|
|
while (*str)
|
|
hash = (33 * hash) + *str++;
|
|
|
|
return hash;
|
|
}
|
|
|
|
static void hashmap_grow(struct hashmap *map)
|
|
{
|
|
struct hash_bucket *oldbuckets = map->buckets;
|
|
size_t oldcap = map->capacity;
|
|
|
|
map->capacity = oldcap ? oldcap*2 : 32;
|
|
map->buckets = calloc(map->capacity, sizeof(*map->buckets));
|
|
map->size = 0;
|
|
|
|
for (size_t i = 0; i < oldcap; ++i)
|
|
{
|
|
struct hash_bucket *bucket = &oldbuckets[i];
|
|
if (bucket->key == NULL)
|
|
continue;
|
|
|
|
hashmap_insert(map, bucket->key, bucket->value);
|
|
}
|
|
|
|
free(oldbuckets);
|
|
}
|
|
|
|
void hashmap_free(struct hashmap *map)
|
|
{
|
|
free(map->buckets);
|
|
memset(map, 0, sizeof(*map));
|
|
}
|
|
|
|
int hashmap_insert(struct hashmap *map, const char *key, void *value)
|
|
{
|
|
if (map->capacity == 0)
|
|
hashmap_grow(map);
|
|
|
|
size_t hash = hash_string(key);
|
|
size_t startpos = hash % map->capacity;
|
|
size_t pos = startpos;
|
|
for (;;)
|
|
{
|
|
struct hash_bucket *bucket = &map->buckets[pos];
|
|
if (bucket->key == NULL)
|
|
{
|
|
bucket->key = key;
|
|
bucket->value = value;
|
|
map->size++;
|
|
return 0;
|
|
}
|
|
else if (!strcmp(key, bucket->key))
|
|
{
|
|
return HASHERR_EXISTS;
|
|
}
|
|
|
|
if (++pos == map->capacity)
|
|
pos = 0;
|
|
|
|
/* no free space; grow and try again */
|
|
if (pos == startpos)
|
|
{
|
|
hashmap_grow(map);
|
|
startpos = hash % map->capacity;
|
|
pos = startpos;
|
|
}
|
|
}
|
|
}
|
|
|
|
void *hashmap_lookup(struct hashmap *map, const char *key)
|
|
{
|
|
if (map->capacity == 0)
|
|
return NULL;
|
|
|
|
size_t hash = hash_string(key);
|
|
size_t startpos = hash % map->capacity;
|
|
size_t pos = startpos;
|
|
for (;;)
|
|
{
|
|
struct hash_bucket *bucket = &map->buckets[pos];
|
|
if (bucket->key == NULL)
|
|
return NULL;
|
|
|
|
if (!strcmp(key, bucket->key))
|
|
return bucket->value;
|
|
|
|
if (++pos == map->capacity)
|
|
pos = 0;
|
|
|
|
if (pos == startpos)
|
|
return NULL;
|
|
}
|
|
}
|
|
|
|
size_t hashmap_size(struct hashmap *map)
|
|
{
|
|
return map->size;
|
|
}
|