-- Chain handling. -- Copyright (C) 2002, 2003, 2004, 2005 Tristan Gingold -- -- GHDL 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. -- -- GHDL 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 GHDL; see the file COPYING. If not, write to the Free -- Software Foundation, 59 Temple Place - Suite 330, Boston, MA -- 02111-1307, USA. package body Vhdl.Nodes_Utils is function Get_Chain_Length (First : Iir) return Natural is Res : Natural := 0; El : Iir := First; begin while El /= Null_Iir loop Res := Res + 1; El := Get_Chain (El); end loop; return Res; end Get_Chain_Length; procedure Append_Chain (N : Iir; Field : Vhdl.Nodes_Meta.Fields_Enum; Chain : Iir) is use Vhdl.Nodes_Meta; N_Chain : Iir; Next_Chain : Iir; begin N_Chain := Get_Iir (N, Field); if Is_Null (N_Chain) then Set_Iir (N, Field, Chain); else loop Next_Chain := Get_Chain (N_Chain); if Is_Null (Next_Chain) then Set_Chain (N_Chain, Chain); exit; end if; N_Chain := Next_Chain; end loop; end if; end Append_Chain; procedure Chain_Init (First, Last : out Iir) is begin First := Null_Iir; Last := Null_Iir; end Chain_Init; procedure Chain_Append (First, Last : in out Iir; El : Iir) is begin pragma Assert (El /= Null_Iir); if First = Null_Iir then First := El; else Set_Chain (Last, El); end if; Last := El; end Chain_Append; procedure Chain_Append_Chain (First, Last : in out Iir; First_Sub, Last_Sub : Iir) is begin pragma Assert (First_Sub /= Null_Iir); if First = Null_Iir then First := First_Sub; else Set_Chain (Last, First_Sub); end if; Last := Last_Sub; end Chain_Append_Chain; procedure Chain_Append_Subchain (First, Last : in out Iir; Sub : Iir) is N : Iir; begin pragma Assert (Sub /= Null_Iir); if First = Null_Iir then First := Sub; else Set_Chain (Last, Sub); end if; -- Update last. N := Sub; while N /= Null_Iir loop Last := N; N := Get_Chain (N); end loop; end Chain_Append_Subchain; function Is_Chain_Length_One (Chain : Iir) return Boolean is begin return Chain /= Null_Iir and then Get_Chain (Chain) = Null_Iir; end Is_Chain_Length_One; procedure Insert_Incr (Last : in out Iir; El : Iir) is begin Set_Chain (El, Get_Chain (Last)); Set_Chain (Last, El); Last := El; end Insert_Incr; end Vhdl.Nodes_Utils; ac8c420'>plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
/*
             LUFA Library
     Copyright (C) Dean Camera, 2013.

  dean [at] fourwalledcubicle [dot] com
           www.lufa-lib.org
*/

/*
  Copyright 2013  Dean Camera (dean [at] fourwalledcubicle [dot] com)

  Permission to use, copy, modify, distribute, and sell this
  software and its documentation for any purpose is hereby granted
  without fee, provided that the above copyright notice appear in
  all copies and that both that the copyright notice and this
  permission notice and warranty disclaimer appear in supporting
  documentation, and that the name of the author not be used in
  advertising or publicity pertaining to distribution of the
  software without specific, written prior permission.

  The author disclaims all warranties with regard to this
  software, including all implied warranties of merchantability
  and fitness.  In no event shall the author be liable for any
  special, indirect or consequential damages or any damages
  whatsoever resulting from loss of use, data or profits, whether
  in an action of contract, negligence or other tortious action,
  arising out of or in connection with the use or performance of
  this software.
*/

/** \file
 *
 *  Common DHCP routines to manage DHCP packet data.
 */

#include "DHCPCommon.h"

#if defined(ENABLE_DHCP_CLIENT) || defined(ENABLE_DHCP_SERVER) || defined(__DOXYGEN__)

/** Sets the given DHCP option in the DHCP packet's option list. This automatically moves the
 *  end of options terminator past the new option in the options list.
 *
 *  \param[in,out] DHCPOptionList  Pointer to the start of the DHCP packet's options list
 *  \param[in]     Option          DHCP option to add to the list
 *  \param[in]     DataLen         Size in bytes of the option data to add
 *  \param[in]     OptionData      Buffer where the option's data is to be sourced from
 *
 *  \return Number of bytes added to the DHCP packet
 */
uint8_t DHCPCommon_SetOption(uint8_t* DHCPOptionList,
                             const uint8_t Option,
                             const uint8_t DataLen,
                             void* const OptionData)
{
	/* Skip through the DHCP options list until the terminator option is found */
	while (*DHCPOptionList != DHCP_OPTION_END)
	  DHCPOptionList += (DHCPOptionList[1] + 2);

	/* Overwrite the existing terminator with the new option, add a new terminator at the end of the list */
	DHCPOptionList[0] = Option;
	DHCPOptionList[1] = DataLen;
	memcpy(&DHCPOptionList[2], OptionData, DataLen);
	DHCPOptionList[2 + DataLen] = DHCP_OPTION_END;

	/* Calculate the total number of bytes added to the outgoing packet */
	return (2 + DataLen);
}

/** Retrieves the given option's data (if present) from the DHCP packet's options list.
 *
 *  \param[in,out] DHCPOptionList  Pointer to the start of the DHCP packet's options list
 *  \param[in]     Option          DHCP option to retrieve to the list
 *  \param[out]    Destination     Buffer where the option's data is to be written to if found
 *
 *  \return Boolean \c true if the option was found in the DHCP packet's options list, \c false otherwise
 */
bool DHCPCommon_GetOption(const uint8_t* DHCPOptionList,
                          const uint8_t Option,
                          void* const Destination)
{
	/* Look through the incoming DHCP packet's options list for the requested option */
	while (*DHCPOptionList != DHCP_OPTION_END)
	{
		/* Check if the current DHCP option in the packet is the one requested */
		if (DHCPOptionList[0] == Option)
		{
			/* Copy request option's data to the destination buffer */
			memcpy(Destination, &DHCPOptionList[2], DHCPOptionList[1]);

			/* Indicate that the requested option data was successfully retrieved */
			return true;
		}

		/* Skip to next DHCP option in the options list */
		DHCPOptionList += (DHCPOptionList[1] + 2);
	}

	/* Requested option not found in the incoming packet's DHCP options list */
	return false;
}

#endif