/** mapping.h
 **
 ** Original Author: Guido de Jong
 ** Date: 11/16/99
 **
 ** Description:
 ** Binary tree implementation for page mapping.
 ** 
 ** This program is free software, you can redistribute it and/or
 ** modify it under the terms of the GNU General Public License
 ** as published by the Free Software Foundation; either version
 ** 2 of the License, or (at your option) any later version.
 **
 ** This program is distributed in the hope that it will be
 ** useful, but WITHOUT ANY WARRANTY; without even the implied
 ** warranty or MERCHANTABILITY or FITNESS FOR A PARTICULAR
 ** PURPOSE.  See the GNU General Public License for more
 ** details.
 **
 ** You should have received a copy of the GNU General Public
 ** License along with this program; if not, write to the
 ** Free Software Foundation, Inc., 59 Temple Place, Suite 330,
 ** Boston, MA 02111-1307 USA
 **
 *********************************************************Apostle OS**/

#ifndef __MAPPING_H_
#define __MAPPING_H_

#include <types.h>

typedef struct mapping_node
{
  dword *addrSpace;
  void *address;
  struct mapping_node *parent, *next, *child;
} MappingNode;

MappingNode *NewMappingNode(dword *addrSp, void *addr);
void         AddNode(MappingNode *parentNode, MappingNode *childNode);
void         DeleteNode(MappingNode *node);

#endif /* __MAPPING_H_ */