crypto/asn1/x_name.c:232: error: MEMORY_LEAK
  memory dynamically allocated to `c.line` by call to `malloc()` at line 230, column 2 is not reachable after line 232, column 5.
Showing all 11 steps of the trace


crypto/asn1/x_name.c:225:1: start of procedure X509_NAME_new()
223.   	}
224.   
225. > X509_NAME *X509_NAME_new(void)
226.   	{
227.   	X509_NAME *ret=NULL;

crypto/asn1/x_name.c:227:2: 
225.   X509_NAME *X509_NAME_new(void)
226.   	{
227. > 	X509_NAME *ret=NULL;
228.   	ASN1_CTX c;
229.   

crypto/asn1/x_name.c:230:2: Taking false branch
228.   	ASN1_CTX c;
229.   
230.   	M_ASN1_New_Malloc(ret,X509_NAME);
        ^
231.   	if ((ret->entries=sk_new(NULL)) == NULL)
232.   		{ c.line=__LINE__; goto err2; }

crypto/asn1/x_name.c:231:6: 
229.   
230.   	M_ASN1_New_Malloc(ret,X509_NAME);
231. > 	if ((ret->entries=sk_new(NULL)) == NULL)
232.   		{ c.line=__LINE__; goto err2; }
233.   	M_ASN1_New(ret->bytes,BUF_MEM_new);

crypto/stack/stack.c:117:1: start of procedure sk_new()
  115.   	}
  116.   
  117. > STACK *sk_new(int (*c)())
  118.   	{
  119.   	STACK *ret;

crypto/stack/stack.c:122:6: Taking true branch
  120.   	int i;
  121.   
  122.   	if ((ret=(STACK *)Malloc(sizeof(STACK))) == NULL)
              ^
  123.   		goto err0;
  124.   	if ((ret->data=(char **)Malloc(sizeof(char *)*MIN_NODES)) == NULL)

crypto/stack/stack.c:135:1: 
  133.   err1:
  134.   	Free((char *)ret);
  135. > err0:
  136.   	return(NULL);
  137.   	}

crypto/stack/stack.c:136:2: 
  134.   	Free((char *)ret);
  135.   err0:
  136. > 	return(NULL);
  137.   	}
  138.   

crypto/stack/stack.c:137:2: return from a call to sk_new
  135.   err0:
  136.   	return(NULL);
  137.   	}
          ^
  138.   
  139.   int sk_insert(STACK *st, char *data, int loc)

crypto/asn1/x_name.c:231:6: Taking true branch
229.   
230.   	M_ASN1_New_Malloc(ret,X509_NAME);
231.   	if ((ret->entries=sk_new(NULL)) == NULL)
            ^
232.   		{ c.line=__LINE__; goto err2; }
233.   	M_ASN1_New(ret->bytes,BUF_MEM_new);

crypto/asn1/x_name.c:232:5: 
230.   	M_ASN1_New_Malloc(ret,X509_NAME);
231.   	if ((ret->entries=sk_new(NULL)) == NULL)
232. > 		{ c.line=__LINE__; goto err2; }
233.   	M_ASN1_New(ret->bytes,BUF_MEM_new);
234.   	ret->modified=1;

X509_NAME *X509_NAME_new(void)
	{
	X509_NAME *ret=NULL;
	ASN1_CTX c;
	M_ASN1_New_Malloc(ret,X509_NAME);
	if ((ret->entries=sk_new(NULL)) == NULL)
		{ c.line=__LINE__; goto err2; }
	M_ASN1_New(ret->bytes,BUF_MEM_new);
	ret->modified=1;
	return(ret);
	M_ASN1_New_Error(ASN1_F_X509_NAME_NEW);
	}
['X509_NAME *X509_NAME_new(void)\n\t{\n\tX509_NAME *ret=NULL;\n\tASN1_CTX c;\n\tM_ASN1_New_Malloc(ret,X509_NAME);\n\tif ((ret->entries=sk_new(NULL)) == NULL)\n\t\t{ c.line=__LINE__; goto err2; }\n\tM_ASN1_New(ret->bytes,BUF_MEM_new);\n\tret->modified=1;\n\treturn(ret);\n\tM_ASN1_New_Error(ASN1_F_X509_NAME_NEW);\n\t}', 'STACK *sk_new(int (*c)())\n\t{\n\tSTACK *ret;\n\tint i;\n\tif ((ret=(STACK *)Malloc(sizeof(STACK))) == NULL)\n\t\tgoto err0;\n\tif ((ret->data=(char **)Malloc(sizeof(char *)*MIN_NODES)) == NULL)\n\t\tgoto err1;\n\tfor (i=0; i<MIN_NODES; i++)\n\t\tret->data[i]=NULL;\n\tret->comp=c;\n\tret->num_alloc=MIN_NODES;\n\tret->num=0;\n\tret->sorted=0;\n\treturn(ret);\nerr1:\n\tFree((char *)ret);\nerr0:\n\treturn(NULL);\n\t}']