|
|
1.1 root 1: #ifndef MEMORY_H
2: #define MEMORY_H
3: #ifndef UNIV_H
4: #include "univ.h"
5: #endif
6: >pri
7: class Cell : public PadRcv {
8: friend Memory;
9: friend Process;
10: Memory *memory;
11: long addr;
12: int fmt;
13: int size;
14: Cell *sib;
15: Cslfd *spy;
16:
17: char *kbd(char*);
18: char *help();
19: void relative(long);
20: void indirect();
21: void reformat(long);
22: void resize(int);
23: void display(char* = 0, int=0);
24: void dodisplay(Bls&);
25: void asmblr();
26: Index carte();
27: void setspy(long);
28: int changed();
29: char *search(int, char*);
30: PUBLIC(Cell,U_CELL)
31: Cell(Memory *m) { memory = m; }
32: };
33: >
34: class Memory : public PadRcv {
35: >pub
36: char pub_filler[16];
37: >pri
38: friend Cell;
39: Pad *pad;
40: Cell *cellset;
41: Cell *current;
42: void makecell(Cell*,long);
43: char *prevpat;
44: >
45: Core *core;
46: char *kbd(char*);
47: char *help();
48: PUBLIC(Memory,U_MEMORY)
49: Memory(Core*);
50: void open(long=0);
51: void userclose();
52: void banner();
53: int changes(long=0);
54: };
55: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.