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
|
/*
* Copyright (c) 2017-2019 TOYOTA MOTOR CORPORATION
*
* Licensed 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.
*/
#define _GNU_SOURCE
#include <stdio.h>
#include <stdio.h>
#include <stdlib.h>
#include <search.h>
#include <string.h>
#include "wheel-service.h"
#include "prop_search.h"
#define SUPPORT_PROPERTY_LIMIT 512
static void *property_root = NULL;
static const char *support_property_list[SUPPORT_PROPERTY_LIMIT];
static int nProperties = 0;
static void (*_walker_action)(struct prop_info_t *);
static int property_compare(const void *pa, const void *pb)
{
struct prop_info_t *a =(struct prop_info_t *)pa;
struct prop_info_t *b =(struct prop_info_t *)pb;
return strcmp(a->name,b->name);
}
static int addProperty_dict(struct prop_info_t *prop_info)
{
void *v;
v = tfind((void *)prop_info, &property_root, property_compare);
if (v == NULL)
{
v = tsearch((void *)prop_info, &property_root, property_compare);
if (v == NULL)
{
DBG_ERROR("add property failed: not enogh memory?");
return -1;
}
if (nProperties >= SUPPORT_PROPERTY_LIMIT)
{
DBG_ERROR("Reach properties limit");
return -1;
}
support_property_list[nProperties] = prop_info->name;
++nProperties;
return 0;
} /* else Multi entry */
return 1;
}
int addAllPropDict(struct wheel_info_t *wheel_info)
{
unsigned int maxEntry = wheel_info->nData;
for(unsigned int i=0; i < maxEntry ; i++)
{
int ret;
ret = addProperty_dict(&wheel_info->property[i]);
if (!ret)
{
continue;
}
}
return 0;
}
const char **getSupportPropertiesList(int *nEntry)
{
*nEntry = nProperties;
return support_property_list;
}
struct prop_info_t * getProperty_dict(const char *propertyName)
{
struct prop_info_t key;
void *v;
key.name = propertyName;
v = tfind((void *)&key, &property_root, property_compare);
if (v == NULL) {
return NULL;
}
return (*(struct prop_info_t **)v);
}
static void canid_walk_action(const void *nodep, const VISIT which , const int depth)
{
struct prop_info_t *datap;
switch (which) {
case preorder:
break;
case postorder:
datap = *(struct prop_info_t **) nodep;
_walker_action(datap);
break;
case endorder:
break;
case leaf:
datap = *(struct prop_info_t **) nodep;
_walker_action(datap);
break;
}
}
void canid_walker(void (*walker_action)(struct prop_info_t *))
{
if (walker_action == NULL)
return;
_walker_action = walker_action;
twalk(property_root, canid_walk_action);
}
|
