Foreword I have written the basic file compilation, system compilation and system programming earlier, and the preliminary work is almost ready. The current stuff can solve most entry-level needs. Of course, if development is required, other things need to be modified. The following will introduce step by step how to modify the key parameters. Given […]
Tag: root
android10.0(Q) user version opens root permissions
Foreword Individual players recommend using the magisk method to directly patch boot.img to achieve root, and then use the RE file manager to operate system-related partitions. Source code players can directly modify the aosp source code and compile the rom themselves for direct flashing. File list aosp10\build\core\main.mk aosp10\system\sepolicy\definitions.mk aosp10\system\sepolicy\Android.mk aosp10\system\core\fs_mgr\Android.bp aosp10\system\core\adb\daemon\main.cpp aosp10\system\core\adb\Android.bp aosp10\system\core\init\selinux.cpp aosp10\system\core\init\Android.mk aosp10\system\core\init\Android.bp […]
RK356X/RK3588 build Ubuntu20.04 root file system
Article directory Preface 1. Download ubuntu-base from the official website 2. Mount and build the file system 2.1. Configure the build file system environment 2.2. Write the mounting script mount.sh and install related tools 2.3. Lightweight desktop environment lubuntu-desktop 2.4. Uninstall some unnecessary software 2.5. Add users 2.6. Allow root user to log in to […]
[Data structure: Heap] Large root heap, small root heap, heap upward adjustment algorithm, downward adjustment algorithm and heap function implementation!
Foreword This series of articles [Data Structure] will use C/C++ for design and implementation by default! For implementation methods in other languages, please refer to the analysis and design ideas to implement it yourself! Note[1]: The article is a study summary and does not have the corresponding sequence compared to the textbook! (You can check […]
Xunwei transplants the root file system of iTOP-4412 Elite Edition
Preparation Virtual machine: VM-Ware 16.2.3 Operating system: Ubuntu Linux 16.04Cross-compiler: arm-linux-gcc-4.6.4 Work folder:/home/work Build and configure the cross-compilation environment. For the complete construction and configuration process, please refer to the following blog post: Construction of Android 4.0 system compilation environment for Xunwei iTOP-4412 (full version) – CSDN blog https://blog.csdn.net/Eva20192020/article/details/134668004?spm=1001.2014.3001.5502 Tip: It is recommended to delete […]
Linux+SD card (rootfs) (2)
Linux + SD card (rootfs) busybox Download link: https://busybox.net/ download wget https://busybox.net/downloads/busybox-1.36.1.tar.bz2 Unzip tar -vxf busybox-1.36.1.tar.bz2 and go to its root directory export ARCH=arm export CROSS_COMPILE=arm-none-linux-gnueabihf- makedefconfig make menuconfig # Check Settings-> [*] Build static binary (no shared libs) make -j6 make install After the above steps are executed, an _install folder is generated in […]
IPV6 ND protocol–source code analysis [root cause analysis]
ND protocol introduction For an introduction to ND, please read the previous article: IPv6 Knowledge – ND Protocol [Comprehensive article]11.NDP protocol analysis and practice_router solicitation packets do not carry source link-layer address-CSDN Blog The ND protocol defines 5 ICMPv6 message types, as shown in the following table: NS/NA messages are mainly used for address resolutionRS/RA […]
Tree/root changing dp question sheet (updating)
tree diameter Conclusion: The maximum value of the distance from a point on the tree to the two endpoints of the diameter of the tree is the maximum value from that point to all points in the tree. F – Minimum Maximum Distance (marked diameter) Codeforces Round 903 (Div. 3)A~F_hjingXiaojing’s blog-CSDN blog The diameter of […]
Data structure experiment – merge and find the root of the tree with a high height as the new root + find uses folding rules to implement the union and set experiment
Merge and find the root of the tree with the highest height when merging as the new root Experiment 1.1 Experimental content When the union search is merged, the root node of the tree with a higher height is used as the root node of the new tree to generate a new tree. After merging, […]
The path to growth if you want to become proficient in algorithms and SQL – sliding windows and large and small root heaps
The path to growth if you want to be proficient in algorithms and SQL – sliding windows and large and small root heaps Preface 1. Large and small root heaps 2. Median of data stream 1.1 Initialization 1.2 Insert operation 1.3 Complete code 3. Sliding window median 3.1 Modification based on the first question 3.2 […]