1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 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 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to you under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.derbyTesting.functionTests.tests.lang;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.sql.Statement;
import java.util.Random;
import junit.framework.Test;
import org.apache.derbyTesting.junit.BaseJDBCTestCase;
import org.apache.derbyTesting.junit.BaseTestSuite;
import org.apache.derbyTesting.junit.CleanDatabaseTestSetup;
// This test tries to push byte code generation to the limit.
// It has to be run with a large amount of memory which is set with jvmflags in
// largeCodeGen_app.properties
// There are only a few types of cases now. Other areas need to be tested such as large in clauses, etc.
//
public class largeCodeGen extends BaseJDBCTestCase
{
private static boolean TEST_QUERY_EXECUTION = true;
public largeCodeGen(String name)
{
super(name);
}
public static Test suite() {
BaseTestSuite suite = new BaseTestSuite();
// Code generation test, just invoke on embedded
// as the main function is to test the byte code compiler.
if (usingEmbedded()) {
suite.addTestSuite(largeCodeGen.class);
return new CleanDatabaseTestSetup(suite);
}
return suite;
}
protected void setUp() throws SQLException
{
getConnection().setAutoCommit(false);
Statement stmt = createStatement();
String createSQL = "create table t0 " +
"(si smallint,i int, bi bigint, r real, f float, d double precision, n5_2 numeric(5,2), dec10_3 decimal(10,3), ch20 char(3),vc varchar(20), lvc long varchar)";
stmt.executeUpdate(createSQL);
stmt.executeUpdate("insert into t0 values(2,3,4,5.3,5.3,5.3,31.13,123456.123, 'one','one','one')");
stmt.close();
commit();
}
protected void tearDown() throws Exception
{
Statement stmt = createStatement();
stmt.execute("DROP TABLE T0");
stmt.close();
commit();
super.tearDown();
}
/**
* Prepares and executes query against table t0 with n parameters
* The assumption is that the query will always return our one row
* of data inserted into the t0 table.
*
* @param testName
* @param sqlBuffer - StringBuffer with SQL Text
* @param numParams - Number of parameters
* @param paramValue - Parameter value
* @return true if the check fails
*/
private boolean checkT0Query(String testName,
StringBuffer sqlBuffer, int numParams, int paramValue) {
PreparedStatement ps;
try {
ps = prepareStatement(sqlBuffer.toString());
if (TEST_QUERY_EXECUTION)
{
for (int i = 1; i <= numParams; i++)
{
ps.setInt(i, paramValue);
}
ResultSet rs = ps.executeQuery();
rs.next();
checkRowData(rs);
rs.close();
}
ps.close();
commit();
return false;
}catch (SQLException e)
{
// The top level exception is expected to be
// the "user-friendly" query is too complex
// rather than some linkage error.
assertSQLState("42ZA0", e);
return true;
}
}
/**
* Test many logical operators in the where clause.
*/
public void testLogicalOperators() throws SQLException {
int passCount = 0;
for (int count = 700; count <= 10000 ; count += 100)
{
// keep testing until it fails
if (logicalOperators(count))
break;
passCount = count;
}
// svn 372388 trunk - passed @ 400
// Fix to DERBY-921 - passed @ 800
// DERBY-921 - support 32bit branch offsets
assertEquals("logical operators change from previous limit",
800, passCount);
// 10,000 causes Stack overflow and database corruption
//testLogicalOperators(con, 10000);
}
/**
* Tests numParam parameter markers in a where clause
*
* @param numOperands
*/
private boolean logicalOperators(int numOperands) throws SQLException {
// First with parameters
String pred = "(si = ? AND si = ? )";
String testName = "Logical operators with " + numOperands + " parameters";
StringBuffer sqlBuffer = new StringBuffer((numOperands * 20) + 512);
sqlBuffer.append("SELECT * FROM T0 WHERE " + pred );
for (int i = 2; i < numOperands; i+=2)
{
sqlBuffer.append(" OR " + pred);
}
return checkT0Query(testName, sqlBuffer, numOperands, 2);
}
public void testInClause() throws SQLException {
// DERBY-739 raised number of parameters from 2700 to 3400
// svn 372388 trunk - passed @ 3400
// So perform a quick check there.
assertFalse("IN clause with 3400 parameters ", inClause(3400));
int passCount = 0;
for (int count = 97000; count <= 200000 ; count += 1000)
{
// keep testing until it fails.
if (inClause(count))
break;
passCount = count;
}
// fixes for DERBY-766 to split methods with individual statements
// bumps the limit to 98,000 parameters.
assertEquals("IN clause change from previous limit", 98000, passCount);
}
/**
* Test in clause with many parameters
*
* @param numParams Number of parameters to test
* @return true if the test fails
* @throws SQLException
*/
private boolean inClause(int numParams) throws SQLException {
String testName = "IN clause with " + numParams + " parameters";
StringBuffer sqlBuffer = new StringBuffer((numParams * 20) + 512);
sqlBuffer.append("SELECT * FROM T0 WHERE SI IN (" );
for (int i = 1; i < numParams; i++)
{
sqlBuffer.append("?, ");
}
sqlBuffer.append("?)");
return checkT0Query(testName, sqlBuffer, numParams, 2);
}
public void testUnions() throws SQLException
{
String viewName = "v0";
Statement stmt = createStatement();
StringBuffer createView = new StringBuffer("create view " + viewName +
" as select * from t0 " );
for (int i = 1; i < 100; i ++)
{
createView.append(" UNION ALL (SELECT * FROM t0 )");
}
//System.out.println(createViewString);
stmt.executeUpdate(createView.toString());
commit();
int passCount = 0;
for (int count = 1000; count <= 1000; count += 1000)
{
// keep testing until it fails
if (largeUnionSelect(viewName, count))
break;
passCount = count;
}
// 10000 gives a different constant pool error
// DERBY-1315 gives out of memory error.
//assertTrue("10000 UNION passed!",
// largeUnionSelect(viewName, 10000));
createStatement().executeUpdate("DROP VIEW " + viewName);
// svn 372388 trunk - passed @ 900
// trunk now back to 700
//
assertEquals("UNION operators change from previous limit",
1000, passCount);
}
private boolean largeUnionSelect(String viewName,
int numUnions) throws SQLException
{
// There are 100 unions in each view so round to the nearest 100
String unionClause = " UNION ALL (SELECT * FROM " + viewName + ")";
StringBuffer selectSQLBuffer =
new StringBuffer(((numUnions/100) * unionClause.length()) + 512);
selectSQLBuffer.append("select * from t0 ");
for (int i = 1; i < numUnions/100;i++)
{
selectSQLBuffer.append(unionClause);
}
try {
// Ready to execute the problematic query
String selectSQL = selectSQLBuffer.toString();
//System.out.println(selectSQL);
PreparedStatement pstmt = prepareStatement(selectSQL);
if (largeCodeGen.TEST_QUERY_EXECUTION)
{
ResultSet rs = pstmt.executeQuery();
int numRows = 0;
while (rs.next())
{
numRows++;
if ((numRows % 100) == 0)
checkRowData(rs);
}
rs.close();
commit();
}
pstmt.close();
return false;
} catch (SQLException sqle)
{
// The top level exception is expected to be
// the "user-friendly" query is too complex
// rather than some linkage error.
assertSQLState("42ZA0", sqle);
return true;
}
}
// Check the data on the positioned row against what we inserted.
private static void checkRowData(ResultSet rs) throws SQLException
{
//" values(2,3,4,5.3,5.3,5.3,31.13,123456.123, 'one','one','one')");
String[] values = {"2", "3", "4", "5.3","5.3","5.3","31.13","123456.123",
"one","one","one"};
for (int i = 1; i <= 11; i ++)
{
assertEquals("Result set data value: ",
values[i-1], rs.getString(i));
}
}
/**
* Test an INSERT statement with a large number of rows in the VALUES clause.
* Reported as DERBY-1714.
* @throws SQLException
*
*/
public void testInsertValues() throws SQLException {
int passCount = 0;
for (int count = 1500; count <= 1700; count += 200) {
// keep testing until it fails
if (insertValues(count))
break;
passCount = count;
}
// Final fixes for DERBY-766 pushed the limit to 1700
// Beyond that a StackOverflow occurs.
assertEquals("INSERT VALUES change from previous limit", 1700, passCount);
}
/**
* Create a large insert statement with rowCount rows all with
* constants. Prepare and execute it and then rollback to leave
* the table unchanged.
* @param rowCount
* @return false if rollback succeeds, otherwise true
* @throws SQLException
*/
private boolean insertValues(int rowCount) throws SQLException {
Random r = new Random(3457245435L);
StringBuffer insertSQL = new StringBuffer(
"INSERT INTO T0(SI,I,BI,R,F,D,N5_2,DEC10_3,CH20,VC,LVC) VALUES\n");
for (int i = 0; i < rowCount; i++) {
if (i != 0)
insertSQL.append(',');
insertSQL.append('(');
insertSQL.append(((short) r.nextInt()));
insertSQL.append(',');
insertSQL.append(i);
insertSQL.append(',');
insertSQL.append(r.nextLong());
insertSQL.append(',');
insertSQL.append(r.nextFloat());
insertSQL.append(',');
insertSQL.append(r.nextFloat());
insertSQL.append(',');
insertSQL.append(r.nextDouble());
insertSQL.append(',');
insertSQL.append("462.54");
insertSQL.append(',');
insertSQL.append("9324324.34");
insertSQL.append(',');
insertSQL.append('\'');
insertSQL.append("c");
insertSQL.append(r.nextInt() % 10);
insertSQL.append('\'');
insertSQL.append(',');
insertSQL.append('\'');
insertSQL.append("vc");
insertSQL.append(r.nextInt() % 1000000);
insertSQL.append('\'');
insertSQL.append(',');
insertSQL.append('\'');
insertSQL.append("lvc");
insertSQL.append(r.nextInt());
insertSQL.append('\'');
insertSQL.append(')');
insertSQL.append('\n');
}
try {
PreparedStatement ps = prepareStatement(insertSQL.toString());
assertEquals("Incorrect update count", rowCount, ps.executeUpdate());
ps.close();
rollback();
return false;
} catch (SQLException e) {
// The top level exception is expected to be
// the "user-friendly" query is too complex
// rather than some linkage error.
assertSQLState("42ZA0", e);
}
return true;
}
}
|