summaryrefslogtreecommitdiff
path: root/src/lib/eet
diff options
context:
space:
mode:
authorMike Blumenkrantz <zmike@samsung.com>2018-06-29 11:36:12 -0400
committerMike Blumenkrantz <zmike@samsung.com>2018-06-29 11:36:13 -0400
commit8f7170bfad8ecfb3241c28cb564cd704458b4acc (patch)
tree09d7c9bc207c6d45d51b5cab3216dd53aa4040e1 /src/lib/eet
parentd2e631586c768fedb795730e64739612d283e2b9 (diff)
eet: set parent struct member when adding a child to a parent node
Summary: this relation can be retrieved with eet_node_parent_get() but is never set internally fix T4600 @fix Reviewers: artem.popov, devilhorns, Hermet, vtorri Reviewed By: Hermet Subscribers: Hermet, cedric, #committers Tags: #efl Maniphest Tasks: T4600 Differential Revision: https://phab.enlightenment.org/D6336
Diffstat (limited to 'src/lib/eet')
-rw-r--r--src/lib/eet/eet_node.c4
1 files changed, 4 insertions, 0 deletions
diff --git a/src/lib/eet/eet_node.c b/src/lib/eet/eet_node.c
index 76c705a299..fa203f2ea8 100644
--- a/src/lib/eet/eet_node.c
+++ b/src/lib/eet/eet_node.c
@@ -275,6 +275,7 @@ eet_node_list_append(Eet_Node *parent,
275 } 275 }
276 276
277 child->next = NULL; 277 child->next = NULL;
278 child->parent = parent;
278 279
279 eina_stringshare_del(tmp); 280 eina_stringshare_del(tmp);
280 281
@@ -287,6 +288,7 @@ eet_node_list_append(Eet_Node *parent,
287 /* And add it to the parent. */ 288 /* And add it to the parent. */
288 nn->next = parent->values; 289 nn->next = parent->values;
289 parent->values = nn; 290 parent->values = nn;
291 child->parent = parent;
290 292
291 eina_stringshare_del(tmp); 293 eina_stringshare_del(tmp);
292} 294}
@@ -336,6 +338,7 @@ eet_node_struct_append(Eet_Node *parent,
336 child->next = NULL; 338 child->next = NULL;
337 parent->values = child; 339 parent->values = child;
338 } 340 }
341 child->parent = parent;
339 342
340 eina_stringshare_del(tmp); 343 eina_stringshare_del(tmp);
341} 344}
@@ -356,6 +359,7 @@ eet_node_hash_add(Eet_Node *parent,
356 /* And add it to the parent. */ 359 /* And add it to the parent. */
357 nn->next = parent->values; 360 nn->next = parent->values;
358 parent->values = nn; 361 parent->values = nn;
362 child->parent = parent;
359} 363}
360 364
361int 365int