of Tru64 UNIX) that define TRUE and FALSE.
Fixes to some Tru64 compiler warnings.
svn path=/trunk/; revision=3120
Fixes to the Q.931 dissector
}
+Albert Chin <china@thewrittenword.com> {
+ Fixes to Lemon to get it to compile on platforms (such as some
+ versions of Tru64 UNIX) that define TRUE and FALSE
+ Fixes to some Tru64 compiler warninngs
+}
+
Alain Magloire <alainm@rcsm.ece.mcgill.ca> was kind enough to
give his permission to use his version of snprintf.c.
James E. Flemer <jflemer@acm.jhu.edu>
Peter Lei <peterlei@cisco.com>
Thomas Gimpel <thomas.gimpel@ferrari.de>
+ Albert Chin <china@thewrittenword.com>
Alain Magloire <alainm@rcsm.ece.mcgill.ca> was kind enough to give his
permission to use his version of snprintf.c.
* Copyright 1999, Uwe Girlich <Uwe.Girlich@philosys.de>
* Copyright 2000, Mike Frisch <frisch@hummingbird.com> (NFSv4 decoding)
*
- * $Id: packet-nfs.c,v 1.49 2001/03/06 18:27:07 gram Exp $
+ * $Id: packet-nfs.c,v 1.50 2001/03/09 04:35:22 guy Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
{ 0, NULL }
};
-guint *nfsv4_operation_ett[] =
+gint *nfsv4_operation_ett[] =
{
&ett_nfs_access4 ,
&ett_nfs_close4 ,
* ISO 10589 ISIS (Intradomain Routeing Information Exchange Protocol)
* ISO 9542 ESIS (End System To Intermediate System Routeing Exchange Protocol)
*
- * $Id: packet-osi-options.c,v 1.5 2001/02/05 02:47:31 guy Exp $
+ * $Id: packet-osi-options.c,v 1.6 2001/03/09 04:35:22 guy Exp $
* Ralf Schneider <Ralf.Schneider@t-online.de>
*
* Ethereal - Network traffic analyzer
val_to_str( tmp_type, osi_opt_qos_sub_vals, "Unknown (0x%x)") );
}
}
-};
+}
+
void
dissect_option_route( u_char parm_type, u_char offset, u_char parm_len,
tvbuff_t *tvb, proto_tree *tree ) {
print_nsap_net( tvb_get_ptr(tvb, this_hop + 1, netl), netl ) );
this_hop += 1 + netl;
}
-};
+}
proto_tree_add_text( tree, tvb, offset, len,
"Reason for discard: UNKNOWN Error Class" );
}
-};
+}
/* ############################## Dissection Functions ###################### */
offset += parm_len;
}
}
-}; /* dissect-osi-options */
+} /* dissect-osi-options */
/*
&ott_osi_redirect,
};
proto_register_subtree_array( ott, array_length(ott));
-};
-
+}
*
* Copyright 2000, Heikki Vatiainen <hessu@cs.tut.fi>
*
- * $Id: packet-sip.c,v 1.13 2001/01/30 02:38:33 gerald Exp $
+ * $Id: packet-sip.c,v 1.14 2001/03/09 04:35:22 guy Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
/* Required function calls to register the header fields and subtrees used */
proto_register_field_array(proto_sip, hf, array_length(hf));
proto_register_subtree_array(ett, array_length(ett));
-};
+}
void
proto_reg_handoff_sip(void)
* In particular I have not had an opportunity to see how it
* responds to SRVLOC over TCP.
*
- * $Id: packet-srvloc.c,v 1.21 2001/01/22 08:54:06 guy Exp $
+ * $Id: packet-srvloc.c,v 1.22 2001/03/09 04:35:22 guy Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
tvb_format_text(tvb, offset, length));
offset += length;
return offset;
-};
+}
/* Packet dissection routine called by tcp & udp when port 427 detected */
proto_tree_add_text(srvloc_tree, tvb, offset, tvb_length_remaining(tvb, offset), "Unknown Function Type");
};
};
-};
+}
/* Register protocol with Ethereal. */
*
* Routines to dissect WTLS component of WAP traffic.
*
- * $Id: packet-wtls.c,v 1.3 2001/02/19 21:02:33 guy Exp $
+ * $Id: packet-wtls.c,v 1.4 2001/03/09 04:35:22 guy Exp $
*
* Ethereal - Network traffic analyzer
* By Gerald Combs <gerald@zing.org>
proto_register_subtree_array(ett, array_length(ett));
register_dissector("wtls", dissect_wtls, proto_wtls);
-};
+}
void
proto_reg_handoff_wtls(void)
** drh@acm.org
** http://www.hwaci.com/drh/
**
-** $Id: lemon.c,v 1.5 2001/02/15 09:25:38 guy Exp $
+** $Id: lemon.c,v 1.6 2001/03/09 04:35:25 guy Exp $
*/
#include <stdio.h>
#include <stdarg.h>
** Principal data structures for the LEMON parser generator.
*/
-typedef enum {FALSE=0, TRUE} Boolean;
+typedef enum {BOOL_FALSE=0, BOOL_TRUE} Boolean;
/* Symbols (terminals and nonterminals) of the grammar are stored
** in the following: */
int progress;
for(i=0; i<lemp->nsymbol; i++){
- lemp->symbols[i]->lambda = FALSE;
+ lemp->symbols[i]->lambda = BOOL_FALSE;
}
for(i=lemp->nterminal; i<lemp->nsymbol; i++){
lemp->symbols[i]->firstset = SetNew();
for(rp=lemp->rule; rp; rp=rp->next){
if( rp->lhs->lambda ) continue;
for(i=0; i<rp->nrhs; i++){
- if( rp->rhs[i]->lambda==FALSE ) break;
+ if( rp->rhs[i]->lambda==BOOL_FALSE ) break;
}
if( i==rp->nrhs ){
- rp->lhs->lambda = TRUE;
+ rp->lhs->lambda = BOOL_TRUE;
progress = 1;
}
}
progress += SetAdd(s1->firstset,s2->index);
break;
}else if( s1==s2 ){
- if( s1->lambda==FALSE ) break;
+ if( s1->lambda==BOOL_FALSE ) break;
}else{
progress += SetUnion(s1->firstset,s2->firstset);
- if( s2->lambda==FALSE ) break;
+ if( s2->lambda==BOOL_FALSE ) break;
}
}
}
}
/* Report an error for each rule that can never be reduced. */
- for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = FALSE;
+ for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = BOOL_FALSE;
for(i=0; i<lemp->nstate; i++){
struct action *ap;
for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){
- if( ap->type==REDUCE ) ap->x.rp->canReduce = TRUE;
+ if( ap->type==REDUCE ) ap->x.rp->canReduce = BOOL_TRUE;
}
}
for(rp=lemp->rule; rp; rp=rp->next){
break;
}else{
SetUnion(newcfp->fws,xsp->firstset);
- if( xsp->lambda==FALSE ) break;
+ if( xsp->lambda==BOOL_FALSE ) break;
}
}
if( i==rp->nrhs ) Plink_add(&cfp->fplp,newcfp);
sp->prec = -1;
sp->assoc = UNK;
sp->firstset = 0;
- sp->lambda = FALSE;
+ sp->lambda = BOOL_FALSE;
sp->destructor = 0;
sp->datatype = 0;
Symbol_insert(sp,sp->name);