85 lines
3.3 KiB
C
85 lines
3.3 KiB
C
|
/*
|
||
|
|
* $Id: query_parser.h 44 2011-02-15 12:32:29Z kaori $
|
||
|
|
*
|
||
|
|
* Copyright (c) 2002-2011, Communications and Remote Sensing Laboratory, Universite catholique de Louvain (UCL), Belgium
|
||
|
|
* Copyright (c) 2002-2011, Professor Benoit Macq
|
||
|
|
* Copyright (c) 2010-2011, Kaori Hagihara
|
||
|
|
* All rights reserved.
|
||
|
|
*
|
||
|
|
* Redistribution and use in source and binary forms, with or without
|
||
|
|
* modification, are permitted provided that the following conditions
|
||
|
|
* are met:
|
||
|
|
* 1. Redistributions of source code must retain the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer.
|
||
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
||
|
|
* notice, this list of conditions and the following disclaimer in the
|
||
|
|
* documentation and/or other materials provided with the distribution.
|
||
|
|
*
|
||
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS 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 COPYRIGHT OWNER 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.
|
||
|
|
*/
|
||
|
|
|
||
|
|
#ifndef QUERY_PARSER_H_
|
||
|
|
# define QUERY_PARSER_H_
|
||
|
|
|
||
|
|
#include <stdbool.h>
|
||
|
|
|
||
|
|
//! maximum length of target name
|
||
|
|
#define MAX_LENOFTARGET 128
|
||
|
|
|
||
|
|
//! maximum length of channel identifier
|
||
|
|
#define MAX_LENOFCID 30
|
||
|
|
|
||
|
|
//! maximum number of closing channel
|
||
|
|
#define MAX_NUMOFCCLOSE 10
|
||
|
|
|
||
|
|
//! maximum number of meta request box
|
||
|
|
#define MAX_NUMOFBOX 10
|
||
|
|
|
||
|
|
//! Query parameters
|
||
|
|
typedef struct query_param{
|
||
|
|
char target[MAX_LENOFTARGET]; //!< target name
|
||
|
|
int fx, fy; //!< frame size (fx,fy)
|
||
|
|
int rx, ry, rw, rh; //!< roi region
|
||
|
|
char cid[MAX_LENOFCID]; //!< channel identifier
|
||
|
|
bool cnew; //!< if there is new channel request(true) or not (false)
|
||
|
|
char cclose[MAX_NUMOFCCLOSE][MAX_LENOFCID]; //!< closing channel identifiers
|
||
|
|
char box_type[MAX_NUMOFBOX][4]; //!< interested box-types
|
||
|
|
int limit[MAX_NUMOFBOX]; //!< limit value, -1: skeleton request "r", 0: entire contents
|
||
|
|
bool w[MAX_NUMOFBOX]; //!< Metadata request qualifier flags
|
||
|
|
bool s[MAX_NUMOFBOX];
|
||
|
|
bool g[MAX_NUMOFBOX];
|
||
|
|
bool a[MAX_NUMOFBOX];
|
||
|
|
bool priority[MAX_NUMOFBOX]; //!< priority flag
|
||
|
|
int root_bin; //!< root-bin
|
||
|
|
int max_depth; //!< max-depth
|
||
|
|
bool metadata_only; //!< metadata-only request
|
||
|
|
} query_param_t;
|
||
|
|
|
||
|
|
|
||
|
|
/**
|
||
|
|
* parse query
|
||
|
|
*
|
||
|
|
* @param[in] query_string request query string
|
||
|
|
* @param[out] query_param query parameters
|
||
|
|
*/
|
||
|
|
void parse_query( char *query_string, query_param_t *query_param);
|
||
|
|
|
||
|
|
/**
|
||
|
|
* print query parameters
|
||
|
|
*
|
||
|
|
* @param[in] query_param query parameters
|
||
|
|
*/
|
||
|
|
void print_queryparam( query_param_t query_param);
|
||
|
|
|
||
|
|
#endif /* !QUERY_PARSER_H_ */
|