Skip to content
Browse files

DT Symbol Resolution roadmap

Signed-off-by: Joel A Fernandes <joelagnel@ti.com>
  • Loading branch information...
1 parent a9eb5d9 commit 40aa4754d2168fc892c1a0566ab1f7dca3ceb6bb Joel A Fernandes committed Jan 6, 2013
Showing with 15 additions and 0 deletions.
  1. +15 −0 dt-ROADMAP
View
15 dt-ROADMAP
@@ -0,0 +1,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

0 comments on commit 40aa475

Please sign in to comment.
Something went wrong with that request. Please try again.