What is this exception and how do I remove it? I keep getting it at glutmainloop

Question

0.00/5 (No votes)

See more:

hi , i have code for openGL project but i get this exception "

Quote:
Access violation writing location 0x000000D4.

here is the code

#include<stdio.h>
#include<conio.h>
#include<process.h>
#include<stdlib.h>
#include <Windows.h>
#include <GL\glew.h>
#include <GL\freeglut.h>
#include <iostream>
void renderscene()
{

	glClear(GL_COLOR_BUFFER_BIT);
	glColor3f(1.0, 0.3, 0.0);

	char c1[] = "COMPUTER GRAPHICS PROJECT";
	glRasterPos2f(600, 375);
	for (int i = 0; c1[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c1[i]);

	char c2[] = "NAME:";
	glRasterPos2f(700.0, 350.0);
	for (int i = 0; c2[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c2[i]);

	char c3[] = "COLLEGE:";
	glRasterPos2f(700.0, 325.0);
	for (int i = 0; c3[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c3[i]);

	char c4[] = "";
	glRasterPos2f(700.0, 300.0);
	for (int i = 0; c4[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c4[i]);

	char c5[] = "Press right button of mouse to get various options";
	glRasterPos2f(300.0, 200.0);
	for (int i = 0; c5[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c5[i]);
	glFlush();

}


void init()
{
	glClearColor(1.0, 1.0, 1.0, 0.0);
	glColor3f(0.0f, 0.0f, 0.0f);
	glPointSize(0.8);
	glMatrixMode(GL_PROJECTION);
	glLoadIdentity();
	gluOrtho2D(0.0, 2000.0, 0.0, 400.0);
}
struct node
{
	int info;
	struct node *rlink;
	struct node *llink;
};
typedef struct node *NODE;
static int count = 0;
NODE head;
int h[100];
struct arr
{
	int p;
	int q;
}m[100];

NODE getnode()
{
	NODE temp;
	temp = (NODE)malloc(sizeof(struct node));
	if (temp == NULL)
	{
		printf("out of memory\n");
		exit(1);
	}
	return temp;
}
void disp()
{
	glClear(GL_COLOR_BUFFER_BIT);
	glColor3f(1.0, 0.0, 1.0);
	char c[] = "List is Empty";
	glRasterPos2f(800.0, 200.0);
	for (int i = 0; c[i] != '\0'; i++)
		glutBitmapCharacter(GLUT_BITMAP_HELVETICA_18, c[i]);
	glColor3f(1.0, 1.0, 1.0);
	glBegin(GL_POLYGON);
	glVertex2i(100, 200);
	glVertex2i(100, 225);
	glVertex2i(500, 225);
	glVertex2i(500, 200);
	glEnd();
	glFlush();
}
NODE display(NODE head)
{
	glClear(GL_COLOR_BUFFER_BIT);
	NODE temp;
	int i = 0, k, j = 0;
	temp = head->rlink;
	if (temp == head)
	{
		printf(" list is empty\n");
		disp();
		return head;

	}
	printf("elements are\n");

	while (temp != head)
	{
		for (k = 0; k<count; k++)
		{
			GLfloat x1 = 100, x2 = 150, x3 = 350, x4 = 400, x5 = 500, x6 = 480, x7 = 20, x9 = 0;
			h[j] = temp->info;
			printf("%d\n", h[j]);
			glColor3f(0.0, 0.0, 0.0);
			char c[] = "Info";
			glRasterPos2f(220.0, 230.0);
			for (int a = 0; c[a] != '\0'; a++)
				glutBitmapCharacter(GLUT_BITMAP_HELVETICA_10, c[a]);
			glColor3f(1.0, 0.0, 0.0);
			glBegin(GL_POLYGON);
			glVertex2i(x2 + k * 400, 200);
			glVertex2i(x2 + k * 400, 225);
			glVertex2i(x3 + k * 400, 225);
			glVertex2i(x3 + k * 400, 200);
			glEnd();
			glColor3f(0.0, 0.0, 0.0);
			char r[] = "rlink";
			glRasterPos2f(355.0, 230.0);
			for (int b = 0; r[b] != '\0'; b++)
				glutBitmapCharacter(GLUT_BITMAP_HELVETICA_10, r[b]);
			glColor3f(0.0, 0.0, 1.0);
			glBegin(GL_POLYGON);
			glVertex2i(x3 + k * 400, 225);
			glVertex2i(x3 + k * 400, 200);
			glVertex2i(x4 + k * 400, 200);
			glVertex2i(x4 + k * 400, 225);
			glEnd();
			glColor3f(0.0, 0.0, 0.0);
			char s[] = "llink";
			glRasterPos2f(120.0, 230.0);
			for (int d = 0; s[d] != '\0'; d++)
				glutBitmapCharacter(GLUT_BITMAP_HELVETICA_10, s[d]);
			glColor3f(0.0, 1.0, 0.0);
			glBegin(GL_POLYGON);
			glVertex2i(x1 + k * 400, 225);
			glVertex2i(x1 + k * 400, 200);
			glVertex2i(x2 + k * 400, 200);
			glVertex2i(x2 + k * 400, 225);
			glEnd();
			glColor3f(0.0, 1.0, 0.0);
			glBegin(GL_LINES);
			glVertex2i(x1 + k * 400, 207);
			glVertex2i(x9 + k * 400, 207);
			glVertex2i(x9 + k * 400, 207);
			glVertex2i(x7 + k * 400, 202);
			glVertex2i(x9 + k * 400, 207);
			glVertex2i(x7 + k * 400, 210);
			glColor3f(0.0, 0.0, 1.0);
			glBegin(GL_LINES);
			glVertex2i(x4 + k * 400, 215);
			glVertex2i(x5 + k * 400, 215);
			glVertex2i(x5 + k * 400, 215);
			glVertex2i(x6 + k * 400, 210);
			glVertex2i(x5 + k * 400, 215);
			glVertex2i(x6 + k * 400, 219);
			glEnd();
			m[i].p = h[j] / 10;
			m[i].q = h[j] % 10;
			m[i].p = m[i].p + 48;
			m[i].q = m[i].q + 48;
			int x8 = 225;
			glColor3f(0.0, 0.0, 0.0);
			glRasterPos2i(x8 + k * 400, 210);
			glutBitmapCharacter(GLUT_BITMAP_HELVETICA_12, m[i].p);
			glutBitmapCharacter(GLUT_BITMAP_HELVETICA_12, m[i].q);
			i++;
			j++;
			temp = temp->rlink;
			glFlush();
		}
	}
	return head;
}
NODE insertfront(NODE head, int item)
{
	NODE temp, cur;
	temp = getnode();
	temp->info = item;
	cur = head->rlink;
	head->rlink = temp;
	temp->llink = head;
	temp->rlink = cur;
	cur->llink = temp;
	return head;

}
NODE insertrear(NODE head, int item)
{
	NODE temp, cur;
	temp = getnode();
	temp->info = item;
	cur = head->llink;
	head->llink = temp;
	temp->rlink = head;
	temp->llink = cur;
	cur->rlink = temp;
	return head;
}
NODE insertleft(NODE head, int ele)
{
	int item;
	NODE temp, cur, pre;
	if (head->rlink == head)
	{
		printf("list is empty\n");
		count--;
		return head;
	}
	cur = head->rlink;
	while (cur != head)
	{
		if (cur->info == ele)
			break;
		cur = cur->rlink;
	}
	if (cur == head)
	{
		printf("%d element not found\n", ele);
		count--;
		return head;
	}
	printf("enter element to be inserted\n");
	scanf_s("%d", &item);
	pre = cur->llink;
	temp = getnode();
	temp->info = item;
	temp->llink = pre;
	temp->rlink = cur;
	cur->llink = temp;
	pre->rlink = temp;
	return head;

}
NODE insertright(NODE head, int ele)
{
	int item;
	glClear(GL_COLOR_BUFFER_BIT);
	NODE temp, cur, next;
	if (head->rlink == head)
	{
		printf("list is empty\n");
		count--;
		return head;
	}
	cur = head->rlink;
	while (cur != head)
	{
		if (cur->info == ele)
		{
			printf("enter element to be inserted\n");
			scanf_s("%d", &item);
			next = cur->rlink;
			temp = getnode();
			temp->info = item;
			temp->llink = cur;
			temp->rlink = next;
			cur->rlink = temp;
			next->llink = temp;
			return head;
		}
		cur = cur->rlink;
	}
	printf("%d element not found\n", ele);
	count--;
	return head;
}
NODE deletfront(NODE head)
{
	NODE cur, next;
	if (head->rlink == head)
	{
		printf("list is empty\n");
		count++;
		return head;
	}
	cur = head->rlink;
	next = cur->rlink;
	head->rlink = next;
	next->llink = head;
	printf("node to b deleted is %d\n", cur->info);
	free(cur);
	return head;
}
NODE deletrear(NODE head)
{
	NODE cur, prev;
	if (head->llink == head)
	{
		printf("list is empty\n");
		count++;
		return head;
	}
	cur = head->llink;
	prev = cur->llink;
	head->llink = prev;
	prev->rlink = head;
	printf("node to b deleted is %d\n", cur->info);
	free(cur);
	return head;
}

NODE del(NODE head, int ele)
{
	NODE cur, next, pre;
	glClear(GL_COLOR_BUFFER_BIT);
	if (head->rlink == head)
	{
		printf("list is empty\n");
		count++;
		return head;
	}
	cur = head->rlink;
	while (cur != head)
	{
		if (cur->info == ele)
			break;
		cur = cur->rlink;
	}
	if (cur == head)
	{
		printf("%d element not found\n", ele);
		count++;
		return head;
	}
	pre = cur->llink;
	next = cur->rlink;
	printf("%d element found and deleted\n", ele);
	pre->rlink = next;
	next->llink = pre;
	free(cur);
	return head;

}


void top_menu(int option)
{
	int ele;
	switch (option)
	{
	case 1:

		printf("enter item to be inserted\n");
		scanf_s("%d", &ele);
		head = insertfront(head, ele);
		count++;
		display(head);
		break;
	case 2:
		printf("enter item to be inserted\n");
		scanf_s("%d", &ele);
		head = insertrear(head, ele);
		count++;
		display(head);
		break;
	case 3:
		printf("enter key to be searched\n");
		scanf_s("%d", &ele);
		head = insertleft(head, ele);
		count++;
		display(head);
		break;
	case 4:
		printf("enter key to be searched\n");
		scanf_s("%d", &ele);
		head = insertright(head, ele);
		count++;
		display(head);
		break;
	case 5:
		head = deletfront(head);
		count--;
		display(head);
		break;
	case 6:
		head = deletrear(head);
		count--;
		display(head);
		break;
	case  7:printf("enter key\n");
		scanf_s("%d", &ele);
		count--;
		head = del(head, ele);
		display(head);
		break;
	case 8:exit(0);
	}
}
void main(int argc, char**argv)
{
	head = getnode();
	head->rlink = head;
	head->llink = head;
	head->info = NULL;
	glutInit(&argc, argv);
	glutInitDisplayMode(GLUT_SINGLE | GLUT_RGB);
	glutInitWindowSize(700, 500);
	glutInitWindowPosition(0, 0);
	glutCreateWindow("Doubly Linked List");
	glutCreateMenu(top_menu);
	glutAddMenuEntry("InsertFront", 1);
	glutAddMenuEntry("InsertRear", 2);
	glutAddMenuEntry("InsertLeft", 3);
	glutAddMenuEntry("InsertRight", 4);
	glutAddMenuEntry("DeleteFront", 5);
	glutAddMenuEntry("DeleteRear", 6);
	glutAddMenuEntry("DeletSpecified", 7);
	glutAddMenuEntry("Exit", 8);
	glutAttachMenu(GLUT_RIGHT_BUTTON);
	glutDisplayFunc(renderscene);
	init();
	glutMainLoop();		
}

What I have tried:

I haven't tried anything as i can't understand anything

Posted 21-Mar-18 5:21am

Mohammed Mishkath

Updated 21-Mar-18 22:00pm

v3

Add a Solution

Comments

Richard MacCutchan 21-Mar-18 13:18pm

"i can't understand anything
Then how did you write all that code?

Mohammed Mishkath 22-Mar-18 0:01am

I got it online

Richard MacCutchan 22-Mar-18 4:06am

Then go back to the place you found it and ask the writer for help. We have no idea what it is supposed to be doing.

2 solutions

Solution 1

If you want to solve this problem it is time to get some understanding. At minimum, it's time to learn how to use your debugger. You have made no mention of your development environment so I will assume that it is one with a decent debugger. If it doesn't have one then find a different one that does as soon as possible. A good debugger will show you exactly where the program crashes and you can examine the call stack to find out more details. That is one of the primary purposes of a debugger.

Posted 21-Mar-18 5:34am

Rick York

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Accepted Answer · 2018-03-21T22:01:00

Solution 2

Why are you using your own implementation of double linked list when std::list[^] is available (and reliable)?

If you really want to use it then you have first to make sure it reliably works, that is write test cases to check it, in isolation (that is without OpenGL interaction).

Posted 21-Mar-18 22:01pm

CPallini

Comments

Maciej Los 22-Mar-18 6:05am

Short And To The Point!

CPallini 22-Mar-18 12:16pm

Thank you very much!