[www] r358406 - [EuroLLVM'19] Add more TechTalk slides.

[Arnaud A. de Grandmaison via llvm-commits]

Author: aadg
Date: Mon Apr 15 06:56:10 2019
New Revision: 358406

URL: http://llvm.org/viewvc/llvm-project?rev=358406&view=rev
Log:
[EuroLLVM'19] Add more TechTalk slides.

Added:
    www/trunk/devmtg/2019-04/slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf   (with props)
    www/trunk/devmtg/2019-04/slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf   (with props)
Modified:
    www/trunk/devmtg/2019-04/index.html
    www/trunk/devmtg/2019-04/talks.html

Modified: www/trunk/devmtg/2019-04/index.html
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/index.html?rev=358406&r1=358405&r2=358406&view=diff
==============================================================================
--- www/trunk/devmtg/2019-04/index.html (original)
+++ www/trunk/devmtg/2019-04/index.html Mon Apr 15 06:56:10 2019
@@ -161,7 +161,7 @@ There is a separate schedule for the <a
 </li>
 <li><a href="talks.html#Talk_3">
   The Future of AST Matcher-based Refactoring</a>
-  [ Video ] [ Slides ]
+  [ Video ] [ <a href="slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf">Slides</a> ]
   <i>Stephen Kelly</i>
 </li>
 <li><a href="talks.html#Talk_4">
@@ -176,7 +176,7 @@ There is a separate schedule for the <a
 </li>
 <li><a href="talks.html#Talk_6">
   Handling massive concurrency: Development of a programming model for GPU and CPU</a>
-  [ Video ] [ Slides ]
+  [ Video ] [ <a href="slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf">Slides</a> ]
   <i>Matthias Liedtke (SAP)</i>
 </li>
 <li><a href="talks.html#Talk_7">

Added: www/trunk/devmtg/2019-04/slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf?rev=358406&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www/trunk/devmtg/2019-04/slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Added: www/trunk/devmtg/2019-04/slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf?rev=358406&view=auto
==============================================================================
Binary file - no diff available.

Propchange: www/trunk/devmtg/2019-04/slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf
------------------------------------------------------------------------------
    svn:mime-type = application/octet-stream

Modified: www/trunk/devmtg/2019-04/talks.html
URL: http://llvm.org/viewvc/llvm-project/www/trunk/devmtg/2019-04/talks.html?rev=358406&r1=358405&r2=358406&view=diff
==============================================================================
--- www/trunk/devmtg/2019-04/talks.html (original)
+++ www/trunk/devmtg/2019-04/talks.html Mon Apr 15 06:56:10 2019
@@ -97,7 +97,7 @@ top of this infrastructure.</p>
 
 <tr><td valign="top" id="Talk_3">
 <b>The Future of AST Matcher-based Refactoring</b>
- [ Video ] [ Slides ]<br>
+ [ Video ] [ <a href="slides/TechTalk-Kelly-The_future_of_AST_matcherbased_refactoring.pdf">Slides</a> ]<br>
 <i>Stephen Kelly</i>
 <p>In the last few years, Clang has opened up new possibilities in C++ tooling
 for the masses. Tools such as clang-tidy and clazy offer ready-to-use
@@ -164,7 +164,7 @@ discussion on the LLVM mailing list and
 
 <tr><td valign="top" id="Talk_6">
 <b>Handling massive concurrency: Development of a programming model for GPU and CPU</b>
- [ Video ] [ Slides ]<br>
+ [ Video ] [ <a href="slides/TechTalk-Liedtke-Handling_massive_concurrency.pdf">Slides</a> ]<br>
 <i>Matthias Liedtke (SAP)</i>
 <p>For efficient parallel execution it is necessary to write massively
 concurrent algorithms and to optimize memory access.  In this session we show