Rev 2590 | Rev 2596 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
2590 | jermar | 1 | /* |
2 | * Copyright (c) 2007 Jakub Jermar |
||
3 | * All rights reserved. |
||
4 | * |
||
5 | * Redistribution and use in source and binary forms, with or without |
||
6 | * modification, are permitted provided that the following conditions |
||
7 | * are met: |
||
8 | * |
||
9 | * - Redistributions of source code must retain the above copyright |
||
10 | * notice, this list of conditions and the following disclaimer. |
||
11 | * - Redistributions in binary form must reproduce the above copyright |
||
12 | * notice, this list of conditions and the following disclaimer in the |
||
13 | * documentation and/or other materials provided with the distribution. |
||
14 | * - The name of the author may not be used to endorse or promote products |
||
15 | * derived from this software without specific prior written permission. |
||
16 | * |
||
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR |
||
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES |
||
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. |
||
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT |
||
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
||
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
||
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
||
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF |
||
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
||
27 | */ |
||
28 | |||
29 | /** @addtogroup fs |
||
30 | * @{ |
||
31 | */ |
||
32 | |||
33 | /** |
||
34 | * @file vfs_node.c |
||
35 | * @brief Various operations on VFS nodes have their home in this file. |
||
36 | */ |
||
37 | |||
38 | #include "vfs.h" |
||
39 | |||
2593 | jermar | 40 | /** Increment reference count of a VFS node. |
41 | * |
||
42 | * @param node VFS node that will have its refcnt incremented. |
||
43 | */ |
||
44 | void vfs_node_addref(vfs_node_t *node) |
||
45 | { |
||
46 | /* TODO */ |
||
47 | } |
||
48 | |||
49 | /** Decrement reference count of a VFS node. |
||
50 | * |
||
51 | * This function handles the case when the reference count drops to zero. |
||
52 | * |
||
53 | * @param node VFS node that will have its refcnt decremented. |
||
54 | */ |
||
55 | void vfs_node_delref(vfs_node_t *node) |
||
56 | { |
||
57 | /* TODO */ |
||
58 | } |
||
59 | |||
60 | /** Find VFS node. |
||
61 | * |
||
62 | * This function will try to lookup the given triplet in the VFS node hash |
||
63 | * table. In case the triplet is not found there, a new VFS node is created. |
||
64 | * In any case, the VFS node will have its reference count incremented. Every |
||
65 | * node returned by this call should be eventually put back by calling |
||
66 | * vfs_node_put() on it. |
||
67 | * |
||
68 | * @param triplet Triplet encoding the identity of the VFS node. |
||
69 | * |
||
70 | * @return VFS node corresponding to the given triplet. |
||
71 | */ |
||
2590 | jermar | 72 | vfs_node_t *vfs_node_get(vfs_triplet_t *triplet) |
73 | { |
||
2593 | jermar | 74 | /* TODO */ |
75 | return NULL; |
||
2590 | jermar | 76 | } |
77 | |||
2593 | jermar | 78 | /** Return VFS node when no longer needed by the caller. |
79 | * |
||
80 | * This function will remove the reference on the VFS node created by |
||
81 | * vfs_node_get(). This function can only be called as a closing bracket to the |
||
82 | * preceding vfs_node_get() call. |
||
83 | * |
||
84 | * @param node VFS node being released. |
||
85 | */ |
||
86 | void vfs_node_put(vfs_node_t *node) |
||
87 | { |
||
88 | vfs_node_delref(node); |
||
89 | } |
||
90 | |||
2590 | jermar | 91 | /** |
92 | * @} |
||
93 | */ |