filter.hh

跑leach需要的

// 
// filter.hh     : Filter definitions
// authors       : Fabio Silva
//
// Copyright (C) 2000-2003 by the University of Southern California
// $Id: filter.hh,v 1.7 2003/07/09 17:50:02 haldar Exp $
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License,
// version 2, as published by the Free Software Foundation.
//
// This program 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 this program; if not, write to the Free Software Foundation, Inc.,
// 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
//
//

#ifndef _FILTER_HH_
#define _FILTER_HH_

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif // HAVE_CONFIG_H

#include <sys/time.h>
#include <unistd.h>
#include <list>

#include "message.hh"

using namespace std;

// Filter priority definitions
#define FILTER_ZERO_PRIORITY 0
#define FILTER_MIN_PRIORITY 1
#define FILTER_MAX_PRIORITY 254
#define FILTER_KEEP_PRIORITY 255
#define FILTER_INVALID_PRIORITY 256

// The following definitions should help people pick a priority when
// writing filters.

// If a filter is a pre-processing filter (e.g. logging) which should
// receive messages before they get to a routing protocol, it should
// have a priority between FILTER_MAX_PRIORITY and
// PRE_PROCESSING_COMPLETED_PRIORITY.

#define PRE_PROCESSING_COMPLETED_PRIORITY 200

// Filters implementing routing protocols, should have a priority
// between PRE_PROCESSING_COMPLETED_PRIORITY and
// ROUTING_COMPLETED_PRIORITY.

#define ROUTING_COMPLETED_PRIORITY 50

// If a filter is a post-processing filter, it should use a priority
// between ROUTING_COMPLETED_PRIORITY and FILTER_MIN_PRIORITY.

class FilterEntry;
class FilterCallback;

typedef list<FilterEntry *> FilterList;
typedef long handle;

class FilterEntry {
public:
  NRAttrVec *filter_attrs_;
  int16_t handle_;
  u_int16_t priority_;
  u_int16_t agent_;
  FilterCallback *cb_;
  struct timeval tmv_;
  bool valid_;
   
  FilterEntry(int16_t handle, u_int16_t priority, u_int16_t agent) :
    handle_(handle), priority_(priority), agent_(agent)
  {
    valid_ = true;
    cb_ = NULL;
    GetTime(&tmv_);
  }

  ~FilterEntry()
  {
    if (filter_attrs_){
      ClearAttrs(filter_attrs_);
      delete filter_attrs_;
    }
  }
};

class FilterCallback {
public:
  virtual void recv(Message *msg, handle h) = 0;
};

#endif // !_FILTER_HH_