← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/optimizer/quick_range_select.cc

  • Committer: Tim Martin
  • Date: 2010-04-05 14:22:01 UTC
  • mto: This revision was merged to the branch mainline in revision 1452.
  • Revision ID: timm@woolly-20100405142201-0qeekehrbui768he
Removed function prototype left over after previous dead code removal

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/optimizer/quick_range_select.cc
1
1
/* -*- mode: c++; c-basic-offset: 2; indent-tabs-mode: nil; -*-
2
2
 *  vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
3
3
 *
4
 
 *  Copyright (C) 2008-2009 Sun Microsystems, Inc.
 
4
 *  Copyright (C) 2008-2009 Sun Microsystems
5
5
 *
6
6
 *  This program is free software; you can redistribute it and/or modify
7
7
 *  it under the terms of the GNU General Public License as published by
17
17
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
18
18
 */
19
19
 
20
 
#include <config.h>
21
 
 
22
 
#include <drizzled/session.h>
23
 
#include <drizzled/optimizer/quick_range.h>
24
 
#include <drizzled/optimizer/quick_range_select.h>
25
 
#include <drizzled/internal/m_string.h>
26
 
#include <drizzled/current_session.h>
27
 
 
 
20
#include "config.h"
 
21
#include "drizzled/session.h"
 
22
#include "drizzled/optimizer/quick_range.h"
 
23
#include "drizzled/optimizer/quick_range_select.h"
 
24
#include "drizzled/sql_bitmap.h"
 
25
#include "drizzled/internal/m_string.h"
28
26
#include <fcntl.h>
 
27
#include "drizzled/memory/multi_malloc.h"
29
28
 
30
29
using namespace std;
31
30
 
37
36
                                              Table *table,
38
37
                                              uint32_t key_nr,
39
38
                                              bool no_alloc,
40
 
                                              memory::Root *parent_alloc)
 
39
                                              memory::Root *parent_alloc,
 
40
                                              bool *create_error)
41
41
  :
 
42
    mrr_flags(0),
 
43
    alloc(),
42
44
    cursor(NULL),
43
45
    ranges(),
44
46
    in_ror_merged_scan(false),
45
 
    column_bitmap(NULL),
 
47
    column_bitmap(),
46
48
    save_read_set(NULL),
47
49
    save_write_set(NULL),
48
50
    free_file(false),
50
52
    last_range(NULL),
51
53
    qr_traversal_ctx(),
52
54
    mrr_buf_size(0),
 
55
    mrr_buf_desc(NULL),
53
56
    key_parts(NULL),
54
 
    dont_free(false),
55
 
    mrr_flags(0),
56
 
    alloc()
 
57
    dont_free(false)
57
58
{
 
59
  my_bitmap_map *bitmap= NULL;
 
60
 
58
61
  sorted= 0;
59
62
  index= key_nr;
60
63
  head= table;
63
66
 
64
67
  /* 'session' is not accessible in QuickRangeSelect::reset(). */
65
68
  mrr_buf_size= session->variables.read_rnd_buff_size;
 
69
  mrr_buf_desc= NULL;
66
70
 
67
71
  if (! no_alloc && ! parent_alloc)
68
72
  {
79
83
  record= head->record[0];
80
84
  save_read_set= head->read_set;
81
85
  save_write_set= head->write_set;
82
 
  column_bitmap= new boost::dynamic_bitset<>(table->getShare()->sizeFields());
 
86
 
 
87
  /* Allocate a bitmap for used columns. Using memory::sql_alloc instead of malloc
 
88
     simply as a "fix" to the MySQL 6.0 code that also free()s it at the
 
89
     same time we destroy the mem_root.
 
90
   */
 
91
 
 
92
  bitmap= reinterpret_cast<my_bitmap_map*>(memory::sql_alloc(head->s->column_bitmap_size));
 
93
  if (! bitmap)
 
94
  {
 
95
    column_bitmap.setBitmap(NULL);
 
96
    *create_error= 1;
 
97
  }
 
98
  else
 
99
  {
 
100
    column_bitmap.init(bitmap, head->s->fields);
 
101
  }
83
102
}
84
103
 
85
104
 
87
106
{
88
107
  if (cursor->inited != Cursor::NONE)
89
108
    cursor->ha_index_or_rnd_end();
90
 
  return (cursor->startIndexScan(index, 1));
 
109
  return (cursor->ha_index_init(index, 1));
91
110
}
92
111
 
93
112
 
119
138
      }
120
139
    }
121
140
    delete_dynamic(&ranges); /* ranges are allocated in alloc */
122
 
    delete column_bitmap;
123
 
    alloc.free_root(MYF(0));
124
 
  }
125
 
  head->column_bitmaps_set(*save_read_set, *save_write_set);
 
141
    free_root(&alloc,MYF(0));
 
142
  }
 
143
  head->column_bitmaps_set(save_read_set, save_write_set);
 
144
  assert(mrr_buf_desc == NULL);
 
145
  if (mrr_buf_desc)
 
146
  {
 
147
    free(mrr_buf_desc);
 
148
  }
126
149
}
127
150
 
128
151
 
138
161
    {
139
162
      return 0;
140
163
    }
141
 
    head->column_bitmaps_set(*column_bitmap, *column_bitmap);
 
164
    head->column_bitmaps_set(&column_bitmap, &column_bitmap);
142
165
    goto end;
143
166
  }
144
167
 
164
187
    goto failure;
165
188
  }
166
189
 
167
 
  head->column_bitmaps_set(*column_bitmap, *column_bitmap);
 
190
  head->column_bitmaps_set(&column_bitmap, &column_bitmap);
168
191
 
169
192
  if (cursor->ha_external_lock(session, F_RDLCK))
170
193
    goto failure;
195
218
  }
196
219
  head->prepare_for_position();
197
220
  head->cursor= org_file;
198
 
  *column_bitmap|= *head->read_set;
199
 
  head->column_bitmaps_set(*column_bitmap, *column_bitmap);
 
221
  column_bitmap= *head->read_set;
 
222
  head->column_bitmaps_set(&column_bitmap, &column_bitmap);
200
223
 
201
224
  return 0;
202
225
 
203
226
failure:
204
 
  head->column_bitmaps_set(*save_read_set, *save_write_set);
 
227
  head->column_bitmaps_set(save_read_set, save_write_set);
205
228
  delete cursor;
206
229
  cursor= save_file;
207
230
  return 0;
221
244
    optimizer::QuickRange *tmp= *((optimizer::QuickRange**)ranges.buffer);
222
245
    if ((tmp->flag & (EQ_RANGE | NULL_RANGE)) == EQ_RANGE)
223
246
    {
224
 
      KeyInfo *key=head->key_info+index;
 
247
      KEY *key=head->key_info+index;
225
248
      return ((key->flags & (HA_NOSAME)) == HA_NOSAME &&
226
249
              key->key_length == tmp->min_length);
227
250
    }
232
255
 
233
256
int optimizer::QuickRangeSelect::reset()
234
257
{
 
258
  uint32_t buf_size= 0;
 
259
  unsigned char *mrange_buff= NULL;
235
260
  int error= 0;
 
261
  HANDLER_BUFFER empty_buf;
236
262
  last_range= NULL;
237
263
  cur_range= (optimizer::QuickRange**) ranges.buffer;
238
264
 
239
 
  if (cursor->inited == Cursor::NONE && (error= cursor->startIndexScan(index, 1)))
 
265
  if (cursor->inited == Cursor::NONE && (error= cursor->ha_index_init(index, 1)))
240
266
  {
241
267
    return error;
242
268
  }
243
269
 
244
 
  /*
245
 
    (in the past) Allocate buffer if we need one but haven't allocated it yet 
246
 
    There is a later assert in th code that hoped to catch random free() that might
247
 
    have done this.
248
 
  */
249
 
  assert(not (mrr_buf_size));
 
270
  /* Allocate buffer if we need one but haven't allocated it yet */
 
271
  if (mrr_buf_size && ! mrr_buf_desc)
 
272
  {
 
273
    buf_size= mrr_buf_size;
 
274
    while (buf_size && ! memory::multi_malloc(false,
 
275
                                              &mrr_buf_desc,
 
276
                                              sizeof(*mrr_buf_desc),
 
277
                                              &mrange_buff,
 
278
                                              buf_size,
 
279
                                              NULL))
 
280
    {
 
281
      /* Try to shrink the buffers until both are 0. */
 
282
      buf_size/= 2;
 
283
    }
 
284
    if (! mrr_buf_desc)
 
285
    {
 
286
      return HA_ERR_OUT_OF_MEM;
 
287
    }
 
288
 
 
289
    /* Initialize the Cursor buffer. */
 
290
    mrr_buf_desc->buffer= mrange_buff;
 
291
    mrr_buf_desc->buffer_end= mrange_buff + buf_size;
 
292
    mrr_buf_desc->end_of_used_area= mrange_buff;
 
293
  }
 
294
 
 
295
  if (! mrr_buf_desc)
 
296
  {
 
297
    empty_buf.buffer= NULL;
 
298
    empty_buf.buffer_end= NULL;
 
299
    empty_buf.end_of_used_area= NULL;
 
300
  }
250
301
 
251
302
  if (sorted)
252
303
  {
259
310
  error= cursor->multi_range_read_init(&seq_funcs,
260
311
                                       (void*) this,
261
312
                                       ranges.elements,
262
 
                                       mrr_flags);
 
313
                                       mrr_flags,
 
314
                                       mrr_buf_desc ? mrr_buf_desc : &empty_buf);
263
315
  return error;
264
316
}
265
317
 
273
325
      We don't need to signal the bitmap change as the bitmap is always the
274
326
      same for this head->cursor
275
327
    */
276
 
    head->column_bitmaps_set(*column_bitmap, *column_bitmap);
 
328
    head->column_bitmaps_set(&column_bitmap, &column_bitmap);
277
329
  }
278
330
 
279
331
  int result= cursor->multi_range_read_next(&dummy);
281
333
  if (in_ror_merged_scan)
282
334
  {
283
335
    /* Restore bitmaps set on entry */
284
 
    head->column_bitmaps_set(*save_read_set, *save_write_set);
 
336
    head->column_bitmaps_set(save_read_set, save_write_set);
285
337
  }
286
338
  return result;
287
339
}
419
471
}
420
472
 
421
473
 
422
 
void optimizer::QuickRangeSelect::add_info_string(string *str)
 
474
void optimizer::QuickRangeSelect::add_info_string(String *str)
423
475
{
424
 
  KeyInfo *key_info= head->key_info + index;
 
476
  KEY *key_info= head->key_info + index;
425
477
  str->append(key_info->name);
426
478
}
427
479
 
428
480
 
429
 
void optimizer::QuickRangeSelect::add_keys_and_lengths(string *key_names,
430
 
                                                       string *used_lengths)
 
481
void optimizer::QuickRangeSelect::add_keys_and_lengths(String *key_names,
 
482
                                                       String *used_lengths)
431
483
{
432
484
  char buf[64];
433
485
  uint32_t length;
434
 
  KeyInfo *key_info= head->key_info + index;
 
486
  KEY *key_info= head->key_info + index;
435
487
  key_names->append(key_info->name);
436
488
  length= internal::int64_t2str(max_used_key_length, buf, 10) - buf;
437
489
  used_lengths->append(buf, length);