1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8">
<title>libacpi: list.c Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.5.2 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
</ul>
</div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>File Members</span></a></li>
</ul>
</div>
<h1>list.c</h1><a href="list_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * (C)opyright 2007 Nico Golde <nico@ngolde.de></span>
<a name="l00003"></a>00003 <span class="comment"> * See LICENSE file for license details</span>
<a name="l00004"></a>00004 <span class="comment"> * This is no complete linked list implementation, it is just used</span>
<a name="l00005"></a>00005 <span class="comment"> * to get a list of directory entries and delete the list</span>
<a name="l00006"></a>00006 <span class="comment"> */</span>
<a name="l00007"></a>00007
<a name="l00008"></a>00008 <span class="preprocessor">#include <stdio.h></span>
<a name="l00009"></a>00009 <span class="preprocessor">#include <string.h></span>
<a name="l00010"></a>00010 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00011"></a>00011 <span class="preprocessor">#include <dirent.h></span>
<a name="l00012"></a>00012
<a name="l00013"></a>00013 <span class="preprocessor">#include "<a class="code" href="list_8h.html" title="linked list">list.h</a>"</span>
<a name="l00014"></a>00014
<a name="l00015"></a>00015 <span class="comment">/* create a new list */</span>
<a name="l00016"></a>00016 <span class="keyword">static</span> <a class="code" href="structlist__t.html" title="linked list">list_t</a> *
<a name="l00017"></a>00017 new_list(<span class="keywordtype">void</span>){
<a name="l00018"></a>00018 <a class="code" href="structlist__t.html" title="linked list">list_t</a> *l = malloc(<span class="keyword">sizeof</span>(<a class="code" href="structlist__t.html" title="linked list">list_t</a>));
<a name="l00019"></a>00019 <span class="keywordflow">if</span>(!l) <span class="keywordflow">return</span> NULL;
<a name="l00020"></a>00020 l-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a> = l-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a> = NULL;
<a name="l00021"></a>00021 l-><a class="code" href="structlist__t.html#83b75d11703efffb2677432019405890">length</a> = 0;
<a name="l00022"></a>00022 <span class="keywordflow">return</span> l;
<a name="l00023"></a>00023 }
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="keyword">static</span> <span class="keywordtype">void</span>
<a name="l00026"></a>00026 append_node(<a class="code" href="structlist__t.html" title="linked list">list_t</a> *lst, <span class="keywordtype">char</span> *name){
<a name="l00027"></a>00027 <a class="code" href="structnode__t.html" title="node for linked list">node_t</a> *n;
<a name="l00028"></a>00028 <span class="keywordflow">if</span>(!lst) <span class="keywordflow">return</span>;
<a name="l00029"></a>00029 <span class="keywordflow">if</span>((n = malloc(<span class="keyword">sizeof</span>(<a class="code" href="structnode__t.html" title="node for linked list">node_t</a>))) == NULL) <span class="keywordflow">return</span>;
<a name="l00030"></a>00030 <span class="keywordflow">if</span>((n->name = strdup(name)) == NULL) {
<a name="l00031"></a>00031 free(n);
<a name="l00032"></a>00032 <span class="keywordflow">return</span>;
<a name="l00033"></a>00033 }
<a name="l00034"></a>00034 n->next = NULL;
<a name="l00035"></a>00035 <span class="keywordflow">if</span>(lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a>){
<a name="l00036"></a>00036 lst-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a>->next = n;
<a name="l00037"></a>00037 lst-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a> = lst-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a>->next;
<a name="l00038"></a>00038 } <span class="keywordflow">else</span> {
<a name="l00039"></a>00039 lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a> = lst-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a> = n;
<a name="l00040"></a>00040 }
<a name="l00041"></a>00041 lst-><a class="code" href="structlist__t.html#83b75d11703efffb2677432019405890">length</a>++;
<a name="l00042"></a>00042 }
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="comment">/* delete the whole list */</span>
<a name="l00045"></a>00045 <span class="keywordtype">void</span>
<a name="l00046"></a><a class="code" href="list_8h.html#8779934af9269ac85b5eda546da2285c">00046</a> <a class="code" href="list_8c.html#8779934af9269ac85b5eda546da2285c">delete_list</a>(<a class="code" href="structlist__t.html" title="linked list">list_t</a> *lst){
<a name="l00047"></a>00047 node_t *tmp;
<a name="l00048"></a>00048 tmp = lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a>;
<a name="l00049"></a>00049 <span class="keywordflow">while</span>(tmp != NULL){
<a name="l00050"></a>00050 lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a> = tmp->next;
<a name="l00051"></a>00051 <span class="keywordflow">if</span>(tmp->name) free(tmp->name);
<a name="l00052"></a>00052 free(tmp);
<a name="l00053"></a>00053 tmp = lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a>;
<a name="l00054"></a>00054 }
<a name="l00055"></a>00055 lst-><a class="code" href="structlist__t.html#de49a4e4abadbc70c3c96dcb0100ca6a">top</a> = lst-><a class="code" href="structlist__t.html#60c65bb5c6c4040a68cce5e2e0f6915c">last</a> = NULL;
<a name="l00056"></a>00056 free(lst);
<a name="l00057"></a>00057 }
<a name="l00058"></a>00058
<a name="l00059"></a>00059 <span class="comment">/* return a linked list with directory entries or NULL on error */</span>
<a name="l00060"></a>00060 <a class="code" href="structlist__t.html" title="linked list">list_t</a> *
<a name="l00061"></a><a class="code" href="list_8h.html#ac821e6d16d9494f9b8ffc3f9cd0aec4">00061</a> <a class="code" href="list_8c.html#ac821e6d16d9494f9b8ffc3f9cd0aec4">dir_list</a>(<span class="keywordtype">char</span> *dir){
<a name="l00062"></a>00062 <a class="code" href="structlist__t.html" title="linked list">list_t</a> *list = new_list();
<a name="l00063"></a>00063 DIR *rddir = NULL;
<a name="l00064"></a>00064 <span class="keyword">struct </span>dirent *rd;
<a name="l00065"></a>00065
<a name="l00066"></a>00066 <span class="keywordflow">if</span>((rddir = opendir(dir)) == NULL)
<a name="l00067"></a>00067 <span class="keywordflow">return</span> NULL;
<a name="l00068"></a>00068 <span class="keywordflow">while</span>((rd = readdir(rddir))){
<a name="l00069"></a>00069 <span class="keywordflow">if</span>(!strncmp(<span class="stringliteral">"."</span>, rd->d_name, 1) || !strncmp(<span class="stringliteral">".."</span>, rd->d_name, 2))
<a name="l00070"></a>00070 <span class="keywordflow">continue</span>;
<a name="l00071"></a>00071
<a name="l00072"></a>00072 append_node(list, rd->d_name);
<a name="l00073"></a>00073 }
<a name="l00074"></a>00074 closedir(rddir);
<a name="l00075"></a>00075 <span class="keywordflow">return</span> list;
<a name="l00076"></a>00076 }
</pre></div><hr size="1"><address style="text-align: right;"><small>Generated on Sun Jul 29 14:09:38 2007 for libacpi by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.5.2 </small></address>
</body>
</html>
|
