You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
118 lines
4.1 KiB
118 lines
4.1 KiB
/* |
|
* Copyright (c) 2001-2004 Swedish Institute of Computer Science. |
|
* 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. |
|
* 3. The name of the author may not be used to endorse or promote products |
|
* derived from this software without specific prior written permission. |
|
* |
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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. |
|
* |
|
* This file is part of the lwIP TCP/IP stack. |
|
* |
|
* Author: Martin Hentschel <info@cl-soft.de> |
|
* |
|
*/ |
|
|
|
using System; |
|
using System.Text; |
|
using CCodeGeneration; |
|
|
|
namespace LwipSnmpCodeGeneration |
|
{ |
|
public class SnmpScalarNodeOctetString : SnmpScalarNode |
|
{ |
|
public SnmpScalarNodeOctetString(SnmpDataType dataType, SnmpTreeNode parentNode) |
|
: base(parentNode) |
|
{ |
|
System.Diagnostics.Debug.Assert( |
|
(dataType == SnmpDataType.OctetString) || |
|
(dataType == SnmpDataType.Opaque) || |
|
(dataType == SnmpDataType.IpAddress)); |
|
|
|
this.DataType = dataType; |
|
} |
|
|
|
protected override void GenerateGetMethodCodeCore(CodeContainerBase container, string localValueVarName, ref bool localValueVarUsed, string retLenVarName) |
|
{ |
|
if (this.Restrictions.Count > 0) |
|
{ |
|
StringBuilder ifCond = new StringBuilder(); |
|
foreach (IRestriction restriction in this.Restrictions) |
|
{ |
|
ifCond.Append(restriction.GetCheckCodeValid(retLenVarName)); |
|
ifCond.Append(" || "); |
|
} |
|
|
|
ifCond.Length -= 4; |
|
container.AddElement(new Comment("TODO: take care of len restrictions defined in MIB: " + ifCond, singleLine: true)); |
|
} |
|
base.GenerateGetMethodCodeCore(container, localValueVarName, ref localValueVarUsed, retLenVarName); |
|
} |
|
|
|
protected override void GenerateTestMethodCodeCore(CodeContainerBase container, string localValueVarName, ref bool localValueVarUsed, string lenVarName, ref bool lenVarUsed, string retErrVarName) |
|
{ |
|
System.Diagnostics.Trace.Assert(this.Restrictions.Count > 0); |
|
|
|
// checks refer to length of octet string |
|
StringBuilder ifCond = new StringBuilder(); |
|
foreach (IRestriction restriction in this.Restrictions) |
|
{ |
|
ifCond.Append(restriction.GetCheckCodeValid(lenVarName)); |
|
ifCond.Append(" || "); |
|
|
|
lenVarUsed = true; |
|
} |
|
|
|
ifCond.Length -= 4; |
|
|
|
IfThenElse ite = new IfThenElse(ifCond.ToString()); |
|
ite.AddCode(String.Format("{0} = {1};", retErrVarName, LwipDefs.Def_ErrorCode_Ok)); |
|
container.AddElement(ite); |
|
} |
|
|
|
public override int OidRepresentationLen |
|
{ |
|
get |
|
{ |
|
// check restrictions if we are set to one fixed length |
|
if ((this.Restrictions != null) && (this.Restrictions.Count > 0)) |
|
{ |
|
foreach (IRestriction restriction in this.Restrictions) |
|
{ |
|
if (restriction is IsInRangeRestriction) |
|
{ |
|
if ((restriction as IsInRangeRestriction).RangeStart == (restriction as IsInRangeRestriction).RangeEnd) |
|
{ |
|
return (int)(restriction as IsInRangeRestriction).RangeStart; |
|
} |
|
} |
|
else if (restriction is IsEqualRestriction) |
|
{ |
|
return (int)(restriction as IsEqualRestriction).Value; |
|
} |
|
} |
|
} |
|
|
|
return -1; // variable length |
|
} |
|
} |
|
|
|
} |
|
}
|
|
|