golden hour

/usr/include/mysql/server/private

File/Folder	Size	Actions
aria_backup.h	1.51 KB
assume_aligned.h	2.29 KB
atomic	-
authors.h	9.9 KB
backup.h	1.21 KB
bounded_queue.h	6.67 KB
client_settings.h	1.89 KB
compat56.h	2.23 KB
config.h	14.18 KB
contributors.h	4.76 KB
create_options.h	4.42 KB
custom_conf.h	1.06 KB
datadict.h	1.53 KB
debug_sync.h	2 KB
derived_handler.h	2.32 KB
derror.h	980 B
des_key_file.h	1.21 KB
discover.h	1.53 KB
dur_prop.h	1.06 KB
embedded_priv.h	1.62 KB
event_data_objects.h	4.09 KB
event_db_repository.h	3.56 KB
event_parse_data.h	2.83 KB
event_queue.h	3.36 KB
event_scheduler.h	3.21 KB
events.h	4.59 KB
field.h	211.96 KB
field_comp.h	1.15 KB
filesort.h	6.67 KB
filesort_utils.h	8 KB
ft_global.h	3.04 KB
gcalc_slicescan.h	16.87 KB
gcalc_tools.h	11.62 KB
grant.h	2.69 KB
group_by_handler.h	3.45 KB
gstream.h	2.38 KB
ha_partition.h	62.22 KB
ha_sequence.h	5.94 KB
handle_connections_win.h	884 B
handler.h	188.39 KB
hash.h	4.34 KB
hash_filo.h	5.55 KB
heap.h	9.2 KB
hostname.h	5.29 KB
ilist.h	6.85 KB
init.h	852 B
innodb_priv.h	1.29 KB
item.h	263.12 KB
item_cmpfunc.h	128.01 KB
item_create.h	11.22 KB
item_func.h	124.59 KB
item_geofunc.h	34.69 KB
item_jsonfunc.h	19.8 KB
item_row.h	5.43 KB
item_strfunc.h	64.55 KB
item_subselect.h	56.19 KB
item_sum.h	69.2 KB
item_timefunc.h	57.85 KB
item_vers.h	3.79 KB
item_windowfunc.h	32.61 KB
item_xmlfunc.h	4.36 KB
key.h	2 KB
keycaches.h	1.95 KB
lex.h	28.9 KB
lex_ident.h	2.07 KB
lex_string.h	3.97 KB
lex_symbol.h	1.29 KB
lf.h	6.31 KB
lock.h	2.15 KB
log.h	44.46 KB
log_event.h	178.94 KB
log_event_data_type.h	1.85 KB
log_event_old.h	19.32 KB
log_slow.h	1.98 KB
maria.h	5.73 KB
mariadb.h	1.25 KB
mdl.h	36.78 KB
mem_root_array.h	6.94 KB
message.h	1.17 KB
multi_range_read.h	22.58 KB
my_alarm.h	2.37 KB
my_apc.h	4.62 KB
my_atomic.h	7.11 KB
my_atomic_wrapper.h	2.92 KB
my_base.h	26.5 KB
my_bit.h	6.05 KB
my_bitmap.h	5.22 KB
my_check_opt.h	2.56 KB
my_compare.h	10.93 KB
my_context.h	6.59 KB
my_counter.h	1.68 KB
my_cpu.h	4.85 KB
my_crypt.h	904 B
my_decimal.h	13.43 KB
my_default.h	1.84 KB
my_handler_errors.h	4.74 KB
my_json_writer.h	17.9 KB
my_libwrap.h	1.16 KB
my_md5.h	1.45 KB
my_minidump.h	848 B
my_nosys.h	1.4 KB
my_rdtsc.h	8.15 KB
my_rnd.h	1.04 KB
my_service_manager.h	1.47 KB
my_stack_alloc.h	6.2 KB
my_stacktrace.h	3.14 KB
my_time.h	10.22 KB
my_tree.h	3.9 KB
my_uctype.h	67.9 KB
my_user.h	1.1 KB
myisam.h	17.11 KB
myisamchk.h	4.61 KB
myisammrg.h	4.78 KB
myisampack.h	14.58 KB
mysql_async.h	1.77 KB
mysqld.h	38.7 KB
mysqld_default_groups.h	204 B
mysqld_suffix.h	1.17 KB
mysys_err.h	2.95 KB
nt_servc.h	2.94 KB
opt_range.h	57.58 KB
opt_subselect.h	14.21 KB
opt_trace.h	8.11 KB
opt_trace_context.h	3.21 KB
parse_file.h	4.11 KB
partition_element.h	5.09 KB
partition_info.h	18.85 KB
password.h	1.14 KB
pfs_file_provider.h	3.08 KB
pfs_idle_provider.h	1.35 KB
pfs_memory_provider.h	1.59 KB
pfs_metadata_provider.h	1.85 KB
pfs_socket_provider.h	2.21 KB
pfs_stage_provider.h	1.52 KB
pfs_statement_provider.h	4.25 KB
pfs_table_provider.h	2.56 KB
pfs_thread_provider.h	5.43 KB
pfs_transaction_provider.h	2.78 KB
privilege.h	27.9 KB
probes_mysql.h	973 B
probes_mysql_dtrace.h	32.23 KB
probes_mysql_nodtrace.h	4.89 KB
procedure.h	6.57 KB
protocol.h	12.32 KB
proxy_protocol.h	548 B
queues.h	3.46 KB
records.h	3.03 KB
repl_failsafe.h	1.55 KB
replication.h	15.73 KB
rijndael.h	1.67 KB
rowid_filter.h	15.13 KB
rpl_constants.h	3.28 KB
rpl_filter.h	4.43 KB
rpl_gtid.h	13.31 KB
rpl_injector.h	9.43 KB
rpl_mi.h	13.65 KB
rpl_parallel.h	13.57 KB
rpl_record.h	1.55 KB
rpl_record_old.h	1.37 KB
rpl_reporting.h	2.96 KB
rpl_rli.h	31.8 KB
rpl_tblmap.h	3.1 KB
rpl_utility.h	9.4 KB
scheduler.h	2.99 KB
scope.h	1.76 KB
select_handler.h	2.18 KB
semisync.h	2.23 KB
semisync_master.h	22.7 KB
semisync_master_ack_receiver.h	5.73 KB
semisync_slave.h	3.47 KB
service_versions.h	2 KB
session_tracker.h	13.96 KB
set_var.h	16.1 KB
slave.h	11.99 KB
source_revision.h	67 B
sp.h	22.02 KB
sp_cache.h	2 KB
sp_head.h	63.05 KB
sp_pcontext.h	24.31 KB
sp_rcontext.h	14 KB
span.h	3.84 KB
spatial.h	21.82 KB
sql_acl.h	13.8 KB
sql_admin.h	2.78 KB
sql_alloc.h	1.83 KB
sql_alter.h	11.86 KB
sql_analyse.h	11.23 KB
sql_analyze_stmt.h	11.48 KB
sql_array.h	6.79 KB
sql_audit.h	13.62 KB
sql_base.h	24.83 KB
sql_basic_types.h	9.28 KB
sql_binlog.h	895 B
sql_bitmap.h	7.66 KB
sql_bootstrap.h	1.63 KB
sql_cache.h	21.15 KB
sql_callback.h	1.51 KB
sql_class.h	250.08 KB
sql_cmd.h	9.13 KB
sql_connect.h	3.99 KB
sql_const.h	10.94 KB
sql_crypt.h	1.4 KB
sql_cte.h	16.15 KB
sql_cursor.h	2.26 KB
sql_db.h	2.16 KB
sql_debug.h	4.65 KB
sql_delete.h	1.31 KB
sql_derived.h	1.26 KB
sql_digest.h	3.73 KB
sql_digest_stream.h	1.53 KB
sql_do.h	954 B
sql_error.h	38.12 KB
sql_explain.h	27.1 KB
sql_expression_cache.h	4.26 KB
sql_get_diagnostics.h	7.68 KB
sql_handler.h	2.84 KB
sql_help.h	920 B
sql_hset.h	3.56 KB
sql_i_s.h	7.97 KB
sql_insert.h	2.39 KB
sql_join_cache.h	47.44 KB
sql_lex.h	166.31 KB
sql_lifo_buffer.h	9.45 KB
sql_limit.h	2.38 KB
sql_list.h	21.56 KB
sql_load.h	1.25 KB
sql_locale.h	2.64 KB
sql_manager.h	960 B
sql_mode.h	6.58 KB
sql_parse.h	8.26 KB
sql_partition.h	11.75 KB
sql_partition_admin.h	5.8 KB
sql_plist.h	7.55 KB
sql_plugin.h	7.39 KB
sql_plugin_compat.h	2.18 KB
sql_prepare.h	11.14 KB
sql_priv.h	17.67 KB
sql_profile.h	7.63 KB
sql_reload.h	1.01 KB
sql_rename.h	982 B
sql_repl.h	2.96 KB
sql_schema.h	3.23 KB
sql_select.h	86.56 KB
sql_sequence.h	5.06 KB
sql_servers.h	1.74 KB
sql_show.h	9.39 KB
sql_signal.h	3.28 KB
sql_sort.h	21.39 KB
sql_statistics.h	11.96 KB
sql_string.h	36.43 KB
sql_table.h	11.07 KB
sql_tablespace.h	956 B
sql_test.h	1.55 KB
sql_time.h	8.18 KB
sql_trigger.h	10.76 KB
sql_truncate.h	2.03 KB
sql_tvc.h	2.36 KB
sql_type.h	286 KB
sql_type_geom.h	18.53 KB
sql_type_int.h	9.73 KB
sql_type_json.h	6 KB
sql_type_real.h	1.23 KB
sql_type_string.h	1.59 KB
sql_udf.h	4.74 KB
sql_union.h	1.04 KB
sql_update.h	1.88 KB
sql_view.h	2.33 KB
sql_window.h	6.65 KB
ssl_compat.h	3.07 KB
strfunc.h	2.22 KB
structs.h	25.13 KB
sys_vars_shared.h	2.67 KB
t_ctype.h	5.51 KB
table.h	112.29 KB
table_cache.h	4.13 KB
thr_alarm.h	2.87 KB
thr_lock.h	6.7 KB
thr_malloc.h	1.17 KB
thr_timer.h	1.53 KB
thread_cache.h	5.77 KB
thread_pool_priv.h	4 KB
threadpool.h	4.51 KB
threadpool_generic.h	3.83 KB
transaction.h	1.43 KB
tzfile.h	4.9 KB
tztime.h	3.32 KB
uniques.h	4.1 KB
unireg.h	7.43 KB
vers_string.h	2.47 KB
violite.h	9.71 KB
waiting_threads.h	4.43 KB
welcome_copyright_notice.h	1.19 KB
win_tzname_data.h	6.35 KB
winservice.h	1.17 KB
wqueue.h	1.53 KB
wsrep.h	3.23 KB
wsrep_applier.h	2.64 KB
wsrep_binlog.h	3.36 KB
wsrep_client_service.h	2.5 KB
wsrep_client_state.h	1.53 KB
wsrep_condition_variable.h	1.45 KB
wsrep_high_priority_service.h	4.8 KB
wsrep_mutex.h	1.19 KB
wsrep_mysqld.h	19.88 KB
wsrep_mysqld_c.h	1.2 KB
wsrep_on.h	1.68 KB
wsrep_priv.h	1.6 KB
wsrep_schema.h	4.54 KB
wsrep_server_service.h	3.55 KB
wsrep_server_state.h	2.23 KB
wsrep_sst.h	3.86 KB
wsrep_storage_service.h	1.77 KB
wsrep_thd.h	10.58 KB
wsrep_trans_observer.h	17.81 KB
wsrep_types.h	997 B
wsrep_utils.h	9.07 KB
wsrep_var.h	4.17 KB
wsrep_xid.h	1.42 KB
xa.h	1.69 KB

Edit: gcalc_tools.h

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 Street, Fifth Floor, Boston, MA 02110-1335 USA */

#ifndef GCALC_TOOLS_INCLUDED
#define GCALC_TOOLS_INCLUDED

#include "gcalc_slicescan.h"
#include "sql_string.h"

/*
  The Gcalc_function class objects are used to check for a binary relation.
  The relation can be constructed with the prefix notation using predicates as
        op_not (as !A)
        op_union ( A || B || C... )
        op_intersection ( A && B && C ... )
        op_symdifference ( A+B+C+... == 1 )
        op_difference ( A && !(B||C||..))
  with the calls of the add_operation(operation, n_operands) method.
  The relation is calculated over a set of shapes, that in turn have
  to be added with the add_new_shape() method. All the 'shapes' can
  be set to 0 with clear_shapes() method and single value
  can be changed with the invert_state() method.
  Then the value of the relation can be calculated with the count() method.
  Frequently used method is find_function(Gcalc_scan_iterator it) that
  iterates through the 'it' until the relation becomes TRUE.
*/

class Gcalc_function
{
private:
  String shapes_buffer;
  String function_buffer;
  int *i_states;
  int *b_states;
  uint32 cur_object_id;
  uint n_shapes;
  int count_internal(const char *cur_func, uint set_type,
                     const char **end);
public:
  enum op_type
  {
    v_empty=          0x00000000,
    v_find_t=         0x01000000,
    v_find_f=         0x02000000,
    v_t_found=        0x03000000,
    v_f_found=        0x04000000,
    v_mask=           0x07000000,

op_not=           0x80000000,
    op_shape=         0x00000000,
    op_union=         0x10000000,
    op_intersection=  0x20000000,
    op_symdifference= 0x30000000,
    op_difference=    0x40000000,
    op_repeat=        0x50000000,
    op_border=        0x60000000,
    op_internals=     0x70000000,
    op_false=         0x08000000,
    op_any=           0x78000000 /* The mask to get any of the operations */
  };
  enum shape_type
  {
    shape_point= 0,
    shape_line= 1,
    shape_polygon= 2,
    shape_hole= 3
  };
  enum count_result
  {
    result_false= 0,
    result_true= 1,
    result_unknown= 2
  };
  Gcalc_function() : n_shapes(0) {}
  gcalc_shape_info add_new_shape(uint32 shape_id, shape_type shape_kind);
  /*
    Adds the leaf operation that returns the shape value.
    Also adds the shape to the list of operands.
  */
  int single_shape_op(shape_type shape_kind, gcalc_shape_info *si);
  void add_operation(uint operation, uint32 n_operands);
  void add_not_operation(op_type operation, uint32 n_operands);
  uint32 get_next_expression_pos() { return function_buffer.length(); }
  void add_operands_to_op(uint32 operation_pos, uint32 n_operands);
  int repeat_expression(uint32 exp_pos);
  void set_cur_obj(uint32 cur_obj) { cur_object_id= cur_obj; }
  int reserve_shape_buffer(uint n_shapes);
  int reserve_op_buffer(uint n_ops);
  uint get_nshapes() const { return n_shapes; }
  shape_type get_shape_kind(gcalc_shape_info si) const
  {
    return (shape_type) uint4korr(shapes_buffer.ptr() + (si*4));
  }

void set_states(int *shape_states) { i_states= shape_states; }
  int alloc_states();
  void invert_i_state(gcalc_shape_info shape) { i_states[shape]^= 1; }
  void set_i_state(gcalc_shape_info shape) { i_states[shape]= 1; }
  void clear_i_state(gcalc_shape_info shape) { i_states[shape]= 0; }
  void set_b_state(gcalc_shape_info shape) { b_states[shape]= 1; }
  void clear_b_state(gcalc_shape_info shape) { b_states[shape]= 0; }
  int get_state(gcalc_shape_info shape)
    { return i_states[shape] | b_states[shape]; }
  int get_i_state(gcalc_shape_info shape) { return i_states[shape]; }
  int get_b_state(gcalc_shape_info shape) { return b_states[shape]; }
  int count()
    { return count_internal(function_buffer.ptr(), 0, 0); }
  int count_last()
    { return count_internal(function_buffer.ptr(), 1, 0); }
  void clear_i_states();
  void clear_b_states();
  void reset();

int check_function(Gcalc_scan_iterator &scan_it);
};

/*
  Gcalc_operation_transporter class extends the Gcalc_shape_transporter.
  In addition to the parent's functionality, it fills the Gcalc_function
  object so it has the function that determines the proper shape.
  For example Multipolyline will be represented as an union of polylines.
*/

class Gcalc_operation_transporter : public Gcalc_shape_transporter
{
protected:
  Gcalc_function *m_fn;
  gcalc_shape_info m_si;
public:
  Gcalc_operation_transporter(Gcalc_function *fn, Gcalc_heap *heap) :
    Gcalc_shape_transporter(heap), m_fn(fn) {}

int single_point(double x, double y) override;
  int start_line() override;
  int complete_line() override;
  int start_poly() override;
  int complete_poly() override;
  int start_ring() override;
  int complete_ring() override;
  int add_point(double x, double y) override;
  int start_collection(int n_objects) override;
  int empty_shape() override;
};

/*
   When we calculate the result of an spatial operation like
   Union or Intersection, we receive vertexes of the result
   one-by-one, and probably need to treat them in variative ways.
   So, the Gcalc_result_receiver class designed to get these
   vertexes and construct shapes/objects out of them.
   and to store the result in an appropriate format
*/

class Gcalc_result_receiver
{
  String buffer;
  uint32 n_points;
  Gcalc_function::shape_type common_shapetype;
  bool collection_result;
  uint32 n_shapes;
  uint32 n_holes;

Gcalc_function::shape_type cur_shape;
  uint32 shape_pos;
  double first_x, first_y, prev_x, prev_y;
  double shape_area;
public:
Gcalc_result_receiver() :
    n_points(0),
    common_shapetype(Gcalc_function::shape_point),
    collection_result(FALSE), n_shapes(0), n_holes(0),
    cur_shape(Gcalc_function::shape_point), shape_pos(0)
    {}
  int start_shape(Gcalc_function::shape_type shape);
  int add_point(double x, double y);
  int complete_shape();
  int single_point(double x, double y);
  int done();
  void reset();

const char *result() { return buffer.ptr(); }
  uint length() { return buffer.length(); }
  int get_nshapes() { return n_shapes; }
  int get_nholes() { return n_holes; }
  int get_result_typeid();
  uint32 position() { return buffer.length(); }
  int move_hole(uint32 dest_position, uint32 source_position,
                uint32 *position_shift);
};

/*
  Gcalc_operation_reducer class incapsulates the spatial
  operation functionality. It analyses the slices generated by
  the slicescan and calculates the shape of the result defined
  by some Gcalc_function.
*/

class Gcalc_operation_reducer : public Gcalc_dyn_list
{
public:
  enum modes
  {
    /* Numeric values important here - careful with changing */
    default_mode= 0,
    prefer_big_with_holes= 1,
    polygon_selfintersections_allowed= 2,  /* allowed in the result */
    line_selfintersections_allowed= 4      /* allowed in the result */
  };

Gcalc_operation_reducer(size_t blk_size=8192);
  Gcalc_operation_reducer(const Gcalc_operation_reducer &gor);
  void init(Gcalc_function *fn, modes mode= default_mode);
  Gcalc_operation_reducer(Gcalc_function *fn, modes mode= default_mode,
		       size_t blk_size=8192);
  GCALC_DECL_TERMINATED_STATE(killed)
  int count_slice(Gcalc_scan_iterator *si);
  int count_all(Gcalc_heap *hp);
  int get_result(Gcalc_result_receiver *storage);
  void reset();

#ifndef GCALC_DBUG_OFF
  int n_res_points;
#endif /*GCALC_DBUG_OFF*/
  class res_point : public Gcalc_dyn_list::Item
  {
  public:
    int intersection_point;
    union
    {
      const Gcalc_heap::Info *pi;
      res_point *first_poly_node;
    };
    union
    {
      res_point *outer_poly;
      uint32 poly_position;
    };
    res_point *up;
    res_point *down;
    res_point *glue;
    Gcalc_function::shape_type type;
    Gcalc_dyn_list::Item **prev_hook;
#ifndef GCALC_DBUG_OFF
    int point_n;
#endif /*GCALC_DBUG_OFF*/
    void set(const Gcalc_scan_iterator *si);
    res_point *get_next() { return (res_point *)next; }
  };

class active_thread : public Gcalc_dyn_list::Item
  {
  public:
    res_point *rp;
    res_point *thread_start;

const Gcalc_heap::Info *p1, *p2;
    res_point *enabled() { return rp; }
    active_thread *get_next() { return (active_thread *)next; }
  };

class poly_instance : public Gcalc_dyn_list::Item
  {
  public:
    uint32 *after_poly_position;
    poly_instance *get_next() { return (poly_instance *)next; }
  };

class line : public Gcalc_dyn_list::Item
  {
  public:
    active_thread *t;
    int incoming;
    const Gcalc_scan_iterator::point *p;
    line *get_next() { return (line *)next; }
  };

class poly_border : public Gcalc_dyn_list::Item
  {
  public:
    active_thread *t;
    int incoming;
    int prev_state;
    const Gcalc_scan_iterator::point *p;
    poly_border *get_next() { return (poly_border *)next; }
  };

line *m_lines;
  Gcalc_dyn_list::Item **m_lines_hook;
  poly_border *m_poly_borders;
  Gcalc_dyn_list::Item **m_poly_borders_hook;
  line *new_line() { return (line *) new_item(); }
  poly_border *new_poly_border() { return (poly_border *) new_item(); }
  int add_line(int incoming, active_thread *t,
               const Gcalc_scan_iterator::point *p);
  int add_poly_border(int incoming, active_thread *t, int prev_state,
                      const Gcalc_scan_iterator::point *p);

protected:
  Gcalc_function *m_fn;
  Gcalc_dyn_list::Item **m_res_hook;
  res_point *m_result;
  int m_mode;

res_point *result_heap;
  active_thread *m_first_active_thread;

res_point *add_res_point(Gcalc_function::shape_type type);
  active_thread *new_active_thread() { return (active_thread *)new_item(); }

poly_instance *new_poly() { return (poly_instance *) new_item(); }

private:
  int start_line(active_thread *t, const Gcalc_scan_iterator::point *p,
                 const Gcalc_scan_iterator *si);
  int end_line(active_thread *t, const Gcalc_scan_iterator *si);
  int connect_threads(int incoming_a, int incoming_b,
                      active_thread *ta, active_thread *tb,
                      const Gcalc_scan_iterator::point *pa,
                      const Gcalc_scan_iterator::point *pb,
                      active_thread *prev_range,
                      const Gcalc_scan_iterator *si,
                      Gcalc_function::shape_type s_t);
  int add_single_point(const Gcalc_scan_iterator *si);
  poly_border *get_pair_border(poly_border *b1);
  int continue_range(active_thread *t, const Gcalc_heap::Info *p,
                     const Gcalc_heap::Info *p_next);
  int continue_i_range(active_thread *t,
                       const Gcalc_heap::Info *ii);
  int end_couple(active_thread *t0, active_thread *t1, const Gcalc_heap::Info *p);
  int get_single_result(res_point *res, Gcalc_result_receiver *storage);
  int get_result_thread(res_point *cur, Gcalc_result_receiver *storage,
			int move_upward, res_point *first_poly_node);
  int get_polygon_result(res_point *cur, Gcalc_result_receiver *storage,
                         res_point *first_poly_node);
  int get_line_result(res_point *cur, Gcalc_result_receiver *storage);

void free_result(res_point *res);
};

#endif /*GCALC_TOOLS_INCLUDED*/