import VTY code from zebra/quagga (from my cardshell project)
parent
32201c1aea
commit
955049f191
|
@ -0,0 +1,100 @@
|
|||
/*
|
||||
* Buffering to output and input.
|
||||
* Copyright (C) 1998 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra 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, or (at your
|
||||
* option) any later version.
|
||||
*
|
||||
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the
|
||||
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
||||
* Boston, MA 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#ifndef _ZEBRA_BUFFER_H
|
||||
#define _ZEBRA_BUFFER_H
|
||||
|
||||
/* Create a new buffer. Memory will be allocated in chunks of the given
|
||||
size. If the argument is 0, the library will supply a reasonable
|
||||
default size suitable for buffering socket I/O. */
|
||||
struct buffer *buffer_new(size_t);
|
||||
|
||||
/* Free all data in the buffer. */
|
||||
void buffer_reset(struct buffer *);
|
||||
|
||||
/* This function first calls buffer_reset to release all buffered data.
|
||||
Then it frees the struct buffer itself. */
|
||||
void buffer_free(struct buffer *);
|
||||
|
||||
/* Add the given data to the end of the buffer. */
|
||||
extern void buffer_put(struct buffer *, const void *, size_t);
|
||||
/* Add a single character to the end of the buffer. */
|
||||
extern void buffer_putc(struct buffer *, u_char);
|
||||
/* Add a NUL-terminated string to the end of the buffer. */
|
||||
extern void buffer_putstr(struct buffer *, const char *);
|
||||
|
||||
/* Combine all accumulated (and unflushed) data inside the buffer into a
|
||||
single NUL-terminated string allocated using XMALLOC(MTYPE_TMP). Note
|
||||
that this function does not alter the state of the buffer, so the data
|
||||
is still inside waiting to be flushed. */
|
||||
char *buffer_getstr(struct buffer *);
|
||||
|
||||
/* Returns 1 if there is no pending data in the buffer. Otherwise returns 0. */
|
||||
int buffer_empty(struct buffer *);
|
||||
|
||||
typedef enum {
|
||||
/* An I/O error occurred. The buffer should be destroyed and the
|
||||
file descriptor should be closed. */
|
||||
BUFFER_ERROR = -1,
|
||||
|
||||
/* The data was written successfully, and the buffer is now empty
|
||||
(there is no pending data waiting to be flushed). */
|
||||
BUFFER_EMPTY = 0,
|
||||
|
||||
/* There is pending data in the buffer waiting to be flushed. Please
|
||||
try flushing the buffer when select indicates that the file descriptor
|
||||
is writeable. */
|
||||
BUFFER_PENDING = 1
|
||||
} buffer_status_t;
|
||||
|
||||
/* Try to write this data to the file descriptor. Any data that cannot
|
||||
be written immediately is added to the buffer queue. */
|
||||
extern buffer_status_t buffer_write(struct buffer *, int fd,
|
||||
const void *, size_t);
|
||||
|
||||
/* This function attempts to flush some (but perhaps not all) of
|
||||
the queued data to the given file descriptor. */
|
||||
extern buffer_status_t buffer_flush_available(struct buffer *, int fd);
|
||||
|
||||
/* The following 2 functions (buffer_flush_all and buffer_flush_window)
|
||||
are for use in lib/vty.c only. They should not be used elsewhere. */
|
||||
|
||||
/* Call buffer_flush_available repeatedly until either all data has been
|
||||
flushed, or an I/O error has been encountered, or the operation would
|
||||
block. */
|
||||
extern buffer_status_t buffer_flush_all(struct buffer *, int fd);
|
||||
|
||||
/* Attempt to write enough data to the given fd to fill a window of the
|
||||
given width and height (and remove the data written from the buffer).
|
||||
|
||||
If !no_more, then a message saying " --More-- " is appended.
|
||||
If erase is true, then first overwrite the previous " --More-- " message
|
||||
with spaces.
|
||||
|
||||
Any write error (including EAGAIN or EINTR) will cause this function
|
||||
to return -1 (because the logic for handling the erase and more features
|
||||
is too complicated to retry the write later).
|
||||
*/
|
||||
extern buffer_status_t buffer_flush_window(struct buffer *, int fd, int width,
|
||||
int height, int erase, int no_more);
|
||||
|
||||
#endif /* _ZEBRA_BUFFER_H */
|
|
@ -0,0 +1,351 @@
|
|||
/*
|
||||
* Zebra configuration command interface routine
|
||||
* Copyright (C) 1997, 98 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra 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, or (at your
|
||||
* option) any later version.
|
||||
*
|
||||
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the
|
||||
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
||||
* Boston, MA 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#ifndef _ZEBRA_COMMAND_H
|
||||
#define _ZEBRA_COMMAND_H
|
||||
|
||||
#include <stdio.h>
|
||||
#include "vector.h"
|
||||
#include "vty.h"
|
||||
|
||||
/* Host configuration variable */
|
||||
struct host {
|
||||
/* Host name of this router. */
|
||||
char *name;
|
||||
|
||||
/* Password for vty interface. */
|
||||
char *password;
|
||||
char *password_encrypt;
|
||||
|
||||
/* Enable password */
|
||||
char *enable;
|
||||
char *enable_encrypt;
|
||||
|
||||
/* System wide terminal lines. */
|
||||
int lines;
|
||||
|
||||
/* Log filename. */
|
||||
char *logfile;
|
||||
|
||||
/* config file name of this host */
|
||||
char *config;
|
||||
|
||||
/* Flags for services */
|
||||
int advanced;
|
||||
int encrypt;
|
||||
|
||||
/* Banner configuration. */
|
||||
const char *motd;
|
||||
char *motdfile;
|
||||
};
|
||||
|
||||
/* There are some command levels which called from command node. */
|
||||
enum node_type {
|
||||
SEND_NODE,
|
||||
|
||||
AUTH_NODE, /* Authentication mode of vty interface. */
|
||||
VIEW_NODE, /* View node. Default mode of vty interface. */
|
||||
AUTH_ENABLE_NODE, /* Authentication mode for change enable. */
|
||||
ENABLE_NODE, /* Enable node. */
|
||||
CONFIG_NODE, /* Config node. Default mode of config file. */
|
||||
SERVICE_NODE, /* Service node. */
|
||||
DEBUG_NODE, /* Debug node. */
|
||||
AAA_NODE, /* AAA node. */
|
||||
KEYCHAIN_NODE, /* Key-chain node. */
|
||||
KEYCHAIN_KEY_NODE, /* Key-chain key node. */
|
||||
INTERFACE_NODE, /* Interface mode node. */
|
||||
ZEBRA_NODE, /* zebra connection node. */
|
||||
TABLE_NODE, /* rtm_table selection node. */
|
||||
RIP_NODE, /* RIP protocol mode node. */
|
||||
RIPNG_NODE, /* RIPng protocol mode node. */
|
||||
BGP_NODE, /* BGP protocol mode which includes BGP4+ */
|
||||
BGP_VPNV4_NODE, /* BGP MPLS-VPN PE exchange. */
|
||||
BGP_IPV4_NODE, /* BGP IPv4 unicast address family. */
|
||||
BGP_IPV4M_NODE, /* BGP IPv4 multicast address family. */
|
||||
BGP_IPV6_NODE, /* BGP IPv6 address family */
|
||||
OSPF_NODE, /* OSPF protocol mode */
|
||||
OSPF6_NODE, /* OSPF protocol for IPv6 mode */
|
||||
ISIS_NODE, /* ISIS protocol mode */
|
||||
MASC_NODE, /* MASC for multicast. */
|
||||
IRDP_NODE, /* ICMP Router Discovery Protocol mode. */
|
||||
IP_NODE, /* Static ip route node. */
|
||||
ACCESS_NODE, /* Access list node. */
|
||||
PREFIX_NODE, /* Prefix list node. */
|
||||
ACCESS_IPV6_NODE, /* Access list node. */
|
||||
PREFIX_IPV6_NODE, /* Prefix list node. */
|
||||
AS_LIST_NODE, /* AS list node. */
|
||||
COMMUNITY_LIST_NODE, /* Community list node. */
|
||||
RMAP_NODE, /* Route map node. */
|
||||
SMUX_NODE, /* SNMP configuration node. */
|
||||
DUMP_NODE, /* Packet dump node. */
|
||||
FORWARDING_NODE, /* IP forwarding node. */
|
||||
VTY_NODE /* Vty node. */
|
||||
};
|
||||
|
||||
/* Node which has some commands and prompt string and configuration
|
||||
function pointer . */
|
||||
struct cmd_node {
|
||||
/* Node index. */
|
||||
enum node_type node;
|
||||
|
||||
/* Prompt character at vty interface. */
|
||||
const char *prompt;
|
||||
|
||||
/* Is this node's configuration goes to vtysh ? */
|
||||
int vtysh;
|
||||
|
||||
/* Node's configuration write function */
|
||||
int (*func) (struct vty *);
|
||||
|
||||
/* Vector of this node's command list. */
|
||||
vector cmd_vector;
|
||||
};
|
||||
|
||||
enum {
|
||||
CMD_ATTR_DEPRECATED = 1,
|
||||
CMD_ATTR_HIDDEN,
|
||||
};
|
||||
|
||||
/* Structure of command element. */
|
||||
struct cmd_element {
|
||||
const char *string; /* Command specification by string. */
|
||||
int (*func) (struct cmd_element *, struct vty *, int, const char *[]);
|
||||
const char *doc; /* Documentation of this command. */
|
||||
int daemon; /* Daemon to which this command belong. */
|
||||
vector strvec; /* Pointing out each description vector. */
|
||||
unsigned int cmdsize; /* Command index count. */
|
||||
char *config; /* Configuration string */
|
||||
vector subconfig; /* Sub configuration string */
|
||||
u_char attr; /* Command attributes */
|
||||
};
|
||||
|
||||
/* Command description structure. */
|
||||
struct desc {
|
||||
const char *cmd; /* Command string. */
|
||||
const char *str; /* Command's description. */
|
||||
};
|
||||
|
||||
/* Return value of the commands. */
|
||||
#define CMD_SUCCESS 0
|
||||
#define CMD_WARNING 1
|
||||
#define CMD_ERR_NO_MATCH 2
|
||||
#define CMD_ERR_AMBIGUOUS 3
|
||||
#define CMD_ERR_INCOMPLETE 4
|
||||
#define CMD_ERR_EXEED_ARGC_MAX 5
|
||||
#define CMD_ERR_NOTHING_TODO 6
|
||||
#define CMD_COMPLETE_FULL_MATCH 7
|
||||
#define CMD_COMPLETE_MATCH 8
|
||||
#define CMD_COMPLETE_LIST_MATCH 9
|
||||
#define CMD_SUCCESS_DAEMON 10
|
||||
|
||||
/* Argc max counts. */
|
||||
#define CMD_ARGC_MAX 25
|
||||
|
||||
/* Turn off these macros when uisng cpp with extract.pl */
|
||||
#ifndef VTYSH_EXTRACT_PL
|
||||
|
||||
/* helper defines for end-user DEFUN* macros */
|
||||
#define DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, attrs, dnum) \
|
||||
struct cmd_element cmdname = \
|
||||
{ \
|
||||
.string = cmdstr, \
|
||||
.func = funcname, \
|
||||
.doc = helpstr, \
|
||||
.attr = attrs, \
|
||||
.daemon = dnum, \
|
||||
};
|
||||
|
||||
#define DEFUN_CMD_FUNC_DECL(funcname) \
|
||||
static int funcname (struct cmd_element *, struct vty *, int, const char *[]); \
|
||||
|
||||
#define DEFUN_CMD_FUNC_TEXT(funcname) \
|
||||
static int funcname \
|
||||
(struct cmd_element *self, struct vty *vty, int argc, const char *argv[])
|
||||
|
||||
/* DEFUN for vty command interafce. Little bit hacky ;-). */
|
||||
#define DEFUN(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_FUNC_DECL(funcname) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, 0, 0) \
|
||||
DEFUN_CMD_FUNC_TEXT(funcname)
|
||||
|
||||
#define DEFUN_ATTR(funcname, cmdname, cmdstr, helpstr, attr) \
|
||||
DEFUN_CMD_FUNC_DECL(funcname) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, attr, 0) \
|
||||
DEFUN_CMD_FUNC_TEXT(funcname)
|
||||
|
||||
#define DEFUN_HIDDEN(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_ATTR (funcname, cmdname, cmdstr, helpstr, CMD_ATTR_HIDDEN)
|
||||
|
||||
#define DEFUN_DEPRECATED(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_ATTR (funcname, cmdname, cmdstr, helpstr, CMD_ATTR_DEPRECATED) \
|
||||
|
||||
/* DEFUN_NOSH for commands that vtysh should ignore */
|
||||
#define DEFUN_NOSH(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN(funcname, cmdname, cmdstr, helpstr)
|
||||
|
||||
/* DEFSH for vtysh. */
|
||||
#define DEFSH(daemon, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(NULL, cmdname, cmdstr, helpstr, 0, daemon) \
|
||||
|
||||
/* DEFUN + DEFSH */
|
||||
#define DEFUNSH(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_FUNC_DECL(funcname) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, 0, daemon) \
|
||||
DEFUN_CMD_FUNC_TEXT(funcname)
|
||||
|
||||
/* DEFUN + DEFSH with attributes */
|
||||
#define DEFUNSH_ATTR(daemon, funcname, cmdname, cmdstr, helpstr, attr) \
|
||||
DEFUN_CMD_FUNC_DECL(funcname) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, attr, daemon) \
|
||||
DEFUN_CMD_FUNC_TEXT(funcname)
|
||||
|
||||
#define DEFUNSH_HIDDEN(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUNSH_ATTR (daemon, funcname, cmdname, cmdstr, helpstr, CMD_ATTR_HIDDEN)
|
||||
|
||||
#define DEFUNSH_DEPRECATED(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUNSH_ATTR (daemon, funcname, cmdname, cmdstr, helpstr, CMD_ATTR_DEPRECATED)
|
||||
|
||||
/* ALIAS macro which define existing command's alias. */
|
||||
#define ALIAS(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, 0, 0)
|
||||
|
||||
#define ALIAS_ATTR(funcname, cmdname, cmdstr, helpstr, attr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, attr, 0)
|
||||
|
||||
#define ALIAS_HIDDEN(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, CMD_ATTR_HIDDEN, 0)
|
||||
|
||||
#define ALIAS_DEPRECATED(funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, CMD_ATTR_DEPRECATED, 0)
|
||||
|
||||
#define ALIAS_SH(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, 0, daemon)
|
||||
|
||||
#define ALIAS_SH_HIDDEN(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, CMD_ATTR_HIDDEN, daemon)
|
||||
|
||||
#define ALIAS_SH_DEPRECATED(daemon, funcname, cmdname, cmdstr, helpstr) \
|
||||
DEFUN_CMD_ELEMENT(funcname, cmdname, cmdstr, helpstr, CMD_ATTR_DEPRECATED, daemon)
|
||||
|
||||
#endif /* VTYSH_EXTRACT_PL */
|
||||
|
||||
/* Some macroes */
|
||||
#define CMD_OPTION(S) ((S[0]) == '[')
|
||||
#define CMD_VARIABLE(S) (((S[0]) >= 'A' && (S[0]) <= 'Z') || ((S[0]) == '<'))
|
||||
#define CMD_VARARG(S) ((S[0]) == '.')
|
||||
#define CMD_RANGE(S) ((S[0] == '<'))
|
||||
|
||||
#define CMD_IPV4(S) ((strcmp ((S), "A.B.C.D") == 0))
|
||||
#define CMD_IPV4_PREFIX(S) ((strcmp ((S), "A.B.C.D/M") == 0))
|
||||
#define CMD_IPV6(S) ((strcmp ((S), "X:X::X:X") == 0))
|
||||
#define CMD_IPV6_PREFIX(S) ((strcmp ((S), "X:X::X:X/M") == 0))
|
||||
|
||||
/* Common descriptions. */
|
||||
#define SHOW_STR "Show running system information\n"
|
||||
#define IP_STR "IP information\n"
|
||||
#define IPV6_STR "IPv6 information\n"
|
||||
#define NO_STR "Negate a command or set its defaults\n"
|
||||
#define CLEAR_STR "Reset functions\n"
|
||||
#define RIP_STR "RIP information\n"
|
||||
#define BGP_STR "BGP information\n"
|
||||
#define OSPF_STR "OSPF information\n"
|
||||
#define NEIGHBOR_STR "Specify neighbor router\n"
|
||||
#define DEBUG_STR "Debugging functions (see also 'undebug')\n"
|
||||
#define UNDEBUG_STR "Disable debugging functions (see also 'debug')\n"
|
||||
#define ROUTER_STR "Enable a routing process\n"
|
||||
#define AS_STR "AS number\n"
|
||||
#define MBGP_STR "MBGP information\n"
|
||||
#define MATCH_STR "Match values from routing table\n"
|
||||
#define SET_STR "Set values in destination routing protocol\n"
|
||||
#define OUT_STR "Filter outgoing routing updates\n"
|
||||
#define IN_STR "Filter incoming routing updates\n"
|
||||
#define V4NOTATION_STR "specify by IPv4 address notation(e.g. 0.0.0.0)\n"
|
||||
#define OSPF6_NUMBER_STR "Specify by number\n"
|
||||
#define INTERFACE_STR "Interface infomation\n"
|
||||
#define IFNAME_STR "Interface name(e.g. ep0)\n"
|
||||
#define IP6_STR "IPv6 Information\n"
|
||||
#define OSPF6_STR "Open Shortest Path First (OSPF) for IPv6\n"
|
||||
#define OSPF6_ROUTER_STR "Enable a routing process\n"
|
||||
#define OSPF6_INSTANCE_STR "<1-65535> Instance ID\n"
|
||||
#define SECONDS_STR "<1-65535> Seconds\n"
|
||||
#define ROUTE_STR "Routing Table\n"
|
||||
#define PREFIX_LIST_STR "Build a prefix list\n"
|
||||
#define OSPF6_DUMP_TYPE_LIST \
|
||||
"(neighbor|interface|area|lsa|zebra|config|dbex|spf|route|lsdb|redistribute|hook|asbr|prefix|abr)"
|
||||
#define ISIS_STR "IS-IS information\n"
|
||||
#define AREA_TAG_STR "[area tag]\n"
|
||||
|
||||
#define CONF_BACKUP_EXT ".sav"
|
||||
|
||||
/* IPv4 only machine should not accept IPv6 address for peer's IP
|
||||
address. So we replace VTY command string like below. */
|
||||
#ifdef HAVE_IPV6
|
||||
#define NEIGHBOR_CMD "neighbor (A.B.C.D|X:X::X:X) "
|
||||
#define NO_NEIGHBOR_CMD "no neighbor (A.B.C.D|X:X::X:X) "
|
||||
#define NEIGHBOR_ADDR_STR "Neighbor address\nIPv6 address\n"
|
||||
#define NEIGHBOR_CMD2 "neighbor (A.B.C.D|X:X::X:X|WORD) "
|
||||
#define NO_NEIGHBOR_CMD2 "no neighbor (A.B.C.D|X:X::X:X|WORD) "
|
||||
#define NEIGHBOR_ADDR_STR2 "Neighbor address\nNeighbor IPv6 address\nNeighbor tag\n"
|
||||
#else
|
||||
#define NEIGHBOR_CMD "neighbor A.B.C.D "
|
||||
#define NO_NEIGHBOR_CMD "no neighbor A.B.C.D "
|
||||
#define NEIGHBOR_ADDR_STR "Neighbor address\n"
|
||||
#define NEIGHBOR_CMD2 "neighbor (A.B.C.D|WORD) "
|
||||
#define NO_NEIGHBOR_CMD2 "no neighbor (A.B.C.D|WORD) "
|
||||
#define NEIGHBOR_ADDR_STR2 "Neighbor address\nNeighbor tag\n"
|
||||
#endif /* HAVE_IPV6 */
|
||||
|
||||
/* Prototypes. */
|
||||
void install_node(struct cmd_node *, int (*)(struct vty *));
|
||||
void install_default(enum node_type);
|
||||
void install_element(enum node_type, struct cmd_element *);
|
||||
void sort_node();
|
||||
|
||||
/* Concatenates argv[shift] through argv[argc-1] into a single NUL-terminated
|
||||
string with a space between each element (allocated using
|
||||
XMALLOC(MTYPE_TMP)). Returns NULL if shift >= argc. */
|
||||
char *argv_concat(const char **argv, int argc, int shift);
|
||||
|
||||
vector cmd_make_strvec(const char *);
|
||||
void cmd_free_strvec(vector);
|
||||
vector cmd_describe_command();
|
||||
char **cmd_complete_command();
|
||||
const char *cmd_prompt(enum node_type);
|
||||
int config_from_file(struct vty *, FILE *);
|
||||
enum node_type node_parent(enum node_type);
|
||||
int cmd_execute_command(vector, struct vty *, struct cmd_element **, int);
|
||||
int cmd_execute_command_strict(vector, struct vty *, struct cmd_element **);
|
||||
void config_replace_string(struct cmd_element *, char *, ...);
|
||||
void cmd_init(int);
|
||||
|
||||
/* Export typical functions. */
|
||||
extern struct cmd_element config_end_cmd;
|
||||
extern struct cmd_element config_exit_cmd;
|
||||
extern struct cmd_element config_quit_cmd;
|
||||
extern struct cmd_element config_help_cmd;
|
||||
extern struct cmd_element config_list_cmd;
|
||||
char *host_config_file();
|
||||
void host_config_set(char *);
|
||||
|
||||
void print_version(const char *);
|
||||
|
||||
#endif /* _ZEBRA_COMMAND_H */
|
|
@ -0,0 +1,62 @@
|
|||
/*
|
||||
* Generic vector interface header.
|
||||
* Copyright (C) 1997, 98 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra 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, or (at your option) any
|
||||
* later version.
|
||||
*
|
||||
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the Free
|
||||
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||||
* 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#ifndef _ZEBRA_VECTOR_H
|
||||
#define _ZEBRA_VECTOR_H
|
||||
|
||||
/* struct for vector */
|
||||
struct _vector {
|
||||
unsigned int active; /* number of active slots */
|
||||
unsigned int alloced; /* number of allocated slot */
|
||||
void **index; /* index to data */
|
||||
};
|
||||
typedef struct _vector *vector;
|
||||
|
||||
#define VECTOR_MIN_SIZE 1
|
||||
|
||||
/* (Sometimes) usefull macros. This macro convert index expression to
|
||||
array expression. */
|
||||
/* Reference slot at given index, caller must ensure slot is active */
|
||||
#define vector_slot(V,I) ((V)->index[(I)])
|
||||
/* Number of active slots.
|
||||
* Note that this differs from vector_count() as it the count returned
|
||||
* will include any empty slots
|
||||
*/
|
||||
#define vector_active(V) ((V)->active)
|
||||
|
||||
/* Prototypes. */
|
||||
vector vector_init(unsigned int size);
|
||||
void vector_ensure(vector v, unsigned int num);
|
||||
int vector_empty_slot(vector v);
|
||||
int vector_set(vector v, void *val);
|
||||
int vector_set_index(vector v, unsigned int i, void *val);
|
||||
void vector_unset(vector v, unsigned int i);
|
||||
unsigned int vector_count(vector v);
|
||||
void vector_only_wrapper_free(vector v);
|
||||
void vector_only_index_free(void *index);
|
||||
void vector_free(vector v);
|
||||
vector vector_copy(vector v);
|
||||
|
||||
void *vector_lookup(vector, unsigned int);
|
||||
void *vector_lookup_ensure(vector, unsigned int);
|
||||
|
||||
#endif /* _ZEBRA_VECTOR_H */
|
|
@ -0,0 +1,134 @@
|
|||
#ifndef _VTY_H
|
||||
#define _VTY_H
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
|
||||
/* GCC have printf type attribute check. */
|
||||
#ifdef __GNUC__
|
||||
#define PRINTF_ATTRIBUTE(a,b) __attribute__ ((__format__ (__printf__, a, b)))
|
||||
#else
|
||||
#define PRINTF_ATTRIBUTE(a,b)
|
||||
#endif /* __GNUC__ */
|
||||
|
||||
/* Does the I/O error indicate that the operation should be retried later? */
|
||||
#define ERRNO_IO_RETRY(EN) \
|
||||
(((EN) == EAGAIN) || ((EN) == EWOULDBLOCK) || ((EN) == EINTR))
|
||||
|
||||
/* Vty read buffer size. */
|
||||
#define VTY_READ_BUFSIZ 512
|
||||
|
||||
#define VTY_BUFSIZ 512
|
||||
#define VTY_MAXHIST 20
|
||||
|
||||
struct vty {
|
||||
FILE *file;
|
||||
|
||||
/* File descripter of this vty. */
|
||||
int fd;
|
||||
|
||||
/* Is this vty connect to file or not */
|
||||
enum { VTY_TERM, VTY_FILE, VTY_SHELL, VTY_SHELL_SERV } type;
|
||||
|
||||
/* Node status of this vty */
|
||||
int node;
|
||||
|
||||
/* Failure count */
|
||||
int fail;
|
||||
|
||||
/* Output buffer. */
|
||||
struct buffer *obuf;
|
||||
|
||||
/* Command input buffer */
|
||||
char *buf;
|
||||
|
||||
/* Command cursor point */
|
||||
int cp;
|
||||
|
||||
/* Command length */
|
||||
int length;
|
||||
|
||||
/* Command max length. */
|
||||
int max;
|
||||
|
||||
/* Histry of command */
|
||||
char *hist[VTY_MAXHIST];
|
||||
|
||||
/* History lookup current point */
|
||||
int hp;
|
||||
|
||||
/* History insert end point */
|
||||
int hindex;
|
||||
|
||||
/* For current referencing point of interface, route-map,
|
||||
access-list etc... */
|
||||
void *index;
|
||||
|
||||
/* For multiple level index treatment such as key chain and key. */
|
||||
void *index_sub;
|
||||
|
||||
/* For escape character. */
|
||||
unsigned char escape;
|
||||
|
||||
/* Current vty status. */
|
||||
enum { VTY_NORMAL, VTY_CLOSE, VTY_MORE, VTY_MORELINE } status;
|
||||
|
||||
/* IAC handling: was the last character received the IAC
|
||||
* (interpret-as-command) escape character (and therefore the next
|
||||
* character will be the command code)? Refer to Telnet RFC 854. */
|
||||
unsigned char iac;
|
||||
|
||||
/* IAC SB (option subnegotiation) handling */
|
||||
unsigned char iac_sb_in_progress;
|
||||
/* At the moment, we care only about the NAWS (window size) negotiation,
|
||||
* and that requires just a 5-character buffer (RFC 1073):
|
||||
* <NAWS char> <16-bit width> <16-bit height> */
|
||||
#define TELNET_NAWS_SB_LEN 5
|
||||
unsigned char sb_buf[TELNET_NAWS_SB_LEN];
|
||||
/* How many subnegotiation characters have we received? We just drop
|
||||
* those that do not fit in the buffer. */
|
||||
size_t sb_len;
|
||||
|
||||
/* Window width/height. */
|
||||
int width;
|
||||
int height;
|
||||
|
||||
/* Configure lines. */
|
||||
int lines;
|
||||
|
||||
int monitor;
|
||||
|
||||
/* In configure mode. */
|
||||
int config;
|
||||
};
|
||||
|
||||
/* Small macro to determine newline is newline only or linefeed needed. */
|
||||
#define VTY_NEWLINE ((vty->type == VTY_TERM) ? "\r\n" : "\n")
|
||||
|
||||
static inline char *vty_newline(struct vty *vty)
|
||||
{
|
||||
return VTY_NEWLINE;
|
||||
}
|
||||
|
||||
/* Prototypes. */
|
||||
void vty_init (void);
|
||||
void vty_init_vtysh (void);
|
||||
void vty_reset (void);
|
||||
struct vty *vty_new (void);
|
||||
struct vty *vty_create (int vty_sock);
|
||||
int vty_out (struct vty *, const char *, ...) PRINTF_ATTRIBUTE(2, 3);
|
||||
int vty_out_newline(struct vty *);
|
||||
int vty_read(struct vty *vty);
|
||||
void vty_read_config (char *, char *);
|
||||
void vty_time_print (struct vty *, int);
|
||||
void vty_close (struct vty *);
|
||||
char *vty_get_cwd (void);
|
||||
void vty_log (const char *level, const char *proto, const char *fmt, va_list);
|
||||
int vty_config_lock (struct vty *);
|
||||
int vty_config_unlock (struct vty *);
|
||||
int vty_shell (struct vty *);
|
||||
int vty_shell_serv (struct vty *);
|
||||
void vty_hello (struct vty *);
|
||||
|
||||
|
||||
#endif
|
|
@ -2,7 +2,7 @@ INCLUDES = $(all_includes) -I$(top_srcdir)/include
|
|||
AM_CFLAGS=-Wall
|
||||
|
||||
sbin_PROGRAMS = bsc_hack bs11_config ipaccess-find
|
||||
noinst_LIBRARIES = libbsc.a
|
||||
noinst_LIBRARIES = libbsc.a libvty.a
|
||||
|
||||
libbsc_a_SOURCES = abis_rsl.c abis_nm.c gsm_04_08.c gsm_data.c \
|
||||
gsm_subscriber.c msgb.c select.c chan_alloc.c timer.c debug.c db.c \
|
||||
|
@ -10,6 +10,8 @@ libbsc_a_SOURCES = abis_rsl.c abis_nm.c gsm_04_08.c gsm_data.c \
|
|||
trau_frame.c trau_mux.c paging.c e1_config.c e1_input.c tlv_parser.c \
|
||||
input/misdn.c input/ipaccess.c signal.c gsm_utils.c
|
||||
|
||||
libvty_a_SOURCES = vty/buffer.c vty/command.c vty/vector.c vty/vty.c
|
||||
|
||||
bsc_hack_SOURCES = bsc_hack.c
|
||||
bsc_hack_LDADD = libbsc.a -ldl -ldbi
|
||||
|
||||
|
|
|
@ -0,0 +1,460 @@
|
|||
/*
|
||||
* Buffering of output and input.
|
||||
* Copyright (C) 1998 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra 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, or (at your
|
||||
* option) any later version.
|
||||
*
|
||||
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the
|
||||
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
|
||||
* Boston, MA 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <string.h>
|
||||
#include <errno.h>
|
||||
#include <stddef.h>
|
||||
#include <sys/uio.h>
|
||||
|
||||
#include <vty/buffer.h>
|
||||
#include <vty/vty.h>
|
||||
|
||||
/* Buffer master. */
|
||||
struct buffer {
|
||||
/* Data list. */
|
||||
struct buffer_data *head;
|
||||
struct buffer_data *tail;
|
||||
|
||||
/* Size of each buffer_data chunk. */
|
||||
size_t size;
|
||||
};
|
||||
|
||||
/* Data container. */
|
||||
struct buffer_data {
|
||||
struct buffer_data *next;
|
||||
|
||||
/* Location to add new data. */
|
||||
size_t cp;
|
||||
|
||||
/* Pointer to data not yet flushed. */
|
||||
size_t sp;
|
||||
|
||||
/* Actual data stream (variable length). */
|
||||
unsigned char data[0]; /* real dimension is buffer->size */
|
||||
};
|
||||
|
||||
/* It should always be true that: 0 <= sp <= cp <= size */
|
||||
|
||||
/* Default buffer size (used if none specified). It is rounded up to the
|
||||
next page boundery. */
|
||||
#define BUFFER_SIZE_DEFAULT 4096
|
||||
|
||||
#define BUFFER_DATA_FREE(D) free((D))
|
||||
|
||||
/* Make new buffer. */
|
||||
struct buffer *buffer_new(size_t size)
|
||||
{
|
||||
struct buffer *b;
|
||||
|
||||
b = calloc(1, sizeof(struct buffer));
|
||||
|
||||
if (size)
|
||||
b->size = size;
|
||||
else {
|
||||
static size_t default_size;
|
||||
if (!default_size) {
|
||||
long pgsz = sysconf(_SC_PAGESIZE);
|
||||
default_size =
|
||||
((((BUFFER_SIZE_DEFAULT - 1) / pgsz) + 1) * pgsz);
|
||||
}
|
||||
b->size = default_size;
|
||||
}
|
||||
|
||||
return b;
|
||||
}
|
||||
|
||||
/* Free buffer. */
|
||||
void buffer_free(struct buffer *b)
|
||||
{
|
||||
buffer_reset(b);
|
||||
free(b);
|
||||
}
|
||||
|
||||
/* Make string clone. */
|
||||
char *buffer_getstr(struct buffer *b)
|
||||
{
|
||||
size_t totlen = 0;
|
||||
struct buffer_data *data;
|
||||
char *s;
|
||||
char *p;
|
||||
|
||||
for (data = b->head; data; data = data->next)
|
||||
totlen += data->cp - data->sp;
|
||||
if (!(s = malloc(totlen + 1)))
|
||||
return NULL;
|
||||
p = s;
|
||||
for (data = b->head; data; data = data->next) {
|
||||
memcpy(p, data->data + data->sp, data->cp - data->sp);
|
||||
p += data->cp - data->sp;
|
||||
}
|
||||
*p = '\0';
|
||||
return s;
|
||||
}
|
||||
|
||||
/* Return 1 if buffer is empty. */
|
||||
int buffer_empty(struct buffer *b)
|
||||
{
|
||||
return (b->head == NULL);
|
||||
}
|
||||
|
||||
/* Clear and free all allocated data. */
|
||||
void buffer_reset(struct buffer *b)
|
||||
{
|
||||
struct buffer_data *data;
|
||||
struct buffer_data *next;
|
||||
|
||||
for (data = b->head; data; data = next) {
|
||||
next = data->next;
|
||||
BUFFER_DATA_FREE(data);
|
||||
}
|
||||
b->head = b->tail = NULL;
|
||||
}
|
||||
|
||||
/* Add buffer_data to the end of buffer. */
|
||||
static struct buffer_data *buffer_add(struct buffer *b)
|
||||
{
|
||||
struct buffer_data *d;
|
||||
|
||||
d = malloc(offsetof(struct buffer_data, data[b->size]));
|
||||
if (!d)
|
||||
return NULL;
|
||||
d->cp = d->sp = 0;
|
||||
d->next = NULL;
|
||||
|
||||
if (b->tail)
|
||||
b->tail->next = d;
|
||||
else
|
||||
b->head = d;
|
||||
b->tail = d;
|
||||
|
||||
return d;
|
||||
}
|
||||
|
||||
/* Write data to buffer. */
|
||||
void buffer_put(struct buffer *b, const void *p, size_t size)
|
||||
{
|
||||
struct buffer_data *data = b->tail;
|
||||
const char *ptr = p;
|
||||
|
||||
/* We use even last one byte of data buffer. */
|
||||
while (size) {
|
||||
size_t chunk;
|
||||
|
||||
/* If there is no data buffer add it. */
|
||||
if (data == NULL || data->cp == b->size)
|
||||
data = buffer_add(b);
|
||||
|
||||
chunk =
|
||||
((size <=
|
||||
(b->size - data->cp)) ? size : (b->size - data->cp));
|
||||
memcpy((data->data + data->cp), ptr, chunk);
|
||||
size -= chunk;
|
||||
ptr += chunk;
|
||||
data->cp += chunk;
|
||||
}
|
||||
}
|
||||
|
||||
/* Insert character into the buffer. */
|
||||
void buffer_putc(struct buffer *b, u_char c)
|
||||
{
|
||||
buffer_put(b, &c, 1);
|
||||
}
|
||||
|
||||
/* Put string to the buffer. */
|
||||
void buffer_putstr(struct buffer *b, const char *c)
|
||||
{
|
||||
buffer_put(b, c, strlen(c));
|
||||
}
|
||||
|
||||
/* Keep flushing data to the fd until the buffer is empty or an error is
|
||||
encountered or the operation would block. */
|
||||
buffer_status_t buffer_flush_all(struct buffer *b, int fd)
|
||||
{
|
||||
buffer_status_t ret;
|
||||
struct buffer_data *head;
|
||||
size_t head_sp;
|
||||
|
||||
if (!b->head)
|
||||
return BUFFER_EMPTY;
|
||||
head_sp = (head = b->head)->sp;
|
||||
/* Flush all data. */
|
||||
while ((ret = buffer_flush_available(b, fd)) == BUFFER_PENDING) {
|
||||
if ((b->head == head) && (head_sp == head->sp)
|
||||
&& (errno != EINTR))
|
||||
/* No data was flushed, so kernel buffer must be full. */
|
||||
return ret;
|
||||
head_sp = (head = b->head)->sp;
|
||||
}
|
||||
|
||||
return ret;
|
||||
}
|
||||
|
||||
#if 0
|
||||
/* Flush enough data to fill a terminal window of the given scene (used only
|
||||
by vty telnet interface). */
|
||||
buffer_status_t
|
||||
buffer_flush_window(struct buffer * b, int fd, int width, int height,
|
||||
int erase_flag, int no_more_flag)
|
||||
{
|
||||
int nbytes;
|
||||
int iov_alloc;
|
||||
int iov_index;
|
||||
struct iovec *iov;
|
||||
struct iovec small_iov[3];
|
||||
char more[] = " --More-- ";
|
||||
char erase[] =
|
||||
{ 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
|
||||
' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' ',
|
||||
0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08
|
||||
};
|
||||
struct buffer_data *data;
|
||||
int column;
|
||||
|
||||
if (!b->head)
|
||||
return BUFFER_EMPTY;
|
||||
|
||||
if (height < 1) {
|
||||
zlog_warn
|
||||
("%s called with non-positive window height %d, forcing to 1",
|
||||
__func__, height);
|
||||
height = 1;
|
||||
} else if (height >= 2)
|
||||
height--;
|
||||
if (width < 1) {
|
||||
zlog_warn
|
||||
("%s called with non-positive window width %d, forcing to 1",
|
||||
__func__, width);
|
||||
width = 1;
|
||||
}
|
||||
|
||||
/* For erase and more data add two to b's buffer_data count. */
|
||||
if (b->head->next == NULL) {
|
||||
iov_alloc = sizeof(small_iov) / sizeof(small_iov[0]);
|
||||
iov = small_iov;
|
||||
} else {
|
||||
iov_alloc = ((height * (width + 2)) / b->size) + 10;
|
||||
iov = XMALLOC(MTYPE_TMP, iov_alloc * sizeof(*iov));
|
||||
}
|
||||
iov_index = 0;
|
||||
|
||||
/* Previously print out is performed. */
|
||||
if (erase_flag) {
|
||||
iov[iov_index].iov_base = erase;
|
||||
iov[iov_index].iov_len = sizeof erase;
|
||||
iov_index++;
|
||||
}
|
||||
|
||||
/* Output data. */
|
||||
column = 1; /* Column position of next character displayed. */
|
||||
for (data = b->head; data && (height > 0); data = data->next) {
|
||||
size_t cp;
|
||||
|
||||
cp = data->sp;
|
||||
while ((cp < data->cp) && (height > 0)) {
|
||||
/* Calculate lines remaining and column position after displaying
|
||||
this character. */
|
||||
if (data->data[cp] == '\r')
|
||||
column = 1;
|
||||
else if ((data->data[cp] == '\n') || (column == width)) {
|
||||
column = 1;
|
||||
height--;
|
||||
} else
|
||||
column++;
|
||||
cp++;
|
||||
}
|
||||
iov[iov_index].iov_base = (char *)(data->data + data->sp);
|
||||
iov[iov_index++].iov_len = cp - data->sp;
|
||||
data->sp = cp;
|
||||
|
||||
if (iov_index == iov_alloc)
|
||||
/* This should not ordinarily happen. */
|
||||
{
|
||||
iov_alloc *= 2;
|
||||
if (iov != small_iov) {
|
||||
zlog_warn("%s: growing iov array to %d; "
|
||||
"width %d, height %d, size %lu",
|
||||
__func__, iov_alloc, width, height,
|
||||
(u_long) b->size);
|
||||
iov =
|
||||
XREALLOC(MTYPE_TMP, iov,
|
||||
iov_alloc * sizeof(*iov));
|
||||
} else {
|
||||
/* This should absolutely never occur. */
|
||||
zlog_err
|
||||
("%s: corruption detected: iov_small overflowed; "
|
||||
"head %p, tail %p, head->next %p",
|
||||
__func__, b->head, b->tail, b->head->next);
|
||||
iov =
|
||||
XMALLOC(MTYPE_TMP,
|
||||
iov_alloc * sizeof(*iov));
|
||||
memcpy(iov, small_iov, sizeof(small_iov));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* In case of `more' display need. */
|
||||
if (b->tail && (b->tail->sp < b->tail->cp) && !no_more_flag) {
|
||||
iov[iov_index].iov_base = more;
|
||||
iov[iov_index].iov_len = sizeof more;
|
||||
iov_index++;
|
||||
}
|
||||
#ifdef IOV_MAX
|
||||
/* IOV_MAX are normally defined in <sys/uio.h> , Posix.1g.
|
||||
example: Solaris2.6 are defined IOV_MAX size at 16. */
|
||||
{
|
||||
struct iovec *c_iov = iov;
|
||||
nbytes = 0; /* Make sure it's initialized. */
|
||||
|
||||
while (iov_index > 0) {
|
||||
int iov_size;
|
||||
|
||||
iov_size =
|
||||
((iov_index > IOV_MAX) ? IOV_MAX : iov_index);
|
||||
if ((nbytes = writev(fd, c_iov, iov_size)) < 0) {
|
||||
zlog_warn("%s: writev to fd %d failed: %s",
|
||||
__func__, fd, safe_strerror(errno));
|
||||
break;
|
||||
}
|
||||
|
||||
/* move pointer io-vector */
|
||||
c_iov += iov_size;
|
||||
iov_index -= iov_size;
|
||||
}
|
||||
}
|
||||
#else /* IOV_MAX */
|
||||
if ((nbytes = writev(fd, iov, iov_index)) < 0)
|
||||
zlog_warn("%s: writev to fd %d failed: %s",
|
||||
__func__, fd, safe_strerror(errno));
|
||||
#endif /* IOV_MAX */
|
||||
|
||||
/* Free printed buffer data. */
|
||||
while (b->head && (b->head->sp == b->head->cp)) {
|
||||
struct buffer_data *del;
|
||||
if (!(b->head = (del = b->head)->next))
|
||||
b->tail = NULL;
|
||||
BUFFER_DATA_FREE(del);
|
||||
}
|
||||
|
||||
if (iov != small_iov)
|
||||
XFREE(MTYPE_TMP, iov);
|
||||
|
||||
return (nbytes < 0) ? BUFFER_ERROR :
|
||||
(b->head ? BUFFER_PENDING : BUFFER_EMPTY);
|
||||
}
|
||||
#endif
|
||||
|
||||
/* This function (unlike other buffer_flush* functions above) is designed
|
||||
to work with non-blocking sockets. It does not attempt to write out
|
||||
all of the queued data, just a "big" chunk. It returns 0 if it was
|
||||
able to empty out the buffers completely, 1 if more flushing is
|
||||
required later, or -1 on a fatal write error. */
|
||||
buffer_status_t buffer_flush_available(struct buffer * b, int fd)
|
||||
{
|
||||
|
||||
/* These are just reasonable values to make sure a significant amount of
|
||||
data is written. There's no need to go crazy and try to write it all
|
||||
in one shot. */
|
||||
#ifdef IOV_MAX
|
||||
#define MAX_CHUNKS ((IOV_MAX >= 16) ? 16 : IOV_MAX)
|
||||
#else
|
||||
#define MAX_CHUNKS 16
|
||||
#endif
|
||||
#define MAX_FLUSH 131072
|
||||
|
||||
struct buffer_data *d;
|
||||
size_t written;
|
||||
struct iovec iov[MAX_CHUNKS];
|
||||
size_t iovcnt = 0;
|
||||
size_t nbyte = 0;
|
||||
|
||||
for (d = b->head; d && (iovcnt < MAX_CHUNKS) && (nbyte < MAX_FLUSH);
|
||||
d = d->next, iovcnt++) {
|
||||
iov[iovcnt].iov_base = d->data + d->sp;
|
||||
nbyte += (iov[iovcnt].iov_len = d->cp - d->sp);
|
||||
}
|
||||
|
||||
if (!nbyte)
|
||||
/* No data to flush: should we issue a warning message? */
|
||||
return BUFFER_EMPTY;
|
||||
|
||||
/* only place where written should be sign compared */
|
||||
if ((ssize_t) (written = writev(fd, iov, iovcnt)) < 0) {
|
||||
if (ERRNO_IO_RETRY(errno))
|
||||
/* Calling code should try again later. */
|
||||
return BUFFER_PENDING;
|
||||
return BUFFER_ERROR;
|
||||
}
|
||||
|
||||
/* Free printed buffer data. */
|
||||
while (written > 0) {
|
||||
struct buffer_data *d;
|
||||
if (!(d = b->head))
|
||||
break;
|
||||
if (written < d->cp - d->sp) {
|
||||
d->sp += written;
|
||||
return BUFFER_PENDING;
|
||||
}
|
||||
|
||||
written -= (d->cp - d->sp);
|
||||
if (!(b->head = d->next))
|
||||
b->tail = NULL;
|
||||
BUFFER_DATA_FREE(d);
|
||||
}
|
||||
|
||||
return b->head ? BUFFER_PENDING : BUFFER_EMPTY;
|
||||
|
||||
#undef MAX_CHUNKS
|
||||
#undef MAX_FLUSH
|
||||
}
|
||||
|
||||
buffer_status_t
|
||||
buffer_write(struct buffer * b, int fd, const void *p, size_t size)
|
||||
{
|
||||
ssize_t nbytes;
|
||||
|
||||
#if 0
|
||||
/* Should we attempt to drain any previously buffered data? This could help reduce latency in pushing out the data if we are stuck in a long-running thread that is preventing the main select loop from calling the flush thread... */
|
||||
|
||||
if (b->head && (buffer_flush_available(b, fd) == BUFFER_ERROR))
|
||||
return BUFFER_ERROR;
|
||||
#endif
|
||||
if (b->head)
|
||||
/* Buffer is not empty, so do not attempt to write the new data. */
|
||||
nbytes = 0;
|
||||
else if ((nbytes = write(fd, p, size)) < 0) {
|
||||
if (ERRNO_IO_RETRY(errno))
|
||||
nbytes = 0;
|
||||
else
|
||||
return BUFFER_ERROR;
|
||||
}
|
||||
/* Add any remaining data to the buffer. */
|
||||
{
|
||||
size_t written = nbytes;
|
||||
if (written < size)
|
||||
buffer_put(b, ((const char *)p) + written,
|
||||
size - written);
|
||||
}
|
||||
return b->head ? BUFFER_PENDING : BUFFER_EMPTY;
|
||||
}
|
|
@ -0,0 +1,5 @@
|
|||
#define QUAGGA_PROGNAME "OpenBSC"
|
||||
#define QUAGGA_VERSION "0.01"
|
||||
#define QUAGGA_COPYRIGHT "Harald Welte <laforge@gnumonks.org>"
|
||||
#define CONFIGFILE_MASK 022
|
||||
#define SYSCONFDIR "/usr/local/etc"
|
File diff suppressed because it is too large
Load Diff
|
@ -0,0 +1,186 @@
|
|||
/* Generic vector interface routine
|
||||
* Copyright (C) 1997 Kunihiro Ishiguro
|
||||
*
|
||||
* This file is part of GNU Zebra.
|
||||
*
|
||||
* GNU Zebra 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, or (at your option) any
|
||||
* later version.
|
||||
*
|
||||
* GNU Zebra 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 GNU Zebra; see the file COPYING. If not, write to the Free
|
||||
* Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
|
||||
* 02111-1307, USA.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#include <vty/vector.h>
|
||||
#include <memory.h>
|
||||
|
||||
/* Initialize vector : allocate memory and return vector. */
|
||||
vector vector_init(unsigned int size)
|
||||
{
|
||||
vector v = calloc(1, sizeof(struct _vector));
|
||||
if (!v)
|
||||
return NULL;
|
||||
|
||||
/* allocate at least one slot */
|
||||
if (size == 0)
|
||||
size = 1;
|
||||
|
||||
v->alloced = size;
|
||||
v->active = 0;
|
||||
v->index = calloc(1, sizeof(void *) * size);
|
||||
if (!v->index) {
|
||||
free(v);
|
||||
return NULL;
|
||||
}
|
||||
return v;
|
||||
}
|
||||
|
||||
void vector_only_wrapper_free(vector v)
|
||||
{
|
||||
free(v);
|
||||
}
|
||||
|
||||
void vector_only_index_free(void *index)
|
||||
{
|
||||
free(index);
|
||||
}
|
||||
|
||||
void vector_free(vector v)
|
||||
{
|
||||
free(v->index);
|
||||
free(v);
|
||||
}
|
||||
|
||||
vector vector_copy(vector v)
|
||||
{
|
||||
unsigned int size;
|
||||
vector new = calloc(1, sizeof(struct _vector));
|
||||
if (!new)
|
||||
return NULL;
|
||||
|
||||
new->active = v->active;
|
||||
new->alloced = v->alloced;
|
||||
|
||||
size = sizeof(void *) * (v->alloced);
|
||||
new->index = calloc(1, size);
|
||||
if (!new->index) {
|
||||
free(new);
|
||||
return NULL;
|
||||
}
|
||||
memcpy(new->index, v->index, size);
|
||||
|
||||
return new;
|
||||
}
|
||||
|
||||
/* Check assigned index, and if it runs short double index pointer */
|
||||
void vector_ensure(vector v, unsigned int num)
|
||||
{
|
||||
if (v->alloced > num)
|
||||
return;
|
||||
|
||||
v->index = realloc(v->index, sizeof(void *) * (v->alloced * 2));
|
||||
memset(&v->index[v->alloced], 0, sizeof(void *) * v->alloced);
|
||||
v->alloced *= 2;
|
||||
|
||||
if (v->alloced <= num)
|
||||
vector_ensure(v, num);
|
||||
}
|
||||
|
||||
/* This function only returns next empty slot index. It dose not mean
|
||||
the slot's index memory is assigned, please call vector_ensure()
|
||||
after calling this function. */
|
||||
int vector_empty_slot(vector v)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
if (v->active == 0)
|
||||
return 0;
|
||||
|
||||
for (i = 0; i < v->active; i++)
|
||||
if (v->index[i] == 0)
|
||||
return i;
|
||||
|
||||
return i;
|
||||
}
|
||||
|
||||
/* Set value to the smallest empty slot. */
|
||||
int vector_set(vector v, void *val)
|
||||
{
|
||||
unsigned int i;
|
||||
|
||||
i = vector_empty_slot(v);
|
||||
vector_ensure(v, i);
|
||||
|
||||
v->index[i] = val;
|
||||
|
||||
if (v->active <= i)
|
||||
v->active = i + 1;
|
||||
|
||||
return i;
|
||||
}
|
||||
|
||||
/* Set value to specified index slot. */
|
||||
int vector_set_index(vector v, unsigned int i, void *val)
|
||||
{
|
||||
vector_ensure(v, i);
|
||||
|
||||
v->index[i] = val;
|
||||
|
||||
if (v->active <= i)
|
||||
v->active = i + 1;
|
||||
|
||||
return i;
|
||||
}
|
||||
|
||||
/* Look up vector. */
|
||||
void *vector_lookup(vector v, unsigned int i)
|
||||
{
|
||||
if (i >= v->active)
|
||||
return NULL;
|
||||
return v->index[i];
|
||||
}
|
||||
|
||||
/* Lookup vector, ensure it. */
|
||||
void *vector_lookup_ensure(vector v, unsigned int i)
|
||||
{
|
||||
vector_ensure(v, i);
|
||||
return v->index[i];
|
||||
}
|
||||
|
||||
/* Unset value at specified index slot. */
|
||||
void vector_unset(vector v, unsigned int i)
|
||||
{
|
||||
if (i >= v->alloced)
|
||||
return;
|
||||
|
||||
v->index[i] = NULL;
|
||||
|
||||
if (i + 1 == v->active) {
|
||||
v->active--;
|
||||
while (i && v->index[--i] == NULL && v->active--) ; /* Is this ugly ? */
|
||||
}
|
||||
}
|
||||
|
||||
/* Count the number of not emplty slot. */
|
||||
unsigned int vector_count(vector v)
|
||||
{
|
||||
unsigned int i;
|
||||
unsigned count = 0;
|
||||
|
||||
for (i = 0; i < v->active; i++)
|
||||
if (v->index[i] != NULL)
|
||||
count++;
|
||||
|
||||
return count;
|
||||
}
|
File diff suppressed because it is too large
Load Diff
Loading…
Reference in New Issue