source: mainline/uspace/srv/fs/fat/fat_dentry.c@ a1d89ad

lfn serial ticket/834-toolchain-update topic/msim-upgrade topic/simplify-dev-export
Last change on this file since a1d89ad was 7afb4a5, checked in by Jiri Svoboda <jirik.svoboda@…>, 17 years ago

Nuke strchr() and strrchr().

  • Property mode set to 100644
File size: 4.7 KB
Line 
1/*
2 * Copyright (c) 2008 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 fat_dentry.c
35 * @brief Functions that work with FAT directory entries.
36 */
37
38#include "fat_dentry.h"
39#include <ctype.h>
40#include <string.h>
41
42static bool is_d_char(const char ch)
43{
44 if (isalnum(ch) || ch == '_')
45 return true;
46 else
47 return false;
48}
49
50/** Compare path component with the name read from the dentry.
51 *
52 * This function compares the path component with the name read from the dentry.
53 * The comparison is case insensitive and tolerates a mismatch on the trailing
54 * dot character at the end of the name (i.e. when there is a dot, but no
55 * extension).
56 *
57 * @param name Node name read from the dentry.
58 * @param component Path component.
59 *
60 * @return Zero on match, non-zero otherwise.
61 */
62int fat_dentry_namecmp(char *name, const char *component)
63{
64 int rc;
65 size_t size;
66
67 if (!(rc = stricmp(name, component)))
68 return rc;
69 if (!str_chr(name, '.')) {
70 /*
71 * There is no '.' in the name, so we know that there is enough
72 * space for appending an extra '.' to name.
73 */
74 size = str_size(name);
75 name[size] = '.';
76 name[size + 1] = '\0';
77 rc = stricmp(name, component);
78 }
79 return rc;
80}
81
82bool fat_dentry_name_verify(const char *name)
83{
84 unsigned i, dot;
85 bool dot_found = false;
86
87
88 for (i = 0; name[i]; i++) {
89 if (name[i] == '.') {
90 if (dot_found) {
91 return false;
92 } else {
93 dot_found = true;
94 dot = i;
95 }
96 } else {
97 if (!is_d_char(name[i]))
98 return false;
99 }
100 }
101
102 if (dot_found) {
103 if (dot > FAT_NAME_LEN)
104 return false;
105 if (i - dot > FAT_EXT_LEN + 1)
106 return false;
107 } else {
108 if (i > FAT_NAME_LEN)
109 return false;
110 }
111
112 return true;
113}
114
115void fat_dentry_name_get(const fat_dentry_t *d, char *buf)
116{
117 int i;
118
119 for (i = 0; i < FAT_NAME_LEN; i++) {
120 if (d->name[i] == FAT_PAD)
121 break;
122 if (d->name[i] == FAT_DENTRY_E5_ESC)
123 *buf++ = 0xe5;
124 else
125 *buf++ = d->name[i];
126 }
127 if (d->ext[0] != FAT_PAD)
128 *buf++ = '.';
129 for (i = 0; i < FAT_EXT_LEN; i++) {
130 if (d->ext[i] == FAT_PAD) {
131 *buf = '\0';
132 return;
133 }
134 if (d->ext[i] == FAT_DENTRY_E5_ESC)
135 *buf++ = 0xe5;
136 else
137 *buf++ = d->ext[i];
138 }
139 *buf = '\0';
140}
141
142void fat_dentry_name_set(fat_dentry_t *d, const char *name)
143{
144 int i;
145 const char fake_ext[] = " ";
146
147
148 for (i = 0; i < FAT_NAME_LEN; i++) {
149 switch ((uint8_t) *name) {
150 case 0xe5:
151 d->name[i] = FAT_DENTRY_E5_ESC;
152 name++;
153 break;
154 case '\0':
155 case '.':
156 d->name[i] = FAT_PAD;
157 break;
158 default:
159 d->name[i] = toupper(*name++);
160 break;
161 }
162 }
163 if (*name++ != '.')
164 name = fake_ext;
165 for (i = 0; i < FAT_EXT_LEN; i++) {
166 switch ((uint8_t) *name) {
167 case 0xe5:
168 d->ext[i] = FAT_DENTRY_E5_ESC;
169 name++;
170 break;
171 case '\0':
172 d->ext[i] = FAT_PAD;
173 break;
174 default:
175 d->ext[i] = toupper(*name++);
176 break;
177 }
178 }
179}
180
181fat_dentry_clsf_t fat_classify_dentry(const fat_dentry_t *d)
182{
183 if (d->attr & FAT_ATTR_VOLLABEL) {
184 /* volume label entry */
185 return FAT_DENTRY_SKIP;
186 }
187 if (d->name[0] == FAT_DENTRY_ERASED) {
188 /* not-currently-used entry */
189 return FAT_DENTRY_FREE;
190 }
191 if (d->name[0] == FAT_DENTRY_UNUSED) {
192 /* never used entry */
193 return FAT_DENTRY_LAST;
194 }
195 if (d->name[0] == FAT_DENTRY_DOT) {
196 /*
197 * Most likely '.' or '..'.
198 * It cannot occur in a regular file name.
199 */
200 return FAT_DENTRY_SKIP;
201 }
202 return FAT_DENTRY_VALID;
203}
204
205/**
206 * @}
207 */
Note: See TracBrowser for help on using the repository browser.