421 |
mateuszvis |
1 |
/* This file is part of the SvarCOM project and is published under the terms
|
|
|
2 |
* of the MIT license.
|
|
|
3 |
*
|
963 |
mateusz.vi |
4 |
* Copyright (C) 2021-2022 Mateusz Viste
|
421 |
mateuszvis |
5 |
*
|
|
|
6 |
* Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
7 |
* copy of this software and associated documentation files (the "Software"),
|
|
|
8 |
* to deal in the Software without restriction, including without limitation
|
|
|
9 |
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
|
|
|
10 |
* and/or sell copies of the Software, and to permit persons to whom the
|
|
|
11 |
* Software is furnished to do so, subject to the following conditions:
|
|
|
12 |
*
|
|
|
13 |
* The above copyright notice and this permission notice shall be included in
|
|
|
14 |
* all copies or substantial portions of the Software.
|
|
|
15 |
*
|
|
|
16 |
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
17 |
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
18 |
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
19 |
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
20 |
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
|
21 |
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
|
|
|
22 |
* DEALINGS IN THE SOFTWARE.
|
|
|
23 |
*/
|
|
|
24 |
|
351 |
mateuszvis |
25 |
#ifndef RMODINIT_H
|
|
|
26 |
#define RMODINIT_H
|
|
|
27 |
|
1023 |
mateusz.vi |
28 |
#include "helpers.h" /* struct DTA definition */
|
|
|
29 |
|
494 |
mateuszvis |
30 |
#define FLAG_EXEC_AND_QUIT 1
|
|
|
31 |
#define FLAG_PERMANENT 2
|
|
|
32 |
#define FLAG_ECHOFLAG 4
|
|
|
33 |
#define FLAG_ECHO_BEFORE_BAT 8
|
|
|
34 |
#define FLAG_SKIP_AUTOEXEC 16
|
1001 |
mateusz.vi |
35 |
#define FLAG_STEPBYSTEP 32
|
449 |
mateuszvis |
36 |
|
1001 |
mateusz.vi |
37 |
|
949 |
mateusz.vi |
38 |
/* batch context structure used to track what batch file is being executed,
|
|
|
39 |
* at what line, arguments, whether or not it has a parent batch... */
|
|
|
40 |
struct batctx {
|
|
|
41 |
char fname[130]; /* truename of batch file being processed */
|
|
|
42 |
char argv[130]; /* args of the batch call (0-separated) */
|
1001 |
mateusz.vi |
43 |
unsigned char flags; /* used for step-by-step execution */
|
949 |
mateusz.vi |
44 |
unsigned long nextline; /* offset in file of next bat line to process */
|
|
|
45 |
struct batctx far *parent; /* parent context if this batch was CALLed */
|
|
|
46 |
};
|
|
|
47 |
|
1023 |
mateusz.vi |
48 |
/* for context structure used to track the execution of the ongoing FOR loop */
|
|
|
49 |
struct forctx {
|
|
|
50 |
char cmd[130]; /* copy of the original FOR command */
|
1024 |
mateusz.vi |
51 |
struct DTA dta; /* DTA for FindNext on current pattern */
|
1023 |
mateusz.vi |
52 |
unsigned short curpat; /* cmd offset of currently processed pattern */
|
1024 |
mateusz.vi |
53 |
unsigned short nextpat; /* cmd offset of next pattern to be processed */
|
1023 |
mateusz.vi |
54 |
unsigned short exec; /* cmd offset of the command to be executed */
|
1024 |
mateusz.vi |
55 |
char varname; /* single char of variable name */
|
1023 |
mateusz.vi |
56 |
unsigned char dta_inited; /* 0=requires FindFirst 1=FindNext */
|
|
|
57 |
};
|
|
|
58 |
|
449 |
mateuszvis |
59 |
struct rmod_props {
|
450 |
mateuszvis |
60 |
unsigned short rmodseg; /* segment where rmod is loaded */
|
|
|
61 |
unsigned long origparent; /* original parent (far ptr) of the shell */
|
453 |
mateuszvis |
62 |
unsigned short origenvseg; /* original environment segment */
|
450 |
mateuszvis |
63 |
unsigned char flags; /* command line parameters */
|
572 |
mateuszvis |
64 |
unsigned char version; /* used to detect mismatch between rmod and SvarCOM */
|
543 |
mateuszvis |
65 |
char awaitingcmd[130]; /* command to exec next time (if any) */
|
1023 |
mateusz.vi |
66 |
struct batctx far *bat; /* linked list of bat contexts, if BAT ongoing */
|
|
|
67 |
struct forctx far *forloop; /* a single FOR loop structure, if FOR ongoing */
|
449 |
mateuszvis |
68 |
};
|
|
|
69 |
|
459 |
mateuszvis |
70 |
#define RMOD_OFFSET_ENVSEG 0x2C /* stored in rmod's PSP */
|
983 |
mateusz.vi |
71 |
#define RMOD_OFFSET_INPUTBUF (0x100 + 0x08)
|
|
|
72 |
#define RMOD_OFFSET_COMSPECPTR (0x100 + 0xCE)
|
|
|
73 |
#define RMOD_OFFSET_BOOTDRIVE (0x100 + 0xD0)
|
|
|
74 |
#define RMOD_OFFSET_LEXITCODE (0x100 + 0xDF)
|
|
|
75 |
#define RMOD_OFFSET_EXECPARAM (0x100 + 0xE0)
|
|
|
76 |
#define RMOD_OFFSET_EXECPROG (0x100 + 0xEE)
|
1041 |
mateusz.vi |
77 |
#define RMOD_OFFSET_STDINFILE (0x100 + 0x16E)
|
983 |
mateusz.vi |
78 |
#define RMOD_OFFSET_STDOUTFILE (0x100 + 0x1EE)
|
|
|
79 |
#define RMOD_OFFSET_STDOUTAPP (0x100 + 0x26E)
|
|
|
80 |
#define RMOD_OFFSET_STDIN_DEL (0x100 + 0x270)
|
|
|
81 |
#define RMOD_OFFSET_BRKHANDLER (0x100 + 0x271)
|
1178 |
mateusz.vi |
82 |
#define RMOD_OFFSET_ROUTINE (0x100 + 0x276)
|
351 |
mateuszvis |
83 |
|
479 |
mateuszvis |
84 |
struct rmod_props far *rmod_install(unsigned short envsize, unsigned char *rmodcore, unsigned short rmodcore_len);
|
|
|
85 |
struct rmod_props far *rmod_find(unsigned short rmodcore_len);
|
367 |
mateuszvis |
86 |
void rmod_updatecomspecptr(unsigned short rmod_seg, unsigned short env_seg);
|
351 |
mateuszvis |
87 |
|
957 |
mateusz.vi |
88 |
/* allocates bytes of far memory, flags it as belonging to rmod
|
|
|
89 |
* the new block can be optionally flagged as 'ident' (if not null) and zero
|
|
|
90 |
* out the newly allocated memory.
|
|
|
91 |
* returns a far ptr to the allocated block, or NULL on error */
|
|
|
92 |
void far *rmod_fcalloc(unsigned short bytes, unsigned short rmod_seg, char *ident);
|
|
|
93 |
|
|
|
94 |
/* free memory previously allocated by rmod_fcalloc() */
|
949 |
mateusz.vi |
95 |
void rmod_ffree(void far *ptr);
|
|
|
96 |
|
963 |
mateusz.vi |
97 |
/* free the entire linked list of bat ctx nodes (and set its rmod ptr to NULL) */
|
|
|
98 |
void rmod_free_bat_llist(struct rmod_props far *rmod);
|
|
|
99 |
|
351 |
mateuszvis |
100 |
#endif
|