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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
|
;; -----------------------------------------------------------------------
;;
;; Copyright 2007 H. Peter Anvin - All Rights Reserved
;;
;; This program 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, Inc., 53 Temple Place Ste 330,
;; Boston MA 02111-1307, USA; either version 2 of the License, or
;; (at your option) any later version; incorporated herein by reference.
;;
;; -----------------------------------------------------------------------
;;
;; adv.inc
;;
;; The auxillary data vector and its routines
;;
;; The auxillary data vector is a 512-byte aligned block that on the
;; disk-based derivatives can be part of the syslinux file itself. It
;; exists in two copies; when written, both copies are written (with a
;; sync in between, if from the operating system.) The first two
;; dwords are magic number and inverse checksum, then follows the data
;; area as a tagged array similar to BOOTP/DHCP, finally a tail
;; signature.
;;
;; Note that unlike BOOTP/DHCP, zero terminates the chain, and FF
;; has no special meaning.
;;
;;
;; List of ADV tags...
;;
ADV_BOOTONCE equ 1
;;
;; Other ADV data...
;;
ADV_MAGIC1 equ 0x5a2d2fa5 ; Head signature
ADV_MAGIC2 equ 0xa3041767 ; Total checksum
ADV_MAGIC3 equ 0xdd28bf64 ; Tail signature
ADV_LEN equ 500 ; Data bytes
adv_retries equ 6 ; Disk retries
section .adv
; Introduce the ADVs to valid but blank
adv0:
.head resd 1
.csum resd 1
.data resb ADV_LEN
.tail resd 1
.end
adv1:
.head resd 1
.csum resd 1
.data resb ADV_LEN
.tail resd 1
.end
section .text
;
; This is called after config file parsing, so we know
; the intended location of the ADV
;
adv_init:
cmp byte [ADVDrive],-1
jne adv_read
;%if IS_SYSLINUX || IS_MDSLINUX || IS_EXTLINUX
%if IS_EXTLINUX ; Not yet implemented for the other derivatives
;
; Update pointers to default ADVs...
;
mov bx,[LDLSectors]
shl bx,2
mov ecx,[bsHidden]
mov eax,[bx+SectorPtrs-8]
mov edx,[bx+SectorPtrs-4]
add eax,ecx
add edx,ecx
mov [ADVSec0],eax
mov [ADVSec1],edx
mov al,[DriveNumber]
mov [ADVDrive],al
%endif
; ** fall through to adv_verify **
;
; Initialize the ADV data structure in memory
;
adv_verify:
mov si,adv0
call .check_adv
jz .ok ; Primary ADV okay
mov si,adv1
call .check_adv
jz .adv1ok
; Neither ADV is usable; initialize to blank
mov si,adv0
mov eax,ADV_MAGIC1
stosd
mov eax,ADV_MAGIC2
stosd
xor eax,eax
mov cx,ADV_LEN/4
rep stosd
mov eax,ADV_MAGIC3
stosd
.ok:
ret
; The primary ADV is bad, but the backup is OK
.adv1ok:
mov di,adv0
mov cx,512/4
rep movsd
ret
; SI points to the putative ADV; unchanged by routine
; ZF=1 on return if good
.check_adv:
push si
lodsd
cmp eax,ADV_MAGIC1
jne .done ; ZF=0, i.e. bad
xor edx,edx
mov cx,ADV_LEN/4+1 ; Remaining dwords
.csum:
lodsd
add edx,eax
loop .csum
cmp edx,ADV_MAGIC2
jne .done
lodsd
cmp eax,ADV_MAGIC3
.done:
pop si
ret
;
; adv_get: find an ADV string if present
;
; Input: DL = ADV ID
; Output: CX = byte count (zero on not found)
; SI = pointer to data
; DL = unchanged
;
; Assumes CS == DS.
;
adv_get:
push ax
mov si,adv0.data
xor ax,ax ; Keep AH=0 at all times
.loop:
lodsb ; Read ID
cmp al,dl
je .found
and al,al
jz .end
lodsb ; Read length
add si,ax
cmp si,adv0.tail
jb .loop
jmp .end
.found:
lodsb
mov cx,ax
add ax,si ; Make sure it fits
cmp ax,adv0.tail
jbe .ok
.end:
xor cx,cx
.ok:
pop ax
ret
;
; adv_set: insert a string into the ADV in memory
;
; Input: DL = ADV ID
; FS:BX = input buffer
; CX = byte count (max = 255!)
; Output: CF=1 on error
; CX clobbered
;
; Assumes CS == DS == ES.
;
adv_set:
push ax
push si
push di
and ch,ch
jnz .overflow
push cx
mov si,adv0.data
xor ax,ax
.loop:
lodsb
cmp al,dl
je .found
and al,al
jz .endz
lodsb
add si,ax
cmp si,adv0.tail
jb .loop
jmp .end
.found: ; Found, need to delete old copy
lodsb
lea di,[si-2]
push di
add si,ax
mov cx,adv0.tail
sub cx,si
jb .nukeit
rep movsb ; Remove the old one
mov [di],ah ; Termination zero
pop si
jmp .loop
.nukeit:
pop si
jmp .end
.endz:
dec si
.end:
; Now SI points to where we want to put our data
pop cx
mov di,si
jcxz .empty
add si,cx
cmp si,adv0.tail-2
jae .overflow ; CF=0
mov si,bx
mov al,dl
stosb
mov al,cl
stosb
fs rep movsb
.empty:
mov cx,adv0.tail
sub cx,di
xor ax,ax
rep stosb ; Zero-fill remainder
clc
.done:
pop di
pop si
pop ax
ret
.overflow:
stc
jmp .done
;
; adv_cleanup: checksum adv0 and copy to adv1
; Assumes CS == DS == ES.
;
adv_cleanup:
pushad
mov si,adv0.data
mov cx,ADV_LEN/4
xor edx,edx
.loop:
lodsd
add edx,eax
loop .loop
mov eax,ADV_MAGIC2
sub eax,edx
lea di,[si+4] ; adv1
mov si,adv0
mov [si+4],eax ; Store checksum
mov cx,(ADV_LEN+12)/4
rep movsd
popad
ret
;
; adv_write: write the ADV to disk.
;
; Location is in memory variables.
; Assumes CS == DS == ES.
;
; Returns CF=1 if the ADV cannot be written.
;
adv_write:
cmp dword [ADVSec0],0
je .bad
cmp dword [ADVSec1],0
je .bad
push ax
call adv_cleanup
mov ah,3 ; Write
call adv_read_write
pop ax
clc
ret
.bad: ; No location for ADV set
stc
ret
;
; adv_read: read the ADV from disk
;
; Location is in memory variables.
; Assumes CS == DS == ES.
;
adv_read:
push ax
mov ah,2 ; Read
call adv_read_write
call adv_verify
pop ax
ret
;
; adv_read_write: disk I/O for the ADV
;
; On input, AH=2 for read, AH=3 for write.
; Assumes CS == DS == ES.
;
adv_read_write:
mov [ADVOp],ah
pushad
mov dl,[ADVDrive]
and dl,dl
; Floppies: can't trust INT 13h 08h, we better know
; the geometry a priori, which means it better be our
; boot device. Handle that later.
; jns .floppy ; Floppy drive... urk
mov ah,08h ; Get disk parameters
int 13h
jc .noparm
and ah,ah
jnz .noparm
shr dx,8
inc dx
mov [ADVHeads],dx
and cx,3fh
mov [ADVSecPerTrack],cx
.noparm:
; Check for EDD
mov bx,55AAh
mov ah,41h ; EDD existence query
mov dl,[ADVDrive]
int 13h
mov si,.cbios
jc .noedd
mov si,.ebios
.noedd:
mov eax,[ADVSec0]
mov bx,adv0
call .doone
mov eax,[ADVSec1]
mov bx,adv1
call .doone
popad
ret
.doone:
xor edx,edx ; Zero-extend LBA
push si
jmp si
.ebios:
mov cx,adv_retries
.eb_retry:
; Form DAPA on stack
push edx
push eax
push es
push bx
push word 1 ; Sector count
push word 16 ; DAPA size
mov si,sp
pushad
mov dl,[ADVDrive]
mov ax,4080h
or ah,[ADVOp]
push ds
push ss
pop ds
int 13h
pop ds
popad
lea sp,[si+16] ; Remove DAPA
jc .eb_error
pop si
ret
.eb_error:
loop .eb_retry
stc
pop si
ret
.cbios:
push edx
push eax
push bp
movzx esi,word [ADVSecPerTrack]
movzx edi,word [ADVHeads]
;
; Dividing by sectors to get (track,sector): we may have
; up to 2^18 tracks, so we need to use 32-bit arithmetric.
;
div esi
xor cx,cx
xchg cx,dx ; CX <- sector index (0-based)
; EDX <- 0
; eax = track #
div edi ; Convert track to head/cyl
; Watch out for overflow, we might be writing!
cmp eax,1023
ja .cb_overflow
;
; Now we have AX = cyl, DX = head, CX = sector (0-based),
; BP = sectors to transfer, SI = bsSecPerTrack,
; ES:BX = data target
;
shl ah,6 ; Because IBM was STOOPID
; and thought 8 bits were enough
; then thought 10 bits were enough...
inc cx ; Sector numbers are 1-based, sigh
or cl,ah
mov ch,al
mov dh,dl
mov dl,[ADVDrive]
xchg ax,bp ; Sector to transfer count
mov ah,[ADVOp] ; Operation
mov bp,adv_retries
.cb_retry:
pushad
int 13h
popad
jc .cb_error
.cb_done:
pop bp
pop eax
pop edx
ret
.cb_error:
dec bp
jnz .cb_retry
.cb_overflow:
stc
jmp .cb_done
section .data
align 4, db 0
ADVDrive db -1 ; No ADV defined
section .bss
alignb 4
ADVSec0 resd 1
ADVSec1 resd 1
ADVSecPerTrack resw 1
ADVHeads resw 1
ADVOp resb 1
|