Lines Matching refs:machine
42 interface on a machine, the problem is expressed well as a simple
43 state-machine, as shown in RFC2131. However, when a DHCP agent is
49 machine, the event-driven model is the closest match.
161 For IPv4, each DHCP state machine manages a single IP address and
164 each DHCP state machine manages a group of addresses, and is
172 This state machine then points to the main LIF used for I/O, and to a
187 back, it must know which state machine this packet is for (it must get
194 on the state machine use dhcp_smach_t, and so on.
215 on another state machine), eventually checks to see if an acceptable
217 state machine's current state (SELECTING, REQUESTING, etc) helps
219 if while the agent is waiting for an OFFER on a given state machine,
221 agent knows to send back an error since the state machine must be in
236 asynchronous action), of which each state machine can have at most
239 transaction per state machine. Typical "asynchronous transactions"
258 action on that state machine. If the transaction is unable to
276 can be at most one asynchronous action per state machine, there can
277 also be at most one `ipc_action' per state machine (this means it can
397 gethrtime() returns time T, and then the machine is suspended for 2
403 assumption that all finite leases have expired while the machine was