/* * Copyright (c) 2019 TAOS Data, Inc. * * This program is free software: you can use, redistribute, and/or modify * it under the terms of the GNU Affero General Public License, version 3 * or later ("AGPL"), as published by the Free Software Foundation. * * 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. * * You should have received a copy of the GNU Affero General Public License * along with this program. If not, see . */ #ifndef __FST_REGISTRY_H__ #define __FST_REGISTRY_H__ #include "index_fst_util.h" #include "tarray.h" #include "index_fst_node.h" typedef struct FstRegistryCell { CompiledAddr addr; FstBuilderNode *node; } FstRegistryCell; typedef struct FstRegistryCache { SArray *cells; uint32_t start; uint32_t end; } FstRegistryCache; typedef enum {FOUND, NOTFOUND, REJECTED} FstRegistryEntryState; typedef struct FstRegistryEntry { FstRegistryEntryState state; CompiledAddr addr; FstRegistryCell *cell; } FstRegistryEntry; // Registry relation function typedef struct FstRegistry { SArray *table; uint64_t tableSize; // num of rows uint64_t mruSize; // num of columns } FstRegistry; // FstRegistry* fstRegistryCreate(uint64_t tableSize, uint64_t mruSize); FstRegistryEntry* fstRegistryGetEntry(FstRegistry *registry, FstBuilderNode *bNode); uint64_t fstRegistryHash(FstRegistry *registry, FstBuilderNode *node); #endif