| /external/ppp/pppd/ |
| fsm.h | 2 * fsm.h - {Link, IP} Control Protocol Finite State Machine definitions.
42 * $Id: fsm.h,v 1.10 2004/11/13 02:28:15 paulus Exp $
64 * Each FSM is described by an fsm structure and fsm callbacks.
66 typedef struct fsm { struct
84 } fsm; typedef in typeref:struct:fsm
89 __P((fsm *));
91 __P((fsm *));
93 __P((fsm *, u_char *, int *))
[all...] |
| ecp.h | 39 extern fsm ecp_fsm[];
|
| ccp.h | 46 extern fsm ccp_fsm[];
|
| ipv6cp.h | 165 extern fsm ipv6cp_fsm[];
|
| fsm.c | 2 * fsm.c - {Link, IP} Control Protocol Finite State Machine.
43 #define RCSID "$Id: fsm.c,v 1.23 2004/11/13 02:28:15 paulus Exp $"
47 * Randomize fsm id on link/init.
56 #include "fsm.h"
61 static void fsm_rconfreq __P((fsm *, int, u_char *, int));
62 static void fsm_rconfack __P((fsm *, int, u_char *, int));
63 static void fsm_rconfnakrej __P((fsm *, int, int, u_char *, int));
64 static void fsm_rtermreq __P((fsm *, int, u_char *, int));
65 static void fsm_rtermack __P((fsm *));
66 static void fsm_rcoderej __P((fsm *, u_char *, int))
[all...] |
| ipcp.h | 88 extern fsm ipcp_fsm[];
|
| ipxcp.h | 88 extern fsm ipxcp_fsm[];
|
| Android.mk | 7 fsm.c \
|
| ecp.c | 67 #include "fsm.h"
118 fsm ecp_fsm[NUM_PPP];
149 fsm *f = &ecp_fsm[unit];
|
| lcp.c | 54 #include "fsm.h"
66 /* steal a bit in fsm flags word */
190 fsm lcp_fsm[NUM_PPP]; /* LCP fsm structure (global)*/
203 * Callbacks for fsm code. (CI = Configuration Information)
205 static void lcp_resetci __P((fsm *)); /* Reset our CI */
206 static int lcp_cilen __P((fsm *)); /* Return length of our CI */
207 static void lcp_addci __P((fsm *, u_char *, int *)); /* Add our CI to pkt */
208 static int lcp_ackci __P((fsm *, u_char *, int)); /* Peer ack'd our CI */
209 static int lcp_nakci __P((fsm *, u_char *, int, int)); /* Peer nak'd our CI *
[all...] |
| lcp.h | 99 extern fsm lcp_fsm[];
|
| ipxcp.c | 60 #include "fsm.h"
79 * Callbacks for fsm code. (CI = Configuration Information)
81 static void ipxcp_resetci __P((fsm *)); /* Reset our CI */
82 static int ipxcp_cilen __P((fsm *)); /* Return length of our CI */
83 static void ipxcp_addci __P((fsm *, u_char *, int *)); /* Add our CI */
84 static int ipxcp_ackci __P((fsm *, u_char *, int)); /* Peer ack'd our CI */
85 static int ipxcp_nakci __P((fsm *, u_char *, int, int));/* Peer nak'd our CI */
86 static int ipxcp_rejci __P((fsm *, u_char *, int)); /* Peer rej'd our CI */
87 static int ipxcp_reqci __P((fsm *, u_char *, int *, int)); /* Rcv CI */
88 static void ipxcp_up __P((fsm *)); /* We're UP *
[all...] |
| ipv6cp.c | 164 #include "fsm.h"
183 * Callbacks for fsm code. (CI = Configuration Information)
185 static void ipv6cp_resetci __P((fsm *)); /* Reset our CI */
186 static int ipv6cp_cilen __P((fsm *)); /* Return length of our CI */
187 static void ipv6cp_addci __P((fsm *, u_char *, int *)); /* Add our CI */
188 static int ipv6cp_ackci __P((fsm *, u_char *, int)); /* Peer ack'd our CI */
189 static int ipv6cp_nakci __P((fsm *, u_char *, int, int));/* Peer nak'd our CI */
190 static int ipv6cp_rejci __P((fsm *, u_char *, int)); /* Peer rej'd our CI */
191 static int ipv6cp_reqci __P((fsm *, u_char *, int *, int)); /* Rcv CI */
192 static void ipv6cp_up __P((fsm *)); /* We're UP *
[all...] |
| ccp.c | 37 #include "fsm.h"
199 fsm ccp_fsm[NUM_PPP];
206 * Callbacks for fsm code.
208 static void ccp_resetci __P((fsm *));
209 static int ccp_cilen __P((fsm *));
210 static void ccp_addci __P((fsm *, u_char *, int *));
211 static int ccp_ackci __P((fsm *, u_char *, int));
212 static int ccp_nakci __P((fsm *, u_char *, int, int));
213 static int ccp_rejci __P((fsm *, u_char *, int));
214 static int ccp_reqci __P((fsm *, u_char *, int *, int))
[all...] |
| Makefile.sol2 | 11 OBJS = main.o magic.o fsm.o lcp.o ipcp.o upap.o chap-new.o eap.o md5.o \
|
| ipcp.c | 60 #include "fsm.h"
100 * Callbacks for fsm code. (CI = Configuration Information)
102 static void ipcp_resetci __P((fsm *)); /* Reset our CI */
103 static int ipcp_cilen __P((fsm *)); /* Return length of our CI */
104 static void ipcp_addci __P((fsm *, u_char *, int *)); /* Add our CI */
105 static int ipcp_ackci __P((fsm *, u_char *, int)); /* Peer ack'd our CI */
106 static int ipcp_nakci __P((fsm *, u_char *, int, int));/* Peer nak'd our CI */
107 static int ipcp_rejci __P((fsm *, u_char *, int)); /* Peer rej'd our CI */
108 static int ipcp_reqci __P((fsm *, u_char *, int *, int)); /* Rcv CI */
109 static void ipcp_up __P((fsm *)); /* We're UP *
[all...] |
| Makefile.linux | 14 PPPDSRCS = main.c magic.c fsm.c lcp.c ipcp.c upap.c chap-new.c md5.c ccp.c \
18 HEADERS = ccp.h chap-new.h ecp.h fsm.h ipcp.h \
23 PPPDOBJS = main.o magic.o fsm.o lcp.o ipcp.o upap.o chap-new.o md5.o ccp.o \
|
| /external/lldb/test/pexpect-2.4/ |
| ANSI.py | 12 import FSM
16 def Emit (fsm):
18 screen = fsm.memory[0]
19 screen.write_ch(fsm.input_symbol)
21 def StartNumber (fsm):
23 fsm.memory.append (fsm.input_symbol)
25 def BuildNumber (fsm):
27 ns = fsm.memory.pop()
28 ns = ns + fsm.input_symbo
[all...] |
| FSM.py | 3 """This module implements a Finite State Machine (FSM). In addition to state
4 this FSM also maintains a user defined "memory". So this FSM can be used as a
5 Push-down Automata (PDA) since a PDA is a FSM + memory.
7 The following describes how the FSM works, but you will probably also need to
8 see the example function to understand how the FSM is used in practice.
10 You define an FSM by building tables of transitions. For a given input symbol
12 the next state will be. The FSM has a table of transitions that associate:
18 to the transition table. The FSM also has a table of transitions that
24 FSM also has one default transition that is not associated with any specifi
[all...] |
| /external/chromium_org/third_party/pexpect/ |
| ANSI.py | 30 import FSM
37 def DoEmit (fsm):
39 screen = fsm.memory[0]
40 screen.write_ch(fsm.input_symbol)
42 def DoStartNumber (fsm):
44 fsm.memory.append (fsm.input_symbol)
46 def DoBuildNumber (fsm):
48 ns = fsm.memory.pop()
49 ns = ns + fsm.input_symbo
[all...] |
| FSM.py | 3 """This module implements a Finite State Machine (FSM). In addition to state
4 this FSM also maintains a user defined "memory". So this FSM can be used as a
5 Push-down Automata (PDA) since a PDA is a FSM + memory.
7 The following describes how the FSM works, but you will probably also need to
8 see the example function to understand how the FSM is used in practice.
10 You define an FSM by building tables of transitions. For a given input symbol
12 the next state will be. The FSM has a table of transitions that associate:
18 to the transition table. The FSM also has a table of transitions that
24 FSM also has one default transition that is not associated with any specifi
[all...] |
| /external/valgrind/main/coregrind/m_debuginfo/ |
| readmacho.c | 711 vg_assert(di->fsm.have_rx_map);
712 vg_assert(di->fsm.have_rw_map);
714 for (i = 0; i < VG_(sizeXA)(di->fsm.maps); i++) {
715 struct _DebugInfoMapping* map = VG_(indexXA)(di->fsm.maps, i);
728 "%s (rx at %#lx, rw at %#lx)\n", di->fsm.filename,
733 msli = map_image_aboard( di, di->fsm.filename );
[all...] |
| debuginfo.c | 182 di->fsm.filename = ML_(dinfo_strdup)("di.debuginfo.aDI.2", filename);
183 di->fsm.maps = VG_(newXA)(
212 if (di->fsm.maps) VG_(deleteXA)(di->fsm.maps);
213 if (di->fsm.filename) ML_(dinfo_free)(di->fsm.filename);
317 curr->fsm.filename ? curr->fsm.filename
400 for (i = 0; i < VG_(sizeXA)(di1->fsm.maps); i++) {
401 struct _DebugInfoMapping* map1 = VG_(indexXA)(di1->fsm.maps, i)
[all...] |
| readelf.c | 645 vg_assert(di->fsm.have_rx_map);
[all...] |
| /external/chromium_org/third_party/codesighs/ |
| msmap2tsv.c | 1128 MSMap_ReadState fsm; local
[all...] |
