static void
st_collections_group_parts_part_insert_before(void)
{
- /* Edje_Part_Collection *pc; */
Edje_Part_Parser *epp;
- char *name;
check_arg_count(1);
- /* pc = eina_list_data_get(eina_list_last(edje_collections)); */
- name = parse_str(0);
epp = (Edje_Part_Parser *)current_part;
- epp->reorder.insert_before = name;
+ epp->reorder.insert_before = parse_str(0);
}
/**
static void
st_collections_group_parts_part_insert_after(void)
{
- /* Edje_Part_Collection *pc; */
Edje_Part_Parser *epp;
- char *name;
check_arg_count(1);
- /* pc = eina_list_data_get(eina_list_last(edje_collections)); */
- name = parse_str(0);
epp = (Edje_Part_Parser *)current_part;
- epp->reorder.insert_after = name;
+ epp->reorder.insert_after = parse_str(0);
}
/**
{
ep = (Edje_Part_Parser *)pc->parts[i];
if (ep->reorder.insert_before && ep->reorder.insert_after)
- ERR("Unable to use together insert_before and insert_after in part \"%s\".", pc->parts[i]->name);
+ error_and_abort(NULL, "In group \"%s\": Unable to use together insert_before and insert_after in part \"%s\".",
+ pc->part, pc->parts[i]->name);
if (ep->reorder.done)
{
if (ep->reorder.insert_before &&
!strcmp(ep->reorder.insert_before, pc->parts[j]->name))
{
- needed_part_exists(pc, ep->reorder.insert_before);
-
ep2 = (Edje_Part_Parser *)pc->parts[j];
if (ep2->reorder.after)
- ERR("The part \"%s\" is ambiguous ordered part.",
- pc->parts[i]->name);
+ error_and_abort(NULL, "In group \"%s\": The part \"%s\" is ambiguous ordered part.",
+ pc->part, pc->parts[i]->name);
if (ep2->reorder.linked_prev)
- ERR("Unable to insert two or more parts in same part \"%s\".",
- pc->parts[j]->name);
+ error_and_abort(NULL, "In group \"%s\": Unable to insert two or more parts in same part \"%s\".",
+ pc->part, pc->parts[j]->name);
/* Need it to be able to insert an element before the first */
if (j == 0) k = 0;
else k = j - 1;
else if (ep->reorder.insert_after &&
!strcmp(ep->reorder.insert_after, pc->parts[j]->name))
{
- needed_part_exists(pc, ep->reorder.insert_after);
-
ep2 = (Edje_Part_Parser *)pc->parts[j];
if (ep2->reorder.before)
- ERR("The part \"%s\" is ambiguous ordered part.", pc->parts[i]->name);
+ error_and_abort(NULL, "In group \"%s\": The part \"%s\" is ambiguous ordered part.",
+ pc->part, pc->parts[i]->name);
if (ep2->reorder.linked_next)
- ERR("Unable to insert two or more parts in same part \"%s\".", pc->parts[j]->name);
+ error_and_abort(NULL, "In group \"%s\": Unable to insert two or more parts in same part \"%s\".",
+ pc->part, pc->parts[j]->name);
k = j;
found = EINA_TRUE;
ep2->reorder.linked_next += ep->reorder.linked_next + 1;
if (((i > k) && ((i - ep->reorder.linked_prev) <= k))
|| ((i < k) && ((i + ep->reorder.linked_next) >= k)))
- ERR("The part order is wrong. It has circular dependency.");
+ error_and_abort(NULL, "In group \"%s\": The part order is wrong. It has circular dependency.", pc->part);
amount = ep->reorder.linked_prev + ep->reorder.linked_next + 1;
linked = i - ep->reorder.linked_prev;
ep->reorder.done = EINA_TRUE;
free(parts);
}
+ else
+ {
+ if (ep->reorder.insert_before)
+ error_and_abort(NULL, "In group \"%s\": Unable to find part \"%s\" for insert_before in part \"%s\".",
+ pc->part, ep->reorder.insert_before, pc->parts[i]->name);
+ else
+ error_and_abort(NULL, "In group \"%s\": Unable to find part \"%s\" for insert_after in part \"%s\".",
+ pc->part, ep->reorder.insert_after, pc->parts[i]->name);
+ }
}
}
}