Bug Summary

File:src/gnu/usr.bin/clang/liblldELF/../../../llvm/lld/ELF/ARMErrataFix.cpp
Warning:line 393, column 27
Assigned value is garbage or undefined

Annotated Source Code

Press '?' to see keyboard shortcuts

clang -cc1 -cc1 -triple amd64-unknown-openbsd7.0 -analyze -disable-free -disable-llvm-verifier -discard-value-names -main-file-name ARMErrataFix.cpp -analyzer-store=region -analyzer-opt-analyze-nested-blocks -analyzer-checker=core -analyzer-checker=apiModeling -analyzer-checker=unix -analyzer-checker=deadcode -analyzer-checker=cplusplus -analyzer-checker=security.insecureAPI.UncheckedReturn -analyzer-checker=security.insecureAPI.getpw -analyzer-checker=security.insecureAPI.gets -analyzer-checker=security.insecureAPI.mktemp -analyzer-checker=security.insecureAPI.mkstemp -analyzer-checker=security.insecureAPI.vfork -analyzer-checker=nullability.NullPassedToNonnull -analyzer-checker=nullability.NullReturnedFromNonnull -analyzer-output plist -w -setup-static-analyzer -mrelocation-model static -mframe-pointer=all -relaxed-aliasing -fno-rounding-math -mconstructor-aliases -munwind-tables -target-cpu x86-64 -tune-cpu generic -debugger-tuning=gdb -fcoverage-compilation-dir=/usr/src/gnu/usr.bin/clang/liblldELF/obj -resource-dir /usr/local/lib/clang/13.0.0 -I /usr/src/gnu/usr.bin/clang/liblldELF/obj/../include/lld/ELF -I /usr/src/gnu/usr.bin/clang/liblldELF/../../../llvm/lld/include -I /usr/src/gnu/usr.bin/clang/liblldELF/../../../llvm/lld/ELF -I /usr/src/gnu/usr.bin/clang/liblldELF/../../../llvm/llvm/include -I /usr/src/gnu/usr.bin/clang/liblldELF/../include -I /usr/src/gnu/usr.bin/clang/liblldELF/obj -I /usr/src/gnu/usr.bin/clang/liblldELF/obj/../include -D NDEBUG -D __STDC_LIMIT_MACROS -D __STDC_CONSTANT_MACROS -D __STDC_FORMAT_MACROS -D LLVM_PREFIX="/usr" -internal-isystem /usr/include/c++/v1 -internal-isystem /usr/local/lib/clang/13.0.0/include -internal-externc-isystem /usr/include -O2 -Wno-unused-parameter -Wwrite-strings -Wno-missing-field-initializers -Wno-long-long -Wno-comment -std=c++14 -fdeprecated-macro -fdebug-compilation-dir=/usr/src/gnu/usr.bin/clang/liblldELF/obj -ferror-limit 19 -fvisibility-inlines-hidden -fwrapv -stack-protector 2 -fno-rtti -fgnuc-version=4.2.1 -vectorize-loops -vectorize-slp -fno-builtin-malloc -fno-builtin-calloc -fno-builtin-realloc -fno-builtin-valloc -fno-builtin-free -fno-builtin-strdup -fno-builtin-strndup -analyzer-output=html -faddrsig -D__GCC_HAVE_DWARF2_CFI_ASM=1 -o /home/ben/Projects/vmm/scan-build/2022-01-12-194120-40624-1 -x c++ /usr/src/gnu/usr.bin/clang/liblldELF/../../../llvm/lld/ELF/ARMErrataFix.cpp

/usr/src/gnu/usr.bin/clang/liblldELF/../../../llvm/lld/ELF/ARMErrataFix.cpp

→
1//===- ARMErrataFix.cpp ---------------------------------------------------===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8// This file implements Section Patching for the purpose of working around the
9// Cortex-a8 erratum 657417 "A 32bit branch instruction that spans 2 4K regions
10// can result in an incorrect instruction fetch or processor deadlock." The
11// erratum affects all but r1p7, r2p5, r2p6, r3p1 and r3p2 revisions of the
12// Cortex-A8. A high level description of the patching technique is given in
13// the opening comment of AArch64ErrataFix.cpp.
14//===----------------------------------------------------------------------===//
15
16#include "ARMErrataFix.h"
17
18#include "Config.h"
19#include "LinkerScript.h"
20#include "OutputSections.h"
21#include "Relocations.h"
22#include "Symbols.h"
23#include "SyntheticSections.h"
24#include "Target.h"
25#include "lld/Common/Memory.h"
26#include "lld/Common/Strings.h"
27#include "llvm/Support/Endian.h"
28#include "llvm/Support/raw_ostream.h"
29#include <algorithm>
30
31using namespace llvm;
32using namespace llvm::ELF;
33using namespace llvm::object;
34using namespace llvm::support;
35using namespace llvm::support::endian;
36using namespace lld;
37using namespace lld::elf;
38
39// The documented title for Erratum 657417 is:
40// "A 32bit branch instruction that spans two 4K regions can result in an
41// incorrect instruction fetch or processor deadlock". Graphically using a
42// 32-bit B.w instruction encoded as a pair of halfwords 0xf7fe 0xbfff
43// xxxxxx000 // Memory region 1 start
44// target:
45// ...
46// xxxxxxffe f7fe // First halfword of branch to target:
47// xxxxxx000 // Memory region 2 start
48// xxxxxx002 bfff // Second halfword of branch to target:
49//
50// The specific trigger conditions that can be detected at link time are:
51// - There is a 32-bit Thumb-2 branch instruction with an address of the form
52// xxxxxxFFE. The first 2 bytes of the instruction are in 4KiB region 1, the
53// second 2 bytes are in region 2.
54// - The branch instruction is one of BLX, BL, B.w BCC.w
55// - The instruction preceding the branch is a 32-bit non-branch instruction.
56// - The target of the branch is in region 1.
57//
58// The linker mitigation for the fix is to redirect any branch that meets the
59// erratum conditions to a patch section containing a branch to the target.
60//
61// As adding patch sections may move branches onto region boundaries the patch
62// must iterate until no more patches are added.
63//
64// Example, before:
65// 00000FFA func: NOP.w // 32-bit Thumb function
66// 00000FFE B.W func // 32-bit branch spanning 2 regions, dest in 1st.
67// Example, after:
68// 00000FFA func: NOP.w // 32-bit Thumb function
69// 00000FFE B.w __CortexA8657417_00000FFE
70// 00001002 2 - bytes padding
71// 00001004 __CortexA8657417_00000FFE: B.w func
72
73class elf::Patch657417Section : public SyntheticSection {
74public:
75 Patch657417Section(InputSection *p, uint64_t off, uint32_t instr, bool isARM);
76
77 void writeTo(uint8_t *buf) override;
78
79 size_t getSize() const override { return 4; }
80
81 // Get the virtual address of the branch instruction at patcheeOffset.
82 uint64_t getBranchAddr() const;
83
84 static bool classof(const SectionBase *d) {
85 return d->kind() == InputSectionBase::Synthetic && d->name ==".text.patch";
86 }
87
88 // The Section we are patching.
89 const InputSection *patchee;
90 // The offset of the instruction in the Patchee section we are patching.
91 uint64_t patcheeOffset;
92 // A label for the start of the Patch that we can use as a relocation target.
93 Symbol *patchSym;
94 // A decoding of the branch instruction at patcheeOffset.
95 uint32_t instr;
96 // True If the patch is to be written in ARM state, otherwise the patch will
97 // be written in Thumb state.
98 bool isARM;
99};
100
101// Return true if the half-word, when taken as the first of a pair of halfwords
102// is the first half of a 32-bit instruction.
103// Reference from ARM Architecture Reference Manual ARMv7-A and ARMv7-R edition
104// section A6.3: 32-bit Thumb instruction encoding
105// | HW1 | HW2 |
106// | 1 1 1 | op1 (2) | op2 (7) | x (4) |op| x (15) |
107// With op1 == 0b00, a 16-bit instruction is encoded.
108//
109// We test only the first halfword, looking for op != 0b00.
110static bool is32bitInstruction(uint16_t hw) {
111 return (hw & 0xe000) == 0xe000 && (hw & 0x1800) != 0x0000;
112}
113
114// Reference from ARM Architecture Reference Manual ARMv7-A and ARMv7-R edition
115// section A6.3.4 Branches and miscellaneous control.
116// | HW1 | HW2 |
117// | 1 1 1 | 1 0 | op (7) | x (4) | 1 | op1 (3) | op2 (4) | imm8 (8) |
118// op1 == 0x0 op != x111xxx | Conditional branch (Bcc.W)
119// op1 == 0x1 | Branch (B.W)
120// op1 == 1x0 | Branch with Link and Exchange (BLX.w)
121// op1 == 1x1 | Branch with Link (BL.W)
122
123static bool isBcc(uint32_t instr) {
124 return (instr & 0xf800d000) == 0xf0008000 &&
125 (instr & 0x03800000) != 0x03800000;
126}
127
128static bool isB(uint32_t instr) { return (instr & 0xf800d000) == 0xf0009000; }
129
130static bool isBLX(uint32_t instr) { return (instr & 0xf800d000) == 0xf000c000; }
131
132static bool isBL(uint32_t instr) { return (instr & 0xf800d000) == 0xf000d000; }
133
134static bool is32bitBranch(uint32_t instr) {
135 return isBcc(instr) || isB(instr) || isBL(instr) || isBLX(instr);
136}
137
138Patch657417Section::Patch657417Section(InputSection *p, uint64_t off,
139 uint32_t instr, bool isARM)
140 : SyntheticSection(SHF_ALLOC | SHF_EXECINSTR, SHT_PROGBITS, 4,
141 ".text.patch"),
142 patchee(p), patcheeOffset(off), instr(instr), isARM(isARM) {
143 parent = p->getParent();
144 patchSym = addSyntheticLocal(
145 saver.save("__CortexA8657417_" + utohexstr(getBranchAddr())), STT_FUNC,
146 isARM ? 0 : 1, getSize(), *this);
147 addSyntheticLocal(saver.save(isARM ? "$a" : "$t"), STT_NOTYPE, 0, 0, *this);
148}
149
150uint64_t Patch657417Section::getBranchAddr() const {
151 return patchee->getVA(patcheeOffset);
152}
153
154// Given a branch instruction instr at sourceAddr work out its destination
155// address. This is only used when the branch instruction has no relocation.
156static uint64_t getThumbDestAddr(uint64_t sourceAddr, uint32_t instr) {
157 uint8_t buf[4];
158 write16le(buf, instr >> 16);
159 write16le(buf + 2, instr & 0x0000ffff);
160 int64_t offset;
161 if (isBcc(instr))
162 offset = target->getImplicitAddend(buf, R_ARM_THM_JUMP19);
163 else if (isB(instr))
164 offset = target->getImplicitAddend(buf, R_ARM_THM_JUMP24);
165 else
166 offset = target->getImplicitAddend(buf, R_ARM_THM_CALL);
167 // A BLX instruction from Thumb to Arm may have an address that is
168 // not 4-byte aligned. As Arm instructions are always 4-byte aligned
169 // the instruction is calculated (from Arm ARM):
170 // targetAddress = Align(PC, 4) + imm32
171 // where
172 // Align(x, y) = y * (x Div y)
173 // which corresponds to alignDown.
174 if (isBLX(instr))
175 sourceAddr = alignDown(sourceAddr, 4);
176 return sourceAddr + offset + 4;
177}
178
179void Patch657417Section::writeTo(uint8_t *buf) {
180 // The base instruction of the patch is always a 32-bit unconditional branch.
181 if (isARM)
182 write32le(buf, 0xea000000);
183 else
184 write32le(buf, 0x9000f000);
185 // If we have a relocation then apply it.
186 if (!relocations.empty()) {
187 relocateAlloc(buf, buf + getSize());
188 return;
189 }
190
191 // If we don't have a relocation then we must calculate and write the offset
192 // ourselves.
193 // Get the destination offset from the addend in the branch instruction.
194 // We cannot use the instruction in the patchee section as this will have
195 // been altered to point to us!
196 uint64_t s = getThumbDestAddr(getBranchAddr(), instr);
197 // A BLX changes the state of the branch in the patch to Arm state, which
198 // has a PC Bias of 8, whereas in all other cases the branch is in Thumb
199 // state with a PC Bias of 4.
200 uint64_t pcBias = isBLX(instr) ? 8 : 4;
201 uint64_t p = getVA(pcBias);
202 target->relocateNoSym(buf, isARM ? R_ARM_JUMP24 : R_ARM_THM_JUMP24, s - p);
203}
204
205// Given a branch instruction spanning two 4KiB regions, at offset off from the
206// start of isec, return true if the destination of the branch is within the
207// first of the two 4Kib regions.
208static bool branchDestInFirstRegion(const InputSection *isec, uint64_t off,
209 uint32_t instr, const Relocation *r) {
210 uint64_t sourceAddr = isec->getVA(0) + off;
211 assert((sourceAddr & 0xfff) == 0xffe)((void)0);
212 uint64_t destAddr = sourceAddr;
213 // If there is a branch relocation at the same offset we must use this to
214 // find the destination address as the branch could be indirected via a thunk
215 // or the PLT.
216 if (r) {
217 uint64_t dst = (r->expr == R_PLT_PC) ? r->sym->getPltVA() : r->sym->getVA();
218 // Account for Thumb PC bias, usually cancelled to 0 by addend of -4.
219 destAddr = dst + r->addend + 4;
220 } else {
221 // If there is no relocation, we must have an intra-section branch
222 // We must extract the offset from the addend manually.
223 destAddr = getThumbDestAddr(sourceAddr, instr);
224 }
225
226 return (destAddr & 0xfffff000) == (sourceAddr & 0xfffff000);
227}
228
229// Return true if a branch can reach a patch section placed after isec.
230// The Bcc.w instruction has a range of 1 MiB, all others have 16 MiB.
231static bool patchInRange(const InputSection *isec, uint64_t off,
232 uint32_t instr) {
233
234 // We need the branch at source to reach a patch section placed immediately
235 // after isec. As there can be more than one patch in the patch section we
236 // add 0x100 as contingency to account for worst case of 1 branch every 4KiB
237 // for a 1 MiB range.
238 return target->inBranchRange(
239 isBcc(instr) ? R_ARM_THM_JUMP19 : R_ARM_THM_JUMP24, isec->getVA(off),
240 isec->getVA() + isec->getSize() + 0x100);
241}
242
243struct ScanResult {
244 // Offset of branch within its InputSection.
245 uint64_t off;
246 // Cached decoding of the branch instruction.
247 uint32_t instr;
248 // Branch relocation at off. Will be nullptr if no relocation exists.
249 Relocation *rel;
250};
251
252// Detect the erratum sequence, returning the offset of the branch instruction
253// and a decoding of the branch. If the erratum sequence is not found then
254// return an offset of 0 for the branch. 0 is a safe value to use for no patch
255// as there must be at least one 32-bit non-branch instruction before the
256// branch so the minimum offset for a patch is 4.
257static ScanResult scanCortexA8Errata657417(InputSection *isec, uint64_t &off,
258 uint64_t limit) {
259 uint64_t isecAddr = isec->getVA(0);
260 // Advance Off so that (isecAddr + off) modulo 0x1000 is at least 0xffa. We
261 // need to check for a 32-bit instruction immediately before a 32-bit branch
262 // at 0xffe modulo 0x1000.
263 off = alignTo(isecAddr + off, 0x1000, 0xffa) - isecAddr;
264 if (off >= limit || limit - off < 8) {
265 // Need at least 2 4-byte sized instructions to trigger erratum.
266 off = limit;
267 return {0, 0, nullptr};
268 }
269
270 ScanResult scanRes = {0, 0, nullptr};
271 const uint8_t *buf = isec->data().begin();
272 // ARMv7-A Thumb 32-bit instructions are encoded 2 consecutive
273 // little-endian halfwords.
274 const ulittle16_t *instBuf = reinterpret_cast<const ulittle16_t *>(buf + off);
275 uint16_t hw11 = *instBuf++;
276 uint16_t hw12 = *instBuf++;
277 uint16_t hw21 = *instBuf++;
278 uint16_t hw22 = *instBuf++;
279 if (is32bitInstruction(hw11) && is32bitInstruction(hw21)) {
280 uint32_t instr1 = (hw11 << 16) | hw12;
281 uint32_t instr2 = (hw21 << 16) | hw22;
282 if (!is32bitBranch(instr1) && is32bitBranch(instr2)) {
283 // Find a relocation for the branch if it exists. This will be used
284 // to determine the target.
285 uint64_t branchOff = off + 4;
286 auto relIt = llvm::find_if(isec->relocations, [=](const Relocation &r) {
287 return r.offset == branchOff &&
288 (r.type == R_ARM_THM_JUMP19 || r.type == R_ARM_THM_JUMP24 ||
289 r.type == R_ARM_THM_CALL);
290 });
291 if (relIt != isec->relocations.end())
292 scanRes.rel = &(*relIt);
293 if (branchDestInFirstRegion(isec, branchOff, instr2, scanRes.rel)) {
294 if (patchInRange(isec, branchOff, instr2)) {
295 scanRes.off = branchOff;
296 scanRes.instr = instr2;
297 } else {
298 warn(toString(isec->file) +
299 ": skipping cortex-a8 657417 erratum sequence, section " +
300 isec->name + " is too large to patch");
301 }
302 }
303 }
304 }
305 off += 0x1000;
306 return scanRes;
307}
308
309void ARMErr657417Patcher::init() {
310 // The Arm ABI permits a mix of ARM, Thumb and Data in the same
311 // InputSection. We must only scan Thumb instructions to avoid false
312 // matches. We use the mapping symbols in the InputObjects to identify this
313 // data, caching the results in sectionMap so we don't have to recalculate
314 // it each pass.
315
316 // The ABI Section 4.5.5 Mapping symbols; defines local symbols that describe
317 // half open intervals [Symbol Value, Next Symbol Value) of code and data
318 // within sections. If there is no next symbol then the half open interval is
319 // [Symbol Value, End of section). The type, code or data, is determined by
320 // the mapping symbol name, $a for Arm code, $t for Thumb code, $d for data.
321 auto isArmMapSymbol = [](const Symbol *s) {
322 return s->getName() == "$a" || s->getName().startswith("$a.");
323 };
324 auto isThumbMapSymbol = [](const Symbol *s) {
325 return s->getName() == "$t" || s->getName().startswith("$t.");
326 };
327 auto isDataMapSymbol = [](const Symbol *s) {
328 return s->getName() == "$d" || s->getName().startswith("$d.");
329 };
330
331 // Collect mapping symbols for every executable InputSection.
332 for (InputFile *file : objectFiles) {
333 auto *f = cast<ObjFile<ELF32LE>>(file);
334 for (Symbol *s : f->getLocalSymbols()) {
335 auto *def = dyn_cast<Defined>(s);
336 if (!def)
337 continue;
338 if (!isArmMapSymbol(def) && !isThumbMapSymbol(def) &&
339 !isDataMapSymbol(def))
340 continue;
341 if (auto *sec = dyn_cast_or_null<InputSection>(def->section))
342 if (sec->flags & SHF_EXECINSTR)
343 sectionMap[sec].push_back(def);
344 }
345 }
346 // For each InputSection make sure the mapping symbols are in sorted in
347 // ascending order and are in alternating Thumb, non-Thumb order.
348 for (auto &kv : sectionMap) {
349 std::vector<const Defined *> &mapSyms = kv.second;
350 llvm::stable_sort(mapSyms, [](const Defined *a, const Defined *b) {
351 return a->value < b->value;
352 });
353 mapSyms.erase(std::unique(mapSyms.begin(), mapSyms.end(),
354 [=](const Defined *a, const Defined *b) {
355 return (isThumbMapSymbol(a) ==
356 isThumbMapSymbol(b));
357 }),
358 mapSyms.end());
359 // Always start with a Thumb Mapping Symbol
360 if (!mapSyms.empty() && !isThumbMapSymbol(mapSyms.front()))
361 mapSyms.erase(mapSyms.begin());
362 }
363 initialized = true;
364}
365
366void ARMErr657417Patcher::insertPatches(
367 InputSectionDescription &isd, std::vector<Patch657417Section *> &patches) {
368 uint64_t spacing = 0x100000 - 0x7500;
369 uint64_t isecLimit;
11
←
'isecLimit' declared without an initial value
→
370 uint64_t prevIsecLimit = isd.sections.front()->outSecOff;
371 uint64_t patchUpperBound = prevIsecLimit + spacing;
372 uint64_t outSecAddr = isd.sections.front()->getParent()->addr;
373
374 // Set the outSecOff of patches to the place where we want to insert them.
375 // We use a similar strategy to initial thunk placement, using 1 MiB as the
376 // range of the Thumb-2 conditional branch with a contingency accounting for
377 // thunk generation.
378 auto patchIt = patches.begin();
379 auto patchEnd = patches.end();
380 for (const InputSection *isec : isd.sections) {
381 isecLimit = isec->outSecOff + isec->getSize();
382 if (isecLimit > patchUpperBound) {
383 for (; patchIt != patchEnd; ++patchIt) {
384 if ((*patchIt)->getBranchAddr() - outSecAddr >= prevIsecLimit)
385 break;
386 (*patchIt)->outSecOff = prevIsecLimit;
387 }
388 patchUpperBound = prevIsecLimit + spacing;
389 }
390 prevIsecLimit = isecLimit;
391 }
392 for (; patchIt != patchEnd; ++patchIt)
12
←
Calling 'operator!=<lld::elf::Patch657417Section **>'
→
18
←
Returning from 'operator!=<lld::elf::Patch657417Section **>'
→
19
←
Loop condition is true. Entering loop body
→
393 (*patchIt)->outSecOff = isecLimit;
20
←
Assigned value is garbage or undefined
394
395 // Merge all patch sections. We use the outSecOff assigned above to
396 // determine the insertion point. This is ok as we only merge into an
397 // InputSectionDescription once per pass, and at the end of the pass
398 // assignAddresses() will recalculate all the outSecOff values.
399 std::vector<InputSection *> tmp;
400 tmp.reserve(isd.sections.size() + patches.size());
401 auto mergeCmp = [](const InputSection *a, const InputSection *b) {
402 if (a->outSecOff != b->outSecOff)
403 return a->outSecOff < b->outSecOff;
404 return isa<Patch657417Section>(a) && !isa<Patch657417Section>(b);
405 };
406 std::merge(isd.sections.begin(), isd.sections.end(), patches.begin(),
407 patches.end(), std::back_inserter(tmp), mergeCmp);
408 isd.sections = std::move(tmp);
409}
410
411// Given a branch instruction described by ScanRes redirect it to a patch
412// section containing an unconditional branch instruction to the target.
413// Ensure that this patch section is 4-byte aligned so that the branch cannot
414// span two 4 KiB regions. Place the patch section so that it is always after
415// isec so the branch we are patching always goes forwards.
416static void implementPatch(ScanResult sr, InputSection *isec,
417 std::vector<Patch657417Section *> &patches) {
418
419 log("detected cortex-a8-657419 erratum sequence starting at " +
420 utohexstr(isec->getVA(sr.off)) + " in unpatched output.");
421 Patch657417Section *psec;
422 // We have two cases to deal with.
423 // Case 1. There is a relocation at patcheeOffset to a symbol. The
424 // unconditional branch in the patch must have a relocation so that any
425 // further redirection via the PLT or a Thunk happens as normal. At
426 // patcheeOffset we redirect the existing relocation to a Symbol defined at
427 // the start of the patch section.
428 //
429 // Case 2. There is no relocation at patcheeOffset. We are unlikely to have
430 // a symbol that we can use as a target for a relocation in the patch section.
431 // Luckily we know that the destination cannot be indirected via the PLT or
432 // a Thunk so we can just write the destination directly.
433 if (sr.rel) {
434 // Case 1. We have an existing relocation to redirect to patch and a
435 // Symbol target.
436
437 // Create a branch relocation for the unconditional branch in the patch.
438 // This can be redirected via the PLT or Thunks.
439 RelType patchRelType = R_ARM_THM_JUMP24;
440 int64_t patchRelAddend = sr.rel->addend;
441 bool destIsARM = false;
442 if (isBL(sr.instr) || isBLX(sr.instr)) {
443 // The final target of the branch may be ARM or Thumb, if the target
444 // is ARM then we write the patch in ARM state to avoid a state change
445 // Thunk from the patch to the target.
446 uint64_t dstSymAddr = (sr.rel->expr == R_PLT_PC) ? sr.rel->sym->getPltVA()
447 : sr.rel->sym->getVA();
448 destIsARM = (dstSymAddr & 1) == 0;
449 }
450 psec = make<Patch657417Section>(isec, sr.off, sr.instr, destIsARM);
451 if (destIsARM) {
452 // The patch will be in ARM state. Use an ARM relocation and account for
453 // the larger ARM PC-bias of 8 rather than Thumb's 4.
454 patchRelType = R_ARM_JUMP24;
455 patchRelAddend -= 4;
456 }
457 psec->relocations.push_back(
458 Relocation{sr.rel->expr, patchRelType, 0, patchRelAddend, sr.rel->sym});
459 // Redirect the existing branch relocation to the patch.
460 sr.rel->expr = R_PC;
461 sr.rel->addend = -4;
462 sr.rel->sym = psec->patchSym;
463 } else {
464 // Case 2. We do not have a relocation to the patch. Add a relocation of the
465 // appropriate type to the patch at patcheeOffset.
466
467 // The destination is ARM if we have a BLX.
468 psec = make<Patch657417Section>(isec, sr.off, sr.instr, isBLX(sr.instr));
469 RelType type;
470 if (isBcc(sr.instr))
471 type = R_ARM_THM_JUMP19;
472 else if (isB(sr.instr))
473 type = R_ARM_THM_JUMP24;
474 else
475 type = R_ARM_THM_CALL;
476 isec->relocations.push_back(
477 Relocation{R_PC, type, sr.off, -4, psec->patchSym});
478 }
479 patches.push_back(psec);
480}
481
482// Scan all the instructions in InputSectionDescription, for each instance of
483// the erratum sequence create a Patch657417Section. We return the list of
484// Patch657417Sections that need to be applied to the InputSectionDescription.
485std::vector<Patch657417Section *>
486ARMErr657417Patcher::patchInputSectionDescription(
487 InputSectionDescription &isd) {
488 std::vector<Patch657417Section *> patches;
489 for (InputSection *isec : isd.sections) {
490 // LLD doesn't use the erratum sequence in SyntheticSections.
491 if (isa<SyntheticSection>(isec))
492 continue;
493 // Use sectionMap to make sure we only scan Thumb code and not Arm or inline
494 // data. We have already sorted mapSyms in ascending order and removed
495 // consecutive mapping symbols of the same type. Our range of executable
496 // instructions to scan is therefore [thumbSym->value, nonThumbSym->value)
497 // or [thumbSym->value, section size).
498 std::vector<const Defined *> &mapSyms = sectionMap[isec];
499
500 auto thumbSym = mapSyms.begin();
501 while (thumbSym != mapSyms.end()) {
502 auto nonThumbSym = std::next(thumbSym);
503 uint64_t off = (*thumbSym)->value;
504 uint64_t limit = (nonThumbSym == mapSyms.end()) ? isec->data().size()
505 : (*nonThumbSym)->value;
506
507 while (off < limit) {
508 ScanResult sr = scanCortexA8Errata657417(isec, off, limit);
509 if (sr.off)
510 implementPatch(sr, isec, patches);
511 }
512 if (nonThumbSym == mapSyms.end())
513 break;
514 thumbSym = std::next(nonThumbSym);
515 }
516 }
517 return patches;
518}
519
520bool ARMErr657417Patcher::createFixes() {
521 if (!initialized)
1
Assuming field 'initialized' is true
→
2
←
Taking false branch
→
522 init();
523
524 bool addressesChanged = false;
525 for (OutputSection *os : outputSections) {
526 if (!(os->flags & SHF_ALLOC) || !(os->flags & SHF_EXECINSTR))
3
←
Assuming the condition is false
→
4
←
Assuming the condition is false
→
5
←
Taking false branch
→
527 continue;
528 for (BaseCommand *bc : os->sectionCommands)
529 if (auto *isd
6.1
'isd' is non-null
6.1
'isd' is non-null
 = dyn_cast<InputSectionDescription>(bc)) {
6
←
Assuming 'bc' is a 'InputSectionDescription'
→
7
←
Taking true branch
→
530 std::vector<Patch657417Section *> patches =
531 patchInputSectionDescription(*isd);
532 if (!patches.empty()) {
8
←
Assuming the condition is true
→
9
←
Taking true branch
→
533 insertPatches(*isd, patches);
10
←
Calling 'ARMErr657417Patcher::insertPatches'
→
534 addressesChanged = true;
535 }
536 }
537 }
538 return addressesChanged;
539}
←

/usr/include/c++/v1/__iterator/wrap_iter.h

1// -*- C++ -*-
2//===----------------------------------------------------------------------===//
3//
4// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5// See https://llvm.org/LICENSE.txt for license information.
6// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7//
8//===----------------------------------------------------------------------===//
9
10#ifndef _LIBCPP___ITERATOR_WRAP_ITER_H
11#define _LIBCPP___ITERATOR_WRAP_ITER_H
12
13#include <__config>
14#include <__debug>
15#include <__iterator/iterator_traits.h>
16#include <__memory/pointer_traits.h> // __to_address
17#include <type_traits>
18
19#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
20#pragma GCC system_header
21#endif
22
23_LIBCPP_PUSH_MACROSpush_macro("min") push_macro("max")
24#include <__undef_macros>
25
26_LIBCPP_BEGIN_NAMESPACE_STDnamespace std { inline namespace __1 {
27
28template <class _Iter>
29class __wrap_iter
30{
31public:
32 typedef _Iter iterator_type;
33 typedef typename iterator_traits<iterator_type>::value_type value_type;
34 typedef typename iterator_traits<iterator_type>::difference_type difference_type;
35 typedef typename iterator_traits<iterator_type>::pointer pointer;
36 typedef typename iterator_traits<iterator_type>::reference reference;
37 typedef typename iterator_traits<iterator_type>::iterator_category iterator_category;
38#if _LIBCPP_STD_VER14 > 17
39 typedef contiguous_iterator_tag iterator_concept;
40#endif
41
42private:
43 iterator_type __i;
44public:
45 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter() _NOEXCEPTnoexcept
46#if _LIBCPP_STD_VER14 > 11
47 : __i{}
48#endif
49 {
50#if _LIBCPP_DEBUG_LEVEL0 == 2
51 __get_db()->__insert_i(this);
52#endif
53 }
54 template <class _Up> _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
55 __wrap_iter(const __wrap_iter<_Up>& __u,
56 typename enable_if<is_convertible<_Up, iterator_type>::value>::type* = nullptr) _NOEXCEPTnoexcept
57 : __i(__u.base())
58 {
59#if _LIBCPP_DEBUG_LEVEL0 == 2
60 __get_db()->__iterator_copy(this, &__u);
61#endif
62 }
63#if _LIBCPP_DEBUG_LEVEL0 == 2
64 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
65 __wrap_iter(const __wrap_iter& __x)
66 : __i(__x.base())
67 {
68 __get_db()->__iterator_copy(this, &__x);
69 }
70 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
71 __wrap_iter& operator=(const __wrap_iter& __x)
72 {
73 if (this != &__x)
74 {
75 __get_db()->__iterator_copy(this, &__x);
76 __i = __x.__i;
77 }
78 return *this;
79 }
80 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
81 ~__wrap_iter()
82 {
83 __get_db()->__erase_i(this);
84 }
85#endif
86 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr reference operator*() const _NOEXCEPTnoexcept
87 {
88#if _LIBCPP_DEBUG_LEVEL0 == 2
89 _LIBCPP_ASSERT(__get_const_db()->__dereferenceable(this),((void)0)
90 "Attempted to dereference a non-dereferenceable iterator")((void)0);
91#endif
92 return *__i;
93 }
94 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr pointer operator->() const _NOEXCEPTnoexcept
95 {
96#if _LIBCPP_DEBUG_LEVEL0 == 2
97 _LIBCPP_ASSERT(__get_const_db()->__dereferenceable(this),((void)0)
98 "Attempted to dereference a non-dereferenceable iterator")((void)0);
99#endif
100 return _VSTDstd::__1::__to_address(__i);
101 }
102 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter& operator++() _NOEXCEPTnoexcept
103 {
104#if _LIBCPP_DEBUG_LEVEL0 == 2
105 _LIBCPP_ASSERT(__get_const_db()->__dereferenceable(this),((void)0)
106 "Attempted to increment a non-incrementable iterator")((void)0);
107#endif
108 ++__i;
109 return *this;
110 }
111 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter operator++(int) _NOEXCEPTnoexcept
112 {__wrap_iter __tmp(*this); ++(*this); return __tmp;}
113
114 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter& operator--() _NOEXCEPTnoexcept
115 {
116#if _LIBCPP_DEBUG_LEVEL0 == 2
117 _LIBCPP_ASSERT(__get_const_db()->__decrementable(this),((void)0)
118 "Attempted to decrement a non-decrementable iterator")((void)0);
119#endif
120 --__i;
121 return *this;
122 }
123 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter operator--(int) _NOEXCEPTnoexcept
124 {__wrap_iter __tmp(*this); --(*this); return __tmp;}
125 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter operator+ (difference_type __n) const _NOEXCEPTnoexcept
126 {__wrap_iter __w(*this); __w += __n; return __w;}
127 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter& operator+=(difference_type __n) _NOEXCEPTnoexcept
128 {
129#if _LIBCPP_DEBUG_LEVEL0 == 2
130 _LIBCPP_ASSERT(__get_const_db()->__addable(this, __n),((void)0)
131 "Attempted to add/subtract an iterator outside its valid range")((void)0);
132#endif
133 __i += __n;
134 return *this;
135 }
136 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter operator- (difference_type __n) const _NOEXCEPTnoexcept
137 {return *this + (-__n);}
138 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter& operator-=(difference_type __n) _NOEXCEPTnoexcept
139 {*this += -__n; return *this;}
140 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr reference operator[](difference_type __n) const _NOEXCEPTnoexcept
141 {
142#if _LIBCPP_DEBUG_LEVEL0 == 2
143 _LIBCPP_ASSERT(__get_const_db()->__subscriptable(this, __n),((void)0)
144 "Attempted to subscript an iterator outside its valid range")((void)0);
145#endif
146 return __i[__n];
147 }
148
149 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr iterator_type base() const _NOEXCEPTnoexcept {return __i;}
150
151private:
152#if _LIBCPP_DEBUG_LEVEL0 == 2
153 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter(const void* __p, iterator_type __x) : __i(__x)
154 {
155 __get_db()->__insert_ic(this, __p);
156 }
157#else
158 _LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr __wrap_iter(iterator_type __x) _NOEXCEPTnoexcept : __i(__x) {}
159#endif
160
161 template <class _Up> friend class __wrap_iter;
162 template <class _CharT, class _Traits, class _Alloc> friend class basic_string;
163 template <class _Tp, class _Alloc> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) vector;
164 template <class _Tp, size_t> friend class _LIBCPP_TEMPLATE_VIS__attribute__ ((__type_visibility__("default"))) span;
165};
166
167template <class _Iter1>
168_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
169bool operator==(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
170{
171 return __x.base() == __y.base();
14
←
Assuming the condition is false
→
15
←
Returning zero, which participates in a condition later
→
172}
173
174template <class _Iter1, class _Iter2>
175_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
176bool operator==(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
177{
178 return __x.base() == __y.base();
179}
180
181template <class _Iter1>
182_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
183bool operator<(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
184{
185#if _LIBCPP_DEBUG_LEVEL0 == 2
186 _LIBCPP_ASSERT(__get_const_db()->__less_than_comparable(&__x, &__y),((void)0)
187 "Attempted to compare incomparable iterators")((void)0);
188#endif
189 return __x.base() < __y.base();
190}
191
192template <class _Iter1, class _Iter2>
193_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
194bool operator<(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
195{
196#if _LIBCPP_DEBUG_LEVEL0 == 2
197 _LIBCPP_ASSERT(__get_const_db()->__less_than_comparable(&__x, &__y),((void)0)
198 "Attempted to compare incomparable iterators")((void)0);
199#endif
200 return __x.base() < __y.base();
201}
202
203template <class _Iter1>
204_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
205bool operator!=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
206{
207 return !(__x == __y);
13
←
Calling 'operator==<lld::elf::Patch657417Section **>'
→
16
←
Returning from 'operator==<lld::elf::Patch657417Section **>'
→
17
←
Returning the value 1, which participates in a condition later
→
208}
209
210template <class _Iter1, class _Iter2>
211_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
212bool operator!=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
213{
214 return !(__x == __y);
215}
216
217template <class _Iter1>
218_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
219bool operator>(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
220{
221 return __y < __x;
222}
223
224template <class _Iter1, class _Iter2>
225_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
226bool operator>(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
227{
228 return __y < __x;
229}
230
231template <class _Iter1>
232_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
233bool operator>=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
234{
235 return !(__x < __y);
236}
237
238template <class _Iter1, class _Iter2>
239_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
240bool operator>=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
241{
242 return !(__x < __y);
243}
244
245template <class _Iter1>
246_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
247bool operator<=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter1>& __y) _NOEXCEPTnoexcept
248{
249 return !(__y < __x);
250}
251
252template <class _Iter1, class _Iter2>
253_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
254bool operator<=(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
255{
256 return !(__y < __x);
257}
258
259template <class _Iter1, class _Iter2>
260_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
261#ifndef _LIBCPP_CXX03_LANG
262auto operator-(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
263 -> decltype(__x.base() - __y.base())
264#else
265typename __wrap_iter<_Iter1>::difference_type
266operator-(const __wrap_iter<_Iter1>& __x, const __wrap_iter<_Iter2>& __y) _NOEXCEPTnoexcept
267#endif // C++03
268{
269#if _LIBCPP_DEBUG_LEVEL0 == 2
270 _LIBCPP_ASSERT(__get_const_db()->__less_than_comparable(&__x, &__y),((void)0)
271 "Attempted to subtract incompatible iterators")((void)0);
272#endif
273 return __x.base() - __y.base();
274}
275
276template <class _Iter1>
277_LIBCPP_INLINE_VISIBILITY__attribute__ ((__visibility__("hidden"))) __attribute__ ((__exclude_from_explicit_instantiation__
)) _LIBCPP_CONSTEXPR_IF_NODEBUGconstexpr
278__wrap_iter<_Iter1> operator+(typename __wrap_iter<_Iter1>::difference_type __n, __wrap_iter<_Iter1> __x) _NOEXCEPTnoexcept
279{
280 __x += __n;
281 return __x;
282}
283
284#if _LIBCPP_STD_VER14 <= 17
285template <class _It>
286struct __is_cpp17_contiguous_iterator<__wrap_iter<_It> > : true_type {};
287#endif
288
289template <class _Iter>
290_LIBCPP_CONSTEXPRconstexpr
291decltype(_VSTDstd::__1::__to_address(declval<_Iter>()))
292__to_address(__wrap_iter<_Iter> __w) _NOEXCEPTnoexcept {
293 return _VSTDstd::__1::__to_address(__w.base());
294}
295
296_LIBCPP_END_NAMESPACE_STD} }
297
298_LIBCPP_POP_MACROSpop_macro("min") pop_macro("max")
299
300#endif // _LIBCPP___ITERATOR_WRAP_ITER_H