axvm 0.5.20

Virtual Machine resource management crate for ArceOS's hypervisor variant.
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

// Copyright 2025 The Axvisor Team
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

//! FDT parsing and processing functionality.

use alloc::format;

use fdt_edit::Fdt;
use fdt_raw::Header;

#[allow(dead_code)]
pub fn print_fdt(fdt_addr: usize) {
    let header = unsafe {
        core::slice::from_raw_parts(fdt_addr as *const u8, core::mem::size_of::<Header>())
    };
    let fdt_header = Header::from_bytes(header)
        .map_err(|e| format!("Failed to parse FDT header: {e:#?}"))
        .unwrap();

    let fdt_bytes = unsafe {
        core::slice::from_raw_parts(fdt_addr as *const u8, fdt_header.totalsize as usize)
    };

    let fdt = Fdt::from_bytes(fdt_bytes)
        .map_err(|e| format!("Failed to parse FDT: {e:#?}"))
        .expect("Failed to parse FDT");

    // Statistics of node count and level distribution
    let mut node_count = 0;
    let mut level_counts = alloc::collections::BTreeMap::new();
    let mut max_level = 0;

    info!("=== FDT Node Information Statistics ===");

    // Traverse all nodes once for statistics (following optimization strategy)
    for node_id in fdt.iter_node_ids() {
        let Some(node) = fdt.node(node_id) else {
            continue;
        };
        let level = fdt.path_of(node_id).matches('/').count().max(1);
        node_count += 1;

        // Count nodes by level
        *level_counts.entry(level).or_insert(0) += 1;

        // Record maximum level
        if level > max_level {
            max_level = level;
        }

        // Count property numbers
        let node_properties_count = node.properties().len();

        trace!(
            "Node[{}]: {} (Level: {}, Properties: {})",
            node_count,
            node.name(),
            level,
            node_properties_count
        );

        for prop in node.properties() {
            trace!("Properties: {}, Raw_value: {:x?}", prop.name(), prop.data);
        }
    }

    info!("=== FDT Statistics Results ===");
    info!("Total node count: {node_count}");
    info!("FDT total size: {} bytes", fdt_header.totalsize);
    info!("Maximum level depth: {max_level}");

    info!("Node distribution by level:");
    for (level, count) in level_counts {
        let percentage = (count as f32 / node_count as f32) * 100.0;
        info!("  Level {level}: {count} nodes ({percentage:.1}%)");
    }
}

#[allow(dead_code)]
pub fn print_guest_fdt(fdt_bytes: &[u8]) {
    let fdt = Fdt::from_bytes(fdt_bytes)
        .map_err(|e| format!("Failed to parse FDT: {e:#?}"))
        .expect("Failed to parse FDT");
    // Statistics of node count and level distribution
    let mut node_count = 0;
    let mut level_counts = alloc::collections::BTreeMap::new();
    let mut max_level = 0;

    info!("=== FDT Node Information Statistics ===");

    // Traverse all nodes once for statistics (following optimization strategy)
    for node_id in fdt.iter_node_ids() {
        let Some(node) = fdt.node(node_id) else {
            continue;
        };
        let level = fdt.path_of(node_id).matches('/').count().max(1);
        node_count += 1;

        // Count nodes by level
        *level_counts.entry(level).or_insert(0) += 1;

        // Record maximum level
        if level > max_level {
            max_level = level;
        }

        // Count property numbers
        let node_properties_count = node.properties().len();

        info!(
            "Node[{}]: {} (Level: {}, Properties: {})",
            node_count,
            node.name(),
            level,
            node_properties_count
        );

        for prop in node.properties() {
            info!("Properties: {}, Raw_value: {:x?}", prop.name(), prop.data);
        }
    }

    info!("=== FDT Statistics Results ===");
    info!("Total node count: {node_count}");
    info!("Maximum level depth: {max_level}");

    info!("Node distribution by level:");
    for (level, count) in level_counts {
        let percentage = (count as f32 / node_count as f32) * 100.0;
        info!("  Level {level}: {count} nodes ({percentage:.1}%)");
    }
}