1 /**
2 * \file drm_info.c
3 * DRM info file implementations
4 *
5 * \author Ben Gamari <bgamari@gmail.com>
6 */
7
8 /*
9 * Created: Sun Dec 21 13:09:50 2008 by bgamari@gmail.com
10 *
11 * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
12 * Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
13 * Copyright 2008 Ben Gamari <bgamari@gmail.com>
14 * All Rights Reserved.
15 *
16 * Permission is hereby granted, free of charge, to any person obtaining a
17 * copy of this software and associated documentation files (the "Software"),
18 * to deal in the Software without restriction, including without limitation
19 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
20 * and/or sell copies of the Software, and to permit persons to whom the
21 * Software is furnished to do so, subject to the following conditions:
22 *
23 * The above copyright notice and this permission notice (including the next
24 * paragraph) shall be included in all copies or substantial portions of the
25 * Software.
26 *
27 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
28 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
29 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
30 * VA LINUX SYSTEMS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR
31 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
32 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
33 * OTHER DEALINGS IN THE SOFTWARE.
34 */
35
36 #include <linux/seq_file.h>
37 #include <drm/drmP.h>
38 #include <drm/drm_gem.h>
39
40 #include "drm_legacy.h"
41
42 /**
43 * Called when "/proc/dri/.../name" is read.
44 *
45 * Prints the device name together with the bus id if available.
46 */
drm_name_info(struct seq_file * m,void * data)47 int drm_name_info(struct seq_file *m, void *data)
48 {
49 struct drm_info_node *node = (struct drm_info_node *) m->private;
50 struct drm_minor *minor = node->minor;
51 struct drm_device *dev = minor->dev;
52 struct drm_master *master = minor->master;
53 if (!master)
54 return 0;
55
56 if (master->unique) {
57 seq_printf(m, "%s %s %s\n",
58 dev->driver->name,
59 dev_name(dev->dev), master->unique);
60 } else {
61 seq_printf(m, "%s %s\n",
62 dev->driver->name, dev_name(dev->dev));
63 }
64 return 0;
65 }
66
67 /**
68 * Called when "/proc/dri/.../vm" is read.
69 *
70 * Prints information about all mappings in drm_device::maplist.
71 */
drm_vm_info(struct seq_file * m,void * data)72 int drm_vm_info(struct seq_file *m, void *data)
73 {
74 struct drm_info_node *node = (struct drm_info_node *) m->private;
75 struct drm_device *dev = node->minor->dev;
76 struct drm_local_map *map;
77 struct drm_map_list *r_list;
78
79 /* Hardcoded from _DRM_FRAME_BUFFER,
80 _DRM_REGISTERS, _DRM_SHM, _DRM_AGP, and
81 _DRM_SCATTER_GATHER and _DRM_CONSISTENT */
82 const char *types[] = { "FB", "REG", "SHM", "AGP", "SG", "PCI" };
83 const char *type;
84 int i;
85
86 mutex_lock(&dev->struct_mutex);
87 seq_printf(m, "slot offset size type flags address mtrr\n\n");
88 i = 0;
89 list_for_each_entry(r_list, &dev->maplist, head) {
90 map = r_list->map;
91 if (!map)
92 continue;
93 if (map->type < 0 || map->type > 5)
94 type = "??";
95 else
96 type = types[map->type];
97
98 seq_printf(m, "%4d 0x%016llx 0x%08lx %4.4s 0x%02x 0x%08lx ",
99 i,
100 (unsigned long long)map->offset,
101 map->size, type, map->flags,
102 (unsigned long) r_list->user_token);
103 if (map->mtrr < 0)
104 seq_printf(m, "none\n");
105 else
106 seq_printf(m, "%4d\n", map->mtrr);
107 i++;
108 }
109 mutex_unlock(&dev->struct_mutex);
110 return 0;
111 }
112
113 /**
114 * Called when "/proc/dri/.../bufs" is read.
115 */
drm_bufs_info(struct seq_file * m,void * data)116 int drm_bufs_info(struct seq_file *m, void *data)
117 {
118 struct drm_info_node *node = (struct drm_info_node *) m->private;
119 struct drm_device *dev = node->minor->dev;
120 struct drm_device_dma *dma;
121 int i, seg_pages;
122
123 mutex_lock(&dev->struct_mutex);
124 dma = dev->dma;
125 if (!dma) {
126 mutex_unlock(&dev->struct_mutex);
127 return 0;
128 }
129
130 seq_printf(m, " o size count free segs pages kB\n\n");
131 for (i = 0; i <= DRM_MAX_ORDER; i++) {
132 if (dma->bufs[i].buf_count) {
133 seg_pages = dma->bufs[i].seg_count * (1 << dma->bufs[i].page_order);
134 seq_printf(m, "%2d %8d %5d %5d %5d %5d %5ld\n",
135 i,
136 dma->bufs[i].buf_size,
137 dma->bufs[i].buf_count,
138 0,
139 dma->bufs[i].seg_count,
140 seg_pages,
141 seg_pages * PAGE_SIZE / 1024);
142 }
143 }
144 seq_printf(m, "\n");
145 for (i = 0; i < dma->buf_count; i++) {
146 if (i && !(i % 32))
147 seq_printf(m, "\n");
148 seq_printf(m, " %d", dma->buflist[i]->list);
149 }
150 seq_printf(m, "\n");
151 mutex_unlock(&dev->struct_mutex);
152 return 0;
153 }
154
155 /**
156 * Called when "/proc/dri/.../vblank" is read.
157 */
drm_vblank_info(struct seq_file * m,void * data)158 int drm_vblank_info(struct seq_file *m, void *data)
159 {
160 struct drm_info_node *node = (struct drm_info_node *) m->private;
161 struct drm_device *dev = node->minor->dev;
162 int crtc;
163
164 mutex_lock(&dev->struct_mutex);
165 for (crtc = 0; crtc < dev->num_crtcs; crtc++) {
166 seq_printf(m, "CRTC %d enable: %d\n",
167 crtc, atomic_read(&dev->vblank[crtc].refcount));
168 seq_printf(m, "CRTC %d counter: %d\n",
169 crtc, drm_vblank_count(dev, crtc));
170 seq_printf(m, "CRTC %d last wait: %d\n",
171 crtc, dev->vblank[crtc].last_wait);
172 seq_printf(m, "CRTC %d in modeset: %d\n",
173 crtc, dev->vblank[crtc].inmodeset);
174 }
175 mutex_unlock(&dev->struct_mutex);
176 return 0;
177 }
178
179 /**
180 * Called when "/proc/dri/.../clients" is read.
181 *
182 */
drm_clients_info(struct seq_file * m,void * data)183 int drm_clients_info(struct seq_file *m, void *data)
184 {
185 struct drm_info_node *node = (struct drm_info_node *) m->private;
186 struct drm_device *dev = node->minor->dev;
187 struct drm_file *priv;
188
189 seq_printf(m,
190 "%20s %5s %3s master a %5s %10s\n",
191 "command",
192 "pid",
193 "dev",
194 "uid",
195 "magic");
196
197 /* dev->filelist is sorted youngest first, but we want to present
198 * oldest first (i.e. kernel, servers, clients), so walk backwardss.
199 */
200 mutex_lock(&dev->struct_mutex);
201 list_for_each_entry_reverse(priv, &dev->filelist, lhead) {
202 struct task_struct *task;
203
204 rcu_read_lock(); /* locks pid_task()->comm */
205 task = pid_task(priv->pid, PIDTYPE_PID);
206 seq_printf(m, "%20s %5d %3d %c %c %5d %10u\n",
207 task ? task->comm : "<unknown>",
208 pid_vnr(priv->pid),
209 priv->minor->index,
210 priv->is_master ? 'y' : 'n',
211 priv->authenticated ? 'y' : 'n',
212 from_kuid_munged(seq_user_ns(m), priv->uid),
213 priv->magic);
214 rcu_read_unlock();
215 }
216 mutex_unlock(&dev->struct_mutex);
217 return 0;
218 }
219
220
drm_gem_one_name_info(int id,void * ptr,void * data)221 static int drm_gem_one_name_info(int id, void *ptr, void *data)
222 {
223 struct drm_gem_object *obj = ptr;
224 struct seq_file *m = data;
225
226 seq_printf(m, "%6d %8zd %7d %8d\n",
227 obj->name, obj->size,
228 obj->handle_count,
229 atomic_read(&obj->refcount.refcount));
230 return 0;
231 }
232
drm_gem_name_info(struct seq_file * m,void * data)233 int drm_gem_name_info(struct seq_file *m, void *data)
234 {
235 struct drm_info_node *node = (struct drm_info_node *) m->private;
236 struct drm_device *dev = node->minor->dev;
237
238 seq_printf(m, " name size handles refcount\n");
239
240 mutex_lock(&dev->object_name_lock);
241 idr_for_each(&dev->object_name_idr, drm_gem_one_name_info, m);
242 mutex_unlock(&dev->object_name_lock);
243
244 return 0;
245 }
246