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 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728
|
/* samp.c -- code for ln_samp objects.
*
* 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 <stdlib.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <assert.h>
#include <ctype.h>
#include <libee/libee.h>
#include <libee/primitivetype.h>
#include "liblognorm.h"
#include "lognorm.h"
#include "samp.h"
#include "internal.h"
struct ln_sampRepos*
ln_sampOpen(ln_ctx __attribute((unused)) ctx, char *name)
{
struct ln_sampRepos *repo = NULL;
FILE *fp;
if((fp = fopen(name, "r")) == NULL)
goto done;
if((repo = calloc(1, sizeof(struct ln_sampRepos))) == NULL) {
fclose(fp);
goto done;
}
repo->fp = fp;
done:
return repo;
}
void
ln_sampClose(ln_ctx __attribute((unused)) ctx, struct ln_sampRepos *repo)
{
if(repo->fp != NULL)
fclose(repo->fp);
free(repo);
}
/**
* Construct a sample object.
*/
struct ln_samp*
ln_sampCreate(ln_ctx __attribute__((unused)) ctx)
{
struct ln_samp* samp;
if((samp = calloc(1, sizeof(struct ln_samp))) == NULL)
goto done;
/* place specific init code here (none at this time) */
done: return samp;
}
void
ln_sampFree(ln_ctx __attribute__((unused)) ctx, struct ln_samp *samp)
{
free(samp);
}
/**
* Extract a field description from a sample.
* The field description is added to the tail of the current
* subtree's field list. The parse buffer must be position on the
* leading '%' that starts a field definition. It is a program error
* if this condition is not met.
*
* Note that we break up the object model and access ptree members
* directly. Let's consider us a friend of ptree. This is necessary
* to optimize the structure for a high-speed parsing process.
*
* @param[in] str a temporary work string. This is passed in to save the
* creation overhead
* @returns 0 on success, something else otherwise
*/
static inline int
parseFieldDescr(ln_ctx ctx, struct ln_ptree **subtree, es_str_t *rule,
es_size_t *bufOffs, es_str_t **str)
{
int r;
ln_fieldList_t *node;
es_size_t i = *bufOffs;
char *cstr; /* for debug mode strings */
unsigned char *buf;
es_size_t lenBuf;
assert(subtree != NULL);
buf = es_getBufAddr(rule);
lenBuf = es_strlen(rule);
assert(buf[i] == '%');
++i; /* "eat" ':' */
CHKN(node = malloc(sizeof(ln_fieldList_t)));
node->subtree = NULL;
node->next = NULL;
node->data = NULL;
CHKN(node->name = es_newStr(16));
while(i < lenBuf && buf[i] != ':') {
CHKR(es_addChar(&node->name, buf[i++]));
}
if(es_strlen(node->name) == 0) {
FAIL(LN_INVLDFDESCR);
}
if(ctx->debug) {
cstr = es_str2cstr(node->name, NULL);
ln_dbgprintf(ctx, "parsed field: '%s'", cstr);
free(cstr);
}
if(buf[i] != ':') {
/* may be valid later if we have a loaded CEE dictionary
* and the name is present inside it.
*/
FAIL(LN_INVLDFDESCR);
}
++i; /* skip ':' */
/* parse and process type
* Note: if we have a CEE dictionary, this part can be optional!
*/
es_emptyStr(*str);
while(i < lenBuf && buf[i] != ':' && buf[i] != '%') {
CHKR(es_addChar(str, buf[i++]));
}
if(i == lenBuf) {
FAIL(LN_INVLDFDESCR);
}
node->isIPTables = 0; /* first assume no special parser is used */
if(!es_strconstcmp(*str, "date-rfc3164")) {
node->parser = ee_parseRFC3164Date;
} else if(!es_strconstcmp(*str, "date-rfc5424")) {
node->parser = ee_parseRFC5424Date;
} else if(!es_strconstcmp(*str, "number")) {
node->parser = ee_parseNumber;
} else if(!es_strconstcmp(*str, "ipv4")) {
node->parser = ee_parseIPv4;
} else if(!es_strconstcmp(*str, "word")) {
node->parser = ee_parseWord;
} else if(!es_strconstcmp(*str, "quoted-string")) {
node->parser = ee_parseQuotedString;
} else if(!es_strconstcmp(*str, "date-iso")) {
node->parser = ee_parseISODate;
} else if(!es_strconstcmp(*str, "time-24hr")) {
node->parser = ee_parseTime24hr;
} else if(!es_strconstcmp(*str, "time-12hr")) {
node->parser = ee_parseTime12hr;
} else if(!es_strconstcmp(*str, "iptables")) {
node->parser = NULL;
node->isIPTables = 1;
} else if(!es_strconstcmp(*str, "char-to")) {
// TODO: check extra data!!!! (very important)
node->parser = ee_parseCharTo;
} else {
cstr = es_str2cstr(*str, NULL);
ln_dbgprintf(ctx, "ERROR: invalid field type '%s'", cstr);
free(cstr);
FAIL(LN_INVLDFDESCR);
}
if(buf[i] == '%') {
i++;
} else {
/* parse extra data */
CHKN(node->data = es_newStr(8));
i++;
while(i < lenBuf) {
if(buf[i] == '%') {
++i;
if(i == lenBuf || buf[i] != '%') {
break; /* end of field */
}
}
CHKR(es_addChar(&node->data, buf[i++]));
}
es_unescapeStr(node->data);
if(ctx->debug) {
cstr = es_str2cstr(node->data, NULL);
ln_dbgprintf(ctx, "parsed extra data: '%s'", cstr);
free(cstr);
}
}
/* finished */
CHKR(ln_addFDescrToPTree(subtree, node));
*bufOffs = i;
r = 0;
done: return r;
}
/**
* Parse a Literal string out of the template and add it to the tree.
* @param[in] ctx the context
* @param[in/out] subtree on entry, current subtree, on exist newest
* deepest subtree
* @param[in] rule string with current rule
* @param[in/out] bufOffs parse pointer, up to which offset is parsed
* (is updated so that it points to first char after consumed
* string on exit).
* @param[out] str literal extracted (is empty, when no litral could be found)
* @return 0 on success, something else otherwise
*/
static inline int
parseLiteral(ln_ctx ctx, struct ln_ptree **subtree, es_str_t *rule,
es_size_t *bufOffs, es_str_t **str)
{
int r;
es_size_t i = *bufOffs;
unsigned char *buf;
es_size_t lenBuf;
es_emptyStr(*str);
buf = es_getBufAddr(rule);
lenBuf = es_strlen(rule);
/* extract maximum length literal */
while(i < lenBuf) {
if(buf[i] == '%') {
if(i+1 < lenBuf && buf[i+1] != '%') {
break; /* field start is end of literal */
}
++i;
}
CHKR(es_addChar(str, buf[i]));
++i;
}
if(es_strlen(*str) == 0)
goto done;
es_unescapeStr(*str);
if(ctx->debug) {
char *cstr = es_str2cstr(*str, NULL);
ln_dbgprintf(ctx, "parsed literal: '%s'", cstr);
free(cstr);
}
*subtree = ln_buildPTree(*subtree, *str, 0);
*bufOffs = i;
r = 0;
done: return r;
}
/* Implementation note:
* We read in the sample, and split it into chunks of literal text and
* fields. Each literal text is added as whole to the tree, as is each
* field individually. To do so, we keep track of our current subtree
* root, which changes whenever a new part of the tree is build. It is
* set to the then-lowest part of the tree, where the next step sample
* data is to be added.
*
* This function processes the whole string or returns an error.
*
* format: literal1%field:type:extra-data%literal2
*
* @returns the new subtree root (or NULL in case of error)
*/
static inline int
addSampToTree(ln_ctx ctx, es_str_t *rule, struct ee_tagbucket *tagBucket)
{
int r;
struct ln_ptree* subtree;
es_str_t *str = NULL;
es_size_t i;
subtree = ctx->ptree;
CHKN(str = es_newStr(256));
i = 0;
while(i < es_strlen(rule)) {
ln_dbgprintf(ctx, "addSampToTree %d of %d", i, es_strlen(rule));
CHKR(parseLiteral(ctx, &subtree, rule, &i, &str));
if(es_strlen(str) == 0) {
/* we had no literal, so let's parse a field description */
CHKR(parseFieldDescr(ctx, &subtree, rule, &i, &str));
}
}
ln_dbgprintf(ctx, "end addSampToTree %d of %d", i, es_strlen(rule));
/* we are at the end of rule processing, so this node is a terminal */
subtree->flags.isTerminal = 1;
subtree->tags = tagBucket;
done:
if(str != NULL)
es_deleteStr(str);
return r;
}
/**
* get the initial word of a rule line that tells us the type of the
* line.
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[out] offs offset after "="
* @param[out] str string with "linetype-word" (newly created)
* @returns 0 on success, something else otherwise
*/
static inline int
getLineType(char *buf, es_size_t lenBuf, es_size_t *offs, es_str_t **str)
{
int r;
es_size_t i;
*str = es_newStr(16);
for(i = 0 ; i < lenBuf && buf[i] != '=' ; ++i) {
CHKR(es_addChar(str, buf[i]));
}
if(i < lenBuf)
++i; /* skip over '=' */
*offs = i;
done: return r;
}
/**
* Get a new common prefix from the config file. That is actually everything from
* the current offset to the end of line.
*
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in] offs offset after "="
* @param[in/out] str string to store common offset. If NULL, it is created,
* otherwise it is emptied.
* @returns 0 on success, something else otherwise
*/
static inline int
getPrefix(char *buf, es_size_t lenBuf, es_size_t offs, es_str_t **str)
{
int r;
if(*str == NULL) {
CHKN(*str = es_newStr(lenBuf - offs));
} else {
es_emptyStr(*str);
}
r = es_addBuf(str, buf + offs, lenBuf - offs);
done: return r;
}
/**
* Extend the common prefix. This means that the line is concatenated
* to the prefix. This is useful if the same rulebase is to be used with
* different prefixes (well, not strictly necessary, but probably useful).
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in] offs offset to-be-added text starts
* @returns 0 on success, something else otherwise
*/
static inline int
extendPrefix(ln_ctx ctx, char *buf, es_size_t lenBuf, es_size_t offs)
{
return es_addBuf(&ctx->rulePrefix, buf+offs, lenBuf - offs);
}
/**
* Add a tag to the tag bucket. Helper to processTags.
* @param[in] ctx current context
* @param[in] tagname string with tag name
* @param[out] tagBucket tagbucket to which new tags shall be added
* the tagbucket is created if it is NULL
* @returns 0 on success, something else otherwise
*/
static inline int
addTagStrToBucket(ln_ctx ctx, es_str_t *tagname, struct ee_tagbucket **tagBucket)
{
int r = -1;
char *cstr;
if(*tagBucket == NULL) {
CHKN(*tagBucket = ee_newTagbucket(ctx->eectx));
}
cstr = es_str2cstr(tagname, NULL);
ln_dbgprintf(ctx, "tag found: '%s'", cstr);
free(cstr);
CHKR(ee_addTagToBucket(*tagBucket, tagname));
r = 0;
done: return r;
}
/**
* Extract the tags and create a tag bucket out of them
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in,out] poffs offset where tags start, on exit and success
* offset after tag part (excluding ':')
* @param[out] tagBucket tagbucket to which new tags shall be added
* the tagbucket is created if it is NULL
* @returns 0 on success, something else otherwise
*/
static inline int
processTags(ln_ctx ctx, char *buf, es_size_t lenBuf, es_size_t *poffs, struct ee_tagbucket **tagBucket)
{
int r = -1;
es_str_t *str = NULL;
es_size_t i;
assert(poffs != NULL);
i = *poffs;
while(i < lenBuf && buf[i] != ':') {
if(buf[i] == ',') {
/* end of this tag */
CHKR(addTagStrToBucket(ctx, str, tagBucket));
str = NULL;
} else {
if(str == NULL) {
CHKN(str = es_newStr(32));
}
CHKR(es_addChar(&str, buf[i]));
}
++i;
}
if(buf[i] != ':')
goto done;
++i; /* skip ':' */
if(str != NULL) {
CHKR(addTagStrToBucket(ctx, str, tagBucket));
}
*poffs = i;
r = 0;
done: return r;
}
/**
* Process a new rule and add it to tree.
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in] offs offset where rule starts
* @returns 0 on success, something else otherwise
*/
static inline int
processRule(ln_ctx ctx, char *buf, es_size_t lenBuf, es_size_t offs)
{
int r = -1;
es_str_t *str;
struct ee_tagbucket *tagBucket = NULL;
ln_dbgprintf(ctx, "sample line to add: '%s'\n", buf+offs);
CHKR(processTags(ctx, buf, lenBuf, &offs, &tagBucket));
if(offs == lenBuf) {
ln_dbgprintf(ctx, "error, actual message sample part is missing");
// TODO: provide some error indicator to app? We definitely must do (a callback?)
goto done;
}
if(ctx->rulePrefix == NULL) {
CHKN(str = es_newStr(lenBuf));
} else {
CHKN(str = es_strdup(ctx->rulePrefix));
}
CHKR(es_addBuf(&str, buf + offs, lenBuf - offs));
addSampToTree(ctx, str, tagBucket);
es_deleteStr(str);
r = 0;
done: return r;
}
/**
* Obtain a field name from a rule base line.
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in/out] offs on entry: offset where tag starts,
* on exit: updated offset AFTER TAG and (':')
* @param [out] strTag obtained tag, if successful
* @returns 0 on success, something else otherwise
*/
static inline int
getFieldName(ln_ctx ctx, char *buf, es_size_t lenBuf, es_size_t *offs, es_str_t **strTag)
{
int r = -1;
es_size_t i;
i = *offs;
while(i < lenBuf &&
(isalnum(buf[i]) || buf[i] == '_' || buf[i] == '.')) {
if(*strTag == NULL) {
CHKN(*strTag = es_newStr(32));
}
CHKR(es_addChar(strTag, buf[i]));
++i;
}
*offs = i;
r = 0;
done: return r;
}
/**
* Skip over whitespace.
* Skips any whitespace present at the offset.
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in/out] offs on entry: offset first unprocessed position
*/
static inline void
skipWhitespace(ln_ctx __attribute__((unused)) ctx, char *buf, es_size_t lenBuf, es_size_t *offs)
{
while(*offs < lenBuf && isspace(buf[*offs])) {
(*offs)++;
}
}
/**
* Obtain an annotation (field) operation.
* This usually is a plus or minus sign followed by a field name
* followed (if plus) by an equal sign and the field value. On entry,
* offs must be positioned on the first unprocessed field (after ':' for
* the initial field!). Extra whitespace is detected and, if present,
* skipped. The obtained operation is added to the annotation set provided.
* Note that extracted string objects are passed to the annotation; thus it
* is vital NOT to free them (most importantly, this is *not* a memory leak).
*
* @param[in] ctx current context
* @param[in] annot active annotation set to which the operation is to be added
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in/out] offs on entry: offset where tag starts,
* on exit: updated offset AFTER TAG and (':')
* @param [out] strTag obtained tag, if successful
* @returns 0 on success, something else otherwise
*/
static inline int
getAnnotationOp(ln_ctx ctx, ln_annot *annot, char *buf, es_size_t lenBuf, es_size_t *offs)
{
int r = -1;
es_size_t i;
es_str_t *fieldName = NULL;
es_str_t *fieldVal = NULL;
ln_annot_opcode opc;
i = *offs;
skipWhitespace(ctx, buf, lenBuf, &i);
if(i == lenBuf) {
r = 0;
goto done; /* nothing left to process (no error!) */
}
if(buf[i] == '+') {
opc = ln_annot_ADD;
} else if(buf[i] == '-') {
ln_dbgprintf(ctx, "annotate op '-' not yet implemented - failing");
goto fail;
} else {
ln_dbgprintf(ctx, "invalid annotate opcode '%c' - failing" , buf[i]);
goto fail;
}
i++;
if(i == lenBuf) goto fail; /* nothing left to process */
CHKR(getFieldName(ctx, buf, lenBuf, &i, &fieldName));
if(i == lenBuf) goto fail; /* nothing left to process */
if(buf[i] != '=') goto fail; /* format error */
i++;
skipWhitespace(ctx, buf, lenBuf, &i);
if(buf[i] != '"') goto fail; /* format error */
++i;
while(i < lenBuf && buf[i] != '"') {
if(fieldVal == NULL) {
CHKN(fieldVal = es_newStr(32));
}
CHKR(es_addChar(&fieldVal, buf[i]));
++i;
}
*offs = (i == lenBuf) ? i : i+1;
CHKR(ln_addAnnotOp(annot, opc, fieldName, fieldVal));
r = 0;
done: return r;
fail: return -1;
}
/**
* Process a new annotation and add it to the annotation set.
*
* @param[in] ctx current context
* @param[in] buf line buffer
* @param[in] len length of buffer
* @param[in] offs offset where annotation starts
* @returns 0 on success, something else otherwise
*/
static inline int
processAnnotate(ln_ctx ctx, char *buf, es_size_t lenBuf, es_size_t offs)
{
int r;
es_str_t *tag = NULL;
ln_annot *annot;
ln_dbgprintf(ctx, "sample annotation to add: '%s'", buf+offs);
CHKR(getFieldName(ctx, buf, lenBuf, &offs, &tag));
skipWhitespace(ctx, buf, lenBuf, &offs);
if(buf[offs] != ':') {
ln_dbgprintf(ctx, "invalid tag field in annotation, line is '%s'", buf);
r=-1;
goto done;
}
++offs;
/* we got an annotation! */
CHKN(annot = ln_newAnnot(tag));
while(offs < lenBuf) {
CHKR(getAnnotationOp(ctx, annot, buf, lenBuf, &offs));
}
r = ln_addAnnotToSet(ctx->pas, annot);
done: return r;
}
struct ln_samp *
ln_sampRead(ln_ctx ctx, struct ln_sampRepos *repo, int *isEof)
{
struct ln_samp *samp = NULL;
es_size_t offs;
int done = 0;
char buf[10*1024]; /**< max size of rule */ // TODO: make configurable
es_size_t lenBuf;
es_str_t *typeStr = NULL;
/* we ignore empty lines and lines that begin with "#" */
while(!done) {
if(feof(repo->fp)) {
*isEof = 1;
goto done;
}
buf[0] = '\0'; /* fgets does not empty its buffer! */
fgets(buf, sizeof(buf), repo->fp);
lenBuf = strlen(buf);
if(lenBuf == 0 || buf[0] == '#' || buf[0] == '\n')
continue;
if(buf[lenBuf - 1] == '\n') {
buf[lenBuf - 1] = '\0';
lenBuf--;
}
done = 1; /* we found a valid line */
}
ln_dbgprintf(ctx, "read sample line: '%s'", buf);
if(getLineType(buf, lenBuf, &offs, &typeStr) != 0) goto done;
if(!es_strconstcmp(typeStr, "prefix")) {
if(getPrefix(buf, lenBuf, offs, &ctx->rulePrefix) != 0) goto done;
} else if(!es_strconstcmp(typeStr, "extendprefix")) {
if(extendPrefix(ctx, buf, lenBuf, offs) != 0) goto done;
} else if(!es_strconstcmp(typeStr, "rule")) {
if(processRule(ctx, buf, lenBuf, offs) != 0) goto done;
} else if(!es_strconstcmp(typeStr, "annotate")) {
if(processAnnotate(ctx, buf, lenBuf, offs) != 0) goto done;
} else {
// TODO error reporting
char *str;
str = es_str2cstr(typeStr, NULL);
ln_dbgprintf(ctx, "invalid record type detected: '%s'", str);
free(str);
goto done;
}
//ln_displayPTree(ctx, ctx->ptree, 0);
done:
if(typeStr != NULL)
es_deleteStr(typeStr);
return samp;
}
|