Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
handle.c
Go to the documentation of this file.
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 
25 #include <core/object.h>
26 #include <core/handle.h>
27 #include <core/client.h>
28 
29 #define hprintk(h,l,f,a...) do { \
30  struct nouveau_client *c = nouveau_client((h)->object); \
31  struct nouveau_handle *p = (h)->parent; u32 n = p ? p->name : ~0; \
32  nv_printk((c), l, "0x%08x:0x%08x "f, n, (h)->name, ##a); \
33 } while(0)
34 
35 int
37 {
38  struct nouveau_handle *item;
39  int ret;
40 
41  hprintk(handle, TRACE, "init running\n");
42  ret = nouveau_object_inc(handle->object);
43  if (ret)
44  return ret;
45 
46  hprintk(handle, TRACE, "init children\n");
47  list_for_each_entry(item, &handle->tree, head) {
48  ret = nouveau_handle_init(item);
49  if (ret)
50  goto fail;
51  }
52 
53  hprintk(handle, TRACE, "init completed\n");
54  return 0;
55 fail:
56  hprintk(handle, ERROR, "init failed with %d\n", ret);
58  nouveau_handle_fini(item, false);
59  }
60 
61  nouveau_object_dec(handle->object, false);
62  return ret;
63 }
64 
65 int
67 {
68  static char *name[2] = { "fini", "suspend" };
69  struct nouveau_handle *item;
70  int ret;
71 
72  hprintk(handle, TRACE, "%s children\n", name[suspend]);
73  list_for_each_entry(item, &handle->tree, head) {
74  ret = nouveau_handle_fini(item, suspend);
75  if (ret && suspend)
76  goto fail;
77  }
78 
79  hprintk(handle, TRACE, "%s running\n", name[suspend]);
80  if (handle->object) {
81  ret = nouveau_object_dec(handle->object, suspend);
82  if (ret && suspend)
83  goto fail;
84  }
85 
86  hprintk(handle, TRACE, "%s completed\n", name[suspend]);
87  return 0;
88 fail:
89  hprintk(handle, ERROR, "%s failed with %d\n", name[suspend], ret);
91  int rret = nouveau_handle_init(item);
92  if (rret)
93  hprintk(handle, FATAL, "failed to restart, %d\n", rret);
94  }
95 
96  return ret;
97 }
98 
99 int
101  struct nouveau_object *object,
102  struct nouveau_handle **phandle)
103 {
104  struct nouveau_object *namedb;
105  struct nouveau_handle *handle;
106  int ret;
107 
108  namedb = parent;
109  while (!nv_iclass(namedb, NV_NAMEDB_CLASS))
110  namedb = namedb->parent;
111 
112  handle = *phandle = kzalloc(sizeof(*handle), GFP_KERNEL);
113  if (!handle)
114  return -ENOMEM;
115 
116  INIT_LIST_HEAD(&handle->head);
117  INIT_LIST_HEAD(&handle->tree);
118  handle->name = _handle;
119  handle->priv = ~0;
120 
121  ret = nouveau_namedb_insert(nv_namedb(namedb), _handle, object, handle);
122  if (ret) {
123  kfree(handle);
124  return ret;
125  }
126 
127  if (nv_parent(parent)->object_attach) {
128  ret = nv_parent(parent)->object_attach(parent, object, _handle);
129  if (ret < 0) {
130  nouveau_handle_destroy(handle);
131  return ret;
132  }
133 
134  handle->priv = ret;
135  }
136 
137  if (object != namedb) {
138  while (!nv_iclass(namedb, NV_CLIENT_CLASS))
139  namedb = namedb->parent;
140 
141  handle->parent = nouveau_namedb_get(nv_namedb(namedb), _parent);
142  if (handle->parent) {
143  list_add(&handle->head, &handle->parent->tree);
144  nouveau_namedb_put(handle->parent);
145  }
146  }
147 
148  hprintk(handle, TRACE, "created\n");
149  return 0;
150 }
151 
152 void
154 {
155  struct nouveau_handle *item, *temp;
156 
157  hprintk(handle, TRACE, "destroy running\n");
158  list_for_each_entry_safe(item, temp, &handle->tree, head) {
160  }
161  list_del(&handle->head);
162 
163  if (handle->priv != ~0) {
164  struct nouveau_object *parent = handle->parent->object;
165  nv_parent(parent)->object_detach(parent, handle->priv);
166  }
167 
168  hprintk(handle, TRACE, "destroy completed\n");
169  nouveau_namedb_remove(handle);
170  kfree(handle);
171 }
172 
173 struct nouveau_object *
175 {
176  struct nouveau_object *object = NULL;
177  struct nouveau_handle *handle;
178 
179  while (!nv_iclass(parent, NV_NAMEDB_CLASS))
180  parent = parent->parent;
181 
182  handle = nouveau_namedb_get(nv_namedb(parent), name);
183  if (handle) {
184  nouveau_object_ref(handle->object, &object);
185  nouveau_namedb_put(handle);
186  }
187 
188  return object;
189 }
190 
191 struct nouveau_handle *
193 {
194  struct nouveau_namedb *namedb;
195  if (engctx && (namedb = (void *)nv_pclass(engctx, NV_NAMEDB_CLASS)))
196  return nouveau_namedb_get_class(namedb, oclass);
197  return NULL;
198 }
199 
200 struct nouveau_handle *
202 {
203  struct nouveau_namedb *namedb;
204  if (engctx && (namedb = (void *)nv_pclass(engctx, NV_NAMEDB_CLASS)))
205  return nouveau_namedb_get_vinst(namedb, vinst);
206  return NULL;
207 }
208 
209 struct nouveau_handle *
211 {
212  struct nouveau_namedb *namedb;
213  if (engctx && (namedb = (void *)nv_pclass(engctx, NV_NAMEDB_CLASS)))
214  return nouveau_namedb_get_cinst(namedb, cinst);
215  return NULL;
216 }
217 
218 void
220 {
221  if (handle)
222  nouveau_namedb_put(handle);
223 }