| 1 |
|
| 2 |
|
| 3 |
|
| 4 |
|
| 5 |
|
| 6 |
|
| 7 |
|
| 8 |
|
| 9 |
use crate::cbor::{self, Value}; |
| 10 |
use crate::hash::{hash_object, ObjectRef, ObjectType}; |
| 11 |
use crate::objects::{schema, ObjectError}; |
| 12 |
use std::collections::BTreeMap; |
| 13 |
|
| 14 |
type R<T> = std::result::Result<T, ObjectError>; |
| 15 |
|
| 16 |
|
| 17 |
pub const VERSION: u64 = 1; |
| 18 |
|
| 19 |
|
| 20 |
#[derive(Clone, Copy, Debug, PartialEq, Eq)] |
| 21 |
pub enum Kind { |
| 22 |
Container, |
| 23 |
RunnerImage, |
| 24 |
Package, |
| 25 |
Archive, |
| 26 |
Report, |
| 27 |
} |
| 28 |
|
| 29 |
impl Kind { |
| 30 |
pub const ALL: [Kind; 5] = [ |
| 31 |
Kind::Container, |
| 32 |
Kind::RunnerImage, |
| 33 |
Kind::Package, |
| 34 |
Kind::Archive, |
| 35 |
Kind::Report, |
| 36 |
]; |
| 37 |
|
| 38 |
pub fn as_str(self) -> &'static str { |
| 39 |
match self { |
| 40 |
Kind::Container => "container", |
| 41 |
Kind::RunnerImage => "runner-image", |
| 42 |
Kind::Package => "package", |
| 43 |
Kind::Archive => "archive", |
| 44 |
Kind::Report => "report", |
| 45 |
} |
| 46 |
} |
| 47 |
|
| 48 |
pub fn parse(s: &str) -> R<Kind> { |
| 49 |
Kind::ALL.into_iter().find(|k| k.as_str() == s).map_or_else( |
| 50 |
|| { |
| 51 |
schema(format!( |
| 52 |
"{s:?} is not a kind of artifact: {}", |
| 53 |
Kind::ALL.map(|k| k.as_str()).join(", ") |
| 54 |
)) |
| 55 |
}, |
| 56 |
Ok, |
| 57 |
) |
| 58 |
} |
| 59 |
} |
| 60 |
|
| 61 |
|
| 62 |
|
| 63 |
pub const MODE_FILE: u32 = 0o100644; |
| 64 |
pub const MODE_EXEC: u32 = 0o100755; |
| 65 |
pub const MODE_LINK: u32 = 0o120000; |
| 66 |
|
| 67 |
|
| 68 |
#[derive(Clone, Debug, PartialEq, Eq)] |
| 69 |
pub struct Entry { |
| 70 |
|
| 71 |
pub path: String, |
| 72 |
pub mode: u32, |
| 73 |
pub blob: ObjectRef, |
| 74 |
pub size: u64, |
| 75 |
} |
| 76 |
|
| 77 |
|
| 78 |
#[derive(Clone, Debug, Default, PartialEq, Eq)] |
| 79 |
pub struct DirTree { |
| 80 |
pub entries: Vec<Entry>, |
| 81 |
} |
| 82 |
|
| 83 |
fn path_ok(p: &str) -> bool { |
| 84 |
!p.is_empty() |
| 85 |
&& !p.starts_with('/') |
| 86 |
&& p.split('/').all(|s| !s.is_empty() && s != "." && s != "..") |
| 87 |
} |
| 88 |
|
| 89 |
fn obj(r: &ObjectRef) -> Value { |
| 90 |
Value::Bytes(r.0.to_vec()) |
| 91 |
} |
| 92 |
|
| 93 |
fn get_obj(v: &Value, what: &str) -> R<ObjectRef> { |
| 94 |
match v.as_bytes() { |
| 95 |
Some(b) if b.len() == 32 => { |
| 96 |
let mut a = [0u8; 32]; |
| 97 |
a.copy_from_slice(b); |
| 98 |
Ok(ObjectRef(a)) |
| 99 |
} |
| 100 |
_ => schema(format!("{what} is not an object reference")), |
| 101 |
} |
| 102 |
} |
| 103 |
|
| 104 |
fn get_text(v: &Value, what: &str) -> R<String> { |
| 105 |
v.as_text() |
| 106 |
.map(str::to_string) |
| 107 |
.map_or_else(|| schema(format!("{what} is not text")), Ok) |
| 108 |
} |
| 109 |
|
| 110 |
fn get_uint(v: &Value, what: &str) -> R<u64> { |
| 111 |
v.as_uint() |
| 112 |
.map_or_else(|| schema(format!("{what} is not a number")), Ok) |
| 113 |
} |
| 114 |
|
| 115 |
impl DirTree { |
| 116 |
pub fn encode(&self) -> Vec<u8> { |
| 117 |
let entries = self |
| 118 |
.entries |
| 119 |
.iter() |
| 120 |
.map(|e| { |
| 121 |
Value::Array(vec![ |
| 122 |
Value::Text(e.path.clone()), |
| 123 |
Value::Uint(e.mode as u64), |
| 124 |
obj(&e.blob), |
| 125 |
Value::Uint(e.size), |
| 126 |
]) |
| 127 |
}) |
| 128 |
.collect(); |
| 129 |
cbor::encode(&Value::map([ |
| 130 |
(0, Value::Uint(VERSION)), |
| 131 |
(1, Value::Array(entries)), |
| 132 |
])) |
| 133 |
} |
| 134 |
|
| 135 |
|
| 136 |
|
| 137 |
pub fn decode(bytes: &[u8]) -> R<DirTree> { |
| 138 |
let v = cbor::decode(bytes)?; |
| 139 |
let m = v.as_map().map_or_else(|| schema("a tree is a map"), Ok)?; |
| 140 |
if m.get(&0).and_then(Value::as_uint) != Some(VERSION) { |
| 141 |
return schema(format!( |
| 142 |
"tree version {:?} is not known; this reads {VERSION}", |
| 143 |
m.get(&0) |
| 144 |
)); |
| 145 |
} |
| 146 |
let mut entries = Vec::new(); |
| 147 |
for item in m.get(&1).and_then(Value::as_array).unwrap_or_default() { |
| 148 |
let [p, mode, blob, size] = item.as_array().unwrap_or_default() else { |
| 149 |
return schema("a tree entry is [path, mode, blob, size]"); |
| 150 |
}; |
| 151 |
let path = get_text(p, "a path")?; |
| 152 |
let mode = get_uint(mode, "a mode")? as u32; |
| 153 |
if !path_ok(&path) { |
| 154 |
return schema(format!("{path:?} is not a clean relative path")); |
| 155 |
} |
| 156 |
if ![MODE_FILE, MODE_EXEC, MODE_LINK].contains(&mode) { |
| 157 |
return schema(format!( |
| 158 |
"{path}: mode {mode:o} is not a file, an executable or a link" |
| 159 |
)); |
| 160 |
} |
| 161 |
if entries.last().is_some_and(|l: &Entry| l.path >= path) { |
| 162 |
return schema(format!( |
| 163 |
"{path}: entries are not in path order, or one is there twice" |
| 164 |
)); |
| 165 |
} |
| 166 |
entries.push(Entry { |
| 167 |
path, |
| 168 |
mode, |
| 169 |
blob: get_obj(blob, "a blob")?, |
| 170 |
size: get_uint(size, "a size")?, |
| 171 |
}); |
| 172 |
} |
| 173 |
Ok(DirTree { entries }) |
| 174 |
} |
| 175 |
} |
| 176 |
|
| 177 |
|
| 178 |
#[derive(Clone, Debug, PartialEq, Eq)] |
| 179 |
pub struct Artifact { |
| 180 |
pub kind: Kind, |
| 181 |
|
| 182 |
pub arch: Option<String>, |
| 183 |
|
| 184 |
pub os: Option<String>, |
| 185 |
|
| 186 |
pub tree: ObjectRef, |
| 187 |
|
| 188 |
pub entrypoint: Option<Vec<String>>, |
| 189 |
pub env: BTreeMap<String, String>, |
| 190 |
pub labels: BTreeMap<String, String>, |
| 191 |
|
| 192 |
pub total_size: u64, |
| 193 |
|
| 194 |
pub receipt: Option<ObjectRef>, |
| 195 |
} |
| 196 |
|
| 197 |
fn pairs(m: &BTreeMap<String, String>) -> Value { |
| 198 |
if m.is_empty() { |
| 199 |
return Value::Null; |
| 200 |
} |
| 201 |
Value::Array( |
| 202 |
m.iter() |
| 203 |
.map(|(k, v)| Value::Array(vec![Value::Text(k.clone()), Value::Text(v.clone())])) |
| 204 |
.collect(), |
| 205 |
) |
| 206 |
} |
| 207 |
|
| 208 |
fn get_pairs(v: Option<&Value>, what: &str) -> R<BTreeMap<String, String>> { |
| 209 |
let mut out = BTreeMap::new(); |
| 210 |
let Some(v) = v.filter(|v| !v.is_null()) else { |
| 211 |
return Ok(out); |
| 212 |
}; |
| 213 |
for p in v |
| 214 |
.as_array() |
| 215 |
.map_or_else(|| schema(format!("{what} is a list of pairs")), Ok)? |
| 216 |
{ |
| 217 |
let [k, val] = p.as_array().unwrap_or_default() else { |
| 218 |
return schema(format!("{what}: a pair is [key, value]")); |
| 219 |
}; |
| 220 |
let k = get_text(k, what)?; |
| 221 |
if out.insert(k.clone(), get_text(val, what)?).is_some() { |
| 222 |
return schema(format!("{what}: {k} is there twice")); |
| 223 |
} |
| 224 |
} |
| 225 |
Ok(out) |
| 226 |
} |
| 227 |
|
| 228 |
fn opt_text(v: &Option<String>) -> Value { |
| 229 |
v.as_ref().map_or(Value::Null, |s| Value::Text(s.clone())) |
| 230 |
} |
| 231 |
|
| 232 |
impl Artifact { |
| 233 |
|
| 234 |
pub fn encode(&self) -> Vec<u8> { |
| 235 |
let entry = self.entrypoint.as_ref().map_or(Value::Null, |a| { |
| 236 |
Value::Array(a.iter().cloned().map(Value::Text).collect()) |
| 237 |
}); |
| 238 |
cbor::encode(&Value::map([ |
| 239 |
(0, Value::Uint(VERSION)), |
| 240 |
(1, Value::Text(self.kind.as_str().into())), |
| 241 |
(2, opt_text(&self.arch)), |
| 242 |
(3, opt_text(&self.os)), |
| 243 |
(4, obj(&self.tree)), |
| 244 |
(5, entry), |
| 245 |
(6, pairs(&self.env)), |
| 246 |
(7, pairs(&self.labels)), |
| 247 |
(8, Value::Uint(self.total_size)), |
| 248 |
(9, self.receipt.as_ref().map_or(Value::Null, obj)), |
| 249 |
])) |
| 250 |
} |
| 251 |
|
| 252 |
pub fn decode(bytes: &[u8]) -> R<Artifact> { |
| 253 |
let v = cbor::decode(bytes)?; |
| 254 |
let m = v |
| 255 |
.as_map() |
| 256 |
.map_or_else(|| schema("an artifact is a map"), Ok)?; |
| 257 |
if m.get(&0).and_then(Value::as_uint) != Some(VERSION) { |
| 258 |
return schema(format!( |
| 259 |
"artifact version {:?} is not known; this reads {VERSION}", |
| 260 |
m.get(&0) |
| 261 |
)); |
| 262 |
} |
| 263 |
if let Some(k) = m.keys().find(|k| **k > 9) { |
| 264 |
return schema(format!("key {k} is not part of an artifact")); |
| 265 |
} |
| 266 |
let text = |k: u64, what: &str| -> R<Option<String>> { |
| 267 |
match m.get(&k) { |
| 268 |
None | Some(Value::Null) => Ok(None), |
| 269 |
Some(v) => get_text(v, what).map(Some), |
| 270 |
} |
| 271 |
}; |
| 272 |
let entrypoint = match m.get(&5) { |
| 273 |
None | Some(Value::Null) => None, |
| 274 |
Some(v) => Some( |
| 275 |
v.as_array() |
| 276 |
.unwrap_or_default() |
| 277 |
.iter() |
| 278 |
.map(|a| get_text(a, "the entrypoint")) |
| 279 |
.collect::<R<_>>()?, |
| 280 |
), |
| 281 |
}; |
| 282 |
let receipt = match m.get(&9) { |
| 283 |
None | Some(Value::Null) => None, |
| 284 |
Some(v) => Some(get_obj(v, "the receipt")?), |
| 285 |
}; |
| 286 |
Ok(Artifact { |
| 287 |
kind: Kind::parse(&text(1, "the kind")?.unwrap_or_default())?, |
| 288 |
arch: text(2, "the architecture")?, |
| 289 |
os: text(3, "the system")?, |
| 290 |
tree: get_obj(m.get(&4).unwrap_or(&Value::Null), "the tree")?, |
| 291 |
entrypoint, |
| 292 |
env: get_pairs(m.get(&6), "env")?, |
| 293 |
labels: get_pairs(m.get(&7), "labels")?, |
| 294 |
total_size: get_uint(m.get(&8).unwrap_or(&Value::Null), "the size")?, |
| 295 |
receipt, |
| 296 |
}) |
| 297 |
} |
| 298 |
|
| 299 |
|
| 300 |
pub fn name(&self) -> ObjectRef { |
| 301 |
hash_object(ObjectType::Artifact, &self.encode()) |
| 302 |
} |
| 303 |
} |