File: hash_join_chunk.cc

package info (click to toggle)
mysql-8.0 8.0.44-1
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,272,892 kB
  • sloc: cpp: 4,685,345; ansic: 412,712; pascal: 108,395; java: 83,641; perl: 30,221; cs: 27,067; sql: 26,594; python: 21,816; sh: 17,285; yacc: 17,169; php: 11,522; xml: 7,388; javascript: 7,083; makefile: 1,793; lex: 1,075; awk: 670; asm: 520; objc: 183; ruby: 97; lisp: 86
file content (159 lines) | stat: -rw-r--r-- 5,131 bytes parent folder | download
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
/* Copyright (c) 2019, 2025, Oracle and/or its affiliates.

   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License, version 2.0,
   as published by the Free Software Foundation.

   This program is designed to work with certain software (including
   but not limited to OpenSSL) that is licensed under separate terms,
   as designated in a particular file or component or in included license
   documentation.  The authors of MySQL hereby grant you an additional
   permission to link the program and your derivative works with the
   separately licensed software that they have either included with
   the program or referenced in the documentation.

   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, version 2.0, 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 */

#include "sql/iterators/hash_join_chunk.h"

#include <stddef.h>
#include <new>
#include <utility>

#include "my_inttypes.h"
#include "my_sys.h"
#include "mysqld_error.h"
#include "sql/iterators/hash_join_buffer.h"
#include "sql/mysqld.h"
#include "sql/sql_base.h"
#include "sql/sql_const.h"
#include "sql_string.h"
#include "template_utils.h"

using pack_rows::TableCollection;

HashJoinChunk::HashJoinChunk(HashJoinChunk &&other)
    : m_tables(std::move(other.m_tables)),
      m_num_rows(other.m_num_rows),
      m_file(other.m_file),
      m_uses_match_flags(other.m_uses_match_flags) {
  setup_io_cache(&m_file);
  // Reset the IO_CACHE structure so that the destructor doesn't close/clear the
  // file contents and it's buffers.
  new (&other.m_file) IO_CACHE();
}

HashJoinChunk &HashJoinChunk::operator=(HashJoinChunk &&other) {
  m_tables = std::move(other.m_tables);
  m_num_rows = other.m_num_rows;
  m_uses_match_flags = other.m_uses_match_flags;

  // Since the file we are replacing will become unreachable, free all resources
  // used by it.
  close_cached_file(&m_file);
  m_file = other.m_file;
  setup_io_cache(&m_file);

  // Reset the IO_CACHE structure so that the destructor doesn't close/clear the
  // file contents and it's buffers.
  new (&other.m_file) IO_CACHE();
  return *this;
}

HashJoinChunk::~HashJoinChunk() { close_cached_file(&m_file); }

bool HashJoinChunk::Init(const TableCollection &tables, bool uses_match_flags) {
  m_tables = tables;
  m_file.file_key = key_file_hash_join;
  m_num_rows = 0;
  m_uses_match_flags = uses_match_flags;
  close_cached_file(&m_file);
  return open_cached_file(&m_file, mysql_tmpdir, TEMP_PREFIX, DISK_BUFFER_SIZE,
                          MYF(MY_WME));
}

bool HashJoinChunk::Rewind() {
  if (my_b_flush_io_cache(&m_file, /*need_append_buffer_lock=*/0) == -1 ||
      reinit_io_cache(&m_file, READ_CACHE, 0, false, false)) {
    my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
    return true;
  }

  return false;
}

bool HashJoinChunk::WriteRowToChunk(String *buffer, bool matched) {
  if (StoreFromTableBuffers(m_tables, buffer)) {
    my_error(ER_OUTOFMEMORY, MYF(ME_FATALERROR),
             ComputeRowSizeUpperBound(m_tables));
    return true;
  }

  if (m_uses_match_flags) {
    if (my_b_write(&m_file, pointer_cast<const uchar *>(&matched),
                   sizeof(matched)) != 0) {
      my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
      return true;
    }
  }

  // Write out the length of the data.
  size_t data_length = buffer->length();
  if (my_b_write(&m_file, pointer_cast<const uchar *>(&data_length),
                 sizeof(data_length)) != 0) {
    my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
    return true;
  }

  // ... and then write the actual data.
  if (my_b_write(&m_file, pointer_cast<uchar *>(buffer->ptr()), data_length) !=
      0) {
    my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
    return true;
  }
  m_num_rows++;
  return false;
}

bool HashJoinChunk::LoadRowFromChunk(String *buffer, bool *matched) {
  if (m_uses_match_flags) {
    if (my_b_read(&m_file, pointer_cast<uchar *>(matched), sizeof(*matched)) !=
        0) {
      my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
      return true;
    }
  }

  // Read the length of the row.
  size_t row_length;
  if (my_b_read(&m_file, pointer_cast<uchar *>(&row_length),
                sizeof(row_length)) != 0) {
    my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
    return true;
  }

  // Read the actual data of the row.
  if (buffer->reserve(row_length)) {
    my_error(ER_OUTOFMEMORY, MYF(ME_FATALERROR), row_length);
    return true;
  }

  buffer->length(row_length);
  if (my_b_read(&m_file, pointer_cast<uchar *>(buffer->ptr()), row_length) !=
      0) {
    my_error(ER_TEMP_FILE_WRITE_FAILURE, MYF(0));
    return true;
  }

  hash_join_buffer::LoadBufferRowIntoTableBuffers(
      m_tables, {buffer->ptr(), buffer->length()});

  return false;
}