← Back to branch summary

~drizzle-trunk/drizzle/development

« back to all changes in this revision

Viewing changes to drizzled/sql_lex.cc

  • Committer: Monty Taylor
  • Date: 2010-06-02 22:35:45 UTC
  • mto: This revision was merged to the branch mainline in revision 1586.
  • Revision ID: mordred@inaugust.com-20100602223545-q8ekf9b40a85nwuf
Rearragned unittests into a single exe because of how we need to link it
(thanks lifeless)
Link with server symbols without needing to build a library.
Added an additional atomics test which tests whatever version of the atomics
lib the running platform would actually use.

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