-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmqttfs_create.c
74 lines (65 loc) · 2.03 KB
/
mqttfs_create.c
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
/*
* Copyright (C) 2022 Mikhail Burakov. This file is part of mqttfs.
*
* mqttfs is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* mqttfs is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with mqttfs. If not, see <https://www.gnu.org/licenses/>.
*/
#include <errno.h>
#include <fuse.h>
#include <search.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <sys/types.h>
#include <threads.h>
#include "log.h"
#include "mqttfs.h"
#include "node.h"
#include "str.h"
int MqttfsCreate(const char* path, mode_t mode, struct fuse_file_info* fi) {
(void)mode;
struct Context* context = fuse_get_context()->private_data;
if (mtx_lock(&context->root_mutex) != thrd_success) {
LOG(ERR, "failed to lock root mutex");
return -EIO;
}
int result;
struct Str path_view = StrView(path + 1);
void** nodep = tsearch(&path_view, &context->root_node, NodeCompare);
if (!nodep) {
LOG(ERR, "failed to search node: %s", strerror(errno));
result = -EIO;
goto rollback_mtx_lock;
}
if (*nodep != &path_view) {
result = -EEXIST;
goto rollback_mtx_lock;
}
// TODO(mburakov): Should recursive creation be allowed?
// TODO(mburakov): Should parent node type be verified?
struct Node* node = NodeCreate(&path_view, 0);
if (!node) {
LOG(ERR, "failed to create node");
result = -EIO;
goto rollback_tsearch;
}
*nodep = node;
fi->fh = (uint64_t)node;
mtx_unlock(&context->root_mutex);
return 0;
rollback_tsearch:
tdelete(&path_view, &context->root_node, NodeCompare);
rollback_mtx_lock:
mtx_unlock(&context->root_mutex);
return result;
}