2 * Copyright (c) 2015, Mellanox Technologies. All rights reserved.
4 * This software is available to you under a choice of one of two
5 * licenses. You may choose to be licensed under the terms of the GNU
6 * General Public License (GPL) Version 2, available from the file
7 * COPYING in the main directory of this source tree, or the
8 * OpenIB.org BSD license below:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
18 * - Redistributions in binary form must reproduce the above
19 * copyright notice, this list of conditions and the following
20 * disclaimer in the documentation and/or other materials
21 * provided with the distribution.
23 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
24 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
25 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
26 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
27 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
28 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
29 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33 #include <linux/mutex.h>
34 #include <linux/mlx5/driver.h>
36 #include "mlx5_core.h"
39 static void tree_init_node(struct fs_node *node,
40 unsigned int refcount,
41 void (*remove_func)(struct fs_node *))
43 atomic_set(&node->refcount, refcount);
44 INIT_LIST_HEAD(&node->list);
45 INIT_LIST_HEAD(&node->children);
46 mutex_init(&node->lock);
47 node->remove_func = remove_func;
50 static void tree_add_node(struct fs_node *node, struct fs_node *parent)
53 atomic_inc(&parent->refcount);
54 node->parent = parent;
56 /* Parent is the root */
60 node->root = parent->root;
63 static void tree_get_node(struct fs_node *node)
65 atomic_inc(&node->refcount);
68 static void nested_lock_ref_node(struct fs_node *node)
71 mutex_lock_nested(&node->lock, SINGLE_DEPTH_NESTING);
72 atomic_inc(&node->refcount);
76 static void lock_ref_node(struct fs_node *node)
79 mutex_lock(&node->lock);
80 atomic_inc(&node->refcount);
84 static void unlock_ref_node(struct fs_node *node)
87 atomic_dec(&node->refcount);
88 mutex_unlock(&node->lock);
92 static void tree_put_node(struct fs_node *node)
94 struct fs_node *parent_node = node->parent;
96 lock_ref_node(parent_node);
97 if (atomic_dec_and_test(&node->refcount)) {
99 list_del_init(&node->list);
100 if (node->remove_func)
101 node->remove_func(node);
105 unlock_ref_node(parent_node);
106 if (!node && parent_node)
107 tree_put_node(parent_node);
110 static int tree_remove_node(struct fs_node *node)
112 if (atomic_read(&node->refcount) > 1)