forked from jonsmirl/mpc5200
/
dt-ROADMAP
15 lines (13 loc) · 910 Bytes
/
dt-ROADMAP
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
1. add code to kernel: check for duplicate phandles in a dt base/overlay (This goes somewhere in the initial stage when a live tree is created) (not required if implementing 3)
2. add code to kernel: check if phandle referred to is valid or not (to of_resolve)
3. add code to dtc: for every phandle generated, check if phandle was already generated for another node, this could imply a collision
4. compute crc32 of every possible label and dump this into a file, add docs that document the robustness of the hash used.
Community:
- prepare docs that discuss
- the motivation (including lines of code lesser in both dtc and kernel)
- the advantages
- the robustness of the hash and the algorithm itself
- the backward compatibility
- prepare patches
- Post RFC series to few of the local people for feedback including Pantelis
- make sure cover is as detailed as possible discussing motivation