|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245 |
- /**
- * @fileoverview A class of the code path segment.
- * @author Toru Nagashima
- */
-
- "use strict";
-
- //------------------------------------------------------------------------------
- // Requirements
- //------------------------------------------------------------------------------
-
- const debug = require("./debug-helpers");
-
- //------------------------------------------------------------------------------
- // Helpers
- //------------------------------------------------------------------------------
-
- /**
- * Checks whether or not a given segment is reachable.
- *
- * @param {CodePathSegment} segment - A segment to check.
- * @returns {boolean} `true` if the segment is reachable.
- */
- function isReachable(segment) {
- return segment.reachable;
- }
-
- //------------------------------------------------------------------------------
- // Public Interface
- //------------------------------------------------------------------------------
-
- /**
- * A code path segment.
- */
- class CodePathSegment {
-
- /**
- * @param {string} id - An identifier.
- * @param {CodePathSegment[]} allPrevSegments - An array of the previous segments.
- * This array includes unreachable segments.
- * @param {boolean} reachable - A flag which shows this is reachable.
- */
- constructor(id, allPrevSegments, reachable) {
-
- /**
- * The identifier of this code path.
- * Rules use it to store additional information of each rule.
- * @type {string}
- */
- this.id = id;
-
- /**
- * An array of the next segments.
- * @type {CodePathSegment[]}
- */
- this.nextSegments = [];
-
- /**
- * An array of the previous segments.
- * @type {CodePathSegment[]}
- */
- this.prevSegments = allPrevSegments.filter(isReachable);
-
- /**
- * An array of the next segments.
- * This array includes unreachable segments.
- * @type {CodePathSegment[]}
- */
- this.allNextSegments = [];
-
- /**
- * An array of the previous segments.
- * This array includes unreachable segments.
- * @type {CodePathSegment[]}
- */
- this.allPrevSegments = allPrevSegments;
-
- /**
- * A flag which shows this is reachable.
- * @type {boolean}
- */
- this.reachable = reachable;
-
- // Internal data.
- Object.defineProperty(this, "internal", {
- value: {
- used: false,
- loopedPrevSegments: []
- }
- });
-
- /* istanbul ignore if */
- if (debug.enabled) {
- this.internal.nodes = [];
- this.internal.exitNodes = [];
- }
- }
-
- /**
- * Checks a given previous segment is coming from the end of a loop.
- *
- * @param {CodePathSegment} segment - A previous segment to check.
- * @returns {boolean} `true` if the segment is coming from the end of a loop.
- */
- isLoopedPrevSegment(segment) {
- return this.internal.loopedPrevSegments.indexOf(segment) !== -1;
- }
-
- /**
- * Creates the root segment.
- *
- * @param {string} id - An identifier.
- * @returns {CodePathSegment} The created segment.
- */
- static newRoot(id) {
- return new CodePathSegment(id, [], true);
- }
-
- /**
- * Creates a segment that follows given segments.
- *
- * @param {string} id - An identifier.
- * @param {CodePathSegment[]} allPrevSegments - An array of the previous segments.
- * @returns {CodePathSegment} The created segment.
- */
- static newNext(id, allPrevSegments) {
- return new CodePathSegment(
- id,
- CodePathSegment.flattenUnusedSegments(allPrevSegments),
- allPrevSegments.some(isReachable)
- );
- }
-
- /**
- * Creates an unreachable segment that follows given segments.
- *
- * @param {string} id - An identifier.
- * @param {CodePathSegment[]} allPrevSegments - An array of the previous segments.
- * @returns {CodePathSegment} The created segment.
- */
- static newUnreachable(id, allPrevSegments) {
- const segment = new CodePathSegment(id, CodePathSegment.flattenUnusedSegments(allPrevSegments), false);
-
- /*
- * In `if (a) return a; foo();` case, the unreachable segment preceded by
- * the return statement is not used but must not be remove.
- */
- CodePathSegment.markUsed(segment);
-
- return segment;
- }
-
- /**
- * Creates a segment that follows given segments.
- * This factory method does not connect with `allPrevSegments`.
- * But this inherits `reachable` flag.
- *
- * @param {string} id - An identifier.
- * @param {CodePathSegment[]} allPrevSegments - An array of the previous segments.
- * @returns {CodePathSegment} The created segment.
- */
- static newDisconnected(id, allPrevSegments) {
- return new CodePathSegment(id, [], allPrevSegments.some(isReachable));
- }
-
- /**
- * Makes a given segment being used.
- *
- * And this function registers the segment into the previous segments as a next.
- *
- * @param {CodePathSegment} segment - A segment to mark.
- * @returns {void}
- */
- static markUsed(segment) {
- if (segment.internal.used) {
- return;
- }
- segment.internal.used = true;
-
- let i;
-
- if (segment.reachable) {
- for (i = 0; i < segment.allPrevSegments.length; ++i) {
- const prevSegment = segment.allPrevSegments[i];
-
- prevSegment.allNextSegments.push(segment);
- prevSegment.nextSegments.push(segment);
- }
- } else {
- for (i = 0; i < segment.allPrevSegments.length; ++i) {
- segment.allPrevSegments[i].allNextSegments.push(segment);
- }
- }
- }
-
- /**
- * Marks a previous segment as looped.
- *
- * @param {CodePathSegment} segment - A segment.
- * @param {CodePathSegment} prevSegment - A previous segment to mark.
- * @returns {void}
- */
- static markPrevSegmentAsLooped(segment, prevSegment) {
- segment.internal.loopedPrevSegments.push(prevSegment);
- }
-
- /**
- * Replaces unused segments with the previous segments of each unused segment.
- *
- * @param {CodePathSegment[]} segments - An array of segments to replace.
- * @returns {CodePathSegment[]} The replaced array.
- */
- static flattenUnusedSegments(segments) {
- const done = Object.create(null);
- const retv = [];
-
- for (let i = 0; i < segments.length; ++i) {
- const segment = segments[i];
-
- // Ignores duplicated.
- if (done[segment.id]) {
- continue;
- }
-
- // Use previous segments if unused.
- if (!segment.internal.used) {
- for (let j = 0; j < segment.allPrevSegments.length; ++j) {
- const prevSegment = segment.allPrevSegments[j];
-
- if (!done[prevSegment.id]) {
- done[prevSegment.id] = true;
- retv.push(prevSegment);
- }
- }
- } else {
- done[segment.id] = true;
- retv.push(segment);
- }
- }
-
- return retv;
- }
- }
-
- module.exports = CodePathSegment;
|