CUBRID Engine  latest
Classes | Macros | Typedefs | Functions | Variables
query_bitset.h File Reference
#include <stdio.h>
#include <string.h>
#include "optimizer.h"
Include dependency graph for query_bitset.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

struct  bitset
 
struct  bitset_iterator
 

Macros

#define NELEMENTS   64
 
#define _LOG2_WORDSIZE   5
 
#define _WORDSIZE   32 /* Number of bits in BITSET_CARRIER */
 
#define _MASK   ((1L << _LOG2_WORDSIZE) - 1)
 
#define _WORD(x)   ((x) >> _LOG2_WORDSIZE)
 
#define _BIT(x)   ((x) & _MASK)
 
#define NWORDS
 
#define BITSET_CLEAR(s)
 
#define BITSET_MEMBER(s, x)
 
#define BITPATTERN(s)   ((s).setp[0])
 
#define BITSET_MOVE(dst, src)
 

Typedefs

typedef unsigned int BITSET_CARRIER
 
typedef struct bitset_iterator BITSET_ITERATOR
 

Functions

void bitset_extend (BITSET *dst, int nwords)
 
void bitset_assign (BITSET *, const BITSET *)
 
void bitset_add (BITSET *, int)
 
void bitset_remove (BITSET *, int)
 
void bitset_union (BITSET *, const BITSET *)
 
void bitset_intersect (BITSET *, const BITSET *)
 
void bitset_difference (BITSET *, const BITSET *)
 
int bitset_subset (const BITSET *, const BITSET *)
 
int bitset_intersects (const BITSET *, const BITSET *)
 
int bitset_is_empty (const BITSET *)
 
int bitset_is_equivalent (const BITSET *, const BITSET *)
 
int bitset_cardinality (const BITSET *)
 
int bitset_iterate (const BITSET *, BITSET_ITERATOR *)
 
int bitset_next_member (BITSET_ITERATOR *)
 
int bitset_first_member (const BITSET *)
 
void bitset_print (const BITSET *, FILE *fp)
 
void bitset_init (BITSET *, QO_ENV *)
 
void bitset_delset (BITSET *)
 

Variables

BITSET EMPTY_SET
 

Macro Definition Documentation

#define _BIT (   x)    ((x) & _MASK)

Definition at line 43 of file query_bitset.h.

Referenced by bitset_add(), bitset_next_member(), and bitset_remove().

#define _LOG2_WORDSIZE   5

Definition at line 39 of file query_bitset.h.

#define _MASK   ((1L << _LOG2_WORDSIZE) - 1)

Definition at line 41 of file query_bitset.h.

#define _WORD (   x)    ((x) >> _LOG2_WORDSIZE)

Definition at line 42 of file query_bitset.h.

Referenced by bitset_add(), bitset_cardinality(), bitset_next_member(), and bitset_remove().

#define _WORDSIZE   32 /* Number of bits in BITSET_CARRIER */

Definition at line 40 of file query_bitset.h.

Referenced by bitset_next_member(), and qo_discover_partitions().

#define BITPATTERN (   s)    ((s).setp[0])

Definition at line 72 of file query_bitset.h.

#define BITSET_CLEAR (   s)
Value:
memset((char *)(s).setp, 0, \
(s).nwords * sizeof(BITSET_CARRIER))
BITSET_CARRIER
unsigned int BITSET_CARRIER
Definition: query_bitset.h:48

Definition at line 68 of file query_bitset.h.

Referenced by bitset_init(), gen_outer(), planner_permutate(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_segs(), qo_discover_edges(), qo_find_index_terms(), qo_optimize_helper(), qo_search_partition_join(), qo_search_planner(), qo_seg_nodes(), and qo_validate_index_attr_notnull().

#define BITSET_MEMBER (   s,
  x 
)
Value:
((_WORD(x) < (s).nwords) \
&& ((s).setp[_WORD(x)] & (1L << _BIT(x))))
_BIT
#define _BIT(x)
Definition: query_bitset.h:43
_WORD
#define _WORD(x)
Definition: query_bitset.h:42

Definition at line 70 of file query_bitset.h.

Referenced by bitset_cardinality(), gen_outer(), make_mergelist_proc(), planner_permutate(), planner_visit_node(), qo_analyze_term(), qo_assign_eq_classes(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_segs(), qo_discover_sort_limit_join_nodes(), qo_dump_planner_info(), qo_env_dump(), qo_eqclass_wrt(), qo_examine_merge_join(), qo_find_index_seg_terms(), qo_generate_join_index_scan(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_is_coverage_index(), qo_is_pk_fk_full_join(), qo_iscan_cost(), qo_optimize_helper(), qo_plan_order_by(), qo_search_partition(), qo_search_partition_join(), and qo_validate_index_term_notnull().

#define BITSET_MOVE (   dst,
  src 
)
Value:
do { \
(dst) = (src); \
if ((src).setp == (src).set.word) \
(dst).setp = (dst).set.word; \
} while(0)
if
if(extra_options)
Definition: dynamic_load.c:958

Definition at line 80 of file query_bitset.h.

Referenced by add_local_subquery().

#define NELEMENTS   64

Definition at line 37 of file query_bitset.h.

Referenced by qo_find_node_indexes().

#define NWORDS
Value:
(((NELEMENTS + (_WORDSIZE-1)) & ~(_WORDSIZE-1)) \
>> _LOG2_WORDSIZE)
_LOG2_WORDSIZE
#define _LOG2_WORDSIZE
Definition: query_bitset.h:39
_WORDSIZE
#define _WORDSIZE
Definition: query_bitset.h:40
NELEMENTS
#define NELEMENTS
Definition: query_bitset.h:37

Definition at line 45 of file query_bitset.h.

Referenced by bitset_init().

Typedef Documentation

typedef unsigned int BITSET_CARRIER

Definition at line 48 of file query_bitset.h.

typedef struct bitset_iterator BITSET_ITERATOR

Definition at line 49 of file query_bitset.h.

Function Documentation

void bitset_add ( BITSET *  ,
int   
)

Definition at line 138 of file query_bitset.c.

References _BIT, _WORD, and bitset_extend().

Referenced by add_hint(), check_subquery_pre(), gen_outer(), make_outer_instnum(), make_pred_from_plan(), planner_permutate(), planner_visit_node(), qo_add_dep_term(), qo_add_dummy_join_term(), qo_add_term(), qo_alloc_planner(), qo_analyze_term(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_discover_indexes(), qo_discover_partitions(), qo_discover_sort_limit_join_nodes(), qo_eqclass_add(), qo_examine_correlated_index(), qo_find_index_seg_terms(), qo_find_index_segs(), qo_find_index_terms(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_index_scan_new(), qo_insert_segment(), qo_node_add_sarg(), qo_optimize_helper(), qo_search_isnull_key_expr(), qo_search_partition_join(), qo_search_planner(), qo_seg_nodes(), qo_validate_index_attr_notnull(), and set_seg_node().

void bitset_assign ( BITSET *  ,
const BITSET *   
)

Definition at line 120 of file query_bitset.c.

References bitset_extend(), and NBYTES.

Referenced by add_hint(), gen_inner(), gen_outer(), make_mergelist_proc(), planner_permutate(), planner_visit_node(), qo_add_dep_term(), qo_alloc_info(), qo_alloc_planner(), qo_analyze_term(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_segs(), qo_find_index_segs(), qo_follow_new(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_get_multi_col_range_segs(), qo_index_scan_new(), qo_join_new(), qo_scan_new(), qo_search_partition_join(), and qo_search_planner().

int bitset_cardinality ( const BITSET *  )

Definition at line 393 of file query_bitset.c.

References _WORD, BITSET_MEMBER, i, and nbits.

Referenced by get_term_rank(), make_mergelist_proc(), planner_visit_node(), qo_analyze_term(), qo_discover_edges(), qo_discover_partitions(), qo_discover_sort_limit_nodes(), qo_examine_idx_join(), qo_examine_nl_join(), qo_get_ils_prefix_length(), qo_get_xasl_index_info(), qo_index_covering_plans_cmp(), qo_is_iss_index(), qo_multi_range_opt_plans_cmp(), qo_plan_cmp(), qo_plan_compute_iscan_sort_list(), qo_plan_iscan_terms_cmp(), qo_plan_scan_print_json(), qo_plan_scan_print_text(), qo_scan_fprint(), qo_scan_info(), qo_search_partition(), qo_search_partition_join(), qo_top_plan_new(), and set_seg_expr().

void bitset_delset ( BITSET *  )

Definition at line 571 of file query_bitset.c.

References bitset_free, and NULL.

Referenced by gen_inner(), gen_outer(), get_local_subqueries_pre(), make_mergelist_proc(), planner_permutate(), planner_visit_node(), qo_analyze_term(), qo_assign_eq_classes(), qo_classify_outerjoin_terms(), qo_clean_planner(), qo_combine_partitions(), qo_compute_projected_segs(), qo_cp_new(), qo_discover_edges(), qo_discover_sort_limit_nodes(), qo_env_free(), qo_eqclass_free(), qo_examine_correlated_index(), qo_find_index_segs(), qo_find_node_indexes(), qo_free_index(), qo_free_info(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_generate_loose_index_scan(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_join_free(), qo_join_new(), qo_node_free(), qo_optimize_helper(), qo_partition_free(), qo_plan_add_to_free_list(), qo_scan_free(), qo_search_partition_join(), qo_search_planner(), qo_seg_free(), qo_subquery_free(), qo_term_free(), and qo_validate_index_attr_notnull().

void bitset_difference ( BITSET *  ,
const BITSET *   
)

Definition at line 224 of file query_bitset.c.

Referenced by gen_outer(), make_pred_from_plan(), planner_permutate(), planner_visit_node(), qo_discover_sort_limit_join_nodes(), qo_discover_sort_limit_nodes(), qo_generate_join_index_scan(), qo_index_scan_new(), qo_join_new(), and qo_search_partition_join().

Here is the caller graph for this function:

void bitset_extend ( BITSET *  dst,
int  nwords 
)

Definition at line 92 of file query_bitset.c.

References ARG_FILE_LINE, bitset_free, ER_ERROR_SEVERITY, ER_OUT_OF_VIRTUAL_MEMORY, er_set(), NBYTES, and NULL.

Referenced by bitset_add(), bitset_assign(), and bitset_union().

Here is the caller graph for this function:

int bitset_first_member ( const BITSET *  )

Definition at line 514 of file query_bitset.c.

References bitset_iterate().

Referenced by make_mergelist_proc(), qo_add_dep_term(), qo_analyze_term(), qo_discover_edges(), qo_discover_sort_limit_nodes(), qo_examine_correlated_index(), qo_examine_idx_join(), qo_examine_merge_join(), qo_examine_nl_join(), qo_generate_index_scan(), qo_join_new(), qo_plan_cmp(), and qo_search_partition().

Here is the caller graph for this function:

void bitset_init ( BITSET *  ,
QO_ENV *   
)

Definition at line 557 of file query_bitset.c.

References BITSET_CLEAR, and NWORDS.

Referenced by add_local_subquery(), gen_inner(), gen_outer(), get_local_subqueries_pre(), make_mergelist_proc(), planner_permutate(), planner_visit_node(), qo_alloc_index(), qo_alloc_info(), qo_alloc_planner(), qo_analyze_term(), qo_assign_eq_classes(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_segs(), qo_cp_new(), qo_discover_edges(), qo_discover_sort_limit_join_nodes(), qo_discover_sort_limit_nodes(), qo_env_new(), qo_eqclass_new(), qo_examine_correlated_index(), qo_examine_merge_join(), qo_find_index_segs(), qo_find_node_indexes(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_generate_loose_index_scan(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_join_new(), qo_node_clear(), qo_optimize_helper(), qo_partition_init(), qo_plan_malloc(), qo_scan_new(), qo_search_isnull_key_expr(), qo_search_partition_join(), qo_search_planner(), qo_seg_clear(), qo_term_clear(), and qo_validate_index_attr_notnull().

void bitset_intersect ( BITSET *  ,
const BITSET *   
)

Definition at line 200 of file query_bitset.c.

Referenced by gen_outer(), make_mergelist_proc(), qo_compute_projected_segs(), qo_index_scan_new(), and qo_search_planner().

Here is the caller graph for this function:

int bitset_intersects ( const BITSET *  ,
const BITSET *   
)

Definition at line 295 of file query_bitset.c.

Referenced by gen_outer(), planner_permutate(), qo_analyze_term(), qo_classify_outerjoin_terms(), qo_discover_edges(), qo_examine_correlated_index(), qo_examine_merge_join(), qo_examine_nl_join(), qo_find_index_terms(), qo_has_is_not_null_term(), qo_index_scan_new(), qo_join_new(), qo_search_isnull_key_expr(), qo_validate_index_attr_notnull(), and sort_partitions().

Here is the caller graph for this function:

int bitset_is_empty ( const BITSET *  )

Definition at line 318 of file query_bitset.c.

Referenced by add_subqueries(), bitset_print(), gen_outer(), get_local_subqueries_pre(), is_after_join_term(), is_normal_access_term(), is_normal_if_term(), is_totally_after_join_term(), planner_permutate(), planner_visit_node(), qo_analyze_term(), qo_check_new_best_plan_on_info(), qo_combine_partitions(), qo_discover_partitions(), qo_dump_planner_info(), qo_eqclass_fprint_wrt(), qo_generate_join_index_scan(), qo_generate_loose_index_scan(), qo_index_scan_new(), qo_iscan_cost(), qo_join_fprint(), qo_join_info(), qo_node_dump(), qo_optimize_helper(), qo_plan_cmp_prefer_covering_index(), qo_plan_join_print_json(), qo_plan_join_print_text(), qo_plan_print_outer_join_terms(), qo_plan_print_sarged_terms(), qo_plan_print_subqueries(), qo_scan_fprint(), qo_search_partition_join(), qo_search_planner(), qo_seq_scan_new(), and qo_sort_new().

int bitset_is_equivalent ( const BITSET *  ,
const BITSET *   
)

Definition at line 342 of file query_bitset.c.

Referenced by planner_visit_node(), qo_check_new_best_plan_on_info(), qo_classify_outerjoin_terms(), qo_discover_edges(), qo_join_new(), and qo_plan_iscan_terms_cmp().

Here is the caller graph for this function:

int bitset_iterate ( const BITSET *  ,
BITSET_ITERATOR *   
)

Definition at line 464 of file query_bitset.c.

References bitset_next_member(), bitset_iterator::next, and bitset_iterator::set.

Referenced by add_subqueries(), bitset_first_member(), bitset_has_path(), bitset_print(), gen_outer(), make_mergelist_proc(), make_namelist_from_projected_segs(), make_outer_instnum(), make_pred_from_bitset(), planner_nodeset_join_cost(), planner_permutate(), planner_visit_node(), qo_add_dep_term(), qo_analyze_term(), qo_check_parent_eq_class_for_multi_range_opt(), qo_check_seg_belongs_to_range_term(), qo_check_subplan_join_cond_for_multi_range_opt(), qo_check_subqueries_for_multi_range_opt(), qo_check_terms_for_multiple_range_opt(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_size(), qo_discover_edges(), qo_discover_indexes(), qo_discover_partitions(), qo_discover_sort_limit_join_nodes(), qo_discover_sort_limit_nodes(), qo_dump_planner_info(), qo_eqclass_dump(), qo_eqclass_wrt(), qo_examine_correlated_index(), qo_examine_merge_join(), qo_examine_nl_join(), qo_find_index_segs(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_get_multi_col_range_segs(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_iscan_cost(), qo_join_info(), qo_nljoin_cost(), qo_plan_compute_cost(), qo_plan_compute_iscan_sort_list(), qo_plan_print_projected_segs(), qo_plan_scan_print_json(), qo_plan_scan_print_text(), qo_scan_info(), qo_search_partition_join(), qo_search_planner(), qo_seg_nodes(), qo_subquery_dump(), qo_term_string(), qo_termset_fprint(), and qo_top_plan_new().

int bitset_next_member ( BITSET_ITERATOR *  )

Definition at line 478 of file query_bitset.c.

References _BIT, _WORD, _WORDSIZE, bitset_iterator::next, and bitset_iterator::set.

Referenced by add_subqueries(), bitset_has_path(), bitset_iterate(), bitset_print(), gen_outer(), make_mergelist_proc(), make_namelist_from_projected_segs(), make_outer_instnum(), make_pred_from_bitset(), planner_nodeset_join_cost(), planner_permutate(), planner_visit_node(), qo_add_dep_term(), qo_analyze_term(), qo_check_parent_eq_class_for_multi_range_opt(), qo_check_seg_belongs_to_range_term(), qo_check_subplan_join_cond_for_multi_range_opt(), qo_check_subqueries_for_multi_range_opt(), qo_check_terms_for_multiple_range_opt(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_compute_projected_size(), qo_discover_edges(), qo_discover_indexes(), qo_discover_partitions(), qo_discover_sort_limit_join_nodes(), qo_discover_sort_limit_nodes(), qo_dump_planner_info(), qo_eqclass_dump(), qo_eqclass_wrt(), qo_examine_correlated_index(), qo_examine_merge_join(), qo_examine_nl_join(), qo_find_index_segs(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_get_multi_col_range_segs(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_iscan_cost(), qo_join_info(), qo_nljoin_cost(), qo_plan_compute_cost(), qo_plan_compute_iscan_sort_list(), qo_plan_print_projected_segs(), qo_plan_scan_print_json(), qo_plan_scan_print_text(), qo_scan_info(), qo_search_partition_join(), qo_search_planner(), qo_seg_nodes(), qo_subquery_dump(), qo_term_string(), qo_termset_fprint(), and qo_top_plan_new().

void bitset_print ( const BITSET *  ,
FILE *  fp 
)

Definition at line 527 of file query_bitset.c.

References bitset_is_empty(), bitset_iterate(), bitset_next_member(), and i.

Referenced by qo_dump_info(), qo_node_dump(), qo_partition_dump(), qo_plan_print_subqueries(), qo_term_dump(), and qo_term_fprint().

Here is the caller graph for this function:

void bitset_remove ( BITSET *  ,
int   
)

Definition at line 158 of file query_bitset.c.

References _BIT, and _WORD.

Referenced by planner_permutate(), planner_visit_node(), qo_classify_outerjoin_terms(), qo_combine_partitions(), qo_find_index_segs(), qo_follow_new(), qo_generate_index_scan(), qo_generate_join_index_scan(), qo_search_partition_join(), and qo_search_planner().

Here is the caller graph for this function:

int bitset_subset ( const BITSET *  ,
const BITSET *   
)

Definition at line 263 of file query_bitset.c.

Referenced by planner_permutate(), planner_visit_node(), qo_combine_partitions(), qo_discover_partitions(), qo_get_xasl_index_info(), qo_index_scan_new(), qo_plan_iscan_terms_cmp(), qo_search_partition(), qo_search_partition_join(), and qo_search_planner().

Here is the caller graph for this function:

void bitset_union ( BITSET *  ,
const BITSET *   
)

Definition at line 176 of file query_bitset.c.

References bitset_extend().

Referenced by gen_inner(), gen_outer(), planner_permutate(), planner_visit_node(), qo_analyze_term(), qo_assign_eq_classes(), qo_combine_partitions(), qo_compute_projected_segs(), qo_discover_edges(), qo_discover_partitions(), qo_discover_sort_limit_join_nodes(), qo_discover_sort_limit_nodes(), qo_examine_correlated_index(), qo_find_index_terms(), qo_follow_new(), qo_index_scan_new(), qo_join_new(), qo_search_partition_join(), and qo_search_planner().

Here is the caller graph for this function:

Variable Documentation

BITSET EMPTY_SET

Definition at line 64 of file query_bitset.c.

Referenced by gen_inner(), gen_outer(), make_sort_limit_proc(), and qo_to_xasl().