FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
write-after-read-protocol/sql/item_cmpfunc.h at master · FlashSQL/write-after-read-protocol · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
FlashSQL
/
write-after-read-protocol
Public
forked from
MahletNigusse/write-after-read-protocol
Notifications
You must be signed in to change notification settings
Fork
0
Star
9
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
write-after-read-protocol
/
sql
/
item_cmpfunc.h
Copy path
More file actions
More file actions
Latest commit
History
History
History
2336 lines (2030 loc) · 73.5 KB
Breadcrumbs
write-after-read-protocol
/
sql
/
item_cmpfunc.h
Copy path
File metadata and controls
2336 lines (2030 loc) · 73.5 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#
ifndef
ITEM_CMPFUNC_INCLUDED
#
define
ITEM_CMPFUNC_INCLUDED
/*
Copyright (c) 2000, 2017, Oracle and/or its affiliates. All rights reserved.
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*
compare and test functions
*/
#
include
"
mem_root_array.h
"
//
Mem_root_array
#
include
"
my_regex.h
"
//
my_regex_t
#
include
"
item_func.h
"
//
Item_int_func
#
include
"
item_row.h
"
//
Item_row
#
include
"
template_utils.h
"
//
down_cast
class
Arg_comparator
;
class
Item_sum_hybrid
;
class
Item_row
;
struct
Json_scalar_holder
;
typedef
int
(Arg_comparator::*arg_cmp_func)();
typedef
int
(*Item_field_cmpfunc)(Item_field *f1, Item_field *f2,
void
*arg);
class
Arg_comparator
:
public
Sql_alloc
{
Item **a, **b;
arg_cmp_func func;
Item_result_field *owner;
Arg_comparator *comparators;
//
used only for compare_row()
uint16 comparator_count;
double
precision;
/*
Fields used in DATE/DATETIME comparison.
*/
Item *a_cache, *b_cache;
//
Cached values of a and b items
bool
is_nulls_eq;
//
TRUE <=> compare for the EQUAL_FUNC
bool
set_null;
//
TRUE <=> set owner->null_value
//
when one of arguments is NULL.
longlong
(*get_value_a_func)(
THD
*thd, Item ***item_arg, Item **cache_arg,
const
Item *warn_item,
bool
*is_null);
longlong
(*get_value_b_func)(
THD
*thd, Item ***item_arg, Item **cache_arg,
const
Item *warn_item,
bool
*is_null);
bool
try_year_cmp_func
(Item_result type);
static
bool
get_date_from_const
(Item *date_arg, Item *str_arg,
ulonglong *value);
/*
*
Only used by compare_json() in the case where a JSON value is
compared to an SQL value. This member points to pre-allocated
memory that can be used instead of the heap when converting the
SQL value to a JSON value.
*/
Json_scalar_holder *json_scalar;
public:
DTCollation cmp_collation;
/*
Allow owner function to use string buffers.
*/
String value1, value2;
Arg_comparator
(): comparators(
0
), comparator_count(
0
),
a_cache
(
0
), b_cache(
0
), set_null(
TRUE
),
get_value_a_func(
0
), get_value_b_func(
0
), json_scalar(
0
)
{}
Arg_comparator
(Item **a1, Item **a2): a(a1), b(a2),
comparators(
0
), comparator_count(
0
),
a_cache(
0
), b_cache(
0
), set_null(
TRUE
),
get_value_a_func(
0
), get_value_b_func(
0
), json_scalar(
0
)
{}
int
set_compare_func
(Item_result_field *owner, Item_result type);
inline
int
set_compare_func
(Item_result_field *owner_arg)
{
return
set_compare_func
(owner_arg,
item_cmp_type
((*a)->
result_type
(),
(*b)->
result_type
()));
}
int
set_cmp_func
(Item_result_field *owner_arg,
Item **a1, Item **a2,
Item_result type);
int
set_cmp_func
(Item_result_field *owner_arg,
Item **a1, Item **a2,
bool
set_null_arg);
inline
int
compare
() {
return
(
this
->*func)(); }
int
compare_string
();
//
compare args[0] & args[1]
int
compare_binary_string
();
//
compare args[0] & args[1]
int
compare_real
();
//
compare args[0] & args[1]
int
compare_decimal
();
//
compare args[0] & args[1]
int
compare_int_signed
();
//
compare args[0] & args[1]
int
compare_int_signed_unsigned
();
int
compare_int_unsigned_signed
();
int
compare_int_unsigned
();
int
compare_time_packed
();
int
compare_e_time_packed
();
int
compare_row
();
//
compare args[0] & args[1]
int
compare_e_string
();
//
compare args[0] & args[1]
int
compare_e_binary_string
();
//
compare args[0] & args[1]
int
compare_e_real
();
//
compare args[0] & args[1]
int
compare_e_decimal
();
//
compare args[0] & args[1]
int
compare_e_int
();
//
compare args[0] & args[1]
int
compare_e_int_diff_signedness
();
int
compare_e_row
();
//
compare args[0] & args[1]
int
compare_real_fixed
();
int
compare_e_real_fixed
();
int
compare_datetime
();
//
compare args[0] & args[1] as DATETIMEs
int
compare_json
();
static
bool
can_compare_as_dates
(Item *a, Item *b, ulonglong *const_val_arg);
Item**
cache_converted_constant
(
THD
*thd, Item **value, Item **cache,
Item_result type);
void
set_datetime_cmp_func
(Item_result_field *owner_arg, Item **a1, Item **b1);
static
arg_cmp_func comparator_matrix [
5
][
2
];
inline
bool
is_owner_equal_func
()
{
return
(owner->
type
() == Item::
FUNC_ITEM
&&
((Item_func*)owner)->
functype
() == Item_func::
EQUAL_FUNC
);
}
void
cleanup
();
/*
Set correct cmp_context if items would be compared as INTs.
*/
inline
void
set_cmp_context_for_datetime
()
{
DBUG_ASSERT
(func == &Arg_comparator::compare_datetime);
if
((*a)->
is_temporal
())
(*a)->
cmp_context
=
INT_RESULT
;
if
((*b)->
is_temporal
())
(*b)->
cmp_context
=
INT_RESULT
;
}
friend
class
Item_func
;
};
class
Item_bool_func
:
public
Item_int_func
{
public:
Item_bool_func
() : Item_int_func(), m_created_by_in2exists(
false
) {}
explicit
Item_bool_func
(
const
POS
&pos)
: Item_int_func(pos), m_created_by_in2exists(
false
)
{}
Item_bool_func
(Item *a) : Item_int_func(a),
m_created_by_in2exists
(
false
) {}
Item_bool_func
(
const
POS
&pos, Item *a) : Item_int_func(pos, a),
m_created_by_in2exists(
false
) {}
Item_bool_func
(Item *a,Item *b) : Item_int_func(a,b),
m_created_by_in2exists(
false
) {}
Item_bool_func
(
const
POS
&pos, Item *a,Item *b) : Item_int_func(pos, a,b),
m_created_by_in2exists(
false
) {}
Item_bool_func
(
THD
*thd, Item_bool_func *item) : Item_int_func(thd, item),
m_created_by_in2exists(item->m_created_by_in2exists) {}
bool
is_bool_func
() {
return
1
; }
void
fix_length_and_dec
() { decimals=
0
; max_length=
1
; }
uint
decimal_precision
()
const
{
return
1
; }
virtual
bool
created_by_in2exists
()
const
{
return
m_created_by_in2exists; }
void
set_created_by_in2exists
() { m_created_by_in2exists=
true
; }
private:
/*
*
True <=> this item was added by IN->EXISTS subquery transformation, and
should thus be deleted if we switch to materialization.
*/
bool
m_created_by_in2exists;
};
/*
*
Abstract Item class, to represent <code>X IS [NOT] (TRUE | FALSE)</code>
boolean predicates.
*/
class
Item_func_truth
:
public
Item_bool_func
{
public:
virtual
bool
val_bool
();
virtual
longlong
val_int
();
virtual
void
fix_length_and_dec
();
virtual
void
print
(String *str, enum_query_type query_type);
protected:
Item_func_truth
(
const
POS
&pos, Item *a,
bool
a_value,
bool
a_affirmative)
: Item_bool_func(pos, a), value(a_value), affirmative(a_affirmative)
{}
~Item_func_truth
()
{}
private:
/*
*
True for <code>X IS [NOT] TRUE</code>,
false for <code>X IS [NOT] FALSE</code> predicates.
*/
const
bool
value;
/*
*
True for <code>X IS Y</code>, false for <code>X IS NOT Y</code> predicates.
*/
const
bool
affirmative;
};
/*
*
This Item represents a <code>X IS TRUE</code> boolean predicate.
*/
class
Item_func_istrue
:
public
Item_func_truth
{
public:
Item_func_istrue
(
const
POS
&pos, Item *a)
: Item_func_truth(pos, a,
true
,
true
)
{}
~Item_func_istrue
() {}
virtual
const
char
*
func_name
()
const
{
return
"
istrue
"
; }
};
/*
*
This Item represents a <code>X IS NOT TRUE</code> boolean predicate.
*/
class
Item_func_isnottrue
:
public
Item_func_truth
{
public:
Item_func_isnottrue
(
const
POS
&pos, Item *a)
: Item_func_truth(pos, a,
true
,
false
)
{}
~Item_func_isnottrue
() {}
virtual
const
char
*
func_name
()
const
{
return
"
isnottrue
"
; }
};
/*
*
This Item represents a <code>X IS FALSE</code> boolean predicate.
*/
class
Item_func_isfalse
:
public
Item_func_truth
{
public:
Item_func_isfalse
(
const
POS
&pos, Item *a)
: Item_func_truth(pos, a,
false
,
true
)
{}
~Item_func_isfalse
() {}
virtual
const
char
*
func_name
()
const
{
return
"
isfalse
"
; }
};
/*
*
This Item represents a <code>X IS NOT FALSE</code> boolean predicate.
*/
class
Item_func_isnotfalse
:
public
Item_func_truth
{
public:
Item_func_isnotfalse
(
const
POS
&pos, Item *a)
: Item_func_truth(pos, a,
false
,
false
)
{}
~Item_func_isnotfalse
() {}
virtual
const
char
*
func_name
()
const
{
return
"
isnotfalse
"
; }
};
class
Item_cache
;
#
define
UNKNOWN
((my_bool)-
1
)
/*
Item_in_optimizer(left_expr, Item_in_subselect(...))
Item_in_optimizer is used to wrap an instance of Item_in_subselect. This
class does the following:
- Evaluate the left expression and store it in Item_cache_* object (to
avoid re-evaluating it many times during subquery execution)
- Shortcut the evaluation of "NULL IN (...)" to NULL in the cases where we
don't care if the result is NULL or FALSE.
args[1] keeps a reference to the Item_in_subselect object.
args[0] is a copy of Item_in_subselect's left expression and should be
kept equal also after resolving.
NOTE
It is not quite clear why the above listed functionality should be
placed into a separate class called 'Item_in_optimizer'.
*/
class
Item_in_optimizer
:
public
Item_bool_func
{
private:
Item_cache *cache;
bool
save_cache;
/*
Stores the value of "NULL IN (SELECT ...)" for uncorrelated subqueries:
UNKNOWN - "NULL in (SELECT ...)" has not yet been evaluated
FALSE - result is FALSE
TRUE - result is NULL
*/
my_bool result_for_null_param;
public:
Item_in_optimizer
(Item *a, Item_in_subselect *b):
Item_bool_func
(a,
reinterpret_cast
<Item *>(b)), cache(
0
),
save_cache
(
0
), result_for_null_param(
UNKNOWN
)
{ with_subselect=
TRUE
; }
bool
fix_fields
(
THD
*, Item **);
bool
fix_left
(
THD
*thd, Item **ref);
void
fix_after_pullout
(st_select_lex *parent_select,
st_select_lex *removed_select);
bool
is_null
();
longlong
val_int
();
void
cleanup
();
const
char
*
func_name
()
const
{
return
"
<in_optimizer>
"
; }
Item_cache **
get_cache
() {
return
&cache; }
void
keep_top_level_cache
();
Item *
transform
(Item_transformer transformer, uchar *arg);
void
replace_argument
(
THD
*thd, Item **oldpp, Item *newp);
};
//
/ Abstract factory interface for creating comparison predicates.
class
Comp_creator
{
public:
virtual
~Comp_creator
() {}
virtual
Item_bool_func*
create
(Item *a, Item *b)
const
= 0;
//
/ This interface is only used by Item_allany_subselect.
virtual
const
char
*
symbol
(
bool
invert)
const
= 0;
virtual
bool
eqne_op
()
const
= 0;
virtual
bool
l_op
()
const
= 0;
};
//
/ Abstract base class for the comparison operators =, <> and <=>.
class
Linear_comp_creator
:
public
Comp_creator
{
public:
virtual
Item_bool_func *
create
(Item *a, Item *b)
const
;
virtual
bool
eqne_op
()
const
{
return
true
; }
virtual
bool
l_op
()
const
{
return
false
; }
protected:
/*
*
Creates only an item tree node, without attempting to rewrite row
constructors.
@see create()
*/
virtual
Item_bool_func *
create_scalar_predicate
(Item *a, Item *b)
const
= 0;
//
/ Combines a list of conditions <code>exp op exp</code>.
virtual
Item_bool_func *
combine
(List<Item> list)
const
= 0;
};
class
Eq_creator
:
public
Linear_comp_creator
{
public:
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert ?
"
<>
"
:
"
=
"
; }
protected:
virtual
Item_bool_func *
create_scalar_predicate
(Item *a, Item *b)
const
;
virtual
Item_bool_func *
combine
(List<Item> list)
const
;
};
class
Equal_creator
:
public
Linear_comp_creator
{
public:
virtual
const
char
*
symbol
(
bool
invert)
const
{
//
This will never be called with true.
DBUG_ASSERT
(!invert);
return
"
<=>
"
;
}
protected:
virtual
Item_bool_func *
create_scalar_predicate
(Item *a, Item *b)
const
;
virtual
Item_bool_func *
combine
(List<Item> list)
const
;
};
class
Ne_creator
:
public
Linear_comp_creator
{
public:
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert ?
"
=
"
:
"
<>
"
; }
protected:
virtual
Item_bool_func *
create_scalar_predicate
(Item *a, Item *b)
const
;
virtual
Item_bool_func *
combine
(List<Item> list)
const
;
};
class
Gt_creator
:
public
Comp_creator
{
public:
Gt_creator
() {}
/*
Remove gcc warning
*/
virtual
~Gt_creator
() {}
/*
Remove gcc warning
*/
virtual
Item_bool_func*
create
(Item *a, Item *b)
const
;
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert?
"
<=
"
:
"
>
"
; }
virtual
bool
eqne_op
()
const
{
return
0
; }
virtual
bool
l_op
()
const
{
return
0
; }
};
class
Lt_creator
:
public
Comp_creator
{
public:
Lt_creator
() {}
/*
Remove gcc warning
*/
virtual
~Lt_creator
() {}
/*
Remove gcc warning
*/
virtual
Item_bool_func*
create
(Item *a, Item *b)
const
;
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert?
"
>=
"
:
"
<
"
; }
virtual
bool
eqne_op
()
const
{
return
0
; }
virtual
bool
l_op
()
const
{
return
1
; }
};
class
Ge_creator
:
public
Comp_creator
{
public:
Ge_creator
() {}
/*
Remove gcc warning
*/
virtual
~Ge_creator
() {}
/*
Remove gcc warning
*/
virtual
Item_bool_func*
create
(Item *a, Item *b)
const
;
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert?
"
<
"
:
"
>=
"
; }
virtual
bool
eqne_op
()
const
{
return
0
; }
virtual
bool
l_op
()
const
{
return
0
; }
};
class
Le_creator
:
public
Comp_creator
{
public:
Le_creator
() {}
/*
Remove gcc warning
*/
virtual
~Le_creator
() {}
/*
Remove gcc warning
*/
virtual
Item_bool_func*
create
(Item *a, Item *b)
const
;
virtual
const
char
*
symbol
(
bool
invert)
const
{
return
invert?
"
>
"
:
"
<=
"
; }
virtual
bool
eqne_op
()
const
{
return
0
; }
virtual
bool
l_op
()
const
{
return
1
; }
};
class
Item_bool_func2
:
public
Item_bool_func
{
/*
Bool with 2 string args
*/
private:
bool
convert_constant_arg
(
THD
*thd, Item *field, Item **item);
protected:
Arg_comparator cmp;
bool
abort_on_null;
public:
Item_bool_func2
(Item *a,Item *b)
:Item_bool_func(a,b), cmp(tmp_arg, tmp_arg+
1
), abort_on_null(
FALSE
) {}
Item_bool_func2
(
const
POS
&pos, Item *a,Item *b)
:Item_bool_func(pos, a,b), cmp(tmp_arg, tmp_arg+
1
), abort_on_null(
FALSE
)
{}
void
fix_length_and_dec
();
int
set_cmp_func
()
{
return
cmp.
set_cmp_func
(
this
, tmp_arg, tmp_arg+
1
,
TRUE
);
}
optimize_type
select_optimize
()
const
{
return
OPTIMIZE_OP
; }
virtual
enum
Functype
rev_functype
()
const
{
return
UNKNOWN_FUNC
; }
bool
have_rev_func
()
const
{
return
rev_functype
() !=
UNKNOWN_FUNC
; }
virtual
inline
void
print
(String *str, enum_query_type query_type)
{
Item_func::print_op
(str, query_type);
}
bool
is_null
() {
return
MY_TEST
(args[
0
]->
is_null
() || args[
1
]->
is_null
()); }
const
CHARSET_INFO
*
compare_collation
()
{
return
cmp.
cmp_collation
.
collation
; }
void
top_level_item
() { abort_on_null=
TRUE
; }
void
cleanup
()
{
Item_bool_func::cleanup
();
cmp.
cleanup
();
}
friend
class
Arg_comparator
;
};
class
Item_bool_rowready_func2
:
public
Item_bool_func2
{
public:
Item_bool_rowready_func2
(Item *a, Item *b) :Item_bool_func2(a, b)
{
allowed_arg_cols=
0
;
//
Fetch this value from first argument
}
Item_bool_rowready_func2
(
const
POS
&pos, Item *a, Item *b)
: Item_bool_func2(pos, a, b)
{
allowed_arg_cols=
0
;
//
Fetch this value from first argument
}
Item *
neg_transformer
(
THD
*thd);
virtual
Item *
negated_item
();
bool
subst_argument_checker
(uchar **arg) {
return
TRUE
; }
};
/*
*
XOR inherits from Item_bool_func2 because it is not optimized yet.
Later, when XOR is optimized, it needs to inherit from
Item_cond instead. See WL#5800.
*/
class
Item_func_xor
:
public
Item_bool_func2
{
public:
Item_func_xor
(Item *i1, Item *i2) :Item_bool_func2(i1, i2) {}
Item_func_xor
(
const
POS
&pos, Item *i1, Item *i2)
: Item_bool_func2(pos, i1, i2)
{}
enum
Functype
functype
()
const
{
return
XOR_FUNC
; }
const
char
*
func_name
()
const
{
return
"
xor
"
; }
longlong
val_int
();
void
top_level_item
() {}
Item *
neg_transformer
(
THD
*thd);
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_not
:
public
Item_bool_func
{
public:
Item_func_not
(Item *a) :Item_bool_func(a) {}
Item_func_not
(
const
POS
&pos, Item *a) :Item_bool_func(pos, a) {}
longlong
val_int
();
enum
Functype
functype
()
const
{
return
NOT_FUNC
; }
const
char
*
func_name
()
const
{
return
"
not
"
; }
Item *
neg_transformer
(
THD
*thd);
virtual
void
print
(String *str, enum_query_type query_type);
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_maxmin_subselect
;
class
JOIN
;
/*
trigcond<param>(arg) ::= param? arg : TRUE
The class Item_func_trig_cond is used for guarded predicates
which are employed only for internal purposes.
A guarded predicate is an object consisting of an a regular or
a guarded predicate P and a pointer to a boolean guard variable g.
A guarded predicate P/g is evaluated to true if the value of the
guard g is false, otherwise it is evaluated to the same value that
the predicate P: val(P/g)= g ? val(P):true.
Guarded predicates allow us to include predicates into a conjunction
conditionally. Currently they are utilized for pushed down predicates
in queries with outer join operations.
In the future, probably, it makes sense to extend this class to
the objects consisting of three elements: a predicate P, a pointer
to a variable g and a firing value s with following evaluation
rule: val(P/g,s)= g==s? val(P) : true. It will allow us to build only
one item for the objects of the form P/g1/g2...
Objects of this class are built only for query execution after
the execution plan has been already selected. That's why this
class needs only val_int out of generic methods.
Current uses of Item_func_trig_cond objects:
- To wrap selection conditions when executing outer joins
- To wrap condition that is pushed down into subquery
*/
class
Item_func_trig_cond
:
public
Item_bool_func
{
public:
enum
enum_trig_type
{
/*
*
This trigger type deactivates join conditions when a row has been
NULL-complemented. For example, in t1 LEFT JOIN t2, the join condition
can be tested on t2's row only if that row is not NULL-complemented.
*/
IS_NOT_NULL_COMPL
,
/*
*
This trigger type deactivates predicated from WHERE condition when no
row satisfying the join condition has been found. For Example, in t1
LEFT JOIN t2, the where condition pushed to t2 can be tested only after
at least one t2 row has been produced, which may be a NULL-complemented
row.
*/
FOUND_MATCH
,
/*
*
In IN->EXISTS subquery transformation, new predicates are added:
WHERE inner_field=outer_field OR inner_field IS NULL,
as well as
HAVING inner_field IS NOT NULL,
are disabled if outer_field is a NULL value
*/
OUTER_FIELD_IS_NOT_NULL
};
private:
/*
* Pointer to trigger variable
*/
bool
*trig_var;
//
/ Optional: JOIN of table which is the source of trig_var
const
JOIN
*m_join;
//
/ Optional: if join!=NULL: index of table
plan_idx m_idx;
/*
* Type of trig_var; for printing
*/
enum_trig_type trig_type;
public:
/*
*
@param a the item for <condition>
@param f pointer to trigger variable
@param join if a table's property is the source of 'f', JOIN
which owns this table; NULL otherwise.
@param idx if join!=NULL: index of this table in the
JOIN_TAB/QEP_TAB array. NO_PLAN_IDX otherwise.
@param trig_type_arg type of 'f'
*/
Item_func_trig_cond
(Item *a,
bool
*f,
JOIN
*join, plan_idx idx,
enum_trig_type trig_type_arg)
: Item_bool_func(a), trig_var(f), m_join(join), m_idx(idx),
trig_type
(trig_type_arg)
{}
longlong
val_int
();
enum
Functype
functype
()
const
{
return
TRIG_COND_FUNC
; };
//
/ '<if>', to distinguish from the if() SQL function
const
char
*
func_name
()
const
{
return
"
<if>
"
; };
bool
const_item
()
const
{
return
FALSE
; }
bool
*
get_trig_var
() {
return
trig_var; }
/*
The following is needed for ICP:
*/
table_map
used_tables
()
const
{
return
args[
0
]->
used_tables
(); }
void
print
(String *str, enum_query_type query_type);
};
class
Item_func_not_all
:
public
Item_func_not
{
/*
allow to check presence of values in max/min optimization
*/
Item_sum_hybrid *test_sum_item;
Item_maxmin_subselect *test_sub_item;
Item_subselect *subselect;
bool
abort_on_null;
public:
bool
show;
Item_func_not_all
(Item *a)
:Item_func_not(a), test_sum_item(
0
), test_sub_item(
0
), subselect(
0
),
abort_on_null
(
0
), show(
0
)
{}
virtual
void
top_level_item
() { abort_on_null=
1
; }
bool
is_top_level_item
()
const
{
return
abort_on_null; }
longlong
val_int
();
enum
Functype
functype
()
const
{
return
NOT_ALL_FUNC
; }
const
char
*
func_name
()
const
{
return
"
<not>
"
; }
virtual
void
print
(String *str, enum_query_type query_type);
void
set_sum_test
(Item_sum_hybrid *item) { test_sum_item= item; };
void
set_sub_test
(Item_maxmin_subselect *item) { test_sub_item= item; };
void
set_subselect
(Item_subselect *item) { subselect= item; }
table_map
not_null_tables
()
const
{
/*
See handling of not_null_tables_cache in
Item_in_optimizer::fix_fields().
This item is the result of a transformation from an ALL clause
such as
left-expr < ALL(subquery)
into
<not>(left-expr >= (subquery)
An inequality usually rejects NULLs from both operands, so the
not_null_tables() of the inequality is the union of the
null-rejecting tables of both operands. However, since this is a
transformed ALL clause that should return true if the subquery
is empty (even if left-expr is NULL), it is not null rejecting
for left-expr. The not null tables mask for left-expr should be
removed, leaving only the null-rejecting tables of the
subquery. Item_subselect::not_null_tables() always returns 0 (no
null-rejecting tables). Therefore, always return 0.
*/
return
0
;
}
bool
empty_underlying_subquery
();
Item *
neg_transformer
(
THD
*thd);
};
class
Item_func_nop_all
:
public
Item_func_not_all
{
public:
Item_func_nop_all
(Item *a) :Item_func_not_all(a) {}
longlong
val_int
();
const
char
*
func_name
()
const
{
return
"
<nop>
"
; }
table_map
not_null_tables
()
const
{
return
not_null_tables_cache; }
Item *
neg_transformer
(
THD
*thd);
};
class
Item_func_eq
:
public
Item_bool_rowready_func2
{
public:
Item_func_eq
(Item *a,Item *b) :
Item_bool_rowready_func2
( a, b)
{}
Item_func_eq
(
const
POS
&pos, Item *a,Item *b) :
Item_bool_rowready_func2
(pos, a, b)
{}
longlong
val_int
();
enum
Functype
functype
()
const
{
return
EQ_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
EQ_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_TRUE
; }
const
char
*
func_name
()
const
{
return
"
=
"
; }
Item *
negated_item
();
virtual
bool
equality_substitution_analyzer
(uchar **arg) {
return
true
; }
virtual
Item*
equality_substitution_transformer
(uchar *arg);
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_equal
:
public
Item_bool_rowready_func2
{
public:
Item_func_equal
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
Item_func_equal
(
const
POS
&pos, Item *a,Item *b)
: Item_bool_rowready_func2(pos, a,b)
{};
longlong
val_int
();
void
fix_length_and_dec
();
table_map
not_null_tables
()
const
{
return
0
; }
enum
Functype
functype
()
const
{
return
EQUAL_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
EQUAL_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_TRUE
; }
const
char
*
func_name
()
const
{
return
"
<=>
"
; }
Item *
neg_transformer
(
THD
*thd) {
return
0
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_ge
:
public
Item_bool_rowready_func2
{
public:
Item_func_ge
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
longlong
val_int
();
enum
Functype
functype
()
const
{
return
GE_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
LE_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_TRUE
; }
const
char
*
func_name
()
const
{
return
"
>=
"
; }
Item *
negated_item
();
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_gt
:
public
Item_bool_rowready_func2
{
public:
Item_func_gt
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
longlong
val_int
();
enum
Functype
functype
()
const
{
return
GT_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
LT_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_FALSE
; }
const
char
*
func_name
()
const
{
return
"
>
"
; }
Item *
negated_item
();
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_le
:
public
Item_bool_rowready_func2
{
public:
Item_func_le
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {};
longlong
val_int
();
enum
Functype
functype
()
const
{
return
LE_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
GE_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_TRUE
; }
const
char
*
func_name
()
const
{
return
"
<=
"
; }
Item *
negated_item
();
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_lt
:
public
Item_bool_rowready_func2
{
public:
Item_func_lt
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {}
longlong
val_int
();
enum
Functype
functype
()
const
{
return
LT_FUNC
; }
enum
Functype
rev_functype
()
const
{
return
GT_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_FALSE
; }
const
char
*
func_name
()
const
{
return
"
<
"
; }
Item *
negated_item
();
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_ne
:
public
Item_bool_rowready_func2
{
public:
Item_func_ne
(Item *a,Item *b) :Item_bool_rowready_func2(a,b) {}
longlong
val_int
();
enum
Functype
functype
()
const
{
return
NE_FUNC
; }
cond_result
eq_cmp_result
()
const
{
return
COND_FALSE
; }
optimize_type
select_optimize
()
const
{
return
OPTIMIZE_KEY
; }
const
char
*
func_name
()
const
{
return
"
<>
"
; }
Item *
negated_item
();
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
/*
The class Item_func_opt_neg is defined to factor out the functionality
common for the classes Item_func_between and Item_func_in. The objects
of these classes can express predicates or there negations.
The alternative approach would be to create pairs Item_func_between,
Item_func_notbetween and Item_func_in, Item_func_notin.
*/
class
Item_func_opt_neg
:
public
Item_int_func
{
public:
bool
negated;
/*
<=> the item represents NOT <func>
*/
bool
pred_level;
/*
<=> [NOT] <func> is used on a predicate level
*/
public:
Item_func_opt_neg
(
const
POS
&pos, Item *a, Item *b, Item *c,
bool
is_negation)
:Item_int_func(pos, a, b, c), negated(
0
), pred_level(
0
)
{
if
(is_negation)
negate
();
}
Item_func_opt_neg
(
const
POS
&pos, PT_item_list *list,
bool
is_negation)
:Item_int_func(pos, list), negated(
0
), pred_level(
0
)
{
if
(is_negation)
negate
();
}
public:
inline
void
negate
() { negated= !negated; }
inline
void
top_level_item
() { pred_level=
1
; }
bool
is_top_level_item
()
const
{
return
pred_level; }
Item *
neg_transformer
(
THD
*thd)
{
negated= !negated;
return
this
;
}
bool
eq
(
const
Item *item,
bool
binary_cmp)
const
;
bool
subst_argument_checker
(uchar **arg) {
return
TRUE
; }
};
class
Item_func_between
:
public
Item_func_opt_neg
{
DTCollation cmp_collation;
public:
Item_result cmp_type;
String value0,value1,value2;
/*
TRUE <=> arguments will be compared as dates.
*/
bool
compare_as_dates_with_strings;
bool
compare_as_temporal_dates;
bool
compare_as_temporal_times;
/*
Comparators used for DATE/DATETIME comparison.
*/
Arg_comparator ge_cmp, le_cmp;
Item_func_between
(
const
POS
&pos, Item *a, Item *b, Item *c,
bool
is_negation)
:Item_func_opt_neg(pos, a, b, c, is_negation),
compare_as_dates_with_strings
(
FALSE
),
compare_as_temporal_dates(
FALSE
),
compare_as_temporal_times(
FALSE
) {}
longlong
val_int
();
optimize_type
select_optimize
()
const
{
return
OPTIMIZE_KEY
; }
enum
Functype
functype
()
const
{
return
BETWEEN
; }
const
char
*
func_name
()
const
{
return
"
between
"
; }
bool
fix_fields
(
THD
*, Item **);
void
fix_after_pullout
(st_select_lex *parent_select,
st_select_lex *removed_select);
void
fix_length_and_dec
();
virtual
void
print
(String *str, enum_query_type query_type);
bool
is_bool_func
() {
return
1
; }
const
CHARSET_INFO
*
compare_collation
() {
return
cmp_collation.
collation
; }
uint
decimal_precision
()
const
{
return
1
; }
bool
gc_subst_analyzer
(uchar **arg) {
return
true
; }
float
get_filtering_effect
(table_map filter_for_table,
table_map read_tables,
const
MY_BITMAP
*fields_to_ignore,
double
rows_in_table);
};
class
Item_func_strcmp
:
public
Item_bool_func2
{
public:
Item_func_strcmp
(
const
POS
&pos, Item *a, Item *b) :Item_bool_func2(pos, a, b)
{}
longlong
val_int
();
optimize_type
select_optimize
()
const
{
return
OPTIMIZE_NONE
; }
const
char
*
func_name
()
const
{
return
"
strcmp
"
; }
virtual
inline
void
print
(String *str, enum_query_type query_type)
{
Item_func::print
(str, query_type);
}
void
fix_length_and_dec
()
{
Item_bool_func2::fix_length_and_dec
();
fix_char_length
(
2
);
//
returns "1" or "0" or "-1"
}
};
struct
interval_range
{
Item_result type;
double
dbl;
my_decimal dec;
};
class
Item_func_interval
:
public
Item_int_func
{
typedef
Item_int_func super;
Item_row *row;
my_bool use_decimal_comparison;
interval_range *intervals;
public:
Item_func_interval
(
const
POS
&pos,
MEM_ROOT
*mem_root, Item *expr1,
Item *expr2,
class
PT_item_list
*opt_expr_list=
NULL
)
:super(pos, alloc_row(pos, mem_root, expr1, expr2, opt_expr_list)),
intervals
(
0
)
{
allowed_arg_cols=
0
;
//
Fetch this value from first argument
}
virtual
bool
itemize
(Parse_context *pc, Item **res);
longlong
val_int
();
void
fix_length_and_dec
();
const
char
*
func_name
()
const
{
return
"
interval
"
; }
uint
decimal_precision
()
const
{
return
2
; }
void
print
(String *str, enum_query_type query_type);
private:
Item_row *
alloc_row
(
const
POS
&pos,
MEM_ROOT
*mem_root, Item *expr1,
Item *expr2,
class
PT_item_list
*opt_expr_list);
};
class
Item_func_coalesce
:
public
Item_func_numhybrid
{
protected:
enum_field_types cached_field_type;
Item_func_coalesce
(
const
POS
&pos, Item *a, Item *b)
: Item_func_numhybrid(pos, a, b)
{}
Item_func_coalesce
(
const
POS
&pos, Item *a)
: Item_func_numhybrid(pos, a)
{}
public:
Item_func_coalesce
(
const
POS
&pos, PT_item_list *list);
double
real_op
();
longlong
int_op
();
String *
str_op
(String *);
/*
*
Get the result of COALESCE as a JSON value.
@param[in,out] wr the result value holder
View remainder of file in raw view
Back
|
FazBrowse Home
|
New Git URL