react-native/local-cli/util/findSymlinksPaths.js
Sophie Alpert 1490ab12ef Update license headers for MIT license
Summary:
Includes React Native and its dependencies Fresco, Metro, and Yoga. Excludes samples/examples/docs.

find: ^(?:( *)|( *(?:[\*~#]|::))( )? *)?Copyright (?:\(c\) )?(\d{4})\b.+Facebook[\s\S]+?BSD[\s\S]+?(?:this source tree|the same directory)\.$
replace: $1$2$3Copyright (c) $4-present, Facebook, Inc.\n$2\n$1$2$3This source code is licensed under the MIT license found in the\n$1$2$3LICENSE file in the root directory of this source tree.

Reviewed By: TheSavior, yungsters

Differential Revision: D7007050

fbshipit-source-id: 37dd6bf0ffec0923bfc99c260bb330683f35553e
2018-02-16 18:31:53 -08:00

58 lines
1.5 KiB
JavaScript

/**
* 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);
}