*** old/src/share/vm/gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.cpp	Thu Jan 30 13:10:42 2014
--- new/src/share/vm/gc_implementation/concurrentMarkSweep/concurrentMarkSweepGeneration.cpp	Thu Jan 30 13:10:41 2014

*** 956,966 ****
--- 956,966 ----
        gclog_or_tty->print_cr("  Free fraction %f", free_percentage);
        gclog_or_tty->print_cr("  Desired free fraction %f",
          desired_free_percentage);
        gclog_or_tty->print_cr("  Maximum free fraction %f",
          maximum_free_percentage);
!       gclog_or_tty->print_cr("  Capactiy "SIZE_FORMAT, capacity()/1000);
!       gclog_or_tty->print_cr("  Capacity "SIZE_FORMAT, capacity()/1000);
        gclog_or_tty->print_cr("  Desired capacity "SIZE_FORMAT,
          desired_capacity/1000);
        int prev_level = level() - 1;
        if (prev_level >= 0) {
          size_t prev_size = 0;

*** 3311,3321 ****
--- 3311,3321 ----
      set_verifying(should_verify);    // Set verification state for this cycle
      return;                            // Nothing else needs to be done at this time
    }
  
    // Not unloading classes this cycle
!   assert(!should_unload_classes(), "Inconsitency!");
!   assert(!should_unload_classes(), "Inconsistency!");
    remove_root_scanning_option(SharedHeap::SO_SystemClasses);
    add_root_scanning_option(SharedHeap::SO_AllClasses);
  
    if ((!verifying() || unloaded_classes_last_cycle()) && should_verify) {
      // Include symbols, strings and code cache elements to prevent their resurrection.

*** 7241,7251 ****
--- 7241,7251 ----
  size_t SurvivorSpacePrecleanClosure::do_object_careful(oop p) {
  
    HeapWord* addr = (HeapWord*)p;
    DEBUG_ONLY(_collector->verify_work_stacks_empty();)
    assert(!_span.contains(addr), "we are scanning the survivor spaces");
!   assert(p->klass_or_null() != NULL, "object should be initializd");
!   assert(p->klass_or_null() != NULL, "object should be initialized");
    // an initialized object; ignore mark word in verification below
    // since we are running concurrent with mutators
    assert(p->is_oop(true), "should be an oop");
    // Note that we do not yield while we iterate over
    // the interior oops of p, pushing the relevant ones