root/trunk/src/prefix_mgmt.c

/*
 * File: prefix_mgmt.c
 * 
 * Authors: ANDREU Francois-Xavier 
 *
 * Copyright (C) 2005-2011 GIP RENATER 
 */

/*  This file is part of renetcol. 
 *
 *  renetcol 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.
 *
 *  renetcol is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  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 renetcol; if not, write to the Free Software
 *  Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
 */

#include "prefix_mgmt.h"

/*
 * prefCmp()
 */
int
prefCmp(const void *elem1, const void *elem2){
  struct PrefixV4 *el1 = (struct PrefixV4 *) elem1;
  struct PrefixV4 *el2 = (struct PrefixV4 *) elem2;
  return ( 
          el1->beginning - el2->beginning
          );
}


/*
 * prefGlobalCmp()
 */
int
prefGlobalCmp(const void *elem1, const void *elem2){
  struct PrefixV4 *el1 = (struct PrefixV4 *) elem1;
  struct PrefixV4 *el2 = (struct PrefixV4 *) elem2;
  if ( el1->beginning >= el2->beginning && el1->beginning <= el2->end ) {
    return 0;
  } else if (el1->beginning < el2->beginning) {
    return -1;
  } else if (el1->beginning > el2->end) {
    return 1;
  } else {
    syslog(LOG_ERR,"You have won !!! This case doesn't exist !!!!");
    exit(1);
    return 0;
  }
}

/*
 * prefV6Cmp()
 */
int
prefV6Cmp(const void *elem1, const void *elem2){
  struct PrefixV6 *el1 = (struct PrefixV6 *) elem1;
  struct PrefixV6 *el2 = (struct PrefixV6 *) elem2;
  int i;
  int moreIsNecessary = 1;

  for (i=0;i<4;i++) {
    switch(i){
    case 0:
      if ( el2->mask <= 32 ) {
        if ( el2->start[i] == el1->start[i] ) {
          return 0;
        }else{ 
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        }
      } else { /* el2 > /32 */
        if ( el2->start[i] != el1->start[i] ) {
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        } /* here we don't return, we'll continue in case */
      }
      break;
    case 1:
      if ( el2->mask <= 64 ) {
        if ( el2->start[i] == el1->start[i] ) {
          return 0;
        }else{ 
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        }
      } else { /* el2 > /64 */
        if ( el2->start[i] != el1->start[i] ) {
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        } /* here we don't return, we'll continue in case */
      }
      break;
    case 2:
      if ( el2->mask <= 96 ) {
        if ( el2->start[i] == el1->start[i] ) {
          return 0;
        }else{ 
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        }
      } else { /* el2 > /96 */
        if ( el2->start[i] != el1->start[i] ) {
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        } /* here we don't return, we'll continue in case */
      }
      break;
    case 3:
      if ( el2->mask <= 128 ) {
        if ( el2->start[i] == el1->start[i] ) {
          return 0;
        }else{ 
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        }
      } else { /* el2 > /128 */
        if ( el2->start[i] != el1->start[i] ) {
          if (el2->end[i] < el1->start[i]) {
            return 1;
          }else{
            return 1;
          }
        } /* here we don't return, we'll continue in case */
      }
      break;
    default:
      syslog(LOG_ERR,"You have won !!! This IPv6 case doesn't exist !!!!");
      exit(1);
      return 0;
      break;
    }
  }
}