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
// SPDX-License-Identifier: GPL-2.0-or-later
/*
* libxas: Extendable Assembler Library
* Copyright (C) 2022 Amy Parker <apark0006@student.cerritos.edu>
*
* 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; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA or visit
* the GNU Project at <https://gnu.org/licenses>. The GNU General Public
* License version 2 is available at, for your convenience,
* <https://gnu.org/licenses/old-licenses/gpl-2.0.html>.
*/
// T = crate::bbu::SymConv
pub type LabelTree<T> = HashMap;
// TODO: fix inherent cloning issues with String
// also, TODO: it is absolutely not necessary for these to be ordered
// T = crate::bbu::SymConv, U = crate::bbu::PTR_SIZE
//pub type UnresSymTree<T, U> = Vec<(Box<dyn crate::bbu::ArchInstruction<T>>, U)>;
// TODO NOTE: utility function
// o = offset
/*
pub fn vec_update(s: &Vec<u8>, d: &mut Vec<u8>, o: usize) -> () {
// TODO: make this more efficient, this is slow asf
// also, TODO: make this work for Vec<T: Integral>
for e in 0..s.len() {
d[o + e] = s[e];
}
}*/