Repository navigation
Expand file tree
/
Copy pathfs.c
More file actions
11413 lines (9294 loc) · 345 KB
/
Copy pathfs.c
File metadata and controls
11413 lines (9294 loc) · 345 KB
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
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#ifndef fs_c
#define fs_c
#include "fs.h"
#include <errno.h>
/* BEG fs_common_macros.c */
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <limits.h> /* For INT_MAX. */
#if defined(__clang__) && defined(__has_attribute)
#if __has_attribute(suppress)
#define FS_SUPPRESS_CLANG_ANALYZER __attribute__((suppress))
#else
#define FS_SUPPRESS_CLANG_ANALYZER
#endif
#else
#define FS_SUPPRESS_CLANG_ANALYZER
#endif
/* BEG fs_va_copy.c */
#ifndef fs_va_copy
#if !defined(_MSC_VER) || _MSC_VER >= 1800
#if defined(va_copy) || (defined(__cplusplus) && __cplusplus >= 201103L) || (defined(__STDC_VERSION__) && __STDC_VERSION__ >= 199901L && (!defined(__GNUC__) || __GNUC__ >= 3))
#define fs_va_copy(dst, src) va_copy((dst), (src))
#elif defined(__va_copy)
#define fs_va_copy(dst, src) __va_copy(dst, src)
#else
#define fs_va_copy(dst, src) ((dst) = (src)) /* This is untested. Not sure if this is correct for old GCC. */
#endif
#else
#define fs_va_copy(dst, src) ((dst) = (src))
#endif
#endif
/* END fs_va_copy.c */
#define FS_UNUSED(x) (void)x
#ifndef FS_MALLOC
#define FS_MALLOC(sz) malloc((sz))
#endif
#ifndef FS_REALLOC
#define FS_REALLOC(p, sz) realloc((p), (sz))
#endif
#ifndef FS_FREE
#define FS_FREE(p) free((p))
#endif
static void fs_zero_memory_default(void* p, size_t sz)
{
if (sz > 0) {
memset(p, 0, sz);
}
}
#ifndef FS_ZERO_MEMORY
#define FS_ZERO_MEMORY(p, sz) fs_zero_memory_default((p), (sz))
#endif
#ifndef FS_COPY_MEMORY
#define FS_COPY_MEMORY(dst, src, sz) memcpy((dst), (src), (sz))
#endif
#ifndef FS_MOVE_MEMORY
#define FS_MOVE_MEMORY(dst, src, sz) memmove((dst), (src), (sz))
#endif
#ifndef FS_ASSERT
#define FS_ASSERT(condition) assert(condition)
#endif
#define FS_ZERO_OBJECT(p) FS_ZERO_MEMORY((p), sizeof(*(p)))
#define FS_COUNTOF(x) (sizeof(x) / sizeof(x[0]))
#define FS_MAX(x, y) (((x) > (y)) ? (x) : (y))
#define FS_MIN(x, y) (((x) < (y)) ? (x) : (y))
#define FS_ABS(x) (((x) > 0) ? (x) : -(x))
#define FS_CLAMP(x, lo, hi) (FS_MAX((lo), FS_MIN((x), (hi))))
#define FS_OFFSET_PTR(p, offset) (((unsigned char*)(p)) + (offset))
#define FS_ALIGN(x, a) ((x + (a-1)) & ~(a-1))
/* END fs_common_macros.c */
FS_API char* fs_strcpy(char* dst, const char* src)
{
char* dstorig;
FS_ASSERT(dst != NULL);
FS_ASSERT(src != NULL);
dstorig = dst;
/* No, we're not using this garbage: while (*dst++ = *src++); */
for (;;) {
*dst = *src;
if (*src == '\0') {
break;
}
dst += 1;
src += 1;
}
return dstorig;
}
FS_API int fs_strncpy(char* dst, const char* src, size_t count)
{
size_t maxcount;
size_t i;
if (dst == 0) {
return EINVAL;
}
if (src == 0) {
dst[0] = '\0';
return EINVAL;
}
maxcount = count;
for (i = 0; i < maxcount && src[i] != '\0'; ++i) {
dst[i] = src[i];
}
if (i == count || src[i] == '\0' || count == ((size_t)-1)) {
dst[i] = '\0';
return 0;
}
dst[0] = '\0';
return ERANGE;
}
FS_API int fs_strcpy_s(char* dst, size_t dstCap, const char* src)
{
size_t i;
if (dst == 0) {
return EINVAL;
}
if (dstCap == 0) {
return ERANGE;
}
if (src == 0) {
dst[0] = '\0';
return EINVAL;
}
for (i = 0; i < dstCap && src[i] != '\0'; ++i) {
dst[i] = src[i];
}
if (i < dstCap) {
dst[i] = '\0';
return 0;
}
dst[0] = '\0';
return ERANGE;
}
FS_API int fs_strncpy_s(char* dst, size_t dstCap, const char* src, size_t count)
{
size_t maxcount;
size_t i;
if (dst == 0) {
return EINVAL;
}
if (dstCap == 0) {
return EINVAL;
}
if (src == 0) {
dst[0] = '\0';
return EINVAL;
}
maxcount = count;
if (count == ((size_t)-1) || count >= dstCap) { /* -1 = _TRUNCATE */
maxcount = dstCap - 1;
}
for (i = 0; i < maxcount && src[i] != '\0'; ++i) {
dst[i] = src[i];
}
if (src[i] == '\0' || i == count || count == ((size_t)-1)) {
dst[i] = '\0';
return 0;
}
dst[0] = '\0';
return ERANGE;
}
FS_API int fs_strcat_s(char* dst, size_t dstCap, const char* src)
{
char* dstorig;
if (dst == 0) {
return EINVAL;
}
if (dstCap == 0) {
return ERANGE;
}
if (src == 0) {
dst[0] = '\0';
return EINVAL;
}
dstorig = dst;
while (dstCap > 0 && dst[0] != '\0') {
dst += 1;
dstCap -= 1;
}
if (dstCap == 0) {
return EINVAL; /* Unterminated. */
}
while (dstCap > 0 && src[0] != '\0') {
*dst++ = *src++;
dstCap -= 1;
}
if (dstCap > 0) {
dst[0] = '\0';
} else {
dstorig[0] = '\0';
return ERANGE;
}
return 0;
}
FS_API int fs_strncat_s(char* dst, size_t dstCap, const char* src, size_t count)
{
char* dstorig;
if (dst == 0) {
return EINVAL;
}
if (dstCap == 0) {
return ERANGE;
}
if (src == 0) {
return EINVAL;
}
dstorig = dst;
while (dstCap > 0 && dst[0] != '\0') {
dst += 1;
dstCap -= 1;
}
if (dstCap == 0) {
return EINVAL; /* Unterminated. */
}
if (count == ((size_t)-1)) { /* _TRUNCATE */
count = dstCap - 1;
}
while (dstCap > 0 && src[0] != '\0' && count > 0) {
*dst++ = *src++;
dstCap -= 1;
count -= 1;
}
if (dstCap > 0) {
dst[0] = '\0';
} else {
dstorig[0] = '\0';
return ERANGE;
}
return 0;
}
FS_API int fs_strncmp(const char* str1, const char* str2, size_t maxLen)
{
if (str1 == str2) return 0;
/* These checks differ from the standard implementation. It's not important, but I prefer it just for sanity. */
if (str1 == NULL) return -1;
if (str2 == NULL) return 1;
/* This function still needs to check for null terminators even though the length has been specified. */
for (;;) {
if (maxLen == 0) {
break;
}
if (str1[0] == '\0') {
break;
}
if (str1[0] != str2[0]) {
break;
}
str1 += 1;
str2 += 1;
maxLen -= 1;
}
if (maxLen == 0) {
return 0;
}
return ((unsigned char*)str1)[0] - ((unsigned char*)str2)[0];
}
FS_API int fs_strnicmp_ascii(const char* str1, const char* str2, size_t count)
{
if (str1 == NULL || str2 == NULL) {
return 0;
}
while (*str1 != '\0' && *str2 != '\0' && count > 0) {
int c1 = (int)*str1;
int c2 = (int)*str2;
if (c1 >= 'A' && c1 <= 'Z') {
c1 += 'a' - 'A';
}
if (c2 >= 'A' && c2 <= 'Z') {
c2 += 'a' - 'A';
}
if (c1 != c2) {
return c1 - c2;
}
str1 += 1;
str2 += 1;
count -= 1;
}
if (count == 0) {
return 0;
} else if (*str1 == '\0' && *str2 == '\0') {
return 0;
} else if (*str1 == '\0') {
return -1;
} else {
return 1;
}
}
FS_API int fs_strnicmp(const char* str1, const char* str2, size_t count)
{
/* We will use the standard implementations of strnicmp() and strncasecmp() if they are available. */
#if defined(_MSC_VER) && _MSC_VER >= 1400
return _strnicmp(str1, str2, count);
#elif defined(__GNUC__) && defined(__USE_GNU)
return strncasecmp(str1, str2, count);
#else
/* It would be good if we could use a custom implementation based on the Unicode standard here. Would require a lot of work to get that right, however. */
return fs_strnicmp_ascii(str1, str2, count);
#endif
}
/* BEG fs_result_description.c */
FS_API const char* fs_result_description(fs_result result)
{
switch (result)
{
case FS_SUCCESS: return "No error";
case FS_ERROR: return "Unknown error";
case FS_INVALID_ARGS: return "Invalid argument";
case FS_INVALID_OPERATION: return "Invalid operation";
case FS_OUT_OF_MEMORY: return "Out of memory";
case FS_OUT_OF_RANGE: return "Out of range";
case FS_ACCESS_DENIED: return "Permission denied";
case FS_DOES_NOT_EXIST: return "Resource does not exist";
case FS_ALREADY_EXISTS: return "Resource already exists";
case FS_TOO_MANY_OPEN_FILES: return "Too many open files";
case FS_INVALID_FILE: return "Invalid file";
case FS_TOO_BIG: return "Too large";
case FS_PATH_TOO_LONG: return "Path too long";
case FS_NAME_TOO_LONG: return "Name too long";
case FS_NOT_DIRECTORY: return "Not a directory";
case FS_IS_DIRECTORY: return "Is a directory";
case FS_DIRECTORY_NOT_EMPTY: return "Directory not empty";
case FS_AT_END: return "At end";
case FS_NO_SPACE: return "No space available";
case FS_BUSY: return "Device or resource busy";
case FS_IO_ERROR: return "Input/output error";
case FS_INTERRUPT: return "Interrupted";
case FS_UNAVAILABLE: return "Resource unavailable";
case FS_ALREADY_IN_USE: return "Resource already in use";
case FS_BAD_ADDRESS: return "Bad address";
case FS_BAD_SEEK: return "Illegal seek";
case FS_BAD_PIPE: return "Broken pipe";
case FS_DEADLOCK: return "Deadlock";
case FS_TOO_MANY_LINKS: return "Too many links";
case FS_NOT_IMPLEMENTED: return "Not implemented";
case FS_NO_MESSAGE: return "No message of desired type";
case FS_BAD_MESSAGE: return "Invalid message";
case FS_NO_DATA_AVAILABLE: return "No data available";
case FS_INVALID_DATA: return "Invalid data";
case FS_TIMEOUT: return "Timeout";
case FS_NO_NETWORK: return "Network unavailable";
case FS_NOT_UNIQUE: return "Not unique";
case FS_NOT_SOCKET: return "Socket operation on non-socket";
case FS_NO_ADDRESS: return "Destination address required";
case FS_BAD_PROTOCOL: return "Protocol wrong type for socket";
case FS_PROTOCOL_UNAVAILABLE: return "Protocol not available";
case FS_PROTOCOL_NOT_SUPPORTED: return "Protocol not supported";
case FS_PROTOCOL_FAMILY_NOT_SUPPORTED: return "Protocol family not supported";
case FS_ADDRESS_FAMILY_NOT_SUPPORTED: return "Address family not supported";
case FS_SOCKET_NOT_SUPPORTED: return "Socket type not supported";
case FS_CONNECTION_RESET: return "Connection reset";
case FS_ALREADY_CONNECTED: return "Already connected";
case FS_NOT_CONNECTED: return "Not connected";
case FS_CONNECTION_REFUSED: return "Connection refused";
case FS_NO_HOST: return "No host";
case FS_IN_PROGRESS: return "Operation in progress";
case FS_CANCELLED: return "Operation cancelled";
case FS_MEMORY_ALREADY_MAPPED: return "Memory already mapped";
case FS_DIFFERENT_DEVICE: return "Different device";
default: return "Unknown error";
}
}
/* END fs_result_description.c */
/* BEG fs_result_conversion.c */
#include <errno.h>
FS_API fs_result fs_result_from_errno(int error)
{
if (error == 0) {
return FS_SUCCESS;
}
#ifdef EPERM
else if (error == EPERM) { return FS_INVALID_OPERATION; }
#endif
#ifdef ENOENT
else if (error == ENOENT) { return FS_DOES_NOT_EXIST; }
#endif
#ifdef ESRCH
else if (error == ESRCH) { return FS_DOES_NOT_EXIST; }
#endif
#ifdef EINTR
else if (error == EINTR) { return FS_INTERRUPT; }
#endif
#ifdef EIO
else if (error == EIO) { return FS_IO_ERROR; }
#endif
#ifdef ENXIO
else if (error == ENXIO) { return FS_DOES_NOT_EXIST; }
#endif
#ifdef E2BIG
else if (error == E2BIG) { return FS_INVALID_ARGS; }
#endif
#ifdef ENOEXEC
else if (error == ENOEXEC) { return FS_INVALID_FILE; }
#endif
#ifdef EBADF
else if (error == EBADF) { return FS_INVALID_FILE; }
#endif
#ifdef EAGAIN
else if (error == EAGAIN) { return FS_UNAVAILABLE; }
#endif
#ifdef ENOMEM
else if (error == ENOMEM) { return FS_OUT_OF_MEMORY; }
#endif
#ifdef EACCES
else if (error == EACCES) { return FS_ACCESS_DENIED; }
#endif
#ifdef EFAULT
else if (error == EFAULT) { return FS_BAD_ADDRESS; }
#endif
#ifdef EBUSY
else if (error == EBUSY) { return FS_BUSY; }
#endif
#ifdef EEXIST
else if (error == EEXIST) { return FS_ALREADY_EXISTS; }
#endif
#ifdef EXDEV
else if (error == EXDEV) { return FS_DIFFERENT_DEVICE; }
#endif
#ifdef ENODEV
else if (error == ENODEV) { return FS_DOES_NOT_EXIST; }
#endif
#ifdef ENOTDIR
else if (error == ENOTDIR) { return FS_NOT_DIRECTORY; }
#endif
#ifdef EISDIR
else if (error == EISDIR) { return FS_IS_DIRECTORY; }
#endif
#ifdef EINVAL
else if (error == EINVAL) { return FS_INVALID_ARGS; }
#endif
#ifdef ENFILE
else if (error == ENFILE) { return FS_TOO_MANY_OPEN_FILES; }
#endif
#ifdef EMFILE
else if (error == EMFILE) { return FS_TOO_MANY_OPEN_FILES; }
#endif
#ifdef ENOTTY
else if (error == ENOTTY) { return FS_INVALID_OPERATION; }
#endif
#ifdef ETXTBSY
else if (error == ETXTBSY) { return FS_BUSY; }
#endif
#ifdef EFBIG
else if (error == EFBIG) { return FS_TOO_BIG; }
#endif
#ifdef ENOSPC
else if (error == ENOSPC) { return FS_NO_SPACE; }
#endif
#ifdef ESPIPE
else if (error == ESPIPE) { return FS_BAD_SEEK; }
#endif
#ifdef EROFS
else if (error == EROFS) { return FS_ACCESS_DENIED; }
#endif
#ifdef EPIPE
else if (error == EPIPE) { return FS_BAD_PIPE; }
#endif
#ifdef EDOM
else if (error == EDOM) { return FS_OUT_OF_RANGE; }
#endif
#ifdef ERANGE
else if (error == ERANGE) { return FS_OUT_OF_RANGE; }
#endif
#ifdef EDEADLK
else if (error == EDEADLK) { return FS_DEADLOCK; }
#endif
#ifdef ENAMETOOLONG
else if (error == ENAMETOOLONG) { return FS_PATH_TOO_LONG; }
#endif
#ifdef ENOSYS
else if (error == ENOSYS) { return FS_NOT_IMPLEMENTED; }
#endif
#ifdef ENOTEMPTY
else if (error == ENOTEMPTY) { return FS_DIRECTORY_NOT_EMPTY; }
#endif
#ifdef ELNRNG
else if (error == ELNRNG) { return FS_OUT_OF_RANGE; }
#endif
#ifdef EBFONT
else if (error == EBFONT) { return FS_INVALID_FILE; }
#endif
#ifdef ENODATA
else if (error == ENODATA) { return FS_NO_DATA_AVAILABLE; }
#endif
#ifdef ETIME
else if (error == ETIME) { return FS_TIMEOUT; }
#endif
#ifdef ENOSR
else if (error == ENOSR) { return FS_NO_DATA_AVAILABLE; }
#endif
#ifdef ENONET
else if (error == ENONET) { return FS_NO_NETWORK; }
#endif
#ifdef EOVERFLOW
else if (error == EOVERFLOW) { return FS_TOO_BIG; }
#endif
#ifdef ELIBACC
else if (error == ELIBACC) { return FS_ACCESS_DENIED; }
#endif
#ifdef ELIBBAD
else if (error == ELIBBAD) { return FS_INVALID_FILE; }
#endif
#ifdef ELIBSCN
else if (error == ELIBSCN) { return FS_INVALID_FILE; }
#endif
#ifdef EILSEQ
else if (error == EILSEQ) { return FS_INVALID_DATA; }
#endif
#ifdef ENOTSOCK
else if (error == ENOTSOCK) { return FS_NOT_SOCKET; }
#endif
#ifdef EDESTADDRREQ
else if (error == EDESTADDRREQ) { return FS_NO_ADDRESS; }
#endif
#ifdef EMSGSIZE
else if (error == EMSGSIZE) { return FS_TOO_BIG; }
#endif
#ifdef EPROTOTYPE
else if (error == EPROTOTYPE) { return FS_BAD_PROTOCOL; }
#endif
#ifdef ENOPROTOOPT
else if (error == ENOPROTOOPT) { return FS_PROTOCOL_UNAVAILABLE; }
#endif
#ifdef EPROTONOSUPPORT
else if (error == EPROTONOSUPPORT) { return FS_PROTOCOL_NOT_SUPPORTED; }
#endif
#ifdef ESOCKTNOSUPPORT
else if (error == ESOCKTNOSUPPORT) { return FS_SOCKET_NOT_SUPPORTED; }
#endif
#ifdef EOPNOTSUPP
else if (error == EOPNOTSUPP) { return FS_INVALID_OPERATION; }
#endif
#ifdef EPFNOSUPPORT
else if (error == EPFNOSUPPORT) { return FS_PROTOCOL_FAMILY_NOT_SUPPORTED; }
#endif
#ifdef EAFNOSUPPORT
else if (error == EAFNOSUPPORT) { return FS_ADDRESS_FAMILY_NOT_SUPPORTED; }
#endif
#ifdef EADDRINUSE
else if (error == EADDRINUSE) { return FS_ALREADY_IN_USE; }
#endif
#ifdef ENETDOWN
else if (error == ENETDOWN) { return FS_NO_NETWORK; }
#endif
#ifdef ENETUNREACH
else if (error == ENETUNREACH) { return FS_NO_NETWORK; }
#endif
#ifdef ENETRESET
else if (error == ENETRESET) { return FS_NO_NETWORK; }
#endif
#ifdef ECONNABORTED
else if (error == ECONNABORTED) { return FS_NO_NETWORK; }
#endif
#ifdef ECONNRESET
else if (error == ECONNRESET) { return FS_CONNECTION_RESET; }
#endif
#ifdef ENOBUFS
else if (error == ENOBUFS) { return FS_NO_SPACE; }
#endif
#ifdef EISCONN
else if (error == EISCONN) { return FS_ALREADY_CONNECTED; }
#endif
#ifdef ENOTCONN
else if (error == ENOTCONN) { return FS_NOT_CONNECTED; }
#endif
#ifdef ETIMEDOUT
else if (error == ETIMEDOUT) { return FS_TIMEOUT; }
#endif
#ifdef ECONNREFUSED
else if (error == ECONNREFUSED) { return FS_CONNECTION_REFUSED; }
#endif
#ifdef EHOSTDOWN
else if (error == EHOSTDOWN) { return FS_NO_HOST; }
#endif
#ifdef EHOSTUNREACH
else if (error == EHOSTUNREACH) { return FS_NO_HOST; }
#endif
#ifdef EALREADY
else if (error == EALREADY) { return FS_IN_PROGRESS; }
#endif
#ifdef EINPROGRESS
else if (error == EINPROGRESS) { return FS_IN_PROGRESS; }
#endif
#ifdef ESTALE
else if (error == ESTALE) { return FS_INVALID_FILE; }
#endif
#ifdef EREMOTEIO
else if (error == EREMOTEIO) { return FS_IO_ERROR; }
#endif
#ifdef EDQUOT
else if (error == EDQUOT) { return FS_NO_SPACE; }
#endif
#ifdef ENOMEDIUM
else if (error == ENOMEDIUM) { return FS_DOES_NOT_EXIST; }
#endif
#ifdef ECANCELED
else if (error == ECANCELED) { return FS_CANCELLED; }
#endif
return FS_ERROR;
}
#if defined(_WIN32)
#include <windows.h> /* For GetLastError, ERROR_* constants. */
FS_API fs_result fs_result_from_GetLastError(void)
{
switch (GetLastError())
{
case ERROR_SUCCESS: return FS_SUCCESS;
case ERROR_NOT_ENOUGH_MEMORY: return FS_OUT_OF_MEMORY;
case ERROR_OUTOFMEMORY: return FS_OUT_OF_MEMORY;
case ERROR_BUSY: return FS_BUSY;
case ERROR_SEM_TIMEOUT: return FS_TIMEOUT;
case ERROR_ALREADY_EXISTS: return FS_ALREADY_EXISTS;
case ERROR_FILE_EXISTS: return FS_ALREADY_EXISTS;
case ERROR_ACCESS_DENIED: return FS_ACCESS_DENIED;
case ERROR_WRITE_PROTECT: return FS_ACCESS_DENIED;
case ERROR_PRIVILEGE_NOT_HELD: return FS_ACCESS_DENIED;
case ERROR_SHARING_VIOLATION: return FS_ACCESS_DENIED;
case ERROR_LOCK_VIOLATION: return FS_ACCESS_DENIED;
case ERROR_FILE_NOT_FOUND: return FS_DOES_NOT_EXIST;
case ERROR_PATH_NOT_FOUND: return FS_DOES_NOT_EXIST;
case ERROR_INVALID_NAME: return FS_INVALID_ARGS;
case ERROR_BAD_PATHNAME: return FS_INVALID_ARGS;
case ERROR_INVALID_PARAMETER: return FS_INVALID_ARGS;
case ERROR_INVALID_HANDLE: return FS_INVALID_ARGS;
case ERROR_INVALID_FUNCTION: return FS_INVALID_OPERATION;
case ERROR_FILENAME_EXCED_RANGE: return FS_PATH_TOO_LONG;
case ERROR_DIRECTORY: return FS_NOT_DIRECTORY;
case ERROR_DIR_NOT_EMPTY: return FS_DIRECTORY_NOT_EMPTY;
case ERROR_FILE_TOO_LARGE: return FS_TOO_BIG;
case ERROR_DISK_FULL: return FS_OUT_OF_RANGE;
case ERROR_HANDLE_EOF: return FS_AT_END;
case ERROR_SEEK: return FS_BAD_SEEK;
case ERROR_OPERATION_ABORTED: return FS_CANCELLED;
case ERROR_CANCELLED: return FS_INTERRUPT;
case ERROR_TOO_MANY_OPEN_FILES: return FS_TOO_MANY_OPEN_FILES;
case ERROR_INVALID_DATA: return FS_INVALID_DATA;
case ERROR_NO_DATA: return FS_NO_DATA_AVAILABLE;
case ERROR_NOT_SAME_DEVICE: return FS_DIFFERENT_DEVICE;
default: return FS_ERROR; /* Generic error. */
}
}
#endif /* _WIN32 */
/* END fs_result_conversion.c */
/* BEG fs_allocation_callbacks.c */
static void* fs_malloc_default(size_t sz, void* pUserData)
{
FS_UNUSED(pUserData);
return FS_MALLOC(sz);
}
static void* fs_realloc_default(void* p, size_t sz, void* pUserData)
{
FS_UNUSED(pUserData);
return FS_REALLOC(p, sz);
}
static void fs_free_default(void* p, void* pUserData)
{
FS_UNUSED(pUserData);
FS_FREE(p);
}
static fs_allocation_callbacks fs_allocation_callbacks_init_default(void)
{
fs_allocation_callbacks allocationCallbacks;
allocationCallbacks.pUserData = NULL;
allocationCallbacks.>
allocationCallbacks.>
allocationCallbacks.>
return allocationCallbacks;
}
static fs_allocation_callbacks fs_allocation_callbacks_init_copy(const fs_allocation_callbacks* pAllocationCallbacks)
{
if (pAllocationCallbacks != NULL) {
return *pAllocationCallbacks;
} else {
return fs_allocation_callbacks_init_default();
}
}
FS_API void* fs_malloc(size_t sz, const fs_allocation_callbacks* pAllocationCallbacks)
{
if (pAllocationCallbacks != NULL) {
if (pAllocationCallbacks->onMalloc != NULL) {
return pAllocationCallbacks->onMalloc(sz, pAllocationCallbacks->pUserData);
} else {
return NULL; /* Do not fall back to the default implementation. */
}
} else {
return fs_malloc_default(sz, NULL);
}
}
FS_API void* fs_calloc(size_t sz, const fs_allocation_callbacks* pAllocationCallbacks)
{
void* p = fs_malloc(sz, pAllocationCallbacks);
if (p != NULL) {
FS_ZERO_MEMORY(p, sz);
}
return p;
}
FS_API void* fs_realloc(void* p, size_t sz, const fs_allocation_callbacks* pAllocationCallbacks)
{
if (pAllocationCallbacks != NULL) {
if (pAllocationCallbacks->onRealloc != NULL) {
return pAllocationCallbacks->onRealloc(p, sz, pAllocationCallbacks->pUserData);
} else {
return NULL; /* Do not fall back to the default implementation. */
}
} else {
return fs_realloc_default(p, sz, NULL);
}
}
FS_API void fs_free(void* p, const fs_allocation_callbacks* pAllocationCallbacks)
{
if (p == NULL) {
return;
}
if (pAllocationCallbacks != NULL) {
if (pAllocationCallbacks->onFree != NULL) {
pAllocationCallbacks->onFree(p, pAllocationCallbacks->pUserData);
} else {
return; /* Do no fall back to the default implementation. */
}
} else {
fs_free_default(p, NULL);
}
}
/* END fs_allocation_callbacks.c */
/* BEG fs_thread.c */
/*
This section has been designed to be mostly compatible with c89thread with only a few minor changes
if you wanted to amalgamate this into another project which uses c89thread and want to avoid duplicate
code. These are the differences:
* The c89 namespace is replaced with "fs_".
* There is no c89mtx_trylock() or c89mtx_timedlock() equivalent.
* c89thrd_success is FS_SUCCESS
* c89thrd_error is FS_ERROR
* c89thrd_busy is FS_BUSY
* c89thrd_pthread_* is fs_pthread_*
Parameter ordering is the same as c89thread to make amalgamation easier.
*/
/* BEG fs_thread_mtx.c */
#if defined(FS_WIN32) && !defined(FS_USE_PTHREAD)
FS_API fs_result fs_mtx_init(fs_mtx* mutex, int type)
{
HANDLE hMutex;
if (mutex == NULL) {
return FS_ERROR;
}
/* Initialize the object to zero for safety. */
mutex->handle = NULL;
mutex->type = 0;
/*
CreateMutex() will create a thread-aware mutex (allowing recursiveness), whereas an auto-reset
event (CreateEvent()) is not thread-aware and will deadlock (will not allow recursiveness). In
Win32 I'm making all mutex's timeable.
*/
if ((type & fs_mtx_recursive) != 0) {
hMutex = CreateMutexA(NULL, FALSE, NULL);
} else {
hMutex = CreateEventA(NULL, FALSE, TRUE, NULL);
}
if (hMutex == NULL) {
return fs_result_from_GetLastError();
}
mutex->handle = (void*)hMutex;
mutex->type = type;
return FS_SUCCESS;
}
FS_API void fs_mtx_destroy(fs_mtx* mutex)
{
if (mutex == NULL) {
return;
}
CloseHandle((HANDLE)mutex->handle);
}
FS_API fs_result fs_mtx_lock(fs_mtx* mutex)
{
DWORD result;
if (mutex == NULL) {
return FS_ERROR;
}
result = WaitForSingleObject((HANDLE)mutex->handle, INFINITE);
if (result == WAIT_ABANDONED) {
ReleaseMutex((HANDLE)mutex->handle);
return FS_ERROR;
}
if (result != WAIT_OBJECT_0) {
return FS_ERROR;
}
return FS_SUCCESS;
}
FS_API fs_result fs_mtx_unlock(fs_mtx* mutex)
{
BOOL result;
if (mutex == NULL) {
return FS_ERROR;
}
if ((mutex->type & fs_mtx_recursive) != 0) {
result = ReleaseMutex((HANDLE)mutex->handle);
} else {
result = SetEvent((HANDLE)mutex->handle);
}
if (!result) {
return FS_ERROR;
}
return FS_SUCCESS;
}
#else
static fs_result fs_result_from_pthread(int e)
{
if (e == 0) {
return FS_SUCCESS;
} else {
return fs_result_from_errno(e);
}
}
FS_API fs_result fs_mtx_init(fs_mtx* mutex, int type)
{
int result;
if (mutex == NULL) {
return FS_ERROR;
}
#ifdef FS_USE_MANUAL_RECURSIVE_MUTEX
{
/* Initialize the main mutex */
result = fs_result_from_pthread(pthread_mutex_init(&mutex->mutex, NULL));
if (result != FS_SUCCESS) {
return FS_ERROR;
}
/* For recursive mutexes, we need the guard mutex and metadata */
if ((type & fs_mtx_recursive) != 0) {
if (fs_result_from_pthread(pthread_mutex_init(&mutex->guard, NULL)) != FS_SUCCESS) {
pthread_mutex_destroy(&mutex->mutex);
return FS_ERROR;
}
mutex->recursionCount = 0;
}
mutex->type = type;
return FS_SUCCESS;
}
#else
{
if ((type & fs_mtx_recursive) != 0) {
pthread_mutexattr_t attr;
result = fs_result_from_pthread(pthread_mutexattr_init(&attr));
if (result != FS_SUCCESS) {
return FS_ERROR;
}
result = fs_result_from_pthread(pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE));
if (result == FS_SUCCESS) {
result = fs_result_from_pthread(pthread_mutex_init((pthread_mutex_t*)mutex, &attr));
}
pthread_mutexattr_destroy(&attr);
} else {
result = fs_result_from_pthread(pthread_mutex_init((pthread_mutex_t*)mutex, NULL));
}
if (result != FS_SUCCESS) {
return FS_ERROR;
}
return FS_SUCCESS;
}
#endif
}
FS_API void fs_mtx_destroy(fs_mtx* mutex)
{
if (mutex == NULL) {
return;
}
#ifdef FS_USE_MANUAL_RECURSIVE_MUTEX
{
/* Only destroy the guard mutex if it was initialized (for recursive mutexes) */
if ((mutex->type & fs_mtx_recursive) != 0) {
pthread_mutex_destroy(&mutex->guard);
You can’t perform that action at this time.