| 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 |
|
|---|
| 34 | // Gives the permutation of all possible domainMatch()es of a given domain. The
|
|---|
| 35 | // array is in shortest-to-longest order. Handy for indexing.
|
|---|
| 36 |
|
|---|
| 37 | function permuteDomain(domain, allowSpecialUseDomain) {
|
|---|
| 38 | const pubSuf = pubsuffix.getPublicSuffix(domain, {
|
|---|
| 39 | allowSpecialUseDomain: allowSpecialUseDomain
|
|---|
| 40 | });
|
|---|
| 41 |
|
|---|
| 42 | if (!pubSuf) {
|
|---|
| 43 | return null;
|
|---|
| 44 | }
|
|---|
| 45 | if (pubSuf == domain) {
|
|---|
| 46 | return [domain];
|
|---|
| 47 | }
|
|---|
| 48 |
|
|---|
| 49 | // Nuke trailing dot
|
|---|
| 50 | if (domain.slice(-1) == ".") {
|
|---|
| 51 | domain = domain.slice(0, -1);
|
|---|
| 52 | }
|
|---|
| 53 |
|
|---|
| 54 | const prefix = domain.slice(0, -(pubSuf.length + 1)); // ".example.com"
|
|---|
| 55 | const parts = prefix.split(".").reverse();
|
|---|
| 56 | let cur = pubSuf;
|
|---|
| 57 | const permutations = [cur];
|
|---|
| 58 | while (parts.length) {
|
|---|
| 59 | cur = `${parts.shift()}.${cur}`;
|
|---|
| 60 | permutations.push(cur);
|
|---|
| 61 | }
|
|---|
| 62 | return permutations;
|
|---|
| 63 | }
|
|---|
| 64 |
|
|---|
| 65 | exports.permuteDomain = permuteDomain;
|
|---|
