-
Notifications
You must be signed in to change notification settings - Fork 58
/
tinyobj_loader_c.h
1736 lines (1463 loc) · 49.4 KB
/
tinyobj_loader_c.h
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
/*
The MIT License (MIT)
Copyright (c) 2016 - 2019 Syoyo Fujita and many contributors.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef TINOBJ_LOADER_C_H_
#define TINOBJ_LOADER_C_H_
/* @todo { Remove stddef dependency. size_t? } */
#include <stddef.h>
#ifdef __cplusplus
extern "C" {
#endif
typedef struct {
char *name;
float ambient[3];
float diffuse[3];
float specular[3];
float transmittance[3];
float emission[3];
float shininess;
float ior; /* index of refraction */
float dissolve; /* 1 == opaque; 0 == fully transparent */
/* illumination model (see http://www.fileformat.info/format/material/) */
int illum;
int pad0;
char *ambient_texname; /* map_Ka */
char *diffuse_texname; /* map_Kd */
char *specular_texname; /* map_Ks */
char *specular_highlight_texname; /* map_Ns */
char *bump_texname; /* map_bump, bump */
char *displacement_texname; /* disp */
char *alpha_texname; /* map_d */
} tinyobj_material_t;
typedef struct {
char *name; /* group name or object name. */
unsigned int face_offset;
unsigned int length;
} tinyobj_shape_t;
typedef struct { int v_idx, vt_idx, vn_idx; } tinyobj_vertex_index_t;
typedef struct {
unsigned int num_vertices;
unsigned int num_normals;
unsigned int num_texcoords;
unsigned int num_faces;
unsigned int num_face_num_verts;
int pad0;
float *vertices;
float *normals;
float *texcoords;
tinyobj_vertex_index_t *faces;
int *face_num_verts;
int *material_ids;
} tinyobj_attrib_t;
#define TINYOBJ_FLAG_TRIANGULATE (1 << 0)
#define TINYOBJ_INVALID_INDEX (0x80000000)
#define TINYOBJ_SUCCESS (0)
#define TINYOBJ_ERROR_EMPTY (-1)
#define TINYOBJ_ERROR_INVALID_PARAMETER (-2)
#define TINYOBJ_ERROR_FILE_OPERATION (-3)
/* Provide a callback that can read text file without any parsing or modification.
* The obj and mtl parser is going to read all the necessary data:
* tinyobj_parse_obj
* tinyobj_parse_mtl_file
*
* @param[in] ctx User provided context.
* @param[in] filename Filename to be loaded.
* @param[in] is_mtl 1 when the callback is invoked for loading .mtl. 0 for .obj
* @param[in] obj_filename .obj filename. Useful when you load .mtl from same location of .obj. When the callback is called to load .obj, `filename` and `obj_filename` are same.
* @param[out] buf Content of loaded file
* @param[out] len Size of content(file)
*/
typedef void (*file_reader_callback)(void *ctx, const char *filename, int is_mtl, const char *obj_filename, char **buf, size_t *len);
/* Parse wavefront .obj
* @param[out] attrib Attibutes
* @param[out] shapes Array of parsed shapes
* @param[out] num_shapes Array length of `shapes`
* @param[out] materials Array of parsed materials
* @param[out] num_materials Array length of `materials`
* @param[in] file_name File name of .obj
* @param[in] file_reader File reader callback function(to read .obj and .mtl).
* @param[in] ctx Context pointer passed to the file_reader_callback.
* @param[in] flags combination of TINYOBJ_FLAG_***
*
* Returns TINYOBJ_SUCCESS if things goes well.
* Returns TINYOBJ_ERROR_*** when there is an error.
*/
extern int tinyobj_parse_obj(tinyobj_attrib_t *attrib, tinyobj_shape_t **shapes,
size_t *num_shapes, tinyobj_material_t **materials,
size_t *num_materials, const char *file_name, file_reader_callback file_reader,
void *ctx, unsigned int flags);
/* Parse wavefront .mtl
*
* @param[out] materials_out
* @param[out] num_materials_out
* @param[in] filename .mtl filename
* @param[in] filename of .obj filename. could be NULL if you just want to parse .mtl file.
* @param[in] file_reader File reader callback
* @param[in[ ctx Context pointer passed to the file_reader callack.
* Returns TINYOBJ_SUCCESS if things goes well.
* Returns TINYOBJ_ERROR_*** when there is an error.
*/
extern int tinyobj_parse_mtl_file(tinyobj_material_t **materials_out,
size_t *num_materials_out,
const char *filename, const char *obj_filename, file_reader_callback file_reader,
void *ctx);
extern void tinyobj_attrib_init(tinyobj_attrib_t *attrib);
extern void tinyobj_attrib_free(tinyobj_attrib_t *attrib);
extern void tinyobj_shapes_free(tinyobj_shape_t *shapes, size_t num_shapes);
extern void tinyobj_materials_free(tinyobj_material_t *materials,
size_t num_materials);
#ifdef __cplusplus
}
#endif
#ifdef TINYOBJ_LOADER_C_IMPLEMENTATION
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <errno.h>
#if defined(TINYOBJ_MALLOC) && defined(TINYOBJ_CALLOC) && defined(TINYOBJ_FREE) && (defined(TINYOBJ_REALLOC) || defined(TINYOBJ_REALLOC_SIZED))
/* ok */
#elif !defined(TINYOBJ_MALLOC) && !defined(TINYOBJ_CALLOC) && !defined(TINYOBJ_FREE) && !defined(TINYOBJ_REALLOC) && !defined(TINYOBJ_REALLOC_SIZED)
/* ok */
#else
#error "Must define all or none of TINYOBJ_MALLOC, TINYOBJ_CALLOC, TINYOBJ_FREE, and TINYOBJ_REALLOC (or TINYOBJ_REALLOC_SIZED)."
#endif
#ifndef TINYOBJ_MALLOC
#include <stdlib.h>
#define TINYOBJ_MALLOC malloc
#define TINYOBJ_REALLOC realloc
#define TINYOBJ_CALLOC calloc
#define TINYOBJ_FREE free
#endif
#ifndef TINYOBJ_REALLOC_SIZED
#define TINYOBJ_REALLOC_SIZED(p,oldsz,newsz) TINYOBJ_REALLOC(p,newsz)
#endif
#define TINYOBJ_MAX_FACES_PER_F_LINE (16)
#define TINYOBJ_MAX_FILEPATH (8192)
#define IS_SPACE(x) (((x) == ' ') || ((x) == '\t'))
#define IS_DIGIT(x) ((unsigned int)((x) - '0') < (unsigned int)(10))
#define IS_NEW_LINE(x) (((x) == '\r') || ((x) == '\n') || ((x) == '\0'))
static void skip_space(const char **token) {
while ((*token)[0] == ' ' || (*token)[0] == '\t') {
(*token)++;
}
}
static void skip_space_and_cr(const char **token) {
while ((*token)[0] == ' ' || (*token)[0] == '\t' || (*token)[0] == '\r') {
(*token)++;
}
}
static int until_space(const char *token) {
const char *p = token;
while (p[0] != '\0' && p[0] != ' ' && p[0] != '\t' && p[0] != '\r') {
p++;
}
return (int)(p - token);
}
static size_t length_until_newline(const char *token, size_t n) {
size_t len = 0;
/* Assume token[n-1] = '\0' */
for (len = 0; len < n - 1; len++) {
if (token[len] == '\n') {
break;
}
if ((token[len] == '\r') && ((len < (n - 2)) && (token[len + 1] != '\n'))) {
break;
}
}
return len;
}
static size_t length_until_line_feed(const char *token, size_t n) {
size_t len = 0;
/* Assume token[n-1] = '\0' */
for (len = 0; len < n; len++) {
if ((token[len] == '\n') || (token[len] == '\r')) {
break;
}
}
return len;
}
/* http://stackoverflow.com/questions/5710091/how-does-atoi-function-in-c-work
*/
static int my_atoi(const char *c) {
int value = 0;
int sign = 1;
if (*c == '+' || *c == '-') {
if (*c == '-') sign = -1;
c++;
}
while (((*c) >= '0') && ((*c) <= '9')) { /* isdigit(*c) */
value *= 10;
value += (int)(*c - '0');
c++;
}
return value * sign;
}
/* Make index zero-base, and also support relative index. */
static int fixIndex(int idx, size_t n) {
if (idx > 0) return idx - 1;
if (idx == 0) return 0;
return (int)n + idx; /* negative value = relative */
}
/* Parse raw triples: i, i/j/k, i//k, i/j */
static tinyobj_vertex_index_t parseRawTriple(const char **token) {
tinyobj_vertex_index_t vi;
/* 0x80000000 = -2147483648 = invalid */
vi.v_idx = (int)(0x80000000);
vi.vn_idx = (int)(0x80000000);
vi.vt_idx = (int)(0x80000000);
vi.v_idx = my_atoi((*token));
while ((*token)[0] != '\0' && (*token)[0] != '/' && (*token)[0] != ' ' &&
(*token)[0] != '\t' && (*token)[0] != '\r') {
(*token)++;
}
if ((*token)[0] != '/') {
return vi;
}
(*token)++;
/* i//k */
if ((*token)[0] == '/') {
(*token)++;
vi.vn_idx = my_atoi((*token));
while ((*token)[0] != '\0' && (*token)[0] != '/' && (*token)[0] != ' ' &&
(*token)[0] != '\t' && (*token)[0] != '\r') {
(*token)++;
}
return vi;
}
/* i/j/k or i/j */
vi.vt_idx = my_atoi((*token));
while ((*token)[0] != '\0' && (*token)[0] != '/' && (*token)[0] != ' ' &&
(*token)[0] != '\t' && (*token)[0] != '\r') {
(*token)++;
}
if ((*token)[0] != '/') {
return vi;
}
/* i/j/k */
(*token)++; /* skip '/' */
vi.vn_idx = my_atoi((*token));
while ((*token)[0] != '\0' && (*token)[0] != '/' && (*token)[0] != ' ' &&
(*token)[0] != '\t' && (*token)[0] != '\r') {
(*token)++;
}
return vi;
}
static int parseInt(const char **token) {
int i = 0;
skip_space(token);
i = my_atoi((*token));
(*token) += until_space((*token));
return i;
}
/*
* Tries to parse a floating point number located at s.
*
* s_end should be a location in the string where reading should absolutely
* stop. For example at the end of the string, to prevent buffer overflows.
*
* Parses the following EBNF grammar:
* sign = "+" | "-" ;
* END = ? anything not in digit ?
* digit = "0" | "1" | "2" | "3" | "4" | "5" | "6" | "7" | "8" | "9" ;
* integer = [sign] , digit , {digit} ;
* decimal = integer , ["." , integer] ;
* float = ( decimal , END ) | ( decimal , ("E" | "e") , integer , END ) ;
*
* Valid strings are for example:
* -0 +3.1417e+2 -0.0E-3 1.0324 -1.41 11e2
*
* If the parsing is a success, result is set to the parsed value and true
* is returned.
*
* The function is greedy and will parse until any of the following happens:
* - a non-conforming character is encountered.
* - s_end is reached.
*
* The following situations triggers a failure:
* - s >= s_end.
* - parse failure.
*/
static int tryParseDouble(const char *s, const char *s_end, double *result) {
double mantissa = 0.0;
/* This exponent is base 2 rather than 10.
* However the exponent we parse is supposed to be one of ten,
* thus we must take care to convert the exponent/and or the
* mantissa to a * 2^E, where a is the mantissa and E is the
* exponent.
* To get the final double we will use ldexp, it requires the
* exponent to be in base 2.
*/
int exponent = 0;
/* NOTE: THESE MUST BE DECLARED HERE SINCE WE ARE NOT ALLOWED
* TO JUMP OVER DEFINITIONS.
*/
char sign = '+';
char exp_sign = '+';
char const *curr = s;
/* How many characters were read in a loop. */
int read = 0;
/* Tells whether a loop terminated due to reaching s_end. */
int end_not_reached = 0;
/*
BEGIN PARSING.
*/
if (s >= s_end) {
return 0; /* fail */
}
/* Find out what sign we've got. */
if (*curr == '+' || *curr == '-') {
sign = *curr;
curr++;
} else if (IS_DIGIT(*curr)) { /* Pass through. */
} else {
goto fail;
}
/* Read the integer part. */
end_not_reached = (curr != s_end);
while (end_not_reached && IS_DIGIT(*curr)) {
mantissa *= 10;
mantissa += (int)(*curr - 0x30);
curr++;
read++;
end_not_reached = (curr != s_end);
}
/* We must make sure we actually got something. */
if (read == 0) goto fail;
/* We allow numbers of form "#", "###" etc. */
if (!end_not_reached) goto assemble;
/* Read the decimal part. */
if (*curr == '.') {
curr++;
read = 1;
end_not_reached = (curr != s_end);
while (end_not_reached && IS_DIGIT(*curr)) {
/* pow(10.0, -read) */
double frac_value = 1.0;
int f;
for (f = 0; f < read; f++) {
frac_value *= 0.1;
}
mantissa += (int)(*curr - 0x30) * frac_value;
read++;
curr++;
end_not_reached = (curr != s_end);
}
} else if (*curr == 'e' || *curr == 'E') {
} else {
goto assemble;
}
if (!end_not_reached) goto assemble;
/* Read the exponent part. */
if (*curr == 'e' || *curr == 'E') {
curr++;
/* Figure out if a sign is present and if it is. */
end_not_reached = (curr != s_end);
if (end_not_reached && (*curr == '+' || *curr == '-')) {
exp_sign = *curr;
curr++;
} else if (IS_DIGIT(*curr)) { /* Pass through. */
} else {
/* Empty E is not allowed. */
goto fail;
}
read = 0;
end_not_reached = (curr != s_end);
while (end_not_reached && IS_DIGIT(*curr)) {
exponent *= 10;
exponent += (int)(*curr - 0x30);
curr++;
read++;
end_not_reached = (curr != s_end);
}
if (read == 0) goto fail;
}
assemble :
{
double a = 1.0; /* = pow(5.0, exponent); */
double b = 1.0; /* = 2.0^exponent */
int i;
for (i = 0; i < exponent; i++) {
a = a * 5.0;
}
for (i = 0; i < exponent; i++) {
b = b * 2.0;
}
if (exp_sign == '-') {
a = 1.0 / a;
b = 1.0 / b;
}
*result =
/* (sign == '+' ? 1 : -1) * ldexp(mantissa * pow(5.0, exponent),
exponent); */
(sign == '+' ? 1 : -1) * (mantissa * a * b);
}
return 1;
fail:
return 0;
}
static float parseFloat(const char **token) {
const char *end;
double val = 0.0;
float f = 0.0f;
skip_space(token);
end = (*token) + until_space((*token));
val = 0.0;
tryParseDouble((*token), end, &val);
f = (float)(val);
(*token) = end;
return f;
}
static void parseFloat2(float *x, float *y, const char **token) {
(*x) = parseFloat(token);
(*y) = parseFloat(token);
}
static void parseFloat3(float *x, float *y, float *z, const char **token) {
(*x) = parseFloat(token);
(*y) = parseFloat(token);
(*z) = parseFloat(token);
}
static size_t my_strnlen(const char *s, size_t n) {
const char *p = (char *)memchr(s, 0, n);
return p ? (size_t)(p - s) : n;
}
static char *my_strdup(const char *s, size_t max_length) {
char *d;
size_t len;
if (s == NULL) return NULL;
/* Do not consider CRLF line ending(#19) */
len = length_until_line_feed(s, max_length);
/* len = strlen(s); */
/* trim line ending and append '\0' */
d = (char *)TINYOBJ_MALLOC(len + 1); /* + '\0' */
memcpy(d, s, (size_t)(len));
d[len] = '\0';
return d;
}
static char *my_strndup(const char *s, size_t len) {
char *d;
size_t slen;
if (s == NULL) return NULL;
if (len == 0) return NULL;
slen = my_strnlen(s, len);
d = (char *)TINYOBJ_MALLOC(slen + 1); /* + '\0' */
if (!d) {
return NULL;
}
memcpy(d, s, slen);
d[slen] = '\0';
return d;
}
char *dynamic_fgets(char **buf, size_t *size, FILE *file) {
char *offset;
char *ret;
size_t old_size;
if (!(ret = fgets(*buf, (int)*size, file))) {
return ret;
}
if (NULL != strchr(*buf, '\n')) {
return ret;
}
do {
old_size = *size;
*size *= 2;
*buf = (char*)TINYOBJ_REALLOC_SIZED(*buf, old_size, *size);
offset = &((*buf)[old_size - 1]);
ret = fgets(offset, (int)(old_size + 1), file);
} while(ret && (NULL == strchr(*buf, '\n')));
return ret;
}
static void initMaterial(tinyobj_material_t *material) {
int i;
material->name = NULL;
material->ambient_texname = NULL;
material->diffuse_texname = NULL;
material->specular_texname = NULL;
material->specular_highlight_texname = NULL;
material->bump_texname = NULL;
material->displacement_texname = NULL;
material->alpha_texname = NULL;
for (i = 0; i < 3; i++) {
material->ambient[i] = 0.f;
material->diffuse[i] = 0.f;
material->specular[i] = 0.f;
material->transmittance[i] = 0.f;
material->emission[i] = 0.f;
}
material->illum = 0;
material->dissolve = 1.f;
material->shininess = 1.f;
material->ior = 1.f;
}
/* Implementation of string to int hashtable */
#define HASH_TABLE_ERROR 1
#define HASH_TABLE_SUCCESS 0
#define HASH_TABLE_DEFAULT_SIZE 10
typedef struct hash_table_entry_t
{
unsigned long hash;
int filled;
int pad0;
long value;
struct hash_table_entry_t* next;
} hash_table_entry_t;
typedef struct
{
unsigned long* hashes;
hash_table_entry_t* entries;
size_t capacity;
size_t n;
} hash_table_t;
static unsigned long hash_djb2(const unsigned char* str)
{
unsigned long hash = 5381;
int c;
while ((c = *str++)) {
hash = ((hash << 5) + hash) + (unsigned long)(c);
}
return hash;
}
static void create_hash_table(size_t start_capacity, hash_table_t* hash_table)
{
if (start_capacity < 1)
start_capacity = HASH_TABLE_DEFAULT_SIZE;
hash_table->hashes = (unsigned long*) TINYOBJ_MALLOC(start_capacity * sizeof(unsigned long));
hash_table->entries = (hash_table_entry_t*) TINYOBJ_CALLOC(start_capacity, sizeof(hash_table_entry_t));
hash_table->capacity = start_capacity;
hash_table->n = 0;
}
static void destroy_hash_table(hash_table_t* hash_table)
{
TINYOBJ_FREE(hash_table->entries);
TINYOBJ_FREE(hash_table->hashes);
}
/* Insert with quadratic probing */
static int hash_table_insert_value(unsigned long hash, long value, hash_table_t* hash_table)
{
/* Insert value */
size_t start_index = hash % hash_table->capacity;
size_t index = start_index;
hash_table_entry_t* start_entry = hash_table->entries + start_index;
size_t i;
hash_table_entry_t* entry;
for (i = 1; hash_table->entries[index].filled; i++)
{
if (i >= hash_table->capacity)
return HASH_TABLE_ERROR;
index = (start_index + (i * i)) % hash_table->capacity;
}
entry = hash_table->entries + index;
entry->hash = hash;
entry->filled = 1;
entry->value = value;
if (index != start_index) {
/* This is a new entry, but not the start entry, hence we need to add a next pointer to our entry */
entry->next = start_entry->next;
start_entry->next = entry;
}
return HASH_TABLE_SUCCESS;
}
static int hash_table_insert(unsigned long hash, long value, hash_table_t* hash_table)
{
int ret = hash_table_insert_value(hash, value, hash_table);
if (ret == HASH_TABLE_SUCCESS)
{
hash_table->hashes[hash_table->n] = hash;
hash_table->n++;
}
return ret;
}
static hash_table_entry_t* hash_table_find(unsigned long hash, hash_table_t* hash_table)
{
hash_table_entry_t* entry = hash_table->entries + (hash % hash_table->capacity);
while (entry)
{
if (entry->hash == hash && entry->filled)
{
return entry;
}
entry = entry->next;
}
return NULL;
}
static void hash_table_grow(hash_table_t* hash_table)
{
size_t new_capacity;
hash_table_t new_hash_table;
size_t i;
new_capacity = 2 * hash_table->capacity;
/* Create a new hash table. We're not calling create_hash_table because we want to realloc the hash array */
new_hash_table.hashes = hash_table->hashes = (unsigned long*) TINYOBJ_REALLOC_SIZED(
(void*) hash_table->hashes, sizeof(unsigned long) * hash_table->capacity, sizeof(unsigned long) * new_capacity);
new_hash_table.entries = (hash_table_entry_t*) TINYOBJ_CALLOC(new_capacity, sizeof(hash_table_entry_t));
new_hash_table.capacity = new_capacity;
new_hash_table.n = hash_table->n;
/* Rehash */
for (i = 0; i < hash_table->capacity; i++)
{
hash_table_entry_t* entry = &hash_table->entries[i];
if (entry->filled) {
hash_table_insert_value(entry->hash, entry->value, &new_hash_table);
}
}
TINYOBJ_FREE(hash_table->entries);
(*hash_table) = new_hash_table;
}
static int hash_table_exists(const char* name, hash_table_t* hash_table)
{
return hash_table_find(hash_djb2((const unsigned char*)name), hash_table) != NULL;
}
static void hash_table_set(const char* name, size_t val, hash_table_t* hash_table)
{
/* Hash name */
unsigned long hash = hash_djb2((const unsigned char *)name);
hash_table_entry_t* entry = hash_table_find(hash, hash_table);
if (entry)
{
entry->value = (long)val;
return;
}
/* Expand if necessary
* Grow until the element has been added
*/
while (hash_table_insert(hash, (long)val, hash_table) != HASH_TABLE_SUCCESS) {
hash_table_grow(hash_table);
}
}
static long hash_table_get(const char* name, hash_table_t* hash_table)
{
hash_table_entry_t* ret = hash_table_find(hash_djb2((const unsigned char*)(name)), hash_table);
return ret->value;
}
static tinyobj_material_t *tinyobj_material_add(tinyobj_material_t *prev,
size_t num_materials,
tinyobj_material_t *new_mat) {
tinyobj_material_t *dst;
size_t num_bytes = sizeof(tinyobj_material_t) * num_materials;
dst = (tinyobj_material_t *)TINYOBJ_REALLOC_SIZED(
prev, num_bytes, num_bytes + sizeof(tinyobj_material_t));
dst[num_materials] = (*new_mat); /* Just copy pointer for char* members */
return dst;
}
static int is_line_ending(const char *p, size_t i, size_t end_i) {
if (p[i] == '\0') return 1;
if (p[i] == '\n') return 1; /* this includes \r\n */
if (p[i] == '\r') {
if (((i + 1) < end_i) && (p[i + 1] != '\n')) { /* detect only \r case */
return 1;
}
}
return 0;
}
typedef struct {
size_t pos;
size_t len;
} LineInfo;
/* Find '\n' and create line data. */
static int get_line_infos(const char *buf, size_t buf_len, LineInfo **line_infos, size_t *num_lines)
{
size_t i = 0;
size_t end_idx = buf_len;
size_t prev_pos = 0;
size_t line_no = 0;
size_t last_line_ending = 0;
/* Count # of lines. */
for (i = 0; i < end_idx; i++) {
if (is_line_ending(buf, i, end_idx)) {
(*num_lines)++;
last_line_ending = i;
}
}
/* The last char from the input may not be a line
* ending character so add an extra line if there
* are more characters after the last line ending
* that was found. */
if (end_idx - last_line_ending > 1) {
(*num_lines)++;
}
if (*num_lines == 0) return TINYOBJ_ERROR_EMPTY;
*line_infos = (LineInfo *)TINYOBJ_MALLOC(sizeof(LineInfo) * (*num_lines));
/* Fill line infos. */
for (i = 0; i < end_idx; i++) {
if (is_line_ending(buf, i, end_idx)) {
(*line_infos)[line_no].pos = prev_pos;
(*line_infos)[line_no].len = i - prev_pos;
prev_pos = i + 1;
line_no++;
}
}
if (end_idx - last_line_ending > 1) {
(*line_infos)[line_no].pos = prev_pos;
(*line_infos)[line_no].len = end_idx - 1 - last_line_ending;
}
return 0;
}
static int tinyobj_parse_and_index_mtl_file(tinyobj_material_t **materials_out,
size_t *num_materials_out,
const char *mtl_filename, const char *obj_filename, file_reader_callback file_reader, void *ctx,
hash_table_t* material_table) {
tinyobj_material_t material;
size_t num_materials = 0;
tinyobj_material_t *materials = NULL;
int has_previous_material = 0;
const char *line_end = NULL;
size_t num_lines = 0;
LineInfo *line_infos = NULL;
size_t i = 0;
char *buf = NULL;
size_t len = 0;
if (materials_out == NULL) {
return TINYOBJ_ERROR_INVALID_PARAMETER;
}
if (num_materials_out == NULL) {
return TINYOBJ_ERROR_INVALID_PARAMETER;
}
(*materials_out) = NULL;
(*num_materials_out) = 0;
file_reader(ctx, mtl_filename, 1, obj_filename, &buf, &len);
if (len < 1) return TINYOBJ_ERROR_INVALID_PARAMETER;
if (buf == NULL) return TINYOBJ_ERROR_INVALID_PARAMETER;
if (get_line_infos(buf, len, &line_infos, &num_lines) != 0) {
TINYOBJ_FREE(line_infos);
return TINYOBJ_ERROR_EMPTY;
}
/* Create a default material */
initMaterial(&material);
for (i = 0; i < num_lines; i++) {
const char *p = &buf[line_infos[i].pos];
size_t p_len = line_infos[i].len;
char linebuf[4096];
const char *token;
assert(p_len < 4095);
memcpy(linebuf, p, p_len);
linebuf[p_len] = '\0';
token = linebuf;
line_end = token + p_len;
/* Skip leading space. */
token += strspn(token, " \t");
assert(token);
if (token[0] == '\0') continue; /* empty line */
if (token[0] == '#') continue; /* comment line */
/* new mtl */
if ((0 == strncmp(token, "newmtl", 6)) && IS_SPACE((token[6]))) {
char namebuf[4096];
/* flush previous material. */
if (has_previous_material) {
materials = tinyobj_material_add(materials, num_materials, &material);
num_materials++;
} else {
has_previous_material = 1;
}
/* initial temporary material */
initMaterial(&material);
/* set new mtl name */
token += 7;
#ifdef _MSC_VER
sscanf_s(token, "%s", namebuf, (unsigned)_countof(namebuf));
#else
sscanf(token, "%s", namebuf);
#endif
material.name = my_strdup(namebuf, (size_t) (line_end - token));
/* Add material to material table */
if (material_table)
hash_table_set(material.name, num_materials, material_table);
continue;
}
/* ambient */
if (token[0] == 'K' && token[1] == 'a' && IS_SPACE((token[2]))) {
float r, g, b;
token += 2;
parseFloat3(&r, &g, &b, &token);
material.ambient[0] = r;
material.ambient[1] = g;
material.ambient[2] = b;
continue;
}
/* diffuse */
if (token[0] == 'K' && token[1] == 'd' && IS_SPACE((token[2]))) {
float r, g, b;
token += 2;
parseFloat3(&r, &g, &b, &token);
material.diffuse[0] = r;
material.diffuse[1] = g;
material.diffuse[2] = b;
continue;
}
/* specular */
if (token[0] == 'K' && token[1] == 's' && IS_SPACE((token[2]))) {
float r, g, b;
token += 2;
parseFloat3(&r, &g, &b, &token);
material.specular[0] = r;
material.specular[1] = g;
material.specular[2] = b;
continue;
}
/* transmittance */
if (token[0] == 'K' && token[1] == 't' && IS_SPACE((token[2]))) {
float r, g, b;
token += 2;
parseFloat3(&r, &g, &b, &token);
material.transmittance[0] = r;
material.transmittance[1] = g;
material.transmittance[2] = b;
continue;
}
/* ior(index of refraction) */
if (token[0] == 'N' && token[1] == 'i' && IS_SPACE((token[2]))) {
token += 2;
material.ior = parseFloat(&token);
continue;
}
/* emission */
if (token[0] == 'K' && token[1] == 'e' && IS_SPACE(token[2])) {
float r, g, b;
token += 2;
parseFloat3(&r, &g, &b, &token);
material.emission[0] = r;
material.emission[1] = g;
material.emission[2] = b;
continue;
}
/* shininess */
if (token[0] == 'N' && token[1] == 's' && IS_SPACE(token[2])) {
token += 2;
material.shininess = parseFloat(&token);
continue;
}
/* illum model */
if (0 == strncmp(token, "illum", 5) && IS_SPACE(token[5])) {
token += 6;
material.illum = parseInt(&token);
continue;
}