Remove unused variables in the relocation packer.

tools/relocation_packer/src/elf_file.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 // Implementation notes:
 //
 // We need to remove a piece from the ELF shared library.  However, we also
 // want to ensure that code and data loads at the same addresses as before
 // packing, so that tools like breakpad can still match up addresses found
 // in any crash dumps with data extracted from the pre-packed version of
@@ skipping 986 matching lines @@
   if (relative_relocations.empty()) {
     LOG(ERROR) << "No relative relocations found (already packed?)";
     return false;
   }
 
   // If not padding fully, apply only enough padding to preserve alignment.
   // Otherwise, pad so that we do not shrink the relocations section at all.
   if (!is_padding_relocations_) {
     // Calculate the size of the hole we will close up when we rewrite
     // dynamic relocations.
-    ELF::Shdr* section_header = ELF::getshdr(relocations_section_);
-    const ELF::Off hole_start = section_header->sh_offset;
     ssize_t hole_size =
         relative_relocations.size() * sizeof(relative_relocations[0]);
     const ssize_t unaligned_hole_size = hole_size;
 
     // Adjust the actual hole size to preserve alignment.  We always adjust
     // by a whole number of NONE-type relocations.
     while (hole_size % kPreserveAlignment)
       hole_size -= sizeof(relative_relocations[0]);
     LOG(INFO) << "Compaction    : " << hole_size << " bytes";
 
@@ skipping 191 matching lines @@
 
   // If we found the same number of null relocation entries in the dynamic
   // relocations section as we hold as unpacked relative relocations, then
   // this is a padded file.
   const bool is_padded = padding == relative_relocations.size();
 
   // Unless padded, report by how much we expand the file.
   if (!is_padded) {
     // Calculate the size of the hole we will open up when we rewrite
     // dynamic relocations.
-    ELF::Shdr* section_header = ELF::getshdr(relocations_section_);
-    const ELF::Off hole_start = section_header->sh_offset;
     ssize_t hole_size =
         relative_relocations.size() * sizeof(relative_relocations[0]);
 
     // Adjust the hole size for the padding added to preserve alignment.
     hole_size -= padding * sizeof(other_relocations[0]);
     LOG(INFO) << "Expansion     : " << hole_size << " bytes";
   }
 
   // Rewrite the current dynamic relocations section to be the relative
   // relocations followed by other relocations.  This is the usual order in
@@ skipping 48 matching lines @@
 
   // Clean up libelf, and truncate the output file to the number of bytes
   // written by elf_update().
   elf_end(elf_);
   elf_ = NULL;
   const int truncate = ftruncate(fd_, file_bytes);
   CHECK(truncate == 0);
 }
 
 }  // namespace relocation_packer