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
|
/* - mode: c; c-basic-offset: 2; indent-tabs-mode: nil; -*-
* vim:expandtab:shiftwidth=2:tabstop=2:smarttab:
*
* Copyright (C) 2009 Sun Microsystems
*
* 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; either version 2 of the License, or
* (at your option) any later version.
*
* 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
*/
#include "config.h"
#include <plugin/data_engine/cursor.h>
#include <drizzled/session.h>
#include "drizzled/internal/my_sys.h"
#include <string>
using namespace std;
using namespace drizzled;
/*****************************************************************************
** Data Function tables
*****************************************************************************/
FunctionCursor::FunctionCursor(plugin::StorageEngine &engine_arg,
TableShare &table_arg) :
Cursor(engine_arg, table_arg)
{}
int FunctionCursor::open(const char *name, int, uint32_t)
{
(void)name;
string temp_name= name;
tool= static_cast<Function *>(engine)->getFunction(temp_name);
return 0;
}
int FunctionCursor::close(void)
{
tool= NULL;
return 0;
}
int FunctionCursor::rnd_init(bool)
{
record_id= 0;
generator= tool->generator(table->field);
return 0;
}
int FunctionCursor::rnd_next(unsigned char *)
{
bool more_rows;
ha_statistic_increment(&SSV::ha_read_rnd_next_count);
more_rows= generator->sub_populate();
if (more_rows)
{
return 0;
}
else
{
delete generator;
generator= NULL;
}
return more_rows ? 0 : HA_ERR_END_OF_FILE;
}
void FunctionCursor::position(const unsigned char *record)
{
unsigned char *copy;
copy= (unsigned char *)malloc(table->s->reclength);
memcpy(copy, record, table->s->reclength);
row_cache.push_back(copy);
my_store_ptr(ref, ref_length, record_id);
record_id++;
}
int FunctionCursor::rnd_end()
{
size_t length_of_vector= row_cache.size();
for (size_t x= 0; x < length_of_vector; x++)
{
free(row_cache[x]);
}
row_cache.clear();
record_id= 0;
delete generator; // Do this in case of an early exit from rnd_next()
return 0;
}
int FunctionCursor::rnd_pos(unsigned char *buf, unsigned char *pos)
{
ha_statistic_increment(&SSV::ha_read_rnd_count);
size_t position_id= (size_t)my_get_ptr(pos, ref_length);
memcpy(buf, row_cache[position_id], table->s->reclength);
return 0;
}
int FunctionCursor::info(uint32_t flag)
{
memset(&stats, 0, sizeof(stats));
if (flag & HA_STATUS_AUTO)
stats.auto_increment_value= 1;
return 0;
}
|