]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * NOT functionality | |
3 | */ | |
4 | ||
5 | #include "newsearch.h" | |
6 | ||
7 | #include <stdio.h> | |
8 | #include <stdlib.h> | |
9 | ||
10 | void not_free(searchCtx *ctx, struct searchNode *thenode); | |
11 | void *not_exe(searchCtx *ctx, struct searchNode *thenode, void *theinput); | |
12 | ||
13 | struct searchNode *not_parse(searchCtx *ctx, int argc, char **argv) { | |
14 | searchNode *thenode, *subnode; | |
15 | ||
16 | if (argc!=1) { | |
17 | parseError="not: usage: not (term)"; | |
18 | return NULL; | |
19 | } | |
20 | ||
21 | /* Allocate our actual node */ | |
22 | if (!(thenode=(searchNode *)malloc(sizeof(searchNode)))) { | |
23 | parseError = "malloc: could not allocate memory for this search."; | |
24 | return NULL; | |
25 | } | |
26 | ||
27 | thenode->returntype = RETURNTYPE_BOOL; | |
28 | thenode->exe = not_exe; | |
29 | thenode->free = not_free; | |
30 | ||
31 | subnode=ctx->parser(ctx, argv[0]); /* Propogate the search type */ | |
32 | ||
33 | if (!subnode) { | |
34 | free(thenode); | |
35 | return NULL; | |
36 | } | |
37 | ||
38 | /* Our subnode needs to return a BOOL */ | |
39 | subnode=coerceNode(ctx, subnode, RETURNTYPE_BOOL); | |
40 | if(!subnode) { | |
41 | free(thenode); | |
42 | return NULL; | |
43 | } | |
44 | ||
45 | thenode->localdata=(void *)subnode; | |
46 | ||
47 | return thenode; | |
48 | } | |
49 | ||
50 | void not_free(searchCtx *ctx, struct searchNode *thenode) { | |
51 | struct searchNode *subnode; | |
52 | subnode=thenode->localdata; | |
53 | ||
54 | (subnode->free)(ctx, subnode); | |
55 | free(thenode); | |
56 | } | |
57 | ||
58 | void *not_exe(searchCtx *ctx, struct searchNode *thenode, void *theinput) { | |
59 | struct searchNode *subnode; | |
60 | ||
61 | subnode=thenode->localdata; | |
62 | ||
63 | if ((subnode->exe)(ctx, subnode, theinput)) { | |
64 | return (void *)0; | |
65 | } else { | |
66 | return (void *)1; | |
67 | } | |
68 | } |