[go: up one dir, main page]

Menu

[r22]: / server / sql.cpp  Maximize  Restore  History

Download this file

176 lines (148 with data), 4.5 kB

  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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
/*****************************************************************************
Copyright © 2006, 2007, The Board of Trustees of the University of Illinois.
All Rights Reserved.
National Center for Data Mining (NCDM)
University of Illinois at Chicago
http://www.ncdm.uic.edu/
This library is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation; either version 2.1 of the License, or (at
your option) any later version.
This library 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 Lesser
General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this library; if not, write to the Free Software Foundation, Inc.,
59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*****************************************************************************/
/*****************************************************************************
written by
Yunhong Gu [gu@lac.uic.edu], last updated 02/23/2007
*****************************************************************************/
#include <server.h>
#include <sql.h>
#include <table.h>
void* Server::SQLHandler(void* p)
{
//Server* self = ((Param3*)p)->s;
string filename = ((Param3*)p)->fn;
string query = ((Param3*)p)->q;
UDTSOCKET u = ((Param3*)p)->u;
int t = ((Param3*)p)->t;
int conn = ((Param3*)p)->c;
delete (Param3*)p;
SQLExpr sql;
SQLParser::parse(query, sql);
Table table;
table.loadDataFile(filename);
table.loadSemantics(filename + ".sem");
EvalTree* tree;
SQLParser::buildTree(sql.m_Condition, 0, sql.m_Condition.size(), tree);
bool project;
if ((sql.m_vstrFieldList.size() == 1) && (sql.m_vstrFieldList[0] == "*"))
project = false;
else
project = true;
int32_t cmd;
bool run = true;
UDTSOCKET lu = u;
int lt = t;
if (1 == conn)
{
u = UDT::accept(u, NULL, NULL);
UDT::close(lu);
}
else
{
t = accept(t, NULL, NULL);
::close(lt);
}
while (run)
{
if (1 == conn)
{
if (UDT::recv(u, (char*)&cmd, 4, 0) < 0)
continue;
}
else
{
if (::recv(t, (char*)&cmd, 4, 0) <= 0)
continue;
}
switch (cmd)
{
case 1: // fetch
{
int numOfRows;
if (1 == conn)
{
if (UDT::recv(u, (char*)&numOfRows, 4, 0) < 0)
continue;
}
else
{
if (::recv(t, (char*)&numOfRows, 4, 0) <= 0)
continue;
}
char* buf = new char[4096 * numOfRows];
int size = 0;
int unitsize = 4096;
for (int i = 0; i < numOfRows; ++ i)
{
unitsize = 4096;
if (table.readTuple(buf + size, unitsize) < 0)
break;
if (table.select(buf + size, tree))
{
if (project)
{
char temp[4096];
unitsize = table.project(buf + size, temp, sql.m_vstrFieldList);
memcpy(buf + size, temp, unitsize);
}
size += unitsize;
}
}
if (1 == conn)
{
if (UDT::send(u, (char*)&size, 4, 0) < 0)
{
run = false;
break;
}
int h;
if (UDT::send(u, buf, size, 0, &h) < 0)
run = false;
}
else
{
if (::send(u, (char*)&size, 4, 0) < 0)
{
run = false;
break;
}
int unit = 1460;
int ts = 0;
while (size > 0)
{
int ss = ::send(t, buf + ts, (size > unit) ? unit : size, 0);
if (ss < 0)
{
run = false;
break;
}
size -= ss;
ts += ss;
}
}
break;
}
case 2: // close
run = false;
default:
break;
}
}
return NULL;
}