// Check offset overflow. Must fit in int32.
	MOVQ 2147483647+1(AX), AX       // ERROR "offset too large"
	MOVQ 3395469782(R10), R8        // ERROR "offset too large"
	LEAQ 3395469782(AX), AX         // ERROR "offset too large"
	ADDQ 3395469782(AX), AX         // ERROR "offset too large"
	ADDL 3395469782(AX), AX         // ERROR "offset too large"

		b.data = nil
		b.err = DecodeError{b.name, b.off, s}
	}
}

type DecodeError struct {
	Name   string
	Offset Offset
	Err    string
}

func (e DecodeError) Error() string {
	return "decoding dwarf section " + e.Name + " at offset 0x" + strconv.FormatInt(int64(e.Offset), 16) + ": " + e.Err

	if offset < 0 || length < 0 {
		return -1, errInvalidArgument
	}
	if offset+length > totalLength {
		return -1, errInvalidArgument
	}

	if length == 0 {
		return 0, nil
	}

	reader := newParallelReader(readers, e, offset, totalLength)
	if len(prefer) == len(readers) {

        "a/b"        | ""    | "a/b"
        ""           | ""    | ""
    }

    def "'#relativePath / #offset' #verb a prefix of '#childPath'"() {
        expect:
        VfsRelativePath.of(relativePath, offset).isPrefixOf(childPath, CASE_SENSITIVE) == result

        where:
        relativePath | offset         | childPath | result
        "a/b"        | "a/".length()  | "a"       | false

// Convert a < xlength, xoffset > pair into a match token.
func matchToken(xlength uint32, xoffset uint32) token {
	return token(matchType + xlength<<lengthShift + xoffset)
}

// Returns the literal of a literal token.
func (t token) literal() uint32 { return uint32(t - literalType) }

// Returns the extra offset of a match token.
func (t token) offset() uint32 { return uint32(t) & offsetMask }

	vd_ndx     uint16 /* Version Index */
	vd_cnt     uint16 /* Number of associated aux entries */
	vd_hash    uint32 /* Version name hash value */
	vd_aux     uint32 /* Offset in bytes to verdaux array */
	vd_next    uint32 /* Offset in bytes to next verdef entry */
}

type elfEhdr struct {
	e_ident     [_EI_NIDENT]byte /* Magic number and other info */
	e_type      uint16           /* Object file type */

namespace tflite {
namespace {

TEST(OffsetBufferTest, IsValidBufferOffsetTrueGreaterThan1) {
  EXPECT_TRUE(IsValidBufferOffset(/*offset=*/2));
}

TEST(OffsetBufferTest, IsValidBufferOffsetFalseForLessThanOrEqualTo1) {
  EXPECT_FALSE(IsValidBufferOffset(/*offset=*/1));
  EXPECT_FALSE(IsValidBufferOffset(/*offset=*/0));
}

}  // namespace

		}
		if isExecutable(info.Protection) {
			// NOTE: the meaning/value of Offset is unclear. However,
			// this likely doesn't matter as the text segment's file
			// offset is usually 0.
			addMapping(addr,
				addr+memRegionSize,
				read64(&info.Offset),
				regionFilename(addr),
				"")
			added = true
		}
		addr += memRegionSize
	}
}

 *
 * ```
 *  0..63 : Length of the UTF-16 sequence that this range maps to. The offset is b2b3.
 * 64..79 : Offset by a fixed negative offset. The bottom 4 bits of b1 are the top 4 bits of the offset.
 * 80..95 : Offset by a fixed positive offset. The bottom 4 bits of b1 are the top 4 bits of the offset.
 *    119 : Ignored.
 *    120 : Valid.
 *    121 : Disallowed
 *    122 : Mapped inline to the sequence: [b2].

		}
	}
	offset := int64(4)

	// Read the number of FatArchHeaders that come after the fat_header.
	var narch uint32
	err = binary.Read(sr, binary.BigEndian, &narch)
	if err != nil {
		return nil, &FormatError{offset, "invalid fat_header", nil}
	}
	offset += 4

	if narch < 1 {
		return nil, &FormatError{offset, "file contains no images", nil}
	}