├── app
    ├── .gitignore
    ├── src
    │   └── main
    │   │   ├── AndroidManifest.xml
    │   │   └── cpp
    │   │       ├── main.hpp
    │   │       ├── logging.h
    │   │       ├── logging.cpp
    │   │       ├── CMakeLists.txt
    │   │       ├── main.cpp
    │   │       ├── base.hpp
    │   │       ├── modules.cpp
    │   │       ├── node.hpp
    │   │       └── base.cpp
    └── build.gradle.kts
├── gradle
    ├── wrapper
    │   ├── gradle-wrapper.jar
    │   └── gradle-wrapper.properties
    └── libs.versions.toml
├── .gitignore
├── settings.gradle.kts
├── README.md
├── .github
    └── workflows
    │   └── build.yml
├── gradle.properties
├── gradlew.bat
├── gradlew
└── LICENSE


/app/.gitignore:
--------------------------------------------------------------------------------
1 | /build
2 | /release
3 | 


--------------------------------------------------------------------------------
/app/src/main/AndroidManifest.xml:
--------------------------------------------------------------------------------
1 | <?xml version="1.0" encoding="utf-8"?>
2 | <manifest/>


--------------------------------------------------------------------------------
/gradle/wrapper/gradle-wrapper.jar:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/5ec1cff/MagicMountStandalone/HEAD/gradle/wrapper/gradle-wrapper.jar


--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
 1 | *.iml
 2 | .gradle
 3 | /local.properties
 4 | /.idea
 5 | .DS_Store
 6 | /build
 7 | /captures
 8 | .externalNativeBuild
 9 | .cxx
10 | local.properties
11 | 


--------------------------------------------------------------------------------
/gradle/libs.versions.toml:
--------------------------------------------------------------------------------
 1 | [versions]
 2 | agp = "8.7.0"
 3 | 
 4 | [libraries]
 5 | cxx = { module = "org.lsposed.libcxx:libcxx", version = "27.0.12077973" }
 6 | 
 7 | [plugins]
 8 | agp-lib = { id = "com.android.library", version.ref = "agp" }
 9 | 
10 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/main.hpp:
--------------------------------------------------------------------------------
 1 | #pragma once
 2 | 
 3 | #include <string>
 4 | #include <vector>
 5 | 
 6 | std::string get_magisk_tmp();
 7 | 
 8 | void handle_modules();
 9 | 
10 | void umount_modules(const char *magic);
11 | 
12 | extern std::vector<std::string> partitions;
13 | 


--------------------------------------------------------------------------------
/gradle/wrapper/gradle-wrapper.properties:
--------------------------------------------------------------------------------
1 | #Wed Oct 23 20:36:09 CST 2024
2 | distributionBase=GRADLE_USER_HOME
3 | distributionPath=wrapper/dists
4 | distributionUrl=https\://services.gradle.org/distributions/gradle-8.9-bin.zip
5 | zipStoreBase=GRADLE_USER_HOME
6 | zipStorePath=wrapper/dists
7 | 


--------------------------------------------------------------------------------
/settings.gradle.kts:
--------------------------------------------------------------------------------
 1 | pluginManagement {
 2 |     repositories {
 3 |         google()
 4 |         mavenCentral()
 5 |         gradlePluginPortal()
 6 |     }
 7 | }
 8 | dependencyResolutionManagement {
 9 |     repositoriesMode.set(RepositoriesMode.FAIL_ON_PROJECT_REPOS)
10 |     repositories {
11 |         google()
12 |         mavenCentral()
13 |     }
14 | }
15 | 
16 | rootProject.name = "MagicMountStandalone"
17 | include(":app")
18 |  


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # Magic Mount Standalone
 2 | 
 3 | The extracted version of [Magisk](https://github.com/topjohnwu/Magisk) Magic Mount
 4 | 
 5 | ## Build
 6 | 
 7 | ./gradlew zipDebug
 8 | ./gradlew zipRelease
 9 | 
10 | Package will be placed at app/release, including executables and debug symbols
11 | 
12 | ## Install for test
13 | 
14 | ./gradlew installDebug
15 | ./gradlew installRelease
16 | 
17 | Binaries will be push to /data/local/tmp/magic_mount
18 | 
19 | ## Usage
20 | 
21 | ```shell
22 | magic_mount <mount|umount> [--work-dir dir] [--magic magic] [--add-partitions /p1,/p2,....]
23 | 
24 | mount: do magic mount
25 | umount: umount all magic mounts
26 | 
27 | magic: the name of the work dir
28 | work-dir: the path of the work dir
29 | add-partitions: add special partitions to mount
30 | ```
31 | 


--------------------------------------------------------------------------------
/.github/workflows/build.yml:
--------------------------------------------------------------------------------
 1 | name: Build
 2 | 
 3 | on:
 4 |   workflow_dispatch:
 5 |   push:
 6 |     branches: [ master ]
 7 |     tags: [ v* ]
 8 |   pull_request:
 9 |   merge_group:
10 | 
11 | jobs:
12 |   build:
13 |     name: Build
14 |     runs-on: ubuntu-latest
15 | 
16 |     steps:
17 |       - name: Checkout
18 |         uses: actions/checkout@v4
19 |         with:
20 |           submodules: "recursive"
21 |           fetch-depth: 0
22 | 
23 |       - name: Setup Java
24 |         uses: actions/setup-java@v4
25 |         with:
26 |           distribution: temurin
27 |           java-version: 21
28 | 
29 |       - name: Setup Gradle
30 |         uses: gradle/actions/setup-gradle@v4
31 | 
32 |       - name: Build with Gradle
33 |         run: |
34 |           ./gradlew zipDebug
35 |           ./gradlew zipRelease
36 | 
37 |       - name: Upload artifacts
38 |         uses: actions/upload-artifact@v4
39 |         with:
40 |           name: "artifacts"
41 |           path: "./app/release"
42 |           compression-level: 9
43 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/logging.h:
--------------------------------------------------------------------------------
 1 | #pragma once
 2 | 
 3 | #include <android/log.h>
 4 | #include <cerrno>
 5 | #include <cstring>
 6 | #include <string>
 7 | 
 8 | #ifndef LOG_TAG
 9 | # define LOG_TAG "MagicMount"
10 | #endif
11 | 
12 | #ifndef NDEBUG
13 | #define LOGD(...)  logging::log(ANDROID_LOG_DEBUG, LOG_TAG, __VA_ARGS__)
14 | #define LOGV(...)  logging::log(ANDROID_LOG_VERBOSE, LOG_TAG, __VA_ARGS__)
15 | #else
16 | #define LOGD(...)
17 | #define LOGV(...)
18 | #endif
19 | #define LOGI(...)  logging::log(ANDROID_LOG_INFO, LOG_TAG, __VA_ARGS__)
20 | #define LOGW(...)  logging::log(ANDROID_LOG_WARN, LOG_TAG, __VA_ARGS__)
21 | #define LOGE(...)  logging::log(ANDROID_LOG_ERROR, LOG_TAG, __VA_ARGS__)
22 | #define LOGF(...)  logging::log(ANDROID_LOG_FATAL, LOG_TAG, __VA_ARGS__)
23 | #define PLOGE(fmt, args...) LOGE(fmt " failed with %d: %s", ##args, errno, strerror(errno))
24 | 
25 | namespace logging {
26 |     void setPrintEnabled(bool print);
27 | 
28 |     [[gnu::format(printf, 3, 4)]]
29 |     void log(int prio, const char *tag, const char *fmt, ...);
30 | }
31 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/logging.cpp:
--------------------------------------------------------------------------------
 1 | #include <android/log.h>
 2 | #include <unistd.h>
 3 | #include <cstdio>
 4 | #include <string>
 5 | 
 6 | #include "logging.h"
 7 | 
 8 | namespace logging {
 9 |     static bool use_print = false;
10 |     static char prio_str[] = {
11 |             'V', 'D', 'I', 'W', 'E', 'F'
12 |     };
13 | 
14 |     void setPrintEnabled(bool print) {
15 |         use_print = print;
16 |     }
17 | 
18 |     void log(int prio, const char *tag, const char *fmt, ...) {
19 |         {
20 |             va_list ap;
21 |             va_start(ap, fmt);
22 |             __android_log_vprint(prio, tag, fmt, ap);
23 |             va_end(ap);
24 |         }
25 |         if (use_print) {
26 |             char buf[BUFSIZ];
27 |             va_list ap;
28 |             va_start(ap, fmt);
29 |             vsnprintf(buf, sizeof(buf), fmt, ap);
30 |             va_end(ap);
31 |             auto prio_char = (prio > ANDROID_LOG_DEFAULT && prio <= ANDROID_LOG_FATAL) ? prio_str[
32 |                     prio - ANDROID_LOG_VERBOSE] : '?';
33 |             printf("[%c][%d:%d][%s]:%s\n", prio_char, getpid(), gettid(), tag, buf);
34 |         }
35 |     }
36 | }


--------------------------------------------------------------------------------
/app/src/main/cpp/CMakeLists.txt:
--------------------------------------------------------------------------------
 1 | cmake_minimum_required(VERSION 3.22.1)
 2 | 
 3 | project("magic_mount")
 4 | 
 5 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} ${CXX_FLAGS}")
 6 | 
 7 | set(CMAKE_SHARED_LINKER_FLAGS "${CMAKE_SHARED_LINKER_FLAGS} ${LINKER_FLAGS}")
 8 | set(CMAKE_MODULE_LINKER_FLAGS "${CMAKE_MODULE_LINKER_FLAGS} ${LINKER_FLAGS}")
 9 | 
10 | find_package(cxx REQUIRED CONFIG)
11 | link_libraries(cxx::cxx)
12 | 
13 | add_executable(${PROJECT_NAME} main.cpp modules.cpp base.cpp logging.cpp)
14 | target_link_libraries(${PROJECT_NAME} cxx::cxx log)
15 | 
16 | if (DEFINED DEBUG_SYMBOLS_PATH)
17 |     message(STATUS "Debug symbols will be placed at ${DEBUG_SYMBOLS_PATH}")
18 |     add_custom_command(TARGET ${PROJECT_NAME} POST_BUILD
19 |             COMMAND ${CMAKE_COMMAND} -E make_directory ${DEBUG_SYMBOLS_PATH}/${ANDROID_ABI}
20 |             COMMAND ${CMAKE_OBJCOPY} --only-keep-debug $<TARGET_FILE:${PROJECT_NAME}>
21 |             ${DEBUG_SYMBOLS_PATH}/${ANDROID_ABI}/${PROJECT_NAME}.debug
22 |             COMMAND ${CMAKE_STRIP} --strip-all $<TARGET_FILE:${PROJECT_NAME}>
23 |             COMMAND ${CMAKE_OBJCOPY} --add-gnu-debuglink ${DEBUG_SYMBOLS_PATH}/${ANDROID_ABI}/${PROJECT_NAME}.debug
24 |             $<TARGET_FILE:${PROJECT_NAME}>)
25 | endif()
26 | 


--------------------------------------------------------------------------------
/gradle.properties:
--------------------------------------------------------------------------------
 1 | # Project-wide Gradle settings.
 2 | # IDE (e.g. Android Studio) users:
 3 | # Gradle settings configured through the IDE *will override*
 4 | # any settings specified in this file.
 5 | # For more details on how to configure your build environment visit
 6 | # http://www.gradle.org/docs/current/userguide/build_environment.html
 7 | # Specifies the JVM arguments used for the daemon process.
 8 | # The setting is particularly useful for tweaking memory settings.
 9 | org.gradle.jvmargs=-Xmx2048m -Dfile.encoding=UTF-8
10 | # When configured, Gradle will run in incubating parallel mode.
11 | # This option should only be used with decoupled projects. For more details, visit
12 | # https://developer.android.com/r/tools/gradle-multi-project-decoupled-projects
13 | # org.gradle.parallel=true
14 | # AndroidX package structure to make it clearer which packages are bundled with the
15 | # Android operating system, and which are packaged with your app's APK
16 | # https://developer.android.com/topic/libraries/support-library/androidx-rn
17 | android.useAndroidX=true
18 | # Enables namespacing of each library's R class so that its R class includes only the
19 | # resources declared in the library itself and none from the library's dependencies,
20 | # thereby reducing the size of the R class for that library
21 | android.nonTransitiveRClass=true


--------------------------------------------------------------------------------
/app/src/main/cpp/main.cpp:
--------------------------------------------------------------------------------
 1 | #include <sys/mount.h>
 2 | 
 3 | #include "main.hpp"
 4 | #include "logging.h"
 5 | 
 6 | std::string tmp_path = "/debug_ramdisk";
 7 | 
 8 | using namespace std::string_view_literals;
 9 | 
10 | std::vector<std::string> partitions{"/vendor", "/product", "/system_ext"};
11 | 
12 | void help() {
13 |     LOGE("usage: magic_mount <mount|umount> [--work-dir dir] [--magic magic] [--add-partitions /p1,/p2,....]");
14 | }
15 | 
16 | int main(int argc, char **argv) {
17 | #ifndef NDEBUG
18 |     logging::setPrintEnabled(true);
19 | #endif
20 | 
21 |     const char *magic = "magic";
22 | 
23 |     if (argc < 2) {
24 |         help();
25 |         return 1;
26 |     }
27 | 
28 |     bool do_umount = false;
29 | 
30 |     if (argv[1] == "umount"sv) {
31 |         do_umount = true;
32 |     } else if (argv[1] != "mount"sv) {
33 |         help();
34 |         return 1;
35 |     }
36 | 
37 |     for (int i = 2; i < argc; i++) {
38 |         if (argv[i] == "--work-dir"sv && i + 1 < argc) {
39 |             tmp_path = argv[i + 1];
40 |         } else if (argv[i] == "--magic"sv && i + 1 < argc) {
41 |             magic = argv[i + 1];
42 |         } else if (argv[i] == "--add-partitions"sv && i + 1 < argc) {
43 |             size_t pos = 0;
44 |             std::string_view ps{argv[i + 1]};
45 |             for (;;) {
46 |                 auto new_pos = ps.find(',', pos);
47 |                 if (new_pos != std::string_view::npos) {
48 |                     partitions.emplace_back(ps.substr(pos, new_pos - pos));
49 |                     pos = new_pos + 1;
50 |                     continue;
51 |                 }
52 |                 break;
53 |             }
54 |             partitions.emplace_back(ps.substr(pos));
55 |         }
56 |     }
57 | 
58 |     if (do_umount) {
59 |         umount_modules(magic);
60 |         return 0;
61 |     }
62 | 
63 |     LOGI("magic_mount: work dir %s magic %s", tmp_path.c_str(), magic);
64 |     for (auto &s: partitions) {
65 |         LOGD("supported partitions: %s", s.c_str());
66 |     }
67 | 
68 |     if (mount(magic, tmp_path.c_str(), "tmpfs", 0, nullptr) == -1) {
69 |         PLOGE("mount tmp");
70 |         return 1;
71 |     }
72 |     if (mount(nullptr, tmp_path.c_str(), nullptr, MS_PRIVATE, nullptr) == -1) {
73 |         PLOGE("mount tmp private");
74 |         return 1;
75 |     }
76 |     handle_modules();
77 |     LOGI("mount done");
78 |     if (mount(nullptr, tmp_path.c_str(), nullptr, MS_REMOUNT | MS_RDONLY, nullptr) == -1) {
79 |         PLOGE("make ro");
80 |     }
81 |     if (umount2(tmp_path.c_str(), MNT_DETACH) == -1) {
82 |         PLOGE("umount tmp");
83 |     }
84 |     return 0;
85 | }
86 | 
87 | std::string get_magisk_tmp() {
88 |     return tmp_path;
89 | }
90 | 


--------------------------------------------------------------------------------
/gradlew.bat:
--------------------------------------------------------------------------------
 1 | @rem
 2 | @rem Copyright 2015 the original author or authors.
 3 | @rem
 4 | @rem Licensed under the Apache License, Version 2.0 (the "License");
 5 | @rem you may not use this file except in compliance with the License.
 6 | @rem You may obtain a copy of the License at
 7 | @rem
 8 | @rem      https://www.apache.org/licenses/LICENSE-2.0
 9 | @rem
10 | @rem Unless required by applicable law or agreed to in writing, software
11 | @rem distributed under the License is distributed on an "AS IS" BASIS,
12 | @rem WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 | @rem See the License for the specific language governing permissions and
14 | @rem limitations under the License.
15 | @rem
16 | 
17 | @if "%DEBUG%" == "" @echo off
18 | @rem ##########################################################################
19 | @rem
20 | @rem  Gradle startup script for Windows
21 | @rem
22 | @rem ##########################################################################
23 | 
24 | @rem Set local scope for the variables with windows NT shell
25 | if "%OS%"=="Windows_NT" setlocal
26 | 
27 | set DIRNAME=%~dp0
28 | if "%DIRNAME%" == "" set DIRNAME=.
29 | set APP_BASE_NAME=%~n0
30 | set APP_HOME=%DIRNAME%
31 | 
32 | @rem Resolve any "." and ".." in APP_HOME to make it shorter.
33 | for %%i in ("%APP_HOME%") do set APP_HOME=%%~fi
34 | 
35 | @rem Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
36 | set DEFAULT_JVM_OPTS="-Xmx64m" "-Xms64m"
37 | 
38 | @rem Find java.exe
39 | if defined JAVA_HOME goto findJavaFromJavaHome
40 | 
41 | set JAVA_EXE=java.exe
42 | %JAVA_EXE% -version >NUL 2>&1
43 | if "%ERRORLEVEL%" == "0" goto execute
44 | 
45 | echo.
46 | echo ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
47 | echo.
48 | echo Please set the JAVA_HOME variable in your environment to match the
49 | echo location of your Java installation.
50 | 
51 | goto fail
52 | 
53 | :findJavaFromJavaHome
54 | set JAVA_HOME=%JAVA_HOME:"=%
55 | set JAVA_EXE=%JAVA_HOME%/bin/java.exe
56 | 
57 | if exist "%JAVA_EXE%" goto execute
58 | 
59 | echo.
60 | echo ERROR: JAVA_HOME is set to an invalid directory: %JAVA_HOME%
61 | echo.
62 | echo Please set the JAVA_HOME variable in your environment to match the
63 | echo location of your Java installation.
64 | 
65 | goto fail
66 | 
67 | :execute
68 | @rem Setup the command line
69 | 
70 | set CLASSPATH=%APP_HOME%\gradle\wrapper\gradle-wrapper.jar
71 | 
72 | 
73 | @rem Execute Gradle
74 | "%JAVA_EXE%" %DEFAULT_JVM_OPTS% %JAVA_OPTS% %GRADLE_OPTS% "-Dorg.gradle.appname=%APP_BASE_NAME%" -classpath "%CLASSPATH%" org.gradle.wrapper.GradleWrapperMain %*
75 | 
76 | :end
77 | @rem End local scope for the variables with windows NT shell
78 | if "%ERRORLEVEL%"=="0" goto mainEnd
79 | 
80 | :fail
81 | rem Set variable GRADLE_EXIT_CONSOLE if you need the _script_ return code instead of
82 | rem the _cmd.exe /c_ return code!
83 | if  not "" == "%GRADLE_EXIT_CONSOLE%" exit 1
84 | exit /b 1
85 | 
86 | :mainEnd
87 | if "%OS%"=="Windows_NT" endlocal
88 | 
89 | :omega
90 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/base.hpp:
--------------------------------------------------------------------------------
  1 | #pragma once
  2 | 
  3 | #include <unistd.h>
  4 | #include <dirent.h>
  5 | #include <fcntl.h>
  6 | #include <sys/stat.h>
  7 | #include <cstring>
  8 | 
  9 | #include <memory>
 10 | #include <functional>
 11 | #include <string>
 12 | #include <vector>
 13 | 
 14 | #include "logging.h"
 15 | 
 16 | // https://github.com/topjohnwu/Magisk/blob/455b13b83c4dde60511e43a634c880317b1ba5fc/native/src/core/include/core.hpp#L31
 17 | struct module_info {
 18 |     std::string name;
 19 | };
 20 | 
 21 | // https://github.com/topjohnwu/Magisk/blob/455b13b83c4dde60511e43a634c880317b1ba5fc/native/src/include/consts.hpp#L8
 22 | 
 23 | #define SECURE_DIR      "/data/adb"
 24 | #define MODULEROOT      SECURE_DIR "/modules"
 25 | 
 26 | #define INTLROOT      ".magisk"
 27 | #define WORKERDIR     INTLROOT "/worker"
 28 | #define MODULEMNT     INTLROOT "/modules"
 29 | 
 30 | struct dirent *xreaddir(DIR *dirp);
 31 | 
 32 | // files
 33 | 
 34 | using sFILE = std::unique_ptr<FILE, decltype(&fclose)>;
 35 | using sDIR = std::unique_ptr<DIR, decltype(&closedir)>;
 36 | 
 37 | sDIR make_dir(DIR *dp);
 38 | 
 39 | sFILE make_file(FILE *fp);
 40 | 
 41 | static inline sDIR open_dir(const char *path) {
 42 |     return make_dir(opendir(path));
 43 | }
 44 | 
 45 | static inline sDIR xopen_dir(const char *path) {
 46 |     return make_dir(opendir(path));
 47 | }
 48 | 
 49 | static inline sDIR xopen_dir(int dirfd) {
 50 |     return make_dir(fdopendir(dirfd));
 51 | }
 52 | 
 53 | static inline sFILE open_file(const char *path, const char *mode) {
 54 |     return make_file(fopen(path, mode));
 55 | }
 56 | 
 57 | static inline sFILE xopen_file(const char *path, const char *mode) {
 58 |     return make_file(fopen(path, mode));
 59 | }
 60 | 
 61 | static inline sFILE xopen_file(int fd, const char *mode) {
 62 |     return make_file(fdopen(fd, mode));
 63 | }
 64 | 
 65 | #define DISALLOW_COPY_AND_MOVE(clazz) \
 66 | clazz(const clazz&) = delete;        \
 67 | clazz(clazz &&) = delete;
 68 | 
 69 | template<class Func>
 70 | class run_finally {
 71 |     DISALLOW_COPY_AND_MOVE(run_finally)
 72 | 
 73 | public:
 74 |     explicit run_finally(Func &&fn) : fn(std::move(fn)) {}
 75 | 
 76 |     ~run_finally() { fn(); }
 77 | 
 78 | private:
 79 |     Func fn;
 80 | };
 81 | 
 82 | void cp_afc(const char *src, const char *dest);
 83 | 
 84 | void clone_attr(const char *src, const char *dest);
 85 | 
 86 | int mkdirs(const char *path, mode_t mode);
 87 | int xmkdirs(const char *path, mode_t mode);
 88 | 
 89 | // mount scan
 90 | 
 91 | struct mount_info {
 92 |     unsigned int id;
 93 |     unsigned int parent;
 94 |     dev_t device;
 95 |     std::string root;
 96 |     std::string target;
 97 |     std::string vfs_option;
 98 |     struct {
 99 |         unsigned int shared;
100 |         unsigned int master;
101 |         unsigned int propagate_from;
102 |     } optional;
103 |     std::string type;
104 |     std::string source;
105 |     std::string fs_option;
106 | };
107 | 
108 | std::vector<mount_info> parse_mount_info(const char *pid);
109 | 
110 | // https://github.com/topjohnwu/Magisk/blob/40aab136019f4c1950f0789baf92a0686cd0a29e/native/src/base/xwrap.cpp#L354
111 | // xwrap
112 | 
113 | int xmount(const char *source, const char *target,
114 |            const char *filesystemtype, unsigned long mountflags,
115 |            const void *data);
116 | 
117 | int xsymlink(const char *target, const char *linkpath);
118 | int xsymlinkat(const char *target, int newdirfd, const char *linkpath);
119 | 
120 | ssize_t xreadlink(const char *pathname, char *buf, size_t bufsiz);
121 | ssize_t xreadlinkat(int dirfd, const char *pathname, char *buf, size_t bufsiz);
122 | 
123 | ssize_t xsendfile(int out_fd, int in_fd, off_t *offset, size_t count);
124 | 
125 | int xlstat(const char *pathname, struct stat *buf);
126 | int xfstat(int fd, struct stat *buf);
127 | int xmkdirat(int dirfd, const char *pathname, mode_t mode);
128 | int xmkdir(const char *pathname, mode_t mode);
129 | 
130 | int xopen(const char *pathname, int flags);
131 | int xopen(const char *pathname, int flags, mode_t mode);
132 | int xopenat(int dirfd, const char *pathname, int flags);
133 | int xopenat(int dirfd, const char *pathname, int flags, mode_t mode);
134 | 


--------------------------------------------------------------------------------
/app/build.gradle.kts:
--------------------------------------------------------------------------------
  1 | import java.io.ByteArrayOutputStream
  2 | 
  3 | plugins {
  4 |     alias(libs.plugins.agp.lib)
  5 | }
  6 | 
  7 | fun String.execute(currentWorkingDir: File = file("./")): String {
  8 |     val byteOut = ByteArrayOutputStream()
  9 |     project.exec {
 10 |         workingDir = currentWorkingDir
 11 |         commandLine = split("\\s".toRegex())
 12 |         standardOutput = byteOut
 13 |     }
 14 |     return String(byteOut.toByteArray()).trim()
 15 | }
 16 | 
 17 | val gitCommitCount = "git rev-list HEAD --count".execute().toInt()
 18 | val gitCommitHash = "git rev-parse --verify --short HEAD".execute()
 19 | 
 20 | val defaultCFlags = arrayOf(
 21 |     "-Wall",
 22 |     "-Wno-unused", "-Wno-unused-parameter", "-Wno-vla-cxx-extension",
 23 |     "-fno-rtti", "-fno-exceptions",
 24 |     "-fno-stack-protector", "-fomit-frame-pointer",
 25 |     "-Wno-builtin-macro-redefined", "-D__FILE__=__FILE_NAME__",
 26 | )
 27 | 
 28 | val releaseFlags = arrayOf(
 29 |     "-O3", "-flto",
 30 |     "-fvisibility=hidden", "-fvisibility-inlines-hidden",
 31 |     "-Wl,--exclude-libs,ALL", "-Wl,--gc-sections",
 32 | )
 33 | 
 34 | android {
 35 |     buildFeatures {
 36 |         androidResources = false
 37 |         buildConfig = false
 38 |         prefab = true
 39 |         prefabPublishing = true
 40 |     }
 41 |     externalNativeBuild.cmake {
 42 |         path("src/main/cpp/CMakeLists.txt")
 43 |     }
 44 | 
 45 |     defaultConfig {
 46 |         externalNativeBuild.cmake {
 47 |             arguments += "-DANDROID_STL=none"
 48 |             cFlags("-std=c18", *defaultCFlags)
 49 |             cppFlags("-std=c++20", *defaultCFlags)
 50 |         }
 51 |     }
 52 | 
 53 |     buildTypes {
 54 |         forEach {
 55 |             it.externalNativeBuild.cmake {
 56 |                 arguments += "-DDEBUG_SYMBOLS_PATH=${layout.buildDirectory.dir("symbols/${it.name}").get().asFile.absolutePath}"
 57 |             }
 58 |         }
 59 |     }
 60 | 
 61 |     prefab {
 62 |         register("magic_mount")
 63 |     }
 64 | }
 65 | 
 66 | androidComponents.onVariants { variant ->
 67 |     val variantLowered = variant.name.lowercase()
 68 |     val variantCapped = variant.name.replaceFirstChar { it.uppercaseChar() }
 69 |     afterEvaluate {
 70 |         task<Zip>("zip$variantCapped") {
 71 |             group = "my"
 72 |             archiveFileName.set("magic_mount-$gitCommitHash-$gitCommitCount-$variantLowered.zip")
 73 |             destinationDirectory.set(layout.projectDirectory.dir("release").asFile)
 74 |             dependsOn("externalNativeBuild$variantCapped")
 75 | 
 76 |             into("") {
 77 |                 from(layout.buildDirectory.dir("intermediates/cmake/$variantLowered/obj"))
 78 |                 from(layout.buildDirectory.dir("symbols/${variant.buildType}"))
 79 |             }
 80 |         }
 81 | 
 82 |         val executableName = "magic_mount"
 83 | 
 84 |         task<Task>("install$variantCapped") {
 85 |             group = "my"
 86 |             dependsOn("externalNativeBuild$variantCapped")
 87 | 
 88 |             val abiList = listOf("armeabi-v7a", "arm64-v8a", "x86_64", "x86")
 89 |             doLast {
 90 |                 val primaryArch = "adb shell getprop ro.product.cpu.abi".execute()
 91 |                 val arch = "adb shell getprop ro.product.cpu.abilist".execute()
 92 |                 exec {
 93 |                     commandLine = listOf(
 94 |                         "adb", "shell", "rm /data/local/tmp/$executableName || su -c 'rm /data/local/tmp/$executableName'")
 95 |                     isIgnoreExitValue = true
 96 |                 }
 97 |                 arch.split(",").forEach { abi ->
 98 |                     if (abi !in abiList) {
 99 |                         println("ignore unknown abi $abi")
100 |                         return@forEach
101 |                     }
102 |                     val isPrimary = primaryArch == abi
103 |                     val devPath =
104 |                         "/data/local/tmp/${if (isPrimary) executableName else "${executableName}_$abi"}"
105 |                     exec {
106 |                         workingDir =
107 |                             layout.buildDirectory.dir("intermediates/cmake/$variantLowered/obj/$abi").get().asFile
108 |                         commandLine =
109 |                             listOf(
110 |                                 "adb",
111 |                                 "push",
112 |                                 executableName,
113 |                                 devPath
114 |                             )
115 |                     }
116 |                     exec {
117 |                         commandLine = listOf(
118 |                             "adb",
119 |                             "shell",
120 |                             "chmod",
121 |                             "+x",
122 |                             devPath
123 |                         )
124 |                     }
125 |                 }
126 |             }
127 |         }
128 |     }
129 | }
130 | 
131 | dependencies {
132 |     implementation(libs.cxx)
133 | }
134 | 


--------------------------------------------------------------------------------
/gradlew:
--------------------------------------------------------------------------------
  1 | #!/usr/bin/env sh
  2 | 
  3 | #
  4 | # Copyright 2015 the original author or authors.
  5 | #
  6 | # Licensed under the Apache License, Version 2.0 (the "License");
  7 | # you may not use this file except in compliance with the License.
  8 | # You may obtain a copy of the License at
  9 | #
 10 | #      https://www.apache.org/licenses/LICENSE-2.0
 11 | #
 12 | # Unless required by applicable law or agreed to in writing, software
 13 | # distributed under the License is distributed on an "AS IS" BASIS,
 14 | # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 15 | # See the License for the specific language governing permissions and
 16 | # limitations under the License.
 17 | #
 18 | 
 19 | ##############################################################################
 20 | ##
 21 | ##  Gradle start up script for UN*X
 22 | ##
 23 | ##############################################################################
 24 | 
 25 | # Attempt to set APP_HOME
 26 | # Resolve links: $0 may be a link
 27 | PRG="$0"
 28 | # Need this for relative symlinks.
 29 | while [ -h "$PRG" ] ; do
 30 |     ls=`ls -ld "$PRG"`
 31 |     link=`expr "$ls" : '.*-> \(.*\)$'`
 32 |     if expr "$link" : '/.*' > /dev/null; then
 33 |         PRG="$link"
 34 |     else
 35 |         PRG=`dirname "$PRG"`"/$link"
 36 |     fi
 37 | done
 38 | SAVED="`pwd`"
 39 | cd "`dirname \"$PRG\"`/" >/dev/null
 40 | APP_HOME="`pwd -P`"
 41 | cd "$SAVED" >/dev/null
 42 | 
 43 | APP_NAME="Gradle"
 44 | APP_BASE_NAME=`basename "$0"`
 45 | 
 46 | # Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
 47 | DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"'
 48 | 
 49 | # Use the maximum available, or set MAX_FD != -1 to use that value.
 50 | MAX_FD="maximum"
 51 | 
 52 | warn () {
 53 |     echo "$*"
 54 | }
 55 | 
 56 | die () {
 57 |     echo
 58 |     echo "$*"
 59 |     echo
 60 |     exit 1
 61 | }
 62 | 
 63 | # OS specific support (must be 'true' or 'false').
 64 | cygwin=false
 65 | msys=false
 66 | darwin=false
 67 | nonstop=false
 68 | case "`uname`" in
 69 |   CYGWIN* )
 70 |     cygwin=true
 71 |     ;;
 72 |   Darwin* )
 73 |     darwin=true
 74 |     ;;
 75 |   MINGW* )
 76 |     msys=true
 77 |     ;;
 78 |   NONSTOP* )
 79 |     nonstop=true
 80 |     ;;
 81 | esac
 82 | 
 83 | CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar
 84 | 
 85 | 
 86 | # Determine the Java command to use to start the JVM.
 87 | if [ -n "$JAVA_HOME" ] ; then
 88 |     if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
 89 |         # IBM's JDK on AIX uses strange locations for the executables
 90 |         JAVACMD="$JAVA_HOME/jre/sh/java"
 91 |     else
 92 |         JAVACMD="$JAVA_HOME/bin/java"
 93 |     fi
 94 |     if [ ! -x "$JAVACMD" ] ; then
 95 |         die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
 96 | 
 97 | Please set the JAVA_HOME variable in your environment to match the
 98 | location of your Java installation."
 99 |     fi
100 | else
101 |     JAVACMD="java"
102 |     which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
103 | 
104 | Please set the JAVA_HOME variable in your environment to match the
105 | location of your Java installation."
106 | fi
107 | 
108 | # Increase the maximum file descriptors if we can.
109 | if [ "$cygwin" = "false" -a "$darwin" = "false" -a "$nonstop" = "false" ] ; then
110 |     MAX_FD_LIMIT=`ulimit -H -n`
111 |     if [ $? -eq 0 ] ; then
112 |         if [ "$MAX_FD" = "maximum" -o "$MAX_FD" = "max" ] ; then
113 |             MAX_FD="$MAX_FD_LIMIT"
114 |         fi
115 |         ulimit -n $MAX_FD
116 |         if [ $? -ne 0 ] ; then
117 |             warn "Could not set maximum file descriptor limit: $MAX_FD"
118 |         fi
119 |     else
120 |         warn "Could not query maximum file descriptor limit: $MAX_FD_LIMIT"
121 |     fi
122 | fi
123 | 
124 | # For Darwin, add options to specify how the application appears in the dock
125 | if $darwin; then
126 |     GRADLE_OPTS="$GRADLE_OPTS \"-Xdock:name=$APP_NAME\" \"-Xdock:icon=$APP_HOME/media/gradle.icns\""
127 | fi
128 | 
129 | # For Cygwin or MSYS, switch paths to Windows format before running java
130 | if [ "$cygwin" = "true" -o "$msys" = "true" ] ; then
131 |     APP_HOME=`cygpath --path --mixed "$APP_HOME"`
132 |     CLASSPATH=`cygpath --path --mixed "$CLASSPATH"`
133 | 
134 |     JAVACMD=`cygpath --unix "$JAVACMD"`
135 | 
136 |     # We build the pattern for arguments to be converted via cygpath
137 |     ROOTDIRSRAW=`find -L / -maxdepth 1 -mindepth 1 -type d 2>/dev/null`
138 |     SEP=""
139 |     for dir in $ROOTDIRSRAW ; do
140 |         ROOTDIRS="$ROOTDIRS$SEP$dir"
141 |         SEP="|"
142 |     done
143 |     OURCYGPATTERN="(^($ROOTDIRS))"
144 |     # Add a user-defined pattern to the cygpath arguments
145 |     if [ "$GRADLE_CYGPATTERN" != "" ] ; then
146 |         OURCYGPATTERN="$OURCYGPATTERN|($GRADLE_CYGPATTERN)"
147 |     fi
148 |     # Now convert the arguments - kludge to limit ourselves to /bin/sh
149 |     i=0
150 |     for arg in "$@" ; do
151 |         CHECK=`echo "$arg"|egrep -c "$OURCYGPATTERN" -`
152 |         CHECK2=`echo "$arg"|egrep -c "^-"`                                 ### Determine if an option
153 | 
154 |         if [ $CHECK -ne 0 ] && [ $CHECK2 -eq 0 ] ; then                    ### Added a condition
155 |             eval `echo args$i`=`cygpath --path --ignore --mixed "$arg"`
156 |         else
157 |             eval `echo args$i`="\"$arg\""
158 |         fi
159 |         i=`expr $i + 1`
160 |     done
161 |     case $i in
162 |         0) set -- ;;
163 |         1) set -- "$args0" ;;
164 |         2) set -- "$args0" "$args1" ;;
165 |         3) set -- "$args0" "$args1" "$args2" ;;
166 |         4) set -- "$args0" "$args1" "$args2" "$args3" ;;
167 |         5) set -- "$args0" "$args1" "$args2" "$args3" "$args4" ;;
168 |         6) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" ;;
169 |         7) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" ;;
170 |         8) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" ;;
171 |         9) set -- "$args0" "$args1" "$args2" "$args3" "$args4" "$args5" "$args6" "$args7" "$args8" ;;
172 |     esac
173 | fi
174 | 
175 | # Escape application args
176 | save () {
177 |     for i do printf %s\\n "$i" | sed "s/'/'\\\\''/g;1s/^/'/;\$s/\$/' \\\\/" ; done
178 |     echo " "
179 | }
180 | APP_ARGS=`save "$@"`
181 | 
182 | # Collect all arguments for the java command, following the shell quoting and substitution rules
183 | eval set -- $DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS "\"-Dorg.gradle.appname=$APP_BASE_NAME\"" -classpath "\"$CLASSPATH\"" org.gradle.wrapper.GradleWrapperMain "$APP_ARGS"
184 | 
185 | exec "$JAVACMD" "$@"
186 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/modules.cpp:
--------------------------------------------------------------------------------
  1 | #include <sys/mman.h>
  2 | #include <sys/syscall.h>
  3 | #include <sys/mount.h>
  4 | #include <map>
  5 | #include <utility>
  6 | 
  7 | #include "main.hpp"
  8 | #include "base.hpp"
  9 | #include "node.hpp"
 10 | 
 11 | using namespace std;
 12 | 
 13 | #define VLOGD(tag, from, to) LOGD("%-8s: %s <- %s", tag, to, from)
 14 | 
 15 | static int bind_mount(const char *reason, const char *from, const char *to, bool move = false) {
 16 |     VLOGD(reason, from, to);
 17 |     int ret = xmount(from, to, nullptr, (move ? MS_MOVE : MS_BIND) | MS_REC, nullptr);
 18 |     return ret;
 19 | }
 20 | 
 21 | /*************************
 22 |  * Node Tree Construction
 23 |  *************************/
 24 | 
 25 | tmpfs_node::tmpfs_node(node_entry *node) : dir_node(node, this) {
 26 |     if (!replace()) {
 27 |         if (auto dir = open_dir(node_path().data())) {
 28 |             set_exist(true);
 29 |             for (dirent *entry; (entry = xreaddir(dir.get()));) {
 30 |                 // create a dummy inter_node to upgrade later
 31 |                 emplace<inter_node>(entry->d_name, entry);
 32 |             }
 33 |         }
 34 |     }
 35 | 
 36 |     for (auto it = children.begin(); it != children.end(); ++it) {
 37 |         // Upgrade resting inter_node children to tmpfs_node
 38 |         if (isa<inter_node>(it->second))
 39 |             it = upgrade<tmpfs_node>(it);
 40 |     }
 41 | }
 42 | 
 43 | bool dir_node::prepare() {
 44 |     // If direct replace or not exist, mount ourselves as tmpfs
 45 |     bool upgrade_to_tmpfs = replace() || !exist();
 46 | 
 47 |     for (auto it = children.begin(); it != children.end();) {
 48 |         // We also need to upgrade to tmpfs node if any child:
 49 |         // - Target does not exist
 50 |         // - Source or target is a symlink (since we cannot bind mount symlink)
 51 |         bool cannot_mnt;
 52 |         if (struct stat st{}; lstat(it->second->node_path().data(), &st) != 0) {
 53 |             cannot_mnt = true;
 54 |         } else {
 55 |             it->second->set_exist(true);
 56 |             cannot_mnt = it->second->is_lnk() || S_ISLNK(st.st_mode);
 57 |         }
 58 | 
 59 |         if (cannot_mnt) {
 60 |             if (_node_type > type_id<tmpfs_node>()) {
 61 |                 // Upgrade will fail, remove the unsupported child node
 62 |                 LOGW("Unable to add: %s, skipped", it->second->node_path().data());
 63 |                 delete it->second;
 64 |                 it = children.erase(it);
 65 |                 continue;
 66 |             }
 67 |             upgrade_to_tmpfs = true;
 68 |         }
 69 |         if (auto dn = dyn_cast<dir_node>(it->second)) {
 70 |             if (replace()) {
 71 |                 // Propagate skip mirror state to all children
 72 |                 dn->set_replace(true);
 73 |             }
 74 |             if (dn->prepare()) {
 75 |                 // Upgrade child to tmpfs
 76 |                 it = upgrade<tmpfs_node>(it);
 77 |             }
 78 |         }
 79 |         ++it;
 80 |     }
 81 |     return upgrade_to_tmpfs;
 82 | }
 83 | 
 84 | void dir_node::collect_module_files(const char *module, int dfd) {
 85 |     LOGD("collect %s: %s", module, peek_node_path().data());
 86 |     auto dir = xopen_dir(xopenat(dfd, name().data(), O_RDONLY | O_CLOEXEC));
 87 |     if (!dir)
 88 |         return;
 89 | 
 90 |     for (dirent *entry; (entry = xreaddir(dir.get()));) {
 91 |         if (entry->d_name == ".replace"sv) {
 92 |             set_replace(true);
 93 |             continue;
 94 |         }
 95 | 
 96 |         if (entry->d_type == DT_DIR) {
 97 |             inter_node *node;
 98 |             if (auto it = children.find(entry->d_name); it == children.end()) {
 99 |                 node = emplace<inter_node>(entry->d_name, entry->d_name);
100 |             } else {
101 |                 node = dyn_cast<inter_node>(it->second);
102 |             }
103 |             if (node) {
104 |                 node->collect_module_files(module, dirfd(dir.get()));
105 |             }
106 |         } else {
107 |             emplace<module_node>(entry->d_name, module, entry);
108 |         }
109 |     }
110 | }
111 | 
112 | /************************
113 |  * Mount Implementations
114 |  ************************/
115 | 
116 | void node_entry::create_and_mount(const char *reason, const string &src, bool ro) {
117 |     const string dest = isa<tmpfs_node>(parent()) ? worker_path() : node_path();
118 |     if (is_lnk()) {
119 |         VLOGD("cp_link", src.data(), dest.data());
120 |         cp_afc(src.data(), dest.data());
121 |     } else {
122 |         if (is_dir())
123 |             xmkdir(dest.data(), 0);
124 |         else if (is_reg())
125 |             close(xopen(dest.data(), O_RDONLY | O_CREAT | O_CLOEXEC, 0));
126 |         else
127 |             return;
128 |         bind_mount(reason, src.data(), dest.data());
129 |         if (ro) {
130 |             xmount(nullptr, dest.data(), nullptr, MS_REMOUNT | MS_BIND | MS_RDONLY, nullptr);
131 |         }
132 |     }
133 | }
134 | 
135 | void module_node::mount() {
136 |     std::string path = module + (parent()->root()->prefix + node_path());
137 |     string mnt_src = module_mnt + path;
138 |     {
139 |         string src = MODULEROOT "/" + path;
140 |         if (exist()) clone_attr(node_path().data(), src.data());
141 |     }
142 |     if (isa<tmpfs_node>(parent())) {
143 |         create_and_mount("module", mnt_src);
144 |     } else {
145 |         bind_mount("module", mnt_src.data(), node_path().data());
146 |     }
147 | }
148 | 
149 | void tmpfs_node::mount() {
150 |     if (!is_dir()) {
151 |         create_and_mount("mirror", node_path());
152 |         return;
153 |     }
154 |     if (!isa<tmpfs_node>(parent())) {
155 |         auto worker_dir = worker_path();
156 |         xmkdirs(worker_dir.data(), 0);
157 |         bind_mount(replace() ? "replace" : "bind", worker_dir.data(), worker_dir.data());
158 |         clone_attr(exist() ? node_path().data() : parent()->node_path().data(), worker_dir.data());
159 |         dir_node::mount();
160 |         bind_mount(replace() ? "replace" : "move", worker_dir.data(), node_path().data(), true);
161 |         xmount(nullptr, node_path().data(), nullptr, MS_PRIVATE, nullptr);
162 |         // we shouldn't make ro here
163 |     } else {
164 |         const string dest = worker_path();
165 |         // We don't need another layer of tmpfs if parent is tmpfs
166 |         mkdir(dest.data(), 0);
167 |         clone_attr(exist() ? node_path().data() : parent()->worker_path().data(), dest.data());
168 |         dir_node::mount();
169 |     }
170 | }
171 | 
172 | void load_modules(const vector<module_info> &module_list) {
173 |     node_entry::module_mnt = MODULEROOT "/";
174 | 
175 |     auto root = make_unique<root_node>("");
176 |     auto system = new root_node("system");
177 |     root->insert(system);
178 | 
179 |     char buf[4096];
180 |     LOGI("* Loading modules");
181 |     for (const auto &m: module_list) {
182 |         const char *module = m.name.data();
183 |         char *b = buf + snprintf(buf, sizeof(buf), MODULEROOT "/%s/", module);
184 | 
185 |         // Check whether skip mounting
186 |         strcpy(b, "skip_mount");
187 |         if (access(buf, F_OK) == 0)
188 |             continue;
189 | 
190 |         // Double check whether the system folder exists
191 |         strcpy(b, "system");
192 |         if (access(buf, F_OK) != 0)
193 |             continue;
194 | 
195 |         LOGI("%s: loading mount files", module);
196 |         b[-1] = '\0';
197 |         int fd = xopen(buf, O_RDONLY | O_CLOEXEC);
198 |         system->collect_module_files(module, fd);
199 |         close(fd);
200 |     }
201 | 
202 |     if (!system->is_empty()) {
203 |         // Handle special read-only partitions
204 |         for (auto &part: partitions) {
205 |             struct stat st{};
206 |             if (!part.empty() && lstat(part.c_str(), &st) == 0 && S_ISDIR(st.st_mode)) {
207 |                 if (auto old = system->extract(part.c_str() + 1)) {
208 |                     auto new_node = new root_node(old);
209 |                     root->insert(new_node);
210 |                 }
211 |             }
212 |         }
213 |         root->prepare();
214 |         root->mount();
215 |     } else {
216 |         LOGI("nothing to mount");
217 |     }
218 | }
219 | 
220 | template<typename Func>
221 | static void foreach_module(Func fn) {
222 |     auto dir = open_dir(MODULEROOT);
223 |     if (!dir)
224 |         return;
225 | 
226 |     int dfd = dirfd(dir.get());
227 |     for (dirent *entry; (entry = xreaddir(dir.get()));) {
228 |         if (entry->d_type == DT_DIR && entry->d_name != ".core"sv) {
229 |             int modfd = xopenat(dfd, entry->d_name, O_RDONLY | O_CLOEXEC);
230 |             fn(dfd, entry, modfd);
231 |             close(modfd);
232 |         }
233 |     }
234 | }
235 | 
236 | void handle_modules() {
237 |     vector<module_info> module_list;
238 |     LOGD("collecting modules ...");
239 |     foreach_module([&](int dfd, dirent *entry, int modfd) {
240 |         // unlinkat(modfd, "update", 0);
241 |         if (faccessat(modfd, "disable", F_OK, 0) == 0)
242 |             return;
243 | 
244 |         module_info info;
245 |         info.name = entry->d_name;
246 |         module_list.push_back(info);
247 |     });
248 |     LOGD("loading modules ...");
249 |     load_modules(module_list);
250 | }
251 | 
252 | void umount_modules(const char *magic) {
253 |     vector<string> targets;
254 |     for (auto &info: parse_mount_info("self")) {
255 |         if (info.root.starts_with("/adb/modules/") ||
256 |             (info.source == magic && info.type == "tmpfs")) {
257 |             targets.emplace_back(info.target);
258 |         }
259 |     }
260 | 
261 |     for (auto &target: targets) {
262 |         if (umount2(target.c_str(), MNT_DETACH) == -1) {
263 |             PLOGE("umount %s", target.c_str());
264 |         } else {
265 |             LOGD("umount %s", target.c_str());
266 |         }
267 |     }
268 | }
269 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/node.hpp:
--------------------------------------------------------------------------------
  1 | #pragma once
  2 | 
  3 | #include <sys/mount.h>
  4 | #include <map>
  5 | 
  6 | using namespace std;
  7 | 
  8 | #define TYPE_INTER   (1 << 0)    /* intermediate node */
  9 | #define TYPE_TMPFS   (1 << 1)    /* replace with tmpfs */
 10 | #define TYPE_MODULE  (1 << 2)    /* mount from module */
 11 | #define TYPE_ROOT    (1 << 3)    /* partition root */
 12 | #define TYPE_CUSTOM  (1 << 4)    /* custom node type overrides all */
 13 | #define TYPE_DIR     (TYPE_INTER|TYPE_TMPFS|TYPE_ROOT)
 14 | 
 15 | class node_entry;
 16 | 
 17 | class dir_node;
 18 | 
 19 | class inter_node;
 20 | 
 21 | class tmpfs_node;
 22 | 
 23 | class module_node;
 24 | 
 25 | class root_node;
 26 | 
 27 | // Poor man's dynamic cast without RTTI
 28 | template<class T>
 29 | static bool isa(node_entry *node);
 30 | 
 31 | template<class T>
 32 | static T *dyn_cast(node_entry *node);
 33 | 
 34 | template<class T>
 35 | uint8_t type_id() { return TYPE_CUSTOM; }
 36 | 
 37 | template<>
 38 | uint8_t type_id<dir_node>() { return TYPE_DIR; }
 39 | 
 40 | template<>
 41 | uint8_t type_id<inter_node>() { return TYPE_INTER; }
 42 | 
 43 | template<>
 44 | uint8_t type_id<tmpfs_node>() { return TYPE_TMPFS; }
 45 | 
 46 | template<>
 47 | uint8_t type_id<module_node>() { return TYPE_MODULE; }
 48 | 
 49 | template<>
 50 | uint8_t type_id<root_node>() { return TYPE_ROOT; }
 51 | 
 52 | class node_entry {
 53 | public:
 54 |     virtual ~node_entry() = default;
 55 | 
 56 |     // Node info
 57 |     bool is_dir() const { return file_type() == DT_DIR; }
 58 | 
 59 |     bool is_lnk() const { return file_type() == DT_LNK; }
 60 | 
 61 |     bool is_reg() const { return file_type() == DT_REG; }
 62 | 
 63 |     const string &name() const { return _name; }
 64 | 
 65 |     dir_node *parent() const { return _parent; }
 66 | 
 67 |     // Don't call the following two functions before prepare
 68 |     const string &node_path();
 69 | 
 70 |     string peek_node_path();
 71 | 
 72 |     const string worker_path();
 73 | 
 74 |     virtual void mount() = 0;
 75 | 
 76 |     inline static string module_mnt;
 77 | 
 78 | protected:
 79 |     template<class T>
 80 |     node_entry(const char *name, uint8_t file_type, T *)
 81 |             : _name(name), _file_type(file_type & 15), _node_type(type_id<T>()) {}
 82 | 
 83 |     template<class T>
 84 |     explicit node_entry(T *) : _file_type(0), _node_type(type_id<T>()) {}
 85 | 
 86 |     virtual void consume(node_entry *other) {
 87 |         _name.swap(other->_name);
 88 |         _file_type = other->_file_type;
 89 |         _parent = other->_parent;
 90 |         delete other;
 91 |     }
 92 | 
 93 |     void create_and_mount(const char *reason, const string &src, bool ro = false);
 94 | 
 95 |     // Use bit 7 of _file_type for exist status
 96 |     bool exist() const { return static_cast<bool>(_file_type & (1 << 7)); }
 97 | 
 98 |     void set_exist(bool b) { if (b) _file_type |= (1 << 7); else _file_type &= ~(1 << 7); }
 99 | 
100 | private:
101 |     friend class dir_node;
102 | 
103 |     template<class T>
104 |     friend bool isa(node_entry *node);
105 | 
106 |     uint8_t file_type() const { return static_cast<uint8_t>(_file_type & 15); }
107 | 
108 |     // Node properties
109 |     string _name;
110 |     dir_node *_parent = nullptr;
111 | 
112 |     // Cache, it should only be used within prepare
113 |     string _node_path;
114 | 
115 |     uint8_t _file_type;
116 |     const uint8_t _node_type;
117 | };
118 | 
119 | class dir_node : public node_entry {
120 | public:
121 |     using map_type = map<string_view, node_entry *>;
122 |     using iterator = map_type::iterator;
123 | 
124 |     ~dir_node() override {
125 |         for (auto &it: children)
126 |             delete it.second;
127 |         children.clear();
128 |     }
129 | 
130 |     /**************
131 |      * Entrypoints
132 |      **************/
133 | 
134 |     // Traverse through module directories to generate a tree of module files
135 |     void collect_module_files(const char *module, int dfd);
136 | 
137 |     // Traverse through the real filesystem and prepare the tree for magic mount.
138 |     // Return true to indicate that this node needs to be upgraded to tmpfs_node.
139 |     bool prepare();
140 | 
141 |     // Default directory mount logic
142 |     void mount() override {
143 |         for (auto &pair: children)
144 |             pair.second->mount();
145 |     }
146 | 
147 |     /***************
148 |      * Tree Methods
149 |      ***************/
150 | 
151 |     bool is_empty() { return children.empty(); }
152 | 
153 |     template<class T>
154 |     T *get_child(string_view name) { return iterator_to_node<T>(children.find(name)); }
155 | 
156 |     root_node *root() {
157 |         if (!_root)
158 |             _root = _parent->root();
159 |         return _root;
160 |     }
161 | 
162 |     // Return child with name or nullptr
163 |     node_entry *extract(string_view name) {
164 |         auto it = children.find(name);
165 |         if (it != children.end()) {
166 |             auto ret = it->second;
167 |             children.erase(it);
168 |             return ret;
169 |         }
170 |         return nullptr;
171 |     }
172 | 
173 |     // Return false if rejected
174 |     bool insert(node_entry *node) {
175 |         auto fn = [=](auto) { return node; };
176 |         return node && iterator_to_node(insert(node->_name, node->_node_type, fn));
177 |     }
178 | 
179 |     // Return inserted node or null if rejected
180 |     template<class T, class ...Args>
181 |     T *emplace(string_view name, Args &&...args) {
182 |         auto fn = [&](auto) { return new T(std::forward<Args>(args)...); };
183 |         return iterator_to_node<T>(insert(name, type_id<T>(), fn));
184 |     }
185 | 
186 |     // Return upgraded node or null if rejected
187 |     template<class T, class ...Args>
188 |     T *upgrade(string_view name, Args &...args) {
189 |         return iterator_to_node<T>(upgrade<T>(children.find(name), args...));
190 |     }
191 | 
192 | protected:
193 |     template<class T>
194 |     dir_node(const char *name, T *self) : node_entry(name, DT_DIR, self) {
195 |         if constexpr (std::is_same_v<T, root_node>)
196 |             _root = self;
197 |     }
198 | 
199 |     template<class T>
200 |     dir_node(dirent *entry, T *self) : node_entry(entry->d_name, entry->d_type, self) {
201 |         if constexpr (std::is_same_v<T, root_node>)
202 |             _root = self;
203 |     }
204 | 
205 |     template<class T>
206 |     dir_node(node_entry *node, T *self) : node_entry(self) {
207 |         if constexpr (std::is_same_v<T, root_node>)
208 |             _root = self;
209 |         dir_node::consume(node);
210 |     }
211 | 
212 |     void consume(node_entry *other) override {
213 |         if (auto o = dyn_cast<dir_node>(other)) {
214 |             children.merge(o->children);
215 |             for (auto &pair: children)
216 |                 pair.second->_parent = this;
217 |         }
218 |         node_entry::consume(other);
219 |     }
220 | 
221 |     // Use bit 6 of _file_type
222 |     // Skip binding mirror for this directory
223 |     bool replace() const { return static_cast<bool>(_file_type & (1 << 6)); }
224 | 
225 |     void set_replace(bool b) { if (b) _file_type |= (1 << 6); else _file_type &= ~(1 << 6); }
226 | 
227 |     template<class T = node_entry>
228 |     T *iterator_to_node(iterator it) {
229 |         return static_cast<T *>(it == children.end() ? nullptr : it->second);
230 |     }
231 | 
232 |     template<typename Builder>
233 |     iterator insert(string_view name, uint8_t type, const Builder &builder) {
234 |         return insert_at(children.find(name), type, builder);
235 |     }
236 | 
237 |     // Emplace insert a new node, or upgrade if the requested type has a higher rank.
238 |     // Return iterator to the new/upgraded node, or end() if insertion is rejected.
239 |     // fn is the node builder function. Signature: (node_entry *&) -> node_entry *
240 |     // fn gets a reference to the existing node pointer and returns a new node object.
241 |     // Input is null when there is no existing node. If returns null, the insertion is rejected.
242 |     // If fn consumes the input, it should set the reference to null.
243 |     template<typename Builder>
244 |     iterator insert_at(iterator it, uint8_t type, const Builder &builder) {
245 |         node_entry *node = nullptr;
246 |         if (it != children.end()) {
247 |             // Upgrade existing node only if higher rank
248 |             if (it->second->_node_type < type) {
249 |                 node = builder(it->second);
250 |                 if (!node)
251 |                     return children.end();
252 |                 if (it->second)
253 |                     node->consume(it->second);
254 |                 it = children.erase(it);
255 |                 // Minor optimization to make insert O(1) by using hint
256 |                 if (it == children.begin())
257 |                     it = children.emplace(node->_name, node).first;
258 |                 else
259 |                     it = children.emplace_hint(--it, node->_name, node);
260 |             } else {
261 |                 return children.end();
262 |             }
263 |         } else {
264 |             node = builder(node);
265 |             if (!node)
266 |                 return children.end();
267 |             node->_parent = this;
268 |             it = children.emplace(node->_name, node).first;
269 |         }
270 |         return it;
271 |     }
272 | 
273 |     template<class T, class ...Args>
274 |     iterator upgrade(iterator it, Args &&...args) {
275 |         return insert_at(it, type_id<T>(), [&](node_entry *&ex) -> node_entry * {
276 |             if (!ex) return nullptr;
277 |             auto node = new T(ex, std::forward<Args>(args)...);
278 |             ex = nullptr;
279 |             return node;
280 |         });
281 |     }
282 | 
283 |     // dir nodes host children
284 |     map_type children;
285 | 
286 | private:
287 |     // Root node lookup cache
288 |     root_node *_root = nullptr;
289 | };
290 | 
291 | class root_node : public dir_node {
292 | public:
293 |     explicit root_node(const char *name) : dir_node(name, this), prefix("") {
294 |         set_exist(true);
295 |     }
296 | 
297 |     explicit root_node(node_entry *node) : dir_node(node, this), prefix("/system") {
298 |         set_exist(true);
299 |     }
300 | 
301 |     const char *const prefix;
302 | };
303 | 
304 | class inter_node : public dir_node {
305 | public:
306 |     inter_node(const char *name) : dir_node(name, this) {}
307 | 
308 |     inter_node(dirent *entry) : dir_node(entry, this) {}
309 | };
310 | 
311 | class module_node : public node_entry {
312 | public:
313 |     module_node(const char *module, dirent *entry)
314 |             : node_entry(entry->d_name, entry->d_type, this), module(module) {}
315 | 
316 |     module_node(node_entry *node, const char *module) : node_entry(this), module(module) {
317 |         node_entry::consume(node);
318 |     }
319 | 
320 |     void mount() override;
321 | 
322 | private:
323 |     const char *module;
324 | };
325 | 
326 | // Don't create tmpfs_node before prepare
327 | class tmpfs_node : public dir_node {
328 | public:
329 |     explicit tmpfs_node(node_entry *node);
330 | 
331 |     void mount() override;
332 | };
333 | 
334 | template<class T>
335 | static bool isa(node_entry *node) {
336 |     return node && (node->_node_type & type_id<T>());
337 | }
338 | 
339 | template<class T>
340 | static T *dyn_cast(node_entry *node) {
341 |     return isa<T>(node) ? static_cast<T *>(node) : nullptr;
342 | }
343 | 
344 | const string &node_entry::node_path() {
345 |     if (_parent && _node_path.empty())
346 |         _node_path = _parent->node_path() + '/' + _name;
347 |     return _node_path;
348 | }
349 | 
350 | string node_entry::peek_node_path() {
351 |     if (_parent)
352 |         return _parent->peek_node_path() + '/' + _name;
353 |     return "";
354 | }
355 | 
356 | const string node_entry::worker_path() {
357 |     return get_magisk_tmp() + node_path();
358 | }
359 | 


--------------------------------------------------------------------------------
/app/src/main/cpp/base.cpp:
--------------------------------------------------------------------------------
  1 | #include <sys/mount.h>
  2 | #include <sys/xattr.h>
  3 | #include <sys/syscall.h>
  4 | #include <sys/sendfile.h>
  5 | #include <sys/sysmacros.h>
  6 | 
  7 | #include "base.hpp"
  8 | #include "logging.h"
  9 | 
 10 | using namespace std::string_view_literals;
 11 | 
 12 | struct dirent *xreaddir(DIR *dirp) {
 13 |     errno = 0;
 14 |     for (dirent *e;;) {
 15 |         e = readdir(dirp);
 16 |         if (e == nullptr) {
 17 |             if (errno)
 18 |                 PLOGE("readdir");
 19 |             return nullptr;
 20 |         } else if (e->d_name == "."sv || e->d_name == ".."sv) {
 21 |             // Filter . and .. for users
 22 |             continue;
 23 |         }
 24 |         return e;
 25 |     }
 26 | }
 27 | 
 28 | sDIR make_dir(DIR *dp) {
 29 |     return sDIR(dp, [](DIR *dp) { return dp ? closedir(dp) : 1; });
 30 | }
 31 | 
 32 | sFILE make_file(FILE *fp) {
 33 |     return sFILE(fp, [](FILE *fp) { return fp ? fclose(fp) : 1; });
 34 | }
 35 | 
 36 | int xmount(const char *source, const char *target,
 37 |            const char *filesystemtype, unsigned long mountflags,
 38 |            const void *data) {
 39 |     int ret = mount(source, target, filesystemtype, mountflags, data);
 40 |     if (ret < 0) {
 41 |         PLOGE("mount %s->%s", source, target);
 42 |     }
 43 |     return ret;
 44 | }
 45 | 
 46 | 
 47 | struct file_attr {
 48 |     struct stat st;
 49 |     char con[128];
 50 | };
 51 | 
 52 | static void freecon(char *s) {
 53 |     free(s);
 54 | }
 55 | 
 56 | static int getfilecon(const char *path, char **ctx) {
 57 |     char buf[1024];
 58 |     int rc = syscall(__NR_getxattr, path, XATTR_NAME_SELINUX, buf, sizeof(buf) - 1);
 59 |     if (rc >= 0)
 60 |         *ctx = strdup(buf);
 61 |     return rc;
 62 | }
 63 | 
 64 | static int lgetfilecon(const char *path, char **ctx) {
 65 |     char buf[1024];
 66 |     int rc = syscall(__NR_lgetxattr, path, XATTR_NAME_SELINUX, buf, sizeof(buf) - 1);
 67 |     if (rc >= 0)
 68 |         *ctx = strdup(buf);
 69 |     return rc;
 70 | }
 71 | 
 72 | static int fgetfilecon(int fd, char **ctx) {
 73 |     char buf[1024];
 74 |     int rc = syscall(__NR_fgetxattr, fd, XATTR_NAME_SELINUX, buf, sizeof(buf) - 1);
 75 |     if (rc >= 0)
 76 |         *ctx = strdup(buf);
 77 |     return rc;
 78 | }
 79 | 
 80 | static int setfilecon(const char *path, const char *ctx) {
 81 |     return syscall(__NR_setxattr, path, XATTR_NAME_SELINUX, ctx, strlen(ctx) + 1, 0);
 82 | }
 83 | 
 84 | static int lsetfilecon(const char *path, const char *ctx) {
 85 |     return syscall(__NR_lsetxattr, path, XATTR_NAME_SELINUX, ctx, strlen(ctx) + 1, 0);
 86 | }
 87 | 
 88 | static int fsetfilecon(int fd, const char *ctx) {
 89 |     return syscall(__NR_fsetxattr, fd, XATTR_NAME_SELINUX, ctx, strlen(ctx) + 1, 0);
 90 | }
 91 | 
 92 | ssize_t fd_path(int fd, char *path, size_t size) {
 93 |     snprintf(path, size, "/proc/self/fd/%d", fd);
 94 |     return xreadlink(path, path, size);
 95 | }
 96 | 
 97 | int fd_pathat(int dirfd, const char *name, char *path, size_t size) {
 98 |     if (fd_path(dirfd, path, size) < 0)
 99 |         return -1;
100 |     auto len = strlen(path);
101 |     path[len] = '/';
102 |     strlcpy(path + len + 1, name, size - len - 1);
103 |     return 0;
104 | }
105 | 
106 | int getattr(const char *path, file_attr *a) {
107 |     if (xlstat(path, &a->st) == -1)
108 |         return -1;
109 |     char *con;
110 |     if (lgetfilecon(path, &con) == -1)
111 |         return -1;
112 |     strcpy(a->con, con);
113 |     freecon(con);
114 |     return 0;
115 | }
116 | 
117 | int getattrat(int dirfd, const char *name, file_attr *a) {
118 |     char path[4096];
119 |     fd_pathat(dirfd, name, path, sizeof(path));
120 |     return getattr(path, a);
121 | }
122 | 
123 | int fgetattr(int fd, file_attr *a) {
124 |     if (xfstat(fd, &a->st) < 0)
125 |         return -1;
126 |     char *con;
127 |     if (fgetfilecon(fd, &con) < 0)
128 |         return -1;
129 |     strcpy(a->con, con);
130 |     freecon(con);
131 |     return 0;
132 | }
133 | 
134 | 
135 | int setattr(const char *path, file_attr *a) {
136 |     if (chmod(path, a->st.st_mode & 0777) < 0)
137 |         return -1;
138 |     if (chown(path, a->st.st_uid, a->st.st_gid) < 0)
139 |         return -1;
140 |     if (a->con[0] && lsetfilecon(path, a->con) < 0)
141 |         return -1;
142 |     return 0;
143 | }
144 | 
145 | int setattrat(int dirfd, const char *name, file_attr *a) {
146 |     char path[4096];
147 |     fd_pathat(dirfd, name, path, sizeof(path));
148 |     return setattr(path, a);
149 | }
150 | 
151 | int fsetattr(int fd, file_attr *a) {
152 |     if (fchmod(fd, a->st.st_mode & 0777) < 0)
153 |         return -1;
154 |     if (fchown(fd, a->st.st_uid, a->st.st_gid) < 0)
155 |         return -1;
156 |     if (a->con[0] && fsetfilecon(fd, a->con) < 0)
157 |         return -1;
158 |     return 0;
159 | }
160 | 
161 | void clone_attr(const char *src, const char *dest) {
162 |     file_attr a;
163 |     getattr(src, &a);
164 |     setattr(dest, &a);
165 | }
166 | 
167 | void fclone_attr(int src, int dest) {
168 |     file_attr a;
169 |     fgetattr(src, &a);
170 |     fsetattr(dest, &a);
171 | }
172 | 
173 | // https://github.com/topjohnwu/Magisk/blob/66a7ef5615f463435b45d29e737d37cf48a9b78c/native/src/base/files.cpp#L26
174 | 
175 | int mkdirs(const char *path, mode_t mode) {
176 |     char buf[4096];
177 |     strlcpy(buf, path, sizeof(buf));
178 |     errno = 0;
179 |     for (char *p = &buf[1]; *p; ++p) {
180 |         if (*p == '/') {
181 |             *p = '\0';
182 |             if (mkdir(buf, mode) == -1) {
183 |                 if (errno != EEXIST) {
184 |                     PLOGE("mkdir %s", buf);
185 |                     return -1;
186 |                 }
187 |             }
188 |             *p = '/';
189 |         }
190 |     }
191 |     if (mkdir(buf, mode) == -1) {
192 |         if (errno != EEXIST) {
193 |             PLOGE("mkdir %s", buf);
194 |             return -1;
195 |         }
196 |     }
197 |     return 0;
198 | }
199 | 
200 | int xmkdirs(const char *pathname, mode_t mode) {
201 |     int ret = mkdirs(pathname, mode);
202 |     if (ret < 0) {
203 |         PLOGE("mkdirs %s", pathname);
204 |     }
205 |     return ret;
206 | }
207 | 
208 | // https://github.com/topjohnwu/Magisk/blob/40aab136019f4c1950f0789baf92a0686cd0a29e/native/src/base/files.cpp#L144
209 | 
210 | 
211 | void clone_dir(int src, int dest) {
212 |     auto dir = xopen_dir(src);
213 |     run_finally f([&] { close(dest); });
214 |     for (dirent *entry; (entry = xreaddir(dir.get()));) {
215 |         file_attr a;
216 |         getattrat(src, entry->d_name, &a);
217 |         switch (entry->d_type) {
218 |             case DT_DIR: {
219 |                 xmkdirat(dest, entry->d_name, 0);
220 |                 setattrat(dest, entry->d_name, &a);
221 |                 int sfd = xopenat(src, entry->d_name, O_RDONLY | O_CLOEXEC);
222 |                 int dst = xopenat(dest, entry->d_name, O_RDONLY | O_CLOEXEC);
223 |                 clone_dir(sfd, dst);
224 |                 break;
225 |             }
226 |             case DT_REG: {
227 |                 int sfd = xopenat(src, entry->d_name, O_RDONLY | O_CLOEXEC);
228 |                 int dfd = xopenat(dest, entry->d_name, O_WRONLY | O_CREAT | O_TRUNC | O_CLOEXEC, 0);
229 |                 xsendfile(dfd, sfd, nullptr, a.st.st_size);
230 |                 fsetattr(dfd, &a);
231 |                 close(dfd);
232 |                 close(sfd);
233 |                 break;
234 |             }
235 |             case DT_LNK: {
236 |                 char buf[4096];
237 |                 xreadlinkat(src, entry->d_name, buf, sizeof(buf));
238 |                 xsymlinkat(buf, dest, entry->d_name);
239 |                 setattrat(dest, entry->d_name, &a);
240 |                 break;
241 |             }
242 |         }
243 |     }
244 | }
245 | 
246 | void cp_afc(const char *src, const char *dest) {
247 |     file_attr a;
248 |     getattr(src, &a);
249 |     if (S_ISDIR(a.st.st_mode)) {
250 |         xmkdirs(dest, 0);
251 |         clone_dir(xopen(src, O_RDONLY | O_CLOEXEC), xopen(dest, O_RDONLY | O_CLOEXEC));
252 |     } else {
253 |         unlink(dest);
254 |         if (S_ISREG(a.st.st_mode)) {
255 |             int sfd = xopen(src, O_RDONLY | O_CLOEXEC);
256 |             int dfd = xopen(dest, O_WRONLY | O_CREAT | O_TRUNC | O_CLOEXEC, 0);
257 |             xsendfile(dfd, sfd, nullptr, a.st.st_size);
258 |             close(sfd);
259 |             close(dfd);
260 |         } else if (S_ISLNK(a.st.st_mode)) {
261 |             char buf[4096];
262 |             xreadlink(src, buf, sizeof(buf));
263 |             xsymlink(buf, dest);
264 |         }
265 |     }
266 |     setattr(dest, &a);
267 | }
268 | 
269 | void file_readline(bool trim, FILE *fp, const std::function<bool(std::string_view)> &fn) {
270 |     size_t len = 1024;
271 |     char *buf = (char *) malloc(len);
272 |     char *start;
273 |     ssize_t read;
274 |     while ((read = getline(&buf, &len, fp)) >= 0) {
275 |         start = buf;
276 |         if (trim) {
277 |             while (read && "\n\r "sv.find(buf[read - 1]) != std::string::npos)
278 |                 --read;
279 |             buf[read] = '\0';
280 |             while (*start == ' ')
281 |                 ++start;
282 |         }
283 |         if (!fn(start))
284 |             break;
285 |     }
286 |     free(buf);
287 | }
288 | 
289 | void file_readline(bool trim, const char *file, const std::function<bool(std::string_view)> &fn) {
290 |     if (auto fp = open_file(file, "re"))
291 |         file_readline(trim, fp.get(), fn);
292 | }
293 | 
294 | void file_readline(const char *file, const std::function<bool(std::string_view)> &fn) {
295 |     file_readline(false, file, fn);
296 | }
297 | 
298 | int parse_int(std::string_view s) {
299 |     if (s.empty()) return -1;
300 |     int val = 0;
301 |     for (char c: s) {
302 |         if (!c) break;
303 |         if (c > '9' || c < '0')
304 |             return -1;
305 |         val = val * 10 + c - '0';
306 |     }
307 |     return val;
308 | }
309 | 
310 | std::vector<mount_info> parse_mount_info(const char *pid) {
311 |     char buf[PATH_MAX] = {};
312 |     snprintf(buf, sizeof(buf), "/proc/%s/mountinfo", pid);
313 |     std::vector<mount_info> result;
314 | 
315 |     file_readline(buf, [&result](std::string_view line) -> bool {
316 |         int root_start = 0, root_end = 0;
317 |         int target_start = 0, target_end = 0;
318 |         int vfs_option_start = 0, vfs_option_end = 0;
319 |         int type_start = 0, type_end = 0;
320 |         int source_start = 0, source_end = 0;
321 |         int fs_option_start = 0, fs_option_end = 0;
322 |         int optional_start = 0, optional_end = 0;
323 |         unsigned int id, parent, maj, min;
324 |         sscanf(line.data(),
325 |                "%u "           // (1) id
326 |                "%u "           // (2) parent
327 |                "%u:%u "        // (3) maj:min
328 |                "%n%*s%n "      // (4) mountroot
329 |                "%n%*s%n "      // (5) target
330 |                "%n%*s%n"       // (6) vfs options (fs-independent)
331 |                "%n%*[^-]%n - " // (7) optional fields
332 |                "%n%*s%n "      // (8) FS type
333 |                "%n%*s%n "      // (9) source
334 |                "%n%*s%n",      // (10) fs options (fs specific)
335 |                &id, &parent, &maj, &min, &root_start, &root_end, &target_start,
336 |                &target_end, &vfs_option_start, &vfs_option_end,
337 |                &optional_start, &optional_end, &type_start, &type_end,
338 |                &source_start, &source_end, &fs_option_start, &fs_option_end);
339 | 
340 |         auto root = line.substr(root_start, root_end - root_start);
341 |         auto target = line.substr(target_start, target_end - target_start);
342 |         auto vfs_option =
343 |                 line.substr(vfs_option_start, vfs_option_end - vfs_option_start);
344 |         ++optional_start;
345 |         --optional_end;
346 |         auto optional = line.substr(
347 |                 optional_start,
348 |                 optional_end - optional_start > 0 ? optional_end - optional_start : 0);
349 | 
350 |         auto type = line.substr(type_start, type_end - type_start);
351 |         auto source = line.substr(source_start, source_end - source_start);
352 |         auto fs_option =
353 |                 line.substr(fs_option_start, fs_option_end - fs_option_start);
354 | 
355 |         unsigned int shared = 0;
356 |         unsigned int master = 0;
357 |         unsigned int propagate_from = 0;
358 |         if (auto pos = optional.find("shared:"); pos != std::string_view::npos) {
359 |             shared = parse_int(optional.substr(pos + 7));
360 |         }
361 |         if (auto pos = optional.find("master:"); pos != std::string_view::npos) {
362 |             master = parse_int(optional.substr(pos + 7));
363 |         }
364 |         if (auto pos = optional.find("propagate_from:");
365 |                 pos != std::string_view::npos) {
366 |             propagate_from = parse_int(optional.substr(pos + 15));
367 |         }
368 | 
369 |         result.emplace_back(mount_info{
370 |                 .id = id,
371 |                 .parent = parent,
372 |                 .device = static_cast<dev_t>(makedev(maj, min)),
373 |                 .root {root},
374 |                 .target {target},
375 |                 .vfs_option {vfs_option},
376 |                 .optional {
377 |                         .shared = shared,
378 |                         .master = master,
379 |                         .propagate_from = propagate_from,
380 |                 },
381 |                 .type {type},
382 |                 .source {source},
383 |                 .fs_option {fs_option},
384 |         });
385 |         return true;
386 |     });
387 |     return result;
388 | }
389 | 
390 | int xsymlink(const char *target, const char *linkpath) {
391 |     int ret = symlink(target, linkpath);
392 |     if (ret < 0) {
393 |         PLOGE("symlink %s->%s", target, linkpath);
394 |     }
395 |     return ret;
396 | }
397 | 
398 | ssize_t xreadlink(const char *pathname, char *buf, size_t bufsiz) {
399 |     ssize_t ret = readlink(pathname, buf, bufsiz);
400 |     if (ret < 0) {
401 |         PLOGE("readlink %s", pathname);
402 |     } else {
403 |         buf[ret] = '\0';
404 |     }
405 |     return ret;
406 | }
407 | 
408 | ssize_t xreadlinkat(int dirfd, const char *pathname, char *buf, size_t bufsiz) {
409 |     // readlinkat() may fail on x86 platform, returning random value
410 |     // instead of number of bytes placed in buf (length of link)
411 | #if defined(__i386__) || defined(__x86_64__)
412 |     memset(buf, 0, bufsiz);
413 |     ssize_t ret = readlinkat(dirfd, pathname, buf, bufsiz);
414 |     if (ret < 0) {
415 |         PLOGE("readlinkat %s", pathname);
416 |     }
417 |     return ret;
418 | #else
419 |     ssize_t ret = readlinkat(dirfd, pathname, buf, bufsiz);
420 |     if (ret < 0) {
421 |         PLOGE("readlinkat %s", pathname);
422 |     } else {
423 |         buf[ret] = '\0';
424 |     }
425 |     return ret;
426 | #endif
427 | }
428 | 
429 | 
430 | int xsymlinkat(const char *target, int newdirfd, const char *linkpath) {
431 |     int ret = symlinkat(target, newdirfd, linkpath);
432 |     if (ret < 0) {
433 |         PLOGE("symlinkat %s->%s", target, linkpath);
434 |     }
435 |     return ret;
436 | }
437 | 
438 | ssize_t xsendfile(int out_fd, int in_fd, off_t *offset, size_t count) {
439 |     ssize_t ret = sendfile(out_fd, in_fd, offset, count);
440 |     if (ret < 0) {
441 |         PLOGE("sendfile");
442 |     }
443 |     return ret;
444 | }
445 | 
446 | int xlstat(const char *pathname, struct stat *buf) {
447 |     int ret = lstat(pathname, buf);
448 |     if (ret < 0) {
449 |         PLOGE("lstat %s", pathname);
450 |     }
451 |     return ret;
452 | }
453 | 
454 | int xfstat(int fd, struct stat *buf) {
455 |     int ret = fstat(fd, buf);
456 |     if (ret < 0) {
457 |         PLOGE("fstat %d", fd);
458 |     }
459 |     return ret;
460 | }
461 | 
462 | int xmkdirat(int dirfd, const char *pathname, mode_t mode) {
463 |     int ret = mkdirat(dirfd, pathname, mode);
464 |     if (ret < 0 && errno != EEXIST) {
465 |         PLOGE("mkdirat %s %u", pathname, mode);
466 |     }
467 |     return ret;
468 | }
469 | 
470 | int xmkdir(const char *pathname, mode_t mode) {
471 |     int ret = mkdir(pathname, mode);
472 |     if (ret < 0 && errno != EEXIST) {
473 |         PLOGE("mkdir %s %u", pathname, mode);
474 |     }
475 |     return ret;
476 | }
477 | 
478 | int xopen(const char *pathname, int flags) {
479 |     int fd = open(pathname, flags);
480 |     if (fd < 0) {
481 |         PLOGE("open: %s", pathname);
482 |     }
483 |     return fd;
484 | }
485 | 
486 | int xopen(const char *pathname, int flags, mode_t mode) {
487 |     int fd = open(pathname, flags, mode);
488 |     if (fd < 0) {
489 |         PLOGE("open: %s", pathname);
490 |     }
491 |     return fd;
492 | }
493 | 
494 | int xopenat(int dirfd, const char *pathname, int flags) {
495 |     int fd = openat(dirfd, pathname, flags);
496 |     if (fd < 0) {
497 |         PLOGE("openat: %s", pathname);
498 |     }
499 |     return fd;
500 | }
501 | 
502 | int xopenat(int dirfd, const char *pathname, int flags, mode_t mode) {
503 |     int fd = openat(dirfd, pathname, flags, mode);
504 |     if (fd < 0) {
505 |         PLOGE("openat: %s", pathname);
506 |     }
507 |     return fd;
508 | }
509 | 


--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
  1 |                     GNU GENERAL PUBLIC LICENSE
  2 |                        Version 3, 29 June 2007
  3 | 
  4 |  Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
  5 |  Everyone is permitted to copy and distribute verbatim copies
  6 |  of this license document, but changing it is not allowed.
  7 | 
  8 |                             Preamble
  9 | 
 10 |   The GNU General Public License is a free, copyleft license for
 11 | software and other kinds of works.
 12 | 
 13 |   The licenses for most software and other practical works are designed
 14 | to take away your freedom to share and change the works.  By contrast,
 15 | the GNU General Public License is intended to guarantee your freedom to
 16 | share and change all versions of a program--to make sure it remains free
 17 | software for all its users.  We, the Free Software Foundation, use the
 18 | GNU General Public License for most of our software; it applies also to
 19 | any other work released this way by its authors.  You can apply it to
 20 | your programs, too.
 21 | 
 22 |   When we speak of free software, we are referring to freedom, not
 23 | price.  Our General Public Licenses are designed to make sure that you
 24 | have the freedom to distribute copies of free software (and charge for
 25 | them if you wish), that you receive source code or can get it if you
 26 | want it, that you can change the software or use pieces of it in new
 27 | free programs, and that you know you can do these things.
 28 | 
 29 |   To protect your rights, we need to prevent others from denying you
 30 | these rights or asking you to surrender the rights.  Therefore, you have
 31 | certain responsibilities if you distribute copies of the software, or if
 32 | you modify it: responsibilities to respect the freedom of others.
 33 | 
 34 |   For example, if you distribute copies of such a program, whether
 35 | gratis or for a fee, you must pass on to the recipients the same
 36 | freedoms that you received.  You must make sure that they, too, receive
 37 | or can get the source code.  And you must show them these terms so they
 38 | know their rights.
 39 | 
 40 |   Developers that use the GNU GPL protect your rights with two steps:
 41 | (1) assert copyright on the software, and (2) offer you this License
 42 | giving you legal permission to copy, distribute and/or modify it.
 43 | 
 44 |   For the developers' and authors' protection, the GPL clearly explains
 45 | that there is no warranty for this free software.  For both users' and
 46 | authors' sake, the GPL requires that modified versions be marked as
 47 | changed, so that their problems will not be attributed erroneously to
 48 | authors of previous versions.
 49 | 
 50 |   Some devices are designed to deny users access to install or run
 51 | modified versions of the software inside them, although the manufacturer
 52 | can do so.  This is fundamentally incompatible with the aim of
 53 | protecting users' freedom to change the software.  The systematic
 54 | pattern of such abuse occurs in the area of products for individuals to
 55 | use, which is precisely where it is most unacceptable.  Therefore, we
 56 | have designed this version of the GPL to prohibit the practice for those
 57 | products.  If such problems arise substantially in other domains, we
 58 | stand ready to extend this provision to those domains in future versions
 59 | of the GPL, as needed to protect the freedom of users.
 60 | 
 61 |   Finally, every program is threatened constantly by software patents.
 62 | States should not allow patents to restrict development and use of
 63 | software on general-purpose computers, but in those that do, we wish to
 64 | avoid the special danger that patents applied to a free program could
 65 | make it effectively proprietary.  To prevent this, the GPL assures that
 66 | patents cannot be used to render the program non-free.
 67 | 
 68 |   The precise terms and conditions for copying, distribution and
 69 | modification follow.
 70 | 
 71 |                        TERMS AND CONDITIONS
 72 | 
 73 |   0. Definitions.
 74 | 
 75 |   "This License" refers to version 3 of the GNU General Public License.
 76 | 
 77 |   "Copyright" also means copyright-like laws that apply to other kinds of
 78 | works, such as semiconductor masks.
 79 | 
 80 |   "The Program" refers to any copyrightable work licensed under this
 81 | License.  Each licensee is addressed as "you".  "Licensees" and
 82 | "recipients" may be individuals or organizations.
 83 | 
 84 |   To "modify" a work means to copy from or adapt all or part of the work
 85 | in a fashion requiring copyright permission, other than the making of an
 86 | exact copy.  The resulting work is called a "modified version" of the
 87 | earlier work or a work "based on" the earlier work.
 88 | 
 89 |   A "covered work" means either the unmodified Program or a work based
 90 | on the Program.
 91 | 
 92 |   To "propagate" a work means to do anything with it that, without
 93 | permission, would make you directly or secondarily liable for
 94 | infringement under applicable copyright law, except executing it on a
 95 | computer or modifying a private copy.  Propagation includes copying,
 96 | distribution (with or without modification), making available to the
 97 | public, and in some countries other activities as well.
 98 | 
 99 |   To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies.  Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 | 
103 |   An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License.  If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 | 
112 |   1. Source Code.
113 | 
114 |   The "source code" for a work means the preferred form of the work
115 | for making modifications to it.  "Object code" means any non-source
116 | form of a work.
117 | 
118 |   A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 | 
123 |   The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form.  A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 | 
134 |   The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities.  However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work.  For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 | 
147 |   The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 | 
151 |   The Corresponding Source for a work in source code form is that
152 | same work.
153 | 
154 |   2. Basic Permissions.
155 | 
156 |   All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met.  This License explicitly affirms your unlimited
159 | permission to run the unmodified Program.  The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work.  This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 | 
164 |   You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force.  You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright.  Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 | 
175 |   Conveying under any other circumstances is permitted solely under
176 | the conditions stated below.  Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 | 
179 |   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 | 
181 |   No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 | 
187 |   When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 | 
195 |   4. Conveying Verbatim Copies.
196 | 
197 |   You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 | 
205 |   You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 | 
208 |   5. Conveying Modified Source Versions.
209 | 
210 |   You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 | 
214 |     a) The work must carry prominent notices stating that you modified
215 |     it, and giving a relevant date.
216 | 
217 |     b) The work must carry prominent notices stating that it is
218 |     released under this License and any conditions added under section
219 |     7.  This requirement modifies the requirement in section 4 to
220 |     "keep intact all notices".
221 | 
222 |     c) You must license the entire work, as a whole, under this
223 |     License to anyone who comes into possession of a copy.  This
224 |     License will therefore apply, along with any applicable section 7
225 |     additional terms, to the whole of the work, and all its parts,
226 |     regardless of how they are packaged.  This License gives no
227 |     permission to license the work in any other way, but it does not
228 |     invalidate such permission if you have separately received it.
229 | 
230 |     d) If the work has interactive user interfaces, each must display
231 |     Appropriate Legal Notices; however, if the Program has interactive
232 |     interfaces that do not display Appropriate Legal Notices, your
233 |     work need not make them do so.
234 | 
235 |   A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit.  Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 | 
245 |   6. Conveying Non-Source Forms.
246 | 
247 |   You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 | 
252 |     a) Convey the object code in, or embodied in, a physical product
253 |     (including a physical distribution medium), accompanied by the
254 |     Corresponding Source fixed on a durable physical medium
255 |     customarily used for software interchange.
256 | 
257 |     b) Convey the object code in, or embodied in, a physical product
258 |     (including a physical distribution medium), accompanied by a
259 |     written offer, valid for at least three years and valid for as
260 |     long as you offer spare parts or customer support for that product
261 |     model, to give anyone who possesses the object code either (1) a
262 |     copy of the Corresponding Source for all the software in the
263 |     product that is covered by this License, on a durable physical
264 |     medium customarily used for software interchange, for a price no
265 |     more than your reasonable cost of physically performing this
266 |     conveying of source, or (2) access to copy the
267 |     Corresponding Source from a network server at no charge.
268 | 
269 |     c) Convey individual copies of the object code with a copy of the
270 |     written offer to provide the Corresponding Source.  This
271 |     alternative is allowed only occasionally and noncommercially, and
272 |     only if you received the object code with such an offer, in accord
273 |     with subsection 6b.
274 | 
275 |     d) Convey the object code by offering access from a designated
276 |     place (gratis or for a charge), and offer equivalent access to the
277 |     Corresponding Source in the same way through the same place at no
278 |     further charge.  You need not require recipients to copy the
279 |     Corresponding Source along with the object code.  If the place to
280 |     copy the object code is a network server, the Corresponding Source
281 |     may be on a different server (operated by you or a third party)
282 |     that supports equivalent copying facilities, provided you maintain
283 |     clear directions next to the object code saying where to find the
284 |     Corresponding Source.  Regardless of what server hosts the
285 |     Corresponding Source, you remain obligated to ensure that it is
286 |     available for as long as needed to satisfy these requirements.
287 | 
288 |     e) Convey the object code using peer-to-peer transmission, provided
289 |     you inform other peers where the object code and Corresponding
290 |     Source of the work are being offered to the general public at no
291 |     charge under subsection 6d.
292 | 
293 |   A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 | 
297 |   A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling.  In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage.  For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product.  A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 | 
310 |   "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source.  The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 | 
318 |   If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information.  But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 | 
329 |   The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed.  Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 | 
337 |   Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 | 
343 |   7. Additional Terms.
344 | 
345 |   "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law.  If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 | 
354 |   When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it.  (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.)  You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 | 
361 |   Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 | 
365 |     a) Disclaiming warranty or limiting liability differently from the
366 |     terms of sections 15 and 16 of this License; or
367 | 
368 |     b) Requiring preservation of specified reasonable legal notices or
369 |     author attributions in that material or in the Appropriate Legal
370 |     Notices displayed by works containing it; or
371 | 
372 |     c) Prohibiting misrepresentation of the origin of that material, or
373 |     requiring that modified versions of such material be marked in
374 |     reasonable ways as different from the original version; or
375 | 
376 |     d) Limiting the use for publicity purposes of names of licensors or
377 |     authors of the material; or
378 | 
379 |     e) Declining to grant rights under trademark law for use of some
380 |     trade names, trademarks, or service marks; or
381 | 
382 |     f) Requiring indemnification of licensors and authors of that
383 |     material by anyone who conveys the material (or modified versions of
384 |     it) with contractual assumptions of liability to the recipient, for
385 |     any liability that these contractual assumptions directly impose on
386 |     those licensors and authors.
387 | 
388 |   All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10.  If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term.  If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 | 
398 |   If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 | 
403 |   Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 | 
407 |   8. Termination.
408 | 
409 |   You may not propagate or modify a covered work except as expressly
410 | provided under this License.  Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 | 
415 |   However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 | 
422 |   Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 | 
429 |   Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License.  If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 | 
435 |   9. Acceptance Not Required for Having Copies.
436 | 
437 |   You are not required to accept this License in order to receive or
438 | run a copy of the Program.  Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance.  However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work.  These actions infringe copyright if you do
443 | not accept this License.  Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 | 
446 |   10. Automatic Licensing of Downstream Recipients.
447 | 
448 |   Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License.  You are not responsible
451 | for enforcing compliance by third parties with this License.
452 | 
453 |   An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations.  If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 | 
463 |   You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License.  For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 | 
471 |   11. Patents.
472 | 
473 |   A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based.  The
475 | work thus licensed is called the contributor's "contributor version".
476 | 
477 |   A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version.  For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 | 
487 |   Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 | 
492 |   In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement).  To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 | 
499 |   If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients.  "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 | 
513 |   If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 | 
521 |   A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License.  You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 | 
536 |   Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 | 
540 |   12. No Surrender of Others' Freedom.
541 | 
542 |   If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License.  If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all.  For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 | 
552 |   13. Use with the GNU Affero General Public License.
553 | 
554 |   Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work.  The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 | 
563 |   14. Revised Versions of this License.
564 | 
565 |   The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time.  Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 | 
570 |   Each version is given a distinguishing version number.  If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation.  If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 | 
579 |   If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 | 
584 |   Later license versions may give you additional or different
585 | permissions.  However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 | 
589 |   15. Disclaimer of Warranty.
590 | 
591 |   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 | 
600 |   16. Limitation of Liability.
601 | 
602 |   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 | 
612 |   17. Interpretation of Sections 15 and 16.
613 | 
614 |   If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 | 
621 |                      END OF TERMS AND CONDITIONS
622 | 
623 |             How to Apply These Terms to Your New Programs
624 | 
625 |   If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 | 
629 |   To do so, attach the following notices to the program.  It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 | 
634 |     {one line to give the program's name and a brief idea of what it does.}
635 |     Copyright (C) {year}  {name of author}
636 | 
637 |     This program is free software: you can redistribute it and/or modify
638 |     it under the terms of the GNU General Public License as published by
639 |     the Free Software Foundation, either version 3 of the License, or
640 |     (at your option) any later version.
641 | 
642 |     This program is distributed in the hope that it will be useful,
643 |     but WITHOUT ANY WARRANTY; without even the implied warranty of
644 |     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
645 |     GNU General Public License for more details.
646 | 
647 |     You should have received a copy of the GNU General Public License
648 |     along with this program.  If not, see <http://www.gnu.org/licenses/>.
649 | 
650 | Also add information on how to contact you by electronic and paper mail.
651 | 
652 |   If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 | 
655 |     {project}  Copyright (C) {year}  {fullname}
656 |     This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 |     This is free software, and you are welcome to redistribute it
658 |     under certain conditions; type `show c' for details.
659 | 
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License.  Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 | 
664 |   You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | <http://www.gnu.org/licenses/>.
668 | 
669 |   The GNU General Public License does not permit incorporating your program
670 | into proprietary programs.  If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library.  If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License.  But first, please read
674 | <http://www.gnu.org/philosophy/why-not-lgpl.html>.
675 | 


--------------------------------------------------------------------------------