Merge tag 'v2.076.1' into merge-2.076.1

.codecov.yml

@@ -0,0 +1,21 @@
+# https://github.com/codecov/support/blob/master/codecov.yml
+codecov:
+  bot: dlang-bot
+
+coverage:
+  precision: 2
+  round: down
+  range: 70...100
+
+  status:
+    # Learn more at https://codecov.io/docs#yaml_default_commit_status
+    project: false
+    patch: false
+    changes: false
+
+  notify:
+    webhook:
+      default:
+        url: "https://dlang-bot.herokuapp.com/codecov_hook"
+
+comment: false

.gitignore

@@ -2,11 +2,12 @@ doc/*
 lib/*
 obj/*
 import/*
+generated/*
 druntime.json
 .DS_Store
 trace.def
 trace.log
-Makefile
-/errno_c.obj
+/Makefile
+/errno_c*.obj
+/msvc*.obj
 make
-test/*

HACKING.md → CONTRIBUTING.md

@@ -48,7 +48,6 @@ updated:
 * mak/COPY
 * mak/DOCS
 * mak/IMPORTS
-* mak/MANIFEST
 * mak/SRCS
 
 Operating system bindings

Jenkinsfile

@@ -0,0 +1,3 @@
+#!/bin/env groovy
+library 'dlang'
+runPipeline()

README.md

@@ -1,6 +1,11 @@
 DRuntime: Runtime Library for the D Programming Language
 ========================================================
 
+[![GitHub tag](https://img.shields.io/github/tag/dlang/druntime.svg?maxAge=86400)](#)
+[![Build status](https://img.shields.io/circleci/project/dlang/druntime.svg?maxAge=86400)](https://circleci.com/gh/dlang/druntime)
+[![Code coverage](https://img.shields.io/codecov/c/github/dlang/druntime.svg?maxAge=86400)](https://codecov.io/gh/dlang/druntime)
+[![Issue Stats](https://img.shields.io/issuestats/p/github/dlang/druntime.svg?maxAge=2592000)](http://www.issuestats.com/github/dlang/druntime)
+
 This is DRuntime. It is the low-level runtime library
 backing the D programming language.
 

benchmark/aabench/bigval.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 void main(string[] args)
 {

benchmark/aabench/bulk.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2011.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 import std.random, std.typetuple, std.conv;
 

benchmark/aabench/int.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 import std.random;
 

benchmark/aabench/l3cache.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 void main(string[] args)
 {

benchmark/aabench/obj.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 import std.random;
 

benchmark/aabench/ptr.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 import std.random;
 

benchmark/aabench/resize.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2011.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 
 import std.random;

benchmark/aabench/stomper.d

@@ -3,7 +3,7 @@
  *
  * Copyright: Copyright Martin Nowak 2015 - .
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
 import std.file, std.algorithm, std.random, std.math;
 

benchmark/aabench/string.d

@@ -3,8 +3,10 @@
  *
  * Copyright: Copyright Martin Nowak 2011 - 2015.
  * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
- * Authors:    Martin Nowak
+ * Authors:   Martin Nowak
  */
+module aabench.string;
+
 import std.algorithm, std.file;
 
 void runTest(R)(R words)

benchmark/arrayops/arrayops.d

@@ -0,0 +1,193 @@
+/**
+ * Benchmark for array ops.
+ *
+ * Copyright: Copyright Martin Nowak 2016 -.
+ * License:   $(LINK2 http://www.boost.org/LICENSE_1_0.txt, Boost License 1.0)
+ * Authors:   Martin Nowak
+ */
+import core.cpuid, std.algorithm, std.datetime, std.meta, std.stdio, std.string,
+    std.range;
+
+float[6] getLatencies(T, string op)()
+{
+    enum N = (64 * (1 << 6) + 64) * T.sizeof;
+    auto a = Array!T(N), b = Array!T(N), c = Array!T(N);
+    float[6] latencies = float.max;
+    foreach (i, ref latency; latencies)
+    {
+        auto len = 1 << i;
+        foreach (_; 1 .. 32)
+        {
+            a[] = 24;
+            b[] = 4;
+            c[] = 2;
+            __gshared T s = 2; // scalar, use __gshared to avoid const-folding
+            auto sw = StopWatch(AutoStart.yes);
+            foreach (off; size_t(0) .. size_t(64))
+            {
+                off = off * len + off;
+                enum op = op
+                    .replace("scalar", "s")
+                    .replace("a", "a[off .. off + len]")
+                    .replace("b", "b[off .. off + len]")
+                    .replace("c", "c[off .. off + len]");
+                mixin(op ~ ";");
+            }
+            latency = min(latency, sw.peek.nsecs);
+        }
+    }
+    float[6] res = latencies[] / 1024;
+    return res;
+}
+
+float[4] getThroughput(T, string op)()
+{
+    enum N = (40 * 1024 * 1024 + 64 * T.sizeof) / T.sizeof;
+    auto a = Array!T(N), b = Array!T(N), c = Array!T(N);
+    float[4] latencies = float.max;
+    size_t[4] lengths = [
+        8 * 1024 / T.sizeof, 32 * 1024 / T.sizeof, 512 * 1024 / T.sizeof, 32 * 1024 * 1024 / T
+        .sizeof
+    ];
+    foreach (i, ref latency; latencies)
+    {
+        auto len = lengths[i] / 64;
+        foreach (_; 1 .. 4)
+        {
+            a[] = 24;
+            b[] = 4;
+            c[] = 2;
+            __gshared T s = 2; // scalar, use __gshared to avoid const-folding
+            auto sw = StopWatch(AutoStart.yes);
+            foreach (off; size_t(0) .. size_t(64))
+            {
+                off = off * len + off;
+                enum op = op
+                    .replace("scalar", "s")
+                    .replace("a", "a[off .. off + len]")
+                    .replace("b", "b[off .. off + len]")
+                    .replace("c", "c[off .. off + len]");
+                mixin(op ~ ";");
+            }
+            immutable nsecs = sw.peek.nsecs;
+            runMasked({latency = min(latency, nsecs);});
+        }
+    }
+    float[4] throughputs = void;
+    runMasked({throughputs = T.sizeof * lengths[] / latencies[];});
+    return throughputs;
+}
+
+string[] genOps()
+{
+    string[] ops;
+    foreach (op1; ["+", "-", "*", "/"])
+    {
+        ops ~= "a " ~ op1 ~ "= b";
+        ops ~= "a " ~ op1 ~ "= scalar";
+        foreach (op2; ["+", "-", "*", "/"])
+        {
+            ops ~= "a " ~ op1 ~ "= b " ~ op2 ~ " c";
+            ops ~= "a " ~ op1 ~ "= b " ~ op2 ~ " scalar";
+        }
+    }
+    return ops;
+}
+
+void runOp(string op)()
+{
+    foreach (T; AliasSeq!(ubyte, ushort, uint, ulong, byte, short, int, long, float,
+            double))
+        writefln("%s, %s, %(%.2f, %), %(%s, %)", T.stringof, op,
+            getLatencies!(T, op), getThroughput!(T, op));
+}
+
+struct Array(T)
+{
+    import core.stdc.stdlib : free, malloc;
+
+    this(size_t n)
+    {
+        ary = (cast(T*) malloc(T.sizeof * n))[0 .. n];
+    }
+
+    ~this()
+    {
+        free(ary.ptr);
+    }
+
+    T[] ary;
+    alias ary this;
+}
+
+version (X86)
+    version = SSE;
+else version (X86_64)
+    version = SSE;
+else
+    static assert(0, "unimplemented");
+
+version (SSE)
+{
+    uint mxcsr()
+    {
+        uint ret = void;
+        asm
+        {
+            stmxcsr ret;
+        }
+        return ret;
+    }
+
+    void mxcsr(uint val)
+    {
+        asm
+        {
+            ldmxcsr val;
+        }
+    }
+
+    // http://softpixel.com/~cwright/programming/simd/sse.php
+    enum FPU_EXCEPTION_MASKS = 1 << 12 | 1 << 11 | 1 << 10 | 1 << 9 | 1 << 8 | 1 << 7;
+    enum FPU_EXCEPTION_FLAGS = 1 << 5 | 1 << 4 | 1 << 3 | 1 << 2 | 1 << 1 | 1 << 0;
+
+    void maskFPUExceptions()
+    {
+        mxcsr = mxcsr | FPU_EXCEPTION_MASKS;
+    }
+
+    void unmaskFPUExceptions()
+    {
+        mxcsr = mxcsr & ~FPU_EXCEPTION_MASKS;
+    }
+
+    uint FPUExceptionFlags()
+    {
+        return mxcsr & FPU_EXCEPTION_FLAGS;
+    }
+
+    void clearFPUExceptionFlags()
+    {
+        mxcsr = mxcsr & ~FPU_EXCEPTION_FLAGS;
+    }
+}
+
+void runMasked(scope void delegate() dg)
+{
+    assert(FPUExceptionFlags == 0);
+    maskFPUExceptions;
+    dg();
+    clearFPUExceptionFlags;
+    unmaskFPUExceptions;
+}
+
+void main()
+{
+    unmaskFPUExceptions;
+
+    writefln("type, op, %(latency%s, %), %-(throughput%s, %)", iota(6)
+        .map!(i => 1 << i), ["8KB", "32KB", "512KB", "32768KB"]);
+    foreach (op; mixin("AliasSeq!(%(%s, %))".format(genOps)))
+        runOp!op;
+    maskFPUExceptions;
+}

benchmark/arrayops/plot.R

@@ -0,0 +1,35 @@
+# Use `Rscript --vanilla plot.R old.csv new.csv` to run this script.
+# It will read old.csv and new.csv files and create a comparison plot for them.
+library(ggplot2)
+library(dplyr)
+library(tidyr)
+
+dat <- NULL
+args <- commandArgs(trailingOnly=T)
+old <- read.csv(args[1]) %>% tbl_df()
+new <- read.csv(args[2]) %>% tbl_df()
+
+col.indices <- which(!colnames(new) %in% c("type", "op"))
+
+# relative values
+new[,col.indices] <- 100 * new[,col.indices] / old[,col.indices]
+
+# arrange type factor levels
+new$type <- factor(new$type, levels = c('byte', 'ubyte', 'short', 'ushort', 'int', 'uint', 'long', 'ulong', 'float', 'double'))
+
+latencies <- gather(new %>% select(-starts_with('throughput')), num_elems, latency, starts_with('latency')) %>%
+    mutate(num_elems = factor(as.integer(sub("latency(\\d+)", "\\1", num_elems))))
+throughputs <- gather(new %>% select(-starts_with('latency')), array_size, throughput, starts_with('throughput')) %>%
+    mutate(array_size = factor(as.integer(sub("throughput(\\d+)KB", "\\1", array_size))))
+
+img <- ggplot(latencies, aes(x=num_elems, y=latency, fill=type)) +
+  geom_bar(position="dodge", stat="identity") +
+  facet_grid(op ~ ., scales="free_y") +
+  labs(x="num elements", y="relative latency / %")
+ggsave('array_ops_latency.png', plot = img, width = 8, height = 40)
+
+img <- ggplot(throughputs, aes(x=array_size, y=throughput, fill=type)) +
+  geom_bar(position="dodge", stat="identity") +
+  facet_grid(op ~ ., scales="free_y") +
+  labs(x="array size / KB", y="relative throughput / %")
+ggsave('array_ops_throughput.png', plot = img, width = 8, height = 40)

benchmark/gcbench/conalloc.d

@@ -11,8 +11,8 @@ import std.conv;
 import std.file;
 import std.digest.sha;
 
-auto N = 50;
-auto NT = 4;
+__gshared int N = 2500;
+__gshared int NT = 4;
 
 __gshared ubyte[] BYTES;
 shared(int) running; // Atomic

benchmark/gcbench/conappend.d

@@ -11,8 +11,8 @@ import std.conv;
 import std.file;
 import std.exception;
 
-auto N = 50;
-auto NT = 4;
+__gshared int N = 10000;
+__gshared int NT = 4;
 
 __gshared ubyte[] BYTES;
 shared(int) running; // Atomic