Lines Matching +full:0 +full:xe

27   for (int i = 0; i < kSize; i++) {  in PopulateFakeMap()
39 assert(reinterpret_cast<size_t>(Buffer) % sizeof(T) == 0 && in Read()
48 FakeModule.addAddressRange(/*begin=*/0x10, /*end=*/0x20, /*executable=*/true, in TEST()
50 const char uuid[MEMPROF_BUILDID_MAX_SIZE] = {0xC, 0x0, 0xF, 0xF, 0xE, 0xE}; in TEST()
59 memset(&FakeMIB, 0, sizeof(MemInfoBlock)); in TEST()
60 FakeMIB.AllocCount = 0x1; in TEST()
61 FakeMIB.TotalAccessCount = 0x2; in TEST()
64 FakeIds[0] = PopulateFakeMap(FakeMIB, /*StackPCBegin=*/2, FakeMap); in TEST()
71 ASSERT_GT(NumBytes, 0ULL); in TEST()
84 EXPECT_EQ(TotalSize % 8, 0ULL); in TEST()
107 0x01, 0, 0, 0, 0, 0, 0, 0, // Number of entries in TEST()
108 0x10, 0, 0, 0, 0, 0, 0, 0, // Start in TEST()
109 0x20, 0, 0, 0, 0, 0, 0, 0, // End in TEST()
110 0x0, 0, 0, 0, 0, 0, 0, 0, // Offset in TEST()
111 0x20, 0, 0, 0, 0, 0, 0, 0, // UuidSize in TEST()
112 0xC, 0x0, 0xF, 0xF, 0xE, 0xE // Uuid in TEST()
114 EXPECT_EQ(memcmp(Buffer + SegmentOffset, ExpectedSegmentBytes, 72), 0); in TEST()
120 FakeIds[0]); in TEST()
124 0x01, 0, 0, 0, // Alloc count in TEST()
125 0x02, 0, 0, 0, // Total access count in TEST()
130 0); in TEST()
135 0); in TEST()
141 FakeIds[0]); in TEST()
145 0x5, 0, 0, 0, 0, 0, 0, 0, // Number of PCs in TEST()
146 0x1, 0, 0, 0, 0, 0, 0, 0, // PC ... in TEST()
147 0x2, 0, 0, 0, 0, 0, 0, 0, 0x3, 0, 0, 0, 0, 0, 0, 0, in TEST()
148 0x4, 0, 0, 0, 0, 0, 0, 0, 0x5, 0, 0, 0, 0, 0, 0, 0, in TEST()
151 0x5, 0, 0, 0, 0, 0, 0, 0, // Number of PCs in TEST()
152 0x2, 0, 0, 0, 0, 0, 0, 0, // PC ... in TEST()
153 0x3, 0, 0, 0, 0, 0, 0, 0, 0x4, 0, 0, 0, 0, 0, 0, 0, in TEST()
154 0x5, 0, 0, 0, 0, 0, 0, 0, 0x6, 0, 0, 0, 0, 0, 0, 0, in TEST()
157 EXPECT_EQ(memcmp(Buffer + StackOffset + 16, ExpectedStackBytes[0], in TEST()
158 sizeof(ExpectedStackBytes[0])), in TEST()
159 0); in TEST()
168 0); in TEST()