Why is `pLQ->tail` a null pointer?











up vote
0
down vote

favorite












I am working on an a queue and keep running into problems with enqueuing. Here is what I believe to be the relevant code:



typedef struct Qnode QNODE;
struct Qnode
{
int length;
QNODE* next;
QNODE* prev;
};

typedef struct lqueue lQUEUE;
struct lqueue
{
QNODE *head;
QNODE *tail;
};

lQueue lqueue_init_default(void)
{
lQUEUE* pQ = NULL;
pQ = (lQUEUE*)malloc(sizeof(lQUEUE));
if (pQ != NULL)
{
pQ->head = NULL;
pQ->tail = NULL;
}
pQ->head = pQ->tail;
return pQ;
}

Status lqueue_henqueue(lQueue* hLQ, int lc)
{
lQUEUE* pLQ = (lQUEUE*)hLQ;
QNODE* new = (QNODE*)malloc(sizeof(QNODE));
if (new == NULL)
{
printf("Couldn't allocate space.n");
return FAILURE;
}
new->length = lc;
new->next = pLQ->tail->next;

pLQ->tail = new;
return SUCCESS;
}


Whenever I try to run the program, I get this error during run time:

Exception thrown: read access violation.
pLQ->tail was nullptr.

Why is it a null pointer? Does it have to do with the Initialization function?

Here is how it is called:



int cl = 0;//Individual car length
lQueue hLQ = lqueue_init_default();//Handle to the left queue
printf("Enter the length of the lcar:n");
scanf("%d", &cl);
lqueue_henqueue(hLQ, cl);









share|improve this question
























  • You'll have to show how lqueue_henqueue is called
    – P0W
    Nov 11 at 4:43










  • lQueue lqueue_init_default(void) did you forget a * on the return type?
    – StoryTeller
    Nov 11 at 4:50










  • No, because when I do that, I get a compiler error.
    – Nairbnb
    Nov 11 at 4:54















up vote
0
down vote

favorite












I am working on an a queue and keep running into problems with enqueuing. Here is what I believe to be the relevant code:



typedef struct Qnode QNODE;
struct Qnode
{
int length;
QNODE* next;
QNODE* prev;
};

typedef struct lqueue lQUEUE;
struct lqueue
{
QNODE *head;
QNODE *tail;
};

lQueue lqueue_init_default(void)
{
lQUEUE* pQ = NULL;
pQ = (lQUEUE*)malloc(sizeof(lQUEUE));
if (pQ != NULL)
{
pQ->head = NULL;
pQ->tail = NULL;
}
pQ->head = pQ->tail;
return pQ;
}

Status lqueue_henqueue(lQueue* hLQ, int lc)
{
lQUEUE* pLQ = (lQUEUE*)hLQ;
QNODE* new = (QNODE*)malloc(sizeof(QNODE));
if (new == NULL)
{
printf("Couldn't allocate space.n");
return FAILURE;
}
new->length = lc;
new->next = pLQ->tail->next;

pLQ->tail = new;
return SUCCESS;
}


Whenever I try to run the program, I get this error during run time:

Exception thrown: read access violation.
pLQ->tail was nullptr.

Why is it a null pointer? Does it have to do with the Initialization function?

Here is how it is called:



int cl = 0;//Individual car length
lQueue hLQ = lqueue_init_default();//Handle to the left queue
printf("Enter the length of the lcar:n");
scanf("%d", &cl);
lqueue_henqueue(hLQ, cl);









share|improve this question
























  • You'll have to show how lqueue_henqueue is called
    – P0W
    Nov 11 at 4:43










  • lQueue lqueue_init_default(void) did you forget a * on the return type?
    – StoryTeller
    Nov 11 at 4:50










  • No, because when I do that, I get a compiler error.
    – Nairbnb
    Nov 11 at 4:54













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I am working on an a queue and keep running into problems with enqueuing. Here is what I believe to be the relevant code:



typedef struct Qnode QNODE;
struct Qnode
{
int length;
QNODE* next;
QNODE* prev;
};

typedef struct lqueue lQUEUE;
struct lqueue
{
QNODE *head;
QNODE *tail;
};

lQueue lqueue_init_default(void)
{
lQUEUE* pQ = NULL;
pQ = (lQUEUE*)malloc(sizeof(lQUEUE));
if (pQ != NULL)
{
pQ->head = NULL;
pQ->tail = NULL;
}
pQ->head = pQ->tail;
return pQ;
}

Status lqueue_henqueue(lQueue* hLQ, int lc)
{
lQUEUE* pLQ = (lQUEUE*)hLQ;
QNODE* new = (QNODE*)malloc(sizeof(QNODE));
if (new == NULL)
{
printf("Couldn't allocate space.n");
return FAILURE;
}
new->length = lc;
new->next = pLQ->tail->next;

pLQ->tail = new;
return SUCCESS;
}


Whenever I try to run the program, I get this error during run time:

Exception thrown: read access violation.
pLQ->tail was nullptr.

Why is it a null pointer? Does it have to do with the Initialization function?

Here is how it is called:



int cl = 0;//Individual car length
lQueue hLQ = lqueue_init_default();//Handle to the left queue
printf("Enter the length of the lcar:n");
scanf("%d", &cl);
lqueue_henqueue(hLQ, cl);









share|improve this question















I am working on an a queue and keep running into problems with enqueuing. Here is what I believe to be the relevant code:



typedef struct Qnode QNODE;
struct Qnode
{
int length;
QNODE* next;
QNODE* prev;
};

typedef struct lqueue lQUEUE;
struct lqueue
{
QNODE *head;
QNODE *tail;
};

lQueue lqueue_init_default(void)
{
lQUEUE* pQ = NULL;
pQ = (lQUEUE*)malloc(sizeof(lQUEUE));
if (pQ != NULL)
{
pQ->head = NULL;
pQ->tail = NULL;
}
pQ->head = pQ->tail;
return pQ;
}

Status lqueue_henqueue(lQueue* hLQ, int lc)
{
lQUEUE* pLQ = (lQUEUE*)hLQ;
QNODE* new = (QNODE*)malloc(sizeof(QNODE));
if (new == NULL)
{
printf("Couldn't allocate space.n");
return FAILURE;
}
new->length = lc;
new->next = pLQ->tail->next;

pLQ->tail = new;
return SUCCESS;
}


Whenever I try to run the program, I get this error during run time:

Exception thrown: read access violation.
pLQ->tail was nullptr.

Why is it a null pointer? Does it have to do with the Initialization function?

Here is how it is called:



int cl = 0;//Individual car length
lQueue hLQ = lqueue_init_default();//Handle to the left queue
printf("Enter the length of the lcar:n");
scanf("%d", &cl);
lqueue_henqueue(hLQ, cl);






c pointers linked-list queue






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 11 at 4:53

























asked Nov 11 at 4:30









Nairbnb

12




12












  • You'll have to show how lqueue_henqueue is called
    – P0W
    Nov 11 at 4:43










  • lQueue lqueue_init_default(void) did you forget a * on the return type?
    – StoryTeller
    Nov 11 at 4:50










  • No, because when I do that, I get a compiler error.
    – Nairbnb
    Nov 11 at 4:54


















  • You'll have to show how lqueue_henqueue is called
    – P0W
    Nov 11 at 4:43










  • lQueue lqueue_init_default(void) did you forget a * on the return type?
    – StoryTeller
    Nov 11 at 4:50










  • No, because when I do that, I get a compiler error.
    – Nairbnb
    Nov 11 at 4:54
















You'll have to show how lqueue_henqueue is called
– P0W
Nov 11 at 4:43




You'll have to show how lqueue_henqueue is called
– P0W
Nov 11 at 4:43












lQueue lqueue_init_default(void) did you forget a * on the return type?
– StoryTeller
Nov 11 at 4:50




lQueue lqueue_init_default(void) did you forget a * on the return type?
– StoryTeller
Nov 11 at 4:50












No, because when I do that, I get a compiler error.
– Nairbnb
Nov 11 at 4:54




No, because when I do that, I get a compiler error.
– Nairbnb
Nov 11 at 4:54












1 Answer
1






active

oldest

votes

















up vote
0
down vote













Your code is highly prone to undefined behavior... Look at this if statement:



if (pQ != NULL)
{
pQ->head = NULL; // This pointer is now 'NULL'
pQ->tail = NULL; // This is also 'NULL'
}


Which should be this...



if (pQ != NULL)
{
pQ->head = (QNODE*)calloc(1, sizeof(lQUEUE)); // This is proper pointer initialization...
pQ->tail = (QNODE*)calloc(1, sizeof(lQUEUE));
}


And this:



lQueue lqueue_init_default(void)


should be this:



lQueue * lqueue_init_default(void) // Since you are returning a pointer...


You will see that the code works fine because there is no undefined behavior...




Note that you can never access an object that is assigned to NULL... (Only if you don't want your program to behave undefined...) So, this:



pQ->tail = NULL;


is not safe in the very least... Structural pointers being assigned to NULL are usually only seen when being destroyed... An example is given below...






Also, unrelated, but have a destructor for the structure and call it when you don't need the structure anymore, or it will leak the memory afterwards...



void destroy_lqueue(struct lqueue ** queue)
{
if (queue != NULL)
queue = NULL;
free(queue);
}





share|improve this answer























    Your Answer






    StackExchange.ifUsing("editor", function () {
    StackExchange.using("externalEditor", function () {
    StackExchange.using("snippets", function () {
    StackExchange.snippets.init();
    });
    });
    }, "code-snippets");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "1"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245852%2fwhy-is-plq-tail-a-null-pointer%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes








    up vote
    0
    down vote













    Your code is highly prone to undefined behavior... Look at this if statement:



    if (pQ != NULL)
    {
    pQ->head = NULL; // This pointer is now 'NULL'
    pQ->tail = NULL; // This is also 'NULL'
    }


    Which should be this...



    if (pQ != NULL)
    {
    pQ->head = (QNODE*)calloc(1, sizeof(lQUEUE)); // This is proper pointer initialization...
    pQ->tail = (QNODE*)calloc(1, sizeof(lQUEUE));
    }


    And this:



    lQueue lqueue_init_default(void)


    should be this:



    lQueue * lqueue_init_default(void) // Since you are returning a pointer...


    You will see that the code works fine because there is no undefined behavior...




    Note that you can never access an object that is assigned to NULL... (Only if you don't want your program to behave undefined...) So, this:



    pQ->tail = NULL;


    is not safe in the very least... Structural pointers being assigned to NULL are usually only seen when being destroyed... An example is given below...






    Also, unrelated, but have a destructor for the structure and call it when you don't need the structure anymore, or it will leak the memory afterwards...



    void destroy_lqueue(struct lqueue ** queue)
    {
    if (queue != NULL)
    queue = NULL;
    free(queue);
    }





    share|improve this answer



























      up vote
      0
      down vote













      Your code is highly prone to undefined behavior... Look at this if statement:



      if (pQ != NULL)
      {
      pQ->head = NULL; // This pointer is now 'NULL'
      pQ->tail = NULL; // This is also 'NULL'
      }


      Which should be this...



      if (pQ != NULL)
      {
      pQ->head = (QNODE*)calloc(1, sizeof(lQUEUE)); // This is proper pointer initialization...
      pQ->tail = (QNODE*)calloc(1, sizeof(lQUEUE));
      }


      And this:



      lQueue lqueue_init_default(void)


      should be this:



      lQueue * lqueue_init_default(void) // Since you are returning a pointer...


      You will see that the code works fine because there is no undefined behavior...




      Note that you can never access an object that is assigned to NULL... (Only if you don't want your program to behave undefined...) So, this:



      pQ->tail = NULL;


      is not safe in the very least... Structural pointers being assigned to NULL are usually only seen when being destroyed... An example is given below...






      Also, unrelated, but have a destructor for the structure and call it when you don't need the structure anymore, or it will leak the memory afterwards...



      void destroy_lqueue(struct lqueue ** queue)
      {
      if (queue != NULL)
      queue = NULL;
      free(queue);
      }





      share|improve this answer

























        up vote
        0
        down vote










        up vote
        0
        down vote









        Your code is highly prone to undefined behavior... Look at this if statement:



        if (pQ != NULL)
        {
        pQ->head = NULL; // This pointer is now 'NULL'
        pQ->tail = NULL; // This is also 'NULL'
        }


        Which should be this...



        if (pQ != NULL)
        {
        pQ->head = (QNODE*)calloc(1, sizeof(lQUEUE)); // This is proper pointer initialization...
        pQ->tail = (QNODE*)calloc(1, sizeof(lQUEUE));
        }


        And this:



        lQueue lqueue_init_default(void)


        should be this:



        lQueue * lqueue_init_default(void) // Since you are returning a pointer...


        You will see that the code works fine because there is no undefined behavior...




        Note that you can never access an object that is assigned to NULL... (Only if you don't want your program to behave undefined...) So, this:



        pQ->tail = NULL;


        is not safe in the very least... Structural pointers being assigned to NULL are usually only seen when being destroyed... An example is given below...






        Also, unrelated, but have a destructor for the structure and call it when you don't need the structure anymore, or it will leak the memory afterwards...



        void destroy_lqueue(struct lqueue ** queue)
        {
        if (queue != NULL)
        queue = NULL;
        free(queue);
        }





        share|improve this answer














        Your code is highly prone to undefined behavior... Look at this if statement:



        if (pQ != NULL)
        {
        pQ->head = NULL; // This pointer is now 'NULL'
        pQ->tail = NULL; // This is also 'NULL'
        }


        Which should be this...



        if (pQ != NULL)
        {
        pQ->head = (QNODE*)calloc(1, sizeof(lQUEUE)); // This is proper pointer initialization...
        pQ->tail = (QNODE*)calloc(1, sizeof(lQUEUE));
        }


        And this:



        lQueue lqueue_init_default(void)


        should be this:



        lQueue * lqueue_init_default(void) // Since you are returning a pointer...


        You will see that the code works fine because there is no undefined behavior...




        Note that you can never access an object that is assigned to NULL... (Only if you don't want your program to behave undefined...) So, this:



        pQ->tail = NULL;


        is not safe in the very least... Structural pointers being assigned to NULL are usually only seen when being destroyed... An example is given below...






        Also, unrelated, but have a destructor for the structure and call it when you don't need the structure anymore, or it will leak the memory afterwards...



        void destroy_lqueue(struct lqueue ** queue)
        {
        if (queue != NULL)
        queue = NULL;
        free(queue);
        }






        share|improve this answer














        share|improve this answer



        share|improve this answer








        edited Nov 11 at 9:24

























        answered Nov 11 at 8:26









        Ruks

        663111




        663111






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Stack Overflow!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53245852%2fwhy-is-plq-tail-a-null-pointer%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            鏡平學校

            ꓛꓣだゔៀៅຸ໢ທຮ໕໒ ,ໂ'໥໓າ໼ឨឲ៵៭ៈゎゔit''䖳𥁄卿' ☨₤₨こゎもょの;ꜹꟚꞖꞵꟅꞛေၦေɯ,ɨɡ𛃵𛁹ޝ޳ޠ޾,ޤޒޯ޾𫝒𫠁သ𛅤チョ'サノބޘދ𛁐ᶿᶇᶀᶋᶠ㨑㽹⻮ꧬ꧹؍۩وَؠ㇕㇃㇪ ㇦㇋㇋ṜẰᵡᴠ 軌ᵕ搜۳ٰޗޮ޷ސޯ𫖾𫅀ल, ꙭ꙰ꚅꙁꚊꞻꝔ꟠Ꝭㄤﺟޱސꧨꧼ꧴ꧯꧽ꧲ꧯ'⽹⽭⾁⿞⼳⽋២៩ញណើꩯꩤ꩸ꩮᶻᶺᶧᶂ𫳲𫪭𬸄𫵰𬖩𬫣𬊉ၲ𛅬㕦䬺𫝌𫝼,,𫟖𫞽ហៅ஫㆔ాఆఅꙒꚞꙍ,Ꙟ꙱エ ,ポテ,フࢰࢯ𫟠𫞶 𫝤𫟠ﺕﹱﻜﻣ𪵕𪭸𪻆𪾩𫔷ġ,ŧآꞪ꟥,ꞔꝻ♚☹⛵𛀌ꬷꭞȄƁƪƬșƦǙǗdžƝǯǧⱦⱰꓕꓢႋ神 ဴ၀க௭எ௫ឫោ ' េㇷㇴㇼ神ㇸㇲㇽㇴㇼㇻㇸ'ㇸㇿㇸㇹㇰㆣꓚꓤ₡₧ ㄨㄟ㄂ㄖㄎ໗ツڒذ₶।ऩछएोञयूटक़कयँृी,冬'𛅢𛅥ㇱㇵㇶ𥄥𦒽𠣧𠊓𧢖𥞘𩔋цѰㄠſtʯʭɿʆʗʍʩɷɛ,əʏダヵㄐㄘR{gỚṖḺờṠṫảḙḭᴮᵏᴘᵀᵷᵕᴜᴏᵾq﮲ﲿﴽﭙ軌ﰬﶚﶧ﫲Ҝжюїкӈㇴffצּ﬘﭅﬈軌'ffistfflſtffतभफɳɰʊɲʎ𛁱𛁖𛁮𛀉 𛂯𛀞నఋŀŲ 𫟲𫠖𫞺ຆຆ ໹້໕໗ๆทԊꧢꧠ꧰ꓱ⿝⼑ŎḬẃẖỐẅ ,ờỰỈỗﮊDžȩꭏꭎꬻ꭮ꬿꭖꭥꭅ㇭神 ⾈ꓵꓑ⺄㄄ㄪㄙㄅㄇstA۵䞽ॶ𫞑𫝄㇉㇇゜軌𩜛𩳠Jﻺ‚Üမ႕ႌႊၐၸဓၞၞၡ៸wyvtᶎᶪᶹစဎ꣡꣰꣢꣤ٗ؋لㇳㇾㇻㇱ㆐㆔,,㆟Ⱶヤマފ޼ޝަݿݞݠݷݐ',ݘ,ݪݙݵ𬝉𬜁𫝨𫞘くせぉて¼óû×ó£…𛅑הㄙくԗԀ5606神45,神796'𪤻𫞧ꓐ㄁ㄘɥɺꓵꓲ3''7034׉ⱦⱠˆ“𫝋ȍ,ꩲ軌꩷ꩶꩧꩫఞ۔فڱێظペサ神ナᴦᵑ47 9238їﻂ䐊䔉㠸﬎ffiﬣ,לּᴷᴦᵛᵽ,ᴨᵤ ᵸᵥᴗᵈꚏꚉꚟ⻆rtǟƴ𬎎

            Why https connections are so slow when debugging (stepping over) in Java?