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
|
/* This file implements the liblognorm API.
* See header file for descriptions.
*
* liblognorm - a fast samples-based log normalization library
* Copyright 2010 by Rainer Gerhards and Adiscon GmbH.
*
* This file is part of liblognorm.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* A copy of the LGPL v2.1 can be found in the file "COPYING" in this distribution.
*/
#include "config.h"
#include "liblognorm.h"
#include "lognorm.h"
#include "annot.h"
#include "samp.h"
#define ERR_ABORT {r = 1; goto done; }
#define CHECK_CTX \
if(ctx->objID != LN_ObjID_CTX) { \
r = -1; \
goto done; \
}
char *
ln_version(void)
{
return VERSION;
}
ln_ctx
ln_initCtx(void)
{
ln_ctx ctx;
if((ctx = calloc(1, sizeof(struct ln_ctx_s))) == NULL)
goto done;
ctx->objID = LN_ObjID_CTX;
ctx->dbgCB = NULL;
/* we add an root for the empty word, this simplifies parse
* tree handling.
*/
if((ctx->ptree = ln_newPTree(ctx, NULL)) == NULL) {
free(ctx);
ctx = NULL;
goto done;
}
/* same for annotation set */
if((ctx->pas = ln_newAnnotSet(ctx)) == NULL) {
ln_deletePTree(ctx->ptree);
free(ctx);
ctx = NULL;
goto done;
}
done:
return ctx;
}
int
ln_exitCtx(ln_ctx ctx)
{
int r = 0;
CHECK_CTX;
ctx->objID = LN_ObjID_None; /* prevent double free */
if(ctx->ptree != NULL)
ln_deletePTree(ctx->ptree);
if(ctx->rulePrefix != NULL)
es_deleteStr(ctx->rulePrefix);
free(ctx);
done:
return r;
}
int
ln_setDebugCB(ln_ctx ctx, void (*cb)(void*, char*, size_t), void *cookie)
{
int r = 0;
CHECK_CTX;
ctx->dbgCB = cb;
ctx->dbgCookie = cookie;
done:
return r;
}
int
ln_loadSamples(ln_ctx ctx, char *file)
{
int r = 0;
struct ln_sampRepos *repo;
struct ln_samp *samp;
int isEof = 0;
CHECK_CTX;
if(file == NULL) ERR_ABORT;
if((repo = ln_sampOpen(ctx, file)) == NULL) ERR_ABORT;
while(!isEof) {
if((samp = ln_sampRead(ctx, repo, &isEof)) == NULL) {
/* TODO: what exactly to do? */
}
}
ln_sampClose(ctx, repo);
done:
return r;
}
void
ln_setEECtx(ln_ctx ctx, ee_ctx eectx)
{
ctx->eectx = eectx;
}
|