deleting old files for trie library
This commit is contained in:
Ricardo Rocha
parent
d9cdee931c
commit
cd2902f0d8
@ -507,7 +507,7 @@ void core_trie_print(TrNode node, void (*print_function)(TrNode)) {
|
|||||||
DATA_PRINT_FUNCTION = print_function;
|
DATA_PRINT_FUNCTION = print_function;
|
||||||
if (TrNode_child(node)) {
|
if (TrNode_child(node)) {
|
||||||
YAP_Int arity[100];
|
YAP_Int arity[100];
|
||||||
char str[1000];
|
char str[10000];
|
||||||
arity[0] = 0;
|
arity[0] = 0;
|
||||||
traverse_and_print(TrNode_child(node), arity, str, 0, TRIE_PRINT_NORMAL);
|
traverse_and_print(TrNode_child(node), arity, str, 0, TRIE_PRINT_NORMAL);
|
||||||
} else
|
} else
|
||||||
|
|||||||
@ -46,7 +46,7 @@
|
|||||||
#define TRIE_PRINT_FLOAT2 2
|
#define TRIE_PRINT_FLOAT2 2
|
||||||
#define TRIE_PRINT_FLOAT_END 3
|
#define TRIE_PRINT_FLOAT_END 3
|
||||||
|
|
||||||
#define BASE_AUXILIARY_TERM_STACK_SIZE 1000
|
#define BASE_AUXILIARY_TERM_STACK_SIZE 10000
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|||||||
@ -1,242 +0,0 @@
|
|||||||
/******************************************
|
|
||||||
* File: tries.h *
|
|
||||||
* Author: Ricardo Rocha *
|
|
||||||
* Comments: Tries module for yap *
|
|
||||||
******************************************/
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* --------------------------- */
|
|
||||||
/* Defines */
|
|
||||||
/* --------------------------- */
|
|
||||||
|
|
||||||
/* WARNING: the following macros need Yap tag scheme from file 'Tags_32LowTag' */
|
|
||||||
#define ApplTag 1
|
|
||||||
#define PairInitTag 3
|
|
||||||
#define PairEndTag 19 /* 0x13 */
|
|
||||||
#define CommaInitTag 35 /* 0x23 */
|
|
||||||
#define CommaEndTag 51 /* 0x33 */
|
|
||||||
#define FloatInitTag 67 /* 0x43 */
|
|
||||||
#define FloatEndTag 83 /* 0x53 */
|
|
||||||
|
|
||||||
#define TERM_STACK_SIZE 1000
|
|
||||||
#define MODE_STANDARD 0
|
|
||||||
#define MODE_REVERSE 1
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* --------------------------- */
|
|
||||||
/* Structs */
|
|
||||||
/* --------------------------- */
|
|
||||||
|
|
||||||
struct global_trie_stats {
|
|
||||||
int memory_in_use;
|
|
||||||
int memory_max_used;
|
|
||||||
int nodes_in_use;
|
|
||||||
int nodes_max_used;
|
|
||||||
int hashes_in_use;
|
|
||||||
int hashes_max_used;
|
|
||||||
int buckets_in_use;
|
|
||||||
int buckets_max_used;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define MEMORY_IN_USE (GLOBAL_STATS.memory_in_use)
|
|
||||||
#define MEMORY_MAX_USED (GLOBAL_STATS.memory_max_used)
|
|
||||||
#define NODES_IN_USE (GLOBAL_STATS.nodes_in_use)
|
|
||||||
#define NODES_MAX_USED (GLOBAL_STATS.nodes_max_used)
|
|
||||||
#define HASHES_IN_USE (GLOBAL_STATS.hashes_in_use)
|
|
||||||
#define HASHES_MAX_USED (GLOBAL_STATS.hashes_max_used)
|
|
||||||
#define BUCKETS_IN_USE (GLOBAL_STATS.buckets_in_use)
|
|
||||||
#define BUCKETS_MAX_USED (GLOBAL_STATS.buckets_max_used)
|
|
||||||
|
|
||||||
struct local_trie_stats{
|
|
||||||
int entries;
|
|
||||||
int nodes;
|
|
||||||
int virtual_nodes;
|
|
||||||
};
|
|
||||||
|
|
||||||
#define TRIE_ENTRIES (LOCAL_STATS.entries)
|
|
||||||
#define TRIE_NODES (LOCAL_STATS.nodes)
|
|
||||||
#define TRIE_VIRTUAL_NODES (LOCAL_STATS.virtual_nodes)
|
|
||||||
|
|
||||||
typedef struct trie_node {
|
|
||||||
YAP_Term entry;
|
|
||||||
struct trie_node *parent;
|
|
||||||
struct trie_node *child;
|
|
||||||
struct trie_node *next;
|
|
||||||
#ifdef ALLOW_REMOVE_TRIE
|
|
||||||
struct trie_node *previous;
|
|
||||||
int hits;
|
|
||||||
#endif /* ALLOW_REMOVE_TRIE */
|
|
||||||
} *TrNode;
|
|
||||||
|
|
||||||
#define TrNode_entry(X) ((X)->entry)
|
|
||||||
#define TrNode_parent(X) ((X)->parent)
|
|
||||||
#define TrNode_child(X) ((X)->child)
|
|
||||||
#define TrNode_next(X) ((X)->next)
|
|
||||||
#define TrNode_previous(X) ((X)->previous)
|
|
||||||
#define TrNode_hits(X) ((X)->hits)
|
|
||||||
|
|
||||||
typedef struct trie_hash {
|
|
||||||
YAP_Term entry; /* for compatibility with the trie_node data structure */
|
|
||||||
int number_of_buckets;
|
|
||||||
int number_of_nodes;
|
|
||||||
struct trie_node **buckets;
|
|
||||||
struct trie_hash *next;
|
|
||||||
struct trie_hash *previous;
|
|
||||||
} *TrHash;
|
|
||||||
|
|
||||||
#define TrHash_mark(X) ((X)->entry)
|
|
||||||
#define TrHash_num_buckets(X) ((X)->number_of_buckets)
|
|
||||||
#define TrHash_seed(X) ((X)->number_of_buckets - 1)
|
|
||||||
#define TrHash_num_nodes(X) ((X)->number_of_nodes)
|
|
||||||
#define TrHash_buckets(X) ((X)->buckets)
|
|
||||||
#define TrHash_bucket(X,N) ((X)->buckets + N)
|
|
||||||
#define TrHash_next(X) ((X)->next)
|
|
||||||
#define TrHash_previous(X) ((X)->previous)
|
|
||||||
|
|
||||||
#define TYPE_TR_NODE struct trie_node
|
|
||||||
#define TYPE_TR_HASH struct trie_hash
|
|
||||||
#define SIZEOF_TR_NODE sizeof(TYPE_TR_NODE)
|
|
||||||
#define SIZEOF_TR_HASH sizeof(TYPE_TR_HASH)
|
|
||||||
#define SIZEOF_TR_BUCKET sizeof(TYPE_TR_NODE *)
|
|
||||||
|
|
||||||
#define AS_TR_NODE_NEXT(ADDRESS) (TrNode)((int)(ADDRESS) - sizeof(YAP_Term) - sizeof(int) - 2 * sizeof(struct trie_node *))
|
|
||||||
#define AS_TR_HASH_NEXT(ADDRESS) (TrHash)((int)(ADDRESS) - sizeof(YAP_Term) - 2 * sizeof(int) - sizeof(struct trie_node **))
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* --------------------------- */
|
|
||||||
/* Macros */
|
|
||||||
/* --------------------------- */
|
|
||||||
|
|
||||||
#define MkTrieVar(INDEX) ((INDEX) << 4)
|
|
||||||
#define TrieVarIndex(TERM) ((TERM) >> 4)
|
|
||||||
#define IsTrieVar(TERM) ((YAP_Term *)(TERM) > stack_vars && (YAP_Term *)(TERM) <= stack_vars_base)
|
|
||||||
|
|
||||||
#define HASH_MARK ((YAP_Term) MkTrieVar(TERM_STACK_SIZE))
|
|
||||||
#define BASE_HASH_BUCKETS 64
|
|
||||||
#define MAX_NODES_PER_TRIE_LEVEL 8
|
|
||||||
#define MAX_NODES_PER_BUCKET (MAX_NODES_PER_TRIE_LEVEL / 2)
|
|
||||||
#define IS_TRIE_HASH(NODE) (TrHash_mark(NODE) == HASH_MARK)
|
|
||||||
#define HASH_TERM(TERM, SEED) (((TERM) >> 4) & (SEED))
|
|
||||||
|
|
||||||
#define STACK_NOT_EMPTY(STACK, STACK_BASE) STACK != STACK_BASE
|
|
||||||
#define POP_UP(STACK) *--STACK
|
|
||||||
#define POP_DOWN(STACK) *++STACK
|
|
||||||
#define PUSH_DOWN(STACK, ITEM, STACK_TOP) \
|
|
||||||
{ if (STACK > STACK_TOP) \
|
|
||||||
fprintf(stderr, "\nTries module: TERM_STACK full"); \
|
|
||||||
*STACK = (YAP_Term)(ITEM); \
|
|
||||||
STACK++; \
|
|
||||||
}
|
|
||||||
#define PUSH_UP(STACK, ITEM, STACK_TOP) \
|
|
||||||
{ if (STACK < STACK_TOP) \
|
|
||||||
fprintf(stderr, "\nTries module: TERM_STACK full"); \
|
|
||||||
*STACK = (YAP_Term)(ITEM); \
|
|
||||||
STACK--; \
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#define new_struct(STR, STR_TYPE, STR_SIZE) \
|
|
||||||
STR = (STR_TYPE *) YAP_AllocSpaceFromYap(STR_SIZE)
|
|
||||||
#define free_struct(STR) \
|
|
||||||
YAP_FreeSpaceFromYap((char *) (STR))
|
|
||||||
#define free_trie_node(STR) \
|
|
||||||
free_struct(STR); \
|
|
||||||
STATS_node_dec()
|
|
||||||
#define free_hash_buckets(STR, NUM_BUCKETS) \
|
|
||||||
free_struct(STR); \
|
|
||||||
STATS_buckets_dec(NUM_BUCKETS)
|
|
||||||
#define free_trie_hash(STR) \
|
|
||||||
free_struct(STR); \
|
|
||||||
STATS_hash_dec()
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef ALLOW_REMOVE_TRIE
|
|
||||||
#define TrNode_allow_remove_trie(TR_NODE, PREVIOUS) \
|
|
||||||
TrNode_previous(TR_NODE) = PREVIOUS; \
|
|
||||||
TrNode_hits(TR_NODE) = 0
|
|
||||||
#else
|
|
||||||
#define TrNode_allow_remove_trie(TR_NODE, PREVIOUS)
|
|
||||||
#endif /* ALLOW_REMOVE_TRIE */
|
|
||||||
|
|
||||||
#define new_trie_node(TR_NODE, ENTRY, PARENT, CHILD, NEXT, PREVIOUS) \
|
|
||||||
new_struct(TR_NODE, TYPE_TR_NODE, SIZEOF_TR_NODE); \
|
|
||||||
TrNode_entry(TR_NODE) = ENTRY; \
|
|
||||||
TrNode_parent(TR_NODE) = PARENT; \
|
|
||||||
TrNode_child(TR_NODE) = CHILD; \
|
|
||||||
TrNode_next(TR_NODE) = NEXT; \
|
|
||||||
TrNode_allow_remove_trie(TR_NODE, PREVIOUS); \
|
|
||||||
STATS_node_inc()
|
|
||||||
#define new_hash_buckets(TR_HASH, NUM_BUCKETS) \
|
|
||||||
{ int i; void **ptr; \
|
|
||||||
new_struct(ptr, void *, NUM_BUCKETS * sizeof(void *)); \
|
|
||||||
TrHash_buckets(TR_HASH) = (TYPE_TR_NODE **) ptr; \
|
|
||||||
for (i = NUM_BUCKETS; i != 0; i--) \
|
|
||||||
*ptr++ = NULL; \
|
|
||||||
STATS_buckets_inc(NUM_BUCKETS); \
|
|
||||||
}
|
|
||||||
#define new_trie_hash(TR_HASH, NUM_NODES) \
|
|
||||||
new_struct(TR_HASH, TYPE_TR_HASH, SIZEOF_TR_HASH); \
|
|
||||||
TrHash_mark(TR_HASH) = HASH_MARK; \
|
|
||||||
TrHash_num_buckets(TR_HASH) = BASE_HASH_BUCKETS; \
|
|
||||||
new_hash_buckets(TR_HASH, BASE_HASH_BUCKETS); \
|
|
||||||
TrHash_num_nodes(TR_HASH) = NUM_NODES; \
|
|
||||||
TrHash_next(TR_HASH) = HASHES; \
|
|
||||||
TrHash_previous(TR_HASH) = AS_TR_HASH_NEXT(&HASHES); \
|
|
||||||
if (HASHES) \
|
|
||||||
TrHash_previous(HASHES) = TR_HASH; \
|
|
||||||
HASHES = TR_HASH; \
|
|
||||||
STATS_hash_inc()
|
|
||||||
|
|
||||||
#define STATS_node_inc() \
|
|
||||||
NODES_IN_USE++; \
|
|
||||||
if (NODES_IN_USE > NODES_MAX_USED) \
|
|
||||||
NODES_MAX_USED = NODES_IN_USE; \
|
|
||||||
MEMORY_IN_USE += SIZEOF_TR_NODE; \
|
|
||||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
|
||||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
|
||||||
#define STATS_node_dec() \
|
|
||||||
NODES_IN_USE--; \
|
|
||||||
MEMORY_IN_USE -= SIZEOF_TR_NODE
|
|
||||||
#define STATS_hash_inc() \
|
|
||||||
HASHES_IN_USE++; \
|
|
||||||
if (HASHES_IN_USE > HASHES_MAX_USED) \
|
|
||||||
HASHES_MAX_USED = HASHES_IN_USE; \
|
|
||||||
MEMORY_IN_USE += SIZEOF_TR_HASH; \
|
|
||||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
|
||||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
|
||||||
#define STATS_hash_dec() \
|
|
||||||
HASHES_IN_USE--; \
|
|
||||||
MEMORY_IN_USE -= SIZEOF_TR_HASH
|
|
||||||
#define STATS_buckets_inc(N) \
|
|
||||||
BUCKETS_IN_USE += N; \
|
|
||||||
if (BUCKETS_IN_USE > BUCKETS_MAX_USED) \
|
|
||||||
BUCKETS_MAX_USED = BUCKETS_IN_USE; \
|
|
||||||
MEMORY_IN_USE += (N) * SIZEOF_TR_BUCKET; \
|
|
||||||
if (MEMORY_IN_USE > MEMORY_MAX_USED) \
|
|
||||||
MEMORY_MAX_USED = MEMORY_IN_USE
|
|
||||||
#define STATS_buckets_dec(N) \
|
|
||||||
BUCKETS_IN_USE -= N; \
|
|
||||||
MEMORY_IN_USE -= (N) * SIZEOF_TR_BUCKET
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* --------------------------- */
|
|
||||||
/* API */
|
|
||||||
/* --------------------------- */
|
|
||||||
|
|
||||||
void init_tries_module(void);
|
|
||||||
TrNode open_trie(void);
|
|
||||||
void close_trie(TrNode node);
|
|
||||||
void close_all_tries(void);
|
|
||||||
TrNode put_trie_entry(TrNode node, YAP_Term entry, int mode);
|
|
||||||
YAP_Term get_trie_entry(TrNode node, int mode);
|
|
||||||
void remove_trie_entry(TrNode node);
|
|
||||||
void trie_stats(int *nodes, int *hashes, int *buckets, int *memory);
|
|
||||||
void trie_max_stats(int *nodes, int *hashes, int *buckets, int *memory);
|
|
||||||
void trie_usage(TrNode node, int *entries, int *nodes, int *virtual_nodes);
|
|
||||||
void print_trie(TrNode node);
|
|
||||||
@ -1,301 +0,0 @@
|
|||||||
/******************************************
|
|
||||||
* File: yap_tries.c *
|
|
||||||
* Author: Ricardo Rocha *
|
|
||||||
* Comments: Tries module for yap *
|
|
||||||
******************************************/
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* -------------------------- */
|
|
||||||
/* Includes */
|
|
||||||
/* -------------------------- */
|
|
||||||
|
|
||||||
#include <YapInterface.h>
|
|
||||||
#include <string.h>
|
|
||||||
#include "tries.h"
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* -------------------------- */
|
|
||||||
/* Procedures */
|
|
||||||
/* -------------------------- */
|
|
||||||
|
|
||||||
void init_tries(void);
|
|
||||||
static int p_open_trie(void);
|
|
||||||
static int p_close_trie(void);
|
|
||||||
static int p_close_all_tries(void);
|
|
||||||
static int p_put_trie_entry(void);
|
|
||||||
static int p_get_trie_entry(void);
|
|
||||||
#ifdef ALLOW_REMOVE_TRIE
|
|
||||||
static int p_remove_trie_entry(void);
|
|
||||||
#endif /* ALLOW_REMOVE_TRIE */
|
|
||||||
static int p_trie_stats(void);
|
|
||||||
static int p_trie_max_stats(void);
|
|
||||||
static int p_trie_usage(void);
|
|
||||||
static int p_print_trie(void);
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* -------------------------- */
|
|
||||||
/* Module Init Procedure */
|
|
||||||
/* -------------------------- */
|
|
||||||
|
|
||||||
void init_tries(void) {
|
|
||||||
init_tries_module();
|
|
||||||
|
|
||||||
/* open_trie: -> Trie */
|
|
||||||
YAP_UserCPredicate("open_trie", p_open_trie, 1);
|
|
||||||
/* close_trie: Trie -> */
|
|
||||||
YAP_UserCPredicate("close_trie", p_close_trie, 1);
|
|
||||||
/* close_all_tries: -> */
|
|
||||||
YAP_UserCPredicate("close_all_tries", p_close_all_tries, 0);
|
|
||||||
/* put_trie_entry: Mode x Trie x Entry -> Ref */
|
|
||||||
YAP_UserCPredicate("put_trie_entry", p_put_trie_entry, 4);
|
|
||||||
/* get_trie_entry: Mode x Ref -> Entry */
|
|
||||||
YAP_UserCPredicate("get_trie_entry", p_get_trie_entry, 3);
|
|
||||||
#ifdef ALLOW_REMOVE_TRIE
|
|
||||||
/* remove_trie_entry: Ref -> */
|
|
||||||
YAP_UserCPredicate("remove_trie_entry", p_remove_trie_entry, 1);
|
|
||||||
#endif /* ALLOW_REMOVE_TRIE */
|
|
||||||
/* trie_stats: -> TrieNodes x HashNodes x HashBuckets x Mem */
|
|
||||||
YAP_UserCPredicate("trie_stats", p_trie_stats, 4);
|
|
||||||
/* trie_max_stats: -> TrieNodes x HashNodes x HashBuckets x Mem */
|
|
||||||
YAP_UserCPredicate("trie_max_stats", p_trie_max_stats, 4);
|
|
||||||
/* trie_usage: Trie -> Entries x Nodes x VirtualNodes */
|
|
||||||
YAP_UserCPredicate("trie_usage", p_trie_usage, 4);
|
|
||||||
/* print_trie: Trie -> */
|
|
||||||
YAP_UserCPredicate("print_trie", p_print_trie, 1);
|
|
||||||
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/* -------------------------- */
|
|
||||||
/* Local Procedures */
|
|
||||||
/* -------------------------- */
|
|
||||||
|
|
||||||
/* open_trie(+Trie) */
|
|
||||||
static int p_open_trie(void) {
|
|
||||||
YAP_Term arg_trie = YAP_ARG1;
|
|
||||||
TrNode node;
|
|
||||||
|
|
||||||
/* check arg */
|
|
||||||
if (!YAP_IsVarTerm(arg_trie))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* open trie */
|
|
||||||
node = open_trie();
|
|
||||||
if (!YAP_Unify(arg_trie, YAP_MkIntTerm((YAP_Int) node)))
|
|
||||||
return FALSE;
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* close_trie(-Trie) */
|
|
||||||
static int p_close_trie(void) {
|
|
||||||
YAP_Term arg_trie = YAP_ARG1;
|
|
||||||
|
|
||||||
/* check args */
|
|
||||||
if (!YAP_IsIntTerm(arg_trie))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* close trie */
|
|
||||||
close_trie((TrNode) YAP_IntOfTerm(arg_trie));
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* close_all_tries() */
|
|
||||||
static int p_close_all_tries(void) {
|
|
||||||
close_all_tries();
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* put_trie_entry(-Mode,-Trie,-Entry,+Ref) */
|
|
||||||
static int p_put_trie_entry(void) {
|
|
||||||
YAP_Term arg_mode = YAP_ARG1;
|
|
||||||
YAP_Term arg_trie = YAP_ARG2;
|
|
||||||
YAP_Term arg_entry = YAP_ARG3;
|
|
||||||
YAP_Term arg_ref = YAP_ARG4;
|
|
||||||
TrNode node;
|
|
||||||
char *mode_str;
|
|
||||||
int mode;
|
|
||||||
|
|
||||||
/* check args */
|
|
||||||
mode_str = (char *)YAP_AtomName(YAP_AtomOfTerm(arg_mode));
|
|
||||||
if (!strcmp(mode_str, "std")) {
|
|
||||||
mode = MODE_STANDARD;
|
|
||||||
} else if (!strcmp(mode_str, "rev")) {
|
|
||||||
mode = MODE_REVERSE;
|
|
||||||
} else
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_IsIntTerm(arg_trie))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* put trie entry */
|
|
||||||
node = put_trie_entry((TrNode) YAP_IntOfTerm(arg_trie), arg_entry, mode);
|
|
||||||
if (!YAP_Unify(arg_ref, YAP_MkIntTerm((YAP_Int) node)))
|
|
||||||
return FALSE;
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* get_trie_entry(-Mode,-Ref,+Entry) */
|
|
||||||
static int p_get_trie_entry(void) {
|
|
||||||
YAP_Term arg_mode = YAP_ARG1;
|
|
||||||
YAP_Term arg_ref = YAP_ARG2;
|
|
||||||
YAP_Term arg_entry = YAP_ARG3;
|
|
||||||
YAP_Term entry;
|
|
||||||
char *mode_str;
|
|
||||||
int mode;
|
|
||||||
|
|
||||||
/* check args */
|
|
||||||
mode_str = (char *)YAP_AtomName(YAP_AtomOfTerm(arg_mode));
|
|
||||||
if (!strcmp(mode_str, "std")) {
|
|
||||||
mode = MODE_STANDARD;
|
|
||||||
} else if (!strcmp(mode_str, "rev")) {
|
|
||||||
mode = MODE_REVERSE;
|
|
||||||
} else
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_IsIntTerm(arg_ref))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* get trie entry */
|
|
||||||
entry = get_trie_entry((TrNode) YAP_IntOfTerm(arg_ref), mode);
|
|
||||||
if (!YAP_Unify(arg_entry, entry))
|
|
||||||
return FALSE;
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
#ifdef ALLOW_REMOVE_TRIE
|
|
||||||
/* remove_trie_entry(-Ref) */
|
|
||||||
static int p_remove_trie_entry(void) {
|
|
||||||
YAP_Term arg_ref = YAP_ARG1;
|
|
||||||
|
|
||||||
/* check arg */
|
|
||||||
if (!YAP_IsIntTerm(arg_ref))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* remove trie entry */
|
|
||||||
remove_trie_entry((TrNode) YAP_IntOfTerm(arg_ref));
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
#endif /* ALLOW_REMOVE_TRIE */
|
|
||||||
|
|
||||||
|
|
||||||
/* trie_stats(+TrieNodes,+HashNodes,+HashBuckets,+Mem) */
|
|
||||||
static int p_trie_stats(void) {
|
|
||||||
YAP_Term arg_trienodes = YAP_ARG1;
|
|
||||||
YAP_Term arg_hashnodes = YAP_ARG2;
|
|
||||||
YAP_Term arg_hashbuckets = YAP_ARG3;
|
|
||||||
YAP_Term arg_mem = YAP_ARG4;
|
|
||||||
int trienodes;
|
|
||||||
int hashnodes;
|
|
||||||
int hashbuckets;
|
|
||||||
int mem;
|
|
||||||
|
|
||||||
trie_stats(&trienodes, &hashnodes, &hashbuckets, &mem);
|
|
||||||
|
|
||||||
/* all args should be arguments */
|
|
||||||
if (!YAP_Unify(arg_trienodes, YAP_MkIntTerm(trienodes)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_hashnodes, YAP_MkIntTerm(hashnodes)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_hashbuckets, YAP_MkIntTerm(hashbuckets)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_mem, YAP_MkIntTerm(mem)))
|
|
||||||
return FALSE;
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* trie_max_stats(+TrieNodes,+HashNodes,+HashBuckets,+Mem) */
|
|
||||||
static int p_trie_max_stats(void) {
|
|
||||||
YAP_Term arg_trienodes = YAP_ARG1;
|
|
||||||
YAP_Term arg_hashnodes = YAP_ARG2;
|
|
||||||
YAP_Term arg_hashbuckets = YAP_ARG3;
|
|
||||||
YAP_Term arg_mem = YAP_ARG4;
|
|
||||||
int trienodes;
|
|
||||||
int hashnodes;
|
|
||||||
int hashbuckets;
|
|
||||||
int mem;
|
|
||||||
|
|
||||||
trie_max_stats(&trienodes, &hashnodes, &hashbuckets, &mem);
|
|
||||||
|
|
||||||
/* all args should be arguments */
|
|
||||||
if (!YAP_Unify(arg_trienodes, YAP_MkIntTerm(trienodes)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_hashnodes, YAP_MkIntTerm(hashnodes)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_hashbuckets, YAP_MkIntTerm(hashbuckets)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_mem, YAP_MkIntTerm(mem)))
|
|
||||||
return FALSE;
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* trie_usage(-Trie,+Entries,+Nodes,+VirtualNodes) */
|
|
||||||
static int p_trie_usage(void) {
|
|
||||||
YAP_Term arg_trie = YAP_ARG1;
|
|
||||||
YAP_Term arg_entries = YAP_ARG2;
|
|
||||||
YAP_Term arg_nodes = YAP_ARG3;
|
|
||||||
YAP_Term arg_virtualnodes = YAP_ARG4;
|
|
||||||
int entries;
|
|
||||||
int nodes;
|
|
||||||
int virtualnodes;
|
|
||||||
|
|
||||||
/* check arg */
|
|
||||||
if (!YAP_IsIntTerm(arg_trie))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
trie_usage((TrNode) YAP_IntOfTerm(arg_trie), &entries, &nodes, &virtualnodes);
|
|
||||||
if (!YAP_Unify(arg_entries, YAP_MkIntTerm(entries)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_nodes, YAP_MkIntTerm(nodes)))
|
|
||||||
return FALSE;
|
|
||||||
if (!YAP_Unify(arg_virtualnodes, YAP_MkIntTerm(virtualnodes)))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
/* print_trie(-Trie) */
|
|
||||||
static int p_print_trie(void) {
|
|
||||||
YAP_Term arg_trie = YAP_ARG1;
|
|
||||||
|
|
||||||
/* check arg */
|
|
||||||
if (!YAP_IsIntTerm(arg_trie))
|
|
||||||
return FALSE;
|
|
||||||
|
|
||||||
/* print trie */
|
|
||||||
print_trie((TrNode) YAP_IntOfTerm(arg_trie));
|
|
||||||
return TRUE;
|
|
||||||
}
|
|
||||||
|
|
||||||
#ifdef _WIN32
|
|
||||||
|
|
||||||
#include <windows.h>
|
|
||||||
|
|
||||||
int WINAPI PROTO(win_tries, (HANDLE, DWORD, LPVOID));
|
|
||||||
|
|
||||||
int WINAPI win_tries(HANDLE hinst, DWORD reason, LPVOID reserved)
|
|
||||||
{
|
|
||||||
switch (reason)
|
|
||||||
{
|
|
||||||
case DLL_PROCESS_ATTACH:
|
|
||||||
break;
|
|
||||||
case DLL_PROCESS_DETACH:
|
|
||||||
break;
|
|
||||||
case DLL_THREAD_ATTACH:
|
|
||||||
break;
|
|
||||||
case DLL_THREAD_DETACH:
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
return 1;
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
Reference in New Issue
Block a user