← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/sql_lex.cc

  • Committer: Stewart Smith
  • Date: 2010-03-18 12:01:34 UTC
  • mto: (1666.2.3 build)
  • mto: This revision was merged to the branch mainline in revision 1596.
  • Revision ID: stewart@flamingspork.com-20100318120134-45fdnsw8g3j6c7oy
move RAND() into a plugin

Show diffs side-by-side

added added

removed removed

Lines of Context:
drizzled/sql_lex.cc
11
11
 
12
12
   You should have received a copy of the GNU General Public License
13
13
   along with this program; if not, write to the Free Software
14
 
   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA */
 
14
   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA */
15
15
 
16
16
 
17
17
/* A lexical scanner on a temporary buffer with a yacc interface */
26
26
#include "drizzled/lookup_symbol.h"
27
27
#include "drizzled/index_hint.h"
28
28
 
29
 
#include <cstdio>
30
29
#include <ctype.h>
31
30
 
32
31
using namespace std;
44
43
*/
45
44
static bool add_to_list(Session *session, SQL_LIST &list, Item *item, bool asc)
46
45
{
47
 
  Order *order;
48
 
  if (!(order = (Order *) session->alloc(sizeof(Order))))
 
46
  order_st *order;
 
47
  if (!(order = (order_st *) session->alloc(sizeof(order_st))))
49
48
    return(1);
50
49
  order->item_ptr= item;
51
50
  order->item= &order->item_ptr;
206
205
  Because of this, it's critical to not do too much things here.
207
206
  (We already do too much here)
208
207
*/
209
 
void LEX::start(Session *arg)
210
 
{
211
 
  lex_start(arg);
212
 
}
213
 
 
214
208
void lex_start(Session *session)
215
209
{
216
210
  LEX *lex= session->lex;
264
258
 
265
259
  lex->is_lex_started= true;
266
260
  lex->statement= NULL;
267
 
  
268
 
  lex->is_cross= false;
269
 
 
270
 
  lex->reset();
271
261
}
272
262
 
273
 
void LEX::end()
 
263
void lex_end(LEX *lex)
274
264
{
275
 
  if (yacc_yyss)
 
265
  if (lex->yacc_yyss)
276
266
  {
277
 
    free(yacc_yyss);
278
 
    free(yacc_yyvs);
279
 
    yacc_yyss= 0;
280
 
    yacc_yyvs= 0;
 
267
    free(lex->yacc_yyss);
 
268
    free(lex->yacc_yyvs);
 
269
    lex->yacc_yyss= 0;
 
270
    lex->yacc_yyvs= 0;
281
271
  }
282
272
 
283
 
  delete result;
284
 
 
285
 
  result= 0;
286
 
  setCacheable(true);
287
 
 
288
 
  delete statement;
289
 
  statement= NULL;
 
273
  delete lex->result;
 
274
 
 
275
  lex->result= 0;
 
276
 
 
277
  if (lex->statement) 
 
278
    delete lex->statement;
290
279
}
291
280
 
292
281
static int find_keyword(Lex_input_stream *lip, uint32_t len, bool function)
1304
1293
  options= 0;
1305
1294
  linkage= UNSPECIFIED_TYPE;
1306
1295
  no_error= no_table_names_allowed= 0;
1307
 
  uncacheable.reset();
 
1296
  uncacheable= 0;
1308
1297
}
1309
1298
 
1310
1299
void Select_Lex_Node::init_select()
1373
1362
  group_list.empty();
1374
1363
  db= 0;
1375
1364
  having= 0;
 
1365
  table_join_options= 0;
1376
1366
  in_sum_expr= with_wild= 0;
1377
1367
  options= 0;
1378
1368
  braces= 0;
1569
1559
       s && s != last;
1570
1560
       s= s->outer_select())
1571
1561
  {
1572
 
    if (! (s->uncacheable.test(UNCACHEABLE_DEPENDENT)))
 
1562
    if (!(s->uncacheable & UNCACHEABLE_DEPENDENT))
1573
1563
    {
1574
1564
      // Select is dependent of outer select
1575
 
      s->uncacheable.set(UNCACHEABLE_DEPENDENT);
1576
 
      s->uncacheable.set(UNCACHEABLE_UNITED);
 
1565
      s->uncacheable= (s->uncacheable & ~UNCACHEABLE_UNITED) |
 
1566
                       UNCACHEABLE_DEPENDENT;
1577
1567
      Select_Lex_Unit *munit= s->master_unit();
1578
 
      munit->uncacheable.set(UNCACHEABLE_UNITED);
1579
 
      munit->uncacheable.set(UNCACHEABLE_DEPENDENT);
 
1568
      munit->uncacheable= (munit->uncacheable & ~UNCACHEABLE_UNITED) |
 
1569
                       UNCACHEABLE_DEPENDENT;
1580
1570
      for (Select_Lex *sl= munit->first_select(); sl ; sl= sl->next_select())
1581
1571
      {
1582
1572
        if (sl != s &&
1583
 
            ! (sl->uncacheable.test(UNCACHEABLE_DEPENDENT) && sl->uncacheable.test(UNCACHEABLE_UNITED)))
1584
 
          sl->uncacheable.set(UNCACHEABLE_UNITED);
 
1573
            !(sl->uncacheable & (UNCACHEABLE_DEPENDENT | UNCACHEABLE_UNITED)))
 
1574
          sl->uncacheable|= UNCACHEABLE_UNITED;
1585
1575
      }
1586
1576
    }
1587
1577
    s->is_correlated= true;
1606
1596
List<Item>* Select_Lex_Node::get_item_list()
1607
1597
{ return NULL; }
1608
1598
 
1609
 
TableList *Select_Lex_Node::add_table_to_list(Session *, 
1610
 
                                              Table_ident *, 
1611
 
                                              LEX_STRING *, 
1612
 
                                              const bitset<NUM_OF_TABLE_OPTIONS>&,
1613
 
                                              thr_lock_type, 
1614
 
                                              List<Index_hint> *, 
1615
 
                                              LEX_STRING *)
 
1599
TableList *Select_Lex_Node::add_table_to_list (Session *, Table_ident *, LEX_STRING *, uint32_t,
 
1600
                                                  thr_lock_type, List<Index_hint> *, LEX_STRING *)
1616
1601
{
1617
1602
  return 0;
1618
1603
}
1619
1604
 
 
1605
uint32_t Select_Lex_Node::get_table_join_options()
 
1606
{
 
1607
  return 0;
 
1608
}
1620
1609
 
1621
1610
/*
1622
1611
  prohibit using LIMIT clause
1694
1683
  return &item_list;
1695
1684
}
1696
1685
 
 
1686
uint32_t Select_Lex::get_table_join_options()
 
1687
{
 
1688
  return table_join_options;
 
1689
}
1697
1690
 
1698
1691
bool Select_Lex::setup_ref_array(Session *session, uint32_t order_group_num)
1699
1692
{
1734
1727
      str->append(STRING_WITH_LEN(" order by "));
1735
1728
      fake_select_lex->print_order(
1736
1729
        str,
1737
 
        (Order *) fake_select_lex->order_list.first,
 
1730
        (order_st *) fake_select_lex->order_list.first,
1738
1731
        query_type);
1739
1732
    }
1740
1733
    fake_select_lex->print_limit(session, str, query_type);
1742
1735
}
1743
1736
 
1744
1737
void Select_Lex::print_order(String *str,
1745
 
                                Order *order,
 
1738
                                order_st *order,
1746
1739
                                enum_query_type query_type)
1747
1740
{
1748
1741
  for (; order; order= order->next)
1864
1857
    for this.
1865
1858
*/
1866
1859
LEX::LEX()
1867
 
  :
1868
 
    result(0), 
1869
 
    yacc_yyss(0), 
1870
 
    yacc_yyvs(0),
1871
 
    charset(NULL),
1872
 
    sql_command(SQLCOM_END), 
1873
 
    option_type(OPT_DEFAULT), 
1874
 
    is_lex_started(0),
1875
 
    cacheable(true),
1876
 
    sum_expr_used(false)
 
1860
  :result(0), yacc_yyss(0), yacc_yyvs(0),
 
1861
   sql_command(SQLCOM_END), option_type(OPT_DEFAULT), is_lex_started(0)
1877
1862
{
1878
1863
  reset_query_tables_list(true);
1879
1864
  statement= NULL;
1880
1865
}
1881
1866
 
 
1867
/*
 
1868
  Detect that we need only table structure of derived table/view
 
1869
 
 
1870
  SYNOPSIS
 
1871
    only_view_structure()
 
1872
 
 
1873
  RETURN
 
1874
    true yes, we need only structure
 
1875
    false no, we need data
 
1876
*/
 
1877
bool LEX::only_view_structure()
 
1878
{
 
1879
  if (sql_command == SQLCOM_SHOW_CREATE)
 
1880
    return true;
 
1881
 
 
1882
  return false;
 
1883
}
 
1884
 
 
1885
/*
 
1886
  Should Items_ident be printed correctly
 
1887
 
 
1888
  SYNOPSIS
 
1889
    need_correct_ident()
 
1890
 
 
1891
  RETURN
 
1892
    true yes, we need only structure
 
1893
    false no, we need data
 
1894
*/
 
1895
bool LEX::need_correct_ident()
 
1896
{
 
1897
  if (sql_command== SQLCOM_SHOW_CREATE)
 
1898
    return true;
 
1899
 
 
1900
  return false;
 
1901
}
 
1902
 
1882
1903
/**
1883
1904
  This method should be called only during parsing.
1884
1905
  It is aware of compound statements (stored routine bodies)