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
/*
This file is part of Donet.
Copyright © 2024 Max Rodriguez
Donet is free software; you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License,
as published by the Free Software Foundation, either version 3
of the License, or (at your option) any later version.
Donet 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public
License along with Donet. If not, see <https://www.gnu.org/licenses/>.
*/
//! Representation of arbitrary and historical
//! keywords as defined in the DC file.
use crate::hashgen::*;
use multimap::MultiMap;
/// This is a flag bitmask for historical keywords.
/// Panda uses a C/C++ 'int' for this, which is stored
/// as 4 bytes in modern 32-bit and 64-bit C/C++ compilers.
pub type HistoricalFlag = i32;
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct DCKeyword {
name: String,
// This flag is only kept for historical reasons, so we can
// preserve the DC file's hash code if no new flags are in use.
historical_flag: HistoricalFlag,
}
impl From<interim::DCKeyword> for DCKeyword {
fn from(value: interim::DCKeyword) -> Self {
Self {
name: value.name,
historical_flag: value.historical_flag,
}
}
}
impl std::fmt::Display for DCKeyword {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
write!(f, "keyword ")?;
f.write_str(&self.name)?;
writeln!(f, ";")
}
}
impl LegacyDCHash for DCKeyword {
fn generate_hash(&self, hashgen: &mut DCHashGenerator) {
hashgen.add_string(self.name.clone());
}
}
impl DCKeyword {
#[inline]
pub fn get_name(&self) -> String {
self.name.clone()
}
#[inline]
pub fn get_historical_flag(&self) -> HistoricalFlag {
self.historical_flag
}
}
/// A map of key/value pairs mapping keyword names to DCKeyword struct pointers.
pub type KeywordName2Keyword<'dc> = MultiMap<String, &'dc DCKeyword>;
/// Represents the two types of inputs that `DCKeywordList.has_keyword`
/// accepts for looking up a Keyword. In Panda and Astron, the
/// `has_keyword` method is overloaded instead.
pub enum IdentifyKeyword {
ByStruct(DCKeyword),
ByName(String),
}
/// This is a list of [`DCKeyword`] structures, which represent
/// communication keywords that may be set on a particular field.
#[derive(Debug)]
pub struct DCKeywordList<'dc> {
keywords: Vec<&'dc DCKeyword>,
kw_name_2_keyword: KeywordName2Keyword<'dc>,
flags: HistoricalFlag,
}
impl<'dc> std::cmp::PartialEq for DCKeywordList<'dc> {
fn eq(&self, other: &Self) -> bool {
let target_kw_map: KeywordName2Keyword = other._get_keywords_by_name_map();
// If our maps are different sizes, they are already not the same.
if self.kw_name_2_keyword.len() != target_kw_map.len() {
return false;
}
// Since MultiMap does not implement the Eq trait,
// we have to iterate through both maps and compare.
for key in self.kw_name_2_keyword.keys() {
if !target_kw_map.contains_key(key) {
return false;
}
}
true // no differences found
}
}
impl<'dc> std::fmt::Display for DCKeywordList<'dc> {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
for (i, kw) in self.keywords.iter().enumerate() {
// We do not call the fmt::Display impl of [`DCKeyword`] here,
// as that formats it as a declaration, not use in a field's
// keyword list. So, we just need to format the kw identifier.
f.write_str(&kw.name)?;
if i != self.keywords.len() - 1 {
write!(f, " ")?;
}
}
writeln!(f, ";")
}
}
impl<'dc> LegacyDCHash for DCKeywordList<'dc> {
fn generate_hash(&self, hashgen: &mut DCHashGenerator) {
if self.flags != !0 {
// All of the flags are historical flags only, so add just the flags
// bitmask to keep the hash code the same as it has historically been.
hashgen.add_int(self.flags);
} else {
hashgen.add_int(self.keywords.len().try_into().unwrap());
for keyword in &self.keywords {
keyword.generate_hash(hashgen);
}
}
}
}
impl<'dc> DCKeywordList<'dc> {
/// Returns the number of keywords in this keyword list.
pub fn get_num_keywords(&self) -> usize {
self.keywords.len()
}
/// Returns `true` if given keyword identifier or struct
/// is present in this keyword list.
pub fn has_keyword(&self, kw: IdentifyKeyword) -> bool {
match kw {
IdentifyKeyword::ByName(kw_id) => self.get_keyword_by_name(kw_id).is_some(),
IdentifyKeyword::ByStruct(kw_obj) => {
for keyword in &self.keywords {
if **keyword == kw_obj {
return true;
}
}
false // no match found
}
}
}
/// Returns [`DCKeyword`] reference by index, wrapped in an Option.
pub fn get_keyword(&self, index: usize) -> Option<&'dc DCKeyword> {
self.keywords.get(index).copied()
}
/// Returns [`DCKeyword`] reference by given name, wrapped in an Option.
pub fn get_keyword_by_name(&self, name: String) -> Option<&'dc DCKeyword> {
self.kw_name_2_keyword.get(&name).copied()
}
/// Returns a clone of this object's keyword name map.
pub fn _get_keywords_by_name_map(&self) -> KeywordName2Keyword {
self.kw_name_2_keyword.clone()
}
}
/// Contains intermediate keyword structures and logic
/// for semantic analysis as the keyword/lists is being built.
pub(crate) mod interim {
use super::HistoricalFlag;
use crate::parser::ast;
use crate::parser::lexer::Span;
use multimap::MultiMap;
use std::rc::Rc;
#[derive(Debug)]
pub struct DCKeyword {
pub span: Span,
pub name: String,
pub historical_flag: HistoricalFlag,
}
impl From<ast::KeywordDefinition> for DCKeyword {
fn from(value: ast::KeywordDefinition) -> Self {
Self {
span: value.span,
name: value.identifier,
historical_flag: {
if value.historical {
// Sets the historical flag bitmask to the bitwise complement of 0
// (!0 in Rust, or ~0 in C/C++), as if the keyword were not one
// of the historically defined keywords.
!0
} else {
0
}
},
}
}
}
#[derive(Debug)]
pub struct DCKeywordList {
pub keywords: Vec<Rc<DCKeyword>>,
pub kw_name_2_keyword: MultiMap<String, Rc<DCKeyword>>,
pub flags: HistoricalFlag,
}
impl Default for DCKeywordList {
fn default() -> Self {
Self {
keywords: vec![],
kw_name_2_keyword: MultiMap::new(),
// Panda initializes its keyword list class with the flags bitmask
// set to 0 as a regular int (signed). But, it still confuses me why
// since a clear bitmask (no historical kw flags) is the bitwise complement of 0.
flags: 0_i32,
}
}
}
impl DCKeywordList {
pub fn add_keyword(&mut self, keyword: DCKeyword) -> Result<(), ()> {
let kw_name: String = keyword.name.clone(); // avoid moving 'name'
if self.kw_name_2_keyword.get(&kw_name).is_some() {
return Err(()); // keyword is already in our list!
}
// Mixes the bitmask of this keyword into our KW list flags bitmask.
self.flags |= keyword.historical_flag;
self.keywords.push(Rc::new(keyword));
self.kw_name_2_keyword
.insert(kw_name, self.keywords.last().unwrap().clone());
Ok(())
}
/// Overwrites the DCKeywords of this list with the target's DCKeywords.
pub fn copy_keywords(&mut self, target: &DCKeywordList) {
let target_kw_array: Vec<Rc<DCKeyword>> = target._get_keyword_list();
let target_kw_map: MultiMap<String, Rc<DCKeyword>> = target._get_keywords_by_name_map();
self.keywords = target_kw_array; // old vec will be dropped from memory
self.kw_name_2_keyword = target_kw_map;
}
/// Returns a clone of this object's keyword array.
pub fn _get_keyword_list(&self) -> Vec<Rc<DCKeyword>> {
self.keywords.clone()
}
/// Returns a clone of this object's keyword name map.
pub fn _get_keywords_by_name_map(&self) -> MultiMap<String, Rc<DCKeyword>> {
self.kw_name_2_keyword.clone()
}
/// Clears the DCKeywords array, keyword name map, and
/// historical flags bitmask from this [`DCKeywordList`] struct.
pub fn clear_keywords(&mut self) {
self.keywords.clear();
self.kw_name_2_keyword.clear();
self.flags = 0_i32;
}
}
}