move=RIGHT;
continue;
}
- else p=asn1_find_up(p);
+ else p=_asn1_find_up(p);
move=UP;
}
if(move==UP){
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
*len=counter;
p2=NULL;
if(p!=node){
p2=_asn1_find_left(p);
- if(!p2) p2=asn1_find_up(p);
+ if(!p2) p2=_asn1_find_up(p);
}
asn1_delete_structure(&p);
p=p2;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==node){
p=NULL;
break;
ris=ASN1_SUCCESS;
if(move!=UP){
if(p->type&CONST_SET){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(len2==-1){
if(!der[counter] && !der[counter+1]){
}
if((p->type&CONST_OPTION) || (p->type&CONST_DEFAULT)){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(counter==len2){
if(p->right){
}
if((p->type&CONST_OPTION) || (p->type&CONST_DEFAULT)){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if((len2!=-1) && (counter>len2)) ris=ASN1_TAG_ERROR;
}
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
_asn1_delete_not_used(*element);
if(move!=UP){
if(p->type&CONST_SET){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(counter==len2){
p=p2;
}
if((p->type&CONST_OPTION) || (p->type&CONST_DEFAULT)){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(counter==len2){
if(p->right){
}
if((p->type&CONST_OPTION) || (p->type&CONST_DEFAULT)){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(counter>len2) ris=ASN1_TAG_ERROR;
}
}
if(move==UP){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(state != FOUND){
dot_p=char_p=currentName;
if(move!=UP){
if(p->type&CONST_SET){
- p2=asn1_find_up(p);
+ p2=_asn1_find_up(p);
len2=strtol(p2->value,NULL,10);
if(len2==-1){
if(!der[counter] && !der[counter+1]){
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
return ASN1_ELEMENT_NOT_FOUND;
break;
}
- p3=asn1_find_up(p);
+ p3=_asn1_find_up(p);
if(!p3){
retCode=ASN1_ERROR_TYPE_ANY;
if((!p3) || (type_field(p3->type)!=TYPE_OBJECT_ID) ||
(p3->value==NULL)){
- p3=asn1_find_up(p);
- p3=asn1_find_up(p3);
+ p3=_asn1_find_up(p);
+ p3=_asn1_find_up(p3);
if(!p3){
retCode=ASN1_ERROR_TYPE_ANY;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==*element){
p=NULL;
break;
_asn1_str_cat(name,name_size,".");
_asn1_str_cat(name,name_size,tmp_name);
}
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
}
if(name[0]==0) _asn1_str_cpy(name,name_size,"ROOT");
_asn1_free(node);
}
-/**
- * asn1_find_up:
- * @node: NODE_ASN element pointer.
- *
- * Return the father of the NODE_ASN element.
- *
- * Return value: Return the father of the node, or %NULL if not found.
- **/
-ASN1_TYPE
-asn1_find_up(ASN1_TYPE node)
+/******************************************************************/
+/* Function : __asn1_find_up */
+/* Description: return the father of the NODE_ASN element. */
+/* Parameters: */
+/* node: NODE_ASN element pointer. */
+/* Return: Null if not found. */
+/******************************************************************/
+node_asn *
+__asn1_find_up(node_asn *node)
{
node_asn *p;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==node){
p=NULL;
break;
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
return ASN1_SUCCESS;
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
return ASN1_SUCCESS;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==node){
p=NULL;
break;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==node){
p=NULL;
break;
}
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==pointer){
p=NULL;
break;
while(1){
if(p_last==*definitions) break;
- p_last= asn1_find_up(p_last);
+ p_last= _asn1_find_up(p_last);
if(p_last==NULL) break;
else{ /* no down */
p2=p->right;
if(p!=*structure){
- p3=asn1_find_up(p);
+ p3=_asn1_find_up(p);
_asn1_set_down(p3,p2);
_asn1_remove_node(p);
p=p3;
else{ /* p==root */
p3=_asn1_find_left(p);
if(!p3){
- p3=asn1_find_up(p);
+ p3=_asn1_find_up(p);
if(p3) _asn1_set_down(p3,p2);
else{
if(p->right) p->right->left=NULL;
p2=source_node->right;
p3=_asn1_find_left(source_node);
if(!p3){
- p3=asn1_find_up(source_node);
+ p3=_asn1_find_up(source_node);
if(p3)
_asn1_set_down(p3,p2);
else
else move=UP;
}
if(move==UP){
- p_s=asn1_find_up(p_s);
- p_d=asn1_find_up(p_d);
+ p_s=_asn1_find_up(p_s);
+ p_d=_asn1_find_up(p_d);
}
}while(p_s!=source_node);
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
return ASN1_SUCCESS;
p3=_asn1_find_left(p);
if(p3) _asn1_set_right(p3,p2);
else{
- p3=asn1_find_up(p);
+ p3=_asn1_find_up(p);
if(p3) _asn1_set_down(p3,p2);
else {
p2->left=NULL;
if(p->right) p=p->right;
else move=UP;
}
- if(move==UP) p=asn1_find_up(p);
+ if(move==UP) p=_asn1_find_up(p);
}
return ASN1_SUCCESS;
else if(p->right) p=p->right;
else{
while(1){
- p=asn1_find_up(p);
+ p=_asn1_find_up(p);
if(p==root){
p=NULL;
break;