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
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
|
// inremental.cc -- incremental linking support for gold
// Copyright 2009 Free Software Foundation, Inc.
// Written by Mikolaj Zalewski <mikolajz@google.com>.
// This file is part of gold.
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
// MA 02110-1301, USA.
#include "gold.h"
#include <cstdarg>
#include "elfcpp.h"
#include "output.h"
#include "incremental.h"
#include "archive.h"
#include "output.h"
#include "target-select.h"
using elfcpp::Convert;
namespace gold {
// Version information. Will change frequently during the development, later
// we could think about backward (and forward?) compatibility.
const unsigned int INCREMENTAL_LINK_VERSION = 1;
namespace internal {
// Header of the .gnu_incremental_input section.
struct Incremental_inputs_header_data
{
// Incremental linker version.
elfcpp::Elf_Word version;
// Numer of input files in the link.
elfcpp::Elf_Word input_file_count;
// Offset of command line options in .gnu_incremental_strtab.
elfcpp::Elf_Word command_line_offset;
// Padding.
elfcpp::Elf_Word reserved;
};
// Data stored in .gnu_incremental_input after the header for each of the
// Incremental_input_header_data::input_file_count input entries.
struct Incremental_inputs_entry_data
{
// Offset of file name in .gnu_incremental_strtab section.
elfcpp::Elf_Word filename_offset;
// Offset of data in .gnu_incremental_input.
elfcpp::Elf_Word data_offset;
// Timestamp (in seconds).
elfcpp::Elf_Xword timestamp_sec;
// Nano-second part of timestamp (if supported).
elfcpp::Elf_Word timestamp_nsec;
// Type of the input entry.
elfcpp::Elf_Half input_type;
// Padding.
elfcpp::Elf_Half reserved;
};
}
// Accessors.
// Reader class for .gnu_incremental_inputs header. See
// internal::Incremental_inputs_header_data for fields descriptions.
template<int size, bool big_endian>
class Incremental_inputs_header
{
private:
typedef internal::Incremental_inputs_header_data Data_type;
public:
Incremental_inputs_header(const unsigned char *p)
: p_(reinterpret_cast<const Data_type*>(p))
{ }
static const int data_size = sizeof(Data_type);
elfcpp::Elf_Word
get_version() const
{ return Convert<32, big_endian>::convert_host(this->p_->version); }
elfcpp::Elf_Word
get_input_file_count() const
{ return Convert<32, big_endian>::convert_host(this->p_->input_file_count); }
elfcpp::Elf_Word
get_command_line_offset() const
{ return Convert<32, big_endian>::convert_host(this->p_->command_line_offset); }
elfcpp::Elf_Word
get_reserved() const
{ return Convert<32, big_endian>::convert_host(this->p_->reserved); }
private:
const Data_type* p_;
};
// Writer class for .gnu_incremental_inputs header. See
// internal::Incremental_inputs_header_data for fields descriptions.
template<int size, bool big_endian>
class Incremental_inputs_header_write
{
private:
typedef internal::Incremental_inputs_header_data Data_type;
public:
Incremental_inputs_header_write(unsigned char *p)
: p_(reinterpret_cast<Data_type*>(p))
{ }
static const int data_size = sizeof(Data_type);
void
put_version(elfcpp::Elf_Word v)
{ this->p_->version = Convert<32, big_endian>::convert_host(v); }
void
put_input_file_count(elfcpp::Elf_Word v)
{ this->p_->input_file_count = Convert<32, big_endian>::convert_host(v); }
void
put_command_line_offset(elfcpp::Elf_Word v)
{ this->p_->command_line_offset = Convert<32, big_endian>::convert_host(v); }
void
put_reserved(elfcpp::Elf_Word v)
{ this->p_->reserved = Convert<32, big_endian>::convert_host(v); }
private:
Data_type* p_;
};
// Reader class for an .gnu_incremental_inputs entry. See
// internal::Incremental_inputs_entry_data for fields descriptions.
template<int size, bool big_endian>
class Incremental_inputs_entry
{
private:
typedef internal::Incremental_inputs_entry_data Data_type;
public:
Incremental_inputs_entry(const unsigned char *p)
: p_(reinterpret_cast<const Data_type*>(p))
{ }
static const int data_size = sizeof(Data_type);
elfcpp::Elf_Word
get_filename_offset(elfcpp::Elf_Word v)
{ return Convert<32, big_endian>::convert_host(this->p_->filename_offset); }
elfcpp::Elf_Word
get_data_offset(elfcpp::Elf_Word v)
{ return Convert<32, big_endian>::convert_host(this->p_->data_offset); }
elfcpp::Elf_Xword
get_timestamp_sec(elfcpp::Elf_Xword v)
{ return Convert<64, big_endian>::convert_host(this->p_->timestamp_sec); }
elfcpp::Elf_Word
get_timestamp_nsec(elfcpp::Elf_Word v)
{ return Convert<32, big_endian>::convert_host(this->p_->timestamp_nsec); }
elfcpp::Elf_Word
get_input_type(elfcpp::Elf_Word v)
{ return Convert<32, big_endian>::convert_host(this->p_->input_type); }
elfcpp::Elf_Word
get_reserved(elfcpp::Elf_Word v)
{ return Convert<32, big_endian>::convert_host(this->p_->reserved); }
private:
const Data_type* p_;
};
// Writer class for an .gnu_incremental_inputs entry. See
// internal::Incremental_inputs_entry_data for fields descriptions.
template<int size, bool big_endian>
class Incremental_inputs_entry_write
{
private:
typedef internal::Incremental_inputs_entry_data Data_type;
public:
Incremental_inputs_entry_write(unsigned char *p)
: p_(reinterpret_cast<Data_type*>(p))
{ }
static const int data_size = sizeof(Data_type);
void
put_filename_offset(elfcpp::Elf_Word v)
{ this->p_->filename_offset = Convert<32, big_endian>::convert_host(v); }
void
put_data_offset(elfcpp::Elf_Word v)
{ this->p_->data_offset = Convert<32, big_endian>::convert_host(v); }
void
put_timestamp_sec(elfcpp::Elf_Xword v)
{ this->p_->timestamp_sec = Convert<64, big_endian>::convert_host(v); }
void
put_timestamp_nsec(elfcpp::Elf_Word v)
{ this->p_->timestamp_nsec = Convert<32, big_endian>::convert_host(v); }
void
put_input_type(elfcpp::Elf_Word v)
{ this->p_->input_type = Convert<32, big_endian>::convert_host(v); }
void
put_reserved(elfcpp::Elf_Word v)
{ this->p_->reserved = Convert<32, big_endian>::convert_host(v); }
private:
Data_type* p_;
};
// Inform the user why we don't do an incremental link. Not called in
// the obvious case of missing output file. TODO: Is this helpful?
void
vexplain_no_incremental(const char* format, va_list args)
{
char* buf = NULL;
if (vasprintf(&buf, format, args) < 0)
gold_nomem();
gold_info(_("the link might take longer: "
"cannot perform incremental link: %s"), buf);
free(buf);
}
void
explain_no_incremental(const char* format, ...)
{
va_list args;
va_start(args, format);
vexplain_no_incremental(format, args);
va_end(args);
}
// Report an error.
void
Incremental_binary::error(const char* format, ...) const
{
va_list args;
va_start(args, format);
// Current code only checks if the file can be used for incremental linking,
// so errors shouldn't fail the build, but only result in a fallback to a
// full build.
// TODO: when we implement incremental editing of the file, we may need a
// flag that will cause errors to be treated seriously.
vexplain_no_incremental(format, args);
va_end(args);
}
template<int size, bool big_endian>
bool
Sized_incremental_binary<size, big_endian>::do_find_incremental_inputs_section(
Location* location,
unsigned int* strtab_shndx)
{
unsigned int shndx = this->elf_file_.find_section_by_type(
elfcpp::SHT_GNU_INCREMENTAL_INPUTS);
if (shndx == elfcpp::SHN_UNDEF) // Not found.
return false;
*strtab_shndx = this->elf_file_.section_link(shndx);
*location = this->elf_file_.section_contents(shndx);
return true;
}
template<int size, bool big_endian>
bool
Sized_incremental_binary<size, big_endian>::do_check_inputs(
Incremental_inputs* incremental_inputs)
{
const int entry_size =
Incremental_inputs_entry_write<size, big_endian>::data_size;
const int header_size =
Incremental_inputs_header_write<size, big_endian>::data_size;
unsigned int strtab_shndx;
Location location;
if (!do_find_incremental_inputs_section(&location, &strtab_shndx))
{
explain_no_incremental(_("no incremental data from previous build"));
return false;
}
if (location.data_size < header_size
|| strtab_shndx >= this->elf_file_.shnum()
|| this->elf_file_.section_type(strtab_shndx) != elfcpp::SHT_STRTAB)
{
explain_no_incremental(_("invalid incremental build data"));
return false;
}
Location strtab_location(this->elf_file_.section_contents(strtab_shndx));
View data_view(view(location));
View strtab_view(view(strtab_location));
elfcpp::Elf_strtab strtab(strtab_view.data(), strtab_location.data_size);
Incremental_inputs_header<size, big_endian> header(data_view.data());
if (header.get_version() != INCREMENTAL_LINK_VERSION)
{
explain_no_incremental(_("different version of incremental build data"));
return false;
}
const char* command_line;
// We divide instead of multiplying to make sure there is no integer
// overflow.
size_t max_input_entries = (location.data_size - header_size) / entry_size;
if (header.get_input_file_count() > max_input_entries
|| !strtab.get_c_string(header.get_command_line_offset(), &command_line))
{
explain_no_incremental(_("invalid incremental build data"));
return false;
}
if (incremental_inputs->command_line() != command_line)
{
explain_no_incremental(_("command line changed"));
return false;
}
// TODO: compare incremental_inputs->inputs() with entries in data_view.
return true;
}
namespace
{
// Create a Sized_incremental_binary object of the specified size and
// endianness. Fails if the target architecture is not supported.
template<int size, bool big_endian>
Incremental_binary*
make_sized_incremental_binary(Output_file* file,
const elfcpp::Ehdr<size, big_endian>& ehdr)
{
Target* target = select_target(ehdr.get_e_machine(), size, big_endian,
ehdr.get_e_ident()[elfcpp::EI_OSABI],
ehdr.get_e_ident()[elfcpp::EI_ABIVERSION]);
if (target == NULL)
{
explain_no_incremental(_("unsupported ELF machine number %d"),
ehdr.get_e_machine());
return NULL;
}
return new Sized_incremental_binary<size, big_endian>(file, ehdr, target);
}
} // End of anonymous namespace.
// Create an Incremental_binary object for FILE. Returns NULL is this is not
// possible, e.g. FILE is not an ELF file or has an unsupported target. FILE
// should be opened.
Incremental_binary*
open_incremental_binary(Output_file* file)
{
off_t filesize = file->filesize();
int want = elfcpp::Elf_recognizer::max_header_size;
if (filesize < want)
want = filesize;
const unsigned char* p = file->get_input_view(0, want);
if (!elfcpp::Elf_recognizer::is_elf_file(p, want))
{
explain_no_incremental(_("output is not an ELF file."));
return NULL;
}
int size = 0;
bool big_endian = false;
std::string error;
if (!elfcpp::Elf_recognizer::is_valid_header(p, want, &size, &big_endian,
&error))
{
explain_no_incremental(error.c_str());
return NULL;
}
Incremental_binary* result = NULL;
if (size == 32)
{
if (big_endian)
{
#ifdef HAVE_TARGET_32_BIG
result = make_sized_incremental_binary<32, true>(
file, elfcpp::Ehdr<32, true>(p));
#else
explain_no_incremental(_("unsupported file: 32-bit, big-endian"));
#endif
}
else
{
#ifdef HAVE_TARGET_32_LITTLE
result = make_sized_incremental_binary<32, false>(
file, elfcpp::Ehdr<32, false>(p));
#else
explain_no_incremental(_("unsupported file: 32-bit, little-endian"));
#endif
}
}
else if (size == 64)
{
if (big_endian)
{
#ifdef HAVE_TARGET_64_BIG
result = make_sized_incremental_binary<64, true>(
file, elfcpp::Ehdr<64, true>(p));
#else
explain_no_incremental(_("unsupported file: 64-bit, big-endian"));
#endif
}
else
{
#ifdef HAVE_TARGET_64_LITTLE
result = make_sized_incremental_binary<64, false>(
file, elfcpp::Ehdr<64, false>(p));
#else
explain_no_incremental(_("unsupported file: 64-bit, little-endian"));
#endif
}
}
else
gold_unreachable();
return result;
}
// Analyzes the output file to check if incremental linking is possible and
// (to be done) what files need to be relinked.
bool
Incremental_checker::can_incrementally_link_output_file()
{
Output_file output(this->output_name_);
if (!output.open_for_modification())
return false;
Incremental_binary* binary = open_incremental_binary(&output);
if (binary == NULL)
return false;
return binary->check_inputs(this->incremental_inputs_);
}
// Add the command line to the string table, setting
// command_line_key_. In incremental builds, the command line is
// stored in .gnu_incremental_inputs so that the next linker run can
// check if the command line options didn't change.
void
Incremental_inputs::report_command_line(int argc, const char* const* argv)
{
// Always store 'gold' as argv[0] to avoid a full relink if the user used a
// different path to the linker.
std::string args("gold");
// Copied from collect_argv in main.cc.
for (int i = 1; i < argc; ++i)
{
// Adding/removing these options should result in a full relink.
if (strcmp(argv[i], "--incremental-changed") == 0
|| strcmp(argv[i], "--incremental-unchanged") == 0
|| strcmp(argv[i], "--incremental-unknown") == 0)
continue;
args.append(" '");
// Now append argv[i], but with all single-quotes escaped
const char* argpos = argv[i];
while (1)
{
const int len = strcspn(argpos, "'");
args.append(argpos, len);
if (argpos[len] == '\0')
break;
args.append("'\"'\"'");
argpos += len + 1;
}
args.append("'");
}
this->command_line_ = args;
this->strtab_->add(this->command_line_.c_str(), false,
&this->command_line_key_);
}
// Record that the input argument INPUT is an achive ARCHIVE. This is
// called by Read_symbols after finding out the type of the file.
void
Incremental_inputs::report_archive(const Input_argument* input,
Archive* archive)
{
Hold_lock hl(*this->lock_);
Input_info info;
info.type = INCREMENTAL_INPUT_ARCHIVE;
info.archive = archive;
info.mtime = archive->file().get_mtime();
this->inputs_map_.insert(std::make_pair(input, info));
}
// Record that the input argument INPUT is an object OBJ. This is
// called by Read_symbols after finding out the type of the file.
void
Incremental_inputs::report_object(const Input_argument* input,
Object* obj)
{
Hold_lock hl(*this->lock_);
Input_info info;
info.type = (obj->is_dynamic()
? INCREMENTAL_INPUT_SHARED_LIBRARY
: INCREMENTAL_INPUT_OBJECT);
info.object = obj;
info.mtime = obj->input_file()->file().get_mtime();
this->inputs_map_.insert(std::make_pair(input, info));
}
// Record that the input argument INPUT is an script SCRIPT. This is
// called by read_script after parsing the script and reading the list
// of inputs added by this script.
void
Incremental_inputs::report_script(const Input_argument* input,
Timespec mtime,
Script_info* script)
{
Hold_lock hl(*this->lock_);
Input_info info;
info.type = INCREMENTAL_INPUT_SCRIPT;
info.script = script;
info.mtime = mtime;
this->inputs_map_.insert(std::make_pair(input, info));
}
// Compute indexes in the order in which the inputs should appear in
// .gnu_incremental_inputs. This needs to be done after all the
// scripts are parsed. The function is first called for the command
// line inputs arguments and may call itself recursively for e.g. a
// list of elements of a group or a list of inputs added by a script.
// The [BEGIN; END) interval to analyze and *INDEX is the current
// value of the index (that will be updated).
void
Incremental_inputs::finalize_inputs(
Input_argument_list::const_iterator begin,
Input_argument_list::const_iterator end,
unsigned int* index)
{
for (Input_argument_list::const_iterator p = begin; p != end; ++p)
{
if (p->is_group())
{
finalize_inputs(p->group()->begin(), p->group()->end(), index);
continue;
}
Inputs_info_map::iterator it = this->inputs_map_.find(&(*p));
// TODO: turn it into an assert when the code will be more stable.
if (it == this->inputs_map_.end())
{
gold_error("internal error: %s: incremental build info not provided",
(p->is_file() ? p->file().name() : "[group]"));
continue;
}
Input_info* info = &it->second;
info->index = *index;
(*index)++;
this->strtab_->add(p->file().name(), false, &info->filename_key);
if (info->type == INCREMENTAL_INPUT_SCRIPT)
{
finalize_inputs(info->script->inputs()->begin(),
info->script->inputs()->end(),
index);
}
}
}
// Finalize the incremental link information. Called from
// Layout::finalize.
void
Incremental_inputs::finalize()
{
unsigned int index = 0;
finalize_inputs(this->inputs_->begin(), this->inputs_->end(), &index);
// Sanity check.
for (Inputs_info_map::const_iterator p = this->inputs_map_.begin();
p != this->inputs_map_.end();
++p)
{
gold_assert(p->second.filename_key != 0);
}
this->strtab_->set_string_offsets();
}
// Create the content of the .gnu_incremental_inputs section.
Output_section_data*
Incremental_inputs::create_incremental_inputs_section_data()
{
switch (parameters->size_and_endianness())
{
#ifdef HAVE_TARGET_32_LITTLE
case Parameters::TARGET_32_LITTLE:
return this->sized_create_inputs_section_data<32, false>();
#endif
#ifdef HAVE_TARGET_32_BIG
case Parameters::TARGET_32_BIG:
return this->sized_create_inputs_section_data<32, true>();
#endif
#ifdef HAVE_TARGET_64_LITTLE
case Parameters::TARGET_64_LITTLE:
return this->sized_create_inputs_section_data<64, false>();
#endif
#ifdef HAVE_TARGET_64_BIG
case Parameters::TARGET_64_BIG:
return this->sized_create_inputs_section_data<64, true>();
#endif
default:
gold_unreachable();
}
}
// Sized creation of .gnu_incremental_inputs section.
template<int size, bool big_endian>
Output_section_data*
Incremental_inputs::sized_create_inputs_section_data()
{
const int entry_size =
Incremental_inputs_entry_write<size, big_endian>::data_size;
const int header_size =
Incremental_inputs_header_write<size, big_endian>::data_size;
unsigned int sz = header_size + entry_size * this->inputs_map_.size();
unsigned char* buffer = new unsigned char[sz];
unsigned char* inputs_base = buffer + header_size;
Incremental_inputs_header_write<size, big_endian> header_writer(buffer);
gold_assert(this->command_line_key_ > 0);
int cmd_offset = this->strtab_->get_offset_from_key(this->command_line_key_);
header_writer.put_version(INCREMENTAL_LINK_VERSION);
header_writer.put_input_file_count(this->inputs_map_.size());
header_writer.put_command_line_offset(cmd_offset);
header_writer.put_reserved(0);
for (Inputs_info_map::const_iterator it = this->inputs_map_.begin();
it != this->inputs_map_.end();
++it)
{
gold_assert(it->second.index < this->inputs_map_.size());
unsigned char* entry_buffer =
inputs_base + it->second.index * entry_size;
Incremental_inputs_entry_write<size, big_endian> entry(entry_buffer);
int filename_offset =
this->strtab_->get_offset_from_key(it->second.filename_key);
entry.put_filename_offset(filename_offset);
// TODO: add per input data and timestamp. Currently we store
// an out-of-bounds offset for future version of gold to reject
// such an incremental_inputs section.
entry.put_data_offset(0xffffffff);
entry.put_timestamp_sec(it->second.mtime.seconds);
entry.put_timestamp_nsec(it->second.mtime.nanoseconds);
entry.put_input_type(it->second.type);
entry.put_reserved(0);
}
return new Output_data_const_buffer(buffer, sz, 8,
"** incremental link inputs list");
}
// Instantiate the templates we need.
#ifdef HAVE_TARGET_32_LITTLE
template
class Sized_incremental_binary<32, false>;
#endif
#ifdef HAVE_TARGET_32_BIG
template
class Sized_incremental_binary<32, true>;
#endif
#ifdef HAVE_TARGET_64_LITTLE
template
class Sized_incremental_binary<64, false>;
#endif
#ifdef HAVE_TARGET_64_BIG
template
class Sized_incremental_binary<64, true>;
#endif
} // End namespace gold.
|