permuteDomain.js 2.7 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970
  1. /*!
  2. * Copyright (c) 2015, Salesforce.com, Inc.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice,
  9. * this list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * 3. Neither the name of Salesforce.com nor the names of its contributors may
  16. * be used to endorse or promote products derived from this software without
  17. * specific prior written permission.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  20. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  21. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  22. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  23. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  24. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  25. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  26. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  27. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  28. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  29. * POSSIBILITY OF SUCH DAMAGE.
  30. */
  31. "use strict";
  32. const pubsuffix = require("./pubsuffix-psl");
  33. // Gives the permutation of all possible domainMatch()es of a given domain. The
  34. // array is in shortest-to-longest order. Handy for indexing.
  35. const SPECIAL_USE_DOMAINS = ["local"]; // RFC 6761
  36. function permuteDomain(domain, allowSpecialUseDomain) {
  37. let pubSuf = null;
  38. if (allowSpecialUseDomain) {
  39. const domainParts = domain.split(".");
  40. if (SPECIAL_USE_DOMAINS.includes(domainParts[domainParts.length - 1])) {
  41. pubSuf = `${domainParts[domainParts.length - 2]}.${
  42. domainParts[domainParts.length - 1]
  43. }`;
  44. } else {
  45. pubSuf = pubsuffix.getPublicSuffix(domain);
  46. }
  47. } else {
  48. pubSuf = pubsuffix.getPublicSuffix(domain);
  49. }
  50. if (!pubSuf) {
  51. return null;
  52. }
  53. if (pubSuf == domain) {
  54. return [domain];
  55. }
  56. const prefix = domain.slice(0, -(pubSuf.length + 1)); // ".example.com"
  57. const parts = prefix.split(".").reverse();
  58. let cur = pubSuf;
  59. const permutations = [cur];
  60. while (parts.length) {
  61. cur = `${parts.shift()}.${cur}`;
  62. permutations.push(cur);
  63. }
  64. return permutations;
  65. }
  66. exports.permuteDomain = permuteDomain;