C / C++ / MFC

Trevor Johansen wrote:

I know that the compiler is invoked for every separate c file so it will include say function _delay() in every .c file. The linker then puts all the objects together and makes the binary but does it strip the duplicate _delays?? I know the pragma once and other inclusion guards are only relative to that source file being compiled and each source will include the functions.

Trevor Johansen wrote:

declared in my header and want to use these states in multiple source files so I include the header when I need it. I also have an initialized structure struct branch the_table[8][5] = { {Control,0,0,0,0,0}, {Speed,0,0,0,0,0} }; and since this structure is using memory I must put it in my source file the problem is I want to be able to access this array outside of its source file and if I declare extern truct branch the_table[8][5]; in the header with the rest of the structure decelerations other source files cannot access its internal structure.

enum states { 
		Info = 0,
		Speed = 1,
			Up = 2,
			Down = 3,
		Control = 4,
			OnOff = 5,
			CW = 6,
			CCW = 7
};

struct branch {
    enum states new_state:7;
		int entry_action;
                int action_a;
		int action_b;
		int action_c;
		int exit_action;
};

// main.h
struct Point 
{
	int x,y;
};
void init();

// init.cpp
#include "main.h"
Point centre={0,0};
void init()
{
	centre.x=100;
	centre.y=120;
}

// main.cpp
#include <iostream>
#include "main.h"
extern Point centre;
void out()
{
	std::cout << "cente = {" << centre.x << ", " << centre.y << "}" << std::endl;
}

void main()
{
	init();
	out();
}

Chidori-chan wrote:

free (root->children[i]);
deleteTree (root->children[i]);

if (root->leaf == TRUE)
  {
    free (root);
    root->leaf = NULL;
  }

root->leaf;

  if (root->leaf == TRUE)
{

  root->leaf = NULL;
  free (root);
}

int checkKids(qnode *parent)
{
   int i;
   for(i = 0; i < 4; ++i)
      if(parent->children[i] != NULL)
         return 0;
   return 1;
}

void deletE(qnode *root)
{
   if(checkKids(root) && !root->leaf)
   {
      root = NULL;
      free(root);
   }
   else
   {
      int i;
      for(i = 0; i < 4; ++i)
         if(root->children[i] != NULL)
            deletE(root->children[i]);
   }
}

void deletePoint()
{
   deletE(root);
}


void deletePointS (int sx, int sy, qnode *root)
{
   int i;
   for(i=0; i<4; i++)
   {
         if(root->children[i] != NULL)
         {
            if(root->children[i]->leaf == TRUE)
            {
               if(isIn(root->children[i]->px, root->children[i]->py, sx, sy, 5))
               {
                  root-&gt;children[i] = NULL;
                  free(root->children[i]);

                  if(checkKids(root))
                  {
                     free(root);
                     root = NULL;
                  }
                  return;
               }
            }
            else
            {
               deletePointS(sx, sy, root->children[i]);
            }
         }
   }
    
}

void deleteNode (int sx, int sy)
{ 
int deleting;
   if(deleting == 1)
      return;
   deleting = 1;
   deletePointS(sx, sy, root);
   deletePoint();
   deleting = 0;
}