simplecov 1.1.1 → 1.3.0

data/lib/simplecov/context_map.rb

@@ -0,0 +1,187 @@
+# frozen_string_literal: true
+
+module SimpleCov
+  #
+  # Records which context covered which line: a list of context ids and, per
+  # source file, a bitmap of covered lines for each context that touched the
+  # file. A context is any labeled region of execution, and the vocabulary is
+  # deliberately the general one (coverage.py calls the same idea dynamic
+  # contexts), so the stored format doesn't bake simplecov's current use into
+  # a name.
+  #
+  # The naive shape of this data, a list of ids on every line, is
+  # O(contexts x lines) strings. Context ids are interned instead, and each
+  # context's covered lines within a file are a single Integer bitmap with bit
+  # N set when line N+1 was executed, which packs a thousand-line file into
+  # ~125 bytes and makes the union of two recordings a bitwise OR.
+  #
+  # Serialized into `.resultset.json` as `{"version" => 1, "contexts" =>
+  # [...ids...], "files" => {path => {context index => bitmap as hex}}}`. The
+  # format is tolerated, not trusted: `.from_hash` returns nil for anything
+  # malformed or future-versioned, which the merge treats the same as a map
+  # that was never recorded.
+  #
+  class ContextMap
+    # Bumped on any change an older reader could misread, so `.from_hash` can
+    # treat a future format as absent instead of answering from it wrongly.
+    VERSION = 1
+
+    def initialize
+      @contexts = [] #: Array[String]
+      @indices = {} #: Hash[String, Integer]
+      @files = {} #: Hash[String, Hash[Integer, Integer]]
+    end
+
+    # `lines_by_file` maps a source path to the bitmap of lines the context
+    # executed there. The id is interned even when the delta is empty: the
+    # context ran, and keeping it distinguishes "covered nothing of its own"
+    # from "never recorded".
+    def record(context_id, lines_by_file)
+      index = intern(context_id)
+      lines_by_file.each do |path, bitmap|
+        next if bitmap.zero?
+
+        table = (@files[path] ||= {})
+        table[index] = (table[index] || 0) | bitmap
+      end
+      self
+    end
+
+    # Sorted for stable output, since recording order varies between runs and
+    # merges. The path is resolved against `SimpleCov.root`, so callers can
+    # pass either an absolute or a project-relative one.
+    #
+    # A line number below 1 needs no guard of its own: it shifts the probe bit
+    # right off the end of the bitmap, leaving a mask no line can match.
+    def covering(path, line)
+      table = @files[File.expand_path(path, SimpleCov.root)]
+      return [] unless table
+
+      bit = 1 << (line - 1)
+      table.filter_map { |index, bitmap| @contexts.fetch(index) if bitmap.anybits?(bit) }.sort
+    end
+
+    def contexts
+      @contexts.dup
+    end
+
+    def empty?
+      @contexts.empty?
+    end
+
+    # Other's contexts are re-interned, so maps recorded by different processes
+    # merge by id, and a context both sides saw contributes one entry.
+    def absorb(other)
+      remap = other.interned_contexts.map { |context_id| intern(context_id) }
+      other.file_tables.each do |path, table|
+        target = (@files[path] ||= {})
+        table.each do |index, bitmap|
+          key = remap.fetch(index)
+          target[key] = (target[key] || 0) | bitmap
+        end
+      end
+      self
+    end
+
+    # `only:` restricts the files to a given set of paths, so the map follows
+    # the same universe as the coverage it sits beside. The context list is
+    # never restricted: which contexts ran is true regardless of which files
+    # survived filtering.
+    def to_h(only: nil)
+      # Selected rather than sliced: `only` is a Set, and splatting one into
+      # `slice` is a call `to_a` answers for, which makes dropping the `to_a` a
+      # mutation nothing can observe.
+      tables = only ? @files.select { |path, _table| only.include?(path) } : @files # rubocop:disable Style/HashSlice
+      serialized = tables.transform_values { |table| serialize_table(table) }
+      {"version" => VERSION, "contexts" => @contexts.dup, "files" => serialized}
+    end
+
+    # Index string => hex bitmap, the wire encoding `to_h` writes.
+    # coverage.json shares the resultset's encoding through this, so the format
+    # has one owner.
+    def serialized_bitmaps_for(path)
+      serialize_table(@files[File.expand_path(path, SimpleCov.root)] || {})
+    end
+
+    # @api private
+    def intern(context_id)
+      @indices[context_id] ||= begin
+        @contexts << context_id
+        @contexts.size - 1
+      end
+    end
+
+    class << self
+      # nil when the data is not a well-formed map of this format version.
+      # All-or-nothing on purpose: a partially salvaged map would answer
+      # `covering` queries with silent gaps, and the merge already drops an
+      # absent map consistently.
+      def from_hash(data)
+        # `eql?` rather than `==`: a version written as 1.0 is not this format,
+        # and reading it as if it were is what the version gate exists to stop.
+        return nil unless data.instance_of?(Hash) && data["version"].eql?(VERSION)
+
+        contexts = data["contexts"]
+        files = data["files"]
+        return nil unless contexts.instance_of?(Array) && contexts.all?(String) && files.instance_of?(Hash)
+
+        build(contexts, files)
+      end
+
+      private
+
+      def build(contexts, files)
+        map = new
+        contexts.each { |context_id| map.intern(context_id) }
+        files.each do |path, table|
+          return nil unless path.instance_of?(String) && table.instance_of?(Hash)
+          return nil unless absorb_table(map, contexts, path, table)
+        end
+        map
+      end
+
+      def absorb_table(map, contexts, path, table)
+        table.all? do |index, encoded|
+          position = parse_index(index, contexts.size)
+          bitmap = parse_bitmap(encoded)
+          map.record(contexts.fetch(position), path => bitmap) if position && bitmap
+        end
+      end
+
+      # A serialized context index is a decimal string pointing into the entry's
+      # own context list. An out-of-range one makes the whole map malformed.
+      def parse_index(index, size)
+        return nil unless index.instance_of?(String) && index.match?(/\A\d+\z/)
+
+        value = index.to_i
+        value if value < size
+      end
+
+      def parse_bitmap(encoded)
+        return nil unless encoded.instance_of?(String) && encoded.match?(/\A\h+\z/)
+
+        encoded.to_i(16)
+      end
+    end
+
+    private
+
+    # Sorted by index: recording and merge order vary run to run, and a
+    # deterministic serialization keeps stored resultsets diffable.
+    def serialize_table(table)
+      table.sort.to_h { |index, bitmap| [index.to_s, bitmap.to_s(16)] }
+    end
+
+    protected
+
+    # Live state, not copies, which is why these are protected rather than
+    # public.
+    def interned_contexts
+      @contexts
+    end
+
+    def file_tables
+      @files
+    end
+  end
+end

data/lib/simplecov/coverage_json.rb

@@ -3,9 +3,6 @@
 require "json"
 
 module SimpleCov
-  # Shared parser for coverage.json consumers. It enforces the encoding and
-  # stable outermost shape while leaving command- or viewer-specific fields to
-  # their respective callers.
   module CoverageJSON
     class Error < StandardError; end
 
@@ -14,11 +11,11 @@ module SimpleCov
       raise Error, "input is not valid UTF-8" unless source.valid_encoding?
 
       document = JSON.parse(source)
-      return document if document.is_a?(Hash)
+      return document if document.instance_of?(Hash)
 
       raise Error, "top-level value must be an object"
     rescue JSON::ParserError => e
-      raise Error, e.message
+      raise Error, e
     end
   end
 end

data/lib/simplecov/coverage_statistics.rb

@@ -1,22 +1,17 @@
 # frozen_string_literal: true
 
 module SimpleCov
-  # Holds the individual data of a coverage result.
-  #
-  # This is uniform across coverage criteria as they all have:
-  #
-  # * total - how many things to cover there are (total relevant loc/branches)
-  # * covered - how many of the coverables are hit
-  # * missed - how many of the coverables are missed
-  # * omitted - how many lines cannot be covered (blank lines/comments); only meaningful for line coverage
-  # * percent - percentage as covered/missed
-  # * strength - average hits per coverable unit (will not exist for one shot lines format)
+  # One coverage criterion's numbers, uniform across criteria: total, covered,
+  # missed, omitted (only meaningful for line coverage), percent, and strength,
+  # the average hits per coverable unit, which the oneshot-lines format has no
+  # way to produce.
   class CoverageStatistics
     attr_reader :total, :covered, :missed, :omitted, :strength, :percent
 
-    # Seed for the reduce in `.from`: covered, missed, omitted, strength.
     ZERO_STATS = [0, 0, 0, 0.0].freeze #: [Integer, Integer, Integer, Float]
 
+    # Strength is remultiplied by loc because files have different strengths and
+    # line counts, giving them a different weight in the total.
     def self.from(coverage_statistics)
       sum_covered, sum_missed, sum_omitted, sum_total_strength =
         coverage_statistics.reduce(ZERO_STATS) do |(covered, missed, omitted, total_strength), stats|
@@ -24,8 +19,6 @@ module SimpleCov
             covered + stats.covered,
             missed + stats.missed,
             omitted + stats.omitted,
-            # gotta remultiply with loc because files have different strength and loc
-            # giving them a different "weight" in total
             total_strength + (stats.strength * stats.total)
           ]
         end
@@ -33,19 +26,16 @@ module SimpleCov
       new(covered: sum_covered, missed: sum_missed, omitted: sum_omitted, total_strength: sum_total_strength)
     end
 
-    # Requires only covered, missed and strength to be initialized.
-    #
-    # Other values are computed by this class.
-    def initialize(covered:, missed:, omitted: 0, total_strength: 0.0, percent: nil)
-      @covered  = covered
-      @missed   = missed
-      @omitted  = omitted
-      @total    = covered + missed
-      @percent  = percent || compute_percent(covered, missed, total)
+    def initialize(covered:, missed:, omitted: 0, total_strength: 0, percent: nil)
+      @covered = covered
+      @missed = missed
+      @omitted = omitted
+      @total = covered + missed
+      @percent = percent || compute_percent(covered, missed, total)
       @strength = compute_strength(total_strength, total)
     end
 
-  private
+    private
 
     def compute_percent(covered, missed, total)
       return 100.0 if missed.zero?
@@ -56,7 +46,7 @@ module SimpleCov
     def compute_strength(total_strength, total)
       return 0.0 if total.zero?
 
-      total_strength.to_f / total
+      total_strength.fdiv(total)
     end
   end
 end

data/lib/simplecov/coverage_violations.rb

@@ -1,48 +1,71 @@
 # frozen_string_literal: true
 
 module SimpleCov
-  # Computes coverage threshold violations for a given result. Shared by
-  # the exit-code checks and the JSON formatter's `errors` section.
-  #
-  # Each method returns an array of violation hashes. All percents are
-  # rounded via `SimpleCov.round_coverage` so downstream consumers don't
-  # need to round again.
   module CoverageViolations
     class << self
-      # @return [Array<Hash>] {:criterion, :expected, :actual}
       def minimum_overall(result, thresholds)
         thresholds.filter_map do |criterion, expected|
-          actual = percent_for(result, criterion) or next
+          actual = floored_percent_for(result, criterion) or next
           {criterion: criterion, expected: expected, actual: actual} if actual < expected
         end
       end
 
-      # @return [Array<Hash>] {:criterion, :expected, :actual}
-      # Tolerance: `percent_for` floors the actual percent to two decimal
-      # places (matching the existing minimum-coverage behavior), so an
-      # actual of e.g. 95.4287 is treated as 95.42 — meaning a maximum of
-      # 95.42 still passes. See issue #187 for the rationale.
+      # An actual of 95.4287 floors to 95.42, so a maximum of 95.42 passes
+      # (#187).
       def maximum_overall(result, thresholds)
         thresholds.filter_map do |criterion, expected|
-          actual = percent_for(result, criterion) or next
+          actual = floored_percent_for(result, criterion) or next
           {criterion: criterion, expected: expected, actual: actual} if actual > expected
         end
       end
 
-      # @return [Array<Hash>] {:criterion, :expected, :actual, :filename, :project_filename}
-      #
-      # `defaults` is the criterion-keyed Hash applied to every file.
-      # `overrides` is an ordered Hash<pattern, criterion_thresholds> of per-path
-      # overrides; for each file, defaults are merged with every matching override
-      # (later wins per criterion, overrides win over defaults).
-      def minimum_by_file(result, defaults, overrides = {})
+      # A file and criterion with a `baseline` floor is exempt here: the baseline
+      # check holds it to its own floor instead, which is the fall-through the
+      # ratchet workflow rests on (#1268).
+      def minimum_by_file(result, defaults, overrides = {}, baseline: nil)
         result.files.flat_map do |file|
           effective = effective_per_file_thresholds(file, defaults, overrides)
-          effective.filter_map { |criterion, expected| file_minimum_violation(file, criterion, expected) }
+          effective.filter_map do |criterion, expected|
+            next if baseline&.covers?(file.project_filename, criterion)
+
+            file_minimum_violation(file, criterion, expected)
+          end
+        end
+      end
+
+      # A baseline violation needs the file below its floor on both axes: a
+      # percent under the floor's, and (when the floor records one) more misses
+      # than it allows. The missed count is what keeps percent movement from
+      # pure edits out of the answer.
+      def baseline(result, baseline)
+        return [] unless baseline
+
+        result.files.flat_map do |file|
+          entry = baseline.entry_for(file.project_filename)
+          next [] unless entry
+
+          entry.filter_map { |criterion, floor| baseline_violation(file, criterion, floor) }
+        end
+      end
+
+      def maximum_missed(result, caps)
+        caps.filter_map do |criterion, maximum|
+          actual = missed_for(result, criterion) or next
+          {criterion: criterion, maximum: maximum, actual: actual} if actual > maximum
+        end
+      end
+
+      def maximum_missed_by_file(result, defaults, overrides = {}, baseline: nil)
+        result.files.flat_map do |file|
+          effective = effective_per_file_thresholds(file, defaults, overrides)
+          effective.filter_map do |criterion, maximum|
+            next if baseline&.covers?(file.project_filename, criterion)
+
+            file_missed_cap_violation(file, criterion, maximum)
+          end
         end
       end
 
-      # @return [Array<Hash>] {:group_name, :criterion, :expected, :actual}
       def minimum_by_group(result, thresholds)
         thresholds.flat_map do |group_name, minimums|
           group = lookup_group(result, group_name)
@@ -51,50 +74,38 @@ module SimpleCov
         end
       end
 
-      # @return [Array<Hash>] {:criterion, :maximum, :actual} where `actual`
-      #   is the observed drop (in percentage points) vs. the last run.
-      def maximum_drop(result, thresholds, last_run: SimpleCov::LastRun.read)
-        return [] unless last_run
+      def maximum_drop(result, thresholds, last_run: nil, mode: SimpleCov.drop_baseline)
+        baseline = drop_baseline_percents(mode, last_run)
+        return [] unless baseline
 
         thresholds.filter_map do |criterion, maximum|
-          actual = compute_drop(criterion, result, last_run)
+          actual = compute_drop(criterion, result, baseline)
           {criterion: criterion, maximum: maximum, actual: actual} if actual && actual > maximum
         end
       end
 
-    private
+      private
 
-      # Look up a criterion's percent on any coverage_statistics-bearing
-      # object (Result, SourceFile, FileList). Returns nil — and the
-      # caller silently skips — when the criterion was configured but not
-      # actually measured by the runtime (e.g. `minimum_coverage branch:
-      # 100` under the "strict" profile on JRuby, where the Coverage
-      # module doesn't emit branch data). The config-time
-      # `raise_if_criterion_disabled` check still catches the genuine
-      # "forgot to enable the criterion" mistake before we ever get here.
-      def percent_for(stats_source, criterion)
+      # Answers nil, and the caller silently skips, when the criterion was
+      # configured but not measured by the runtime (`branch: 100` under the
+      # "strict" profile on JRuby, say). The config-time
+      # `raise_if_criterion_disabled` check catches the genuine mistake earlier.
+      def floored_percent_for(stats_source, criterion)
         stats = stats_source.coverage_statistics[SimpleCov.coverage_statistics_key(criterion)]
         round(stats.percent) if stats
       end
 
-      # Walk the overrides in declaration order, merging each one that matches
-      # the file's project path into the running effective threshold (so the
-      # most-specific or latest-declared override wins per criterion). Returns
-      # the defaults Hash unchanged when nothing matches.
       def effective_per_file_thresholds(file, defaults, overrides)
-        return defaults if overrides.empty?
-
         path = file.project_filename
         overrides.reduce(defaults) do |acc, (pattern, criterion_thresholds)|
           path_matches?(path, pattern) ? acc.merge(criterion_thresholds) : acc
         end
       end
 
-      # Per-path matching for `minimum_coverage_by_file` overrides. Strings
-      # ending in `/` are treated as directory prefixes; otherwise they must
-      # match `project_filename` exactly. Regexps are tested via `match?`.
-      # The configuration setter rejects anything other than String/Regexp,
-      # so no dead `else` branch is needed here.
+      # `==` and `eql?` are indistinguishable for the String operands, so that
+      # mutation is equivalent. The override examples pin every arm instead.
+      # mutant:disable
+      # mutant:disable
       def path_matches?(project_filename, pattern)
         return project_filename.match?(pattern) if pattern.is_a?(Regexp)
         return project_filename.start_with?(pattern) if pattern.end_with?("/")
@@ -102,8 +113,33 @@ module SimpleCov
         project_filename == pattern
       end
 
+      def missed_for(stats_source, criterion)
+        stats = stats_source.coverage_statistics[SimpleCov.coverage_statistics_key(criterion)]
+        stats&.missed
+      end
+
+      def file_missed_cap_violation(file, criterion, maximum)
+        actual = missed_for(file, criterion) or return
+        return unless actual > maximum
+
+        {criterion: criterion, maximum: maximum, actual: actual,
+         filename: file.filename, project_filename: file.project_filename}
+      end
+
+      def baseline_violation(file, criterion, floor)
+        stats = file.coverage_statistics[SimpleCov.coverage_statistics_key(criterion)]
+        return unless stats
+
+        actual = round(stats.percent)
+        return unless actual < floor.percent
+        return if floor.missed && stats.missed <= floor.missed
+
+        {criterion: criterion, expected: floor.percent, allowed_missed: floor.missed, actual: actual,
+         actual_missed: stats.missed, filename: file.filename, project_filename: file.project_filename}
+      end
+
       def file_minimum_violation(file, criterion, expected)
-        actual = percent_for(file, criterion) or return
+        actual = floored_percent_for(file, criterion) or return
         return unless actual < expected
 
         {
@@ -117,37 +153,96 @@ module SimpleCov
 
       def group_minimum_violations(group_name, group, minimums)
         minimums.filter_map do |criterion, expected|
-          actual = percent_for(group, criterion) or next
+          actual = floored_percent_for(group, criterion) or next
           {group_name: group_name, criterion: criterion, expected: expected, actual: actual} if actual < expected
         end
       end
 
-      # The misconfiguration notice is enforcement output, not a Ruby
-      # warning: like every other enforcement message it must survive
-      # `-W0` and `Warning.warn` hooks (see ExitCodes.print_error) and
-      # honor the `print_errors` opt-out.
+      # The misconfiguration notice is enforcement output, not a Ruby warning: it
+      # must survive `-W0` and `Warning.warn` hooks, and honor `print_errors`. A
+      # configured group that matched no files is absent from `result.groups`
+      # too, but has nothing to gate rather than nothing to look up.
       def lookup_group(result, group_name)
         group = result.groups[group_name]
-        if group.nil? && SimpleCov.print_errors
+        if group.nil? && SimpleCov.print_errors && !result.configured_group?(group_name)
           ExitCodes.print_error "minimum_coverage_by_group: no group named '#{group_name}' exists. " \
-                                "Available groups: #{result.groups.keys.join(', ')}"
+                                "Available groups: #{result.groups.keys.join(", ")}"
         end
         group
       end
 
-      def compute_drop(criterion, result, last_run)
-        stats_key = SimpleCov.coverage_statistics_key(criterion)
-        last_coverage_percent = last_run.dig(:result, stats_key)
-        if last_coverage_percent.nil? && stats_key == :line
-          last_coverage_percent = last_run.dig(:result, :covered_percent)
+      def drop_baseline_percents(mode, last_run)
+        case mode
+        when :median then median_baseline
+        when :branch then branch_baseline
+        else last_run_baseline(last_run || LastRun.read)
+        end
+      end
+
+      # A hand-edited .last_run.json can carry any value type, and `LastRun.read`
+      # only vouches for the top level being a Hash. `:covered_percent` is the
+      # pre-criteria file format's spelling of the line percent.
+      def last_run_baseline(last_run)
+        return nil unless last_run.is_a?(Hash)
+
+        previous = (_ = last_run)[:result]
+        return nil unless previous.is_a?(Hash)
+
+        previous = _ = previous
+        {line: previous[:line] || previous[:covered_percent],
+         branch: previous[:branch], method: previous[:method]}
+      end
+
+      def median_baseline
+        totals = history_totals
+        baseline = {} #: Hash[Symbol, untyped]
+        %i[line branch method].each do |criterion|
+          values = totals.map { |entry| entry[criterion.to_s] }.grep(Numeric)
+          baseline[criterion] = median(values) unless values.empty?
+        end
+        baseline
+      end
+
+      def history_totals
+        History.read.filter_map do |entry|
+          entry.fetch("totals") if entry.is_a?(Hash) && entry["totals"].is_a?(Hash)
         end
-        # A hand-edited .last_run.json can carry any value type, and
-        # LastRun.read only vouches for the top level being a Hash.
+      end
+
+      def median(values)
+        sorted = values.sort
+        mid = sorted.length / 2
+        sorted.length.odd? ? sorted.fetch(mid) : (sorted.fetch(mid - 1) + sorted.fetch(mid)).fdiv(2)
+      end
+
+      def branch_baseline
+        branch, = History.git_info
+        return nil unless branch
+
+        entry = History.read.reverse_each.find { |candidate| branch_entry?(candidate, branch) }
+        return nil unless entry
+
+        totals = {} #: Hash[Symbol, untyped]
+        entry.fetch("totals").each { |key, value| totals[key.to_sym] = value }
+        totals
+      end
+
+      # `==` and `eql?` are indistinguishable for the String operands, so that
+      # mutation is equivalent. The branch-baseline examples pin every clause.
+      # mutant:disable
+      # mutant:disable
+      def branch_entry?(candidate, branch)
+        candidate.is_a?(Hash) && candidate["branch"] == branch && candidate["totals"].is_a?(Hash)
+      end
+
+      def compute_drop(criterion, result, baseline)
+        stats_key = SimpleCov.coverage_statistics_key(criterion)
+        last_coverage_percent = baseline[stats_key]
         # Treat a non-numeric percent like a missing one instead of
         # raising out of the at_exit hook.
         return unless last_coverage_percent.is_a?(Numeric)
 
-        current = percent_for(result, criterion) or return
+        current = floored_percent_for(result, criterion) or return
         (last_coverage_percent - current).floor(10)
       end
 

data/lib/simplecov/current_run.rb

@@ -0,0 +1,61 @@
+# frozen_string_literal: true
+
+module SimpleCov
+  # The state one measured run accumulates in one process: the pid and start
+  # time that identify it, the result it computes, the flags the merge
+  # coordination reads, and the serial the parent hands each forked
+  # subprocess. A new run is a new object, which is what lets anything needing
+  # a clean slate begin one instead of unsetting state by hand.
+  class CurrentRun
+    attr_accessor :pid, :process_start_time, :result
+    attr_writer :collating_result
+
+    # The result, the coordination flags and the identity belong to the run that
+    # ends; the fork genealogy belongs to the process and carries over. A child
+    # that restarts tracking must not forget it was forked, or it would produce
+    # the final report itself, and a parent must not recount from zero, or its
+    # next children's names would collide with its first ones (#1171).
+    def successor
+      following = self.class.new
+      following.subprocess_serial = @subprocess_serial
+      following.mark_forked_subprocess! if forked_subprocess?
+      following
+    end
+
+    # Answers exactly false while no result was ever stored, which is how "never
+    # computed" stays distinct from "cleared to nil".
+    def result?
+      instance_variable_defined?(:@result) && (_ = @result)
+    end
+
+    def collating_result?
+      !!@collating_result
+    end
+
+    # Reading a mark that was never set answers nil, which is the answer wanted.
+    def forked_subprocess?
+      !!@forked_subprocess
+    end
+
+    def mark_forked_subprocess!
+      @forked_subprocess = true
+    end
+
+    # A monotonically increasing serial the parent assigns to each forked
+    # subprocess. The default `at_fork` builds the worker's command_name from
+    # this rather than the OS pid: the serial sequence is the same from one run
+    # to the next, so a re-run overwrites the previous run's resultset entries
+    # instead of writing uniquely-named ones that pile up (#1171).
+    def subprocess_serial
+      @subprocess_serial ||= 0
+    end
+
+    def next_subprocess_serial!
+      @subprocess_serial = subprocess_serial + 1
+    end
+
+    protected
+
+    attr_writer :subprocess_serial
+  end
+end