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 a question.

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

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 571289
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T13:29:29+00:00 2026-05-13T13:29:29+00:00

I want to ‘construct’ (read: malloc and memset) my hashtable in c. To do

  • 0

I want to ‘construct’ (read: malloc and memset) my hashtable in c. To do this, I created a function as follows:

int maketable(struct hash_entry **table, int size){

    table = (struct hash_entry **)malloc(size*sizeof(struct hash_entry *));
    int i = 0;
    for (; i<size; i++) {
        memset(table[i], '\0', sizeof(struct hash_entry *));
    }
    return 0;

}

Given that table will have been declared as

struct hash_entry **table[size]

before entering this code, I won’t lose anything when I return from maketable, right?

EDIT:
Does passing table into maketable() ensure that as long as I change the data that table points to, the changes will be preserved?

EDIT II:
I am trying to allocate an array of pointers to pointers to hash_entries

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T13:29:29+00:00Added an answer on May 13, 2026 at 1:29 pm

    Your code is assigning to the local table variable, the caller is not affected. This results in a memory leak.

    Outside the function, you have declared table as an array of pointer to pointers of struct hash_entry – I’m guessing you rather just want an array of pointers to struct hash entries.

    If you actually declare table as an array, there’s no need to malloc that space. You just need a loop to set every element in it to NULL (Don’t memset each element to zeroes).

    If the goal is to allocate the entire table, this is perhps what you’re looking for:

    struct hash_entry **table;
    ...
    int maketable(struct hash_entry ***table, int size){
    
        *table = malloc(size* sizeof **table);
        int i = 0;
        for (; i<size; i++) {
           (*table)[i] = NULL;
        }
        return 0;
    }
    

    call it like

    maketable(&table,100);
    

    I’d rather make that return the table like so:

    struct hash_entry ** maketable(int size){
       return calloc(size, sizeof(struct hash_entry *));
    }
    

    if the declaration struct hash_entry **table[size] is really what you want, you need to tell us what your maketable() function actually is supposed to do (e.g. do you want to a dynamically allocated ‘array’ as one of the elements in that table ?

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

Sidebar

Related Questions

Want to do this: (EDIT: bad sample code, ignore and skip below) struct RECORD
Want the function to sort the table by HP but if duplicate HPs then
want to fetch the value from dynamically created textfield with tag from NSMutableArray.... Txt_New_Estimated
Want to verify that my understanding of how this works. Have a C++ Class
Want to just confirm on following. Please verify if this is correct: 1. As
want to drag element to specific div and if not dragged to this div
Want to check if this a good example for representing the abstract factory pattern.
Want to find one and modify that to read, write file on mongoDB gridfs
Want to do a checkboxes for has_many :through. Railscast in 2007 recommends this: check_box_tag
want to access select list where id starts with sentidd $('.select[id^=sentidd]').change(function() {} It fails.

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

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.