Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask question.(5)

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

ITtutoria

ITtutoria Logo ITtutoria Logo

ITtutoria Navigation

  • Python
  • Java
  • Reactjs
  • JavaScript
  • R
  • PySpark
  • MYSQL
  • Pandas
  • QA
  • C++
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Python
  • Science
  • Java
  • JavaScript
  • Reactjs
  • Nodejs
  • Tools
  • QA
Home/ Questions/Stabilizing the error with the best answers: double free or corruption (fasttop)
Next
In Process
Sawyer Byrne
  • 18
Sawyer Byrne
Asked: May 17, 20222022-05-17T14:33:17+00:00 2022-05-17T14:33:17+00:00In: c

Stabilizing the error with the best answers: double free or corruption (fasttop)

  • 18

. Advertisement .

..3..

. Advertisement .

..4..

I have the following c code, but I do not know how to find the correct result. Why has this problem occurred, and how can it be solved? Here is the code that I am running:

bool found= false;
 int x=0;
 for ( x=0; x<=312500; x++)
 {
  while (count <=32)
  {
  fscanf (file, "%d", &temp->num); 
 
  temp->ptr=NULL;
 
  newNode = (NODE *)malloc(sizeof(NODE));
  newNode->num=temp->num;
  newNode->ptr=NULL;
 
  if (first != NULL)
  {
  temp2=(NODE *)malloc(sizeof(NODE));
 
  temp2=first;
  while (temp2 != NULL && !found)
  {
  if (temp2->num == newNode->num) 
  {found=true;}
 
  temp2= temp2->ptr;
  }
 
  free(temp2);
 
  if (!found)
  { 
  last->ptr=newNode;
  last=newNode;
  count=count+1;
  } 
  } 
  else 
  {
  first = newNode;
  last = newNode;
  count=count+1;
  }
 
  fflush(stdin);
  }

And this is the error text I receive:

* glibc detected ./a.out: double free or corruption (fasttop): 0x08e065d0 **
corruption (fasttop)
  • 1 1 Answer
  • 62 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook
  • Report

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. hdtutoria Expert
    2022-06-27T02:44:13+00:00Added an answer on June 27, 2022 at 2:44 am

    The cause: I think here’s the issue:

    temp2=first;

    In essence, you free temp2 first, not the memory that was allocated here:

    temp2=(NODE *)malloc(sizeof(NODE));

    ,which is still a memory leak because it cannot be released after the assignment.

    Additionally, your code probably has other issues (for example, you shouldn’t use fflush on an input stream), but it’s tough to determine without additional information.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

Sidebar

Ask A Question
  • How to Split String by space in C++
  • How To Convert A Pandas DataFrame Column To A List
  • How to Replace Multiple Characters in A String in Python?
  • How To Remove Special Characters From String Python

Explore

  • Home
  • Tutorial

Footer

ITtutoria

ITtutoria

This website is user friendly and will facilitate transferring knowledge. It would be useful for a self-initiated learning process.

@ ITTutoria Co Ltd.

Tutorial

  • Home
  • Python
  • Science
  • Java
  • JavaScript
  • Reactjs
  • Nodejs
  • Tools
  • QA

Legal Stuff

  • About Us
  • Terms of Use
  • Privacy Policy
  • Contact Us

DMCA.com Protection Status

Help

  • Knowledge Base
  • Support

Follow

© 2022 Ittutoria. All Rights Reserved.

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.