Attachment 130208 Details for Bug 88766 – Proposed patch to support clang without too much hacking

[patch] Proposed patch to support clang without too much hacking

mesa-17-clang-support.patch (text/plain), 1.38 KB, created by Pablo Cholaky on 2017-03-14 06:44:46 UTC

(hide)

Description:

Filename:

MIME Type:

Creator: Pablo Cholaky

Created: 2017-03-14 06:44:46 UTC

Size: 1.38 KB

patch

obsolete

>diff --git a/src/gallium/drivers/nouveau/codegen/unordered_set.h b/src/gallium/drivers/nouveau/codegen/unordered_set.h
>index 65bbec6..d95aff7 100644
>--- a/src/gallium/drivers/nouveau/codegen/unordered_set.h
>+++ b/src/gallium/drivers/nouveau/codegen/unordered_set.h
>@@ -1,7 +1,7 @@
> #ifndef __NV50_UNORDERED_SET_H__
> #define __NV50_UNORDERED_SET_H__
> 
>-#if (__cplusplus >= 201103L) || defined(ANDROID)
>+#if (__cplusplus >= 201103L) || defined(__clang__) || defined(ANDROID)
> #include <unordered_set>
> #else
> #include <tr1/unordered_set>
>@@ -9,7 +9,7 @@
> 
> namespace nv50_ir {
> 
>-#if __cplusplus >= 201103L
>+#if __cplusplus >= 201103L || defined(__clang__)
> using std::unordered_set;
> #elif !defined(ANDROID)
> using std::tr1::unordered_set;
>
>diff --git a/src/gallium/drivers/nouveau/codegen/nv50_ir_ra.cpp b/src/gallium/drivers/nouveau/codegen/nv50_ir_ra.cpp
>index d36c853..8f24454 100644
>--- a/src/gallium/drivers/nouveau/codegen/nv50_ir_ra.cpp
>+++ b/src/gallium/drivers/nouveau/codegen/nv50_ir_ra.cpp
>@@ -26,7 +26,7 @@
> #include <algorithm>
> #include <stack>
> #include <limits>
>-#if __cplusplus >= 201103L
>+#if __cplusplus >= 201103L || defined(__clang__)
> #include <unordered_map>
> #else
> #include <tr1/unordered_map>
>@@ -34,7 +34,7 @@
> 
> namespace nv50_ir {
> 
>-#if __cplusplus >= 201103L
>+#if __cplusplus >= 201103L || defined(__clang__)
> using std::hash;
> using std::unordered_map;
> #elif !defined(ANDROID)

Actions: View | Splinter Review

Attachments on bug 88766: 112757 | 130208

Use of freedesktop.org services, including Bugzilla, is subject to our Code of Conduct. How we collect and use information is described in our Privacy Policy.