This app provides monitoring and information features for the common freifunk user and the technical stuff of a freifunk community.
Code base is taken from a TUM Practical Course project and added here to see if Freifunk Altdorf can use it.
https://www.freifunk-altdorf.de
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
58 lines
1.5 KiB
58 lines
1.5 KiB
6 years ago
|
/**
|
||
|
|
* Copyright (c) 2015-present, Facebook, Inc.
|
||
|
|
*
|
||
|
|
* This source code is licensed under the MIT license found in the
|
||
|
|
* LICENSE file in the root directory of this source tree.
|
||
|
|
*/
|
||
|
|
|
||
|
|
const path = require('path');
|
||
|
|
const fs = require('fs');
|
||
|
|
|
||
|
|
/**
|
||
|
|
* Find and resolve symlinks in `lookupFolder`.
|
||
|
|
* Ignore any descendants of the paths in `ignoredRoots`.
|
||
|
|
*/
|
||
|
|
module.exports = function findSymlinksPaths(lookupFolder, ignoredRoots) {
|
||
|
|
const timeStart = Date.now();
|
||
|
|
const folders = fs.readdirSync(lookupFolder);
|
||
|
|
|
||
|
|
const resolvedSymlinks = [];
|
||
|
|
folders.forEach(folder => {
|
||
|
|
const visited = [];
|
||
|
|
|
||
|
|
let symlink = path.resolve(lookupFolder, folder);
|
||
|
|
while (fs.lstatSync(symlink).isSymbolicLink()) {
|
||
|
|
const index = visited.indexOf(symlink);
|
||
|
|
if (index !== -1) {
|
||
|
|
throw Error(
|
||
|
|
'Infinite symlink recursion detected:\n ' +
|
||
|
|
visited.slice(index).join('\n ')
|
||
|
|
);
|
||
|
|
}
|
||
|
|
|
||
|
|
visited.push(symlink);
|
||
|
|
symlink = path.resolve(
|
||
|
|
path.dirname(symlink),
|
||
|
|
fs.readlinkSync(symlink)
|
||
|
|
);
|
||
|
|
}
|
||
|
|
|
||
|
|
if (visited.length && !rootExists(ignoredRoots, symlink)) {
|
||
|
|
resolvedSymlinks.push(symlink);
|
||
|
|
}
|
||
|
|
});
|
||
|
|
|
||
|
|
const timeEnd = Date.now();
|
||
|
|
console.log(`Scanning ${folders.length} folders for symlinks in ${lookupFolder} (${timeEnd - timeStart}ms)`);
|
||
|
|
|
||
|
|
return resolvedSymlinks;
|
||
|
|
};
|
||
|
|
|
||
|
|
function rootExists(roots, child) {
|
||
|
|
return roots.some(root => isDescendant(root, child));
|
||
|
|
}
|
||
|
|
|
||
|
|
function isDescendant(root, child) {
|
||
|
|
return root === child || child.startsWith(root + path.sep);
|
||
|
|
}
|