1 /***************************************************************************
2 * Copyright (C) 2007 by www.databasecache.com *
3 * Contact: praba_tuty@databasecache.com *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 ***************************************************************************/
16 #ifndef PREDICATE_IMPL_H
17 #define PREDICATE_IMPL_H
24 class PredicateImpl
:public Predicate
26 //Members set during initialization of the term
27 char fldName1
[IDENTIFIER_LENGTH
];
28 char fldName2
[IDENTIFIER_LENGTH
];
35 PredicateImpl
*parent
;
39 //Members set during execution
40 void *tuple
; //pointer to the tuple
44 //optimization:caching val1 and val2 for evaluation
52 //opt for between queries
53 ComparisionOp comp2Op
;
56 //This will be set before calling evaluate
62 strcpy(fldName1
, ""); strcpy(fldName2
, "");
63 operand
= NULL
; operandPtr
= NULL
; lhs
= rhs
= NULL
;
64 tuple
= NULL
; table
= NULL
;
67 offset1
= -1; offset2
=-1;
80 void setTerm(const char* fName1
, ComparisionOp op
, const char *fName2
);
82 //Operand should be of the same type of the field.This is must
83 void setTerm(const char* fName1
, ComparisionOp op
, void *opnd
);
85 void setTerm(const char* fName1
, ComparisionOp op
, void **opnd
);
86 void setTerm(const char* fName1
, ComparisionOp op
, void **opnd
,
87 ComparisionOp op2
, void **opnd2
);
90 void setTerm(Predicate
*p1
, LogicalOp op
, Predicate
*p2
= NULL
);
92 void* valPtrForIndexField(const char *name
);
93 ComparisionOp
opForIndexField(const char *name
);
95 DbRetVal
evaluate(bool &result
);
96 void evaluateForTable(bool &result
, char*tuple
);
98 DbRetVal
evaluateLogical(bool &result
);
99 DbRetVal
evaluateLogicalForTable(bool &result
, char *tuple
);
101 void setTable(Table
*tbl
);
102 void setTuple(void *tpl
);
103 void setProjectionList(List
*list
); //used by JoinTableImpl
104 void setOffsetAndType();
106 bool isNotOrInvolved();
107 //check predicate, whether it has field name and == operator
108 //and does not have OR, NOT operator
109 // TODO:: expression like !(f1 !=100) wont be optimized for now
110 bool pointLookupInvolved(const char *fName
);
111 bool rangeQueryInvolved(const char *fName
);
112 bool isBetweenInvolved(const char *fname
);
113 PredicateImpl
*getTablePredicate();
114 PredicateImpl
*getJoinPredicate();
115 void removeIfNotNecessary();
116 bool isDummyPredicate();
117 PredicateImpl
* getIfOneSidedPredicate();
118 void setParent(PredicateImpl
*pImpl
);
119 char* getFldName1(){ return fldName1
; }
120 char* getFldName2(){ return fldName2
; }
121 ComparisionOp
getCompOp() {return compOp
; }
122 void print(int space
);
123 void setIfNoLeftRight();
124 void setDontEvaluate(){dontEvaluate
= true;}
125 bool appendIfSameFld(char *fname
, ComparisionOp op
, void* buf
);
126 void* getValIfPointLookupOnInt(int &offset
);
127 void* getVal1IfBetweenOnInt(int &offset
);
128 void* getVal2IfBetweenOnInt(int &offset
);