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 6095325
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 23, 20262026-05-23T12:47:59+00:00 2026-05-23T12:47:59+00:00

I’m refactoring an old C code. The code has absolutely no layered architecture (everything

  • 0

I’m refactoring an old C code. The code has absolutely no layered architecture (everything is being accessed by everything) and I’m trying to change that.

I would like to cut direct access to structure members (at least write for now) and only allow access through access functions. Is there some tool (or perhaps directly the compiler) that could check this rule for me?

I need this since I’m maintaining a fork and the upstream isn’t very concerned with code quality.

  • 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-23T12:47:59+00:00Added an answer on May 23, 2026 at 12:47 pm

    The best way to ensure no new code accesses structures directly is to not make them available using total encapsulation. This comes at the cost of not being able to use a structure on the stack anymore. You provide a function to allocate the structure, another to free it, and all module functions accept a pointer to the structure. However, the definition of the structure itself is in the C file, and not the header file. Another disadvantage is that you may need to write a lot of functions to manipulate/query the structure.

    I will provide snippets from an old code base where I’ve used this approach. The header contains:

    #ifndef INC_QUEUE_H
    #define INC_QUEUE_H
    
    typedef enum {
        QUE_OK,
        QUE_BAD_PARAM,
        QUE_NO_MEMORY,
        QUE_SYS_ERROR
    } QUE_RV;
    
    typedef struct Queue_st Queue_t;
    
    QUE_RV QUE_New(Queue_t **ppQueue);
    QUE_RV QUE_Put(Queue_t *pQueue, int priority, void *pData);
    QUE_RV QUE_Get(Queue_t *pQueue, int *priority, void **ppData);
    void QUE_Free(Queue_t *pQueue);
    
    #endif /* INC_QUEUE_H */
    

    The C file defines the structure Queue_st, and implementations of the functions (heavily modified to highlight the approach):

    #include "queue.h"
    #include "log.h"
    
    #define QUE_INITIAL_CAPACITY 128
    
    struct Queue_st {
        /* SNIP: structure contents go here */
    };
    
    QUE_RV QUE_New(Queue_t **ppQueue)
    {
        QUE_RV rv;
    
        *ppQueue = malloc(sizeof(Queue_t));
    
        /* SNIP: Check malloc, Initialize the structure here ... */
    
        return QUE_OK;
    }
    
    void QUE_Free(Queue_t *pQueue)
    {
        if (pQueue != NULL)
        {
            /* SNIP: Free contents of the structure before the free below... */
            free(pQueue);
        }
    }
    

    An alternative approach is to use typedef struct StructName *StructHandle;, and replace all the pointers in the API with StructHandle. One less * to worry about.


    EDIT: If you want some members visible, and some not, it is also possible with an extension of the above approach. In your header, define:

    typedef struct StructPriv StructPriv;
    
    typedef struct {
        /* public members go here */
    
        StructPriv *private;
    } Struct;
    
    Struct *STRUCT_Create();
    void STRUCT_Free();
    

    In the C file, define the private members, and the functions that manipulate them.

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

Sidebar

Related Questions

I'm parsing an RSS feed that has an ’ in it. SimpleXML turns this
That's pretty much it. I'm using Nokogiri to scrape a web page what has
Basically, what I'm trying to create is a page of div tags, each has
I've got a string that has curly quotes in it. I'd like to replace
I'm trying to create an if statement in PHP that prevents a single post
link Im having trouble converting the html entites into html characters, (&# 8217;) i
I want to count how many characters a certain string has in PHP, but
I am trying to understand how to use SyndicationItem to display feed which is
I have a French site that I want to parse, but am running into
I have this code: - (void)parser:(NSXMLParser *)parser foundCDATA:(NSData *)CDATABlock { NSString *someString = [[NSString

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.