Loading...
1/*
2 * Copyright 2012 Red Hat Inc.
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
21 *
22 * Authors: Ben Skeggs
23 */
24#include <core/client.h>
25#include <core/device.h>
26#include <core/notify.h>
27#include <core/option.h>
28
29#include <nvif/class.h>
30#include <nvif/event.h>
31#include <nvif/if0000.h>
32#include <nvif/unpack.h>
33
34struct nvkm_client_notify {
35 struct nvkm_client *client;
36 struct nvkm_notify n;
37 u8 version;
38 u8 size;
39 union {
40 struct nvif_notify_rep_v0 v0;
41 } rep;
42};
43
44static int
45nvkm_client_notify(struct nvkm_notify *n)
46{
47 struct nvkm_client_notify *notify = container_of(n, typeof(*notify), n);
48 struct nvkm_client *client = notify->client;
49 return client->ntfy(¬ify->rep, notify->size, n->data, n->size);
50}
51
52int
53nvkm_client_notify_put(struct nvkm_client *client, int index)
54{
55 if (index < ARRAY_SIZE(client->notify)) {
56 if (client->notify[index]) {
57 nvkm_notify_put(&client->notify[index]->n);
58 return 0;
59 }
60 }
61 return -ENOENT;
62}
63
64int
65nvkm_client_notify_get(struct nvkm_client *client, int index)
66{
67 if (index < ARRAY_SIZE(client->notify)) {
68 if (client->notify[index]) {
69 nvkm_notify_get(&client->notify[index]->n);
70 return 0;
71 }
72 }
73 return -ENOENT;
74}
75
76int
77nvkm_client_notify_del(struct nvkm_client *client, int index)
78{
79 if (index < ARRAY_SIZE(client->notify)) {
80 if (client->notify[index]) {
81 nvkm_notify_fini(&client->notify[index]->n);
82 kfree(client->notify[index]);
83 client->notify[index] = NULL;
84 return 0;
85 }
86 }
87 return -ENOENT;
88}
89
90int
91nvkm_client_notify_new(struct nvkm_object *object,
92 struct nvkm_event *event, void *data, u32 size)
93{
94 struct nvkm_client *client = object->client;
95 struct nvkm_client_notify *notify;
96 union {
97 struct nvif_notify_req_v0 v0;
98 } *req = data;
99 u8 index, reply;
100 int ret = -ENOSYS;
101
102 for (index = 0; index < ARRAY_SIZE(client->notify); index++) {
103 if (!client->notify[index])
104 break;
105 }
106
107 if (index == ARRAY_SIZE(client->notify))
108 return -ENOSPC;
109
110 notify = kzalloc(sizeof(*notify), GFP_KERNEL);
111 if (!notify)
112 return -ENOMEM;
113
114 nvif_ioctl(object, "notify new size %d\n", size);
115 if (!(ret = nvif_unpack(ret, &data, &size, req->v0, 0, 0, true))) {
116 nvif_ioctl(object, "notify new vers %d reply %d route %02x "
117 "token %llx\n", req->v0.version,
118 req->v0.reply, req->v0.route, req->v0.token);
119 notify->version = req->v0.version;
120 notify->size = sizeof(notify->rep.v0);
121 notify->rep.v0.version = req->v0.version;
122 notify->rep.v0.route = req->v0.route;
123 notify->rep.v0.token = req->v0.token;
124 reply = req->v0.reply;
125 }
126
127 if (ret == 0) {
128 ret = nvkm_notify_init(object, event, nvkm_client_notify,
129 false, data, size, reply, ¬ify->n);
130 if (ret == 0) {
131 client->notify[index] = notify;
132 notify->client = client;
133 return index;
134 }
135 }
136
137 kfree(notify);
138 return ret;
139}
140
141static int
142nvkm_client_mthd_devlist(struct nvkm_object *object, void *data, u32 size)
143{
144 union {
145 struct nv_client_devlist_v0 v0;
146 } *args = data;
147 int ret = -ENOSYS;
148
149 nvif_ioctl(object, "client devlist size %d\n", size);
150 if (!(ret = nvif_unpack(ret, &data, &size, args->v0, 0, 0, true))) {
151 nvif_ioctl(object, "client devlist vers %d count %d\n",
152 args->v0.version, args->v0.count);
153 if (size == sizeof(args->v0.device[0]) * args->v0.count) {
154 ret = nvkm_device_list(args->v0.device, args->v0.count);
155 if (ret >= 0) {
156 args->v0.count = ret;
157 ret = 0;
158 }
159 } else {
160 ret = -EINVAL;
161 }
162 }
163
164 return ret;
165}
166
167static int
168nvkm_client_mthd(struct nvkm_object *object, u32 mthd, void *data, u32 size)
169{
170 switch (mthd) {
171 case NV_CLIENT_DEVLIST:
172 return nvkm_client_mthd_devlist(object, data, size);
173 default:
174 break;
175 }
176 return -EINVAL;
177}
178
179static int
180nvkm_client_child_new(const struct nvkm_oclass *oclass,
181 void *data, u32 size, struct nvkm_object **pobject)
182{
183 return oclass->base.ctor(oclass, data, size, pobject);
184}
185
186static int
187nvkm_client_child_get(struct nvkm_object *object, int index,
188 struct nvkm_oclass *oclass)
189{
190 const struct nvkm_sclass *sclass;
191
192 switch (index) {
193 case 0: sclass = &nvkm_udevice_sclass; break;
194 default:
195 return -EINVAL;
196 }
197
198 oclass->ctor = nvkm_client_child_new;
199 oclass->base = *sclass;
200 return 0;
201}
202
203static const struct nvkm_object_func
204nvkm_client_object_func = {
205 .mthd = nvkm_client_mthd,
206 .sclass = nvkm_client_child_get,
207};
208
209void
210nvkm_client_remove(struct nvkm_client *client, struct nvkm_object *object)
211{
212 if (!RB_EMPTY_NODE(&object->node))
213 rb_erase(&object->node, &client->objroot);
214}
215
216bool
217nvkm_client_insert(struct nvkm_client *client, struct nvkm_object *object)
218{
219 struct rb_node **ptr = &client->objroot.rb_node;
220 struct rb_node *parent = NULL;
221
222 while (*ptr) {
223 struct nvkm_object *this =
224 container_of(*ptr, typeof(*this), node);
225 parent = *ptr;
226 if (object->object < this->object)
227 ptr = &parent->rb_left;
228 else
229 if (object->object > this->object)
230 ptr = &parent->rb_right;
231 else
232 return false;
233 }
234
235 rb_link_node(&object->node, parent, ptr);
236 rb_insert_color(&object->node, &client->objroot);
237 return true;
238}
239
240struct nvkm_object *
241nvkm_client_search(struct nvkm_client *client, u64 handle)
242{
243 struct rb_node *node = client->objroot.rb_node;
244 while (node) {
245 struct nvkm_object *object =
246 container_of(node, typeof(*object), node);
247 if (handle < object->object)
248 node = node->rb_left;
249 else
250 if (handle > object->object)
251 node = node->rb_right;
252 else
253 return object;
254 }
255 return NULL;
256}
257
258int
259nvkm_client_fini(struct nvkm_client *client, bool suspend)
260{
261 struct nvkm_object *object = &client->object;
262 const char *name[2] = { "fini", "suspend" };
263 int i;
264 nvif_debug(object, "%s notify\n", name[suspend]);
265 for (i = 0; i < ARRAY_SIZE(client->notify); i++)
266 nvkm_client_notify_put(client, i);
267 return nvkm_object_fini(&client->object, suspend);
268}
269
270int
271nvkm_client_init(struct nvkm_client *client)
272{
273 return nvkm_object_init(&client->object);
274}
275
276void
277nvkm_client_del(struct nvkm_client **pclient)
278{
279 struct nvkm_client *client = *pclient;
280 int i;
281 if (client) {
282 nvkm_client_fini(client, false);
283 for (i = 0; i < ARRAY_SIZE(client->notify); i++)
284 nvkm_client_notify_del(client, i);
285 nvkm_object_dtor(&client->object);
286 kfree(*pclient);
287 *pclient = NULL;
288 }
289}
290
291int
292nvkm_client_new(const char *name, u64 device, const char *cfg,
293 const char *dbg, struct nvkm_client **pclient)
294{
295 struct nvkm_oclass oclass = {};
296 struct nvkm_client *client;
297
298 if (!(client = *pclient = kzalloc(sizeof(*client), GFP_KERNEL)))
299 return -ENOMEM;
300 oclass.client = client;
301
302 nvkm_object_ctor(&nvkm_client_object_func, &oclass, &client->object);
303 snprintf(client->name, sizeof(client->name), "%s", name);
304 client->device = device;
305 client->debug = nvkm_dbgopt(dbg, "CLIENT");
306 client->objroot = RB_ROOT;
307 client->dmaroot = RB_ROOT;
308 return 0;
309}
1/*
2 * Copyright 2012 Red Hat Inc.
3 *
4 * Permission is hereby granted, free of charge, to any person obtaining a
5 * copy of this software and associated documentation files (the "Software"),
6 * to deal in the Software without restriction, including without limitation
7 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
8 * and/or sell copies of the Software, and to permit persons to whom the
9 * Software is furnished to do so, subject to the following conditions:
10 *
11 * The above copyright notice and this permission notice shall be included in
12 * all copies or substantial portions of the Software.
13 *
14 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
17 * THE COPYRIGHT HOLDER(S) OR AUTHOR(S) BE LIABLE FOR ANY CLAIM, DAMAGES OR
18 * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE,
19 * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
20 * OTHER DEALINGS IN THE SOFTWARE.
21 *
22 * Authors: Ben Skeggs
23 */
24#include <core/client.h>
25#include <core/device.h>
26#include <core/option.h>
27
28#include <nvif/class.h>
29#include <nvif/event.h>
30#include <nvif/if0000.h>
31#include <nvif/unpack.h>
32
33static int
34nvkm_uclient_new(const struct nvkm_oclass *oclass, void *argv, u32 argc,
35 struct nvkm_object **pobject)
36{
37 union {
38 struct nvif_client_v0 v0;
39 } *args = argv;
40 struct nvkm_client *client;
41 int ret = -ENOSYS;
42
43 if (!(ret = nvif_unpack(ret, &argv, &argc, args->v0, 0, 0, false))){
44 args->v0.name[sizeof(args->v0.name) - 1] = 0;
45 ret = nvkm_client_new(args->v0.name, args->v0.device, NULL,
46 NULL, oclass->client->event, &client);
47 if (ret)
48 return ret;
49 } else
50 return ret;
51
52 client->object.client = oclass->client;
53 client->object.handle = oclass->handle;
54 client->object.route = oclass->route;
55 client->object.token = oclass->token;
56 client->object.object = oclass->object;
57 client->debug = oclass->client->debug;
58 *pobject = &client->object;
59 return 0;
60}
61
62static const struct nvkm_sclass
63nvkm_uclient_sclass = {
64 .oclass = NVIF_CLASS_CLIENT,
65 .minver = 0,
66 .maxver = 0,
67 .ctor = nvkm_uclient_new,
68};
69
70static const struct nvkm_object_func nvkm_client;
71struct nvkm_client *
72nvkm_client_search(struct nvkm_client *client, u64 handle)
73{
74 struct nvkm_object *object;
75
76 object = nvkm_object_search(client, handle, &nvkm_client);
77 if (IS_ERR(object))
78 return (void *)object;
79
80 return nvkm_client(object);
81}
82
83static int
84nvkm_client_mthd_devlist(struct nvkm_client *client, void *data, u32 size)
85{
86 union {
87 struct nvif_client_devlist_v0 v0;
88 } *args = data;
89 int ret = -ENOSYS;
90
91 nvif_ioctl(&client->object, "client devlist size %d\n", size);
92 if (!(ret = nvif_unpack(ret, &data, &size, args->v0, 0, 0, true))) {
93 nvif_ioctl(&client->object, "client devlist vers %d count %d\n",
94 args->v0.version, args->v0.count);
95 if (size == sizeof(args->v0.device[0]) * args->v0.count) {
96 ret = nvkm_device_list(args->v0.device, args->v0.count);
97 if (ret >= 0) {
98 args->v0.count = ret;
99 ret = 0;
100 }
101 } else {
102 ret = -EINVAL;
103 }
104 }
105
106 return ret;
107}
108
109static int
110nvkm_client_mthd(struct nvkm_object *object, u32 mthd, void *data, u32 size)
111{
112 struct nvkm_client *client = nvkm_client(object);
113 switch (mthd) {
114 case NVIF_CLIENT_V0_DEVLIST:
115 return nvkm_client_mthd_devlist(client, data, size);
116 default:
117 break;
118 }
119 return -EINVAL;
120}
121
122static int
123nvkm_client_child_new(const struct nvkm_oclass *oclass,
124 void *data, u32 size, struct nvkm_object **pobject)
125{
126 return oclass->base.ctor(oclass, data, size, pobject);
127}
128
129static int
130nvkm_client_child_get(struct nvkm_object *object, int index,
131 struct nvkm_oclass *oclass)
132{
133 const struct nvkm_sclass *sclass;
134
135 switch (index) {
136 case 0: sclass = &nvkm_uclient_sclass; break;
137 case 1: sclass = &nvkm_udevice_sclass; break;
138 default:
139 return -EINVAL;
140 }
141
142 oclass->ctor = nvkm_client_child_new;
143 oclass->base = *sclass;
144 return 0;
145}
146
147static int
148nvkm_client_fini(struct nvkm_object *object, bool suspend)
149{
150 return 0;
151}
152
153static void *
154nvkm_client_dtor(struct nvkm_object *object)
155{
156 return nvkm_client(object);
157}
158
159static const struct nvkm_object_func
160nvkm_client = {
161 .dtor = nvkm_client_dtor,
162 .fini = nvkm_client_fini,
163 .mthd = nvkm_client_mthd,
164 .sclass = nvkm_client_child_get,
165};
166
167int
168nvkm_client_new(const char *name, u64 device, const char *cfg, const char *dbg,
169 int (*event)(u64, void *, u32), struct nvkm_client **pclient)
170{
171 struct nvkm_oclass oclass = { .base = nvkm_uclient_sclass };
172 struct nvkm_client *client;
173
174 if (!(client = *pclient = kzalloc(sizeof(*client), GFP_KERNEL)))
175 return -ENOMEM;
176 oclass.client = client;
177
178 nvkm_object_ctor(&nvkm_client, &oclass, &client->object);
179 snprintf(client->name, sizeof(client->name), "%s", name);
180 client->device = device;
181 client->debug = nvkm_dbgopt(dbg, "CLIENT");
182 client->objroot = RB_ROOT;
183 spin_lock_init(&client->obj_lock);
184 client->event = event;
185 INIT_LIST_HEAD(&client->umem);
186 spin_lock_init(&client->lock);
187 return 0;
188}