hachem.wtf
aboutsummaryrefslogtreecommitdiff
path: root/kernel/fs.rv
blob: 0c98c3645a1c9155260241f65fdf7629d65b6eda (plain)
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
# revelfs, a tiny fat style filesystem, now an object you talk to as fs:method()
#
# on disk layout for the 16 mib test disk (32768 sectors):
#   sector 0        superblock (magic + total sectors)
#   sectors 1..8    directory, 128 entries of 32 bytes (16 per sector)
#   sectors 9..136  fat, one 2 byte entry per sector on the whole disk
#   sectors 137..   file data, one block == one sector
# a fat entry points at the next block in a files chain, 0 is free, END is the last

const SB_LBA = 0
const DIR_LBA = 1
const DIR_SECTORS = 8
const DIR_ENTRIES = 128
const FAT_LBA = 9
const FAT_SECTORS = 128
const DATA_LBA = 137
const BLOCK = 512
const NAME_MAX = 24
const MAGIC = 0x53465652   # "RVFS" little endian
const END = 0xffff         # end of chain marker in the fat

# pure index math, no state, so theyre plain helpers not methods
fn dir_lba(i) DIR_LBA + (i shr 4)
fn dir_off(i) (i band 15) * 32

# buf is a scratch sector for the superblock/directory/data, fat is a separate
# scratch sector so fat lookups dont trample a directory sector were mid edit
global fs = {
  buf = 0, fat = 0, ready = :false, total = 0,

  fat_get = fn(self, block) do
    disk_read(FAT_LBA + (block shr 8), self.fat)
    mem_read(self.fat + (block band 255) * 2, 2)
  end,

  fat_set = fn(self, block, val) do
    const lba = FAT_LBA + (block shr 8)
    disk_read(lba, self.fat)
    mem_write(self.fat + (block band 255) * 2, val, 2)
    disk_write(lba, self.fat)
  end,

  # first free data block, or 0 if full. scans a whole fat sector per read so this
  # isnt snails pace
  fat_alloc = fn(self) do
    let block = DATA_LBA
    while block < self.total do
      disk_read(FAT_LBA + (block shr 8), self.fat)
      let off = block band 255
      while (off < 256 and block < self.total) do
        if mem_read(self.fat + off * 2, 2) == 0 return block
        off += 1
        block += 1
      end
    end
    0
  end,

  free_chain = fn(self, first) do
    let block = first
    while (block != 0 and block != END) do
      const nxt = self:fat_get(block)
      self:fat_set(block, 0)
      block = nxt
    end
  end,

  # dir entry is 32 bytes: 
  # +0 used
  # +1 name len
  # +2 first block
  # +4 size
  # +8 name
  name_at = fn(self, base, len) do
    let out = ""
    for k in 0..len do out = out ~ string.of_ascii(mem_read(base + 8 + k, 1)) end
    out
  end,

  name_matches = fn(self, base, target) do
    const len = mem_read(base + 1, 1)
    if len != target:len() return :false
    return self:name_at(base, len) == target
  end,

  find = fn(self, name) do
    for i in 0..DIR_ENTRIES do
      disk_read(dir_lba(i), self.buf)
      const base = self.buf + dir_off(i)
      if mem_read(base, 1) == 1 and self:name_matches(base, name) return i
    end
    return -1
  end,

  dir_alloc = fn(self) do
    for i in 0..DIR_ENTRIES do
      disk_read(dir_lba(i), self.buf)
      if mem_read(self.buf + dir_off(i), 1) == 0 return i
    end
    return -1
  end,

  mount = fn(self) do
    self.buf = frame_alloc()
    self.fat = frame_alloc()
    self.total = disk_sectors()
    if self.total == 0 do self.ready = :false return :nil end
    disk_read(SB_LBA, self.buf)
    self.ready = if mem_read(self.buf, 4) == MAGIC :true else :false
  end,

  # ready is a field so the gate cant be called `ready`, this complains if theres no fs
  ensure = fn(self) do
    if self.ready return :true
    puts("no filesystem, run mkfs first\n")
    :false
  end,

  format = fn(self) do
    if disk_sectors() == 0 do puts("mkfs: no disk\n") return :nil end
    mem_zero(self.buf, BLOCK)
    mem_write(self.buf, MAGIC, 4)
    mem_write(self.buf + 4, self.total, 4)
    disk_write(SB_LBA, self.buf)
    mem_zero(self.buf, BLOCK)
    for s in 0..DIR_SECTORS do disk_write(DIR_LBA + s, self.buf) end
    for s in 0..FAT_SECTORS do disk_write(FAT_LBA + s, self.buf) end
    self.ready = :true
    puts("formatted #{self.total} sectors, #{(self.total shr 1)} KiB\n")
  end,

  # silent core of write, returns 1 ok / 0 fail
  store = fn(self, name, text) do
    if self:ensure() == :false return 0
    if name:len() > NAME_MAX do puts("name too long (max #{NAME_MAX})\n") return 0 end
    let idx = self:find(name)
    if idx >= 0 do
      disk_read(dir_lba(idx), self.buf)
      self:free_chain(mem_read(self.buf + dir_off(idx) + 2, 2))
    end
    else do
      idx = self:dir_alloc()
      if idx < 0 do puts("directory full\n") return 0 end
    end

    const size = text:len()
    let first = 0
    let prev = 0
    let written = 0
    while written < size do
      const block = self:fat_alloc()
      if block == 0 do puts("disk full\n") return 0 end
      self:fat_set(block, END) # reserve
      if first == 0 do first = block end
      else do self:fat_set(prev, block) end
      mem_zero(self.buf, BLOCK)
      let k = 0
      while (k < BLOCK and written < size) do
        mem_write(self.buf + k, text[written]:ascii(), 1)
        k += 1
        written += 1
      end
      disk_write(block, self.buf)
      prev = block
    end

    disk_read(dir_lba(idx), self.buf)
    const base = self.buf + dir_off(idx)
    mem_write(base, 1, 1)
    mem_write(base + 1, name:len(), 1)
    mem_write(base + 2, first, 2)
    mem_write(base + 4, size, 4)
    for k in 0..name:len() do mem_write(base + 8 + k, name[k]:ascii(), 1) end
    disk_write(dir_lba(idx), self.buf)
    return 1
  end,

  # write a file, gee i wonder what a function called `write` does
  write = fn(self, name, text) do
    if self:store(name, text) == 1 puts("wrote #{name} (#{text:len()} bytes)\n")
  end,

  size = fn(self, name) do
    const idx = self:find(name)
    if idx < 0 return -1
    disk_read(dir_lba(idx), self.buf)
    return mem_read(self.buf + dir_off(idx) + 4, 4)
  end,

  # read up to len bytes from offset, returned as a string (shorter at eof)
  read_bytes = fn(self, name, offset, len) do
    const idx = self:find(name)
    if idx < 0 return ""
    disk_read(dir_lba(idx), self.buf)
    const base = self.buf + dir_off(idx)
    let block = mem_read(base + 2, 2)
    const size = mem_read(base + 4, 4)
    let stop = offset + len
    if stop > size do stop = size end
    let pos = 0
    let out = ""
    while (block != 0 and block != END and pos < stop) do
      const nxt = self:fat_get(block)
      if (pos + BLOCK > offset and pos < stop) do
        disk_read(block, self.buf)
        let k = 0
        while (k < BLOCK) do
          const abs = pos + k
          if (abs >= offset and abs < stop) do out = out ~ string.of_ascii(mem_read(self.buf + k, 1)) end
          k += 1
        end
      end
      pos += BLOCK
      block = nxt
    end
    return out
  end,

  cat = fn(self, name) do
    if self:ensure() == :false return :nil
    const idx = self:find(name)
    if idx < 0 do puts("cat: #{name}: no such file\n") return :nil end
    disk_read(dir_lba(idx), self.buf)
    const base = self.buf + dir_off(idx)
    let block = mem_read(base + 2, 2)
    let remaining = mem_read(base + 4, 4)
    let out = ""
    while (block != 0 and block != END and remaining > 0) do
      const nxt = self:fat_get(block) # grab next before disk_read reuses self.buf
      disk_read(block, self.buf)
      const chunk = if remaining > BLOCK BLOCK else remaining
      for k in 0..chunk do out = out ~ string.of_ascii(mem_read(self.buf + k, 1)) end
      remaining -= chunk
      block = nxt
    end
    puts(out)
    puts("\n")
  end,

  ls = fn(self) do
    if self:ensure() == :false return :nil
    let count = 0
    for i in 0..DIR_ENTRIES do
      disk_read(dir_lba(i), self.buf)
      const base = self.buf + dir_off(i)
      if mem_read(base, 1) == 1 do
        puts("  #{self:name_at(base, mem_read(base + 1, 1))}  #{mem_read(base + 4, 4)} bytes\n")
        count += 1
      end
    end
    if count == 0 puts("  (empty)\n")
  end,

  rm = fn(self, name) do
    if self:ensure() == :false return :nil
    const idx = self:find(name)
    if idx < 0 do puts("rm: #{name}: no such file\n") return :nil end
    disk_read(dir_lba(idx), self.buf)
    const base = self.buf + dir_off(idx)
    self:free_chain(mem_read(base + 2, 2))
    disk_read(dir_lba(idx), self.buf)
    mem_write(self.buf + dir_off(idx), 0, 1)
    disk_write(dir_lba(idx), self.buf)
    puts("removed #{name}\n")
  end,
}

global fs_store = fn(name, text) fs:store(name, text)
global fs_size = fn(name) fs:size(name)
global fs_read_bytes = fn(name, offset, len) fs:read_bytes(name, offset, len)