The version of Apache log4j used by SoundHelix.

[[ 🗃 ^aEp6o apache-log4j ]] :: [📥 Inbox] [📤 Outbox] [🐤 Followers] [🤝 Collaborators] [🛠 Commits]

Clone

HTTPS: git clone https://vervis.peers.community/repos/aEp6o

SSH: git clone USERNAME@vervis.peers.community:aEp6o

Branches

Tags

1.3alpha-7 :: tests / src / java / org / apache / log4j / scheduler /

SchedulerTest.java

/*
 * Copyright 1999,2004 The Apache Software Foundation.
 *
 * Licensed 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.log4j.scheduler;

import junit.framework.Test;
import junit.framework.TestCase;
import junit.framework.TestSuite;

import java.util.Iterator;
import java.util.Random;
import java.util.Vector;


/**
 * @author Ceki Gulcu
 *
 */
public class SchedulerTest extends TestCase {
  static final long TOLERATED_GAP = 2000;
  Random random = new Random(480361007);

  public SchedulerTest(String arg0) {
    super(arg0);
  }

  protected void setUp() throws Exception {
    super.setUp();
  }

  protected void tearDown() throws Exception {
    super.tearDown();
  }

  public void testBasic() {
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    long now = System.currentTimeMillis();
    long expected = now + 100;
    CountingJob cj = new CountingJob(0, expected);
    scheduler.schedule(cj, expected);
    sleep(300);
    assertEquals(1, cj.count);
  }

  public void testMultipleEvents() {
    Vector jobs = new Vector();
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    long now = System.currentTimeMillis();

    int loopLength = 100;

    for (int i = 0; i < loopLength; i++) {
      long expected = now + (i * 100);
      CountingJob cj = new CountingJob(i, expected);
      jobs.add(cj);
      scheduler.schedule(cj, expected);
    }

    sleep((100 * loopLength) + 200);

    for (Iterator i = jobs.iterator(); i.hasNext();) {
      CountingJob cj = (CountingJob) i.next();
      assertEquals(1, cj.count);
    }
  }

  public void testDelete() {
    Vector jobs = new Vector();
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    long now = System.currentTimeMillis();

    long expected0 = now + 200;
    CountingJob cj0 = new CountingJob(0, expected0);
    long expected1 = expected0 + 200;
    CountingJob cj1 = new CountingJob(1, expected1);
    scheduler.schedule(cj0, expected0);
    scheduler.schedule(cj1, expected1);
    scheduler.delete(cj0);
    cj0.markAsDeleted();
    sleep(100 + (3 * 200));
    assertEquals(0, cj0.count);
    assertEquals(1, cj1.count);
  }

  /**
   * A test that inserts and deltes a large number of jobs at random
   */
  public void testRandom() {
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    Vector jobVector = new Vector();
    Vector deletedVector = new Vector();

    // the approximative duration of this test in millisecs
    final int TEST_DURATION = 15000;

    // the frequncy of operations in millisecs
    final int OP_FREQUENCY = 25;

    // The number of times we will perform an operation on the scheduler
    final int MAX_OPS = TEST_DURATION / OP_FREQUENCY;

    long start = System.currentTimeMillis();

    for (long i = 0; i < MAX_OPS; i++) {
      if (shouldDelete() && !jobVector.isEmpty()) {
        int indexToDelete = getRandomIndexToDelete(jobVector.size());
        CountingJob j = (CountingJob) jobVector.remove(indexToDelete);

        scheduler.delete(j);
        deletedVector.add(j);
        j.markAsDeleted();
      } else {
        long expected = start + random.nextInt(TEST_DURATION);
        CountingJob cj;
        
        if (shouldBePeriodic()) {
          System.out.println(i+ " is periodic");
          // the period should be at least 50 millis
          int period = random.nextInt(500)+50;
          cj = new PeriodicJob((int) i, expected, period);
          jobVector.add(cj);
          scheduler.schedule(cj, expected, period);
        } else {
          cj = new CountingJob((int) i, expected);
          jobVector.add(cj);
          scheduler.schedule(cj, expected);
        }
        
      }
    }

    long loopEnd = System.currentTimeMillis();
    sleep(TEST_DURATION - (loopEnd - start) + 2000);

    long endOfExecution = System.currentTimeMillis();

    if (deletedVector.size() > (MAX_OPS / 2)) {
      fail("too many deleted jobs: " + deletedVector.size());
    }

    if (jobVector.size() < (MAX_OPS / 2)) {
      fail("too few jobs: " + jobVector.size());
    }

    for (Iterator i = jobVector.iterator(); i.hasNext();) {
      CountingJob cj = (CountingJob) i.next();
      cj.sanityCheck(endOfExecution);
    }

    for (Iterator i = deletedVector.iterator(); i.hasNext();) {
      CountingJob cj = (CountingJob) i.next();
      cj.sanityCheck(endOfExecution);
    }
  }

  public void testPeriodic() {
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    long now = System.currentTimeMillis();
    long firstOn = now;
    long period = 100;
    PeriodicJob pj = new PeriodicJob(0, firstOn, period);
    scheduler.schedule(pj, firstOn, period);

    int NUM_PERIODS = 10;
    sleep(period * (NUM_PERIODS+1));

    scheduler.shutdown();

    long endOfExecution = System.currentTimeMillis();

    if (pj.count <  NUM_PERIODS) {
      fail(
        "Periodic job executed only " + pj.count + " times. Expected at least"
        + NUM_PERIODS);
    }
    pj.sanityCheck(endOfExecution);
  }

  public void testMultiplePeriodic() {
    Vector jobs = new Vector();
    Scheduler scheduler = new Scheduler();
    scheduler.start();

    long now = System.currentTimeMillis();
    long period = 100;
    long runLen = 10;

    for (int i = 0; i < runLen; i++) {
      long firstOn = now + i;
      PeriodicJob pj = new PeriodicJob(i, firstOn, period);
      scheduler.schedule(pj, firstOn, period);
      jobs.add(pj);
    }

    int NUM_PERIODS = 10;
    sleep(period * NUM_PERIODS);
    scheduler.shutdown();

    long endOfExecution = System.currentTimeMillis();

    for (int i = 0; i < runLen; i++) {
      PeriodicJob pj = (PeriodicJob) jobs.get(i);

      // allow for 15% error margin
      if ((pj.count*1.15) < NUM_PERIODS) {
        fail(
          "Periodic job executed only " + pj.count
          + " times. Expected at least " + NUM_PERIODS);
      }
      pj.sanityCheck(endOfExecution);
    }
  }

  boolean shouldDelete() {
    int r = random.nextInt(2);

    if (r == 2) {
      return true;
    } else {
      return false;
    }
  }

  // One in every 10 tests should be periodic
  boolean shouldBePeriodic() {
    int r = random.nextInt(10);

    if (r == 0) {
      return true;
    } else {
      return false;
    }
  }

  // On average, make the index of 1 out of 5 deletes zero
  int getRandomIndexToDelete(int range) {
    int r = random.nextInt(5);

    if (r == 0) {
      return 0;
    } else {
      return random.nextInt(range);
    }
  }

  void sleep(long duration) {
    try {
      Thread.sleep(duration);
    } catch (InterruptedException ie) {
    }
  }

  public static Test xsuite() {
    TestSuite suite = new TestSuite();

    suite.addTest(new SchedulerTest("testRandom"));
    //suite.addTest(new SchedulerTest("testPeriodic"));
    //suite.addTest(new SchedulerTest("testMultiplePeriodic"));
    return suite;
  }
}
[See repo JSON]