Lines Matching defs:node

36     util_url_node_t *node = n;
37 return util_ald_hash_string(1, node->url);
51 util_url_node_t *node = util_ald_alloc(cache, sizeof *node);
53 if (node) {
54 if (!(node->url = util_ald_strdup(cache, n->url))) {
55 util_ald_free(cache, node);
58 node->search_cache = n->search_cache;
59 node->compare_cache = n->compare_cache;
60 node->dn_compare_cache = n->dn_compare_cache;
61 return node;
70 util_url_node_t *node = n;
72 util_ald_free(cache, node->url);
73 util_ald_destroy_cache(node->search_cache);
74 util_ald_destroy_cache(node->compare_cache);
75 util_ald_destroy_cache(node->dn_compare_cache);
76 util_ald_free(cache, node);
81 util_url_node_t *node = n;
90 cache_node = node->search_cache;
94 cache_node = node->compare_cache;
99 cache_node = node->dn_compare_cache;
119 node->url,
135 util_search_node_t *node = n;
136 return util_ald_hash_string(1, node->username);
149 util_search_node_t *node = c;
156 if (node->vals) {
157 int k = node->numvals;
163 newnode->numvals = node->numvals;
165 if (node->vals[i]) {
166 if (!(newnode->vals[i] = util_ald_strdup(cache, node->vals[i]))) {
179 if (!(newnode->username = util_ald_strdup(cache, node->username)) ||
180 !(newnode->dn = util_ald_strdup(cache, node->dn)) ) {
184 if(node->bindpw) {
185 if(!(newnode->bindpw = util_ald_strdup(cache, node->bindpw))) {
192 newnode->lastbind = node->lastbind;
201 util_search_node_t *node = n;
202 int k = node->numvals;
204 if (node->vals) {
206 if (node->vals[i]) {
207 util_ald_free(cache, node->vals[i]);
210 util_ald_free(cache, node->vals);
212 util_ald_free(cache, node->username);
213 util_ald_free(cache, node->dn);
214 util_ald_free(cache, node->bindpw);
215 util_ald_free(cache, node);
220 util_search_node_t *node = n;
223 apr_ctime(date_str, node->lastbind);
231 node->username,
232 node->dn,
240 util_compare_node_t *node = n;
241 return util_ald_hash_string(3, node->dn, node->attrib, node->value);
257 util_compare_node_t *node = util_ald_alloc(cache, sizeof *node);
259 if (node) {
260 if (!(node->dn = util_ald_strdup(cache, n->dn)) ||
261 !(node->attrib = util_ald_strdup(cache, n->attrib)) ||
262 !(node->value = util_ald_strdup(cache, n->value)) ||
263 ((n->subgroupList) && !(node->subgroupList = util_ald_sgl_dup(cache, n->subgroupList)))) {
264 util_ldap_compare_node_free(cache, node);
267 node->lastcompare = n->lastcompare;
268 node->result = n->result;
269 node->sgl_processed = n->sgl_processed;
270 return node;
279 util_compare_node_t *node = n;
281 util_ald_sgl_free(cache, &(node->subgroupList));
282 util_ald_free(cache, node->dn);
283 util_ald_free(cache, node->attrib);
284 util_ald_free(cache, node->value);
285 util_ald_free(cache, node);
290 util_compare_node_t *node = n;
296 apr_ctime(date_str, node->lastcompare);
298 if (node->result == LDAP_COMPARE_TRUE) {
301 else if (node->result == LDAP_COMPARE_FALSE) {
305 cmp_result = apr_itoa(r->pool, node->result);
308 if(node->subgroupList) {
315 if(node->sgl_processed) {
332 node->dn,
333 node->attrib,
334 node->value,
345 util_dn_compare_node_t *node = n;
346 return util_ald_hash_string(1, node->reqdn);
360 util_dn_compare_node_t *node = util_ald_alloc(cache, sizeof *node);
362 if (node) {
363 if (!(node->reqdn = util_ald_strdup(cache, n->reqdn)) ||
364 !(node->dn = util_ald_strdup(cache, n->dn))) {
365 util_ldap_dn_compare_node_free(cache, node);
368 return node;
377 util_dn_compare_node_t *node = n;
378 util_ald_free(cache, node->reqdn);
379 util_ald_free(cache, node->dn);
380 util_ald_free(cache, node);
385 util_dn_compare_node_t *node = n;
392 node->reqdn,
393 node->dn);