Show mhf_i.h syntax highlighted
/*
*
* Copyright (c) 2004 The Regents of the University of California. All
* rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Neither the name of the University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*/
#include "libstatedev.h"
#include "link/link.h"
#include "link/link_multi.h"
#include "routing/routing_table.h"
#include "cluster_map.h"
#include "retx_proto.h"
#ifndef __MHF_I__
#define __MHF_I__
typedef struct mhf_state {
/* use this link */
char *if_class;
char *neighbors;
/* event references */
lu_multi_context_t *link_ref;
state_sync_t *ref;
status_context_t *routes_status;
/* options */
int no_throttle;
int slow_refresh;
int fast_refresh;
int overflood;
int pkt_type;
int rate;
char *prefix;
} mhf_state_t;
typedef struct mhf_per_link {
retx_context_t *retx;
int iface;
if_id_t if_id;
cl_index_t curr_target;
mhf_state_t *parent;
} mhf_per_link_t;
typedef struct per_flow_state {
source_t *parent;
cl_id_t upstream;
uint8_t forward_vector[MAX_IFACES];
g_event_t *refresh_timer;
g_event_t *expect_refresh_timer;
int timed_out;
int16_t refresh_seqno;
} per_flow_state_t;
#define MHF_SEQNO_UPDATE_HOLDOFF 5000
#define MHF_SEQNO_REFRESH 20000
#define MHF_SLOW_REFRESH_FACTOR 100
#define MHF_SLOW_HOLDOFF_FACTOR 10
#define MHF_FAST_REFRESH_FACTOR 10
/* mhf_devs */
void mhf_devs_init(mhf_state_t *cs, int *argc, char **argv);
per_flow_state_t *mhf_maybe_init_source(source_t *s);
/* mhf_net */
void mhf_net_init(mhf_state_t *mh, int *argc, char **argv);
#endif
See more files for this project here
EmStar is a software system for developing and deploying wireless sensor networks involving Linux-based platforms. As the wireless sensor network community has attempted to deploy more complex designs---large-scale, long-lived systems that need self-organization and adaptivity---a number of difficult software design issues have arisen. Advances in software design have not kept pace with the capabilities of hardware. This is because designing for an adaptive, efficient, and useful sensor network has turned out to be surprisingly complex and difficult. EmStar is a Linux-based software framework, whose goal is to dramatically reduce this complexity, enabling work to be shared and reused, and simplifying and speeding the design of new sensor network applications.
Project homepage:
http://cvs.cens.ucla.edu/emstar/
Programming language(s): C,Shell Script
License: other
mhf_devs.c
mhf_i.h
mhf_main.c
mhf_net.c