-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathcommon.cpp
1439 lines (1196 loc) · 33.4 KB
/
common.cpp
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
/*
+----------------------------------------------------------------------+
| Copyright (c) The PHP Group |
+----------------------------------------------------------------------+
| This source file is subject to version 3.01 of the PHP license, |
| that is bundled with this package in the file LICENSE, and is |
| available through the world-wide-web at the following url: |
| https://www.php.net/license/3_01.txt |
| If you did not receive a copy of the PHP license and are unable to |
| obtain it through the world-wide-web, please send a note to |
| license@php.net so we can mail you a copy immediately. |
+----------------------------------------------------------------------+
| Author: Lochemem Bruno Michael |
+----------------------------------------------------------------------+
*/
#include "php_trie_ext.h"
#include "trie.h"
using namespace trie;
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifdef HAVE_SPL
#include "ext/spl/spl_exceptions.h"
#endif
/* For compatibility with older PHP versions */
#ifndef ZEND_PARSE_PARAMETERS_NONE
#define ZEND_PARSE_PARAMETERS_NONE() \
ZEND_PARSE_PARAMETERS_START(0, 0) \
ZEND_PARSE_PARAMETERS_END()
#endif
zend_object_handlers phptrie_object_handlers;
zend_object_handlers phphattrie_object_handlers;
/* phptrie object instantiation */
zend_class_entry *phptrie_ce;
zend_class_entry *phphattrie_ce; // HAT Trie class
zend_class_entry *phptrie_exception_ce;
/* phptrie object struct */
typedef struct _phptrie_object
{
Trie *trie;
zend_object std;
} phptrie_object;
/* phphattrie object */
typedef struct _phphattrie_object
{
HatTrie *hat;
size_t burstThreshold;
float loadFactor;
bool shrink;
zend_object std;
} phphattrie_object;
#define TRIEOBJ_INIT(type, object) \
return (type##_object *)((char *)(object)-XtOffsetOf(type##_object, std));
static inline phptrie_object *phptrie_obj_from_obj(zend_object *obj)
{
TRIEOBJ_INIT(phptrie, obj);
}
static inline phphattrie_object *phphattrie_obj_from_obj(zend_object *obj)
{
TRIEOBJ_INIT(phphattrie, obj);
}
#define Z_TRIEOBJ_P(zv) phptrie_obj_from_obj(Z_OBJ_P((zv)))
#define Z_HATOBJ_P(zv) phphattrie_obj_from_obj(Z_OBJ_P((zv)))
// macro to throw TrieException
#define TRIE_THROW(msg) \
zend_throw_exception(phptrie_exception_ce, msg, 0); \
RETURN_NULL();
// macro to create a Trie object
#define TRIE_OBJECT_CREATE(type, entry) \
type##_object *intern = (type##_object *)ecalloc(1, sizeof(type##_object) + zend_object_properties_size(entry)); \
zend_object_std_init(&intern->std, entry); \
object_properties_init(&intern->std, entry); \
intern->std.handlers = &type##_object_handlers; \
return &intern->std;
// macro to destroy a Trie object
#define TRIE_OBJECT_DESTROY(type, object) \
type##_object *obj; \
obj = (type##_object *)((char *)object - XtOffsetOf(type##_object, std)); \
zend_objects_destroy_object(object);
// macro to free a Trie object
#define TRIE_OBJECT_FREE(name, type, object) \
type##_object *obj; \
obj = (type##_object *)((char *)object - XtOffsetOf(type##_object, std)); \
delete obj->name; \
zend_object_std_dtor(object);
#if ZEND_MODULE_API_NO < ZEND_API_PHP80
// macro to compute the element count
#define TRIE_OBJECT_COUNT(name, type, zv, count) \
type##_object *trie = type##_obj_from_obj(Z_OBJ_P(zv)); \
*count = trie->name->size(); \
return SUCCESS;
#endif
/**
* @brief creates new phptrie object
*
* @param ce
* @return zend_object*
*/
zend_object *phptrie_object_new(zend_class_entry *ce)
{
TRIE_OBJECT_CREATE(phptrie, ce);
}
/**
* @brief creates new phphattrie object
*
* @param ce
* @return zend_object*
*/
zend_object *phphattrie_object_new(zend_class_entry *ce)
{
TRIE_OBJECT_CREATE(phphattrie, ce);
}
/**
* @brief creates new Trie object from corresponding C++ object
*
* @param trie
* @return zend_object*
*/
zend_object *phptrie_object_new_ex(Trie *trie)
{
phptrie_object *obj = (phptrie_object *)ecalloc(1,
sizeof(phptrie_object) + zend_object_properties_size(phptrie_ce));
zend_object_std_init(&obj->std, phptrie_ce);
obj->std.handlers = &phptrie_object_handlers;
obj->trie = trie;
return &obj->std;
}
/**
* @brief creates new PHP HatTrie object from corresponding C++ object
*
* @param trie
* @param lftr
* @param shr
* @return zend_object*
*/
zend_object *phphattrie_object_new_ex(HatTrie *trie,
size_t threshold = DEFAULT_BURST_THRESHOLD,
float lftr = DEFAULT_LOAD_FACTOR,
bool shr = false)
{
phphattrie_object *obj = (phphattrie_object *)ecalloc(1,
sizeof(phphattrie_object) + zend_object_properties_size(phphattrie_ce));
zend_object_std_init(&obj->std, phphattrie_ce);
obj->std.handlers = &phphattrie_object_handlers;
obj->hat = trie;
obj->loadFactor = lftr;
obj->shrink = shr;
obj->burstThreshold = threshold;
return &obj->std;
}
/**
* @brief destroys phptrie object
*
* @param object
*/
static void phptrie_object_destroy(zend_object *object)
{
TRIE_OBJECT_DESTROY(phptrie, object);
}
/**
* @brief destroys phphattrie object
*
* @param object
*/
static void phphattrie_object_destroy(zend_object *object)
{
TRIE_OBJECT_DESTROY(phphattrie, object);
}
/**
* @brief releases the memory allocated to phptrie object
*
* @param object
*/
static void phptrie_object_free(zend_object *object)
{
TRIE_OBJECT_FREE(trie, phptrie, object);
}
/**
* @brief releases the memory allocated to phphattrie object
*
* @param object
*/
static void phphattrie_object_free(zend_object *object)
{
TRIE_OBJECT_FREE(hat, phphattrie, object);
}
#if ZEND_MODULE_API_NO < ZEND_API_PHP80
/**
* @brief allows for HatTrie object to implement Countable::count
*
* @param obj
* @param count
* @return int
*/
static int phphattrie_count_elements(zval *obj, zend_long *count)
{
TRIE_OBJECT_COUNT(hat, phphattrie, obj, count);
}
/**
* @brief allows for Trie object to implement Countable::count
*
* @param obj
* @param count
* @return int
*/
static int phptrie_count_elements(zval *obj, zend_long *count)
{
TRIE_OBJECT_COUNT(trie, phptrie, obj, count);
}
#endif
/**
* @brief fcall cache release function for compatibility with newer and older versions of PHP
*
* @param fncache
*/
static void fcall_cache_release(zend_fcall_info_cache fncache)
{
#if ZEND_MODULE_API_NO >= ZEND_API_PHP74
zend_release_fcall_info_cache(&fncache);
#endif
}
// macro to convert Trie branch to hashtable entry
#define TRIE_TO_ARRAY(retval, key, value) \
switch (value.type) \
{ \
case NodeVal::isString: \
add_assoc_string(&retval, key.c_str(), value.strv); \
break; \
case NodeVal::isLong: \
add_assoc_long(&retval, key.c_str(), value.lv); \
break; \
case NodeVal::isFloat: \
add_assoc_double(&retval, key.c_str(), value.fv); \
break; \
case NodeVal::isBool: \
add_assoc_bool(&retval, key.c_str(), value.bv ? 1 : 0); \
break; \
case NodeVal::isNull: \
add_assoc_null(&retval, key.c_str()); \
break; \
}
// macro to copy trie content to zval
#define TRIE_NODE_TO_ZVAL(tmp, value) \
switch (value.type) \
{ \
case NodeVal::isString: \
ZVAL_STRING(&tmp, value.strv); \
break; \
case NodeVal::isLong: \
ZVAL_LONG(&tmp, value.lv); \
break; \
case NodeVal::isBool: \
ZVAL_BOOL(&tmp, value.bv); \
break; \
case NodeVal::isFloat: \
ZVAL_DOUBLE(&tmp, value.fv); \
break; \
case NodeVal::isNull: \
ZVAL_NULL(&tmp); \
break; \
}
// macro to create trie node from zval
#define ZVAL_TO_TRIE_NODE(zval, node) \
switch (Z_TYPE(zval)) \
{ \
case IS_STRING: \
node.type = NodeVal::isString; \
node.strv = Z_STRVAL(zval); \
break; \
case IS_LONG: \
node.type = NodeVal::isLong; \
node.lv = Z_LVAL(zval); \
break; \
case IS_DOUBLE: \
node.type = NodeVal::isFloat; \
node.fv = Z_DVAL(zval); \
break; \
case IS_NULL: \
node.type = NodeVal::isNull; \
node.nullv = nullptr; \
break; \
case IS_TRUE: \
node.type = NodeVal::isBool; \
node.bv = true; \
break; \
case IS_FALSE: \
node.type = NodeVal::isBool; \
node.bv = false; \
break; \
default: \
continue; \
}
// macro that performs map/filter function call
#define MAP_FILTER_FUNC_CALL(fn, fncache, result, arg) \
fn.retval = &result; \
fn.param_count = 1; \
fn.params = &arg; \
ZVAL_COPY(&arg, &temp); \
if (zend_call_function(&fn, &fncache) == FAILURE || Z_TYPE(result) == IS_UNDEF) \
{ \
TRIE_THROW("map operation failure"); \
}
// macro that performs filter operation
#define FILTER_OP(trie, fnres, key, value) \
switch (Z_TYPE(fnres)) \
{ \
case IS_FALSE: \
continue; \
case IS_TRUE: \
trie->insert(key, value); \
break; \
default: \
TRIE_THROW("Filter operation failed"); \
break; \
}
/* ---- common routines ----- */
/**
* @brief PHP trie/HAT trie insert function
*
* @param type
*/
static void insert(INTERNAL_FUNCTION_PARAMETERS, long type)
{
zend_string *key;
zval *entry;
zval *obj = getThis();
phptrie_object *trie;
phphattrie_object *hat;
ZEND_PARSE_PARAMETERS_START(2, 2)
Z_PARAM_STR(key)
Z_PARAM_ZVAL(entry)
ZEND_PARSE_PARAMETERS_END();
if (ZSTR_LEN(key) == 0)
{
TRIE_THROW("Key cannot be empty");
}
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
NodeVal ins;
auto ret = false;
switch (Z_TYPE_P(entry))
{
case IS_STRING:
ins.type = NodeVal::isString;
ins.strv = Z_STRVAL_P(entry);
break;
case IS_DOUBLE:
ins.type = NodeVal::isFloat;
ins.fv = Z_DVAL_P(entry);
break;
case IS_LONG:
ins.type = NodeVal::isLong;
ins.lv = Z_LVAL_P(entry);
break;
case IS_NULL:
ins.type = NodeVal::isNull;
ins.nullv = nullptr;
break;
case IS_TRUE:
ins.type = NodeVal::isBool;
ins.bv = true;
break;
case IS_FALSE:
ins.type = NodeVal::isBool;
ins.bv = false;
break;
default:
TRIE_THROW("Everything but resources, objects, and callables are storable");
break;
}
switch (type)
{
case IS_HATTRIE:
ret = hat->hat->insert(ZSTR_VAL(key), ins);
if (hat->shrink)
{
hat->hat->shrinkTrie();
}
break;
case IS_TRIE:
ret = trie->trie->insert(ZSTR_VAL(key), ins);
break;
}
RETURN_BOOL(ret);
}
zend_string_release(key);
}
/**
* @brief PHP trie/HAT trie keyExists function
*
* @param type
*/
static void keyExists(INTERNAL_FUNCTION_PARAMETERS, long type)
{
zend_string *key;
zval *obj = getThis();
phptrie_object *trie;
phphattrie_object *hat;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_STR(key)
ZEND_PARSE_PARAMETERS_END();
if (ZSTR_LEN(key) == 0)
{
TRIE_THROW("Sorry, key length cannot be zero");
}
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
bool ret;
switch (type)
{
case IS_HATTRIE:
ret = hat->hat->check(ZSTR_VAL(key));
break;
case IS_TRIE:
ret = trie->trie->check(ZSTR_VAL(key));
break;
}
RETURN_BOOL(ret);
}
zend_string_release(key);
}
/**
* @brief PHP trie/HAT trie search function
*
* @param type
*/
static void search(INTERNAL_FUNCTION_PARAMETERS, long type)
{
zend_string *key;
zval *obj = getThis();
phptrie_object *trie;
phphattrie_object *hat;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_STR(key)
ZEND_PARSE_PARAMETERS_END();
// trie = Z_TRIEOBJ_P(obj);
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
NodeVal val;
zval temp;
switch (type)
{
case IS_HATTRIE:
// if key does not exist, then throw exception
try
{
val = hat->hat->extract(ZSTR_VAL(key));
}
catch (const std::exception &exp)
{
TRIE_THROW(exp.what());
}
break;
case IS_TRIE:
val = trie->trie->extract(ZSTR_VAL(key));
break;
}
TRIE_NODE_TO_ZVAL(temp, val);
RETURN_ZVAL(&temp, 1, 0);
}
zend_string_release(key);
}
/**
* @brief PHP trie/HAT trie delete function
*
* @param type
*/
static void keyDelete(INTERNAL_FUNCTION_PARAMETERS, long type)
{
zend_string *key;
zval *obj = getThis();
phptrie_object *trie;
phphattrie_object *hat;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_STR(key)
ZEND_PARSE_PARAMETERS_END();
// trie = Z_TRIEOBJ_P(obj);
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
bool deleted;
switch (type)
{
case IS_HATTRIE:
deleted = hat->hat->remove(ZSTR_VAL(key));
if (hat->shrink)
{
hat->hat->shrinkTrie();
}
break;
case IS_TRIE:
deleted = trie->trie->remove(ZSTR_VAL(key));
break;
}
if (!deleted)
{
zend_throw_exception(phptrie_exception_ce,
"Cannot delete key",
0);
}
}
}
/**
* @brief PHP trie/HAT trie size function
*
* @param type
*/
static void count(INTERNAL_FUNCTION_PARAMETERS, long type)
{
zval *obj = getThis();
phptrie_object *trie;
phphattrie_object *hat;
ZEND_PARSE_PARAMETERS_NONE();
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
switch (type)
{
case IS_HATTRIE:
RETURN_LONG(hat->hat->size());
break;
case IS_TRIE:
RETURN_LONG(trie->trie->size());
break;
}
}
}
/**
* @brief PHP trie/HAT trie merge function
*
* @param type
*/
static void trieMerge(INTERNAL_FUNCTION_PARAMETERS, long type)
{
int argc; // variadic argument count
zval *args = NULL;
zval *obj = getThis();
phphattrie_object *hat;
phptrie_object *trie;
HatTrie *rethat;
Trie *rettrie;
ZEND_PARSE_PARAMETERS_START(0, -1)
Z_PARAM_VARIADIC('+', args, argc)
ZEND_PARSE_PARAMETERS_END();
switch (type)
{
case IS_HATTRIE:
hat = Z_HATOBJ_P(obj);
break;
case IS_TRIE:
trie = Z_TRIEOBJ_P(obj);
break;
}
if (trie != NULL || hat != NULL)
{
switch (type)
{
case IS_HATTRIE:
rethat = new HatTrie(hat->loadFactor, hat->burstThreshold);
rethat->merge(hat->hat->all());
break;
case IS_TRIE:
rettrie = new Trie();
rettrie->merge(trie->trie->all());
break;
}
if (argc == 0)
{
switch (type)
{
case IS_HATTRIE:
ZVAL_OBJ(return_value, phphattrie_object_new_ex(hat->hat,
hat->burstThreshold,
hat->loadFactor,
hat->shrink));
break;
case IS_TRIE:
ZVAL_OBJ(return_value, phptrie_object_new_ex(trie->trie));
break;
}
}
// check validity of variadic function argument
#define VARIADIC_CHECK(type, arg, tmp) \
if (Z_TYPE_P(arg) != IS_OBJECT || tmp == NULL || !instanceof_function(Z_OBJCE_P(arg), type##_ce)) \
{ \
TRIE_THROW("Only trie elements are allowed"); \
}
// handle potential memory allocation error
#define MERGE_ALLOC(trie, obj) \
try \
{ \
trie->merge(obj); \
} \
catch (const std::bad_alloc &exp) \
{ \
std::string err((std::string)exp.what() + " allocation error"); \
TRIE_THROW(err.c_str()); \
}
for (auto idx = 0; idx < argc; ++idx)
{
zval *arg = args + idx; // next argument
phphattrie_object *tmphat;
phptrie_object *tmptrie;
switch (type)
{
case IS_HATTRIE:
tmphat = Z_HATOBJ_P(arg);
VARIADIC_CHECK(phphattrie, arg, tmphat);
MERGE_ALLOC(rethat, tmphat->hat->all());
break;
case IS_TRIE:
tmptrie = Z_TRIEOBJ_P(arg);
VARIADIC_CHECK(phptrie, arg, tmptrie);
MERGE_ALLOC(rettrie, tmptrie->trie->all());
break;
}
i_zval_ptr_dtor(arg);
}
switch (type)
{
case IS_HATTRIE:
ZVAL_OBJ(return_value, phphattrie_object_new_ex(rethat,
hat->burstThreshold,
hat->loadFactor,
hat->shrink));
break;
case IS_TRIE:
ZVAL_OBJ(return_value, phptrie_object_new_ex(rettrie));
break;
}
}
}
/* ---- Trie routines ----- */
/**
* @brief PHP trie/HAT trie object constructor
*
* @param type
*/
static void trieConstruct(INTERNAL_FUNCTION_PARAMETERS)
{
zval *obj = getThis();
phptrie_object *trie;
ZEND_PARSE_PARAMETERS_NONE();
trie = Z_TRIEOBJ_P(obj);
if (trie != NULL)
{
trie->trie = new Trie();
}
}
/**
* @brief PHP trie toArray function
*
*/
static void trieToArray(INTERNAL_FUNCTION_PARAMETERS)
{
zval *obj = getThis();
phptrie_object *trie;
triemap data;
ZEND_PARSE_PARAMETERS_NONE();
trie = Z_TRIEOBJ_P(obj);
if (trie != NULL)
{
zval retval;
array_init(&retval);
data = trie->trie->all();
for (auto idx : data)
{
TRIE_TO_ARRAY(retval, idx.first, idx.second);
}
RETURN_ZVAL(&retval, 1, 0);
}
}
/**
* @brief PHP trie fromArray static function
*
* @param type
*/
static void trieFromArray(INTERNAL_FUNCTION_PARAMETERS)
{
zval *array, *hashVal;
zend_string *hashKey;
zval *obj = getThis();
phptrie_object *trie;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_ARRAY(array)
ZEND_PARSE_PARAMETERS_END();
if (zend_hash_num_elements(Z_ARRVAL_P(array)) == 0)
{
TRIE_THROW("Array cannot be empty");
}
Trie *dest = new Trie();
ZEND_HASH_FOREACH_STR_KEY_VAL(Z_ARRVAL_P(array), hashKey, hashVal)
{
NodeVal ins;
zval dup;
ZVAL_COPY(&dup, hashVal);
ZVAL_TO_TRIE_NODE(dup, ins);
dest->insert(ZSTR_VAL(hashKey), ins);
}
ZEND_HASH_FOREACH_END();
object_init_ex(return_value, phptrie_ce);
trie = Z_TRIEOBJ_P(return_value);
trie->trie = dest;
}
/**
* @brief PHP trie prefixSearch function
*
*/
static void triePrefixSearch(INTERNAL_FUNCTION_PARAMETERS)
{
zend_string *prefix;
zval *obj = getThis();
phptrie_object *trie;
Trie *cpptrie;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_STR(prefix)
ZEND_PARSE_PARAMETERS_END();
if (ZSTR_LEN(prefix) == 0)
{
TRIE_THROW("Prefix cannot be empty");
}
trie = Z_TRIEOBJ_P(obj);
if (trie != NULL)
{
auto entries = trie->trie->prefixSearch(ZSTR_VAL(prefix));
cpptrie = new Trie(entries);
ZVAL_OBJ(return_value, phptrie_object_new_ex(cpptrie));
}
zend_string_release(prefix);
}
/**
* @brief PHP trie map function
*
*/
static void trieMap(INTERNAL_FUNCTION_PARAMETERS)
{
zval result, arg;
zend_fcall_info fci = empty_fcall_info;
zend_fcall_info_cache fci_cache = empty_fcall_info_cache;
zval *obj = getThis();
phptrie_object *trie;
triemap entries;
Trie *cpptrie;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_FUNC(fci, fci_cache)
ZEND_PARSE_PARAMETERS_END();
trie = Z_TRIEOBJ_P(obj);
if (trie != NULL)
{
entries = trie->trie->all();
cpptrie = new Trie();
for (auto idx : entries)
{
NodeVal ins;
zval temp;
TRIE_NODE_TO_ZVAL(temp, idx.second);
MAP_FILTER_FUNC_CALL(fci, fci_cache, result, arg);
i_zval_ptr_dtor(&arg);
ZVAL_TO_TRIE_NODE(result, ins);
cpptrie->insert(idx.first.c_str(), ins);
}
fcall_cache_release(fci_cache);
// zend_release_fcall_info_cache(&fci_cache);
ZVAL_OBJ(return_value, phptrie_object_new_ex(cpptrie));
}
}
/**
* @brief PHP trie filter function
*
*/
static void trieFilter(INTERNAL_FUNCTION_PARAMETERS)
{
zval result, arg;
zend_fcall_info fci = empty_fcall_info;
zend_fcall_info_cache fci_cache = empty_fcall_info_cache;
zval *obj = getThis();
phptrie_object *trie;
triemap entries;
Trie *cpptrie;
ZEND_PARSE_PARAMETERS_START(1, 1)
Z_PARAM_FUNC(fci, fci_cache)
ZEND_PARSE_PARAMETERS_END();
trie = Z_TRIEOBJ_P(obj);
if (trie != NULL)
{
entries = trie->trie->all();
cpptrie = new Trie();
for (auto idx : entries)
{
zval temp;
TRIE_NODE_TO_ZVAL(temp, idx.second);
MAP_FILTER_FUNC_CALL(fci, fci_cache, result, arg);
i_zval_ptr_dtor(&arg);
FILTER_OP(cpptrie, result, idx.first.c_str(), idx.second);
}
fcall_cache_release(fci_cache);
// zend_release_fcall_info_cache(&fci_cache);
ZVAL_OBJ(return_value, phptrie_object_new_ex(cpptrie));
}
}
/* ---- HAT trie routines ----- */
/**
* @brief PHP HAT trie constructor