Lines Matching defs:bitmap

2081   // entry encodes 1 relocation. The subsequent bitmap entries encode up to 63
2084   // The bitmap entries must have 1 in the least significant bit. The assumption
2088   // Excluding the least significant bit in the bitmap, each non-zero bit in
2089   // the bitmap represents a relocation to be applied to a corresponding machine
2093   // a single bitmap can encode up to 31 relocations in a 32-bit object, and
2097   // 1. Looking at any entry, it is clear whether it's an address or a bitmap:
2098   //    even means address, odd means bitmap.
2106   // Number of bits to use for the relocation offsets bitmap.
2117   // as a bitmap and fold them.
2126       uint64_t bitmap = 0;
2131         bitmap |= uint64_t(1) << (d / wordsize);
2133       if (!bitmap)
2135       relrRelocs.push_back(Elf_Relr((bitmap << 1) | 1));