2 * element.c : editing trees of versioned resources
4 * ====================================================================
5 * Licensed to the Apache Software Foundation (ASF) under one
6 * or more contributor license agreements. See the NOTICE file
7 * distributed with this work for additional information
8 * regarding copyright ownership. The ASF licenses this file
9 * to you under the Apache License, Version 2.0 (the
10 * "License"); you may not use this file except in compliance
11 * with the License. You may obtain a copy of the License at
13 * http://www.apache.org/licenses/LICENSE-2.0
15 * Unless required by applicable law or agreed to in writing,
16 * software distributed under the License is distributed on an
17 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
18 * KIND, either express or implied. See the License for the
19 * specific language governing permissions and limitations
21 * ====================================================================
25 #include <apr_pools.h>
27 #include "svn_types.h"
28 #include "svn_error.h"
29 #include "svn_string.h"
30 #include "svn_props.h"
31 #include "svn_dirent_uri.h"
33 #include "private/svn_sorts_private.h"
35 #include "private/svn_element.h"
36 #include "svn_private_config.h"
40 svn_eid__hash_get(apr_hash_t *ht,
43 return apr_hash_get(ht, &key, sizeof(key));
47 svn_eid__hash_set(apr_hash_t *ht,
51 int *id_p = apr_pmemdup(apr_hash_pool_get(ht), &key, sizeof(key));
53 apr_hash_set(ht, id_p, sizeof(key), val);
57 svn_eid__hash_this_key(apr_hash_index_t *hi)
59 return *(const int *)apr_hash_this_key(hi);
62 svn_eid__hash_iter_t *
63 svn_eid__hash_sorted_first(apr_pool_t *pool,
65 int (*comparison_func)(const svn_sort__item_t *,
66 const svn_sort__item_t *))
68 svn_eid__hash_iter_t *hi = apr_palloc(pool, sizeof(*hi));
70 if (apr_hash_count(ht) == 0)
73 hi->array = svn_sort__hash(ht, comparison_func, pool);
75 hi->eid = *(const int *)(APR_ARRAY_IDX(hi->array, hi->i,
76 svn_sort__item_t).key);
77 hi->val = APR_ARRAY_IDX(hi->array, hi->i, svn_sort__item_t).value;
81 svn_eid__hash_iter_t *
82 svn_eid__hash_sorted_next(svn_eid__hash_iter_t *hi)
85 if (hi->i >= hi->array->nelts)
89 hi->eid = *(const int *)(APR_ARRAY_IDX(hi->array, hi->i,
90 svn_sort__item_t).key);
91 hi->val = APR_ARRAY_IDX(hi->array, hi->i, svn_sort__item_t).value;
96 svn_eid__hash_sort_compare_items_by_eid(const svn_sort__item_t *a,
97 const svn_sort__item_t *b)
99 int eid_a = *(const int *)a->key;
100 int eid_b = *(const int *)b->key;
102 return eid_a - eid_b;
107 * ===================================================================
109 * ===================================================================
113 svn_element__payload_invariants(const svn_element__payload_t *payload)
115 if (payload->is_subbranch_root)
118 /* If kind is unknown, it's a reference; otherwise it has content
119 specified and may also have a reference. */
120 if (payload->kind == svn_node_unknown)
121 if (SVN_IS_VALID_REVNUM(payload->branch_ref.rev)
122 && payload->branch_ref.branch_id
123 && payload->branch_ref.eid != -1)
125 if ((payload->kind == svn_node_dir
126 || payload->kind == svn_node_file
127 || payload->kind == svn_node_symlink)
129 && ((payload->kind == svn_node_file) == !!payload->text)
130 && ((payload->kind == svn_node_symlink) == !!payload->target)))
135 svn_element__payload_t *
136 svn_element__payload_dup(const svn_element__payload_t *old,
137 apr_pool_t *result_pool)
139 svn_element__payload_t *new_payload;
141 assert(! old || svn_element__payload_invariants(old));
146 new_payload = apr_pmemdup(result_pool, old, sizeof(*new_payload));
147 if (old->branch_ref.branch_id)
148 new_payload->branch_ref.branch_id
149 = apr_pstrdup(result_pool, old->branch_ref.branch_id);
151 new_payload->props = svn_prop_hash_dup(old->props, result_pool);
152 if (old->kind == svn_node_file && old->text)
153 new_payload->text = svn_stringbuf_dup(old->text, result_pool);
154 if (old->kind == svn_node_symlink && old->target)
155 new_payload->target = apr_pstrdup(result_pool, old->target);
160 svn_element__payload_equal(const svn_element__payload_t *left,
161 const svn_element__payload_t *right,
162 apr_pool_t *scratch_pool)
164 apr_array_header_t *prop_diffs;
166 assert(svn_element__payload_invariants(left));
167 assert(svn_element__payload_invariants(right));
169 /* any two subbranch-root elements compare equal */
170 if (left->is_subbranch_root && right->is_subbranch_root)
174 else if (left->is_subbranch_root || right->is_subbranch_root)
179 /* content defined only by reference is not supported */
180 SVN_ERR_ASSERT_NO_RETURN(left->kind != svn_node_unknown
181 && right->kind != svn_node_unknown);
183 if (left->kind != right->kind)
188 svn_error_clear(svn_prop_diffs(&prop_diffs,
189 left->props, right->props,
192 if (prop_diffs->nelts != 0)
201 if (! svn_stringbuf_compare(left->text, right->text))
206 case svn_node_symlink:
207 if (strcmp(left->target, right->target) != 0)
219 svn_element__payload_t *
220 svn_element__payload_create_subbranch(apr_pool_t *result_pool)
222 svn_element__payload_t *new_payload
223 = apr_pcalloc(result_pool, sizeof(*new_payload));
225 new_payload->pool = result_pool;
226 new_payload->is_subbranch_root = TRUE;
227 assert(svn_element__payload_invariants(new_payload));
231 svn_element__payload_t *
232 svn_element__payload_create_ref(svn_revnum_t rev,
233 const char *branch_id,
235 apr_pool_t *result_pool)
237 svn_element__payload_t *new_payload
238 = apr_pcalloc(result_pool, sizeof(*new_payload));
240 new_payload->pool = result_pool;
241 new_payload->kind = svn_node_unknown;
242 new_payload->branch_ref.rev = rev;
243 new_payload->branch_ref.branch_id = apr_pstrdup(result_pool, branch_id);
244 new_payload->branch_ref.eid = eid;
245 assert(svn_element__payload_invariants(new_payload));
249 svn_element__payload_t *
250 svn_element__payload_create_dir(apr_hash_t *props,
251 apr_pool_t *result_pool)
253 svn_element__payload_t *new_payload
254 = apr_pcalloc(result_pool, sizeof(*new_payload));
256 new_payload->pool = result_pool;
257 new_payload->kind = svn_node_dir;
258 new_payload->props = props ? svn_prop_hash_dup(props, result_pool) : NULL;
259 assert(svn_element__payload_invariants(new_payload));
263 svn_element__payload_t *
264 svn_element__payload_create_file(apr_hash_t *props,
265 svn_stringbuf_t *text,
266 apr_pool_t *result_pool)
268 svn_element__payload_t *new_payload
269 = apr_pcalloc(result_pool, sizeof(*new_payload));
271 SVN_ERR_ASSERT_NO_RETURN(text);
273 new_payload->pool = result_pool;
274 new_payload->kind = svn_node_file;
275 new_payload->props = props ? svn_prop_hash_dup(props, result_pool) : NULL;
276 new_payload->text = svn_stringbuf_dup(text, result_pool);
277 assert(svn_element__payload_invariants(new_payload));
281 svn_element__payload_t *
282 svn_element__payload_create_symlink(apr_hash_t *props,
284 apr_pool_t *result_pool)
286 svn_element__payload_t *new_payload
287 = apr_pcalloc(result_pool, sizeof(*new_payload));
289 SVN_ERR_ASSERT_NO_RETURN(target);
291 new_payload->pool = result_pool;
292 new_payload->kind = svn_node_symlink;
293 new_payload->props = props ? svn_prop_hash_dup(props, result_pool) : NULL;
294 new_payload->target = apr_pstrdup(result_pool, target);
295 assert(svn_element__payload_invariants(new_payload));
299 svn_element__content_t *
300 svn_element__content_create(int parent_eid,
302 const svn_element__payload_t *payload,
303 apr_pool_t *result_pool)
305 svn_element__content_t *content
306 = apr_palloc(result_pool, sizeof(*content));
308 content->parent_eid = parent_eid;
309 content->name = apr_pstrdup(result_pool, name);
310 content->payload = svn_element__payload_dup(payload, result_pool);
314 svn_element__content_t *
315 svn_element__content_dup(const svn_element__content_t *old,
316 apr_pool_t *result_pool)
318 svn_element__content_t *content
319 = apr_pmemdup(result_pool, old, sizeof(*content));
321 content->name = apr_pstrdup(result_pool, old->name);
322 content->payload = svn_element__payload_dup(old->payload, result_pool);
327 svn_element__content_equal(const svn_element__content_t *content_left,
328 const svn_element__content_t *content_right,
329 apr_pool_t *scratch_pool)
331 if (!content_left && !content_right)
335 else if (!content_left || !content_right)
340 if (content_left->parent_eid != content_right->parent_eid)
344 if (strcmp(content_left->name, content_right->name) != 0)
348 if (! svn_element__payload_equal(content_left->payload, content_right->payload,
357 svn_element__tree_t *
358 svn_element__tree_create(apr_hash_t *e_map,
360 apr_pool_t *result_pool)
362 svn_element__tree_t *element_tree
363 = apr_pcalloc(result_pool, sizeof(*element_tree));
365 element_tree->e_map = e_map ? apr_hash_copy(result_pool, e_map)
366 : apr_hash_make(result_pool);
367 element_tree->root_eid = root_eid;
371 svn_element__content_t *
372 svn_element__tree_get(const svn_element__tree_t *tree,
375 return svn_eid__hash_get(tree->e_map, eid);
379 svn_element__tree_set(svn_element__tree_t *tree,
381 const svn_element__content_t *element)
383 svn_eid__hash_set(tree->e_map, eid, element);
389 svn_element__tree_purge_orphans(apr_hash_t *e_map,
391 apr_pool_t *scratch_pool)
393 apr_hash_index_t *hi;
394 svn_boolean_t changed;
396 SVN_ERR_ASSERT_NO_RETURN(svn_eid__hash_get(e_map, root_eid));
402 for (hi = apr_hash_first(scratch_pool, e_map);
403 hi; hi = apr_hash_next(hi))
405 int this_eid = svn_eid__hash_this_key(hi);
406 svn_element__content_t *this_element = apr_hash_this_val(hi);
408 if (this_eid != root_eid)
410 svn_element__content_t *parent_element
411 = svn_eid__hash_get(e_map, this_element->parent_eid);
413 /* Purge if parent is deleted */
414 if (! parent_element)
416 svn_eid__hash_set(e_map, this_eid, NULL);
420 SVN_ERR_ASSERT_NO_RETURN(
421 ! parent_element->payload->is_subbranch_root);
429 svn_element__tree_get_path_by_eid(const svn_element__tree_t *tree,
431 apr_pool_t *result_pool)
433 const char *path = "";
434 svn_element__content_t *element;
436 for (; eid != tree->root_eid; eid = element->parent_eid)
438 element = svn_element__tree_get(tree, eid);
441 path = svn_relpath_join(element->name, path, result_pool);
443 SVN_ERR_ASSERT_NO_RETURN(eid == tree->root_eid);
447 svn_element__tree_t *
448 svn_element__tree_get_subtree_at_eid(svn_element__tree_t *element_tree,
450 apr_pool_t *result_pool)
452 svn_element__tree_t *new_subtree;
453 svn_element__content_t *subtree_root_element;
455 new_subtree = svn_element__tree_create(element_tree->e_map, eid,
459 svn_element__tree_purge_orphans(new_subtree->e_map,
460 new_subtree->root_eid, result_pool);
462 /* Remove 'parent' and 'name' attributes from subtree root element */
464 = svn_element__tree_get(new_subtree, new_subtree->root_eid);
465 svn_element__tree_set(new_subtree, new_subtree->root_eid,
466 svn_element__content_create(
467 -1, "", subtree_root_element->payload, result_pool));