1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
/*
* Copyright © 2008 Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*
* Authors:
* Eric Anholt <eric@anholt.net>
*
*/
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <fcntl.h>
#include <inttypes.h>
#include <errno.h>
#include <sys/stat.h>
#include <sys/ioctl.h>
#include <sys/mman.h>
#include "drm.h"
#include "i915_drm.h"
#include "drmtest.h"
#include "intel_gpu_tools.h"
#define OBJECT_SIZE (1024*1024)
#define TEST_STRIDE (1024*4)
/**
* Testcase: Check set_tiling vs gtt mmap coherency
*/
int main(int argc, char **argv)
{
int fd;
uint32_t *ptr;
uint32_t data[OBJECT_SIZE/4];
int i;
uint32_t handle;
bool tiling_changed;
int tile_height;
fd = drm_open_any();
if (IS_GEN2(intel_get_drm_devid(fd)))
tile_height = 16;
else
tile_height = 8;
handle = gem_create(fd, OBJECT_SIZE);
ptr = gem_mmap(fd, handle, OBJECT_SIZE, PROT_READ | PROT_WRITE);
assert(ptr);
/* gtt coherency is done with set_domain in libdrm, don't break that */
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, I915_GEM_DOMAIN_GTT);
for (i = 0; i < OBJECT_SIZE/4; i++)
ptr[i] = data[i] = i;
gem_set_tiling(fd, handle, I915_TILING_X, TEST_STRIDE);
printf("testing untiled->tiled\n");
tiling_changed = false;
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, 0);
/* Too lazy to check for the correct tiling, and impossible anyway on
* bit17 swizzling machines. */
for (i = 0; i < OBJECT_SIZE/4; i++)
if (ptr[i] != data[i])
tiling_changed = true;
assert(tiling_changed);
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, I915_GEM_DOMAIN_GTT);
for (i = 0; i < OBJECT_SIZE/4; i++)
ptr[i] = data[i] = i;
gem_set_tiling(fd, handle, I915_TILING_X, TEST_STRIDE*2);
printf("testing tiled->tiled\n");
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, 0);
for (i = 0; i < OBJECT_SIZE/4; i++) {
int tile_row = i / (TEST_STRIDE * tile_height / 4);
int row = i / (TEST_STRIDE * 2 / 4);
int half = i & (TEST_STRIDE / 4);
int ofs = i % (TEST_STRIDE / 4);
int data_i = (tile_row/2)*(TEST_STRIDE * tile_height / 4)
+ row*TEST_STRIDE/4
+ half*tile_height + ofs;
uint32_t val = data[data_i];
if (ptr[i] != val) {
printf("mismatch at %i, row=%i, half=%i, ofs=%i\n",
i, row, half, ofs);
printf("read: 0x%08x, expected: 0x%08x\n",
ptr[i], val);
assert(0);
}
}
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, I915_GEM_DOMAIN_GTT);
for (i = 0; i < OBJECT_SIZE/4; i++)
ptr[i] = data[i] = i;
gem_set_tiling(fd, handle, I915_TILING_NONE, 0);
printf("testing tiled->untiled\n");
tiling_changed = false;
gem_set_domain(fd, handle, I915_GEM_DOMAIN_GTT, 0);
/* Too lazy to check for the correct tiling, and impossible anyway on
* bit17 swizzling machines. */
for (i = 0; i < OBJECT_SIZE/4; i++)
if (ptr[i] != data[i])
tiling_changed = true;
assert(tiling_changed);
munmap(ptr, OBJECT_SIZE);
close(fd);
return 0;
}
|
