summaryrefslogtreecommitdiff
path: root/storage/innobase/pars
diff options
context:
space:
mode:
authorunknown <aivanov@mysql.com>2006-03-10 19:22:21 +0300
committerunknown <aivanov@mysql.com>2006-03-10 19:22:21 +0300
commit050f14ac371e03dc96b96e8a9b0cd8fa8e3a23e0 (patch)
tree8105d79f7267d8af93861befd1899063f1ad42c2 /storage/innobase/pars
parent1cef1679a47bfbf744d656646770193ba07c30fe (diff)
downloadmariadb-git-050f14ac371e03dc96b96e8a9b0cd8fa8e3a23e0.tar.gz
Applied innodb-5.1-ss269 snapshot.
Fixed BUGS: #3300: "UPDATE statement with no index column in where condition locks all rows" Implement semi-consistent read to reduce lock conflicts at the cost of breaking serializability. ha_innobase::unlock_row(): reset the "did semi consistent read" flag ha_innobase::was_semi_consistent_read(), ha_innobase::try_semi_consistent_read(): new methods row_prebuilt_t, row_create_prebuilt(): add field row_read_type for keeping track of semi-consistent reads row_vers_build_for_semi_consistent_read(), row_sel_build_committed_vers_for_mysql(): new functions row_search_for_mysql(): implement semi-consistent reads #9802: "Foreign key checks disallow alter table". Added test cases. #12456: "Cursor shows incorrect data - DML does not affect, probably caching" This patch implements a high-granularity read view to be used with cursors. In this high-granularity consistent read view modifications done by the creating transaction after the cursor is created or future transactions are not visible. But those modifications that transaction did before the cursor was created are visible. #12701: "Support >4GB buffer pool and log files on 64-bit Windows" Do not call os_file_create_tmpfile() at runtime. Instead, create all tempfiles at startup and guard access to them with mutexes. #13778: "If FOREIGN_KEY_CHECKS=0, one can create inconsistent FOREIGN KEYs". When FOREIGN_KEY_CHECKS=0 we still need to check that datatypes between foreign key references are compatible. #14189: "VARBINARY and BINARY variables: trailing space ignored with InnoDB" innobase_init(): Assert that DATA_MYSQL_BINARY_CHARSET_COLL == my_charset_bin.number. dtype_get_pad_char(): Do not pad VARBINARY or BINARY columns. row_ins_cascade_calc_update_vec(): Refuse ON UPDATE CASCADE when trying to change the length of a VARBINARY column that refers to or is referenced by a BINARY column. BINARY columns are no longer padded on comparison, and thus they cannot be padded on storage either. #14747: "Race condition can cause btr_search_drop_page_hash_index() to crash" Note that buf_block_t::index should be protected by btr_search_latch or an s-latch or x-latch on the index page. btr_search_drop_page_hash_index(): Read block->index while holding btr_search_latch and use the cached value in the loop. Remove some redundant assertions. #15108: "mysqld crashes when innodb_log_file_size is set > 4G" #15308: "Problem of Order with Enum Column in Primary Key" #15550: "mysqld crashes in printing a FOREIGN KEY error in InnoDB" row_ins_foreign_report_add_err(): When printing the parent record, use the index in the parent table rather than the index in the child table. #15653: "Slow inserts to InnoDB if many thousands of .ibd files" Keep track on unflushed modifications to file spaces. When there are tens of thousands of file spaces, flushing all files in fil_flush_file_spaces() would be very slow. fil_flush_file_spaces(): Only flush unflushed file spaces. fil_space_t, fil_system_t: Add a list of unflushed spaces. #15991: "innodb-file-per-table + symlink database + rename = cr" os_file_handle_error(): Map the error codes EXDEV, ENOTDIR, and EISDIR to the new code OS_FILE_PATH_ERROR. Treat this code as OS_FILE_PATH_ERROR. This fixes the crash on RENAME TABLE when the .ibd file is a symbolic link to a different file system. #16157: "InnoDB crashes when main location settings are empty" This patch is from Heikki. #16298: "InnoDB segfaults in INSERTs in upgrade of 4.0 -> 5.0 tables with VARCHAR BINARY" dict_load_columns(): Set the charset-collation code DATA_MYSQL_BINARY_CHARSET_COLL for those binary string columns that lack a charset-collation code, i.e., the tables were created with an older version of MySQL/InnoDB than 4.1.2. #16229: "MySQL/InnoDB uses full explicit table locks in trigger processing" Take a InnoDB table lock only if user has explicitly requested a table lock. Added some additional comments to store_lock() and external_lock(). #16387: "InnoDB crash when dropping a foreign key <table>_ibfk_0" Do not mistake TABLENAME_ibfk_0 for auto-generated id. dict_table_get_highest_foreign_id(): Ignore foreign constraint identifiers starting with the pattern TABLENAME_ibfk_0. #16582: "InnoDB: Error in an adaptive hash index pointer to page" Account for a race condition when dropping the adaptive hash index for a B-tree page. btr_search_drop_page_hash_index(): Retry the operation if a hash index with different parameters was built meanwhile. Add diagnostics for the case that hash node pointers to the page remain. btr_search_info_update_hash(), btr_search_info_update_slow(): Document the parameter "info" as in/out. #16814: "SHOW INNODB STATUS format error in LATEST FOREIGN KEY ERROR section" Add a missing newline to the LAST FOREIGN KEY ERROR section in SHOW INNODB STATUS output. dict_foreign_error_report(): Always print a newline after invoking dict_print_info_on_foreign_key_in_create_format(). #16827: "Better InnoDB error message if ibdata files omitted from my.cnf" #17126: "CHECK TABLE on InnoDB causes a short hang during check of adaptive hash" CHECK TABLE blocking other queries, by releasing the btr_search_latch periodically during the adaptive hash table validation. #17405: "Valgrind: conditional jump or move depends on unititialised values" buf_block_init(): Reset magic_n, buf_fix_count and io_fix to avoid testing uninitialized variables. mysql-test/r/innodb.result: Applied innodb-5.1-ss269 snapshot. mysql-test/t/innodb.test: Applied innodb-5.1-ss269 snapshot. sql/ha_innodb.cc: Applied innodb-5.1-ss269 snapshot. sql/ha_innodb.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/btr/btr0btr.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/btr/btr0cur.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/btr/btr0pcur.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/btr/btr0sea.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/buf/buf0buf.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/buf/buf0flu.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/buf/buf0lru.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/buf/buf0rea.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/data/data0data.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/data/data0type.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dict/dict0boot.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dict/dict0crea.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dict/dict0dict.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dict/dict0load.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dict/dict0mem.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/dyn/dyn0dyn.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/eval/eval0eval.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/eval/eval0proc.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/fil/fil0fil.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/fsp/fsp0fsp.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/fut/fut0lst.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ha/ha0ha.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ha/hash0hash.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ibuf/ibuf0ibuf.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0btr.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0btr.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0cur.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0cur.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0pcur.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0pcur.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0sea.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0sea.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/btr0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/buf0buf.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/buf0buf.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/buf0flu.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/buf0flu.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/buf0lru.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/data0data.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/data0data.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/data0type.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/data0type.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/db0err.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0boot.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0boot.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0crea.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0dict.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0dict.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0load.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dict0mem.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dyn0dyn.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/dyn0dyn.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/eval0eval.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/eval0eval.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/eval0proc.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/eval0proc.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/fil0fil.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/fsp0fsp.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/fut0lst.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ha0ha.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/hash0hash.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/hash0hash.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ibuf0ibuf.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ibuf0ibuf.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/lock0lock.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/lock0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/log0log.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/log0log.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/log0recv.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mach0data.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mach0data.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mem0dbg.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mem0dbg.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mem0mem.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mem0mem.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mem0pool.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mtr0log.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mtr0mtr.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/mtr0mtr.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/os0file.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/os0proc.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/os0sync.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/os0sync.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/os0thread.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/page0cur.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/page0cur.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/page0page.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/page0page.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/page0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/pars0grm.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/pars0opt.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/pars0pars.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/pars0sym.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/pars0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/que0que.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/que0que.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/que0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/read0read.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/read0read.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/rem0cmp.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/rem0cmp.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/rem0rec.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/rem0rec.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0ins.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0mysql.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0purge.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0row.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0row.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0sel.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0sel.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0uins.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0umod.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0undo.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0upd.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0upd.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/row0vers.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/srv0srv.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/srv0start.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/sync0arr.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/sync0rw.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/sync0rw.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/sync0sync.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/sync0sync.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0purge.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0purge.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0rec.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0roll.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0rseg.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0rseg.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0sys.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0sys.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0trx.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0trx.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0undo.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0undo.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/trx0xa.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/univ.i: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/usr0sess.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/usr0types.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0byte.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0byte.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0dbg.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0lst.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0mem.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0mem.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0rnd.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0rnd.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0sort.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0ut.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/include/ut0ut.ic: Applied innodb-5.1-ss269 snapshot. storage/innobase/lock/lock0lock.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/log/log0log.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/log/log0recv.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mach/mach0data.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mem/mem0dbg.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mem/mem0mem.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mem/mem0pool.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mtr/mtr0log.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/mtr/mtr0mtr.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/os/os0file.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/os/os0proc.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/os/os0sync.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/os/os0thread.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/page/page0cur.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/page/page0page.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/lexyy.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0grm.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0grm.h: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0grm.y: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0lex.l: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0opt.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0pars.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/pars/pars0sym.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/que/que0que.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/read/read0read.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/rem/rem0cmp.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/rem/rem0rec.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0ins.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0mysql.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0purge.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0row.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0sel.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0uins.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0umod.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0undo.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0upd.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/row/row0vers.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/srv/srv0que.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/srv/srv0srv.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/srv/srv0start.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/sync/sync0arr.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/sync/sync0rw.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/sync/sync0sync.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/thr/thr0loc.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0purge.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0rec.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0roll.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0rseg.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0sys.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0trx.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/trx/trx0undo.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/usr/usr0sess.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ut/ut0byte.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ut/ut0dbg.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ut/ut0mem.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ut/ut0rnd.c: Applied innodb-5.1-ss269 snapshot. storage/innobase/ut/ut0ut.c: Applied innodb-5.1-ss269 snapshot. mysql-test/r/innodb_unsafe_binlog.result: New BitKeeper file ``mysql-test/r/innodb_unsafe_binlog.result'' mysql-test/t/innodb_unsafe_binlog-master.opt: New BitKeeper file ``mysql-test/t/innodb_unsafe_binlog-master.opt'' mysql-test/t/innodb_unsafe_binlog.test: New BitKeeper file ``mysql-test/t/innodb_unsafe_binlog.test'' storage/innobase/pars/make_bison.sh: New BitKeeper file ``storage/innobase/pars/make_bison.sh''
Diffstat (limited to 'storage/innobase/pars')
-rw-r--r--storage/innobase/pars/lexyy.c2146
-rwxr-xr-xstorage/innobase/pars/make_bison.sh11
-rw-r--r--storage/innobase/pars/pars0grm.c3670
-rw-r--r--storage/innobase/pars/pars0grm.h302
-rw-r--r--storage/innobase/pars/pars0grm.y21
-rw-r--r--storage/innobase/pars/pars0lex.l15
-rw-r--r--storage/innobase/pars/pars0opt.c170
-rw-r--r--storage/innobase/pars/pars0pars.c233
-rw-r--r--storage/innobase/pars/pars0sym.c32
9 files changed, 3748 insertions, 2852 deletions
diff --git a/storage/innobase/pars/lexyy.c b/storage/innobase/pars/lexyy.c
index 1145ca295e7..d64ecbbfcbc 100644
--- a/storage/innobase/pars/lexyy.c
+++ b/storage/innobase/pars/lexyy.c
@@ -1,34 +1,87 @@
-/* A lexical scanner generated by flex */
-/* Scanner skeleton version:
- * $Header: /home/heikki/cvsroot/ib/pars/lexyy.c,v 1.2 2003/10/30 20:27:19 heikki Exp $
- */
+#line 3 "lex.yy.c"
-/* This include MUST be first to keep things portable ! */
#include "univ.i"
+#define YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
#define FLEX_SCANNER
#define YY_FLEX_MAJOR_VERSION 2
#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 31
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+/* First, we deal with platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
#include <stdio.h>
+#include <string.h>
+#include <errno.h>
+#include <stdlib.h>
+
+/* end standard C headers. */
+/* flex integer type definitions */
-/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */
-#ifdef c_plusplus
-#ifndef __cplusplus
-#define __cplusplus
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have <inttypes.h>. Non-C99 systems may or may not. */
+
+#if defined __STDC_VERSION__ && __STDC_VERSION__ >= 199901L
+#include <inttypes.h>
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t;
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+#endif /* ! C99 */
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX (2147483647)
#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX (4294967295U)
#endif
+#endif /* ! FLEXINT_H */
#ifdef __cplusplus
-#include <stdlib.h>
-
-/* Use prototypes in function declarations. */
-#define YY_USE_PROTOS
-
/* The "const" storage-class-modifier is valid. */
#define YY_USE_CONST
@@ -36,34 +89,17 @@
#if __STDC__
-#define YY_USE_PROTOS
#define YY_USE_CONST
#endif /* __STDC__ */
#endif /* ! __cplusplus */
-#ifdef __TURBOC__
- #pragma warn -rch
- #pragma warn -use
-#include <io.h>
-#include <stdlib.h>
-#define YY_USE_CONST
-#define YY_USE_PROTOS
-#endif
-
#ifdef YY_USE_CONST
#define yyconst const
#else
#define yyconst
#endif
-
-#ifdef YY_USE_PROTOS
-#define YY_PROTO(proto) proto
-#else
-#define YY_PROTO(proto) ()
-#endif
-
/* Returned upon end-of-file. */
#define YY_NULL 0
@@ -78,71 +114,71 @@
* but we do it the disgusting crufty way forced on us by the ()-less
* definition of BEGIN.
*/
-#define BEGIN yy_start = 1 + 2 *
+#define BEGIN (yy_start) = 1 + 2 *
/* Translate the current start state into a value that can be later handed
* to BEGIN to return to the state. The YYSTATE alias is for lex
* compatibility.
*/
-#define YY_START ((yy_start - 1) / 2)
+#define YY_START (((yy_start) - 1) / 2)
#define YYSTATE YY_START
/* Action number for EOF rule of a given start state. */
#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
/* Special action meaning "start processing a new file". */
-#define YY_NEW_FILE yyrestart( yyin )
+#define YY_NEW_FILE yyrestart(yyin )
#define YY_END_OF_BUFFER_CHAR 0
/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
#define YY_BUF_SIZE 16384
+#endif
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
extern int yyleng;
+
extern FILE *yyin, *yyout;
#define EOB_ACT_CONTINUE_SCAN 0
#define EOB_ACT_END_OF_FILE 1
#define EOB_ACT_LAST_MATCH 2
-/* The funky do-while in the following #define is used to turn the definition
- * int a single C statement (which needs a semi-colon terminator). This
- * avoids problems with code like:
- *
- * if ( condition_holds )
- * yyless( 5 );
- * else
- * do_something_else();
- *
- * Prior to using the do-while the compiler would get upset at the
- * "else" because it interpreted the "if" statement as being all
- * done when it reached the ';' after the yyless() call.
- */
-
-/* Return all but the first 'n' matched characters back to the input stream. */
-
+ #define YY_LESS_LINENO(n)
+
+/* Return all but the first "n" matched characters back to the input stream. */
#define yyless(n) \
do \
{ \
/* Undo effects of setting up yytext. */ \
- *yy_cp = yy_hold_char; \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ *yy_cp = (yy_hold_char); \
YY_RESTORE_YY_MORE_OFFSET \
- yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
+ (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
YY_DO_BEFORE_ACTION; /* set up yytext again */ \
} \
while ( 0 )
-#define unput(c) yyunput( c, yytext_ptr )
+#define unput(c) yyunput( c, (yytext_ptr) )
/* The following is because we cannot portably get our hands on size_t
* (without autoconf's help, which isn't available because we want
* flex-generated scanners to compile on their own).
*/
-typedef unsigned int yy_size_t;
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef unsigned int yy_size_t;
+#endif
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
struct yy_buffer_state
{
FILE *yy_input_file;
@@ -179,12 +215,16 @@ struct yy_buffer_state
*/
int yy_at_bol;
+ int yy_bs_lineno; /**< The line count. */
+ int yy_bs_column; /**< The column count. */
+
/* Whether to try to fill the input buffer when we reach the
* end of it.
*/
int yy_fill_buffer;
int yy_buffer_status;
+
#define YY_BUFFER_NEW 0
#define YY_BUFFER_NORMAL 1
/* When an EOF's been seen but there's still some text to process
@@ -198,23 +238,33 @@ struct yy_buffer_state
* just pointing yyin at a new input file.
*/
#define YY_BUFFER_EOF_PENDING 2
+
};
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
-static YY_BUFFER_STATE yy_current_buffer = 0;
+/* Stack of input buffers. */
+static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
+static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
+static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
/* We provide macros for accessing buffer states in case in the
* future we want to put the buffer states in a more general
* "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
*/
-#define YY_CURRENT_BUFFER yy_current_buffer
+#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
+ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
+ : NULL)
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
/* yy_hold_char holds the character lost when yytext is formed. */
static char yy_hold_char;
-
static int yy_n_chars; /* number of characters read into yy_ch_buf */
-
-
int yyleng;
/* Points to current character in buffer. */
@@ -227,113 +277,139 @@ static int yy_start = 0; /* start state number */
*/
static int yy_did_buffer_switch_on_eof;
-void yyrestart YY_PROTO(( FILE *input_file ));
+void yyrestart (FILE *input_file );
+void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer );
+YY_BUFFER_STATE yy_create_buffer (FILE *file,int size );
+void yy_delete_buffer (YY_BUFFER_STATE b );
+void yy_flush_buffer (YY_BUFFER_STATE b );
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer );
+void yypop_buffer_state (void );
-void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
-void yy_load_buffer_state YY_PROTO(( void ));
-YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
-void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
-void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
-void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
-#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
+static void yyensure_buffer_stack (void );
+static void yy_load_buffer_state (void );
+static void yy_init_buffer (YY_BUFFER_STATE b,FILE *file );
-YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
-YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str ));
-YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
+#define YY_FLUSH_BUFFER yy_flush_buffer(YY_CURRENT_BUFFER )
-static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
-static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
-static void yy_flex_free YY_PROTO(( void * ));
+YY_BUFFER_STATE yy_scan_buffer (char *base,yy_size_t size );
+YY_BUFFER_STATE yy_scan_string (yyconst char *yy_str );
+YY_BUFFER_STATE yy_scan_bytes (yyconst char *bytes,int len );
+
+void *yyalloc (yy_size_t );
+void *yyrealloc (void *,yy_size_t );
+void yyfree (void * );
#define yy_new_buffer yy_create_buffer
#define yy_set_interactive(is_interactive) \
{ \
- if ( ! yy_current_buffer ) \
- yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
- yy_current_buffer->yy_is_interactive = is_interactive; \
+ if ( ! YY_CURRENT_BUFFER ){ \
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer(yyin,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
}
#define yy_set_bol(at_bol) \
{ \
- if ( ! yy_current_buffer ) \
- yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
- yy_current_buffer->yy_at_bol = at_bol; \
+ if ( ! YY_CURRENT_BUFFER ){\
+ yyensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ yy_create_buffer(yyin,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
}
-#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+/* Begin user sect3 */
-#define yywrap() 1
+#define yywrap(n) 1
#define YY_SKIP_YYWRAP
+
typedef unsigned char YY_CHAR;
+
FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
+
typedef int yy_state_type;
+
+extern int yylineno;
+
+int yylineno = 1;
+
extern char *yytext;
#define yytext_ptr yytext
-static yy_state_type yy_get_previous_state YY_PROTO(( void ));
-static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
-static int yy_get_next_buffer YY_PROTO(( void ));
-static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
+static yy_state_type yy_get_previous_state (void );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
+static int yy_get_next_buffer (void );
+static void yy_fatal_error (yyconst char msg[] );
/* Done after the current pattern has been matched and before the
* corresponding action - sets up yytext.
*/
#define YY_DO_BEFORE_ACTION \
- yytext_ptr = yy_bp; \
- yyleng = (int) (yy_cp - yy_bp); \
- yy_hold_char = *yy_cp; \
+ (yytext_ptr) = yy_bp; \
+ yyleng = (size_t) (yy_cp - yy_bp); \
+ (yy_hold_char) = *yy_cp; \
*yy_cp = '\0'; \
- yy_c_buf_p = yy_cp;
+ (yy_c_buf_p) = yy_cp;
-#define YY_NUM_RULES 107
-#define YY_END_OF_BUFFER 108
-static yyconst short int yy_accept[367] =
+#define YY_NUM_RULES 109
+#define YY_END_OF_BUFFER 110
+/* This struct is not used in this scanner,
+ but its presence is necessary. */
+struct yy_trans_info
+ {
+ flex_int32_t yy_verify;
+ flex_int32_t yy_nxt;
+ };
+static yyconst flex_int16_t yy_accept[370] =
{ 0,
- 0, 0, 102, 102, 0, 0, 108, 106, 105, 105,
- 97, 3, 86, 92, 95, 93, 90, 94, 106, 96,
- 1, 106, 91, 89, 87, 88, 100, 80, 80, 80,
- 80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
- 80, 80, 80, 80, 80, 98, 99, 102, 103, 4,
- 5, 105, 81, 101, 2, 1, 82, 83, 85, 84,
- 80, 80, 80, 80, 80, 38, 80, 80, 80, 80,
- 80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
- 21, 12, 18, 80, 80, 80, 80, 48, 55, 80,
- 9, 80, 80, 80, 80, 80, 80, 80, 80, 80,
-
- 80, 80, 80, 80, 80, 80, 80, 80, 102, 103,
- 103, 104, 4, 5, 2, 8, 39, 80, 80, 80,
- 80, 80, 80, 80, 80, 80, 80, 80, 80, 80,
- 80, 80, 80, 80, 20, 80, 80, 34, 80, 80,
- 80, 14, 80, 80, 10, 80, 80, 80, 13, 80,
- 80, 80, 80, 80, 74, 80, 80, 80, 45, 7,
- 80, 29, 80, 80, 80, 80, 80, 80, 80, 80,
- 80, 80, 80, 80, 80, 17, 80, 80, 80, 80,
- 80, 80, 80, 80, 80, 80, 80, 40, 80, 80,
- 23, 80, 80, 80, 32, 80, 80, 80, 80, 42,
-
- 80, 25, 80, 6, 58, 80, 80, 80, 36, 80,
- 80, 80, 80, 80, 80, 80, 80, 80, 22, 80,
- 80, 80, 80, 80, 80, 80, 80, 79, 80, 19,
- 80, 60, 80, 80, 80, 80, 30, 80, 80, 80,
- 80, 80, 80, 80, 24, 59, 16, 51, 80, 69,
- 80, 80, 80, 37, 80, 80, 80, 80, 80, 80,
- 80, 80, 80, 80, 50, 80, 80, 80, 80, 80,
- 80, 33, 26, 73, 80, 80, 77, 68, 80, 49,
- 80, 57, 80, 46, 80, 80, 41, 80, 70, 80,
- 72, 80, 80, 27, 80, 80, 80, 28, 66, 80,
-
- 80, 80, 80, 52, 44, 43, 80, 80, 80, 47,
- 56, 80, 80, 15, 80, 80, 67, 75, 80, 80,
- 71, 80, 62, 80, 80, 80, 80, 31, 80, 61,
- 80, 78, 80, 80, 80, 80, 53, 80, 80, 11,
- 80, 64, 63, 80, 35, 80, 76, 80, 80, 80,
- 80, 80, 80, 80, 80, 80, 80, 65, 80, 80,
- 80, 80, 80, 80, 54, 0
+ 0, 0, 104, 104, 0, 0, 110, 108, 107, 107,
+ 99, 3, 88, 94, 97, 95, 92, 96, 108, 98,
+ 1, 108, 93, 91, 89, 90, 102, 82, 82, 82,
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
+ 82, 82, 82, 82, 82, 100, 101, 104, 105, 4,
+ 5, 107, 83, 103, 2, 1, 84, 85, 87, 86,
+ 82, 82, 82, 82, 82, 82, 40, 82, 82, 82,
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
+ 82, 23, 12, 20, 82, 82, 82, 82, 50, 57,
+ 82, 9, 82, 82, 82, 82, 82, 82, 82, 82,
+
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 104,
+ 105, 105, 106, 4, 5, 2, 8, 41, 82, 82,
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
+ 82, 82, 82, 82, 82, 82, 22, 82, 82, 36,
+ 82, 82, 82, 16, 82, 82, 10, 82, 82, 82,
+ 13, 82, 82, 82, 82, 82, 76, 82, 82, 82,
+ 47, 7, 82, 31, 82, 82, 82, 82, 82, 82,
+ 82, 82, 82, 82, 82, 82, 82, 15, 19, 82,
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
+ 42, 82, 82, 25, 82, 82, 82, 34, 82, 82,
+
+ 82, 82, 44, 82, 27, 82, 6, 60, 82, 82,
+ 82, 38, 82, 82, 82, 82, 82, 82, 82, 82,
+ 82, 24, 82, 82, 82, 82, 82, 82, 82, 82,
+ 81, 82, 21, 82, 62, 82, 82, 82, 82, 32,
+ 82, 82, 82, 82, 82, 82, 82, 26, 61, 18,
+ 53, 82, 71, 82, 82, 82, 39, 82, 82, 82,
+ 82, 82, 82, 82, 82, 82, 82, 52, 82, 82,
+ 82, 82, 82, 82, 35, 28, 75, 14, 82, 79,
+ 70, 82, 51, 82, 59, 82, 48, 82, 82, 43,
+ 82, 72, 82, 74, 82, 82, 29, 82, 82, 82,
+
+ 30, 68, 82, 82, 82, 82, 54, 46, 45, 82,
+ 82, 82, 49, 58, 82, 82, 17, 82, 82, 69,
+ 77, 82, 82, 73, 82, 64, 82, 82, 82, 82,
+ 33, 82, 63, 82, 80, 82, 82, 82, 82, 55,
+ 82, 82, 11, 82, 66, 65, 82, 37, 82, 78,
+ 82, 82, 82, 82, 82, 82, 82, 82, 82, 82,
+ 67, 82, 82, 82, 82, 82, 82, 56, 0
} ;
-static yyconst int yy_ec[256] =
+static yyconst flex_int32_t yy_ec[256] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
@@ -365,7 +441,7 @@ static yyconst int yy_ec[256] =
1, 1, 1, 1, 1
} ;
-static yyconst int yy_meta[49] =
+static yyconst flex_int32_t yy_meta[49] =
{ 0,
1, 1, 1, 1, 2, 1, 1, 3, 1, 1,
1, 1, 1, 4, 1, 1, 1, 1, 1, 1,
@@ -374,150 +450,150 @@ static yyconst int yy_meta[49] =
4, 4, 4, 4, 4, 4, 1, 1
} ;
-static yyconst short int yy_base[373] =
+static yyconst flex_int16_t yy_base[376] =
{ 0,
- 0, 0, 387, 386, 388, 387, 391, 396, 47, 49,
- 396, 396, 396, 396, 396, 396, 396, 396, 378, 381,
- 41, 370, 396, 38, 396, 369, 396, 20, 33, 32,
- 36, 34, 44, 0, 46, 49, 40, 57, 348, 52,
- 63, 68, 56, 364, 66, 396, 396, 0, 89, 0,
- 379, 103, 396, 396, 369, 95, 396, 396, 396, 396,
- 0, 358, 76, 354, 346, 0, 358, 75, 78, 353,
- 339, 90, 337, 350, 335, 349, 332, 336, 332, 334,
- 0, 93, 0, 334, 332, 326, 333, 0, 0, 339,
- 339, 322, 85, 100, 337, 91, 86, 328, 102, 320,
-
- 336, 332, 310, 326, 330, 321, 102, 314, 0, 117,
- 129, 396, 0, 346, 336, 0, 0, 324, 319, 326,
- 308, 306, 305, 310, 105, 308, 320, 100, 308, 314,
- 315, 297, 297, 116, 0, 312, 313, 0, 300, 307,
- 118, 121, 304, 294, 303, 296, 293, 301, 0, 291,
- 301, 299, 290, 280, 274, 287, 272, 292, 0, 0,
- 277, 0, 291, 282, 279, 125, 275, 290, 269, 271,
- 276, 276, 268, 271, 266, 0, 278, 262, 272, 279,
- 270, 258, 257, 271, 260, 273, 253, 0, 263, 245,
- 0, 264, 261, 248, 0, 243, 248, 247, 257, 0,
-
- 243, 0, 247, 0, 0, 243, 240, 254, 0, 239,
- 239, 237, 253, 238, 250, 232, 250, 245, 0, 240,
- 240, 226, 225, 225, 239, 238, 237, 0, 221, 0,
- 215, 0, 234, 218, 217, 217, 0, 230, 220, 215,
- 214, 226, 216, 215, 0, 0, 0, 0, 208, 0,
- 222, 218, 204, 0, 218, 219, 202, 207, 200, 218,
- 200, 197, 198, 195, 0, 200, 212, 199, 206, 205,
- 190, 0, 0, 0, 182, 189, 0, 0, 186, 0,
- 185, 0, 199, 0, 200, 187, 0, 183, 0, 186,
- 0, 178, 180, 0, 179, 193, 186, 0, 0, 189,
-
- 192, 174, 189, 0, 0, 0, 170, 184, 183, 0,
- 0, 167, 166, 0, 181, 166, 0, 0, 172, 168,
- 0, 163, 0, 175, 164, 174, 163, 0, 150, 0,
- 170, 0, 154, 148, 154, 145, 0, 150, 163, 0,
- 162, 0, 0, 153, 0, 157, 0, 144, 144, 150,
- 136, 159, 151, 152, 136, 119, 109, 0, 121, 128,
- 119, 116, 112, 104, 0, 396, 159, 163, 59, 167,
- 171, 175
+ 0, 0, 390, 389, 391, 390, 394, 399, 47, 49,
+ 399, 399, 399, 399, 399, 399, 399, 399, 381, 384,
+ 41, 373, 399, 38, 399, 372, 399, 20, 33, 32,
+ 46, 29, 44, 0, 46, 49, 42, 60, 351, 65,
+ 66, 67, 32, 367, 69, 399, 399, 0, 79, 0,
+ 382, 103, 399, 399, 372, 96, 399, 399, 399, 399,
+ 0, 361, 70, 357, 349, 347, 0, 360, 77, 80,
+ 355, 341, 92, 339, 352, 337, 351, 334, 338, 334,
+ 336, 0, 93, 0, 336, 334, 328, 335, 0, 0,
+ 341, 341, 324, 87, 98, 339, 93, 88, 330, 104,
+
+ 322, 338, 334, 312, 328, 332, 323, 98, 316, 0,
+ 122, 131, 399, 0, 348, 338, 0, 0, 326, 321,
+ 328, 326, 309, 307, 306, 311, 106, 309, 321, 102,
+ 309, 315, 316, 298, 298, 117, 0, 313, 314, 0,
+ 301, 308, 118, 122, 305, 295, 304, 297, 294, 302,
+ 0, 292, 302, 300, 291, 281, 275, 288, 273, 293,
+ 0, 0, 278, 0, 292, 283, 280, 126, 276, 291,
+ 270, 272, 277, 277, 269, 272, 267, 0, 0, 279,
+ 263, 273, 280, 271, 259, 258, 272, 261, 274, 254,
+ 0, 264, 246, 0, 265, 262, 249, 0, 244, 249,
+
+ 248, 258, 0, 244, 0, 248, 0, 0, 244, 241,
+ 255, 0, 240, 240, 238, 254, 239, 251, 233, 251,
+ 246, 0, 241, 241, 227, 226, 226, 240, 239, 238,
+ 0, 222, 0, 216, 0, 235, 219, 218, 218, 0,
+ 231, 221, 216, 215, 227, 217, 216, 0, 0, 0,
+ 0, 209, 0, 223, 219, 205, 0, 219, 220, 203,
+ 208, 201, 219, 201, 198, 199, 196, 0, 201, 213,
+ 200, 207, 206, 191, 0, 0, 0, 183, 190, 0,
+ 0, 187, 0, 186, 0, 200, 0, 201, 188, 0,
+ 184, 0, 187, 0, 179, 181, 0, 180, 194, 187,
+
+ 0, 0, 190, 193, 175, 190, 0, 0, 0, 171,
+ 185, 184, 0, 0, 168, 167, 0, 182, 167, 0,
+ 0, 173, 169, 0, 164, 0, 176, 165, 175, 164,
+ 0, 151, 0, 171, 0, 155, 149, 155, 146, 0,
+ 151, 164, 0, 163, 0, 0, 154, 0, 158, 0,
+ 145, 145, 151, 137, 160, 152, 153, 137, 121, 110,
+ 0, 122, 129, 120, 117, 113, 105, 0, 399, 160,
+ 164, 85, 168, 172, 176
} ;
-static yyconst short int yy_def[373] =
+static yyconst flex_int16_t yy_def[376] =
{ 0,
- 366, 1, 367, 367, 368, 368, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 366, 366, 370, 371, 372,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
-
- 369, 369, 369, 369, 369, 369, 369, 369, 370, 371,
- 371, 366, 372, 366, 366, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 1, 370, 370, 371, 371, 369, 369, 369, 369,
369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 369, 369, 373, 374, 375,
369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
-
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
-
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
- 369, 369, 369, 369, 369, 0, 366, 366, 366, 366,
- 366, 366
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 373,
+ 374, 374, 369, 375, 369, 369, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 372, 372,
+ 372, 372, 372, 372, 372, 372, 372, 372, 0, 369,
+ 369, 369, 369, 369, 369
} ;
-static yyconst short int yy_nxt[445] =
+static yyconst flex_int16_t yy_nxt[448] =
{ 0,
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, 34, 35, 34,
34, 36, 34, 37, 38, 39, 34, 40, 41, 42,
43, 44, 45, 34, 34, 34, 46, 47, 52, 52,
- 52, 52, 55, 62, 56, 58, 59, 64, 63, 67,
- 72, 65, 61, 68, 73, 75, 69, 76, 77, 70,
- 74, 81, 71, 84, 86, 78, 94, 66, 79, 82,
- 87, 80, 88, 85, 83, 95, 96, 97, 101, 104,
- 89, 105, 90, 107, 91, 102, 111, 92, 117, 98,
-
- 108, 112, 103, 99, 52, 52, 55, 100, 56, 122,
- 124, 125, 129, 150, 118, 123, 140, 158, 126, 151,
- 152, 130, 156, 161, 366, 159, 170, 180, 131, 366,
- 171, 141, 142, 157, 162, 153, 111, 184, 185, 154,
- 191, 112, 197, 181, 192, 199, 220, 221, 365, 364,
- 363, 362, 361, 360, 359, 200, 358, 198, 222, 48,
- 48, 48, 48, 50, 50, 50, 50, 109, 109, 357,
- 109, 110, 110, 110, 110, 113, 356, 113, 113, 355,
- 354, 353, 352, 351, 350, 349, 348, 347, 346, 345,
- 344, 343, 342, 341, 340, 339, 338, 337, 336, 335,
-
- 334, 333, 332, 331, 330, 329, 328, 327, 326, 325,
- 324, 323, 322, 321, 320, 319, 318, 317, 316, 315,
- 314, 313, 312, 311, 310, 309, 308, 307, 306, 305,
- 304, 303, 302, 301, 300, 299, 298, 297, 296, 295,
- 294, 293, 292, 291, 290, 289, 288, 287, 286, 285,
- 284, 283, 282, 281, 280, 279, 278, 277, 276, 275,
- 274, 273, 272, 271, 270, 269, 268, 267, 266, 265,
- 264, 263, 262, 261, 260, 259, 258, 257, 256, 255,
- 254, 253, 252, 251, 250, 249, 248, 247, 246, 245,
- 244, 243, 242, 241, 240, 239, 238, 237, 236, 235,
-
- 234, 233, 232, 231, 230, 229, 228, 227, 226, 225,
- 224, 223, 219, 218, 217, 216, 215, 214, 213, 212,
- 211, 210, 209, 208, 207, 206, 205, 204, 203, 202,
- 201, 196, 195, 194, 193, 190, 189, 188, 187, 186,
- 183, 182, 179, 178, 177, 176, 175, 174, 173, 115,
- 114, 172, 169, 168, 167, 166, 165, 164, 163, 160,
- 155, 149, 148, 147, 146, 145, 144, 143, 139, 138,
- 137, 136, 135, 134, 133, 132, 128, 127, 121, 120,
- 119, 116, 115, 114, 106, 93, 60, 57, 54, 53,
- 366, 51, 51, 49, 49, 7, 366, 366, 366, 366,
-
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366
+ 52, 52, 55, 62, 56, 58, 59, 64, 63, 68,
+ 76, 65, 77, 69, 66, 105, 70, 106, 78, 71,
+ 73, 82, 72, 85, 74, 79, 87, 67, 80, 83,
+ 75, 81, 88, 86, 84, 89, 112, 102, 61, 95,
+ 98, 113, 118, 90, 103, 91, 108, 92, 96, 97,
+
+ 93, 104, 99, 109, 52, 52, 100, 55, 119, 56,
+ 101, 124, 126, 127, 131, 152, 142, 125, 154, 160,
+ 128, 153, 172, 132, 158, 163, 173, 161, 183, 369,
+ 133, 143, 144, 155, 369, 159, 164, 156, 112, 187,
+ 188, 194, 200, 113, 184, 195, 202, 223, 224, 368,
+ 367, 366, 365, 364, 363, 362, 203, 201, 361, 225,
+ 48, 48, 48, 48, 50, 50, 50, 50, 110, 110,
+ 360, 110, 111, 111, 111, 111, 114, 359, 114, 114,
+ 358, 357, 356, 355, 354, 353, 352, 351, 350, 349,
+ 348, 347, 346, 345, 344, 343, 342, 341, 340, 339,
+
+ 338, 337, 336, 335, 334, 333, 332, 331, 330, 329,
+ 328, 327, 326, 325, 324, 323, 322, 321, 320, 319,
+ 318, 317, 316, 315, 314, 313, 312, 311, 310, 309,
+ 308, 307, 306, 305, 304, 303, 302, 301, 300, 299,
+ 298, 297, 296, 295, 294, 293, 292, 291, 290, 289,
+ 288, 287, 286, 285, 284, 283, 282, 281, 280, 279,
+ 278, 277, 276, 275, 274, 273, 272, 271, 270, 269,
+ 268, 267, 266, 265, 264, 263, 262, 261, 260, 259,
+ 258, 257, 256, 255, 254, 253, 252, 251, 250, 249,
+ 248, 247, 246, 245, 244, 243, 242, 241, 240, 239,
+
+ 238, 237, 236, 235, 234, 233, 232, 231, 230, 229,
+ 228, 227, 226, 222, 221, 220, 219, 218, 217, 216,
+ 215, 214, 213, 212, 211, 210, 209, 208, 207, 206,
+ 205, 204, 199, 198, 197, 196, 193, 192, 191, 190,
+ 189, 186, 185, 182, 181, 180, 179, 178, 177, 176,
+ 175, 116, 115, 174, 171, 170, 169, 168, 167, 166,
+ 165, 162, 157, 151, 150, 149, 148, 147, 146, 145,
+ 141, 140, 139, 138, 137, 136, 135, 134, 130, 129,
+ 123, 122, 121, 120, 117, 116, 115, 107, 94, 60,
+ 57, 54, 53, 369, 51, 51, 49, 49, 7, 369,
+
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369
} ;
-static yyconst short int yy_chk[445] =
+static yyconst flex_int16_t yy_chk[448] =
{ 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
@@ -525,54 +601,57 @@ static yyconst short int yy_chk[445] =
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 9, 9,
10, 10, 21, 28, 21, 24, 24, 29, 28, 30,
- 31, 29, 369, 30, 31, 32, 30, 32, 33, 30,
- 31, 35, 30, 36, 37, 33, 40, 29, 33, 35,
- 37, 33, 38, 36, 35, 40, 40, 41, 42, 43,
- 38, 43, 38, 45, 38, 42, 49, 38, 63, 41,
-
- 45, 49, 42, 41, 52, 52, 56, 41, 56, 68,
- 69, 69, 72, 93, 63, 68, 82, 97, 69, 93,
- 94, 72, 96, 99, 110, 97, 107, 125, 72, 110,
- 107, 82, 82, 96, 99, 94, 111, 128, 128, 94,
- 134, 111, 141, 125, 134, 142, 166, 166, 364, 363,
- 362, 361, 360, 359, 357, 142, 356, 141, 166, 367,
- 367, 367, 367, 368, 368, 368, 368, 370, 370, 355,
- 370, 371, 371, 371, 371, 372, 354, 372, 372, 353,
- 352, 351, 350, 349, 348, 346, 344, 341, 339, 338,
- 336, 335, 334, 333, 331, 329, 327, 326, 325, 324,
-
- 322, 320, 319, 316, 315, 313, 312, 309, 308, 307,
- 303, 302, 301, 300, 297, 296, 295, 293, 292, 290,
- 288, 286, 285, 283, 281, 279, 276, 275, 271, 270,
- 269, 268, 267, 266, 264, 263, 262, 261, 260, 259,
- 258, 257, 256, 255, 253, 252, 251, 249, 244, 243,
- 242, 241, 240, 239, 238, 236, 235, 234, 233, 231,
- 229, 227, 226, 225, 224, 223, 222, 221, 220, 218,
- 217, 216, 215, 214, 213, 212, 211, 210, 208, 207,
- 206, 203, 201, 199, 198, 197, 196, 194, 193, 192,
- 190, 189, 187, 186, 185, 184, 183, 182, 181, 180,
-
- 179, 178, 177, 175, 174, 173, 172, 171, 170, 169,
- 168, 167, 165, 164, 163, 161, 158, 157, 156, 155,
- 154, 153, 152, 151, 150, 148, 147, 146, 145, 144,
- 143, 140, 139, 137, 136, 133, 132, 131, 130, 129,
- 127, 126, 124, 123, 122, 121, 120, 119, 118, 115,
- 114, 108, 106, 105, 104, 103, 102, 101, 100, 98,
- 95, 92, 91, 90, 87, 86, 85, 84, 80, 79,
- 78, 77, 76, 75, 74, 73, 71, 70, 67, 65,
- 64, 62, 55, 51, 44, 39, 26, 22, 20, 19,
- 7, 6, 5, 4, 3, 366, 366, 366, 366, 366,
-
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366, 366, 366, 366, 366, 366, 366,
- 366, 366, 366, 366
+ 32, 29, 32, 30, 29, 43, 30, 43, 33, 30,
+ 31, 35, 30, 36, 31, 33, 37, 29, 33, 35,
+ 31, 33, 37, 36, 35, 38, 49, 42, 372, 40,
+ 41, 49, 63, 38, 42, 38, 45, 38, 40, 40,
+
+ 38, 42, 41, 45, 52, 52, 41, 56, 63, 56,
+ 41, 69, 70, 70, 73, 94, 83, 69, 95, 98,
+ 70, 94, 108, 73, 97, 100, 108, 98, 127, 111,
+ 73, 83, 83, 95, 111, 97, 100, 95, 112, 130,
+ 130, 136, 143, 112, 127, 136, 144, 168, 168, 367,
+ 366, 365, 364, 363, 362, 360, 144, 143, 359, 168,
+ 370, 370, 370, 370, 371, 371, 371, 371, 373, 373,
+ 358, 373, 374, 374, 374, 374, 375, 357, 375, 375,
+ 356, 355, 354, 353, 352, 351, 349, 347, 344, 342,
+ 341, 339, 338, 337, 336, 334, 332, 330, 329, 328,
+
+ 327, 325, 323, 322, 319, 318, 316, 315, 312, 311,
+ 310, 306, 305, 304, 303, 300, 299, 298, 296, 295,
+ 293, 291, 289, 288, 286, 284, 282, 279, 278, 274,
+ 273, 272, 271, 270, 269, 267, 266, 265, 264, 263,
+ 262, 261, 260, 259, 258, 256, 255, 254, 252, 247,
+ 246, 245, 244, 243, 242, 241, 239, 238, 237, 236,
+ 234, 232, 230, 229, 228, 227, 226, 225, 224, 223,
+ 221, 220, 219, 218, 217, 216, 215, 214, 213, 211,
+ 210, 209, 206, 204, 202, 201, 200, 199, 197, 196,
+ 195, 193, 192, 190, 189, 188, 187, 186, 185, 184,
+
+ 183, 182, 181, 180, 177, 176, 175, 174, 173, 172,
+ 171, 170, 169, 167, 166, 165, 163, 160, 159, 158,
+ 157, 156, 155, 154, 153, 152, 150, 149, 148, 147,
+ 146, 145, 142, 141, 139, 138, 135, 134, 133, 132,
+ 131, 129, 128, 126, 125, 124, 123, 122, 121, 120,
+ 119, 116, 115, 109, 107, 106, 105, 104, 103, 102,
+ 101, 99, 96, 93, 92, 91, 88, 87, 86, 85,
+ 81, 80, 79, 78, 77, 76, 75, 74, 72, 71,
+ 68, 66, 65, 64, 62, 55, 51, 44, 39, 26,
+ 22, 20, 19, 7, 6, 5, 4, 3, 369, 369,
+
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369, 369, 369, 369,
+ 369, 369, 369, 369, 369, 369, 369
} ;
static yy_state_type yy_last_accepting_state;
static char *yy_last_accepting_cpos;
+extern int yy_flex_debug;
+int yy_flex_debug = 0;
+
/* The intent behind this definition is that it'll catch
* any uses of REJECT which flex missed.
*/
@@ -582,7 +661,6 @@ static char *yy_last_accepting_cpos;
#define YY_RESTORE_YY_MORE_OFFSET
char *yytext;
#line 1 "pars0lex.l"
-#define INITIAL 0
/******************************************************
SQL parser lexical analyzer: input file for the GNU Flex lexer generator
@@ -622,13 +700,9 @@ How to make the InnoDB parser and lexer C files:
These instructions seem to work at least with bison-1.28 and flex-2.5.4 on
Linux.
*******************************************************/
-#define YY_NEVER_INTERACTIVE 1
#define YY_NO_INPUT 1
-#define YY_NO_UNPUT 1
-#define YY_NO_SCAN_BUFFER 1
-#define YY_NO_SCAN_BYTES 1
-#define YY_NO_SCAN_STRING 1
-#line 52 "pars0lex.l"
+#define YY_NO_UNISTD_H 1
+#line 56 "pars0lex.l"
#define YYSTYPE que_node_t*
#include "univ.i"
@@ -673,11 +747,25 @@ string_append(
stringbuf_len += len;
}
-#define comment 1
+
+#line 751 "lex.yy.c"
+
+#define INITIAL 0
+#define comment 1
#define quoted 2
-#line 676 "lex.yy.c"
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include <unistd.h>
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
/* Macros after this point can all be overridden by user definitions in
* section 1.
@@ -685,65 +773,28 @@ string_append(
#ifndef YY_SKIP_YYWRAP
#ifdef __cplusplus
-extern "C" int yywrap YY_PROTO(( void ));
+extern "C" int yywrap (void );
#else
-extern int yywrap YY_PROTO(( void ));
+extern int yywrap (void );
#endif
#endif
-#ifndef YY_NO_UNPUT
-static void yyunput YY_PROTO(( int c, char *buf_ptr ));
-#endif
-
#ifndef yytext_ptr
-static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
+static void yy_flex_strncpy (char *,yyconst char *,int );
#endif
#ifdef YY_NEED_STRLEN
-static int yy_flex_strlen YY_PROTO(( yyconst char * ));
+static int yy_flex_strlen (yyconst char * );
#endif
#ifndef YY_NO_INPUT
-#ifdef __cplusplus
-static int yyinput YY_PROTO(( void ));
-#else
-static int input YY_PROTO(( void ));
-#endif
-#endif
-
-#if YY_STACK_USED
-static int yy_start_stack_ptr = 0;
-static int yy_start_stack_depth = 0;
-static int *yy_start_stack = 0;
-#ifndef YY_NO_PUSH_STATE
-static void yy_push_state YY_PROTO(( int new_state ));
-#endif
-#ifndef YY_NO_POP_STATE
-static void yy_pop_state YY_PROTO(( void ));
-#endif
-#ifndef YY_NO_TOP_STATE
-static int yy_top_state YY_PROTO(( void ));
-#endif
+#ifdef __cplusplus
+static int yyinput (void );
#else
-#define YY_NO_PUSH_STATE 1
-#define YY_NO_POP_STATE 1
-#define YY_NO_TOP_STATE 1
+static int input (void );
#endif
-#ifdef YY_MALLOC_DECL
-YY_MALLOC_DECL
-#else
-#if __STDC__
-#ifndef __cplusplus
-#include <stdlib.h>
-#endif
-#else
-/* Just try to get by without declaring the routines. This will fail
- * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
- * or sizeof(void*) != sizeof(int).
- */
-#endif
#endif
/* Amount of stuff to slurp up with each read. */
@@ -752,7 +803,6 @@ YY_MALLOC_DECL
#endif
/* Copy whatever the last rule matched to the standard output. */
-
#ifndef ECHO
/* This used to be an fputs(), but since the string might contain NUL's,
* we now use fwrite().
@@ -765,9 +815,10 @@ YY_MALLOC_DECL
*/
#ifndef YY_INPUT
#define YY_INPUT(buf,result,max_size) \
- if ( yy_current_buffer->yy_is_interactive ) \
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
{ \
- int c = '*', n; \
+ int c = '*'; \
+ size_t n; \
for ( n = 0; n < max_size && \
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
buf[n] = (char) c; \
@@ -777,9 +828,22 @@ YY_MALLOC_DECL
YY_FATAL_ERROR( "input in flex scanner failed" ); \
result = n; \
} \
- else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
- && ferror( yyin ) ) \
- YY_FATAL_ERROR( "input in flex scanner failed" );
+ else \
+ { \
+ errno=0; \
+ while ( (result = fread(buf, 1, max_size, yyin))==0 && ferror(yyin)) \
+ { \
+ if( errno != EINTR) \
+ { \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ break; \
+ } \
+ errno=0; \
+ clearerr(yyin); \
+ } \
+ }\
+\
+
#endif
/* No semi-colon after return; correct usage is to write "yyterminate();" -
@@ -800,12 +864,18 @@ YY_MALLOC_DECL
#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
#endif
+/* end tables serialization structures and prototypes */
+
/* Default declaration of generated scanner - a define so the user can
* easily add parameters.
*/
#ifndef YY_DECL
-#define YY_DECL int yylex YY_PROTO(( void ))
-#endif
+#define YY_DECL_IS_OURS 1
+
+extern int yylex (void);
+
+#define YY_DECL int yylex (void)
+#endif /* !YY_DECL */
/* Code executed at the beginning of each rule, after yytext and yyleng
* have been set up.
@@ -822,27 +892,29 @@ YY_MALLOC_DECL
#define YY_RULE_SETUP \
YY_USER_ACTION
+/** The main scanner function which does all the work.
+ */
YY_DECL
- {
+{
register yy_state_type yy_current_state;
register char *yy_cp, *yy_bp;
register int yy_act;
-
-#line 102 "pars0lex.l"
+
+#line 106 "pars0lex.l"
-#line 830 "lex.yy.c"
+#line 905 "lex.yy.c"
- if ( yy_init )
+ if ( (yy_init) )
{
- yy_init = 0;
+ (yy_init) = 0;
#ifdef YY_USER_INIT
YY_USER_INIT;
#endif
- if ( ! yy_start )
- yy_start = 1; /* first start state */
+ if ( ! (yy_start) )
+ (yy_start) = 1; /* first start state */
if ( ! yyin )
yyin = stdin;
@@ -850,73 +922,69 @@ YY_DECL
if ( ! yyout )
yyout = stdout;
- if ( ! yy_current_buffer )
- yy_current_buffer =
- yy_create_buffer( yyin, YY_BUF_SIZE );
+ if ( ! YY_CURRENT_BUFFER ) {
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer(yyin,YY_BUF_SIZE );
+ }
- yy_load_buffer_state();
+ yy_load_buffer_state( );
}
while ( 1 ) /* loops until end-of-file is reached */
{
- yy_cp = yy_c_buf_p;
+ yy_cp = (yy_c_buf_p);
/* Support of yytext. */
- *yy_cp = yy_hold_char;
+ *yy_cp = (yy_hold_char);
/* yy_bp points to the position in yy_ch_buf of the start of
* the current run.
*/
yy_bp = yy_cp;
- yy_current_state = yy_start;
+ yy_current_state = (yy_start);
yy_match:
do
{
register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
if ( yy_accept[yy_current_state] )
{
- yy_last_accepting_state = yy_current_state;
- yy_last_accepting_cpos = yy_cp;
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
- if ( yy_current_state >= 367 )
+ if ( yy_current_state >= 370 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
++yy_cp;
}
- while ( yy_base[yy_current_state] != 396 );
+ while ( yy_current_state != 369 );
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
yy_find_action:
yy_act = yy_accept[yy_current_state];
- if ( yy_act == 0 )
- { /* have to back up */
- yy_cp = yy_last_accepting_cpos;
- yy_current_state = yy_last_accepting_state;
- yy_act = yy_accept[yy_current_state];
- }
YY_DO_BEFORE_ACTION;
-
do_action: /* This label is used only to access EOF actions. */
-
switch ( yy_act )
{ /* beginning of action switch */
case 0: /* must back up */
/* undo the effects of YY_DO_BEFORE_ACTION */
- *yy_cp = yy_hold_char;
- yy_cp = yy_last_accepting_cpos;
- yy_current_state = yy_last_accepting_state;
+ *yy_cp = (yy_hold_char);
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
case 1:
YY_RULE_SETUP
-#line 104 "pars0lex.l"
+#line 108 "pars0lex.l"
{
yylval = sym_tab_add_int_lit(pars_sym_tab_global,
atoi(yytext));
@@ -925,7 +993,7 @@ YY_RULE_SETUP
YY_BREAK
case 2:
YY_RULE_SETUP
-#line 110 "pars0lex.l"
+#line 114 "pars0lex.l"
{
ut_error; /* not implemented */
@@ -934,7 +1002,7 @@ YY_RULE_SETUP
YY_BREAK
case 3:
YY_RULE_SETUP
-#line 116 "pars0lex.l"
+#line 120 "pars0lex.l"
{
/* Quoted character string literals are handled in an explicit
start state 'quoted'. This state is entered and the buffer for
@@ -946,8 +1014,9 @@ In the state 'quoted', only two actions are possible (defined below). */
}
YY_BREAK
case 4:
+/* rule 4 can match eol */
YY_RULE_SETUP
-#line 125 "pars0lex.l"
+#line 129 "pars0lex.l"
{
/* Got a sequence of characters other than "'":
append to string buffer */
@@ -956,7 +1025,7 @@ YY_RULE_SETUP
YY_BREAK
case 5:
YY_RULE_SETUP
-#line 130 "pars0lex.l"
+#line 134 "pars0lex.l"
{
/* Got a sequence of "'" characters:
append half of them to string buffer,
@@ -983,7 +1052,7 @@ YY_RULE_SETUP
YY_BREAK
case 6:
YY_RULE_SETUP
-#line 154 "pars0lex.l"
+#line 158 "pars0lex.l"
{
yylval = sym_tab_add_null_lit(pars_sym_tab_global);
@@ -992,7 +1061,7 @@ YY_RULE_SETUP
YY_BREAK
case 7:
YY_RULE_SETUP
-#line 160 "pars0lex.l"
+#line 164 "pars0lex.l"
{
/* Implicit cursor name */
yylval = sym_tab_add_str_lit(pars_sym_tab_global,
@@ -1002,572 +1071,570 @@ YY_RULE_SETUP
YY_BREAK
case 8:
YY_RULE_SETUP
-#line 167 "pars0lex.l"
+#line 171 "pars0lex.l"
{
return(PARS_AND_TOKEN);
}
YY_BREAK
case 9:
YY_RULE_SETUP
-#line 171 "pars0lex.l"
+#line 175 "pars0lex.l"
{
return(PARS_OR_TOKEN);
}
YY_BREAK
case 10:
YY_RULE_SETUP
-#line 175 "pars0lex.l"
+#line 179 "pars0lex.l"
{
return(PARS_NOT_TOKEN);
}
YY_BREAK
case 11:
YY_RULE_SETUP
-#line 179 "pars0lex.l"
+#line 183 "pars0lex.l"
{
return(PARS_PROCEDURE_TOKEN);
}
YY_BREAK
case 12:
YY_RULE_SETUP
-#line 183 "pars0lex.l"
+#line 187 "pars0lex.l"
{
return(PARS_IN_TOKEN);
}
YY_BREAK
case 13:
YY_RULE_SETUP
-#line 187 "pars0lex.l"
+#line 191 "pars0lex.l"
{
return(PARS_OUT_TOKEN);
}
YY_BREAK
case 14:
YY_RULE_SETUP
-#line 191 "pars0lex.l"
+#line 195 "pars0lex.l"
{
- return(PARS_INT_TOKEN);
+ return(PARS_BINARY_TOKEN);
}
YY_BREAK
case 15:
YY_RULE_SETUP
-#line 195 "pars0lex.l"
+#line 199 "pars0lex.l"
{
- return(PARS_INT_TOKEN);
+ return(PARS_BLOB_TOKEN);
}
YY_BREAK
case 16:
YY_RULE_SETUP
-#line 199 "pars0lex.l"
+#line 203 "pars0lex.l"
{
- return(PARS_FLOAT_TOKEN);
+ return(PARS_INT_TOKEN);
}
YY_BREAK
case 17:
YY_RULE_SETUP
-#line 203 "pars0lex.l"
+#line 207 "pars0lex.l"
{
- return(PARS_CHAR_TOKEN);
+ return(PARS_INT_TOKEN);
}
YY_BREAK
case 18:
YY_RULE_SETUP
-#line 207 "pars0lex.l"
+#line 211 "pars0lex.l"
{
- return(PARS_IS_TOKEN);
+ return(PARS_FLOAT_TOKEN);
}
YY_BREAK
case 19:
YY_RULE_SETUP
-#line 211 "pars0lex.l"
+#line 215 "pars0lex.l"
{
- return(PARS_BEGIN_TOKEN);
+ return(PARS_CHAR_TOKEN);
}
YY_BREAK
case 20:
YY_RULE_SETUP
-#line 215 "pars0lex.l"
+#line 219 "pars0lex.l"
{
- return(PARS_END_TOKEN);
+ return(PARS_IS_TOKEN);
}
YY_BREAK
case 21:
YY_RULE_SETUP
-#line 219 "pars0lex.l"
+#line 223 "pars0lex.l"
{
- return(PARS_IF_TOKEN);
+ return(PARS_BEGIN_TOKEN);
}
YY_BREAK
case 22:
YY_RULE_SETUP
-#line 223 "pars0lex.l"
+#line 227 "pars0lex.l"
{
- return(PARS_THEN_TOKEN);
+ return(PARS_END_TOKEN);
}
YY_BREAK
case 23:
YY_RULE_SETUP
-#line 227 "pars0lex.l"
+#line 231 "pars0lex.l"
{
- return(PARS_ELSE_TOKEN);
+ return(PARS_IF_TOKEN);
}
YY_BREAK
case 24:
YY_RULE_SETUP
-#line 231 "pars0lex.l"
+#line 235 "pars0lex.l"
{
- return(PARS_ELSIF_TOKEN);
+ return(PARS_THEN_TOKEN);
}
YY_BREAK
case 25:
YY_RULE_SETUP
-#line 235 "pars0lex.l"
+#line 239 "pars0lex.l"
{
- return(PARS_LOOP_TOKEN);
+ return(PARS_ELSE_TOKEN);
}
YY_BREAK
case 26:
YY_RULE_SETUP
-#line 239 "pars0lex.l"
+#line 243 "pars0lex.l"
{
- return(PARS_WHILE_TOKEN);
+ return(PARS_ELSIF_TOKEN);
}
YY_BREAK
case 27:
YY_RULE_SETUP
-#line 243 "pars0lex.l"
+#line 247 "pars0lex.l"
{
- return(PARS_RETURN_TOKEN);
+ return(PARS_LOOP_TOKEN);
}
YY_BREAK
case 28:
YY_RULE_SETUP
-#line 247 "pars0lex.l"
+#line 251 "pars0lex.l"
{
- return(PARS_SELECT_TOKEN);
+ return(PARS_WHILE_TOKEN);
}
YY_BREAK
case 29:
YY_RULE_SETUP
-#line 251 "pars0lex.l"
+#line 255 "pars0lex.l"
{
- return(PARS_SUM_TOKEN);
+ return(PARS_RETURN_TOKEN);
}
YY_BREAK
case 30:
YY_RULE_SETUP
-#line 255 "pars0lex.l"
+#line 259 "pars0lex.l"
{
- return(PARS_COUNT_TOKEN);
+ return(PARS_SELECT_TOKEN);
}
YY_BREAK
case 31:
YY_RULE_SETUP
-#line 259 "pars0lex.l"
+#line 263 "pars0lex.l"
{
- return(PARS_DISTINCT_TOKEN);
+ return(PARS_SUM_TOKEN);
}
YY_BREAK
case 32:
YY_RULE_SETUP
-#line 263 "pars0lex.l"
+#line 267 "pars0lex.l"
{
- return(PARS_FROM_TOKEN);
+ return(PARS_COUNT_TOKEN);
}
YY_BREAK
case 33:
YY_RULE_SETUP
-#line 267 "pars0lex.l"
+#line 271 "pars0lex.l"
{
- return(PARS_WHERE_TOKEN);
+ return(PARS_DISTINCT_TOKEN);
}
YY_BREAK
case 34:
YY_RULE_SETUP
-#line 271 "pars0lex.l"
+#line 275 "pars0lex.l"
{
- return(PARS_FOR_TOKEN);
+ return(PARS_FROM_TOKEN);
}
YY_BREAK
case 35:
YY_RULE_SETUP
-#line 275 "pars0lex.l"
+#line 279 "pars0lex.l"
{
- return(PARS_CONSISTENT_TOKEN);
+ return(PARS_WHERE_TOKEN);
}
YY_BREAK
case 36:
YY_RULE_SETUP
-#line 279 "pars0lex.l"
+#line 283 "pars0lex.l"
{
- return(PARS_READ_TOKEN);
+ return(PARS_FOR_TOKEN);
}
YY_BREAK
case 37:
YY_RULE_SETUP
-#line 283 "pars0lex.l"
+#line 287 "pars0lex.l"
{
- return(PARS_ORDER_TOKEN);
+ return(PARS_CONSISTENT_TOKEN);
}
YY_BREAK
case 38:
YY_RULE_SETUP
-#line 287 "pars0lex.l"
+#line 291 "pars0lex.l"
{
- return(PARS_BY_TOKEN);
+ return(PARS_READ_TOKEN);
}
YY_BREAK
case 39:
YY_RULE_SETUP
-#line 291 "pars0lex.l"
+#line 295 "pars0lex.l"
{
- return(PARS_ASC_TOKEN);
+ return(PARS_ORDER_TOKEN);
}
YY_BREAK
case 40:
YY_RULE_SETUP
-#line 295 "pars0lex.l"
+#line 299 "pars0lex.l"
{
- return(PARS_DESC_TOKEN);
+ return(PARS_BY_TOKEN);
}
YY_BREAK
case 41:
YY_RULE_SETUP
-#line 299 "pars0lex.l"
+#line 303 "pars0lex.l"
{
- return(PARS_INSERT_TOKEN);
+ return(PARS_ASC_TOKEN);
}
YY_BREAK
case 42:
YY_RULE_SETUP
-#line 303 "pars0lex.l"
+#line 307 "pars0lex.l"
{
- return(PARS_INTO_TOKEN);
+ return(PARS_DESC_TOKEN);
}
YY_BREAK
case 43:
YY_RULE_SETUP
-#line 307 "pars0lex.l"
+#line 311 "pars0lex.l"
{
- return(PARS_VALUES_TOKEN);
+ return(PARS_INSERT_TOKEN);
}
YY_BREAK
case 44:
YY_RULE_SETUP
-#line 311 "pars0lex.l"
+#line 315 "pars0lex.l"
{
- return(PARS_UPDATE_TOKEN);
+ return(PARS_INTO_TOKEN);
}
YY_BREAK
case 45:
YY_RULE_SETUP
-#line 315 "pars0lex.l"
+#line 319 "pars0lex.l"
{
- return(PARS_SET_TOKEN);
+ return(PARS_VALUES_TOKEN);
}
YY_BREAK
case 46:
YY_RULE_SETUP
-#line 319 "pars0lex.l"
+#line 323 "pars0lex.l"
{
- return(PARS_DELETE_TOKEN);
+ return(PARS_UPDATE_TOKEN);
}
YY_BREAK
case 47:
YY_RULE_SETUP
-#line 323 "pars0lex.l"
+#line 327 "pars0lex.l"
{
- return(PARS_CURRENT_TOKEN);
+ return(PARS_SET_TOKEN);
}
YY_BREAK
case 48:
YY_RULE_SETUP
-#line 327 "pars0lex.l"
+#line 331 "pars0lex.l"
{
- return(PARS_OF_TOKEN);
+ return(PARS_DELETE_TOKEN);
}
YY_BREAK
case 49:
YY_RULE_SETUP
-#line 331 "pars0lex.l"
+#line 335 "pars0lex.l"
{
- return(PARS_CREATE_TOKEN);
+ return(PARS_CURRENT_TOKEN);
}
YY_BREAK
case 50:
YY_RULE_SETUP
-#line 335 "pars0lex.l"
+#line 339 "pars0lex.l"
{
- return(PARS_TABLE_TOKEN);
+ return(PARS_OF_TOKEN);
}
YY_BREAK
case 51:
YY_RULE_SETUP
-#line 339 "pars0lex.l"
+#line 343 "pars0lex.l"
{
- return(PARS_INDEX_TOKEN);
+ return(PARS_CREATE_TOKEN);
}
YY_BREAK
case 52:
YY_RULE_SETUP
-#line 343 "pars0lex.l"
+#line 347 "pars0lex.l"
{
- return(PARS_UNIQUE_TOKEN);
+ return(PARS_TABLE_TOKEN);
}
YY_BREAK
case 53:
YY_RULE_SETUP
-#line 347 "pars0lex.l"
+#line 351 "pars0lex.l"
{
- return(PARS_CLUSTERED_TOKEN);
+ return(PARS_INDEX_TOKEN);
}
YY_BREAK
case 54:
YY_RULE_SETUP
-#line 351 "pars0lex.l"
+#line 355 "pars0lex.l"
{
- return(PARS_DOES_NOT_FIT_IN_MEM_TOKEN);
+ return(PARS_UNIQUE_TOKEN);
}
YY_BREAK
case 55:
YY_RULE_SETUP
-#line 355 "pars0lex.l"
+#line 359 "pars0lex.l"
{
- return(PARS_ON_TOKEN);
+ return(PARS_CLUSTERED_TOKEN);
}
YY_BREAK
case 56:
YY_RULE_SETUP
-#line 359 "pars0lex.l"
+#line 363 "pars0lex.l"
{
- return(PARS_DECLARE_TOKEN);
+ return(PARS_DOES_NOT_FIT_IN_MEM_TOKEN);
}
YY_BREAK
case 57:
YY_RULE_SETUP
-#line 363 "pars0lex.l"
+#line 367 "pars0lex.l"
{
- return(PARS_CURSOR_TOKEN);
+ return(PARS_ON_TOKEN);
}
YY_BREAK
case 58:
YY_RULE_SETUP
-#line 367 "pars0lex.l"
+#line 371 "pars0lex.l"
{
- return(PARS_OPEN_TOKEN);
+ return(PARS_DECLARE_TOKEN);
}
YY_BREAK
case 59:
YY_RULE_SETUP
-#line 371 "pars0lex.l"
+#line 375 "pars0lex.l"
{
- return(PARS_FETCH_TOKEN);
+ return(PARS_CURSOR_TOKEN);
}
YY_BREAK
case 60:
YY_RULE_SETUP
-#line 375 "pars0lex.l"
+#line 379 "pars0lex.l"
{
- return(PARS_CLOSE_TOKEN);
+ return(PARS_OPEN_TOKEN);
}
YY_BREAK
case 61:
YY_RULE_SETUP
-#line 379 "pars0lex.l"
+#line 383 "pars0lex.l"
{
- return(PARS_NOTFOUND_TOKEN);
+ return(PARS_FETCH_TOKEN);
}
YY_BREAK
case 62:
YY_RULE_SETUP
-#line 383 "pars0lex.l"
+#line 387 "pars0lex.l"
{
- return(PARS_TO_CHAR_TOKEN);
+ return(PARS_CLOSE_TOKEN);
}
YY_BREAK
case 63:
YY_RULE_SETUP
-#line 387 "pars0lex.l"
+#line 391 "pars0lex.l"
{
- return(PARS_TO_NUMBER_TOKEN);
+ return(PARS_NOTFOUND_TOKEN);
}
YY_BREAK
case 64:
YY_RULE_SETUP
-#line 391 "pars0lex.l"
+#line 395 "pars0lex.l"
{
- return(PARS_TO_BINARY_TOKEN);
+ return(PARS_TO_CHAR_TOKEN);
}
YY_BREAK
case 65:
YY_RULE_SETUP
-#line 395 "pars0lex.l"
+#line 399 "pars0lex.l"
{
- return(PARS_BINARY_TO_NUMBER_TOKEN);
+ return(PARS_TO_NUMBER_TOKEN);
}
YY_BREAK
case 66:
YY_RULE_SETUP
-#line 399 "pars0lex.l"
+#line 403 "pars0lex.l"
{
- return(PARS_SUBSTR_TOKEN);
+ return(PARS_TO_BINARY_TOKEN);
}
YY_BREAK
case 67:
YY_RULE_SETUP
-#line 403 "pars0lex.l"
+#line 407 "pars0lex.l"
{
- return(PARS_REPLSTR_TOKEN);
+ return(PARS_BINARY_TO_NUMBER_TOKEN);
}
YY_BREAK
case 68:
YY_RULE_SETUP
-#line 407 "pars0lex.l"
+#line 411 "pars0lex.l"
{
- return(PARS_CONCAT_TOKEN);
+ return(PARS_SUBSTR_TOKEN);
}
YY_BREAK
case 69:
YY_RULE_SETUP
-#line 411 "pars0lex.l"
+#line 415 "pars0lex.l"
{
- return(PARS_INSTR_TOKEN);
+ return(PARS_REPLSTR_TOKEN);
}
YY_BREAK
case 70:
YY_RULE_SETUP
-#line 415 "pars0lex.l"
+#line 419 "pars0lex.l"
{
- return(PARS_LENGTH_TOKEN);
+ return(PARS_CONCAT_TOKEN);
}
YY_BREAK
case 71:
YY_RULE_SETUP
-#line 419 "pars0lex.l"
+#line 423 "pars0lex.l"
{
- return(PARS_SYSDATE_TOKEN);
+ return(PARS_INSTR_TOKEN);
}
YY_BREAK
case 72:
YY_RULE_SETUP
-#line 423 "pars0lex.l"
+#line 427 "pars0lex.l"
{
- return(PARS_PRINTF_TOKEN);
+ return(PARS_LENGTH_TOKEN);
}
YY_BREAK
case 73:
YY_RULE_SETUP
-#line 427 "pars0lex.l"
+#line 431 "pars0lex.l"
{
- return(PARS_ASSERT_TOKEN);
+ return(PARS_SYSDATE_TOKEN);
}
YY_BREAK
case 74:
YY_RULE_SETUP
-#line 431 "pars0lex.l"
+#line 435 "pars0lex.l"
{
- return(PARS_RND_TOKEN);
+ return(PARS_PRINTF_TOKEN);
}
YY_BREAK
case 75:
YY_RULE_SETUP
-#line 435 "pars0lex.l"
+#line 439 "pars0lex.l"
{
- return(PARS_RND_STR_TOKEN);
+ return(PARS_ASSERT_TOKEN);
}
YY_BREAK
case 76:
YY_RULE_SETUP
-#line 439 "pars0lex.l"
+#line 443 "pars0lex.l"
{
- return(PARS_ROW_PRINTF_TOKEN);
+ return(PARS_RND_TOKEN);
}
YY_BREAK
case 77:
YY_RULE_SETUP
-#line 443 "pars0lex.l"
+#line 447 "pars0lex.l"
{
- return(PARS_COMMIT_TOKEN);
+ return(PARS_RND_STR_TOKEN);
}
YY_BREAK
case 78:
YY_RULE_SETUP
-#line 447 "pars0lex.l"
+#line 451 "pars0lex.l"
{
- return(PARS_ROLLBACK_TOKEN);
+ return(PARS_ROW_PRINTF_TOKEN);
}
YY_BREAK
case 79:
YY_RULE_SETUP
-#line 451 "pars0lex.l"
+#line 455 "pars0lex.l"
{
- return(PARS_WORK_TOKEN);
+ return(PARS_COMMIT_TOKEN);
}
YY_BREAK
case 80:
YY_RULE_SETUP
-#line 455 "pars0lex.l"
+#line 459 "pars0lex.l"
{
- yylval = sym_tab_add_id(pars_sym_tab_global,
- (byte*)yytext,
- ut_strlen(yytext));
- return(PARS_ID_TOKEN);
+ return(PARS_ROLLBACK_TOKEN);
}
YY_BREAK
case 81:
YY_RULE_SETUP
-#line 462 "pars0lex.l"
+#line 463 "pars0lex.l"
{
- return(PARS_DDOT_TOKEN);
+ return(PARS_WORK_TOKEN);
}
YY_BREAK
case 82:
YY_RULE_SETUP
-#line 466 "pars0lex.l"
+#line 467 "pars0lex.l"
{
- return(PARS_ASSIGN_TOKEN);
+ yylval = sym_tab_add_id(pars_sym_tab_global,
+ (byte*)yytext,
+ ut_strlen(yytext));
+ return(PARS_ID_TOKEN);
}
YY_BREAK
case 83:
YY_RULE_SETUP
-#line 470 "pars0lex.l"
+#line 474 "pars0lex.l"
{
- return(PARS_LE_TOKEN);
+ return(PARS_DDOT_TOKEN);
}
YY_BREAK
case 84:
YY_RULE_SETUP
-#line 474 "pars0lex.l"
+#line 478 "pars0lex.l"
{
- return(PARS_GE_TOKEN);
+ return(PARS_ASSIGN_TOKEN);
}
YY_BREAK
case 85:
YY_RULE_SETUP
-#line 478 "pars0lex.l"
+#line 482 "pars0lex.l"
{
- return(PARS_NE_TOKEN);
+ return(PARS_LE_TOKEN);
}
YY_BREAK
case 86:
YY_RULE_SETUP
-#line 482 "pars0lex.l"
+#line 486 "pars0lex.l"
{
-
- return((int)(*yytext));
+ return(PARS_GE_TOKEN);
}
YY_BREAK
case 87:
YY_RULE_SETUP
-#line 487 "pars0lex.l"
+#line 490 "pars0lex.l"
{
-
- return((int)(*yytext));
+ return(PARS_NE_TOKEN);
}
YY_BREAK
case 88:
YY_RULE_SETUP
-#line 492 "pars0lex.l"
+#line 494 "pars0lex.l"
{
return((int)(*yytext));
@@ -1575,7 +1642,7 @@ YY_RULE_SETUP
YY_BREAK
case 89:
YY_RULE_SETUP
-#line 497 "pars0lex.l"
+#line 499 "pars0lex.l"
{
return((int)(*yytext));
@@ -1583,7 +1650,7 @@ YY_RULE_SETUP
YY_BREAK
case 90:
YY_RULE_SETUP
-#line 502 "pars0lex.l"
+#line 504 "pars0lex.l"
{
return((int)(*yytext));
@@ -1591,7 +1658,7 @@ YY_RULE_SETUP
YY_BREAK
case 91:
YY_RULE_SETUP
-#line 507 "pars0lex.l"
+#line 509 "pars0lex.l"
{
return((int)(*yytext));
@@ -1599,7 +1666,7 @@ YY_RULE_SETUP
YY_BREAK
case 92:
YY_RULE_SETUP
-#line 512 "pars0lex.l"
+#line 514 "pars0lex.l"
{
return((int)(*yytext));
@@ -1607,7 +1674,7 @@ YY_RULE_SETUP
YY_BREAK
case 93:
YY_RULE_SETUP
-#line 517 "pars0lex.l"
+#line 519 "pars0lex.l"
{
return((int)(*yytext));
@@ -1615,7 +1682,7 @@ YY_RULE_SETUP
YY_BREAK
case 94:
YY_RULE_SETUP
-#line 522 "pars0lex.l"
+#line 524 "pars0lex.l"
{
return((int)(*yytext));
@@ -1623,7 +1690,7 @@ YY_RULE_SETUP
YY_BREAK
case 95:
YY_RULE_SETUP
-#line 527 "pars0lex.l"
+#line 529 "pars0lex.l"
{
return((int)(*yytext));
@@ -1631,7 +1698,7 @@ YY_RULE_SETUP
YY_BREAK
case 96:
YY_RULE_SETUP
-#line 532 "pars0lex.l"
+#line 534 "pars0lex.l"
{
return((int)(*yytext));
@@ -1639,7 +1706,7 @@ YY_RULE_SETUP
YY_BREAK
case 97:
YY_RULE_SETUP
-#line 537 "pars0lex.l"
+#line 539 "pars0lex.l"
{
return((int)(*yytext));
@@ -1647,7 +1714,7 @@ YY_RULE_SETUP
YY_BREAK
case 98:
YY_RULE_SETUP
-#line 542 "pars0lex.l"
+#line 544 "pars0lex.l"
{
return((int)(*yytext));
@@ -1655,7 +1722,7 @@ YY_RULE_SETUP
YY_BREAK
case 99:
YY_RULE_SETUP
-#line 547 "pars0lex.l"
+#line 549 "pars0lex.l"
{
return((int)(*yytext));
@@ -1663,7 +1730,7 @@ YY_RULE_SETUP
YY_BREAK
case 100:
YY_RULE_SETUP
-#line 552 "pars0lex.l"
+#line 554 "pars0lex.l"
{
return((int)(*yytext));
@@ -1671,32 +1738,51 @@ YY_RULE_SETUP
YY_BREAK
case 101:
YY_RULE_SETUP
-#line 557 "pars0lex.l"
-BEGIN(comment); /* eat up comment */
+#line 559 "pars0lex.l"
+{
+
+ return((int)(*yytext));
+}
YY_BREAK
case 102:
YY_RULE_SETUP
-#line 559 "pars0lex.l"
+#line 564 "pars0lex.l"
+{
+ return((int)(*yytext));
+}
YY_BREAK
case 103:
YY_RULE_SETUP
-#line 560 "pars0lex.l"
-
+#line 569 "pars0lex.l"
+BEGIN(comment); /* eat up comment */
YY_BREAK
case 104:
+/* rule 104 can match eol */
YY_RULE_SETUP
-#line 561 "pars0lex.l"
-BEGIN(INITIAL);
+#line 571 "pars0lex.l"
+
YY_BREAK
case 105:
+/* rule 105 can match eol */
YY_RULE_SETUP
-#line 563 "pars0lex.l"
-/* eat up whitespace */
+#line 572 "pars0lex.l"
+
YY_BREAK
case 106:
YY_RULE_SETUP
-#line 566 "pars0lex.l"
+#line 573 "pars0lex.l"
+BEGIN(INITIAL);
+ YY_BREAK
+case 107:
+/* rule 107 can match eol */
+YY_RULE_SETUP
+#line 575 "pars0lex.l"
+/* eat up whitespace */
+ YY_BREAK
+case 108:
+YY_RULE_SETUP
+#line 578 "pars0lex.l"
{
fprintf(stderr,"Unrecognized character: %02x\n",
*yytext);
@@ -1706,12 +1792,12 @@ YY_RULE_SETUP
return(0);
}
YY_BREAK
-case 107:
+case 109:
YY_RULE_SETUP
-#line 575 "pars0lex.l"
+#line 587 "pars0lex.l"
YY_FATAL_ERROR( "flex scanner jammed" );
YY_BREAK
-#line 1710 "lex.yy.c"
+#line 1799 "lex.yy.c"
case YY_STATE_EOF(INITIAL):
case YY_STATE_EOF(comment):
case YY_STATE_EOF(quoted):
@@ -1720,26 +1806,26 @@ case YY_STATE_EOF(quoted):
case YY_END_OF_BUFFER:
{
/* Amount of text matched not including the EOB char. */
- int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
+ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
/* Undo the effects of YY_DO_BEFORE_ACTION. */
- *yy_cp = yy_hold_char;
+ *yy_cp = (yy_hold_char);
YY_RESTORE_YY_MORE_OFFSET
- if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
{
/* We're scanning a new file or input source. It's
* possible that this happened because the user
* just pointed yyin at a new source and called
* yylex(). If so, then we have to assure
- * consistency between yy_current_buffer and our
+ * consistency between YY_CURRENT_BUFFER and our
* globals. Here is the right place to do so, because
* this is the first action (other than possibly a
* back-up) that will match for the new input source.
*/
- yy_n_chars = yy_current_buffer->yy_n_chars;
- yy_current_buffer->yy_input_file = yyin;
- yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
}
/* Note that here we test for yy_c_buf_p "<=" to the position
@@ -1749,13 +1835,13 @@ case YY_STATE_EOF(quoted):
* end-of-buffer state). Contrast this with the test
* in input().
*/
- if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
+ if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
{ /* This was really a NUL. */
yy_state_type yy_next_state;
- yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
+ (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
- yy_current_state = yy_get_previous_state();
+ yy_current_state = yy_get_previous_state( );
/* Okay, we're now positioned to make the NUL
* transition. We couldn't have
@@ -1768,30 +1854,31 @@ case YY_STATE_EOF(quoted):
yy_next_state = yy_try_NUL_trans( yy_current_state );
- yy_bp = yytext_ptr + YY_MORE_ADJ;
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
if ( yy_next_state )
{
/* Consume the NUL. */
- yy_cp = ++yy_c_buf_p;
+ yy_cp = ++(yy_c_buf_p);
yy_current_state = yy_next_state;
goto yy_match;
}
else
{
- yy_cp = yy_c_buf_p;
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
goto yy_find_action;
}
}
- else switch ( yy_get_next_buffer() )
+ else switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_END_OF_FILE:
{
- yy_did_buffer_switch_on_eof = 0;
+ (yy_did_buffer_switch_on_eof) = 0;
- if ( yywrap() )
+ if ( yywrap( ) )
{
/* Note: because we've taken care in
* yy_get_next_buffer() to have set up
@@ -1802,7 +1889,7 @@ case YY_STATE_EOF(quoted):
* YY_NULL, it'll still work - another
* YY_NULL will get returned.
*/
- yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
+ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
yy_act = YY_STATE_EOF(YY_START);
goto do_action;
@@ -1810,30 +1897,30 @@ case YY_STATE_EOF(quoted):
else
{
- if ( ! yy_did_buffer_switch_on_eof )
+ if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
}
break;
}
case EOB_ACT_CONTINUE_SCAN:
- yy_c_buf_p =
- yytext_ptr + yy_amount_of_matched_text;
+ (yy_c_buf_p) =
+ (yytext_ptr) + yy_amount_of_matched_text;
- yy_current_state = yy_get_previous_state();
+ yy_current_state = yy_get_previous_state( );
- yy_cp = yy_c_buf_p;
- yy_bp = yytext_ptr + YY_MORE_ADJ;
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_match;
case EOB_ACT_LAST_MATCH:
- yy_c_buf_p =
- &yy_current_buffer->yy_ch_buf[yy_n_chars];
+ (yy_c_buf_p) =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
- yy_current_state = yy_get_previous_state();
+ yy_current_state = yy_get_previous_state( );
- yy_cp = yy_c_buf_p;
- yy_bp = yytext_ptr + YY_MORE_ADJ;
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
goto yy_find_action;
}
break;
@@ -1844,8 +1931,7 @@ case YY_STATE_EOF(quoted):
"fatal flex scanner internal error--no action found" );
} /* end of action switch */
} /* end of scanning one token */
- } /* end of yylex */
-
+} /* end of yylex */
/* yy_get_next_buffer - try to read in a new buffer
*
@@ -1854,21 +1940,20 @@ case YY_STATE_EOF(quoted):
* EOB_ACT_CONTINUE_SCAN - continue scanning from current position
* EOB_ACT_END_OF_FILE - end of file
*/
-
-static int yy_get_next_buffer()
- {
- register char *dest = yy_current_buffer->yy_ch_buf;
- register char *source = yytext_ptr;
+static int yy_get_next_buffer (void)
+{
+ register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+ register char *source = (yytext_ptr);
register int number_to_move, i;
int ret_val;
- if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
+ if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
YY_FATAL_ERROR(
"fatal flex scanner internal error--end of buffer missed" );
- if ( yy_current_buffer->yy_fill_buffer == 0 )
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
{ /* Don't try to fill the buffer, so this is an EOF. */
- if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
+ if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
{
/* We matched a single character, the EOB, so
* treat this as a final EOF.
@@ -1888,34 +1973,30 @@ static int yy_get_next_buffer()
/* Try to read more data. */
/* First move last chars to start of buffer. */
- number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
+ number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
for ( i = 0; i < number_to_move; ++i )
*(dest++) = *(source++);
- if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
/* don't do the read, it's not guaranteed to return an EOF,
* just force an EOF
*/
- yy_current_buffer->yy_n_chars = yy_n_chars = 0;
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
else
{
- int num_to_read =
- yy_current_buffer->yy_buf_size - number_to_move - 1;
+ size_t num_to_read =
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
while ( num_to_read <= 0 )
{ /* Not enough room in the buffer - grow it. */
-#ifdef YY_USES_REJECT
- YY_FATAL_ERROR(
-"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
-#else
/* just a shorter name for the current buffer */
- YY_BUFFER_STATE b = yy_current_buffer;
+ YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
int yy_c_buf_p_offset =
- (int) (yy_c_buf_p - b->yy_ch_buf);
+ (int) ((yy_c_buf_p) - b->yy_ch_buf);
if ( b->yy_is_our_buffer )
{
@@ -1928,8 +2009,7 @@ static int yy_get_next_buffer()
b->yy_ch_buf = (char *)
/* Include room in for 2 EOB chars. */
- yy_flex_realloc( (void *) b->yy_ch_buf,
- b->yy_buf_size + 2 );
+ yyrealloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
}
else
/* Can't grow it, we don't own it. */
@@ -1939,35 +2019,35 @@ static int yy_get_next_buffer()
YY_FATAL_ERROR(
"fatal error - scanner input buffer overflow" );
- yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+ (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
- num_to_read = yy_current_buffer->yy_buf_size -
+ num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
number_to_move - 1;
-#endif
+
}
if ( num_to_read > YY_READ_BUF_SIZE )
num_to_read = YY_READ_BUF_SIZE;
/* Read in more data. */
- YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
- yy_n_chars, num_to_read );
+ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+ (yy_n_chars), num_to_read );
- yy_current_buffer->yy_n_chars = yy_n_chars;
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
- if ( yy_n_chars == 0 )
+ if ( (yy_n_chars) == 0 )
{
if ( number_to_move == YY_MORE_ADJ )
{
ret_val = EOB_ACT_END_OF_FILE;
- yyrestart( yyin );
+ yyrestart(yyin );
}
else
{
ret_val = EOB_ACT_LAST_MATCH;
- yy_current_buffer->yy_buffer_status =
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
YY_BUFFER_EOF_PENDING;
}
}
@@ -1975,152 +2055,100 @@ static int yy_get_next_buffer()
else
ret_val = EOB_ACT_CONTINUE_SCAN;
- yy_n_chars += number_to_move;
- yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
- yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+ (yy_n_chars) += number_to_move;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
- yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
+ (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
return ret_val;
- }
-
+}
/* yy_get_previous_state - get the state just before the EOB char was reached */
-static yy_state_type yy_get_previous_state()
- {
+ static yy_state_type yy_get_previous_state (void)
+{
register yy_state_type yy_current_state;
register char *yy_cp;
+
+ yy_current_state = (yy_start);
- yy_current_state = yy_start;
-
- for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
+ for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
{
register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
if ( yy_accept[yy_current_state] )
{
- yy_last_accepting_state = yy_current_state;
- yy_last_accepting_cpos = yy_cp;
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
- if ( yy_current_state >= 367 )
+ if ( yy_current_state >= 370 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
}
return yy_current_state;
- }
-
+}
/* yy_try_NUL_trans - try to make a transition on the NUL character
*
* synopsis
* next_state = yy_try_NUL_trans( current_state );
*/
-
-#ifdef YY_USE_PROTOS
-static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
-#else
-static yy_state_type yy_try_NUL_trans( yy_current_state )
-yy_state_type yy_current_state;
-#endif
- {
+ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
+{
register int yy_is_jam;
- register char *yy_cp = yy_c_buf_p;
+ register char *yy_cp = (yy_c_buf_p);
register YY_CHAR yy_c = 1;
if ( yy_accept[yy_current_state] )
{
- yy_last_accepting_state = yy_current_state;
- yy_last_accepting_cpos = yy_cp;
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
}
while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
{
yy_current_state = (int) yy_def[yy_current_state];
- if ( yy_current_state >= 367 )
+ if ( yy_current_state >= 370 )
yy_c = yy_meta[(unsigned int) yy_c];
}
yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
- yy_is_jam = (yy_current_state == 366);
+ yy_is_jam = (yy_current_state == 369);
return yy_is_jam ? 0 : yy_current_state;
- }
-
-
-#ifndef YY_NO_UNPUT
-#ifdef YY_USE_PROTOS
-static void yyunput( int c, register char *yy_bp )
-#else
-static void yyunput( c, yy_bp )
-int c;
-register char *yy_bp;
-#endif
- {
- register char *yy_cp = yy_c_buf_p;
-
- /* undo effects of setting up yytext */
- *yy_cp = yy_hold_char;
-
- if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
- { /* need to shift things up to make room */
- /* +2 for EOB chars. */
- register int number_to_move = yy_n_chars + 2;
- register char *dest = &yy_current_buffer->yy_ch_buf[
- yy_current_buffer->yy_buf_size + 2];
- register char *source =
- &yy_current_buffer->yy_ch_buf[number_to_move];
-
- while ( source > yy_current_buffer->yy_ch_buf )
- *--dest = *--source;
-
- yy_cp += (int) (dest - source);
- yy_bp += (int) (dest - source);
- yy_current_buffer->yy_n_chars =
- yy_n_chars = yy_current_buffer->yy_buf_size;
-
- if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
- YY_FATAL_ERROR( "flex scanner push-back overflow" );
- }
-
- *--yy_cp = (char) c;
-
-
- yytext_ptr = yy_bp;
- yy_hold_char = *yy_cp;
- yy_c_buf_p = yy_cp;
- }
-#endif /* ifndef YY_NO_UNPUT */
-
+}
+#ifndef YY_NO_INPUT
#ifdef __cplusplus
-static int yyinput()
+ static int yyinput (void)
#else
-static int input()
+ static int input (void)
#endif
- {
- int c;
- *yy_c_buf_p = yy_hold_char;
+{
+ int c;
+
+ *(yy_c_buf_p) = (yy_hold_char);
- if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+ if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
{
/* yy_c_buf_p now points to the character we want to return.
* If this occurs *before* the EOB characters, then it's a
* valid NUL; if not, then we've hit the end of the buffer.
*/
- if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
+ if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
/* This was really a NUL. */
- *yy_c_buf_p = '\0';
+ *(yy_c_buf_p) = '\0';
else
{ /* need more input */
- int offset = (int) (yy_c_buf_p - yytext_ptr);
- ++yy_c_buf_p;
+ int offset = (int)(yy_c_buf_p - yytext_ptr);
+ ++(yy_c_buf_p);
- switch ( yy_get_next_buffer() )
+ switch ( yy_get_next_buffer( ) )
{
case EOB_ACT_LAST_MATCH:
/* This happens because yy_g_n_b()
@@ -2134,16 +2162,16 @@ static int input()
*/
/* Reset buffer status. */
- yyrestart( yyin );
+ yyrestart(yyin );
- /* fall through */
+ /*FALLTHROUGH*/
case EOB_ACT_END_OF_FILE:
{
- if ( yywrap() )
+ if ( yywrap( ) )
return EOF;
- if ( ! yy_did_buffer_switch_on_eof )
+ if ( ! (yy_did_buffer_switch_on_eof) )
YY_NEW_FILE;
#ifdef __cplusplus
return yyinput();
@@ -2153,90 +2181,92 @@ static int input()
}
case EOB_ACT_CONTINUE_SCAN:
- yy_c_buf_p = yytext_ptr + offset;
+ (yy_c_buf_p) = (yytext_ptr) + offset;
break;
}
}
}
- c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */
- *yy_c_buf_p = '\0'; /* preserve yytext */
- yy_hold_char = *++yy_c_buf_p;
-
+ c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
+ *(yy_c_buf_p) = '\0'; /* preserve yytext */
+ (yy_hold_char) = *++(yy_c_buf_p);
return c;
- }
-
-
-#ifdef YY_USE_PROTOS
-void yyrestart( FILE *input_file )
-#else
-void yyrestart( input_file )
-FILE *input_file;
-#endif
- {
- if ( ! yy_current_buffer )
- yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
+}
+#endif /* ifndef YY_NO_INPUT */
- yy_init_buffer( yy_current_buffer, input_file );
- yy_load_buffer_state();
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ *
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+ void yyrestart (FILE * input_file )
+{
+
+ if ( ! YY_CURRENT_BUFFER ){
+ yyensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ yy_create_buffer(yyin,YY_BUF_SIZE );
}
+ yy_init_buffer(YY_CURRENT_BUFFER,input_file );
+ yy_load_buffer_state( );
+}
-#ifdef YY_USE_PROTOS
-void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
-#else
-void yy_switch_to_buffer( new_buffer )
-YY_BUFFER_STATE new_buffer;
-#endif
- {
- if ( yy_current_buffer == new_buffer )
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ *
+ */
+ void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer )
+{
+
+ /* TODO. We should be able to replace this entire function body
+ * with
+ * yypop_buffer_state();
+ * yypush_buffer_state(new_buffer);
+ */
+ yyensure_buffer_stack ();
+ if ( YY_CURRENT_BUFFER == new_buffer )
return;
- if ( yy_current_buffer )
+ if ( YY_CURRENT_BUFFER )
{
/* Flush out information for old buffer. */
- *yy_c_buf_p = yy_hold_char;
- yy_current_buffer->yy_buf_pos = yy_c_buf_p;
- yy_current_buffer->yy_n_chars = yy_n_chars;
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
}
- yy_current_buffer = new_buffer;
- yy_load_buffer_state();
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+ yy_load_buffer_state( );
/* We don't actually know whether we did this switch during
* EOF (yywrap()) processing, but the only time this flag
* is looked at is after yywrap() is called, so it's safe
* to go ahead and always set it.
*/
- yy_did_buffer_switch_on_eof = 1;
- }
-
-
-#ifdef YY_USE_PROTOS
-void yy_load_buffer_state( void )
-#else
-void yy_load_buffer_state()
-#endif
- {
- yy_n_chars = yy_current_buffer->yy_n_chars;
- yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
- yyin = yy_current_buffer->yy_input_file;
- yy_hold_char = *yy_c_buf_p;
- }
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+static void yy_load_buffer_state (void)
+{
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+ yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+ (yy_hold_char) = *(yy_c_buf_p);
+}
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
-#else
-YY_BUFFER_STATE yy_create_buffer( file, size )
-FILE *file;
-int size;
-#endif
- {
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ *
+ * @return the allocated buffer state.
+ */
+ YY_BUFFER_STATE yy_create_buffer (FILE * file, int size )
+{
YY_BUFFER_STATE b;
-
- b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
+
+ b = (YY_BUFFER_STATE) yyalloc(sizeof( struct yy_buffer_state ) );
if ( ! b )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
@@ -2245,80 +2275,71 @@ int size;
/* yy_ch_buf has to be 2 characters longer than the size given because
* we need to put in 2 end-of-buffer characters.
*/
- b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
+ b->yy_ch_buf = (char *) yyalloc(b->yy_buf_size + 2 );
if ( ! b->yy_ch_buf )
YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
b->yy_is_our_buffer = 1;
- yy_init_buffer( b, file );
+ yy_init_buffer(b,file );
return b;
- }
-
+}
-#ifdef YY_USE_PROTOS
-void yy_delete_buffer( YY_BUFFER_STATE b )
-#else
-void yy_delete_buffer( b )
-YY_BUFFER_STATE b;
-#endif
- {
+/** Destroy the buffer.
+ * @param b a buffer created with yy_create_buffer()
+ *
+ */
+ void yy_delete_buffer (YY_BUFFER_STATE b )
+{
+
if ( ! b )
return;
- if ( b == yy_current_buffer )
- yy_current_buffer = (YY_BUFFER_STATE) 0;
+ if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
if ( b->yy_is_our_buffer )
- yy_flex_free( (void *) b->yy_ch_buf );
-
- yy_flex_free( (void *) b );
- }
-
-
-#ifndef YY_ALWAYS_INTERACTIVE
-#ifndef YY_NEVER_INTERACTIVE
-extern int isatty YY_PROTO(( int ));
-#endif
-#endif
+ yyfree((void *) b->yy_ch_buf );
-#ifdef YY_USE_PROTOS
-void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
-#else
-void yy_init_buffer( b, file )
-YY_BUFFER_STATE b;
-FILE *file;
-#endif
+ yyfree((void *) b );
+}
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a yyrestart() or at EOF.
+ */
+ static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file )
- {
- yy_flush_buffer( b );
+{
+ int oerrno = errno;
+
+ yy_flush_buffer(b );
b->yy_input_file = file;
b->yy_fill_buffer = 1;
-#if YY_ALWAYS_INTERACTIVE
- b->yy_is_interactive = 1;
-#else
-#if YY_NEVER_INTERACTIVE
- b->yy_is_interactive = 0;
-#else
- b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
-#endif
-#endif
- }
+ /* If b is the current buffer, then yy_init_buffer was _probably_
+ * called from yyrestart() or through yy_get_next_buffer.
+ * In that case, we don't want to reset the lineno or column.
+ */
+ if (b != YY_CURRENT_BUFFER){
+ b->yy_bs_lineno = 1;
+ b->yy_bs_column = 0;
+ }
+ b->yy_is_interactive = 0;
+
+ errno = oerrno;
+}
-#ifdef YY_USE_PROTOS
-void yy_flush_buffer( YY_BUFFER_STATE b )
-#else
-void yy_flush_buffer( b )
-YY_BUFFER_STATE b;
-#endif
-
- {
- if ( ! b )
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ *
+ */
+ void yy_flush_buffer (YY_BUFFER_STATE b )
+{
+ if ( ! b )
return;
b->yy_n_chars = 0;
@@ -2335,243 +2356,260 @@ YY_BUFFER_STATE b;
b->yy_at_bol = 1;
b->yy_buffer_status = YY_BUFFER_NEW;
- if ( b == yy_current_buffer )
- yy_load_buffer_state();
- }
-
+ if ( b == YY_CURRENT_BUFFER )
+ yy_load_buffer_state( );
+}
-#ifndef YY_NO_SCAN_BUFFER
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
-#else
-YY_BUFFER_STATE yy_scan_buffer( base, size )
-char *base;
-yy_size_t size;
-#endif
- {
- YY_BUFFER_STATE b;
+/** Pushes the new state onto the stack. The new state becomes
+ * the current state. This function will allocate the stack
+ * if necessary.
+ * @param new_buffer The new state.
+ *
+ */
+void yypush_buffer_state (YY_BUFFER_STATE new_buffer )
+{
+ if (new_buffer == NULL)
+ return;
- if ( size < 2 ||
- base[size-2] != YY_END_OF_BUFFER_CHAR ||
- base[size-1] != YY_END_OF_BUFFER_CHAR )
- /* They forgot to leave room for the EOB's. */
- return 0;
+ yyensure_buffer_stack();
- b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
- if ( ! b )
- YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
-
- b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
- b->yy_buf_pos = b->yy_ch_buf = base;
- b->yy_is_our_buffer = 0;
- b->yy_input_file = 0;
- b->yy_n_chars = b->yy_buf_size;
- b->yy_is_interactive = 0;
- b->yy_at_bol = 1;
- b->yy_fill_buffer = 0;
- b->yy_buffer_status = YY_BUFFER_NEW;
+ /* This block is copied from yy_switch_to_buffer. */
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
- yy_switch_to_buffer( b );
+ /* Only push if top exists. Otherwise, replace top. */
+ if (YY_CURRENT_BUFFER)
+ (yy_buffer_stack_top)++;
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
- return b;
- }
-#endif
+ /* copied from yy_switch_to_buffer. */
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+/** Removes and deletes the top of the stack, if present.
+ * The next element becomes the new top.
+ *
+ */
+void yypop_buffer_state (void)
+{
+ if (!YY_CURRENT_BUFFER)
+ return;
-#ifndef YY_NO_SCAN_STRING
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str )
-#else
-YY_BUFFER_STATE yy_scan_string( yy_str )
-yyconst char *yy_str;
-#endif
- {
- int len;
- for ( len = 0; yy_str[len]; ++len )
- ;
+ yy_delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ if ((yy_buffer_stack_top) > 0)
+ --(yy_buffer_stack_top);
- return yy_scan_bytes( yy_str, len );
+ if (YY_CURRENT_BUFFER) {
+ yy_load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
}
-#endif
-
-
-#ifndef YY_NO_SCAN_BYTES
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
-#else
-YY_BUFFER_STATE yy_scan_bytes( bytes, len )
-yyconst char *bytes;
-int len;
-#endif
- {
- YY_BUFFER_STATE b;
- char *buf;
- yy_size_t n;
- int i;
-
- /* Get memory for full buffer, including space for trailing EOB's. */
- n = len + 2;
- buf = (char *) yy_flex_alloc( n );
- if ( ! buf )
- YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
+}
- for ( i = 0; i < len; ++i )
- buf[i] = bytes[i];
+/* Allocates the stack if it does not exist.
+ * Guarantees space for at least one push.
+ */
+static void yyensure_buffer_stack (void)
+{
+ int num_to_alloc;
+
+ if (!(yy_buffer_stack)) {
+
+ /* First allocation is just for 2 elements, since we don't know if this
+ * scanner will even need a stack. We use 2 instead of 1 to avoid an
+ * immediate realloc on the next call.
+ */
+ num_to_alloc = 1;
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc
+ (num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+
+ memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+
+ (yy_buffer_stack_max) = num_to_alloc;
+ (yy_buffer_stack_top) = 0;
+ return;
+ }
- buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
+ if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
- b = yy_scan_buffer( buf, n );
- if ( ! b )
- YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
+ /* Increase the buffer to prepare for a possible push. */
+ int grow_size = 8 /* arbitrary grow size */;
- /* It's okay to grow etc. this buffer, and we should throw it
- * away when we're done.
- */
- b->yy_is_our_buffer = 1;
+ num_to_alloc = (yy_buffer_stack_max) + grow_size;
+ (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc
+ ((yy_buffer_stack),
+ num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
- return b;
+ /* zero only the new slots.*/
+ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
+ (yy_buffer_stack_max) = num_to_alloc;
}
-#endif
-
+}
-#ifndef YY_NO_PUSH_STATE
-#ifdef YY_USE_PROTOS
-static void yy_push_state( int new_state )
-#else
-static void yy_push_state( new_state )
-int new_state;
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
#endif
- {
- if ( yy_start_stack_ptr >= yy_start_stack_depth )
- {
- yy_size_t new_size;
- yy_start_stack_depth += YY_START_STACK_INCR;
- new_size = yy_start_stack_depth * sizeof( int );
+static void yy_fatal_error (yyconst char* msg )
+{
+ (void) fprintf( stderr, "%s\n", msg );
+ exit( YY_EXIT_FAILURE );
+}
- if ( ! yy_start_stack )
- yy_start_stack = (int *) yy_flex_alloc( new_size );
+/* Redefine yyless() so it works in section 3 code. */
- else
- yy_start_stack = (int *) yy_flex_realloc(
- (void *) yy_start_stack, new_size );
+#undef yyless
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up yytext. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ yytext[yyleng] = (yy_hold_char); \
+ (yy_c_buf_p) = yytext + yyless_macro_arg; \
+ (yy_hold_char) = *(yy_c_buf_p); \
+ *(yy_c_buf_p) = '\0'; \
+ yyleng = yyless_macro_arg; \
+ } \
+ while ( 0 )
- if ( ! yy_start_stack )
- YY_FATAL_ERROR(
- "out of memory expanding start-condition stack" );
- }
+/* Accessor methods (get/set functions) to struct members. */
- yy_start_stack[yy_start_stack_ptr++] = YY_START;
+/** Get the current line number.
+ *
+ */
+int yyget_lineno (void)
+{
+
+ return yylineno;
+}
- BEGIN(new_state);
- }
-#endif
+/** Get the input stream.
+ *
+ */
+FILE *yyget_in (void)
+{
+ return yyin;
+}
+/** Get the output stream.
+ *
+ */
+FILE *yyget_out (void)
+{
+ return yyout;
+}
-#ifndef YY_NO_POP_STATE
-static void yy_pop_state()
- {
- if ( --yy_start_stack_ptr < 0 )
- YY_FATAL_ERROR( "start-condition stack underflow" );
+/** Get the length of the current token.
+ *
+ */
+int yyget_leng (void)
+{
+ return yyleng;
+}
- BEGIN(yy_start_stack[yy_start_stack_ptr]);
- }
-#endif
+/** Get the current token.
+ *
+ */
+char *yyget_text (void)
+{
+ return yytext;
+}
-#ifndef YY_NO_TOP_STATE
-static int yy_top_state()
- {
- return yy_start_stack[yy_start_stack_ptr - 1];
- }
-#endif
+/** Set the current line number.
+ * @param line_number
+ *
+ */
+void yyset_lineno (int line_number )
+{
+
+ yylineno = line_number;
+}
-#ifndef YY_EXIT_FAILURE
-#define YY_EXIT_FAILURE 2
-#endif
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ *
+ * @see yy_switch_to_buffer
+ */
+void yyset_in (FILE * in_str )
+{
+ yyin = in_str ;
+}
-#ifdef YY_USE_PROTOS
-static void yy_fatal_error( yyconst char msg[] )
-#else
-static void yy_fatal_error( msg )
-char msg[];
-#endif
- {
- (void) fprintf( stderr, "%s\n", msg );
- exit( YY_EXIT_FAILURE );
- }
+void yyset_out (FILE * out_str )
+{
+ yyout = out_str ;
+}
+int yyget_debug (void)
+{
+ return yy_flex_debug;
+}
+void yyset_debug (int bdebug )
+{
+ yy_flex_debug = bdebug ;
+}
-/* Redefine yyless() so it works in section 3 code. */
+/* yylex_destroy is for both reentrant and non-reentrant scanners. */
+int yylex_destroy (void)
+{
+
+ /* Pop the buffer stack, destroying each element. */
+ while(YY_CURRENT_BUFFER){
+ yy_delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ yypop_buffer_state();
+ }
-#undef yyless
-#define yyless(n) \
- do \
- { \
- /* Undo effects of setting up yytext. */ \
- yytext[yyleng] = yy_hold_char; \
- yy_c_buf_p = yytext + n; \
- yy_hold_char = *yy_c_buf_p; \
- *yy_c_buf_p = '\0'; \
- yyleng = n; \
- } \
- while ( 0 )
+ /* Destroy the stack itself. */
+ yyfree((yy_buffer_stack) );
+ (yy_buffer_stack) = NULL;
+ return 0;
+}
-/* Internal utility routines. */
+/*
+ * Internal utility routines.
+ */
#ifndef yytext_ptr
-#ifdef YY_USE_PROTOS
-static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
-#else
-static void yy_flex_strncpy( s1, s2, n )
-char *s1;
-yyconst char *s2;
-int n;
-#endif
- {
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
+{
register int i;
- for ( i = 0; i < n; ++i )
+ for ( i = 0; i < n; ++i )
s1[i] = s2[i];
- }
+}
#endif
#ifdef YY_NEED_STRLEN
-#ifdef YY_USE_PROTOS
-static int yy_flex_strlen( yyconst char *s )
-#else
-static int yy_flex_strlen( s )
-yyconst char *s;
-#endif
- {
+static int yy_flex_strlen (yyconst char * s )
+{
register int n;
- for ( n = 0; s[n]; ++n )
+ for ( n = 0; s[n]; ++n )
;
return n;
- }
+}
#endif
-
-#ifdef YY_USE_PROTOS
-static void *yy_flex_alloc( yy_size_t size )
-#else
-static void *yy_flex_alloc( size )
-yy_size_t size;
-#endif
- {
+void *yyalloc (yy_size_t size )
+{
return (void *) malloc( size );
- }
+}
-#ifdef YY_USE_PROTOS
-static void *yy_flex_realloc( void *ptr, yy_size_t size )
-#else
-static void *yy_flex_realloc( ptr, size )
-void *ptr;
-yy_size_t size;
-#endif
- {
+void *yyrealloc (void * ptr, yy_size_t size )
+{
/* The cast to (char *) in the following accommodates both
* implementations that use char* generic pointers, and those
* that use void* generic pointers. It works with the latter
@@ -2580,24 +2618,28 @@ yy_size_t size;
* as though doing an assignment.
*/
return (void *) realloc( (char *) ptr, size );
- }
+}
-#ifdef YY_USE_PROTOS
-static void yy_flex_free( void *ptr )
-#else
-static void yy_flex_free( ptr )
-void *ptr;
-#endif
- {
- free( ptr );
- }
+void yyfree (void * ptr )
+{
+ free( (char *) ptr ); /* see yyrealloc() for (char *) cast */
+}
-#if YY_MAIN
-int main()
- {
- yylex();
- return 0;
- }
+#define YYTABLES_NAME "yytables"
+
+#undef YY_NEW_FILE
+#undef YY_FLUSH_BUFFER
+#undef yy_set_bol
+#undef yy_new_buffer
+#undef yy_set_interactive
+#undef yytext_ptr
+#undef YY_DO_BEFORE_ACTION
+
+#ifdef YY_DECL_IS_OURS
+#undef YY_DECL_IS_OURS
+#undef YY_DECL
#endif
-#line 575 "pars0lex.l"
+#line 587 "pars0lex.l"
+
+
diff --git a/storage/innobase/pars/make_bison.sh b/storage/innobase/pars/make_bison.sh
new file mode 100755
index 00000000000..43b0322494c
--- /dev/null
+++ b/storage/innobase/pars/make_bison.sh
@@ -0,0 +1,11 @@
+#!/bin/bash
+#
+# regenerate parser from bison input files as documented at the top of
+# pars0lex.l.
+
+set -eu
+
+bison -d pars0grm.y
+mv pars0grm.tab.c pars0grm.c
+mv pars0grm.tab.h pars0grm.h
+cp pars0grm.h ../include
diff --git a/storage/innobase/pars/pars0grm.c b/storage/innobase/pars/pars0grm.c
index 05b75398084..3800cdda88e 100644
--- a/storage/innobase/pars/pars0grm.c
+++ b/storage/innobase/pars/pars0grm.c
@@ -1,94 +1,237 @@
+/* A Bison parser, made by GNU Bison 1.875d. */
-/* A Bison parser, made from pars0grm.y
- by GNU Bison version 1.28 */
-
-#define YYBISON 1 /* Identify Bison output. */
-
-#define PARS_INT_LIT 257
-#define PARS_FLOAT_LIT 258
-#define PARS_STR_LIT 259
-#define PARS_NULL_LIT 260
-#define PARS_ID_TOKEN 261
-#define PARS_AND_TOKEN 262
-#define PARS_OR_TOKEN 263
-#define PARS_NOT_TOKEN 264
-#define PARS_GE_TOKEN 265
-#define PARS_LE_TOKEN 266
-#define PARS_NE_TOKEN 267
-#define PARS_PROCEDURE_TOKEN 268
-#define PARS_IN_TOKEN 269
-#define PARS_OUT_TOKEN 270
-#define PARS_INT_TOKEN 271
-#define PARS_INTEGER_TOKEN 272
-#define PARS_FLOAT_TOKEN 273
-#define PARS_CHAR_TOKEN 274
-#define PARS_IS_TOKEN 275
-#define PARS_BEGIN_TOKEN 276
-#define PARS_END_TOKEN 277
-#define PARS_IF_TOKEN 278
-#define PARS_THEN_TOKEN 279
-#define PARS_ELSE_TOKEN 280
-#define PARS_ELSIF_TOKEN 281
-#define PARS_LOOP_TOKEN 282
-#define PARS_WHILE_TOKEN 283
-#define PARS_RETURN_TOKEN 284
-#define PARS_SELECT_TOKEN 285
-#define PARS_SUM_TOKEN 286
-#define PARS_COUNT_TOKEN 287
-#define PARS_DISTINCT_TOKEN 288
-#define PARS_FROM_TOKEN 289
-#define PARS_WHERE_TOKEN 290
-#define PARS_FOR_TOKEN 291
-#define PARS_DDOT_TOKEN 292
-#define PARS_CONSISTENT_TOKEN 293
-#define PARS_READ_TOKEN 294
-#define PARS_ORDER_TOKEN 295
-#define PARS_BY_TOKEN 296
-#define PARS_ASC_TOKEN 297
-#define PARS_DESC_TOKEN 298
-#define PARS_INSERT_TOKEN 299
-#define PARS_INTO_TOKEN 300
-#define PARS_VALUES_TOKEN 301
-#define PARS_UPDATE_TOKEN 302
-#define PARS_SET_TOKEN 303
-#define PARS_DELETE_TOKEN 304
-#define PARS_CURRENT_TOKEN 305
-#define PARS_OF_TOKEN 306
-#define PARS_CREATE_TOKEN 307
-#define PARS_TABLE_TOKEN 308
-#define PARS_INDEX_TOKEN 309
-#define PARS_UNIQUE_TOKEN 310
-#define PARS_CLUSTERED_TOKEN 311
-#define PARS_DOES_NOT_FIT_IN_MEM_TOKEN 312
-#define PARS_ON_TOKEN 313
-#define PARS_ASSIGN_TOKEN 314
-#define PARS_DECLARE_TOKEN 315
-#define PARS_CURSOR_TOKEN 316
-#define PARS_SQL_TOKEN 317
-#define PARS_OPEN_TOKEN 318
-#define PARS_FETCH_TOKEN 319
-#define PARS_CLOSE_TOKEN 320
-#define PARS_NOTFOUND_TOKEN 321
-#define PARS_TO_CHAR_TOKEN 322
-#define PARS_TO_NUMBER_TOKEN 323
-#define PARS_TO_BINARY_TOKEN 324
-#define PARS_BINARY_TO_NUMBER_TOKEN 325
-#define PARS_SUBSTR_TOKEN 326
-#define PARS_REPLSTR_TOKEN 327
-#define PARS_CONCAT_TOKEN 328
-#define PARS_INSTR_TOKEN 329
-#define PARS_LENGTH_TOKEN 330
-#define PARS_SYSDATE_TOKEN 331
-#define PARS_PRINTF_TOKEN 332
-#define PARS_ASSERT_TOKEN 333
-#define PARS_RND_TOKEN 334
-#define PARS_RND_STR_TOKEN 335
-#define PARS_ROW_PRINTF_TOKEN 336
-#define PARS_COMMIT_TOKEN 337
-#define PARS_ROLLBACK_TOKEN 338
-#define PARS_WORK_TOKEN 339
-#define NEG 340
+/* Skeleton parser for Yacc-like parsing with Bison,
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
+ 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, 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., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+/* As a special exception, when this file is copied by Bison into a
+ Bison output file, you may use that output file without restriction.
+ This special exception was added by the Free Software Foundation
+ in version 1.24 of Bison. */
+
+/* Written by Richard Stallman by simplifying the original so called
+ ``semantic'' parser. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output. */
+#define YYBISON 1
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 0
+
+/* Using locations. */
+#define YYLSP_NEEDED 0
+
+
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ PARS_INT_LIT = 258,
+ PARS_FLOAT_LIT = 259,
+ PARS_STR_LIT = 260,
+ PARS_NULL_LIT = 261,
+ PARS_ID_TOKEN = 262,
+ PARS_AND_TOKEN = 263,
+ PARS_OR_TOKEN = 264,
+ PARS_NOT_TOKEN = 265,
+ PARS_GE_TOKEN = 266,
+ PARS_LE_TOKEN = 267,
+ PARS_NE_TOKEN = 268,
+ PARS_PROCEDURE_TOKEN = 269,
+ PARS_IN_TOKEN = 270,
+ PARS_OUT_TOKEN = 271,
+ PARS_BINARY_TOKEN = 272,
+ PARS_BLOB_TOKEN = 273,
+ PARS_INT_TOKEN = 274,
+ PARS_INTEGER_TOKEN = 275,
+ PARS_FLOAT_TOKEN = 276,
+ PARS_CHAR_TOKEN = 277,
+ PARS_IS_TOKEN = 278,
+ PARS_BEGIN_TOKEN = 279,
+ PARS_END_TOKEN = 280,
+ PARS_IF_TOKEN = 281,
+ PARS_THEN_TOKEN = 282,
+ PARS_ELSE_TOKEN = 283,
+ PARS_ELSIF_TOKEN = 284,
+ PARS_LOOP_TOKEN = 285,
+ PARS_WHILE_TOKEN = 286,
+ PARS_RETURN_TOKEN = 287,
+ PARS_SELECT_TOKEN = 288,
+ PARS_SUM_TOKEN = 289,
+ PARS_COUNT_TOKEN = 290,
+ PARS_DISTINCT_TOKEN = 291,
+ PARS_FROM_TOKEN = 292,
+ PARS_WHERE_TOKEN = 293,
+ PARS_FOR_TOKEN = 294,
+ PARS_DDOT_TOKEN = 295,
+ PARS_CONSISTENT_TOKEN = 296,
+ PARS_READ_TOKEN = 297,
+ PARS_ORDER_TOKEN = 298,
+ PARS_BY_TOKEN = 299,
+ PARS_ASC_TOKEN = 300,
+ PARS_DESC_TOKEN = 301,
+ PARS_INSERT_TOKEN = 302,
+ PARS_INTO_TOKEN = 303,
+ PARS_VALUES_TOKEN = 304,
+ PARS_UPDATE_TOKEN = 305,
+ PARS_SET_TOKEN = 306,
+ PARS_DELETE_TOKEN = 307,
+ PARS_CURRENT_TOKEN = 308,
+ PARS_OF_TOKEN = 309,
+ PARS_CREATE_TOKEN = 310,
+ PARS_TABLE_TOKEN = 311,
+ PARS_INDEX_TOKEN = 312,
+ PARS_UNIQUE_TOKEN = 313,
+ PARS_CLUSTERED_TOKEN = 314,
+ PARS_DOES_NOT_FIT_IN_MEM_TOKEN = 315,
+ PARS_ON_TOKEN = 316,
+ PARS_ASSIGN_TOKEN = 317,
+ PARS_DECLARE_TOKEN = 318,
+ PARS_CURSOR_TOKEN = 319,
+ PARS_SQL_TOKEN = 320,
+ PARS_OPEN_TOKEN = 321,
+ PARS_FETCH_TOKEN = 322,
+ PARS_CLOSE_TOKEN = 323,
+ PARS_NOTFOUND_TOKEN = 324,
+ PARS_TO_CHAR_TOKEN = 325,
+ PARS_TO_NUMBER_TOKEN = 326,
+ PARS_TO_BINARY_TOKEN = 327,
+ PARS_BINARY_TO_NUMBER_TOKEN = 328,
+ PARS_SUBSTR_TOKEN = 329,
+ PARS_REPLSTR_TOKEN = 330,
+ PARS_CONCAT_TOKEN = 331,
+ PARS_INSTR_TOKEN = 332,
+ PARS_LENGTH_TOKEN = 333,
+ PARS_SYSDATE_TOKEN = 334,
+ PARS_PRINTF_TOKEN = 335,
+ PARS_ASSERT_TOKEN = 336,
+ PARS_RND_TOKEN = 337,
+ PARS_RND_STR_TOKEN = 338,
+ PARS_ROW_PRINTF_TOKEN = 339,
+ PARS_COMMIT_TOKEN = 340,
+ PARS_ROLLBACK_TOKEN = 341,
+ PARS_WORK_TOKEN = 342,
+ NEG = 343
+ };
+#endif
+#define PARS_INT_LIT 258
+#define PARS_FLOAT_LIT 259
+#define PARS_STR_LIT 260
+#define PARS_NULL_LIT 261
+#define PARS_ID_TOKEN 262
+#define PARS_AND_TOKEN 263
+#define PARS_OR_TOKEN 264
+#define PARS_NOT_TOKEN 265
+#define PARS_GE_TOKEN 266
+#define PARS_LE_TOKEN 267
+#define PARS_NE_TOKEN 268
+#define PARS_PROCEDURE_TOKEN 269
+#define PARS_IN_TOKEN 270
+#define PARS_OUT_TOKEN 271
+#define PARS_BINARY_TOKEN 272
+#define PARS_BLOB_TOKEN 273
+#define PARS_INT_TOKEN 274
+#define PARS_INTEGER_TOKEN 275
+#define PARS_FLOAT_TOKEN 276
+#define PARS_CHAR_TOKEN 277
+#define PARS_IS_TOKEN 278
+#define PARS_BEGIN_TOKEN 279
+#define PARS_END_TOKEN 280
+#define PARS_IF_TOKEN 281
+#define PARS_THEN_TOKEN 282
+#define PARS_ELSE_TOKEN 283
+#define PARS_ELSIF_TOKEN 284
+#define PARS_LOOP_TOKEN 285
+#define PARS_WHILE_TOKEN 286
+#define PARS_RETURN_TOKEN 287
+#define PARS_SELECT_TOKEN 288
+#define PARS_SUM_TOKEN 289
+#define PARS_COUNT_TOKEN 290
+#define PARS_DISTINCT_TOKEN 291
+#define PARS_FROM_TOKEN 292
+#define PARS_WHERE_TOKEN 293
+#define PARS_FOR_TOKEN 294
+#define PARS_DDOT_TOKEN 295
+#define PARS_CONSISTENT_TOKEN 296
+#define PARS_READ_TOKEN 297
+#define PARS_ORDER_TOKEN 298
+#define PARS_BY_TOKEN 299
+#define PARS_ASC_TOKEN 300
+#define PARS_DESC_TOKEN 301
+#define PARS_INSERT_TOKEN 302
+#define PARS_INTO_TOKEN 303
+#define PARS_VALUES_TOKEN 304
+#define PARS_UPDATE_TOKEN 305
+#define PARS_SET_TOKEN 306
+#define PARS_DELETE_TOKEN 307
+#define PARS_CURRENT_TOKEN 308
+#define PARS_OF_TOKEN 309
+#define PARS_CREATE_TOKEN 310
+#define PARS_TABLE_TOKEN 311
+#define PARS_INDEX_TOKEN 312
+#define PARS_UNIQUE_TOKEN 313
+#define PARS_CLUSTERED_TOKEN 314
+#define PARS_DOES_NOT_FIT_IN_MEM_TOKEN 315
+#define PARS_ON_TOKEN 316
+#define PARS_ASSIGN_TOKEN 317
+#define PARS_DECLARE_TOKEN 318
+#define PARS_CURSOR_TOKEN 319
+#define PARS_SQL_TOKEN 320
+#define PARS_OPEN_TOKEN 321
+#define PARS_FETCH_TOKEN 322
+#define PARS_CLOSE_TOKEN 323
+#define PARS_NOTFOUND_TOKEN 324
+#define PARS_TO_CHAR_TOKEN 325
+#define PARS_TO_NUMBER_TOKEN 326
+#define PARS_TO_BINARY_TOKEN 327
+#define PARS_BINARY_TO_NUMBER_TOKEN 328
+#define PARS_SUBSTR_TOKEN 329
+#define PARS_REPLSTR_TOKEN 330
+#define PARS_CONCAT_TOKEN 331
+#define PARS_INSTR_TOKEN 332
+#define PARS_LENGTH_TOKEN 333
+#define PARS_SYSDATE_TOKEN 334
+#define PARS_PRINTF_TOKEN 335
+#define PARS_ASSERT_TOKEN 336
+#define PARS_RND_TOKEN 337
+#define PARS_RND_STR_TOKEN 338
+#define PARS_ROW_PRINTF_TOKEN 339
+#define PARS_COMMIT_TOKEN 340
+#define PARS_ROLLBACK_TOKEN 341
+#define PARS_WORK_TOKEN 342
+#define NEG 343
+
+
+
+
+/* Copy the first part of user declarations. */
#line 13 "pars0grm.y"
/* The value of the semantic attribute is a pointer to a query tree node
@@ -108,767 +251,1136 @@ que_node_t */
int
yylex(void);
-#ifndef YYSTYPE
-#define YYSTYPE int
+
+
+/* Enabling traces. */
+#ifndef YYDEBUG
+# define YYDEBUG 0
#endif
-#include <stdio.h>
-#ifndef __cplusplus
-#ifndef __STDC__
-#define const
+/* Enabling verbose error messages. */
+#ifdef YYERROR_VERBOSE
+# undef YYERROR_VERBOSE
+# define YYERROR_VERBOSE 1
+#else
+# define YYERROR_VERBOSE 0
#endif
+
+#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
+typedef int YYSTYPE;
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+# define YYSTYPE_IS_TRIVIAL 1
#endif
-#define YYFINAL 311
-#define YYFLAG -32768
-#define YYNTBASE 102
-
-#define YYTRANSLATE(x) ((unsigned)(x) <= 340 ? yytranslate[x] : 163)
-
-static const char yytranslate[] = { 0,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 94, 2, 2, 96,
- 97, 91, 90, 99, 89, 2, 92, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 95, 87,
- 86, 88, 98, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 100, 2, 101, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 1, 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, 93
-};
+/* Copy the second part of user declarations. */
-#if YYDEBUG != 0
-static const short yyprhs[] = { 0,
- 0, 3, 5, 8, 11, 14, 17, 20, 23, 26,
- 29, 32, 35, 38, 41, 44, 47, 50, 53, 56,
- 59, 62, 65, 67, 70, 72, 77, 79, 81, 83,
- 85, 87, 91, 95, 99, 103, 106, 110, 114, 118,
- 122, 126, 130, 134, 138, 142, 145, 149, 153, 155,
- 157, 159, 161, 163, 165, 167, 169, 171, 173, 175,
- 176, 178, 182, 189, 194, 196, 198, 200, 202, 206,
- 207, 209, 213, 214, 216, 220, 222, 227, 233, 238,
- 239, 241, 245, 247, 251, 253, 254, 257, 258, 261,
- 262, 265, 266, 268, 270, 271, 276, 285, 289, 295,
- 298, 302, 304, 308, 313, 318, 321, 324, 328, 331,
- 334, 337, 341, 346, 348, 351, 352, 355, 357, 365,
- 372, 383, 385, 388, 391, 396, 399, 401, 405, 406,
- 408, 416, 418, 422, 423, 425, 426, 428, 439, 442,
- 445, 447, 449, 453, 457, 458, 460, 464, 468, 469,
- 471, 474, 481, 482, 484, 487
-};
-static const short yyrhs[] = { 162,
- 95, 0, 107, 0, 108, 95, 0, 139, 95, 0,
- 140, 95, 0, 138, 95, 0, 141, 95, 0, 134,
- 95, 0, 121, 95, 0, 123, 95, 0, 133, 95,
- 0, 131, 95, 0, 132, 95, 0, 128, 95, 0,
- 129, 95, 0, 142, 95, 0, 144, 95, 0, 143,
- 95, 0, 153, 95, 0, 154, 95, 0, 148, 95,
- 0, 152, 95, 0, 102, 0, 103, 102, 0, 7,
- 0, 105, 96, 112, 97, 0, 3, 0, 4, 0,
- 5, 0, 6, 0, 63, 0, 104, 90, 104, 0,
- 104, 89, 104, 0, 104, 91, 104, 0, 104, 92,
- 104, 0, 89, 104, 0, 96, 104, 97, 0, 104,
- 86, 104, 0, 104, 87, 104, 0, 104, 88, 104,
- 0, 104, 11, 104, 0, 104, 12, 104, 0, 104,
- 13, 104, 0, 104, 8, 104, 0, 104, 9, 104,
- 0, 10, 104, 0, 7, 94, 67, 0, 63, 94,
- 67, 0, 68, 0, 69, 0, 70, 0, 71, 0,
- 72, 0, 74, 0, 75, 0, 76, 0, 77, 0,
- 80, 0, 81, 0, 0, 98, 0, 106, 99, 98,
- 0, 100, 7, 96, 106, 97, 101, 0, 109, 96,
- 112, 97, 0, 73, 0, 78, 0, 79, 0, 7,
- 0, 110, 99, 7, 0, 0, 7, 0, 111, 99,
- 7, 0, 0, 104, 0, 112, 99, 104, 0, 104,
- 0, 33, 96, 91, 97, 0, 33, 96, 34, 7,
- 97, 0, 32, 96, 104, 97, 0, 0, 113, 0,
- 114, 99, 113, 0, 91, 0, 114, 46, 111, 0,
- 114, 0, 0, 36, 104, 0, 0, 37, 48, 0,
- 0, 39, 40, 0, 0, 43, 0, 44, 0, 0,
- 41, 42, 7, 119, 0, 31, 115, 35, 110, 116,
- 117, 118, 120, 0, 45, 46, 7, 0, 122, 47,
- 96, 112, 97, 0, 122, 121, 0, 7, 86, 104,
- 0, 124, 0, 125, 99, 124, 0, 36, 51, 52,
- 7, 0, 48, 7, 49, 125, 0, 127, 116, 0,
- 127, 126, 0, 50, 35, 7, 0, 130, 116, 0,
- 130, 126, 0, 82, 121, 0, 7, 60, 104, 0,
- 27, 104, 25, 103, 0, 135, 0, 136, 135, 0,
- 0, 26, 103, 0, 136, 0, 24, 104, 25, 103,
- 137, 23, 24, 0, 29, 104, 28, 103, 23, 28,
- 0, 37, 7, 15, 104, 38, 104, 28, 103, 23,
- 28, 0, 30, 0, 64, 7, 0, 66, 7, 0,
- 65, 7, 46, 111, 0, 7, 155, 0, 145, 0,
- 146, 99, 145, 0, 0, 58, 0, 53, 54, 7,
- 96, 146, 97, 147, 0, 7, 0, 149, 99, 7,
- 0, 0, 56, 0, 0, 57, 0, 53, 150, 151,
- 55, 7, 59, 7, 96, 149, 97, 0, 83, 85,
- 0, 84, 85, 0, 17, 0, 20, 0, 7, 15,
- 155, 0, 7, 16, 155, 0, 0, 156, 0, 157,
- 99, 156, 0, 7, 155, 95, 0, 0, 158, 0,
- 159, 158, 0, 61, 62, 7, 21, 121, 95, 0,
- 0, 160, 0, 161, 160, 0, 14, 7, 96, 157,
- 97, 21, 159, 161, 22, 103, 23, 0
-};
+/* Line 214 of yacc.c. */
+#line 283 "pars0grm.tab.c"
-#endif
+#if ! defined (yyoverflow) || YYERROR_VERBOSE
-#if YYDEBUG != 0
-static const short yyrline[] = { 0,
- 129, 131, 132, 133, 134, 135, 136, 137, 138, 139,
- 140, 141, 142, 143, 144, 145, 146, 147, 148, 149,
- 150, 151, 154, 156, 160, 162, 164, 165, 166, 167,
- 168, 169, 170, 171, 172, 173, 174, 175, 176, 177,
- 178, 179, 180, 181, 182, 183, 184, 186, 190, 192,
- 193, 194, 196, 197, 198, 199, 200, 201, 202, 205,
- 207, 208, 211, 216, 221, 223, 224, 227, 229, 233,
- 235, 236, 240, 242, 243, 246, 248, 253, 259, 265,
- 267, 268, 272, 275, 277, 280, 282, 285, 287, 291,
- 293, 297, 299, 300, 303, 305, 309, 319, 324, 327,
- 331, 335, 337, 341, 347, 354, 359, 364, 370, 375,
- 380, 385, 390, 396, 398, 402, 404, 406, 409, 416,
- 422, 430, 434, 440, 446, 451, 455, 457, 461, 463,
- 468, 474, 476, 480, 482, 485, 487, 490, 498, 503,
- 508, 510, 513, 517, 522, 524, 525, 529, 534, 536,
- 537, 540, 546, 548, 549, 552
-};
-#endif
+# ifndef YYFREE
+# define YYFREE free
+# endif
+# ifndef YYMALLOC
+# define YYMALLOC malloc
+# endif
+/* The parser invokes alloca or malloc; define the necessary symbols. */
+
+# ifdef YYSTACK_USE_ALLOCA
+# if YYSTACK_USE_ALLOCA
+# define YYSTACK_ALLOC alloca
+# endif
+# else
+# if defined (alloca) || defined (_ALLOCA_H)
+# define YYSTACK_ALLOC alloca
+# else
+# ifdef __GNUC__
+# define YYSTACK_ALLOC __builtin_alloca
+# endif
+# endif
+# endif
+
+# ifdef YYSTACK_ALLOC
+ /* Pacify GCC's `empty if-body' warning. */
+# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
+# else
+# if defined (__STDC__) || defined (__cplusplus)
+# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# endif
+# define YYSTACK_ALLOC YYMALLOC
+# define YYSTACK_FREE YYFREE
+# endif
+#endif /* ! defined (yyoverflow) || YYERROR_VERBOSE */
+
+
+#if (! defined (yyoverflow) \
+ && (! defined (__cplusplus) \
+ || (defined (YYSTYPE_IS_TRIVIAL) && YYSTYPE_IS_TRIVIAL)))
+
+/* A type that is properly aligned for any stack member. */
+union yyalloc
+{
+ short int yyss;
+ YYSTYPE yyvs;
+ };
+
+/* The size of the maximum gap between one aligned stack and the next. */
+# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
+
+/* The size of an array large to enough to hold all stacks, each with
+ N elements. */
+# define YYSTACK_BYTES(N) \
+ ((N) * (sizeof (short int) + sizeof (YYSTYPE)) \
+ + YYSTACK_GAP_MAXIMUM)
+
+/* Copy COUNT objects from FROM to TO. The source and destination do
+ not overlap. */
+# ifndef YYCOPY
+# if defined (__GNUC__) && 1 < __GNUC__
+# define YYCOPY(To, From, Count) \
+ __builtin_memcpy (To, From, (Count) * sizeof (*(From)))
+# else
+# define YYCOPY(To, From, Count) \
+ do \
+ { \
+ register YYSIZE_T yyi; \
+ for (yyi = 0; yyi < (Count); yyi++) \
+ (To)[yyi] = (From)[yyi]; \
+ } \
+ while (0)
+# endif
+# endif
+
+/* Relocate STACK from its old location to the new one. The
+ local variables YYSIZE and YYSTACKSIZE give the old and new number of
+ elements in the stack, and YYPTR gives the new location of the
+ stack. Advance YYPTR to a properly aligned location for the next
+ stack. */
+# define YYSTACK_RELOCATE(Stack) \
+ do \
+ { \
+ YYSIZE_T yynewbytes; \
+ YYCOPY (&yyptr->Stack, Stack, yysize); \
+ Stack = &yyptr->Stack; \
+ yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
+ yyptr += yynewbytes / sizeof (*yyptr); \
+ } \
+ while (0)
-#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
-
-static const char * const yytname[] = { "$","error","$undefined.","PARS_INT_LIT",
-"PARS_FLOAT_LIT","PARS_STR_LIT","PARS_NULL_LIT","PARS_ID_TOKEN","PARS_AND_TOKEN",
-"PARS_OR_TOKEN","PARS_NOT_TOKEN","PARS_GE_TOKEN","PARS_LE_TOKEN","PARS_NE_TOKEN",
-"PARS_PROCEDURE_TOKEN","PARS_IN_TOKEN","PARS_OUT_TOKEN","PARS_INT_TOKEN","PARS_INTEGER_TOKEN",
-"PARS_FLOAT_TOKEN","PARS_CHAR_TOKEN","PARS_IS_TOKEN","PARS_BEGIN_TOKEN","PARS_END_TOKEN",
-"PARS_IF_TOKEN","PARS_THEN_TOKEN","PARS_ELSE_TOKEN","PARS_ELSIF_TOKEN","PARS_LOOP_TOKEN",
-"PARS_WHILE_TOKEN","PARS_RETURN_TOKEN","PARS_SELECT_TOKEN","PARS_SUM_TOKEN",
-"PARS_COUNT_TOKEN","PARS_DISTINCT_TOKEN","PARS_FROM_TOKEN","PARS_WHERE_TOKEN",
-"PARS_FOR_TOKEN","PARS_DDOT_TOKEN","PARS_CONSISTENT_TOKEN","PARS_READ_TOKEN",
-"PARS_ORDER_TOKEN","PARS_BY_TOKEN","PARS_ASC_TOKEN","PARS_DESC_TOKEN","PARS_INSERT_TOKEN",
-"PARS_INTO_TOKEN","PARS_VALUES_TOKEN","PARS_UPDATE_TOKEN","PARS_SET_TOKEN","PARS_DELETE_TOKEN",
-"PARS_CURRENT_TOKEN","PARS_OF_TOKEN","PARS_CREATE_TOKEN","PARS_TABLE_TOKEN",
-"PARS_INDEX_TOKEN","PARS_UNIQUE_TOKEN","PARS_CLUSTERED_TOKEN","PARS_DOES_NOT_FIT_IN_MEM_TOKEN",
-"PARS_ON_TOKEN","PARS_ASSIGN_TOKEN","PARS_DECLARE_TOKEN","PARS_CURSOR_TOKEN",
-"PARS_SQL_TOKEN","PARS_OPEN_TOKEN","PARS_FETCH_TOKEN","PARS_CLOSE_TOKEN","PARS_NOTFOUND_TOKEN",
-"PARS_TO_CHAR_TOKEN","PARS_TO_NUMBER_TOKEN","PARS_TO_BINARY_TOKEN","PARS_BINARY_TO_NUMBER_TOKEN",
-"PARS_SUBSTR_TOKEN","PARS_REPLSTR_TOKEN","PARS_CONCAT_TOKEN","PARS_INSTR_TOKEN",
-"PARS_LENGTH_TOKEN","PARS_SYSDATE_TOKEN","PARS_PRINTF_TOKEN","PARS_ASSERT_TOKEN",
-"PARS_RND_TOKEN","PARS_RND_STR_TOKEN","PARS_ROW_PRINTF_TOKEN","PARS_COMMIT_TOKEN",
-"PARS_ROLLBACK_TOKEN","PARS_WORK_TOKEN","'='","'<'","'>'","'-'","'+'","'*'",
-"'/'","NEG","'%'","';'","'('","')'","'?'","','","'{'","'}'","statement","statement_list",
-"exp","function_name","question_mark_list","stored_procedure_call","predefined_procedure_call",
-"predefined_procedure_name","table_list","variable_list","exp_list","select_item",
-"select_item_list","select_list","search_condition","for_update_clause","consistent_read_clause",
-"order_direction","order_by_clause","select_statement","insert_statement_start",
-"insert_statement","column_assignment","column_assignment_list","cursor_positioned",
-"update_statement_start","update_statement_searched","update_statement_positioned",
-"delete_statement_start","delete_statement_searched","delete_statement_positioned",
-"row_printf_statement","assignment_statement","elsif_element","elsif_list","else_part",
-"if_statement","while_statement","for_statement","return_statement","open_cursor_statement",
-"close_cursor_statement","fetch_statement","column_def","column_def_list","not_fit_in_memory",
-"create_table","column_list","unique_def","clustered_def","create_index","commit_statement",
-"rollback_statement","type_name","parameter_declaration","parameter_declaration_list",
-"variable_declaration","variable_declaration_list","cursor_declaration","declaration_list",
-"procedure_definition", NULL
-};
#endif
-static const short yyr1[] = { 0,
- 102, 102, 102, 102, 102, 102, 102, 102, 102, 102,
- 102, 102, 102, 102, 102, 102, 102, 102, 102, 102,
- 102, 102, 103, 103, 104, 104, 104, 104, 104, 104,
- 104, 104, 104, 104, 104, 104, 104, 104, 104, 104,
- 104, 104, 104, 104, 104, 104, 104, 104, 105, 105,
- 105, 105, 105, 105, 105, 105, 105, 105, 105, 106,
- 106, 106, 107, 108, 109, 109, 109, 110, 110, 111,
- 111, 111, 112, 112, 112, 113, 113, 113, 113, 114,
- 114, 114, 115, 115, 115, 116, 116, 117, 117, 118,
- 118, 119, 119, 119, 120, 120, 121, 122, 123, 123,
- 124, 125, 125, 126, 127, 128, 129, 130, 131, 132,
- 133, 134, 135, 136, 136, 137, 137, 137, 138, 139,
- 140, 141, 142, 143, 144, 145, 146, 146, 147, 147,
- 148, 149, 149, 150, 150, 151, 151, 152, 153, 154,
- 155, 155, 156, 156, 157, 157, 157, 158, 159, 159,
- 159, 160, 161, 161, 161, 162
+#if defined (__STDC__) || defined (__cplusplus)
+ typedef signed char yysigned_char;
+#else
+ typedef short int yysigned_char;
+#endif
+
+/* YYFINAL -- State number of the termination state. */
+#define YYFINAL 95
+/* YYLAST -- Last index in YYTABLE. */
+#define YYLAST 734
+
+/* YYNTOKENS -- Number of terminals. */
+#define YYNTOKENS 104
+/* YYNNTS -- Number of nonterminals. */
+#define YYNNTS 64
+/* YYNRULES -- Number of rules. */
+#define YYNRULES 164
+/* YYNRULES -- Number of states. */
+#define YYNSTATES 321
+
+/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
+#define YYUNDEFTOK 2
+#define YYMAXUTOK 343
+
+#define YYTRANSLATE(YYX) \
+ ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
+
+/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
+static const unsigned char yytranslate[] =
+{
+ 0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 96, 2, 2,
+ 98, 99, 93, 92, 101, 91, 2, 94, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 97,
+ 89, 88, 90, 100, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 102, 2, 103, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 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, 95
};
-static const short yyr2[] = { 0,
- 2, 1, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
- 2, 2, 1, 2, 1, 4, 1, 1, 1, 1,
- 1, 3, 3, 3, 3, 2, 3, 3, 3, 3,
- 3, 3, 3, 3, 3, 2, 3, 3, 1, 1,
- 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
- 1, 3, 6, 4, 1, 1, 1, 1, 3, 0,
- 1, 3, 0, 1, 3, 1, 4, 5, 4, 0,
- 1, 3, 1, 3, 1, 0, 2, 0, 2, 0,
- 2, 0, 1, 1, 0, 4, 8, 3, 5, 2,
- 3, 1, 3, 4, 4, 2, 2, 3, 2, 2,
- 2, 3, 4, 1, 2, 0, 2, 1, 7, 6,
- 10, 1, 2, 2, 4, 2, 1, 3, 0, 1,
- 7, 1, 3, 0, 1, 0, 1, 10, 2, 2,
- 1, 1, 3, 3, 0, 1, 3, 3, 0, 1,
- 2, 6, 0, 1, 2, 11
+#if YYDEBUG
+/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
+ YYRHS. */
+static const unsigned short int yyprhs[] =
+{
+ 0, 0, 3, 6, 8, 11, 14, 17, 20, 23,
+ 26, 29, 32, 35, 38, 41, 44, 47, 50, 53,
+ 56, 59, 62, 65, 68, 70, 73, 75, 80, 82,
+ 84, 86, 88, 90, 94, 98, 102, 106, 109, 113,
+ 117, 121, 125, 129, 133, 137, 141, 145, 148, 152,
+ 156, 158, 160, 162, 164, 166, 168, 170, 172, 174,
+ 176, 178, 179, 181, 185, 192, 197, 199, 201, 203,
+ 205, 209, 210, 212, 216, 217, 219, 223, 225, 230,
+ 236, 241, 242, 244, 248, 250, 254, 256, 257, 260,
+ 261, 264, 265, 268, 269, 271, 273, 274, 279, 288,
+ 292, 298, 301, 305, 307, 311, 316, 321, 324, 327,
+ 331, 334, 337, 340, 344, 349, 351, 354, 355, 358,
+ 360, 368, 375, 386, 388, 391, 394, 399, 404, 406,
+ 410, 411, 415, 416, 419, 420, 422, 430, 432, 436,
+ 437, 439, 440, 442, 453, 456, 459, 461, 463, 465,
+ 467, 469, 473, 477, 478, 480, 484, 488, 489, 491,
+ 494, 501, 502, 504, 507
};
-static const short yydefact[] = { 0,
- 0, 0, 0, 0, 122, 80, 0, 0, 0, 0,
- 134, 0, 0, 0, 65, 66, 67, 0, 0, 0,
- 0, 2, 0, 0, 0, 0, 0, 86, 0, 0,
- 86, 0, 0, 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 27,
- 28, 29, 30, 25, 0, 31, 49, 50, 51, 52,
- 53, 54, 55, 56, 57, 58, 59, 0, 0, 0,
- 0, 0, 0, 0, 83, 76, 81, 85, 0, 0,
- 0, 0, 0, 0, 135, 136, 123, 0, 124, 111,
- 139, 140, 0, 3, 73, 9, 0, 100, 10, 0,
- 106, 107, 14, 15, 109, 110, 12, 13, 11, 8,
- 6, 4, 5, 7, 16, 18, 17, 21, 22, 19,
- 20, 1, 112, 145, 0, 46, 0, 36, 0, 0,
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 73, 0, 0, 0, 70, 0, 0, 0,
- 98, 0, 108, 0, 137, 0, 70, 60, 74, 0,
- 73, 0, 87, 0, 146, 0, 47, 48, 37, 44,
- 45, 41, 42, 43, 23, 116, 38, 39, 40, 33,
- 32, 34, 35, 0, 0, 0, 0, 0, 71, 84,
- 82, 68, 86, 0, 0, 102, 105, 0, 0, 125,
- 61, 0, 64, 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 24, 114, 118, 0, 26, 0, 79, 0,
- 77, 0, 0, 0, 88, 0, 0, 0, 0, 127,
- 0, 0, 0, 0, 75, 99, 104, 141, 142, 143,
- 144, 149, 147, 117, 0, 115, 0, 120, 78, 72,
- 69, 0, 90, 0, 101, 103, 126, 129, 0, 0,
- 63, 62, 0, 150, 153, 0, 119, 89, 0, 95,
- 0, 130, 131, 128, 0, 0, 0, 151, 154, 0,
- 113, 91, 0, 97, 0, 0, 148, 0, 0, 155,
- 0, 0, 132, 0, 0, 0, 92, 121, 138, 0,
- 0, 156, 93, 94, 96, 133, 0, 152, 0, 0,
- 0
+/* YYRHS -- A `-1'-separated list of the rules' RHS. */
+static const short int yyrhs[] =
+{
+ 105, 0, -1, 167, 97, -1, 110, -1, 111, 97,
+ -1, 142, 97, -1, 143, 97, -1, 141, 97, -1,
+ 144, 97, -1, 137, 97, -1, 124, 97, -1, 126,
+ 97, -1, 136, 97, -1, 134, 97, -1, 135, 97,
+ -1, 131, 97, -1, 132, 97, -1, 145, 97, -1,
+ 147, 97, -1, 146, 97, -1, 158, 97, -1, 159,
+ 97, -1, 153, 97, -1, 157, 97, -1, 105, -1,
+ 106, 105, -1, 7, -1, 108, 98, 115, 99, -1,
+ 3, -1, 4, -1, 5, -1, 6, -1, 65, -1,
+ 107, 92, 107, -1, 107, 91, 107, -1, 107, 93,
+ 107, -1, 107, 94, 107, -1, 91, 107, -1, 98,
+ 107, 99, -1, 107, 88, 107, -1, 107, 89, 107,
+ -1, 107, 90, 107, -1, 107, 11, 107, -1, 107,
+ 12, 107, -1, 107, 13, 107, -1, 107, 8, 107,
+ -1, 107, 9, 107, -1, 10, 107, -1, 7, 96,
+ 69, -1, 65, 96, 69, -1, 70, -1, 71, -1,
+ 72, -1, 73, -1, 74, -1, 76, -1, 77, -1,
+ 78, -1, 79, -1, 82, -1, 83, -1, -1, 100,
+ -1, 109, 101, 100, -1, 102, 7, 98, 109, 99,
+ 103, -1, 112, 98, 115, 99, -1, 75, -1, 80,
+ -1, 81, -1, 7, -1, 113, 101, 7, -1, -1,
+ 7, -1, 114, 101, 7, -1, -1, 107, -1, 115,
+ 101, 107, -1, 107, -1, 35, 98, 93, 99, -1,
+ 35, 98, 36, 7, 99, -1, 34, 98, 107, 99,
+ -1, -1, 116, -1, 117, 101, 116, -1, 93, -1,
+ 117, 48, 114, -1, 117, -1, -1, 38, 107, -1,
+ -1, 39, 50, -1, -1, 41, 42, -1, -1, 45,
+ -1, 46, -1, -1, 43, 44, 7, 122, -1, 33,
+ 118, 37, 113, 119, 120, 121, 123, -1, 47, 48,
+ 7, -1, 125, 49, 98, 115, 99, -1, 125, 124,
+ -1, 7, 88, 107, -1, 127, -1, 128, 101, 127,
+ -1, 38, 53, 54, 7, -1, 50, 7, 51, 128,
+ -1, 130, 119, -1, 130, 129, -1, 52, 37, 7,
+ -1, 133, 119, -1, 133, 129, -1, 84, 124, -1,
+ 7, 62, 107, -1, 29, 107, 27, 106, -1, 138,
+ -1, 139, 138, -1, -1, 28, 106, -1, 139, -1,
+ 26, 107, 27, 106, 140, 25, 26, -1, 31, 107,
+ 30, 106, 25, 30, -1, 39, 7, 15, 107, 40,
+ 107, 30, 106, 25, 30, -1, 32, -1, 66, 7,
+ -1, 68, 7, -1, 67, 7, 48, 114, -1, 7,
+ 160, 150, 151, -1, 148, -1, 149, 101, 148, -1,
+ -1, 98, 3, 99, -1, -1, 10, 6, -1, -1,
+ 60, -1, 55, 56, 7, 98, 149, 99, 152, -1,
+ 7, -1, 154, 101, 7, -1, -1, 58, -1, -1,
+ 59, -1, 55, 155, 156, 57, 7, 61, 7, 98,
+ 154, 99, -1, 85, 87, -1, 86, 87, -1, 19,
+ -1, 20, -1, 22, -1, 17, -1, 18, -1, 7,
+ 15, 160, -1, 7, 16, 160, -1, -1, 161, -1,
+ 162, 101, 161, -1, 7, 160, 97, -1, -1, 163,
+ -1, 164, 163, -1, 63, 64, 7, 23, 124, 97,
+ -1, -1, 165, -1, 166, 165, -1, 14, 7, 98,
+ 162, 99, 23, 164, 166, 24, 106, 25, -1
};
-static const short yydefgoto[] = { 175,
- 176, 159, 71, 202, 22, 23, 24, 193, 190, 160,
- 77, 78, 79, 101, 253, 270, 305, 284, 25, 26,
- 27, 196, 197, 102, 28, 29, 30, 31, 32, 33,
- 34, 35, 214, 215, 216, 36, 37, 38, 39, 40,
- 41, 42, 230, 231, 273, 43, 294, 86, 156, 44,
- 45, 46, 240, 165, 166, 264, 265, 279, 280, 47
+/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
+static const unsigned short int yyrline[] =
+{
+ 0, 131, 131, 132, 133, 134, 135, 136, 137, 138,
+ 139, 140, 141, 142, 143, 144, 145, 146, 147, 148,
+ 149, 150, 151, 152, 156, 157, 162, 163, 165, 166,
+ 167, 168, 169, 170, 171, 172, 173, 174, 175, 176,
+ 177, 178, 179, 180, 181, 182, 183, 184, 185, 187,
+ 192, 193, 194, 195, 197, 198, 199, 200, 201, 202,
+ 203, 206, 208, 209, 213, 218, 223, 224, 225, 229,
+ 230, 235, 236, 237, 242, 243, 244, 248, 249, 254,
+ 260, 267, 268, 269, 274, 276, 278, 282, 283, 287,
+ 288, 293, 294, 299, 300, 301, 305, 306, 311, 321,
+ 326, 328, 333, 337, 338, 343, 349, 356, 361, 366,
+ 372, 377, 382, 387, 392, 398, 399, 404, 405, 407,
+ 411, 418, 424, 432, 436, 442, 448, 453, 458, 459,
+ 464, 465, 470, 471, 477, 478, 484, 490, 491, 496,
+ 497, 501, 502, 506, 514, 519, 524, 525, 526, 527,
+ 528, 532, 535, 541, 542, 543, 548, 552, 554, 555,
+ 559, 564, 566, 567, 571
};
+#endif
-static const short yypact[] = { 443,
- -36, 39, 479, 479,-32768, 7, 45, 10, 54, 28,
- -28, 57, 59, 66,-32768,-32768,-32768, 49, 12, 15,
- 88,-32768, 16, 6, 21, 3, 22, 84, 26, 27,
- 84, 29, 30, 31, 33, 47, 48, 51, 53, 56,
- 58, 60, 62, 64, 65, 67, 68, 479, 71,-32768,
--32768,-32768,-32768, 70, 479, 75,-32768,-32768,-32768,-32768,
--32768,-32768,-32768,-32768,-32768,-32768,-32768, 479, 479, 293,
- 74, 502, 76, 77,-32768, 356,-32768, -25, 117, 108,
- 147, 107, 154, 164,-32768, 122,-32768, 128,-32768,-32768,
--32768,-32768, 87,-32768, 479,-32768, 90,-32768,-32768, 38,
--32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
--32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
--32768,-32768, 356, 177, 120, 550, 131, 176, 234, 479,
- 479, 479, 479, 479, 443, 479, 479, 479, 479, 479,
- 479, 479, 479, 443, 479, -26, 188, 187, 193, 479,
--32768, 195,-32768, 109,-32768, 152, 188, 110, 356, -70,
- 479, 157, 356, 20,-32768, -67,-32768,-32768,-32768, 550,
- 550, 2, 2, 356,-32768, 151, 2, 2, 2, -6,
- -6, 176, 176, -66, 263, 490, 199, 113,-32768, 114,
--32768,-32768, -30, 520, 126,-32768, 115, 211, 214, 114,
--32768, -48,-32768, 479, -44, 216, 5, 5, 206, 177,
- 443, 479,-32768,-32768, 201, 208,-32768, 204,-32768, 139,
--32768, 230, 479, 231, 202, 479, 479, 195, 5,-32768,
- -40, 181, 140, 150, 356,-32768,-32768,-32768,-32768,-32768,
--32768, 242,-32768, 443, 527,-32768, 228,-32768,-32768,-32768,
--32768, 205, 215, 558, 356,-32768,-32768, 207, 211, 253,
--32768,-32768, 5,-32768, 11, 443,-32768,-32768, 226, 232,
- 443,-32768,-32768,-32768, 173, 179, 209,-32768,-32768, -3,
- 443,-32768, 233,-32768, 325, 265,-32768, 271, 443,-32768,
- 272, 252,-32768, -37, 261, 387, 61,-32768,-32768, 281,
- 49,-32768,-32768,-32768,-32768,-32768, 194,-32768, 290, 291,
--32768
+#if YYDEBUG || YYERROR_VERBOSE
+/* YYTNME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
+ First, the terminals, then, starting at YYNTOKENS, nonterminals. */
+static const char *const yytname[] =
+{
+ "$end", "error", "$undefined", "PARS_INT_LIT", "PARS_FLOAT_LIT",
+ "PARS_STR_LIT", "PARS_NULL_LIT", "PARS_ID_TOKEN", "PARS_AND_TOKEN",
+ "PARS_OR_TOKEN", "PARS_NOT_TOKEN", "PARS_GE_TOKEN", "PARS_LE_TOKEN",
+ "PARS_NE_TOKEN", "PARS_PROCEDURE_TOKEN", "PARS_IN_TOKEN",
+ "PARS_OUT_TOKEN", "PARS_BINARY_TOKEN", "PARS_BLOB_TOKEN",
+ "PARS_INT_TOKEN", "PARS_INTEGER_TOKEN", "PARS_FLOAT_TOKEN",
+ "PARS_CHAR_TOKEN", "PARS_IS_TOKEN", "PARS_BEGIN_TOKEN", "PARS_END_TOKEN",
+ "PARS_IF_TOKEN", "PARS_THEN_TOKEN", "PARS_ELSE_TOKEN",
+ "PARS_ELSIF_TOKEN", "PARS_LOOP_TOKEN", "PARS_WHILE_TOKEN",
+ "PARS_RETURN_TOKEN", "PARS_SELECT_TOKEN", "PARS_SUM_TOKEN",
+ "PARS_COUNT_TOKEN", "PARS_DISTINCT_TOKEN", "PARS_FROM_TOKEN",
+ "PARS_WHERE_TOKEN", "PARS_FOR_TOKEN", "PARS_DDOT_TOKEN",
+ "PARS_CONSISTENT_TOKEN", "PARS_READ_TOKEN", "PARS_ORDER_TOKEN",
+ "PARS_BY_TOKEN", "PARS_ASC_TOKEN", "PARS_DESC_TOKEN",
+ "PARS_INSERT_TOKEN", "PARS_INTO_TOKEN", "PARS_VALUES_TOKEN",
+ "PARS_UPDATE_TOKEN", "PARS_SET_TOKEN", "PARS_DELETE_TOKEN",
+ "PARS_CURRENT_TOKEN", "PARS_OF_TOKEN", "PARS_CREATE_TOKEN",
+ "PARS_TABLE_TOKEN", "PARS_INDEX_TOKEN", "PARS_UNIQUE_TOKEN",
+ "PARS_CLUSTERED_TOKEN", "PARS_DOES_NOT_FIT_IN_MEM_TOKEN",
+ "PARS_ON_TOKEN", "PARS_ASSIGN_TOKEN", "PARS_DECLARE_TOKEN",
+ "PARS_CURSOR_TOKEN", "PARS_SQL_TOKEN", "PARS_OPEN_TOKEN",
+ "PARS_FETCH_TOKEN", "PARS_CLOSE_TOKEN", "PARS_NOTFOUND_TOKEN",
+ "PARS_TO_CHAR_TOKEN", "PARS_TO_NUMBER_TOKEN", "PARS_TO_BINARY_TOKEN",
+ "PARS_BINARY_TO_NUMBER_TOKEN", "PARS_SUBSTR_TOKEN", "PARS_REPLSTR_TOKEN",
+ "PARS_CONCAT_TOKEN", "PARS_INSTR_TOKEN", "PARS_LENGTH_TOKEN",
+ "PARS_SYSDATE_TOKEN", "PARS_PRINTF_TOKEN", "PARS_ASSERT_TOKEN",
+ "PARS_RND_TOKEN", "PARS_RND_STR_TOKEN", "PARS_ROW_PRINTF_TOKEN",
+ "PARS_COMMIT_TOKEN", "PARS_ROLLBACK_TOKEN", "PARS_WORK_TOKEN", "'='",
+ "'<'", "'>'", "'-'", "'+'", "'*'", "'/'", "NEG", "'%'", "';'", "'('",
+ "')'", "'?'", "','", "'{'", "'}'", "$accept", "statement",
+ "statement_list", "exp", "function_name", "question_mark_list",
+ "stored_procedure_call", "predefined_procedure_call",
+ "predefined_procedure_name", "table_list", "variable_list", "exp_list",
+ "select_item", "select_item_list", "select_list", "search_condition",
+ "for_update_clause", "consistent_read_clause", "order_direction",
+ "order_by_clause", "select_statement", "insert_statement_start",
+ "insert_statement", "column_assignment", "column_assignment_list",
+ "cursor_positioned", "update_statement_start",
+ "update_statement_searched", "update_statement_positioned",
+ "delete_statement_start", "delete_statement_searched",
+ "delete_statement_positioned", "row_printf_statement",
+ "assignment_statement", "elsif_element", "elsif_list", "else_part",
+ "if_statement", "while_statement", "for_statement", "return_statement",
+ "open_cursor_statement", "close_cursor_statement", "fetch_statement",
+ "column_def", "column_def_list", "opt_column_len", "opt_not_null",
+ "not_fit_in_memory", "create_table", "column_list", "unique_def",
+ "clustered_def", "create_index", "commit_statement",
+ "rollback_statement", "type_name", "parameter_declaration",
+ "parameter_declaration_list", "variable_declaration",
+ "variable_declaration_list", "cursor_declaration", "declaration_list",
+ "procedure_definition", 0
};
+#endif
-static const short yypgoto[] = { 0,
- -121, -1,-32768,-32768,-32768,-32768,-32768,-32768, 138, -123,
- 149,-32768,-32768, -27,-32768,-32768,-32768,-32768, -17,-32768,
--32768, 79,-32768, 267,-32768,-32768,-32768,-32768,-32768,-32768,
--32768,-32768, 94,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
--32768,-32768, 40,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
--32768,-32768, -192, 93,-32768, 50,-32768, 32,-32768,-32768
+# ifdef YYPRINT
+/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
+ token YYLEX-NUM. */
+static const unsigned short int yytoknum[] =
+{
+ 0, 256, 257, 258, 259, 260, 261, 262, 263, 264,
+ 265, 266, 267, 268, 269, 270, 271, 272, 273, 274,
+ 275, 276, 277, 278, 279, 280, 281, 282, 283, 284,
+ 285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
+ 295, 296, 297, 298, 299, 300, 301, 302, 303, 304,
+ 305, 306, 307, 308, 309, 310, 311, 312, 313, 314,
+ 315, 316, 317, 318, 319, 320, 321, 322, 323, 324,
+ 325, 326, 327, 328, 329, 330, 331, 332, 333, 334,
+ 335, 336, 337, 338, 339, 340, 341, 342, 61, 60,
+ 62, 45, 43, 42, 47, 343, 37, 59, 40, 41,
+ 63, 44, 123, 125
};
+# endif
+/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
+static const unsigned char yyr1[] =
+{
+ 0, 104, 105, 105, 105, 105, 105, 105, 105, 105,
+ 105, 105, 105, 105, 105, 105, 105, 105, 105, 105,
+ 105, 105, 105, 105, 106, 106, 107, 107, 107, 107,
+ 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
+ 107, 107, 107, 107, 107, 107, 107, 107, 107, 107,
+ 108, 108, 108, 108, 108, 108, 108, 108, 108, 108,
+ 108, 109, 109, 109, 110, 111, 112, 112, 112, 113,
+ 113, 114, 114, 114, 115, 115, 115, 116, 116, 116,
+ 116, 117, 117, 117, 118, 118, 118, 119, 119, 120,
+ 120, 121, 121, 122, 122, 122, 123, 123, 124, 125,
+ 126, 126, 127, 128, 128, 129, 130, 131, 132, 133,
+ 134, 135, 136, 137, 138, 139, 139, 140, 140, 140,
+ 141, 142, 143, 144, 145, 146, 147, 148, 149, 149,
+ 150, 150, 151, 151, 152, 152, 153, 154, 154, 155,
+ 155, 156, 156, 157, 158, 159, 160, 160, 160, 160,
+ 160, 161, 161, 162, 162, 162, 163, 164, 164, 164,
+ 165, 166, 166, 166, 167
+};
-#define YYLAST 650
-
-
-static const short yytable[] = { 309,
- 90, 70, 72, 105, 76, 223, 134, 187, 98, 50,
- 51, 52, 53, 54, 134, 241, 55, 263, 289, 184,
- 147, 238, 185, 48, 239, 84, 203, 85, 204, 209,
- 217, 210, 204, 6, 207, 208, 257, 205, 73, 74,
- 50, 51, 52, 53, 54, 49, 123, 55, 233, 97,
- 234, 80, 236, 126, 204, 81, 258, 277, 259, 299,
- 82, 300, 83, 87, 188, 88, 128, 129, 224, 56,
- 276, 277, 89, 148, 57, 58, 59, 60, 61, 6,
- 62, 63, 64, 65, 141, 142, 66, 67, 162, 244,
- 139, 140, 141, 142, 93, 68, 91, 75, 163, 92,
- 56, 95, 69, 303, 304, 57, 58, 59, 60, 61,
- 94, 62, 63, 64, 65, 96, 99, 66, 67, 100,
- 103, 104, 150, 107, 108, 109, 68, 110, 170, 171,
- 172, 173, 174, 69, 177, 178, 179, 180, 181, 182,
- 183, 111, 112, 186, 281, 113, 76, 114, 194, 285,
- 115, 149, 116, 151, 117, 152, 118, 1, 119, 120,
- 153, 121, 122, 125, 2, 225, 124, 296, 127, 143,
- 154, 145, 146, 157, 3, 213, 211, 212, 155, 4,
- 5, 6, 158, 164, 213, 161, 167, 7, 134, 50,
- 51, 52, 53, 54, 189, 8, 55, 168, 9, 192,
- 10, 195, 235, 11, 198, 220, 199, 201, 206, 221,
- 245, 227, 222, 228, 12, 13, 14, 229, 73, 74,
- 232, 163, 237, 15, 254, 255, 242, 212, 16, 17,
- 247, 248, 18, 19, 20, 249, 250, 251, 252, 260,
- 261, 130, 131, 213, 132, 133, 134, 262, 263, 56,
- 21, 267, 268, 269, 57, 58, 59, 60, 61, 275,
- 62, 63, 64, 65, 272, 282, 66, 67, 286, 1,
- 288, 293, 283, 287, 291, 68, 2, 295, 297, 298,
- 213, 301, 69, 307, 213, 218, 3, 306, 308, 310,
- 311, 4, 5, 6, 200, 213, 191, 106, 274, 7,
- 130, 131, 243, 132, 133, 134, 256, 8, 246, 0,
- 9, 290, 10, 0, 278, 11, 0, 135, 0, 136,
- 137, 138, 139, 140, 141, 142, 12, 13, 14, 0,
- 169, 1, 0, 0, 0, 15, 0, 0, 2, 0,
- 16, 17, 0, 0, 18, 19, 20, 292, 3, 0,
- 0, 0, 0, 4, 5, 6, 0, 0, 0, 0,
- 0, 7, 21, 130, 131, 0, 132, 133, 134, 8,
- 0, 0, 9, 0, 10, 0, 0, 11, 136, 137,
- 138, 139, 140, 141, 142, 0, 0, 0, 12, 13,
- 14, 0, 0, 1, 0, 0, 0, 15, 0, 0,
- 2, 0, 16, 17, 0, 0, 18, 19, 20, 302,
- 3, 0, 0, 0, 0, 4, 5, 6, 0, 0,
- 0, 0, 0, 7, 21, 0, 0, 0, 0, 0,
- 0, 8, 0, 0, 9, 0, 10, 0, 0, 11,
- 0, 136, 137, 138, 139, 140, 141, 142, 0, 1,
- 12, 13, 14, 0, 0, 0, 2, 0, 0, 15,
- 0, 0, 0, 0, 16, 17, 3, 0, 18, 19,
- 20, 4, 5, 6, 0, 0, 0, 0, 0, 7,
- 0, 50, 51, 52, 53, 54, 21, 8, 55, 0,
- 9, 0, 10, 0, 0, 11, 0, 130, 131, 0,
- 132, 133, 134, 0, 0, 0, 12, 13, 14, 130,
- 131, 0, 132, 133, 134, 15, 0, 0, 0, 0,
- 16, 17, 0, 0, 18, 19, 20, 130, 131, 144,
- 132, 133, 134, 0, 130, 131, 0, 132, 133, 134,
- 0, 56, 21, 0, 0, 0, 57, 58, 59, 60,
- 61, 266, 62, 63, 64, 65, 0, 226, 66, 67,
- 132, 133, 134, 0, 0, 130, 131, 68, 132, 133,
- 134, 0, 0, 0, 69, 136, 137, 138, 139, 140,
- 141, 142, 0, 0, 0, 271, 219, 136, 137, 138,
- 139, 140, 141, 142, 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 136, 137, 138, 139, 140,
- 141, 142, 136, 137, 138, 139, 140, 141, 142, 0,
- 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
- 0, 0, 0, 0, 0, 136, 137, 138, 139, 140,
- 141, 142, 0, 136, 137, 138, 139, 140, 141, 142
+/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
+static const unsigned char yyr2[] =
+{
+ 0, 2, 2, 1, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+ 2, 2, 2, 2, 1, 2, 1, 4, 1, 1,
+ 1, 1, 1, 3, 3, 3, 3, 2, 3, 3,
+ 3, 3, 3, 3, 3, 3, 3, 2, 3, 3,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 0, 1, 3, 6, 4, 1, 1, 1, 1,
+ 3, 0, 1, 3, 0, 1, 3, 1, 4, 5,
+ 4, 0, 1, 3, 1, 3, 1, 0, 2, 0,
+ 2, 0, 2, 0, 1, 1, 0, 4, 8, 3,
+ 5, 2, 3, 1, 3, 4, 4, 2, 2, 3,
+ 2, 2, 2, 3, 4, 1, 2, 0, 2, 1,
+ 7, 6, 10, 1, 2, 2, 4, 4, 1, 3,
+ 0, 3, 0, 2, 0, 1, 7, 1, 3, 0,
+ 1, 0, 1, 10, 2, 2, 1, 1, 1, 1,
+ 1, 3, 3, 0, 1, 3, 3, 0, 1, 2,
+ 6, 0, 1, 2, 11
};
-static const short yycheck[] = { 0,
- 18, 3, 4, 31, 6, 36, 13, 34, 26, 3,
- 4, 5, 6, 7, 13, 208, 10, 7, 22, 143,
- 46, 17, 144, 60, 20, 54, 97, 56, 99, 97,
- 97, 99, 99, 31, 15, 16, 229, 161, 32, 33,
- 3, 4, 5, 6, 7, 7, 48, 10, 97, 47,
- 99, 7, 97, 55, 99, 46, 97, 61, 99, 97,
- 7, 99, 35, 7, 91, 7, 68, 69, 99, 63,
- 263, 61, 7, 99, 68, 69, 70, 71, 72, 31,
- 74, 75, 76, 77, 91, 92, 80, 81, 51, 211,
- 89, 90, 91, 92, 7, 89, 85, 91, 100, 85,
- 63, 96, 96, 43, 44, 68, 69, 70, 71, 72,
- 95, 74, 75, 76, 77, 95, 95, 80, 81, 36,
- 95, 95, 15, 95, 95, 95, 89, 95, 130, 131,
- 132, 133, 134, 96, 136, 137, 138, 139, 140, 141,
- 142, 95, 95, 145, 266, 95, 148, 95, 150, 271,
- 95, 35, 95, 7, 95, 49, 95, 7, 95, 95,
- 7, 95, 95, 94, 14, 193, 96, 289, 94, 96,
- 7, 96, 96, 46, 24, 176, 26, 27, 57, 29,
- 30, 31, 96, 7, 185, 96, 67, 37, 13, 3,
- 4, 5, 6, 7, 7, 45, 10, 67, 48, 7,
- 50, 7, 204, 53, 96, 7, 55, 98, 52, 97,
- 212, 86, 99, 99, 64, 65, 66, 7, 32, 33,
- 7, 223, 7, 73, 226, 227, 21, 27, 78, 79,
- 23, 28, 82, 83, 84, 97, 7, 7, 37, 59,
- 101, 8, 9, 244, 11, 12, 13, 98, 7, 63,
- 100, 24, 48, 39, 68, 69, 70, 71, 72, 7,
- 74, 75, 76, 77, 58, 40, 80, 81, 96, 7,
- 62, 7, 41, 95, 42, 89, 14, 7, 7, 28,
- 281, 21, 96, 301, 285, 23, 24, 7, 95, 0,
- 0, 29, 30, 31, 157, 296, 148, 31, 259, 37,
- 8, 9, 210, 11, 12, 13, 228, 45, 215, -1,
- 48, 280, 50, -1, 265, 53, -1, 25, -1, 86,
- 87, 88, 89, 90, 91, 92, 64, 65, 66, -1,
- 97, 7, -1, -1, -1, 73, -1, -1, 14, -1,
- 78, 79, -1, -1, 82, 83, 84, 23, 24, -1,
- -1, -1, -1, 29, 30, 31, -1, -1, -1, -1,
- -1, 37, 100, 8, 9, -1, 11, 12, 13, 45,
- -1, -1, 48, -1, 50, -1, -1, 53, 86, 87,
- 88, 89, 90, 91, 92, -1, -1, -1, 64, 65,
- 66, -1, -1, 7, -1, -1, -1, 73, -1, -1,
- 14, -1, 78, 79, -1, -1, 82, 83, 84, 23,
- 24, -1, -1, -1, -1, 29, 30, 31, -1, -1,
- -1, -1, -1, 37, 100, -1, -1, -1, -1, -1,
- -1, 45, -1, -1, 48, -1, 50, -1, -1, 53,
- -1, 86, 87, 88, 89, 90, 91, 92, -1, 7,
- 64, 65, 66, -1, -1, -1, 14, -1, -1, 73,
- -1, -1, -1, -1, 78, 79, 24, -1, 82, 83,
- 84, 29, 30, 31, -1, -1, -1, -1, -1, 37,
- -1, 3, 4, 5, 6, 7, 100, 45, 10, -1,
- 48, -1, 50, -1, -1, 53, -1, 8, 9, -1,
- 11, 12, 13, -1, -1, -1, 64, 65, 66, 8,
- 9, -1, 11, 12, 13, 73, -1, -1, -1, -1,
- 78, 79, -1, -1, 82, 83, 84, 8, 9, 28,
- 11, 12, 13, -1, 8, 9, -1, 11, 12, 13,
- -1, 63, 100, -1, -1, -1, 68, 69, 70, 71,
- 72, 25, 74, 75, 76, 77, -1, 38, 80, 81,
- 11, 12, 13, -1, -1, 8, 9, 89, 11, 12,
- 13, -1, -1, -1, 96, 86, 87, 88, 89, 90,
- 91, 92, -1, -1, -1, 28, 97, 86, 87, 88,
- 89, 90, 91, 92, -1, -1, -1, -1, -1, -1,
- -1, -1, -1, -1, -1, 86, 87, 88, 89, 90,
- 91, 92, 86, 87, 88, 89, 90, 91, 92, -1,
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
- -1, -1, -1, -1, -1, 86, 87, 88, 89, 90,
- 91, 92, -1, 86, 87, 88, 89, 90, 91, 92
+/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
+ STATE-NUM when YYTABLE doesn't specify something else to do. Zero
+ means the default is an error. */
+static const unsigned char yydefact[] =
+{
+ 0, 0, 0, 0, 0, 123, 81, 0, 0, 0,
+ 0, 139, 0, 0, 0, 66, 67, 68, 0, 0,
+ 0, 0, 0, 3, 0, 0, 0, 0, 0, 87,
+ 0, 0, 87, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 28, 29, 30, 31, 26, 0, 32, 50, 51,
+ 52, 53, 54, 55, 56, 57, 58, 59, 60, 0,
+ 0, 0, 0, 0, 0, 0, 84, 77, 82, 86,
+ 0, 0, 0, 0, 0, 0, 140, 141, 124, 0,
+ 125, 112, 144, 145, 0, 1, 4, 74, 10, 0,
+ 101, 11, 0, 107, 108, 15, 16, 110, 111, 13,
+ 14, 12, 9, 7, 5, 6, 8, 17, 19, 18,
+ 22, 23, 20, 21, 2, 113, 153, 0, 47, 0,
+ 37, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 74, 0, 0, 0, 71,
+ 0, 0, 0, 99, 0, 109, 0, 142, 0, 71,
+ 61, 75, 0, 74, 0, 88, 0, 154, 0, 48,
+ 49, 38, 45, 46, 42, 43, 44, 24, 117, 39,
+ 40, 41, 34, 33, 35, 36, 0, 0, 0, 0,
+ 0, 72, 85, 83, 69, 87, 0, 0, 103, 106,
+ 0, 0, 126, 62, 0, 65, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 25, 115, 119, 0, 27,
+ 0, 80, 0, 78, 0, 0, 0, 89, 0, 0,
+ 0, 0, 128, 0, 0, 0, 0, 76, 100, 105,
+ 149, 150, 146, 147, 148, 151, 152, 157, 155, 118,
+ 0, 116, 0, 121, 79, 73, 70, 0, 91, 0,
+ 102, 104, 130, 134, 0, 0, 64, 63, 0, 158,
+ 161, 0, 120, 90, 0, 96, 0, 0, 132, 135,
+ 136, 129, 0, 0, 0, 159, 162, 0, 114, 92,
+ 0, 98, 0, 0, 0, 127, 0, 156, 0, 0,
+ 163, 0, 0, 131, 133, 137, 0, 0, 0, 93,
+ 122, 143, 0, 0, 164, 94, 95, 97, 138, 0,
+ 160
};
-/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
-#line 3 "/usr/share/bison.simple"
-/* This file comes from bison-1.28. */
-/* Skeleton output parser for bison,
- Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
+/* YYDEFGOTO[NTERM-NUM]. */
+static const short int yydefgoto[] =
+{
+ -1, 177, 178, 161, 72, 204, 23, 24, 25, 195,
+ 192, 162, 78, 79, 80, 103, 258, 275, 317, 291,
+ 26, 27, 28, 198, 199, 104, 29, 30, 31, 32,
+ 33, 34, 35, 36, 216, 217, 218, 37, 38, 39,
+ 40, 41, 42, 43, 232, 233, 278, 295, 280, 44,
+ 306, 87, 158, 45, 46, 47, 245, 167, 168, 269,
+ 270, 286, 287, 48
+};
- 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, or (at your option)
- any later version.
+/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
+ STATE-NUM. */
+#define YYPACT_NINF -205
+static const short int yypact[] =
+{
+ 454, -48, 30, 521, 521, -205, 12, 42, -18, 46,
+ -4, -33, 67, 69, 71, -205, -205, -205, 47, -8,
+ -6, 85, 93, -205, 1, -2, 2, -20, 3, 59,
+ 5, 7, 59, 24, 27, 28, 31, 32, 33, 39,
+ 50, 51, 55, 56, 57, 58, 60, 62, 63, 521,
+ 22, -205, -205, -205, -205, 48, 521, 65, -205, -205,
+ -205, -205, -205, -205, -205, -205, -205, -205, -205, 521,
+ 521, 252, 64, 576, 66, 68, -205, 640, -205, -40,
+ 86, 111, 120, 105, 156, 161, -205, 110, -205, 122,
+ -205, -205, -205, -205, 73, -205, -205, 521, -205, 74,
+ -205, -205, 492, -205, -205, -205, -205, -205, -205, -205,
+ -205, -205, -205, -205, -205, -205, -205, -205, -205, -205,
+ -205, -205, -205, -205, -205, 640, 167, 106, 309, 107,
+ 168, 23, 521, 521, 521, 521, 521, 454, 521, 521,
+ 521, 521, 521, 521, 521, 521, 454, 521, -27, 178,
+ 204, 179, 521, -205, 181, -205, 91, -205, 134, 178,
+ 92, 640, -75, 521, 139, 640, 29, -205, -59, -205,
+ -205, -205, 309, 309, 15, 15, 640, -205, 151, 15,
+ 15, 15, 25, 25, 168, 168, -58, 284, 535, 187,
+ 96, -205, 95, -205, -205, -31, 568, 109, -205, 98,
+ 193, 195, 95, -205, -49, -205, 521, -45, 197, 40,
+ 40, 189, 167, 454, 521, -205, -205, 186, 191, -205,
+ 190, -205, 123, -205, 214, 521, 216, 194, 521, 521,
+ 181, 40, -205, -36, 164, 126, 130, 640, -205, -205,
+ -205, -205, -205, -205, -205, -205, -205, 227, -205, 454,
+ 605, -205, 215, -205, -205, -205, -205, 192, 199, 633,
+ 640, -205, 145, 184, 193, 238, -205, -205, 40, -205,
+ 4, 454, -205, -205, 205, 203, 454, 245, 240, -205,
+ -205, -205, 153, 155, 198, -205, -205, -12, 454, -205,
+ 210, -205, 341, 157, 249, -205, 250, -205, 251, 454,
+ -205, 259, 229, -205, -205, -205, -26, 244, 398, 26,
+ -205, -205, 261, 47, -205, -205, -205, -205, -205, 173,
+ -205
+};
- 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.
+/* YYPGOTO[NTERM-NUM]. */
+static const short int yypgoto[] =
+{
+ -205, 0, -126, -1, -205, -205, -205, -205, -205, -205,
+ 112, -124, 135, -205, -205, -28, -205, -205, -205, -205,
+ -17, -205, -205, 43, -205, 257, -205, -205, -205, -205,
+ -205, -205, -205, -205, 76, -205, -205, -205, -205, -205,
+ -205, -205, -205, -205, 8, -205, -205, -205, -205, -205,
+ -205, -205, -205, -205, -205, -205, -204, 72, -205, 20,
+ -205, 10, -205, -205
+};
- 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., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA. */
+/* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If
+ positive, shift that token. If negative, reduce the rule which
+ number is the opposite. If zero, do what YYDEFACT says.
+ If YYTABLE_NINF, syntax error. */
+#define YYTABLE_NINF -1
+static const unsigned short int yytable[] =
+{
+ 22, 91, 71, 73, 107, 77, 246, 225, 149, 189,
+ 100, 268, 299, 6, 49, 51, 52, 53, 54, 55,
+ 187, 186, 56, 85, 205, 86, 206, 262, 136, 99,
+ 82, 132, 133, 84, 134, 135, 136, 50, 136, 207,
+ 211, 219, 212, 206, 209, 210, 74, 75, 125, 81,
+ 235, 284, 236, 83, 238, 128, 206, 240, 241, 242,
+ 243, 150, 244, 263, 283, 264, 190, 284, 130, 131,
+ 226, 315, 316, 311, 88, 312, 89, 57, 90, 92,
+ 6, 93, 58, 59, 60, 61, 62, 249, 63, 64,
+ 65, 66, 94, 95, 67, 68, 97, 102, 96, 98,
+ 101, 165, 105, 69, 106, 76, 141, 142, 143, 144,
+ 70, 138, 139, 140, 141, 142, 143, 144, 143, 144,
+ 126, 109, 171, 151, 110, 111, 152, 153, 112, 113,
+ 114, 172, 173, 174, 175, 176, 115, 179, 180, 181,
+ 182, 183, 184, 185, 127, 288, 188, 116, 117, 77,
+ 292, 196, 118, 119, 120, 121, 154, 122, 1, 123,
+ 124, 129, 145, 155, 147, 2, 148, 227, 156, 157,
+ 159, 160, 163, 308, 166, 169, 170, 3, 215, 213,
+ 214, 136, 4, 5, 6, 191, 194, 215, 197, 200,
+ 7, 201, 203, 208, 222, 223, 224, 229, 8, 230,
+ 231, 9, 234, 10, 239, 237, 11, 51, 52, 53,
+ 54, 55, 247, 250, 56, 214, 252, 12, 13, 14,
+ 253, 255, 254, 256, 165, 265, 15, 259, 260, 266,
+ 267, 16, 17, 257, 268, 18, 19, 20, 74, 75,
+ 274, 272, 273, 277, 279, 282, 290, 289, 293, 215,
+ 294, 296, 297, 21, 301, 304, 303, 305, 307, 310,
+ 132, 133, 298, 134, 135, 136, 309, 313, 318, 57,
+ 320, 202, 281, 261, 58, 59, 60, 61, 62, 137,
+ 63, 64, 65, 66, 248, 193, 67, 68, 215, 108,
+ 285, 1, 215, 251, 0, 69, 319, 300, 2, 0,
+ 0, 0, 70, 0, 0, 0, 0, 0, 215, 220,
+ 3, 0, 0, 0, 0, 4, 5, 6, 0, 0,
+ 134, 135, 136, 7, 0, 0, 0, 0, 0, 0,
+ 0, 8, 0, 0, 9, 0, 10, 0, 0, 11,
+ 138, 139, 140, 141, 142, 143, 144, 0, 1, 0,
+ 12, 13, 14, 0, 0, 2, 0, 0, 0, 15,
+ 0, 0, 0, 0, 16, 17, 302, 3, 18, 19,
+ 20, 0, 4, 5, 6, 0, 0, 0, 0, 0,
+ 7, 0, 0, 0, 0, 0, 21, 0, 8, 0,
+ 0, 9, 0, 10, 0, 0, 11, 138, 139, 140,
+ 141, 142, 143, 144, 0, 1, 0, 12, 13, 14,
+ 0, 0, 2, 0, 0, 0, 15, 0, 0, 0,
+ 0, 16, 17, 314, 3, 18, 19, 20, 0, 4,
+ 5, 6, 0, 0, 0, 0, 0, 7, 0, 0,
+ 0, 0, 0, 21, 0, 8, 0, 0, 9, 0,
+ 10, 0, 0, 11, 0, 0, 0, 0, 0, 0,
+ 0, 1, 0, 0, 12, 13, 14, 0, 2, 0,
+ 0, 0, 0, 15, 0, 0, 0, 0, 16, 17,
+ 3, 0, 18, 19, 20, 4, 5, 6, 0, 0,
+ 0, 0, 0, 7, 0, 51, 52, 53, 54, 55,
+ 21, 8, 56, 0, 9, 0, 10, 0, 0, 11,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 12, 13, 14, 0, 51, 52, 53, 54, 55, 15,
+ 0, 56, 0, 0, 16, 17, 0, 0, 18, 19,
+ 20, 0, 0, 132, 133, 164, 134, 135, 136, 0,
+ 0, 0, 0, 0, 0, 0, 21, 57, 0, 0,
+ 0, 0, 58, 59, 60, 61, 62, 0, 63, 64,
+ 65, 66, 0, 0, 67, 68, 132, 133, 0, 134,
+ 135, 136, 0, 69, 132, 133, 57, 134, 135, 136,
+ 70, 58, 59, 60, 61, 62, 0, 63, 64, 65,
+ 66, 0, 0, 67, 68, 0, 146, 0, 228, 0,
+ 0, 0, 69, 132, 133, 0, 134, 135, 136, 70,
+ 0, 0, 0, 138, 139, 140, 141, 142, 143, 144,
+ 0, 0, 271, 0, 221, 0, 0, 0, 0, 0,
+ 0, 132, 133, 0, 134, 135, 136, 0, 132, 133,
+ 0, 134, 135, 136, 0, 0, 138, 139, 140, 141,
+ 142, 143, 144, 276, 138, 139, 140, 141, 142, 143,
+ 144, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 138, 139, 140, 141, 142, 143, 144,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+ 0, 138, 139, 140, 141, 142, 143, 144, 138, 139,
+ 140, 141, 142, 143, 144
+};
-/* As a special exception, when this file is copied by Bison into a
- Bison output file, you may use that output file without restriction.
- This special exception was added by the Free Software Foundation
- in version 1.24 of Bison. */
+static const short int yycheck[] =
+{
+ 0, 18, 3, 4, 32, 6, 210, 38, 48, 36,
+ 27, 7, 24, 33, 62, 3, 4, 5, 6, 7,
+ 146, 145, 10, 56, 99, 58, 101, 231, 13, 49,
+ 48, 8, 9, 37, 11, 12, 13, 7, 13, 163,
+ 99, 99, 101, 101, 15, 16, 34, 35, 49, 7,
+ 99, 63, 101, 7, 99, 56, 101, 17, 18, 19,
+ 20, 101, 22, 99, 268, 101, 93, 63, 69, 70,
+ 101, 45, 46, 99, 7, 101, 7, 65, 7, 87,
+ 33, 87, 70, 71, 72, 73, 74, 213, 76, 77,
+ 78, 79, 7, 0, 82, 83, 98, 38, 97, 97,
+ 97, 102, 97, 91, 97, 93, 91, 92, 93, 94,
+ 98, 88, 89, 90, 91, 92, 93, 94, 93, 94,
+ 98, 97, 99, 37, 97, 97, 15, 7, 97, 97,
+ 97, 132, 133, 134, 135, 136, 97, 138, 139, 140,
+ 141, 142, 143, 144, 96, 271, 147, 97, 97, 150,
+ 276, 152, 97, 97, 97, 97, 51, 97, 7, 97,
+ 97, 96, 98, 7, 98, 14, 98, 195, 7, 59,
+ 48, 98, 98, 299, 7, 69, 69, 26, 178, 28,
+ 29, 13, 31, 32, 33, 7, 7, 187, 7, 98,
+ 39, 57, 100, 54, 7, 99, 101, 88, 47, 101,
+ 7, 50, 7, 52, 7, 206, 55, 3, 4, 5,
+ 6, 7, 23, 214, 10, 29, 25, 66, 67, 68,
+ 30, 7, 99, 7, 225, 61, 75, 228, 229, 103,
+ 100, 80, 81, 39, 7, 84, 85, 86, 34, 35,
+ 41, 26, 50, 98, 60, 7, 43, 42, 3, 249,
+ 10, 98, 97, 102, 44, 6, 99, 7, 7, 30,
+ 8, 9, 64, 11, 12, 13, 7, 23, 7, 65,
+ 97, 159, 264, 230, 70, 71, 72, 73, 74, 27,
+ 76, 77, 78, 79, 212, 150, 82, 83, 288, 32,
+ 270, 7, 292, 217, -1, 91, 313, 287, 14, -1,
+ -1, -1, 98, -1, -1, -1, -1, -1, 308, 25,
+ 26, -1, -1, -1, -1, 31, 32, 33, -1, -1,
+ 11, 12, 13, 39, -1, -1, -1, -1, -1, -1,
+ -1, 47, -1, -1, 50, -1, 52, -1, -1, 55,
+ 88, 89, 90, 91, 92, 93, 94, -1, 7, -1,
+ 66, 67, 68, -1, -1, 14, -1, -1, -1, 75,
+ -1, -1, -1, -1, 80, 81, 25, 26, 84, 85,
+ 86, -1, 31, 32, 33, -1, -1, -1, -1, -1,
+ 39, -1, -1, -1, -1, -1, 102, -1, 47, -1,
+ -1, 50, -1, 52, -1, -1, 55, 88, 89, 90,
+ 91, 92, 93, 94, -1, 7, -1, 66, 67, 68,
+ -1, -1, 14, -1, -1, -1, 75, -1, -1, -1,
+ -1, 80, 81, 25, 26, 84, 85, 86, -1, 31,
+ 32, 33, -1, -1, -1, -1, -1, 39, -1, -1,
+ -1, -1, -1, 102, -1, 47, -1, -1, 50, -1,
+ 52, -1, -1, 55, -1, -1, -1, -1, -1, -1,
+ -1, 7, -1, -1, 66, 67, 68, -1, 14, -1,
+ -1, -1, -1, 75, -1, -1, -1, -1, 80, 81,
+ 26, -1, 84, 85, 86, 31, 32, 33, -1, -1,
+ -1, -1, -1, 39, -1, 3, 4, 5, 6, 7,
+ 102, 47, 10, -1, 50, -1, 52, -1, -1, 55,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ 66, 67, 68, -1, 3, 4, 5, 6, 7, 75,
+ -1, 10, -1, -1, 80, 81, -1, -1, 84, 85,
+ 86, -1, -1, 8, 9, 53, 11, 12, 13, -1,
+ -1, -1, -1, -1, -1, -1, 102, 65, -1, -1,
+ -1, -1, 70, 71, 72, 73, 74, -1, 76, 77,
+ 78, 79, -1, -1, 82, 83, 8, 9, -1, 11,
+ 12, 13, -1, 91, 8, 9, 65, 11, 12, 13,
+ 98, 70, 71, 72, 73, 74, -1, 76, 77, 78,
+ 79, -1, -1, 82, 83, -1, 30, -1, 40, -1,
+ -1, -1, 91, 8, 9, -1, 11, 12, 13, 98,
+ -1, -1, -1, 88, 89, 90, 91, 92, 93, 94,
+ -1, -1, 27, -1, 99, -1, -1, -1, -1, -1,
+ -1, 8, 9, -1, 11, 12, 13, -1, 8, 9,
+ -1, 11, 12, 13, -1, -1, 88, 89, 90, 91,
+ 92, 93, 94, 30, 88, 89, 90, 91, 92, 93,
+ 94, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, 88, 89, 90, 91, 92, 93, 94,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+ -1, 88, 89, 90, 91, 92, 93, 94, 88, 89,
+ 90, 91, 92, 93, 94
+};
-/* This is the parser code that is written into each bison parser
- when the %semantic_parser declaration is not specified in the grammar.
- It was written by Richard Stallman by simplifying the hairy parser
- used when %semantic_parser is specified. */
+/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
+ symbol of state STATE-NUM. */
+static const unsigned char yystos[] =
+{
+ 0, 7, 14, 26, 31, 32, 33, 39, 47, 50,
+ 52, 55, 66, 67, 68, 75, 80, 81, 84, 85,
+ 86, 102, 105, 110, 111, 112, 124, 125, 126, 130,
+ 131, 132, 133, 134, 135, 136, 137, 141, 142, 143,
+ 144, 145, 146, 147, 153, 157, 158, 159, 167, 62,
+ 7, 3, 4, 5, 6, 7, 10, 65, 70, 71,
+ 72, 73, 74, 76, 77, 78, 79, 82, 83, 91,
+ 98, 107, 108, 107, 34, 35, 93, 107, 116, 117,
+ 118, 7, 48, 7, 37, 56, 58, 155, 7, 7,
+ 7, 124, 87, 87, 7, 0, 97, 98, 97, 49,
+ 124, 97, 38, 119, 129, 97, 97, 119, 129, 97,
+ 97, 97, 97, 97, 97, 97, 97, 97, 97, 97,
+ 97, 97, 97, 97, 97, 107, 98, 96, 107, 96,
+ 107, 107, 8, 9, 11, 12, 13, 27, 88, 89,
+ 90, 91, 92, 93, 94, 98, 30, 98, 98, 48,
+ 101, 37, 15, 7, 51, 7, 7, 59, 156, 48,
+ 98, 107, 115, 98, 53, 107, 7, 161, 162, 69,
+ 69, 99, 107, 107, 107, 107, 107, 105, 106, 107,
+ 107, 107, 107, 107, 107, 107, 115, 106, 107, 36,
+ 93, 7, 114, 116, 7, 113, 107, 7, 127, 128,
+ 98, 57, 114, 100, 109, 99, 101, 115, 54, 15,
+ 16, 99, 101, 28, 29, 105, 138, 139, 140, 99,
+ 25, 99, 7, 99, 101, 38, 101, 119, 40, 88,
+ 101, 7, 148, 149, 7, 99, 101, 107, 99, 7,
+ 17, 18, 19, 20, 22, 160, 160, 23, 161, 106,
+ 107, 138, 25, 30, 99, 7, 7, 39, 120, 107,
+ 107, 127, 160, 99, 101, 61, 103, 100, 7, 163,
+ 164, 27, 26, 50, 41, 121, 30, 98, 150, 60,
+ 152, 148, 7, 160, 63, 163, 165, 166, 106, 42,
+ 43, 123, 106, 3, 10, 151, 98, 97, 64, 24,
+ 165, 44, 25, 99, 6, 7, 154, 7, 106, 7,
+ 30, 99, 101, 23, 25, 45, 46, 122, 7, 124,
+ 97
+};
-#ifndef YYPARSE_RETURN_TYPE
-#define YYPARSE_RETURN_TYPE int
+#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
+# define YYSIZE_T __SIZE_TYPE__
#endif
-
-
-#ifndef YYSTACK_USE_ALLOCA
-#ifdef alloca
-#define YYSTACK_USE_ALLOCA
-#else /* alloca not defined */
-#ifdef __GNUC__
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#else /* not GNU C. */
-#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
-#define YYSTACK_USE_ALLOCA
-#include <alloca.h>
-#else /* not sparc */
-/* We think this test detects Watcom and Microsoft C. */
-/* This used to test MSDOS, but that is a bad idea
- since that symbol is in the user namespace. */
-#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
-#if 0 /* No need for malloc.h, which pollutes the namespace;
- instead, just don't use alloca. */
-#include <malloc.h>
+#if ! defined (YYSIZE_T) && defined (size_t)
+# define YYSIZE_T size_t
#endif
-#else /* not MSDOS, or __TURBOC__ */
-#if defined(_AIX)
-/* I don't know what this was needed for, but it pollutes the namespace.
- So I turned it off. rms, 2 May 1997. */
-/* #include <malloc.h> */
- #pragma alloca
-#define YYSTACK_USE_ALLOCA
-#else /* not MSDOS, or __TURBOC__, or _AIX */
-#if 0
-#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
- and on HPUX 10. Eventually we can turn this on. */
-#define YYSTACK_USE_ALLOCA
-#define alloca __builtin_alloca
-#endif /* __hpux */
+#if ! defined (YYSIZE_T)
+# if defined (__STDC__) || defined (__cplusplus)
+# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
+# define YYSIZE_T size_t
+# endif
#endif
-#endif /* not _AIX */
-#endif /* not MSDOS, or __TURBOC__ */
-#endif /* not sparc */
-#endif /* not GNU C */
-#endif /* alloca not defined */
-#endif /* YYSTACK_USE_ALLOCA not defined */
-
-#ifdef YYSTACK_USE_ALLOCA
-#define YYSTACK_ALLOC alloca
-#else
-#define YYSTACK_ALLOC malloc
+#if ! defined (YYSIZE_T)
+# define YYSIZE_T unsigned int
#endif
-/* Note: there must be only one dollar sign in this file.
- It is replaced by the list of actions, each action
- as one case of the switch. */
-
#define yyerrok (yyerrstatus = 0)
#define yyclearin (yychar = YYEMPTY)
-#define YYEMPTY -2
+#define YYEMPTY (-2)
#define YYEOF 0
+
#define YYACCEPT goto yyacceptlab
-#define YYABORT goto yyabortlab
-#define YYERROR goto yyerrlab1
-/* Like YYERROR except do call yyerror.
- This remains here temporarily to ease the
- transition to the new meaning of YYERROR, for GCC.
+#define YYABORT goto yyabortlab
+#define YYERROR goto yyerrorlab
+
+
+/* Like YYERROR except do call yyerror. This remains here temporarily
+ to ease the transition to the new meaning of YYERROR, for GCC.
Once GCC version 2 has supplanted version 1, this can go. */
+
#define YYFAIL goto yyerrlab
+
#define YYRECOVERING() (!!yyerrstatus)
-#define YYBACKUP(token, value) \
+
+#define YYBACKUP(Token, Value) \
do \
if (yychar == YYEMPTY && yylen == 1) \
- { yychar = (token), yylval = (value); \
- yychar1 = YYTRANSLATE (yychar); \
+ { \
+ yychar = (Token); \
+ yylval = (Value); \
+ yytoken = YYTRANSLATE (yychar); \
YYPOPSTACK; \
goto yybackup; \
} \
else \
- { yyerror ("syntax error: cannot back up"); YYERROR; } \
+ { \
+ yyerror ("syntax error: cannot back up");\
+ YYERROR; \
+ } \
while (0)
#define YYTERROR 1
#define YYERRCODE 256
-#ifndef YYPURE
-#define YYLEX yylex()
-#endif
+/* YYLLOC_DEFAULT -- Compute the default location (before the actions
+ are run). */
-#ifdef YYPURE
-#ifdef YYLSP_NEEDED
-#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
-#else
-#define YYLEX yylex(&yylval, &yylloc)
+#ifndef YYLLOC_DEFAULT
+# define YYLLOC_DEFAULT(Current, Rhs, N) \
+ ((Current).first_line = (Rhs)[1].first_line, \
+ (Current).first_column = (Rhs)[1].first_column, \
+ (Current).last_line = (Rhs)[N].last_line, \
+ (Current).last_column = (Rhs)[N].last_column)
#endif
-#else /* not YYLSP_NEEDED */
+
+/* YYLEX -- calling `yylex' with the right arguments. */
+
#ifdef YYLEX_PARAM
-#define YYLEX yylex(&yylval, YYLEX_PARAM)
+# define YYLEX yylex (YYLEX_PARAM)
#else
-#define YYLEX yylex(&yylval)
+# define YYLEX yylex ()
#endif
-#endif /* not YYLSP_NEEDED */
-#endif
-
-/* If nonreentrant, generate the variables here */
-#ifndef YYPURE
+/* Enable debugging if requested. */
+#if YYDEBUG
+
+# ifndef YYFPRINTF
+# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
+# define YYFPRINTF fprintf
+# endif
+
+# define YYDPRINTF(Args) \
+do { \
+ if (yydebug) \
+ YYFPRINTF Args; \
+} while (0)
+
+# define YYDSYMPRINT(Args) \
+do { \
+ if (yydebug) \
+ yysymprint Args; \
+} while (0)
+
+# define YYDSYMPRINTF(Title, Token, Value, Location) \
+do { \
+ if (yydebug) \
+ { \
+ YYFPRINTF (stderr, "%s ", Title); \
+ yysymprint (stderr, \
+ Token, Value); \
+ YYFPRINTF (stderr, "\n"); \
+ } \
+} while (0)
-int yychar; /* the lookahead symbol */
-YYSTYPE yylval; /* the semantic value of the */
- /* lookahead symbol */
+/*------------------------------------------------------------------.
+| yy_stack_print -- Print the state stack from its BOTTOM up to its |
+| TOP (included). |
+`------------------------------------------------------------------*/
-#ifdef YYLSP_NEEDED
-YYLTYPE yylloc; /* location data for the lookahead */
- /* symbol */
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_stack_print (short int *bottom, short int *top)
+#else
+static void
+yy_stack_print (bottom, top)
+ short int *bottom;
+ short int *top;
#endif
+{
+ YYFPRINTF (stderr, "Stack now");
+ for (/* Nothing. */; bottom <= top; ++bottom)
+ YYFPRINTF (stderr, " %d", *bottom);
+ YYFPRINTF (stderr, "\n");
+}
-int yynerrs; /* number of parse errors so far */
-#endif /* not YYPURE */
+# define YY_STACK_PRINT(Bottom, Top) \
+do { \
+ if (yydebug) \
+ yy_stack_print ((Bottom), (Top)); \
+} while (0)
-#if YYDEBUG != 0
-int yydebug; /* nonzero means print parse trace */
-/* Since this is uninitialized, it does not stop multiple parsers
- from coexisting. */
-#endif
-/* YYINITDEPTH indicates the initial size of the parser's stacks */
+/*------------------------------------------------.
+| Report that the YYRULE is going to be reduced. |
+`------------------------------------------------*/
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yy_reduce_print (int yyrule)
+#else
+static void
+yy_reduce_print (yyrule)
+ int yyrule;
+#endif
+{
+ int yyi;
+ unsigned int yylno = yyrline[yyrule];
+ YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
+ yyrule - 1, yylno);
+ /* Print the symbols being reduced, and their result. */
+ for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
+ YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
+ YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
+}
+
+# define YY_REDUCE_PRINT(Rule) \
+do { \
+ if (yydebug) \
+ yy_reduce_print (Rule); \
+} while (0)
+
+/* Nonzero means print parse trace. It is left uninitialized so that
+ multiple parsers can coexist. */
+int yydebug;
+#else /* !YYDEBUG */
+# define YYDPRINTF(Args)
+# define YYDSYMPRINT(Args)
+# define YYDSYMPRINTF(Title, Token, Value, Location)
+# define YY_STACK_PRINT(Bottom, Top)
+# define YY_REDUCE_PRINT(Rule)
+#endif /* !YYDEBUG */
+
+
+/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
-#define YYINITDEPTH 200
+# define YYINITDEPTH 200
#endif
-/* YYMAXDEPTH is the maximum size the stacks can grow to
- (effective only if the built-in stack extension method is used). */
+/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
+ if the built-in stack extension method is used).
+
+ Do not make this value too large; the results are undefined if
+ SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
+ evaluated with infinite-precision integer arithmetic. */
-#if YYMAXDEPTH == 0
-#undef YYMAXDEPTH
+#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
+# undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
-#define YYMAXDEPTH 10000
+# define YYMAXDEPTH 10000
#endif
+
-/* Define __yy_memcpy. Note that the size argument
- should be passed with type unsigned int, because that is what the non-GCC
- definitions require. With GCC, __builtin_memcpy takes an arg
- of type size_t, but it can handle unsigned int. */
-
-#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
-#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
-#else /* not GNU C or C++ */
-#ifndef __cplusplus
-
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
-static void
-__yy_memcpy (to, from, count)
- char *to;
- char *from;
- unsigned int count;
+
+#if YYERROR_VERBOSE
+
+# ifndef yystrlen
+# if defined (__GLIBC__) && defined (_STRING_H)
+# define yystrlen strlen
+# else
+/* Return the length of YYSTR. */
+static YYSIZE_T
+# if defined (__STDC__) || defined (__cplusplus)
+yystrlen (const char *yystr)
+# else
+yystrlen (yystr)
+ const char *yystr;
+# endif
+{
+ register const char *yys = yystr;
+
+ while (*yys++ != '\0')
+ continue;
+
+ return yys - yystr - 1;
+}
+# endif
+# endif
+
+# ifndef yystpcpy
+# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
+# define yystpcpy stpcpy
+# else
+/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
+ YYDEST. */
+static char *
+# if defined (__STDC__) || defined (__cplusplus)
+yystpcpy (char *yydest, const char *yysrc)
+# else
+yystpcpy (yydest, yysrc)
+ char *yydest;
+ const char *yysrc;
+# endif
{
- register char *f = from;
- register char *t = to;
- register int i = count;
+ register char *yyd = yydest;
+ register const char *yys = yysrc;
- while (i-- > 0)
- *t++ = *f++;
+ while ((*yyd++ = *yys++) != '\0')
+ continue;
+
+ return yyd - 1;
}
+# endif
+# endif
+
+#endif /* !YYERROR_VERBOSE */
-#else /* __cplusplus */
+
-/* This is the most reliable way to avoid incompatibilities
- in available built-in functions on various systems. */
+#if YYDEBUG
+/*--------------------------------.
+| Print this symbol on YYOUTPUT. |
+`--------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
static void
-__yy_memcpy (char *to, char *from, unsigned int count)
+yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yysymprint (yyoutput, yytype, yyvaluep)
+ FILE *yyoutput;
+ int yytype;
+ YYSTYPE *yyvaluep;
+#endif
{
- register char *t = to;
- register char *f = from;
- register int i = count;
+ /* Pacify ``unused variable'' warnings. */
+ (void) yyvaluep;
+
+ if (yytype < YYNTOKENS)
+ {
+ YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
+# ifdef YYPRINT
+ YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
+# endif
+ }
+ else
+ YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
- while (i-- > 0)
- *t++ = *f++;
+ switch (yytype)
+ {
+ default:
+ break;
+ }
+ YYFPRINTF (yyoutput, ")");
}
+#endif /* ! YYDEBUG */
+/*-----------------------------------------------.
+| Release the memory associated to this symbol. |
+`-----------------------------------------------*/
+
+#if defined (__STDC__) || defined (__cplusplus)
+static void
+yydestruct (int yytype, YYSTYPE *yyvaluep)
+#else
+static void
+yydestruct (yytype, yyvaluep)
+ int yytype;
+ YYSTYPE *yyvaluep;
#endif
-#endif
+{
+ /* Pacify ``unused variable'' warnings. */
+ (void) yyvaluep;
+
+ switch (yytype)
+ {
+
+ default:
+ break;
+ }
+}
-#line 222 "/usr/share/bison.simple"
-/* The user can define YYPARSE_PARAM as the name of an argument to be passed
- into yyparse. The argument should have type void *.
- It should actually point to an object.
- Grammar actions can access the variable by casting it
- to the proper pointer type. */
+/* Prevent warnings from -Wmissing-prototypes. */
#ifdef YYPARSE_PARAM
-#ifdef __cplusplus
-#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL
-#else /* not __cplusplus */
-#define YYPARSE_PARAM_ARG YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
-#endif /* not __cplusplus */
-#else /* not YYPARSE_PARAM */
-#define YYPARSE_PARAM_ARG
-#define YYPARSE_PARAM_DECL
-#endif /* not YYPARSE_PARAM */
-
-/* Prevent warning if -Wstrict-prototypes. */
-#ifdef __GNUC__
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM);
+# else
+int yyparse ();
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void);
+#else
+int yyparse ();
+#endif
+#endif /* ! YYPARSE_PARAM */
+
+
+
+/* The lookahead symbol. */
+int yychar;
+
+/* The semantic value of the lookahead symbol. */
+YYSTYPE yylval;
+
+/* Number of syntax errors so far. */
+int yynerrs;
+
+
+
+/*----------.
+| yyparse. |
+`----------*/
+
#ifdef YYPARSE_PARAM
-YYPARSE_RETURN_TYPE
-yyparse (void *);
+# if defined (__STDC__) || defined (__cplusplus)
+int yyparse (void *YYPARSE_PARAM)
+# else
+int yyparse (YYPARSE_PARAM)
+ void *YYPARSE_PARAM;
+# endif
+#else /* ! YYPARSE_PARAM */
+#if defined (__STDC__) || defined (__cplusplus)
+int
+yyparse (void)
#else
-YYPARSE_RETURN_TYPE
-yyparse (void);
+int
+yyparse ()
+
#endif
#endif
-
-YYPARSE_RETURN_TYPE
-yyparse(YYPARSE_PARAM_ARG)
- YYPARSE_PARAM_DECL
{
+
register int yystate;
register int yyn;
- register short *yyssp;
+ int yyresult;
+ /* Number of tokens to shift before error messages enabled. */
+ int yyerrstatus;
+ /* Lookahead token as an internal (translated) token number. */
+ int yytoken = 0;
+
+ /* Three stacks and their tools:
+ `yyss': related to states,
+ `yyvs': related to semantic values,
+ `yyls': related to locations.
+
+ Refer to the stacks thru separate pointers, to allow yyoverflow
+ to reallocate them elsewhere. */
+
+ /* The state stack. */
+ short int yyssa[YYINITDEPTH];
+ short int *yyss = yyssa;
+ register short int *yyssp;
+
+ /* The semantic value stack. */
+ YYSTYPE yyvsa[YYINITDEPTH];
+ YYSTYPE *yyvs = yyvsa;
register YYSTYPE *yyvsp;
- int yyerrstatus; /* number of tokens to shift before error messages enabled */
- int yychar1 = 0; /* lookahead token as an internal (translated) token number */
- short yyssa[YYINITDEPTH]; /* the state stack */
- YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
- short *yyss = yyssa; /* refer to the stacks thru separate pointers */
- YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
-#ifdef YYLSP_NEEDED
- YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
- YYLTYPE *yyls = yylsa;
- YYLTYPE *yylsp;
-
-#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
-#else
#define YYPOPSTACK (yyvsp--, yyssp--)
-#endif
- int yystacksize = YYINITDEPTH;
-#ifndef YYSTACK_USE_ALLOCA
- int yyfree_stacks = 0;
-#endif
+ YYSIZE_T yystacksize = YYINITDEPTH;
-#ifdef YYPURE
- int yychar;
- YYSTYPE yylval;
- int yynerrs;
-#ifdef YYLSP_NEEDED
- YYLTYPE yylloc;
-#endif
-#endif
+ /* The variables used to return semantic value and location from the
+ action routines. */
+ YYSTYPE yyval;
- YYSTYPE yyval; /* the variable used to return */
- /* semantic values from the action */
- /* routines */
+ /* When reducing, the number of symbols on the RHS of the reduced
+ rule. */
int yylen;
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Starting parse\n");
-#endif
+ YYDPRINTF ((stderr, "Starting parse\n"));
yystate = 0;
yyerrstatus = 0;
@@ -880,112 +1392,97 @@ yyparse(YYPARSE_PARAM_ARG)
so that they stay on the same level as the state stack.
The wasted elements are never initialized. */
- yyssp = yyss - 1;
+ yyssp = yyss;
yyvsp = yyvs;
-#ifdef YYLSP_NEEDED
- yylsp = yyls;
-#endif
-/* Push a new state, which is found in yystate . */
-/* In all cases, when you get here, the value and location stacks
- have just been pushed. so pushing a state here evens the stacks. */
-yynewstate:
- *++yyssp = yystate;
+ goto yysetstate;
- if (yyssp >= yyss + yystacksize - 1)
- {
- /* Give user a chance to reallocate the stack */
- /* Use copies of these so that the &'s don't force the real ones into memory. */
- YYSTYPE *yyvs1 = yyvs;
- short *yyss1 = yyss;
-#ifdef YYLSP_NEEDED
- YYLTYPE *yyls1 = yyls;
-#endif
+/*------------------------------------------------------------.
+| yynewstate -- Push a new state, which is found in yystate. |
+`------------------------------------------------------------*/
+ yynewstate:
+ /* In all cases, when you get here, the value and location stacks
+ have just been pushed. so pushing a state here evens the stacks.
+ */
+ yyssp++;
+ yysetstate:
+ *yyssp = yystate;
+
+ if (yyss + yystacksize - 1 <= yyssp)
+ {
/* Get the current used size of the three stacks, in elements. */
- int size = yyssp - yyss + 1;
+ YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
- /* Each stack pointer address is followed by the size of
- the data in use in that stack, in bytes. */
-#ifdef YYLSP_NEEDED
- /* This used to be a conditional around just the two extra args,
- but that might be undefined if yyoverflow is a macro. */
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yyls1, size * sizeof (*yylsp),
- &yystacksize);
-#else
- yyoverflow("parser stack overflow",
- &yyss1, size * sizeof (*yyssp),
- &yyvs1, size * sizeof (*yyvsp),
- &yystacksize);
-#endif
-
- yyss = yyss1; yyvs = yyvs1;
-#ifdef YYLSP_NEEDED
- yyls = yyls1;
-#endif
+ {
+ /* Give user a chance to reallocate the stack. Use copies of
+ these so that the &'s don't force the real ones into
+ memory. */
+ YYSTYPE *yyvs1 = yyvs;
+ short int *yyss1 = yyss;
+
+
+ /* Each stack pointer address is followed by the size of the
+ data in use in that stack, in bytes. This used to be a
+ conditional around just the two extra args, but that might
+ be undefined if yyoverflow is a macro. */
+ yyoverflow ("parser stack overflow",
+ &yyss1, yysize * sizeof (*yyssp),
+ &yyvs1, yysize * sizeof (*yyvsp),
+
+ &yystacksize);
+
+ yyss = yyss1;
+ yyvs = yyvs1;
+ }
#else /* no yyoverflow */
+# ifndef YYSTACK_RELOCATE
+ goto yyoverflowlab;
+# else
/* Extend the stack our own way. */
- if (yystacksize >= YYMAXDEPTH)
- {
- yyerror("parser stack overflow");
-#ifndef YYSTACK_USE_ALLOCA
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
-#endif
- return 2;
- }
+ if (YYMAXDEPTH <= yystacksize)
+ goto yyoverflowlab;
yystacksize *= 2;
- if (yystacksize > YYMAXDEPTH)
+ if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
-#ifndef YYSTACK_USE_ALLOCA
- yyfree_stacks = 1;
-#endif
- yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
- __yy_memcpy ((char *)yyss, (char *)yyss1,
- size * (unsigned int) sizeof (*yyssp));
- yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
- __yy_memcpy ((char *)yyvs, (char *)yyvs1,
- size * (unsigned int) sizeof (*yyvsp));
-#ifdef YYLSP_NEEDED
- yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
- __yy_memcpy ((char *)yyls, (char *)yyls1,
- size * (unsigned int) sizeof (*yylsp));
-#endif
+
+ {
+ short int *yyss1 = yyss;
+ union yyalloc *yyptr =
+ (union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
+ if (! yyptr)
+ goto yyoverflowlab;
+ YYSTACK_RELOCATE (yyss);
+ YYSTACK_RELOCATE (yyvs);
+
+# undef YYSTACK_RELOCATE
+ if (yyss1 != yyssa)
+ YYSTACK_FREE (yyss1);
+ }
+# endif
#endif /* no yyoverflow */
- yyssp = yyss + size - 1;
- yyvsp = yyvs + size - 1;
-#ifdef YYLSP_NEEDED
- yylsp = yyls + size - 1;
-#endif
+ yyssp = yyss + yysize - 1;
+ yyvsp = yyvs + yysize - 1;
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Stack size increased to %d\n", yystacksize);
-#endif
- if (yyssp >= yyss + yystacksize - 1)
+ YYDPRINTF ((stderr, "Stack size increased to %lu\n",
+ (unsigned long int) yystacksize));
+
+ if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
}
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Entering state %d\n", yystate);
-#endif
+ YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto yybackup;
- yybackup:
+
+/*-----------.
+| yybackup. |
+`-----------*/
+yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
@@ -994,876 +1491,1005 @@ yynewstate:
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
- if (yyn == YYFLAG)
+ if (yyn == YYPACT_NINF)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
- /* yychar is either YYEMPTY or YYEOF
- or a valid token in external form. */
-
+ /* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
if (yychar == YYEMPTY)
{
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Reading a token: ");
-#endif
+ YYDPRINTF ((stderr, "Reading a token: "));
yychar = YYLEX;
}
- /* Convert token to internal form (in yychar1) for indexing tables with */
-
- if (yychar <= 0) /* This means end of input. */
+ if (yychar <= YYEOF)
{
- yychar1 = 0;
- yychar = YYEOF; /* Don't call YYLEX any more */
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Now at end of input.\n");
-#endif
+ yychar = yytoken = YYEOF;
+ YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
- yychar1 = YYTRANSLATE(yychar);
-
-#if YYDEBUG != 0
- if (yydebug)
- {
- fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
- /* Give the individual parser a way to print the precise meaning
- of a token, for further debugging info. */
-#ifdef YYPRINT
- YYPRINT (stderr, yychar, yylval);
-#endif
- fprintf (stderr, ")\n");
- }
-#endif
+ yytoken = YYTRANSLATE (yychar);
+ YYDSYMPRINTF ("Next token is", yytoken, &yylval, &yylloc);
}
- yyn += yychar1;
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
+ /* If the proper action on seeing token YYTOKEN is to reduce or to
+ detect an error, take that action. */
+ yyn += yytoken;
+ if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
goto yydefault;
-
yyn = yytable[yyn];
-
- /* yyn is what to do for this token type in this state.
- Negative => reduce, -yyn is rule number.
- Positive => shift, yyn is new state.
- New state is final state => don't bother to shift,
- just return success.
- 0, or most negative number => error. */
-
- if (yyn < 0)
+ if (yyn <= 0)
{
- if (yyn == YYFLAG)
+ if (yyn == 0 || yyn == YYTABLE_NINF)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
- else if (yyn == 0)
- goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
-#endif
+ YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
- *++yylsp = yylloc;
-#endif
- /* count tokens shifted since error; after three, turn off error status. */
- if (yyerrstatus) yyerrstatus--;
+
+ /* Count tokens shifted since error; after three, turn off error
+ status. */
+ if (yyerrstatus)
+ yyerrstatus--;
yystate = yyn;
goto yynewstate;
-/* Do the default action for the current state. */
-yydefault:
+/*-----------------------------------------------------------.
+| yydefault -- do the default action for the current state. |
+`-----------------------------------------------------------*/
+yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
+ goto yyreduce;
+
-/* Do a reduction. yyn is the number of a rule to reduce with. */
+/*-----------------------------.
+| yyreduce -- Do a reduction. |
+`-----------------------------*/
yyreduce:
+ /* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
- if (yylen > 0)
- yyval = yyvsp[1-yylen]; /* implement default value of the action */
-#if YYDEBUG != 0
- if (yydebug)
- {
- int i;
-
- fprintf (stderr, "Reducing via rule %d (line %d), ",
- yyn, yyrline[yyn]);
+ /* If YYLEN is nonzero, implement the default value of the action:
+ `$$ = $1'.
- /* Print the symbols being reduced, and their result. */
- for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
- fprintf (stderr, "%s ", yytname[yyrhs[i]]);
- fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
- }
-#endif
+ Otherwise, the following line sets YYVAL to garbage.
+ This behavior is undocumented and Bison
+ users should not rely upon it. Assigning to YYVAL
+ unconditionally makes the parser a bit smaller, and it avoids a
+ GCC warning that YYVAL may be used uninitialized. */
+ yyval = yyvsp[1-yylen];
- switch (yyn) {
-
-case 23:
-#line 155 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 24:
-#line 157 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-1], yyvsp[0]); ;
- break;}
-case 25:
-#line 161 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 26:
-#line 163 "pars0grm.y"
-{ yyval = pars_func(yyvsp[-3], yyvsp[-1]); ;
- break;}
-case 27:
+ YY_REDUCE_PRINT (yyn);
+ switch (yyn)
+ {
+ case 24:
+#line 156 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 25:
+#line 158 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-1], yyvsp[0]); ;}
+ break;
+
+ case 26:
+#line 162 "pars0grm.y"
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 27:
#line 164 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 28:
+ { yyval = pars_func(yyvsp[-3], yyvsp[-1]); ;}
+ break;
+
+ case 28:
#line 165 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 29:
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 29:
#line 166 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 30:
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 30:
#line 167 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 31:
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 31:
#line 168 "pars0grm.y"
-{ yyval = yyvsp[0];;
- break;}
-case 32:
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 32:
#line 169 "pars0grm.y"
-{ yyval = pars_op('+', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 33:
+ { yyval = yyvsp[0];;}
+ break;
+
+ case 33:
#line 170 "pars0grm.y"
-{ yyval = pars_op('-', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 34:
+ { yyval = pars_op('+', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 34:
#line 171 "pars0grm.y"
-{ yyval = pars_op('*', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 35:
+ { yyval = pars_op('-', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 35:
#line 172 "pars0grm.y"
-{ yyval = pars_op('/', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 36:
+ { yyval = pars_op('*', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 36:
#line 173 "pars0grm.y"
-{ yyval = pars_op('-', yyvsp[0], NULL); ;
- break;}
-case 37:
+ { yyval = pars_op('/', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 37:
#line 174 "pars0grm.y"
-{ yyval = yyvsp[-1]; ;
- break;}
-case 38:
+ { yyval = pars_op('-', yyvsp[0], NULL); ;}
+ break;
+
+ case 38:
#line 175 "pars0grm.y"
-{ yyval = pars_op('=', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 39:
+ { yyval = yyvsp[-1]; ;}
+ break;
+
+ case 39:
#line 176 "pars0grm.y"
-{ yyval = pars_op('<', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 40:
+ { yyval = pars_op('=', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 40:
#line 177 "pars0grm.y"
-{ yyval = pars_op('>', yyvsp[-2], yyvsp[0]); ;
- break;}
-case 41:
+ { yyval = pars_op('<', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 41:
#line 178 "pars0grm.y"
-{ yyval = pars_op(PARS_GE_TOKEN, yyvsp[-2], yyvsp[0]); ;
- break;}
-case 42:
+ { yyval = pars_op('>', yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 42:
#line 179 "pars0grm.y"
-{ yyval = pars_op(PARS_LE_TOKEN, yyvsp[-2], yyvsp[0]); ;
- break;}
-case 43:
+ { yyval = pars_op(PARS_GE_TOKEN, yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 43:
#line 180 "pars0grm.y"
-{ yyval = pars_op(PARS_NE_TOKEN, yyvsp[-2], yyvsp[0]); ;
- break;}
-case 44:
+ { yyval = pars_op(PARS_LE_TOKEN, yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 44:
#line 181 "pars0grm.y"
-{ yyval = pars_op(PARS_AND_TOKEN, yyvsp[-2], yyvsp[0]); ;
- break;}
-case 45:
+ { yyval = pars_op(PARS_NE_TOKEN, yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 45:
#line 182 "pars0grm.y"
-{ yyval = pars_op(PARS_OR_TOKEN, yyvsp[-2], yyvsp[0]); ;
- break;}
-case 46:
+ { yyval = pars_op(PARS_AND_TOKEN, yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 46:
#line 183 "pars0grm.y"
-{ yyval = pars_op(PARS_NOT_TOKEN, yyvsp[0], NULL); ;
- break;}
-case 47:
-#line 185 "pars0grm.y"
-{ yyval = pars_op(PARS_NOTFOUND_TOKEN, yyvsp[-2], NULL); ;
- break;}
-case 48:
-#line 187 "pars0grm.y"
-{ yyval = pars_op(PARS_NOTFOUND_TOKEN, yyvsp[-2], NULL); ;
- break;}
-case 49:
-#line 191 "pars0grm.y"
-{ yyval = &pars_to_char_token; ;
- break;}
-case 50:
+ { yyval = pars_op(PARS_OR_TOKEN, yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 47:
+#line 184 "pars0grm.y"
+ { yyval = pars_op(PARS_NOT_TOKEN, yyvsp[0], NULL); ;}
+ break;
+
+ case 48:
+#line 186 "pars0grm.y"
+ { yyval = pars_op(PARS_NOTFOUND_TOKEN, yyvsp[-2], NULL); ;}
+ break;
+
+ case 49:
+#line 188 "pars0grm.y"
+ { yyval = pars_op(PARS_NOTFOUND_TOKEN, yyvsp[-2], NULL); ;}
+ break;
+
+ case 50:
#line 192 "pars0grm.y"
-{ yyval = &pars_to_number_token; ;
- break;}
-case 51:
+ { yyval = &pars_to_char_token; ;}
+ break;
+
+ case 51:
#line 193 "pars0grm.y"
-{ yyval = &pars_to_binary_token; ;
- break;}
-case 52:
-#line 195 "pars0grm.y"
-{ yyval = &pars_binary_to_number_token; ;
- break;}
-case 53:
+ { yyval = &pars_to_number_token; ;}
+ break;
+
+ case 52:
+#line 194 "pars0grm.y"
+ { yyval = &pars_to_binary_token; ;}
+ break;
+
+ case 53:
#line 196 "pars0grm.y"
-{ yyval = &pars_substr_token; ;
- break;}
-case 54:
+ { yyval = &pars_binary_to_number_token; ;}
+ break;
+
+ case 54:
#line 197 "pars0grm.y"
-{ yyval = &pars_concat_token; ;
- break;}
-case 55:
+ { yyval = &pars_substr_token; ;}
+ break;
+
+ case 55:
#line 198 "pars0grm.y"
-{ yyval = &pars_instr_token; ;
- break;}
-case 56:
+ { yyval = &pars_concat_token; ;}
+ break;
+
+ case 56:
#line 199 "pars0grm.y"
-{ yyval = &pars_length_token; ;
- break;}
-case 57:
+ { yyval = &pars_instr_token; ;}
+ break;
+
+ case 57:
#line 200 "pars0grm.y"
-{ yyval = &pars_sysdate_token; ;
- break;}
-case 58:
+ { yyval = &pars_length_token; ;}
+ break;
+
+ case 58:
#line 201 "pars0grm.y"
-{ yyval = &pars_rnd_token; ;
- break;}
-case 59:
+ { yyval = &pars_sysdate_token; ;}
+ break;
+
+ case 59:
#line 202 "pars0grm.y"
-{ yyval = &pars_rnd_str_token; ;
- break;}
-case 63:
-#line 213 "pars0grm.y"
-{ yyval = pars_stored_procedure_call(yyvsp[-4]); ;
- break;}
-case 64:
-#line 218 "pars0grm.y"
-{ yyval = pars_procedure_call(yyvsp[-3], yyvsp[-1]); ;
- break;}
-case 65:
-#line 222 "pars0grm.y"
-{ yyval = &pars_replstr_token; ;
- break;}
-case 66:
+ { yyval = &pars_rnd_token; ;}
+ break;
+
+ case 60:
+#line 203 "pars0grm.y"
+ { yyval = &pars_rnd_str_token; ;}
+ break;
+
+ case 64:
+#line 214 "pars0grm.y"
+ { yyval = pars_stored_procedure_call(yyvsp[-4]); ;}
+ break;
+
+ case 65:
+#line 219 "pars0grm.y"
+ { yyval = pars_procedure_call(yyvsp[-3], yyvsp[-1]); ;}
+ break;
+
+ case 66:
#line 223 "pars0grm.y"
-{ yyval = &pars_printf_token; ;
- break;}
-case 67:
+ { yyval = &pars_replstr_token; ;}
+ break;
+
+ case 67:
#line 224 "pars0grm.y"
-{ yyval = &pars_assert_token; ;
- break;}
-case 68:
-#line 228 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 69:
-#line 230 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 70:
-#line 234 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 71:
+ { yyval = &pars_printf_token; ;}
+ break;
+
+ case 68:
+#line 225 "pars0grm.y"
+ { yyval = &pars_assert_token; ;}
+ break;
+
+ case 69:
+#line 229 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 70:
+#line 231 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 71:
#line 235 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 72:
-#line 237 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 73:
-#line 241 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 74:
+ { yyval = NULL; ;}
+ break;
+
+ case 72:
+#line 236 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 73:
+#line 238 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 74:
#line 242 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]);;
- break;}
-case 75:
+ { yyval = NULL; ;}
+ break;
+
+ case 75:
#line 243 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 76:
-#line 247 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 77:
-#line 249 "pars0grm.y"
-{ yyval = pars_func(&pars_count_token,
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]);;}
+ break;
+
+ case 76:
+#line 244 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 77:
+#line 248 "pars0grm.y"
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 78:
+#line 250 "pars0grm.y"
+ { yyval = pars_func(&pars_count_token,
que_node_list_add_last(NULL,
sym_tab_add_int_lit(
- pars_sym_tab_global, 1))); ;
- break;}
-case 78:
-#line 254 "pars0grm.y"
-{ yyval = pars_func(&pars_count_token,
+ pars_sym_tab_global, 1))); ;}
+ break;
+
+ case 79:
+#line 255 "pars0grm.y"
+ { yyval = pars_func(&pars_count_token,
que_node_list_add_last(NULL,
pars_func(&pars_distinct_token,
que_node_list_add_last(
- NULL, yyvsp[-1])))); ;
- break;}
-case 79:
-#line 260 "pars0grm.y"
-{ yyval = pars_func(&pars_sum_token,
+ NULL, yyvsp[-1])))); ;}
+ break;
+
+ case 80:
+#line 261 "pars0grm.y"
+ { yyval = pars_func(&pars_sum_token,
que_node_list_add_last(NULL,
- yyvsp[-1])); ;
- break;}
-case 80:
-#line 266 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 81:
+ yyvsp[-1])); ;}
+ break;
+
+ case 81:
#line 267 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 82:
-#line 269 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 83:
-#line 273 "pars0grm.y"
-{ yyval = pars_select_list(&pars_star_denoter,
- NULL); ;
- break;}
-case 84:
-#line 276 "pars0grm.y"
-{ yyval = pars_select_list(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 85:
+ { yyval = NULL; ;}
+ break;
+
+ case 82:
+#line 268 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 83:
+#line 270 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 84:
+#line 274 "pars0grm.y"
+ { yyval = pars_select_list(&pars_star_denoter,
+ NULL); ;}
+ break;
+
+ case 85:
#line 277 "pars0grm.y"
-{ yyval = pars_select_list(yyvsp[0], NULL); ;
- break;}
-case 86:
-#line 281 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 87:
+ { yyval = pars_select_list(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 86:
+#line 278 "pars0grm.y"
+ { yyval = pars_select_list(yyvsp[0], NULL); ;}
+ break;
+
+ case 87:
#line 282 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 88:
-#line 286 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 89:
-#line 288 "pars0grm.y"
-{ yyval = &pars_update_token; ;
- break;}
-case 90:
-#line 292 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 91:
-#line 294 "pars0grm.y"
-{ yyval = &pars_consistent_token; ;
- break;}
-case 92:
-#line 298 "pars0grm.y"
-{ yyval = &pars_asc_token; ;
- break;}
-case 93:
+ { yyval = NULL; ;}
+ break;
+
+ case 88:
+#line 283 "pars0grm.y"
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 89:
+#line 287 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 90:
+#line 289 "pars0grm.y"
+ { yyval = &pars_update_token; ;}
+ break;
+
+ case 91:
+#line 293 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 92:
+#line 295 "pars0grm.y"
+ { yyval = &pars_consistent_token; ;}
+ break;
+
+ case 93:
#line 299 "pars0grm.y"
-{ yyval = &pars_asc_token; ;
- break;}
-case 94:
+ { yyval = &pars_asc_token; ;}
+ break;
+
+ case 94:
#line 300 "pars0grm.y"
-{ yyval = &pars_desc_token; ;
- break;}
-case 95:
-#line 304 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 96:
-#line 306 "pars0grm.y"
-{ yyval = pars_order_by(yyvsp[-1], yyvsp[0]); ;
- break;}
-case 97:
-#line 315 "pars0grm.y"
-{ yyval = pars_select_statement(yyvsp[-6], yyvsp[-4], yyvsp[-3],
- yyvsp[-2], yyvsp[-1], yyvsp[0]); ;
- break;}
-case 98:
-#line 321 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 99:
-#line 326 "pars0grm.y"
-{ yyval = pars_insert_statement(yyvsp[-4], yyvsp[-1], NULL); ;
- break;}
-case 100:
-#line 328 "pars0grm.y"
-{ yyval = pars_insert_statement(yyvsp[-1], NULL, yyvsp[0]); ;
- break;}
-case 101:
-#line 332 "pars0grm.y"
-{ yyval = pars_column_assignment(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 102:
-#line 336 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 103:
-#line 338 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 104:
-#line 344 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 105:
-#line 350 "pars0grm.y"
-{ yyval = pars_update_statement_start(FALSE,
- yyvsp[-2], yyvsp[0]); ;
- break;}
-case 106:
-#line 356 "pars0grm.y"
-{ yyval = pars_update_statement(yyvsp[-1], NULL, yyvsp[0]); ;
- break;}
-case 107:
-#line 361 "pars0grm.y"
-{ yyval = pars_update_statement(yyvsp[-1], yyvsp[0], NULL); ;
- break;}
-case 108:
-#line 366 "pars0grm.y"
-{ yyval = pars_update_statement_start(TRUE,
- yyvsp[0], NULL); ;
- break;}
-case 109:
-#line 372 "pars0grm.y"
-{ yyval = pars_update_statement(yyvsp[-1], NULL, yyvsp[0]); ;
- break;}
-case 110:
-#line 377 "pars0grm.y"
-{ yyval = pars_update_statement(yyvsp[-1], yyvsp[0], NULL); ;
- break;}
-case 111:
-#line 382 "pars0grm.y"
-{ yyval = pars_row_printf_statement(yyvsp[0]); ;
- break;}
-case 112:
-#line 387 "pars0grm.y"
-{ yyval = pars_assignment_statement(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 113:
-#line 393 "pars0grm.y"
-{ yyval = pars_elsif_element(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 114:
-#line 397 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 115:
-#line 399 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-1], yyvsp[0]); ;
- break;}
-case 116:
-#line 403 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 117:
-#line 405 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 118:
+ { yyval = &pars_asc_token; ;}
+ break;
+
+ case 95:
+#line 301 "pars0grm.y"
+ { yyval = &pars_desc_token; ;}
+ break;
+
+ case 96:
+#line 305 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 97:
+#line 307 "pars0grm.y"
+ { yyval = pars_order_by(yyvsp[-1], yyvsp[0]); ;}
+ break;
+
+ case 98:
+#line 316 "pars0grm.y"
+ { yyval = pars_select_statement(yyvsp[-6], yyvsp[-4], yyvsp[-3],
+ yyvsp[-2], yyvsp[-1], yyvsp[0]); ;}
+ break;
+
+ case 99:
+#line 322 "pars0grm.y"
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 100:
+#line 327 "pars0grm.y"
+ { yyval = pars_insert_statement(yyvsp[-4], yyvsp[-1], NULL); ;}
+ break;
+
+ case 101:
+#line 329 "pars0grm.y"
+ { yyval = pars_insert_statement(yyvsp[-1], NULL, yyvsp[0]); ;}
+ break;
+
+ case 102:
+#line 333 "pars0grm.y"
+ { yyval = pars_column_assignment(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 103:
+#line 337 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 104:
+#line 339 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 105:
+#line 345 "pars0grm.y"
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 106:
+#line 351 "pars0grm.y"
+ { yyval = pars_update_statement_start(FALSE,
+ yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 107:
+#line 357 "pars0grm.y"
+ { yyval = pars_update_statement(yyvsp[-1], NULL, yyvsp[0]); ;}
+ break;
+
+ case 108:
+#line 362 "pars0grm.y"
+ { yyval = pars_update_statement(yyvsp[-1], yyvsp[0], NULL); ;}
+ break;
+
+ case 109:
+#line 367 "pars0grm.y"
+ { yyval = pars_update_statement_start(TRUE,
+ yyvsp[0], NULL); ;}
+ break;
+
+ case 110:
+#line 373 "pars0grm.y"
+ { yyval = pars_update_statement(yyvsp[-1], NULL, yyvsp[0]); ;}
+ break;
+
+ case 111:
+#line 378 "pars0grm.y"
+ { yyval = pars_update_statement(yyvsp[-1], yyvsp[0], NULL); ;}
+ break;
+
+ case 112:
+#line 383 "pars0grm.y"
+ { yyval = pars_row_printf_statement(yyvsp[0]); ;}
+ break;
+
+ case 113:
+#line 388 "pars0grm.y"
+ { yyval = pars_assignment_statement(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 114:
+#line 394 "pars0grm.y"
+ { yyval = pars_elsif_element(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 115:
+#line 398 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 116:
+#line 400 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-1], yyvsp[0]); ;}
+ break;
+
+ case 117:
+#line 404 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 118:
#line 406 "pars0grm.y"
-{ yyval = yyvsp[0]; ;
- break;}
-case 119:
-#line 413 "pars0grm.y"
-{ yyval = pars_if_statement(yyvsp[-5], yyvsp[-3], yyvsp[-2]); ;
- break;}
-case 120:
-#line 419 "pars0grm.y"
-{ yyval = pars_while_statement(yyvsp[-4], yyvsp[-2]); ;
- break;}
-case 121:
-#line 427 "pars0grm.y"
-{ yyval = pars_for_statement(yyvsp[-8], yyvsp[-6], yyvsp[-4], yyvsp[-2]); ;
- break;}
-case 122:
-#line 431 "pars0grm.y"
-{ yyval = pars_return_statement(); ;
- break;}
-case 123:
-#line 436 "pars0grm.y"
-{ yyval = pars_open_statement(
- ROW_SEL_OPEN_CURSOR, yyvsp[0]); ;
- break;}
-case 124:
-#line 442 "pars0grm.y"
-{ yyval = pars_open_statement(
- ROW_SEL_CLOSE_CURSOR, yyvsp[0]); ;
- break;}
-case 125:
-#line 448 "pars0grm.y"
-{ yyval = pars_fetch_statement(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 126:
-#line 452 "pars0grm.y"
-{ yyval = pars_column_def(yyvsp[-1], yyvsp[0]); ;
- break;}
-case 127:
-#line 456 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 128:
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 119:
+#line 407 "pars0grm.y"
+ { yyval = yyvsp[0]; ;}
+ break;
+
+ case 120:
+#line 414 "pars0grm.y"
+ { yyval = pars_if_statement(yyvsp[-5], yyvsp[-3], yyvsp[-2]); ;}
+ break;
+
+ case 121:
+#line 420 "pars0grm.y"
+ { yyval = pars_while_statement(yyvsp[-4], yyvsp[-2]); ;}
+ break;
+
+ case 122:
+#line 428 "pars0grm.y"
+ { yyval = pars_for_statement(yyvsp[-8], yyvsp[-6], yyvsp[-4], yyvsp[-2]); ;}
+ break;
+
+ case 123:
+#line 432 "pars0grm.y"
+ { yyval = pars_return_statement(); ;}
+ break;
+
+ case 124:
+#line 437 "pars0grm.y"
+ { yyval = pars_open_statement(
+ ROW_SEL_OPEN_CURSOR, yyvsp[0]); ;}
+ break;
+
+ case 125:
+#line 443 "pars0grm.y"
+ { yyval = pars_open_statement(
+ ROW_SEL_CLOSE_CURSOR, yyvsp[0]); ;}
+ break;
+
+ case 126:
+#line 449 "pars0grm.y"
+ { yyval = pars_fetch_statement(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 127:
+#line 454 "pars0grm.y"
+ { yyval = pars_column_def(yyvsp[-3], yyvsp[-2], yyvsp[-1], yyvsp[0]); ;}
+ break;
+
+ case 128:
#line 458 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 129:
-#line 462 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 130:
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 129:
+#line 460 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 130:
#line 464 "pars0grm.y"
-{ yyval = &pars_int_token;
- /* pass any non-NULL pointer */ ;
- break;}
-case 131:
-#line 471 "pars0grm.y"
-{ yyval = pars_create_table(yyvsp[-4], yyvsp[-2], yyvsp[0]); ;
- break;}
-case 132:
-#line 475 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 133:
+ { yyval = NULL; ;}
+ break;
+
+ case 131:
+#line 466 "pars0grm.y"
+ { yyval = yyvsp[-1]; ;}
+ break;
+
+ case 132:
+#line 470 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 133:
+#line 472 "pars0grm.y"
+ { yyval = &pars_int_token;
+ /* pass any non-NULL pointer */ ;}
+ break;
+
+ case 134:
#line 477 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 134:
-#line 481 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 135:
-#line 482 "pars0grm.y"
-{ yyval = &pars_unique_token; ;
- break;}
-case 136:
+ { yyval = NULL; ;}
+ break;
+
+ case 135:
+#line 479 "pars0grm.y"
+ { yyval = &pars_int_token;
+ /* pass any non-NULL pointer */ ;}
+ break;
+
+ case 136:
#line 486 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 137:
-#line 487 "pars0grm.y"
-{ yyval = &pars_clustered_token; ;
- break;}
-case 138:
-#line 495 "pars0grm.y"
-{ yyval = pars_create_index(yyvsp[-8], yyvsp[-7], yyvsp[-5], yyvsp[-3], yyvsp[-1]); ;
- break;}
-case 139:
-#line 500 "pars0grm.y"
-{ yyval = pars_commit_statement(); ;
- break;}
-case 140:
-#line 505 "pars0grm.y"
-{ yyval = pars_rollback_statement(); ;
- break;}
-case 141:
-#line 509 "pars0grm.y"
-{ yyval = &pars_int_token; ;
- break;}
-case 142:
+ { yyval = pars_create_table(yyvsp[-4], yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 137:
+#line 490 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 138:
+#line 492 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 139:
+#line 496 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 140:
+#line 497 "pars0grm.y"
+ { yyval = &pars_unique_token; ;}
+ break;
+
+ case 141:
+#line 501 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 142:
+#line 502 "pars0grm.y"
+ { yyval = &pars_clustered_token; ;}
+ break;
+
+ case 143:
#line 510 "pars0grm.y"
-{ yyval = &pars_char_token; ;
- break;}
-case 143:
+ { yyval = pars_create_index(yyvsp[-8], yyvsp[-7], yyvsp[-5], yyvsp[-3], yyvsp[-1]); ;}
+ break;
+
+ case 144:
#line 515 "pars0grm.y"
-{ yyval = pars_parameter_declaration(yyvsp[-2],
- PARS_INPUT, yyvsp[0]); ;
- break;}
-case 144:
-#line 518 "pars0grm.y"
-{ yyval = pars_parameter_declaration(yyvsp[-2],
- PARS_OUTPUT, yyvsp[0]); ;
- break;}
-case 145:
-#line 523 "pars0grm.y"
-{ yyval = NULL; ;
- break;}
-case 146:
+ { yyval = pars_commit_statement(); ;}
+ break;
+
+ case 145:
+#line 520 "pars0grm.y"
+ { yyval = pars_rollback_statement(); ;}
+ break;
+
+ case 146:
#line 524 "pars0grm.y"
-{ yyval = que_node_list_add_last(NULL, yyvsp[0]); ;
- break;}
-case 147:
+ { yyval = &pars_int_token; ;}
+ break;
+
+ case 147:
+#line 525 "pars0grm.y"
+ { yyval = &pars_int_token; ;}
+ break;
+
+ case 148:
#line 526 "pars0grm.y"
-{ yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;
- break;}
-case 148:
-#line 531 "pars0grm.y"
-{ yyval = pars_variable_declaration(yyvsp[-2], yyvsp[-1]); ;
- break;}
-case 152:
-#line 543 "pars0grm.y"
-{ yyval = pars_cursor_declaration(yyvsp[-3], yyvsp[-1]); ;
- break;}
-case 156:
-#line 559 "pars0grm.y"
-{ yyval = pars_procedure_definition(yyvsp[-9], yyvsp[-7],
- yyvsp[-1]); ;
- break;}
-}
- /* the action file gets copied in in place of this dollarsign */
-#line 554 "/usr/share/bison.simple"
+ { yyval = &pars_char_token; ;}
+ break;
+
+ case 149:
+#line 527 "pars0grm.y"
+ { yyval = &pars_binary_token; ;}
+ break;
+
+ case 150:
+#line 528 "pars0grm.y"
+ { yyval = &pars_blob_token; ;}
+ break;
+
+ case 151:
+#line 533 "pars0grm.y"
+ { yyval = pars_parameter_declaration(yyvsp[-2],
+ PARS_INPUT, yyvsp[0]); ;}
+ break;
+
+ case 152:
+#line 536 "pars0grm.y"
+ { yyval = pars_parameter_declaration(yyvsp[-2],
+ PARS_OUTPUT, yyvsp[0]); ;}
+ break;
+
+ case 153:
+#line 541 "pars0grm.y"
+ { yyval = NULL; ;}
+ break;
+
+ case 154:
+#line 542 "pars0grm.y"
+ { yyval = que_node_list_add_last(NULL, yyvsp[0]); ;}
+ break;
+
+ case 155:
+#line 544 "pars0grm.y"
+ { yyval = que_node_list_add_last(yyvsp[-2], yyvsp[0]); ;}
+ break;
+
+ case 156:
+#line 549 "pars0grm.y"
+ { yyval = pars_variable_declaration(yyvsp[-2], yyvsp[-1]); ;}
+ break;
+
+ case 160:
+#line 561 "pars0grm.y"
+ { yyval = pars_cursor_declaration(yyvsp[-3], yyvsp[-1]); ;}
+ break;
+
+ case 164:
+#line 577 "pars0grm.y"
+ { yyval = pars_procedure_definition(yyvsp[-9], yyvsp[-7],
+ yyvsp[-1]); ;}
+ break;
+
+
+ }
+
+/* Line 1010 of yacc.c. */
+#line 2269 "pars0grm.tab.c"
yyvsp -= yylen;
yyssp -= yylen;
-#ifdef YYLSP_NEEDED
- yylsp -= yylen;
-#endif
-#if YYDEBUG != 0
- if (yydebug)
- {
- short *ssp1 = yyss - 1;
- fprintf (stderr, "state stack now");
- while (ssp1 != yyssp)
- fprintf (stderr, " %d", *++ssp1);
- fprintf (stderr, "\n");
- }
-#endif
+
+ YY_STACK_PRINT (yyss, yyssp);
*++yyvsp = yyval;
-#ifdef YYLSP_NEEDED
- yylsp++;
- if (yylen == 0)
- {
- yylsp->first_line = yylloc.first_line;
- yylsp->first_column = yylloc.first_column;
- yylsp->last_line = (yylsp-1)->last_line;
- yylsp->last_column = (yylsp-1)->last_column;
- yylsp->text = 0;
- }
- else
- {
- yylsp->last_line = (yylsp+yylen-1)->last_line;
- yylsp->last_column = (yylsp+yylen-1)->last_column;
- }
-#endif
- /* Now "shift" the result of the reduction.
- Determine what state that goes to,
- based on the state we popped back to
- and the rule number reduced by. */
+ /* Now `shift' the result of the reduction. Determine what state
+ that goes to, based on the state we popped back to and the rule
+ number reduced by. */
yyn = yyr1[yyn];
- yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
- if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+ yystate = yypgoto[yyn - YYNTOKENS] + *yyssp;
+ if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp)
yystate = yytable[yystate];
else
- yystate = yydefgoto[yyn - YYNTBASE];
+ yystate = yydefgoto[yyn - YYNTOKENS];
goto yynewstate;
-yyerrlab: /* here on detecting error */
- if (! yyerrstatus)
- /* If not already recovering from an error, report this error. */
+/*------------------------------------.
+| yyerrlab -- here on detecting error |
+`------------------------------------*/
+yyerrlab:
+ /* If not already recovering from an error, report this error. */
+ if (!yyerrstatus)
{
++yynerrs;
-
-#ifdef YYERROR_VERBOSE
+#if YYERROR_VERBOSE
yyn = yypact[yystate];
- if (yyn > YYFLAG && yyn < YYLAST)
+ if (YYPACT_NINF < yyn && yyn < YYLAST)
{
- int size = 0;
- char *msg;
- int x, count;
-
- count = 0;
- /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
- for (x = (yyn < 0 ? -yyn : 0);
- x < (sizeof(yytname) / sizeof(char *)); x++)
- if (yycheck[x + yyn] == x)
- size += strlen(yytname[x]) + 15, count++;
- msg = (char *) malloc(size + 15);
- if (msg != 0)
+ YYSIZE_T yysize = 0;
+ int yytype = YYTRANSLATE (yychar);
+ const char* yyprefix;
+ char *yymsg;
+ int yyx;
+
+ /* Start YYX at -YYN if negative to avoid negative indexes in
+ YYCHECK. */
+ int yyxbegin = yyn < 0 ? -yyn : 0;
+
+ /* Stay within bounds of both yycheck and yytname. */
+ int yychecklim = YYLAST - yyn;
+ int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
+ int yycount = 0;
+
+ yyprefix = ", expecting ";
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
+ {
+ yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
+ yycount += 1;
+ if (yycount == 5)
+ {
+ yysize = 0;
+ break;
+ }
+ }
+ yysize += (sizeof ("syntax error, unexpected ")
+ + yystrlen (yytname[yytype]));
+ yymsg = (char *) YYSTACK_ALLOC (yysize);
+ if (yymsg != 0)
{
- strcpy(msg, "parse error");
+ char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
+ yyp = yystpcpy (yyp, yytname[yytype]);
- if (count < 5)
+ if (yycount < 5)
{
- count = 0;
- for (x = (yyn < 0 ? -yyn : 0);
- x < (sizeof(yytname) / sizeof(char *)); x++)
- if (yycheck[x + yyn] == x)
+ yyprefix = ", expecting ";
+ for (yyx = yyxbegin; yyx < yyxend; ++yyx)
+ if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
{
- strcat(msg, count == 0 ? ", expecting `" : " or `");
- strcat(msg, yytname[x]);
- strcat(msg, "'");
- count++;
+ yyp = yystpcpy (yyp, yyprefix);
+ yyp = yystpcpy (yyp, yytname[yyx]);
+ yyprefix = " or ";
}
}
- yyerror(msg);
- free(msg);
+ yyerror (yymsg);
+ YYSTACK_FREE (yymsg);
}
else
- yyerror ("parse error; also virtual memory exceeded");
+ yyerror ("syntax error; also virtual memory exhausted");
}
else
#endif /* YYERROR_VERBOSE */
- yyerror("parse error");
+ yyerror ("syntax error");
}
- goto yyerrlab1;
-yyerrlab1: /* here on error raised explicitly by an action */
+
if (yyerrstatus == 3)
{
- /* if just tried and failed to reuse lookahead token after an error, discard it. */
-
- /* return failure if at end of input */
- if (yychar == YYEOF)
- YYABORT;
-
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
-#endif
+ /* If just tried and failed to reuse lookahead token after an
+ error, discard it. */
+
+ if (yychar <= YYEOF)
+ {
+ /* If at end of input, pop the error token,
+ then the rest of the stack, then return failure. */
+ if (yychar == YYEOF)
+ for (;;)
+ {
+ YYPOPSTACK;
+ if (yyssp == yyss)
+ YYABORT;
+ YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
+ yydestruct (yystos[*yyssp], yyvsp);
+ }
+ }
+ else
+ {
+ YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
+ yydestruct (yytoken, &yylval);
+ yychar = YYEMPTY;
- yychar = YYEMPTY;
+ }
}
- /* Else will try to reuse lookahead token
- after shifting the error token. */
-
- yyerrstatus = 3; /* Each real token shifted decrements this */
+ /* Else will try to reuse lookahead token after shifting the error
+ token. */
+ goto yyerrlab1;
- goto yyerrhandle;
-yyerrdefault: /* current state does not do anything special for the error token. */
+/*---------------------------------------------------.
+| yyerrorlab -- error raised explicitly by YYERROR. |
+`---------------------------------------------------*/
+yyerrorlab:
-#if 0
- /* This is wrong; only states that explicitly want error tokens
- should shift them. */
- yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
- if (yyn) goto yydefault;
+#ifdef __GNUC__
+ /* Pacify GCC when the user code never invokes YYERROR and the label
+ yyerrorlab therefore never appears in user code. */
+ if (0)
+ goto yyerrorlab;
#endif
-yyerrpop: /* pop the current state because it cannot handle the error token */
-
- if (yyssp == yyss) YYABORT;
- yyvsp--;
- yystate = *--yyssp;
-#ifdef YYLSP_NEEDED
- yylsp--;
-#endif
+ yyvsp -= yylen;
+ yyssp -= yylen;
+ yystate = *yyssp;
+ goto yyerrlab1;
-#if YYDEBUG != 0
- if (yydebug)
- {
- short *ssp1 = yyss - 1;
- fprintf (stderr, "Error: state stack now");
- while (ssp1 != yyssp)
- fprintf (stderr, " %d", *++ssp1);
- fprintf (stderr, "\n");
- }
-#endif
-yyerrhandle:
+/*-------------------------------------------------------------.
+| yyerrlab1 -- common code for both syntax error and YYERROR. |
+`-------------------------------------------------------------*/
+yyerrlab1:
+ yyerrstatus = 3; /* Each real token shifted decrements this. */
- yyn = yypact[yystate];
- if (yyn == YYFLAG)
- goto yyerrdefault;
+ for (;;)
+ {
+ yyn = yypact[yystate];
+ if (yyn != YYPACT_NINF)
+ {
+ yyn += YYTERROR;
+ if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
+ {
+ yyn = yytable[yyn];
+ if (0 < yyn)
+ break;
+ }
+ }
- yyn += YYTERROR;
- if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
- goto yyerrdefault;
+ /* Pop the current state because it cannot handle the error token. */
+ if (yyssp == yyss)
+ YYABORT;
- yyn = yytable[yyn];
- if (yyn < 0)
- {
- if (yyn == YYFLAG)
- goto yyerrpop;
- yyn = -yyn;
- goto yyreduce;
+ YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
+ yydestruct (yystos[yystate], yyvsp);
+ YYPOPSTACK;
+ yystate = *yyssp;
+ YY_STACK_PRINT (yyss, yyssp);
}
- else if (yyn == 0)
- goto yyerrpop;
if (yyn == YYFINAL)
YYACCEPT;
-#if YYDEBUG != 0
- if (yydebug)
- fprintf(stderr, "Shifting error token, ");
-#endif
+ YYDPRINTF ((stderr, "Shifting error token, "));
*++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
- *++yylsp = yylloc;
-#endif
+
yystate = yyn;
goto yynewstate;
- yyacceptlab:
- /* YYACCEPT comes here. */
-#ifndef YYSTACK_USE_ALLOCA
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
-#endif
- }
+
+/*-------------------------------------.
+| yyacceptlab -- YYACCEPT comes here. |
+`-------------------------------------*/
+yyacceptlab:
+ yyresult = 0;
+ goto yyreturn;
+
+/*-----------------------------------.
+| yyabortlab -- YYABORT comes here. |
+`-----------------------------------*/
+yyabortlab:
+ yyresult = 1;
+ goto yyreturn;
+
+#ifndef yyoverflow
+/*----------------------------------------------.
+| yyoverflowlab -- parser overflow comes here. |
+`----------------------------------------------*/
+yyoverflowlab:
+ yyerror ("parser stack overflow");
+ yyresult = 2;
+ /* Fall through. */
#endif
- return 0;
- yyabortlab:
- /* YYABORT comes here. */
-#ifndef YYSTACK_USE_ALLOCA
- if (yyfree_stacks)
- {
- free (yyss);
- free (yyvs);
-#ifdef YYLSP_NEEDED
- free (yyls);
+yyreturn:
+#ifndef yyoverflow
+ if (yyss != yyssa)
+ YYSTACK_FREE (yyss);
#endif
- }
-#endif
- return 1;
+ return yyresult;
}
-#line 563 "pars0grm.y"
+
+
+#line 581 "pars0grm.y"
+
diff --git a/storage/innobase/pars/pars0grm.h b/storage/innobase/pars/pars0grm.h
index b2790949057..e35fcf47692 100644
--- a/storage/innobase/pars/pars0grm.h
+++ b/storage/innobase/pars/pars0grm.h
@@ -1,90 +1,220 @@
-#ifndef YYSTYPE
-#define YYSTYPE int
+/* A Bison parser, made by GNU Bison 1.875d. */
+
+/* Skeleton parser for Yacc-like parsing with Bison,
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
+
+ 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, 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., 59 Temple Place - Suite 330,
+ Boston, MA 02111-1307, USA. */
+
+/* As a special exception, when this file is copied by Bison into a
+ Bison output file, you may use that output file without restriction.
+ This special exception was added by the Free Software Foundation
+ in version 1.24 of Bison. */
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ PARS_INT_LIT = 258,
+ PARS_FLOAT_LIT = 259,
+ PARS_STR_LIT = 260,
+ PARS_NULL_LIT = 261,
+ PARS_ID_TOKEN = 262,
+ PARS_AND_TOKEN = 263,
+ PARS_OR_TOKEN = 264,
+ PARS_NOT_TOKEN = 265,
+ PARS_GE_TOKEN = 266,
+ PARS_LE_TOKEN = 267,
+ PARS_NE_TOKEN = 268,
+ PARS_PROCEDURE_TOKEN = 269,
+ PARS_IN_TOKEN = 270,
+ PARS_OUT_TOKEN = 271,
+ PARS_BINARY_TOKEN = 272,
+ PARS_BLOB_TOKEN = 273,
+ PARS_INT_TOKEN = 274,
+ PARS_INTEGER_TOKEN = 275,
+ PARS_FLOAT_TOKEN = 276,
+ PARS_CHAR_TOKEN = 277,
+ PARS_IS_TOKEN = 278,
+ PARS_BEGIN_TOKEN = 279,
+ PARS_END_TOKEN = 280,
+ PARS_IF_TOKEN = 281,
+ PARS_THEN_TOKEN = 282,
+ PARS_ELSE_TOKEN = 283,
+ PARS_ELSIF_TOKEN = 284,
+ PARS_LOOP_TOKEN = 285,
+ PARS_WHILE_TOKEN = 286,
+ PARS_RETURN_TOKEN = 287,
+ PARS_SELECT_TOKEN = 288,
+ PARS_SUM_TOKEN = 289,
+ PARS_COUNT_TOKEN = 290,
+ PARS_DISTINCT_TOKEN = 291,
+ PARS_FROM_TOKEN = 292,
+ PARS_WHERE_TOKEN = 293,
+ PARS_FOR_TOKEN = 294,
+ PARS_DDOT_TOKEN = 295,
+ PARS_CONSISTENT_TOKEN = 296,
+ PARS_READ_TOKEN = 297,
+ PARS_ORDER_TOKEN = 298,
+ PARS_BY_TOKEN = 299,
+ PARS_ASC_TOKEN = 300,
+ PARS_DESC_TOKEN = 301,
+ PARS_INSERT_TOKEN = 302,
+ PARS_INTO_TOKEN = 303,
+ PARS_VALUES_TOKEN = 304,
+ PARS_UPDATE_TOKEN = 305,
+ PARS_SET_TOKEN = 306,
+ PARS_DELETE_TOKEN = 307,
+ PARS_CURRENT_TOKEN = 308,
+ PARS_OF_TOKEN = 309,
+ PARS_CREATE_TOKEN = 310,
+ PARS_TABLE_TOKEN = 311,
+ PARS_INDEX_TOKEN = 312,
+ PARS_UNIQUE_TOKEN = 313,
+ PARS_CLUSTERED_TOKEN = 314,
+ PARS_DOES_NOT_FIT_IN_MEM_TOKEN = 315,
+ PARS_ON_TOKEN = 316,
+ PARS_ASSIGN_TOKEN = 317,
+ PARS_DECLARE_TOKEN = 318,
+ PARS_CURSOR_TOKEN = 319,
+ PARS_SQL_TOKEN = 320,
+ PARS_OPEN_TOKEN = 321,
+ PARS_FETCH_TOKEN = 322,
+ PARS_CLOSE_TOKEN = 323,
+ PARS_NOTFOUND_TOKEN = 324,
+ PARS_TO_CHAR_TOKEN = 325,
+ PARS_TO_NUMBER_TOKEN = 326,
+ PARS_TO_BINARY_TOKEN = 327,
+ PARS_BINARY_TO_NUMBER_TOKEN = 328,
+ PARS_SUBSTR_TOKEN = 329,
+ PARS_REPLSTR_TOKEN = 330,
+ PARS_CONCAT_TOKEN = 331,
+ PARS_INSTR_TOKEN = 332,
+ PARS_LENGTH_TOKEN = 333,
+ PARS_SYSDATE_TOKEN = 334,
+ PARS_PRINTF_TOKEN = 335,
+ PARS_ASSERT_TOKEN = 336,
+ PARS_RND_TOKEN = 337,
+ PARS_RND_STR_TOKEN = 338,
+ PARS_ROW_PRINTF_TOKEN = 339,
+ PARS_COMMIT_TOKEN = 340,
+ PARS_ROLLBACK_TOKEN = 341,
+ PARS_WORK_TOKEN = 342,
+ NEG = 343
+ };
#endif
-#define PARS_INT_LIT 257
-#define PARS_FLOAT_LIT 258
-#define PARS_STR_LIT 259
-#define PARS_NULL_LIT 260
-#define PARS_ID_TOKEN 261
-#define PARS_AND_TOKEN 262
-#define PARS_OR_TOKEN 263
-#define PARS_NOT_TOKEN 264
-#define PARS_GE_TOKEN 265
-#define PARS_LE_TOKEN 266
-#define PARS_NE_TOKEN 267
-#define PARS_PROCEDURE_TOKEN 268
-#define PARS_IN_TOKEN 269
-#define PARS_OUT_TOKEN 270
-#define PARS_INT_TOKEN 271
-#define PARS_INTEGER_TOKEN 272
-#define PARS_FLOAT_TOKEN 273
-#define PARS_CHAR_TOKEN 274
-#define PARS_IS_TOKEN 275
-#define PARS_BEGIN_TOKEN 276
-#define PARS_END_TOKEN 277
-#define PARS_IF_TOKEN 278
-#define PARS_THEN_TOKEN 279
-#define PARS_ELSE_TOKEN 280
-#define PARS_ELSIF_TOKEN 281
-#define PARS_LOOP_TOKEN 282
-#define PARS_WHILE_TOKEN 283
-#define PARS_RETURN_TOKEN 284
-#define PARS_SELECT_TOKEN 285
-#define PARS_SUM_TOKEN 286
-#define PARS_COUNT_TOKEN 287
-#define PARS_DISTINCT_TOKEN 288
-#define PARS_FROM_TOKEN 289
-#define PARS_WHERE_TOKEN 290
-#define PARS_FOR_TOKEN 291
-#define PARS_DDOT_TOKEN 292
-#define PARS_CONSISTENT_TOKEN 293
-#define PARS_READ_TOKEN 294
-#define PARS_ORDER_TOKEN 295
-#define PARS_BY_TOKEN 296
-#define PARS_ASC_TOKEN 297
-#define PARS_DESC_TOKEN 298
-#define PARS_INSERT_TOKEN 299
-#define PARS_INTO_TOKEN 300
-#define PARS_VALUES_TOKEN 301
-#define PARS_UPDATE_TOKEN 302
-#define PARS_SET_TOKEN 303
-#define PARS_DELETE_TOKEN 304
-#define PARS_CURRENT_TOKEN 305
-#define PARS_OF_TOKEN 306
-#define PARS_CREATE_TOKEN 307
-#define PARS_TABLE_TOKEN 308
-#define PARS_INDEX_TOKEN 309
-#define PARS_UNIQUE_TOKEN 310
-#define PARS_CLUSTERED_TOKEN 311
-#define PARS_DOES_NOT_FIT_IN_MEM_TOKEN 312
-#define PARS_ON_TOKEN 313
-#define PARS_ASSIGN_TOKEN 314
-#define PARS_DECLARE_TOKEN 315
-#define PARS_CURSOR_TOKEN 316
-#define PARS_SQL_TOKEN 317
-#define PARS_OPEN_TOKEN 318
-#define PARS_FETCH_TOKEN 319
-#define PARS_CLOSE_TOKEN 320
-#define PARS_NOTFOUND_TOKEN 321
-#define PARS_TO_CHAR_TOKEN 322
-#define PARS_TO_NUMBER_TOKEN 323
-#define PARS_TO_BINARY_TOKEN 324
-#define PARS_BINARY_TO_NUMBER_TOKEN 325
-#define PARS_SUBSTR_TOKEN 326
-#define PARS_REPLSTR_TOKEN 327
-#define PARS_CONCAT_TOKEN 328
-#define PARS_INSTR_TOKEN 329
-#define PARS_LENGTH_TOKEN 330
-#define PARS_SYSDATE_TOKEN 331
-#define PARS_PRINTF_TOKEN 332
-#define PARS_ASSERT_TOKEN 333
-#define PARS_RND_TOKEN 334
-#define PARS_RND_STR_TOKEN 335
-#define PARS_ROW_PRINTF_TOKEN 336
-#define PARS_COMMIT_TOKEN 337
-#define PARS_ROLLBACK_TOKEN 338
-#define PARS_WORK_TOKEN 339
-#define NEG 340
+#define PARS_INT_LIT 258
+#define PARS_FLOAT_LIT 259
+#define PARS_STR_LIT 260
+#define PARS_NULL_LIT 261
+#define PARS_ID_TOKEN 262
+#define PARS_AND_TOKEN 263
+#define PARS_OR_TOKEN 264
+#define PARS_NOT_TOKEN 265
+#define PARS_GE_TOKEN 266
+#define PARS_LE_TOKEN 267
+#define PARS_NE_TOKEN 268
+#define PARS_PROCEDURE_TOKEN 269
+#define PARS_IN_TOKEN 270
+#define PARS_OUT_TOKEN 271
+#define PARS_BINARY_TOKEN 272
+#define PARS_BLOB_TOKEN 273
+#define PARS_INT_TOKEN 274
+#define PARS_INTEGER_TOKEN 275
+#define PARS_FLOAT_TOKEN 276
+#define PARS_CHAR_TOKEN 277
+#define PARS_IS_TOKEN 278
+#define PARS_BEGIN_TOKEN 279
+#define PARS_END_TOKEN 280
+#define PARS_IF_TOKEN 281
+#define PARS_THEN_TOKEN 282
+#define PARS_ELSE_TOKEN 283
+#define PARS_ELSIF_TOKEN 284
+#define PARS_LOOP_TOKEN 285
+#define PARS_WHILE_TOKEN 286
+#define PARS_RETURN_TOKEN 287
+#define PARS_SELECT_TOKEN 288
+#define PARS_SUM_TOKEN 289
+#define PARS_COUNT_TOKEN 290
+#define PARS_DISTINCT_TOKEN 291
+#define PARS_FROM_TOKEN 292
+#define PARS_WHERE_TOKEN 293
+#define PARS_FOR_TOKEN 294
+#define PARS_DDOT_TOKEN 295
+#define PARS_CONSISTENT_TOKEN 296
+#define PARS_READ_TOKEN 297
+#define PARS_ORDER_TOKEN 298
+#define PARS_BY_TOKEN 299
+#define PARS_ASC_TOKEN 300
+#define PARS_DESC_TOKEN 301
+#define PARS_INSERT_TOKEN 302
+#define PARS_INTO_TOKEN 303
+#define PARS_VALUES_TOKEN 304
+#define PARS_UPDATE_TOKEN 305
+#define PARS_SET_TOKEN 306
+#define PARS_DELETE_TOKEN 307
+#define PARS_CURRENT_TOKEN 308
+#define PARS_OF_TOKEN 309
+#define PARS_CREATE_TOKEN 310
+#define PARS_TABLE_TOKEN 311
+#define PARS_INDEX_TOKEN 312
+#define PARS_UNIQUE_TOKEN 313
+#define PARS_CLUSTERED_TOKEN 314
+#define PARS_DOES_NOT_FIT_IN_MEM_TOKEN 315
+#define PARS_ON_TOKEN 316
+#define PARS_ASSIGN_TOKEN 317
+#define PARS_DECLARE_TOKEN 318
+#define PARS_CURSOR_TOKEN 319
+#define PARS_SQL_TOKEN 320
+#define PARS_OPEN_TOKEN 321
+#define PARS_FETCH_TOKEN 322
+#define PARS_CLOSE_TOKEN 323
+#define PARS_NOTFOUND_TOKEN 324
+#define PARS_TO_CHAR_TOKEN 325
+#define PARS_TO_NUMBER_TOKEN 326
+#define PARS_TO_BINARY_TOKEN 327
+#define PARS_BINARY_TO_NUMBER_TOKEN 328
+#define PARS_SUBSTR_TOKEN 329
+#define PARS_REPLSTR_TOKEN 330
+#define PARS_CONCAT_TOKEN 331
+#define PARS_INSTR_TOKEN 332
+#define PARS_LENGTH_TOKEN 333
+#define PARS_SYSDATE_TOKEN 334
+#define PARS_PRINTF_TOKEN 335
+#define PARS_ASSERT_TOKEN 336
+#define PARS_RND_TOKEN 337
+#define PARS_RND_STR_TOKEN 338
+#define PARS_ROW_PRINTF_TOKEN 339
+#define PARS_COMMIT_TOKEN 340
+#define PARS_ROLLBACK_TOKEN 341
+#define PARS_WORK_TOKEN 342
+#define NEG 343
+
+
+#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
+typedef int YYSTYPE;
+# define yystype YYSTYPE /* obsolescent; will be withdrawn */
+# define YYSTYPE_IS_DECLARED 1
+# define YYSTYPE_IS_TRIVIAL 1
+#endif
+
extern YYSTYPE yylval;
+
+
+
diff --git a/storage/innobase/pars/pars0grm.y b/storage/innobase/pars/pars0grm.y
index a142d04301e..435025d7386 100644
--- a/storage/innobase/pars/pars0grm.y
+++ b/storage/innobase/pars/pars0grm.y
@@ -44,6 +44,8 @@ yylex(void);
%token PARS_PROCEDURE_TOKEN
%token PARS_IN_TOKEN
%token PARS_OUT_TOKEN
+%token PARS_BINARY_TOKEN
+%token PARS_BLOB_TOKEN
%token PARS_INT_TOKEN
%token PARS_INTEGER_TOKEN
%token PARS_FLOAT_TOKEN
@@ -448,7 +450,8 @@ fetch_statement:
;
column_def:
- PARS_ID_TOKEN type_name { $$ = pars_column_def($1, $2); }
+ PARS_ID_TOKEN type_name opt_column_len opt_not_null
+ { $$ = pars_column_def($1, $2, $3, $4); }
;
column_def_list:
@@ -457,6 +460,19 @@ column_def_list:
{ $$ = que_node_list_add_last($1, $3); }
;
+opt_column_len:
+ /* Nothing */ { $$ = NULL; }
+ | '(' PARS_INT_LIT ')'
+ { $$ = $2; }
+;
+
+opt_not_null:
+ /* Nothing */ { $$ = NULL; }
+ | PARS_NOT_TOKEN PARS_NULL_LIT
+ { $$ = &pars_int_token;
+ /* pass any non-NULL pointer */ }
+;
+
not_fit_in_memory:
/* Nothing */ { $$ = NULL; }
| PARS_DOES_NOT_FIT_IN_MEM_TOKEN
@@ -506,7 +522,10 @@ rollback_statement:
type_name:
PARS_INT_TOKEN { $$ = &pars_int_token; }
+ | PARS_INTEGER_TOKEN { $$ = &pars_int_token; }
| PARS_CHAR_TOKEN { $$ = &pars_char_token; }
+ | PARS_BINARY_TOKEN { $$ = &pars_binary_token; }
+ | PARS_BLOB_TOKEN { $$ = &pars_blob_token; }
;
parameter_declaration:
diff --git a/storage/innobase/pars/pars0lex.l b/storage/innobase/pars/pars0lex.l
index e481634f77e..4224536d49e 100644
--- a/storage/innobase/pars/pars0lex.l
+++ b/storage/innobase/pars/pars0lex.l
@@ -26,12 +26,10 @@ How to make the InnoDB parser and lexer C files:
5. Rename lex.yy.c to lexyy.c.
-6. Remove the #include of unistd.h from about line 2500 of lexyy.c
-
-7. Add '#include "univ.i"' before #include <stdio.h> in lexyy.c
+6. Add '#include "univ.i"' before #include <stdio.h> in lexyy.c
(Needed for AIX)
-8. Add a type cast to int to the assignment below the comment
+7. Add a type cast to int to the assignment below the comment
'need more input.' (Removes a warning on Win64)
These instructions seem to work at least with bison-1.28 and flex-2.5.4 on
@@ -50,6 +48,7 @@ Linux.
%option noyy_scan_buffer
%option noyy_scan_bytes
%option noyy_scan_string
+%option nounistd
%{
#define YYSTYPE que_node_t*
@@ -191,6 +190,14 @@ In the state 'quoted', only two actions are possible (defined below). */
return(PARS_OUT_TOKEN);
}
+"BINARY" {
+ return(PARS_BINARY_TOKEN);
+}
+
+"BLOB" {
+ return(PARS_BLOB_TOKEN);
+}
+
"INT" {
return(PARS_INT_TOKEN);
}
diff --git a/storage/innobase/pars/pars0opt.c b/storage/innobase/pars/pars0opt.c
index 88022e2efe1..bb41b5da074 100644
--- a/storage/innobase/pars/pars0opt.c
+++ b/storage/innobase/pars/pars0opt.c
@@ -106,7 +106,7 @@ opt_check_exp_determined_before(
}
for (i = 0; i < nth_table; i++) {
-
+
table = sel_node_get_nth_plan(sel_node, i)->table;
if (sym_node->table == table) {
@@ -115,7 +115,7 @@ opt_check_exp_determined_before(
}
}
- return(FALSE);
+ return(FALSE);
}
/***********************************************************************
@@ -148,10 +148,10 @@ opt_look_for_col_in_comparison_before(
ut_ad(search_cond);
ut_a((search_cond->func == '<')
- || (search_cond->func == '>')
- || (search_cond->func == '=')
- || (search_cond->func == PARS_GE_TOKEN)
- || (search_cond->func == PARS_LE_TOKEN));
+ || (search_cond->func == '>')
+ || (search_cond->func == '=')
+ || (search_cond->func == PARS_GE_TOKEN)
+ || (search_cond->func == PARS_LE_TOKEN));
table = sel_node_get_nth_plan(sel_node, nth_table)->table;
@@ -161,7 +161,7 @@ opt_look_for_col_in_comparison_before(
} else if ((cmp_type == OPT_COMPARISON)
&& (search_cond->func != '<')
- && (search_cond->func != '>')
+ && (search_cond->func != '>')
&& (search_cond->func != PARS_GE_TOKEN)
&& (search_cond->func != PARS_LE_TOKEN)) {
@@ -176,14 +176,14 @@ opt_look_for_col_in_comparison_before(
if ((sym_node->token_type == SYM_COLUMN)
&& (sym_node->table == table)
&& (sym_node->col_no == col_no)) {
-
+
/* sym_node contains the desired column id */
/* Check if the expression on the right side of the
operator is already determined */
exp = que_node_get_next(arg);
-
+
if (opt_check_exp_determined_before(exp, sel_node,
nth_table)) {
*op = search_cond->func;
@@ -191,10 +191,10 @@ opt_look_for_col_in_comparison_before(
return(exp);
}
}
- }
+ }
- exp = search_cond->args;
- arg = que_node_get_next(arg);
+ exp = search_cond->args;
+ arg = que_node_get_next(arg);
if (que_node_get_type(arg) == QUE_NODE_SYMBOL) {
sym_node = arg;
@@ -202,7 +202,7 @@ opt_look_for_col_in_comparison_before(
if ((sym_node->token_type == SYM_COLUMN)
&& (sym_node->table == table)
&& (sym_node->col_no == col_no)) {
-
+
if (opt_check_exp_determined_before(exp, sel_node,
nth_table)) {
*op = opt_invert_cmp_op(search_cond->func);
@@ -210,8 +210,8 @@ opt_look_for_col_in_comparison_before(
return(exp);
}
}
- }
-
+ }
+
return(NULL);
}
@@ -243,12 +243,12 @@ opt_look_for_col_in_cond_before(
if (search_cond == NULL) {
return(NULL);
- }
+ }
ut_a(que_node_get_type(search_cond) == QUE_NODE_FUNC);
ut_a(search_cond->func != PARS_OR_TOKEN);
- ut_a(search_cond->func != PARS_NOT_TOKEN);
-
+ ut_a(search_cond->func != PARS_NOT_TOKEN);
+
if (search_cond->func == PARS_AND_TOKEN) {
new_cond = search_cond->args;
@@ -260,7 +260,7 @@ opt_look_for_col_in_cond_before(
}
new_cond = que_node_get_next(new_cond);
-
+
exp = opt_look_for_col_in_cond_before(cmp_type, col_no,
new_cond, sel_node, nth_table, op);
return(exp);
@@ -276,7 +276,7 @@ opt_look_for_col_in_cond_before(
/* If we will fetch in an ascending order, we cannot utilize an upper
limit for a column value; in a descending order, respectively, a lower
limit */
-
+
if (sel_node->asc && ((*op == '<') || (*op == PARS_LE_TOKEN))) {
return(NULL);
@@ -323,11 +323,11 @@ opt_calc_index_goodness(
page addresses as the last field, we must not put more fields in
the search tuple than dict_index_get_n_unique_in_tree(index); see
the note in btr_cur_search_to_nth_level. */
-
+
n_fields = dict_index_get_n_unique_in_tree(index);
mix_id_col_no = dict_table_get_sys_col_no(index->table, DATA_MIX_ID);
-
+
for (j = 0; j < n_fields; j++) {
col_no = dict_index_get_nth_col_no(index, j);
@@ -337,11 +337,11 @@ opt_calc_index_goodness(
sel_node, nth_table, &op);
if (col_no == mix_id_col_no) {
ut_ad(exp == NULL);
-
+
index_plan[j] = NULL;
*last_op = '=';
goodness += 4;
- } else if (exp) {
+ } else if (exp) {
/* The value for this column is exactly known already
at this stage of the join */
@@ -358,10 +358,10 @@ opt_calc_index_goodness(
index_plan[j] = exp;
*last_op = op;
goodness += 2;
- }
-
+ }
+
break;
- }
+ }
}
if (goodness >= 4 * dict_index_get_n_unique(index)) {
@@ -412,7 +412,7 @@ opt_op_to_search_mode(
return(PAGE_CUR_GE);
} else {
return(PAGE_CUR_LE);
- }
+ }
} else if (op == '<') {
ut_a(!asc);
return(PAGE_CUR_L);
@@ -490,8 +490,8 @@ opt_check_order_by(
column defined in the order-by clause, and for all the other tables
we should get only at most a single row, otherwise we cannot presently
calculate the order-by, as we have no sort utility */
-
- for (i = 0; i < sel_node->n_tables; i++) {
+
+ for (i = 0; i < sel_node->n_tables; i++) {
plan = sel_node_get_nth_plan(sel_node, i);
@@ -502,10 +502,10 @@ opt_check_order_by(
ut_a(plan->table == order_table);
ut_a((dict_index_get_n_unique(plan->index)
- <= plan->n_exact_match)
- || (dict_index_get_nth_col_no(plan->index,
- plan->n_exact_match)
- == order_col_no));
+ <= plan->n_exact_match)
+ || (dict_index_get_nth_col_no(plan->index,
+ plan->n_exact_match)
+ == order_col_no));
}
}
}
@@ -547,7 +547,7 @@ opt_search_plan_for_table(
index = dict_table_get_first_index(table);
best_index = index; /* Eliminate compiler warning */
best_goodness = 0;
-
+
/* should be do ... until ? comment by Jani */
while (index) {
goodness = opt_calc_index_goodness(index, sel_node, i,
@@ -564,7 +564,7 @@ opt_search_plan_for_table(
}
index = dict_table_get_next_index(index);
- }
+ }
plan->index = best_index;
@@ -577,24 +577,24 @@ opt_search_plan_for_table(
plan->tuple = dtuple_create(pars_sym_tab_global->heap,
n_fields);
dict_index_copy_types(plan->tuple, plan->index, n_fields);
-
+
plan->tuple_exps = mem_heap_alloc(pars_sym_tab_global->heap,
n_fields * sizeof(void*));
ut_memcpy(plan->tuple_exps, best_index_plan,
- n_fields * sizeof(void*));
+ n_fields * sizeof(void*));
if (best_last_op == '=') {
plan->n_exact_match = n_fields;
} else {
plan->n_exact_match = n_fields - 1;
}
-
+
plan->mode = opt_op_to_search_mode(sel_node->asc,
best_last_op);
}
if ((best_index->type & DICT_CLUSTERED)
- && (plan->n_exact_match >= dict_index_get_n_unique(best_index))) {
+ && (plan->n_exact_match >= dict_index_get_n_unique(best_index))) {
plan->unique_search = TRUE;
} else {
@@ -602,25 +602,25 @@ opt_search_plan_for_table(
}
if ((table->type != DICT_TABLE_ORDINARY)
- && (best_index->type & DICT_CLUSTERED)) {
+ && (best_index->type & DICT_CLUSTERED)) {
- plan->mixed_index = TRUE;
+ plan->mixed_index = TRUE;
- mix_id_pos = table->mix_len;
+ mix_id_pos = table->mix_len;
- if (mix_id_pos < n_fields) {
- /* We have to add the mix id as a (string) literal
+ if (mix_id_pos < n_fields) {
+ /* We have to add the mix id as a (string) literal
expression to the tuple_exps */
plan->tuple_exps[mix_id_pos] =
sym_tab_add_str_lit(pars_sym_tab_global,
table->mix_id_buf,
table->mix_id_len);
- }
+ }
} else {
plan->mixed_index = FALSE;
}
-
+
plan->old_vers_heap = NULL;
btr_pcur_init(&(plan->pcur));
@@ -690,9 +690,9 @@ opt_classify_comparison(
the testing is necessary when the cursor is reversed. */
if ((n_fields > plan->n_exact_match)
- && opt_is_arg(plan->tuple_exps[n_fields - 1], cond)) {
+ && opt_is_arg(plan->tuple_exps[n_fields - 1], cond)) {
- return(OPT_SCROLL_COND);
+ return(OPT_SCROLL_COND);
}
/* If the condition is a non-exact match condition on the first field
@@ -701,12 +701,12 @@ opt_classify_comparison(
access the table, it is classified as OPT_END_COND */
if ((dict_index_get_n_fields(plan->index) > plan->n_exact_match)
- && opt_look_for_col_in_comparison_before(
- OPT_COMPARISON,
- dict_index_get_nth_col_no(plan->index,
- plan->n_exact_match),
- cond, sel_node, i, &op)) {
-
+ && opt_look_for_col_in_comparison_before(
+ OPT_COMPARISON,
+ dict_index_get_nth_col_no(plan->index,
+ plan->n_exact_match),
+ cond, sel_node, i, &op)) {
+
if (sel_node->asc && ((op == '<') || (op == PARS_LE_TOKEN))) {
return(OPT_END_COND);
@@ -749,7 +749,7 @@ opt_find_test_conds(
opt_find_test_conds(sel_node, i, new_cond);
new_cond = que_node_get_next(new_cond);
-
+
opt_find_test_conds(sel_node, i, new_cond);
return;
@@ -808,7 +808,7 @@ opt_normalize_cmp_conds(
cond = UT_LIST_GET_NEXT(cond_list, cond);
}
-}
+}
/***********************************************************************
Finds out the search condition conjuncts we can, and need, to test as the ith
@@ -827,7 +827,7 @@ opt_determine_and_normalize_test_conds(
UT_LIST_INIT(plan->end_conds);
UT_LIST_INIT(plan->other_conds);
-
+
/* Recursively go through the conjuncts and classify them */
opt_find_test_conds(sel_node, i, sel_node->search_cond);
@@ -868,7 +868,7 @@ opt_find_all_cols(
return;
}
-
+
if (que_node_get_type(exp) == QUE_NODE_FUNC) {
func_node = exp;
@@ -929,12 +929,12 @@ opt_find_all_cols(
sym_node->copy_val = copy_val;
/* Fill in the field_no fields in sym_node */
-
+
sym_node->field_nos[SYM_CLUST_FIELD_NO]
= dict_index_get_nth_col_pos(
dict_table_get_first_index(index->table),
sym_node->col_no);
- if (!(index->type & DICT_CLUSTERED)) {
+ if (!(index->type & DICT_CLUSTERED)) {
ut_a(plan);
@@ -944,7 +944,7 @@ opt_find_all_cols(
plan->must_get_clust = TRUE;
}
-
+
sym_node->field_nos[SYM_SEC_FIELD_NO] = col_pos;
}
}
@@ -969,16 +969,16 @@ opt_find_copy_cols(
return;
}
-
+
ut_ad(que_node_get_type(search_cond) == QUE_NODE_FUNC);
if (search_cond->func == PARS_AND_TOKEN) {
new_cond = search_cond->args;
opt_find_copy_cols(sel_node, i, new_cond);
-
+
new_cond = que_node_get_next(new_cond);
-
+
opt_find_copy_cols(sel_node, i, new_cond);
return;
@@ -991,7 +991,7 @@ opt_find_copy_cols(
fetch from the ith table */
plan = sel_node_get_nth_plan(sel_node, i);
-
+
opt_find_all_cols(TRUE, plan->index, &(plan->columns), plan,
search_cond);
}
@@ -1036,7 +1036,7 @@ opt_classify_cols(
/* All remaining columns in the search condition are temporary
columns: therefore FALSE */
-
+
opt_find_all_cols(FALSE, plan->index, &(plan->columns), plan,
sel_node->search_cond);
}
@@ -1064,10 +1064,10 @@ opt_clust_access(
plan = sel_node_get_nth_plan(sel_node, n);
index = plan->index;
-
+
/* The final value of the following field depends on the environment
of the select statement: */
-
+
plan->no_prefetch = FALSE;
if (index->type & DICT_CLUSTERED) {
@@ -1088,9 +1088,9 @@ opt_clust_access(
plan->clust_ref = dtuple_create(heap, n_fields);
dict_index_copy_types(plan->clust_ref, clust_index, n_fields);
-
+
plan->clust_map = mem_heap_alloc(heap, n_fields * sizeof(ulint));
-
+
for (i = 0; i < n_fields; i++) {
pos = dict_index_get_nth_field_pos(index, clust_index, i);
@@ -1100,8 +1100,8 @@ opt_clust_access(
tables, and they should not contain column prefix indexes. */
if (dict_index_get_nth_field(index, pos)->prefix_len != 0
- || dict_index_get_nth_field(clust_index, i)
- ->prefix_len != 0) {
+ || dict_index_get_nth_field(clust_index, i)
+ ->prefix_len != 0) {
fprintf(stderr,
"InnoDB: Error in pars0opt.c: table %s has prefix_len != 0\n",
index->table_name);
@@ -1111,15 +1111,15 @@ opt_clust_access(
ut_ad((pos != ULINT_UNDEFINED)
|| ((table->type == DICT_TABLE_CLUSTER_MEMBER)
- && (i == table->mix_len)));
+ && (i == table->mix_len)));
}
if (table->type == DICT_TABLE_CLUSTER_MEMBER) {
-
+
/* Preset the mix id field to the mix id constant */
-
+
dfield = dtuple_get_nth_field(plan->clust_ref, table->mix_len);
-
+
dfield_set_data(dfield, mem_heap_alloc(heap,
table->mix_id_len),
table->mix_id_len);
@@ -1142,7 +1142,7 @@ opt_search_plan(
dict_table_t* table;
order_node_t* order_by;
ulint i;
-
+
sel_node->plans = mem_heap_alloc(pars_sym_tab_global->heap,
sel_node->n_tables * sizeof(plan_t));
@@ -1159,18 +1159,18 @@ opt_search_plan(
sel_node->asc = order_by->asc;
}
-
+
for (i = 0; i < sel_node->n_tables; i++) {
table = table_node->table;
/* Choose index through which to access the table */
-
+
opt_search_plan_for_table(sel_node, i, table);
/* Determine the search condition conjuncts we can test at
this table; normalize the end conditions */
-
+
opt_determine_and_normalize_test_conds(sel_node, i);
table_node = que_node_get_next(table_node);
@@ -1192,10 +1192,10 @@ opt_search_plan(
table_node = que_node_get_next(table_node);
}
-
+
/* Check that the plan obeys a possible order-by clause: if not,
an assertion error occurs */
-
+
opt_check_order_by(sel_node);
#ifdef UNIV_SQL_DEBUG
@@ -1244,8 +1244,8 @@ opt_print_query_plan(
fputs("Table ", stderr);
dict_index_name_print(stderr, NULL, plan->index);
fprintf(stderr,"; exact m. %lu, match %lu, end conds %lu\n",
- (unsigned long) plan->n_exact_match,
- (unsigned long) n_fields,
+ (unsigned long) plan->n_exact_match,
+ (unsigned long) n_fields,
(unsigned long) UT_LIST_GET_LEN(plan->end_conds));
}
}
diff --git a/storage/innobase/pars/pars0pars.c b/storage/innobase/pars/pars0pars.c
index c62184abd85..1b7a3a653a9 100644
--- a/storage/innobase/pars/pars0pars.c
+++ b/storage/innobase/pars/pars0pars.c
@@ -62,6 +62,8 @@ pars_res_word_t pars_rnd_str_token = {PARS_RND_STR_TOKEN};
pars_res_word_t pars_count_token = {PARS_COUNT_TOKEN};
pars_res_word_t pars_sum_token = {PARS_SUM_TOKEN};
pars_res_word_t pars_distinct_token = {PARS_DISTINCT_TOKEN};
+pars_res_word_t pars_binary_token = {PARS_BINARY_TOKEN};
+pars_res_word_t pars_blob_token = {PARS_BLOB_TOKEN};
pars_res_word_t pars_int_token = {PARS_INT_TOKEN};
pars_res_word_t pars_char_token = {PARS_CHAR_TOKEN};
pars_res_word_t pars_float_token = {PARS_FLOAT_TOKEN};
@@ -128,7 +130,7 @@ pars_func_get_class(
return(PARS_FUNC_OTHER);
}
}
-
+
/*************************************************************************
Parses an operator or predefined function expression. */
static
@@ -146,7 +148,7 @@ pars_func_low(
node->common.type = QUE_NODE_FUNC;
dfield_set_data(&(node->common.val), NULL, 0);
node->common.val_buf_size = 0;
-
+
node->func = func;
node->class = pars_func_get_class(func);
@@ -165,7 +167,7 @@ func_node_t*
pars_func(
/*======*/
/* out, own: function node in a query tree */
- que_node_t* res_word,/* in: function name reserved word */
+ que_node_t* res_word,/* in: function name reserved word */
que_node_t* arg) /* in: first argument in the argument list */
{
return(pars_func_low(((pars_res_word_t*)res_word)->code, arg));
@@ -207,7 +209,7 @@ pars_order_by(
node = mem_heap_alloc(pars_sym_tab_global->heap, sizeof(order_node_t));
node->common.type = QUE_NODE_ORDER;
-
+
node->column = column;
if (asc == &pars_asc_token) {
@@ -233,15 +235,15 @@ pars_resolve_func_data_type(
ulint func;
ut_a(que_node_get_type(node) == QUE_NODE_FUNC);
-
+
arg = node->args;
func = node->func;
if ((func == PARS_SUM_TOKEN)
- || (func == '+') || (func == '-') || (func == '*')
+ || (func == '+') || (func == '-') || (func == '*')
|| (func == '/') || (func == '+')) {
-
+
/* Inherit the data type from the first argument (which must
not be the SQL null literal whose type is DATA_ERROR) */
@@ -253,7 +255,7 @@ pars_resolve_func_data_type(
} else if (func == PARS_COUNT_TOKEN) {
ut_a(arg);
dtype_set(que_node_get_data_type(node), DATA_INT, 0, 4, 0);
-
+
} else if (func == PARS_TO_CHAR_TOKEN) {
ut_a(dtype_get_mtype(que_node_get_data_type(arg)) == DATA_INT);
dtype_set(que_node_get_data_type(node), DATA_VARCHAR,
@@ -360,7 +362,7 @@ pars_resolve_exp_variables_and_types(
return;
}
-
+
ut_a(que_node_get_type(exp_node) == QUE_NODE_SYMBOL);
sym_node = exp_node;
@@ -369,7 +371,7 @@ pars_resolve_exp_variables_and_types(
return;
}
-
+
/* Not resolved yet: look in the symbol table for a variable
or a cursor with the same name */
@@ -386,7 +388,7 @@ pars_resolve_exp_variables_and_types(
/* Found a variable or a cursor declared with
the same name */
-
+
break;
}
@@ -397,12 +399,12 @@ pars_resolve_exp_variables_and_types(
fprintf(stderr, "PARSER ERROR: Unresolved identifier %s\n",
sym_node->name);
}
-
+
ut_a(node);
sym_node->resolved = TRUE;
sym_node->token_type = SYM_IMPLICIT_VAR;
- sym_node->alias = node;
+ sym_node->alias = node;
sym_node->indirection = node;
if (select_node) {
@@ -466,7 +468,7 @@ pars_resolve_exp_columns(
return;
}
-
+
ut_a(que_node_get_type(exp_node) == QUE_NODE_SYMBOL);
sym_node = exp_node;
@@ -475,7 +477,7 @@ pars_resolve_exp_columns(
return;
}
-
+
/* Not resolved yet: look in the table list for a column with the
same name */
@@ -490,17 +492,18 @@ pars_resolve_exp_columns(
col = dict_table_get_nth_col(table, i);
if ((sym_node->name_len == ut_strlen(col->name))
- && (0 == ut_memcmp(sym_node->name, col->name,
- sym_node->name_len))) {
- /* Found */
+ && (0 == ut_memcmp(sym_node->name, col->name,
+ sym_node->name_len))) {
+ /* Found */
sym_node->resolved = TRUE;
sym_node->token_type = SYM_COLUMN;
sym_node->table = table;
sym_node->col_no = i;
sym_node->prefetch_buf = NULL;
-
+
dfield_set_type(&(sym_node->common.val),
dict_col_get_type(col));
+
return;
}
}
@@ -543,7 +546,7 @@ pars_retrieve_table_def(
sym_node->token_type = SYM_TABLE;
table_name = (const char*) sym_node->name;
-
+
sym_node->table = dict_table_get_low(table_name);
ut_a(sym_node->table);
@@ -559,7 +562,7 @@ pars_retrieve_table_list_defs(
sym_node_t* sym_node) /* in: first table node in list */
{
ulint count = 0;
-
+
if (sym_node == NULL) {
return(count);
@@ -592,7 +595,7 @@ pars_select_all_columns(
ulint i;
select_node->select_list = NULL;
-
+
table_node = select_node->table_list;
while (table_node) {
@@ -630,7 +633,7 @@ pars_select_list(
sel_node_t* node;
node = sel_node_create(pars_sym_tab_global->heap);
-
+
node->select_list = select_list;
node->into_list = into_list;
@@ -659,7 +662,7 @@ pars_check_aggregate(
while (exp_node) {
n_nodes++;
-
+
if (que_node_get_type(exp_node) == QUE_NODE_FUNC) {
func_node = exp_node;
@@ -709,7 +712,7 @@ pars_select_statement(
/* SELECT * FROM ... */
pars_select_all_columns(select_node);
}
-
+
if (select_node->into_list) {
ut_a(que_node_list_get_len(select_node->into_list)
== que_node_list_get_len(select_node->select_list));
@@ -750,7 +753,7 @@ pars_select_statement(
if (order_by) {
pars_resolve_exp_columns(table_list, order_by->column);
}
-
+
/* The final value of the following fields depend on the environment
where the select statement appears: */
@@ -780,7 +783,7 @@ pars_cursor_declaration(
select_node->state = SEL_NODE_CLOSED;
select_node->explicit_cursor = sym_node;
- return(sym_node);
+ return(sym_node);
}
/*************************************************************************
@@ -794,10 +797,10 @@ pars_update_statement_start(
ibool is_delete, /* in: TRUE if delete */
sym_node_t* table_sym, /* in: table name node */
col_assign_node_t* col_assign_list)/* in: column assignment list, NULL
- if delete */
+ if delete */
{
upd_node_t* node;
-
+
node = upd_node_create(pars_sym_tab_global->heap);
node->is_delete = is_delete;
@@ -807,7 +810,7 @@ pars_update_statement_start(
return(node);
}
-
+
/*************************************************************************
Parses a column assignment in an update. */
@@ -852,7 +855,7 @@ pars_process_assign_list(
table_sym = node->table_sym;
col_assign_list = node->col_assign_list;
clust_index = dict_table_get_first_index(node->table);
-
+
assign_node = col_assign_list;
n_assigns = 0;
@@ -863,7 +866,7 @@ pars_process_assign_list(
/* ut_a(dtype_get_mtype(dfield_get_type(
que_node_get_val(assign_node->col)))
- == dtype_get_mtype(dfield_get_type(
+ == dtype_get_mtype(dfield_get_type(
que_node_get_val(assign_node->val)))); */
/* Add to the update node all the columns found in assignment
@@ -897,8 +900,8 @@ pars_process_assign_list(
dict_index_get_nth_type(clust_index,
upd_field->field_no))) {
changes_field_size = 0;
- }
-
+ }
+
assign_node = que_node_get_next(assign_node);
}
@@ -910,10 +913,10 @@ pars_process_assign_list(
node->update)) {
changes_ord_field = 0;
}
-
+
node->cmpl_info = changes_ord_field | changes_field_size;
}
-
+
/*************************************************************************
Parses an update or delete statement. */
@@ -932,14 +935,14 @@ pars_update_statement(
plan_t* plan;
table_sym = node->table_sym;
-
+
pars_retrieve_table_def(table_sym);
node->table = table_sym->table;
UT_LIST_INIT(node->columns);
-
+
/* Make the single table node into a list of table nodes of length 1 */
-
+
que_node_list_add_last(NULL, table_sym);
if (cursor_sym) {
@@ -956,7 +959,7 @@ pars_update_statement(
node->searched_update = TRUE;
sel_node->common.parent = node;
}
-
+
node->select = sel_node;
ut_a(!node->is_delete || (node->col_assign_list == NULL));
@@ -982,9 +985,9 @@ pars_update_statement(
ut_a(sel_node->is_aggregate == FALSE);
sel_node->can_get_updated = TRUE;
-
+
node->state = UPD_NODE_UPDATE_CLUSTERED;
-
+
plan = sel_node_get_nth_plan(sel_node, 0);
plan->no_prefetch = TRUE;
@@ -1023,7 +1026,7 @@ pars_insert_statement(
/* out, own: update node in a query
tree */
sym_node_t* table_sym, /* in: table name node */
- que_node_t* values_list, /* in: value expression list or NULL */
+ que_node_t* values_list, /* in: value expression list or NULL */
sel_node_t* select) /* in: select condition or NULL */
{
ins_node_t* node;
@@ -1059,7 +1062,7 @@ pars_insert_statement(
ut_a(que_node_list_get_len(select->select_list)
== dict_table_get_n_user_cols(table_sym->table));
}
-
+
node->values_list = values_list;
if (node->values_list) {
@@ -1078,17 +1081,61 @@ static
void
pars_set_dfield_type(
/*=================*/
- dfield_t* dfield, /* in: dfield */
- pars_res_word_t* type) /* in: pointer to a type token */
+ dfield_t* dfield, /* in: dfield */
+ pars_res_word_t* type, /* in: pointer to a type
+ token */
+ ulint len, /* in: length, or 0 */
+ ibool is_not_null) /* in: if TRUE, column is
+ NOT NULL. */
{
+ ulint flags = 0;
+
+ if (is_not_null) {
+ flags |= DATA_NOT_NULL;
+ }
+
if (type == &pars_int_token) {
+ if (len != 0) {
+ ut_error;
+ }
- dtype_set(dfield_get_type(dfield), DATA_INT, 0, 4, 0);
+ dtype_set(dfield_get_type(dfield), DATA_INT, flags, 4, 0);
} else if (type == &pars_char_token) {
+ if (len != 0) {
+ ut_error;
+ }
dtype_set(dfield_get_type(dfield), DATA_VARCHAR,
- DATA_ENGLISH, 0, 0);
+ DATA_ENGLISH | flags, 0, 0);
+ } else if (type == &pars_binary_token) {
+ if (len == 0) {
+ ut_error;
+ }
+
+ dtype_set(dfield_get_type(dfield), DATA_FIXBINARY,
+ DATA_BINARY_TYPE | flags, len, 0);
+ } else if (type == &pars_blob_token) {
+ if (len != 0) {
+ ut_error;
+ }
+
+ dtype_set(dfield_get_type(dfield), DATA_BLOB,
+ DATA_BINARY_TYPE | flags, 0, 0);
+ } else if (type == &pars_binary_token) {
+ if (len == 0) {
+ ut_error;
+ }
+
+ dtype_set(dfield_get_type(dfield), DATA_FIXBINARY,
+ DATA_BINARY_TYPE, len, 0);
+ } else if (type == &pars_blob_token) {
+ if (len != 0) {
+ ut_error;
+ }
+
+ dtype_set(dfield_get_type(dfield), DATA_BLOB,
+ DATA_BINARY_TYPE, 0, 0);
} else {
ut_error;
}
@@ -1111,8 +1158,8 @@ pars_variable_declaration(
node->param_type = PARS_NOT_PARAM;
- pars_set_dfield_type(que_node_get_val(node), type);
-
+ pars_set_dfield_type(que_node_get_val(node), type, 0, FALSE);
+
return(node);
}
@@ -1129,7 +1176,7 @@ pars_parameter_declaration(
ulint param_type,
/* in: PARS_INPUT or PARS_OUTPUT */
pars_res_word_t* type) /* in: pointer to a type token */
-{
+{
ut_a((param_type == PARS_INPUT) || (param_type == PARS_OUTPUT));
pars_variable_declaration(node, type);
@@ -1158,7 +1205,7 @@ pars_set_parent_in_list(
common = que_node_get_next(common);
}
-}
+}
/*************************************************************************
Parses an elsif element. */
@@ -1179,7 +1226,7 @@ pars_elsif_element(
node->cond = cond;
pars_resolve_exp_variables_and_types(NULL, cond);
-
+
node->stat_list = stat_list;
return(node);
@@ -1207,7 +1254,7 @@ pars_if_statement(
node->cond = cond;
pars_resolve_exp_variables_and_types(NULL, cond);
-
+
node->stat_list = stat_list;
if (else_part && (que_node_get_type(else_part) == QUE_NODE_ELSIF)) {
@@ -1232,7 +1279,7 @@ pars_if_statement(
}
pars_set_parent_in_list(stat_list, node);
-
+
return(node);
}
@@ -1259,7 +1306,7 @@ pars_while_statement(
node->stat_list = stat_list;
pars_set_parent_in_list(stat_list, node);
-
+
return(node);
}
@@ -1295,7 +1342,7 @@ pars_for_statement(
node->stat_list = stat_list;
pars_set_parent_in_list(stat_list, node);
-
+
return(node);
}
@@ -1337,9 +1384,9 @@ pars_assignment_statement(
pars_resolve_exp_variables_and_types(NULL, var);
pars_resolve_exp_variables_and_types(NULL, val);
-
+
ut_a(dtype_get_mtype(dfield_get_type(que_node_get_val(var)))
- == dtype_get_mtype(dfield_get_type(que_node_get_val(val))));
+ == dtype_get_mtype(dfield_get_type(que_node_get_val(val))));
return(node);
}
@@ -1359,7 +1406,7 @@ pars_procedure_call(
node = pars_func(res_word, args);
pars_resolve_exp_list_variables_and_types(NULL, args);
-
+
return(node);
}
@@ -1378,8 +1425,8 @@ pars_fetch_statement(
node = mem_heap_alloc(pars_sym_tab_global->heap, sizeof(fetch_node_t));
- node->common.type = QUE_NODE_FETCH;
-
+ node->common.type = QUE_NODE_FETCH;
+
pars_resolve_exp_variables_and_types(NULL, cursor);
pars_resolve_exp_list_variables_and_types(NULL, into_list);
@@ -1413,7 +1460,7 @@ pars_open_statement(
node = mem_heap_alloc(pars_sym_tab_global->heap, sizeof(open_node_t));
- node->common.type = QUE_NODE_OPEN;
+ node->common.type = QUE_NODE_OPEN;
pars_resolve_exp_variables_and_types(NULL, cursor);
@@ -1437,11 +1484,11 @@ pars_row_printf_statement(
sel_node_t* sel_node) /* in: select node */
{
row_printf_node_t* node;
-
+
node = mem_heap_alloc(pars_sym_tab_global->heap,
sizeof(row_printf_node_t));
node->common.type = QUE_NODE_ROW_PRINTF;
-
+
node->sel_node = sel_node;
sel_node->common.parent = node;
@@ -1475,12 +1522,26 @@ Parses a column definition at a table creation. */
sym_node_t*
pars_column_def(
/*============*/
- /* out: column sym table node */
- sym_node_t* sym_node, /* in: column node in the symbol
- table */
- pars_res_word_t* type) /* in: data type */
+ /* out: column sym table
+ node */
+ sym_node_t* sym_node, /* in: column node in the
+ symbol table */
+ pars_res_word_t* type, /* in: data type */
+ sym_node_t* len, /* in: length of column, or
+ NULL */
+ void* is_not_null) /* in: if not NULL, column
+ is of type NOT NULL. */
{
- pars_set_dfield_type(que_node_get_val(sym_node), type);
+ ulint len2;
+
+ if (len) {
+ len2 = eval_node_get_int_val(len);
+ } else {
+ len2 = 0;
+ }
+
+ pars_set_dfield_type(que_node_get_val(sym_node), type, len2,
+ is_not_null != NULL);
return(sym_node);
}
@@ -1517,7 +1578,7 @@ pars_create_table(
/* As the InnoDB SQL parser is for internal use only,
for creating some system tables, this function will only
create tables in the old (not compact) record format. */
- table = dict_mem_table_create(table_sym->name, 0, n_cols, FALSE);
+ table = dict_mem_table_create(table_sym->name, 0, n_cols, 0);
if (not_fit_in_memory != NULL) {
table->does_not_fit_in_memory = TRUE;
@@ -1527,7 +1588,7 @@ pars_create_table(
while (column) {
dtype = dfield_get_type(que_node_get_val(column));
-
+
dict_mem_table_add_col(table, column->name, dtype->mtype,
dtype->prtype, dtype->len,
dtype->prec);
@@ -1536,12 +1597,12 @@ pars_create_table(
column = que_node_get_next(column);
}
-
+
node = tab_create_graph_create(table, pars_sym_tab_global->heap);
table_sym->resolved = TRUE;
table_sym->token_type = SYM_TABLE;
-
+
return(node);
}
@@ -1577,20 +1638,20 @@ pars_create_index(
if (clustered_def) {
ind_type = ind_type | DICT_CLUSTERED;
}
-
+
index = dict_mem_index_create(table_sym->name, index_sym->name, 0,
ind_type, n_fields);
column = column_list;
while (column) {
- dict_mem_index_add_field(index, column->name, 0, 0);
+ dict_mem_index_add_field(index, column->name, 0);
column->resolved = TRUE;
column->token_type = SYM_COLUMN;
column = que_node_get_next(column);
}
-
+
node = ind_create_graph_create(index, pars_sym_tab_global->heap);
table_sym->resolved = TRUE;
@@ -1633,7 +1694,7 @@ pars_procedure_definition(
sym_node->token_type = SYM_PROCEDURE_NAME;
sym_node->resolved = TRUE;
-
+
node->proc_id = sym_node;
node->param_list = param_list;
node->stat_list = stat_list;
@@ -1644,7 +1705,7 @@ pars_procedure_definition(
thr->child = node;
- pars_sym_tab_global->query_graph = fork;
+ pars_sym_tab_global->query_graph = fork;
return(fork);
}
@@ -1678,13 +1739,13 @@ pars_get_lex_chars(
in the buffer */
{
int len;
-
+
len = pars_sym_tab_global->string_len
- pars_sym_tab_global->next_char_pos;
if (len == 0) {
#ifdef YYDEBUG
/* fputs("SQL string ends\n", stderr); */
-#endif
+#endif
*result = 0;
return;
@@ -1696,7 +1757,7 @@ pars_get_lex_chars(
#ifdef UNIV_SQL_DEBUG
if (pars_print_lexed) {
-
+
if (len >= 5) {
len = 5;
}
@@ -1706,7 +1767,7 @@ pars_get_lex_chars(
1, len, stderr);
}
#endif /* UNIV_SQL_DEBUG */
-
+
ut_memcpy(buf, pars_sym_tab_global->sql_string +
pars_sym_tab_global->next_char_pos, len);
*result = len;
@@ -1756,7 +1817,7 @@ pars_sql(
pars_sym_tab_global->sql_string = mem_heap_strdup(heap, str);
pars_sym_tab_global->string_len = strlen(str);
pars_sym_tab_global->next_char_pos = 0;
-
+
yyparse();
sym_node = UT_LIST_GET_FIRST(pars_sym_tab_global->sym_list);
@@ -1792,7 +1853,7 @@ pars_complete_graph_for_exec(
{
que_fork_t* fork;
que_thr_t* thr;
-
+
fork = que_fork_create(NULL, NULL, QUE_FORK_MYSQL_INTERFACE, heap);
fork->trx = trx;
@@ -1803,6 +1864,6 @@ pars_complete_graph_for_exec(
que_node_set_parent(node, thr);
trx->graph = NULL;
-
+
return(thr);
}
diff --git a/storage/innobase/pars/pars0sym.c b/storage/innobase/pars/pars0sym.c
index 8ade5579e47..d8025998f9a 100644
--- a/storage/innobase/pars/pars0sym.c
+++ b/storage/innobase/pars/pars0sym.c
@@ -66,7 +66,7 @@ sym_tab_free_private(
if (sym->cursor_def) {
que_graph_free_recursive(sym->cursor_def);
}
-
+
sym = UT_LIST_GET_NEXT(sym_list, sym);
}
@@ -91,23 +91,23 @@ sym_tab_add_int_lit(
{
sym_node_t* node;
byte* data;
-
+
node = mem_heap_alloc(sym_tab->heap, sizeof(sym_node_t));
node->common.type = QUE_NODE_SYMBOL;
-
+
node->resolved = TRUE;
node->token_type = SYM_LIT;
node->indirection = NULL;
-
+
dtype_set(&(node->common.val.type), DATA_INT, 0, 4, 0);
data = mem_heap_alloc(sym_tab->heap, 4);
mach_write_to_4(data, val);
dfield_set_data(&(node->common.val), data, 4);
-
+
node->common.val_buf_size = 0;
node->prefetch_buf = NULL;
node->cursor_def = NULL;
@@ -115,7 +115,7 @@ sym_tab_add_int_lit(
UT_LIST_ADD_LAST(sym_list, sym_tab->sym_list, node);
node->sym_table = sym_tab;
-
+
return(node);
}
@@ -133,7 +133,7 @@ sym_tab_add_str_lit(
{
sym_node_t* node;
byte* data;
-
+
node = mem_heap_alloc(sym_tab->heap, sizeof(sym_node_t));
node->common.type = QUE_NODE_SYMBOL;
@@ -142,7 +142,7 @@ sym_tab_add_str_lit(
node->token_type = SYM_LIT;
node->indirection = NULL;
-
+
dtype_set(&(node->common.val.type), DATA_VARCHAR, DATA_ENGLISH, 0, 0);
if (len) {
@@ -157,7 +157,7 @@ sym_tab_add_str_lit(
node->common.val_buf_size = 0;
node->prefetch_buf = NULL;
node->cursor_def = NULL;
-
+
UT_LIST_ADD_LAST(sym_list, sym_tab->sym_list, node);
node->sym_table = sym_tab;
@@ -175,16 +175,16 @@ sym_tab_add_null_lit(
sym_tab_t* sym_tab) /* in: symbol table */
{
sym_node_t* node;
-
+
node = mem_heap_alloc(sym_tab->heap, sizeof(sym_node_t));
node->common.type = QUE_NODE_SYMBOL;
-
+
node->resolved = TRUE;
node->token_type = SYM_LIT;
node->indirection = NULL;
-
+
node->common.val.type.mtype = DATA_ERROR;
dfield_set_data(&(node->common.val), NULL, UNIV_SQL_NULL);
@@ -192,7 +192,7 @@ sym_tab_add_null_lit(
node->common.val_buf_size = 0;
node->prefetch_buf = NULL;
node->cursor_def = NULL;
-
+
UT_LIST_ADD_LAST(sym_list, sym_tab->sym_list, node);
node->sym_table = sym_tab;
@@ -212,11 +212,11 @@ sym_tab_add_id(
ulint len) /* in: identifier length */
{
sym_node_t* node;
-
+
node = mem_heap_alloc(sym_tab->heap, sizeof(sym_node_t));
node->common.type = QUE_NODE_SYMBOL;
-
+
node->resolved = FALSE;
node->indirection = NULL;
@@ -230,7 +230,7 @@ sym_tab_add_id(
node->common.val_buf_size = 0;
node->prefetch_buf = NULL;
node->cursor_def = NULL;
-
+
node->sym_table = sym_tab;
return(node);
View Lorry Controller Status