1
2
3
4
5
6
7
8
9
10
11#include <asm/idals.h>
12#include <asm/ioctl.h>
13
14
15#define TUBICMD _IO('3', 3)
16#define TUBOCMD _IO('3', 4)
17#define TUBGETI _IO('3', 7)
18#define TUBGETO _IO('3', 8)
19#define TUBSETMOD _IO('3',12)
20#define TUBGETMOD _IO('3',13)
21
22
23#define TC_WRITE 0x01
24#define TC_RDBUF 0x02
25#define TC_EWRITE 0x05
26#define TC_READMOD 0x06
27#define TC_EWRITEA 0x0d
28#define TC_WRITESF 0x11
29
30
31#define TO_SF 0x1d
32#define TO_SBA 0x11
33#define TO_IC 0x13
34#define TO_PT 0x05
35#define TO_RA 0x3c
36#define TO_SFE 0x29
37#define TO_EUA 0x12
38#define TO_MF 0x2c
39#define TO_SA 0x28
40
41
42#define TF_INPUT 0x40
43#define TF_INPUTN 0x4c
44#define TF_INMDT 0xc1
45#define TF_LOG 0x60
46
47
48#define TAT_RESET 0x00
49#define TAT_FIELD 0xc0
50#define TAT_EXTHI 0x41
51#define TAT_COLOR 0x42
52#define TAT_CHARS 0x43
53#define TAT_TRANS 0x46
54
55
56#define TAX_RESET 0x00
57#define TAX_BLINK 0xf1
58#define TAX_REVER 0xf2
59#define TAX_UNDER 0xf4
60
61
62#define TAR_RESET 0x00
63
64
65#define TAC_RESET 0x00
66#define TAC_BLUE 0xf1
67#define TAC_RED 0xf2
68#define TAC_PINK 0xf3
69#define TAC_GREEN 0xf4
70#define TAC_TURQ 0xf5
71#define TAC_YELLOW 0xf6
72#define TAC_WHITE 0xf7
73#define TAC_DEFAULT 0x00
74
75
76#define TW_NONE 0x40
77#define TW_KR 0xc2
78#define TW_PLUSALARM 0x04
79
80#define RAW3270_FIRSTMINOR 1
81#define RAW3270_MAXDEVS 255
82
83
84struct raw3270_iocb {
85 short model;
86 short line_cnt;
87 short col_cnt;
88 short pf_cnt;
89 short re_cnt;
90 short map;
91};
92
93struct raw3270;
94struct raw3270_view;
95extern struct class *class3270;
96
97
98struct raw3270_request {
99 struct list_head list;
100 struct raw3270_view *view;
101 struct ccw1 ccw;
102 void *buffer;
103 size_t size;
104 int rescnt;
105 int rc;
106
107
108 void (*callback)(struct raw3270_request *, void *);
109 void *callback_data;
110};
111
112struct raw3270_request *raw3270_request_alloc(size_t size);
113struct raw3270_request *raw3270_request_alloc_bootmem(size_t size);
114void raw3270_request_free(struct raw3270_request *);
115void raw3270_request_reset(struct raw3270_request *);
116void raw3270_request_set_cmd(struct raw3270_request *, u8 cmd);
117int raw3270_request_add_data(struct raw3270_request *, void *, size_t);
118void raw3270_request_set_data(struct raw3270_request *, void *, size_t);
119void raw3270_request_set_idal(struct raw3270_request *, struct idal_buffer *);
120
121static inline int
122raw3270_request_final(struct raw3270_request *rq)
123{
124 return list_empty(&rq->list);
125}
126
127void raw3270_buffer_address(struct raw3270 *, char *, unsigned short);
128
129
130
131
132struct raw3270_fn {
133 int (*activate)(struct raw3270_view *);
134 void (*deactivate)(struct raw3270_view *);
135 void (*intv)(struct raw3270_view *,
136 struct raw3270_request *, struct irb *);
137 void (*release)(struct raw3270_view *);
138 void (*free)(struct raw3270_view *);
139 void (*resize)(struct raw3270_view *, int, int, int);
140};
141
142
143
144
145
146
147
148
149
150struct raw3270_view {
151 struct list_head list;
152 spinlock_t lock;
153#define RAW3270_VIEW_LOCK_IRQ 0
154#define RAW3270_VIEW_LOCK_BH 1
155 atomic_t ref_count;
156 struct raw3270 *dev;
157 struct raw3270_fn *fn;
158 unsigned int model;
159 unsigned int rows, cols;
160 unsigned char *ascebc;
161};
162
163int raw3270_add_view(struct raw3270_view *, struct raw3270_fn *, int, int);
164int raw3270_activate_view(struct raw3270_view *);
165void raw3270_del_view(struct raw3270_view *);
166void raw3270_deactivate_view(struct raw3270_view *);
167struct raw3270_view *raw3270_find_view(struct raw3270_fn *, int);
168int raw3270_start(struct raw3270_view *, struct raw3270_request *);
169int raw3270_start_locked(struct raw3270_view *, struct raw3270_request *);
170int raw3270_start_irq(struct raw3270_view *, struct raw3270_request *);
171int raw3270_reset(struct raw3270_view *);
172struct raw3270_view *raw3270_view(struct raw3270_view *);
173int raw3270_view_active(struct raw3270_view *);
174
175
176static inline void
177raw3270_get_view(struct raw3270_view *view)
178{
179 atomic_inc(&view->ref_count);
180}
181
182extern wait_queue_head_t raw3270_wait_queue;
183
184static inline void
185raw3270_put_view(struct raw3270_view *view)
186{
187 if (atomic_dec_return(&view->ref_count) == 0)
188 wake_up(&raw3270_wait_queue);
189}
190
191struct raw3270 *raw3270_setup_console(void);
192void raw3270_wait_cons_dev(struct raw3270 *);
193
194
195struct raw3270_notifier {
196 struct list_head list;
197 void (*create)(int minor);
198 void (*destroy)(int minor);
199};
200
201int raw3270_register_notifier(struct raw3270_notifier *);
202void raw3270_unregister_notifier(struct raw3270_notifier *);
203void raw3270_pm_unfreeze(struct raw3270_view *);
204
205
206
207
208struct string
209{
210 struct list_head list;
211 struct list_head update;
212 unsigned long size;
213 unsigned long len;
214 char string[0];
215} __attribute__ ((aligned(8)));
216
217static inline struct string *
218alloc_string(struct list_head *free_list, unsigned long len)
219{
220 struct string *cs, *tmp;
221 unsigned long size;
222
223 size = (len + 7L) & -8L;
224 list_for_each_entry(cs, free_list, list) {
225 if (cs->size < size)
226 continue;
227 if (cs->size > size + sizeof(struct string)) {
228 char *endaddr = (char *) (cs + 1) + cs->size;
229 tmp = (struct string *) (endaddr - size) - 1;
230 tmp->size = size;
231 cs->size -= size + sizeof(struct string);
232 cs = tmp;
233 } else
234 list_del(&cs->list);
235 cs->len = len;
236 INIT_LIST_HEAD(&cs->list);
237 INIT_LIST_HEAD(&cs->update);
238 return cs;
239 }
240 return NULL;
241}
242
243static inline unsigned long
244free_string(struct list_head *free_list, struct string *cs)
245{
246 struct string *tmp;
247 struct list_head *p, *left;
248
249
250 left = free_list;
251 list_for_each(p, free_list) {
252 if (list_entry(p, struct string, list) > cs)
253 break;
254 left = p;
255 }
256
257 if (left->next != free_list) {
258 tmp = list_entry(left->next, struct string, list);
259 if ((char *) (cs + 1) + cs->size == (char *) tmp) {
260 list_del(&tmp->list);
261 cs->size += tmp->size + sizeof(struct string);
262 }
263 }
264
265 if (left != free_list) {
266 tmp = list_entry(left, struct string, list);
267 if ((char *) (tmp + 1) + tmp->size == (char *) cs) {
268 tmp->size += cs->size + sizeof(struct string);
269 return tmp->size;
270 }
271 }
272 __list_add(&cs->list, left, left->next);
273 return cs->size;
274}
275
276static inline void
277add_string_memory(struct list_head *free_list, void *mem, unsigned long size)
278{
279 struct string *cs;
280
281 cs = (struct string *) mem;
282 cs->size = size - sizeof(struct string);
283 free_string(free_list, cs);
284}
285
286