mirror of
https://github.com/QuasarApp/LIEF.git
synced 2025-04-28 05:14:33 +00:00
b94900ca7f
Major changes (features):
* Enable adding multiple sections/segments - Executable (PIE or not), Library
* Enable adding multiple dynamic entries (DT_NEEDED, DT_INIT etc)
* Enable adding multiple relocations
* Enable adding multiple dynamic symbols
* Enable segment replacement
Major changes (API):
* Getters Binary::get_*name*() has been renamed to "name()"
* Binary::add(const DynamicEntry& entry) - To add an entry in the dynamic table
* Section& Binary::add(const Section& section, bool loaded = true) - To add a section(s)
* Segment& Binary::add(const Segment& segment, uint64_t base = 0) - To add segments
* Segment& replace(const Segment& new_segment, const Segment& original_segment, uint64_t base = 0)
* Binary's last_offset_section(), last_offset_segment(), next_virtual_address()
to have information about offset
* Binary's add_library(), get_library(), has_library() to handle
DT_NEEDED entries
Other changes:
* Binary::insert_content() - Use add(const Section&) or add(const Segment&) instead
* ELF's DataHandler has been cleaned
* Through LIEF::Section one can look for integers, strings, data
within the section (see LIEF::Section::search,
LIEF::Section::search_all)
* Through LIEF::Binary one can get *xref* of a number (or address)
see LIEF::Binary::xref function
* To access to the Abstract binary in Python, one can now use
the 'abstract' attribute. (e.g. binary.abstract.header.is_32)
Resolve: #83
Resolve: #66
Resolve: #48
72 lines
2.4 KiB
C++
72 lines
2.4 KiB
C++
/* Copyright 2017 R. Thomas
|
||
* Copyright 2017 Quarkslab
|
||
*
|
||
* 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.
|
||
*/
|
||
#include <iostream>
|
||
#include <memory>
|
||
#include <iostream>
|
||
#include <fstream>
|
||
#include <algorithm>
|
||
#include <iterator>
|
||
|
||
#include <LIEF/ELF.hpp>
|
||
|
||
//
|
||
// Rename the first section name.
|
||
// Ex: ./tools/ELFSectionRename /bin/ls ./lsRename
|
||
//
|
||
// $ readelf -S /bin/ls
|
||
//
|
||
// [Nr] Nom Type Adresse Décalage
|
||
// Taille TaillEntrée Fanion Lien Info Alignement
|
||
// [ 0] NULL 0000000000000000 00000000
|
||
// 0000000000000000 0000000000000000 0 0 0
|
||
// [ 1] .interp PROGBITS 0000000000400238 00000238
|
||
// 000000000000001c 0000000000000000 A 0 0 1
|
||
// [ 2] .note.ABI-tag NOTE 0000000000400254 00000254
|
||
// 0000000000000020 0000000000000000 A 0 0 4
|
||
//
|
||
// $ readelf -S ./lsRename
|
||
//
|
||
// En-têtes de section :
|
||
// [Nr] Nom Type Adresse Décalage
|
||
// Taille TaillEntrée Fanion Lien Info Alignement
|
||
// [ 0] toto NULL 0000000000000000 00000000
|
||
// 0000000000000000 0000000000000000 0 0 0
|
||
// [ 1] .interp PROGBITS 0000000000400238 00000238
|
||
// 000000000000001c 0000000000000000 A 0 0 1
|
||
// [ 2] .note.ABI-tag NOTE 0000000000400254 00000254
|
||
// 0000000000000020 0000000000000000 A 0 0 4
|
||
// ....
|
||
//
|
||
//
|
||
//
|
||
int main(int argc, char **argv) {
|
||
std::cout << "ELF Section rename" << std::endl;
|
||
if (argc != 3) {
|
||
std::cerr << "Usage: " << argv[0] << " <Original Binary> <Output Binary>" << std::endl;
|
||
return -1;
|
||
}
|
||
|
||
std::unique_ptr<LIEF::ELF::Binary> binary{LIEF::ELF::Parser::parse(argv[1])};
|
||
|
||
LIEF::ELF::Section& section = binary->sections()[0];
|
||
section.name("toto");
|
||
binary->write(argv[2]);
|
||
|
||
return 0;
|
||
|
||
|
||
}
|