Lines Matching +full:0 +full:xe

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