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
|
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/***************************************************************************
* Description: General purpose map object *
* Author: Gal Shachor <shachor@il.ibm.com> *
* Author: Mladen Turk <mturk@apache.org> *
* Version: $Revision: 1042364 $ *
***************************************************************************/
#if defined(AS400) && !defined(AS400_UTF8)
#include "apr_xlate.h"
#endif
#include "jk_global.h"
#include "jk_pool.h"
#include "jk_util.h"
#include "jk_map.h"
#define CAPACITY_INC_SIZE (50)
#define LENGTH_OF_LINE (8192)
#define JK_MAP_RECURSION (20)
#define JK_MAP_REFERENCE (".reference")
#define JK_MAP_REFERENCE_SZ (strlen(JK_MAP_REFERENCE))
/* Compute the "checksum" for a key, consisting of the first
* 4 bytes, packed into an int.
* This checksum allows us to do a single integer
* comparison as a fast check to determine whether we can
* skip a strcmp
*/
#define COMPUTE_KEY_CHECKSUM(key, checksum) \
{ \
const char *k = (key); \
unsigned int c = (unsigned int)*k; \
(checksum) = c; \
(checksum) <<= 8; \
if (c) { \
c = (unsigned int)*++k; \
checksum |= c; \
} \
(checksum) <<= 8; \
if (c) { \
c = (unsigned int)*++k; \
checksum |= c; \
} \
(checksum) <<= 8; \
if (c) { \
c = (unsigned int)*++k; \
checksum |= c; \
} \
}
struct jk_map
{
jk_pool_t p;
jk_pool_atom_t buf[SMALL_POOL_SIZE];
const char **names;
const void **values;
unsigned int *keys;
unsigned int capacity;
unsigned int size;
};
static void trim_prp_comment(char *prp);
static size_t trim(char *s);
static int map_realloc(jk_map_t *m);
static char *jk_map_replace_properties(jk_map_t *m, jk_map_t *env, char *value);
int jk_map_alloc(jk_map_t **m)
{
if (m) {
return jk_map_open(*m = (jk_map_t *)malloc(sizeof(jk_map_t)));
}
return JK_FALSE;
}
int jk_map_free(jk_map_t **m)
{
int rc = JK_FALSE;
if (m && *m) {
jk_map_close(*m);
free(*m);
*m = NULL;
}
return rc;
}
int jk_map_open(jk_map_t *m)
{
int rc = JK_FALSE;
if (m) {
jk_open_pool(&m->p, m->buf, sizeof(jk_pool_atom_t) * SMALL_POOL_SIZE);
m->capacity = 0;
m->size = 0;
m->keys = NULL;
m->names = NULL;
m->values = NULL;
rc = JK_TRUE;
}
return rc;
}
int jk_map_close(jk_map_t *m)
{
int rc = JK_FALSE;
if (m) {
jk_close_pool(&m->p);
rc = JK_TRUE;
}
return rc;
}
void *jk_map_get(jk_map_t *m, const char *name, const void *def)
{
const void *rc = (void *)def;
if (m && name) {
unsigned int i;
unsigned int key;
COMPUTE_KEY_CHECKSUM(name, key)
for (i = 0; i < m->size; i++) {
if (m->keys[i] == key && strcmp(m->names[i], name) == 0) {
rc = m->values[i];
break;
}
}
}
return (void *)rc; /* DIRTY */
}
int jk_map_get_id(jk_map_t *m, const char *name)
{
int rc = -1;
if (m && name) {
unsigned int i;
unsigned int key;
COMPUTE_KEY_CHECKSUM(name, key)
for (i = 0; i < m->size; i++) {
if (m->keys[i] == key && strcmp(m->names[i], name) == 0) {
rc = i;
break;
}
}
}
return rc;
}
const char *jk_map_get_string(jk_map_t *m, const char *name, const char *def)
{
const char *rc = def;
if (m && name) {
unsigned int i;
unsigned int key;
COMPUTE_KEY_CHECKSUM(name, key)
for (i = 0; i < m->size; i++) {
if (m->keys[i] == key && strcmp(m->names[i], name) == 0) {
rc = m->values[i];
break;
}
}
}
return rc;
}
int jk_map_get_int(jk_map_t *m, const char *name, int def)
{
char buf[100];
const char *rc;
size_t len;
int int_res;
int multit = 1;
sprintf(buf, "%d", def);
rc = jk_map_get_string(m, name, buf);
len = strlen(rc);
if (len) {
char *lastchar = &buf[0] + len - 1;
strcpy(buf, rc);
if ('m' == *lastchar || 'M' == *lastchar) {
*lastchar = '\0';
multit = 1024 * 1024;
}
else if ('k' == *lastchar || 'K' == *lastchar) {
*lastchar = '\0';
multit = 1024;
}
int_res = atoi(buf);
}
else
int_res = def;
return int_res * multit;
}
double jk_map_get_double(jk_map_t *m, const char *name, double def)
{
char buf[100];
const char *rc;
sprintf(buf, "%f", def);
rc = jk_map_get_string(m, name, buf);
return atof(rc);
}
int jk_map_get_bool(jk_map_t *m, const char *name, int def)
{
char buf[100];
const char *rc;
sprintf(buf, "%d", def);
rc = jk_map_get_string(m, name, buf);
return jk_get_bool_code(rc, def);
}
char **jk_map_get_string_list(jk_map_t *m,
const char *name,
unsigned int *list_len, const char *def)
{
const char *l = jk_map_get_string(m, name, def);
char **ar = NULL;
#ifdef _MT_CODE_PTHREAD
char *lasts;
#endif
*list_len = 0;
if (l) {
unsigned capacity = 0;
unsigned idex = 0;
char *p;
char *v = jk_pool_strdup(&m->p, l);
if (!v) {
return NULL;
}
/*
* GS, in addition to VG's patch, we now need to
* strtok also by a "*"
*/
#ifdef _MT_CODE_PTHREAD
for (p = strtok_r(v, " \t,", &lasts);
p; p = strtok_r(NULL, " \t,", &lasts))
#else
for (p = strtok(v, " \t,"); p; p = strtok(NULL, " \t,"))
#endif
{
if (idex == capacity) {
ar = jk_pool_realloc(&m->p,
sizeof(char *) * (capacity + 5),
ar, sizeof(char *) * capacity);
if (!ar) {
return JK_FALSE;
}
capacity += 5;
}
ar[idex] = jk_pool_strdup(&m->p, p);
idex++;
}
*list_len = idex;
}
return ar;
}
int jk_map_get_int_list(jk_map_t *m,
const char *name,
int *list,
unsigned int list_len,
const char *def)
{
const char *l = jk_map_get_string(m, name, def);
#ifdef _MT_CODE_PTHREAD
char *lasts;
#endif
if (!list_len)
return 0;
if (l) {
unsigned int capacity = list_len;
unsigned int index = 0;
char *p;
char *v = jk_pool_strdup(&m->p, l);
if (!v) {
return 0;
}
/*
* GS, in addition to VG's patch, we now need to
* strtok also by a "*"
*/
#ifdef _MT_CODE_PTHREAD
for (p = strtok_r(v, " \t,", &lasts);
p; p = strtok_r(NULL, " \t,", &lasts))
#else
for (p = strtok(v, " \t,"); p; p = strtok(NULL, " \t,"))
#endif
{
if (index < capacity) {
list[index] = atoi(p);
index++;
}
else
break;
}
return index;
}
return 0;
}
int jk_map_add(jk_map_t *m, const char *name, const void *value)
{
int rc = JK_FALSE;
if (m && name) {
unsigned int key;
COMPUTE_KEY_CHECKSUM(name, key)
map_realloc(m);
if (m->size < m->capacity) {
m->values[m->size] = value;
m->names[m->size] = jk_pool_strdup(&m->p, name);
m->keys[m->size] = key;
m->size++;
rc = JK_TRUE;
}
}
return rc;
}
int jk_map_put(jk_map_t *m, const char *name, const void *value, void **old)
{
int rc = JK_FALSE;
if (m && name) {
unsigned int i;
unsigned int key;
COMPUTE_KEY_CHECKSUM(name, key)
for (i = 0; i < m->size; i++) {
if (m->keys[i] == key && strcmp(m->names[i], name) == 0) {
break;
}
}
if (i < m->size) {
if (old)
*old = (void *)m->values[i]; /* DIRTY */
m->values[i] = value;
rc = JK_TRUE;
}
else {
rc = jk_map_add(m, name, value);
}
}
return rc;
}
static int jk_map_validate_property(char *prp, jk_logger_t *l)
{
/* check the worker properties */
if (!jk_is_valid_property(prp)) {
jk_log(l, JK_LOG_ERROR,
"The attribute '%s' is not supported - please check"
" the documentation for the supported attributes.",
prp);
return JK_FALSE;
}
if (jk_is_deprecated_property(prp)) {
jk_log(l, JK_LOG_WARNING,
"The attribute '%s' is deprecated - please check"
" the documentation for the correct replacement.",
prp);
}
return JK_TRUE;
}
static int jk_map_handle_duplicates(jk_map_t *m, const char *prp, char **v,
int treatment, jk_logger_t *l)
{
const char *oldv = jk_map_get_string(m, prp, NULL);
if (oldv) {
if ((treatment == JK_MAP_HANDLE_DUPLICATES)
&& jk_is_unique_property(prp) == JK_FALSE) {
char *tmpv = jk_pool_alloc(&m->p,
strlen(*v) + strlen(oldv) + 3);
if (tmpv) {
char sep = '*';
if (jk_is_path_property(prp))
sep = PATH_SEPERATOR;
else if (jk_is_cmd_line_property(prp))
sep = ' ';
else if (jk_is_list_property(prp))
sep = ',';
sprintf(tmpv, "%s%c%s", oldv, sep, *v);
}
*v = tmpv;
if (JK_IS_DEBUG_LEVEL(l))
jk_log(l, JK_LOG_DEBUG,
"Concatenated value is: %s -> %s",
prp, *v);
return JK_FALSE;
}
else {
jk_log(l, JK_LOG_WARNING,
"Duplicate key '%s' detected - previous value '%s'"
" will be overwritten with '%s'.",
prp, oldv ? oldv : "(null)", v ? *v : "(null)");
return JK_TRUE;
}
}
else {
return JK_TRUE;
}
}
int jk_map_read_property(jk_map_t *m, jk_map_t *env, const char *str,
int treatment, jk_logger_t *l)
{
int rc = JK_TRUE;
char buf[LENGTH_OF_LINE + 1];
char *prp = &buf[0];
if (strlen(str) > LENGTH_OF_LINE) {
jk_log(l, JK_LOG_WARNING,
"Line to long (%d > %d), ignoring entry",
strlen(str), LENGTH_OF_LINE);
return JK_FALSE;
}
strcpy(prp, str);
if (trim(prp)) {
char *v = strchr(prp, '=');
if (v) {
*v = '\0';
v++;
if (trim(v) && trim(prp)) {
if (treatment == JK_MAP_HANDLE_RAW) {
v = jk_pool_strdup(&m->p, v);
}
else {
if (jk_map_validate_property(prp, l) == JK_FALSE)
return JK_FALSE;
v = jk_map_replace_properties(m, env, v);
if (jk_map_handle_duplicates(m, prp, &v, treatment, l) == JK_TRUE)
v = jk_pool_strdup(&m->p, v);
}
if (v) {
if (JK_IS_DEBUG_LEVEL(l))
jk_log(l, JK_LOG_DEBUG,
"Adding property '%s' with value '%s' to map.",
prp, v);
jk_map_put(m, prp, v, NULL);
}
else {
JK_LOG_NULL_PARAMS(l);
rc = JK_FALSE;
}
}
}
}
return rc;
}
int jk_map_read_properties(jk_map_t *m, jk_map_t *env, const char *f, time_t *modified,
int treatment, jk_logger_t *l)
{
int rc = JK_FALSE;
if (m && f) {
struct stat statbuf;
FILE *fp;
if (jk_stat(f, &statbuf) == -1)
return JK_FALSE;
#if defined(AS400) && !defined(AS400_UTF8)
fp = fopen(f, "r, o_ccsid=0");
#else
fp = fopen(f, "r");
#endif
if (fp) {
char buf[LENGTH_OF_LINE + 1];
char *prp;
rc = JK_TRUE;
while (NULL != (prp = fgets(buf, LENGTH_OF_LINE, fp))) {
trim_prp_comment(prp);
if (*prp) {
if ((rc = jk_map_read_property(m, env, prp, treatment, l)) == JK_FALSE)
break;
}
}
fclose(fp);
if (modified)
*modified = statbuf.st_mtime;
}
}
return rc;
}
int jk_map_size(jk_map_t *m)
{
if (m) {
return m->size;
}
return -1;
}
const char *jk_map_name_at(jk_map_t *m, int idex)
{
if (m && idex >= 0) {
return m->names[idex]; /* DIRTY */
}
return NULL;
}
void *jk_map_value_at(jk_map_t *m, int idex)
{
if (m && idex >= 0) {
return (void *)m->values[idex]; /* DIRTY */
}
return NULL;
}
void jk_map_dump(jk_map_t *m, jk_logger_t *l)
{
if (m) {
int s = jk_map_size(m);
int i;
for (i=0;i<s;i++) {
if (!jk_map_name_at(m, i)) {
jk_log(l, JK_LOG_WARNING,
"Map contains empty name at index %d\n", i);
}
if (!jk_map_value_at(m, i)) {
jk_log(l, JK_LOG_WARNING,
"Map contains empty value for name '%s' at index %d\n",
jk_map_name_at(m, i), i);
}
if (JK_IS_DEBUG_LEVEL(l)) {
jk_log(l, JK_LOG_DEBUG,
"Dump of map: '%s' -> '%s'",
jk_map_name_at(m, i) ? jk_map_name_at(m, i) : "(null)",
jk_map_value_at(m, i) ? jk_map_value_at(m, i) : "(null)");
}
}
}
}
int jk_map_copy(jk_map_t *src, jk_map_t *dst)
{
int sz = jk_map_size(src);
int i;
for (i = 0; i < sz; i++) {
const char *name = jk_map_name_at(src, i);
if (jk_map_get(dst, name, NULL) == NULL) {
if (!jk_map_put(dst, name,
jk_pool_strdup(&dst->p, jk_map_get_string(src, name, NULL)),
NULL)) {
return JK_FALSE;
}
}
}
return JK_TRUE;
}
static void trim_prp_comment(char *prp)
{
#if defined(AS400) && !defined(AS400_UTF8)
char *comment;
/* lots of lines that translate a '#' realtime deleted */
comment = strchr(prp, *APR_NUMBERSIGN);
#else
char *comment = strchr(prp, '#');
#endif
if (comment) {
*comment = '\0';
}
}
static size_t trim(char *s)
{
size_t first;
size_t len;
/* check for empty strings */
if (!(len = strlen(s)))
return 0;
for (len = len - 1; (len > 0) &&
isspace((int)((unsigned char)s[len])); len--);
if ((len > 0) || !isspace((int)((unsigned char)s[len]))) {
len++;
}
s[len] = '\0';
len++;
for (first = 0; (s[first] != '\0') &&
isspace((int)((unsigned char)s[first])); first++);
if (first > 0) {
memmove(s, s + first, len - first);
}
return len;
}
static int map_realloc(jk_map_t *m)
{
if (m->size == m->capacity) {
char **names;
void **values;
unsigned int *keys;
int capacity = m->capacity + CAPACITY_INC_SIZE;
names = (char **)jk_pool_alloc(&m->p, sizeof(char *) * capacity);
values = (void **)jk_pool_alloc(&m->p, sizeof(void *) * capacity);
keys = (unsigned int *)jk_pool_alloc(&m->p, sizeof(unsigned int) * capacity);
if (values && names) {
if (m->capacity && m->names)
memcpy(names, m->names, sizeof(char *) * m->capacity);
if (m->capacity && m->values)
memcpy(values, m->values, sizeof(void *) * m->capacity);
if (m->capacity && m->keys)
memcpy(keys, m->keys, sizeof(unsigned int) * m->capacity);
m->names = (const char **)names;
m->values = (const void **)values;
m->keys = keys;
m->capacity = capacity;
return JK_TRUE;
}
}
return JK_FALSE;
}
/**
* Replace $(property) in value.
*
*/
static char *jk_map_replace_properties(jk_map_t *m, jk_map_t *env, char *value)
{
char *rc = value;
char *env_start = rc;
int rec = 0;
while ((env_start = strstr(env_start, "$(")) != NULL) {
char *env_end = strstr(env_start, ")");
if (rec++ > 20)
return rc;
if (env_end) {
char env_name[LENGTH_OF_LINE + 1] = "";
const char *env_value;
#if defined(WIN32)
char env_buf[LENGTH_OF_LINE + 1];
#endif
*env_end = '\0';
strcpy(env_name, env_start + 2);
*env_end = ')';
env_value = jk_map_get_string(m, env_name, NULL);
if (!env_value) {
env_value = getenv(env_name);
}
if (!env_value && env) {
/* Search inside local environment table */
env_value = jk_map_get_string(env, env_name, NULL);
}
#if defined(WIN32)
if (!env_value) {
/* Try the env block from calling process */
if (GetEnvironmentVariable(env_name, env_buf,
sizeof(env_buf)))
env_value = &env_buf[0];
}
#endif
if (env_value) {
size_t offset = 0;
char *new_value = jk_pool_alloc(&m->p,
(sizeof(char) *
(strlen(rc) +
strlen(env_value))));
if (!new_value) {
break;
}
*env_start = '\0';
strcpy(new_value, rc);
strcat(new_value, env_value);
strcat(new_value, env_end + 1);
offset = env_start - rc + strlen(env_value);
rc = new_value;
/* Avoid recursive subst */
env_start = rc + offset;
}
else {
env_start = env_end;
}
}
else {
break;
}
}
return rc;
}
/**
* Resolve references
*
*/
int jk_map_resolve_references(jk_map_t *m, const char *prefix,
int wildcard, int depth, jk_logger_t *l)
{
int rc = JK_FALSE;
JK_TRACE_ENTER(l);
if (m && prefix) {
if (depth <= JK_MAP_RECURSION) {
size_t prelen = strlen(prefix);
unsigned int i;
rc = JK_TRUE;
if (JK_IS_DEBUG_LEVEL(l))
jk_log(l, JK_LOG_DEBUG,
"Checking for references with prefix %s with%s wildcard (recursion %d)",
prefix, wildcard? "" : "out", depth);
for (i = 0; i < m->size; i++) {
char *v = (char *)m->values[i];
if (v && *v &&
!strncmp(m->names[i], prefix, prelen)) {
size_t remain = strlen(m->names[i]) - prelen;
if ((remain == JK_MAP_REFERENCE_SZ ) || (wildcard && remain > JK_MAP_REFERENCE_SZ)) {
remain = strlen(m->names[i]) - JK_MAP_REFERENCE_SZ;
if (!strncmp(m->names[i] + remain, JK_MAP_REFERENCE, JK_MAP_REFERENCE_SZ)) {
char *from = jk_pool_alloc(&m->p,
(sizeof(char) *
(strlen(v) + 2)));
char *to = jk_pool_alloc(&m->p,
(sizeof(char) *
(remain + 2)));
if (!from || !to) {
jk_log(l, JK_LOG_ERROR,
"Error in string allocation");
rc = JK_FALSE;
break;
}
strcpy(from, v);
*(from+strlen(v)) = '.';
*(from+strlen(v)+1) = '\0';
strncpy(to, m->names[i], remain);
*(to+remain) = '.';
*(to+remain+1) = '\0';
rc = jk_map_resolve_references(m, v, 0, depth+1, l);
if (rc == JK_FALSE) {
break;
}
if (JK_IS_DEBUG_LEVEL(l))
jk_log(l, JK_LOG_DEBUG,
"Copying values from %s to %s",
from, to);
rc = jk_map_inherit_properties(m, from, to, l);
if (rc == JK_FALSE) {
break;
}
}
}
}
}
}
else {
jk_log(l, JK_LOG_ERROR,
"Recursion limit %d for worker references with prefix '%s' reached",
JK_MAP_RECURSION, prefix);
}
}
else {
JK_LOG_NULL_PARAMS(l);
}
JK_TRACE_EXIT(l);
return rc;
}
/**
* Inherit properties
*
*/
int jk_map_inherit_properties(jk_map_t *m, const char *from, const char *to, jk_logger_t *l)
{
int rc = JK_FALSE;
const char *prp;
char *to_prp;
if (m && from && to) {
unsigned int i;
for (i = 0; i < m->size; i++) {
if (!strncmp(m->names[i], from, strlen(from))) {
rc = JK_TRUE;
prp = m->names[i] + strlen(from);
to_prp = jk_pool_alloc(&m->p,
(sizeof(char) *
(strlen(to) +
strlen(prp) + 1)));
if (!to_prp) {
jk_log(l, JK_LOG_ERROR,
"Error in string allocation for attribute '%s.%s'",
to, prp);
rc = JK_FALSE;
break;
}
strcpy(to_prp, to);
strcat(to_prp, prp);
if (jk_map_get_id(m, to_prp) < 0 ) {
rc = jk_map_add(m, to_prp, m->values[i]);
if (rc == JK_FALSE) {
jk_log(l, JK_LOG_ERROR,
"Error when adding attribute '%s'",
to_prp);
break;
}
}
}
}
if ( rc == JK_FALSE) {
jk_log(l, JK_LOG_ERROR,
"Reference '%s' not found",
from);
}
}
else {
JK_LOG_NULL_PARAMS(l);
}
return rc;
}
|