Sorting error cornercase with invalid two choices, and also sort attributes first.
This commit is contained in:
parent
b31297cb21
commit
e1bccfa2a7
5 changed files with 45 additions and 15 deletions
|
|
@ -1130,8 +1130,9 @@ _json_parse(char *str,
|
|||
cxobj *x;
|
||||
cbuf *cberr = NULL;
|
||||
int i;
|
||||
int failed = 0; /* yang assignment */
|
||||
|
||||
clicon_debug(1, "%s %s", __FUNCTION__, str);
|
||||
clicon_debug(1, "%s %d %s", __FUNCTION__, yb, str);
|
||||
jy.jy_parse_string = str;
|
||||
jy.jy_linenum = 1;
|
||||
jy.jy_current = xt;
|
||||
|
|
@ -1174,12 +1175,16 @@ _json_parse(char *str,
|
|||
case YB_NONE:
|
||||
break;
|
||||
case YB_PARENT:
|
||||
if (xml_spec_populate0_parent(x, NULL) < 0)
|
||||
if ((ret = xml_spec_populate0_parent(x, xerr)) < 0)
|
||||
goto done;
|
||||
if (ret == 0)
|
||||
failed++;
|
||||
break;
|
||||
case YB_TOP:
|
||||
if (xml_spec_populate0(x, yspec, NULL) < 0)
|
||||
if (xml_spec_populate0(x, yspec, xerr) < 0)
|
||||
goto done;
|
||||
if (ret == 0)
|
||||
failed++;
|
||||
break;
|
||||
}
|
||||
/* Now find leafs with identityrefs (+transitive) and translate
|
||||
|
|
@ -1191,7 +1196,7 @@ _json_parse(char *str,
|
|||
}
|
||||
if (xml_apply0(xt, CX_ELMNT, xml_sort, NULL) < 0)
|
||||
goto done;
|
||||
retval = 1;
|
||||
retval = (failed==0) ? 1 : 0;
|
||||
done:
|
||||
clicon_debug(1, "%s retval:%d", __FUNCTION__, retval);
|
||||
if (cberr)
|
||||
|
|
|
|||
|
|
@ -196,9 +196,22 @@ xml_cmp(cxobj *x1,
|
|||
int nr2 = 0;
|
||||
cxobj *x1b;
|
||||
cxobj *x2b;
|
||||
enum cxobj_type xt1;
|
||||
enum cxobj_type xt2;
|
||||
|
||||
if (x1==NULL || x2==NULL)
|
||||
goto done; /* shouldnt happen */
|
||||
/* Sort according to attributes first */
|
||||
if ((xt1 = xml_type(x1)) != (xt2 = xml_type(x2))){
|
||||
if (xt1 == CX_ATTR){
|
||||
equal = -1;
|
||||
goto done;
|
||||
}
|
||||
else if (xt2 == CX_ATTR){
|
||||
equal = 1;
|
||||
goto done;
|
||||
}
|
||||
}
|
||||
y1 = xml_spec(x1);
|
||||
y2 = xml_spec(x2);
|
||||
if (same){
|
||||
|
|
@ -301,10 +314,14 @@ xml_cmp(cxobj *x1,
|
|||
} /* while cvi */
|
||||
break;
|
||||
default:
|
||||
/* This is a very special case such as for two choices - which is not validation correct, but we
|
||||
should sort them according to nr1, nr2 since their yang is equal order */
|
||||
if (same)
|
||||
equal = nr1-nr2;
|
||||
break;
|
||||
} /* switch */
|
||||
done:
|
||||
clicon_debug(2, "%s %s %s %d nr: %d %d yi: %d %d", __FUNCTION__, xml_name(x1), xml_name(x2), equal, nr1, nr2, yi1, yi2);
|
||||
clicon_debug(2, "%s %s %s eq:%d nr: %d %d yi: %d %d", __FUNCTION__, xml_name(x1), xml_name(x2), equal, nr1, nr2, yi1, yi2);
|
||||
return equal;
|
||||
}
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue