UNPKG

smc-hub

Version:

CoCalc: Backend webserver component

252 lines 11.9 kB
"use strict"; /* * This file is part of CoCalc: Copyright © 2020 Sagemath, Inc. * License: AGPLv3 s.t. "Commons Clause" – see LICENSE.md for details */ var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) { if (k2 === undefined) k2 = k; Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } }); }) : (function(o, m, k, k2) { if (k2 === undefined) k2 = k; o[k2] = m[k]; })); var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) { Object.defineProperty(o, "default", { enumerable: true, value: v }); }) : function(o, v) { o["default"] = v; }); var __importStar = (this && this.__importStar) || function (mod) { if (mod && mod.__esModule) return mod; var result = {}; if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k); __setModuleDefault(result, mod); return result; }; var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) { function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); } return new (P || (P = Promise))(function (resolve, reject) { function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } } function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } } function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } step((generator = generator.apply(thisArg, _arguments || [])).next()); }); }; var __generator = (this && this.__generator) || function (thisArg, body) { var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g; return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; function verb(n) { return function (v) { return step([n, v]); }; } function step(op) { if (f) throw new TypeError("Generator is already executing."); while (_) try { if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; if (y = 0, t) op = [op[0] & 2, t.value]; switch (op[0]) { case 0: case 1: t = op; break; case 4: _.label++; return { value: op[1], done: false }; case 5: _.label++; y = op[1]; op = [0]; continue; case 7: op = _.ops.pop(); _.trys.pop(); continue; default: if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; } if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; } if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; } if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; } if (t[2]) _.ops.pop(); _.trys.pop(); continue; } op = body.call(thisArg, _); } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; } if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true }; } }; var __read = (this && this.__read) || function (o, n) { var m = typeof Symbol === "function" && o[Symbol.iterator]; if (!m) return o; var i = m.call(o), r, ar = [], e; try { while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value); } catch (error) { e = { error: error }; } finally { try { if (r && !r.done && (m = i["return"])) m.call(i); } finally { if (e) throw e.error; } } return ar; }; var __spreadArray = (this && this.__spreadArray) || function (to, from) { for (var i = 0, il = from.length, j = to.length; i < il; i++, j++) to[j] = from[i]; return to; }; var __importDefault = (this && this.__importDefault) || function (mod) { return (mod && mod.__esModule) ? mod : { "default": mod }; }; Object.defineProperty(exports, "__esModule", { value: true }); exports.render_public_path = void 0; /* Render a public path */ // Do not backend render any file beyond this size, instead showing // a download link. This is to avoid a share server blocking for // a long time or using a lot of RAM. var MB = 1000000; var MAX_SIZE_MB = 10; // I want to raise this, but right now our Markdown and HTML renderers // are VERY slow on big files: var MAX_SIZE_HIGHLIGHT_MB = 0.5; var os_path = __importStar(require("path")); var fs_1 = require("fs"); var awaiting_1 = require("awaiting"); var misc_1 = require("smc-util/misc"); var app_framework_1 = require("smc-webapp/app-framework"); var public_path_1 = require("smc-webapp/share/public-path"); var file_contents_1 = require("smc-webapp/share/file-contents"); var directory_listing_1 = require("smc-webapp/share/directory-listing"); var listing_1 = require("./listing"); var util_1 = require("./util"); var base_path_1 = __importDefault(require("smc-util-node/base-path")); function render_public_path(opts) { return __awaiter(this, void 0, void 0, function () { function dbg() { var args = []; for (var _i = 0; _i < arguments.length; _i++) { args[_i] = arguments[_i]; } console.log.apply(console, __spreadArray(["render_public_path('" + path_to_file + "')"], __read(args))); } var path_to_file, stats, err_1, files, err_2, reverse, sort, component_1, noindex, why, content, ext, err_3, highlight, component, subtitle; return __generator(this, function (_a) { switch (_a.label) { case 0: path_to_file = os_path.join(opts.dir, opts.path); dbg(); _a.label = 1; case 1: _a.trys.push([1, 3, , 4]); return [4 /*yield*/, awaiting_1.callback(fs_1.stat, path_to_file)]; case 2: stats = _a.sent(); return [3 /*break*/, 4]; case 3: err_1 = _a.sent(); dbg("error", err_1); opts.res.sendStatus(404); return [2 /*return*/]; case 4: if (!stats.isDirectory()) return [3 /*break*/, 9]; dbg("is directory"); if (opts.path.slice(-1) !== "/") { util_1.redirect_to_directory(opts.req, opts.res); return [2 /*return*/]; } files = void 0; _a.label = 5; case 5: _a.trys.push([5, 7, , 8]); return [4 /*yield*/, listing_1.get_listing(path_to_file)]; case 6: files = _a.sent(); return [3 /*break*/, 8]; case 7: err_2 = _a.sent(); // TODO: show directory listing opts.res.send("Error getting directory listing -- " + err_2); return [2 /*return*/]; case 8: reverse = void 0; sort = void 0; if (opts.sort[0] === "-") { reverse = true; sort = opts.sort.slice(1); } else { reverse = false; sort = opts.sort; } files.sort(misc_1.field_cmp(sort)); if (reverse) { files.reverse(); } component_1 = app_framework_1.React.createElement(directory_listing_1.DirectoryListing, { hidden: opts.hidden, info: opts.info, files: files, viewer: opts.viewer, path: opts.path, views: opts.views, base_path: base_path_1.default, }); // NOTE: last true is because we never index directory listings -- instead we want // users to find specific files by their content and name opts.react(opts.res, component_1, opts.path, true); return [2 /*return*/]; case 9: dbg("is file"); if (opts.viewer == "share") { // do index a file if we will be showing it via the share server. noindex = false; } else { noindex = true; // never index content that is raw or embedded } why = undefined; content = undefined; ext = misc_1.filename_extension(path_to_file); if (ext != null) ext = ext.toLowerCase(); if (!!file_contents_1.has_viewer(ext)) return [3 /*break*/, 10]; why = "We do not have a way to display this file."; return [3 /*break*/, 17]; case 10: if (!(stats.size > MAX_SIZE_MB * MB)) return [3 /*break*/, 11]; why = "File too big to be shown."; return [3 /*break*/, 17]; case 11: if (!file_contents_1.needs_content(ext)) return [3 /*break*/, 16]; _a.label = 12; case 12: _a.trys.push([12, 14, , 15]); return [4 /*yield*/, awaiting_1.callback(fs_1.readFile, path_to_file)]; case 13: content = (_a.sent()).toString(); return [3 /*break*/, 15]; case 14: err_3 = _a.sent(); opts.res.sendStatus(404); return [2 /*return*/]; case 15: return [3 /*break*/, 17]; case 16: content = ""; _a.label = 17; case 17: if (ext == "ipynb") { // ipynb files tend to be very large, but still easy to render, due to images. // This is a little dangerous though! We will eventually need to do something // maybe async with a timeout... highlight = true; } else { highlight = stats.size < MAX_SIZE_HIGHLIGHT_MB * MB; } component = app_framework_1.React.createElement(public_path_1.PublicPath, { info: opts.info, content: content, viewer: opts.viewer, path: opts.path, why: why, size: stats.size, highlight: highlight, authors: opts.authors, base_path: base_path_1.default, views: opts.views, }); subtitle = misc_1.path_to_title(opts.path); opts.react(opts.res, component, subtitle, noindex); return [2 /*return*/]; } }); }); } exports.render_public_path = render_public_path; //# sourceMappingURL=render-public-path.js.map