[llvm-branch-commits] [polly] r246029 - Only use instructions as insert locations for SCEVExpander

2015-08-26 Thread Tobias Grosser via llvm-branch-commits
Author: grosser
Date: Wed Aug 26 06:01:14 2015
New Revision: 246029

URL: http://llvm.org/viewvc/llvm-project?rev=246029&view=rev
Log:
Only use instructions as insert locations for SCEVExpander

SCEVExpander, which we are using during code generation, only allows
instructions as insert locations, but breaks in case BasicBlock->end() iterators
are passed to it due to it trying to obtain the basic block in which code should
be generated by calling Instruction->getParent(), which is not defined for
->end() iterators.

This change adds an assert to Polly that ensures we only pass valid instructions
to SCEVExpander and it fixes one case, where we used IRBuilder->SetInsertBlock()
to set an ->end() insert location which was later passed to SCEVExpander.

In general, Polly is always trying to build up the CFG first, before we actually
insert instructions into the CFG sceleton. As a result, each basic block should
already have at least one branch instruction before we start adding code. Hence,
always requiring the IRBuilder insert location to be set to a real instruction
should always be possible.

Thanks Utpal Bora  for his help with test case
reduction.

This is a backport from r243830 as it was committed on trunk.

Added:
polly/branches/release_37/test/Isl/CodeGen/non-affine-phi-node-expansion.ll
Modified:
polly/branches/release_37/lib/CodeGen/BlockGenerators.cpp

Modified: polly/branches/release_37/lib/CodeGen/BlockGenerators.cpp
URL: 
http://llvm.org/viewvc/llvm-project/polly/branches/release_37/lib/CodeGen/BlockGenerators.cpp?rev=246029&r1=246028&r2=246029&view=diff
==
--- polly/branches/release_37/lib/CodeGen/BlockGenerators.cpp (original)
+++ polly/branches/release_37/lib/CodeGen/BlockGenerators.cpp Wed Aug 26 
06:01:14 2015
@@ -123,6 +123,8 @@ Value *BlockGenerator::getNewValue(ScopS
   ->getParent()
   ->getDataLayout(),
   "polly");
+assert(Builder.GetInsertPoint() != Builder.GetInsertBlock()->end() &&
+   "Only instructions can be insert points for SCEVExpander");
 Value *Expanded = Expander.expandCodeFor(NewScev, Old->getType(),
  Builder.GetInsertPoint());
 
@@ -1116,7 +1118,7 @@ void RegionGenerator::copyStmt(ScopStmt
 ValueMapT &RegionMap = RegionMaps[BBCopy];
 RegionMap.insert(BlockMap.begin(), BlockMap.end());
 
-Builder.SetInsertPoint(BBCopy);
+Builder.SetInsertPoint(BICopy);
 copyInstScalar(Stmt, BI, RegionMap, GlobalMap, LTS);
 BICopy->eraseFromParent();
   }

Added: 
polly/branches/release_37/test/Isl/CodeGen/non-affine-phi-node-expansion.ll
URL: 
http://llvm.org/viewvc/llvm-project/polly/branches/release_37/test/Isl/CodeGen/non-affine-phi-node-expansion.ll?rev=246029&view=auto
==
--- polly/branches/release_37/test/Isl/CodeGen/non-affine-phi-node-expansion.ll 
(added)
+++ polly/branches/release_37/test/Isl/CodeGen/non-affine-phi-node-expansion.ll 
Wed Aug 26 06:01:14 2015
@@ -0,0 +1,54 @@
+; RUN: opt %loadPolly -polly-codegen -S < %s | FileCheck %s
+target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
+
+%struct.wombat = type {[4 x i32]}
+
+; CHECK: polly.stmt.bb3.entry: ; preds = 
%polly.start
+; CHECK:   br label %polly.stmt.bb3
+
+; CHECK: polly.stmt.bb3:   ; preds = 
%polly.stmt.bb3.entry
+; CHECK:   %polly.subregion.iv = phi i32 [ 0, %polly.stmt.bb3.entry ]
+; CHECK:   %polly.subregion.iv.inc = add i32 %polly.subregion.iv, 1
+; CHECK:   br i1 true, label %polly.stmt.bb4, label %polly.stmt.bb5
+
+; CHECK: polly.stmt.bb4:   ; preds = 
%polly.stmt.bb3
+; CHECK:   br label %polly.stmt.bb13.exit
+
+; CHECK: polly.stmt.bb5:   ; preds = 
%polly.stmt.bb3
+; CHECK:   %tmp7_p_scalar_ = load i32, i32* %B, !alias.scope !0, !noalias !2
+; CHECK:   store i32 %tmp7_p_scalar_, i32* %polly.access.cast.arg2, 
!alias.scope !3, !noalias !4
+; CHECK:   br label %polly.stmt.bb13.exit
+
+; Function Attrs: nounwind uwtable
+define void @quux(%struct.wombat* %arg, i32* %B) {
+bb:
+  br i1 undef, label %bb2, label %bb1
+
+bb1:  ; preds = %bb
+  br label %bb2
+
+bb2:  ; preds = %bb1, %bb
+  %tmp = phi i1 [ true, %bb ], [ undef, %bb1 ]
+  br label %bb3
+
+bb3:  ; preds = %bb13, %bb2
+  br i1 %tmp, label %bb4, label %bb5
+
+bb4:  ; preds = %bb3
+  br label %bb13
+
+bb5:  ; preds = %bb3
+  %tmp7 = load i32, i32* %B
+  %tmp12 = getelementptr inbounds %struct.wombat, %struct.wombat* %arg, i64 0, 
i32 0, i64 0
+  store i32 

[llvm-branch-commits] [cfe-branch] r246036 - Add note about SEH to clang 3.7 notes

2015-08-26 Thread Reid Kleckner via llvm-branch-commits
Author: rnk
Date: Wed Aug 26 10:41:07 2015
New Revision: 246036

URL: http://llvm.org/viewvc/llvm-project?rev=246036&view=rev
Log:
Add note about SEH to clang 3.7 notes

Modified:
cfe/branches/release_37/docs/ReleaseNotes.rst

Modified: cfe/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/cfe/branches/release_37/docs/ReleaseNotes.rst?rev=246036&r1=246035&r2=246036&view=diff
==
--- cfe/branches/release_37/docs/ReleaseNotes.rst (original)
+++ cfe/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 10:41:07 2015
@@ -42,6 +42,10 @@ Major New Features
   extension is also enabled when compiling CUDA code, but its use should be
   viewed as an implementation detail that is subject to change.
 
+- On Windows targets, some uses of the ``__try``, ``__except``, and
+  ``__finally`` language constructs are supported in Clang 3.7. MSVC-compatible
+  C++ exceptions are not yet supported, however.
+
 - Clang 3.7 fully supports OpenMP 3.1 and reported to work on many platforms,
   including x86, x86-64 and Power. Also, pragma ``omp simd`` from OpenMP 4.0 is
   supported as well. See below for details.


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [llvm-branch] r246053 - Polly subproject release notes

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 13:58:15 2015
New Revision: 246053

URL: http://llvm.org/viewvc/llvm-project?rev=246053&view=rev
Log:
Polly subproject release notes

By Tobias Grosser!

Modified:
llvm/branches/release_37/docs/ReleaseNotes.rst

Modified: llvm/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/llvm/branches/release_37/docs/ReleaseNotes.rst?rev=246053&r1=246052&r2=246053&view=diff
==
--- llvm/branches/release_37/docs/ReleaseNotes.rst (original)
+++ llvm/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 13:58:15 2015
@@ -246,6 +246,114 @@ Changes to the JIT APIs
   encouraged to try ORC out for their projects. (A good place to start is the
   new ORC tutorials under llvm/examples/kaleidoscope/orc).
 
+Sub-project Status Update
+=
+
+In addition to the core LLVM 3.7 distribution of production-quality compiler
+infrastructure, the LLVM project includes sub-projects that use the LLVM core
+and share the same distribution license. This section provides updates on these
+sub-projects.
+
+Polly - The Polyhedral Loop Optimizer in LLVM
+-
+
+`Polly `_ is a polyhedral loop optimization
+infrastructure that provides data-locality optimizations to LLVM-based
+compilers. When compiled as part of clang or loaded as a module into clang,
+it can perform loop optimizations such as tiling, loop fusion or outer-loop
+vectorization. As a generic loop optimization infrastructure it allows
+developers to get a per-loop-iteration model of a loop nest on which detailed
+analysis and transformations can be performed.
+
+Changes since the last release:
+
+* isl imported into Polly distribution
+
+`isl `_, the math library Polly uses, has been
+imported into the source code repository of Polly and is now distributed as 
part
+of Polly. As this was the last external library dependency of Polly, Polly can
+now be compiled right after checking out the Polly source code without the need
+for any additional libraries to be pre-installed.
+
+* Small integer optimization of isl
+
+The MIT licensed imath backend using in `isl `_ 
for
+arbitrary width integer computations has been optimized to use native integer
+operations for the common case where the operands of a computation fit into 32
+bit and to only fall back to large arbitrary precision integers for the
+remaining cases. This optimization has greatly improved the compile-time
+performance of Polly, both due to faster native operations also due to a
+reduction in malloc traffic and pointer indirections. As a result, computations
+that use arbitrary precision integers heavily have been speed up by almost 6x.
+As a result, the compile-time of Polly on the Polybench test kernels in the LNT
+suite has been reduced by 20% on average with compile time reductions between
+9-43%.
+
+* Schedule Trees
+
+Polly now uses internally so-called > Schedule Trees < to model the loop
+structure it optimizes. Schedule trees are an easy to understand tree structure
+that describes a loop nest using integer constraint sets to keep track of
+execution constraints. It allows the developer to use per-tree-node operations
+to modify the loop tree. Programatic analysis that work on the schedule tree
+(e.g., as dependence analysis) also show a visible speedup as they can exploit
+the tree structure of the schedule and need to fall back to ILP based
+optimization problems less often. Section 6 of `Polyhedral AST generation is
+more than scanning polyhedra
+`_ gives a detailed
+explanation of this schedule trees.
+
+* Scalar and PHI node modeling - Polly as an analysis
+
+Polly now requires almost no preprocessing to analyse LLVM-IR, which makes it
+easier to use Polly as a pure analysis pass e.g. to provide more precise
+dependence information to non-polyhedral transformation passes. Originally,
+Polly required the input LLVM-IR to be preprocessed such that all scalar and
+PHI-node dependences are translated to in-memory operations. Since this 
release,
+Polly has full support for scalar and PHI node dependences and requires no
+scalar-to-memory translation for such kind of dependences.
+
+* Modeling of modulo and non-affine conditions
+
+Polly can now supports modulo operations such as A[t%2][i][j] as they appear
+often in stencil computations and also allows data-dependent conditional
+branches as they result e.g. from ternary conditions ala A[i] > 255 ? 255 :
+A[i].
+
+* Delinearization
+
+Polly now support the analysis of manually linearized multi-dimensional arrays
+as they result form macros such as
+"#define 2DARRAY(A,i,j) (A.data[(i) * A.size + (j)]". Similar constructs appear
+in old C code written before C99, C++ code such as boost::ublas, LLVM exported
+from Julia, Matlab gen

[llvm-branch-commits] [llvm-branch] r246071 - Add a release note about raising the minimum Windows version for the next major release

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 15:19:38 2015
New Revision: 246071

URL: http://llvm.org/viewvc/llvm-project?rev=246071&view=rev
Log:
Add a release note about raising the minimum Windows version for the next major 
release

Patch by Greg Bedwell!

Differential Revision: http://reviews.llvm.org/D12367

Modified:
llvm/branches/release_37/docs/ReleaseNotes.rst

Modified: llvm/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/llvm/branches/release_37/docs/ReleaseNotes.rst?rev=246071&r1=246070&r2=246071&view=diff
==
--- llvm/branches/release_37/docs/ReleaseNotes.rst (original)
+++ llvm/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 15:19:38 2015
@@ -96,6 +96,10 @@ Non-comprehensive list of changes in thi
   target, but implementing full ``Function`` based ``TargetSubtargetInfo``
   support is recommended.
 
+* This is expected to be the last major release of LLVM that supports being
+  run on Windows XP and Windows Vista.  For the next major release the minimum
+  Windows version requirement will be Windows 7.
+
 Changes to the MIPS Target
 --
 


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [llvm-branch] r246072 - Release Notes expansion for BPF

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 15:28:56 2015
New Revision: 246072

URL: http://llvm.org/viewvc/llvm-project?rev=246072&view=rev
Log:
Release Notes expansion for BPF

By Brenden Blanco!

Modified:
llvm/branches/release_37/docs/ReleaseNotes.rst

Modified: llvm/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/llvm/branches/release_37/docs/ReleaseNotes.rst?rev=246072&r1=246071&r2=246072&view=diff
==
--- llvm/branches/release_37/docs/ReleaseNotes.rst (original)
+++ llvm/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 15:28:56 2015
@@ -72,6 +72,19 @@ Non-comprehensive list of changes in thi
   instruction set that can be dynamically loaded into the Linux kernel via the
   `bpf(2) `_ syscall.
 
+  Support for BPF has been present in the kernel for some time, but starting
+  from 3.18 has been extended with such features as: 64-bit registers, 8
+  additional registers registers, conditional backwards jumps, call
+  instruction, shift instructions, map (hash table, array, etc.), 1-8 byte
+  load/store from stack, and more.
+
+  Up until now, users of BPF had to write bytecode by hand, or use
+  custom generators. This release adds a proper LLVM backend target for the BPF
+  bytecode architecture.
+
+  The BPF target is now available by default, and options exist in both Clang
+  (-target bpf) or llc (-march=bpf) to pick eBPF as a backend.
+
 * Switch-case lowering was rewritten to avoid generating unbalanced search 
trees
   (`PR22262 `_) and to exploit profile information
   when available. Some lowering strategies are now disabled when optimizations


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [llvm-branch] r246013 - Add a small release note about the getSubtarget migration.

2015-08-26 Thread Eric Christopher via llvm-branch-commits
Author: echristo
Date: Wed Aug 26 00:12:26 2015
New Revision: 246013

URL: http://llvm.org/viewvc/llvm-project?rev=246013&view=rev
Log:
Add a small release note about the getSubtarget migration.

Modified:
llvm/branches/release_37/docs/ReleaseNotes.rst

Modified: llvm/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/llvm/branches/release_37/docs/ReleaseNotes.rst?rev=246013&r1=246012&r2=246013&view=diff
==
--- llvm/branches/release_37/docs/ReleaseNotes.rst (original)
+++ llvm/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 00:12:26 2015
@@ -90,6 +90,11 @@ Non-comprehensive list of changes in thi
   more you can avoid using ``PointerType::getPointeeType``, the easier the
   migration will be.
 
+* Argument-less ``TargetMachine::getSubtarget`` and
+  ``TargetMachine::getSubtargetImpl`` have been removed from the tree. Updating
+  out of tree ports is as simple as implementing a non-virtual version in the
+  target, but implementing full ``Function`` based ``TargetSubtargetInfo``
+  support is recommended.
 
 Changes to the MIPS Target
 --


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [cfe-branch] r246090 - Add a clang release note about raising the minimum Windows version for the next major release

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 17:01:10 2015
New Revision: 246090

URL: http://llvm.org/viewvc/llvm-project?rev=246090&view=rev
Log:
Add a clang release note about raising the minimum Windows version for the next 
major release

By Greg Bedwell!

Differential Revision: http://reviews.llvm.org/D12368

Modified:
cfe/branches/release_37/docs/ReleaseNotes.rst

Modified: cfe/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/cfe/branches/release_37/docs/ReleaseNotes.rst?rev=246090&r1=246089&r2=246090&view=diff
==
--- cfe/branches/release_37/docs/ReleaseNotes.rst (original)
+++ cfe/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 17:01:10 2015
@@ -247,6 +247,12 @@ Added new checks:
   boolean constants and simplifies them to use the appropriate boolean
   expression directly (``if (x == true) ... -> if (x)``, etc.)
 
+Last release which will run on Windows XP and Windows Vista
+---
+
+This is expected to the be the last major release of Clang that will support
+running on Windows XP and Windows Vista.  For the next major release the
+minimum Windows version requirement will be Windows 7.
 
 Additional Information
 ==


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [llvm-branch] r246108 - ReleaseNotes: fix some indentation

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:27:03 2015
New Revision: 246108

URL: http://llvm.org/viewvc/llvm-project?rev=246108&view=rev
Log:
ReleaseNotes: fix some indentation

Modified:
llvm/branches/release_37/docs/ReleaseNotes.rst

Modified: llvm/branches/release_37/docs/ReleaseNotes.rst
URL: 
http://llvm.org/viewvc/llvm-project/llvm/branches/release_37/docs/ReleaseNotes.rst?rev=246108&r1=246107&r2=246108&view=diff
==
--- llvm/branches/release_37/docs/ReleaseNotes.rst (original)
+++ llvm/branches/release_37/docs/ReleaseNotes.rst Wed Aug 26 18:27:03 2015
@@ -286,89 +286,89 @@ Changes since the last release:
 
 * isl imported into Polly distribution
 
-`isl `_, the math library Polly uses, has been
-imported into the source code repository of Polly and is now distributed as 
part
-of Polly. As this was the last external library dependency of Polly, Polly can
-now be compiled right after checking out the Polly source code without the need
-for any additional libraries to be pre-installed.
+  `isl `_, the math library Polly uses, has been
+  imported into the source code repository of Polly and is now distributed as 
part
+  of Polly. As this was the last external library dependency of Polly, Polly 
can
+  now be compiled right after checking out the Polly source code without the 
need
+  for any additional libraries to be pre-installed.
 
 * Small integer optimization of isl
 
-The MIT licensed imath backend using in `isl `_ 
for
-arbitrary width integer computations has been optimized to use native integer
-operations for the common case where the operands of a computation fit into 32
-bit and to only fall back to large arbitrary precision integers for the
-remaining cases. This optimization has greatly improved the compile-time
-performance of Polly, both due to faster native operations also due to a
-reduction in malloc traffic and pointer indirections. As a result, computations
-that use arbitrary precision integers heavily have been speed up by almost 6x.
-As a result, the compile-time of Polly on the Polybench test kernels in the LNT
-suite has been reduced by 20% on average with compile time reductions between
-9-43%.
+  The MIT licensed imath backend using in `isl `_ 
for
+  arbitrary width integer computations has been optimized to use native integer
+  operations for the common case where the operands of a computation fit into 
32
+  bit and to only fall back to large arbitrary precision integers for the
+  remaining cases. This optimization has greatly improved the compile-time
+  performance of Polly, both due to faster native operations also due to a
+  reduction in malloc traffic and pointer indirections. As a result, 
computations
+  that use arbitrary precision integers heavily have been speed up by almost 
6x.
+  As a result, the compile-time of Polly on the Polybench test kernels in the 
LNT
+  suite has been reduced by 20% on average with compile time reductions between
+  9-43%.
 
 * Schedule Trees
 
-Polly now uses internally so-called > Schedule Trees < to model the loop
-structure it optimizes. Schedule trees are an easy to understand tree structure
-that describes a loop nest using integer constraint sets to keep track of
-execution constraints. It allows the developer to use per-tree-node operations
-to modify the loop tree. Programatic analysis that work on the schedule tree
-(e.g., as dependence analysis) also show a visible speedup as they can exploit
-the tree structure of the schedule and need to fall back to ILP based
-optimization problems less often. Section 6 of `Polyhedral AST generation is
-more than scanning polyhedra
-`_ gives a detailed
-explanation of this schedule trees.
+  Polly now uses internally so-called > Schedule Trees < to model the loop
+  structure it optimizes. Schedule trees are an easy to understand tree 
structure
+  that describes a loop nest using integer constraint sets to keep track of
+  execution constraints. It allows the developer to use per-tree-node 
operations
+  to modify the loop tree. Programatic analysis that work on the schedule tree
+  (e.g., as dependence analysis) also show a visible speedup as they can 
exploit
+  the tree structure of the schedule and need to fall back to ILP based
+  optimization problems less often. Section 6 of `Polyhedral AST generation is
+  more than scanning polyhedra
+  `_ gives a detailed
+  explanation of this schedule trees.
 
 * Scalar and PHI node modeling - Polly as an analysis
 
-Polly now requires almost no preprocessing to analyse LLVM-IR, which makes it
-easier to use Polly as a pure analysis pass e.g. to provide more precise
-dependence information to non-polyhedral transformation passes. Originally,
-Polly

[llvm-branch-commits] [cfe-tag] r246110 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:34:43 2015
New Revision: 246110

URL: http://llvm.org/viewvc/llvm-project?rev=246110&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
cfe/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246109, cfe/branches/release_37/

Propchange: cfe/tags/RELEASE_370/rc4/
--
--- svn:ignore (added)
+++ svn:ignore Wed Aug 26 18:34:43 2015
@@ -0,0 +1,3 @@
+configure.out
+cscope.files
+cscope.out

Propchange: cfe/tags/RELEASE_370/rc4/
--
--- svn:mergeinfo (added)
+++ svn:mergeinfo Wed Aug 26 18:34:43 2015
@@ -0,0 +1,4 @@
+/cfe/branches/type-system-rewrite:134693-134817
+/cfe/trunk:242244,242285,242293,242297,242313,242382,242422,242499,242574,242600,242660,242662,242667,242678,242766,242854,242905,242973,243018,243048,243085,243098,243101,243105,243133,243144,243153,243196,243206,243277,243280,243285,243289,243343,243417,243463,243538,243594,243642-243644,243851,243945-243950,243964,244000,244193,244266,244468,244488,244502,244719,244794,244902,245041,245259,245560
+/cfe/trunk/test:170344
+/cfe/trunk/test/SemaTemplate:126920


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [compiler-rt-tag] r246112 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:34:50 2015
New Revision: 246112

URL: http://llvm.org/viewvc/llvm-project?rev=246112&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
compiler-rt/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246111, compiler-rt/branches/release_37/

Propchange: compiler-rt/tags/RELEASE_370/rc4/
--
--- svn:ignore (added)
+++ svn:ignore Wed Aug 26 18:34:50 2015
@@ -0,0 +1,3 @@
+Debug
+Profile
+Release

Propchange: compiler-rt/tags/RELEASE_370/rc4/
--
--- svn:mergeinfo (added)
+++ svn:mergeinfo Wed Aug 26 18:34:50 2015
@@ -0,0 +1 @@
+/compiler-rt/trunk:242350,242424,242444,242449,242539-242540,242647,242651,243170,243384,243604,243615,243686,244002,244101,244646


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [llvm-tag] r246109 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:34:40 2015
New Revision: 246109

URL: http://llvm.org/viewvc/llvm-project?rev=246109&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
llvm/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246108, llvm/branches/release_37/

Propchange: llvm/tags/RELEASE_370/rc4/
--
--- svn:ignore (added)
+++ svn:ignore Wed Aug 26 18:34:40 2015
@@ -0,0 +1,24 @@
+Debug
+Release
+Release-Asserts
+mklib
+Makefile.config
+config.log
+config.status
+cvs.out
+autom4te.cache
+configure.out
+LLVM-*
+_distcheckdir
+llvm.spec
+svn-commit.*
+*.patch
+*.patch.raw
+cscope.*
+Debug+Coverage-Asserts
+Release+Coverage-Asserts
+Debug+Coverage
+Release+Coverage
+Debug+Checks
+Debug+Asserts
+Release+Asserts

Propchange: llvm/tags/RELEASE_370/rc4/
--
--- svn:mergeinfo (added)
+++ svn:mergeinfo Wed Aug 26 18:34:40 2015
@@ -0,0 +1,3 @@
+/llvm/branches/Apple/Pertwee:110850,110961
+/llvm/branches/type-system-rewrite:133420-134817
+/llvm/trunk:155241,242236,242239,242281,242288,242296,242331,242341,242410,242412,242433-242434,242442,242543,242673,242680,242706,242721-242722,242733-242735,242742,242869,242919,242993,243001,243057,243116,243263,243294,243361,243469,243485,243500,243519,243531,243589,243609,243636,243638-243640,243745,243891,243898,243927,243932,243934,243984,243986,243999,244058,244123,244232,244332,244418,28,244554,244644,244659,244676,244789,244889,245064,245105,245119,245256,245355,245365,245369,245394-245395,245530,245535,245902


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [clang-tools-extra-tag] r246115 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:34:59 2015
New Revision: 246115

URL: http://llvm.org/viewvc/llvm-project?rev=246115&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
clang-tools-extra/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246114, clang-tools-extra/branches/release_37/

Propchange: clang-tools-extra/tags/RELEASE_370/rc4/
--
svn:mergeinfo = /clang-tools-extra/trunk:244001


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [polly] r246116 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:35:02 2015
New Revision: 246116

URL: http://llvm.org/viewvc/llvm-project?rev=246116&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
polly/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246115, polly/branches/release_37/

Propchange: polly/tags/RELEASE_370/rc4/
--
svn:mergeinfo = /polly/trunk:244009


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits


[llvm-branch-commits] [lldb] r246117 - Creating release candidate rc4 from release_370 branch

2015-08-26 Thread Hans Wennborg via llvm-branch-commits
Author: hans
Date: Wed Aug 26 18:35:05 2015
New Revision: 246117

URL: http://llvm.org/viewvc/llvm-project?rev=246117&view=rev
Log:
Creating release candidate rc4 from release_370 branch

Added:
lldb/tags/RELEASE_370/rc4/   (props changed)
  - copied from r246116, lldb/branches/release_37/

Propchange: lldb/tags/RELEASE_370/rc4/
--
--- svn:mergeinfo (added)
+++ svn:mergeinfo Wed Aug 26 18:35:05 2015
@@ -0,0 +1,3 @@
+/lldb/branches/apple/python-GIL:156467-162159
+/lldb/branches/iohandler:198360-200250
+/lldb/trunk:242306,242381,242525,242529,243091,243618,244006,244864-244866,245217,245927


___
llvm-branch-commits mailing list
llvm-branch-commits@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-branch-commits