source stringlengths 3 92 | c stringlengths 26 2.25M |
|---|---|
convolution_sgemm_pack8to1_int8.h | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2022 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy of the License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// Unless required by applicable law or agreed to in writing, software distributed
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
// specific language governing permissions and limitations under the License.
static void im2col_sgemm_pack8to1_int8_sse(const Mat& bottom_im2col, Mat& top_blob, const Mat& kernel, const Option& opt)
{
#if NCNN_AVX512VNNI && __AVX512F__ && !__AVX512VNNI__
if (ncnn::cpu_support_x86_avx512_vnni())
{
extern void im2col_sgemm_pack8to1_int8_sse_avx512vnni(const Mat& bottom_im2col, Mat& top_blob, const Mat& kernel, const Option& opt);
im2col_sgemm_pack8to1_int8_sse_avx512vnni(bottom_im2col, top_blob, kernel, opt);
return;
}
#endif
#if NCNN_AVXVNNI && __AVX2__ && !__AVXVNNI__
if (ncnn::cpu_support_x86_avx_vnni())
{
extern void im2col_sgemm_pack8to1_int8_sse_avxvnni(const Mat& bottom_im2col, Mat& top_blob, const Mat& kernel, const Option& opt);
im2col_sgemm_pack8to1_int8_sse_avxvnni(bottom_im2col, top_blob, kernel, opt);
return;
}
#endif
#if NCNN_AVX2 && __AVX__ && !__AVX2__
if (ncnn::cpu_support_x86_avx2())
{
extern void im2col_sgemm_pack8to1_int8_sse_avx2(const Mat& bottom_im2col, Mat& top_blob, const Mat& kernel, const Option& opt);
im2col_sgemm_pack8to1_int8_sse_avx2(bottom_im2col, top_blob, kernel, opt);
return;
}
#endif
#if NCNN_XOP && __SSE2__ && !__XOP__
if (ncnn::cpu_support_x86_xop())
{
extern void im2col_sgemm_pack8to1_int8_sse_xop(const Mat& bottom_im2col, Mat& top_blob, const Mat& kernel, const Option& opt);
im2col_sgemm_pack8to1_int8_sse_xop(bottom_im2col, top_blob, kernel, opt);
return;
}
#endif
// Mat bottom_im2col(size, maxk, inch, 8u, 8, opt.workspace_allocator);
const int size = bottom_im2col.w;
const int maxk = bottom_im2col.h;
const int inch = bottom_im2col.c;
const int outch = top_blob.c;
// permute
Mat tmp;
#if __AVX2__
if (size >= 4)
tmp.create(4 * maxk, inch, size / 4 + (size % 4) / 2 + size % 2, 8u, 8, opt.workspace_allocator);
else if (size >= 2)
tmp.create(2 * maxk, inch, size / 2 + size % 2, 8u, 8, opt.workspace_allocator);
else
tmp.create(maxk, inch, size, 8u, 8, opt.workspace_allocator);
#else
if (size >= 2)
tmp.create(2 * maxk, inch, size / 2 + size % 2, 8u, 8, opt.workspace_allocator);
else
tmp.create(maxk, inch, size, 8u, 8, opt.workspace_allocator);
#endif
{
#if __AVX2__
int remain_size_start = 0;
int nn_size = size >> 2;
#pragma omp parallel for num_threads(opt.num_threads)
for (int ii = 0; ii < nn_size; ii++)
{
int i = remain_size_start + ii * 4;
int64_t* tmpptr = tmp.channel(i / 4);
for (int q = 0; q < inch; q++)
{
const int64_t* img0 = (const int64_t*)bottom_im2col.channel(q) + i;
for (int k = 0; k < maxk; k++)
{
__m256i _v = _mm256_loadu_si256((const __m256i*)img0);
_mm256_storeu_si256((__m256i*)tmpptr, _v);
tmpptr += 4;
img0 += size;
}
}
}
remain_size_start += nn_size << 2;
nn_size = (size - remain_size_start) >> 1;
#else
int remain_size_start = 0;
int nn_size = (size - remain_size_start) >> 1;
#endif
#pragma omp parallel for num_threads(opt.num_threads)
for (int ii = 0; ii < nn_size; ii++)
{
int i = remain_size_start + ii * 2;
#if __AVX2__
int64_t* tmpptr = tmp.channel(i / 4 + (i % 4) / 2);
#else
int64_t* tmpptr = tmp.channel(i / 2);
#endif
for (int q = 0; q < inch; q++)
{
const int64_t* img0 = (const int64_t*)bottom_im2col.channel(q) + i;
for (int k = 0; k < maxk; k++)
{
__m128i _v = _mm_loadu_si128((const __m128i*)img0);
_mm_storeu_si128((__m128i*)tmpptr, _v);
tmpptr += 2;
img0 += size;
}
}
}
remain_size_start += nn_size << 1;
#pragma omp parallel for num_threads(opt.num_threads)
for (int i = remain_size_start; i < size; i++)
{
#if __AVX2__
int64_t* tmpptr = tmp.channel(i / 4 + (i % 4) / 2 + i % 2);
#else
int64_t* tmpptr = tmp.channel(i / 2 + i % 2);
#endif
for (int q = 0; q < inch; q++)
{
const int64_t* img0 = (const int64_t*)bottom_im2col.channel(q) + i;
for (int k = 0; k < maxk; k++)
{
tmpptr[0] = img0[0];
tmpptr += 1;
img0 += size;
}
}
}
}
int nn_outch = 0;
int remain_outch_start = 0;
nn_outch = outch >> 2;
#pragma omp parallel for num_threads(opt.num_threads)
for (int pp = 0; pp < nn_outch; pp++)
{
int p = pp * 4;
int* outptr0 = top_blob.channel(p);
int* outptr1 = top_blob.channel(p + 1);
int* outptr2 = top_blob.channel(p + 2);
int* outptr3 = top_blob.channel(p + 3);
int i = 0;
#if __AVX2__
for (; i + 3 < size; i += 4)
{
const signed char* tmpptr = tmp.channel(i / 4);
const signed char* kptr0 = kernel.channel(p / 4);
int nn = inch * maxk; // inch always > 0
__m256i _sum00_11 = _mm256_setzero_si256();
__m256i _sum10_01 = _mm256_setzero_si256();
__m256i _sum02_13 = _mm256_setzero_si256();
__m256i _sum12_03 = _mm256_setzero_si256();
__m256i _sum04_15 = _mm256_setzero_si256();
__m256i _sum14_05 = _mm256_setzero_si256();
__m256i _sum06_17 = _mm256_setzero_si256();
__m256i _sum16_07 = _mm256_setzero_si256();
int j = 0;
for (; j < nn; j++)
{
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m256i _val01_16 = _mm256_cvtepi8_epi16(_val01);
__m128i _w01 = _mm_loadu_si128((const __m128i*)kptr0);
__m128i _w23 = _mm_loadu_si128((const __m128i*)(kptr0 + 16));
__m256i _w01_16 = _mm256_cvtepi8_epi16(_w01);
__m256i _w23_16 = _mm256_cvtepi8_epi16(_w23);
__m256i _val10_16 = _mm256_permute4x64_epi64(_val01_16, 78);
#if __AVXVNNI__ || __AVX512VNNI__
_sum00_11 = _mm256_dpwssd_epi32(_sum00_11, _val01_16, _w01_16);
_sum10_01 = _mm256_dpwssd_epi32(_sum10_01, _val10_16, _w01_16);
_sum02_13 = _mm256_dpwssd_epi32(_sum02_13, _val01_16, _w23_16);
_sum12_03 = _mm256_dpwssd_epi32(_sum12_03, _val10_16, _w23_16);
#else
__m256i _sl00_11 = _mm256_mullo_epi16(_val01_16, _w01_16);
__m256i _sh00_11 = _mm256_mulhi_epi16(_val01_16, _w01_16);
__m256i _sl10_01 = _mm256_mullo_epi16(_val10_16, _w01_16);
__m256i _sh10_01 = _mm256_mulhi_epi16(_val10_16, _w01_16);
__m256i _sl02_13 = _mm256_mullo_epi16(_val01_16, _w23_16);
__m256i _sh02_13 = _mm256_mulhi_epi16(_val01_16, _w23_16);
__m256i _sl12_03 = _mm256_mullo_epi16(_val10_16, _w23_16);
__m256i _sh12_03 = _mm256_mulhi_epi16(_val10_16, _w23_16);
_sum00_11 = _mm256_add_epi32(_sum00_11, _mm256_unpacklo_epi16(_sl00_11, _sh00_11));
_sum10_01 = _mm256_add_epi32(_sum10_01, _mm256_unpacklo_epi16(_sl10_01, _sh10_01));
_sum02_13 = _mm256_add_epi32(_sum02_13, _mm256_unpacklo_epi16(_sl02_13, _sh02_13));
_sum12_03 = _mm256_add_epi32(_sum12_03, _mm256_unpacklo_epi16(_sl12_03, _sh12_03));
_sum00_11 = _mm256_add_epi32(_sum00_11, _mm256_unpackhi_epi16(_sl00_11, _sh00_11));
_sum10_01 = _mm256_add_epi32(_sum10_01, _mm256_unpackhi_epi16(_sl10_01, _sh10_01));
_sum02_13 = _mm256_add_epi32(_sum02_13, _mm256_unpackhi_epi16(_sl02_13, _sh02_13));
_sum12_03 = _mm256_add_epi32(_sum12_03, _mm256_unpackhi_epi16(_sl12_03, _sh12_03));
#endif
__m128i _val23 = _mm_loadu_si128((const __m128i*)(tmpptr + 16));
__m256i _val23_16 = _mm256_cvtepi8_epi16(_val23);
__m256i _val32_16 = _mm256_permute4x64_epi64(_val23_16, 78);
#if __AVXVNNI__ || __AVX512VNNI__
_sum04_15 = _mm256_dpwssd_epi32(_sum04_15, _val23_16, _w01_16);
_sum14_05 = _mm256_dpwssd_epi32(_sum14_05, _val32_16, _w01_16);
_sum06_17 = _mm256_dpwssd_epi32(_sum06_17, _val23_16, _w23_16);
_sum16_07 = _mm256_dpwssd_epi32(_sum16_07, _val32_16, _w23_16);
#else
__m256i _sl04_15 = _mm256_mullo_epi16(_val23_16, _w01_16);
__m256i _sh04_15 = _mm256_mulhi_epi16(_val23_16, _w01_16);
__m256i _sl14_05 = _mm256_mullo_epi16(_val32_16, _w01_16);
__m256i _sh14_05 = _mm256_mulhi_epi16(_val32_16, _w01_16);
__m256i _sl06_17 = _mm256_mullo_epi16(_val23_16, _w23_16);
__m256i _sh06_17 = _mm256_mulhi_epi16(_val23_16, _w23_16);
__m256i _sl16_07 = _mm256_mullo_epi16(_val32_16, _w23_16);
__m256i _sh16_07 = _mm256_mulhi_epi16(_val32_16, _w23_16);
_sum04_15 = _mm256_add_epi32(_sum04_15, _mm256_unpacklo_epi16(_sl04_15, _sh04_15));
_sum14_05 = _mm256_add_epi32(_sum14_05, _mm256_unpacklo_epi16(_sl14_05, _sh14_05));
_sum06_17 = _mm256_add_epi32(_sum06_17, _mm256_unpacklo_epi16(_sl06_17, _sh06_17));
_sum16_07 = _mm256_add_epi32(_sum16_07, _mm256_unpacklo_epi16(_sl16_07, _sh16_07));
_sum04_15 = _mm256_add_epi32(_sum04_15, _mm256_unpackhi_epi16(_sl04_15, _sh04_15));
_sum14_05 = _mm256_add_epi32(_sum14_05, _mm256_unpackhi_epi16(_sl14_05, _sh14_05));
_sum06_17 = _mm256_add_epi32(_sum06_17, _mm256_unpackhi_epi16(_sl06_17, _sh06_17));
_sum16_07 = _mm256_add_epi32(_sum16_07, _mm256_unpackhi_epi16(_sl16_07, _sh16_07));
#endif
tmpptr += 32;
kptr0 += 32;
}
// transpose 4x8
{
__m256i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm256_unpacklo_epi32(_sum00_11, _sum10_01);
_tmp1 = _mm256_unpacklo_epi32(_sum02_13, _sum12_03);
_tmp2 = _mm256_unpackhi_epi32(_sum00_11, _sum10_01);
_tmp3 = _mm256_unpackhi_epi32(_sum02_13, _sum12_03);
_sum00_11 = _mm256_unpacklo_epi64(_tmp0, _tmp1);
_sum10_01 = _mm256_unpackhi_epi64(_tmp0, _tmp1);
_sum02_13 = _mm256_unpacklo_epi64(_tmp2, _tmp3);
_sum12_03 = _mm256_unpackhi_epi64(_tmp2, _tmp3);
}
{
__m256i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm256_unpacklo_epi32(_sum04_15, _sum14_05);
_tmp1 = _mm256_unpacklo_epi32(_sum06_17, _sum16_07);
_tmp2 = _mm256_unpackhi_epi32(_sum04_15, _sum14_05);
_tmp3 = _mm256_unpackhi_epi32(_sum06_17, _sum16_07);
_sum04_15 = _mm256_unpacklo_epi64(_tmp0, _tmp1);
_sum14_05 = _mm256_unpackhi_epi64(_tmp0, _tmp1);
_sum06_17 = _mm256_unpacklo_epi64(_tmp2, _tmp3);
_sum16_07 = _mm256_unpackhi_epi64(_tmp2, _tmp3);
}
_sum00_11 = _mm256_add_epi32(_sum00_11, _sum10_01);
_sum02_13 = _mm256_add_epi32(_sum02_13, _sum12_03);
_sum00_11 = _mm256_add_epi32(_sum00_11, _sum02_13);
_sum04_15 = _mm256_add_epi32(_sum04_15, _sum14_05);
_sum06_17 = _mm256_add_epi32(_sum06_17, _sum16_07);
_sum04_15 = _mm256_add_epi32(_sum04_15, _sum06_17);
__m256i _perm_mask = _mm256_set_epi32(6, 3, 4, 1, 7, 2, 5, 0);
_sum00_11 = _mm256_permutevar8x32_epi32(_sum00_11, _perm_mask);
_sum04_15 = _mm256_permutevar8x32_epi32(_sum04_15, _perm_mask);
int sum[16];
_mm256_storeu_si256((__m256i*)sum, _sum00_11);
_mm256_storeu_si256((__m256i*)(sum + 8), _sum04_15);
outptr0[0] = sum[0];
outptr1[0] = sum[1];
outptr2[0] = sum[2];
outptr3[0] = sum[3];
outptr0[1] = sum[4];
outptr1[1] = sum[5];
outptr2[1] = sum[6];
outptr3[1] = sum[7];
outptr0[2] = sum[8];
outptr1[2] = sum[9];
outptr2[2] = sum[10];
outptr3[2] = sum[11];
outptr0[3] = sum[12];
outptr1[3] = sum[13];
outptr2[3] = sum[14];
outptr3[3] = sum[15];
outptr0 += 4;
outptr1 += 4;
outptr2 += 4;
outptr3 += 4;
}
#endif
for (; i + 1 < size; i += 2)
{
#if __AVX2__
const signed char* tmpptr = tmp.channel(i / 4 + (i % 4) / 2);
#else
const signed char* tmpptr = tmp.channel(i / 2);
#endif
const signed char* kptr0 = kernel.channel(p / 4);
int nn = inch * maxk; // inch always > 0
#if __AVX2__
__m256i _sum00_11 = _mm256_setzero_si256();
__m256i _sum10_01 = _mm256_setzero_si256();
__m256i _sum02_13 = _mm256_setzero_si256();
__m256i _sum12_03 = _mm256_setzero_si256();
#else
__m128i _sum00 = _mm_setzero_si128();
__m128i _sum01 = _mm_setzero_si128();
__m128i _sum02 = _mm_setzero_si128();
__m128i _sum03 = _mm_setzero_si128();
__m128i _sum10 = _mm_setzero_si128();
__m128i _sum11 = _mm_setzero_si128();
__m128i _sum12 = _mm_setzero_si128();
__m128i _sum13 = _mm_setzero_si128();
#endif
int j = 0;
for (; j < nn; j++)
{
#if __AVX2__
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m256i _val01_16 = _mm256_cvtepi8_epi16(_val01);
__m128i _w01 = _mm_loadu_si128((const __m128i*)kptr0);
__m128i _w23 = _mm_loadu_si128((const __m128i*)(kptr0 + 16));
__m256i _w01_16 = _mm256_cvtepi8_epi16(_w01);
__m256i _w23_16 = _mm256_cvtepi8_epi16(_w23);
__m256i _val10_16 = _mm256_permute4x64_epi64(_val01_16, 78);
#if __AVXVNNI__ || __AVX512VNNI__
_sum00_11 = _mm256_dpwssd_epi32(_sum00_11, _val01_16, _w01_16);
_sum10_01 = _mm256_dpwssd_epi32(_sum10_01, _val10_16, _w01_16);
_sum02_13 = _mm256_dpwssd_epi32(_sum02_13, _val01_16, _w23_16);
_sum12_03 = _mm256_dpwssd_epi32(_sum12_03, _val10_16, _w23_16);
#else
__m256i _sl00_11 = _mm256_mullo_epi16(_val01_16, _w01_16);
__m256i _sh00_11 = _mm256_mulhi_epi16(_val01_16, _w01_16);
__m256i _sl10_01 = _mm256_mullo_epi16(_val10_16, _w01_16);
__m256i _sh10_01 = _mm256_mulhi_epi16(_val10_16, _w01_16);
__m256i _sl02_13 = _mm256_mullo_epi16(_val01_16, _w23_16);
__m256i _sh02_13 = _mm256_mulhi_epi16(_val01_16, _w23_16);
__m256i _sl12_03 = _mm256_mullo_epi16(_val10_16, _w23_16);
__m256i _sh12_03 = _mm256_mulhi_epi16(_val10_16, _w23_16);
_sum00_11 = _mm256_add_epi32(_sum00_11, _mm256_unpacklo_epi16(_sl00_11, _sh00_11));
_sum10_01 = _mm256_add_epi32(_sum10_01, _mm256_unpacklo_epi16(_sl10_01, _sh10_01));
_sum02_13 = _mm256_add_epi32(_sum02_13, _mm256_unpacklo_epi16(_sl02_13, _sh02_13));
_sum12_03 = _mm256_add_epi32(_sum12_03, _mm256_unpacklo_epi16(_sl12_03, _sh12_03));
_sum00_11 = _mm256_add_epi32(_sum00_11, _mm256_unpackhi_epi16(_sl00_11, _sh00_11));
_sum10_01 = _mm256_add_epi32(_sum10_01, _mm256_unpackhi_epi16(_sl10_01, _sh10_01));
_sum02_13 = _mm256_add_epi32(_sum02_13, _mm256_unpackhi_epi16(_sl02_13, _sh02_13));
_sum12_03 = _mm256_add_epi32(_sum12_03, _mm256_unpackhi_epi16(_sl12_03, _sh12_03));
#endif
#else
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m128i _extval01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _val01);
__m128i _val0 = _mm_unpacklo_epi8(_val01, _extval01);
__m128i _val1 = _mm_unpackhi_epi8(_val01, _extval01);
__m128i _w01 = _mm_loadu_si128((const __m128i*)kptr0);
__m128i _w23 = _mm_loadu_si128((const __m128i*)(kptr0 + 16));
__m128i _extw01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w01);
__m128i _extw23 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w23);
__m128i _w0 = _mm_unpacklo_epi8(_w01, _extw01);
__m128i _w1 = _mm_unpackhi_epi8(_w01, _extw01);
__m128i _w2 = _mm_unpacklo_epi8(_w23, _extw23);
__m128i _w3 = _mm_unpackhi_epi8(_w23, _extw23);
#if __XOP__
_sum00 = _mm_maddd_epi16(_val0, _w0, _sum00);
_sum01 = _mm_maddd_epi16(_val0, _w1, _sum01);
_sum02 = _mm_maddd_epi16(_val0, _w2, _sum02);
_sum03 = _mm_maddd_epi16(_val0, _w3, _sum03);
_sum10 = _mm_maddd_epi16(_val1, _w0, _sum10);
_sum11 = _mm_maddd_epi16(_val1, _w1, _sum11);
_sum12 = _mm_maddd_epi16(_val1, _w2, _sum12);
_sum13 = _mm_maddd_epi16(_val1, _w3, _sum13);
#else
__m128i _sl00 = _mm_mullo_epi16(_val0, _w0);
__m128i _sh00 = _mm_mulhi_epi16(_val0, _w0);
__m128i _sl01 = _mm_mullo_epi16(_val0, _w1);
__m128i _sh01 = _mm_mulhi_epi16(_val0, _w1);
__m128i _sl02 = _mm_mullo_epi16(_val0, _w2);
__m128i _sh02 = _mm_mulhi_epi16(_val0, _w2);
__m128i _sl03 = _mm_mullo_epi16(_val0, _w3);
__m128i _sh03 = _mm_mulhi_epi16(_val0, _w3);
__m128i _sl10 = _mm_mullo_epi16(_val1, _w0);
__m128i _sh10 = _mm_mulhi_epi16(_val1, _w0);
__m128i _sl11 = _mm_mullo_epi16(_val1, _w1);
__m128i _sh11 = _mm_mulhi_epi16(_val1, _w1);
__m128i _sl12 = _mm_mullo_epi16(_val1, _w2);
__m128i _sh12 = _mm_mulhi_epi16(_val1, _w2);
__m128i _sl13 = _mm_mullo_epi16(_val1, _w3);
__m128i _sh13 = _mm_mulhi_epi16(_val1, _w3);
_sum00 = _mm_add_epi32(_sum00, _mm_unpacklo_epi16(_sl00, _sh00));
_sum01 = _mm_add_epi32(_sum01, _mm_unpacklo_epi16(_sl01, _sh01));
_sum02 = _mm_add_epi32(_sum02, _mm_unpacklo_epi16(_sl02, _sh02));
_sum03 = _mm_add_epi32(_sum03, _mm_unpacklo_epi16(_sl03, _sh03));
_sum00 = _mm_add_epi32(_sum00, _mm_unpackhi_epi16(_sl00, _sh00));
_sum01 = _mm_add_epi32(_sum01, _mm_unpackhi_epi16(_sl01, _sh01));
_sum02 = _mm_add_epi32(_sum02, _mm_unpackhi_epi16(_sl02, _sh02));
_sum03 = _mm_add_epi32(_sum03, _mm_unpackhi_epi16(_sl03, _sh03));
_sum10 = _mm_add_epi32(_sum10, _mm_unpacklo_epi16(_sl10, _sh10));
_sum11 = _mm_add_epi32(_sum11, _mm_unpacklo_epi16(_sl11, _sh11));
_sum12 = _mm_add_epi32(_sum12, _mm_unpacklo_epi16(_sl12, _sh12));
_sum13 = _mm_add_epi32(_sum13, _mm_unpacklo_epi16(_sl13, _sh13));
_sum10 = _mm_add_epi32(_sum10, _mm_unpackhi_epi16(_sl10, _sh10));
_sum11 = _mm_add_epi32(_sum11, _mm_unpackhi_epi16(_sl11, _sh11));
_sum12 = _mm_add_epi32(_sum12, _mm_unpackhi_epi16(_sl12, _sh12));
_sum13 = _mm_add_epi32(_sum13, _mm_unpackhi_epi16(_sl13, _sh13));
#endif
#endif
tmpptr += 16;
kptr0 += 32;
}
#if __AVX2__
// transpose 4x8
{
__m256i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm256_unpacklo_epi32(_sum00_11, _sum10_01);
_tmp1 = _mm256_unpacklo_epi32(_sum02_13, _sum12_03);
_tmp2 = _mm256_unpackhi_epi32(_sum00_11, _sum10_01);
_tmp3 = _mm256_unpackhi_epi32(_sum02_13, _sum12_03);
_sum00_11 = _mm256_unpacklo_epi64(_tmp0, _tmp1);
_sum10_01 = _mm256_unpackhi_epi64(_tmp0, _tmp1);
_sum02_13 = _mm256_unpacklo_epi64(_tmp2, _tmp3);
_sum12_03 = _mm256_unpackhi_epi64(_tmp2, _tmp3);
}
_sum00_11 = _mm256_add_epi32(_sum00_11, _sum10_01);
_sum02_13 = _mm256_add_epi32(_sum02_13, _sum12_03);
_sum00_11 = _mm256_add_epi32(_sum00_11, _sum02_13);
__m256i _perm_mask = _mm256_set_epi32(6, 3, 4, 1, 7, 2, 5, 0);
_sum00_11 = _mm256_permutevar8x32_epi32(_sum00_11, _perm_mask);
int sum[8];
_mm256_storeu_si256((__m256i*)sum, _sum00_11);
#else
// transpose 4x4
{
__m128i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm_unpacklo_epi32(_sum00, _sum01);
_tmp1 = _mm_unpacklo_epi32(_sum02, _sum03);
_tmp2 = _mm_unpackhi_epi32(_sum00, _sum01);
_tmp3 = _mm_unpackhi_epi32(_sum02, _sum03);
_sum00 = _mm_unpacklo_epi64(_tmp0, _tmp1);
_sum01 = _mm_unpackhi_epi64(_tmp0, _tmp1);
_sum02 = _mm_unpacklo_epi64(_tmp2, _tmp3);
_sum03 = _mm_unpackhi_epi64(_tmp2, _tmp3);
}
{
__m128i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm_unpacklo_epi32(_sum10, _sum11);
_tmp1 = _mm_unpacklo_epi32(_sum12, _sum13);
_tmp2 = _mm_unpackhi_epi32(_sum10, _sum11);
_tmp3 = _mm_unpackhi_epi32(_sum12, _sum13);
_sum10 = _mm_unpacklo_epi64(_tmp0, _tmp1);
_sum11 = _mm_unpackhi_epi64(_tmp0, _tmp1);
_sum12 = _mm_unpacklo_epi64(_tmp2, _tmp3);
_sum13 = _mm_unpackhi_epi64(_tmp2, _tmp3);
}
_sum00 = _mm_add_epi32(_sum00, _sum01);
_sum02 = _mm_add_epi32(_sum02, _sum03);
_sum10 = _mm_add_epi32(_sum10, _sum11);
_sum12 = _mm_add_epi32(_sum12, _sum13);
_sum00 = _mm_add_epi32(_sum00, _sum02);
_sum10 = _mm_add_epi32(_sum10, _sum12);
int sum[8];
_mm_storeu_si128((__m128i*)sum, _sum00);
_mm_storeu_si128((__m128i*)(sum + 4), _sum10);
#endif
outptr0[0] = sum[0];
outptr1[0] = sum[1];
outptr2[0] = sum[2];
outptr3[0] = sum[3];
outptr0[1] = sum[4];
outptr1[1] = sum[5];
outptr2[1] = sum[6];
outptr3[1] = sum[7];
outptr0 += 2;
outptr1 += 2;
outptr2 += 2;
outptr3 += 2;
}
for (; i < size; i++)
{
#if __AVX2__
const signed char* tmpptr = tmp.channel(i / 4 + (i % 4) / 2 + i % 2);
#else
const signed char* tmpptr = tmp.channel(i / 2 + i % 2);
#endif
const signed char* kptr0 = kernel.channel(p / 4);
int nn = inch * maxk; // inch always > 0
#if __AVX2__
__m256i _sum0_1 = _mm256_setzero_si256();
__m256i _sum2_3 = _mm256_setzero_si256();
#else
__m128i _sum0 = _mm_setzero_si128();
__m128i _sum1 = _mm_setzero_si128();
__m128i _sum2 = _mm_setzero_si128();
__m128i _sum3 = _mm_setzero_si128();
#endif
int j = 0;
for (; j < nn; j++)
{
#if __AVX2__
__m128i _val = _mm_loadl_epi64((const __m128i*)tmpptr);
_val = _mm_cvtepi8_epi16(_val);
__m128i _w01 = _mm_loadu_si128((const __m128i*)kptr0);
__m128i _w23 = _mm_loadu_si128((const __m128i*)(kptr0 + 16));
__m256i _w01_16 = _mm256_cvtepi8_epi16(_w01);
__m256i _w23_16 = _mm256_cvtepi8_epi16(_w23);
__m256i _valval = _mm256_inserti128_si256(_mm256_castsi128_si256(_val), _val, 1);
#if __AVXVNNI__ || __AVX512VNNI__
_sum0_1 = _mm256_dpwssd_epi32(_sum0_1, _valval, _w01_16);
_sum2_3 = _mm256_dpwssd_epi32(_sum2_3, _valval, _w23_16);
#else
__m256i _sl0_1 = _mm256_mullo_epi16(_valval, _w01_16);
__m256i _sh0_1 = _mm256_mulhi_epi16(_valval, _w01_16);
__m256i _sl2_3 = _mm256_mullo_epi16(_valval, _w23_16);
__m256i _sh2_3 = _mm256_mulhi_epi16(_valval, _w23_16);
_sum0_1 = _mm256_add_epi32(_sum0_1, _mm256_unpacklo_epi16(_sl0_1, _sh0_1));
_sum2_3 = _mm256_add_epi32(_sum2_3, _mm256_unpacklo_epi16(_sl2_3, _sh2_3));
_sum0_1 = _mm256_add_epi32(_sum0_1, _mm256_unpackhi_epi16(_sl0_1, _sh0_1));
_sum2_3 = _mm256_add_epi32(_sum2_3, _mm256_unpackhi_epi16(_sl2_3, _sh2_3));
#endif
#else
__m128i _val = _mm_loadl_epi64((const __m128i*)tmpptr);
#if __SSE4_1__
_val = _mm_cvtepi8_epi16(_val);
#else
_val = _mm_unpacklo_epi8(_val, _mm_cmpgt_epi8(_mm_setzero_si128(), _val));
#endif
__m128i _w01 = _mm_loadu_si128((const __m128i*)kptr0);
__m128i _w23 = _mm_loadu_si128((const __m128i*)(kptr0 + 16));
__m128i _extw01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w01);
__m128i _extw23 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w23);
__m128i _w0 = _mm_unpacklo_epi8(_w01, _extw01);
__m128i _w1 = _mm_unpackhi_epi8(_w01, _extw01);
__m128i _w2 = _mm_unpacklo_epi8(_w23, _extw23);
__m128i _w3 = _mm_unpackhi_epi8(_w23, _extw23);
#if __XOP__
_sum0 = _mm_maddd_epi16(_val, _w0, _sum0);
_sum1 = _mm_maddd_epi16(_val, _w1, _sum1);
_sum2 = _mm_maddd_epi16(_val, _w2, _sum2);
_sum3 = _mm_maddd_epi16(_val, _w3, _sum3);
#else
__m128i _sl0 = _mm_mullo_epi16(_val, _w0);
__m128i _sh0 = _mm_mulhi_epi16(_val, _w0);
__m128i _sl1 = _mm_mullo_epi16(_val, _w1);
__m128i _sh1 = _mm_mulhi_epi16(_val, _w1);
__m128i _sl2 = _mm_mullo_epi16(_val, _w2);
__m128i _sh2 = _mm_mulhi_epi16(_val, _w2);
__m128i _sl3 = _mm_mullo_epi16(_val, _w3);
__m128i _sh3 = _mm_mulhi_epi16(_val, _w3);
_sum0 = _mm_add_epi32(_sum0, _mm_unpacklo_epi16(_sl0, _sh0));
_sum1 = _mm_add_epi32(_sum1, _mm_unpacklo_epi16(_sl1, _sh1));
_sum2 = _mm_add_epi32(_sum2, _mm_unpacklo_epi16(_sl2, _sh2));
_sum3 = _mm_add_epi32(_sum3, _mm_unpacklo_epi16(_sl3, _sh3));
_sum0 = _mm_add_epi32(_sum0, _mm_unpackhi_epi16(_sl0, _sh0));
_sum1 = _mm_add_epi32(_sum1, _mm_unpackhi_epi16(_sl1, _sh1));
_sum2 = _mm_add_epi32(_sum2, _mm_unpackhi_epi16(_sl2, _sh2));
_sum3 = _mm_add_epi32(_sum3, _mm_unpackhi_epi16(_sl3, _sh3));
#endif
#endif
tmpptr += 8;
kptr0 += 32;
}
#if __AVX2__
__m128i _sum0 = _mm256_extracti128_si256(_sum0_1, 0);
__m128i _sum1 = _mm256_extracti128_si256(_sum0_1, 1);
__m128i _sum2 = _mm256_extracti128_si256(_sum2_3, 0);
__m128i _sum3 = _mm256_extracti128_si256(_sum2_3, 1);
#endif
// transpose 4x4
{
__m128i _tmp0, _tmp1, _tmp2, _tmp3;
_tmp0 = _mm_unpacklo_epi32(_sum0, _sum1);
_tmp1 = _mm_unpacklo_epi32(_sum2, _sum3);
_tmp2 = _mm_unpackhi_epi32(_sum0, _sum1);
_tmp3 = _mm_unpackhi_epi32(_sum2, _sum3);
_sum0 = _mm_unpacklo_epi64(_tmp0, _tmp1);
_sum1 = _mm_unpackhi_epi64(_tmp0, _tmp1);
_sum2 = _mm_unpacklo_epi64(_tmp2, _tmp3);
_sum3 = _mm_unpackhi_epi64(_tmp2, _tmp3);
}
_sum0 = _mm_add_epi32(_sum0, _sum1);
_sum2 = _mm_add_epi32(_sum2, _sum3);
_sum0 = _mm_add_epi32(_sum0, _sum2);
int sum[4];
_mm_storeu_si128((__m128i*)sum, _sum0);
outptr0[0] = sum[0];
outptr1[0] = sum[1];
outptr2[0] = sum[2];
outptr3[0] = sum[3];
outptr0 += 1;
outptr1 += 1;
outptr2 += 1;
outptr3 += 1;
}
}
remain_outch_start += nn_outch << 2;
#pragma omp parallel for num_threads(opt.num_threads)
for (int p = remain_outch_start; p < outch; p++)
{
int* outptr0 = top_blob.channel(p);
int i = 0;
#if __AVX2__
for (; i + 3 < size; i += 4)
{
const signed char* tmpptr = tmp.channel(i / 4);
const signed char* kptr0 = kernel.channel(p / 4 + p % 4);
int nn = inch * maxk; // inch always > 0
__m256i _sum0_2 = _mm256_setzero_si256();
__m256i _sum1_3 = _mm256_setzero_si256();
__m256i _sum4_6 = _mm256_setzero_si256();
__m256i _sum5_7 = _mm256_setzero_si256();
int j = 0;
for (; j < nn; j++)
{
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m128i _val23 = _mm_loadu_si128((const __m128i*)(tmpptr + 16));
__m256i _val01_16 = _mm256_cvtepi8_epi16(_val01);
__m256i _val23_16 = _mm256_cvtepi8_epi16(_val23);
__m128i _w01 = _mm_loadl_epi64((const __m128i*)kptr0);
__m256i _w01_16 = _mm256_cvtepi8_epi16(_w01);
_w01_16 = _mm256_permute4x64_epi64(_w01_16, _MM_SHUFFLE(1, 0, 1, 0));
__m256i _sl00_10 = _mm256_mullo_epi16(_val01_16, _w01_16);
__m256i _sh00_10 = _mm256_mulhi_epi16(_val01_16, _w01_16);
__m256i _sl20_30 = _mm256_mullo_epi16(_val23_16, _w01_16);
__m256i _sh20_30 = _mm256_mulhi_epi16(_val23_16, _w01_16);
_sum0_2 = _mm256_add_epi32(_sum0_2, _mm256_unpacklo_epi16(_sl00_10, _sh00_10));
_sum1_3 = _mm256_add_epi32(_sum1_3, _mm256_unpackhi_epi16(_sl00_10, _sh00_10));
_sum4_6 = _mm256_add_epi32(_sum4_6, _mm256_unpacklo_epi16(_sl20_30, _sh20_30));
_sum5_7 = _mm256_add_epi32(_sum5_7, _mm256_unpackhi_epi16(_sl20_30, _sh20_30));
tmpptr += 32;
kptr0 += 8;
}
_sum0_2 = _mm256_add_epi32(_sum0_2, _sum1_3);
_sum4_6 = _mm256_add_epi32(_sum4_6, _sum5_7);
__m128i _sum0 = _mm256_extracti128_si256(_sum0_2, 0);
__m128i _sum2 = _mm256_extracti128_si256(_sum0_2, 1);
__m128i _sum4 = _mm256_extracti128_si256(_sum4_6, 0);
__m128i _sum6 = _mm256_extracti128_si256(_sum4_6, 1);
outptr0[0] = _mm_reduce_add_epi32(_sum0);
outptr0[1] = _mm_reduce_add_epi32(_sum2);
outptr0[2] = _mm_reduce_add_epi32(_sum4);
outptr0[3] = _mm_reduce_add_epi32(_sum6);
outptr0 += 4;
}
#endif
for (; i + 1 < size; i += 2)
{
#if __AVX2__
const signed char* tmpptr = tmp.channel(i / 4 + (i % 4) / 2);
#else
const signed char* tmpptr = tmp.channel(i / 2);
#endif
const signed char* kptr0 = kernel.channel(p / 4 + p % 4);
int nn = inch * maxk; // inch always > 0
#if __AVX2__
__m256i _sum0_2 = _mm256_setzero_si256();
__m256i _sum1_3 = _mm256_setzero_si256();
#else
__m128i _sum0 = _mm_setzero_si128();
__m128i _sum1 = _mm_setzero_si128();
__m128i _sum2 = _mm_setzero_si128();
__m128i _sum3 = _mm_setzero_si128();
#endif
int j = 0;
for (; j < nn; j++)
{
#if __AVX2__
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m256i _val01_16 = _mm256_cvtepi8_epi16(_val01);
__m128i _w01 = _mm_loadl_epi64((const __m128i*)kptr0);
__m256i _w01_16 = _mm256_cvtepi8_epi16(_w01);
_w01_16 = _mm256_permute4x64_epi64(_w01_16, _MM_SHUFFLE(1, 0, 1, 0));
__m256i _sl00_10 = _mm256_mullo_epi16(_val01_16, _w01_16);
__m256i _sh00_10 = _mm256_mulhi_epi16(_val01_16, _w01_16);
_sum0_2 = _mm256_add_epi32(_sum0_2, _mm256_unpacklo_epi16(_sl00_10, _sh00_10));
_sum1_3 = _mm256_add_epi32(_sum1_3, _mm256_unpackhi_epi16(_sl00_10, _sh00_10));
#else
__m128i _val01 = _mm_loadu_si128((const __m128i*)tmpptr);
__m128i _extval01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _val01);
__m128i _val0 = _mm_unpacklo_epi8(_val01, _extval01);
__m128i _val1 = _mm_unpackhi_epi8(_val01, _extval01);
__m128i _w01 = _mm_loadl_epi64((const __m128i*)kptr0);
#if __SSE4_1__
__m128i _w0 = _mm_cvtepi8_epi16(_w01);
#else
__m128i _extw01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w01);
__m128i _w0 = _mm_unpacklo_epi8(_w01, _extw01);
#endif
__m128i _sl00 = _mm_mullo_epi16(_val0, _w0);
__m128i _sh00 = _mm_mulhi_epi16(_val0, _w0);
__m128i _sl10 = _mm_mullo_epi16(_val1, _w0);
__m128i _sh10 = _mm_mulhi_epi16(_val1, _w0);
_sum0 = _mm_add_epi32(_sum0, _mm_unpacklo_epi16(_sl00, _sh00));
_sum1 = _mm_add_epi32(_sum1, _mm_unpackhi_epi16(_sl00, _sh00));
_sum2 = _mm_add_epi32(_sum2, _mm_unpacklo_epi16(_sl10, _sh10));
_sum3 = _mm_add_epi32(_sum3, _mm_unpackhi_epi16(_sl10, _sh10));
#endif
tmpptr += 16;
kptr0 += 8;
}
#if __AVX2__
_sum0_2 = _mm256_add_epi32(_sum0_2, _sum1_3);
__m128i _sum0 = _mm256_extracti128_si256(_sum0_2, 0);
__m128i _sum2 = _mm256_extracti128_si256(_sum0_2, 1);
#else
_sum0 = _mm_add_epi32(_sum0, _sum1);
_sum2 = _mm_add_epi32(_sum2, _sum3);
#endif
outptr0[0] = _mm_reduce_add_epi32(_sum0);
outptr0[1] = _mm_reduce_add_epi32(_sum2);
outptr0 += 2;
}
for (; i < size; i++)
{
#if __AVX2__
const signed char* tmpptr = tmp.channel(i / 4 + (i % 4) / 2 + i % 2);
#else
const signed char* tmpptr = tmp.channel(i / 2 + i % 2);
#endif
const signed char* kptr0 = kernel.channel(p / 4 + p % 4);
int nn = inch * maxk; // inch always > 0
__m128i _sum0 = _mm_setzero_si128();
__m128i _sum1 = _mm_setzero_si128();
int j = 0;
for (; j < nn; j++)
{
__m128i _val01 = _mm_loadl_epi64((const __m128i*)tmpptr);
#if __SSE4_1__
__m128i _val0 = _mm_cvtepi8_epi16(_val01);
#else
__m128i _extval01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _val01);
__m128i _val0 = _mm_unpacklo_epi8(_val01, _extval01);
#endif
__m128i _w01 = _mm_loadl_epi64((const __m128i*)kptr0);
#if __SSE4_1__
__m128i _w0 = _mm_cvtepi8_epi16(_w01);
#else
__m128i _extw01 = _mm_cmpgt_epi8(_mm_setzero_si128(), _w01);
__m128i _w0 = _mm_unpacklo_epi8(_w01, _extw01);
#endif
__m128i _sl00 = _mm_mullo_epi16(_val0, _w0);
__m128i _sh00 = _mm_mulhi_epi16(_val0, _w0);
_sum0 = _mm_add_epi32(_sum0, _mm_unpacklo_epi16(_sl00, _sh00));
_sum1 = _mm_add_epi32(_sum1, _mm_unpackhi_epi16(_sl00, _sh00));
tmpptr += 8;
kptr0 += 8;
}
_sum0 = _mm_add_epi32(_sum0, _sum1);
outptr0[0] = _mm_reduce_add_epi32(_sum0);
outptr0 += 1;
}
}
}
static void convolution_im2col_sgemm_transform_kernel_pack8to1_int8_sse(const Mat& _kernel, Mat& kernel_tm, int inch, int outch, int kernel_w, int kernel_h)
{
const int maxk = kernel_w * kernel_h;
// interleave
// src = maxk-inch-outch
// dst = 8a-4b-maxk-inch/8a-outch/4b
Mat kernel = _kernel.reshape(maxk, inch, outch);
if (outch >= 4)
kernel_tm.create(32 * maxk, inch / 8, outch / 4 + outch % 4, (size_t)1u);
else
kernel_tm.create(8 * maxk, inch / 8, outch, (size_t)1u);
int q = 0;
for (; q + 3 < outch; q += 4)
{
signed char* g00 = kernel_tm.channel(q / 4);
for (int p = 0; p + 7 < inch; p += 8)
{
for (int k = 0; k < maxk; k++)
{
for (int i = 0; i < 4; i++)
{
for (int j = 0; j < 8; j++)
{
const signed char* k00 = kernel.channel(q + i).row<const signed char>(p + j);
g00[0] = k00[k];
g00++;
}
}
}
}
}
// TODO unroll 2
for (; q < outch; q++)
{
signed char* g00 = kernel_tm.channel(q / 4 + q % 4);
for (int p = 0; p + 7 < inch; p += 8)
{
for (int k = 0; k < maxk; k++)
{
for (int j = 0; j < 8; j++)
{
const signed char* k00 = kernel.channel(q).row<const signed char>(p + j);
g00[0] = k00[k];
g00++;
}
}
}
}
}
static void convolution_im2col_sgemm_pack8to1_int8_sse(const Mat& bottom_blob, Mat& top_blob, const Mat& kernel, int kernel_w, int kernel_h, int dilation_w, int dilation_h, int stride_w, int stride_h, const Option& opt)
{
int w = bottom_blob.w;
int inch = bottom_blob.c;
int outw = top_blob.w;
int outh = top_blob.h;
const int size = outw * outh;
const int maxk = kernel_w * kernel_h;
// im2col
Mat bottom_im2col(size, maxk, inch, 8u, 8, opt.workspace_allocator);
{
const int gap = w * stride_h - outw * stride_w;
#pragma omp parallel for num_threads(opt.num_threads)
for (int p = 0; p < inch; p++)
{
const Mat img = bottom_blob.channel(p);
int64_t* ptr = bottom_im2col.channel(p);
for (int u = 0; u < kernel_h; u++)
{
for (int v = 0; v < kernel_w; v++)
{
const int64_t* sptr = img.row<const int64_t>(dilation_h * u) + dilation_w * v;
for (int i = 0; i < outh; i++)
{
int j = 0;
for (; j < outw; j++)
{
ptr[0] = sptr[0];
sptr += stride_w;
ptr += 1;
}
sptr += gap;
}
}
}
}
}
im2col_sgemm_pack8to1_int8_sse(bottom_im2col, top_blob, kernel, opt);
}
|
ljForce.c | /// \file
/// Computes forces for the 12-6 Lennard Jones (LJ) potential.
///
/// The Lennard-Jones model is not a good representation for the
/// bonding in copper, its use has been limited to constant volume
/// simulations where the embedding energy contribution to the cohesive
/// energy is not included in the two-body potential
///
/// The parameters here are taken from Wolf and Phillpot and fit to the
/// room temperature lattice constant and the bulk melt temperature
/// Ref: D. Wolf and S.Yip eds. Materials Interfaces (Chapman & Hall
/// 1992) Page 230.
///
/// Notes on LJ:
///
/// http://en.wikipedia.org/wiki/Lennard_Jones_potential
///
/// The total inter-atomic potential energy in the LJ model is:
///
/// \f[
/// E_{tot} = \sum_{ij} U_{LJ}(r_{ij})
/// \f]
/// \f[
/// U_{LJ}(r_{ij}) = 4 \epsilon
/// \left\{ \left(\frac{\sigma}{r_{ij}}\right)^{12}
/// - \left(\frac{\sigma}{r_{ij}}\right)^6 \right\}
/// \f]
///
/// where \f$\epsilon\f$ and \f$\sigma\f$ are the material parameters in the potential.
/// - \f$\epsilon\f$ = well depth
/// - \f$\sigma\f$ = hard sphere diameter
///
/// To limit the interation range, the LJ potential is typically
/// truncated to zero at some cutoff distance. A common choice for the
/// cutoff distance is 2.5 * \f$\sigma\f$.
/// This implementation can optionally shift the potential slightly
/// upward so the value of the potential is zero at the cuotff
/// distance. This shift has no effect on the particle dynamics.
///
///
/// The force on atom i is given by
///
/// \f[
/// F_i = -\nabla_i \sum_{jk} U_{LJ}(r_{jk})
/// \f]
///
/// where the subsrcipt i on the gradient operator indicates that the
/// derivatives are taken with respect to the coordinates of atom i.
/// Liberal use of the chain rule leads to the expression
///
/// \f{eqnarray*}{
/// F_i &=& - \sum_j U'_{LJ}(r_{ij})\hat{r}_{ij}\\
/// &=& \sum_j 24 \frac{\epsilon}{r_{ij}} \left\{ 2 \left(\frac{\sigma}{r_{ij}}\right)^{12}
/// - \left(\frac{\sigma}{r_{ij}}\right)^6 \right\} \hat{r}_{ij}
/// \f}
///
/// where \f$\hat{r}_{ij}\f$ is a unit vector in the direction from atom
/// i to atom j.
///
///
#include "ljForce.h"
#include <stdlib.h>
#include <assert.h>
#include <string.h>
#include <omp.h>
#include "constants.h"
#include "mytype.h"
#include "parallel.h"
#include "linkCells.h"
#include "memUtils.h"
#include "CoMDTypes.h"
#define POT_SHIFT 1.0
/// Derived struct for a Lennard Jones potential.
/// Polymorphic with BasePotential.
/// \see BasePotential
typedef struct LjPotentialSt
{
real_t cutoff; //!< potential cutoff distance in Angstroms
real_t mass; //!< mass of atoms in intenal units
real_t lat; //!< lattice spacing (angs) of unit cell
char latticeType[8]; //!< lattice type, e.g. FCC, BCC, etc.
char name[3]; //!< element name
int atomicNo; //!< atomic number
int (*force)(SimFlat* s); //!< function pointer to force routine
void (*print)(FILE* file, BasePotential* pot);
void (*destroy)(BasePotential** pot); //!< destruction of the potential
real_t sigma;
real_t epsilon;
} LjPotential;
static int ljForce(SimFlat* s);
static void ljPrint(FILE* file, BasePotential* pot);
void ljDestroy(BasePotential** inppot)
{
if ( ! inppot ) return;
LjPotential* pot = (LjPotential*)(*inppot);
if ( ! pot ) return;
comdFree(pot);
*inppot = NULL;
return;
}
/// Initialize an Lennard Jones potential for Copper.
BasePotential* initLjPot(void)
{
LjPotential *pot = (LjPotential*)comdMalloc(sizeof(LjPotential));
pot->force = ljForce;
pot->print = ljPrint;
pot->destroy = ljDestroy;
pot->sigma = 2.315; // Angstrom
pot->epsilon = 0.167; // eV
pot->mass = 63.55 * amuToInternalMass; // Atomic Mass Units (amu)
pot->lat = 3.615; // Equilibrium lattice const in Angs
strcpy(pot->latticeType, "FCC"); // lattice type, i.e. FCC, BCC, etc.
pot->cutoff = 2.5*pot->sigma; // Potential cutoff in Angs
strcpy(pot->name, "Cu");
pot->atomicNo = 29;
return (BasePotential*) pot;
}
void ljPrint(FILE* file, BasePotential* pot)
{
LjPotential* ljPot = (LjPotential*) pot;
fprintf(file, " Potential type : Lennard-Jones\n");
fprintf(file, " Species name : %s\n", ljPot->name);
fprintf(file, " Atomic number : %d\n", ljPot->atomicNo);
fprintf(file, " Mass : "FMT1" amu\n", ljPot->mass / amuToInternalMass); // print in amu
fprintf(file, " Lattice Type : %s\n", ljPot->latticeType);
fprintf(file, " Lattice spacing : "FMT1" Angstroms\n", ljPot->lat);
fprintf(file, " Cutoff : "FMT1" Angstroms\n", ljPot->cutoff);
fprintf(file, " Epsilon : "FMT1" eV\n", ljPot->epsilon);
fprintf(file, " Sigma : "FMT1" Angstroms\n", ljPot->sigma);
}
int ljForce(SimFlat* s)
{
LjPotential* pot = (LjPotential *) s->pot;
real_t sigma = pot->sigma;
real_t epsilon = pot->epsilon;
real_t rCut = pot->cutoff;
real_t rCut2 = rCut*rCut;
// zero forces and energy
real_t ePot = 0.0;
s->ePotential = 0.0;
int fSize = s->boxes->nTotalBoxes*MAXATOMS;
#pragma omp parallel for
for (int ii=0; ii<fSize; ++ii)
{
zeroReal3(s->atoms->f[ii]);
s->atoms->U[ii] = 0.;
}
real_t s6 = sigma*sigma*sigma*sigma*sigma*sigma;
real_t rCut6 = s6 / (rCut2*rCut2*rCut2);
real_t eShift = POT_SHIFT * rCut6 * (rCut6 - 1.0);
int nNbrBoxes = 27;
// loop over local boxes
#pragma omp parallel for reduction(+:ePot)
for (int iBox=0; iBox<s->boxes->nLocalBoxes; iBox++)
{
int nIBox = s->boxes->nAtoms[iBox];
// loop over neighbors of iBox
for (int jTmp=0; jTmp<nNbrBoxes; jTmp++)
{
int jBox = s->boxes->nbrBoxes[iBox][jTmp];
assert(jBox>=0);
int nJBox = s->boxes->nAtoms[jBox];
// loop over atoms in iBox
for (int iOff=MAXATOMS*iBox; iOff<(iBox*MAXATOMS+nIBox); iOff++)
{
// loop over atoms in jBox
for (int jOff=jBox*MAXATOMS; jOff<(jBox*MAXATOMS+nJBox); jOff++)
{
real3 dr;
real_t r2 = 0.0;
for (int m=0; m<3; m++)
{
dr[m] = s->atoms->r[iOff][m]-s->atoms->r[jOff][m];
r2+=dr[m]*dr[m];
}
if ( r2 <= rCut2 && r2 > 0.0)
{
// Important note:
// from this point on r actually refers to 1.0/r
r2 = 1.0/r2;
real_t r6 = s6 * (r2*r2*r2);
real_t eLocal = r6 * (r6 - 1.0) - eShift;
s->atoms->U[iOff] += 0.5*eLocal;
ePot += 0.5*eLocal;
// different formulation to avoid sqrt computation
real_t fr = - 4.0*epsilon*r6*r2*(12.0*r6 - 6.0);
for (int m=0; m<3; m++)
{
s->atoms->f[iOff][m] -= dr[m]*fr;
}
}
} // loop over atoms in jBox
} // loop over atoms in iBox
} // loop over neighbor boxes
} // loop over local boxes in system
ePot = ePot*4.0*epsilon;
s->ePotential = ePot;
return 0;
}
|
colorspace.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% CCCC OOO L OOO RRRR SSSSS PPPP AAA CCCC EEEEE %
% C O O L O O R R SS P P A A C E %
% C O O L O O RRRR SSS PPPP AAAAA C EEE %
% C O O L O O R R SS P A A C E %
% CCCC OOO LLLLL OOO R R SSSSS P A A CCCC EEEEE %
% %
% %
% MagickCore Image Colorspace Methods %
% %
% Software Design %
% Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2021 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% https://imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
*/
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/property.h"
#include "MagickCore/cache.h"
#include "MagickCore/cache-private.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/color.h"
#include "MagickCore/color-private.h"
#include "MagickCore/colorspace.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/exception.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/enhance.h"
#include "MagickCore/image.h"
#include "MagickCore/image-private.h"
#include "MagickCore/gem.h"
#include "MagickCore/gem-private.h"
#include "MagickCore/memory_.h"
#include "MagickCore/monitor.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/option.h"
#include "MagickCore/pixel-accessor.h"
#include "MagickCore/pixel-private.h"
#include "MagickCore/quantize.h"
#include "MagickCore/quantum.h"
#include "MagickCore/quantum-private.h"
#include "MagickCore/resource_.h"
#include "MagickCore/string_.h"
#include "MagickCore/string-private.h"
#include "MagickCore/utility.h"
/*
Typedef declarations.
*/
typedef struct _TransformPacket
{
MagickRealType
x,
y,
z;
} TransformPacket;
/*
Forward declarations.
*/
static MagickBooleanType
TransformsRGBImage(Image *,ExceptionInfo *);
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t I m a g e C o l o r s p a c e T y p e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetImageColorspaceType() returns the potential type of image:
% sRGBColorspaceType, RGBColorspaceType, GRAYColorspaceType, etc.
%
% To ensure the image type matches its potential, use SetImageColorspaceType():
%
% (void) SetImageColorspaceType(image,GetImageColorspaceType(image),
% exception);
%
% The format of the GetImageColorspaceType method is:
%
% ColorspaceType GetImageColorspaceType(const Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport ColorspaceType GetImageColorspaceType(const Image *image,
ExceptionInfo *exception)
{
ColorspaceType
colorspace;
ImageType
type;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
colorspace=image->colorspace;
type=IdentifyImageType(image,exception);
if ((type == BilevelType) || (type == GrayscaleType) ||
(type == GrayscaleAlphaType))
colorspace=GRAYColorspace;
return(colorspace);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ s R G B T r a n s f o r m I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% sRGBTransformImage() converts the reference image from sRGB to an alternate
% colorspace. The transformation matrices are not the standard ones: the
% weights are rescaled to normalized the range of the transformed values to
% be [0..QuantumRange].
%
% The format of the sRGBTransformImage method is:
%
% MagickBooleanType sRGBTransformImage(Image *image,
% const ColorspaceType colorspace,EsceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o colorspace: the colorspace to transform the image to.
%
% o exception: return any errors or warnings in this structure.
%
*/
static inline void ConvertAdobe98ToRGB(const double r,const double g,
const double b,double *red,double *green,double *blue)
{
double
X,
Y,
Z;
ConvertAdobe98ToXYZ(r,g,b,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline void ConvertDisplayP3ToRGB(const double r,const double g,
const double b,double *red,double *green,double *blue)
{
double
X,
Y,
Z;
ConvertDisplayP3ToXYZ(r,g,b,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline void ConvertProPhotoToRGB(const double r,const double g,
const double b,double *red,double *green,double *blue)
{
double
X,
Y,
Z;
ConvertProPhotoToXYZ(r,g,b,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline void ConvertRGBToCMY(const double red,const double green,
const double blue,double *cyan,double *magenta,double *yellow)
{
*cyan=QuantumScale*(QuantumRange-red);
*magenta=QuantumScale*(QuantumRange-green);
*yellow=QuantumScale*(QuantumRange-blue);
}
static void ConvertRGBToAdobe98(const double red,const double green,
const double blue,double *r,double *g,double *b)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
ConvertXYZToAdobe98(X,Y,Z,r,g,b);
}
static void ConvertRGBToDisplayP3(const double red,const double green,
const double blue,double *r,double *g,double *b)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
ConvertXYZToDisplayP3(X,Y,Z,r,g,b);
}
static void ConvertRGBToProPhoto(const double red,const double green,
const double blue,double *r,double *g,double *b)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
ConvertXYZToProPhoto(X,Y,Z,r,g,b);
}
static inline void ConvertXYZToLMS(const double x,const double y,
const double z,double *L,double *M,double *S)
{
*L=0.7328*x+0.4296*y-0.1624*z;
*M=(-0.7036*x+1.6975*y+0.0061*z);
*S=0.0030*x+0.0136*y+0.9834*z;
}
static void ConvertRGBToLMS(const double red,const double green,
const double blue,double *L,double *M,double *S)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
ConvertXYZToLMS(X,Y,Z,L,M,S);
}
static void ConvertRGBToLuv(const double red,const double green,
const double blue,const IlluminantType illuminant,double *L,double *u,
double *v)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
ConvertXYZToLuv(X,Y,Z,illuminant,L,u,v);
}
static void ConvertRGBToxyY(const double red,const double green,
const double blue,double *low_x,double *low_y,double *cap_Y)
{
double
gamma,
X,
Y,
Z;
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
gamma=PerceptibleReciprocal(X+Y+Z);
*low_x=gamma*X;
*low_y=gamma*Y;
*cap_Y=Y;
}
static void inline ConvertXYZToJzazbz(const double X,const double Y,
const double Z,const double white_luminance,double *Jz,double *az,double *bz)
{
#define Jzazbz_b 1.15 /* https://observablehq.com/@jrus/jzazbz */
#define Jzazbz_g 0.66
#define Jzazbz_c1 (3424.0/4096.0)
#define Jzazbz_c2 (2413.0/128.0)
#define Jzazbz_c3 (2392.0/128.0)
#define Jzazbz_n (2610.0/16384.0)
#define Jzazbz_p (1.7*2523.0/32.0)
#define Jzazbz_d (-0.56)
#define Jzazbz_d0 (1.6295499532821566e-11)
double
gamma,
Iz,
L,
Lp,
M,
Mp,
S,
Sp,
Xp,
Yp,
Zp;
Xp=(Jzazbz_b*X-Z*(Jzazbz_b-1));
Yp=(Jzazbz_g*Y-X*(Jzazbz_g-1));
Zp=Z;
L=0.41478972*Xp+0.579999*Yp+0.0146480*Zp;
M=(-0.2015100)*Xp+1.120649*Yp+0.0531008*Zp;
S=(-0.0166008)*Xp+0.264800*Yp+0.6684799*Zp;
gamma=pow(L*PerceptibleReciprocal(white_luminance),Jzazbz_n);
Lp=pow((Jzazbz_c1+Jzazbz_c2*gamma)/(1.0+Jzazbz_c3*gamma),Jzazbz_p);
gamma=pow(M*PerceptibleReciprocal(white_luminance),Jzazbz_n);
Mp=pow((Jzazbz_c1+Jzazbz_c2*gamma)/(1.0+Jzazbz_c3*gamma),Jzazbz_p);
gamma=pow(S*PerceptibleReciprocal(white_luminance),Jzazbz_n);
Sp=pow((Jzazbz_c1+Jzazbz_c2*gamma)/(1.0+Jzazbz_c3*gamma),Jzazbz_p);
Iz=0.5*Lp+0.5*Mp;
*az=3.52400*Lp-4.066708*Mp+0.542708*Sp+0.5;
*bz=0.199076*Lp+1.096799*Mp-1.295875*Sp+0.5;
*Jz=((Jzazbz_d+1.0)*Iz)/(Jzazbz_d*Iz+1.0)-Jzazbz_d0;
}
static void inline ConvertJzazbzToXYZ(const double Jz,const double az,
const double bz,const double white_luminance,double *X,double *Y,double *Z)
{
double
azz,
bzz,
gamma,
Iz,
L,
Lp,
M,
Mp,
S,
Sp,
Xp,
Yp,
Zp;
gamma=Jz+Jzazbz_d0;
Iz=gamma/(Jzazbz_d-Jzazbz_d*gamma+1.0);
azz=az-0.5;
bzz=bz-0.5;
Lp=Iz+0.138605043271539*azz+0.0580473161561189*bzz;
Mp=Iz-0.138605043271539*azz-0.0580473161561189*bzz;
Sp=Iz-0.0960192420263189*azz-0.811891896056039*bzz;
gamma=pow(Lp,1.0/Jzazbz_p);
L=white_luminance*pow((Jzazbz_c1-gamma)/(Jzazbz_c3*gamma-Jzazbz_c2),1.0/
Jzazbz_n);
gamma=pow(Mp,1.0/Jzazbz_p);
M=white_luminance*pow((Jzazbz_c1-gamma)/(Jzazbz_c3*gamma-Jzazbz_c2),1.0/
Jzazbz_n);
gamma=pow(Sp,1.0/Jzazbz_p);
S=white_luminance*pow((Jzazbz_c1-gamma)/(Jzazbz_c3*gamma-Jzazbz_c2),1.0/
Jzazbz_n);
Xp=1.92422643578761*L-1.00479231259537*M+0.037651404030618*S;
Yp=0.350316762094999*L+0.726481193931655*M-0.065384422948085*S;
Zp=(-0.0909828109828476)*L-0.312728290523074*M+1.52276656130526*S;
*X=(Xp+(Jzazbz_b-1.0)*Zp)/Jzazbz_b;
*Y=(Yp+(Jzazbz_g-1.0)**X)/Jzazbz_g;
*Z=Zp;
}
static void ConvertRGBToJzazbz(const double red,const double green,
const double blue,const double white_luminance,double *Jz,double *az,
double *bz)
{
double
X,
Y,
Z;
ConvertRGBToXYZ(red,blue,green,&X,&Y,&Z);
ConvertXYZToJzazbz(X,Y,Z,white_luminance,Jz,az,bz);
}
static void ConvertJzazbzToRGB(const double Jz,const double az,
const double bz,const double white_luminance,double *red,double *green,
double *blue)
{
double
X,
Y,
Z;
ConvertJzazbzToXYZ(Jz,az,bz,white_luminance,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,blue,green);
}
static void ConvertRGBToYDbDr(const double red,const double green,
const double blue,double *Y,double *Db,double *Dr)
{
*Y=QuantumScale*(0.298839*red+0.586811*green+0.114350*blue);
*Db=QuantumScale*(-0.450*red-0.883*green+1.333*blue)+0.5;
*Dr=QuantumScale*(-1.333*red+1.116*green+0.217*blue)+0.5;
}
static void ConvertRGBToYIQ(const double red,const double green,
const double blue,double *Y,double *I,double *Q)
{
*Y=QuantumScale*(0.298839*red+0.586811*green+0.114350*blue);
*I=QuantumScale*(0.595716*red-0.274453*green-0.321263*blue)+0.5;
*Q=QuantumScale*(0.211456*red-0.522591*green+0.311135*blue)+0.5;
}
static void ConvertRGBToYPbPr(const double red,const double green,
const double blue,double *Y,double *Pb,double *Pr)
{
*Y=QuantumScale*(0.298839*red+0.586811*green+0.114350*blue);
*Pb=QuantumScale*((-0.1687367)*red-0.331264*green+0.5*blue)+0.5;
*Pr=QuantumScale*(0.5*red-0.418688*green-0.081312*blue)+0.5;
}
static void ConvertRGBToYCbCr(const double red,const double green,
const double blue,double *Y,double *Cb,double *Cr)
{
ConvertRGBToYPbPr(red,green,blue,Y,Cb,Cr);
}
static void ConvertRGBToYUV(const double red,const double green,
const double blue,double *Y,double *U,double *V)
{
*Y=QuantumScale*(0.298839*red+0.586811*green+0.114350*blue);
*U=QuantumScale*((-0.147)*red-0.289*green+0.436*blue)+0.5;
*V=QuantumScale*(0.615*red-0.515*green-0.100*blue)+0.5;
}
static MagickBooleanType sRGBTransformImage(Image *image,
const ColorspaceType colorspace,ExceptionInfo *exception)
{
#define sRGBTransformImageTag "RGBTransform/Image"
CacheView
*image_view;
const char
*artifact;
IlluminantType
illuminant = D65Illuminant;
MagickBooleanType
status;
MagickOffsetType
progress;
PrimaryInfo
primary_info;
ssize_t
i;
ssize_t
y;
TransformPacket
*x_map,
*y_map,
*z_map;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(colorspace != sRGBColorspace);
assert(colorspace != TransparentColorspace);
assert(colorspace != UndefinedColorspace);
artifact=GetImageArtifact(image,"color:illuminant");
if (artifact != (const char *) NULL)
{
illuminant=(IlluminantType) ParseCommandOption(MagickIlluminantOptions,
MagickFalse,artifact);
if ((ssize_t) illuminant < 0)
illuminant=UndefinedIlluminant;
}
status=MagickTrue;
progress=0;
switch (colorspace)
{
case CMYKColorspace:
{
PixelInfo
zero;
/*
Convert RGB to CMYK colorspace.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
GetPixelInfo(image,&zero);
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
PixelInfo
pixel;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
pixel=zero;
for (x=0; x < (ssize_t) image->columns; x++)
{
GetPixelInfoPixel(image,q,&pixel);
ConvertRGBToCMYK(&pixel);
SetPixelViaPixelInfo(image,&pixel,q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
image->type=image->alpha_trait == UndefinedPixelTrait ?
ColorSeparationType : ColorSeparationAlphaType;
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case LinearGRAYColorspace:
{
/*
Transform image from sRGB to GRAY.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
MagickRealType
gray;
gray=0.212656*DecodePixelGamma(GetPixelRed(image,q))+0.715158*
DecodePixelGamma(GetPixelGreen(image,q))+0.072186*
DecodePixelGamma(GetPixelBlue(image,q));
SetPixelGray(image,ClampToQuantum(gray),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
image->type=GrayscaleType;
return(status);
}
case GRAYColorspace:
{
/*
Transform image from sRGB to GRAY.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
MagickRealType
gray;
gray=0.212656*GetPixelRed(image,q)+0.715158*GetPixelGreen(image,q)+
0.072186*GetPixelBlue(image,q);
SetPixelGray(image,ClampToQuantum(gray),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
image->type=GrayscaleType;
return(status);
}
case CMYColorspace:
case Adobe98Colorspace:
case DisplayP3Colorspace:
case HCLColorspace:
case HCLpColorspace:
case HSBColorspace:
case HSIColorspace:
case HSLColorspace:
case HSVColorspace:
case HWBColorspace:
case JzazbzColorspace:
case LabColorspace:
case LCHColorspace:
case LCHabColorspace:
case LCHuvColorspace:
case LMSColorspace:
case LuvColorspace:
case ProPhotoColorspace:
case xyYColorspace:
case XYZColorspace:
case YCbCrColorspace:
case YDbDrColorspace:
case YIQColorspace:
case YPbPrColorspace:
case YUVColorspace:
{
const char
*value;
double
white_luminance;
/*
Transform image from sRGB to target colorspace.
*/
white_luminance=10000.0;
value=GetImageProperty(image,"white-luminance",exception);
if (value != (const char *) NULL)
white_luminance=StringToDouble(value,(char **) NULL);
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
double
blue,
green,
red,
X,
Y,
Z;
red=(double) GetPixelRed(image,q);
green=(double) GetPixelGreen(image,q);
blue=(double) GetPixelBlue(image,q);
switch (colorspace)
{
case Adobe98Colorspace:
{
ConvertRGBToAdobe98(red,green,blue,&X,&Y,&Z);
break;
}
case CMYColorspace:
{
ConvertRGBToCMY(red,green,blue,&X,&Y,&Z);
break;
}
case DisplayP3Colorspace:
{
ConvertRGBToDisplayP3(red,green,blue,&X,&Y,&Z);
break;
}
case HCLColorspace:
{
ConvertRGBToHCL(red,green,blue,&X,&Y,&Z);
break;
}
case HCLpColorspace:
{
ConvertRGBToHCLp(red,green,blue,&X,&Y,&Z);
break;
}
case HSBColorspace:
{
ConvertRGBToHSB(red,green,blue,&X,&Y,&Z);
break;
}
case HSIColorspace:
{
ConvertRGBToHSI(red,green,blue,&X,&Y,&Z);
break;
}
case HSLColorspace:
{
ConvertRGBToHSL(red,green,blue,&X,&Y,&Z);
break;
}
case HSVColorspace:
{
ConvertRGBToHSV(red,green,blue,&X,&Y,&Z);
break;
}
case HWBColorspace:
{
ConvertRGBToHWB(red,green,blue,&X,&Y,&Z);
break;
}
case JzazbzColorspace:
{
ConvertRGBToJzazbz(red,green,blue,white_luminance,&X,&Y,&Z);
break;
}
case LabColorspace:
{
ConvertRGBToLab(red,green,blue,illuminant,&X,&Y,&Z);
break;
}
case LCHColorspace:
case LCHabColorspace:
{
ConvertRGBToLCHab(red,green,blue,illuminant,&X,&Y,&Z);
break;
}
case LCHuvColorspace:
{
ConvertRGBToLCHuv(red,green,blue,illuminant,&X,&Y,&Z);
break;
}
case LMSColorspace:
{
ConvertRGBToLMS(red,green,blue,&X,&Y,&Z);
break;
}
case LuvColorspace:
{
ConvertRGBToLuv(red,green,blue,illuminant,&X,&Y,&Z);
break;
}
case ProPhotoColorspace:
{
ConvertRGBToProPhoto(red,green,blue,&X,&Y,&Z);
break;
}
case xyYColorspace:
{
ConvertRGBToxyY(red,green,blue,&X,&Y,&Z);
break;
}
case XYZColorspace:
{
ConvertRGBToXYZ(red,green,blue,&X,&Y,&Z);
break;
}
case YCbCrColorspace:
{
ConvertRGBToYCbCr(red,green,blue,&X,&Y,&Z);
break;
}
case YDbDrColorspace:
{
ConvertRGBToYDbDr(red,green,blue,&X,&Y,&Z);
break;
}
case YIQColorspace:
{
ConvertRGBToYIQ(red,green,blue,&X,&Y,&Z);
break;
}
case YPbPrColorspace:
{
ConvertRGBToYPbPr(red,green,blue,&X,&Y,&Z);
break;
}
case YUVColorspace:
{
ConvertRGBToYUV(red,green,blue,&X,&Y,&Z);
break;
}
default:
{
X=QuantumScale*red;
Y=QuantumScale*green;
Z=QuantumScale*blue;
break;
}
}
SetPixelRed(image,ClampToQuantum(QuantumRange*X),q);
SetPixelGreen(image,ClampToQuantum(QuantumRange*Y),q);
SetPixelBlue(image,ClampToQuantum(QuantumRange*Z),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case LogColorspace:
{
#define DisplayGamma (1.0/1.7)
#define FilmGamma 0.6
#define ReferenceBlack 95.0
#define ReferenceWhite 685.0
const char
*value;
double
black,
density,
film_gamma,
gamma,
reference_black,
reference_white;
Quantum
*logmap;
/*
Transform RGB to Log colorspace.
*/
density=DisplayGamma;
gamma=DisplayGamma;
value=GetImageProperty(image,"gamma",exception);
if (value != (const char *) NULL)
gamma=PerceptibleReciprocal(StringToDouble(value,(char **) NULL));
film_gamma=FilmGamma;
value=GetImageProperty(image,"film-gamma",exception);
if (value != (const char *) NULL)
film_gamma=StringToDouble(value,(char **) NULL);
reference_black=ReferenceBlack;
value=GetImageProperty(image,"reference-black",exception);
if (value != (const char *) NULL)
reference_black=StringToDouble(value,(char **) NULL);
reference_white=ReferenceWhite;
value=GetImageProperty(image,"reference-white",exception);
if (value != (const char *) NULL)
reference_white=StringToDouble(value,(char **) NULL);
logmap=(Quantum *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*logmap));
if (logmap == (Quantum *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
black=pow(10.0,(reference_black-reference_white)*(gamma/density)*0.002*
PerceptibleReciprocal(film_gamma));
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
logmap[i]=ScaleMapToQuantum((double) (MaxMap*(reference_white+
log10(black+(1.0*i/MaxMap)*(1.0-black))/((gamma/density)*0.002*
PerceptibleReciprocal(film_gamma)))/1024.0));
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=(ssize_t) image->columns; x != 0; x--)
{
double
blue,
green,
red;
red=(double) DecodePixelGamma((MagickRealType)
GetPixelRed(image,q));
green=(double) DecodePixelGamma((MagickRealType)
GetPixelGreen(image,q));
blue=(double) DecodePixelGamma((MagickRealType)
GetPixelBlue(image,q));
SetPixelRed(image,logmap[ScaleQuantumToMap(ClampToQuantum(red))],q);
SetPixelGreen(image,logmap[ScaleQuantumToMap(ClampToQuantum(green))],
q);
SetPixelBlue(image,logmap[ScaleQuantumToMap(ClampToQuantum(blue))],q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
logmap=(Quantum *) RelinquishMagickMemory(logmap);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case RGBColorspace:
case scRGBColorspace:
{
/*
Transform image from sRGB to linear RGB.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
double
blue,
green,
red;
red=DecodePixelGamma((MagickRealType) GetPixelRed(image,q));
green=DecodePixelGamma((MagickRealType) GetPixelGreen(image,q));
blue=DecodePixelGamma((MagickRealType) GetPixelBlue(image,q));
SetPixelRed(image,ClampToQuantum(red),q);
SetPixelGreen(image,ClampToQuantum(green),q);
SetPixelBlue(image,ClampToQuantum(blue),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
default:
break;
}
/*
Allocate the tables.
*/
x_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*x_map));
y_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*y_map));
z_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*z_map));
if ((x_map == (TransformPacket *) NULL) ||
(y_map == (TransformPacket *) NULL) ||
(z_map == (TransformPacket *) NULL))
{
if (x_map != (TransformPacket *) NULL)
x_map=(TransformPacket *) RelinquishMagickMemory(x_map);
if (y_map != (TransformPacket *) NULL)
y_map=(TransformPacket *) RelinquishMagickMemory(y_map);
if (z_map != (TransformPacket *) NULL)
z_map=(TransformPacket *) RelinquishMagickMemory(z_map);
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
}
(void) memset(&primary_info,0,sizeof(primary_info));
switch (colorspace)
{
case OHTAColorspace:
{
/*
Initialize OHTA tables:
I1 = 0.33333*R+0.33334*G+0.33333*B
I2 = 0.50000*R+0.00000*G-0.50000*B
I3 =-0.25000*R+0.50000*G-0.25000*B
I and Q, normally -0.5 through 0.5, are normalized to the range 0
through QuantumRange.
*/
primary_info.y=(double) (MaxMap+1.0)/2.0;
primary_info.z=(double) (MaxMap+1.0)/2.0;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (0.33333*(double) i);
x_map[i].y=(MagickRealType) (0.50000*(double) i);
x_map[i].z=(MagickRealType) (-0.25000*(double) i);
y_map[i].x=(MagickRealType) (0.33334*(double) i);
y_map[i].y=(MagickRealType) (0.00000*(double) i);
y_map[i].z=(MagickRealType) (0.50000*(double) i);
z_map[i].x=(MagickRealType) (0.33333*(double) i);
z_map[i].y=(MagickRealType) (-0.50000*(double) i);
z_map[i].z=(MagickRealType) (-0.25000*(double) i);
}
break;
}
case Rec601YCbCrColorspace:
{
/*
Initialize YCbCr tables (ITU-R BT.601):
Y = 0.2988390*R+0.5868110*G+0.1143500*B
Cb= -0.1687367*R-0.3312640*G+0.5000000*B
Cr= 0.5000000*R-0.4186880*G-0.0813120*B
Cb and Cr, normally -0.5 through 0.5, are normalized to the range 0
through QuantumRange.
*/
primary_info.y=(double) (MaxMap+1.0)/2.0;
primary_info.z=(double) (MaxMap+1.0)/2.0;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (0.298839*(double) i);
x_map[i].y=(MagickRealType) (-0.1687367*(double) i);
x_map[i].z=(MagickRealType) (0.500000*(double) i);
y_map[i].x=(MagickRealType) (0.586811*(double) i);
y_map[i].y=(MagickRealType) (-0.331264*(double) i);
y_map[i].z=(MagickRealType) (-0.418688*(double) i);
z_map[i].x=(MagickRealType) (0.114350*(double) i);
z_map[i].y=(MagickRealType) (0.500000*(double) i);
z_map[i].z=(MagickRealType) (-0.081312*(double) i);
}
break;
}
case Rec709YCbCrColorspace:
{
/*
Initialize YCbCr tables (ITU-R BT.709):
Y = 0.212656*R+0.715158*G+0.072186*B
Cb= -0.114572*R-0.385428*G+0.500000*B
Cr= 0.500000*R-0.454153*G-0.045847*B
Cb and Cr, normally -0.5 through 0.5, are normalized to the range 0
through QuantumRange.
*/
primary_info.y=(double) (MaxMap+1.0)/2.0;
primary_info.z=(double) (MaxMap+1.0)/2.0;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (0.212656*(double) i);
x_map[i].y=(MagickRealType) (-0.114572*(double) i);
x_map[i].z=(MagickRealType) (0.500000*(double) i);
y_map[i].x=(MagickRealType) (0.715158*(double) i);
y_map[i].y=(MagickRealType) (-0.385428*(double) i);
y_map[i].z=(MagickRealType) (-0.454153*(double) i);
z_map[i].x=(MagickRealType) (0.072186*(double) i);
z_map[i].y=(MagickRealType) (0.500000*(double) i);
z_map[i].z=(MagickRealType) (-0.045847*(double) i);
}
break;
}
case YCCColorspace:
{
/*
Initialize YCC tables:
Y = 0.298839*R+0.586811*G+0.114350*B
C1= -0.298839*R-0.586811*G+0.88600*B
C2= 0.70100*R-0.586811*G-0.114350*B
YCC is scaled by 1.3584. C1 zero is 156 and C2 is at 137.
*/
primary_info.y=(double) ScaleQuantumToMap(ScaleCharToQuantum(156));
primary_info.z=(double) ScaleQuantumToMap(ScaleCharToQuantum(137));
for (i=0; i <= (ssize_t) (0.018*MaxMap); i++)
{
x_map[i].x=0.005382*i;
x_map[i].y=(-0.003296)*i;
x_map[i].z=0.009410*i;
y_map[i].x=0.010566*i;
y_map[i].y=(-0.006471)*i;
y_map[i].z=(-0.007880)*i;
z_map[i].x=0.002052*i;
z_map[i].y=0.009768*i;
z_map[i].z=(-0.001530)*i;
}
for ( ; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=0.298839*(1.099*i-0.099);
x_map[i].y=(-0.298839)*(1.099*i-0.099);
x_map[i].z=0.70100*(1.099*i-0.099);
y_map[i].x=0.586811*(1.099*i-0.099);
y_map[i].y=(-0.586811)*(1.099*i-0.099);
y_map[i].z=(-0.586811)*(1.099*i-0.099);
z_map[i].x=0.114350*(1.099*i-0.099);
z_map[i].y=0.88600*(1.099*i-0.099);
z_map[i].z=(-0.114350)*(1.099*i-0.099);
}
break;
}
default:
{
/*
Linear conversion tables.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (1.0*(double) i);
x_map[i].y=(MagickRealType) 0.0;
x_map[i].z=(MagickRealType) 0.0;
y_map[i].x=(MagickRealType) 0.0;
y_map[i].y=(MagickRealType) (1.0*(double) i);
y_map[i].z=(MagickRealType) 0.0;
z_map[i].x=(MagickRealType) 0.0;
z_map[i].y=(MagickRealType) 0.0;
z_map[i].z=(MagickRealType) (1.0*(double) i);
}
break;
}
}
/*
Convert from sRGB.
*/
switch (image->storage_class)
{
case DirectClass:
default:
{
/*
Convert DirectClass image.
*/
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
PixelInfo
pixel;
Quantum
*magick_restrict q;
ssize_t
x;
unsigned int
blue,
green,
red;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
red=ScaleQuantumToMap(ClampToQuantum((MagickRealType)
GetPixelRed(image,q)));
green=ScaleQuantumToMap(ClampToQuantum((MagickRealType)
GetPixelGreen(image,q)));
blue=ScaleQuantumToMap(ClampToQuantum((MagickRealType)
GetPixelBlue(image,q)));
pixel.red=(x_map[red].x+y_map[green].x+z_map[blue].x)+
primary_info.x;
pixel.green=(x_map[red].y+y_map[green].y+z_map[blue].y)+
primary_info.y;
pixel.blue=(x_map[red].z+y_map[green].z+z_map[blue].z)+
primary_info.z;
SetPixelRed(image,ScaleMapToQuantum(pixel.red),q);
SetPixelGreen(image,ScaleMapToQuantum(pixel.green),q);
SetPixelBlue(image,ScaleMapToQuantum(pixel.blue),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp atomic
#endif
progress++;
proceed=SetImageProgress(image,sRGBTransformImageTag,progress,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
break;
}
case PseudoClass:
{
unsigned int
blue,
green,
red;
/*
Convert PseudoClass image.
*/
for (i=0; i < (ssize_t) image->colors; i++)
{
PixelInfo
pixel;
red=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].red));
green=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].green));
blue=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].blue));
pixel.red=x_map[red].x+y_map[green].x+z_map[blue].x+primary_info.x;
pixel.green=x_map[red].y+y_map[green].y+z_map[blue].y+primary_info.y;
pixel.blue=x_map[red].z+y_map[green].z+z_map[blue].z+primary_info.z;
image->colormap[i].red=(double) ScaleMapToQuantum(pixel.red);
image->colormap[i].green=(double) ScaleMapToQuantum(pixel.green);
image->colormap[i].blue=(double) ScaleMapToQuantum(pixel.blue);
}
(void) SyncImage(image,exception);
break;
}
}
/*
Relinquish resources.
*/
z_map=(TransformPacket *) RelinquishMagickMemory(z_map);
y_map=(TransformPacket *) RelinquishMagickMemory(y_map);
x_map=(TransformPacket *) RelinquishMagickMemory(x_map);
if (SetImageColorspace(image,colorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e t I m a g e C o l o r s p a c e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SetImageColorspace() sets the colorspace member of the Image structure.
%
% The format of the SetImageColorspace method is:
%
% MagickBooleanType SetImageColorspace(Image *image,
% const ColorspaceType colorspace,ExceptiionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o colorspace: the colorspace.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType SetImageColorspace(Image *image,
const ColorspaceType colorspace,ExceptionInfo *exception)
{
ImageType
type;
MagickBooleanType
status;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
if (image->colorspace == colorspace)
return(MagickTrue);
image->colorspace=colorspace;
image->rendering_intent=UndefinedIntent;
image->gamma=1.000/2.200;
(void) memset(&image->chromaticity,0,sizeof(image->chromaticity));
type=image->type;
if (IsGrayColorspace(colorspace) != MagickFalse)
{
if (colorspace == LinearGRAYColorspace)
image->gamma=1.000;
type=GrayscaleType;
}
else
if ((IsRGBColorspace(colorspace) != MagickFalse) ||
(colorspace == XYZColorspace) || (colorspace == xyYColorspace))
image->gamma=1.000;
else
{
image->rendering_intent=PerceptualIntent;
image->chromaticity.red_primary.x=0.6400;
image->chromaticity.red_primary.y=0.3300;
image->chromaticity.red_primary.z=0.0300;
image->chromaticity.green_primary.x=0.3000;
image->chromaticity.green_primary.y=0.6000;
image->chromaticity.green_primary.z=0.1000;
image->chromaticity.blue_primary.x=0.1500;
image->chromaticity.blue_primary.y=0.0600;
image->chromaticity.blue_primary.z=0.7900;
image->chromaticity.white_point.x=0.3127;
image->chromaticity.white_point.y=0.3290;
image->chromaticity.white_point.z=0.3583;
}
status=SyncImagePixelCache(image,exception);
image->type=type;
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e t I m a g e G r a y %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SetImageGray() returns MagickTrue if all the pixels in the image have the
% same red, green, and blue intensities and changes the type of the image to
% bi-level or grayscale.
%
% The format of the SetImageGray method is:
%
% MagickBooleanType SetImageGray(const Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType SetImageGray(Image *image,
ExceptionInfo *exception)
{
const char
*value;
ImageType
type;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (IsImageGray(image) != MagickFalse)
return(MagickTrue);
if (IssRGBCompatibleColorspace(image->colorspace) == MagickFalse)
return(MagickFalse);
value=GetImageProperty(image,"colorspace:auto-grayscale",exception);
if (IsStringFalse(value) != MagickFalse)
return(MagickFalse);
type=IdentifyImageGray(image,exception);
if (type == UndefinedType)
return(MagickFalse);
image->colorspace=GRAYColorspace;
if (SyncImagePixelCache((Image *) image,exception) == MagickFalse)
return(MagickFalse);
image->type=type;
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e t I m a g e M o n o c h r o m e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SetImageMonochrome() returns MagickTrue if all the pixels in the image have
% the same red, green, and blue intensities and the intensity is either
% 0 or QuantumRange and changes the type of the image to bi-level.
%
% The format of the SetImageMonochrome method is:
%
% MagickBooleanType SetImageMonochrome(Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType SetImageMonochrome(Image *image,
ExceptionInfo *exception)
{
MagickBooleanType
is_bilevel;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (IsImageMonochrome(image) != MagickFalse)
return(MagickTrue);
if (IssRGBCompatibleColorspace(image->colorspace) == MagickFalse)
return(MagickFalse);
is_bilevel=IdentifyImageMonochrome(image,exception);
if (is_bilevel == MagickFalse)
return(MagickFalse);
image->colorspace=GRAYColorspace;
if (SyncImagePixelCache((Image *) image,exception) == MagickFalse)
return(MagickFalse);
image->type=BilevelType;
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% T r a n s f o r m I m a g e C o l o r s p a c e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% TransformImageColorspace() transforms an image colorspace, changing the
% image data to reflect the new colorspace.
%
% The format of the TransformImageColorspace method is:
%
% MagickBooleanType TransformImageColorspace(Image *image,
% const ColorspaceType colorspace,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o colorspace: the colorspace.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType TransformImageColorspace(Image *image,
const ColorspaceType colorspace,ExceptionInfo *exception)
{
MagickBooleanType
status;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->colorspace == colorspace)
return(SetImageColorspace(image,colorspace,exception));
(void) DeleteImageProfile(image,"icc");
(void) DeleteImageProfile(image,"icm");
if (colorspace == UndefinedColorspace)
return(SetImageColorspace(image,colorspace,exception));
/*
Convert the reference image from an alternate colorspace to sRGB.
*/
if (IssRGBColorspace(colorspace) != MagickFalse)
return(TransformsRGBImage(image,exception));
status=MagickTrue;
if (IssRGBColorspace(image->colorspace) == MagickFalse)
status=TransformsRGBImage(image,exception);
if (status == MagickFalse)
return(status);
/*
Convert the reference image from sRGB to an alternate colorspace.
*/
if (sRGBTransformImage(image,colorspace,exception) == MagickFalse)
status=MagickFalse;
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ T r a n s f o r m s R G B I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% TransformsRGBImage() converts the reference image from an alternate
% colorspace to sRGB. The transformation matrices are not the standard ones:
% the weights are rescaled to normalize the range of the transformed values
% to be [0..QuantumRange].
%
% The format of the TransformsRGBImage method is:
%
% MagickBooleanType TransformsRGBImage(Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
static inline void ConvertCMYToRGB(const double cyan,const double magenta,
const double yellow,double *red,double *green,double *blue)
{
*red=QuantumRange*(1.0-cyan);
*green=QuantumRange*(1.0-magenta);
*blue=QuantumRange*(1.0-yellow);
}
static inline void ConvertLMSToXYZ(const double L,const double M,const double S,
double *X,double *Y,double *Z)
{
*X=1.096123820835514*L-0.278869000218287*M+0.182745179382773*S;
*Y=0.454369041975359*L+0.473533154307412*M+0.072097803717229*S;
*Z=(-0.009627608738429)*L-0.005698031216113*M+1.015325639954543*S;
}
static inline void ConvertLMSToRGB(const double L,const double M,
const double S,double *red,double *green,double *blue)
{
double
X,
Y,
Z;
ConvertLMSToXYZ(L,M,S,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline void ConvertLuvToRGB(const double L,const double u,
const double v,const IlluminantType illuminant,double *red,double *green,
double *blue)
{
double
X,
Y,
Z;
ConvertLuvToXYZ(100.0*L,354.0*u-134.0,262.0*v-140.0,illuminant,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline ssize_t RoundToYCC(const double value)
{
if (value <= 0.0)
return(0);
if (value >= 1388.0)
return(1388);
return((ssize_t) (value+0.5));
}
static inline void ConvertLabToRGB(const double L,const double a,
const double b,const IlluminantType illuminant,double *red,double *green,
double *blue)
{
double
X,
Y,
Z;
ConvertLabToXYZ(100.0*L,255.0*(a-0.5),255.0*(b-0.5),illuminant,&X,&Y,&Z);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static inline void ConvertxyYToRGB(const double low_x,const double low_y,
const double cap_Y,double *red,double *green,double *blue)
{
double
gamma,
X,
Y,
Z;
gamma=PerceptibleReciprocal(low_y);
X=gamma*cap_Y*low_x;
Y=cap_Y;
Z=gamma*cap_Y*(1.0-low_x-low_y);
ConvertXYZToRGB(X,Y,Z,red,green,blue);
}
static void ConvertYPbPrToRGB(const double Y,const double Pb,const double Pr,
double *red,double *green,double *blue)
{
*red=QuantumRange*(0.99999999999914679361*Y-1.2188941887145875e-06*(Pb-0.5)+
1.4019995886561440468*(Pr-0.5));
*green=QuantumRange*(0.99999975910502514331*Y-0.34413567816504303521*(Pb-0.5)-
0.71413649331646789076*(Pr-0.5));
*blue=QuantumRange*(1.00000124040004623180*Y+1.77200006607230409200*(Pb-0.5)+
2.1453384174593273e-06*(Pr-0.5));
}
static void ConvertYCbCrToRGB(const double Y,const double Cb,
const double Cr,double *red,double *green,double *blue)
{
ConvertYPbPrToRGB(Y,Cb,Cr,red,green,blue);
}
static void ConvertYIQToRGB(const double Y,const double I,const double Q,
double *red,double *green,double *blue)
{
*red=QuantumRange*(Y+0.9562957197589482261*(I-0.5)+0.6210244164652610754*
(Q-0.5));
*green=QuantumRange*(Y-0.2721220993185104464*(I-0.5)-0.6473805968256950427*
(Q-0.5));
*blue=QuantumRange*(Y-1.1069890167364901945*(I-0.5)+1.7046149983646481374*
(Q-0.5));
}
static void ConvertYDbDrToRGB(const double Y,const double Db,const double Dr,
double *red,double *green,double *blue)
{
*red=QuantumRange*(Y+9.2303716147657e-05*(Db-0.5)-
0.52591263066186533*(Dr-0.5));
*green=QuantumRange*(Y-0.12913289889050927*(Db-0.5)+
0.26789932820759876*(Dr-0.5));
*blue=QuantumRange*(Y+0.66467905997895482*(Db-0.5)-
7.9202543533108e-05*(Dr-0.5));
}
static void ConvertYUVToRGB(const double Y,const double U,const double V,
double *red,double *green,double *blue)
{
*red=QuantumRange*(Y-3.945707070708279e-05*(U-0.5)+1.1398279671717170825*
(V-0.5));
*green=QuantumRange*(Y-0.3946101641414141437*(U-0.5)-0.5805003156565656797*
(V-0.5));
*blue=QuantumRange*(Y+2.0319996843434342537*(U-0.5)-4.813762626262513e-04*
(V-0.5));
}
static MagickBooleanType TransformsRGBImage(Image *image,
ExceptionInfo *exception)
{
#define TransformsRGBImageTag "Transform/Image"
static const float
YCCMap[1389] =
{
0.000000f, 0.000720f, 0.001441f, 0.002161f, 0.002882f, 0.003602f,
0.004323f, 0.005043f, 0.005764f, 0.006484f, 0.007205f, 0.007925f,
0.008646f, 0.009366f, 0.010086f, 0.010807f, 0.011527f, 0.012248f,
0.012968f, 0.013689f, 0.014409f, 0.015130f, 0.015850f, 0.016571f,
0.017291f, 0.018012f, 0.018732f, 0.019452f, 0.020173f, 0.020893f,
0.021614f, 0.022334f, 0.023055f, 0.023775f, 0.024496f, 0.025216f,
0.025937f, 0.026657f, 0.027378f, 0.028098f, 0.028818f, 0.029539f,
0.030259f, 0.030980f, 0.031700f, 0.032421f, 0.033141f, 0.033862f,
0.034582f, 0.035303f, 0.036023f, 0.036744f, 0.037464f, 0.038184f,
0.038905f, 0.039625f, 0.040346f, 0.041066f, 0.041787f, 0.042507f,
0.043228f, 0.043948f, 0.044669f, 0.045389f, 0.046110f, 0.046830f,
0.047550f, 0.048271f, 0.048991f, 0.049712f, 0.050432f, 0.051153f,
0.051873f, 0.052594f, 0.053314f, 0.054035f, 0.054755f, 0.055476f,
0.056196f, 0.056916f, 0.057637f, 0.058357f, 0.059078f, 0.059798f,
0.060519f, 0.061239f, 0.061960f, 0.062680f, 0.063401f, 0.064121f,
0.064842f, 0.065562f, 0.066282f, 0.067003f, 0.067723f, 0.068444f,
0.069164f, 0.069885f, 0.070605f, 0.071326f, 0.072046f, 0.072767f,
0.073487f, 0.074207f, 0.074928f, 0.075648f, 0.076369f, 0.077089f,
0.077810f, 0.078530f, 0.079251f, 0.079971f, 0.080692f, 0.081412f,
0.082133f, 0.082853f, 0.083573f, 0.084294f, 0.085014f, 0.085735f,
0.086455f, 0.087176f, 0.087896f, 0.088617f, 0.089337f, 0.090058f,
0.090778f, 0.091499f, 0.092219f, 0.092939f, 0.093660f, 0.094380f,
0.095101f, 0.095821f, 0.096542f, 0.097262f, 0.097983f, 0.098703f,
0.099424f, 0.100144f, 0.100865f, 0.101585f, 0.102305f, 0.103026f,
0.103746f, 0.104467f, 0.105187f, 0.105908f, 0.106628f, 0.107349f,
0.108069f, 0.108790f, 0.109510f, 0.110231f, 0.110951f, 0.111671f,
0.112392f, 0.113112f, 0.113833f, 0.114553f, 0.115274f, 0.115994f,
0.116715f, 0.117435f, 0.118156f, 0.118876f, 0.119597f, 0.120317f,
0.121037f, 0.121758f, 0.122478f, 0.123199f, 0.123919f, 0.124640f,
0.125360f, 0.126081f, 0.126801f, 0.127522f, 0.128242f, 0.128963f,
0.129683f, 0.130403f, 0.131124f, 0.131844f, 0.132565f, 0.133285f,
0.134006f, 0.134726f, 0.135447f, 0.136167f, 0.136888f, 0.137608f,
0.138329f, 0.139049f, 0.139769f, 0.140490f, 0.141210f, 0.141931f,
0.142651f, 0.143372f, 0.144092f, 0.144813f, 0.145533f, 0.146254f,
0.146974f, 0.147695f, 0.148415f, 0.149135f, 0.149856f, 0.150576f,
0.151297f, 0.152017f, 0.152738f, 0.153458f, 0.154179f, 0.154899f,
0.155620f, 0.156340f, 0.157061f, 0.157781f, 0.158501f, 0.159222f,
0.159942f, 0.160663f, 0.161383f, 0.162104f, 0.162824f, 0.163545f,
0.164265f, 0.164986f, 0.165706f, 0.166427f, 0.167147f, 0.167867f,
0.168588f, 0.169308f, 0.170029f, 0.170749f, 0.171470f, 0.172190f,
0.172911f, 0.173631f, 0.174352f, 0.175072f, 0.175793f, 0.176513f,
0.177233f, 0.177954f, 0.178674f, 0.179395f, 0.180115f, 0.180836f,
0.181556f, 0.182277f, 0.182997f, 0.183718f, 0.184438f, 0.185159f,
0.185879f, 0.186599f, 0.187320f, 0.188040f, 0.188761f, 0.189481f,
0.190202f, 0.190922f, 0.191643f, 0.192363f, 0.193084f, 0.193804f,
0.194524f, 0.195245f, 0.195965f, 0.196686f, 0.197406f, 0.198127f,
0.198847f, 0.199568f, 0.200288f, 0.201009f, 0.201729f, 0.202450f,
0.203170f, 0.203890f, 0.204611f, 0.205331f, 0.206052f, 0.206772f,
0.207493f, 0.208213f, 0.208934f, 0.209654f, 0.210375f, 0.211095f,
0.211816f, 0.212536f, 0.213256f, 0.213977f, 0.214697f, 0.215418f,
0.216138f, 0.216859f, 0.217579f, 0.218300f, 0.219020f, 0.219741f,
0.220461f, 0.221182f, 0.221902f, 0.222622f, 0.223343f, 0.224063f,
0.224784f, 0.225504f, 0.226225f, 0.226945f, 0.227666f, 0.228386f,
0.229107f, 0.229827f, 0.230548f, 0.231268f, 0.231988f, 0.232709f,
0.233429f, 0.234150f, 0.234870f, 0.235591f, 0.236311f, 0.237032f,
0.237752f, 0.238473f, 0.239193f, 0.239914f, 0.240634f, 0.241354f,
0.242075f, 0.242795f, 0.243516f, 0.244236f, 0.244957f, 0.245677f,
0.246398f, 0.247118f, 0.247839f, 0.248559f, 0.249280f, 0.250000f,
0.250720f, 0.251441f, 0.252161f, 0.252882f, 0.253602f, 0.254323f,
0.255043f, 0.255764f, 0.256484f, 0.257205f, 0.257925f, 0.258646f,
0.259366f, 0.260086f, 0.260807f, 0.261527f, 0.262248f, 0.262968f,
0.263689f, 0.264409f, 0.265130f, 0.265850f, 0.266571f, 0.267291f,
0.268012f, 0.268732f, 0.269452f, 0.270173f, 0.270893f, 0.271614f,
0.272334f, 0.273055f, 0.273775f, 0.274496f, 0.275216f, 0.275937f,
0.276657f, 0.277378f, 0.278098f, 0.278818f, 0.279539f, 0.280259f,
0.280980f, 0.281700f, 0.282421f, 0.283141f, 0.283862f, 0.284582f,
0.285303f, 0.286023f, 0.286744f, 0.287464f, 0.288184f, 0.288905f,
0.289625f, 0.290346f, 0.291066f, 0.291787f, 0.292507f, 0.293228f,
0.293948f, 0.294669f, 0.295389f, 0.296109f, 0.296830f, 0.297550f,
0.298271f, 0.298991f, 0.299712f, 0.300432f, 0.301153f, 0.301873f,
0.302594f, 0.303314f, 0.304035f, 0.304755f, 0.305476f, 0.306196f,
0.306916f, 0.307637f, 0.308357f, 0.309078f, 0.309798f, 0.310519f,
0.311239f, 0.311960f, 0.312680f, 0.313401f, 0.314121f, 0.314842f,
0.315562f, 0.316282f, 0.317003f, 0.317723f, 0.318444f, 0.319164f,
0.319885f, 0.320605f, 0.321326f, 0.322046f, 0.322767f, 0.323487f,
0.324207f, 0.324928f, 0.325648f, 0.326369f, 0.327089f, 0.327810f,
0.328530f, 0.329251f, 0.329971f, 0.330692f, 0.331412f, 0.332133f,
0.332853f, 0.333573f, 0.334294f, 0.335014f, 0.335735f, 0.336455f,
0.337176f, 0.337896f, 0.338617f, 0.339337f, 0.340058f, 0.340778f,
0.341499f, 0.342219f, 0.342939f, 0.343660f, 0.344380f, 0.345101f,
0.345821f, 0.346542f, 0.347262f, 0.347983f, 0.348703f, 0.349424f,
0.350144f, 0.350865f, 0.351585f, 0.352305f, 0.353026f, 0.353746f,
0.354467f, 0.355187f, 0.355908f, 0.356628f, 0.357349f, 0.358069f,
0.358790f, 0.359510f, 0.360231f, 0.360951f, 0.361671f, 0.362392f,
0.363112f, 0.363833f, 0.364553f, 0.365274f, 0.365994f, 0.366715f,
0.367435f, 0.368156f, 0.368876f, 0.369597f, 0.370317f, 0.371037f,
0.371758f, 0.372478f, 0.373199f, 0.373919f, 0.374640f, 0.375360f,
0.376081f, 0.376801f, 0.377522f, 0.378242f, 0.378963f, 0.379683f,
0.380403f, 0.381124f, 0.381844f, 0.382565f, 0.383285f, 0.384006f,
0.384726f, 0.385447f, 0.386167f, 0.386888f, 0.387608f, 0.388329f,
0.389049f, 0.389769f, 0.390490f, 0.391210f, 0.391931f, 0.392651f,
0.393372f, 0.394092f, 0.394813f, 0.395533f, 0.396254f, 0.396974f,
0.397695f, 0.398415f, 0.399135f, 0.399856f, 0.400576f, 0.401297f,
0.402017f, 0.402738f, 0.403458f, 0.404179f, 0.404899f, 0.405620f,
0.406340f, 0.407061f, 0.407781f, 0.408501f, 0.409222f, 0.409942f,
0.410663f, 0.411383f, 0.412104f, 0.412824f, 0.413545f, 0.414265f,
0.414986f, 0.415706f, 0.416427f, 0.417147f, 0.417867f, 0.418588f,
0.419308f, 0.420029f, 0.420749f, 0.421470f, 0.422190f, 0.422911f,
0.423631f, 0.424352f, 0.425072f, 0.425793f, 0.426513f, 0.427233f,
0.427954f, 0.428674f, 0.429395f, 0.430115f, 0.430836f, 0.431556f,
0.432277f, 0.432997f, 0.433718f, 0.434438f, 0.435158f, 0.435879f,
0.436599f, 0.437320f, 0.438040f, 0.438761f, 0.439481f, 0.440202f,
0.440922f, 0.441643f, 0.442363f, 0.443084f, 0.443804f, 0.444524f,
0.445245f, 0.445965f, 0.446686f, 0.447406f, 0.448127f, 0.448847f,
0.449568f, 0.450288f, 0.451009f, 0.451729f, 0.452450f, 0.453170f,
0.453891f, 0.454611f, 0.455331f, 0.456052f, 0.456772f, 0.457493f,
0.458213f, 0.458934f, 0.459654f, 0.460375f, 0.461095f, 0.461816f,
0.462536f, 0.463256f, 0.463977f, 0.464697f, 0.465418f, 0.466138f,
0.466859f, 0.467579f, 0.468300f, 0.469020f, 0.469741f, 0.470461f,
0.471182f, 0.471902f, 0.472622f, 0.473343f, 0.474063f, 0.474784f,
0.475504f, 0.476225f, 0.476945f, 0.477666f, 0.478386f, 0.479107f,
0.479827f, 0.480548f, 0.481268f, 0.481988f, 0.482709f, 0.483429f,
0.484150f, 0.484870f, 0.485591f, 0.486311f, 0.487032f, 0.487752f,
0.488473f, 0.489193f, 0.489914f, 0.490634f, 0.491354f, 0.492075f,
0.492795f, 0.493516f, 0.494236f, 0.494957f, 0.495677f, 0.496398f,
0.497118f, 0.497839f, 0.498559f, 0.499280f, 0.500000f, 0.500720f,
0.501441f, 0.502161f, 0.502882f, 0.503602f, 0.504323f, 0.505043f,
0.505764f, 0.506484f, 0.507205f, 0.507925f, 0.508646f, 0.509366f,
0.510086f, 0.510807f, 0.511527f, 0.512248f, 0.512968f, 0.513689f,
0.514409f, 0.515130f, 0.515850f, 0.516571f, 0.517291f, 0.518012f,
0.518732f, 0.519452f, 0.520173f, 0.520893f, 0.521614f, 0.522334f,
0.523055f, 0.523775f, 0.524496f, 0.525216f, 0.525937f, 0.526657f,
0.527378f, 0.528098f, 0.528818f, 0.529539f, 0.530259f, 0.530980f,
0.531700f, 0.532421f, 0.533141f, 0.533862f, 0.534582f, 0.535303f,
0.536023f, 0.536744f, 0.537464f, 0.538184f, 0.538905f, 0.539625f,
0.540346f, 0.541066f, 0.541787f, 0.542507f, 0.543228f, 0.543948f,
0.544669f, 0.545389f, 0.546109f, 0.546830f, 0.547550f, 0.548271f,
0.548991f, 0.549712f, 0.550432f, 0.551153f, 0.551873f, 0.552594f,
0.553314f, 0.554035f, 0.554755f, 0.555476f, 0.556196f, 0.556916f,
0.557637f, 0.558357f, 0.559078f, 0.559798f, 0.560519f, 0.561239f,
0.561960f, 0.562680f, 0.563401f, 0.564121f, 0.564842f, 0.565562f,
0.566282f, 0.567003f, 0.567723f, 0.568444f, 0.569164f, 0.569885f,
0.570605f, 0.571326f, 0.572046f, 0.572767f, 0.573487f, 0.574207f,
0.574928f, 0.575648f, 0.576369f, 0.577089f, 0.577810f, 0.578530f,
0.579251f, 0.579971f, 0.580692f, 0.581412f, 0.582133f, 0.582853f,
0.583573f, 0.584294f, 0.585014f, 0.585735f, 0.586455f, 0.587176f,
0.587896f, 0.588617f, 0.589337f, 0.590058f, 0.590778f, 0.591499f,
0.592219f, 0.592939f, 0.593660f, 0.594380f, 0.595101f, 0.595821f,
0.596542f, 0.597262f, 0.597983f, 0.598703f, 0.599424f, 0.600144f,
0.600865f, 0.601585f, 0.602305f, 0.603026f, 0.603746f, 0.604467f,
0.605187f, 0.605908f, 0.606628f, 0.607349f, 0.608069f, 0.608790f,
0.609510f, 0.610231f, 0.610951f, 0.611671f, 0.612392f, 0.613112f,
0.613833f, 0.614553f, 0.615274f, 0.615994f, 0.616715f, 0.617435f,
0.618156f, 0.618876f, 0.619597f, 0.620317f, 0.621037f, 0.621758f,
0.622478f, 0.623199f, 0.623919f, 0.624640f, 0.625360f, 0.626081f,
0.626801f, 0.627522f, 0.628242f, 0.628963f, 0.629683f, 0.630403f,
0.631124f, 0.631844f, 0.632565f, 0.633285f, 0.634006f, 0.634726f,
0.635447f, 0.636167f, 0.636888f, 0.637608f, 0.638329f, 0.639049f,
0.639769f, 0.640490f, 0.641210f, 0.641931f, 0.642651f, 0.643372f,
0.644092f, 0.644813f, 0.645533f, 0.646254f, 0.646974f, 0.647695f,
0.648415f, 0.649135f, 0.649856f, 0.650576f, 0.651297f, 0.652017f,
0.652738f, 0.653458f, 0.654179f, 0.654899f, 0.655620f, 0.656340f,
0.657061f, 0.657781f, 0.658501f, 0.659222f, 0.659942f, 0.660663f,
0.661383f, 0.662104f, 0.662824f, 0.663545f, 0.664265f, 0.664986f,
0.665706f, 0.666427f, 0.667147f, 0.667867f, 0.668588f, 0.669308f,
0.670029f, 0.670749f, 0.671470f, 0.672190f, 0.672911f, 0.673631f,
0.674352f, 0.675072f, 0.675793f, 0.676513f, 0.677233f, 0.677954f,
0.678674f, 0.679395f, 0.680115f, 0.680836f, 0.681556f, 0.682277f,
0.682997f, 0.683718f, 0.684438f, 0.685158f, 0.685879f, 0.686599f,
0.687320f, 0.688040f, 0.688761f, 0.689481f, 0.690202f, 0.690922f,
0.691643f, 0.692363f, 0.693084f, 0.693804f, 0.694524f, 0.695245f,
0.695965f, 0.696686f, 0.697406f, 0.698127f, 0.698847f, 0.699568f,
0.700288f, 0.701009f, 0.701729f, 0.702450f, 0.703170f, 0.703891f,
0.704611f, 0.705331f, 0.706052f, 0.706772f, 0.707493f, 0.708213f,
0.708934f, 0.709654f, 0.710375f, 0.711095f, 0.711816f, 0.712536f,
0.713256f, 0.713977f, 0.714697f, 0.715418f, 0.716138f, 0.716859f,
0.717579f, 0.718300f, 0.719020f, 0.719741f, 0.720461f, 0.721182f,
0.721902f, 0.722622f, 0.723343f, 0.724063f, 0.724784f, 0.725504f,
0.726225f, 0.726945f, 0.727666f, 0.728386f, 0.729107f, 0.729827f,
0.730548f, 0.731268f, 0.731988f, 0.732709f, 0.733429f, 0.734150f,
0.734870f, 0.735591f, 0.736311f, 0.737032f, 0.737752f, 0.738473f,
0.739193f, 0.739914f, 0.740634f, 0.741354f, 0.742075f, 0.742795f,
0.743516f, 0.744236f, 0.744957f, 0.745677f, 0.746398f, 0.747118f,
0.747839f, 0.748559f, 0.749280f, 0.750000f, 0.750720f, 0.751441f,
0.752161f, 0.752882f, 0.753602f, 0.754323f, 0.755043f, 0.755764f,
0.756484f, 0.757205f, 0.757925f, 0.758646f, 0.759366f, 0.760086f,
0.760807f, 0.761527f, 0.762248f, 0.762968f, 0.763689f, 0.764409f,
0.765130f, 0.765850f, 0.766571f, 0.767291f, 0.768012f, 0.768732f,
0.769452f, 0.770173f, 0.770893f, 0.771614f, 0.772334f, 0.773055f,
0.773775f, 0.774496f, 0.775216f, 0.775937f, 0.776657f, 0.777378f,
0.778098f, 0.778818f, 0.779539f, 0.780259f, 0.780980f, 0.781700f,
0.782421f, 0.783141f, 0.783862f, 0.784582f, 0.785303f, 0.786023f,
0.786744f, 0.787464f, 0.788184f, 0.788905f, 0.789625f, 0.790346f,
0.791066f, 0.791787f, 0.792507f, 0.793228f, 0.793948f, 0.794669f,
0.795389f, 0.796109f, 0.796830f, 0.797550f, 0.798271f, 0.798991f,
0.799712f, 0.800432f, 0.801153f, 0.801873f, 0.802594f, 0.803314f,
0.804035f, 0.804755f, 0.805476f, 0.806196f, 0.806916f, 0.807637f,
0.808357f, 0.809078f, 0.809798f, 0.810519f, 0.811239f, 0.811960f,
0.812680f, 0.813401f, 0.814121f, 0.814842f, 0.815562f, 0.816282f,
0.817003f, 0.817723f, 0.818444f, 0.819164f, 0.819885f, 0.820605f,
0.821326f, 0.822046f, 0.822767f, 0.823487f, 0.824207f, 0.824928f,
0.825648f, 0.826369f, 0.827089f, 0.827810f, 0.828530f, 0.829251f,
0.829971f, 0.830692f, 0.831412f, 0.832133f, 0.832853f, 0.833573f,
0.834294f, 0.835014f, 0.835735f, 0.836455f, 0.837176f, 0.837896f,
0.838617f, 0.839337f, 0.840058f, 0.840778f, 0.841499f, 0.842219f,
0.842939f, 0.843660f, 0.844380f, 0.845101f, 0.845821f, 0.846542f,
0.847262f, 0.847983f, 0.848703f, 0.849424f, 0.850144f, 0.850865f,
0.851585f, 0.852305f, 0.853026f, 0.853746f, 0.854467f, 0.855187f,
0.855908f, 0.856628f, 0.857349f, 0.858069f, 0.858790f, 0.859510f,
0.860231f, 0.860951f, 0.861671f, 0.862392f, 0.863112f, 0.863833f,
0.864553f, 0.865274f, 0.865994f, 0.866715f, 0.867435f, 0.868156f,
0.868876f, 0.869597f, 0.870317f, 0.871037f, 0.871758f, 0.872478f,
0.873199f, 0.873919f, 0.874640f, 0.875360f, 0.876081f, 0.876801f,
0.877522f, 0.878242f, 0.878963f, 0.879683f, 0.880403f, 0.881124f,
0.881844f, 0.882565f, 0.883285f, 0.884006f, 0.884726f, 0.885447f,
0.886167f, 0.886888f, 0.887608f, 0.888329f, 0.889049f, 0.889769f,
0.890490f, 0.891210f, 0.891931f, 0.892651f, 0.893372f, 0.894092f,
0.894813f, 0.895533f, 0.896254f, 0.896974f, 0.897695f, 0.898415f,
0.899135f, 0.899856f, 0.900576f, 0.901297f, 0.902017f, 0.902738f,
0.903458f, 0.904179f, 0.904899f, 0.905620f, 0.906340f, 0.907061f,
0.907781f, 0.908501f, 0.909222f, 0.909942f, 0.910663f, 0.911383f,
0.912104f, 0.912824f, 0.913545f, 0.914265f, 0.914986f, 0.915706f,
0.916427f, 0.917147f, 0.917867f, 0.918588f, 0.919308f, 0.920029f,
0.920749f, 0.921470f, 0.922190f, 0.922911f, 0.923631f, 0.924352f,
0.925072f, 0.925793f, 0.926513f, 0.927233f, 0.927954f, 0.928674f,
0.929395f, 0.930115f, 0.930836f, 0.931556f, 0.932277f, 0.932997f,
0.933718f, 0.934438f, 0.935158f, 0.935879f, 0.936599f, 0.937320f,
0.938040f, 0.938761f, 0.939481f, 0.940202f, 0.940922f, 0.941643f,
0.942363f, 0.943084f, 0.943804f, 0.944524f, 0.945245f, 0.945965f,
0.946686f, 0.947406f, 0.948127f, 0.948847f, 0.949568f, 0.950288f,
0.951009f, 0.951729f, 0.952450f, 0.953170f, 0.953891f, 0.954611f,
0.955331f, 0.956052f, 0.956772f, 0.957493f, 0.958213f, 0.958934f,
0.959654f, 0.960375f, 0.961095f, 0.961816f, 0.962536f, 0.963256f,
0.963977f, 0.964697f, 0.965418f, 0.966138f, 0.966859f, 0.967579f,
0.968300f, 0.969020f, 0.969741f, 0.970461f, 0.971182f, 0.971902f,
0.972622f, 0.973343f, 0.974063f, 0.974784f, 0.975504f, 0.976225f,
0.976945f, 0.977666f, 0.978386f, 0.979107f, 0.979827f, 0.980548f,
0.981268f, 0.981988f, 0.982709f, 0.983429f, 0.984150f, 0.984870f,
0.985591f, 0.986311f, 0.987032f, 0.987752f, 0.988473f, 0.989193f,
0.989914f, 0.990634f, 0.991354f, 0.992075f, 0.992795f, 0.993516f,
0.994236f, 0.994957f, 0.995677f, 0.996398f, 0.997118f, 0.997839f,
0.998559f, 0.999280f, 1.000000f
};
CacheView
*image_view;
const char
*artifact;
IlluminantType
illuminant = D65Illuminant;
MagickBooleanType
status;
MagickOffsetType
progress;
ssize_t
i;
ssize_t
y;
TransformPacket
*y_map,
*x_map,
*z_map;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
artifact=GetImageArtifact(image,"color:illuminant");
if (artifact != (const char *) NULL)
{
illuminant=(IlluminantType) ParseCommandOption(MagickIlluminantOptions,
MagickFalse,artifact);
if ((ssize_t) illuminant < 0)
illuminant=UndefinedIlluminant;
}
status=MagickTrue;
progress=0;
switch (image->colorspace)
{
case CMYKColorspace:
{
PixelInfo
zero;
/*
Transform image from CMYK to sRGB.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
GetPixelInfo(image,&zero);
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
PixelInfo
pixel;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
pixel=zero;
for (x=0; x < (ssize_t) image->columns; x++)
{
GetPixelInfoPixel(image,q,&pixel);
ConvertCMYKToRGB(&pixel);
SetPixelViaPixelInfo(image,&pixel,q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case LinearGRAYColorspace:
{
/*
Transform linear GRAY to sRGB colorspace.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=(ssize_t) image->columns; x != 0; x--)
{
MagickRealType
gray;
gray=0.212656*EncodePixelGamma(GetPixelRed(image,q))+0.715158*
EncodePixelGamma(GetPixelGreen(image,q))+0.072186*
EncodePixelGamma(GetPixelBlue(image,q));
SetPixelRed(image,ClampToQuantum(gray),q);
SetPixelGreen(image,ClampToQuantum(gray),q);
SetPixelBlue(image,ClampToQuantum(gray),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case GRAYColorspace:
{
/*
Transform linear GRAY to sRGB colorspace.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=(ssize_t) image->columns; x != 0; x--)
{
MagickRealType
gray;
gray=0.212656*GetPixelRed(image,q)+0.715158*GetPixelGreen(image,q)+
0.072186*GetPixelBlue(image,q);
SetPixelRed(image,ClampToQuantum(gray),q);
SetPixelGreen(image,ClampToQuantum(gray),q);
SetPixelBlue(image,ClampToQuantum(gray),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case Adobe98Colorspace:
case CMYColorspace:
case DisplayP3Colorspace:
case HCLColorspace:
case HCLpColorspace:
case HSBColorspace:
case HSIColorspace:
case HSLColorspace:
case HSVColorspace:
case HWBColorspace:
case JzazbzColorspace:
case LabColorspace:
case LCHColorspace:
case LCHabColorspace:
case LCHuvColorspace:
case LMSColorspace:
case LuvColorspace:
case ProPhotoColorspace:
case xyYColorspace:
case XYZColorspace:
case YCbCrColorspace:
case YDbDrColorspace:
case YIQColorspace:
case YPbPrColorspace:
case YUVColorspace:
{
const char
*value;
double
white_luminance;
/*
Transform image from source colorspace to sRGB.
*/
white_luminance=10000.0;
value=GetImageProperty(image,"white-luminance",exception);
if (value != (const char *) NULL)
white_luminance=StringToDouble(value,(char **) NULL);
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
double
blue,
green,
red,
X,
Y,
Z;
X=QuantumScale*GetPixelRed(image,q);
Y=QuantumScale*GetPixelGreen(image,q);
Z=QuantumScale*GetPixelBlue(image,q);
switch (image->colorspace)
{
case Adobe98Colorspace:
{
ConvertAdobe98ToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case CMYColorspace:
{
ConvertCMYToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case DisplayP3Colorspace:
{
ConvertDisplayP3ToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HCLColorspace:
{
ConvertHCLToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HCLpColorspace:
{
ConvertHCLpToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HSBColorspace:
{
ConvertHSBToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HSIColorspace:
{
ConvertHSIToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HSLColorspace:
{
ConvertHSLToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HSVColorspace:
{
ConvertHSVToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case HWBColorspace:
{
ConvertHWBToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case JzazbzColorspace:
{
ConvertJzazbzToRGB(X,Y,Z,white_luminance,&red,&green,&blue);
break;
}
case LabColorspace:
{
ConvertLabToRGB(X,Y,Z,illuminant,&red,&green,&blue);
break;
}
case LCHColorspace:
case LCHabColorspace:
{
ConvertLCHabToRGB(X,Y,Z,illuminant,&red,&green,&blue);
break;
}
case LCHuvColorspace:
{
ConvertLCHuvToRGB(X,Y,Z,illuminant,&red,&green,&blue);
break;
}
case LMSColorspace:
{
ConvertLMSToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case LuvColorspace:
{
ConvertLuvToRGB(X,Y,Z,illuminant,&red,&green,&blue);
break;
}
case ProPhotoColorspace:
{
ConvertProPhotoToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case xyYColorspace:
{
ConvertxyYToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case XYZColorspace:
{
ConvertXYZToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case YCbCrColorspace:
{
ConvertYCbCrToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case YDbDrColorspace:
{
ConvertYDbDrToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case YIQColorspace:
{
ConvertYIQToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case YPbPrColorspace:
{
ConvertYPbPrToRGB(X,Y,Z,&red,&green,&blue);
break;
}
case YUVColorspace:
{
ConvertYUVToRGB(X,Y,Z,&red,&green,&blue);
break;
}
default:
{
red=QuantumRange*X;
green=QuantumRange*Y;
blue=QuantumRange*Z;
break;
}
}
SetPixelRed(image,ClampToQuantum(red),q);
SetPixelGreen(image,ClampToQuantum(green),q);
SetPixelBlue(image,ClampToQuantum(blue),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case LogColorspace:
{
const char
*value;
double
black,
density,
film_gamma,
gamma,
reference_black,
reference_white;
Quantum
*logmap;
/*
Transform Log to sRGB colorspace.
*/
density=DisplayGamma;
gamma=DisplayGamma;
value=GetImageProperty(image,"gamma",exception);
if (value != (const char *) NULL)
gamma=PerceptibleReciprocal(StringToDouble(value,(char **) NULL));
film_gamma=FilmGamma;
value=GetImageProperty(image,"film-gamma",exception);
if (value != (const char *) NULL)
film_gamma=StringToDouble(value,(char **) NULL);
reference_black=ReferenceBlack;
value=GetImageProperty(image,"reference-black",exception);
if (value != (const char *) NULL)
reference_black=StringToDouble(value,(char **) NULL);
reference_white=ReferenceWhite;
value=GetImageProperty(image,"reference-white",exception);
if (value != (const char *) NULL)
reference_white=StringToDouble(value,(char **) NULL);
logmap=(Quantum *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*logmap));
if (logmap == (Quantum *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
black=pow(10.0,(reference_black-reference_white)*(gamma/density)*0.002*
PerceptibleReciprocal(film_gamma));
for (i=0; i <= (ssize_t) (reference_black*MaxMap/1024.0); i++)
logmap[i]=(Quantum) 0;
for ( ; i < (ssize_t) (reference_white*MaxMap/1024.0); i++)
logmap[i]=ClampToQuantum(QuantumRange/(1.0-black)*
(pow(10.0,(1024.0*i/MaxMap-reference_white)*(gamma/density)*0.002*
PerceptibleReciprocal(film_gamma))-black));
for ( ; i <= (ssize_t) MaxMap; i++)
logmap[i]=QuantumRange;
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=(ssize_t) image->columns; x != 0; x--)
{
double
blue,
green,
red;
red=(double) logmap[ScaleQuantumToMap(GetPixelRed(image,q))];
green=(double) logmap[ScaleQuantumToMap(GetPixelGreen(image,q))];
blue=(double) logmap[ScaleQuantumToMap(GetPixelBlue(image,q))];
SetPixelRed(image,ClampToQuantum(EncodePixelGamma((MagickRealType)
red)),q);
SetPixelGreen(image,ClampToQuantum(EncodePixelGamma((MagickRealType)
green)),q);
SetPixelBlue(image,ClampToQuantum(EncodePixelGamma((MagickRealType)
blue)),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
logmap=(Quantum *) RelinquishMagickMemory(logmap);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
case RGBColorspace:
case scRGBColorspace:
{
/*
Transform linear RGB to sRGB colorspace.
*/
if (image->storage_class == PseudoClass)
{
if (SyncImage(image,exception) == MagickFalse)
return(MagickFalse);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
}
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=(ssize_t) image->columns; x != 0; x--)
{
double
blue,
green,
red;
red=EncodePixelGamma((MagickRealType) GetPixelRed(image,q));
green=EncodePixelGamma((MagickRealType) GetPixelGreen(image,q));
blue=EncodePixelGamma((MagickRealType) GetPixelBlue(image,q));
SetPixelRed(image,ClampToQuantum(red),q);
SetPixelGreen(image,ClampToQuantum(green),q);
SetPixelBlue(image,ClampToQuantum(blue),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(status);
}
default:
break;
}
/*
Allocate the tables.
*/
x_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*x_map));
y_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*y_map));
z_map=(TransformPacket *) AcquireQuantumMemory((size_t) MaxMap+1UL,
sizeof(*z_map));
if ((x_map == (TransformPacket *) NULL) ||
(y_map == (TransformPacket *) NULL) ||
(z_map == (TransformPacket *) NULL))
{
if (z_map != (TransformPacket *) NULL)
z_map=(TransformPacket *) RelinquishMagickMemory(z_map);
if (y_map != (TransformPacket *) NULL)
y_map=(TransformPacket *) RelinquishMagickMemory(y_map);
if (x_map != (TransformPacket *) NULL)
x_map=(TransformPacket *) RelinquishMagickMemory(x_map);
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
}
switch (image->colorspace)
{
case OHTAColorspace:
{
/*
Initialize OHTA tables:
I1 = 0.33333*R+0.33334*G+0.33333*B
I2 = 0.50000*R+0.00000*G-0.50000*B
I3 =-0.25000*R+0.50000*G-0.25000*B
R = I1+1.00000*I2-0.66668*I3
G = I1+0.00000*I2+1.33333*I3
B = I1-1.00000*I2-0.66668*I3
I and Q, normally -0.5 through 0.5, must be normalized to the range 0
through QuantumRange.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (1.0*(double) i);
y_map[i].x=(MagickRealType) (0.5*1.00000*(2.0*(double) i-MaxMap));
z_map[i].x=(MagickRealType) (-0.5*0.66668*(2.0*(double) i-MaxMap));
x_map[i].y=(MagickRealType) (1.0*(double) i);
y_map[i].y=(MagickRealType) (0.5*0.00000*(2.0*(double) i-MaxMap));
z_map[i].y=(MagickRealType) (0.5*1.33333*(2.0*(double) i-MaxMap));
x_map[i].z=(MagickRealType) (1.0*(double) i);
y_map[i].z=(MagickRealType) (-0.5*1.00000*(2.0*(double) i-MaxMap));
z_map[i].z=(MagickRealType) (-0.5*0.66668*(2.0*(double) i-MaxMap));
}
break;
}
case Rec601YCbCrColorspace:
{
/*
Initialize YCbCr tables:
R = Y +1.402000*Cr
G = Y-0.344136*Cb-0.714136*Cr
B = Y+1.772000*Cb
Cb and Cr, normally -0.5 through 0.5, must be normalized to the range 0
through QuantumRange.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=0.99999999999914679361*(double) i;
y_map[i].x=0.5*(-1.2188941887145875e-06)*(2.00*(double) i-MaxMap);
z_map[i].x=0.5*1.4019995886561440468*(2.00*(double) i-MaxMap);
x_map[i].y=0.99999975910502514331*(double) i;
y_map[i].y=0.5*(-0.34413567816504303521)*(2.00*(double) i-MaxMap);
z_map[i].y=0.5*(-0.71413649331646789076)*(2.00*(double) i-MaxMap);
x_map[i].z=1.00000124040004623180*(double) i;
y_map[i].z=0.5*1.77200006607230409200*(2.00*(double) i-MaxMap);
z_map[i].z=0.5*2.1453384174593273e-06*(2.00*(double) i-MaxMap);
}
break;
}
case Rec709YCbCrColorspace:
{
/*
Initialize YCbCr tables:
R = Y +1.574800*Cr
G = Y-0.187324*Cb-0.468124*Cr
B = Y+1.855600*Cb
Cb and Cr, normally -0.5 through 0.5, must be normalized to the range 0
through QuantumRange.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (1.0*i);
y_map[i].x=(MagickRealType) (0.5*0.000000*(2.0*i-MaxMap));
z_map[i].x=(MagickRealType) (0.5*1.574800*(2.0*i-MaxMap));
x_map[i].y=(MagickRealType) (1.0*i);
y_map[i].y=(MagickRealType) (0.5*(-0.187324)*(2.0*i-MaxMap));
z_map[i].y=(MagickRealType) (0.5*(-0.468124)*(2.0*i-MaxMap));
x_map[i].z=(MagickRealType) (1.0*i);
y_map[i].z=(MagickRealType) (0.5*1.855600*(2.0*i-MaxMap));
z_map[i].z=(MagickRealType) (0.5*0.000000*(2.0*i-MaxMap));
}
break;
}
case YCCColorspace:
{
/*
Initialize YCC tables:
R = Y +1.340762*C2
G = Y-0.317038*C1-0.682243*C2
B = Y+1.632639*C1
YCC is scaled by 1.3584. C1 zero is 156 and C2 is at 137.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (1.3584000*(double) i);
y_map[i].x=(MagickRealType) 0.0000000;
z_map[i].x=(MagickRealType) (1.8215000*(1.0*(double) i-(double)
ScaleQuantumToMap(ScaleCharToQuantum(137))));
x_map[i].y=(MagickRealType) (1.3584000*(double) i);
y_map[i].y=(MagickRealType) (-0.4302726*(1.0*(double) i-(double)
ScaleQuantumToMap(ScaleCharToQuantum(156))));
z_map[i].y=(MagickRealType) (-0.9271435*(1.0*(double) i-(double)
ScaleQuantumToMap(ScaleCharToQuantum(137))));
x_map[i].z=(MagickRealType) (1.3584000*(double) i);
y_map[i].z=(MagickRealType) (2.2179000*(1.0*(double) i-(double)
ScaleQuantumToMap(ScaleCharToQuantum(156))));
z_map[i].z=(MagickRealType) 0.0000000;
}
break;
}
default:
{
/*
Linear conversion tables.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static)
#endif
for (i=0; i <= (ssize_t) MaxMap; i++)
{
x_map[i].x=(MagickRealType) (1.0*(double) i);
y_map[i].x=(MagickRealType) 0.0;
z_map[i].x=(MagickRealType) 0.0;
x_map[i].y=(MagickRealType) 0.0;
y_map[i].y=(MagickRealType) (1.0*(double) i);
z_map[i].y=(MagickRealType) 0.0;
x_map[i].z=(MagickRealType) 0.0;
y_map[i].z=(MagickRealType) 0.0;
z_map[i].z=(MagickRealType) (1.0*(double) i);
}
break;
}
}
/*
Convert to sRGB.
*/
switch (image->storage_class)
{
case DirectClass:
default:
{
/*
Convert DirectClass image.
*/
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
PixelInfo
pixel;
ssize_t
x;
Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
size_t
blue,
green,
red;
red=ScaleQuantumToMap(GetPixelRed(image,q));
green=ScaleQuantumToMap(GetPixelGreen(image,q));
blue=ScaleQuantumToMap(GetPixelBlue(image,q));
pixel.red=x_map[red].x+y_map[green].x+z_map[blue].x;
pixel.green=x_map[red].y+y_map[green].y+z_map[blue].y;
pixel.blue=x_map[red].z+y_map[green].z+z_map[blue].z;
if (image->colorspace == YCCColorspace)
{
pixel.red=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.red/
(double) MaxMap)];
pixel.green=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.green/
(double) MaxMap)];
pixel.blue=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.blue/
(double) MaxMap)];
}
else
{
pixel.red=(MagickRealType) ScaleMapToQuantum(pixel.red);
pixel.green=(MagickRealType) ScaleMapToQuantum(pixel.green);
pixel.blue=(MagickRealType) ScaleMapToQuantum(pixel.blue);
}
SetPixelRed(image,ClampToQuantum(pixel.red),q);
SetPixelGreen(image,ClampToQuantum(pixel.green),q);
SetPixelBlue(image,ClampToQuantum(pixel.blue),q);
q+=GetPixelChannels(image);
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp atomic
#endif
progress++;
proceed=SetImageProgress(image,TransformsRGBImageTag,progress,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
break;
}
case PseudoClass:
{
/*
Convert PseudoClass image.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (i=0; i < (ssize_t) image->colors; i++)
{
PixelInfo
pixel;
size_t
blue,
green,
red;
red=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].red));
green=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].green));
blue=ScaleQuantumToMap(ClampToQuantum(image->colormap[i].blue));
pixel.red=x_map[red].x+y_map[green].x+z_map[blue].x;
pixel.green=x_map[red].y+y_map[green].y+z_map[blue].y;
pixel.blue=x_map[red].z+y_map[green].z+z_map[blue].z;
if (image->colorspace == YCCColorspace)
{
pixel.red=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.red/
(double) MaxMap)];
pixel.green=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.green/
(double) MaxMap)];
pixel.blue=QuantumRange*YCCMap[RoundToYCC(1024.0*pixel.blue/
(double) MaxMap)];
}
else
{
pixel.red=(MagickRealType) ScaleMapToQuantum(pixel.red);
pixel.green=(MagickRealType) ScaleMapToQuantum(pixel.green);
pixel.blue=(MagickRealType) ScaleMapToQuantum(pixel.blue);
}
image->colormap[i].red=(double) ClampToQuantum(pixel.red);
image->colormap[i].green=(double) ClampToQuantum(pixel.green);
image->colormap[i].blue=(double) ClampToQuantum(pixel.blue);
}
(void) SyncImage(image,exception);
break;
}
}
/*
Relinquish resources.
*/
z_map=(TransformPacket *) RelinquishMagickMemory(z_map);
y_map=(TransformPacket *) RelinquishMagickMemory(y_map);
x_map=(TransformPacket *) RelinquishMagickMemory(x_map);
if (SetImageColorspace(image,sRGBColorspace,exception) == MagickFalse)
return(MagickFalse);
return(MagickTrue);
}
|
constitute.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% CCCC OOO N N SSSSS TTTTT IIIII TTTTT U U TTTTT EEEEE %
% C O O NN N SS T I T U U T E %
% C O O N N N ESSS T I T U U T EEE %
% C O O N NN SS T I T U U T E %
% CCCC OOO N N SSSSS T IIIII T UUU T EEEEE %
% %
% %
% MagickCore Methods to Consitute an Image %
% %
% Software Design %
% Cristy %
% October 1998 %
% %
% %
% Copyright @ 1999 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% https://imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
*/
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/blob-private.h"
#include "MagickCore/exception.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/cache.h"
#include "MagickCore/client.h"
#include "MagickCore/coder-private.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/constitute.h"
#include "MagickCore/constitute-private.h"
#include "MagickCore/delegate.h"
#include "MagickCore/geometry.h"
#include "MagickCore/identify.h"
#include "MagickCore/image-private.h"
#include "MagickCore/list.h"
#include "MagickCore/magick.h"
#include "MagickCore/memory_.h"
#include "MagickCore/monitor.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/option.h"
#include "MagickCore/pixel.h"
#include "MagickCore/pixel-accessor.h"
#include "MagickCore/policy.h"
#include "MagickCore/profile.h"
#include "MagickCore/profile-private.h"
#include "MagickCore/property.h"
#include "MagickCore/quantum.h"
#include "MagickCore/resize.h"
#include "MagickCore/resource_.h"
#include "MagickCore/semaphore.h"
#include "MagickCore/statistic.h"
#include "MagickCore/stream.h"
#include "MagickCore/string_.h"
#include "MagickCore/string-private.h"
#include "MagickCore/timer.h"
#include "MagickCore/token.h"
#include "MagickCore/transform.h"
#include "MagickCore/utility.h"
#include "MagickCore/utility-private.h"
/*
Typedef declaractions.
*/
typedef struct _ConstituteInfo
{
const char
*caption,
*comment,
*dispose,
*label;
MagickBooleanType
sync_from_exif,
sync_from_tiff;
MagickStatusType
delay_flags;
size_t
delay;
ssize_t
ticks_per_second;
} ConstituteInfo;
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o n s t i t u t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ConstituteImage() returns an image from the pixel data you supply.
% The pixel data must be in scanline order top-to-bottom. The data can be
% char, short int, int, float, or double. Float and double require the
% pixels to be normalized [0..1], otherwise [0..QuantumRange]. For example, to
% create a 640x480 image from unsigned red-green-blue character data, use:
%
% image = ConstituteImage(640,480,"RGB",CharPixel,pixels,&exception);
%
% The format of the ConstituteImage method is:
%
% Image *ConstituteImage(const size_t columns,const size_t rows,
% const char *map,const StorageType storage,const void *pixels,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o columns: width in pixels of the image.
%
% o rows: height in pixels of the image.
%
% o map: This string reflects the expected ordering of the pixel array.
% It can be any combination or order of R = red, G = green, B = blue,
% A = alpha (0 is transparent), O = opacity (0 is opaque), C = cyan,
% Y = yellow, M = magenta, K = black, I = intensity (for grayscale),
% P = pad.
%
% o storage: Define the data type of the pixels. Float and double types are
% expected to be normalized [0..1] otherwise [0..QuantumRange]. Choose
% from these types: CharPixel, DoublePixel, FloatPixel, IntegerPixel,
% LongPixel, QuantumPixel, or ShortPixel.
%
% o pixels: This array of values contain the pixel components as defined by
% map and type. You must preallocate this array where the expected
% length varies depending on the values of width, height, map, and type.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ConstituteImage(const size_t columns,const size_t rows,
const char *map,const StorageType storage,const void *pixels,
ExceptionInfo *exception)
{
Image
*image;
MagickBooleanType
status;
ssize_t
i;
size_t
length;
/*
Allocate image structure.
*/
assert(map != (const char *) NULL);
assert(pixels != (void *) NULL);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",map);
image=AcquireImage((ImageInfo *) NULL,exception);
if (image == (Image *) NULL)
return((Image *) NULL);
switch (storage)
{
case CharPixel: image->depth=8*sizeof(unsigned char); break;
case DoublePixel: image->depth=8*sizeof(double); break;
case FloatPixel: image->depth=8*sizeof(float); break;
case LongPixel: image->depth=8*sizeof(unsigned long); break;
case LongLongPixel: image->depth=8*sizeof(MagickSizeType); break;
case ShortPixel: image->depth=8*sizeof(unsigned short); break;
default: break;
}
length=strlen(map);
for (i=0; i < (ssize_t) length; i++)
{
switch (map[i])
{
case 'a':
case 'A':
case 'O':
case 'o':
{
image->alpha_trait=BlendPixelTrait;
break;
}
case 'C':
case 'c':
case 'm':
case 'M':
case 'Y':
case 'y':
case 'K':
case 'k':
{
image->colorspace=CMYKColorspace;
break;
}
case 'I':
case 'i':
{
image->colorspace=GRAYColorspace;
break;
}
default:
{
if (length == 1)
image->colorspace=GRAYColorspace;
break;
}
}
}
status=SetImageExtent(image,columns,rows,exception);
if (status == MagickFalse)
return(DestroyImageList(image));
status=ResetImagePixels(image,exception);
if (status == MagickFalse)
return(DestroyImageList(image));
status=ImportImagePixels(image,0,0,columns,rows,map,storage,pixels,exception);
if (status == MagickFalse)
image=DestroyImage(image);
return(image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P i n g I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PingImage() returns all the properties of an image or image sequence
% except for the pixels. It is much faster and consumes far less memory
% than ReadImage(). On failure, a NULL image is returned and exception
% describes the reason for the failure.
%
% The format of the PingImage method is:
%
% Image *PingImage(const ImageInfo *image_info,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: Ping the image defined by the file or filename members of
% this structure.
%
% o exception: return any errors or warnings in this structure.
%
*/
#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif
static size_t PingStream(const Image *magick_unused(image),
const void *magick_unused(pixels),const size_t columns)
{
magick_unreferenced(image);
magick_unreferenced(pixels);
return(columns);
}
#if defined(__cplusplus) || defined(c_plusplus)
}
#endif
MagickExport Image *PingImage(const ImageInfo *image_info,
ExceptionInfo *exception)
{
Image
*image;
ImageInfo
*ping_info;
assert(image_info != (ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(exception != (ExceptionInfo *) NULL);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
image_info->filename);
ping_info=CloneImageInfo(image_info);
ping_info->ping=MagickTrue;
image=ReadStream(ping_info,&PingStream,exception);
if (image != (Image *) NULL)
{
ResetTimer(&image->timer);
if (ping_info->verbose != MagickFalse)
(void) IdentifyImage(image,stdout,MagickFalse,exception);
}
ping_info=DestroyImageInfo(ping_info);
return(image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P i n g I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PingImages() pings one or more images and returns them as an image list.
%
% The format of the PingImage method is:
%
% Image *PingImages(ImageInfo *image_info,const char *filename,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
% o filename: the image filename.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *PingImages(ImageInfo *image_info,const char *filename,
ExceptionInfo *exception)
{
char
ping_filename[MagickPathExtent];
Image
*image,
*images;
ImageInfo
*read_info;
/*
Ping image list from a file.
*/
assert(image_info != (ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(exception != (ExceptionInfo *) NULL);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
image_info->filename);
(void) SetImageOption(image_info,"filename",filename);
(void) CopyMagickString(image_info->filename,filename,MagickPathExtent);
(void) InterpretImageFilename(image_info,(Image *) NULL,image_info->filename,
(int) image_info->scene,ping_filename,exception);
if (LocaleCompare(ping_filename,image_info->filename) != 0)
{
ExceptionInfo
*sans;
ssize_t
extent,
scene;
/*
Images of the form image-%d.png[1-5].
*/
read_info=CloneImageInfo(image_info);
sans=AcquireExceptionInfo();
(void) SetImageInfo(read_info,0,sans);
sans=DestroyExceptionInfo(sans);
if (read_info->number_scenes == 0)
{
read_info=DestroyImageInfo(read_info);
return(PingImage(image_info,exception));
}
(void) CopyMagickString(ping_filename,read_info->filename,
MagickPathExtent);
images=NewImageList();
extent=(ssize_t) (read_info->scene+read_info->number_scenes);
for (scene=(ssize_t) read_info->scene; scene < (ssize_t) extent; scene++)
{
(void) InterpretImageFilename(image_info,(Image *) NULL,ping_filename,
(int) scene,read_info->filename,exception);
image=PingImage(read_info,exception);
if (image == (Image *) NULL)
continue;
AppendImageToList(&images,image);
}
read_info=DestroyImageInfo(read_info);
return(images);
}
return(PingImage(image_info,exception));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e a d I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ReadImage() reads an image or image sequence from a file or file handle.
% The method returns a NULL if there is a memory shortage or if the image
% cannot be read. On failure, a NULL image is returned and exception
% describes the reason for the failure.
%
% The format of the ReadImage method is:
%
% Image *ReadImage(const ImageInfo *image_info,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: Read the image defined by the file or filename members of
% this structure.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType IsCoderAuthorized(const char *coder,
const PolicyRights rights,ExceptionInfo *exception)
{
if (IsRightsAuthorized(CoderPolicyDomain,rights,coder) == MagickFalse)
{
errno=EPERM;
(void) ThrowMagickException(exception,GetMagickModule(),PolicyError,
"NotAuthorized","`%s'",coder);
return(MagickFalse);
}
return(MagickTrue);
}
static void InitializeConstituteInfo(const ImageInfo *image_info,
ConstituteInfo *constitute_info)
{
const char
*option;
memset(constitute_info,0,sizeof(*constitute_info));
constitute_info->sync_from_exif=MagickTrue;
constitute_info->sync_from_tiff=MagickTrue;
option=GetImageOption(image_info,"exif:sync-image");
if (IsStringFalse(option) != MagickFalse)
constitute_info->sync_from_exif=MagickFalse;
option=GetImageOption(image_info,"tiff:sync-image");
if (IsStringFalse(option) != MagickFalse)
constitute_info->sync_from_tiff=MagickFalse;
constitute_info->caption=GetImageOption(image_info,"caption");
constitute_info->comment=GetImageOption(image_info,"comment");
constitute_info->label=GetImageOption(image_info,"label");
option=GetImageOption(image_info,"delay");
if (option != (const char *) NULL)
{
GeometryInfo
geometry_info;
constitute_info->delay_flags=ParseGeometry(option,&geometry_info);
if (constitute_info->delay_flags != NoValue)
{
constitute_info->delay=floor(geometry_info.rho+0.5);
if ((constitute_info->delay_flags & SigmaValue) != 0)
constitute_info->ticks_per_second=CastDoubleToLong(floor(
geometry_info.sigma+0.5));
}
}
}
static void SyncOrientationFromProperties(Image *image,
ConstituteInfo *constitute_info,ExceptionInfo *exception)
{
const char
*orientation;
orientation=(const char *) NULL;
if (constitute_info->sync_from_exif != MagickFalse)
{
orientation=GetImageProperty(image,"exif:Orientation",exception);
if (orientation != (const char *) NULL)
{
image->orientation=(OrientationType) StringToLong(orientation);
(void) DeleteImageProperty(image,"exif:Orientation");
}
}
if ((orientation == (const char *) NULL) &&
(constitute_info->sync_from_tiff != MagickFalse))
{
orientation=GetImageProperty(image,"tiff:Orientation",exception);
if (orientation != (const char *) NULL)
{
image->orientation=(OrientationType) StringToLong(orientation);
(void) DeleteImageProperty(image,"tiff:Orientation");
}
}
}
static void SyncResolutionFromProperties(Image *image,
ConstituteInfo *constitute_info, ExceptionInfo *exception)
{
const char
*resolution_x,
*resolution_y,
*resolution_units;
MagickBooleanType
used_tiff;
resolution_x=(const char *) NULL;
resolution_y=(const char *) NULL;
resolution_units=(const char *) NULL;
used_tiff=MagickFalse;
if (constitute_info->sync_from_exif != MagickFalse)
{
resolution_x=GetImageProperty(image,"exif:XResolution",exception);
resolution_y=GetImageProperty(image,"exif:YResolution",exception);
if ((resolution_x != (const char *) NULL) &&
(resolution_y != (const char *) NULL))
resolution_units=GetImageProperty(image,"exif:ResolutionUnit",
exception);
}
if ((resolution_x == (const char *) NULL) &&
(resolution_y == (const char *) NULL) &&
(constitute_info->sync_from_tiff != MagickFalse))
{
resolution_x=GetImageProperty(image,"tiff:XResolution",exception);
resolution_y=GetImageProperty(image,"tiff:YResolution",exception);
if ((resolution_x != (const char *) NULL) &&
(resolution_y != (const char *) NULL))
{
used_tiff=MagickTrue;
resolution_units=GetImageProperty(image,"tiff:ResolutionUnit",
exception);
}
}
if ((resolution_x != (const char *) NULL) &&
(resolution_y != (const char *) NULL))
{
GeometryInfo
geometry_info;
ssize_t
option_type;
geometry_info.rho=image->resolution.x;
geometry_info.sigma=1.0;
(void) ParseGeometry(resolution_x,&geometry_info);
if (geometry_info.sigma != 0)
image->resolution.x=geometry_info.rho/geometry_info.sigma;
if (strchr(resolution_x,',') != (char *) NULL)
image->resolution.x=geometry_info.rho+geometry_info.sigma/1000.0;
geometry_info.rho=image->resolution.y;
geometry_info.sigma=1.0;
(void) ParseGeometry(resolution_y,&geometry_info);
if (geometry_info.sigma != 0)
image->resolution.y=geometry_info.rho/geometry_info.sigma;
if (strchr(resolution_y,',') != (char *) NULL)
image->resolution.y=geometry_info.rho+geometry_info.sigma/1000.0;
if (resolution_units != (char *) NULL)
{
option_type=ParseCommandOption(MagickResolutionOptions,MagickFalse,
resolution_units);
if (option_type >= 0)
image->units=(ResolutionType) option_type;
}
if (used_tiff == MagickFalse)
{
(void) DeleteImageProperty(image,"exif:XResolution");
(void) DeleteImageProperty(image,"exif:YResolution");
(void) DeleteImageProperty(image,"exif:ResolutionUnit");
}
else
{
(void) DeleteImageProperty(image,"tiff:XResolution");
(void) DeleteImageProperty(image,"tiff:YResolution");
(void) DeleteImageProperty(image,"tiff:ResolutionUnit");
}
}
}
MagickExport Image *ReadImage(const ImageInfo *image_info,
ExceptionInfo *exception)
{
char
filename[MagickPathExtent],
magick[MagickPathExtent],
magick_filename[MagickPathExtent];
ConstituteInfo
constitute_info;
const DelegateInfo
*delegate_info;
const MagickInfo
*magick_info;
DecodeImageHandler
*decoder;
ExceptionInfo
*sans_exception;
Image
*image,
*next;
ImageInfo
*read_info;
MagickBooleanType
status;
/*
Determine image type from filename prefix or suffix (e.g. image.jpg).
*/
assert(image_info != (ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(image_info->filename != (char *) NULL);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
image_info->filename);
assert(exception != (ExceptionInfo *) NULL);
read_info=CloneImageInfo(image_info);
(void) CopyMagickString(magick_filename,read_info->filename,MagickPathExtent);
(void) SetImageInfo(read_info,0,exception);
(void) CopyMagickString(filename,read_info->filename,MagickPathExtent);
(void) CopyMagickString(magick,read_info->magick,MagickPathExtent);
/*
Call appropriate image reader based on image type.
*/
sans_exception=AcquireExceptionInfo();
magick_info=GetMagickInfo(read_info->magick,sans_exception);
if (sans_exception->severity == PolicyError)
InheritException(exception,sans_exception);
sans_exception=DestroyExceptionInfo(sans_exception);
if (magick_info != (const MagickInfo *) NULL)
{
if (GetMagickEndianSupport(magick_info) == MagickFalse)
read_info->endian=UndefinedEndian;
else
if ((image_info->endian == UndefinedEndian) &&
(GetMagickRawSupport(magick_info) != MagickFalse))
{
unsigned long
lsb_first;
lsb_first=1;
read_info->endian=(*(char *) &lsb_first) == 1 ? LSBEndian :
MSBEndian;
}
}
if ((magick_info != (const MagickInfo *) NULL) &&
(GetMagickDecoderSeekableStream(magick_info) != MagickFalse))
{
image=AcquireImage(read_info,exception);
(void) CopyMagickString(image->filename,read_info->filename,
MagickPathExtent);
status=OpenBlob(image_info,image,ReadBinaryBlobMode,exception);
if (status == MagickFalse)
{
read_info=DestroyImageInfo(read_info);
image=DestroyImage(image);
return((Image *) NULL);
}
if (IsBlobSeekable(image) == MagickFalse)
{
/*
Coder requires a seekable stream.
*/
*read_info->filename='\0';
status=ImageToFile(image,read_info->filename,exception);
if (status == MagickFalse)
{
(void) CloseBlob(image);
read_info=DestroyImageInfo(read_info);
image=DestroyImage(image);
return((Image *) NULL);
}
read_info->temporary=MagickTrue;
}
(void) CloseBlob(image);
image=DestroyImage(image);
}
image=NewImageList();
decoder=GetImageDecoder(magick_info);
if (decoder == (DecodeImageHandler *) NULL)
{
delegate_info=GetDelegateInfo(read_info->magick,(char *) NULL,exception);
if (delegate_info == (const DelegateInfo *) NULL)
{
(void) SetImageInfo(read_info,0,exception);
(void) CopyMagickString(read_info->filename,filename,
MagickPathExtent);
magick_info=GetMagickInfo(read_info->magick,exception);
decoder=GetImageDecoder(magick_info);
}
}
if (decoder != (DecodeImageHandler *) NULL)
{
/*
Call appropriate image reader based on image type.
*/
if (GetMagickDecoderThreadSupport(magick_info) == MagickFalse)
LockSemaphoreInfo(magick_info->semaphore);
status=IsCoderAuthorized(read_info->magick,ReadPolicyRights,exception);
image=(Image *) NULL;
if (status != MagickFalse)
image=decoder(read_info,exception);
if (GetMagickDecoderThreadSupport(magick_info) == MagickFalse)
UnlockSemaphoreInfo(magick_info->semaphore);
}
else
{
delegate_info=GetDelegateInfo(read_info->magick,(char *) NULL,exception);
if (delegate_info == (const DelegateInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
MissingDelegateError,"NoDecodeDelegateForThisImageFormat","`%s'",
read_info->magick);
if (read_info->temporary != MagickFalse)
(void) RelinquishUniqueFileResource(read_info->filename);
read_info=DestroyImageInfo(read_info);
return((Image *) NULL);
}
/*
Let our decoding delegate process the image.
*/
image=AcquireImage(read_info,exception);
if (image == (Image *) NULL)
{
read_info=DestroyImageInfo(read_info);
return((Image *) NULL);
}
(void) CopyMagickString(image->filename,read_info->filename,
MagickPathExtent);
*read_info->filename='\0';
if (GetDelegateThreadSupport(delegate_info) == MagickFalse)
LockSemaphoreInfo(delegate_info->semaphore);
status=InvokeDelegate(read_info,image,read_info->magick,(char *) NULL,
exception);
if (GetDelegateThreadSupport(delegate_info) == MagickFalse)
UnlockSemaphoreInfo(delegate_info->semaphore);
image=DestroyImageList(image);
read_info->temporary=MagickTrue;
if (status != MagickFalse)
(void) SetImageInfo(read_info,0,exception);
magick_info=GetMagickInfo(read_info->magick,exception);
decoder=GetImageDecoder(magick_info);
if (decoder == (DecodeImageHandler *) NULL)
{
if (IsPathAccessible(read_info->filename) != MagickFalse)
(void) ThrowMagickException(exception,GetMagickModule(),
MissingDelegateError,"NoDecodeDelegateForThisImageFormat","`%s'",
read_info->magick);
else
ThrowFileException(exception,FileOpenError,"UnableToOpenFile",
read_info->filename);
read_info=DestroyImageInfo(read_info);
return((Image *) NULL);
}
/*
Call appropriate image reader based on image type.
*/
if (GetMagickDecoderThreadSupport(magick_info) == MagickFalse)
LockSemaphoreInfo(magick_info->semaphore);
status=IsCoderAuthorized(read_info->magick,ReadPolicyRights,exception);
image=(Image *) NULL;
if (status != MagickFalse)
image=(decoder)(read_info,exception);
if (GetMagickDecoderThreadSupport(magick_info) == MagickFalse)
UnlockSemaphoreInfo(magick_info->semaphore);
}
if (read_info->temporary != MagickFalse)
{
(void) RelinquishUniqueFileResource(read_info->filename);
read_info->temporary=MagickFalse;
if (image != (Image *) NULL)
(void) CopyMagickString(image->filename,filename,MagickPathExtent);
}
if (image == (Image *) NULL)
{
read_info=DestroyImageInfo(read_info);
return(image);
}
if (exception->severity >= ErrorException)
(void) LogMagickEvent(ExceptionEvent,GetMagickModule(),
"Coder (%s) generated an image despite an error (%d), "
"notify the developers",image->magick,exception->severity);
if (IsBlobTemporary(image) != MagickFalse)
(void) RelinquishUniqueFileResource(read_info->filename);
if ((IsSceneGeometry(read_info->scenes,MagickFalse) != MagickFalse) &&
(GetImageListLength(image) != 1))
{
Image
*clones;
clones=CloneImages(image,read_info->scenes,exception);
if (clones != (Image *) NULL)
{
image=DestroyImageList(image);
image=GetFirstImageInList(clones);
}
}
InitializeConstituteInfo(read_info,&constitute_info);
for (next=image; next != (Image *) NULL; next=GetNextImageInList(next))
{
char
magick_path[MagickPathExtent],
*property;
const StringInfo
*profile;
static const char
*source_date_epoch = (const char *) NULL;
static MagickBooleanType
epoch_initalized = MagickFalse;
next->taint=MagickFalse;
GetPathComponent(magick_filename,MagickPath,magick_path);
if ((*magick_path == '\0') && (*next->magick == '\0'))
(void) CopyMagickString(next->magick,magick,MagickPathExtent);
(void) CopyMagickString(next->magick_filename,magick_filename,
MagickPathExtent);
if (IsBlobTemporary(image) != MagickFalse)
(void) CopyMagickString(next->filename,filename,MagickPathExtent);
if (next->magick_columns == 0)
next->magick_columns=next->columns;
if (next->magick_rows == 0)
next->magick_rows=next->rows;
(void) GetImageProperty(next,"exif:*",exception);
(void) GetImageProperty(next,"icc:*",exception);
(void) GetImageProperty(next,"iptc:*",exception);
(void) GetImageProperty(next,"xmp:*",exception);
SyncOrientationFromProperties(next,&constitute_info,exception);
SyncResolutionFromProperties(next,&constitute_info,exception);
if (next->page.width == 0)
next->page.width=next->columns;
if (next->page.height == 0)
next->page.height=next->rows;
if (constitute_info.caption != (const char *) NULL)
{
property=InterpretImageProperties(read_info,next,
constitute_info.caption,exception);
(void) SetImageProperty(next,"caption",property,exception);
property=DestroyString(property);
}
if (constitute_info.comment != (const char *) NULL)
{
property=InterpretImageProperties(read_info,next,
constitute_info.comment,exception);
(void) SetImageProperty(next,"comment",property,exception);
property=DestroyString(property);
}
if (constitute_info.label != (const char *) NULL)
{
property=InterpretImageProperties(read_info,next,
constitute_info.label,exception);
(void) SetImageProperty(next,"label",property,exception);
property=DestroyString(property);
}
if (LocaleCompare(next->magick,"TEXT") == 0)
(void) ParseAbsoluteGeometry("0x0+0+0",&next->page);
if ((read_info->extract != (char *) NULL) &&
(read_info->stream == (StreamHandler) NULL))
{
RectangleInfo
geometry;
MagickStatusType
flags;
SetGeometry(next,&geometry);
flags=ParseAbsoluteGeometry(read_info->extract,&geometry);
if ((next->columns != geometry.width) ||
(next->rows != geometry.height))
{
if (((flags & XValue) != 0) || ((flags & YValue) != 0))
{
Image
*crop_image;
crop_image=CropImage(next,&geometry,exception);
if (crop_image != (Image *) NULL)
ReplaceImageInList(&next,crop_image);
}
else
if (((flags & WidthValue) != 0) || ((flags & HeightValue) != 0))
{
Image
*size_image;
flags=ParseRegionGeometry(next,read_info->extract,&geometry,
exception);
size_image=ResizeImage(next,geometry.width,geometry.height,
next->filter,exception);
if (size_image != (Image *) NULL)
ReplaceImageInList(&next,size_image);
}
}
}
profile=GetImageProfile(next,"icc");
if (profile == (const StringInfo *) NULL)
profile=GetImageProfile(next,"icm");
profile=GetImageProfile(next,"iptc");
if (profile == (const StringInfo *) NULL)
profile=GetImageProfile(next,"8bim");
if (epoch_initalized == MagickFalse)
{
source_date_epoch=getenv("SOURCE_DATE_EPOCH");
epoch_initalized=MagickTrue;
}
if (source_date_epoch == (const char *) NULL)
{
char
timestamp[MagickTimeExtent];
(void) FormatMagickTime((time_t) GetBlobProperties(next)->st_mtime,
sizeof(timestamp),timestamp);
(void) SetImageProperty(next,"date:modify",timestamp,exception);
(void) FormatMagickTime((time_t) GetBlobProperties(next)->st_ctime,
sizeof(timestamp),timestamp);
(void) SetImageProperty(next,"date:create",timestamp,exception);
}
if (constitute_info.delay_flags != NoValue)
{
if ((constitute_info.delay_flags & GreaterValue) != 0)
{
if (next->delay > constitute_info.delay)
next->delay=constitute_info.delay;
}
else
if ((constitute_info.delay_flags & LessValue) != 0)
{
if (next->delay < constitute_info.delay)
next->delay=constitute_info.delay;
}
else
next->delay=constitute_info.delay;
if ((constitute_info.delay_flags & SigmaValue) != 0)
next->ticks_per_second=constitute_info.ticks_per_second;
}
if (constitute_info.dispose != (const char *) NULL)
{
ssize_t
option_type;
option_type=ParseCommandOption(MagickDisposeOptions,MagickFalse,
constitute_info.dispose);
if (option_type >= 0)
next->dispose=(DisposeType) option_type;
}
if (read_info->verbose != MagickFalse)
(void) IdentifyImage(next,stderr,MagickFalse,exception);
image=next;
}
read_info=DestroyImageInfo(read_info);
if (GetBlobError(image) != MagickFalse)
ThrowReaderException(CorruptImageError,"UnableToReadImageData");
return(GetFirstImageInList(image));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e a d I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ReadImages() reads one or more images and returns them as an image list.
%
% The format of the ReadImage method is:
%
% Image *ReadImages(ImageInfo *image_info,const char *filename,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
% o filename: the image filename.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ReadImages(ImageInfo *image_info,const char *filename,
ExceptionInfo *exception)
{
char
read_filename[MagickPathExtent];
Image
*image,
*images;
ImageInfo
*read_info;
/*
Read image list from a file.
*/
assert(image_info != (ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(exception != (ExceptionInfo *) NULL);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
image_info->filename);
read_info=CloneImageInfo(image_info);
*read_info->magick='\0';
(void) SetImageOption(read_info,"filename",filename);
(void) CopyMagickString(read_info->filename,filename,MagickPathExtent);
(void) InterpretImageFilename(read_info,(Image *) NULL,filename,
(int) read_info->scene,read_filename,exception);
if (LocaleCompare(read_filename,read_info->filename) != 0)
{
ExceptionInfo
*sans;
ssize_t
extent,
scene;
/*
Images of the form image-%d.png[1-5].
*/
sans=AcquireExceptionInfo();
(void) SetImageInfo(read_info,0,sans);
sans=DestroyExceptionInfo(sans);
if (read_info->number_scenes != 0)
{
(void) CopyMagickString(read_filename,read_info->filename,
MagickPathExtent);
images=NewImageList();
extent=(ssize_t) (read_info->scene+read_info->number_scenes);
scene=(ssize_t) read_info->scene;
for ( ; scene < (ssize_t) extent; scene++)
{
(void) InterpretImageFilename(image_info,(Image *) NULL,
read_filename,(int) scene,read_info->filename,exception);
image=ReadImage(read_info,exception);
if (image == (Image *) NULL)
continue;
AppendImageToList(&images,image);
}
read_info=DestroyImageInfo(read_info);
return(images);
}
}
(void) CopyMagickString(read_info->filename,filename,MagickPathExtent);
image=ReadImage(read_info,exception);
read_info=DestroyImageInfo(read_info);
return(image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ R e a d I n l i n e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ReadInlineImage() reads a Base64-encoded inline image or image sequence.
% The method returns a NULL if there is a memory shortage or if the image
% cannot be read. On failure, a NULL image is returned and exception
% describes the reason for the failure.
%
% The format of the ReadInlineImage method is:
%
% Image *ReadInlineImage(const ImageInfo *image_info,const char *content,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
% o content: the image encoded in Base64.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ReadInlineImage(const ImageInfo *image_info,
const char *content,ExceptionInfo *exception)
{
Image
*image;
ImageInfo
*read_info;
unsigned char
*blob;
size_t
length;
const char
*p;
/*
Skip over header (e.g. data:image/gif;base64,).
*/
image=NewImageList();
for (p=content; (*p != ',') && (*p != '\0'); p++) ;
if (*p == '\0')
ThrowReaderException(CorruptImageError,"CorruptImage");
blob=Base64Decode(++p,&length);
if (length == 0)
{
blob=(unsigned char *) RelinquishMagickMemory(blob);
ThrowReaderException(CorruptImageError,"CorruptImage");
}
read_info=CloneImageInfo(image_info);
(void) SetImageInfoProgressMonitor(read_info,(MagickProgressMonitor) NULL,
(void *) NULL);
*read_info->filename='\0';
*read_info->magick='\0';
for (p=content; (*p != '/') && (*p != '\0'); p++) ;
if (*p != '\0')
{
char
*q;
ssize_t
i;
/*
Extract media type.
*/
if (LocaleNCompare(++p,"x-",2) == 0)
p+=2;
(void) strcpy(read_info->filename,"data.");
q=read_info->filename+5;
for (i=0; (*p != ';') && (*p != '\0') && (i < (MagickPathExtent-6)); i++)
*q++=(*p++);
*q++='\0';
}
image=BlobToImage(read_info,blob,length,exception);
blob=(unsigned char *) RelinquishMagickMemory(blob);
read_info=DestroyImageInfo(read_info);
return(image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% W r i t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% WriteImage() writes an image or an image sequence to a file or file handle.
% If writing to a file is on disk, the name is defined by the filename member
% of the image structure. WriteImage() returns MagickFalse is there is a
% memory shortage or if the image cannot be written. Check the exception
% member of image to determine the cause for any failure.
%
% The format of the WriteImage method is:
%
% MagickBooleanType WriteImage(const ImageInfo *image_info,Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType WriteImage(const ImageInfo *image_info,
Image *image,ExceptionInfo *exception)
{
char
filename[MagickPathExtent];
const char
*option;
const DelegateInfo
*delegate_info;
const MagickInfo
*magick_info;
EncodeImageHandler
*encoder;
ExceptionInfo
*sans_exception;
ImageInfo
*write_info;
MagickBooleanType
status,
temporary;
/*
Determine image type from filename prefix or suffix (e.g. image.jpg).
*/
assert(image_info != (ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(image != (Image *) NULL);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
image_info->filename);
assert(image->signature == MagickCoreSignature);
assert(exception != (ExceptionInfo *) NULL);
sans_exception=AcquireExceptionInfo();
write_info=CloneImageInfo(image_info);
(void) CopyMagickString(write_info->filename,image->filename,
MagickPathExtent);
(void) SetImageInfo(write_info,1,sans_exception);
if (*write_info->magick == '\0')
(void) CopyMagickString(write_info->magick,image->magick,MagickPathExtent);
(void) CopyMagickString(filename,image->filename,MagickPathExtent);
(void) CopyMagickString(image->filename,write_info->filename,
MagickPathExtent);
/*
Call appropriate image writer based on image type.
*/
magick_info=GetMagickInfo(write_info->magick,sans_exception);
if (sans_exception->severity == PolicyError)
magick_info=GetMagickInfo(write_info->magick,exception);
sans_exception=DestroyExceptionInfo(sans_exception);
if (magick_info != (const MagickInfo *) NULL)
{
if (GetMagickEndianSupport(magick_info) == MagickFalse)
image->endian=UndefinedEndian;
else
if ((image_info->endian == UndefinedEndian) &&
(GetMagickRawSupport(magick_info) != MagickFalse))
{
unsigned long
lsb_first;
lsb_first=1;
image->endian=(*(char *) &lsb_first) == 1 ? LSBEndian : MSBEndian;
}
}
(void) SyncImageProfiles(image);
DisassociateImageStream(image);
option=GetImageOption(image_info,"delegate:bimodal");
if ((IsStringTrue(option) != MagickFalse) &&
(write_info->page == (char *) NULL) &&
(GetPreviousImageInList(image) == (Image *) NULL) &&
(GetNextImageInList(image) == (Image *) NULL) &&
(IsTaintImage(image) == MagickFalse) )
{
delegate_info=GetDelegateInfo(image->magick,write_info->magick,exception);
if ((delegate_info != (const DelegateInfo *) NULL) &&
(GetDelegateMode(delegate_info) == 0) &&
(IsPathAccessible(image->magick_filename) != MagickFalse))
{
/*
Process image with bi-modal delegate.
*/
(void) CopyMagickString(image->filename,image->magick_filename,
MagickPathExtent);
status=InvokeDelegate(write_info,image,image->magick,
write_info->magick,exception);
write_info=DestroyImageInfo(write_info);
(void) CopyMagickString(image->filename,filename,MagickPathExtent);
return(status);
}
}
status=MagickFalse;
temporary=MagickFalse;
if ((magick_info != (const MagickInfo *) NULL) &&
(GetMagickEncoderSeekableStream(magick_info) != MagickFalse))
{
char
image_filename[MagickPathExtent];
(void) CopyMagickString(image_filename,image->filename,MagickPathExtent);
status=OpenBlob(image_info,image,WriteBinaryBlobMode,exception);
(void) CopyMagickString(image->filename, image_filename,MagickPathExtent);
if (status != MagickFalse)
{
if (IsBlobSeekable(image) == MagickFalse)
{
/*
A seekable stream is required by the encoder.
*/
write_info->adjoin=MagickTrue;
(void) CopyMagickString(write_info->filename,image->filename,
MagickPathExtent);
(void) AcquireUniqueFilename(image->filename);
temporary=MagickTrue;
}
(void) CloseBlob(image);
}
}
encoder=GetImageEncoder(magick_info);
if (encoder != (EncodeImageHandler *) NULL)
{
/*
Call appropriate image writer based on image type.
*/
if (GetMagickEncoderThreadSupport(magick_info) == MagickFalse)
LockSemaphoreInfo(magick_info->semaphore);
status=IsCoderAuthorized(write_info->magick,WritePolicyRights,exception);
if (status != MagickFalse)
status=encoder(write_info,image,exception);
if (GetMagickEncoderThreadSupport(magick_info) == MagickFalse)
UnlockSemaphoreInfo(magick_info->semaphore);
}
else
{
delegate_info=GetDelegateInfo((char *) NULL,write_info->magick,exception);
if (delegate_info != (DelegateInfo *) NULL)
{
/*
Process the image with delegate.
*/
*write_info->filename='\0';
if (GetDelegateThreadSupport(delegate_info) == MagickFalse)
LockSemaphoreInfo(delegate_info->semaphore);
status=InvokeDelegate(write_info,image,(char *) NULL,
write_info->magick,exception);
if (GetDelegateThreadSupport(delegate_info) == MagickFalse)
UnlockSemaphoreInfo(delegate_info->semaphore);
(void) CopyMagickString(image->filename,filename,MagickPathExtent);
}
else
{
sans_exception=AcquireExceptionInfo();
magick_info=GetMagickInfo(write_info->magick,sans_exception);
if (sans_exception->severity == PolicyError)
magick_info=GetMagickInfo(write_info->magick,exception);
sans_exception=DestroyExceptionInfo(sans_exception);
if ((write_info->affirm == MagickFalse) &&
(magick_info == (const MagickInfo *) NULL))
{
(void) CopyMagickString(write_info->magick,image->magick,
MagickPathExtent);
magick_info=GetMagickInfo(write_info->magick,exception);
}
encoder=GetImageEncoder(magick_info);
if (encoder == (EncodeImageHandler *) NULL)
{
char
extension[MagickPathExtent];
GetPathComponent(image->filename,ExtensionPath,extension);
if (*extension != '\0')
magick_info=GetMagickInfo(extension,exception);
else
magick_info=GetMagickInfo(image->magick,exception);
(void) CopyMagickString(image->filename,filename,
MagickPathExtent);
encoder=GetImageEncoder(magick_info);
}
if (encoder == (EncodeImageHandler *) NULL)
{
magick_info=GetMagickInfo(image->magick,exception);
encoder=GetImageEncoder(magick_info);
if (encoder == (EncodeImageHandler *) NULL)
(void) ThrowMagickException(exception,GetMagickModule(),
MissingDelegateError,"NoEncodeDelegateForThisImageFormat",
"`%s'",write_info->magick);
}
if (encoder != (EncodeImageHandler *) NULL)
{
/*
Call appropriate image writer based on image type.
*/
if (GetMagickEncoderThreadSupport(magick_info) == MagickFalse)
LockSemaphoreInfo(magick_info->semaphore);
status=IsCoderAuthorized(write_info->magick,WritePolicyRights,
exception);
if (status != MagickFalse)
status=encoder(write_info,image,exception);
if (GetMagickEncoderThreadSupport(magick_info) == MagickFalse)
UnlockSemaphoreInfo(magick_info->semaphore);
}
}
}
if (temporary != MagickFalse)
{
/*
Copy temporary image file to permanent.
*/
status=OpenBlob(write_info,image,ReadBinaryBlobMode,exception);
if (status != MagickFalse)
{
(void) RelinquishUniqueFileResource(write_info->filename);
status=ImageToFile(image,write_info->filename,exception);
}
(void) CloseBlob(image);
(void) RelinquishUniqueFileResource(image->filename);
(void) CopyMagickString(image->filename,write_info->filename,
MagickPathExtent);
}
if ((LocaleCompare(write_info->magick,"info") != 0) &&
(write_info->verbose != MagickFalse))
(void) IdentifyImage(image,stdout,MagickFalse,exception);
write_info=DestroyImageInfo(write_info);
if (GetBlobError(image) != MagickFalse)
ThrowWriterException(FileOpenError,"UnableToWriteFile");
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% W r i t e I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% WriteImages() writes an image sequence into one or more files. While
% WriteImage() can write an image sequence, it is limited to writing
% the sequence into a single file using a format which supports multiple
% frames. WriteImages(), however, does not have this limitation, instead it
% generates multiple output files if necessary (or when requested). When
% ImageInfo's adjoin flag is set to MagickFalse, the file name is expected
% to include a printf-style formatting string for the frame number (e.g.
% "image%02d.png").
%
% The format of the WriteImages method is:
%
% MagickBooleanType WriteImages(const ImageInfo *image_info,Image *images,
% const char *filename,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
% o images: the image list.
%
% o filename: the image filename.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType WriteImages(const ImageInfo *image_info,
Image *images,const char *filename,ExceptionInfo *exception)
{
#define WriteImageTag "Write/Image"
ExceptionInfo
*sans_exception;
ImageInfo
*write_info;
MagickBooleanType
proceed;
MagickOffsetType
progress;
MagickProgressMonitor
progress_monitor;
MagickSizeType
number_images;
MagickStatusType
status;
Image
*p;
assert(image_info != (const ImageInfo *) NULL);
assert(image_info->signature == MagickCoreSignature);
assert(images != (Image *) NULL);
assert(images->signature == MagickCoreSignature);
if (IsEventLogging() != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
assert(exception != (ExceptionInfo *) NULL);
write_info=CloneImageInfo(image_info);
*write_info->magick='\0';
images=GetFirstImageInList(images);
if (filename != (const char *) NULL)
for (p=images; p != (Image *) NULL; p=GetNextImageInList(p))
(void) CopyMagickString(p->filename,filename,MagickPathExtent);
(void) CopyMagickString(write_info->filename,images->filename,
MagickPathExtent);
sans_exception=AcquireExceptionInfo();
(void) SetImageInfo(write_info,(unsigned int) GetImageListLength(images),
sans_exception);
sans_exception=DestroyExceptionInfo(sans_exception);
if (*write_info->magick == '\0')
(void) CopyMagickString(write_info->magick,images->magick,MagickPathExtent);
p=images;
for ( ; GetNextImageInList(p) != (Image *) NULL; p=GetNextImageInList(p))
{
Image
*next;
next=GetNextImageInList(p);
if (next == (Image *) NULL)
break;
if (p->scene >= next->scene)
{
ssize_t
i;
/*
Generate consistent scene numbers.
*/
i=(ssize_t) images->scene;
for (p=images; p != (Image *) NULL; p=GetNextImageInList(p))
p->scene=(size_t) i++;
break;
}
}
/*
Write images.
*/
status=MagickTrue;
progress_monitor=(MagickProgressMonitor) NULL;
progress=0;
number_images=GetImageListLength(images);
for (p=images; p != (Image *) NULL; p=GetNextImageInList(p))
{
if (number_images != 1)
progress_monitor=SetImageProgressMonitor(p,(MagickProgressMonitor) NULL,
p->client_data);
status&=WriteImage(write_info,p,exception);
if (number_images != 1)
(void) SetImageProgressMonitor(p,progress_monitor,p->client_data);
if (write_info->adjoin != MagickFalse)
break;
if (number_images != 1)
{
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp atomic
#endif
progress++;
proceed=SetImageProgress(p,WriteImageTag,progress,number_images);
if (proceed == MagickFalse)
break;
}
}
write_info=DestroyImageInfo(write_info);
return(status != 0 ? MagickTrue : MagickFalse);
}
|
stream-generic.c | /*-----------------------------------------------------------------------*/
/* Program: STREAM */
/* Revision: $Id: stream.c,v 5.10 2013/01/17 16:01:06 mccalpin Exp mccalpin $ */
/* Original code developed by John D. McCalpin */
/* Programmers: John D. McCalpin */
/* Joe R. Zagar */
/* */
/* This program measures memory transfer rates in MB/s for simple */
/* computational kernels coded in C. */
/*-----------------------------------------------------------------------*/
/* Copyright 1991-2013: John D. McCalpin */
/*-----------------------------------------------------------------------*/
/* License: */
/* 1. You are free to use this program and/or to redistribute */
/* this program. */
/* 2. You are free to modify this program for your own use, */
/* including commercial use, subject to the publication */
/* restrictions in item 3. */
/* 3. You are free to publish results obtained from running this */
/* program, or from works that you derive from this program, */
/* with the following limitations: */
/* 3a. In order to be referred to as "STREAM benchmark results", */
/* published results must be in conformance to the STREAM */
/* Run Rules, (briefly reviewed below) published at */
/* http://www.cs.virginia.edu/stream/ref.html */
/* and incorporated herein by reference. */
/* As the copyright holder, John McCalpin retains the */
/* right to determine conformity with the Run Rules. */
/* 3b. Results based on modified source code or on runs not in */
/* accordance with the STREAM Run Rules must be clearly */
/* labelled whenever they are published. Examples of */
/* proper labelling include: */
/* "tuned STREAM benchmark results" */
/* "based on a variant of the STREAM benchmark code" */
/* Other comparable, clear, and reasonable labelling is */
/* acceptable. */
/* 3c. Submission of results to the STREAM benchmark web site */
/* is encouraged, but not required. */
/* 4. Use of this program or creation of derived works based on this */
/* program constitutes acceptance of these licensing restrictions. */
/* 5. Absolutely no warranty is expressed or implied. */
/*-----------------------------------------------------------------------*/
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <math.h>
#include <float.h>
#include <limits.h>
#ifndef WIN32
#include <unistd.h>
#include <sys/time.h>
#else
#include <Windows.h>
#endif
/*-----------------------------------------------------------------------
* INSTRUCTIONS:
*
* 1) STREAM requires different amounts of memory to run on different
* systems, depending on both the system cache size(s) and the
* granularity of the system timer.
* You should adjust the value of 'STREAM_ARRAY_SIZE' (below)
* to meet *both* of the following criteria:
* (a) Each array must be at least 4 times the size of the
* available cache memory. I don't worry about the difference
* between 10^6 and 2^20, so in practice the minimum array size
* is about 3.8 times the cache size.
* Example 1: One Xeon E3 with 8 MB L3 cache
* STREAM_ARRAY_SIZE should be >= 4 million, giving
* an array size of 30.5 MB and a total memory requirement
* of 91.5 MB.
* Example 2: Two Xeon E5's with 20 MB L3 cache each (using OpenMP)
* STREAM_ARRAY_SIZE should be >= 20 million, giving
* an array size of 153 MB and a total memory requirement
* of 458 MB.
* (b) The size should be large enough so that the 'timing calibration'
* output by the program is at least 20 clock-ticks.
* Example: most versions of Windows have a 10 millisecond timer
* granularity. 20 "ticks" at 10 ms/tic is 200 milliseconds.
* If the chip is capable of 10 GB/s, it moves 2 GB in 200 msec.
* This means the each array must be at least 1 GB, or 128M elements.
*
* Version 5.10 increases the default array size from 2 million
* elements to 10 million elements in response to the increasing
* size of L3 caches. The new default size is large enough for caches
* up to 20 MB.
* Version 5.10 changes the loop index variables from "register int"
* to "ssize_t", which allows array indices >2^32 (4 billion)
* on properly configured 64-bit systems. Additional compiler options
* (such as "-mcmodel=medium") may be required for large memory runs.
*
* Array size can be set at compile time without modifying the source
* code for the (many) compilers that support preprocessor definitions
* on the compile line. E.g.,
* gcc -O -DSTREAM_ARRAY_SIZE=100000000 stream.c -o stream.100M
* will override the default size of 10M with a new size of 100M elements
* per array.
*/
#ifndef STREAM_ARRAY_SIZE
# define STREAM_ARRAY_SIZE 10000000
#endif
/* 2) STREAM runs each kernel "NTIMES" times and reports the *best* result
* for any iteration after the first, therefore the minimum value
* for NTIMES is 2.
* There are no rules on maximum allowable values for NTIMES, but
* values larger than the default are unlikely to noticeably
* increase the reported performance.
* NTIMES can also be set on the compile line without changing the source
* code using, for example, "-DNTIMES=7".
*/
#ifdef NTIMES
#if NTIMES<=1
# define NTIMES 10
#endif
#endif
#ifndef NTIMES
# define NTIMES 10
#endif
/* Users are allowed to modify the "OFFSET" variable, which *may* change the
* relative alignment of the arrays (though compilers may change the
* effective offset by making the arrays non-contiguous on some systems).
* Use of non-zero values for OFFSET can be especially helpful if the
* STREAM_ARRAY_SIZE is set to a value close to a large power of 2.
* OFFSET can also be set on the compile line without changing the source
* code using, for example, "-DOFFSET=56".
*/
#ifndef OFFSET
# define OFFSET 0
#endif
/*
* 3) Compile the code with optimization. Many compilers generate
* unreasonably bad code before the optimizer tightens things up.
* If the results are unreasonably good, on the other hand, the
* optimizer might be too smart for me!
*
* For a simple single-core version, try compiling with:
* cc -O stream.c -o stream
* This is known to work on many, many systems....
*
* To use multiple cores, you need to tell the compiler to obey the OpenMP
* directives in the code. This varies by compiler, but a common example is
* gcc -O -fopenmp stream.c -o stream_omp
* The environment variable OMP_NUM_THREADS allows runtime control of the
* number of threads/cores used when the resulting "stream_omp" program
* is executed.
*
* To run with single-precision variables and arithmetic, simply add
* -DSTREAM_TYPE=float
* to the compile line.
* Note that this changes the minimum array sizes required --- see (1) above.
*
* The preprocessor directive "TUNED" does not do much -- it simply causes the
* code to call separate functions to execute each kernel. Trivial versions
* of these functions are provided, but they are *not* tuned -- they just
* provide predefined interfaces to be replaced with tuned code.
*
*
* 4) Optional: Mail the results to mccalpin@cs.virginia.edu
* Be sure to include info that will help me understand:
* a) the computer hardware configuration (e.g., processor model, memory type)
* b) the compiler name/version and compilation flags
* c) any run-time information (such as OMP_NUM_THREADS)
* d) all of the output from the test case.
*
* Thanks!
*
*-----------------------------------------------------------------------*/
# define HLINE "-------------------------------------------------------------\n"
# ifndef MIN
# define MIN(x,y) ((x)<(y)?(x):(y))
# endif
# ifndef MAX
# define MAX(x,y) ((x)>(y)?(x):(y))
# endif
#ifndef STREAM_TYPE
#define STREAM_TYPE double
#endif
// it turns out that massive static arrays make Emscripten blow up, as it
// encodes their initializers naively. A ten million entry array gets a
// ten million entry initializer.
//static STREAM_TYPE a[STREAM_ARRAY_SIZE+OFFSET],
// b[STREAM_ARRAY_SIZE+OFFSET],
// c[STREAM_ARRAY_SIZE+OFFSET];
static STREAM_TYPE* a, *b, *c;
static double avgtime[4] = {0}, maxtime[4] = {0},
mintime[4] = {FLT_MAX,FLT_MAX,FLT_MAX,FLT_MAX};
static char *label[4] = {"Copy: ", "Scale: ",
"Add: ", "Triad: "};
static double bytes[4] = {
2 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
2 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
3 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE,
3 * sizeof(STREAM_TYPE) * STREAM_ARRAY_SIZE
};
extern double mysecond();
extern void checkSTREAMresults();
#ifdef TUNED
extern void tuned_STREAM_Copy();
extern void tuned_STREAM_Scale(STREAM_TYPE scalar);
extern void tuned_STREAM_Add();
extern void tuned_STREAM_Triad(STREAM_TYPE scalar);
#endif
#ifdef _OPENMP
extern int omp_get_num_threads();
#endif
int
main()
{
int quantum, checktick();
int BytesPerWord;
int k;
size_t j;
STREAM_TYPE scalar;
double t, times[4][NTIMES];
a = calloc(STREAM_ARRAY_SIZE + OFFSET, sizeof(STREAM_TYPE));
b = calloc(STREAM_ARRAY_SIZE + OFFSET, sizeof(STREAM_TYPE));
c = calloc(STREAM_ARRAY_SIZE + OFFSET, sizeof(STREAM_TYPE));
if(!a || !b || !c)
{
printf("Memory allocation failed.\n");
return -1;
}
/* --- SETUP --- determine precision and check timing --- */
printf(HLINE);
printf("STREAM version $Revision: 5.10 $\n");
printf(HLINE);
BytesPerWord = sizeof(STREAM_TYPE);
printf("This system uses %d bytes per array element.\n",
BytesPerWord);
printf(HLINE);
#ifdef N
printf("***** WARNING: ******\n");
printf(" It appears that you set the preprocessor variable N when compiling this code.\n");
printf(" This version of the code uses the preprocesor variable STREAM_ARRAY_SIZE to control the array size\n");
printf(" Reverting to default value of STREAM_ARRAY_SIZE=%llu\n",(unsigned long long) STREAM_ARRAY_SIZE);
printf("***** WARNING: ******\n");
#endif
printf("Array size = %llu (elements), Offset = %d (elements)\n" , (unsigned long long) STREAM_ARRAY_SIZE, OFFSET);
printf("Memory per array = %.1f MiB (= %.1f GiB).\n",
BytesPerWord * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.0),
BytesPerWord * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.0/1024.0));
printf("Total memory required = %.1f MiB (= %.1f GiB).\n",
(3.0 * BytesPerWord) * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024.),
(3.0 * BytesPerWord) * ( (double) STREAM_ARRAY_SIZE / 1024.0/1024./1024.));
printf("Each kernel will be executed %d times.\n", NTIMES);
printf(" The *best* time for each kernel (excluding the first iteration)\n");
printf(" will be used to compute the reported bandwidth.\n");
#ifdef _OPENMP
printf(HLINE);
#pragma omp parallel
{
#pragma omp master
{
k = omp_get_num_threads();
printf ("Number of Threads requested = %i\n",k);
}
}
#endif
#ifdef _OPENMP
k = 0;
#pragma omp parallel
#pragma omp atomic
k++;
printf ("Number of Threads counted = %i\n",k);
#endif
/* Get initial value for system clock. */
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
a[j] = 1.0;
b[j] = 2.0;
c[j] = 0.0;
}
printf(HLINE);
if ( (quantum = checktick()) >= 1)
printf("Your clock granularity/precision appears to be "
"%d microseconds.\n", quantum);
else {
printf("Your clock granularity appears to be "
"less than one microsecond.\n");
quantum = 1;
}
t = mysecond();
#pragma omp parallel for
for (j = 0; j < STREAM_ARRAY_SIZE; j++)
a[j] = 2.0E0 * a[j];
t = 1.0E6 * (mysecond() - t);
printf("Each test below will take on the order"
" of %d microseconds.\n", (int) t );
printf(" (= %d clock ticks)\n", (int) (t/quantum) );
printf("Increase the size of the arrays if this shows that\n");
printf("you are not getting at least 20 clock ticks per test.\n");
printf(HLINE);
printf("WARNING -- The above is only a rough guideline.\n");
printf("For best results, please be sure you know the\n");
printf("precision of your system timer.\n");
printf(HLINE);
/* --- MAIN LOOP --- repeat test cases NTIMES times --- */
scalar = 3.0;
for (k=0; k<NTIMES; k++)
{
times[0][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Copy();
#else
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
#endif
times[0][k] = mysecond() - times[0][k];
times[1][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Scale(scalar);
#else
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
#endif
times[1][k] = mysecond() - times[1][k];
times[2][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Add();
#else
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
#endif
times[2][k] = mysecond() - times[2][k];
times[3][k] = mysecond();
#ifdef TUNED
tuned_STREAM_Triad(scalar);
#else
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[j];
#endif
times[3][k] = mysecond() - times[3][k];
}
/* --- SUMMARY --- */
for (k=1; k<NTIMES; k++) /* note -- skip first iteration */
{
for (j=0; j<4; j++)
{
avgtime[j] = avgtime[j] + times[j][k];
mintime[j] = MIN(mintime[j], times[j][k]);
maxtime[j] = MAX(maxtime[j], times[j][k]);
}
}
printf("Function Best Rate MB/s Avg time Min time Max time\n");
for (j=0; j<4; j++) {
avgtime[j] = avgtime[j]/(double)(NTIMES-1);
printf("%s%12.1f %11.6f %11.6f %11.6f\n", label[j],
1.0E-06 * bytes[j]/mintime[j],
avgtime[j],
mintime[j],
maxtime[j]);
}
printf(HLINE);
/* --- Check Results --- */
checkSTREAMresults();
printf(HLINE);
free(a);
free(b);
free(c);
return 0;
}
# define M 20
int
checktick()
{
int i, minDelta, Delta;
double t1, t2, timesfound[M];
/* Collect a sequence of M unique time values from the system. */
for (i = 0; i < M; i++) {
t1 = mysecond();
while( ((t2=mysecond()) - t1) < 1.0E-6 )
;
timesfound[i] = t1 = t2;
}
/*
* Determine the minimum difference between these M values.
* This result will be our estimate (in microseconds) for the
* clock granularity.
*/
minDelta = 1000000;
for (i = 1; i < M; i++) {
Delta = (int)( 1.0E6 * (timesfound[i]-timesfound[i-1]));
minDelta = MIN(minDelta, MAX(Delta,0));
}
return(minDelta);
}
/* A gettimeofday routine to give access to the wall
clock timer on most UNIX-like systems. */
#ifndef WIN32
double mysecond()
{
struct timeval tp;
struct timezone tzp;
int i;
i = gettimeofday(&tp,&tzp);
return ( (double) tp.tv_sec + (double) tp.tv_usec * 1.e-6 );
}
#else
double mysecond()
{
static LARGE_INTEGER freq = {0};
LARGE_INTEGER count = {0};
if(freq.QuadPart == 0LL) {
QueryPerformanceFrequency(&freq);
}
QueryPerformanceCounter(&count);
return (double)count.QuadPart / (double)freq.QuadPart;
}
#endif
#ifndef abs
#define abs(a) ((a) >= 0 ? (a) : -(a))
#endif
void checkSTREAMresults ()
{
STREAM_TYPE aj,bj,cj,scalar;
STREAM_TYPE aSumErr,bSumErr,cSumErr;
STREAM_TYPE aAvgErr,bAvgErr,cAvgErr;
double epsilon;
size_t j;
int k,ierr,err;
/* reproduce initialization */
aj = 1.0;
bj = 2.0;
cj = 0.0;
/* a[] is modified during timing check */
aj = 2.0E0 * aj;
/* now execute timing loop */
scalar = 3.0;
for (k=0; k<NTIMES; k++)
{
cj = aj;
bj = scalar*cj;
cj = aj+bj;
aj = bj+scalar*cj;
}
/* accumulate deltas between observed and expected results */
aSumErr = 0.0;
bSumErr = 0.0;
cSumErr = 0.0;
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
aSumErr += abs(a[j] - aj);
bSumErr += abs(b[j] - bj);
cSumErr += abs(c[j] - cj);
// if (j == 417) printf("Index 417: c[j]: %f, cj: %f\n",c[j],cj); // MCCALPIN
}
aAvgErr = aSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
bAvgErr = bSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
cAvgErr = cSumErr / (STREAM_TYPE) STREAM_ARRAY_SIZE;
if (sizeof(STREAM_TYPE) == 4) {
epsilon = 1.e-6;
}
else if (sizeof(STREAM_TYPE) == 8) {
epsilon = 1.e-13;
}
else {
printf("WEIRD: sizeof(STREAM_TYPE) = %lu\n",sizeof(STREAM_TYPE));
epsilon = 1.e-6;
}
err = 0;
if (abs(aAvgErr/aj) > epsilon) {
err++;
printf ("Failed Validation on array a[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",aj,aAvgErr,abs(aAvgErr)/aj);
ierr = 0;
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
if (abs(a[j]/aj-1.0) > epsilon) {
ierr++;
#ifdef VERBOSE
if (ierr < 10) {
printf(" array a: index: %ld, expected: %e, observed: %e, relative error: %e\n",
j,aj,a[j],abs((aj-a[j])/aAvgErr));
}
#endif
}
}
printf(" For array a[], %d errors were found.\n",ierr);
}
if (abs(bAvgErr/bj) > epsilon) {
err++;
printf ("Failed Validation on array b[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",bj,bAvgErr,abs(bAvgErr)/bj);
printf (" AvgRelAbsErr > Epsilon (%e)\n",epsilon);
ierr = 0;
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
if (abs(b[j]/bj-1.0) > epsilon) {
ierr++;
#ifdef VERBOSE
if (ierr < 10) {
printf(" array b: index: %ld, expected: %e, observed: %e, relative error: %e\n",
j,bj,b[j],abs((bj-b[j])/bAvgErr));
}
#endif
}
}
printf(" For array b[], %d errors were found.\n",ierr);
}
if (abs(cAvgErr/cj) > epsilon) {
err++;
printf ("Failed Validation on array c[], AvgRelAbsErr > epsilon (%e)\n",epsilon);
printf (" Expected Value: %e, AvgAbsErr: %e, AvgRelAbsErr: %e\n",cj,cAvgErr,abs(cAvgErr)/cj);
printf (" AvgRelAbsErr > Epsilon (%e)\n",epsilon);
ierr = 0;
for (j=0; j<STREAM_ARRAY_SIZE; j++) {
if (abs(c[j]/cj-1.0) > epsilon) {
ierr++;
#ifdef VERBOSE
if (ierr < 10) {
printf(" array c: index: %ld, expected: %e, observed: %e, relative error: %e\n",
j,cj,c[j],abs((cj-c[j])/cAvgErr));
}
#endif
}
}
printf(" For array c[], %d errors were found.\n",ierr);
}
if (err == 0) {
printf ("Solution Validates: avg error less than %e on all three arrays\n",epsilon);
}
#ifdef VERBOSE
printf ("Results Validation Verbose Results: \n");
printf (" Expected a(1), b(1), c(1): %f %f %f \n",aj,bj,cj);
printf (" Observed a(1), b(1), c(1): %f %f %f \n",a[1],b[1],c[1]);
printf (" Rel Errors on a, b, c: %e %e %e \n",abs(aAvgErr/aj),abs(bAvgErr/bj),abs(cAvgErr/cj));
#endif
}
#ifdef TUNED
/* stubs for "tuned" versions of the kernels */
void tuned_STREAM_Copy()
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j];
}
void tuned_STREAM_Scale(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
b[j] = scalar*c[j];
}
void tuned_STREAM_Add()
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
c[j] = a[j]+b[j];
}
void tuned_STREAM_Triad(STREAM_TYPE scalar)
{
ssize_t j;
#pragma omp parallel for
for (j=0; j<STREAM_ARRAY_SIZE; j++)
a[j] = b[j]+scalar*c[j];
}
/* end of stubs for the "tuned" versions of the kernels */
#endif |
task_types_serialized.c | // RUN: %libomp-compile-and-run | FileCheck %s
// REQUIRES: ompt
#include "callback.h"
#include <omp.h>
__attribute__ ((noinline)) // workaround for bug in icc
void print_task_type(int id)
{
#pragma omp critical
{
int task_type;
char buffer[2048];
ompt_get_task_info(0, &task_type, NULL, NULL, NULL, NULL);
format_task_type(task_type, buffer);
printf("%" PRIu64 ": id=%d task_type=%s=%d\n", ompt_get_thread_data()->value, id, buffer, task_type);
}
};
int main()
{
//initial task
print_task_type(0);
int x;
//implicit task
#pragma omp parallel num_threads(1)
{
print_task_type(1);
x++;
}
#pragma omp parallel num_threads(1)
#pragma omp master
{
//explicit task
#pragma omp task
{
print_task_type(2);
x++;
}
//explicit task with undeferred
#pragma omp task if(0)
{
print_task_type(3);
x++;
}
//explicit task with untied
#pragma omp task untied
{
print_task_type(4);
x++;
}
//explicit task with final
#pragma omp task final(1)
{
print_task_type(5);
x++;
//nested explicit task with final and undeferred
#pragma omp task
{
print_task_type(6);
x++;
}
}
/*
//TODO:not working
//explicit task with mergeable
#pragma omp task mergeable
{
print_task_type(7);
x++;
}
*/
//TODO: merged task
}
// Check if libomp supports the callbacks for this test.
// CHECK-NOT: {{^}}0: Could not register callback 'ompt_callback_task_create'
// CHECK: {{^}}0: NULL_POINTER=[[NULL:.*$]]
// CHECK: {{^}}[[MASTER_ID:[0-9]+]]: ompt_event_task_create: parent_task_id=0, parent_task_frame.exit=[[NULL]], parent_task_frame.reenter=[[NULL]], new_task_id={{[0-9]+}}, codeptr_ra=[[NULL]], task_type=ompt_task_initial=1, has_dependences=no
// CHECK: {{^}}[[MASTER_ID]]: id=0 task_type=ompt_task_initial=1
// CHECK: {{^}}[[MASTER_ID]]: id=1 task_type=ompt_task_implicit|ompt_task_undeferred=134217730
// CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred=134217732, has_dependences=no
// CHECK: {{^[0-9]+}}: id=2 task_type=ompt_task_explicit|ompt_task_undeferred=134217732
// CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred=134217732, has_dependences=no
// CHECK: {{^[0-9]+}}: id=3 task_type=ompt_task_explicit|ompt_task_undeferred=134217732
// CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_untied=402653188, has_dependences=no
// CHECK: {{^[0-9]+}}: id=4 task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_untied=402653188
// CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_final=671088644, has_dependences=no
// CHECK: {{^[0-9]+}}: id=5 task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_final=671088644
// CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_final=671088644, has_dependences=no
// CHECK: {{^[0-9]+}}: id=6 task_type=ompt_task_explicit|ompt_task_undeferred|ompt_task_final=671088644
// ___CHECK: {{^[0-9]+}}: ompt_event_task_create: parent_task_id={{[0-9]+}}, parent_task_frame.exit={{0x[0-f]+}}, parent_task_frame.reenter={{0x[0-f]+}}, new_task_id={{[0-9]+}}, codeptr_ra={{0x[0-f]+}}, task_type=ompt_task_explicit|ompt_task_undeferred=134217732, has_dependences=no
// ___CHECK: {{^[0-9]+}}: id=7 task_type=ompt_task_explicit|ompt_task_undeferred=134217732
return 0;
}
|
tree-parloops.c | /* Loop autoparallelization.
Copyright (C) 2006, 2007, 2008, 2009, 2010
Free Software Foundation, Inc.
Contributed by Sebastian Pop <pop@cri.ensmp.fr> and
Zdenek Dvorak <dvorakz@suse.cz>.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#include "config.h"
#include "system.h"
#include "coretypes.h"
#include "tm.h"
#include "tree.h"
#include "rtl.h"
#include "tree-flow.h"
#include "cfgloop.h"
#include "ggc.h"
#include "tree-data-ref.h"
#include "diagnostic.h"
#include "tree-pass.h"
#include "tree-scalar-evolution.h"
#include "hashtab.h"
#include "langhooks.h"
#include "tree-vectorizer.h"
/* This pass tries to distribute iterations of loops into several threads.
The implementation is straightforward -- for each loop we test whether its
iterations are independent, and if it is the case (and some additional
conditions regarding profitability and correctness are satisfied), we
add GIMPLE_OMP_PARALLEL and GIMPLE_OMP_FOR codes and let omp expansion
machinery do its job.
The most of the complexity is in bringing the code into shape expected
by the omp expanders:
-- for GIMPLE_OMP_FOR, ensuring that the loop has only one induction
variable and that the exit test is at the start of the loop body
-- for GIMPLE_OMP_PARALLEL, replacing the references to local addressable
variables by accesses through pointers, and breaking up ssa chains
by storing the values incoming to the parallelized loop to a structure
passed to the new function as an argument (something similar is done
in omp gimplification, unfortunately only a small part of the code
can be shared).
TODO:
-- if there are several parallelizable loops in a function, it may be
possible to generate the threads just once (using synchronization to
ensure that cross-loop dependences are obeyed).
-- handling of common scalar dependence patterns (accumulation, ...)
-- handling of non-innermost loops */
/*
Reduction handling:
currently we use vect_is_simple_reduction() to detect reduction patterns.
The code transformation will be introduced by an example.
parloop
{
int sum=1;
for (i = 0; i < N; i++)
{
x[i] = i + 3;
sum+=x[i];
}
}
gimple-like code:
header_bb:
# sum_29 = PHI <sum_11(5), 1(3)>
# i_28 = PHI <i_12(5), 0(3)>
D.1795_8 = i_28 + 3;
x[i_28] = D.1795_8;
sum_11 = D.1795_8 + sum_29;
i_12 = i_28 + 1;
if (N_6(D) > i_12)
goto header_bb;
exit_bb:
# sum_21 = PHI <sum_11(4)>
printf (&"%d"[0], sum_21);
after reduction transformation (only relevant parts):
parloop
{
....
# Storing the initial value given by the user. #
.paral_data_store.32.sum.27 = 1;
#pragma omp parallel num_threads(4)
#pragma omp for schedule(static)
# The neutral element corresponding to the particular
reduction's operation, e.g. 0 for PLUS_EXPR,
1 for MULT_EXPR, etc. replaces the user's initial value. #
# sum.27_29 = PHI <sum.27_11, 0>
sum.27_11 = D.1827_8 + sum.27_29;
GIMPLE_OMP_CONTINUE
# Adding this reduction phi is done at create_phi_for_local_result() #
# sum.27_56 = PHI <sum.27_11, 0>
GIMPLE_OMP_RETURN
# Creating the atomic operation is done at
create_call_for_reduction_1() #
#pragma omp atomic_load
D.1839_59 = *&.paral_data_load.33_51->reduction.23;
D.1840_60 = sum.27_56 + D.1839_59;
#pragma omp atomic_store (D.1840_60);
GIMPLE_OMP_RETURN
# collecting the result after the join of the threads is done at
create_loads_for_reductions().
The value computed by the threads is loaded from the
shared struct. #
.paral_data_load.33_52 = &.paral_data_store.32;
sum_37 = .paral_data_load.33_52->sum.27;
sum_43 = D.1795_41 + sum_37;
exit bb:
# sum_21 = PHI <sum_43, sum_26>
printf (&"%d"[0], sum_21);
...
}
*/
/* Minimal number of iterations of a loop that should be executed in each
thread. */
#define MIN_PER_THREAD 100
/* Element of the hashtable, representing a
reduction in the current loop. */
struct reduction_info
{
gimple reduc_stmt; /* reduction statement. */
gimple reduc_phi; /* The phi node defining the reduction. */
enum tree_code reduction_code;/* code for the reduction operation. */
gimple keep_res; /* The PHI_RESULT of this phi is the resulting value
of the reduction variable when existing the loop. */
tree initial_value; /* The initial value of the reduction var before entering the loop. */
tree field; /* the name of the field in the parloop data structure intended for reduction. */
tree init; /* reduction initialization value. */
gimple new_phi; /* (helper field) Newly created phi node whose result
will be passed to the atomic operation. Represents
the local result each thread computed for the reduction
operation. */
};
/* Equality and hash functions for hashtab code. */
static int
reduction_info_eq (const void *aa, const void *bb)
{
const struct reduction_info *a = (const struct reduction_info *) aa;
const struct reduction_info *b = (const struct reduction_info *) bb;
return (a->reduc_phi == b->reduc_phi);
}
static hashval_t
reduction_info_hash (const void *aa)
{
const struct reduction_info *a = (const struct reduction_info *) aa;
return htab_hash_pointer (a->reduc_phi);
}
static struct reduction_info *
reduction_phi (htab_t reduction_list, gimple phi)
{
struct reduction_info tmpred, *red;
if (htab_elements (reduction_list) == 0)
return NULL;
tmpred.reduc_phi = phi;
red = (struct reduction_info *) htab_find (reduction_list, &tmpred);
return red;
}
/* Element of hashtable of names to copy. */
struct name_to_copy_elt
{
unsigned version; /* The version of the name to copy. */
tree new_name; /* The new name used in the copy. */
tree field; /* The field of the structure used to pass the
value. */
};
/* Equality and hash functions for hashtab code. */
static int
name_to_copy_elt_eq (const void *aa, const void *bb)
{
const struct name_to_copy_elt *a = (const struct name_to_copy_elt *) aa;
const struct name_to_copy_elt *b = (const struct name_to_copy_elt *) bb;
return a->version == b->version;
}
static hashval_t
name_to_copy_elt_hash (const void *aa)
{
const struct name_to_copy_elt *a = (const struct name_to_copy_elt *) aa;
return (hashval_t) a->version;
}
/* Data dependency analysis. Returns true if the iterations of LOOP
are independent on each other (that is, if we can execute them
in parallel). */
static bool
loop_parallel_p (struct loop *loop)
{
VEC (ddr_p, heap) * dependence_relations;
VEC (data_reference_p, heap) *datarefs;
lambda_trans_matrix trans;
bool ret = false;
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, "Considering loop %d\n", loop->num);
if (!loop->inner)
fprintf (dump_file, "loop is innermost\n");
else
fprintf (dump_file, "loop NOT innermost\n");
}
/* Check for problems with dependences. If the loop can be reversed,
the iterations are independent. */
datarefs = VEC_alloc (data_reference_p, heap, 10);
dependence_relations = VEC_alloc (ddr_p, heap, 10 * 10);
compute_data_dependences_for_loop (loop, true, &datarefs,
&dependence_relations);
if (dump_file && (dump_flags & TDF_DETAILS))
dump_data_dependence_relations (dump_file, dependence_relations);
trans = lambda_trans_matrix_new (1, 1);
LTM_MATRIX (trans)[0][0] = -1;
if (lambda_transform_legal_p (trans, 1, dependence_relations))
{
ret = true;
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " SUCCESS: may be parallelized\n");
}
else if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" FAILED: data dependencies exist across iterations\n");
free_dependence_relations (dependence_relations);
free_data_refs (datarefs);
return ret;
}
/* Return true when LOOP contains basic blocks marked with the
BB_IRREDUCIBLE_LOOP flag. */
static inline bool
loop_has_blocks_with_irreducible_flag (struct loop *loop)
{
unsigned i;
basic_block *bbs = get_loop_body_in_dom_order (loop);
bool res = true;
for (i = 0; i < loop->num_nodes; i++)
if (bbs[i]->flags & BB_IRREDUCIBLE_LOOP)
goto end;
res = false;
end:
free (bbs);
return res;
}
/* Assigns the address of OBJ in TYPE to an ssa name, and returns this name.
The assignment statement is placed on edge ENTRY. DECL_ADDRESS maps decls
to their addresses that can be reused. The address of OBJ is known to
be invariant in the whole function. */
static tree
take_address_of (tree obj, tree type, edge entry, htab_t decl_address)
{
int uid;
void **dslot;
struct int_tree_map ielt, *nielt;
tree *var_p, name, bvar, addr;
gimple stmt;
gimple_seq stmts;
/* Since the address of OBJ is invariant, the trees may be shared.
Avoid rewriting unrelated parts of the code. */
obj = unshare_expr (obj);
for (var_p = &obj;
handled_component_p (*var_p);
var_p = &TREE_OPERAND (*var_p, 0))
continue;
uid = DECL_UID (*var_p);
ielt.uid = uid;
dslot = htab_find_slot_with_hash (decl_address, &ielt, uid, INSERT);
if (!*dslot)
{
addr = build_addr (*var_p, current_function_decl);
bvar = create_tmp_var (TREE_TYPE (addr), get_name (*var_p));
add_referenced_var (bvar);
stmt = gimple_build_assign (bvar, addr);
name = make_ssa_name (bvar, stmt);
gimple_assign_set_lhs (stmt, name);
gsi_insert_on_edge_immediate (entry, stmt);
nielt = XNEW (struct int_tree_map);
nielt->uid = uid;
nielt->to = name;
*dslot = nielt;
}
else
name = ((struct int_tree_map *) *dslot)->to;
if (var_p != &obj)
{
*var_p = build1 (INDIRECT_REF, TREE_TYPE (*var_p), name);
name = force_gimple_operand (build_addr (obj, current_function_decl),
&stmts, true, NULL_TREE);
if (!gimple_seq_empty_p (stmts))
gsi_insert_seq_on_edge_immediate (entry, stmts);
}
if (TREE_TYPE (name) != type)
{
name = force_gimple_operand (fold_convert (type, name), &stmts, true,
NULL_TREE);
if (!gimple_seq_empty_p (stmts))
gsi_insert_seq_on_edge_immediate (entry, stmts);
}
return name;
}
/* Callback for htab_traverse. Create the initialization statement
for reduction described in SLOT, and place it at the preheader of
the loop described in DATA. */
static int
initialize_reductions (void **slot, void *data)
{
tree init, c;
tree bvar, type, arg;
edge e;
struct reduction_info *const reduc = (struct reduction_info *) *slot;
struct loop *loop = (struct loop *) data;
/* Create initialization in preheader:
reduction_variable = initialization value of reduction. */
/* In the phi node at the header, replace the argument coming
from the preheader with the reduction initialization value. */
/* Create a new variable to initialize the reduction. */
type = TREE_TYPE (PHI_RESULT (reduc->reduc_phi));
bvar = create_tmp_var (type, "reduction");
add_referenced_var (bvar);
c = build_omp_clause (gimple_location (reduc->reduc_stmt),
OMP_CLAUSE_REDUCTION);
OMP_CLAUSE_REDUCTION_CODE (c) = reduc->reduction_code;
OMP_CLAUSE_DECL (c) = SSA_NAME_VAR (gimple_assign_lhs (reduc->reduc_stmt));
init = omp_reduction_init (c, TREE_TYPE (bvar));
reduc->init = init;
/* Replace the argument representing the initialization value
with the initialization value for the reduction (neutral
element for the particular operation, e.g. 0 for PLUS_EXPR,
1 for MULT_EXPR, etc).
Keep the old value in a new variable "reduction_initial",
that will be taken in consideration after the parallel
computing is done. */
e = loop_preheader_edge (loop);
arg = PHI_ARG_DEF_FROM_EDGE (reduc->reduc_phi, e);
/* Create new variable to hold the initial value. */
SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE
(reduc->reduc_phi, loop_preheader_edge (loop)), init);
reduc->initial_value = arg;
return 1;
}
struct elv_data
{
struct walk_stmt_info info;
edge entry;
htab_t decl_address;
bool changed;
};
/* Eliminates references to local variables in *TP out of the single
entry single exit region starting at DTA->ENTRY.
DECL_ADDRESS contains addresses of the references that had their
address taken already. If the expression is changed, CHANGED is
set to true. Callback for walk_tree. */
static tree
eliminate_local_variables_1 (tree *tp, int *walk_subtrees, void *data)
{
struct elv_data *const dta = (struct elv_data *) data;
tree t = *tp, var, addr, addr_type, type, obj;
if (DECL_P (t))
{
*walk_subtrees = 0;
if (!SSA_VAR_P (t) || DECL_EXTERNAL (t))
return NULL_TREE;
type = TREE_TYPE (t);
addr_type = build_pointer_type (type);
addr = take_address_of (t, addr_type, dta->entry, dta->decl_address);
*tp = build1 (INDIRECT_REF, TREE_TYPE (*tp), addr);
dta->changed = true;
return NULL_TREE;
}
if (TREE_CODE (t) == ADDR_EXPR)
{
/* ADDR_EXPR may appear in two contexts:
-- as a gimple operand, when the address taken is a function invariant
-- as gimple rhs, when the resulting address in not a function
invariant
We do not need to do anything special in the latter case (the base of
the memory reference whose address is taken may be replaced in the
DECL_P case). The former case is more complicated, as we need to
ensure that the new address is still a gimple operand. Thus, it
is not sufficient to replace just the base of the memory reference --
we need to move the whole computation of the address out of the
loop. */
if (!is_gimple_val (t))
return NULL_TREE;
*walk_subtrees = 0;
obj = TREE_OPERAND (t, 0);
var = get_base_address (obj);
if (!var || !SSA_VAR_P (var) || DECL_EXTERNAL (var))
return NULL_TREE;
addr_type = TREE_TYPE (t);
addr = take_address_of (obj, addr_type, dta->entry, dta->decl_address);
*tp = addr;
dta->changed = true;
return NULL_TREE;
}
if (!EXPR_P (t))
*walk_subtrees = 0;
return NULL_TREE;
}
/* Moves the references to local variables in STMT out of the single
entry single exit region starting at ENTRY. DECL_ADDRESS contains
addresses of the references that had their address taken
already. */
static void
eliminate_local_variables_stmt (edge entry, gimple stmt,
htab_t decl_address)
{
struct elv_data dta;
memset (&dta.info, '\0', sizeof (dta.info));
dta.entry = entry;
dta.decl_address = decl_address;
dta.changed = false;
if (gimple_debug_bind_p (stmt))
walk_tree (gimple_debug_bind_get_value_ptr (stmt),
eliminate_local_variables_1, &dta.info, NULL);
else
walk_gimple_op (stmt, eliminate_local_variables_1, &dta.info);
if (dta.changed)
update_stmt (stmt);
}
/* Eliminates the references to local variables from the single entry
single exit region between the ENTRY and EXIT edges.
This includes:
1) Taking address of a local variable -- these are moved out of the
region (and temporary variable is created to hold the address if
necessary).
2) Dereferencing a local variable -- these are replaced with indirect
references. */
static void
eliminate_local_variables (edge entry, edge exit)
{
basic_block bb;
VEC (basic_block, heap) *body = VEC_alloc (basic_block, heap, 3);
unsigned i;
gimple_stmt_iterator gsi;
htab_t decl_address = htab_create (10, int_tree_map_hash, int_tree_map_eq,
free);
basic_block entry_bb = entry->src;
basic_block exit_bb = exit->dest;
gather_blocks_in_sese_region (entry_bb, exit_bb, &body);
for (i = 0; VEC_iterate (basic_block, body, i, bb); i++)
if (bb != entry_bb && bb != exit_bb)
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
eliminate_local_variables_stmt (entry, gsi_stmt (gsi),
decl_address);
htab_delete (decl_address);
VEC_free (basic_block, heap, body);
}
/* Returns true if expression EXPR is not defined between ENTRY and
EXIT, i.e. if all its operands are defined outside of the region. */
static bool
expr_invariant_in_region_p (edge entry, edge exit, tree expr)
{
basic_block entry_bb = entry->src;
basic_block exit_bb = exit->dest;
basic_block def_bb;
if (is_gimple_min_invariant (expr))
return true;
if (TREE_CODE (expr) == SSA_NAME)
{
def_bb = gimple_bb (SSA_NAME_DEF_STMT (expr));
if (def_bb
&& dominated_by_p (CDI_DOMINATORS, def_bb, entry_bb)
&& !dominated_by_p (CDI_DOMINATORS, def_bb, exit_bb))
return false;
return true;
}
return false;
}
/* If COPY_NAME_P is true, creates and returns a duplicate of NAME.
The copies are stored to NAME_COPIES, if NAME was already duplicated,
its duplicate stored in NAME_COPIES is returned.
Regardless of COPY_NAME_P, the decl used as a base of the ssa name is also
duplicated, storing the copies in DECL_COPIES. */
static tree
separate_decls_in_region_name (tree name,
htab_t name_copies, htab_t decl_copies,
bool copy_name_p)
{
tree copy, var, var_copy;
unsigned idx, uid, nuid;
struct int_tree_map ielt, *nielt;
struct name_to_copy_elt elt, *nelt;
void **slot, **dslot;
if (TREE_CODE (name) != SSA_NAME)
return name;
idx = SSA_NAME_VERSION (name);
elt.version = idx;
slot = htab_find_slot_with_hash (name_copies, &elt, idx,
copy_name_p ? INSERT : NO_INSERT);
if (slot && *slot)
return ((struct name_to_copy_elt *) *slot)->new_name;
var = SSA_NAME_VAR (name);
uid = DECL_UID (var);
ielt.uid = uid;
dslot = htab_find_slot_with_hash (decl_copies, &ielt, uid, INSERT);
if (!*dslot)
{
var_copy = create_tmp_var (TREE_TYPE (var), get_name (var));
DECL_GIMPLE_REG_P (var_copy) = DECL_GIMPLE_REG_P (var);
add_referenced_var (var_copy);
nielt = XNEW (struct int_tree_map);
nielt->uid = uid;
nielt->to = var_copy;
*dslot = nielt;
/* Ensure that when we meet this decl next time, we won't duplicate
it again. */
nuid = DECL_UID (var_copy);
ielt.uid = nuid;
dslot = htab_find_slot_with_hash (decl_copies, &ielt, nuid, INSERT);
gcc_assert (!*dslot);
nielt = XNEW (struct int_tree_map);
nielt->uid = nuid;
nielt->to = var_copy;
*dslot = nielt;
}
else
var_copy = ((struct int_tree_map *) *dslot)->to;
if (copy_name_p)
{
copy = duplicate_ssa_name (name, NULL);
nelt = XNEW (struct name_to_copy_elt);
nelt->version = idx;
nelt->new_name = copy;
nelt->field = NULL_TREE;
*slot = nelt;
}
else
{
gcc_assert (!slot);
copy = name;
}
SSA_NAME_VAR (copy) = var_copy;
return copy;
}
/* Finds the ssa names used in STMT that are defined outside the
region between ENTRY and EXIT and replaces such ssa names with
their duplicates. The duplicates are stored to NAME_COPIES. Base
decls of all ssa names used in STMT (including those defined in
LOOP) are replaced with the new temporary variables; the
replacement decls are stored in DECL_COPIES. */
static void
separate_decls_in_region_stmt (edge entry, edge exit, gimple stmt,
htab_t name_copies, htab_t decl_copies)
{
use_operand_p use;
def_operand_p def;
ssa_op_iter oi;
tree name, copy;
bool copy_name_p;
mark_virtual_ops_for_renaming (stmt);
FOR_EACH_PHI_OR_STMT_DEF (def, stmt, oi, SSA_OP_DEF)
{
name = DEF_FROM_PTR (def);
gcc_assert (TREE_CODE (name) == SSA_NAME);
copy = separate_decls_in_region_name (name, name_copies, decl_copies,
false);
gcc_assert (copy == name);
}
FOR_EACH_PHI_OR_STMT_USE (use, stmt, oi, SSA_OP_USE)
{
name = USE_FROM_PTR (use);
if (TREE_CODE (name) != SSA_NAME)
continue;
copy_name_p = expr_invariant_in_region_p (entry, exit, name);
copy = separate_decls_in_region_name (name, name_copies, decl_copies,
copy_name_p);
SET_USE (use, copy);
}
}
/* Finds the ssa names used in STMT that are defined outside the
region between ENTRY and EXIT and replaces such ssa names with
their duplicates. The duplicates are stored to NAME_COPIES. Base
decls of all ssa names used in STMT (including those defined in
LOOP) are replaced with the new temporary variables; the
replacement decls are stored in DECL_COPIES. */
static bool
separate_decls_in_region_debug_bind (gimple stmt,
htab_t name_copies, htab_t decl_copies)
{
use_operand_p use;
ssa_op_iter oi;
tree var, name;
struct int_tree_map ielt;
struct name_to_copy_elt elt;
void **slot, **dslot;
var = gimple_debug_bind_get_var (stmt);
if (TREE_CODE (var) == DEBUG_EXPR_DECL)
return true;
gcc_assert (DECL_P (var) && SSA_VAR_P (var));
ielt.uid = DECL_UID (var);
dslot = htab_find_slot_with_hash (decl_copies, &ielt, ielt.uid, NO_INSERT);
if (!dslot)
return true;
gimple_debug_bind_set_var (stmt, ((struct int_tree_map *) *dslot)->to);
FOR_EACH_PHI_OR_STMT_USE (use, stmt, oi, SSA_OP_USE)
{
name = USE_FROM_PTR (use);
if (TREE_CODE (name) != SSA_NAME)
continue;
elt.version = SSA_NAME_VERSION (name);
slot = htab_find_slot_with_hash (name_copies, &elt, elt.version, NO_INSERT);
if (!slot)
{
gimple_debug_bind_reset_value (stmt);
update_stmt (stmt);
break;
}
SET_USE (use, ((struct name_to_copy_elt *) *slot)->new_name);
}
return false;
}
/* Callback for htab_traverse. Adds a field corresponding to the reduction
specified in SLOT. The type is passed in DATA. */
static int
add_field_for_reduction (void **slot, void *data)
{
struct reduction_info *const red = (struct reduction_info *) *slot;
tree const type = (tree) data;
tree var = SSA_NAME_VAR (gimple_assign_lhs (red->reduc_stmt));
tree field = build_decl (gimple_location (red->reduc_stmt),
FIELD_DECL, DECL_NAME (var), TREE_TYPE (var));
insert_field_into_struct (type, field);
red->field = field;
return 1;
}
/* Callback for htab_traverse. Adds a field corresponding to a ssa name
described in SLOT. The type is passed in DATA. */
static int
add_field_for_name (void **slot, void *data)
{
struct name_to_copy_elt *const elt = (struct name_to_copy_elt *) *slot;
tree type = (tree) data;
tree name = ssa_name (elt->version);
tree var = SSA_NAME_VAR (name);
tree field = build_decl (DECL_SOURCE_LOCATION (var),
FIELD_DECL, DECL_NAME (var), TREE_TYPE (var));
insert_field_into_struct (type, field);
elt->field = field;
return 1;
}
/* Callback for htab_traverse. A local result is the intermediate result
computed by a single
thread, or the initial value in case no iteration was executed.
This function creates a phi node reflecting these values.
The phi's result will be stored in NEW_PHI field of the
reduction's data structure. */
static int
create_phi_for_local_result (void **slot, void *data)
{
struct reduction_info *const reduc = (struct reduction_info *) *slot;
const struct loop *const loop = (const struct loop *) data;
edge e;
gimple new_phi;
basic_block store_bb;
tree local_res;
source_location locus;
/* STORE_BB is the block where the phi
should be stored. It is the destination of the loop exit.
(Find the fallthru edge from GIMPLE_OMP_CONTINUE). */
store_bb = FALLTHRU_EDGE (loop->latch)->dest;
/* STORE_BB has two predecessors. One coming from the loop
(the reduction's result is computed at the loop),
and another coming from a block preceding the loop,
when no iterations
are executed (the initial value should be taken). */
if (EDGE_PRED (store_bb, 0) == FALLTHRU_EDGE (loop->latch))
e = EDGE_PRED (store_bb, 1);
else
e = EDGE_PRED (store_bb, 0);
local_res
= make_ssa_name (SSA_NAME_VAR (gimple_assign_lhs (reduc->reduc_stmt)),
NULL);
locus = gimple_location (reduc->reduc_stmt);
new_phi = create_phi_node (local_res, store_bb);
SSA_NAME_DEF_STMT (local_res) = new_phi;
add_phi_arg (new_phi, reduc->init, e, locus);
add_phi_arg (new_phi, gimple_assign_lhs (reduc->reduc_stmt),
FALLTHRU_EDGE (loop->latch), locus);
reduc->new_phi = new_phi;
return 1;
}
struct clsn_data
{
tree store;
tree load;
basic_block store_bb;
basic_block load_bb;
};
/* Callback for htab_traverse. Create an atomic instruction for the
reduction described in SLOT.
DATA annotates the place in memory the atomic operation relates to,
and the basic block it needs to be generated in. */
static int
create_call_for_reduction_1 (void **slot, void *data)
{
struct reduction_info *const reduc = (struct reduction_info *) *slot;
struct clsn_data *const clsn_data = (struct clsn_data *) data;
gimple_stmt_iterator gsi;
tree type = TREE_TYPE (PHI_RESULT (reduc->reduc_phi));
tree struct_type = TREE_TYPE (TREE_TYPE (clsn_data->load));
tree load_struct;
basic_block bb;
basic_block new_bb;
edge e;
tree t, addr, ref, x;
tree tmp_load, name;
gimple load;
load_struct = fold_build1 (INDIRECT_REF, struct_type, clsn_data->load);
t = build3 (COMPONENT_REF, type, load_struct, reduc->field, NULL_TREE);
addr = build_addr (t, current_function_decl);
/* Create phi node. */
bb = clsn_data->load_bb;
e = split_block (bb, t);
new_bb = e->dest;
tmp_load = create_tmp_var (TREE_TYPE (TREE_TYPE (addr)), NULL);
add_referenced_var (tmp_load);
tmp_load = make_ssa_name (tmp_load, NULL);
load = gimple_build_omp_atomic_load (tmp_load, addr);
SSA_NAME_DEF_STMT (tmp_load) = load;
gsi = gsi_start_bb (new_bb);
gsi_insert_after (&gsi, load, GSI_NEW_STMT);
e = split_block (new_bb, load);
new_bb = e->dest;
gsi = gsi_start_bb (new_bb);
ref = tmp_load;
x = fold_build2 (reduc->reduction_code,
TREE_TYPE (PHI_RESULT (reduc->new_phi)), ref,
PHI_RESULT (reduc->new_phi));
name = force_gimple_operand_gsi (&gsi, x, true, NULL_TREE, true,
GSI_CONTINUE_LINKING);
gsi_insert_after (&gsi, gimple_build_omp_atomic_store (name), GSI_NEW_STMT);
return 1;
}
/* Create the atomic operation at the join point of the threads.
REDUCTION_LIST describes the reductions in the LOOP.
LD_ST_DATA describes the shared data structure where
shared data is stored in and loaded from. */
static void
create_call_for_reduction (struct loop *loop, htab_t reduction_list,
struct clsn_data *ld_st_data)
{
htab_traverse (reduction_list, create_phi_for_local_result, loop);
/* Find the fallthru edge from GIMPLE_OMP_CONTINUE. */
ld_st_data->load_bb = FALLTHRU_EDGE (loop->latch)->dest;
htab_traverse (reduction_list, create_call_for_reduction_1, ld_st_data);
}
/* Callback for htab_traverse. Loads the final reduction value at the
join point of all threads, and inserts it in the right place. */
static int
create_loads_for_reductions (void **slot, void *data)
{
struct reduction_info *const red = (struct reduction_info *) *slot;
struct clsn_data *const clsn_data = (struct clsn_data *) data;
gimple stmt;
gimple_stmt_iterator gsi;
tree type = TREE_TYPE (gimple_assign_lhs (red->reduc_stmt));
tree struct_type = TREE_TYPE (TREE_TYPE (clsn_data->load));
tree load_struct;
tree name;
tree x;
gsi = gsi_after_labels (clsn_data->load_bb);
load_struct = fold_build1 (INDIRECT_REF, struct_type, clsn_data->load);
load_struct = build3 (COMPONENT_REF, type, load_struct, red->field,
NULL_TREE);
x = load_struct;
name = PHI_RESULT (red->keep_res);
stmt = gimple_build_assign (name, x);
SSA_NAME_DEF_STMT (name) = stmt;
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
for (gsi = gsi_start_phis (gimple_bb (red->keep_res));
!gsi_end_p (gsi); gsi_next (&gsi))
if (gsi_stmt (gsi) == red->keep_res)
{
remove_phi_node (&gsi, false);
return 1;
}
gcc_unreachable ();
}
/* Load the reduction result that was stored in LD_ST_DATA.
REDUCTION_LIST describes the list of reductions that the
loads should be generated for. */
static void
create_final_loads_for_reduction (htab_t reduction_list,
struct clsn_data *ld_st_data)
{
gimple_stmt_iterator gsi;
tree t;
gimple stmt;
gsi = gsi_after_labels (ld_st_data->load_bb);
t = build_fold_addr_expr (ld_st_data->store);
stmt = gimple_build_assign (ld_st_data->load, t);
gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
SSA_NAME_DEF_STMT (ld_st_data->load) = stmt;
htab_traverse (reduction_list, create_loads_for_reductions, ld_st_data);
}
/* Callback for htab_traverse. Store the neutral value for the
particular reduction's operation, e.g. 0 for PLUS_EXPR,
1 for MULT_EXPR, etc. into the reduction field.
The reduction is specified in SLOT. The store information is
passed in DATA. */
static int
create_stores_for_reduction (void **slot, void *data)
{
struct reduction_info *const red = (struct reduction_info *) *slot;
struct clsn_data *const clsn_data = (struct clsn_data *) data;
tree t;
gimple stmt;
gimple_stmt_iterator gsi;
tree type = TREE_TYPE (gimple_assign_lhs (red->reduc_stmt));
gsi = gsi_last_bb (clsn_data->store_bb);
t = build3 (COMPONENT_REF, type, clsn_data->store, red->field, NULL_TREE);
stmt = gimple_build_assign (t, red->initial_value);
mark_virtual_ops_for_renaming (stmt);
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
return 1;
}
/* Callback for htab_traverse. Creates loads to a field of LOAD in LOAD_BB and
store to a field of STORE in STORE_BB for the ssa name and its duplicate
specified in SLOT. */
static int
create_loads_and_stores_for_name (void **slot, void *data)
{
struct name_to_copy_elt *const elt = (struct name_to_copy_elt *) *slot;
struct clsn_data *const clsn_data = (struct clsn_data *) data;
tree t;
gimple stmt;
gimple_stmt_iterator gsi;
tree type = TREE_TYPE (elt->new_name);
tree struct_type = TREE_TYPE (TREE_TYPE (clsn_data->load));
tree load_struct;
gsi = gsi_last_bb (clsn_data->store_bb);
t = build3 (COMPONENT_REF, type, clsn_data->store, elt->field, NULL_TREE);
stmt = gimple_build_assign (t, ssa_name (elt->version));
mark_virtual_ops_for_renaming (stmt);
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
gsi = gsi_last_bb (clsn_data->load_bb);
load_struct = fold_build1 (INDIRECT_REF, struct_type, clsn_data->load);
t = build3 (COMPONENT_REF, type, load_struct, elt->field, NULL_TREE);
stmt = gimple_build_assign (elt->new_name, t);
SSA_NAME_DEF_STMT (elt->new_name) = stmt;
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
return 1;
}
/* Moves all the variables used in LOOP and defined outside of it (including
the initial values of loop phi nodes, and *PER_THREAD if it is a ssa
name) to a structure created for this purpose. The code
while (1)
{
use (a);
use (b);
}
is transformed this way:
bb0:
old.a = a;
old.b = b;
bb1:
a' = new->a;
b' = new->b;
while (1)
{
use (a');
use (b');
}
`old' is stored to *ARG_STRUCT and `new' is stored to NEW_ARG_STRUCT. The
pointer `new' is intentionally not initialized (the loop will be split to a
separate function later, and `new' will be initialized from its arguments).
LD_ST_DATA holds information about the shared data structure used to pass
information among the threads. It is initialized here, and
gen_parallel_loop will pass it to create_call_for_reduction that
needs this information. REDUCTION_LIST describes the reductions
in LOOP. */
static void
separate_decls_in_region (edge entry, edge exit, htab_t reduction_list,
tree *arg_struct, tree *new_arg_struct,
struct clsn_data *ld_st_data)
{
basic_block bb1 = split_edge (entry);
basic_block bb0 = single_pred (bb1);
htab_t name_copies = htab_create (10, name_to_copy_elt_hash,
name_to_copy_elt_eq, free);
htab_t decl_copies = htab_create (10, int_tree_map_hash, int_tree_map_eq,
free);
unsigned i;
tree type, type_name, nvar;
gimple_stmt_iterator gsi;
struct clsn_data clsn_data;
VEC (basic_block, heap) *body = VEC_alloc (basic_block, heap, 3);
basic_block bb;
basic_block entry_bb = bb1;
basic_block exit_bb = exit->dest;
bool has_debug_stmt = false;
entry = single_succ_edge (entry_bb);
gather_blocks_in_sese_region (entry_bb, exit_bb, &body);
for (i = 0; VEC_iterate (basic_block, body, i, bb); i++)
{
if (bb != entry_bb && bb != exit_bb)
{
for (gsi = gsi_start_phis (bb); !gsi_end_p (gsi); gsi_next (&gsi))
separate_decls_in_region_stmt (entry, exit, gsi_stmt (gsi),
name_copies, decl_copies);
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple stmt = gsi_stmt (gsi);
if (is_gimple_debug (stmt))
has_debug_stmt = true;
else
separate_decls_in_region_stmt (entry, exit, stmt,
name_copies, decl_copies);
}
}
}
/* Now process debug bind stmts. We must not create decls while
processing debug stmts, so we defer their processing so as to
make sure we will have debug info for as many variables as
possible (all of those that were dealt with in the loop above),
and discard those for which we know there's nothing we can
do. */
if (has_debug_stmt)
for (i = 0; VEC_iterate (basic_block, body, i, bb); i++)
if (bb != entry_bb && bb != exit_bb)
{
for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi);)
{
gimple stmt = gsi_stmt (gsi);
if (gimple_debug_bind_p (stmt))
{
if (separate_decls_in_region_debug_bind (stmt,
name_copies,
decl_copies))
{
gsi_remove (&gsi, true);
continue;
}
}
gsi_next (&gsi);
}
}
VEC_free (basic_block, heap, body);
if (htab_elements (name_copies) == 0 && htab_elements (reduction_list) == 0)
{
/* It may happen that there is nothing to copy (if there are only
loop carried and external variables in the loop). */
*arg_struct = NULL;
*new_arg_struct = NULL;
}
else
{
/* Create the type for the structure to store the ssa names to. */
type = lang_hooks.types.make_type (RECORD_TYPE);
type_name = build_decl (BUILTINS_LOCATION,
TYPE_DECL, create_tmp_var_name (".paral_data"),
type);
TYPE_NAME (type) = type_name;
htab_traverse (name_copies, add_field_for_name, type);
if (reduction_list && htab_elements (reduction_list) > 0)
{
/* Create the fields for reductions. */
htab_traverse (reduction_list, add_field_for_reduction,
type);
}
layout_type (type);
/* Create the loads and stores. */
*arg_struct = create_tmp_var (type, ".paral_data_store");
add_referenced_var (*arg_struct);
nvar = create_tmp_var (build_pointer_type (type), ".paral_data_load");
add_referenced_var (nvar);
*new_arg_struct = make_ssa_name (nvar, NULL);
ld_st_data->store = *arg_struct;
ld_st_data->load = *new_arg_struct;
ld_st_data->store_bb = bb0;
ld_st_data->load_bb = bb1;
htab_traverse (name_copies, create_loads_and_stores_for_name,
ld_st_data);
/* Load the calculation from memory (after the join of the threads). */
if (reduction_list && htab_elements (reduction_list) > 0)
{
htab_traverse (reduction_list, create_stores_for_reduction,
ld_st_data);
clsn_data.load = make_ssa_name (nvar, NULL);
clsn_data.load_bb = exit->dest;
clsn_data.store = ld_st_data->store;
create_final_loads_for_reduction (reduction_list, &clsn_data);
}
}
htab_delete (decl_copies);
htab_delete (name_copies);
}
/* Bitmap containing uids of functions created by parallelization. We cannot
allocate it from the default obstack, as it must live across compilation
of several functions; we make it gc allocated instead. */
static GTY(()) bitmap parallelized_functions;
/* Returns true if FN was created by create_loop_fn. */
static bool
parallelized_function_p (tree fn)
{
if (!parallelized_functions || !DECL_ARTIFICIAL (fn))
return false;
return bitmap_bit_p (parallelized_functions, DECL_UID (fn));
}
/* Creates and returns an empty function that will receive the body of
a parallelized loop. */
static tree
create_loop_fn (void)
{
char buf[100];
char *tname;
tree decl, type, name, t;
struct function *act_cfun = cfun;
static unsigned loopfn_num;
snprintf (buf, 100, "%s.$loopfn", current_function_name ());
ASM_FORMAT_PRIVATE_NAME (tname, buf, loopfn_num++);
clean_symbol_name (tname);
name = get_identifier (tname);
type = build_function_type_list (void_type_node, ptr_type_node, NULL_TREE);
decl = build_decl (BUILTINS_LOCATION,
FUNCTION_DECL, name, type);
if (!parallelized_functions)
parallelized_functions = BITMAP_GGC_ALLOC ();
bitmap_set_bit (parallelized_functions, DECL_UID (decl));
TREE_STATIC (decl) = 1;
TREE_USED (decl) = 1;
DECL_ARTIFICIAL (decl) = 1;
DECL_IGNORED_P (decl) = 0;
TREE_PUBLIC (decl) = 0;
DECL_UNINLINABLE (decl) = 1;
DECL_EXTERNAL (decl) = 0;
DECL_CONTEXT (decl) = NULL_TREE;
DECL_INITIAL (decl) = make_node (BLOCK);
t = build_decl (BUILTINS_LOCATION,
RESULT_DECL, NULL_TREE, void_type_node);
DECL_ARTIFICIAL (t) = 1;
DECL_IGNORED_P (t) = 1;
DECL_RESULT (decl) = t;
t = build_decl (BUILTINS_LOCATION,
PARM_DECL, get_identifier (".paral_data_param"),
ptr_type_node);
DECL_ARTIFICIAL (t) = 1;
DECL_ARG_TYPE (t) = ptr_type_node;
DECL_CONTEXT (t) = decl;
TREE_USED (t) = 1;
DECL_ARGUMENTS (decl) = t;
allocate_struct_function (decl, false);
/* The call to allocate_struct_function clobbers CFUN, so we need to restore
it. */
set_cfun (act_cfun);
return decl;
}
/* Moves the exit condition of LOOP to the beginning of its header, and
duplicates the part of the last iteration that gets disabled to the
exit of the loop. NIT is the number of iterations of the loop
(used to initialize the variables in the duplicated part).
TODO: the common case is that latch of the loop is empty and immediately
follows the loop exit. In this case, it would be better not to copy the
body of the loop, but only move the entry of the loop directly before the
exit check and increase the number of iterations of the loop by one.
This may need some additional preconditioning in case NIT = ~0.
REDUCTION_LIST describes the reductions in LOOP. */
static void
transform_to_exit_first_loop (struct loop *loop, htab_t reduction_list, tree nit)
{
basic_block *bbs, *nbbs, ex_bb, orig_header;
unsigned n;
bool ok;
edge exit = single_dom_exit (loop), hpred;
tree control, control_name, res, t;
gimple phi, nphi, cond_stmt, stmt, cond_nit;
gimple_stmt_iterator gsi;
tree nit_1;
split_block_after_labels (loop->header);
orig_header = single_succ (loop->header);
hpred = single_succ_edge (loop->header);
cond_stmt = last_stmt (exit->src);
control = gimple_cond_lhs (cond_stmt);
gcc_assert (gimple_cond_rhs (cond_stmt) == nit);
/* Make sure that we have phi nodes on exit for all loop header phis
(create_parallel_loop requires that). */
for (gsi = gsi_start_phis (loop->header); !gsi_end_p (gsi); gsi_next (&gsi))
{
phi = gsi_stmt (gsi);
res = PHI_RESULT (phi);
t = make_ssa_name (SSA_NAME_VAR (res), phi);
SET_PHI_RESULT (phi, t);
nphi = create_phi_node (res, orig_header);
SSA_NAME_DEF_STMT (res) = nphi;
add_phi_arg (nphi, t, hpred, UNKNOWN_LOCATION);
if (res == control)
{
gimple_cond_set_lhs (cond_stmt, t);
update_stmt (cond_stmt);
control = t;
}
}
bbs = get_loop_body_in_dom_order (loop);
for (n = 0; bbs[n] != loop->latch; n++)
continue;
nbbs = XNEWVEC (basic_block, n);
ok = gimple_duplicate_sese_tail (single_succ_edge (loop->header), exit,
bbs + 1, n, nbbs);
gcc_assert (ok);
free (bbs);
ex_bb = nbbs[0];
free (nbbs);
/* Other than reductions, the only gimple reg that should be copied
out of the loop is the control variable. */
control_name = NULL_TREE;
for (gsi = gsi_start_phis (ex_bb); !gsi_end_p (gsi); )
{
phi = gsi_stmt (gsi);
res = PHI_RESULT (phi);
if (!is_gimple_reg (res))
{
gsi_next (&gsi);
continue;
}
/* Check if it is a part of reduction. If it is,
keep the phi at the reduction's keep_res field. The
PHI_RESULT of this phi is the resulting value of the reduction
variable when exiting the loop. */
exit = single_dom_exit (loop);
if (htab_elements (reduction_list) > 0)
{
struct reduction_info *red;
tree val = PHI_ARG_DEF_FROM_EDGE (phi, exit);
red = reduction_phi (reduction_list, SSA_NAME_DEF_STMT (val));
if (red)
{
red->keep_res = phi;
gsi_next (&gsi);
continue;
}
}
gcc_assert (control_name == NULL_TREE
&& SSA_NAME_VAR (res) == SSA_NAME_VAR (control));
control_name = res;
remove_phi_node (&gsi, false);
}
gcc_assert (control_name != NULL_TREE);
/* Initialize the control variable to number of iterations
according to the rhs of the exit condition. */
gsi = gsi_after_labels (ex_bb);
cond_nit = last_stmt (exit->src);
nit_1 = gimple_cond_rhs (cond_nit);
nit_1 = force_gimple_operand_gsi (&gsi,
fold_convert (TREE_TYPE (control_name), nit_1),
false, NULL_TREE, false, GSI_SAME_STMT);
stmt = gimple_build_assign (control_name, nit_1);
gsi_insert_before (&gsi, stmt, GSI_NEW_STMT);
SSA_NAME_DEF_STMT (control_name) = stmt;
}
/* Create the parallel constructs for LOOP as described in gen_parallel_loop.
LOOP_FN and DATA are the arguments of GIMPLE_OMP_PARALLEL.
NEW_DATA is the variable that should be initialized from the argument
of LOOP_FN. N_THREADS is the requested number of threads. Returns the
basic block containing GIMPLE_OMP_PARALLEL tree. */
static basic_block
create_parallel_loop (struct loop *loop, tree loop_fn, tree data,
tree new_data, unsigned n_threads)
{
gimple_stmt_iterator gsi;
basic_block bb, paral_bb, for_bb, ex_bb;
tree t, param;
gimple stmt, for_stmt, phi, cond_stmt;
tree cvar, cvar_init, initvar, cvar_next, cvar_base, type;
edge exit, nexit, guard, end, e;
/* Prepare the GIMPLE_OMP_PARALLEL statement. */
bb = loop_preheader_edge (loop)->src;
paral_bb = single_pred (bb);
gsi = gsi_last_bb (paral_bb);
t = build_omp_clause (BUILTINS_LOCATION, OMP_CLAUSE_NUM_THREADS);
OMP_CLAUSE_NUM_THREADS_EXPR (t)
= build_int_cst (integer_type_node, n_threads);
stmt = gimple_build_omp_parallel (NULL, t, loop_fn, data);
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
/* Initialize NEW_DATA. */
if (data)
{
gsi = gsi_after_labels (bb);
param = make_ssa_name (DECL_ARGUMENTS (loop_fn), NULL);
stmt = gimple_build_assign (param, build_fold_addr_expr (data));
gsi_insert_before (&gsi, stmt, GSI_SAME_STMT);
SSA_NAME_DEF_STMT (param) = stmt;
stmt = gimple_build_assign (new_data,
fold_convert (TREE_TYPE (new_data), param));
gsi_insert_before (&gsi, stmt, GSI_SAME_STMT);
SSA_NAME_DEF_STMT (new_data) = stmt;
}
/* Emit GIMPLE_OMP_RETURN for GIMPLE_OMP_PARALLEL. */
bb = split_loop_exit_edge (single_dom_exit (loop));
gsi = gsi_last_bb (bb);
gsi_insert_after (&gsi, gimple_build_omp_return (false), GSI_NEW_STMT);
/* Extract data for GIMPLE_OMP_FOR. */
gcc_assert (loop->header == single_dom_exit (loop)->src);
cond_stmt = last_stmt (loop->header);
cvar = gimple_cond_lhs (cond_stmt);
cvar_base = SSA_NAME_VAR (cvar);
phi = SSA_NAME_DEF_STMT (cvar);
cvar_init = PHI_ARG_DEF_FROM_EDGE (phi, loop_preheader_edge (loop));
initvar = make_ssa_name (cvar_base, NULL);
SET_USE (PHI_ARG_DEF_PTR_FROM_EDGE (phi, loop_preheader_edge (loop)),
initvar);
cvar_next = PHI_ARG_DEF_FROM_EDGE (phi, loop_latch_edge (loop));
gsi = gsi_last_bb (loop->latch);
gcc_assert (gsi_stmt (gsi) == SSA_NAME_DEF_STMT (cvar_next));
gsi_remove (&gsi, true);
/* Prepare cfg. */
for_bb = split_edge (loop_preheader_edge (loop));
ex_bb = split_loop_exit_edge (single_dom_exit (loop));
extract_true_false_edges_from_block (loop->header, &nexit, &exit);
gcc_assert (exit == single_dom_exit (loop));
guard = make_edge (for_bb, ex_bb, 0);
single_succ_edge (loop->latch)->flags = 0;
end = make_edge (loop->latch, ex_bb, EDGE_FALLTHRU);
for (gsi = gsi_start_phis (ex_bb); !gsi_end_p (gsi); gsi_next (&gsi))
{
source_location locus;
tree def;
phi = gsi_stmt (gsi);
stmt = SSA_NAME_DEF_STMT (PHI_ARG_DEF_FROM_EDGE (phi, exit));
def = PHI_ARG_DEF_FROM_EDGE (stmt, loop_preheader_edge (loop));
locus = gimple_phi_arg_location_from_edge (stmt,
loop_preheader_edge (loop));
add_phi_arg (phi, def, guard, locus);
def = PHI_ARG_DEF_FROM_EDGE (stmt, loop_latch_edge (loop));
locus = gimple_phi_arg_location_from_edge (stmt, loop_latch_edge (loop));
add_phi_arg (phi, def, end, locus);
}
e = redirect_edge_and_branch (exit, nexit->dest);
PENDING_STMT (e) = NULL;
/* Emit GIMPLE_OMP_FOR. */
gimple_cond_set_lhs (cond_stmt, cvar_base);
type = TREE_TYPE (cvar);
t = build_omp_clause (BUILTINS_LOCATION, OMP_CLAUSE_SCHEDULE);
OMP_CLAUSE_SCHEDULE_KIND (t) = OMP_CLAUSE_SCHEDULE_STATIC;
for_stmt = gimple_build_omp_for (NULL, t, 1, NULL);
gimple_omp_for_set_index (for_stmt, 0, initvar);
gimple_omp_for_set_initial (for_stmt, 0, cvar_init);
gimple_omp_for_set_final (for_stmt, 0, gimple_cond_rhs (cond_stmt));
gimple_omp_for_set_cond (for_stmt, 0, gimple_cond_code (cond_stmt));
gimple_omp_for_set_incr (for_stmt, 0, build2 (PLUS_EXPR, type,
cvar_base,
build_int_cst (type, 1)));
gsi = gsi_last_bb (for_bb);
gsi_insert_after (&gsi, for_stmt, GSI_NEW_STMT);
SSA_NAME_DEF_STMT (initvar) = for_stmt;
/* Emit GIMPLE_OMP_CONTINUE. */
gsi = gsi_last_bb (loop->latch);
stmt = gimple_build_omp_continue (cvar_next, cvar);
gsi_insert_after (&gsi, stmt, GSI_NEW_STMT);
SSA_NAME_DEF_STMT (cvar_next) = stmt;
/* Emit GIMPLE_OMP_RETURN for GIMPLE_OMP_FOR. */
gsi = gsi_last_bb (ex_bb);
gsi_insert_after (&gsi, gimple_build_omp_return (true), GSI_NEW_STMT);
return paral_bb;
}
/* Generates code to execute the iterations of LOOP in N_THREADS
threads in parallel.
NITER describes number of iterations of LOOP.
REDUCTION_LIST describes the reductions existent in the LOOP. */
static void
gen_parallel_loop (struct loop *loop, htab_t reduction_list,
unsigned n_threads, struct tree_niter_desc *niter)
{
loop_iterator li;
tree many_iterations_cond, type, nit;
tree arg_struct, new_arg_struct;
gimple_seq stmts;
basic_block parallel_head;
edge entry, exit;
struct clsn_data clsn_data;
unsigned prob;
/* From
---------------------------------------------------------------------
loop
{
IV = phi (INIT, IV + STEP)
BODY1;
if (COND)
break;
BODY2;
}
---------------------------------------------------------------------
with # of iterations NITER (possibly with MAY_BE_ZERO assumption),
we generate the following code:
---------------------------------------------------------------------
if (MAY_BE_ZERO
|| NITER < MIN_PER_THREAD * N_THREADS)
goto original;
BODY1;
store all local loop-invariant variables used in body of the loop to DATA.
GIMPLE_OMP_PARALLEL (OMP_CLAUSE_NUM_THREADS (N_THREADS), LOOPFN, DATA);
load the variables from DATA.
GIMPLE_OMP_FOR (IV = INIT; COND; IV += STEP) (OMP_CLAUSE_SCHEDULE (static))
BODY2;
BODY1;
GIMPLE_OMP_CONTINUE;
GIMPLE_OMP_RETURN -- GIMPLE_OMP_FOR
GIMPLE_OMP_RETURN -- GIMPLE_OMP_PARALLEL
goto end;
original:
loop
{
IV = phi (INIT, IV + STEP)
BODY1;
if (COND)
break;
BODY2;
}
end:
*/
/* Create two versions of the loop -- in the old one, we know that the
number of iterations is large enough, and we will transform it into the
loop that will be split to loop_fn, the new one will be used for the
remaining iterations. */
type = TREE_TYPE (niter->niter);
nit = force_gimple_operand (unshare_expr (niter->niter), &stmts, true,
NULL_TREE);
if (stmts)
gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts);
many_iterations_cond =
fold_build2 (GE_EXPR, boolean_type_node,
nit, build_int_cst (type, MIN_PER_THREAD * n_threads));
many_iterations_cond
= fold_build2 (TRUTH_AND_EXPR, boolean_type_node,
invert_truthvalue (unshare_expr (niter->may_be_zero)),
many_iterations_cond);
many_iterations_cond
= force_gimple_operand (many_iterations_cond, &stmts, false, NULL_TREE);
if (stmts)
gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts);
if (!is_gimple_condexpr (many_iterations_cond))
{
many_iterations_cond
= force_gimple_operand (many_iterations_cond, &stmts,
true, NULL_TREE);
if (stmts)
gsi_insert_seq_on_edge_immediate (loop_preheader_edge (loop), stmts);
}
initialize_original_copy_tables ();
/* We assume that the loop usually iterates a lot. */
prob = 4 * REG_BR_PROB_BASE / 5;
loop_version (loop, many_iterations_cond, NULL,
prob, prob, REG_BR_PROB_BASE - prob, true);
update_ssa (TODO_update_ssa);
free_original_copy_tables ();
/* Base all the induction variables in LOOP on a single control one. */
canonicalize_loop_ivs (loop, &nit, true);
/* Ensure that the exit condition is the first statement in the loop. */
transform_to_exit_first_loop (loop, reduction_list, nit);
/* Generate initializations for reductions. */
if (htab_elements (reduction_list) > 0)
htab_traverse (reduction_list, initialize_reductions, loop);
/* Eliminate the references to local variables from the loop. */
gcc_assert (single_exit (loop));
entry = loop_preheader_edge (loop);
exit = single_dom_exit (loop);
eliminate_local_variables (entry, exit);
/* In the old loop, move all variables non-local to the loop to a structure
and back, and create separate decls for the variables used in loop. */
separate_decls_in_region (entry, exit, reduction_list, &arg_struct,
&new_arg_struct, &clsn_data);
/* Create the parallel constructs. */
parallel_head = create_parallel_loop (loop, create_loop_fn (), arg_struct,
new_arg_struct, n_threads);
if (htab_elements (reduction_list) > 0)
create_call_for_reduction (loop, reduction_list, &clsn_data);
scev_reset ();
/* Cancel the loop (it is simpler to do it here rather than to teach the
expander to do it). */
cancel_loop_tree (loop);
/* Free loop bound estimations that could contain references to
removed statements. */
FOR_EACH_LOOP (li, loop, 0)
free_numbers_of_iterations_estimates_loop (loop);
/* Expand the parallel constructs. We do it directly here instead of running
a separate expand_omp pass, since it is more efficient, and less likely to
cause troubles with further analyses not being able to deal with the
OMP trees. */
omp_expand_local (parallel_head);
}
/* Returns true when LOOP contains vector phi nodes. */
static bool
loop_has_vector_phi_nodes (struct loop *loop ATTRIBUTE_UNUSED)
{
unsigned i;
basic_block *bbs = get_loop_body_in_dom_order (loop);
gimple_stmt_iterator gsi;
bool res = true;
for (i = 0; i < loop->num_nodes; i++)
for (gsi = gsi_start_phis (bbs[i]); !gsi_end_p (gsi); gsi_next (&gsi))
if (TREE_CODE (TREE_TYPE (PHI_RESULT (gsi_stmt (gsi)))) == VECTOR_TYPE)
goto end;
res = false;
end:
free (bbs);
return res;
}
/* Create a reduction_info struct, initialize it with REDUC_STMT
and PHI, insert it to the REDUCTION_LIST. */
static void
build_new_reduction (htab_t reduction_list, gimple reduc_stmt, gimple phi)
{
PTR *slot;
struct reduction_info *new_reduction;
gcc_assert (reduc_stmt);
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file,
"Detected reduction. reduction stmt is: \n");
print_gimple_stmt (dump_file, reduc_stmt, 0, 0);
fprintf (dump_file, "\n");
}
new_reduction = XCNEW (struct reduction_info);
new_reduction->reduc_stmt = reduc_stmt;
new_reduction->reduc_phi = phi;
new_reduction->reduction_code = gimple_assign_rhs_code (reduc_stmt);
slot = htab_find_slot (reduction_list, new_reduction, INSERT);
*slot = new_reduction;
}
/* Detect all reductions in the LOOP, insert them into REDUCTION_LIST. */
static void
gather_scalar_reductions (loop_p loop, htab_t reduction_list)
{
gimple_stmt_iterator gsi;
loop_vec_info simple_loop_info;
vect_dump = NULL;
simple_loop_info = vect_analyze_loop_form (loop);
for (gsi = gsi_start_phis (loop->header); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple phi = gsi_stmt (gsi);
affine_iv iv;
tree res = PHI_RESULT (phi);
bool double_reduc;
if (!is_gimple_reg (res))
continue;
if (!simple_iv (loop, loop, res, &iv, true)
&& simple_loop_info)
{
gimple reduc_stmt = vect_is_simple_reduction (simple_loop_info, phi, true, &double_reduc);
if (reduc_stmt && !double_reduc)
build_new_reduction (reduction_list, reduc_stmt, phi);
}
}
destroy_loop_vec_info (simple_loop_info, true);
}
/* Try to initialize NITER for code generation part. */
static bool
try_get_loop_niter (loop_p loop, struct tree_niter_desc *niter)
{
edge exit = single_dom_exit (loop);
gcc_assert (exit);
/* We need to know # of iterations, and there should be no uses of values
defined inside loop outside of it, unless the values are invariants of
the loop. */
if (!number_of_iterations_exit (loop, exit, niter, false))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, " FAILED: number of iterations not known\n");
return false;
}
return true;
}
/* Try to initialize REDUCTION_LIST for code generation part.
REDUCTION_LIST describes the reductions. */
static bool
try_create_reduction_list (loop_p loop, htab_t reduction_list)
{
edge exit = single_dom_exit (loop);
gimple_stmt_iterator gsi;
gcc_assert (exit);
gather_scalar_reductions (loop, reduction_list);
for (gsi = gsi_start_phis (exit->dest); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple phi = gsi_stmt (gsi);
struct reduction_info *red;
imm_use_iterator imm_iter;
use_operand_p use_p;
gimple reduc_phi;
tree val = PHI_ARG_DEF_FROM_EDGE (phi, exit);
if (is_gimple_reg (val))
{
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, "phi is ");
print_gimple_stmt (dump_file, phi, 0, 0);
fprintf (dump_file, "arg of phi to exit: value ");
print_generic_expr (dump_file, val, 0);
fprintf (dump_file, " used outside loop\n");
fprintf (dump_file,
" checking if it a part of reduction pattern: \n");
}
if (htab_elements (reduction_list) == 0)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" FAILED: it is not a part of reduction.\n");
return false;
}
reduc_phi = NULL;
FOR_EACH_IMM_USE_FAST (use_p, imm_iter, val)
{
if (flow_bb_inside_loop_p (loop, gimple_bb (USE_STMT (use_p))))
{
reduc_phi = USE_STMT (use_p);
break;
}
}
red = reduction_phi (reduction_list, reduc_phi);
if (red == NULL)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" FAILED: it is not a part of reduction.\n");
return false;
}
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, "reduction phi is ");
print_gimple_stmt (dump_file, red->reduc_phi, 0, 0);
fprintf (dump_file, "reduction stmt is ");
print_gimple_stmt (dump_file, red->reduc_stmt, 0, 0);
}
}
}
/* The iterations of the loop may communicate only through bivs whose
iteration space can be distributed efficiently. */
for (gsi = gsi_start_phis (loop->header); !gsi_end_p (gsi); gsi_next (&gsi))
{
gimple phi = gsi_stmt (gsi);
tree def = PHI_RESULT (phi);
affine_iv iv;
if (is_gimple_reg (def) && !simple_iv (loop, loop, def, &iv, true))
{
struct reduction_info *red;
red = reduction_phi (reduction_list, phi);
if (red == NULL)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file,
" FAILED: scalar dependency between iterations\n");
return false;
}
}
}
return true;
}
/* Detect parallel loops and generate parallel code using libgomp
primitives. Returns true if some loop was parallelized, false
otherwise. */
bool
parallelize_loops (void)
{
unsigned n_threads = flag_tree_parallelize_loops;
bool changed = false;
struct loop *loop;
struct tree_niter_desc niter_desc;
loop_iterator li;
htab_t reduction_list;
HOST_WIDE_INT estimated;
LOC loop_loc;
/* Do not parallelize loops in the functions created by parallelization. */
if (parallelized_function_p (cfun->decl))
return false;
if (cfun->has_nonlocal_label)
return false;
reduction_list = htab_create (10, reduction_info_hash,
reduction_info_eq, free);
init_stmt_vec_info_vec ();
FOR_EACH_LOOP (li, loop, 0)
{
htab_empty (reduction_list);
if (dump_file && (dump_flags & TDF_DETAILS))
{
fprintf (dump_file, "Trying loop %d as candidate\n",loop->num);
if (loop->inner)
fprintf (dump_file, "loop %d is not innermost\n",loop->num);
else
fprintf (dump_file, "loop %d is innermost\n",loop->num);
}
/* If we use autopar in graphite pass, we use its marked dependency
checking results. */
if (flag_loop_parallelize_all && !loop->can_be_parallel)
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "loop is not parallel according to graphite\n");
continue;
}
if (!single_dom_exit (loop))
{
if (dump_file && (dump_flags & TDF_DETAILS))
fprintf (dump_file, "loop is !single_dom_exit\n");
continue;
}
if (/* And of course, the loop must be parallelizable. */
!can_duplicate_loop_p (loop)
|| loop_has_blocks_with_irreducible_flag (loop)
|| (loop_preheader_edge (loop)->src->flags & BB_IRREDUCIBLE_LOOP)
/* FIXME: the check for vector phi nodes could be removed. */
|| loop_has_vector_phi_nodes (loop))
continue;
estimated = estimated_loop_iterations_int (loop, false);
/* FIXME: Bypass this check as graphite doesn't update the
count and frequency correctly now. */
if (!flag_loop_parallelize_all
&& ((estimated !=-1
&& estimated <= (HOST_WIDE_INT) n_threads * MIN_PER_THREAD)
/* Do not bother with loops in cold areas. */
|| optimize_loop_nest_for_size_p (loop)))
continue;
if (!try_get_loop_niter (loop, &niter_desc))
continue;
if (!try_create_reduction_list (loop, reduction_list))
continue;
if (!flag_loop_parallelize_all && !loop_parallel_p (loop))
continue;
changed = true;
if (dump_file && (dump_flags & TDF_DETAILS))
{
if (loop->inner)
fprintf (dump_file, "parallelizing outer loop %d\n",loop->header->index);
else
fprintf (dump_file, "parallelizing inner loop %d\n",loop->header->index);
loop_loc = find_loop_location (loop);
if (loop_loc != UNKNOWN_LOC)
fprintf (dump_file, "\nloop at %s:%d: ",
LOC_FILE (loop_loc), LOC_LINE (loop_loc));
}
gen_parallel_loop (loop, reduction_list,
n_threads, &niter_desc);
verify_flow_info ();
verify_dominators (CDI_DOMINATORS);
verify_loop_structure ();
verify_loop_closed_ssa ();
}
free_stmt_vec_info_vec ();
htab_delete (reduction_list);
/* Parallelization will cause new function calls to be inserted through
which local variables will escape. Reset the points-to solutions
for ESCAPED and CALLUSED. */
if (changed)
{
pt_solution_reset (&cfun->gimple_df->escaped);
pt_solution_reset (&cfun->gimple_df->callused);
}
return changed;
}
#include "gt-tree-parloops.h"
|
worklist.c | // -----------------------------------------------------------------------------
//
// "00_AccelGraph"
//
// -----------------------------------------------------------------------------
// Copyright (c) 2014-2019 All rights reserved
// -----------------------------------------------------------------------------
// Author : Abdullah Mughrabi
// Email : atmughra@ncsu.edu||atmughrabi@gmail.com
// File : bitmap.c
// Create : 2019-06-21 17:15:17
// Revise : 2019-09-28 15:36:13
// Editor : Abdullah Mughrabi
// -----------------------------------------------------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <stdint.h>
#include <omp.h>
#include "myMalloc.h"
#include "worklist.h"
void swapWorkLists (uint8_t **workList1, uint8_t **workList2)
{
uint8_t *workList_temp = *workList1;
*workList1 = *workList2;
*workList2 = workList_temp;
}
void resetWorkList(uint8_t *workList, uint32_t size)
{
uint32_t i;
#pragma omp parallel for
for(i = 0; i < size ; i++)
{
workList[i] = 0;
}
}
void setWorkList(uint8_t *workList, uint32_t size)
{
uint32_t i;
#pragma omp parallel for
for(i = 0; i < size ; i++)
{
workList[i] = 1;
}
} |
residualbased_predictorcorrector_velocity_bossak_ale_scheme.h | // | / |
// ' / __| _` | __| _ \ __|
// . \ | ( | | ( |\__ `
// _|\_\_| \__,_|\__|\___/ ____/
// Multi-Physics
//
// License: BSD License
// Kratos default license: kratos/license.txt
//
// Main authors: Ignasi de Pouplana
// Miguel Maso
//
#if !defined(KRATOS_RESIDUALBASED_PREDICTOR_CORRECTOR_VELOCITY_BOSSAK_ALE_SCHEME )
#define KRATOS_RESIDUALBASED_PREDICTOR_CORRECTOR_VELOCITY_BOSSAK_ALE_SCHEME
/* System includes */
/* External includes */
#include "boost/smart_ptr.hpp"
/* Project includes */
#include "includes/define.h"
#include "includes/model_part.h"
#include "includes/deprecated_variables.h"
#include "solving_strategies/schemes/scheme.h"
#include "includes/variables.h"
#include "includes/cfd_variables.h"
#include "containers/array_1d.h"
#include "utilities/openmp_utils.h"
#include "utilities/dof_updater.h"
#include "utilities/coordinate_transformation_utilities.h"
#include "processes/process.h"
#include "../../applications/FluidDynamicsApplication/custom_strategies/strategies/residualbased_predictorcorrector_velocity_bossak_scheme_turbulent.h"
namespace Kratos {
/**@name Kratos Globals */
/*@{ */
/*@} */
/**@name Type Definitions */
/*@{ */
/*@} */
/**@name Enum's */
/*@{ */
/*@} */
/**@name Functions */
/*@{ */
/*@} */
/**@name Kratos Classes */
/*@{ */
/// Bossak time scheme for the incompressible flow problem.
// template<template <class TSparseSpace, class TDenseSpace> class TSchemeType >
// class ResidualBasedPredictorCorrectorVelocityBossakAleScheme : public TSchemeType<TSparseSpace, TDenseSpace> {
template<class TSparseSpace, class TDenseSpace >
class ResidualBasedPredictorCorrectorVelocityBossakAleScheme : public ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace> {
public:
/**@name Type Definitions */
/*@{ */
KRATOS_CLASS_POINTER_DEFINITION(ResidualBasedPredictorCorrectorVelocityBossakAleScheme);
typedef Scheme<TSparseSpace, TDenseSpace> BaseType;
typedef ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace> SchemeType;
typedef typename BaseType::TDataType TDataType;
typedef typename BaseType::DofsArrayType DofsArrayType;
typedef typename Element::DofsVectorType DofsVectorType;
typedef typename BaseType::TSystemMatrixType TSystemMatrixType;
typedef typename BaseType::TSystemVectorType TSystemVectorType;
typedef typename BaseType::LocalSystemVectorType LocalSystemVectorType;
typedef typename BaseType::LocalSystemMatrixType LocalSystemMatrixType;
typedef Element::GeometryType GeometryType;
// using SchemeType::mRotationTool;
/*@} */
/**@name Life Cycle
*/
/*@{ */
/** Constructor without a turbulence model
*/
ResidualBasedPredictorCorrectorVelocityBossakAleScheme(
double NewAlphaBossak,
double MoveMeshStrategy,
unsigned int DomainSize)
: ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace>(NewAlphaBossak,MoveMeshStrategy,DomainSize)
{
}
/** Constructor without a turbulence model with periodic conditions
*/
ResidualBasedPredictorCorrectorVelocityBossakAleScheme(
double NewAlphaBossak,
unsigned int DomainSize,
const Variable<int>& rPeriodicIdVar)
: ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace>(NewAlphaBossak,DomainSize,rPeriodicIdVar)
{
}
/** Constructor without a turbulence model
*/
ResidualBasedPredictorCorrectorVelocityBossakAleScheme(
double NewAlphaBossak,
double MoveMeshStrategy,
unsigned int DomainSize,
Variable<double>& rSlipVar)
: ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace>(NewAlphaBossak,MoveMeshStrategy,rSlipVar)
{
}
/** Constructor with a turbulence model
*/
ResidualBasedPredictorCorrectorVelocityBossakAleScheme(
double NewAlphaBossak,
double MoveMeshStrategy,
unsigned int DomainSize,
Process::Pointer pTurbulenceModel)
: ResidualBasedPredictorCorrectorVelocityBossakSchemeTurbulent<TSparseSpace, TDenseSpace>(NewAlphaBossak,MoveMeshStrategy,DomainSize,pTurbulenceModel)
{
}
/** Destructor.
*/
~ResidualBasedPredictorCorrectorVelocityBossakAleScheme() override {
}
/*@} */
/**@name Operators
*/
/*@{ */
/**
Performing the update of the solution.
*/
//***************************************************************************
void Update(ModelPart& r_model_part,
DofsArrayType& rDofSet,
TSystemMatrixType& A,
TSystemVectorType& Dv,
TSystemVectorType& b) override
{
KRATOS_TRY;
SchemeType::Update(r_model_part,rDofSet,A,Dv,b);
this->Pfem2AdditionalUpdateOperations(r_model_part, rDofSet, A, Dv, b);
KRATOS_CATCH("")
}
//***************************************************************************
void Pfem2AdditionalUpdateOperations(ModelPart& rModelPart,
DofsArrayType& rDofSet,
TSystemMatrixType& A,
TSystemVectorType& Dv,
TSystemVectorType& b)
{
KRATOS_TRY
int NumThreads = OpenMPUtils::GetNumThreads();
OpenMPUtils::PartitionVector NodePartition;
OpenMPUtils::DivideInPartitions(rModelPart.Nodes().size(), NumThreads, NodePartition);
//updating time derivatives (nodally for efficiency)
#pragma omp parallel
{
int k = OpenMPUtils::ThisThread();
ModelPart::NodeIterator NodesBegin = rModelPart.NodesBegin() + NodePartition[k];
ModelPart::NodeIterator NodesEnd = rModelPart.NodesBegin() + NodePartition[k + 1];
for (ModelPart::NodeIterator itNode = NodesBegin; itNode != NodesEnd; itNode++) {
// Pfem2 ALE update to eliminate convective term
noalias(itNode->FastGetSolutionStepValue(MESH_VELOCITY)) = itNode->FastGetSolutionStepValue(VELOCITY);
}
}
KRATOS_CATCH("")
}
//***************************************************************************
//predicts the solution at the current step as
// v = vold
void Predict(ModelPart& rModelPart,
DofsArrayType& rDofSet,
TSystemMatrixType& A,
TSystemVectorType& Dv,
TSystemVectorType& b) override
{
// if (rModelPart.GetCommunicator().MyPID() == 0)
// std::cout << "prediction" << std::endl;
int NumThreads = OpenMPUtils::GetNumThreads();
OpenMPUtils::PartitionVector NodePartition;
OpenMPUtils::DivideInPartitions(rModelPart.Nodes().size(), NumThreads, NodePartition);
#pragma omp parallel
{
//array_1d<double, 3 > DeltaDisp;
int k = OpenMPUtils::ThisThread();
ModelPart::NodeIterator NodesBegin = rModelPart.NodesBegin() + NodePartition[k];
ModelPart::NodeIterator NodesEnd = rModelPart.NodesBegin() + NodePartition[k + 1];
for (ModelPart::NodeIterator itNode = NodesBegin; itNode != NodesEnd; itNode++) {
array_1d<double, 3 > & OldVelocity = (itNode)->FastGetSolutionStepValue(VELOCITY, 1);
double& OldPressure = (itNode)->FastGetSolutionStepValue(PRESSURE, 1);
//predicting velocity
//ATTENTION::: the prediction is performed only on free nodes
array_1d<double, 3 > & CurrentVelocity = (itNode)->FastGetSolutionStepValue(VELOCITY);
double& CurrentPressure = (itNode)->FastGetSolutionStepValue(PRESSURE);
if ((itNode->pGetDof(VELOCITY_X))->IsFree())
(CurrentVelocity[0]) = OldVelocity[0];
if (itNode->pGetDof(VELOCITY_Y)->IsFree())
(CurrentVelocity[1]) = OldVelocity[1];
if (itNode->HasDofFor(VELOCITY_Z))
if (itNode->pGetDof(VELOCITY_Z)->IsFree())
(CurrentVelocity[2]) = OldVelocity[2];
if (itNode->pGetDof(PRESSURE)->IsFree())
CurrentPressure = OldPressure;
// updating time derivatives ::: please note that displacements and
// their time derivatives can not be consistently fixed separately
array_1d<double, 3 > DeltaVel;
noalias(DeltaVel) = CurrentVelocity - OldVelocity;
array_1d<double, 3 > & OldAcceleration = (itNode)->FastGetSolutionStepValue(ACCELERATION, 1);
array_1d<double, 3 > & CurrentAcceleration = (itNode)->FastGetSolutionStepValue(ACCELERATION);
SchemeType::UpdateAcceleration(CurrentAcceleration, DeltaVel, OldAcceleration);
// Pfem2 ALE update to eliminate convective term
noalias(itNode->FastGetSolutionStepValue(MESH_VELOCITY)) = itNode->FastGetSolutionStepValue(VELOCITY);
}
}
}
/*@} */
/**@name Operations */
/*@{ */
/*@} */
/**@name Access */
/*@{ */
/*@} */
/**@name Inquiry */
/*@{ */
/*@} */
/**@name Friends */
/*@{ */
/*@} */
protected:
/**@name Protected static Member Variables */
/*@{ */
/*@} */
/**@name Protected member Variables */
/*@{ */
/*@} */
/**@name Protected Operators*/
/*@{ */
/*@} */
/**@name Protected Operations*/
/*@{ */
/*@} */
/**@name Protected Access */
/*@{ */
/*@} */
/**@name Protected Inquiry */
/*@{ */
/*@} */
/**@name Protected LifeCycle */
/*@{ */
/*@} */
private:
/**@name Static Member Variables */
/*@{ */
/*@} */
/**@name Member Variables */
/*@{ */
/*@} */
/**@name Private Operators*/
/*@{ */
/*@} */
/**@name Private Operations*/
/*@{ */
/*@} */
/**@name Private Access */
/*@{ */
/*@} */
/**@name Private Inquiry */
/*@{ */
/*@} */
/**@name Un accessible methods */
/*@{ */
/*@} */
}; /* Class ResidualBasedPredictorCorrectorVelocityBossakAleScheme */
/*@} */
/**@name Type Definitions */
/*@{ */
/*@} */
} /* namespace Kratos.*/
#endif /* KRATOS_RESIDUALBASED_PREDICTOR_CORRECTOR_VELOCITY_BOSSAK_ALE_SCHEME defined */
|
Sema.h | //===--- Sema.h - Semantic Analysis & AST Building --------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file defines the Sema class, which performs semantic analysis and
// builds ASTs.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_CLANG_SEMA_SEMA_H
#define LLVM_CLANG_SEMA_SEMA_H
#include "clang/AST/Attr.h"
#include "clang/AST/Availability.h"
#include "clang/AST/ComparisonCategories.h"
#include "clang/AST/DeclTemplate.h"
#include "clang/AST/DeclarationName.h"
#include "clang/AST/Expr.h"
#include "clang/AST/ExprCXX.h"
#include "clang/AST/ExprObjC.h"
#include "clang/AST/ExternalASTSource.h"
#include "clang/AST/LocInfoType.h"
#include "clang/AST/MangleNumberingContext.h"
#include "clang/AST/NSAPI.h"
#include "clang/AST/PrettyPrinter.h"
#include "clang/AST/StmtCXX.h"
#include "clang/AST/TypeLoc.h"
#include "clang/APINotes/APINotesManager.h"
#include "clang/AST/TypeOrdering.h"
#include "clang/Basic/ExpressionTraits.h"
#include "clang/Basic/Module.h"
#include "clang/Basic/OpenMPKinds.h"
#include "clang/Basic/PragmaKinds.h"
#include "clang/Basic/Specifiers.h"
#include "clang/Basic/TemplateKinds.h"
#include "clang/Basic/TypeTraits.h"
#include "clang/Sema/AnalysisBasedWarnings.h"
#include "clang/Sema/CleanupInfo.h"
#include "clang/Sema/DeclSpec.h"
#include "clang/Sema/ExternalSemaSource.h"
#include "clang/Sema/IdentifierResolver.h"
#include "clang/Sema/ObjCMethodList.h"
#include "clang/Sema/Ownership.h"
#include "clang/Sema/Scope.h"
#include "clang/Sema/TypoCorrection.h"
#include "clang/Sema/Weak.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/Optional.h"
#include "llvm/ADT/SetVector.h"
#include "llvm/ADT/SmallBitVector.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/TinyPtrVector.h"
#include <deque>
#include <functional>
#include <memory>
#include <string>
#include <tuple>
#include <vector>
namespace llvm {
class APSInt;
template <typename ValueT> struct DenseMapInfo;
template <typename ValueT, typename ValueInfoT> class DenseSet;
class SmallBitVector;
struct InlineAsmIdentifierInfo;
}
namespace clang {
class ADLResult;
class ASTConsumer;
class ASTContext;
class ASTMutationListener;
class ASTReader;
class ASTWriter;
class ArrayType;
class ParsedAttr;
class BindingDecl;
class BlockDecl;
class CapturedDecl;
class CXXBasePath;
class CXXBasePaths;
class CXXBindTemporaryExpr;
typedef SmallVector<CXXBaseSpecifier*, 4> CXXCastPath;
class CXXConstructorDecl;
class CXXConversionDecl;
class CXXDeleteExpr;
class CXXDestructorDecl;
class CXXFieldCollector;
class CXXMemberCallExpr;
class CXXMethodDecl;
class CXXScopeSpec;
class CXXTemporary;
class CXXTryStmt;
class CallExpr;
class ClassTemplateDecl;
class ClassTemplatePartialSpecializationDecl;
class ClassTemplateSpecializationDecl;
class VarTemplatePartialSpecializationDecl;
class CodeCompleteConsumer;
class CodeCompletionAllocator;
class CodeCompletionTUInfo;
class CodeCompletionResult;
class CoroutineBodyStmt;
class Decl;
class DeclAccessPair;
class DeclContext;
class DeclRefExpr;
class DeclaratorDecl;
class DeducedTemplateArgument;
class DependentDiagnostic;
class DesignatedInitExpr;
class Designation;
class EnableIfAttr;
class EnumConstantDecl;
class Expr;
class ExtVectorType;
class FormatAttr;
class FriendDecl;
class FunctionDecl;
class FunctionProtoType;
class FunctionTemplateDecl;
class ImplicitConversionSequence;
typedef MutableArrayRef<ImplicitConversionSequence> ConversionSequenceList;
class InitListExpr;
class InitializationKind;
class InitializationSequence;
class InitializedEntity;
class IntegerLiteral;
class LabelStmt;
class LambdaExpr;
class LangOptions;
class LocalInstantiationScope;
class LookupResult;
class MacroInfo;
typedef ArrayRef<std::pair<IdentifierInfo *, SourceLocation>> ModuleIdPath;
class ModuleLoader;
class MultiLevelTemplateArgumentList;
class NamedDecl;
class ObjCCategoryDecl;
class ObjCCategoryImplDecl;
class ObjCCompatibleAliasDecl;
class ObjCContainerDecl;
class ObjCImplDecl;
class ObjCImplementationDecl;
class ObjCInterfaceDecl;
class ObjCIvarDecl;
template <class T> class ObjCList;
class ObjCMessageExpr;
class ObjCMethodDecl;
class ObjCPropertyDecl;
class ObjCProtocolDecl;
class OMPThreadPrivateDecl;
class OMPRequiresDecl;
class OMPDeclareReductionDecl;
class OMPDeclareSimdDecl;
class OMPClause;
struct OMPVarListLocTy;
struct OverloadCandidate;
enum class OverloadCandidateParamOrder : char;
enum OverloadCandidateRewriteKind : unsigned;
class OverloadCandidateSet;
class OverloadExpr;
class ParenListExpr;
class ParmVarDecl;
class Preprocessor;
class PseudoDestructorTypeStorage;
class PseudoObjectExpr;
class QualType;
class StandardConversionSequence;
class Stmt;
class StringLiteral;
class SwitchStmt;
class TemplateArgument;
class TemplateArgumentList;
class TemplateArgumentLoc;
class TemplateDecl;
class TemplateInstantiationCallback;
class TemplateParameterList;
class TemplatePartialOrderingContext;
class TemplateTemplateParmDecl;
class Token;
class TypeAliasDecl;
class TypedefDecl;
class TypedefNameDecl;
class TypeLoc;
class TypoCorrectionConsumer;
class UnqualifiedId;
class UnresolvedLookupExpr;
class UnresolvedMemberExpr;
class UnresolvedSetImpl;
class UnresolvedSetIterator;
class UsingDecl;
class UsingShadowDecl;
class ValueDecl;
class VarDecl;
class VarTemplateSpecializationDecl;
class VisibilityAttr;
class VisibleDeclConsumer;
class IndirectFieldDecl;
struct DeductionFailureInfo;
class TemplateSpecCandidateSet;
namespace sema {
class AccessedEntity;
class BlockScopeInfo;
class Capture;
class CapturedRegionScopeInfo;
class CapturingScopeInfo;
class CompoundScopeInfo;
class DelayedDiagnostic;
class DelayedDiagnosticPool;
class FunctionScopeInfo;
class LambdaScopeInfo;
class PossiblyUnreachableDiag;
class SemaPPCallbacks;
class TemplateDeductionInfo;
}
namespace threadSafety {
class BeforeSet;
void threadSafetyCleanup(BeforeSet* Cache);
}
// FIXME: No way to easily map from TemplateTypeParmTypes to
// TemplateTypeParmDecls, so we have this horrible PointerUnion.
typedef std::pair<llvm::PointerUnion<const TemplateTypeParmType*, NamedDecl*>,
SourceLocation> UnexpandedParameterPack;
/// Describes whether we've seen any nullability information for the given
/// file.
struct FileNullability {
/// The first pointer declarator (of any pointer kind) in the file that does
/// not have a corresponding nullability annotation.
SourceLocation PointerLoc;
/// The end location for the first pointer declarator in the file. Used for
/// placing fix-its.
SourceLocation PointerEndLoc;
/// Which kind of pointer declarator we saw.
uint8_t PointerKind;
/// Whether we saw any type nullability annotations in the given file.
bool SawTypeNullability = false;
};
/// A mapping from file IDs to a record of whether we've seen nullability
/// information in that file.
class FileNullabilityMap {
/// A mapping from file IDs to the nullability information for each file ID.
llvm::DenseMap<FileID, FileNullability> Map;
/// A single-element cache based on the file ID.
struct {
FileID File;
FileNullability Nullability;
} Cache;
public:
FileNullability &operator[](FileID file) {
// Check the single-element cache.
if (file == Cache.File)
return Cache.Nullability;
// It's not in the single-element cache; flush the cache if we have one.
if (!Cache.File.isInvalid()) {
Map[Cache.File] = Cache.Nullability;
}
// Pull this entry into the cache.
Cache.File = file;
Cache.Nullability = Map[file];
return Cache.Nullability;
}
};
/// Keeps track of expected type during expression parsing. The type is tied to
/// a particular token, all functions that update or consume the type take a
/// start location of the token they are looking at as a parameter. This allows
/// to avoid updating the type on hot paths in the parser.
class PreferredTypeBuilder {
public:
PreferredTypeBuilder() = default;
explicit PreferredTypeBuilder(QualType Type) : Type(Type) {}
void enterCondition(Sema &S, SourceLocation Tok);
void enterReturn(Sema &S, SourceLocation Tok);
void enterVariableInit(SourceLocation Tok, Decl *D);
/// Computing a type for the function argument may require running
/// overloading, so we postpone its computation until it is actually needed.
///
/// Clients should be very careful when using this funciton, as it stores a
/// function_ref, clients should make sure all calls to get() with the same
/// location happen while function_ref is alive.
void enterFunctionArgument(SourceLocation Tok,
llvm::function_ref<QualType()> ComputeType);
void enterParenExpr(SourceLocation Tok, SourceLocation LParLoc);
void enterUnary(Sema &S, SourceLocation Tok, tok::TokenKind OpKind,
SourceLocation OpLoc);
void enterBinary(Sema &S, SourceLocation Tok, Expr *LHS, tok::TokenKind Op);
void enterMemAccess(Sema &S, SourceLocation Tok, Expr *Base);
void enterSubscript(Sema &S, SourceLocation Tok, Expr *LHS);
/// Handles all type casts, including C-style cast, C++ casts, etc.
void enterTypeCast(SourceLocation Tok, QualType CastType);
QualType get(SourceLocation Tok) const {
if (Tok != ExpectedLoc)
return QualType();
if (!Type.isNull())
return Type;
if (ComputeType)
return ComputeType();
return QualType();
}
private:
/// Start position of a token for which we store expected type.
SourceLocation ExpectedLoc;
/// Expected type for a token starting at ExpectedLoc.
QualType Type;
/// A function to compute expected type at ExpectedLoc. It is only considered
/// if Type is null.
llvm::function_ref<QualType()> ComputeType;
};
/// Sema - This implements semantic analysis and AST building for C.
class Sema {
Sema(const Sema &) = delete;
void operator=(const Sema &) = delete;
///Source of additional semantic information.
ExternalSemaSource *ExternalSource;
///Whether Sema has generated a multiplexer and has to delete it.
bool isMultiplexExternalSource;
static bool mightHaveNonExternalLinkage(const DeclaratorDecl *FD);
bool isVisibleSlow(const NamedDecl *D);
/// Determine whether two declarations should be linked together, given that
/// the old declaration might not be visible and the new declaration might
/// not have external linkage.
bool shouldLinkPossiblyHiddenDecl(const NamedDecl *Old,
const NamedDecl *New) {
if (isVisible(Old))
return true;
// See comment in below overload for why it's safe to compute the linkage
// of the new declaration here.
if (New->isExternallyDeclarable()) {
assert(Old->isExternallyDeclarable() &&
"should not have found a non-externally-declarable previous decl");
return true;
}
return false;
}
bool shouldLinkPossiblyHiddenDecl(LookupResult &Old, const NamedDecl *New);
void setupImplicitSpecialMemberType(CXXMethodDecl *SpecialMem,
QualType ResultTy,
ArrayRef<QualType> Args);
public:
typedef OpaquePtr<DeclGroupRef> DeclGroupPtrTy;
typedef OpaquePtr<TemplateName> TemplateTy;
typedef OpaquePtr<QualType> TypeTy;
OpenCLOptions OpenCLFeatures;
FPOptions FPFeatures;
const LangOptions &LangOpts;
Preprocessor &PP;
ASTContext &Context;
ASTConsumer &Consumer;
DiagnosticsEngine &Diags;
SourceManager &SourceMgr;
api_notes::APINotesManager APINotes;
/// Flag indicating whether or not to collect detailed statistics.
bool CollectStats;
/// Code-completion consumer.
CodeCompleteConsumer *CodeCompleter;
/// CurContext - This is the current declaration context of parsing.
DeclContext *CurContext;
/// Generally null except when we temporarily switch decl contexts,
/// like in \see ActOnObjCTemporaryExitContainerContext.
DeclContext *OriginalLexicalContext;
/// VAListTagName - The declaration name corresponding to __va_list_tag.
/// This is used as part of a hack to omit that class from ADL results.
DeclarationName VAListTagName;
bool MSStructPragmaOn; // True when \#pragma ms_struct on
/// Controls member pointer representation format under the MS ABI.
LangOptions::PragmaMSPointersToMembersKind
MSPointerToMemberRepresentationMethod;
/// Stack of active SEH __finally scopes. Can be empty.
SmallVector<Scope*, 2> CurrentSEHFinally;
/// Source location for newly created implicit MSInheritanceAttrs
SourceLocation ImplicitMSInheritanceAttrLoc;
/// Holds TypoExprs that are created from `createDelayedTypo`. This is used by
/// `TransformTypos` in order to keep track of any TypoExprs that are created
/// recursively during typo correction and wipe them away if the correction
/// fails.
llvm::SmallVector<TypoExpr *, 2> TypoExprs;
/// pragma clang section kind
enum PragmaClangSectionKind {
PCSK_Invalid = 0,
PCSK_BSS = 1,
PCSK_Data = 2,
PCSK_Rodata = 3,
PCSK_Text = 4,
PCSK_Relro = 5
};
enum PragmaClangSectionAction {
PCSA_Set = 0,
PCSA_Clear = 1
};
struct PragmaClangSection {
std::string SectionName;
bool Valid = false;
SourceLocation PragmaLocation;
void Act(SourceLocation PragmaLocation,
PragmaClangSectionAction Action,
StringLiteral* Name);
};
PragmaClangSection PragmaClangBSSSection;
PragmaClangSection PragmaClangDataSection;
PragmaClangSection PragmaClangRodataSection;
PragmaClangSection PragmaClangRelroSection;
PragmaClangSection PragmaClangTextSection;
enum PragmaMsStackAction {
PSK_Reset = 0x0, // #pragma ()
PSK_Set = 0x1, // #pragma (value)
PSK_Push = 0x2, // #pragma (push[, id])
PSK_Pop = 0x4, // #pragma (pop[, id])
PSK_Show = 0x8, // #pragma (show) -- only for "pack"!
PSK_Push_Set = PSK_Push | PSK_Set, // #pragma (push[, id], value)
PSK_Pop_Set = PSK_Pop | PSK_Set, // #pragma (pop[, id], value)
};
template<typename ValueType>
struct PragmaStack {
struct Slot {
llvm::StringRef StackSlotLabel;
ValueType Value;
SourceLocation PragmaLocation;
SourceLocation PragmaPushLocation;
Slot(llvm::StringRef StackSlotLabel, ValueType Value,
SourceLocation PragmaLocation, SourceLocation PragmaPushLocation)
: StackSlotLabel(StackSlotLabel), Value(Value),
PragmaLocation(PragmaLocation),
PragmaPushLocation(PragmaPushLocation) {}
};
void Act(SourceLocation PragmaLocation,
PragmaMsStackAction Action,
llvm::StringRef StackSlotLabel,
ValueType Value);
// MSVC seems to add artificial slots to #pragma stacks on entering a C++
// method body to restore the stacks on exit, so it works like this:
//
// struct S {
// #pragma <name>(push, InternalPragmaSlot, <current_pragma_value>)
// void Method {}
// #pragma <name>(pop, InternalPragmaSlot)
// };
//
// It works even with #pragma vtordisp, although MSVC doesn't support
// #pragma vtordisp(push [, id], n)
// syntax.
//
// Push / pop a named sentinel slot.
void SentinelAction(PragmaMsStackAction Action, StringRef Label) {
assert((Action == PSK_Push || Action == PSK_Pop) &&
"Can only push / pop #pragma stack sentinels!");
Act(CurrentPragmaLocation, Action, Label, CurrentValue);
}
// Constructors.
explicit PragmaStack(const ValueType &Default)
: DefaultValue(Default), CurrentValue(Default) {}
bool hasValue() const { return CurrentValue != DefaultValue; }
SmallVector<Slot, 2> Stack;
ValueType DefaultValue; // Value used for PSK_Reset action.
ValueType CurrentValue;
SourceLocation CurrentPragmaLocation;
};
// FIXME: We should serialize / deserialize these if they occur in a PCH (but
// we shouldn't do so if they're in a module).
/// Whether to insert vtordisps prior to virtual bases in the Microsoft
/// C++ ABI. Possible values are 0, 1, and 2, which mean:
///
/// 0: Suppress all vtordisps
/// 1: Insert vtordisps in the presence of vbase overrides and non-trivial
/// structors
/// 2: Always insert vtordisps to support RTTI on partially constructed
/// objects
PragmaStack<MSVtorDispAttr::Mode> VtorDispStack;
// #pragma pack.
// Sentinel to represent when the stack is set to mac68k alignment.
static const unsigned kMac68kAlignmentSentinel = ~0U;
PragmaStack<unsigned> PackStack;
// The current #pragma pack values and locations at each #include.
struct PackIncludeState {
unsigned CurrentValue;
SourceLocation CurrentPragmaLocation;
bool HasNonDefaultValue, ShouldWarnOnInclude;
};
SmallVector<PackIncludeState, 8> PackIncludeStack;
// Segment #pragmas.
PragmaStack<StringLiteral *> DataSegStack;
PragmaStack<StringLiteral *> BSSSegStack;
PragmaStack<StringLiteral *> ConstSegStack;
PragmaStack<StringLiteral *> CodeSegStack;
// RAII object to push / pop sentinel slots for all MS #pragma stacks.
// Actions should be performed only if we enter / exit a C++ method body.
class PragmaStackSentinelRAII {
public:
PragmaStackSentinelRAII(Sema &S, StringRef SlotLabel, bool ShouldAct);
~PragmaStackSentinelRAII();
private:
Sema &S;
StringRef SlotLabel;
bool ShouldAct;
};
/// A mapping that describes the nullability we've seen in each header file.
FileNullabilityMap NullabilityMap;
/// Last section used with #pragma init_seg.
StringLiteral *CurInitSeg;
SourceLocation CurInitSegLoc;
/// VisContext - Manages the stack for \#pragma GCC visibility.
void *VisContext; // Really a "PragmaVisStack*"
/// This an attribute introduced by \#pragma clang attribute.
struct PragmaAttributeEntry {
SourceLocation Loc;
ParsedAttr *Attribute;
SmallVector<attr::SubjectMatchRule, 4> MatchRules;
bool IsUsed;
};
/// A push'd group of PragmaAttributeEntries.
struct PragmaAttributeGroup {
/// The location of the push attribute.
SourceLocation Loc;
/// The namespace of this push group.
const IdentifierInfo *Namespace;
SmallVector<PragmaAttributeEntry, 2> Entries;
};
SmallVector<PragmaAttributeGroup, 2> PragmaAttributeStack;
/// The declaration that is currently receiving an attribute from the
/// #pragma attribute stack.
const Decl *PragmaAttributeCurrentTargetDecl;
/// This represents the last location of a "#pragma clang optimize off"
/// directive if such a directive has not been closed by an "on" yet. If
/// optimizations are currently "on", this is set to an invalid location.
SourceLocation OptimizeOffPragmaLocation;
/// Flag indicating if Sema is building a recovery call expression.
///
/// This flag is used to avoid building recovery call expressions
/// if Sema is already doing so, which would cause infinite recursions.
bool IsBuildingRecoveryCallExpr;
/// Used to control the generation of ExprWithCleanups.
CleanupInfo Cleanup;
/// ExprCleanupObjects - This is the stack of objects requiring
/// cleanup that are created by the current full expression. The
/// element type here is ExprWithCleanups::Object.
SmallVector<BlockDecl*, 8> ExprCleanupObjects;
/// Store a set of either DeclRefExprs or MemberExprs that contain a reference
/// to a variable (constant) that may or may not be odr-used in this Expr, and
/// we won't know until all lvalue-to-rvalue and discarded value conversions
/// have been applied to all subexpressions of the enclosing full expression.
/// This is cleared at the end of each full expression.
using MaybeODRUseExprSet = llvm::SmallPtrSet<Expr *, 2>;
MaybeODRUseExprSet MaybeODRUseExprs;
std::unique_ptr<sema::FunctionScopeInfo> CachedFunctionScope;
/// Stack containing information about each of the nested
/// function, block, and method scopes that are currently active.
SmallVector<sema::FunctionScopeInfo *, 4> FunctionScopes;
typedef LazyVector<TypedefNameDecl *, ExternalSemaSource,
&ExternalSemaSource::ReadExtVectorDecls, 2, 2>
ExtVectorDeclsType;
/// ExtVectorDecls - This is a list all the extended vector types. This allows
/// us to associate a raw vector type with one of the ext_vector type names.
/// This is only necessary for issuing pretty diagnostics.
ExtVectorDeclsType ExtVectorDecls;
/// FieldCollector - Collects CXXFieldDecls during parsing of C++ classes.
std::unique_ptr<CXXFieldCollector> FieldCollector;
typedef llvm::SmallSetVector<NamedDecl *, 16> NamedDeclSetType;
/// Set containing all declared private fields that are not used.
NamedDeclSetType UnusedPrivateFields;
/// Set containing all typedefs that are likely unused.
llvm::SmallSetVector<const TypedefNameDecl *, 4>
UnusedLocalTypedefNameCandidates;
/// Delete-expressions to be analyzed at the end of translation unit
///
/// This list contains class members, and locations of delete-expressions
/// that could not be proven as to whether they mismatch with new-expression
/// used in initializer of the field.
typedef std::pair<SourceLocation, bool> DeleteExprLoc;
typedef llvm::SmallVector<DeleteExprLoc, 4> DeleteLocs;
llvm::MapVector<FieldDecl *, DeleteLocs> DeleteExprs;
typedef llvm::SmallPtrSet<const CXXRecordDecl*, 8> RecordDeclSetTy;
/// PureVirtualClassDiagSet - a set of class declarations which we have
/// emitted a list of pure virtual functions. Used to prevent emitting the
/// same list more than once.
std::unique_ptr<RecordDeclSetTy> PureVirtualClassDiagSet;
/// ParsingInitForAutoVars - a set of declarations with auto types for which
/// we are currently parsing the initializer.
llvm::SmallPtrSet<const Decl*, 4> ParsingInitForAutoVars;
/// Look for a locally scoped extern "C" declaration by the given name.
NamedDecl *findLocallyScopedExternCDecl(DeclarationName Name);
typedef LazyVector<VarDecl *, ExternalSemaSource,
&ExternalSemaSource::ReadTentativeDefinitions, 2, 2>
TentativeDefinitionsType;
/// All the tentative definitions encountered in the TU.
TentativeDefinitionsType TentativeDefinitions;
typedef LazyVector<const DeclaratorDecl *, ExternalSemaSource,
&ExternalSemaSource::ReadUnusedFileScopedDecls, 2, 2>
UnusedFileScopedDeclsType;
/// The set of file scoped decls seen so far that have not been used
/// and must warn if not used. Only contains the first declaration.
UnusedFileScopedDeclsType UnusedFileScopedDecls;
typedef LazyVector<CXXConstructorDecl *, ExternalSemaSource,
&ExternalSemaSource::ReadDelegatingConstructors, 2, 2>
DelegatingCtorDeclsType;
/// All the delegating constructors seen so far in the file, used for
/// cycle detection at the end of the TU.
DelegatingCtorDeclsType DelegatingCtorDecls;
/// All the overriding functions seen during a class definition
/// that had their exception spec checks delayed, plus the overridden
/// function.
SmallVector<std::pair<const CXXMethodDecl*, const CXXMethodDecl*>, 2>
DelayedOverridingExceptionSpecChecks;
/// All the function redeclarations seen during a class definition that had
/// their exception spec checks delayed, plus the prior declaration they
/// should be checked against. Except during error recovery, the new decl
/// should always be a friend declaration, as that's the only valid way to
/// redeclare a special member before its class is complete.
SmallVector<std::pair<FunctionDecl*, FunctionDecl*>, 2>
DelayedEquivalentExceptionSpecChecks;
typedef llvm::MapVector<const FunctionDecl *,
std::unique_ptr<LateParsedTemplate>>
LateParsedTemplateMapT;
LateParsedTemplateMapT LateParsedTemplateMap;
/// Callback to the parser to parse templated functions when needed.
typedef void LateTemplateParserCB(void *P, LateParsedTemplate &LPT);
typedef void LateTemplateParserCleanupCB(void *P);
LateTemplateParserCB *LateTemplateParser;
LateTemplateParserCleanupCB *LateTemplateParserCleanup;
void *OpaqueParser;
void SetLateTemplateParser(LateTemplateParserCB *LTP,
LateTemplateParserCleanupCB *LTPCleanup,
void *P) {
LateTemplateParser = LTP;
LateTemplateParserCleanup = LTPCleanup;
OpaqueParser = P;
}
/// \brief Callback to the parser to parse a type expressed as a string.
std::function<TypeResult(StringRef, StringRef, SourceLocation)>
ParseTypeFromStringCallback;
class DelayedDiagnostics;
class DelayedDiagnosticsState {
sema::DelayedDiagnosticPool *SavedPool;
friend class Sema::DelayedDiagnostics;
};
typedef DelayedDiagnosticsState ParsingDeclState;
typedef DelayedDiagnosticsState ProcessingContextState;
/// A class which encapsulates the logic for delaying diagnostics
/// during parsing and other processing.
class DelayedDiagnostics {
/// The current pool of diagnostics into which delayed
/// diagnostics should go.
sema::DelayedDiagnosticPool *CurPool;
public:
DelayedDiagnostics() : CurPool(nullptr) {}
/// Adds a delayed diagnostic.
void add(const sema::DelayedDiagnostic &diag); // in DelayedDiagnostic.h
/// Determines whether diagnostics should be delayed.
bool shouldDelayDiagnostics() { return CurPool != nullptr; }
/// Returns the current delayed-diagnostics pool.
sema::DelayedDiagnosticPool *getCurrentPool() const {
return CurPool;
}
/// Enter a new scope. Access and deprecation diagnostics will be
/// collected in this pool.
DelayedDiagnosticsState push(sema::DelayedDiagnosticPool &pool) {
DelayedDiagnosticsState state;
state.SavedPool = CurPool;
CurPool = &pool;
return state;
}
/// Leave a delayed-diagnostic state that was previously pushed.
/// Do not emit any of the diagnostics. This is performed as part
/// of the bookkeeping of popping a pool "properly".
void popWithoutEmitting(DelayedDiagnosticsState state) {
CurPool = state.SavedPool;
}
/// Enter a new scope where access and deprecation diagnostics are
/// not delayed.
DelayedDiagnosticsState pushUndelayed() {
DelayedDiagnosticsState state;
state.SavedPool = CurPool;
CurPool = nullptr;
return state;
}
/// Undo a previous pushUndelayed().
void popUndelayed(DelayedDiagnosticsState state) {
assert(CurPool == nullptr);
CurPool = state.SavedPool;
}
} DelayedDiagnostics;
/// A RAII object to temporarily push a declaration context.
class ContextRAII {
private:
Sema &S;
DeclContext *SavedContext;
ProcessingContextState SavedContextState;
QualType SavedCXXThisTypeOverride;
public:
ContextRAII(Sema &S, DeclContext *ContextToPush, bool NewThisContext = true)
: S(S), SavedContext(S.CurContext),
SavedContextState(S.DelayedDiagnostics.pushUndelayed()),
SavedCXXThisTypeOverride(S.CXXThisTypeOverride)
{
assert(ContextToPush && "pushing null context");
S.CurContext = ContextToPush;
if (NewThisContext)
S.CXXThisTypeOverride = QualType();
}
void pop() {
if (!SavedContext) return;
S.CurContext = SavedContext;
S.DelayedDiagnostics.popUndelayed(SavedContextState);
S.CXXThisTypeOverride = SavedCXXThisTypeOverride;
SavedContext = nullptr;
}
~ContextRAII() {
pop();
}
};
/// Used to change context to isConstantEvaluated without pushing a heavy
/// ExpressionEvaluationContextRecord object.
bool isConstantEvaluatedOverride;
bool isConstantEvaluated() {
return ExprEvalContexts.back().isConstantEvaluated() ||
isConstantEvaluatedOverride;
}
/// RAII object to handle the state changes required to synthesize
/// a function body.
class SynthesizedFunctionScope {
Sema &S;
Sema::ContextRAII SavedContext;
bool PushedCodeSynthesisContext = false;
public:
SynthesizedFunctionScope(Sema &S, DeclContext *DC)
: S(S), SavedContext(S, DC) {
S.PushFunctionScope();
S.PushExpressionEvaluationContext(
Sema::ExpressionEvaluationContext::PotentiallyEvaluated);
if (auto *FD = dyn_cast<FunctionDecl>(DC))
FD->setWillHaveBody(true);
else
assert(isa<ObjCMethodDecl>(DC));
}
void addContextNote(SourceLocation UseLoc) {
assert(!PushedCodeSynthesisContext);
Sema::CodeSynthesisContext Ctx;
Ctx.Kind = Sema::CodeSynthesisContext::DefiningSynthesizedFunction;
Ctx.PointOfInstantiation = UseLoc;
Ctx.Entity = cast<Decl>(S.CurContext);
S.pushCodeSynthesisContext(Ctx);
PushedCodeSynthesisContext = true;
}
~SynthesizedFunctionScope() {
if (PushedCodeSynthesisContext)
S.popCodeSynthesisContext();
if (auto *FD = dyn_cast<FunctionDecl>(S.CurContext))
FD->setWillHaveBody(false);
S.PopExpressionEvaluationContext();
S.PopFunctionScopeInfo();
}
};
/// WeakUndeclaredIdentifiers - Identifiers contained in
/// \#pragma weak before declared. rare. may alias another
/// identifier, declared or undeclared
llvm::MapVector<IdentifierInfo *, WeakInfo> WeakUndeclaredIdentifiers;
/// ExtnameUndeclaredIdentifiers - Identifiers contained in
/// \#pragma redefine_extname before declared. Used in Solaris system headers
/// to define functions that occur in multiple standards to call the version
/// in the currently selected standard.
llvm::DenseMap<IdentifierInfo*,AsmLabelAttr*> ExtnameUndeclaredIdentifiers;
/// Load weak undeclared identifiers from the external source.
void LoadExternalWeakUndeclaredIdentifiers();
/// WeakTopLevelDecl - Translation-unit scoped declarations generated by
/// \#pragma weak during processing of other Decls.
/// I couldn't figure out a clean way to generate these in-line, so
/// we store them here and handle separately -- which is a hack.
/// It would be best to refactor this.
SmallVector<Decl*,2> WeakTopLevelDecl;
IdentifierResolver IdResolver;
/// Translation Unit Scope - useful to Objective-C actions that need
/// to lookup file scope declarations in the "ordinary" C decl namespace.
/// For example, user-defined classes, built-in "id" type, etc.
Scope *TUScope;
/// The C++ "std" namespace, where the standard library resides.
LazyDeclPtr StdNamespace;
/// The C++ "std::bad_alloc" class, which is defined by the C++
/// standard library.
LazyDeclPtr StdBadAlloc;
/// The C++ "std::align_val_t" enum class, which is defined by the C++
/// standard library.
LazyDeclPtr StdAlignValT;
/// The C++ "std::experimental" namespace, where the experimental parts
/// of the standard library resides.
NamespaceDecl *StdExperimentalNamespaceCache;
/// The C++ "std::initializer_list" template, which is defined in
/// \<initializer_list>.
ClassTemplateDecl *StdInitializerList;
/// The C++ "std::coroutine_traits" template, which is defined in
/// \<coroutine_traits>
ClassTemplateDecl *StdCoroutineTraitsCache;
/// The C++ "type_info" declaration, which is defined in \<typeinfo>.
RecordDecl *CXXTypeInfoDecl;
/// The MSVC "_GUID" struct, which is defined in MSVC header files.
RecordDecl *MSVCGuidDecl;
/// Caches identifiers/selectors for NSFoundation APIs.
std::unique_ptr<NSAPI> NSAPIObj;
/// The declaration of the Objective-C NSNumber class.
ObjCInterfaceDecl *NSNumberDecl;
/// The declaration of the Objective-C NSValue class.
ObjCInterfaceDecl *NSValueDecl;
/// Pointer to NSNumber type (NSNumber *).
QualType NSNumberPointer;
/// Pointer to NSValue type (NSValue *).
QualType NSValuePointer;
/// The Objective-C NSNumber methods used to create NSNumber literals.
ObjCMethodDecl *NSNumberLiteralMethods[NSAPI::NumNSNumberLiteralMethods];
/// The declaration of the Objective-C NSString class.
ObjCInterfaceDecl *NSStringDecl;
/// Pointer to NSString type (NSString *).
QualType NSStringPointer;
/// The declaration of the stringWithUTF8String: method.
ObjCMethodDecl *StringWithUTF8StringMethod;
/// The declaration of the valueWithBytes:objCType: method.
ObjCMethodDecl *ValueWithBytesObjCTypeMethod;
/// The declaration of the Objective-C NSArray class.
ObjCInterfaceDecl *NSArrayDecl;
/// The declaration of the arrayWithObjects:count: method.
ObjCMethodDecl *ArrayWithObjectsMethod;
/// The declaration of the Objective-C NSDictionary class.
ObjCInterfaceDecl *NSDictionaryDecl;
/// The declaration of the dictionaryWithObjects:forKeys:count: method.
ObjCMethodDecl *DictionaryWithObjectsMethod;
/// id<NSCopying> type.
QualType QIDNSCopying;
/// will hold 'respondsToSelector:'
Selector RespondsToSelectorSel;
/// A flag to remember whether the implicit forms of operator new and delete
/// have been declared.
bool GlobalNewDeleteDeclared;
/// A flag to indicate that we're in a context that permits abstract
/// references to fields. This is really a
bool AllowAbstractFieldReference;
/// Describes how the expressions currently being parsed are
/// evaluated at run-time, if at all.
enum class ExpressionEvaluationContext {
/// The current expression and its subexpressions occur within an
/// unevaluated operand (C++11 [expr]p7), such as the subexpression of
/// \c sizeof, where the type of the expression may be significant but
/// no code will be generated to evaluate the value of the expression at
/// run time.
Unevaluated,
/// The current expression occurs within a braced-init-list within
/// an unevaluated operand. This is mostly like a regular unevaluated
/// context, except that we still instantiate constexpr functions that are
/// referenced here so that we can perform narrowing checks correctly.
UnevaluatedList,
/// The current expression occurs within a discarded statement.
/// This behaves largely similarly to an unevaluated operand in preventing
/// definitions from being required, but not in other ways.
DiscardedStatement,
/// The current expression occurs within an unevaluated
/// operand that unconditionally permits abstract references to
/// fields, such as a SIZE operator in MS-style inline assembly.
UnevaluatedAbstract,
/// The current context is "potentially evaluated" in C++11 terms,
/// but the expression is evaluated at compile-time (like the values of
/// cases in a switch statement).
ConstantEvaluated,
/// The current expression is potentially evaluated at run time,
/// which means that code may be generated to evaluate the value of the
/// expression at run time.
PotentiallyEvaluated,
/// The current expression is potentially evaluated, but any
/// declarations referenced inside that expression are only used if
/// in fact the current expression is used.
///
/// This value is used when parsing default function arguments, for which
/// we would like to provide diagnostics (e.g., passing non-POD arguments
/// through varargs) but do not want to mark declarations as "referenced"
/// until the default argument is used.
PotentiallyEvaluatedIfUsed
};
/// Data structure used to record current or nested
/// expression evaluation contexts.
struct ExpressionEvaluationContextRecord {
/// The expression evaluation context.
ExpressionEvaluationContext Context;
/// Whether the enclosing context needed a cleanup.
CleanupInfo ParentCleanup;
/// Whether we are in a decltype expression.
bool IsDecltype;
/// The number of active cleanup objects when we entered
/// this expression evaluation context.
unsigned NumCleanupObjects;
/// The number of typos encountered during this expression evaluation
/// context (i.e. the number of TypoExprs created).
unsigned NumTypos;
MaybeODRUseExprSet SavedMaybeODRUseExprs;
/// The lambdas that are present within this context, if it
/// is indeed an unevaluated context.
SmallVector<LambdaExpr *, 2> Lambdas;
/// The declaration that provides context for lambda expressions
/// and block literals if the normal declaration context does not
/// suffice, e.g., in a default function argument.
Decl *ManglingContextDecl;
/// If we are processing a decltype type, a set of call expressions
/// for which we have deferred checking the completeness of the return type.
SmallVector<CallExpr *, 8> DelayedDecltypeCalls;
/// If we are processing a decltype type, a set of temporary binding
/// expressions for which we have deferred checking the destructor.
SmallVector<CXXBindTemporaryExpr *, 8> DelayedDecltypeBinds;
llvm::SmallPtrSet<const Expr *, 8> PossibleDerefs;
/// Expressions appearing as the LHS of a volatile assignment in this
/// context. We produce a warning for these when popping the context if
/// they are not discarded-value expressions nor unevaluated operands.
SmallVector<Expr*, 2> VolatileAssignmentLHSs;
/// \brief Describes whether we are in an expression constext which we have
/// to handle differently.
enum ExpressionKind {
EK_Decltype, EK_TemplateArgument, EK_Other
} ExprContext;
ExpressionEvaluationContextRecord(ExpressionEvaluationContext Context,
unsigned NumCleanupObjects,
CleanupInfo ParentCleanup,
Decl *ManglingContextDecl,
ExpressionKind ExprContext)
: Context(Context), ParentCleanup(ParentCleanup),
NumCleanupObjects(NumCleanupObjects), NumTypos(0),
ManglingContextDecl(ManglingContextDecl), ExprContext(ExprContext) {}
bool isUnevaluated() const {
return Context == ExpressionEvaluationContext::Unevaluated ||
Context == ExpressionEvaluationContext::UnevaluatedAbstract ||
Context == ExpressionEvaluationContext::UnevaluatedList;
}
bool isConstantEvaluated() const {
return Context == ExpressionEvaluationContext::ConstantEvaluated;
}
};
/// A stack of expression evaluation contexts.
SmallVector<ExpressionEvaluationContextRecord, 8> ExprEvalContexts;
/// Emit a warning for all pending noderef expressions that we recorded.
void WarnOnPendingNoDerefs(ExpressionEvaluationContextRecord &Rec);
/// Compute the mangling number context for a lambda expression or
/// block literal. Also return the extra mangling decl if any.
///
/// \param DC - The DeclContext containing the lambda expression or
/// block literal.
std::tuple<MangleNumberingContext *, Decl *>
getCurrentMangleNumberContext(const DeclContext *DC);
/// SpecialMemberOverloadResult - The overloading result for a special member
/// function.
///
/// This is basically a wrapper around PointerIntPair. The lowest bits of the
/// integer are used to determine whether overload resolution succeeded.
class SpecialMemberOverloadResult {
public:
enum Kind {
NoMemberOrDeleted,
Ambiguous,
Success
};
private:
llvm::PointerIntPair<CXXMethodDecl*, 2> Pair;
public:
SpecialMemberOverloadResult() : Pair() {}
SpecialMemberOverloadResult(CXXMethodDecl *MD)
: Pair(MD, MD->isDeleted() ? NoMemberOrDeleted : Success) {}
CXXMethodDecl *getMethod() const { return Pair.getPointer(); }
void setMethod(CXXMethodDecl *MD) { Pair.setPointer(MD); }
Kind getKind() const { return static_cast<Kind>(Pair.getInt()); }
void setKind(Kind K) { Pair.setInt(K); }
};
class SpecialMemberOverloadResultEntry
: public llvm::FastFoldingSetNode,
public SpecialMemberOverloadResult {
public:
SpecialMemberOverloadResultEntry(const llvm::FoldingSetNodeID &ID)
: FastFoldingSetNode(ID)
{}
};
/// A cache of special member function overload resolution results
/// for C++ records.
llvm::FoldingSet<SpecialMemberOverloadResultEntry> SpecialMemberCache;
/// A cache of the flags available in enumerations with the flag_bits
/// attribute.
mutable llvm::DenseMap<const EnumDecl*, llvm::APInt> FlagBitsCache;
/// The kind of translation unit we are processing.
///
/// When we're processing a complete translation unit, Sema will perform
/// end-of-translation-unit semantic tasks (such as creating
/// initializers for tentative definitions in C) once parsing has
/// completed. Modules and precompiled headers perform different kinds of
/// checks.
TranslationUnitKind TUKind;
llvm::BumpPtrAllocator BumpAlloc;
/// The number of SFINAE diagnostics that have been trapped.
unsigned NumSFINAEErrors;
typedef llvm::DenseMap<ParmVarDecl *, llvm::TinyPtrVector<ParmVarDecl *>>
UnparsedDefaultArgInstantiationsMap;
/// A mapping from parameters with unparsed default arguments to the
/// set of instantiations of each parameter.
///
/// This mapping is a temporary data structure used when parsing
/// nested class templates or nested classes of class templates,
/// where we might end up instantiating an inner class before the
/// default arguments of its methods have been parsed.
UnparsedDefaultArgInstantiationsMap UnparsedDefaultArgInstantiations;
// Contains the locations of the beginning of unparsed default
// argument locations.
llvm::DenseMap<ParmVarDecl *, SourceLocation> UnparsedDefaultArgLocs;
/// UndefinedInternals - all the used, undefined objects which require a
/// definition in this translation unit.
llvm::MapVector<NamedDecl *, SourceLocation> UndefinedButUsed;
/// Determine if VD, which must be a variable or function, is an external
/// symbol that nonetheless can't be referenced from outside this translation
/// unit because its type has no linkage and it's not extern "C".
bool isExternalWithNoLinkageType(ValueDecl *VD);
/// Obtain a sorted list of functions that are undefined but ODR-used.
void getUndefinedButUsed(
SmallVectorImpl<std::pair<NamedDecl *, SourceLocation> > &Undefined);
/// Retrieves list of suspicious delete-expressions that will be checked at
/// the end of translation unit.
const llvm::MapVector<FieldDecl *, DeleteLocs> &
getMismatchingDeleteExpressions() const;
typedef std::pair<ObjCMethodList, ObjCMethodList> GlobalMethods;
typedef llvm::DenseMap<Selector, GlobalMethods> GlobalMethodPool;
/// Method Pool - allows efficient lookup when typechecking messages to "id".
/// We need to maintain a list, since selectors can have differing signatures
/// across classes. In Cocoa, this happens to be extremely uncommon (only 1%
/// of selectors are "overloaded").
/// At the head of the list it is recorded whether there were 0, 1, or >= 2
/// methods inside categories with a particular selector.
GlobalMethodPool MethodPool;
/// Method selectors used in a \@selector expression. Used for implementation
/// of -Wselector.
llvm::MapVector<Selector, SourceLocation> ReferencedSelectors;
/// List of SourceLocations where 'self' is implicitly retained inside a
/// block.
llvm::SmallVector<std::pair<SourceLocation, const BlockDecl *>, 1>
ImplicitlyRetainedSelfLocs;
/// Kinds of C++ special members.
enum CXXSpecialMember {
CXXDefaultConstructor,
CXXCopyConstructor,
CXXMoveConstructor,
CXXCopyAssignment,
CXXMoveAssignment,
CXXDestructor,
CXXInvalid
};
typedef llvm::PointerIntPair<CXXRecordDecl *, 3, CXXSpecialMember>
SpecialMemberDecl;
/// The C++ special members which we are currently in the process of
/// declaring. If this process recursively triggers the declaration of the
/// same special member, we should act as if it is not yet declared.
llvm::SmallPtrSet<SpecialMemberDecl, 4> SpecialMembersBeingDeclared;
/// Kinds of defaulted comparison operator functions.
enum class DefaultedComparisonKind : unsigned char {
/// This is not a defaultable comparison operator.
None,
/// This is an operator== that should be implemented as a series of
/// subobject comparisons.
Equal,
/// This is an operator<=> that should be implemented as a series of
/// subobject comparisons.
ThreeWay,
/// This is an operator!= that should be implemented as a rewrite in terms
/// of a == comparison.
NotEqual,
/// This is an <, <=, >, or >= that should be implemented as a rewrite in
/// terms of a <=> comparison.
Relational,
};
/// The function definitions which were renamed as part of typo-correction
/// to match their respective declarations. We want to keep track of them
/// to ensure that we don't emit a "redefinition" error if we encounter a
/// correctly named definition after the renamed definition.
llvm::SmallPtrSet<const NamedDecl *, 4> TypoCorrectedFunctionDefinitions;
/// Stack of types that correspond to the parameter entities that are
/// currently being copy-initialized. Can be empty.
llvm::SmallVector<QualType, 4> CurrentParameterCopyTypes;
void ReadMethodPool(Selector Sel);
void updateOutOfDateSelector(Selector Sel);
/// Private Helper predicate to check for 'self'.
bool isSelfExpr(Expr *RExpr);
bool isSelfExpr(Expr *RExpr, const ObjCMethodDecl *Method);
/// Cause the active diagnostic on the DiagosticsEngine to be
/// emitted. This is closely coupled to the SemaDiagnosticBuilder class and
/// should not be used elsewhere.
void EmitCurrentDiagnostic(unsigned DiagID);
/// Records and restores the FP_CONTRACT state on entry/exit of compound
/// statements.
class FPContractStateRAII {
public:
FPContractStateRAII(Sema &S) : S(S), OldFPFeaturesState(S.FPFeatures) {}
~FPContractStateRAII() { S.FPFeatures = OldFPFeaturesState; }
private:
Sema& S;
FPOptions OldFPFeaturesState;
};
void addImplicitTypedef(StringRef Name, QualType T);
bool WarnedStackExhausted = false;
public:
Sema(Preprocessor &pp, ASTContext &ctxt, ASTConsumer &consumer,
TranslationUnitKind TUKind = TU_Complete,
CodeCompleteConsumer *CompletionConsumer = nullptr);
~Sema();
/// Perform initialization that occurs after the parser has been
/// initialized but before it parses anything.
void Initialize();
const LangOptions &getLangOpts() const { return LangOpts; }
OpenCLOptions &getOpenCLOptions() { return OpenCLFeatures; }
FPOptions &getFPOptions() { return FPFeatures; }
DiagnosticsEngine &getDiagnostics() const { return Diags; }
SourceManager &getSourceManager() const { return SourceMgr; }
Preprocessor &getPreprocessor() const { return PP; }
ASTContext &getASTContext() const { return Context; }
ASTConsumer &getASTConsumer() const { return Consumer; }
ASTMutationListener *getASTMutationListener() const;
ExternalSemaSource* getExternalSource() const { return ExternalSource; }
///Registers an external source. If an external source already exists,
/// creates a multiplex external source and appends to it.
///
///\param[in] E - A non-null external sema source.
///
void addExternalSource(ExternalSemaSource *E);
void PrintStats() const;
/// Warn that the stack is nearly exhausted.
void warnStackExhausted(SourceLocation Loc);
/// Run some code with "sufficient" stack space. (Currently, at least 256K is
/// guaranteed). Produces a warning if we're low on stack space and allocates
/// more in that case. Use this in code that may recurse deeply (for example,
/// in template instantiation) to avoid stack overflow.
void runWithSufficientStackSpace(SourceLocation Loc,
llvm::function_ref<void()> Fn);
/// Helper class that creates diagnostics with optional
/// template instantiation stacks.
///
/// This class provides a wrapper around the basic DiagnosticBuilder
/// class that emits diagnostics. SemaDiagnosticBuilder is
/// responsible for emitting the diagnostic (as DiagnosticBuilder
/// does) and, if the diagnostic comes from inside a template
/// instantiation, printing the template instantiation stack as
/// well.
class SemaDiagnosticBuilder : public DiagnosticBuilder {
Sema &SemaRef;
unsigned DiagID;
public:
SemaDiagnosticBuilder(DiagnosticBuilder &DB, Sema &SemaRef, unsigned DiagID)
: DiagnosticBuilder(DB), SemaRef(SemaRef), DiagID(DiagID) { }
// This is a cunning lie. DiagnosticBuilder actually performs move
// construction in its copy constructor (but due to varied uses, it's not
// possible to conveniently express this as actual move construction). So
// the default copy ctor here is fine, because the base class disables the
// source anyway, so the user-defined ~SemaDiagnosticBuilder is a safe no-op
// in that case anwyay.
SemaDiagnosticBuilder(const SemaDiagnosticBuilder&) = default;
~SemaDiagnosticBuilder() {
// If we aren't active, there is nothing to do.
if (!isActive()) return;
// Otherwise, we need to emit the diagnostic. First flush the underlying
// DiagnosticBuilder data, and clear the diagnostic builder itself so it
// won't emit the diagnostic in its own destructor.
//
// This seems wasteful, in that as written the DiagnosticBuilder dtor will
// do its own needless checks to see if the diagnostic needs to be
// emitted. However, because we take care to ensure that the builder
// objects never escape, a sufficiently smart compiler will be able to
// eliminate that code.
FlushCounts();
Clear();
// Dispatch to Sema to emit the diagnostic.
SemaRef.EmitCurrentDiagnostic(DiagID);
}
/// Teach operator<< to produce an object of the correct type.
template<typename T>
friend const SemaDiagnosticBuilder &operator<<(
const SemaDiagnosticBuilder &Diag, const T &Value) {
const DiagnosticBuilder &BaseDiag = Diag;
BaseDiag << Value;
return Diag;
}
};
/// Emit a diagnostic.
SemaDiagnosticBuilder Diag(SourceLocation Loc, unsigned DiagID) {
DiagnosticBuilder DB = Diags.Report(Loc, DiagID);
return SemaDiagnosticBuilder(DB, *this, DiagID);
}
/// Emit a partial diagnostic.
SemaDiagnosticBuilder Diag(SourceLocation Loc, const PartialDiagnostic& PD);
/// Build a partial diagnostic.
PartialDiagnostic PDiag(unsigned DiagID = 0); // in SemaInternal.h
bool findMacroSpelling(SourceLocation &loc, StringRef name);
/// Get a string to suggest for zero-initialization of a type.
std::string
getFixItZeroInitializerForType(QualType T, SourceLocation Loc) const;
std::string getFixItZeroLiteralForType(QualType T, SourceLocation Loc) const;
/// Calls \c Lexer::getLocForEndOfToken()
SourceLocation getLocForEndOfToken(SourceLocation Loc, unsigned Offset = 0);
/// Retrieve the module loader associated with the preprocessor.
ModuleLoader &getModuleLoader() const;
void emitAndClearUnusedLocalTypedefWarnings();
enum TUFragmentKind {
/// The global module fragment, between 'module;' and a module-declaration.
Global,
/// A normal translation unit fragment. For a non-module unit, this is the
/// entire translation unit. Otherwise, it runs from the module-declaration
/// to the private-module-fragment (if any) or the end of the TU (if not).
Normal,
/// The private module fragment, between 'module :private;' and the end of
/// the translation unit.
Private
};
void ActOnStartOfTranslationUnit();
void ActOnEndOfTranslationUnit();
void ActOnEndOfTranslationUnitFragment(TUFragmentKind Kind);
void CheckDelegatingCtorCycles();
Scope *getScopeForContext(DeclContext *Ctx);
void PushFunctionScope();
void PushBlockScope(Scope *BlockScope, BlockDecl *Block);
sema::LambdaScopeInfo *PushLambdaScope();
/// This is used to inform Sema what the current TemplateParameterDepth
/// is during Parsing. Currently it is used to pass on the depth
/// when parsing generic lambda 'auto' parameters.
void RecordParsingTemplateParameterDepth(unsigned Depth);
void PushCapturedRegionScope(Scope *RegionScope, CapturedDecl *CD,
RecordDecl *RD, CapturedRegionKind K,
unsigned OpenMPCaptureLevel = 0);
/// Custom deleter to allow FunctionScopeInfos to be kept alive for a short
/// time after they've been popped.
class PoppedFunctionScopeDeleter {
Sema *Self;
public:
explicit PoppedFunctionScopeDeleter(Sema *Self) : Self(Self) {}
void operator()(sema::FunctionScopeInfo *Scope) const;
};
using PoppedFunctionScopePtr =
std::unique_ptr<sema::FunctionScopeInfo, PoppedFunctionScopeDeleter>;
PoppedFunctionScopePtr
PopFunctionScopeInfo(const sema::AnalysisBasedWarnings::Policy *WP = nullptr,
const Decl *D = nullptr,
QualType BlockType = QualType());
sema::FunctionScopeInfo *getCurFunction() const {
return FunctionScopes.empty() ? nullptr : FunctionScopes.back();
}
sema::FunctionScopeInfo *getEnclosingFunction() const;
void setFunctionHasBranchIntoScope();
void setFunctionHasBranchProtectedScope();
void setFunctionHasIndirectGoto();
void PushCompoundScope(bool IsStmtExpr);
void PopCompoundScope();
sema::CompoundScopeInfo &getCurCompoundScope() const;
bool hasAnyUnrecoverableErrorsInThisFunction() const;
/// Retrieve the current block, if any.
sema::BlockScopeInfo *getCurBlock();
/// Get the innermost lambda enclosing the current location, if any. This
/// looks through intervening non-lambda scopes such as local functions and
/// blocks.
sema::LambdaScopeInfo *getEnclosingLambda() const;
/// Retrieve the current lambda scope info, if any.
/// \param IgnoreNonLambdaCapturingScope true if should find the top-most
/// lambda scope info ignoring all inner capturing scopes that are not
/// lambda scopes.
sema::LambdaScopeInfo *
getCurLambda(bool IgnoreNonLambdaCapturingScope = false);
/// Retrieve the current generic lambda info, if any.
sema::LambdaScopeInfo *getCurGenericLambda();
/// Retrieve the current captured region, if any.
sema::CapturedRegionScopeInfo *getCurCapturedRegion();
/// WeakTopLevelDeclDecls - access to \#pragma weak-generated Decls
SmallVectorImpl<Decl *> &WeakTopLevelDecls() { return WeakTopLevelDecl; }
void ActOnComment(SourceRange Comment);
//===--------------------------------------------------------------------===//
// Type Analysis / Processing: SemaType.cpp.
//
QualType BuildQualifiedType(QualType T, SourceLocation Loc, Qualifiers Qs,
const DeclSpec *DS = nullptr);
QualType BuildQualifiedType(QualType T, SourceLocation Loc, unsigned CVRA,
const DeclSpec *DS = nullptr);
QualType BuildPointerType(QualType T,
SourceLocation Loc, DeclarationName Entity);
QualType BuildReferenceType(QualType T, bool LValueRef,
SourceLocation Loc, DeclarationName Entity);
QualType BuildArrayType(QualType T, ArrayType::ArraySizeModifier ASM,
Expr *ArraySize, unsigned Quals,
SourceRange Brackets, DeclarationName Entity);
QualType BuildVectorType(QualType T, Expr *VecSize, SourceLocation AttrLoc);
QualType BuildExtVectorType(QualType T, Expr *ArraySize,
SourceLocation AttrLoc);
QualType BuildAddressSpaceAttr(QualType &T, LangAS ASIdx, Expr *AddrSpace,
SourceLocation AttrLoc);
/// Same as above, but constructs the AddressSpace index if not provided.
QualType BuildAddressSpaceAttr(QualType &T, Expr *AddrSpace,
SourceLocation AttrLoc);
bool CheckQualifiedFunctionForTypeId(QualType T, SourceLocation Loc);
bool CheckFunctionReturnType(QualType T, SourceLocation Loc);
/// Build a function type.
///
/// This routine checks the function type according to C++ rules and
/// under the assumption that the result type and parameter types have
/// just been instantiated from a template. It therefore duplicates
/// some of the behavior of GetTypeForDeclarator, but in a much
/// simpler form that is only suitable for this narrow use case.
///
/// \param T The return type of the function.
///
/// \param ParamTypes The parameter types of the function. This array
/// will be modified to account for adjustments to the types of the
/// function parameters.
///
/// \param Loc The location of the entity whose type involves this
/// function type or, if there is no such entity, the location of the
/// type that will have function type.
///
/// \param Entity The name of the entity that involves the function
/// type, if known.
///
/// \param EPI Extra information about the function type. Usually this will
/// be taken from an existing function with the same prototype.
///
/// \returns A suitable function type, if there are no errors. The
/// unqualified type will always be a FunctionProtoType.
/// Otherwise, returns a NULL type.
QualType BuildFunctionType(QualType T,
MutableArrayRef<QualType> ParamTypes,
SourceLocation Loc, DeclarationName Entity,
const FunctionProtoType::ExtProtoInfo &EPI);
QualType BuildMemberPointerType(QualType T, QualType Class,
SourceLocation Loc,
DeclarationName Entity);
QualType BuildBlockPointerType(QualType T,
SourceLocation Loc, DeclarationName Entity);
QualType BuildParenType(QualType T);
QualType BuildAtomicType(QualType T, SourceLocation Loc);
QualType BuildReadPipeType(QualType T,
SourceLocation Loc);
QualType BuildWritePipeType(QualType T,
SourceLocation Loc);
TypeSourceInfo *GetTypeForDeclarator(Declarator &D, Scope *S);
TypeSourceInfo *GetTypeForDeclaratorCast(Declarator &D, QualType FromTy);
/// Package the given type and TSI into a ParsedType.
ParsedType CreateParsedType(QualType T, TypeSourceInfo *TInfo);
DeclarationNameInfo GetNameForDeclarator(Declarator &D);
DeclarationNameInfo GetNameFromUnqualifiedId(const UnqualifiedId &Name);
static QualType GetTypeFromParser(ParsedType Ty,
TypeSourceInfo **TInfo = nullptr);
CanThrowResult canThrow(const Expr *E);
const FunctionProtoType *ResolveExceptionSpec(SourceLocation Loc,
const FunctionProtoType *FPT);
void UpdateExceptionSpec(FunctionDecl *FD,
const FunctionProtoType::ExceptionSpecInfo &ESI);
bool CheckSpecifiedExceptionType(QualType &T, SourceRange Range);
bool CheckDistantExceptionSpec(QualType T);
bool CheckEquivalentExceptionSpec(FunctionDecl *Old, FunctionDecl *New);
bool CheckEquivalentExceptionSpec(
const FunctionProtoType *Old, SourceLocation OldLoc,
const FunctionProtoType *New, SourceLocation NewLoc);
bool CheckEquivalentExceptionSpec(
const PartialDiagnostic &DiagID, const PartialDiagnostic & NoteID,
const FunctionProtoType *Old, SourceLocation OldLoc,
const FunctionProtoType *New, SourceLocation NewLoc);
bool handlerCanCatch(QualType HandlerType, QualType ExceptionType);
bool CheckExceptionSpecSubset(const PartialDiagnostic &DiagID,
const PartialDiagnostic &NestedDiagID,
const PartialDiagnostic &NoteID,
const PartialDiagnostic &NoThrowDiagID,
const FunctionProtoType *Superset,
SourceLocation SuperLoc,
const FunctionProtoType *Subset,
SourceLocation SubLoc);
bool CheckParamExceptionSpec(const PartialDiagnostic &NestedDiagID,
const PartialDiagnostic &NoteID,
const FunctionProtoType *Target,
SourceLocation TargetLoc,
const FunctionProtoType *Source,
SourceLocation SourceLoc);
TypeResult ActOnTypeName(Scope *S, Declarator &D);
/// The parser has parsed the context-sensitive type 'instancetype'
/// in an Objective-C message declaration. Return the appropriate type.
ParsedType ActOnObjCInstanceType(SourceLocation Loc);
/// Abstract class used to diagnose incomplete types.
struct TypeDiagnoser {
TypeDiagnoser() {}
virtual void diagnose(Sema &S, SourceLocation Loc, QualType T) = 0;
virtual ~TypeDiagnoser() {}
};
static int getPrintable(int I) { return I; }
static unsigned getPrintable(unsigned I) { return I; }
static bool getPrintable(bool B) { return B; }
static const char * getPrintable(const char *S) { return S; }
static StringRef getPrintable(StringRef S) { return S; }
static const std::string &getPrintable(const std::string &S) { return S; }
static const IdentifierInfo *getPrintable(const IdentifierInfo *II) {
return II;
}
static DeclarationName getPrintable(DeclarationName N) { return N; }
static QualType getPrintable(QualType T) { return T; }
static SourceRange getPrintable(SourceRange R) { return R; }
static SourceRange getPrintable(SourceLocation L) { return L; }
static SourceRange getPrintable(const Expr *E) { return E->getSourceRange(); }
static SourceRange getPrintable(TypeLoc TL) { return TL.getSourceRange();}
template <typename... Ts> class BoundTypeDiagnoser : public TypeDiagnoser {
unsigned DiagID;
std::tuple<const Ts &...> Args;
template <std::size_t... Is>
void emit(const SemaDiagnosticBuilder &DB,
std::index_sequence<Is...>) const {
// Apply all tuple elements to the builder in order.
bool Dummy[] = {false, (DB << getPrintable(std::get<Is>(Args)))...};
(void)Dummy;
}
public:
BoundTypeDiagnoser(unsigned DiagID, const Ts &...Args)
: TypeDiagnoser(), DiagID(DiagID), Args(Args...) {
assert(DiagID != 0 && "no diagnostic for type diagnoser");
}
void diagnose(Sema &S, SourceLocation Loc, QualType T) override {
const SemaDiagnosticBuilder &DB = S.Diag(Loc, DiagID);
emit(DB, std::index_sequence_for<Ts...>());
DB << T;
}
};
/// Do a check to make sure \p Name looks like a legal swift_name
/// attribute for the decl \p D. Raise a diagnostic if the name is invalid
/// for the given declaration.
///
/// For a function, this will validate a compound Swift name,
/// e.g. <code>init(foo:bar:baz:)</code> or <code>controllerForName(_:)</code>,
/// and the function will output the number of parameter names, and whether
/// this is a single-arg initializer.
///
/// For a type, enum constant, property, or variable declaration, this will
/// validate either a simple identifier, or a qualified
/// <code>context.identifier</code> name.
///
/// \returns true if the name is a valid swift name for \p D, false otherwise.
bool DiagnoseSwiftName(Decl *D, StringRef Name,
SourceLocation ArgLoc,
const IdentifierInfo *AttrName);
private:
/// Methods for marking which expressions involve dereferencing a pointer
/// marked with the 'noderef' attribute. Expressions are checked bottom up as
/// they are parsed, meaning that a noderef pointer may not be accessed. For
/// example, in `&*p` where `p` is a noderef pointer, we will first parse the
/// `*p`, but need to check that `address of` is called on it. This requires
/// keeping a container of all pending expressions and checking if the address
/// of them are eventually taken.
void CheckSubscriptAccessOfNoDeref(const ArraySubscriptExpr *E);
void CheckAddressOfNoDeref(const Expr *E);
void CheckMemberAccessOfNoDeref(const MemberExpr *E);
bool RequireCompleteTypeImpl(SourceLocation Loc, QualType T,
TypeDiagnoser *Diagnoser);
struct ModuleScope {
SourceLocation BeginLoc;
clang::Module *Module = nullptr;
bool ModuleInterface = false;
bool ImplicitGlobalModuleFragment = false;
VisibleModuleSet OuterVisibleModules;
};
/// The modules we're currently parsing.
llvm::SmallVector<ModuleScope, 16> ModuleScopes;
/// Namespace definitions that we will export when they finish.
llvm::SmallPtrSet<const NamespaceDecl*, 8> DeferredExportedNamespaces;
/// Get the module whose scope we are currently within.
Module *getCurrentModule() const {
return ModuleScopes.empty() ? nullptr : ModuleScopes.back().Module;
}
VisibleModuleSet VisibleModules;
public:
/// Get the module owning an entity.
Module *getOwningModule(Decl *Entity) { return Entity->getOwningModule(); }
/// Make a merged definition of an existing hidden definition \p ND
/// visible at the specified location.
void makeMergedDefinitionVisible(NamedDecl *ND);
bool isModuleVisible(const Module *M, bool ModulePrivate = false);
/// Determine whether a declaration is visible to name lookup.
bool isVisible(const NamedDecl *D) {
return !D->isHidden() || isVisibleSlow(D);
}
/// Determine whether any declaration of an entity is visible.
bool
hasVisibleDeclaration(const NamedDecl *D,
llvm::SmallVectorImpl<Module *> *Modules = nullptr) {
return isVisible(D) || hasVisibleDeclarationSlow(D, Modules);
}
bool hasVisibleDeclarationSlow(const NamedDecl *D,
llvm::SmallVectorImpl<Module *> *Modules);
bool hasVisibleMergedDefinition(NamedDecl *Def);
bool hasMergedDefinitionInCurrentModule(NamedDecl *Def);
/// Determine if \p D and \p Suggested have a structurally compatible
/// layout as described in C11 6.2.7/1.
bool hasStructuralCompatLayout(Decl *D, Decl *Suggested);
/// Determine if \p D has a visible definition. If not, suggest a declaration
/// that should be made visible to expose the definition.
bool hasVisibleDefinition(NamedDecl *D, NamedDecl **Suggested,
bool OnlyNeedComplete = false);
bool hasVisibleDefinition(const NamedDecl *D) {
NamedDecl *Hidden;
return hasVisibleDefinition(const_cast<NamedDecl*>(D), &Hidden);
}
/// Determine if the template parameter \p D has a visible default argument.
bool
hasVisibleDefaultArgument(const NamedDecl *D,
llvm::SmallVectorImpl<Module *> *Modules = nullptr);
/// Determine if there is a visible declaration of \p D that is an explicit
/// specialization declaration for a specialization of a template. (For a
/// member specialization, use hasVisibleMemberSpecialization.)
bool hasVisibleExplicitSpecialization(
const NamedDecl *D, llvm::SmallVectorImpl<Module *> *Modules = nullptr);
/// Determine if there is a visible declaration of \p D that is a member
/// specialization declaration (as opposed to an instantiated declaration).
bool hasVisibleMemberSpecialization(
const NamedDecl *D, llvm::SmallVectorImpl<Module *> *Modules = nullptr);
/// Determine if \p A and \p B are equivalent internal linkage declarations
/// from different modules, and thus an ambiguity error can be downgraded to
/// an extension warning.
bool isEquivalentInternalLinkageDeclaration(const NamedDecl *A,
const NamedDecl *B);
void diagnoseEquivalentInternalLinkageDeclarations(
SourceLocation Loc, const NamedDecl *D,
ArrayRef<const NamedDecl *> Equiv);
bool isUsualDeallocationFunction(const CXXMethodDecl *FD);
bool isCompleteType(SourceLocation Loc, QualType T) {
return !RequireCompleteTypeImpl(Loc, T, nullptr);
}
bool RequireCompleteType(SourceLocation Loc, QualType T,
TypeDiagnoser &Diagnoser);
bool RequireCompleteType(SourceLocation Loc, QualType T,
unsigned DiagID);
template <typename... Ts>
bool RequireCompleteType(SourceLocation Loc, QualType T, unsigned DiagID,
const Ts &...Args) {
BoundTypeDiagnoser<Ts...> Diagnoser(DiagID, Args...);
return RequireCompleteType(Loc, T, Diagnoser);
}
void completeExprArrayBound(Expr *E);
bool RequireCompleteExprType(Expr *E, TypeDiagnoser &Diagnoser);
bool RequireCompleteExprType(Expr *E, unsigned DiagID);
template <typename... Ts>
bool RequireCompleteExprType(Expr *E, unsigned DiagID, const Ts &...Args) {
BoundTypeDiagnoser<Ts...> Diagnoser(DiagID, Args...);
return RequireCompleteExprType(E, Diagnoser);
}
bool RequireLiteralType(SourceLocation Loc, QualType T,
TypeDiagnoser &Diagnoser);
bool RequireLiteralType(SourceLocation Loc, QualType T, unsigned DiagID);
template <typename... Ts>
bool RequireLiteralType(SourceLocation Loc, QualType T, unsigned DiagID,
const Ts &...Args) {
BoundTypeDiagnoser<Ts...> Diagnoser(DiagID, Args...);
return RequireLiteralType(Loc, T, Diagnoser);
}
QualType getElaboratedType(ElaboratedTypeKeyword Keyword,
const CXXScopeSpec &SS, QualType T,
TagDecl *OwnedTagDecl = nullptr);
QualType BuildTypeofExprType(Expr *E, SourceLocation Loc);
/// If AsUnevaluated is false, E is treated as though it were an evaluated
/// context, such as when building a type for decltype(auto).
QualType BuildDecltypeType(Expr *E, SourceLocation Loc,
bool AsUnevaluated = true);
QualType BuildUnaryTransformType(QualType BaseType,
UnaryTransformType::UTTKind UKind,
SourceLocation Loc);
//===--------------------------------------------------------------------===//
// Symbol table / Decl tracking callbacks: SemaDecl.cpp.
//
struct SkipBodyInfo {
SkipBodyInfo()
: ShouldSkip(false), CheckSameAsPrevious(false), Previous(nullptr),
New(nullptr) {}
bool ShouldSkip;
bool CheckSameAsPrevious;
NamedDecl *Previous;
NamedDecl *New;
};
DeclGroupPtrTy ConvertDeclToDeclGroup(Decl *Ptr, Decl *OwnedType = nullptr);
void DiagnoseUseOfUnimplementedSelectors();
bool isSimpleTypeSpecifier(tok::TokenKind Kind) const;
ParsedType getTypeName(const IdentifierInfo &II, SourceLocation NameLoc,
Scope *S, CXXScopeSpec *SS = nullptr,
bool isClassName = false, bool HasTrailingDot = false,
ParsedType ObjectType = nullptr,
bool IsCtorOrDtorName = false,
bool WantNontrivialTypeSourceInfo = false,
bool IsClassTemplateDeductionContext = true,
IdentifierInfo **CorrectedII = nullptr);
TypeSpecifierType isTagName(IdentifierInfo &II, Scope *S);
bool isMicrosoftMissingTypename(const CXXScopeSpec *SS, Scope *S);
void DiagnoseUnknownTypeName(IdentifierInfo *&II,
SourceLocation IILoc,
Scope *S,
CXXScopeSpec *SS,
ParsedType &SuggestedType,
bool IsTemplateName = false);
/// Attempt to behave like MSVC in situations where lookup of an unqualified
/// type name has failed in a dependent context. In these situations, we
/// automatically form a DependentTypeName that will retry lookup in a related
/// scope during instantiation.
ParsedType ActOnMSVCUnknownTypeName(const IdentifierInfo &II,
SourceLocation NameLoc,
bool IsTemplateTypeArg);
/// Describes the result of the name lookup and resolution performed
/// by \c ClassifyName().
enum NameClassificationKind {
/// This name is not a type or template in this context, but might be
/// something else.
NC_Unknown,
/// Classification failed; an error has been produced.
NC_Error,
/// The name has been typo-corrected to a keyword.
NC_Keyword,
/// The name was classified as a type.
NC_Type,
/// The name was classified as a specific non-type, non-template
/// declaration. ActOnNameClassifiedAsNonType should be called to
/// convert the declaration to an expression.
NC_NonType,
/// The name was classified as an ADL-only function name.
/// ActOnNameClassifiedAsUndeclaredNonType should be called to convert the
/// result to an expression.
NC_UndeclaredNonType,
/// The name denotes a member of a dependent type that could not be
/// resolved. ActOnNameClassifiedAsDependentNonType should be called to
/// convert the result to an expression.
NC_DependentNonType,
/// The name was classified as a non-type, and an expression representing
/// that name has been formed.
NC_ContextIndependentExpr,
/// The name was classified as a template whose specializations are types.
NC_TypeTemplate,
/// The name was classified as a variable template name.
NC_VarTemplate,
/// The name was classified as a function template name.
NC_FunctionTemplate,
/// The name was classified as an ADL-only function template name.
NC_UndeclaredTemplate,
};
class NameClassification {
NameClassificationKind Kind;
union {
ExprResult Expr;
NamedDecl *NonTypeDecl;
TemplateName Template;
ParsedType Type;
};
explicit NameClassification(NameClassificationKind Kind) : Kind(Kind) {}
public:
NameClassification(ParsedType Type) : Kind(NC_Type), Type(Type) {}
NameClassification(const IdentifierInfo *Keyword) : Kind(NC_Keyword) {}
static NameClassification Error() {
return NameClassification(NC_Error);
}
static NameClassification Unknown() {
return NameClassification(NC_Unknown);
}
static NameClassification ContextIndependentExpr(ExprResult E) {
NameClassification Result(NC_ContextIndependentExpr);
Result.Expr = E;
return Result;
}
static NameClassification NonType(NamedDecl *D) {
NameClassification Result(NC_NonType);
Result.NonTypeDecl = D;
return Result;
}
static NameClassification UndeclaredNonType() {
return NameClassification(NC_UndeclaredNonType);
}
static NameClassification DependentNonType() {
return NameClassification(NC_DependentNonType);
}
static NameClassification TypeTemplate(TemplateName Name) {
NameClassification Result(NC_TypeTemplate);
Result.Template = Name;
return Result;
}
static NameClassification VarTemplate(TemplateName Name) {
NameClassification Result(NC_VarTemplate);
Result.Template = Name;
return Result;
}
static NameClassification FunctionTemplate(TemplateName Name) {
NameClassification Result(NC_FunctionTemplate);
Result.Template = Name;
return Result;
}
static NameClassification UndeclaredTemplate(TemplateName Name) {
NameClassification Result(NC_UndeclaredTemplate);
Result.Template = Name;
return Result;
}
NameClassificationKind getKind() const { return Kind; }
ExprResult getExpression() const {
assert(Kind == NC_ContextIndependentExpr);
return Expr;
}
ParsedType getType() const {
assert(Kind == NC_Type);
return Type;
}
NamedDecl *getNonTypeDecl() const {
assert(Kind == NC_NonType);
return NonTypeDecl;
}
TemplateName getTemplateName() const {
assert(Kind == NC_TypeTemplate || Kind == NC_FunctionTemplate ||
Kind == NC_VarTemplate || Kind == NC_UndeclaredTemplate);
return Template;
}
TemplateNameKind getTemplateNameKind() const {
switch (Kind) {
case NC_TypeTemplate:
return TNK_Type_template;
case NC_FunctionTemplate:
return TNK_Function_template;
case NC_VarTemplate:
return TNK_Var_template;
case NC_UndeclaredTemplate:
return TNK_Undeclared_template;
default:
llvm_unreachable("unsupported name classification.");
}
}
};
/// Perform name lookup on the given name, classifying it based on
/// the results of name lookup and the following token.
///
/// This routine is used by the parser to resolve identifiers and help direct
/// parsing. When the identifier cannot be found, this routine will attempt
/// to correct the typo and classify based on the resulting name.
///
/// \param S The scope in which we're performing name lookup.
///
/// \param SS The nested-name-specifier that precedes the name.
///
/// \param Name The identifier. If typo correction finds an alternative name,
/// this pointer parameter will be updated accordingly.
///
/// \param NameLoc The location of the identifier.
///
/// \param NextToken The token following the identifier. Used to help
/// disambiguate the name.
///
/// \param CCC The correction callback, if typo correction is desired.
NameClassification ClassifyName(Scope *S, CXXScopeSpec &SS,
IdentifierInfo *&Name, SourceLocation NameLoc,
const Token &NextToken,
CorrectionCandidateCallback *CCC = nullptr);
/// Act on the result of classifying a name as an undeclared (ADL-only)
/// non-type declaration.
ExprResult ActOnNameClassifiedAsUndeclaredNonType(IdentifierInfo *Name,
SourceLocation NameLoc);
/// Act on the result of classifying a name as an undeclared member of a
/// dependent base class.
ExprResult ActOnNameClassifiedAsDependentNonType(const CXXScopeSpec &SS,
IdentifierInfo *Name,
SourceLocation NameLoc,
bool IsAddressOfOperand);
/// Act on the result of classifying a name as a specific non-type
/// declaration.
ExprResult ActOnNameClassifiedAsNonType(Scope *S, const CXXScopeSpec &SS,
NamedDecl *Found,
SourceLocation NameLoc,
const Token &NextToken);
/// Describes the detailed kind of a template name. Used in diagnostics.
enum class TemplateNameKindForDiagnostics {
ClassTemplate,
FunctionTemplate,
VarTemplate,
AliasTemplate,
TemplateTemplateParam,
Concept,
DependentTemplate
};
TemplateNameKindForDiagnostics
getTemplateNameKindForDiagnostics(TemplateName Name);
/// Determine whether it's plausible that E was intended to be a
/// template-name.
bool mightBeIntendedToBeTemplateName(ExprResult E, bool &Dependent) {
if (!getLangOpts().CPlusPlus || E.isInvalid())
return false;
Dependent = false;
if (auto *DRE = dyn_cast<DeclRefExpr>(E.get()))
return !DRE->hasExplicitTemplateArgs();
if (auto *ME = dyn_cast<MemberExpr>(E.get()))
return !ME->hasExplicitTemplateArgs();
Dependent = true;
if (auto *DSDRE = dyn_cast<DependentScopeDeclRefExpr>(E.get()))
return !DSDRE->hasExplicitTemplateArgs();
if (auto *DSME = dyn_cast<CXXDependentScopeMemberExpr>(E.get()))
return !DSME->hasExplicitTemplateArgs();
// Any additional cases recognized here should also be handled by
// diagnoseExprIntendedAsTemplateName.
return false;
}
void diagnoseExprIntendedAsTemplateName(Scope *S, ExprResult TemplateName,
SourceLocation Less,
SourceLocation Greater);
Decl *ActOnDeclarator(Scope *S, Declarator &D);
NamedDecl *HandleDeclarator(Scope *S, Declarator &D,
MultiTemplateParamsArg TemplateParameterLists);
void RegisterLocallyScopedExternCDecl(NamedDecl *ND, Scope *S);
bool DiagnoseClassNameShadow(DeclContext *DC, DeclarationNameInfo Info);
bool diagnoseQualifiedDeclaration(CXXScopeSpec &SS, DeclContext *DC,
DeclarationName Name, SourceLocation Loc,
bool IsTemplateId);
void
diagnoseIgnoredQualifiers(unsigned DiagID, unsigned Quals,
SourceLocation FallbackLoc,
SourceLocation ConstQualLoc = SourceLocation(),
SourceLocation VolatileQualLoc = SourceLocation(),
SourceLocation RestrictQualLoc = SourceLocation(),
SourceLocation AtomicQualLoc = SourceLocation(),
SourceLocation UnalignedQualLoc = SourceLocation());
void diagnosePointerAuthDisabled(SourceLocation loc, SourceRange range);
bool checkConstantPointerAuthKey(Expr *keyExpr, unsigned &key);
static bool adjustContextForLocalExternDecl(DeclContext *&DC);
void DiagnoseFunctionSpecifiers(const DeclSpec &DS);
NamedDecl *getShadowedDeclaration(const TypedefNameDecl *D,
const LookupResult &R);
NamedDecl *getShadowedDeclaration(const VarDecl *D, const LookupResult &R);
void CheckShadow(NamedDecl *D, NamedDecl *ShadowedDecl,
const LookupResult &R);
void CheckShadow(Scope *S, VarDecl *D);
/// Warn if 'E', which is an expression that is about to be modified, refers
/// to a shadowing declaration.
void CheckShadowingDeclModification(Expr *E, SourceLocation Loc);
void DiagnoseShadowingLambdaDecls(const sema::LambdaScopeInfo *LSI);
private:
/// Map of current shadowing declarations to shadowed declarations. Warn if
/// it looks like the user is trying to modify the shadowing declaration.
llvm::DenseMap<const NamedDecl *, const NamedDecl *> ShadowingDecls;
public:
void CheckCastAlign(Expr *Op, QualType T, SourceRange TRange);
void handleTagNumbering(const TagDecl *Tag, Scope *TagScope);
void setTagNameForLinkagePurposes(TagDecl *TagFromDeclSpec,
TypedefNameDecl *NewTD);
void CheckTypedefForVariablyModifiedType(Scope *S, TypedefNameDecl *D);
NamedDecl* ActOnTypedefDeclarator(Scope* S, Declarator& D, DeclContext* DC,
TypeSourceInfo *TInfo,
LookupResult &Previous);
NamedDecl* ActOnTypedefNameDecl(Scope* S, DeclContext* DC, TypedefNameDecl *D,
LookupResult &Previous, bool &Redeclaration);
NamedDecl *ActOnVariableDeclarator(Scope *S, Declarator &D, DeclContext *DC,
TypeSourceInfo *TInfo,
LookupResult &Previous,
MultiTemplateParamsArg TemplateParamLists,
bool &AddToScope,
ArrayRef<BindingDecl *> Bindings = None);
NamedDecl *
ActOnDecompositionDeclarator(Scope *S, Declarator &D,
MultiTemplateParamsArg TemplateParamLists);
// Returns true if the variable declaration is a redeclaration
bool CheckVariableDeclaration(VarDecl *NewVD, LookupResult &Previous);
void CheckVariableDeclarationType(VarDecl *NewVD);
bool DeduceVariableDeclarationType(VarDecl *VDecl, bool DirectInit,
Expr *Init);
void CheckCompleteVariableDeclaration(VarDecl *VD);
void CheckCompleteDecompositionDeclaration(DecompositionDecl *DD);
void MaybeSuggestAddingStaticToDecl(const FunctionDecl *D);
NamedDecl* ActOnFunctionDeclarator(Scope* S, Declarator& D, DeclContext* DC,
TypeSourceInfo *TInfo,
LookupResult &Previous,
MultiTemplateParamsArg TemplateParamLists,
bool &AddToScope);
bool AddOverriddenMethods(CXXRecordDecl *DC, CXXMethodDecl *MD);
enum class CheckConstexprKind {
/// Diagnose issues that are non-constant or that are extensions.
Diagnose,
/// Identify whether this function satisfies the formal rules for constexpr
/// functions in the current lanugage mode (with no extensions).
CheckValid
};
bool CheckConstexprFunctionDefinition(const FunctionDecl *FD,
CheckConstexprKind Kind);
void DiagnoseHiddenVirtualMethods(CXXMethodDecl *MD);
void FindHiddenVirtualMethods(CXXMethodDecl *MD,
SmallVectorImpl<CXXMethodDecl*> &OverloadedMethods);
void NoteHiddenVirtualMethods(CXXMethodDecl *MD,
SmallVectorImpl<CXXMethodDecl*> &OverloadedMethods);
// Returns true if the function declaration is a redeclaration
bool CheckFunctionDeclaration(Scope *S,
FunctionDecl *NewFD, LookupResult &Previous,
bool IsMemberSpecialization);
bool shouldLinkDependentDeclWithPrevious(Decl *D, Decl *OldDecl);
bool canFullyTypeCheckRedeclaration(ValueDecl *NewD, ValueDecl *OldD,
QualType NewT, QualType OldT);
void CheckMain(FunctionDecl *FD, const DeclSpec &D);
void CheckMSVCRTEntryPoint(FunctionDecl *FD);
Attr *getImplicitCodeSegOrSectionAttrForFunction(const FunctionDecl *FD,
bool IsDefinition);
void CheckFunctionOrTemplateParamDeclarator(Scope *S, Declarator &D);
Decl *ActOnParamDeclarator(Scope *S, Declarator &D);
ParmVarDecl *BuildParmVarDeclForTypedef(DeclContext *DC,
SourceLocation Loc,
QualType T);
QualType adjustParameterTypeForObjCAutoRefCount(QualType T,
SourceLocation NameLoc,
TypeSourceInfo *TSInfo);
ParmVarDecl *CheckParameter(DeclContext *DC, SourceLocation StartLoc,
SourceLocation NameLoc, IdentifierInfo *Name,
QualType T, TypeSourceInfo *TSInfo,
StorageClass SC);
void ActOnParamDefaultArgument(Decl *param,
SourceLocation EqualLoc,
Expr *defarg);
void ActOnParamUnparsedDefaultArgument(Decl *param,
SourceLocation EqualLoc,
SourceLocation ArgLoc);
void ActOnParamDefaultArgumentError(Decl *param, SourceLocation EqualLoc);
bool SetParamDefaultArgument(ParmVarDecl *Param, Expr *DefaultArg,
SourceLocation EqualLoc);
// Contexts where using non-trivial C union types can be disallowed. This is
// passed to err_non_trivial_c_union_in_invalid_context.
enum NonTrivialCUnionContext {
// Function parameter.
NTCUC_FunctionParam,
// Function return.
NTCUC_FunctionReturn,
// Default-initialized object.
NTCUC_DefaultInitializedObject,
// Variable with automatic storage duration.
NTCUC_AutoVar,
// Initializer expression that might copy from another object.
NTCUC_CopyInit,
// Assignment.
NTCUC_Assignment,
// Compound literal.
NTCUC_CompoundLiteral,
// Block capture.
NTCUC_BlockCapture,
// lvalue-to-rvalue conversion of volatile type.
NTCUC_LValueToRValueVolatile,
};
/// Emit diagnostics if the initializer or any of its explicit or
/// implicitly-generated subexpressions require copying or
/// default-initializing a type that is or contains a C union type that is
/// non-trivial to copy or default-initialize.
void checkNonTrivialCUnionInInitializer(const Expr *Init, SourceLocation Loc);
// These flags are passed to checkNonTrivialCUnion.
enum NonTrivialCUnionKind {
NTCUK_Init = 0x1,
NTCUK_Destruct = 0x2,
NTCUK_Copy = 0x4,
};
/// Emit diagnostics if a non-trivial C union type or a struct that contains
/// a non-trivial C union is used in an invalid context.
void checkNonTrivialCUnion(QualType QT, SourceLocation Loc,
NonTrivialCUnionContext UseContext,
unsigned NonTrivialKind);
void AddInitializerToDecl(Decl *dcl, Expr *init, bool DirectInit);
void ActOnUninitializedDecl(Decl *dcl);
void ActOnInitializerError(Decl *Dcl);
void ActOnPureSpecifier(Decl *D, SourceLocation PureSpecLoc);
void ActOnCXXForRangeDecl(Decl *D);
StmtResult ActOnCXXForRangeIdentifier(Scope *S, SourceLocation IdentLoc,
IdentifierInfo *Ident,
ParsedAttributes &Attrs,
SourceLocation AttrEnd);
void SetDeclDeleted(Decl *dcl, SourceLocation DelLoc);
void SetDeclDefaulted(Decl *dcl, SourceLocation DefaultLoc);
void CheckStaticLocalForDllExport(VarDecl *VD);
void FinalizeDeclaration(Decl *D);
DeclGroupPtrTy FinalizeDeclaratorGroup(Scope *S, const DeclSpec &DS,
ArrayRef<Decl *> Group);
DeclGroupPtrTy BuildDeclaratorGroup(MutableArrayRef<Decl *> Group);
/// Should be called on all declarations that might have attached
/// documentation comments.
void ActOnDocumentableDecl(Decl *D);
void ActOnDocumentableDecls(ArrayRef<Decl *> Group);
void ActOnFinishKNRParamDeclarations(Scope *S, Declarator &D,
SourceLocation LocAfterDecls);
void CheckForFunctionRedefinition(
FunctionDecl *FD, const FunctionDecl *EffectiveDefinition = nullptr,
SkipBodyInfo *SkipBody = nullptr);
Decl *ActOnStartOfFunctionDef(Scope *S, Declarator &D,
MultiTemplateParamsArg TemplateParamLists,
SkipBodyInfo *SkipBody = nullptr);
Decl *ActOnStartOfFunctionDef(Scope *S, Decl *D,
SkipBodyInfo *SkipBody = nullptr);
void ActOnStartOfObjCMethodDef(Scope *S, Decl *D);
bool isObjCMethodDecl(Decl *D) {
return D && isa<ObjCMethodDecl>(D);
}
/// Determine whether we can delay parsing the body of a function or
/// function template until it is used, assuming we don't care about emitting
/// code for that function.
///
/// This will be \c false if we may need the body of the function in the
/// middle of parsing an expression (where it's impractical to switch to
/// parsing a different function), for instance, if it's constexpr in C++11
/// or has an 'auto' return type in C++14. These cases are essentially bugs.
bool canDelayFunctionBody(const Declarator &D);
/// Determine whether we can skip parsing the body of a function
/// definition, assuming we don't care about analyzing its body or emitting
/// code for that function.
///
/// This will be \c false only if we may need the body of the function in
/// order to parse the rest of the program (for instance, if it is
/// \c constexpr in C++11 or has an 'auto' return type in C++14).
bool canSkipFunctionBody(Decl *D);
void computeNRVO(Stmt *Body, sema::FunctionScopeInfo *Scope);
Decl *ActOnFinishFunctionBody(Decl *Decl, Stmt *Body);
Decl *ActOnFinishFunctionBody(Decl *Decl, Stmt *Body, bool IsInstantiation);
Decl *ActOnSkippedFunctionBody(Decl *Decl);
void ActOnFinishInlineFunctionDef(FunctionDecl *D);
/// ActOnFinishDelayedAttribute - Invoked when we have finished parsing an
/// attribute for which parsing is delayed.
void ActOnFinishDelayedAttribute(Scope *S, Decl *D, ParsedAttributes &Attrs);
/// Diagnose any unused parameters in the given sequence of
/// ParmVarDecl pointers.
void DiagnoseUnusedParameters(ArrayRef<ParmVarDecl *> Parameters);
/// Diagnose whether the size of parameters or return value of a
/// function or obj-c method definition is pass-by-value and larger than a
/// specified threshold.
void
DiagnoseSizeOfParametersAndReturnValue(ArrayRef<ParmVarDecl *> Parameters,
QualType ReturnTy, NamedDecl *D);
void DiagnoseInvalidJumps(Stmt *Body);
Decl *ActOnFileScopeAsmDecl(Expr *expr,
SourceLocation AsmLoc,
SourceLocation RParenLoc);
/// Handle a C++11 empty-declaration and attribute-declaration.
Decl *ActOnEmptyDeclaration(Scope *S, const ParsedAttributesView &AttrList,
SourceLocation SemiLoc);
enum class ModuleDeclKind {
Interface, ///< 'export module X;'
Implementation, ///< 'module X;'
};
/// The parser has processed a module-declaration that begins the definition
/// of a module interface or implementation.
DeclGroupPtrTy ActOnModuleDecl(SourceLocation StartLoc,
SourceLocation ModuleLoc, ModuleDeclKind MDK,
ModuleIdPath Path, bool IsFirstDecl);
/// The parser has processed a global-module-fragment declaration that begins
/// the definition of the global module fragment of the current module unit.
/// \param ModuleLoc The location of the 'module' keyword.
DeclGroupPtrTy ActOnGlobalModuleFragmentDecl(SourceLocation ModuleLoc);
/// The parser has processed a private-module-fragment declaration that begins
/// the definition of the private module fragment of the current module unit.
/// \param ModuleLoc The location of the 'module' keyword.
/// \param PrivateLoc The location of the 'private' keyword.
DeclGroupPtrTy ActOnPrivateModuleFragmentDecl(SourceLocation ModuleLoc,
SourceLocation PrivateLoc);
/// The parser has processed a module import declaration.
///
/// \param StartLoc The location of the first token in the declaration. This
/// could be the location of an '@', 'export', or 'import'.
/// \param ExportLoc The location of the 'export' keyword, if any.
/// \param ImportLoc The location of the 'import' keyword.
/// \param Path The module access path.
DeclResult ActOnModuleImport(SourceLocation StartLoc,
SourceLocation ExportLoc,
SourceLocation ImportLoc, ModuleIdPath Path);
DeclResult ActOnModuleImport(SourceLocation StartLoc,
SourceLocation ExportLoc,
SourceLocation ImportLoc, Module *M,
ModuleIdPath Path = {});
/// The parser has processed a module import translated from a
/// #include or similar preprocessing directive.
void ActOnModuleInclude(SourceLocation DirectiveLoc, Module *Mod);
void BuildModuleInclude(SourceLocation DirectiveLoc, Module *Mod);
/// The parsed has entered a submodule.
void ActOnModuleBegin(SourceLocation DirectiveLoc, Module *Mod);
/// The parser has left a submodule.
void ActOnModuleEnd(SourceLocation DirectiveLoc, Module *Mod);
/// Create an implicit import of the given module at the given
/// source location, for error recovery, if possible.
///
/// This routine is typically used when an entity found by name lookup
/// is actually hidden within a module that we know about but the user
/// has forgotten to import.
void createImplicitModuleImportForErrorRecovery(SourceLocation Loc,
Module *Mod);
/// Kinds of missing import. Note, the values of these enumerators correspond
/// to %select values in diagnostics.
enum class MissingImportKind {
Declaration,
Definition,
DefaultArgument,
ExplicitSpecialization,
PartialSpecialization
};
/// Diagnose that the specified declaration needs to be visible but
/// isn't, and suggest a module import that would resolve the problem.
void diagnoseMissingImport(SourceLocation Loc, NamedDecl *Decl,
MissingImportKind MIK, bool Recover = true);
void diagnoseMissingImport(SourceLocation Loc, NamedDecl *Decl,
SourceLocation DeclLoc, ArrayRef<Module *> Modules,
MissingImportKind MIK, bool Recover);
Decl *ActOnStartExportDecl(Scope *S, SourceLocation ExportLoc,
SourceLocation LBraceLoc);
Decl *ActOnFinishExportDecl(Scope *S, Decl *ExportDecl,
SourceLocation RBraceLoc);
/// We've found a use of a templated declaration that would trigger an
/// implicit instantiation. Check that any relevant explicit specializations
/// and partial specializations are visible, and diagnose if not.
void checkSpecializationVisibility(SourceLocation Loc, NamedDecl *Spec);
/// We've found a use of a template specialization that would select a
/// partial specialization. Check that the partial specialization is visible,
/// and diagnose if not.
void checkPartialSpecializationVisibility(SourceLocation Loc,
NamedDecl *Spec);
/// Retrieve a suitable printing policy for diagnostics.
PrintingPolicy getPrintingPolicy() const {
return getPrintingPolicy(Context, PP);
}
/// Retrieve a suitable printing policy for diagnostics.
static PrintingPolicy getPrintingPolicy(const ASTContext &Ctx,
const Preprocessor &PP);
/// Scope actions.
void ActOnPopScope(SourceLocation Loc, Scope *S);
void ActOnTranslationUnitScope(Scope *S);
Decl *ParsedFreeStandingDeclSpec(Scope *S, AccessSpecifier AS, DeclSpec &DS,
RecordDecl *&AnonRecord);
Decl *ParsedFreeStandingDeclSpec(Scope *S, AccessSpecifier AS, DeclSpec &DS,
MultiTemplateParamsArg TemplateParams,
bool IsExplicitInstantiation,
RecordDecl *&AnonRecord);
Decl *BuildAnonymousStructOrUnion(Scope *S, DeclSpec &DS,
AccessSpecifier AS,
RecordDecl *Record,
const PrintingPolicy &Policy);
Decl *BuildMicrosoftCAnonymousStruct(Scope *S, DeclSpec &DS,
RecordDecl *Record);
/// Common ways to introduce type names without a tag for use in diagnostics.
/// Keep in sync with err_tag_reference_non_tag.
enum NonTagKind {
NTK_NonStruct,
NTK_NonClass,
NTK_NonUnion,
NTK_NonEnum,
NTK_Typedef,
NTK_TypeAlias,
NTK_Template,
NTK_TypeAliasTemplate,
NTK_TemplateTemplateArgument,
};
/// Given a non-tag type declaration, returns an enum useful for indicating
/// what kind of non-tag type this is.
NonTagKind getNonTagTypeDeclKind(const Decl *D, TagTypeKind TTK);
bool isAcceptableTagRedeclaration(const TagDecl *Previous,
TagTypeKind NewTag, bool isDefinition,
SourceLocation NewTagLoc,
const IdentifierInfo *Name);
enum TagUseKind {
TUK_Reference, // Reference to a tag: 'struct foo *X;'
TUK_Declaration, // Fwd decl of a tag: 'struct foo;'
TUK_Definition, // Definition of a tag: 'struct foo { int X; } Y;'
TUK_Friend // Friend declaration: 'friend struct foo;'
};
Decl *ActOnTag(Scope *S, unsigned TagSpec, TagUseKind TUK,
SourceLocation KWLoc, CXXScopeSpec &SS, IdentifierInfo *Name,
SourceLocation NameLoc, const ParsedAttributesView &Attr,
AccessSpecifier AS, SourceLocation ModulePrivateLoc,
MultiTemplateParamsArg TemplateParameterLists, bool &OwnedDecl,
bool &IsDependent, SourceLocation ScopedEnumKWLoc,
bool ScopedEnumUsesClassTag, TypeResult UnderlyingType,
bool IsTypeSpecifier, bool IsTemplateParamOrArg,
SkipBodyInfo *SkipBody = nullptr);
Decl *ActOnTemplatedFriendTag(Scope *S, SourceLocation FriendLoc,
unsigned TagSpec, SourceLocation TagLoc,
CXXScopeSpec &SS, IdentifierInfo *Name,
SourceLocation NameLoc,
const ParsedAttributesView &Attr,
MultiTemplateParamsArg TempParamLists);
TypeResult ActOnDependentTag(Scope *S,
unsigned TagSpec,
TagUseKind TUK,
const CXXScopeSpec &SS,
IdentifierInfo *Name,
SourceLocation TagLoc,
SourceLocation NameLoc);
void ActOnDefs(Scope *S, Decl *TagD, SourceLocation DeclStart,
IdentifierInfo *ClassName,
SmallVectorImpl<Decl *> &Decls);
Decl *ActOnField(Scope *S, Decl *TagD, SourceLocation DeclStart,
Declarator &D, Expr *BitfieldWidth);
FieldDecl *HandleField(Scope *S, RecordDecl *TagD, SourceLocation DeclStart,
Declarator &D, Expr *BitfieldWidth,
InClassInitStyle InitStyle,
AccessSpecifier AS);
MSPropertyDecl *HandleMSProperty(Scope *S, RecordDecl *TagD,
SourceLocation DeclStart, Declarator &D,
Expr *BitfieldWidth,
InClassInitStyle InitStyle,
AccessSpecifier AS,
const ParsedAttr &MSPropertyAttr);
FieldDecl *CheckFieldDecl(DeclarationName Name, QualType T,
TypeSourceInfo *TInfo,
RecordDecl *Record, SourceLocation Loc,
bool Mutable, Expr *BitfieldWidth,
InClassInitStyle InitStyle,
SourceLocation TSSL,
AccessSpecifier AS, NamedDecl *PrevDecl,
Declarator *D = nullptr);
bool CheckNontrivialField(FieldDecl *FD);
void DiagnoseNontrivial(const CXXRecordDecl *Record, CXXSpecialMember CSM);
enum TrivialABIHandling {
/// The triviality of a method unaffected by "trivial_abi".
TAH_IgnoreTrivialABI,
/// The triviality of a method affected by "trivial_abi".
TAH_ConsiderTrivialABI
};
bool SpecialMemberIsTrivial(CXXMethodDecl *MD, CXXSpecialMember CSM,
TrivialABIHandling TAH = TAH_IgnoreTrivialABI,
bool Diagnose = false);
/// For a defaulted function, the kind of defaulted function that it is.
class DefaultedFunctionKind {
CXXSpecialMember SpecialMember : 8;
DefaultedComparisonKind Comparison : 8;
public:
DefaultedFunctionKind()
: SpecialMember(CXXInvalid), Comparison(DefaultedComparisonKind::None) {
}
DefaultedFunctionKind(CXXSpecialMember CSM)
: SpecialMember(CSM), Comparison(DefaultedComparisonKind::None) {}
DefaultedFunctionKind(DefaultedComparisonKind Comp)
: SpecialMember(CXXInvalid), Comparison(Comp) {}
bool isSpecialMember() const { return SpecialMember != CXXInvalid; }
bool isComparison() const {
return Comparison != DefaultedComparisonKind::None;
}
explicit operator bool() const {
return isSpecialMember() || isComparison();
}
CXXSpecialMember asSpecialMember() const { return SpecialMember; }
DefaultedComparisonKind asComparison() const { return Comparison; }
/// Get the index of this function kind for use in diagnostics.
unsigned getDiagnosticIndex() const {
static_assert(CXXInvalid > CXXDestructor,
"invalid should have highest index");
static_assert((unsigned)DefaultedComparisonKind::None == 0,
"none should be equal to zero");
return SpecialMember + (unsigned)Comparison;
}
};
DefaultedFunctionKind getDefaultedFunctionKind(const FunctionDecl *FD);
CXXSpecialMember getSpecialMember(const CXXMethodDecl *MD) {
return getDefaultedFunctionKind(MD).asSpecialMember();
}
DefaultedComparisonKind getDefaultedComparisonKind(const FunctionDecl *FD) {
return getDefaultedFunctionKind(FD).asComparison();
}
void ActOnLastBitfield(SourceLocation DeclStart,
SmallVectorImpl<Decl *> &AllIvarDecls);
Decl *ActOnIvar(Scope *S, SourceLocation DeclStart,
Declarator &D, Expr *BitfieldWidth,
tok::ObjCKeywordKind visibility);
// This is used for both record definitions and ObjC interface declarations.
void ActOnFields(Scope *S, SourceLocation RecLoc, Decl *TagDecl,
ArrayRef<Decl *> Fields, SourceLocation LBrac,
SourceLocation RBrac, const ParsedAttributesView &AttrList);
/// ActOnTagStartDefinition - Invoked when we have entered the
/// scope of a tag's definition (e.g., for an enumeration, class,
/// struct, or union).
void ActOnTagStartDefinition(Scope *S, Decl *TagDecl);
/// Perform ODR-like check for C/ObjC when merging tag types from modules.
/// Differently from C++, actually parse the body and reject / error out
/// in case of a structural mismatch.
bool ActOnDuplicateDefinition(DeclSpec &DS, Decl *Prev,
SkipBodyInfo &SkipBody);
typedef void *SkippedDefinitionContext;
/// Invoked when we enter a tag definition that we're skipping.
SkippedDefinitionContext ActOnTagStartSkippedDefinition(Scope *S, Decl *TD);
Decl *ActOnObjCContainerStartDefinition(Decl *IDecl);
/// ActOnStartCXXMemberDeclarations - Invoked when we have parsed a
/// C++ record definition's base-specifiers clause and are starting its
/// member declarations.
void ActOnStartCXXMemberDeclarations(Scope *S, Decl *TagDecl,
SourceLocation FinalLoc,
bool IsFinalSpelledSealed,
SourceLocation LBraceLoc);
/// ActOnTagFinishDefinition - Invoked once we have finished parsing
/// the definition of a tag (enumeration, class, struct, or union).
void ActOnTagFinishDefinition(Scope *S, Decl *TagDecl,
SourceRange BraceRange);
void ActOnTagFinishSkippedDefinition(SkippedDefinitionContext Context);
void ActOnObjCContainerFinishDefinition();
/// Invoked when we must temporarily exit the objective-c container
/// scope for parsing/looking-up C constructs.
///
/// Must be followed by a call to \see ActOnObjCReenterContainerContext
void ActOnObjCTemporaryExitContainerContext(DeclContext *DC);
void ActOnObjCReenterContainerContext(DeclContext *DC);
/// ActOnTagDefinitionError - Invoked when there was an unrecoverable
/// error parsing the definition of a tag.
void ActOnTagDefinitionError(Scope *S, Decl *TagDecl);
EnumConstantDecl *CheckEnumConstant(EnumDecl *Enum,
EnumConstantDecl *LastEnumConst,
SourceLocation IdLoc,
IdentifierInfo *Id,
Expr *val);
bool CheckEnumUnderlyingType(TypeSourceInfo *TI);
bool CheckEnumRedeclaration(SourceLocation EnumLoc, bool IsScoped,
QualType EnumUnderlyingTy, bool IsFixed,
const EnumDecl *Prev);
/// Determine whether the body of an anonymous enumeration should be skipped.
/// \param II The name of the first enumerator.
SkipBodyInfo shouldSkipAnonEnumBody(Scope *S, IdentifierInfo *II,
SourceLocation IILoc);
Decl *ActOnEnumConstant(Scope *S, Decl *EnumDecl, Decl *LastEnumConstant,
SourceLocation IdLoc, IdentifierInfo *Id,
const ParsedAttributesView &Attrs,
SourceLocation EqualLoc, Expr *Val);
void ActOnEnumBody(SourceLocation EnumLoc, SourceRange BraceRange,
Decl *EnumDecl, ArrayRef<Decl *> Elements, Scope *S,
const ParsedAttributesView &Attr);
DeclContext *getContainingDC(DeclContext *DC);
/// Set the current declaration context until it gets popped.
void PushDeclContext(Scope *S, DeclContext *DC);
void PopDeclContext();
/// EnterDeclaratorContext - Used when we must lookup names in the context
/// of a declarator's nested name specifier.
void EnterDeclaratorContext(Scope *S, DeclContext *DC);
void ExitDeclaratorContext(Scope *S);
/// Push the parameters of D, which must be a function, into scope.
void ActOnReenterFunctionContext(Scope* S, Decl* D);
void ActOnExitFunctionContext();
DeclContext *getFunctionLevelDeclContext();
/// getCurFunctionDecl - If inside of a function body, this returns a pointer
/// to the function decl for the function being parsed. If we're currently
/// in a 'block', this returns the containing context.
FunctionDecl *getCurFunctionDecl();
/// getCurMethodDecl - If inside of a method body, this returns a pointer to
/// the method decl for the method being parsed. If we're currently
/// in a 'block', this returns the containing context.
ObjCMethodDecl *getCurMethodDecl();
/// getCurFunctionOrMethodDecl - Return the Decl for the current ObjC method
/// or C function we're in, otherwise return null. If we're currently
/// in a 'block', this returns the containing context.
NamedDecl *getCurFunctionOrMethodDecl();
/// Add this decl to the scope shadowed decl chains.
void PushOnScopeChains(NamedDecl *D, Scope *S, bool AddToContext = true);
/// isDeclInScope - If 'Ctx' is a function/method, isDeclInScope returns true
/// if 'D' is in Scope 'S', otherwise 'S' is ignored and isDeclInScope returns
/// true if 'D' belongs to the given declaration context.
///
/// \param AllowInlineNamespace If \c true, allow the declaration to be in the
/// enclosing namespace set of the context, rather than contained
/// directly within it.
bool isDeclInScope(NamedDecl *D, DeclContext *Ctx, Scope *S = nullptr,
bool AllowInlineNamespace = false);
/// Finds the scope corresponding to the given decl context, if it
/// happens to be an enclosing scope. Otherwise return NULL.
static Scope *getScopeForDeclContext(Scope *S, DeclContext *DC);
/// Subroutines of ActOnDeclarator().
TypedefDecl *ParseTypedefDecl(Scope *S, Declarator &D, QualType T,
TypeSourceInfo *TInfo);
bool isIncompatibleTypedef(TypeDecl *Old, TypedefNameDecl *New);
/// Describes the kind of merge to perform for availability
/// attributes (including "deprecated", "unavailable", and "availability").
enum AvailabilityMergeKind {
/// Don't merge availability attributes at all.
AMK_None,
/// Merge availability attributes for a redeclaration, which requires
/// an exact match.
AMK_Redeclaration,
/// Merge availability attributes for an override, which requires
/// an exact match or a weakening of constraints.
AMK_Override,
/// Merge availability attributes for an implementation of
/// a protocol requirement.
AMK_ProtocolImplementation,
};
/// Describes the kind of priority given to an availability attribute.
///
/// The sum of priorities deteremines the final priority of the attribute.
/// The final priority determines how the attribute will be merged.
/// An attribute with a lower priority will always remove higher priority
/// attributes for the specified platform when it is being applied. An
/// attribute with a higher priority will not be applied if the declaration
/// already has an availability attribute with a lower priority for the
/// specified platform. The final prirority values are not expected to match
/// the values in this enumeration, but instead should be treated as a plain
/// integer value. This enumeration just names the priority weights that are
/// used to calculate that final vaue.
enum AvailabilityPriority : int {
/// The availability attribute was specified explicitly next to the
/// declaration.
AP_Explicit = 0,
/// The availability attribute was applied using '#pragma clang attribute'.
AP_PragmaClangAttribute = 1,
/// The availability attribute for a specific platform was inferred from
/// an availability attribute for another platform.
AP_InferredFromOtherPlatform = 2
};
/// Attribute merging methods. Return true if a new attribute was added.
AvailabilityAttr *
mergeAvailabilityAttr(NamedDecl *D, const AttributeCommonInfo &CI,
IdentifierInfo *Platform, bool Implicit,
VersionTuple Introduced, VersionTuple Deprecated,
VersionTuple Obsoleted, bool IsUnavailable,
StringRef Message, bool IsStrict, StringRef Replacement,
AvailabilityMergeKind AMK, int Priority);
TypeVisibilityAttr *
mergeTypeVisibilityAttr(Decl *D, const AttributeCommonInfo &CI,
TypeVisibilityAttr::VisibilityType Vis);
VisibilityAttr *mergeVisibilityAttr(Decl *D, const AttributeCommonInfo &CI,
VisibilityAttr::VisibilityType Vis);
UuidAttr *mergeUuidAttr(Decl *D, const AttributeCommonInfo &CI,
StringRef Uuid);
DLLImportAttr *mergeDLLImportAttr(Decl *D, const AttributeCommonInfo &CI);
DLLExportAttr *mergeDLLExportAttr(Decl *D, const AttributeCommonInfo &CI);
MSInheritanceAttr *
mergeMSInheritanceAttr(Decl *D, const AttributeCommonInfo &CI, bool BestCase,
MSInheritanceAttr::Spelling SemanticSpelling);
FormatAttr *mergeFormatAttr(Decl *D, const AttributeCommonInfo &CI,
IdentifierInfo *Format, int FormatIdx,
int FirstArg);
SectionAttr *mergeSectionAttr(Decl *D, const AttributeCommonInfo &CI,
StringRef Name);
CodeSegAttr *mergeCodeSegAttr(Decl *D, const AttributeCommonInfo &CI,
StringRef Name);
AlwaysInlineAttr *mergeAlwaysInlineAttr(Decl *D,
const AttributeCommonInfo &CI,
const IdentifierInfo *Ident);
MinSizeAttr *mergeMinSizeAttr(Decl *D, const AttributeCommonInfo &CI);
NoSpeculativeLoadHardeningAttr *
mergeNoSpeculativeLoadHardeningAttr(Decl *D,
const NoSpeculativeLoadHardeningAttr &AL);
SpeculativeLoadHardeningAttr *
mergeSpeculativeLoadHardeningAttr(Decl *D,
const SpeculativeLoadHardeningAttr &AL);
OptimizeNoneAttr *mergeOptimizeNoneAttr(Decl *D,
const AttributeCommonInfo &CI);
SwiftNameAttr *mergeSwiftNameAttr(Decl *D, const AttributeCommonInfo &CI,
StringRef Name, bool Override);
InternalLinkageAttr *mergeInternalLinkageAttr(Decl *D, const ParsedAttr &AL);
InternalLinkageAttr *mergeInternalLinkageAttr(Decl *D,
const InternalLinkageAttr &AL);
CommonAttr *mergeCommonAttr(Decl *D, const ParsedAttr &AL);
CommonAttr *mergeCommonAttr(Decl *D, const CommonAttr &AL);
void mergeDeclAttributes(NamedDecl *New, Decl *Old,
AvailabilityMergeKind AMK = AMK_Redeclaration);
void MergeTypedefNameDecl(Scope *S, TypedefNameDecl *New,
LookupResult &OldDecls);
bool MergeFunctionDecl(FunctionDecl *New, NamedDecl *&Old, Scope *S,
bool MergeTypeWithOld);
bool MergeCompatibleFunctionDecls(FunctionDecl *New, FunctionDecl *Old,
Scope *S, bool MergeTypeWithOld);
void mergeObjCMethodDecls(ObjCMethodDecl *New, ObjCMethodDecl *Old);
void MergeVarDecl(VarDecl *New, LookupResult &Previous);
void MergeVarDeclTypes(VarDecl *New, VarDecl *Old, bool MergeTypeWithOld);
void MergeVarDeclExceptionSpecs(VarDecl *New, VarDecl *Old);
bool checkVarDeclRedefinition(VarDecl *OldDefn, VarDecl *NewDefn);
void notePreviousDefinition(const NamedDecl *Old, SourceLocation New);
bool MergeCXXFunctionDecl(FunctionDecl *New, FunctionDecl *Old, Scope *S);
// AssignmentAction - This is used by all the assignment diagnostic functions
// to represent what is actually causing the operation
enum AssignmentAction {
AA_Assigning,
AA_Passing,
AA_Returning,
AA_Converting,
AA_Initializing,
AA_Sending,
AA_Casting,
AA_Passing_CFAudited
};
/// C++ Overloading.
enum OverloadKind {
/// This is a legitimate overload: the existing declarations are
/// functions or function templates with different signatures.
Ovl_Overload,
/// This is not an overload because the signature exactly matches
/// an existing declaration.
Ovl_Match,
/// This is not an overload because the lookup results contain a
/// non-function.
Ovl_NonFunction
};
OverloadKind CheckOverload(Scope *S,
FunctionDecl *New,
const LookupResult &OldDecls,
NamedDecl *&OldDecl,
bool IsForUsingDecl);
bool IsOverload(FunctionDecl *New, FunctionDecl *Old, bool IsForUsingDecl,
bool ConsiderCudaAttrs = true);
ImplicitConversionSequence
TryImplicitConversion(Expr *From, QualType ToType,
bool SuppressUserConversions,
bool AllowExplicit,
bool InOverloadResolution,
bool CStyle,
bool AllowObjCWritebackConversion);
bool IsIntegralPromotion(Expr *From, QualType FromType, QualType ToType);
bool IsFloatingPointPromotion(QualType FromType, QualType ToType);
bool IsComplexPromotion(QualType FromType, QualType ToType);
bool IsPointerConversion(Expr *From, QualType FromType, QualType ToType,
bool InOverloadResolution,
QualType& ConvertedType, bool &IncompatibleObjC);
bool isObjCPointerConversion(QualType FromType, QualType ToType,
QualType& ConvertedType, bool &IncompatibleObjC);
bool isObjCWritebackConversion(QualType FromType, QualType ToType,
QualType &ConvertedType);
bool IsBlockPointerConversion(QualType FromType, QualType ToType,
QualType& ConvertedType);
bool FunctionParamTypesAreEqual(const FunctionProtoType *OldType,
const FunctionProtoType *NewType,
unsigned *ArgPos = nullptr);
void HandleFunctionTypeMismatch(PartialDiagnostic &PDiag,
QualType FromType, QualType ToType);
void maybeExtendBlockObject(ExprResult &E);
CastKind PrepareCastToObjCObjectPointer(ExprResult &E);
bool CheckPointerConversion(Expr *From, QualType ToType,
CastKind &Kind,
CXXCastPath& BasePath,
bool IgnoreBaseAccess,
bool Diagnose = true);
bool IsMemberPointerConversion(Expr *From, QualType FromType, QualType ToType,
bool InOverloadResolution,
QualType &ConvertedType);
bool CheckMemberPointerConversion(Expr *From, QualType ToType,
CastKind &Kind,
CXXCastPath &BasePath,
bool IgnoreBaseAccess);
bool IsQualificationConversion(QualType FromType, QualType ToType,
bool CStyle, bool &ObjCLifetimeConversion);
bool IsFunctionConversion(QualType FromType, QualType ToType,
QualType &ResultTy);
bool DiagnoseMultipleUserDefinedConversion(Expr *From, QualType ToType);
bool isSameOrCompatibleFunctionType(CanQualType Param, CanQualType Arg);
ExprResult PerformMoveOrCopyInitialization(const InitializedEntity &Entity,
const VarDecl *NRVOCandidate,
QualType ResultType,
Expr *Value,
bool AllowNRVO = true);
bool CanPerformAggregateInitializationForOverloadResolution(
const InitializedEntity &Entity, InitListExpr *From);
bool CanPerformCopyInitialization(const InitializedEntity &Entity,
ExprResult Init);
ExprResult PerformCopyInitialization(const InitializedEntity &Entity,
SourceLocation EqualLoc,
ExprResult Init,
bool TopLevelOfInitList = false,
bool AllowExplicit = false);
ExprResult PerformObjectArgumentInitialization(Expr *From,
NestedNameSpecifier *Qualifier,
NamedDecl *FoundDecl,
CXXMethodDecl *Method);
/// Check that the lifetime of the initializer (and its subobjects) is
/// sufficient for initializing the entity, and perform lifetime extension
/// (when permitted) if not.
void checkInitializerLifetime(const InitializedEntity &Entity, Expr *Init);
ExprResult PerformContextuallyConvertToBool(Expr *From);
ExprResult PerformContextuallyConvertToObjCPointer(Expr *From);
/// Contexts in which a converted constant expression is required.
enum CCEKind {
CCEK_CaseValue, ///< Expression in a case label.
CCEK_Enumerator, ///< Enumerator value with fixed underlying type.
CCEK_TemplateArg, ///< Value of a non-type template parameter.
CCEK_NewExpr, ///< Constant expression in a noptr-new-declarator.
CCEK_ConstexprIf, ///< Condition in a constexpr if statement.
CCEK_ExplicitBool ///< Condition in an explicit(bool) specifier.
};
ExprResult CheckConvertedConstantExpression(Expr *From, QualType T,
llvm::APSInt &Value, CCEKind CCE);
ExprResult CheckConvertedConstantExpression(Expr *From, QualType T,
APValue &Value, CCEKind CCE);
/// Abstract base class used to perform a contextual implicit
/// conversion from an expression to any type passing a filter.
class ContextualImplicitConverter {
public:
bool Suppress;
bool SuppressConversion;
ContextualImplicitConverter(bool Suppress = false,
bool SuppressConversion = false)
: Suppress(Suppress), SuppressConversion(SuppressConversion) {}
/// Determine whether the specified type is a valid destination type
/// for this conversion.
virtual bool match(QualType T) = 0;
/// Emits a diagnostic complaining that the expression does not have
/// integral or enumeration type.
virtual SemaDiagnosticBuilder
diagnoseNoMatch(Sema &S, SourceLocation Loc, QualType T) = 0;
/// Emits a diagnostic when the expression has incomplete class type.
virtual SemaDiagnosticBuilder
diagnoseIncomplete(Sema &S, SourceLocation Loc, QualType T) = 0;
/// Emits a diagnostic when the only matching conversion function
/// is explicit.
virtual SemaDiagnosticBuilder diagnoseExplicitConv(
Sema &S, SourceLocation Loc, QualType T, QualType ConvTy) = 0;
/// Emits a note for the explicit conversion function.
virtual SemaDiagnosticBuilder
noteExplicitConv(Sema &S, CXXConversionDecl *Conv, QualType ConvTy) = 0;
/// Emits a diagnostic when there are multiple possible conversion
/// functions.
virtual SemaDiagnosticBuilder
diagnoseAmbiguous(Sema &S, SourceLocation Loc, QualType T) = 0;
/// Emits a note for one of the candidate conversions.
virtual SemaDiagnosticBuilder
noteAmbiguous(Sema &S, CXXConversionDecl *Conv, QualType ConvTy) = 0;
/// Emits a diagnostic when we picked a conversion function
/// (for cases when we are not allowed to pick a conversion function).
virtual SemaDiagnosticBuilder diagnoseConversion(
Sema &S, SourceLocation Loc, QualType T, QualType ConvTy) = 0;
virtual ~ContextualImplicitConverter() {}
};
class ICEConvertDiagnoser : public ContextualImplicitConverter {
bool AllowScopedEnumerations;
public:
ICEConvertDiagnoser(bool AllowScopedEnumerations,
bool Suppress, bool SuppressConversion)
: ContextualImplicitConverter(Suppress, SuppressConversion),
AllowScopedEnumerations(AllowScopedEnumerations) {}
/// Match an integral or (possibly scoped) enumeration type.
bool match(QualType T) override;
SemaDiagnosticBuilder
diagnoseNoMatch(Sema &S, SourceLocation Loc, QualType T) override {
return diagnoseNotInt(S, Loc, T);
}
/// Emits a diagnostic complaining that the expression does not have
/// integral or enumeration type.
virtual SemaDiagnosticBuilder
diagnoseNotInt(Sema &S, SourceLocation Loc, QualType T) = 0;
};
/// Perform a contextual implicit conversion.
ExprResult PerformContextualImplicitConversion(
SourceLocation Loc, Expr *FromE, ContextualImplicitConverter &Converter);
enum ObjCSubscriptKind {
OS_Array,
OS_Dictionary,
OS_Error
};
ObjCSubscriptKind CheckSubscriptingKind(Expr *FromE);
// Note that LK_String is intentionally after the other literals, as
// this is used for diagnostics logic.
enum ObjCLiteralKind {
LK_Array,
LK_Dictionary,
LK_Numeric,
LK_Boxed,
LK_String,
LK_Block,
LK_None
};
ObjCLiteralKind CheckLiteralKind(Expr *FromE);
ExprResult PerformObjectMemberConversion(Expr *From,
NestedNameSpecifier *Qualifier,
NamedDecl *FoundDecl,
NamedDecl *Member);
// Members have to be NamespaceDecl* or TranslationUnitDecl*.
// TODO: make this is a typesafe union.
typedef llvm::SmallSetVector<DeclContext *, 16> AssociatedNamespaceSet;
typedef llvm::SmallSetVector<CXXRecordDecl *, 16> AssociatedClassSet;
using ADLCallKind = CallExpr::ADLCallKind;
void AddOverloadCandidate(FunctionDecl *Function, DeclAccessPair FoundDecl,
ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet,
bool SuppressUserConversions = false,
bool PartialOverloading = false,
bool AllowExplicit = true,
bool AllowExplicitConversion = false,
ADLCallKind IsADLCandidate = ADLCallKind::NotADL,
ConversionSequenceList EarlyConversions = None,
OverloadCandidateParamOrder PO = {});
void AddFunctionCandidates(const UnresolvedSetImpl &Functions,
ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet,
TemplateArgumentListInfo *ExplicitTemplateArgs = nullptr,
bool SuppressUserConversions = false,
bool PartialOverloading = false,
bool FirstArgumentIsBase = false);
void AddMethodCandidate(DeclAccessPair FoundDecl,
QualType ObjectType,
Expr::Classification ObjectClassification,
ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet,
bool SuppressUserConversion = false,
OverloadCandidateParamOrder PO = {});
void AddMethodCandidate(CXXMethodDecl *Method,
DeclAccessPair FoundDecl,
CXXRecordDecl *ActingContext, QualType ObjectType,
Expr::Classification ObjectClassification,
ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet,
bool SuppressUserConversions = false,
bool PartialOverloading = false,
ConversionSequenceList EarlyConversions = None,
OverloadCandidateParamOrder PO = {});
void AddMethodTemplateCandidate(FunctionTemplateDecl *MethodTmpl,
DeclAccessPair FoundDecl,
CXXRecordDecl *ActingContext,
TemplateArgumentListInfo *ExplicitTemplateArgs,
QualType ObjectType,
Expr::Classification ObjectClassification,
ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet,
bool SuppressUserConversions = false,
bool PartialOverloading = false,
OverloadCandidateParamOrder PO = {});
void AddTemplateOverloadCandidate(
FunctionTemplateDecl *FunctionTemplate, DeclAccessPair FoundDecl,
TemplateArgumentListInfo *ExplicitTemplateArgs, ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet, bool SuppressUserConversions = false,
bool PartialOverloading = false, bool AllowExplicit = true,
ADLCallKind IsADLCandidate = ADLCallKind::NotADL,
OverloadCandidateParamOrder PO = {});
bool CheckNonDependentConversions(
FunctionTemplateDecl *FunctionTemplate, ArrayRef<QualType> ParamTypes,
ArrayRef<Expr *> Args, OverloadCandidateSet &CandidateSet,
ConversionSequenceList &Conversions, bool SuppressUserConversions,
CXXRecordDecl *ActingContext = nullptr, QualType ObjectType = QualType(),
Expr::Classification ObjectClassification = {},
OverloadCandidateParamOrder PO = {});
void AddConversionCandidate(
CXXConversionDecl *Conversion, DeclAccessPair FoundDecl,
CXXRecordDecl *ActingContext, Expr *From, QualType ToType,
OverloadCandidateSet &CandidateSet, bool AllowObjCConversionOnExplicit,
bool AllowExplicit, bool AllowResultConversion = true);
void AddTemplateConversionCandidate(
FunctionTemplateDecl *FunctionTemplate, DeclAccessPair FoundDecl,
CXXRecordDecl *ActingContext, Expr *From, QualType ToType,
OverloadCandidateSet &CandidateSet, bool AllowObjCConversionOnExplicit,
bool AllowExplicit, bool AllowResultConversion = true);
void AddSurrogateCandidate(CXXConversionDecl *Conversion,
DeclAccessPair FoundDecl,
CXXRecordDecl *ActingContext,
const FunctionProtoType *Proto,
Expr *Object, ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet);
void AddNonMemberOperatorCandidates(
const UnresolvedSetImpl &Functions, ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet,
TemplateArgumentListInfo *ExplicitTemplateArgs = nullptr);
void AddMemberOperatorCandidates(OverloadedOperatorKind Op,
SourceLocation OpLoc, ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet,
OverloadCandidateParamOrder PO = {});
void AddBuiltinCandidate(QualType *ParamTys, ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet,
bool IsAssignmentOperator = false,
unsigned NumContextualBoolArguments = 0);
void AddBuiltinOperatorCandidates(OverloadedOperatorKind Op,
SourceLocation OpLoc, ArrayRef<Expr *> Args,
OverloadCandidateSet& CandidateSet);
void AddArgumentDependentLookupCandidates(DeclarationName Name,
SourceLocation Loc,
ArrayRef<Expr *> Args,
TemplateArgumentListInfo *ExplicitTemplateArgs,
OverloadCandidateSet& CandidateSet,
bool PartialOverloading = false);
// Emit as a 'note' the specific overload candidate
void NoteOverloadCandidate(
NamedDecl *Found, FunctionDecl *Fn,
OverloadCandidateRewriteKind RewriteKind = OverloadCandidateRewriteKind(),
QualType DestType = QualType(), bool TakingAddress = false);
// Emit as a series of 'note's all template and non-templates identified by
// the expression Expr
void NoteAllOverloadCandidates(Expr *E, QualType DestType = QualType(),
bool TakingAddress = false);
/// Check the enable_if expressions on the given function. Returns the first
/// failing attribute, or NULL if they were all successful.
EnableIfAttr *CheckEnableIf(FunctionDecl *Function, ArrayRef<Expr *> Args,
bool MissingImplicitThis = false);
/// Find the failed Boolean condition within a given Boolean
/// constant expression, and describe it with a string.
std::pair<Expr *, std::string> findFailedBooleanCondition(Expr *Cond);
/// Emit diagnostics for the diagnose_if attributes on Function, ignoring any
/// non-ArgDependent DiagnoseIfAttrs.
///
/// Argument-dependent diagnose_if attributes should be checked each time a
/// function is used as a direct callee of a function call.
///
/// Returns true if any errors were emitted.
bool diagnoseArgDependentDiagnoseIfAttrs(const FunctionDecl *Function,
const Expr *ThisArg,
ArrayRef<const Expr *> Args,
SourceLocation Loc);
/// Emit diagnostics for the diagnose_if attributes on Function, ignoring any
/// ArgDependent DiagnoseIfAttrs.
///
/// Argument-independent diagnose_if attributes should be checked on every use
/// of a function.
///
/// Returns true if any errors were emitted.
bool diagnoseArgIndependentDiagnoseIfAttrs(const NamedDecl *ND,
SourceLocation Loc);
/// Returns whether the given function's address can be taken or not,
/// optionally emitting a diagnostic if the address can't be taken.
///
/// Returns false if taking the address of the function is illegal.
bool checkAddressOfFunctionIsAvailable(const FunctionDecl *Function,
bool Complain = false,
SourceLocation Loc = SourceLocation());
// [PossiblyAFunctionType] --> [Return]
// NonFunctionType --> NonFunctionType
// R (A) --> R(A)
// R (*)(A) --> R (A)
// R (&)(A) --> R (A)
// R (S::*)(A) --> R (A)
QualType ExtractUnqualifiedFunctionType(QualType PossiblyAFunctionType);
FunctionDecl *
ResolveAddressOfOverloadedFunction(Expr *AddressOfExpr,
QualType TargetType,
bool Complain,
DeclAccessPair &Found,
bool *pHadMultipleCandidates = nullptr);
FunctionDecl *
resolveAddressOfOnlyViableOverloadCandidate(Expr *E,
DeclAccessPair &FoundResult);
bool resolveAndFixAddressOfOnlyViableOverloadCandidate(
ExprResult &SrcExpr, bool DoFunctionPointerConversion = false);
FunctionDecl *
ResolveSingleFunctionTemplateSpecialization(OverloadExpr *ovl,
bool Complain = false,
DeclAccessPair *Found = nullptr);
bool ResolveAndFixSingleFunctionTemplateSpecialization(
ExprResult &SrcExpr,
bool DoFunctionPointerConverion = false,
bool Complain = false,
SourceRange OpRangeForComplaining = SourceRange(),
QualType DestTypeForComplaining = QualType(),
unsigned DiagIDForComplaining = 0);
Expr *FixOverloadedFunctionReference(Expr *E,
DeclAccessPair FoundDecl,
FunctionDecl *Fn);
ExprResult FixOverloadedFunctionReference(ExprResult,
DeclAccessPair FoundDecl,
FunctionDecl *Fn);
void AddOverloadedCallCandidates(UnresolvedLookupExpr *ULE,
ArrayRef<Expr *> Args,
OverloadCandidateSet &CandidateSet,
bool PartialOverloading = false);
// An enum used to represent the different possible results of building a
// range-based for loop.
enum ForRangeStatus {
FRS_Success,
FRS_NoViableFunction,
FRS_DiagnosticIssued
};
ForRangeStatus BuildForRangeBeginEndCall(SourceLocation Loc,
SourceLocation RangeLoc,
const DeclarationNameInfo &NameInfo,
LookupResult &MemberLookup,
OverloadCandidateSet *CandidateSet,
Expr *Range, ExprResult *CallExpr);
ExprResult BuildOverloadedCallExpr(Scope *S, Expr *Fn,
UnresolvedLookupExpr *ULE,
SourceLocation LParenLoc,
MultiExprArg Args,
SourceLocation RParenLoc,
Expr *ExecConfig,
bool AllowTypoCorrection=true,
bool CalleesAddressIsTaken=false);
bool buildOverloadedCallSet(Scope *S, Expr *Fn, UnresolvedLookupExpr *ULE,
MultiExprArg Args, SourceLocation RParenLoc,
OverloadCandidateSet *CandidateSet,
ExprResult *Result);
ExprResult CreateOverloadedUnaryOp(SourceLocation OpLoc,
UnaryOperatorKind Opc,
const UnresolvedSetImpl &Fns,
Expr *input, bool RequiresADL = true);
ExprResult CreateOverloadedBinOp(SourceLocation OpLoc,
BinaryOperatorKind Opc,
const UnresolvedSetImpl &Fns,
Expr *LHS, Expr *RHS,
bool RequiresADL = true,
bool AllowRewrittenCandidates = true);
ExprResult CreateOverloadedArraySubscriptExpr(SourceLocation LLoc,
SourceLocation RLoc,
Expr *Base,Expr *Idx);
ExprResult
BuildCallToMemberFunction(Scope *S, Expr *MemExpr,
SourceLocation LParenLoc,
MultiExprArg Args,
SourceLocation RParenLoc);
ExprResult
BuildCallToObjectOfClassType(Scope *S, Expr *Object, SourceLocation LParenLoc,
MultiExprArg Args,
SourceLocation RParenLoc);
ExprResult BuildOverloadedArrowExpr(Scope *S, Expr *Base,
SourceLocation OpLoc,
bool *NoArrowOperatorFound = nullptr);
/// CheckCallReturnType - Checks that a call expression's return type is
/// complete. Returns true on failure. The location passed in is the location
/// that best represents the call.
bool CheckCallReturnType(QualType ReturnType, SourceLocation Loc,
CallExpr *CE, FunctionDecl *FD);
/// Helpers for dealing with blocks and functions.
bool CheckParmsForFunctionDef(ArrayRef<ParmVarDecl *> Parameters,
bool CheckParameterNames);
void CheckCXXDefaultArguments(FunctionDecl *FD);
void CheckExtraCXXDefaultArguments(Declarator &D);
Scope *getNonFieldDeclScope(Scope *S);
/// \name Name lookup
///
/// These routines provide name lookup that is used during semantic
/// analysis to resolve the various kinds of names (identifiers,
/// overloaded operator names, constructor names, etc.) into zero or
/// more declarations within a particular scope. The major entry
/// points are LookupName, which performs unqualified name lookup,
/// and LookupQualifiedName, which performs qualified name lookup.
///
/// All name lookup is performed based on some specific criteria,
/// which specify what names will be visible to name lookup and how
/// far name lookup should work. These criteria are important both
/// for capturing language semantics (certain lookups will ignore
/// certain names, for example) and for performance, since name
/// lookup is often a bottleneck in the compilation of C++. Name
/// lookup criteria is specified via the LookupCriteria enumeration.
///
/// The results of name lookup can vary based on the kind of name
/// lookup performed, the current language, and the translation
/// unit. In C, for example, name lookup will either return nothing
/// (no entity found) or a single declaration. In C++, name lookup
/// can additionally refer to a set of overloaded functions or
/// result in an ambiguity. All of the possible results of name
/// lookup are captured by the LookupResult class, which provides
/// the ability to distinguish among them.
//@{
/// Describes the kind of name lookup to perform.
enum LookupNameKind {
/// Ordinary name lookup, which finds ordinary names (functions,
/// variables, typedefs, etc.) in C and most kinds of names
/// (functions, variables, members, types, etc.) in C++.
LookupOrdinaryName = 0,
/// Tag name lookup, which finds the names of enums, classes,
/// structs, and unions.
LookupTagName,
/// Label name lookup.
LookupLabel,
/// Member name lookup, which finds the names of
/// class/struct/union members.
LookupMemberName,
/// Look up of an operator name (e.g., operator+) for use with
/// operator overloading. This lookup is similar to ordinary name
/// lookup, but will ignore any declarations that are class members.
LookupOperatorName,
/// Look up of a name that precedes the '::' scope resolution
/// operator in C++. This lookup completely ignores operator, object,
/// function, and enumerator names (C++ [basic.lookup.qual]p1).
LookupNestedNameSpecifierName,
/// Look up a namespace name within a C++ using directive or
/// namespace alias definition, ignoring non-namespace names (C++
/// [basic.lookup.udir]p1).
LookupNamespaceName,
/// Look up all declarations in a scope with the given name,
/// including resolved using declarations. This is appropriate
/// for checking redeclarations for a using declaration.
LookupUsingDeclName,
/// Look up an ordinary name that is going to be redeclared as a
/// name with linkage. This lookup ignores any declarations that
/// are outside of the current scope unless they have linkage. See
/// C99 6.2.2p4-5 and C++ [basic.link]p6.
LookupRedeclarationWithLinkage,
/// Look up a friend of a local class. This lookup does not look
/// outside the innermost non-class scope. See C++11 [class.friend]p11.
LookupLocalFriendName,
/// Look up the name of an Objective-C protocol.
LookupObjCProtocolName,
/// Look up implicit 'self' parameter of an objective-c method.
LookupObjCImplicitSelfParam,
/// Look up the name of an OpenMP user-defined reduction operation.
LookupOMPReductionName,
/// Look up the name of an OpenMP user-defined mapper.
LookupOMPMapperName,
/// Look up any declaration with any name.
LookupAnyName
};
/// Specifies whether (or how) name lookup is being performed for a
/// redeclaration (vs. a reference).
enum RedeclarationKind {
/// The lookup is a reference to this name that is not for the
/// purpose of redeclaring the name.
NotForRedeclaration = 0,
/// The lookup results will be used for redeclaration of a name,
/// if an entity by that name already exists and is visible.
ForVisibleRedeclaration,
/// The lookup results will be used for redeclaration of a name
/// with external linkage; non-visible lookup results with external linkage
/// may also be found.
ForExternalRedeclaration
};
RedeclarationKind forRedeclarationInCurContext() {
// A declaration with an owning module for linkage can never link against
// anything that is not visible. We don't need to check linkage here; if
// the context has internal linkage, redeclaration lookup won't find things
// from other TUs, and we can't safely compute linkage yet in general.
if (cast<Decl>(CurContext)
->getOwningModuleForLinkage(/*IgnoreLinkage*/true))
return ForVisibleRedeclaration;
return ForExternalRedeclaration;
}
/// The possible outcomes of name lookup for a literal operator.
enum LiteralOperatorLookupResult {
/// The lookup resulted in an error.
LOLR_Error,
/// The lookup found no match but no diagnostic was issued.
LOLR_ErrorNoDiagnostic,
/// The lookup found a single 'cooked' literal operator, which
/// expects a normal literal to be built and passed to it.
LOLR_Cooked,
/// The lookup found a single 'raw' literal operator, which expects
/// a string literal containing the spelling of the literal token.
LOLR_Raw,
/// The lookup found an overload set of literal operator templates,
/// which expect the characters of the spelling of the literal token to be
/// passed as a non-type template argument pack.
LOLR_Template,
/// The lookup found an overload set of literal operator templates,
/// which expect the character type and characters of the spelling of the
/// string literal token to be passed as template arguments.
LOLR_StringTemplate
};
SpecialMemberOverloadResult LookupSpecialMember(CXXRecordDecl *D,
CXXSpecialMember SM,
bool ConstArg,
bool VolatileArg,
bool RValueThis,
bool ConstThis,
bool VolatileThis);
typedef std::function<void(const TypoCorrection &)> TypoDiagnosticGenerator;
typedef std::function<ExprResult(Sema &, TypoExpr *, TypoCorrection)>
TypoRecoveryCallback;
private:
bool CppLookupName(LookupResult &R, Scope *S);
struct TypoExprState {
std::unique_ptr<TypoCorrectionConsumer> Consumer;
TypoDiagnosticGenerator DiagHandler;
TypoRecoveryCallback RecoveryHandler;
TypoExprState();
TypoExprState(TypoExprState &&other) noexcept;
TypoExprState &operator=(TypoExprState &&other) noexcept;
};
/// The set of unhandled TypoExprs and their associated state.
llvm::MapVector<TypoExpr *, TypoExprState> DelayedTypos;
/// Creates a new TypoExpr AST node.
TypoExpr *createDelayedTypo(std::unique_ptr<TypoCorrectionConsumer> TCC,
TypoDiagnosticGenerator TDG,
TypoRecoveryCallback TRC);
// The set of known/encountered (unique, canonicalized) NamespaceDecls.
//
// The boolean value will be true to indicate that the namespace was loaded
// from an AST/PCH file, or false otherwise.
llvm::MapVector<NamespaceDecl*, bool> KnownNamespaces;
/// Whether we have already loaded known namespaces from an extenal
/// source.
bool LoadedExternalKnownNamespaces;
/// Helper for CorrectTypo and CorrectTypoDelayed used to create and
/// populate a new TypoCorrectionConsumer. Returns nullptr if typo correction
/// should be skipped entirely.
std::unique_ptr<TypoCorrectionConsumer>
makeTypoCorrectionConsumer(const DeclarationNameInfo &Typo,
Sema::LookupNameKind LookupKind, Scope *S,
CXXScopeSpec *SS,
CorrectionCandidateCallback &CCC,
DeclContext *MemberContext, bool EnteringContext,
const ObjCObjectPointerType *OPT,
bool ErrorRecovery);
public:
const TypoExprState &getTypoExprState(TypoExpr *TE) const;
/// Clears the state of the given TypoExpr.
void clearDelayedTypo(TypoExpr *TE);
/// Look up a name, looking for a single declaration. Return
/// null if the results were absent, ambiguous, or overloaded.
///
/// It is preferable to use the elaborated form and explicitly handle
/// ambiguity and overloaded.
NamedDecl *LookupSingleName(Scope *S, DeclarationName Name,
SourceLocation Loc,
LookupNameKind NameKind,
RedeclarationKind Redecl
= NotForRedeclaration);
bool LookupBuiltin(LookupResult &R);
bool LookupName(LookupResult &R, Scope *S,
bool AllowBuiltinCreation = false);
bool LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
bool InUnqualifiedLookup = false);
bool LookupQualifiedName(LookupResult &R, DeclContext *LookupCtx,
CXXScopeSpec &SS);
bool LookupParsedName(LookupResult &R, Scope *S, CXXScopeSpec *SS,
bool AllowBuiltinCreation = false,
bool EnteringContext = false);
ObjCProtocolDecl *LookupProtocol(IdentifierInfo *II, SourceLocation IdLoc,
RedeclarationKind Redecl
= NotForRedeclaration);
bool LookupInSuper(LookupResult &R, CXXRecordDecl *Class);
void LookupOverloadedOperatorName(OverloadedOperatorKind Op, Scope *S,
QualType T1, QualType T2,
UnresolvedSetImpl &Functions);
LabelDecl *LookupOrCreateLabel(IdentifierInfo *II, SourceLocation IdentLoc,
SourceLocation GnuLabelLoc = SourceLocation());
DeclContextLookupResult LookupConstructors(CXXRecordDecl *Class);
CXXConstructorDecl *LookupDefaultConstructor(CXXRecordDecl *Class);
CXXConstructorDecl *LookupCopyingConstructor(CXXRecordDecl *Class,
unsigned Quals);
CXXMethodDecl *LookupCopyingAssignment(CXXRecordDecl *Class, unsigned Quals,
bool RValueThis, unsigned ThisQuals);
CXXConstructorDecl *LookupMovingConstructor(CXXRecordDecl *Class,
unsigned Quals);
CXXMethodDecl *LookupMovingAssignment(CXXRecordDecl *Class, unsigned Quals,
bool RValueThis, unsigned ThisQuals);
CXXDestructorDecl *LookupDestructor(CXXRecordDecl *Class);
bool checkLiteralOperatorId(const CXXScopeSpec &SS, const UnqualifiedId &Id);
LiteralOperatorLookupResult LookupLiteralOperator(Scope *S, LookupResult &R,
ArrayRef<QualType> ArgTys,
bool AllowRaw,
bool AllowTemplate,
bool AllowStringTemplate,
bool DiagnoseMissing);
bool isKnownName(StringRef name);
/// Status of the function emission on the CUDA/HIP/OpenMP host/device attrs.
enum class FunctionEmissionStatus {
Emitted,
CUDADiscarded, // Discarded due to CUDA/HIP hostness
OMPDiscarded, // Discarded due to OpenMP hostness
TemplateDiscarded, // Discarded due to uninstantiated templates
Unknown,
};
FunctionEmissionStatus getEmissionStatus(FunctionDecl *Decl);
// Whether the callee should be ignored in CUDA/HIP/OpenMP host/device check.
bool shouldIgnoreInHostDeviceCheck(FunctionDecl *Callee);
void ArgumentDependentLookup(DeclarationName Name, SourceLocation Loc,
ArrayRef<Expr *> Args, ADLResult &Functions);
void LookupVisibleDecls(Scope *S, LookupNameKind Kind,
VisibleDeclConsumer &Consumer,
bool IncludeGlobalScope = true,
bool LoadExternal = true);
void LookupVisibleDecls(DeclContext *Ctx, LookupNameKind Kind,
VisibleDeclConsumer &Consumer,
bool IncludeGlobalScope = true,
bool IncludeDependentBases = false,
bool LoadExternal = true);
enum CorrectTypoKind {
CTK_NonError, // CorrectTypo used in a non error recovery situation.
CTK_ErrorRecovery // CorrectTypo used in normal error recovery.
};
TypoCorrection CorrectTypo(const DeclarationNameInfo &Typo,
Sema::LookupNameKind LookupKind,
Scope *S, CXXScopeSpec *SS,
CorrectionCandidateCallback &CCC,
CorrectTypoKind Mode,
DeclContext *MemberContext = nullptr,
bool EnteringContext = false,
const ObjCObjectPointerType *OPT = nullptr,
bool RecordFailure = true);
TypoExpr *CorrectTypoDelayed(const DeclarationNameInfo &Typo,
Sema::LookupNameKind LookupKind, Scope *S,
CXXScopeSpec *SS,
CorrectionCandidateCallback &CCC,
TypoDiagnosticGenerator TDG,
TypoRecoveryCallback TRC, CorrectTypoKind Mode,
DeclContext *MemberContext = nullptr,
bool EnteringContext = false,
const ObjCObjectPointerType *OPT = nullptr);
/// Process any TypoExprs in the given Expr and its children,
/// generating diagnostics as appropriate and returning a new Expr if there
/// were typos that were all successfully corrected and ExprError if one or
/// more typos could not be corrected.
///
/// \param E The Expr to check for TypoExprs.
///
/// \param InitDecl A VarDecl to avoid because the Expr being corrected is its
/// initializer.
///
/// \param Filter A function applied to a newly rebuilt Expr to determine if
/// it is an acceptable/usable result from a single combination of typo
/// corrections. As long as the filter returns ExprError, different
/// combinations of corrections will be tried until all are exhausted.
ExprResult
CorrectDelayedTyposInExpr(Expr *E, VarDecl *InitDecl = nullptr,
llvm::function_ref<ExprResult(Expr *)> Filter =
[](Expr *E) -> ExprResult { return E; });
ExprResult
CorrectDelayedTyposInExpr(Expr *E,
llvm::function_ref<ExprResult(Expr *)> Filter) {
return CorrectDelayedTyposInExpr(E, nullptr, Filter);
}
ExprResult
CorrectDelayedTyposInExpr(ExprResult ER, VarDecl *InitDecl = nullptr,
llvm::function_ref<ExprResult(Expr *)> Filter =
[](Expr *E) -> ExprResult { return E; }) {
return ER.isInvalid() ? ER : CorrectDelayedTyposInExpr(ER.get(), Filter);
}
ExprResult
CorrectDelayedTyposInExpr(ExprResult ER,
llvm::function_ref<ExprResult(Expr *)> Filter) {
return CorrectDelayedTyposInExpr(ER, nullptr, Filter);
}
void diagnoseTypo(const TypoCorrection &Correction,
const PartialDiagnostic &TypoDiag,
bool ErrorRecovery = true);
void diagnoseTypo(const TypoCorrection &Correction,
const PartialDiagnostic &TypoDiag,
const PartialDiagnostic &PrevNote,
bool ErrorRecovery = true);
void MarkTypoCorrectedFunctionDefinition(const NamedDecl *F);
void FindAssociatedClassesAndNamespaces(SourceLocation InstantiationLoc,
ArrayRef<Expr *> Args,
AssociatedNamespaceSet &AssociatedNamespaces,
AssociatedClassSet &AssociatedClasses);
void FilterLookupForScope(LookupResult &R, DeclContext *Ctx, Scope *S,
bool ConsiderLinkage, bool AllowInlineNamespace);
bool CheckRedeclarationModuleOwnership(NamedDecl *New, NamedDecl *Old);
void DiagnoseAmbiguousLookup(LookupResult &Result);
//@}
ObjCInterfaceDecl *getObjCInterfaceDecl(IdentifierInfo *&Id,
SourceLocation IdLoc,
bool TypoCorrection = false);
NamedDecl *LazilyCreateBuiltin(IdentifierInfo *II, unsigned ID,
Scope *S, bool ForRedeclaration,
SourceLocation Loc);
NamedDecl *ImplicitlyDefineFunction(SourceLocation Loc, IdentifierInfo &II,
Scope *S);
void AddKnownFunctionAttributes(FunctionDecl *FD);
// More parsing and symbol table subroutines.
void ProcessPragmaWeak(Scope *S, Decl *D);
// Decl attributes - this routine is the top level dispatcher.
void ProcessDeclAttributes(Scope *S, Decl *D, const Declarator &PD);
// Helper for delayed processing of attributes.
void ProcessDeclAttributeDelayed(Decl *D,
const ParsedAttributesView &AttrList);
void ProcessDeclAttributeList(Scope *S, Decl *D, const ParsedAttributesView &AL,
bool IncludeCXX11Attributes = true);
bool ProcessAccessDeclAttributeList(AccessSpecDecl *ASDecl,
const ParsedAttributesView &AttrList);
void checkUnusedDeclAttributes(Declarator &D);
/// Map any API notes provided for this declaration to attributes on the
/// declaration.
///
/// Triggered by declaration-attribute processing.
void ProcessAPINotes(Decl *D);
/// Determine if type T is a valid subject for a nonnull and similar
/// attributes. By default, we look through references (the behavior used by
/// nonnull), but if the second parameter is true, then we treat a reference
/// type as valid.
bool isValidPointerAttrType(QualType T, bool RefOkay = false);
bool CheckRegparmAttr(const ParsedAttr &attr, unsigned &value);
bool CheckCallingConvAttr(const ParsedAttr &attr, CallingConv &CC,
const FunctionDecl *FD = nullptr);
bool CheckAttrTarget(const ParsedAttr &CurrAttr);
bool CheckAttrNoArgs(const ParsedAttr &CurrAttr);
bool checkStringLiteralArgumentAttr(const ParsedAttr &Attr, unsigned ArgNum,
StringRef &Str,
SourceLocation *ArgLocation = nullptr);
bool checkSectionName(SourceLocation LiteralLoc, StringRef Str);
bool checkTargetAttr(SourceLocation LiteralLoc, StringRef Str);
bool checkMSInheritanceAttrOnDefinition(
CXXRecordDecl *RD, SourceRange Range, bool BestCase,
MSInheritanceAttr::Spelling SemanticSpelling);
void CheckAlignasUnderalignment(Decl *D);
/// Adjust the calling convention of a method to be the ABI default if it
/// wasn't specified explicitly. This handles method types formed from
/// function type typedefs and typename template arguments.
void adjustMemberFunctionCC(QualType &T, bool IsStatic, bool IsCtorOrDtor,
SourceLocation Loc);
// Check if there is an explicit attribute, but only look through parens.
// The intent is to look for an attribute on the current declarator, but not
// one that came from a typedef.
bool hasExplicitCallingConv(QualType T);
/// Get the outermost AttributedType node that sets a calling convention.
/// Valid types should not have multiple attributes with different CCs.
const AttributedType *getCallingConvAttributedType(QualType T) const;
/// Check whether a nullability type specifier can be added to the given
/// type through some means not written in source (e.g. API notes).
///
/// \param type The type to which the nullability specifier will be
/// added. On success, this type will be updated appropriately.
///
/// \param nullability The nullability specifier to add.
///
/// \param diagLoc The location to use for diagnostics.
///
/// \param allowArrayTypes Whether to accept nullability specifiers on an
/// array type (e.g., because it will decay to a pointer).
///
/// \param overrideExisting Whether to override an existing, locally-specified
/// nullability specifier rather than complaining about the conflict.
///
/// \returns true if nullability cannot be applied, false otherwise.
bool checkImplicitNullabilityTypeSpecifier(QualType &type,
NullabilityKind nullability,
SourceLocation diagLoc,
bool allowArrayTypes,
bool overrideExisting);
/// Stmt attributes - this routine is the top level dispatcher.
StmtResult ProcessStmtAttributes(Stmt *Stmt,
const ParsedAttributesView &Attrs,
SourceRange Range);
void WarnConflictingTypedMethods(ObjCMethodDecl *Method,
ObjCMethodDecl *MethodDecl,
bool IsProtocolMethodDecl);
void CheckConflictingOverridingMethod(ObjCMethodDecl *Method,
ObjCMethodDecl *Overridden,
bool IsProtocolMethodDecl);
/// WarnExactTypedMethods - This routine issues a warning if method
/// implementation declaration matches exactly that of its declaration.
void WarnExactTypedMethods(ObjCMethodDecl *Method,
ObjCMethodDecl *MethodDecl,
bool IsProtocolMethodDecl);
typedef llvm::SmallPtrSet<Selector, 8> SelectorSet;
/// CheckImplementationIvars - This routine checks if the instance variables
/// listed in the implelementation match those listed in the interface.
void CheckImplementationIvars(ObjCImplementationDecl *ImpDecl,
ObjCIvarDecl **Fields, unsigned nIvars,
SourceLocation Loc);
/// ImplMethodsVsClassMethods - This is main routine to warn if any method
/// remains unimplemented in the class or category \@implementation.
void ImplMethodsVsClassMethods(Scope *S, ObjCImplDecl* IMPDecl,
ObjCContainerDecl* IDecl,
bool IncompleteImpl = false);
/// DiagnoseUnimplementedProperties - This routine warns on those properties
/// which must be implemented by this implementation.
void DiagnoseUnimplementedProperties(Scope *S, ObjCImplDecl* IMPDecl,
ObjCContainerDecl *CDecl,
bool SynthesizeProperties);
/// Diagnose any null-resettable synthesized setters.
void diagnoseNullResettableSynthesizedSetters(const ObjCImplDecl *impDecl);
/// DefaultSynthesizeProperties - This routine default synthesizes all
/// properties which must be synthesized in the class's \@implementation.
void DefaultSynthesizeProperties(Scope *S, ObjCImplDecl *IMPDecl,
ObjCInterfaceDecl *IDecl,
SourceLocation AtEnd);
void DefaultSynthesizeProperties(Scope *S, Decl *D, SourceLocation AtEnd);
/// IvarBacksCurrentMethodAccessor - This routine returns 'true' if 'IV' is
/// an ivar synthesized for 'Method' and 'Method' is a property accessor
/// declared in class 'IFace'.
bool IvarBacksCurrentMethodAccessor(ObjCInterfaceDecl *IFace,
ObjCMethodDecl *Method, ObjCIvarDecl *IV);
/// DiagnoseUnusedBackingIvarInAccessor - Issue an 'unused' warning if ivar which
/// backs the property is not used in the property's accessor.
void DiagnoseUnusedBackingIvarInAccessor(Scope *S,
const ObjCImplementationDecl *ImplD);
/// GetIvarBackingPropertyAccessor - If method is a property setter/getter and
/// it property has a backing ivar, returns this ivar; otherwise, returns NULL.
/// It also returns ivar's property on success.
ObjCIvarDecl *GetIvarBackingPropertyAccessor(const ObjCMethodDecl *Method,
const ObjCPropertyDecl *&PDecl) const;
/// Called by ActOnProperty to handle \@property declarations in
/// class extensions.
ObjCPropertyDecl *HandlePropertyInClassExtension(Scope *S,
SourceLocation AtLoc,
SourceLocation LParenLoc,
FieldDeclarator &FD,
Selector GetterSel,
SourceLocation GetterNameLoc,
Selector SetterSel,
SourceLocation SetterNameLoc,
const bool isReadWrite,
unsigned &Attributes,
const unsigned AttributesAsWritten,
QualType T,
TypeSourceInfo *TSI,
tok::ObjCKeywordKind MethodImplKind);
/// Called by ActOnProperty and HandlePropertyInClassExtension to
/// handle creating the ObjcPropertyDecl for a category or \@interface.
ObjCPropertyDecl *CreatePropertyDecl(Scope *S,
ObjCContainerDecl *CDecl,
SourceLocation AtLoc,
SourceLocation LParenLoc,
FieldDeclarator &FD,
Selector GetterSel,
SourceLocation GetterNameLoc,
Selector SetterSel,
SourceLocation SetterNameLoc,
const bool isReadWrite,
const unsigned Attributes,
const unsigned AttributesAsWritten,
QualType T,
TypeSourceInfo *TSI,
tok::ObjCKeywordKind MethodImplKind,
DeclContext *lexicalDC = nullptr);
/// AtomicPropertySetterGetterRules - This routine enforces the rule (via
/// warning) when atomic property has one but not the other user-declared
/// setter or getter.
void AtomicPropertySetterGetterRules(ObjCImplDecl* IMPDecl,
ObjCInterfaceDecl* IDecl);
void DiagnoseOwningPropertyGetterSynthesis(const ObjCImplementationDecl *D);
void DiagnoseMissingDesignatedInitOverrides(
const ObjCImplementationDecl *ImplD,
const ObjCInterfaceDecl *IFD);
void DiagnoseDuplicateIvars(ObjCInterfaceDecl *ID, ObjCInterfaceDecl *SID);
enum MethodMatchStrategy {
MMS_loose,
MMS_strict
};
/// MatchTwoMethodDeclarations - Checks if two methods' type match and returns
/// true, or false, accordingly.
bool MatchTwoMethodDeclarations(const ObjCMethodDecl *Method,
const ObjCMethodDecl *PrevMethod,
MethodMatchStrategy strategy = MMS_strict);
/// MatchAllMethodDeclarations - Check methods declaraed in interface or
/// or protocol against those declared in their implementations.
void MatchAllMethodDeclarations(const SelectorSet &InsMap,
const SelectorSet &ClsMap,
SelectorSet &InsMapSeen,
SelectorSet &ClsMapSeen,
ObjCImplDecl* IMPDecl,
ObjCContainerDecl* IDecl,
bool &IncompleteImpl,
bool ImmediateClass,
bool WarnCategoryMethodImpl=false);
/// CheckCategoryVsClassMethodMatches - Checks that methods implemented in
/// category matches with those implemented in its primary class and
/// warns each time an exact match is found.
void CheckCategoryVsClassMethodMatches(ObjCCategoryImplDecl *CatIMP);
/// Add the given method to the list of globally-known methods.
void addMethodToGlobalList(ObjCMethodList *List, ObjCMethodDecl *Method);
private:
/// AddMethodToGlobalPool - Add an instance or factory method to the global
/// pool. See descriptoin of AddInstanceMethodToGlobalPool.
void AddMethodToGlobalPool(ObjCMethodDecl *Method, bool impl, bool instance);
/// LookupMethodInGlobalPool - Returns the instance or factory method and
/// optionally warns if there are multiple signatures.
ObjCMethodDecl *LookupMethodInGlobalPool(Selector Sel, SourceRange R,
bool receiverIdOrClass,
bool instance);
public:
/// - Returns instance or factory methods in global method pool for
/// given selector. It checks the desired kind first, if none is found, and
/// parameter checkTheOther is set, it then checks the other kind. If no such
/// method or only one method is found, function returns false; otherwise, it
/// returns true.
bool
CollectMultipleMethodsInGlobalPool(Selector Sel,
SmallVectorImpl<ObjCMethodDecl*>& Methods,
bool InstanceFirst, bool CheckTheOther,
const ObjCObjectType *TypeBound = nullptr);
bool
AreMultipleMethodsInGlobalPool(Selector Sel, ObjCMethodDecl *BestMethod,
SourceRange R, bool receiverIdOrClass,
SmallVectorImpl<ObjCMethodDecl*>& Methods);
void
DiagnoseMultipleMethodInGlobalPool(SmallVectorImpl<ObjCMethodDecl*> &Methods,
Selector Sel, SourceRange R,
bool receiverIdOrClass);
private:
/// - Returns a selector which best matches given argument list or
/// nullptr if none could be found
ObjCMethodDecl *SelectBestMethod(Selector Sel, MultiExprArg Args,
bool IsInstance,
SmallVectorImpl<ObjCMethodDecl*>& Methods);
/// Record the typo correction failure and return an empty correction.
TypoCorrection FailedCorrection(IdentifierInfo *Typo, SourceLocation TypoLoc,
bool RecordFailure = true) {
if (RecordFailure)
TypoCorrectionFailures[Typo].insert(TypoLoc);
return TypoCorrection();
}
public:
/// AddInstanceMethodToGlobalPool - All instance methods in a translation
/// unit are added to a global pool. This allows us to efficiently associate
/// a selector with a method declaraation for purposes of typechecking
/// messages sent to "id" (where the class of the object is unknown).
void AddInstanceMethodToGlobalPool(ObjCMethodDecl *Method, bool impl=false) {
AddMethodToGlobalPool(Method, impl, /*instance*/true);
}
/// AddFactoryMethodToGlobalPool - Same as above, but for factory methods.
void AddFactoryMethodToGlobalPool(ObjCMethodDecl *Method, bool impl=false) {
AddMethodToGlobalPool(Method, impl, /*instance*/false);
}
/// AddAnyMethodToGlobalPool - Add any method, instance or factory to global
/// pool.
void AddAnyMethodToGlobalPool(Decl *D);
/// LookupInstanceMethodInGlobalPool - Returns the method and warns if
/// there are multiple signatures.
ObjCMethodDecl *LookupInstanceMethodInGlobalPool(Selector Sel, SourceRange R,
bool receiverIdOrClass=false) {
return LookupMethodInGlobalPool(Sel, R, receiverIdOrClass,
/*instance*/true);
}
/// LookupFactoryMethodInGlobalPool - Returns the method and warns if
/// there are multiple signatures.
ObjCMethodDecl *LookupFactoryMethodInGlobalPool(Selector Sel, SourceRange R,
bool receiverIdOrClass=false) {
return LookupMethodInGlobalPool(Sel, R, receiverIdOrClass,
/*instance*/false);
}
const ObjCMethodDecl *SelectorsForTypoCorrection(Selector Sel,
QualType ObjectType=QualType());
/// LookupImplementedMethodInGlobalPool - Returns the method which has an
/// implementation.
ObjCMethodDecl *LookupImplementedMethodInGlobalPool(Selector Sel);
/// CollectIvarsToConstructOrDestruct - Collect those ivars which require
/// initialization.
void CollectIvarsToConstructOrDestruct(ObjCInterfaceDecl *OI,
SmallVectorImpl<ObjCIvarDecl*> &Ivars);
//===--------------------------------------------------------------------===//
// Statement Parsing Callbacks: SemaStmt.cpp.
public:
class FullExprArg {
public:
FullExprArg() : E(nullptr) { }
FullExprArg(Sema &actions) : E(nullptr) { }
ExprResult release() {
return E;
}
Expr *get() const { return E; }
Expr *operator->() {
return E;
}
private:
// FIXME: No need to make the entire Sema class a friend when it's just
// Sema::MakeFullExpr that needs access to the constructor below.
friend class Sema;
explicit FullExprArg(Expr *expr) : E(expr) {}
Expr *E;
};
FullExprArg MakeFullExpr(Expr *Arg) {
return MakeFullExpr(Arg, Arg ? Arg->getExprLoc() : SourceLocation());
}
FullExprArg MakeFullExpr(Expr *Arg, SourceLocation CC) {
return FullExprArg(
ActOnFinishFullExpr(Arg, CC, /*DiscardedValue*/ false).get());
}
FullExprArg MakeFullDiscardedValueExpr(Expr *Arg) {
ExprResult FE =
ActOnFinishFullExpr(Arg, Arg ? Arg->getExprLoc() : SourceLocation(),
/*DiscardedValue*/ true);
return FullExprArg(FE.get());
}
StmtResult ActOnExprStmt(ExprResult Arg, bool DiscardedValue = true);
StmtResult ActOnExprStmtError();
StmtResult ActOnNullStmt(SourceLocation SemiLoc,
bool HasLeadingEmptyMacro = false);
void ActOnStartOfCompoundStmt(bool IsStmtExpr);
void ActOnFinishOfCompoundStmt();
StmtResult ActOnCompoundStmt(SourceLocation L, SourceLocation R,
ArrayRef<Stmt *> Elts, bool isStmtExpr);
/// A RAII object to enter scope of a compound statement.
class CompoundScopeRAII {
public:
CompoundScopeRAII(Sema &S, bool IsStmtExpr = false) : S(S) {
S.ActOnStartOfCompoundStmt(IsStmtExpr);
}
~CompoundScopeRAII() {
S.ActOnFinishOfCompoundStmt();
}
private:
Sema &S;
};
/// An RAII helper that pops function a function scope on exit.
struct FunctionScopeRAII {
Sema &S;
bool Active;
FunctionScopeRAII(Sema &S) : S(S), Active(true) {}
~FunctionScopeRAII() {
if (Active)
S.PopFunctionScopeInfo();
}
void disable() { Active = false; }
};
StmtResult ActOnDeclStmt(DeclGroupPtrTy Decl,
SourceLocation StartLoc,
SourceLocation EndLoc);
void ActOnForEachDeclStmt(DeclGroupPtrTy Decl);
StmtResult ActOnForEachLValueExpr(Expr *E);
ExprResult ActOnCaseExpr(SourceLocation CaseLoc, ExprResult Val);
StmtResult ActOnCaseStmt(SourceLocation CaseLoc, ExprResult LHS,
SourceLocation DotDotDotLoc, ExprResult RHS,
SourceLocation ColonLoc);
void ActOnCaseStmtBody(Stmt *CaseStmt, Stmt *SubStmt);
StmtResult ActOnDefaultStmt(SourceLocation DefaultLoc,
SourceLocation ColonLoc,
Stmt *SubStmt, Scope *CurScope);
StmtResult ActOnLabelStmt(SourceLocation IdentLoc, LabelDecl *TheDecl,
SourceLocation ColonLoc, Stmt *SubStmt);
StmtResult ActOnAttributedStmt(SourceLocation AttrLoc,
ArrayRef<const Attr*> Attrs,
Stmt *SubStmt);
class ConditionResult;
StmtResult ActOnIfStmt(SourceLocation IfLoc, bool IsConstexpr,
Stmt *InitStmt,
ConditionResult Cond, Stmt *ThenVal,
SourceLocation ElseLoc, Stmt *ElseVal);
StmtResult BuildIfStmt(SourceLocation IfLoc, bool IsConstexpr,
Stmt *InitStmt,
ConditionResult Cond, Stmt *ThenVal,
SourceLocation ElseLoc, Stmt *ElseVal);
StmtResult ActOnStartOfSwitchStmt(SourceLocation SwitchLoc,
Stmt *InitStmt,
ConditionResult Cond);
StmtResult ActOnFinishSwitchStmt(SourceLocation SwitchLoc,
Stmt *Switch, Stmt *Body);
StmtResult ActOnWhileStmt(SourceLocation WhileLoc, ConditionResult Cond,
Stmt *Body);
StmtResult ActOnDoStmt(SourceLocation DoLoc, Stmt *Body,
SourceLocation WhileLoc, SourceLocation CondLParen,
Expr *Cond, SourceLocation CondRParen);
StmtResult ActOnForStmt(SourceLocation ForLoc,
SourceLocation LParenLoc,
Stmt *First,
ConditionResult Second,
FullExprArg Third,
SourceLocation RParenLoc,
Stmt *Body);
ExprResult CheckObjCForCollectionOperand(SourceLocation forLoc,
Expr *collection);
StmtResult ActOnObjCForCollectionStmt(SourceLocation ForColLoc,
Stmt *First, Expr *collection,
SourceLocation RParenLoc);
StmtResult FinishObjCForCollectionStmt(Stmt *ForCollection, Stmt *Body);
enum BuildForRangeKind {
/// Initial building of a for-range statement.
BFRK_Build,
/// Instantiation or recovery rebuild of a for-range statement. Don't
/// attempt any typo-correction.
BFRK_Rebuild,
/// Determining whether a for-range statement could be built. Avoid any
/// unnecessary or irreversible actions.
BFRK_Check
};
StmtResult ActOnCXXForRangeStmt(Scope *S, SourceLocation ForLoc,
SourceLocation CoawaitLoc,
Stmt *InitStmt,
Stmt *LoopVar,
SourceLocation ColonLoc, Expr *Collection,
SourceLocation RParenLoc,
BuildForRangeKind Kind);
StmtResult BuildCXXForRangeStmt(SourceLocation ForLoc,
SourceLocation CoawaitLoc,
Stmt *InitStmt,
SourceLocation ColonLoc,
Stmt *RangeDecl, Stmt *Begin, Stmt *End,
Expr *Cond, Expr *Inc,
Stmt *LoopVarDecl,
SourceLocation RParenLoc,
BuildForRangeKind Kind);
StmtResult FinishCXXForRangeStmt(Stmt *ForRange, Stmt *Body);
StmtResult ActOnGotoStmt(SourceLocation GotoLoc,
SourceLocation LabelLoc,
LabelDecl *TheDecl);
StmtResult ActOnIndirectGotoStmt(SourceLocation GotoLoc,
SourceLocation StarLoc,
Expr *DestExp);
StmtResult ActOnContinueStmt(SourceLocation ContinueLoc, Scope *CurScope);
StmtResult ActOnBreakStmt(SourceLocation BreakLoc, Scope *CurScope);
void ActOnCapturedRegionStart(SourceLocation Loc, Scope *CurScope,
CapturedRegionKind Kind, unsigned NumParams);
typedef std::pair<StringRef, QualType> CapturedParamNameType;
void ActOnCapturedRegionStart(SourceLocation Loc, Scope *CurScope,
CapturedRegionKind Kind,
ArrayRef<CapturedParamNameType> Params,
unsigned OpenMPCaptureLevel = 0);
StmtResult ActOnCapturedRegionEnd(Stmt *S);
void ActOnCapturedRegionError();
RecordDecl *CreateCapturedStmtRecordDecl(CapturedDecl *&CD,
SourceLocation Loc,
unsigned NumParams);
enum CopyElisionSemanticsKind {
CES_Strict = 0,
CES_AllowParameters = 1,
CES_AllowDifferentTypes = 2,
CES_AllowExceptionVariables = 4,
CES_FormerDefault = (CES_AllowParameters),
CES_Default = (CES_AllowParameters | CES_AllowDifferentTypes),
CES_AsIfByStdMove = (CES_AllowParameters | CES_AllowDifferentTypes |
CES_AllowExceptionVariables),
};
VarDecl *getCopyElisionCandidate(QualType ReturnType, Expr *E,
CopyElisionSemanticsKind CESK);
bool isCopyElisionCandidate(QualType ReturnType, const VarDecl *VD,
CopyElisionSemanticsKind CESK);
StmtResult ActOnReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp,
Scope *CurScope);
StmtResult BuildReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp);
StmtResult ActOnCapScopeReturnStmt(SourceLocation ReturnLoc, Expr *RetValExp);
StmtResult ActOnGCCAsmStmt(SourceLocation AsmLoc, bool IsSimple,
bool IsVolatile, unsigned NumOutputs,
unsigned NumInputs, IdentifierInfo **Names,
MultiExprArg Constraints, MultiExprArg Exprs,
Expr *AsmString, MultiExprArg Clobbers,
unsigned NumLabels,
SourceLocation RParenLoc);
void FillInlineAsmIdentifierInfo(Expr *Res,
llvm::InlineAsmIdentifierInfo &Info);
ExprResult LookupInlineAsmIdentifier(CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
UnqualifiedId &Id,
bool IsUnevaluatedContext);
bool LookupInlineAsmField(StringRef Base, StringRef Member,
unsigned &Offset, SourceLocation AsmLoc);
ExprResult LookupInlineAsmVarDeclField(Expr *RefExpr, StringRef Member,
SourceLocation AsmLoc);
StmtResult ActOnMSAsmStmt(SourceLocation AsmLoc, SourceLocation LBraceLoc,
ArrayRef<Token> AsmToks,
StringRef AsmString,
unsigned NumOutputs, unsigned NumInputs,
ArrayRef<StringRef> Constraints,
ArrayRef<StringRef> Clobbers,
ArrayRef<Expr*> Exprs,
SourceLocation EndLoc);
LabelDecl *GetOrCreateMSAsmLabel(StringRef ExternalLabelName,
SourceLocation Location,
bool AlwaysCreate);
VarDecl *BuildObjCExceptionDecl(TypeSourceInfo *TInfo, QualType ExceptionType,
SourceLocation StartLoc,
SourceLocation IdLoc, IdentifierInfo *Id,
bool Invalid = false);
Decl *ActOnObjCExceptionDecl(Scope *S, Declarator &D);
StmtResult ActOnObjCAtCatchStmt(SourceLocation AtLoc, SourceLocation RParen,
Decl *Parm, Stmt *Body);
StmtResult ActOnObjCAtFinallyStmt(SourceLocation AtLoc, Stmt *Body);
StmtResult ActOnObjCAtTryStmt(SourceLocation AtLoc, Stmt *Try,
MultiStmtArg Catch, Stmt *Finally);
StmtResult BuildObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw);
StmtResult ActOnObjCAtThrowStmt(SourceLocation AtLoc, Expr *Throw,
Scope *CurScope);
ExprResult ActOnObjCAtSynchronizedOperand(SourceLocation atLoc,
Expr *operand);
StmtResult ActOnObjCAtSynchronizedStmt(SourceLocation AtLoc,
Expr *SynchExpr,
Stmt *SynchBody);
StmtResult ActOnObjCAutoreleasePoolStmt(SourceLocation AtLoc, Stmt *Body);
VarDecl *BuildExceptionDeclaration(Scope *S, TypeSourceInfo *TInfo,
SourceLocation StartLoc,
SourceLocation IdLoc,
IdentifierInfo *Id);
Decl *ActOnExceptionDeclarator(Scope *S, Declarator &D);
StmtResult ActOnCXXCatchBlock(SourceLocation CatchLoc,
Decl *ExDecl, Stmt *HandlerBlock);
StmtResult ActOnCXXTryBlock(SourceLocation TryLoc, Stmt *TryBlock,
ArrayRef<Stmt *> Handlers);
StmtResult ActOnSEHTryBlock(bool IsCXXTry, // try (true) or __try (false) ?
SourceLocation TryLoc, Stmt *TryBlock,
Stmt *Handler);
StmtResult ActOnSEHExceptBlock(SourceLocation Loc,
Expr *FilterExpr,
Stmt *Block);
void ActOnStartSEHFinallyBlock();
void ActOnAbortSEHFinallyBlock();
StmtResult ActOnFinishSEHFinallyBlock(SourceLocation Loc, Stmt *Block);
StmtResult ActOnSEHLeaveStmt(SourceLocation Loc, Scope *CurScope);
void DiagnoseReturnInConstructorExceptionHandler(CXXTryStmt *TryBlock);
bool ShouldWarnIfUnusedFileScopedDecl(const DeclaratorDecl *D) const;
/// If it's a file scoped decl that must warn if not used, keep track
/// of it.
void MarkUnusedFileScopedDecl(const DeclaratorDecl *D);
/// DiagnoseUnusedExprResult - If the statement passed in is an expression
/// whose result is unused, warn.
void DiagnoseUnusedExprResult(const Stmt *S);
void DiagnoseUnusedNestedTypedefs(const RecordDecl *D);
void DiagnoseUnusedDecl(const NamedDecl *ND);
/// Emit \p DiagID if statement located on \p StmtLoc has a suspicious null
/// statement as a \p Body, and it is located on the same line.
///
/// This helps prevent bugs due to typos, such as:
/// if (condition);
/// do_stuff();
void DiagnoseEmptyStmtBody(SourceLocation StmtLoc,
const Stmt *Body,
unsigned DiagID);
/// Warn if a for/while loop statement \p S, which is followed by
/// \p PossibleBody, has a suspicious null statement as a body.
void DiagnoseEmptyLoopBody(const Stmt *S,
const Stmt *PossibleBody);
/// Warn if a value is moved to itself.
void DiagnoseSelfMove(const Expr *LHSExpr, const Expr *RHSExpr,
SourceLocation OpLoc);
/// Warn if we're implicitly casting from a _Nullable pointer type to a
/// _Nonnull one.
void diagnoseNullableToNonnullConversion(QualType DstType, QualType SrcType,
SourceLocation Loc);
/// Warn when implicitly casting 0 to nullptr.
void diagnoseZeroToNullptrConversion(CastKind Kind, const Expr *E);
ParsingDeclState PushParsingDeclaration(sema::DelayedDiagnosticPool &pool) {
return DelayedDiagnostics.push(pool);
}
void PopParsingDeclaration(ParsingDeclState state, Decl *decl);
typedef ProcessingContextState ParsingClassState;
ParsingClassState PushParsingClass() {
return DelayedDiagnostics.pushUndelayed();
}
void PopParsingClass(ParsingClassState state) {
DelayedDiagnostics.popUndelayed(state);
}
void redelayDiagnostics(sema::DelayedDiagnosticPool &pool);
void DiagnoseAvailabilityOfDecl(NamedDecl *D, ArrayRef<SourceLocation> Locs,
const ObjCInterfaceDecl *UnknownObjCClass,
bool ObjCPropertyAccess,
bool AvoidPartialAvailabilityChecks = false,
ObjCInterfaceDecl *ClassReceiver = nullptr);
bool makeUnavailableInSystemHeader(SourceLocation loc,
UnavailableAttr::ImplicitReason reason);
/// Issue any -Wunguarded-availability warnings in \c FD
void DiagnoseUnguardedAvailabilityViolations(Decl *FD);
//===--------------------------------------------------------------------===//
// Expression Parsing Callbacks: SemaExpr.cpp.
bool CanUseDecl(NamedDecl *D, bool TreatUnavailableAsInvalid);
bool DiagnoseUseOfDecl(NamedDecl *D, ArrayRef<SourceLocation> Locs,
const ObjCInterfaceDecl *UnknownObjCClass = nullptr,
bool ObjCPropertyAccess = false,
bool AvoidPartialAvailabilityChecks = false,
ObjCInterfaceDecl *ClassReciever = nullptr);
void NoteDeletedFunction(FunctionDecl *FD);
void NoteDeletedInheritingConstructor(CXXConstructorDecl *CD);
bool DiagnosePropertyAccessorMismatch(ObjCPropertyDecl *PD,
ObjCMethodDecl *Getter,
SourceLocation Loc);
void DiagnoseSentinelCalls(NamedDecl *D, SourceLocation Loc,
ArrayRef<Expr *> Args);
void PushExpressionEvaluationContext(
ExpressionEvaluationContext NewContext, Decl *LambdaContextDecl = nullptr,
ExpressionEvaluationContextRecord::ExpressionKind Type =
ExpressionEvaluationContextRecord::EK_Other);
enum ReuseLambdaContextDecl_t { ReuseLambdaContextDecl };
void PushExpressionEvaluationContext(
ExpressionEvaluationContext NewContext, ReuseLambdaContextDecl_t,
ExpressionEvaluationContextRecord::ExpressionKind Type =
ExpressionEvaluationContextRecord::EK_Other);
void PopExpressionEvaluationContext();
void DiscardCleanupsInEvaluationContext();
ExprResult TransformToPotentiallyEvaluated(Expr *E);
ExprResult HandleExprEvaluationContextForTypeof(Expr *E);
ExprResult CheckUnevaluatedOperand(Expr *E);
void CheckUnusedVolatileAssignment(Expr *E);
ExprResult ActOnConstantExpression(ExprResult Res);
// Functions for marking a declaration referenced. These functions also
// contain the relevant logic for marking if a reference to a function or
// variable is an odr-use (in the C++11 sense). There are separate variants
// for expressions referring to a decl; these exist because odr-use marking
// needs to be delayed for some constant variables when we build one of the
// named expressions.
//
// MightBeOdrUse indicates whether the use could possibly be an odr-use, and
// should usually be true. This only needs to be set to false if the lack of
// odr-use cannot be determined from the current context (for instance,
// because the name denotes a virtual function and was written without an
// explicit nested-name-specifier).
void MarkAnyDeclReferenced(SourceLocation Loc, Decl *D, bool MightBeOdrUse);
void MarkFunctionReferenced(SourceLocation Loc, FunctionDecl *Func,
bool MightBeOdrUse = true);
void MarkVariableReferenced(SourceLocation Loc, VarDecl *Var);
void MarkDeclRefReferenced(DeclRefExpr *E, const Expr *Base = nullptr);
void MarkMemberReferenced(MemberExpr *E);
void MarkFunctionParmPackReferenced(FunctionParmPackExpr *E);
void MarkCaptureUsedInEnclosingContext(VarDecl *Capture, SourceLocation Loc,
unsigned CapturingScopeIndex);
ExprResult CheckLValueToRValueConversionOperand(Expr *E);
void CleanupVarDeclMarking();
enum TryCaptureKind {
TryCapture_Implicit, TryCapture_ExplicitByVal, TryCapture_ExplicitByRef
};
/// Try to capture the given variable.
///
/// \param Var The variable to capture.
///
/// \param Loc The location at which the capture occurs.
///
/// \param Kind The kind of capture, which may be implicit (for either a
/// block or a lambda), or explicit by-value or by-reference (for a lambda).
///
/// \param EllipsisLoc The location of the ellipsis, if one is provided in
/// an explicit lambda capture.
///
/// \param BuildAndDiagnose Whether we are actually supposed to add the
/// captures or diagnose errors. If false, this routine merely check whether
/// the capture can occur without performing the capture itself or complaining
/// if the variable cannot be captured.
///
/// \param CaptureType Will be set to the type of the field used to capture
/// this variable in the innermost block or lambda. Only valid when the
/// variable can be captured.
///
/// \param DeclRefType Will be set to the type of a reference to the capture
/// from within the current scope. Only valid when the variable can be
/// captured.
///
/// \param FunctionScopeIndexToStopAt If non-null, it points to the index
/// of the FunctionScopeInfo stack beyond which we do not attempt to capture.
/// This is useful when enclosing lambdas must speculatively capture
/// variables that may or may not be used in certain specializations of
/// a nested generic lambda.
///
/// \returns true if an error occurred (i.e., the variable cannot be
/// captured) and false if the capture succeeded.
bool tryCaptureVariable(VarDecl *Var, SourceLocation Loc, TryCaptureKind Kind,
SourceLocation EllipsisLoc, bool BuildAndDiagnose,
QualType &CaptureType,
QualType &DeclRefType,
const unsigned *const FunctionScopeIndexToStopAt);
/// Try to capture the given variable.
bool tryCaptureVariable(VarDecl *Var, SourceLocation Loc,
TryCaptureKind Kind = TryCapture_Implicit,
SourceLocation EllipsisLoc = SourceLocation());
/// Checks if the variable must be captured.
bool NeedToCaptureVariable(VarDecl *Var, SourceLocation Loc);
/// Given a variable, determine the type that a reference to that
/// variable will have in the given scope.
QualType getCapturedDeclRefType(VarDecl *Var, SourceLocation Loc);
/// Mark all of the declarations referenced within a particular AST node as
/// referenced. Used when template instantiation instantiates a non-dependent
/// type -- entities referenced by the type are now referenced.
void MarkDeclarationsReferencedInType(SourceLocation Loc, QualType T);
void MarkDeclarationsReferencedInExpr(Expr *E,
bool SkipLocalVariables = false);
/// Try to recover by turning the given expression into a
/// call. Returns true if recovery was attempted or an error was
/// emitted; this may also leave the ExprResult invalid.
bool tryToRecoverWithCall(ExprResult &E, const PartialDiagnostic &PD,
bool ForceComplain = false,
bool (*IsPlausibleResult)(QualType) = nullptr);
/// Figure out if an expression could be turned into a call.
bool tryExprAsCall(Expr &E, QualType &ZeroArgCallReturnTy,
UnresolvedSetImpl &NonTemplateOverloads);
/// Conditionally issue a diagnostic based on the current
/// evaluation context.
///
/// \param Statement If Statement is non-null, delay reporting the
/// diagnostic until the function body is parsed, and then do a basic
/// reachability analysis to determine if the statement is reachable.
/// If it is unreachable, the diagnostic will not be emitted.
bool DiagRuntimeBehavior(SourceLocation Loc, const Stmt *Statement,
const PartialDiagnostic &PD);
/// Similar, but diagnostic is only produced if all the specified statements
/// are reachable.
bool DiagRuntimeBehavior(SourceLocation Loc, ArrayRef<const Stmt*> Stmts,
const PartialDiagnostic &PD);
// Primary Expressions.
SourceRange getExprRange(Expr *E) const;
ExprResult ActOnIdExpression(
Scope *S, CXXScopeSpec &SS, SourceLocation TemplateKWLoc,
UnqualifiedId &Id, bool HasTrailingLParen, bool IsAddressOfOperand,
CorrectionCandidateCallback *CCC = nullptr,
bool IsInlineAsmIdentifier = false, Token *KeywordReplacement = nullptr);
void DecomposeUnqualifiedId(const UnqualifiedId &Id,
TemplateArgumentListInfo &Buffer,
DeclarationNameInfo &NameInfo,
const TemplateArgumentListInfo *&TemplateArgs);
bool
DiagnoseEmptyLookup(Scope *S, CXXScopeSpec &SS, LookupResult &R,
CorrectionCandidateCallback &CCC,
TemplateArgumentListInfo *ExplicitTemplateArgs = nullptr,
ArrayRef<Expr *> Args = None, TypoExpr **Out = nullptr);
DeclResult LookupIvarInObjCMethod(LookupResult &Lookup, Scope *S,
IdentifierInfo *II);
ExprResult BuildIvarRefExpr(Scope *S, SourceLocation Loc, ObjCIvarDecl *IV);
ExprResult LookupInObjCMethod(LookupResult &LookUp, Scope *S,
IdentifierInfo *II,
bool AllowBuiltinCreation=false);
ExprResult ActOnDependentIdExpression(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
const DeclarationNameInfo &NameInfo,
bool isAddressOfOperand,
const TemplateArgumentListInfo *TemplateArgs);
/// If \p D cannot be odr-used in the current expression evaluation context,
/// return a reason explaining why. Otherwise, return NOUR_None.
NonOdrUseReason getNonOdrUseReasonInCurrentContext(ValueDecl *D);
DeclRefExpr *BuildDeclRefExpr(ValueDecl *D, QualType Ty, ExprValueKind VK,
SourceLocation Loc,
const CXXScopeSpec *SS = nullptr);
DeclRefExpr *
BuildDeclRefExpr(ValueDecl *D, QualType Ty, ExprValueKind VK,
const DeclarationNameInfo &NameInfo,
const CXXScopeSpec *SS = nullptr,
NamedDecl *FoundD = nullptr,
SourceLocation TemplateKWLoc = SourceLocation(),
const TemplateArgumentListInfo *TemplateArgs = nullptr);
DeclRefExpr *
BuildDeclRefExpr(ValueDecl *D, QualType Ty, ExprValueKind VK,
const DeclarationNameInfo &NameInfo,
NestedNameSpecifierLoc NNS,
NamedDecl *FoundD = nullptr,
SourceLocation TemplateKWLoc = SourceLocation(),
const TemplateArgumentListInfo *TemplateArgs = nullptr);
ExprResult
BuildAnonymousStructUnionMemberReference(
const CXXScopeSpec &SS,
SourceLocation nameLoc,
IndirectFieldDecl *indirectField,
DeclAccessPair FoundDecl = DeclAccessPair::make(nullptr, AS_none),
Expr *baseObjectExpr = nullptr,
SourceLocation opLoc = SourceLocation());
ExprResult BuildPossibleImplicitMemberExpr(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
LookupResult &R,
const TemplateArgumentListInfo *TemplateArgs,
const Scope *S);
ExprResult BuildImplicitMemberExpr(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
LookupResult &R,
const TemplateArgumentListInfo *TemplateArgs,
bool IsDefiniteInstance,
const Scope *S);
bool UseArgumentDependentLookup(const CXXScopeSpec &SS,
const LookupResult &R,
bool HasTrailingLParen);
ExprResult
BuildQualifiedDeclarationNameExpr(CXXScopeSpec &SS,
const DeclarationNameInfo &NameInfo,
bool IsAddressOfOperand, const Scope *S,
TypeSourceInfo **RecoveryTSI = nullptr);
ExprResult BuildDependentDeclRefExpr(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
const DeclarationNameInfo &NameInfo,
const TemplateArgumentListInfo *TemplateArgs);
ExprResult BuildDeclarationNameExpr(const CXXScopeSpec &SS,
LookupResult &R,
bool NeedsADL,
bool AcceptInvalidDecl = false);
ExprResult BuildDeclarationNameExpr(
const CXXScopeSpec &SS, const DeclarationNameInfo &NameInfo, NamedDecl *D,
NamedDecl *FoundD = nullptr,
const TemplateArgumentListInfo *TemplateArgs = nullptr,
bool AcceptInvalidDecl = false);
ExprResult BuildLiteralOperatorCall(LookupResult &R,
DeclarationNameInfo &SuffixInfo,
ArrayRef<Expr *> Args,
SourceLocation LitEndLoc,
TemplateArgumentListInfo *ExplicitTemplateArgs = nullptr);
ExprResult BuildPredefinedExpr(SourceLocation Loc,
PredefinedExpr::IdentKind IK);
ExprResult ActOnPredefinedExpr(SourceLocation Loc, tok::TokenKind Kind);
ExprResult ActOnIntegerConstant(SourceLocation Loc, uint64_t Val);
bool CheckLoopHintExpr(Expr *E, SourceLocation Loc);
ExprResult ActOnNumericConstant(const Token &Tok, Scope *UDLScope = nullptr);
ExprResult ActOnCharacterConstant(const Token &Tok,
Scope *UDLScope = nullptr);
ExprResult ActOnParenExpr(SourceLocation L, SourceLocation R, Expr *E);
ExprResult ActOnParenListExpr(SourceLocation L,
SourceLocation R,
MultiExprArg Val);
/// ActOnStringLiteral - The specified tokens were lexed as pasted string
/// fragments (e.g. "foo" "bar" L"baz").
ExprResult ActOnStringLiteral(ArrayRef<Token> StringToks,
Scope *UDLScope = nullptr);
ExprResult ActOnGenericSelectionExpr(SourceLocation KeyLoc,
SourceLocation DefaultLoc,
SourceLocation RParenLoc,
Expr *ControllingExpr,
ArrayRef<ParsedType> ArgTypes,
ArrayRef<Expr *> ArgExprs);
ExprResult CreateGenericSelectionExpr(SourceLocation KeyLoc,
SourceLocation DefaultLoc,
SourceLocation RParenLoc,
Expr *ControllingExpr,
ArrayRef<TypeSourceInfo *> Types,
ArrayRef<Expr *> Exprs);
// Binary/Unary Operators. 'Tok' is the token for the operator.
ExprResult CreateBuiltinUnaryOp(SourceLocation OpLoc, UnaryOperatorKind Opc,
Expr *InputExpr);
ExprResult BuildUnaryOp(Scope *S, SourceLocation OpLoc,
UnaryOperatorKind Opc, Expr *Input);
ExprResult ActOnUnaryOp(Scope *S, SourceLocation OpLoc,
tok::TokenKind Op, Expr *Input);
bool isQualifiedMemberAccess(Expr *E);
QualType CheckAddressOfOperand(ExprResult &Operand, SourceLocation OpLoc);
ExprResult CreateUnaryExprOrTypeTraitExpr(TypeSourceInfo *TInfo,
SourceLocation OpLoc,
UnaryExprOrTypeTrait ExprKind,
SourceRange R);
ExprResult CreateUnaryExprOrTypeTraitExpr(Expr *E, SourceLocation OpLoc,
UnaryExprOrTypeTrait ExprKind);
ExprResult
ActOnUnaryExprOrTypeTraitExpr(SourceLocation OpLoc,
UnaryExprOrTypeTrait ExprKind,
bool IsType, void *TyOrEx,
SourceRange ArgRange);
ExprResult CheckPlaceholderExpr(Expr *E);
bool CheckVecStepExpr(Expr *E);
bool CheckUnaryExprOrTypeTraitOperand(Expr *E, UnaryExprOrTypeTrait ExprKind);
bool CheckUnaryExprOrTypeTraitOperand(QualType ExprType, SourceLocation OpLoc,
SourceRange ExprRange,
UnaryExprOrTypeTrait ExprKind);
ExprResult ActOnSizeofParameterPackExpr(Scope *S,
SourceLocation OpLoc,
IdentifierInfo &Name,
SourceLocation NameLoc,
SourceLocation RParenLoc);
ExprResult ActOnPostfixUnaryOp(Scope *S, SourceLocation OpLoc,
tok::TokenKind Kind, Expr *Input);
ExprResult ActOnArraySubscriptExpr(Scope *S, Expr *Base, SourceLocation LLoc,
Expr *Idx, SourceLocation RLoc);
ExprResult CreateBuiltinArraySubscriptExpr(Expr *Base, SourceLocation LLoc,
Expr *Idx, SourceLocation RLoc);
ExprResult ActOnOMPArraySectionExpr(Expr *Base, SourceLocation LBLoc,
Expr *LowerBound, SourceLocation ColonLoc,
Expr *Length, SourceLocation RBLoc);
// This struct is for use by ActOnMemberAccess to allow
// BuildMemberReferenceExpr to be able to reinvoke ActOnMemberAccess after
// changing the access operator from a '.' to a '->' (to see if that is the
// change needed to fix an error about an unknown member, e.g. when the class
// defines a custom operator->).
struct ActOnMemberAccessExtraArgs {
Scope *S;
UnqualifiedId &Id;
Decl *ObjCImpDecl;
};
ExprResult BuildMemberReferenceExpr(
Expr *Base, QualType BaseType, SourceLocation OpLoc, bool IsArrow,
CXXScopeSpec &SS, SourceLocation TemplateKWLoc,
NamedDecl *FirstQualifierInScope, const DeclarationNameInfo &NameInfo,
const TemplateArgumentListInfo *TemplateArgs,
const Scope *S,
ActOnMemberAccessExtraArgs *ExtraArgs = nullptr);
ExprResult
BuildMemberReferenceExpr(Expr *Base, QualType BaseType, SourceLocation OpLoc,
bool IsArrow, const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
NamedDecl *FirstQualifierInScope, LookupResult &R,
const TemplateArgumentListInfo *TemplateArgs,
const Scope *S,
bool SuppressQualifierCheck = false,
ActOnMemberAccessExtraArgs *ExtraArgs = nullptr);
ExprResult BuildFieldReferenceExpr(Expr *BaseExpr, bool IsArrow,
SourceLocation OpLoc,
const CXXScopeSpec &SS, FieldDecl *Field,
DeclAccessPair FoundDecl,
const DeclarationNameInfo &MemberNameInfo);
ExprResult PerformMemberExprBaseConversion(Expr *Base, bool IsArrow);
bool CheckQualifiedMemberReference(Expr *BaseExpr, QualType BaseType,
const CXXScopeSpec &SS,
const LookupResult &R);
ExprResult ActOnDependentMemberExpr(Expr *Base, QualType BaseType,
bool IsArrow, SourceLocation OpLoc,
const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
NamedDecl *FirstQualifierInScope,
const DeclarationNameInfo &NameInfo,
const TemplateArgumentListInfo *TemplateArgs);
ExprResult ActOnMemberAccessExpr(Scope *S, Expr *Base,
SourceLocation OpLoc,
tok::TokenKind OpKind,
CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
UnqualifiedId &Member,
Decl *ObjCImpDecl);
MemberExpr *
BuildMemberExpr(Expr *Base, bool IsArrow, SourceLocation OpLoc,
const CXXScopeSpec *SS, SourceLocation TemplateKWLoc,
ValueDecl *Member, DeclAccessPair FoundDecl,
bool HadMultipleCandidates,
const DeclarationNameInfo &MemberNameInfo, QualType Ty,
ExprValueKind VK, ExprObjectKind OK,
const TemplateArgumentListInfo *TemplateArgs = nullptr);
MemberExpr *
BuildMemberExpr(Expr *Base, bool IsArrow, SourceLocation OpLoc,
NestedNameSpecifierLoc NNS, SourceLocation TemplateKWLoc,
ValueDecl *Member, DeclAccessPair FoundDecl,
bool HadMultipleCandidates,
const DeclarationNameInfo &MemberNameInfo, QualType Ty,
ExprValueKind VK, ExprObjectKind OK,
const TemplateArgumentListInfo *TemplateArgs = nullptr);
void ActOnDefaultCtorInitializers(Decl *CDtorDecl);
bool ConvertArgumentsForCall(CallExpr *Call, Expr *Fn,
FunctionDecl *FDecl,
const FunctionProtoType *Proto,
ArrayRef<Expr *> Args,
SourceLocation RParenLoc,
bool ExecConfig = false);
void CheckStaticArrayArgument(SourceLocation CallLoc,
ParmVarDecl *Param,
const Expr *ArgExpr);
/// ActOnCallExpr - Handle a call to Fn with the specified array of arguments.
/// This provides the location of the left/right parens and a list of comma
/// locations.
ExprResult ActOnCallExpr(Scope *S, Expr *Fn, SourceLocation LParenLoc,
MultiExprArg ArgExprs, SourceLocation RParenLoc,
Expr *ExecConfig = nullptr);
ExprResult BuildCallExpr(Scope *S, Expr *Fn, SourceLocation LParenLoc,
MultiExprArg ArgExprs, SourceLocation RParenLoc,
Expr *ExecConfig = nullptr,
bool IsExecConfig = false);
enum class AtomicArgumentOrder { API, AST };
ExprResult
BuildAtomicExpr(SourceRange CallRange, SourceRange ExprRange,
SourceLocation RParenLoc, MultiExprArg Args,
AtomicExpr::AtomicOp Op,
AtomicArgumentOrder ArgOrder = AtomicArgumentOrder::API);
ExprResult
BuildResolvedCallExpr(Expr *Fn, NamedDecl *NDecl, SourceLocation LParenLoc,
ArrayRef<Expr *> Arg, SourceLocation RParenLoc,
Expr *Config = nullptr, bool IsExecConfig = false,
ADLCallKind UsesADL = ADLCallKind::NotADL);
ExprResult ActOnCUDAExecConfigExpr(Scope *S, SourceLocation LLLLoc,
MultiExprArg ExecConfig,
SourceLocation GGGLoc);
ExprResult ActOnCastExpr(Scope *S, SourceLocation LParenLoc,
Declarator &D, ParsedType &Ty,
SourceLocation RParenLoc, Expr *CastExpr);
ExprResult BuildCStyleCastExpr(SourceLocation LParenLoc,
TypeSourceInfo *Ty,
SourceLocation RParenLoc,
Expr *Op);
CastKind PrepareScalarCast(ExprResult &src, QualType destType);
/// Build an altivec or OpenCL literal.
ExprResult BuildVectorLiteral(SourceLocation LParenLoc,
SourceLocation RParenLoc, Expr *E,
TypeSourceInfo *TInfo);
ExprResult MaybeConvertParenListExprToParenExpr(Scope *S, Expr *ME);
ExprResult ActOnCompoundLiteral(SourceLocation LParenLoc,
ParsedType Ty,
SourceLocation RParenLoc,
Expr *InitExpr);
ExprResult BuildCompoundLiteralExpr(SourceLocation LParenLoc,
TypeSourceInfo *TInfo,
SourceLocation RParenLoc,
Expr *LiteralExpr);
ExprResult ActOnInitList(SourceLocation LBraceLoc,
MultiExprArg InitArgList,
SourceLocation RBraceLoc);
ExprResult BuildInitList(SourceLocation LBraceLoc,
MultiExprArg InitArgList,
SourceLocation RBraceLoc);
ExprResult ActOnDesignatedInitializer(Designation &Desig,
SourceLocation EqualOrColonLoc,
bool GNUSyntax,
ExprResult Init);
private:
static BinaryOperatorKind ConvertTokenKindToBinaryOpcode(tok::TokenKind Kind);
public:
ExprResult ActOnBinOp(Scope *S, SourceLocation TokLoc,
tok::TokenKind Kind, Expr *LHSExpr, Expr *RHSExpr);
ExprResult BuildBinOp(Scope *S, SourceLocation OpLoc,
BinaryOperatorKind Opc, Expr *LHSExpr, Expr *RHSExpr);
ExprResult CreateBuiltinBinOp(SourceLocation OpLoc, BinaryOperatorKind Opc,
Expr *LHSExpr, Expr *RHSExpr);
void DiagnoseCommaOperator(const Expr *LHS, SourceLocation Loc);
/// ActOnConditionalOp - Parse a ?: operation. Note that 'LHS' may be null
/// in the case of a the GNU conditional expr extension.
ExprResult ActOnConditionalOp(SourceLocation QuestionLoc,
SourceLocation ColonLoc,
Expr *CondExpr, Expr *LHSExpr, Expr *RHSExpr);
/// ActOnAddrLabel - Parse the GNU address of label extension: "&&foo".
ExprResult ActOnAddrLabel(SourceLocation OpLoc, SourceLocation LabLoc,
LabelDecl *TheDecl);
void ActOnStartStmtExpr();
ExprResult ActOnStmtExpr(SourceLocation LPLoc, Stmt *SubStmt,
SourceLocation RPLoc); // "({..})"
// Handle the final expression in a statement expression.
ExprResult ActOnStmtExprResult(ExprResult E);
void ActOnStmtExprError();
// __builtin_offsetof(type, identifier(.identifier|[expr])*)
struct OffsetOfComponent {
SourceLocation LocStart, LocEnd;
bool isBrackets; // true if [expr], false if .ident
union {
IdentifierInfo *IdentInfo;
Expr *E;
} U;
};
/// __builtin_offsetof(type, a.b[123][456].c)
ExprResult BuildBuiltinOffsetOf(SourceLocation BuiltinLoc,
TypeSourceInfo *TInfo,
ArrayRef<OffsetOfComponent> Components,
SourceLocation RParenLoc);
ExprResult ActOnBuiltinOffsetOf(Scope *S,
SourceLocation BuiltinLoc,
SourceLocation TypeLoc,
ParsedType ParsedArgTy,
ArrayRef<OffsetOfComponent> Components,
SourceLocation RParenLoc);
// __builtin_choose_expr(constExpr, expr1, expr2)
ExprResult ActOnChooseExpr(SourceLocation BuiltinLoc,
Expr *CondExpr, Expr *LHSExpr,
Expr *RHSExpr, SourceLocation RPLoc);
// __builtin_va_arg(expr, type)
ExprResult ActOnVAArg(SourceLocation BuiltinLoc, Expr *E, ParsedType Ty,
SourceLocation RPLoc);
ExprResult BuildVAArgExpr(SourceLocation BuiltinLoc, Expr *E,
TypeSourceInfo *TInfo, SourceLocation RPLoc);
// __builtin_LINE(), __builtin_FUNCTION(), __builtin_FILE(),
// __builtin_COLUMN()
ExprResult ActOnSourceLocExpr(SourceLocExpr::IdentKind Kind,
SourceLocation BuiltinLoc,
SourceLocation RPLoc);
// Build a potentially resolved SourceLocExpr.
ExprResult BuildSourceLocExpr(SourceLocExpr::IdentKind Kind,
SourceLocation BuiltinLoc, SourceLocation RPLoc,
DeclContext *ParentContext);
// __null
ExprResult ActOnGNUNullExpr(SourceLocation TokenLoc);
bool CheckCaseExpression(Expr *E);
/// Describes the result of an "if-exists" condition check.
enum IfExistsResult {
/// The symbol exists.
IER_Exists,
/// The symbol does not exist.
IER_DoesNotExist,
/// The name is a dependent name, so the results will differ
/// from one instantiation to the next.
IER_Dependent,
/// An error occurred.
IER_Error
};
IfExistsResult
CheckMicrosoftIfExistsSymbol(Scope *S, CXXScopeSpec &SS,
const DeclarationNameInfo &TargetNameInfo);
IfExistsResult
CheckMicrosoftIfExistsSymbol(Scope *S, SourceLocation KeywordLoc,
bool IsIfExists, CXXScopeSpec &SS,
UnqualifiedId &Name);
StmtResult BuildMSDependentExistsStmt(SourceLocation KeywordLoc,
bool IsIfExists,
NestedNameSpecifierLoc QualifierLoc,
DeclarationNameInfo NameInfo,
Stmt *Nested);
StmtResult ActOnMSDependentExistsStmt(SourceLocation KeywordLoc,
bool IsIfExists,
CXXScopeSpec &SS, UnqualifiedId &Name,
Stmt *Nested);
//===------------------------- "Block" Extension ------------------------===//
/// ActOnBlockStart - This callback is invoked when a block literal is
/// started.
void ActOnBlockStart(SourceLocation CaretLoc, Scope *CurScope);
/// ActOnBlockArguments - This callback allows processing of block arguments.
/// If there are no arguments, this is still invoked.
void ActOnBlockArguments(SourceLocation CaretLoc, Declarator &ParamInfo,
Scope *CurScope);
/// ActOnBlockError - If there is an error parsing a block, this callback
/// is invoked to pop the information about the block from the action impl.
void ActOnBlockError(SourceLocation CaretLoc, Scope *CurScope);
/// ActOnBlockStmtExpr - This is called when the body of a block statement
/// literal was successfully completed. ^(int x){...}
ExprResult ActOnBlockStmtExpr(SourceLocation CaretLoc, Stmt *Body,
Scope *CurScope);
//===---------------------------- Clang Extensions ----------------------===//
/// __builtin_convertvector(...)
ExprResult ActOnConvertVectorExpr(Expr *E, ParsedType ParsedDestTy,
SourceLocation BuiltinLoc,
SourceLocation RParenLoc);
//===---------------------------- OpenCL Features -----------------------===//
/// __builtin_astype(...)
ExprResult ActOnAsTypeExpr(Expr *E, ParsedType ParsedDestTy,
SourceLocation BuiltinLoc,
SourceLocation RParenLoc);
//===---------------------------- C++ Features --------------------------===//
// Act on C++ namespaces
Decl *ActOnStartNamespaceDef(Scope *S, SourceLocation InlineLoc,
SourceLocation NamespaceLoc,
SourceLocation IdentLoc, IdentifierInfo *Ident,
SourceLocation LBrace,
const ParsedAttributesView &AttrList,
UsingDirectiveDecl *&UsingDecl);
void ActOnFinishNamespaceDef(Decl *Dcl, SourceLocation RBrace);
NamespaceDecl *getStdNamespace() const;
NamespaceDecl *getOrCreateStdNamespace();
NamespaceDecl *lookupStdExperimentalNamespace();
CXXRecordDecl *getStdBadAlloc() const;
EnumDecl *getStdAlignValT() const;
private:
// A cache representing if we've fully checked the various comparison category
// types stored in ASTContext. The bit-index corresponds to the integer value
// of a ComparisonCategoryType enumerator.
llvm::SmallBitVector FullyCheckedComparisonCategories;
ValueDecl *tryLookupCtorInitMemberDecl(CXXRecordDecl *ClassDecl,
CXXScopeSpec &SS,
ParsedType TemplateTypeTy,
IdentifierInfo *MemberOrBase);
public:
/// Lookup the specified comparison category types in the standard
/// library, an check the VarDecls possibly returned by the operator<=>
/// builtins for that type.
///
/// \return The type of the comparison category type corresponding to the
/// specified Kind, or a null type if an error occurs
QualType CheckComparisonCategoryType(ComparisonCategoryType Kind,
SourceLocation Loc);
/// Tests whether Ty is an instance of std::initializer_list and, if
/// it is and Element is not NULL, assigns the element type to Element.
bool isStdInitializerList(QualType Ty, QualType *Element);
/// Looks for the std::initializer_list template and instantiates it
/// with Element, or emits an error if it's not found.
///
/// \returns The instantiated template, or null on error.
QualType BuildStdInitializerList(QualType Element, SourceLocation Loc);
/// Determine whether Ctor is an initializer-list constructor, as
/// defined in [dcl.init.list]p2.
bool isInitListConstructor(const FunctionDecl *Ctor);
Decl *ActOnUsingDirective(Scope *CurScope, SourceLocation UsingLoc,
SourceLocation NamespcLoc, CXXScopeSpec &SS,
SourceLocation IdentLoc,
IdentifierInfo *NamespcName,
const ParsedAttributesView &AttrList);
void PushUsingDirective(Scope *S, UsingDirectiveDecl *UDir);
Decl *ActOnNamespaceAliasDef(Scope *CurScope,
SourceLocation NamespaceLoc,
SourceLocation AliasLoc,
IdentifierInfo *Alias,
CXXScopeSpec &SS,
SourceLocation IdentLoc,
IdentifierInfo *Ident);
void HideUsingShadowDecl(Scope *S, UsingShadowDecl *Shadow);
bool CheckUsingShadowDecl(UsingDecl *UD, NamedDecl *Target,
const LookupResult &PreviousDecls,
UsingShadowDecl *&PrevShadow);
UsingShadowDecl *BuildUsingShadowDecl(Scope *S, UsingDecl *UD,
NamedDecl *Target,
UsingShadowDecl *PrevDecl);
bool CheckUsingDeclRedeclaration(SourceLocation UsingLoc,
bool HasTypenameKeyword,
const CXXScopeSpec &SS,
SourceLocation NameLoc,
const LookupResult &Previous);
bool CheckUsingDeclQualifier(SourceLocation UsingLoc,
bool HasTypename,
const CXXScopeSpec &SS,
const DeclarationNameInfo &NameInfo,
SourceLocation NameLoc);
NamedDecl *BuildUsingDeclaration(
Scope *S, AccessSpecifier AS, SourceLocation UsingLoc,
bool HasTypenameKeyword, SourceLocation TypenameLoc, CXXScopeSpec &SS,
DeclarationNameInfo NameInfo, SourceLocation EllipsisLoc,
const ParsedAttributesView &AttrList, bool IsInstantiation);
NamedDecl *BuildUsingPackDecl(NamedDecl *InstantiatedFrom,
ArrayRef<NamedDecl *> Expansions);
bool CheckInheritingConstructorUsingDecl(UsingDecl *UD);
/// Given a derived-class using shadow declaration for a constructor and the
/// correspnding base class constructor, find or create the implicit
/// synthesized derived class constructor to use for this initialization.
CXXConstructorDecl *
findInheritingConstructor(SourceLocation Loc, CXXConstructorDecl *BaseCtor,
ConstructorUsingShadowDecl *DerivedShadow);
Decl *ActOnUsingDeclaration(Scope *CurScope, AccessSpecifier AS,
SourceLocation UsingLoc,
SourceLocation TypenameLoc, CXXScopeSpec &SS,
UnqualifiedId &Name, SourceLocation EllipsisLoc,
const ParsedAttributesView &AttrList);
Decl *ActOnAliasDeclaration(Scope *CurScope, AccessSpecifier AS,
MultiTemplateParamsArg TemplateParams,
SourceLocation UsingLoc, UnqualifiedId &Name,
const ParsedAttributesView &AttrList,
TypeResult Type, Decl *DeclFromDeclSpec);
/// BuildCXXConstructExpr - Creates a complete call to a constructor,
/// including handling of its default argument expressions.
///
/// \param ConstructKind - a CXXConstructExpr::ConstructionKind
ExprResult
BuildCXXConstructExpr(SourceLocation ConstructLoc, QualType DeclInitType,
NamedDecl *FoundDecl,
CXXConstructorDecl *Constructor, MultiExprArg Exprs,
bool HadMultipleCandidates, bool IsListInitialization,
bool IsStdInitListInitialization,
bool RequiresZeroInit, unsigned ConstructKind,
SourceRange ParenRange);
/// Build a CXXConstructExpr whose constructor has already been resolved if
/// it denotes an inherited constructor.
ExprResult
BuildCXXConstructExpr(SourceLocation ConstructLoc, QualType DeclInitType,
CXXConstructorDecl *Constructor, bool Elidable,
MultiExprArg Exprs,
bool HadMultipleCandidates, bool IsListInitialization,
bool IsStdInitListInitialization,
bool RequiresZeroInit, unsigned ConstructKind,
SourceRange ParenRange);
// FIXME: Can we remove this and have the above BuildCXXConstructExpr check if
// the constructor can be elidable?
ExprResult
BuildCXXConstructExpr(SourceLocation ConstructLoc, QualType DeclInitType,
NamedDecl *FoundDecl,
CXXConstructorDecl *Constructor, bool Elidable,
MultiExprArg Exprs, bool HadMultipleCandidates,
bool IsListInitialization,
bool IsStdInitListInitialization, bool RequiresZeroInit,
unsigned ConstructKind, SourceRange ParenRange);
ExprResult BuildCXXDefaultInitExpr(SourceLocation Loc, FieldDecl *Field);
/// Instantiate or parse a C++ default argument expression as necessary.
/// Return true on error.
bool CheckCXXDefaultArgExpr(SourceLocation CallLoc, FunctionDecl *FD,
ParmVarDecl *Param);
/// BuildCXXDefaultArgExpr - Creates a CXXDefaultArgExpr, instantiating
/// the default expr if needed.
ExprResult BuildCXXDefaultArgExpr(SourceLocation CallLoc,
FunctionDecl *FD,
ParmVarDecl *Param);
/// FinalizeVarWithDestructor - Prepare for calling destructor on the
/// constructed variable.
void FinalizeVarWithDestructor(VarDecl *VD, const RecordType *DeclInitType);
/// Helper class that collects exception specifications for
/// implicitly-declared special member functions.
class ImplicitExceptionSpecification {
// Pointer to allow copying
Sema *Self;
// We order exception specifications thus:
// noexcept is the most restrictive, but is only used in C++11.
// throw() comes next.
// Then a throw(collected exceptions)
// Finally no specification, which is expressed as noexcept(false).
// throw(...) is used instead if any called function uses it.
ExceptionSpecificationType ComputedEST;
llvm::SmallPtrSet<CanQualType, 4> ExceptionsSeen;
SmallVector<QualType, 4> Exceptions;
void ClearExceptions() {
ExceptionsSeen.clear();
Exceptions.clear();
}
public:
explicit ImplicitExceptionSpecification(Sema &Self)
: Self(&Self), ComputedEST(EST_BasicNoexcept) {
if (!Self.getLangOpts().CPlusPlus11)
ComputedEST = EST_DynamicNone;
}
/// Get the computed exception specification type.
ExceptionSpecificationType getExceptionSpecType() const {
assert(!isComputedNoexcept(ComputedEST) &&
"noexcept(expr) should not be a possible result");
return ComputedEST;
}
/// The number of exceptions in the exception specification.
unsigned size() const { return Exceptions.size(); }
/// The set of exceptions in the exception specification.
const QualType *data() const { return Exceptions.data(); }
/// Integrate another called method into the collected data.
void CalledDecl(SourceLocation CallLoc, const CXXMethodDecl *Method);
/// Integrate an invoked expression into the collected data.
void CalledExpr(Expr *E);
/// Overwrite an EPI's exception specification with this
/// computed exception specification.
FunctionProtoType::ExceptionSpecInfo getExceptionSpec() const {
FunctionProtoType::ExceptionSpecInfo ESI;
ESI.Type = getExceptionSpecType();
if (ESI.Type == EST_Dynamic) {
ESI.Exceptions = Exceptions;
} else if (ESI.Type == EST_None) {
/// C++11 [except.spec]p14:
/// The exception-specification is noexcept(false) if the set of
/// potential exceptions of the special member function contains "any"
ESI.Type = EST_NoexceptFalse;
ESI.NoexceptExpr = Self->ActOnCXXBoolLiteral(SourceLocation(),
tok::kw_false).get();
}
return ESI;
}
};
/// Determine what sort of exception specification a defaulted
/// copy constructor of a class will have.
ImplicitExceptionSpecification
ComputeDefaultedDefaultCtorExceptionSpec(SourceLocation Loc,
CXXMethodDecl *MD);
/// Determine what sort of exception specification a defaulted
/// default constructor of a class will have, and whether the parameter
/// will be const.
ImplicitExceptionSpecification
ComputeDefaultedCopyCtorExceptionSpec(CXXMethodDecl *MD);
/// Determine what sort of exception specification a defaulted
/// copy assignment operator of a class will have, and whether the
/// parameter will be const.
ImplicitExceptionSpecification
ComputeDefaultedCopyAssignmentExceptionSpec(CXXMethodDecl *MD);
/// Determine what sort of exception specification a defaulted move
/// constructor of a class will have.
ImplicitExceptionSpecification
ComputeDefaultedMoveCtorExceptionSpec(CXXMethodDecl *MD);
/// Determine what sort of exception specification a defaulted move
/// assignment operator of a class will have.
ImplicitExceptionSpecification
ComputeDefaultedMoveAssignmentExceptionSpec(CXXMethodDecl *MD);
/// Determine what sort of exception specification a defaulted
/// destructor of a class will have.
ImplicitExceptionSpecification
ComputeDefaultedDtorExceptionSpec(CXXMethodDecl *MD);
/// Determine what sort of exception specification an inheriting
/// constructor of a class will have.
ImplicitExceptionSpecification
ComputeInheritingCtorExceptionSpec(SourceLocation Loc,
CXXConstructorDecl *CD);
/// Evaluate the implicit exception specification for a defaulted
/// special member function.
void EvaluateImplicitExceptionSpec(SourceLocation Loc, CXXMethodDecl *MD);
/// Check the given noexcept-specifier, convert its expression, and compute
/// the appropriate ExceptionSpecificationType.
ExprResult ActOnNoexceptSpec(SourceLocation NoexceptLoc, Expr *NoexceptExpr,
ExceptionSpecificationType &EST);
/// Check the given exception-specification and update the
/// exception specification information with the results.
void checkExceptionSpecification(bool IsTopLevel,
ExceptionSpecificationType EST,
ArrayRef<ParsedType> DynamicExceptions,
ArrayRef<SourceRange> DynamicExceptionRanges,
Expr *NoexceptExpr,
SmallVectorImpl<QualType> &Exceptions,
FunctionProtoType::ExceptionSpecInfo &ESI);
/// Determine if we're in a case where we need to (incorrectly) eagerly
/// parse an exception specification to work around a libstdc++ bug.
bool isLibstdcxxEagerExceptionSpecHack(const Declarator &D);
/// Add an exception-specification to the given member function
/// (or member function template). The exception-specification was parsed
/// after the method itself was declared.
void actOnDelayedExceptionSpecification(Decl *Method,
ExceptionSpecificationType EST,
SourceRange SpecificationRange,
ArrayRef<ParsedType> DynamicExceptions,
ArrayRef<SourceRange> DynamicExceptionRanges,
Expr *NoexceptExpr);
class InheritedConstructorInfo;
/// Determine if a special member function should have a deleted
/// definition when it is defaulted.
bool ShouldDeleteSpecialMember(CXXMethodDecl *MD, CXXSpecialMember CSM,
InheritedConstructorInfo *ICI = nullptr,
bool Diagnose = false);
/// Declare the implicit default constructor for the given class.
///
/// \param ClassDecl The class declaration into which the implicit
/// default constructor will be added.
///
/// \returns The implicitly-declared default constructor.
CXXConstructorDecl *DeclareImplicitDefaultConstructor(
CXXRecordDecl *ClassDecl);
/// DefineImplicitDefaultConstructor - Checks for feasibility of
/// defining this constructor as the default constructor.
void DefineImplicitDefaultConstructor(SourceLocation CurrentLocation,
CXXConstructorDecl *Constructor);
/// Declare the implicit destructor for the given class.
///
/// \param ClassDecl The class declaration into which the implicit
/// destructor will be added.
///
/// \returns The implicitly-declared destructor.
CXXDestructorDecl *DeclareImplicitDestructor(CXXRecordDecl *ClassDecl);
/// DefineImplicitDestructor - Checks for feasibility of
/// defining this destructor as the default destructor.
void DefineImplicitDestructor(SourceLocation CurrentLocation,
CXXDestructorDecl *Destructor);
/// Build an exception spec for destructors that don't have one.
///
/// C++11 says that user-defined destructors with no exception spec get one
/// that looks as if the destructor was implicitly declared.
void AdjustDestructorExceptionSpec(CXXDestructorDecl *Destructor);
/// Define the specified inheriting constructor.
void DefineInheritingConstructor(SourceLocation UseLoc,
CXXConstructorDecl *Constructor);
/// Declare the implicit copy constructor for the given class.
///
/// \param ClassDecl The class declaration into which the implicit
/// copy constructor will be added.
///
/// \returns The implicitly-declared copy constructor.
CXXConstructorDecl *DeclareImplicitCopyConstructor(CXXRecordDecl *ClassDecl);
/// DefineImplicitCopyConstructor - Checks for feasibility of
/// defining this constructor as the copy constructor.
void DefineImplicitCopyConstructor(SourceLocation CurrentLocation,
CXXConstructorDecl *Constructor);
/// Declare the implicit move constructor for the given class.
///
/// \param ClassDecl The Class declaration into which the implicit
/// move constructor will be added.
///
/// \returns The implicitly-declared move constructor, or NULL if it wasn't
/// declared.
CXXConstructorDecl *DeclareImplicitMoveConstructor(CXXRecordDecl *ClassDecl);
/// DefineImplicitMoveConstructor - Checks for feasibility of
/// defining this constructor as the move constructor.
void DefineImplicitMoveConstructor(SourceLocation CurrentLocation,
CXXConstructorDecl *Constructor);
/// Declare the implicit copy assignment operator for the given class.
///
/// \param ClassDecl The class declaration into which the implicit
/// copy assignment operator will be added.
///
/// \returns The implicitly-declared copy assignment operator.
CXXMethodDecl *DeclareImplicitCopyAssignment(CXXRecordDecl *ClassDecl);
/// Defines an implicitly-declared copy assignment operator.
void DefineImplicitCopyAssignment(SourceLocation CurrentLocation,
CXXMethodDecl *MethodDecl);
/// Declare the implicit move assignment operator for the given class.
///
/// \param ClassDecl The Class declaration into which the implicit
/// move assignment operator will be added.
///
/// \returns The implicitly-declared move assignment operator, or NULL if it
/// wasn't declared.
CXXMethodDecl *DeclareImplicitMoveAssignment(CXXRecordDecl *ClassDecl);
/// Defines an implicitly-declared move assignment operator.
void DefineImplicitMoveAssignment(SourceLocation CurrentLocation,
CXXMethodDecl *MethodDecl);
/// Force the declaration of any implicitly-declared members of this
/// class.
void ForceDeclarationOfImplicitMembers(CXXRecordDecl *Class);
/// Check a completed declaration of an implicit special member.
void CheckImplicitSpecialMemberDeclaration(Scope *S, FunctionDecl *FD);
/// Determine whether the given function is an implicitly-deleted
/// special member function.
bool isImplicitlyDeleted(FunctionDecl *FD);
/// Check whether 'this' shows up in the type of a static member
/// function after the (naturally empty) cv-qualifier-seq would be.
///
/// \returns true if an error occurred.
bool checkThisInStaticMemberFunctionType(CXXMethodDecl *Method);
/// Whether this' shows up in the exception specification of a static
/// member function.
bool checkThisInStaticMemberFunctionExceptionSpec(CXXMethodDecl *Method);
/// Check whether 'this' shows up in the attributes of the given
/// static member function.
///
/// \returns true if an error occurred.
bool checkThisInStaticMemberFunctionAttributes(CXXMethodDecl *Method);
/// MaybeBindToTemporary - If the passed in expression has a record type with
/// a non-trivial destructor, this will return CXXBindTemporaryExpr. Otherwise
/// it simply returns the passed in expression.
ExprResult MaybeBindToTemporary(Expr *E);
bool CompleteConstructorCall(CXXConstructorDecl *Constructor,
MultiExprArg ArgsPtr,
SourceLocation Loc,
SmallVectorImpl<Expr*> &ConvertedArgs,
bool AllowExplicit = false,
bool IsListInitialization = false);
ParsedType getInheritingConstructorName(CXXScopeSpec &SS,
SourceLocation NameLoc,
IdentifierInfo &Name);
ParsedType getConstructorName(IdentifierInfo &II, SourceLocation NameLoc,
Scope *S, CXXScopeSpec &SS,
bool EnteringContext);
ParsedType getDestructorName(SourceLocation TildeLoc,
IdentifierInfo &II, SourceLocation NameLoc,
Scope *S, CXXScopeSpec &SS,
ParsedType ObjectType,
bool EnteringContext);
ParsedType getDestructorTypeForDecltype(const DeclSpec &DS,
ParsedType ObjectType);
// Checks that reinterpret casts don't have undefined behavior.
void CheckCompatibleReinterpretCast(QualType SrcType, QualType DestType,
bool IsDereference, SourceRange Range);
/// ActOnCXXNamedCast - Parse {dynamic,static,reinterpret,const}_cast's.
ExprResult ActOnCXXNamedCast(SourceLocation OpLoc,
tok::TokenKind Kind,
SourceLocation LAngleBracketLoc,
Declarator &D,
SourceLocation RAngleBracketLoc,
SourceLocation LParenLoc,
Expr *E,
SourceLocation RParenLoc);
ExprResult BuildCXXNamedCast(SourceLocation OpLoc,
tok::TokenKind Kind,
TypeSourceInfo *Ty,
Expr *E,
SourceRange AngleBrackets,
SourceRange Parens);
ExprResult ActOnBuiltinBitCastExpr(SourceLocation KWLoc, Declarator &Dcl,
ExprResult Operand,
SourceLocation RParenLoc);
ExprResult BuildBuiltinBitCastExpr(SourceLocation KWLoc, TypeSourceInfo *TSI,
Expr *Operand, SourceLocation RParenLoc);
ExprResult BuildCXXTypeId(QualType TypeInfoType,
SourceLocation TypeidLoc,
TypeSourceInfo *Operand,
SourceLocation RParenLoc);
ExprResult BuildCXXTypeId(QualType TypeInfoType,
SourceLocation TypeidLoc,
Expr *Operand,
SourceLocation RParenLoc);
/// ActOnCXXTypeid - Parse typeid( something ).
ExprResult ActOnCXXTypeid(SourceLocation OpLoc,
SourceLocation LParenLoc, bool isType,
void *TyOrExpr,
SourceLocation RParenLoc);
ExprResult BuildCXXUuidof(QualType TypeInfoType,
SourceLocation TypeidLoc,
TypeSourceInfo *Operand,
SourceLocation RParenLoc);
ExprResult BuildCXXUuidof(QualType TypeInfoType,
SourceLocation TypeidLoc,
Expr *Operand,
SourceLocation RParenLoc);
/// ActOnCXXUuidof - Parse __uuidof( something ).
ExprResult ActOnCXXUuidof(SourceLocation OpLoc,
SourceLocation LParenLoc, bool isType,
void *TyOrExpr,
SourceLocation RParenLoc);
/// Handle a C++1z fold-expression: ( expr op ... op expr ).
ExprResult ActOnCXXFoldExpr(SourceLocation LParenLoc, Expr *LHS,
tok::TokenKind Operator,
SourceLocation EllipsisLoc, Expr *RHS,
SourceLocation RParenLoc);
ExprResult BuildCXXFoldExpr(SourceLocation LParenLoc, Expr *LHS,
BinaryOperatorKind Operator,
SourceLocation EllipsisLoc, Expr *RHS,
SourceLocation RParenLoc,
Optional<unsigned> NumExpansions);
ExprResult BuildEmptyCXXFoldExpr(SourceLocation EllipsisLoc,
BinaryOperatorKind Operator);
//// ActOnCXXThis - Parse 'this' pointer.
ExprResult ActOnCXXThis(SourceLocation loc);
/// Build a CXXThisExpr and mark it referenced in the current context.
Expr *BuildCXXThisExpr(SourceLocation Loc, QualType Type, bool IsImplicit);
void MarkThisReferenced(CXXThisExpr *This);
/// Try to retrieve the type of the 'this' pointer.
///
/// \returns The type of 'this', if possible. Otherwise, returns a NULL type.
QualType getCurrentThisType();
/// When non-NULL, the C++ 'this' expression is allowed despite the
/// current context not being a non-static member function. In such cases,
/// this provides the type used for 'this'.
QualType CXXThisTypeOverride;
/// RAII object used to temporarily allow the C++ 'this' expression
/// to be used, with the given qualifiers on the current class type.
class CXXThisScopeRAII {
Sema &S;
QualType OldCXXThisTypeOverride;
bool Enabled;
public:
/// Introduce a new scope where 'this' may be allowed (when enabled),
/// using the given declaration (which is either a class template or a
/// class) along with the given qualifiers.
/// along with the qualifiers placed on '*this'.
CXXThisScopeRAII(Sema &S, Decl *ContextDecl, Qualifiers CXXThisTypeQuals,
bool Enabled = true);
~CXXThisScopeRAII();
};
/// Make sure the value of 'this' is actually available in the current
/// context, if it is a potentially evaluated context.
///
/// \param Loc The location at which the capture of 'this' occurs.
///
/// \param Explicit Whether 'this' is explicitly captured in a lambda
/// capture list.
///
/// \param FunctionScopeIndexToStopAt If non-null, it points to the index
/// of the FunctionScopeInfo stack beyond which we do not attempt to capture.
/// This is useful when enclosing lambdas must speculatively capture
/// 'this' that may or may not be used in certain specializations of
/// a nested generic lambda (depending on whether the name resolves to
/// a non-static member function or a static function).
/// \return returns 'true' if failed, 'false' if success.
bool CheckCXXThisCapture(SourceLocation Loc, bool Explicit = false,
bool BuildAndDiagnose = true,
const unsigned *const FunctionScopeIndexToStopAt = nullptr,
bool ByCopy = false);
/// Determine whether the given type is the type of *this that is used
/// outside of the body of a member function for a type that is currently
/// being defined.
bool isThisOutsideMemberFunctionBody(QualType BaseType);
/// ActOnCXXBoolLiteral - Parse {true,false} literals.
ExprResult ActOnCXXBoolLiteral(SourceLocation OpLoc, tok::TokenKind Kind);
/// ActOnObjCBoolLiteral - Parse {__objc_yes,__objc_no} literals.
ExprResult ActOnObjCBoolLiteral(SourceLocation OpLoc, tok::TokenKind Kind);
ExprResult
ActOnObjCAvailabilityCheckExpr(llvm::ArrayRef<AvailabilitySpec> AvailSpecs,
SourceLocation AtLoc, SourceLocation RParen);
/// ActOnCXXNullPtrLiteral - Parse 'nullptr'.
ExprResult ActOnCXXNullPtrLiteral(SourceLocation Loc);
//// ActOnCXXThrow - Parse throw expressions.
ExprResult ActOnCXXThrow(Scope *S, SourceLocation OpLoc, Expr *expr);
ExprResult BuildCXXThrow(SourceLocation OpLoc, Expr *Ex,
bool IsThrownVarInScope);
bool CheckCXXThrowOperand(SourceLocation ThrowLoc, QualType ThrowTy, Expr *E);
/// ActOnCXXTypeConstructExpr - Parse construction of a specified type.
/// Can be interpreted either as function-style casting ("int(x)")
/// or class type construction ("ClassType(x,y,z)")
/// or creation of a value-initialized type ("int()").
ExprResult ActOnCXXTypeConstructExpr(ParsedType TypeRep,
SourceLocation LParenOrBraceLoc,
MultiExprArg Exprs,
SourceLocation RParenOrBraceLoc,
bool ListInitialization);
ExprResult BuildCXXTypeConstructExpr(TypeSourceInfo *Type,
SourceLocation LParenLoc,
MultiExprArg Exprs,
SourceLocation RParenLoc,
bool ListInitialization);
/// ActOnCXXNew - Parsed a C++ 'new' expression.
ExprResult ActOnCXXNew(SourceLocation StartLoc, bool UseGlobal,
SourceLocation PlacementLParen,
MultiExprArg PlacementArgs,
SourceLocation PlacementRParen,
SourceRange TypeIdParens, Declarator &D,
Expr *Initializer);
ExprResult BuildCXXNew(SourceRange Range, bool UseGlobal,
SourceLocation PlacementLParen,
MultiExprArg PlacementArgs,
SourceLocation PlacementRParen,
SourceRange TypeIdParens,
QualType AllocType,
TypeSourceInfo *AllocTypeInfo,
Optional<Expr *> ArraySize,
SourceRange DirectInitRange,
Expr *Initializer);
/// Determine whether \p FD is an aligned allocation or deallocation
/// function that is unavailable.
bool isUnavailableAlignedAllocationFunction(const FunctionDecl &FD) const;
/// Produce diagnostics if \p FD is an aligned allocation or deallocation
/// function that is unavailable.
void diagnoseUnavailableAlignedAllocation(const FunctionDecl &FD,
SourceLocation Loc);
bool CheckAllocatedType(QualType AllocType, SourceLocation Loc,
SourceRange R);
/// The scope in which to find allocation functions.
enum AllocationFunctionScope {
/// Only look for allocation functions in the global scope.
AFS_Global,
/// Only look for allocation functions in the scope of the
/// allocated class.
AFS_Class,
/// Look for allocation functions in both the global scope
/// and in the scope of the allocated class.
AFS_Both
};
/// Finds the overloads of operator new and delete that are appropriate
/// for the allocation.
bool FindAllocationFunctions(SourceLocation StartLoc, SourceRange Range,
AllocationFunctionScope NewScope,
AllocationFunctionScope DeleteScope,
QualType AllocType, bool IsArray,
bool &PassAlignment, MultiExprArg PlaceArgs,
FunctionDecl *&OperatorNew,
FunctionDecl *&OperatorDelete,
bool Diagnose = true);
void DeclareGlobalNewDelete();
void DeclareGlobalAllocationFunction(DeclarationName Name, QualType Return,
ArrayRef<QualType> Params);
bool FindDeallocationFunction(SourceLocation StartLoc, CXXRecordDecl *RD,
DeclarationName Name, FunctionDecl* &Operator,
bool Diagnose = true);
FunctionDecl *FindUsualDeallocationFunction(SourceLocation StartLoc,
bool CanProvideSize,
bool Overaligned,
DeclarationName Name);
FunctionDecl *FindDeallocationFunctionForDestructor(SourceLocation StartLoc,
CXXRecordDecl *RD);
/// ActOnCXXDelete - Parsed a C++ 'delete' expression
ExprResult ActOnCXXDelete(SourceLocation StartLoc,
bool UseGlobal, bool ArrayForm,
Expr *Operand);
void CheckVirtualDtorCall(CXXDestructorDecl *dtor, SourceLocation Loc,
bool IsDelete, bool CallCanBeVirtual,
bool WarnOnNonAbstractTypes,
SourceLocation DtorLoc);
ExprResult ActOnNoexceptExpr(SourceLocation KeyLoc, SourceLocation LParen,
Expr *Operand, SourceLocation RParen);
ExprResult BuildCXXNoexceptExpr(SourceLocation KeyLoc, Expr *Operand,
SourceLocation RParen);
/// Parsed one of the type trait support pseudo-functions.
ExprResult ActOnTypeTrait(TypeTrait Kind, SourceLocation KWLoc,
ArrayRef<ParsedType> Args,
SourceLocation RParenLoc);
ExprResult BuildTypeTrait(TypeTrait Kind, SourceLocation KWLoc,
ArrayRef<TypeSourceInfo *> Args,
SourceLocation RParenLoc);
/// ActOnArrayTypeTrait - Parsed one of the binary type trait support
/// pseudo-functions.
ExprResult ActOnArrayTypeTrait(ArrayTypeTrait ATT,
SourceLocation KWLoc,
ParsedType LhsTy,
Expr *DimExpr,
SourceLocation RParen);
ExprResult BuildArrayTypeTrait(ArrayTypeTrait ATT,
SourceLocation KWLoc,
TypeSourceInfo *TSInfo,
Expr *DimExpr,
SourceLocation RParen);
/// ActOnExpressionTrait - Parsed one of the unary type trait support
/// pseudo-functions.
ExprResult ActOnExpressionTrait(ExpressionTrait OET,
SourceLocation KWLoc,
Expr *Queried,
SourceLocation RParen);
ExprResult BuildExpressionTrait(ExpressionTrait OET,
SourceLocation KWLoc,
Expr *Queried,
SourceLocation RParen);
ExprResult ActOnStartCXXMemberReference(Scope *S,
Expr *Base,
SourceLocation OpLoc,
tok::TokenKind OpKind,
ParsedType &ObjectType,
bool &MayBePseudoDestructor);
ExprResult BuildPseudoDestructorExpr(Expr *Base,
SourceLocation OpLoc,
tok::TokenKind OpKind,
const CXXScopeSpec &SS,
TypeSourceInfo *ScopeType,
SourceLocation CCLoc,
SourceLocation TildeLoc,
PseudoDestructorTypeStorage DestroyedType);
ExprResult ActOnPseudoDestructorExpr(Scope *S, Expr *Base,
SourceLocation OpLoc,
tok::TokenKind OpKind,
CXXScopeSpec &SS,
UnqualifiedId &FirstTypeName,
SourceLocation CCLoc,
SourceLocation TildeLoc,
UnqualifiedId &SecondTypeName);
ExprResult ActOnPseudoDestructorExpr(Scope *S, Expr *Base,
SourceLocation OpLoc,
tok::TokenKind OpKind,
SourceLocation TildeLoc,
const DeclSpec& DS);
/// MaybeCreateExprWithCleanups - If the current full-expression
/// requires any cleanups, surround it with a ExprWithCleanups node.
/// Otherwise, just returns the passed-in expression.
Expr *MaybeCreateExprWithCleanups(Expr *SubExpr);
Stmt *MaybeCreateStmtWithCleanups(Stmt *SubStmt);
ExprResult MaybeCreateExprWithCleanups(ExprResult SubExpr);
MaterializeTemporaryExpr *
CreateMaterializeTemporaryExpr(QualType T, Expr *Temporary,
bool BoundToLvalueReference);
ExprResult ActOnFinishFullExpr(Expr *Expr, bool DiscardedValue) {
return ActOnFinishFullExpr(
Expr, Expr ? Expr->getExprLoc() : SourceLocation(), DiscardedValue);
}
ExprResult ActOnFinishFullExpr(Expr *Expr, SourceLocation CC,
bool DiscardedValue, bool IsConstexpr = false);
StmtResult ActOnFinishFullStmt(Stmt *Stmt);
// Marks SS invalid if it represents an incomplete type.
bool RequireCompleteDeclContext(CXXScopeSpec &SS, DeclContext *DC);
DeclContext *computeDeclContext(QualType T);
DeclContext *computeDeclContext(const CXXScopeSpec &SS,
bool EnteringContext = false);
bool isDependentScopeSpecifier(const CXXScopeSpec &SS);
CXXRecordDecl *getCurrentInstantiationOf(NestedNameSpecifier *NNS);
/// The parser has parsed a global nested-name-specifier '::'.
///
/// \param CCLoc The location of the '::'.
///
/// \param SS The nested-name-specifier, which will be updated in-place
/// to reflect the parsed nested-name-specifier.
///
/// \returns true if an error occurred, false otherwise.
bool ActOnCXXGlobalScopeSpecifier(SourceLocation CCLoc, CXXScopeSpec &SS);
/// The parser has parsed a '__super' nested-name-specifier.
///
/// \param SuperLoc The location of the '__super' keyword.
///
/// \param ColonColonLoc The location of the '::'.
///
/// \param SS The nested-name-specifier, which will be updated in-place
/// to reflect the parsed nested-name-specifier.
///
/// \returns true if an error occurred, false otherwise.
bool ActOnSuperScopeSpecifier(SourceLocation SuperLoc,
SourceLocation ColonColonLoc, CXXScopeSpec &SS);
bool isAcceptableNestedNameSpecifier(const NamedDecl *SD,
bool *CanCorrect = nullptr);
NamedDecl *FindFirstQualifierInScope(Scope *S, NestedNameSpecifier *NNS);
/// Keeps information about an identifier in a nested-name-spec.
///
struct NestedNameSpecInfo {
/// The type of the object, if we're parsing nested-name-specifier in
/// a member access expression.
ParsedType ObjectType;
/// The identifier preceding the '::'.
IdentifierInfo *Identifier;
/// The location of the identifier.
SourceLocation IdentifierLoc;
/// The location of the '::'.
SourceLocation CCLoc;
/// Creates info object for the most typical case.
NestedNameSpecInfo(IdentifierInfo *II, SourceLocation IdLoc,
SourceLocation ColonColonLoc, ParsedType ObjectType = ParsedType())
: ObjectType(ObjectType), Identifier(II), IdentifierLoc(IdLoc),
CCLoc(ColonColonLoc) {
}
NestedNameSpecInfo(IdentifierInfo *II, SourceLocation IdLoc,
SourceLocation ColonColonLoc, QualType ObjectType)
: ObjectType(ParsedType::make(ObjectType)), Identifier(II),
IdentifierLoc(IdLoc), CCLoc(ColonColonLoc) {
}
};
bool isNonTypeNestedNameSpecifier(Scope *S, CXXScopeSpec &SS,
NestedNameSpecInfo &IdInfo);
bool BuildCXXNestedNameSpecifier(Scope *S,
NestedNameSpecInfo &IdInfo,
bool EnteringContext,
CXXScopeSpec &SS,
NamedDecl *ScopeLookupResult,
bool ErrorRecoveryLookup,
bool *IsCorrectedToColon = nullptr,
bool OnlyNamespace = false);
/// The parser has parsed a nested-name-specifier 'identifier::'.
///
/// \param S The scope in which this nested-name-specifier occurs.
///
/// \param IdInfo Parser information about an identifier in the
/// nested-name-spec.
///
/// \param EnteringContext Whether we're entering the context nominated by
/// this nested-name-specifier.
///
/// \param SS The nested-name-specifier, which is both an input
/// parameter (the nested-name-specifier before this type) and an
/// output parameter (containing the full nested-name-specifier,
/// including this new type).
///
/// \param ErrorRecoveryLookup If true, then this method is called to improve
/// error recovery. In this case do not emit error message.
///
/// \param IsCorrectedToColon If not null, suggestions to replace '::' -> ':'
/// are allowed. The bool value pointed by this parameter is set to 'true'
/// if the identifier is treated as if it was followed by ':', not '::'.
///
/// \param OnlyNamespace If true, only considers namespaces in lookup.
///
/// \returns true if an error occurred, false otherwise.
bool ActOnCXXNestedNameSpecifier(Scope *S,
NestedNameSpecInfo &IdInfo,
bool EnteringContext,
CXXScopeSpec &SS,
bool ErrorRecoveryLookup = false,
bool *IsCorrectedToColon = nullptr,
bool OnlyNamespace = false);
ExprResult ActOnDecltypeExpression(Expr *E);
bool ActOnCXXNestedNameSpecifierDecltype(CXXScopeSpec &SS,
const DeclSpec &DS,
SourceLocation ColonColonLoc);
bool IsInvalidUnlessNestedName(Scope *S, CXXScopeSpec &SS,
NestedNameSpecInfo &IdInfo,
bool EnteringContext);
/// The parser has parsed a nested-name-specifier
/// 'template[opt] template-name < template-args >::'.
///
/// \param S The scope in which this nested-name-specifier occurs.
///
/// \param SS The nested-name-specifier, which is both an input
/// parameter (the nested-name-specifier before this type) and an
/// output parameter (containing the full nested-name-specifier,
/// including this new type).
///
/// \param TemplateKWLoc the location of the 'template' keyword, if any.
/// \param TemplateName the template name.
/// \param TemplateNameLoc The location of the template name.
/// \param LAngleLoc The location of the opening angle bracket ('<').
/// \param TemplateArgs The template arguments.
/// \param RAngleLoc The location of the closing angle bracket ('>').
/// \param CCLoc The location of the '::'.
///
/// \param EnteringContext Whether we're entering the context of the
/// nested-name-specifier.
///
///
/// \returns true if an error occurred, false otherwise.
bool ActOnCXXNestedNameSpecifier(Scope *S,
CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
TemplateTy TemplateName,
SourceLocation TemplateNameLoc,
SourceLocation LAngleLoc,
ASTTemplateArgsPtr TemplateArgs,
SourceLocation RAngleLoc,
SourceLocation CCLoc,
bool EnteringContext);
/// Given a C++ nested-name-specifier, produce an annotation value
/// that the parser can use later to reconstruct the given
/// nested-name-specifier.
///
/// \param SS A nested-name-specifier.
///
/// \returns A pointer containing all of the information in the
/// nested-name-specifier \p SS.
void *SaveNestedNameSpecifierAnnotation(CXXScopeSpec &SS);
/// Given an annotation pointer for a nested-name-specifier, restore
/// the nested-name-specifier structure.
///
/// \param Annotation The annotation pointer, produced by
/// \c SaveNestedNameSpecifierAnnotation().
///
/// \param AnnotationRange The source range corresponding to the annotation.
///
/// \param SS The nested-name-specifier that will be updated with the contents
/// of the annotation pointer.
void RestoreNestedNameSpecifierAnnotation(void *Annotation,
SourceRange AnnotationRange,
CXXScopeSpec &SS);
bool ShouldEnterDeclaratorScope(Scope *S, const CXXScopeSpec &SS);
/// ActOnCXXEnterDeclaratorScope - Called when a C++ scope specifier (global
/// scope or nested-name-specifier) is parsed, part of a declarator-id.
/// After this method is called, according to [C++ 3.4.3p3], names should be
/// looked up in the declarator-id's scope, until the declarator is parsed and
/// ActOnCXXExitDeclaratorScope is called.
/// The 'SS' should be a non-empty valid CXXScopeSpec.
bool ActOnCXXEnterDeclaratorScope(Scope *S, CXXScopeSpec &SS);
/// ActOnCXXExitDeclaratorScope - Called when a declarator that previously
/// invoked ActOnCXXEnterDeclaratorScope(), is finished. 'SS' is the same
/// CXXScopeSpec that was passed to ActOnCXXEnterDeclaratorScope as well.
/// Used to indicate that names should revert to being looked up in the
/// defining scope.
void ActOnCXXExitDeclaratorScope(Scope *S, const CXXScopeSpec &SS);
/// ActOnCXXEnterDeclInitializer - Invoked when we are about to parse an
/// initializer for the declaration 'Dcl'.
/// After this method is called, according to [C++ 3.4.1p13], if 'Dcl' is a
/// static data member of class X, names should be looked up in the scope of
/// class X.
void ActOnCXXEnterDeclInitializer(Scope *S, Decl *Dcl);
/// ActOnCXXExitDeclInitializer - Invoked after we are finished parsing an
/// initializer for the declaration 'Dcl'.
void ActOnCXXExitDeclInitializer(Scope *S, Decl *Dcl);
/// Create a new lambda closure type.
CXXRecordDecl *createLambdaClosureType(SourceRange IntroducerRange,
TypeSourceInfo *Info,
bool KnownDependent,
LambdaCaptureDefault CaptureDefault);
/// Start the definition of a lambda expression.
CXXMethodDecl *startLambdaDefinition(CXXRecordDecl *Class,
SourceRange IntroducerRange,
TypeSourceInfo *MethodType,
SourceLocation EndLoc,
ArrayRef<ParmVarDecl *> Params,
ConstexprSpecKind ConstexprKind);
/// Number lambda for linkage purposes if necessary.
void handleLambdaNumbering(
CXXRecordDecl *Class, CXXMethodDecl *Method,
Optional<std::tuple<unsigned, bool, Decl *>> Mangling = None);
/// Endow the lambda scope info with the relevant properties.
void buildLambdaScope(sema::LambdaScopeInfo *LSI,
CXXMethodDecl *CallOperator,
SourceRange IntroducerRange,
LambdaCaptureDefault CaptureDefault,
SourceLocation CaptureDefaultLoc,
bool ExplicitParams,
bool ExplicitResultType,
bool Mutable);
/// Perform initialization analysis of the init-capture and perform
/// any implicit conversions such as an lvalue-to-rvalue conversion if
/// not being used to initialize a reference.
ParsedType actOnLambdaInitCaptureInitialization(
SourceLocation Loc, bool ByRef, SourceLocation EllipsisLoc,
IdentifierInfo *Id, LambdaCaptureInitKind InitKind, Expr *&Init) {
return ParsedType::make(buildLambdaInitCaptureInitialization(
Loc, ByRef, EllipsisLoc, None, Id,
InitKind != LambdaCaptureInitKind::CopyInit, Init));
}
QualType buildLambdaInitCaptureInitialization(
SourceLocation Loc, bool ByRef, SourceLocation EllipsisLoc,
Optional<unsigned> NumExpansions, IdentifierInfo *Id, bool DirectInit,
Expr *&Init);
/// Create a dummy variable within the declcontext of the lambda's
/// call operator, for name lookup purposes for a lambda init capture.
///
/// CodeGen handles emission of lambda captures, ignoring these dummy
/// variables appropriately.
VarDecl *createLambdaInitCaptureVarDecl(SourceLocation Loc,
QualType InitCaptureType,
SourceLocation EllipsisLoc,
IdentifierInfo *Id,
unsigned InitStyle, Expr *Init);
/// Add an init-capture to a lambda scope.
void addInitCapture(sema::LambdaScopeInfo *LSI, VarDecl *Var);
/// Note that we have finished the explicit captures for the
/// given lambda.
void finishLambdaExplicitCaptures(sema::LambdaScopeInfo *LSI);
/// \brief This is called after parsing the explicit template parameter list
/// on a lambda (if it exists) in C++2a.
void ActOnLambdaExplicitTemplateParameterList(SourceLocation LAngleLoc,
ArrayRef<NamedDecl *> TParams,
SourceLocation RAngleLoc);
/// Introduce the lambda parameters into scope.
void addLambdaParameters(
ArrayRef<LambdaIntroducer::LambdaCapture> Captures,
CXXMethodDecl *CallOperator, Scope *CurScope);
/// Deduce a block or lambda's return type based on the return
/// statements present in the body.
void deduceClosureReturnType(sema::CapturingScopeInfo &CSI);
/// ActOnStartOfLambdaDefinition - This is called just before we start
/// parsing the body of a lambda; it analyzes the explicit captures and
/// arguments, and sets up various data-structures for the body of the
/// lambda.
void ActOnStartOfLambdaDefinition(LambdaIntroducer &Intro,
Declarator &ParamInfo, Scope *CurScope);
/// ActOnLambdaError - If there is an error parsing a lambda, this callback
/// is invoked to pop the information about the lambda.
void ActOnLambdaError(SourceLocation StartLoc, Scope *CurScope,
bool IsInstantiation = false);
/// ActOnLambdaExpr - This is called when the body of a lambda expression
/// was successfully completed.
ExprResult ActOnLambdaExpr(SourceLocation StartLoc, Stmt *Body,
Scope *CurScope);
/// Does copying/destroying the captured variable have side effects?
bool CaptureHasSideEffects(const sema::Capture &From);
/// Diagnose if an explicit lambda capture is unused. Returns true if a
/// diagnostic is emitted.
bool DiagnoseUnusedLambdaCapture(SourceRange CaptureRange,
const sema::Capture &From);
/// Build a FieldDecl suitable to hold the given capture.
FieldDecl *BuildCaptureField(RecordDecl *RD, const sema::Capture &Capture);
/// Initialize the given capture with a suitable expression.
ExprResult BuildCaptureInit(const sema::Capture &Capture,
SourceLocation ImplicitCaptureLoc,
bool IsOpenMPMapping = false);
/// Complete a lambda-expression having processed and attached the
/// lambda body.
ExprResult BuildLambdaExpr(SourceLocation StartLoc, SourceLocation EndLoc,
sema::LambdaScopeInfo *LSI);
/// Get the return type to use for a lambda's conversion function(s) to
/// function pointer type, given the type of the call operator.
QualType
getLambdaConversionFunctionResultType(const FunctionProtoType *CallOpType);
/// Define the "body" of the conversion from a lambda object to a
/// function pointer.
///
/// This routine doesn't actually define a sensible body; rather, it fills
/// in the initialization expression needed to copy the lambda object into
/// the block, and IR generation actually generates the real body of the
/// block pointer conversion.
void DefineImplicitLambdaToFunctionPointerConversion(
SourceLocation CurrentLoc, CXXConversionDecl *Conv);
/// Define the "body" of the conversion from a lambda object to a
/// block pointer.
///
/// This routine doesn't actually define a sensible body; rather, it fills
/// in the initialization expression needed to copy the lambda object into
/// the block, and IR generation actually generates the real body of the
/// block pointer conversion.
void DefineImplicitLambdaToBlockPointerConversion(SourceLocation CurrentLoc,
CXXConversionDecl *Conv);
ExprResult BuildBlockForLambdaConversion(SourceLocation CurrentLocation,
SourceLocation ConvLocation,
CXXConversionDecl *Conv,
Expr *Src);
/// Check whether the given expression is a valid constraint expression.
/// A diagnostic is emitted if it is not, and false is returned.
bool CheckConstraintExpression(Expr *CE);
bool CalculateConstraintSatisfaction(ConceptDecl *NamedConcept,
MultiLevelTemplateArgumentList &MLTAL,
Expr *ConstraintExpr,
bool &IsSatisfied);
/// Check that the associated constraints of a template declaration match the
/// associated constraints of an older declaration of which it is a
/// redeclaration.
bool CheckRedeclarationConstraintMatch(TemplateParameterList *Old,
TemplateParameterList *New);
// ParseObjCStringLiteral - Parse Objective-C string literals.
ExprResult ParseObjCStringLiteral(SourceLocation *AtLocs,
ArrayRef<Expr *> Strings);
ExprResult BuildObjCStringLiteral(SourceLocation AtLoc, StringLiteral *S);
/// BuildObjCNumericLiteral - builds an ObjCBoxedExpr AST node for the
/// numeric literal expression. Type of the expression will be "NSNumber *"
/// or "id" if NSNumber is unavailable.
ExprResult BuildObjCNumericLiteral(SourceLocation AtLoc, Expr *Number);
ExprResult ActOnObjCBoolLiteral(SourceLocation AtLoc, SourceLocation ValueLoc,
bool Value);
ExprResult BuildObjCArrayLiteral(SourceRange SR, MultiExprArg Elements);
/// BuildObjCBoxedExpr - builds an ObjCBoxedExpr AST node for the
/// '@' prefixed parenthesized expression. The type of the expression will
/// either be "NSNumber *", "NSString *" or "NSValue *" depending on the type
/// of ValueType, which is allowed to be a built-in numeric type, "char *",
/// "const char *" or C structure with attribute 'objc_boxable'.
ExprResult BuildObjCBoxedExpr(SourceRange SR, Expr *ValueExpr);
ExprResult BuildObjCSubscriptExpression(SourceLocation RB, Expr *BaseExpr,
Expr *IndexExpr,
ObjCMethodDecl *getterMethod,
ObjCMethodDecl *setterMethod);
ExprResult BuildObjCDictionaryLiteral(SourceRange SR,
MutableArrayRef<ObjCDictionaryElement> Elements);
ExprResult BuildObjCEncodeExpression(SourceLocation AtLoc,
TypeSourceInfo *EncodedTypeInfo,
SourceLocation RParenLoc);
ExprResult BuildCXXMemberCallExpr(Expr *Exp, NamedDecl *FoundDecl,
CXXConversionDecl *Method,
bool HadMultipleCandidates);
ExprResult ParseObjCEncodeExpression(SourceLocation AtLoc,
SourceLocation EncodeLoc,
SourceLocation LParenLoc,
ParsedType Ty,
SourceLocation RParenLoc);
/// ParseObjCSelectorExpression - Build selector expression for \@selector
ExprResult ParseObjCSelectorExpression(Selector Sel,
SourceLocation AtLoc,
SourceLocation SelLoc,
SourceLocation LParenLoc,
SourceLocation RParenLoc,
bool WarnMultipleSelectors);
/// ParseObjCProtocolExpression - Build protocol expression for \@protocol
ExprResult ParseObjCProtocolExpression(IdentifierInfo * ProtocolName,
SourceLocation AtLoc,
SourceLocation ProtoLoc,
SourceLocation LParenLoc,
SourceLocation ProtoIdLoc,
SourceLocation RParenLoc);
//===--------------------------------------------------------------------===//
// C++ Declarations
//
Decl *ActOnStartLinkageSpecification(Scope *S,
SourceLocation ExternLoc,
Expr *LangStr,
SourceLocation LBraceLoc);
Decl *ActOnFinishLinkageSpecification(Scope *S,
Decl *LinkageSpec,
SourceLocation RBraceLoc);
//===--------------------------------------------------------------------===//
// C++ Classes
//
CXXRecordDecl *getCurrentClass(Scope *S, const CXXScopeSpec *SS);
bool isCurrentClassName(const IdentifierInfo &II, Scope *S,
const CXXScopeSpec *SS = nullptr);
bool isCurrentClassNameTypo(IdentifierInfo *&II, const CXXScopeSpec *SS);
bool ActOnAccessSpecifier(AccessSpecifier Access, SourceLocation ASLoc,
SourceLocation ColonLoc,
const ParsedAttributesView &Attrs);
NamedDecl *ActOnCXXMemberDeclarator(Scope *S, AccessSpecifier AS,
Declarator &D,
MultiTemplateParamsArg TemplateParameterLists,
Expr *BitfieldWidth, const VirtSpecifiers &VS,
InClassInitStyle InitStyle);
void ActOnStartCXXInClassMemberInitializer();
void ActOnFinishCXXInClassMemberInitializer(Decl *VarDecl,
SourceLocation EqualLoc,
Expr *Init);
MemInitResult ActOnMemInitializer(Decl *ConstructorD,
Scope *S,
CXXScopeSpec &SS,
IdentifierInfo *MemberOrBase,
ParsedType TemplateTypeTy,
const DeclSpec &DS,
SourceLocation IdLoc,
SourceLocation LParenLoc,
ArrayRef<Expr *> Args,
SourceLocation RParenLoc,
SourceLocation EllipsisLoc);
MemInitResult ActOnMemInitializer(Decl *ConstructorD,
Scope *S,
CXXScopeSpec &SS,
IdentifierInfo *MemberOrBase,
ParsedType TemplateTypeTy,
const DeclSpec &DS,
SourceLocation IdLoc,
Expr *InitList,
SourceLocation EllipsisLoc);
MemInitResult BuildMemInitializer(Decl *ConstructorD,
Scope *S,
CXXScopeSpec &SS,
IdentifierInfo *MemberOrBase,
ParsedType TemplateTypeTy,
const DeclSpec &DS,
SourceLocation IdLoc,
Expr *Init,
SourceLocation EllipsisLoc);
MemInitResult BuildMemberInitializer(ValueDecl *Member,
Expr *Init,
SourceLocation IdLoc);
MemInitResult BuildBaseInitializer(QualType BaseType,
TypeSourceInfo *BaseTInfo,
Expr *Init,
CXXRecordDecl *ClassDecl,
SourceLocation EllipsisLoc);
MemInitResult BuildDelegatingInitializer(TypeSourceInfo *TInfo,
Expr *Init,
CXXRecordDecl *ClassDecl);
bool SetDelegatingInitializer(CXXConstructorDecl *Constructor,
CXXCtorInitializer *Initializer);
bool SetCtorInitializers(CXXConstructorDecl *Constructor, bool AnyErrors,
ArrayRef<CXXCtorInitializer *> Initializers = None);
void SetIvarInitializers(ObjCImplementationDecl *ObjCImplementation);
/// MarkBaseAndMemberDestructorsReferenced - Given a record decl,
/// mark all the non-trivial destructors of its members and bases as
/// referenced.
void MarkBaseAndMemberDestructorsReferenced(SourceLocation Loc,
CXXRecordDecl *Record);
/// The list of classes whose vtables have been used within
/// this translation unit, and the source locations at which the
/// first use occurred.
typedef std::pair<CXXRecordDecl*, SourceLocation> VTableUse;
/// The list of vtables that are required but have not yet been
/// materialized.
SmallVector<VTableUse, 16> VTableUses;
/// The set of classes whose vtables have been used within
/// this translation unit, and a bit that will be true if the vtable is
/// required to be emitted (otherwise, it should be emitted only if needed
/// by code generation).
llvm::DenseMap<CXXRecordDecl *, bool> VTablesUsed;
/// Load any externally-stored vtable uses.
void LoadExternalVTableUses();
/// Note that the vtable for the given class was used at the
/// given location.
void MarkVTableUsed(SourceLocation Loc, CXXRecordDecl *Class,
bool DefinitionRequired = false);
/// Mark the exception specifications of all virtual member functions
/// in the given class as needed.
void MarkVirtualMemberExceptionSpecsNeeded(SourceLocation Loc,
const CXXRecordDecl *RD);
/// MarkVirtualMembersReferenced - Will mark all members of the given
/// CXXRecordDecl referenced.
void MarkVirtualMembersReferenced(SourceLocation Loc, const CXXRecordDecl *RD,
bool ConstexprOnly = false);
/// Define all of the vtables that have been used in this
/// translation unit and reference any virtual members used by those
/// vtables.
///
/// \returns true if any work was done, false otherwise.
bool DefineUsedVTables();
void AddImplicitlyDeclaredMembersToClass(CXXRecordDecl *ClassDecl);
void ActOnMemInitializers(Decl *ConstructorDecl,
SourceLocation ColonLoc,
ArrayRef<CXXCtorInitializer*> MemInits,
bool AnyErrors);
/// Check class-level dllimport/dllexport attribute. The caller must
/// ensure that referenceDLLExportedClassMethods is called some point later
/// when all outer classes of Class are complete.
void checkClassLevelDLLAttribute(CXXRecordDecl *Class);
void checkClassLevelCodeSegAttribute(CXXRecordDecl *Class);
void referenceDLLExportedClassMethods();
void propagateDLLAttrToBaseClassTemplate(
CXXRecordDecl *Class, Attr *ClassAttr,
ClassTemplateSpecializationDecl *BaseTemplateSpec,
SourceLocation BaseLoc);
/// Add gsl::Pointer attribute to std::container::iterator
/// \param ND The declaration that introduces the name
/// std::container::iterator. \param UnderlyingRecord The record named by ND.
void inferGslPointerAttribute(NamedDecl *ND, CXXRecordDecl *UnderlyingRecord);
/// Add [[gsl::Owner]] and [[gsl::Pointer]] attributes for std:: types.
void inferGslOwnerPointerAttribute(CXXRecordDecl *Record);
/// Add [[gsl::Pointer]] attributes for std:: types.
void inferGslPointerAttribute(TypedefNameDecl *TD);
void CheckCompletedCXXClass(CXXRecordDecl *Record);
/// Check that the C++ class annoated with "trivial_abi" satisfies all the
/// conditions that are needed for the attribute to have an effect.
void checkIllFormedTrivialABIStruct(CXXRecordDecl &RD);
void ActOnFinishCXXMemberSpecification(Scope *S, SourceLocation RLoc,
Decl *TagDecl, SourceLocation LBrac,
SourceLocation RBrac,
const ParsedAttributesView &AttrList);
void ActOnFinishCXXMemberDecls();
void ActOnFinishCXXNonNestedClass(Decl *D);
void ActOnReenterCXXMethodParameter(Scope *S, ParmVarDecl *Param);
unsigned ActOnReenterTemplateScope(Scope *S, Decl *Template);
void ActOnStartDelayedMemberDeclarations(Scope *S, Decl *Record);
void ActOnStartDelayedCXXMethodDeclaration(Scope *S, Decl *Method);
void ActOnDelayedCXXMethodParameter(Scope *S, Decl *Param);
void ActOnFinishDelayedMemberDeclarations(Scope *S, Decl *Record);
void ActOnFinishDelayedCXXMethodDeclaration(Scope *S, Decl *Method);
void ActOnFinishDelayedMemberInitializers(Decl *Record);
void MarkAsLateParsedTemplate(FunctionDecl *FD, Decl *FnD,
CachedTokens &Toks);
void UnmarkAsLateParsedTemplate(FunctionDecl *FD);
bool IsInsideALocalClassWithinATemplateFunction();
Decl *ActOnStaticAssertDeclaration(SourceLocation StaticAssertLoc,
Expr *AssertExpr,
Expr *AssertMessageExpr,
SourceLocation RParenLoc);
Decl *BuildStaticAssertDeclaration(SourceLocation StaticAssertLoc,
Expr *AssertExpr,
StringLiteral *AssertMessageExpr,
SourceLocation RParenLoc,
bool Failed);
FriendDecl *CheckFriendTypeDecl(SourceLocation LocStart,
SourceLocation FriendLoc,
TypeSourceInfo *TSInfo);
Decl *ActOnFriendTypeDecl(Scope *S, const DeclSpec &DS,
MultiTemplateParamsArg TemplateParams);
NamedDecl *ActOnFriendFunctionDecl(Scope *S, Declarator &D,
MultiTemplateParamsArg TemplateParams);
QualType CheckConstructorDeclarator(Declarator &D, QualType R,
StorageClass& SC);
void CheckConstructor(CXXConstructorDecl *Constructor);
QualType CheckDestructorDeclarator(Declarator &D, QualType R,
StorageClass& SC);
bool CheckDestructor(CXXDestructorDecl *Destructor);
void CheckConversionDeclarator(Declarator &D, QualType &R,
StorageClass& SC);
Decl *ActOnConversionDeclarator(CXXConversionDecl *Conversion);
void CheckDeductionGuideDeclarator(Declarator &D, QualType &R,
StorageClass &SC);
void CheckDeductionGuideTemplate(FunctionTemplateDecl *TD);
void CheckExplicitlyDefaultedFunction(FunctionDecl *MD);
bool CheckExplicitlyDefaultedSpecialMember(CXXMethodDecl *MD,
CXXSpecialMember CSM);
void CheckDelayedMemberExceptionSpecs();
bool CheckExplicitlyDefaultedComparison(FunctionDecl *MD,
DefaultedComparisonKind DCK);
//===--------------------------------------------------------------------===//
// C++ Derived Classes
//
/// ActOnBaseSpecifier - Parsed a base specifier
CXXBaseSpecifier *CheckBaseSpecifier(CXXRecordDecl *Class,
SourceRange SpecifierRange,
bool Virtual, AccessSpecifier Access,
TypeSourceInfo *TInfo,
SourceLocation EllipsisLoc);
BaseResult ActOnBaseSpecifier(Decl *classdecl,
SourceRange SpecifierRange,
ParsedAttributes &Attrs,
bool Virtual, AccessSpecifier Access,
ParsedType basetype,
SourceLocation BaseLoc,
SourceLocation EllipsisLoc);
bool AttachBaseSpecifiers(CXXRecordDecl *Class,
MutableArrayRef<CXXBaseSpecifier *> Bases);
void ActOnBaseSpecifiers(Decl *ClassDecl,
MutableArrayRef<CXXBaseSpecifier *> Bases);
bool IsDerivedFrom(SourceLocation Loc, QualType Derived, QualType Base);
bool IsDerivedFrom(SourceLocation Loc, QualType Derived, QualType Base,
CXXBasePaths &Paths);
// FIXME: I don't like this name.
void BuildBasePathArray(const CXXBasePaths &Paths, CXXCastPath &BasePath);
bool CheckDerivedToBaseConversion(QualType Derived, QualType Base,
SourceLocation Loc, SourceRange Range,
CXXCastPath *BasePath = nullptr,
bool IgnoreAccess = false);
bool CheckDerivedToBaseConversion(QualType Derived, QualType Base,
unsigned InaccessibleBaseID,
unsigned AmbigiousBaseConvID,
SourceLocation Loc, SourceRange Range,
DeclarationName Name,
CXXCastPath *BasePath,
bool IgnoreAccess = false);
std::string getAmbiguousPathsDisplayString(CXXBasePaths &Paths);
bool CheckOverridingFunctionAttributes(const CXXMethodDecl *New,
const CXXMethodDecl *Old);
/// CheckOverridingFunctionReturnType - Checks whether the return types are
/// covariant, according to C++ [class.virtual]p5.
bool CheckOverridingFunctionReturnType(const CXXMethodDecl *New,
const CXXMethodDecl *Old);
/// CheckOverridingFunctionExceptionSpec - Checks whether the exception
/// spec is a subset of base spec.
bool CheckOverridingFunctionExceptionSpec(const CXXMethodDecl *New,
const CXXMethodDecl *Old);
bool CheckPureMethod(CXXMethodDecl *Method, SourceRange InitRange);
/// CheckOverrideControl - Check C++11 override control semantics.
void CheckOverrideControl(NamedDecl *D);
/// DiagnoseAbsenceOfOverrideControl - Diagnose if 'override' keyword was
/// not used in the declaration of an overriding method.
void DiagnoseAbsenceOfOverrideControl(NamedDecl *D);
/// CheckForFunctionMarkedFinal - Checks whether a virtual member function
/// overrides a virtual member function marked 'final', according to
/// C++11 [class.virtual]p4.
bool CheckIfOverriddenFunctionIsMarkedFinal(const CXXMethodDecl *New,
const CXXMethodDecl *Old);
//===--------------------------------------------------------------------===//
// C++ Access Control
//
enum AccessResult {
AR_accessible,
AR_inaccessible,
AR_dependent,
AR_delayed
};
bool SetMemberAccessSpecifier(NamedDecl *MemberDecl,
NamedDecl *PrevMemberDecl,
AccessSpecifier LexicalAS);
AccessResult CheckUnresolvedMemberAccess(UnresolvedMemberExpr *E,
DeclAccessPair FoundDecl);
AccessResult CheckUnresolvedLookupAccess(UnresolvedLookupExpr *E,
DeclAccessPair FoundDecl);
AccessResult CheckAllocationAccess(SourceLocation OperatorLoc,
SourceRange PlacementRange,
CXXRecordDecl *NamingClass,
DeclAccessPair FoundDecl,
bool Diagnose = true);
AccessResult CheckConstructorAccess(SourceLocation Loc,
CXXConstructorDecl *D,
DeclAccessPair FoundDecl,
const InitializedEntity &Entity,
bool IsCopyBindingRefToTemp = false);
AccessResult CheckConstructorAccess(SourceLocation Loc,
CXXConstructorDecl *D,
DeclAccessPair FoundDecl,
const InitializedEntity &Entity,
const PartialDiagnostic &PDiag);
AccessResult CheckDestructorAccess(SourceLocation Loc,
CXXDestructorDecl *Dtor,
const PartialDiagnostic &PDiag,
QualType objectType = QualType());
AccessResult CheckFriendAccess(NamedDecl *D);
AccessResult CheckMemberAccess(SourceLocation UseLoc,
CXXRecordDecl *NamingClass,
DeclAccessPair Found);
AccessResult
CheckStructuredBindingMemberAccess(SourceLocation UseLoc,
CXXRecordDecl *DecomposedClass,
DeclAccessPair Field);
AccessResult CheckMemberOperatorAccess(SourceLocation Loc,
Expr *ObjectExpr,
Expr *ArgExpr,
DeclAccessPair FoundDecl);
AccessResult CheckAddressOfMemberAccess(Expr *OvlExpr,
DeclAccessPair FoundDecl);
AccessResult CheckBaseClassAccess(SourceLocation AccessLoc,
QualType Base, QualType Derived,
const CXXBasePath &Path,
unsigned DiagID,
bool ForceCheck = false,
bool ForceUnprivileged = false);
void CheckLookupAccess(const LookupResult &R);
bool IsSimplyAccessible(NamedDecl *Decl, CXXRecordDecl *NamingClass,
QualType BaseType);
bool isSpecialMemberAccessibleForDeletion(CXXMethodDecl *decl,
AccessSpecifier access,
QualType objectType);
void HandleDependentAccessCheck(const DependentDiagnostic &DD,
const MultiLevelTemplateArgumentList &TemplateArgs);
void PerformDependentDiagnostics(const DeclContext *Pattern,
const MultiLevelTemplateArgumentList &TemplateArgs);
void HandleDelayedAccessCheck(sema::DelayedDiagnostic &DD, Decl *Ctx);
/// When true, access checking violations are treated as SFINAE
/// failures rather than hard errors.
bool AccessCheckingSFINAE;
enum AbstractDiagSelID {
AbstractNone = -1,
AbstractReturnType,
AbstractParamType,
AbstractVariableType,
AbstractFieldType,
AbstractIvarType,
AbstractSynthesizedIvarType,
AbstractArrayType
};
bool isAbstractType(SourceLocation Loc, QualType T);
bool RequireNonAbstractType(SourceLocation Loc, QualType T,
TypeDiagnoser &Diagnoser);
template <typename... Ts>
bool RequireNonAbstractType(SourceLocation Loc, QualType T, unsigned DiagID,
const Ts &...Args) {
BoundTypeDiagnoser<Ts...> Diagnoser(DiagID, Args...);
return RequireNonAbstractType(Loc, T, Diagnoser);
}
void DiagnoseAbstractType(const CXXRecordDecl *RD);
//===--------------------------------------------------------------------===//
// C++ Overloaded Operators [C++ 13.5]
//
bool CheckOverloadedOperatorDeclaration(FunctionDecl *FnDecl);
bool CheckLiteralOperatorDeclaration(FunctionDecl *FnDecl);
//===--------------------------------------------------------------------===//
// C++ Templates [C++ 14]
//
void FilterAcceptableTemplateNames(LookupResult &R,
bool AllowFunctionTemplates = true,
bool AllowDependent = true);
bool hasAnyAcceptableTemplateNames(LookupResult &R,
bool AllowFunctionTemplates = true,
bool AllowDependent = true,
bool AllowNonTemplateFunctions = false);
/// Try to interpret the lookup result D as a template-name.
///
/// \param D A declaration found by name lookup.
/// \param AllowFunctionTemplates Whether function templates should be
/// considered valid results.
/// \param AllowDependent Whether unresolved using declarations (that might
/// name templates) should be considered valid results.
NamedDecl *getAsTemplateNameDecl(NamedDecl *D,
bool AllowFunctionTemplates = true,
bool AllowDependent = true);
enum class AssumedTemplateKind {
/// This is not assumed to be a template name.
None,
/// This is assumed to be a template name because lookup found nothing.
FoundNothing,
/// This is assumed to be a template name because lookup found one or more
/// functions (but no function templates).
FoundFunctions,
};
bool LookupTemplateName(LookupResult &R, Scope *S, CXXScopeSpec &SS,
QualType ObjectType, bool EnteringContext,
bool &MemberOfUnknownSpecialization,
SourceLocation TemplateKWLoc = SourceLocation(),
AssumedTemplateKind *ATK = nullptr);
TemplateNameKind isTemplateName(Scope *S,
CXXScopeSpec &SS,
bool hasTemplateKeyword,
const UnqualifiedId &Name,
ParsedType ObjectType,
bool EnteringContext,
TemplateTy &Template,
bool &MemberOfUnknownSpecialization);
/// Try to resolve an undeclared template name as a type template.
///
/// Sets II to the identifier corresponding to the template name, and updates
/// Name to a corresponding (typo-corrected) type template name and TNK to
/// the corresponding kind, if possible.
void ActOnUndeclaredTypeTemplateName(Scope *S, TemplateTy &Name,
TemplateNameKind &TNK,
SourceLocation NameLoc,
IdentifierInfo *&II);
bool resolveAssumedTemplateNameAsType(Scope *S, TemplateName &Name,
SourceLocation NameLoc,
bool Diagnose = true);
/// Determine whether a particular identifier might be the name in a C++1z
/// deduction-guide declaration.
bool isDeductionGuideName(Scope *S, const IdentifierInfo &Name,
SourceLocation NameLoc,
ParsedTemplateTy *Template = nullptr);
bool DiagnoseUnknownTemplateName(const IdentifierInfo &II,
SourceLocation IILoc,
Scope *S,
const CXXScopeSpec *SS,
TemplateTy &SuggestedTemplate,
TemplateNameKind &SuggestedKind);
bool DiagnoseUninstantiableTemplate(SourceLocation PointOfInstantiation,
NamedDecl *Instantiation,
bool InstantiatedFromMember,
const NamedDecl *Pattern,
const NamedDecl *PatternDef,
TemplateSpecializationKind TSK,
bool Complain = true);
void DiagnoseTemplateParameterShadow(SourceLocation Loc, Decl *PrevDecl);
TemplateDecl *AdjustDeclIfTemplate(Decl *&Decl);
NamedDecl *ActOnTypeParameter(Scope *S, bool Typename,
SourceLocation EllipsisLoc,
SourceLocation KeyLoc,
IdentifierInfo *ParamName,
SourceLocation ParamNameLoc,
unsigned Depth, unsigned Position,
SourceLocation EqualLoc,
ParsedType DefaultArg);
QualType CheckNonTypeTemplateParameterType(TypeSourceInfo *&TSI,
SourceLocation Loc);
QualType CheckNonTypeTemplateParameterType(QualType T, SourceLocation Loc);
NamedDecl *ActOnNonTypeTemplateParameter(Scope *S, Declarator &D,
unsigned Depth,
unsigned Position,
SourceLocation EqualLoc,
Expr *DefaultArg);
NamedDecl *ActOnTemplateTemplateParameter(Scope *S,
SourceLocation TmpLoc,
TemplateParameterList *Params,
SourceLocation EllipsisLoc,
IdentifierInfo *ParamName,
SourceLocation ParamNameLoc,
unsigned Depth,
unsigned Position,
SourceLocation EqualLoc,
ParsedTemplateArgument DefaultArg);
TemplateParameterList *
ActOnTemplateParameterList(unsigned Depth,
SourceLocation ExportLoc,
SourceLocation TemplateLoc,
SourceLocation LAngleLoc,
ArrayRef<NamedDecl *> Params,
SourceLocation RAngleLoc,
Expr *RequiresClause);
/// The context in which we are checking a template parameter list.
enum TemplateParamListContext {
TPC_ClassTemplate,
TPC_VarTemplate,
TPC_FunctionTemplate,
TPC_ClassTemplateMember,
TPC_FriendClassTemplate,
TPC_FriendFunctionTemplate,
TPC_FriendFunctionTemplateDefinition,
TPC_TypeAliasTemplate
};
bool CheckTemplateParameterList(TemplateParameterList *NewParams,
TemplateParameterList *OldParams,
TemplateParamListContext TPC,
SkipBodyInfo *SkipBody = nullptr);
TemplateParameterList *MatchTemplateParametersToScopeSpecifier(
SourceLocation DeclStartLoc, SourceLocation DeclLoc,
const CXXScopeSpec &SS, TemplateIdAnnotation *TemplateId,
ArrayRef<TemplateParameterList *> ParamLists,
bool IsFriend, bool &IsMemberSpecialization, bool &Invalid);
DeclResult CheckClassTemplate(
Scope *S, unsigned TagSpec, TagUseKind TUK, SourceLocation KWLoc,
CXXScopeSpec &SS, IdentifierInfo *Name, SourceLocation NameLoc,
const ParsedAttributesView &Attr, TemplateParameterList *TemplateParams,
AccessSpecifier AS, SourceLocation ModulePrivateLoc,
SourceLocation FriendLoc, unsigned NumOuterTemplateParamLists,
TemplateParameterList **OuterTemplateParamLists,
SkipBodyInfo *SkipBody = nullptr);
TemplateArgumentLoc getTrivialTemplateArgumentLoc(const TemplateArgument &Arg,
QualType NTTPType,
SourceLocation Loc);
void translateTemplateArguments(const ASTTemplateArgsPtr &In,
TemplateArgumentListInfo &Out);
ParsedTemplateArgument ActOnTemplateTypeArgument(TypeResult ParsedType);
void NoteAllFoundTemplates(TemplateName Name);
QualType CheckTemplateIdType(TemplateName Template,
SourceLocation TemplateLoc,
TemplateArgumentListInfo &TemplateArgs);
TypeResult
ActOnTemplateIdType(Scope *S, CXXScopeSpec &SS, SourceLocation TemplateKWLoc,
TemplateTy Template, IdentifierInfo *TemplateII,
SourceLocation TemplateIILoc, SourceLocation LAngleLoc,
ASTTemplateArgsPtr TemplateArgs, SourceLocation RAngleLoc,
bool IsCtorOrDtorName = false, bool IsClassName = false);
/// Parsed an elaborated-type-specifier that refers to a template-id,
/// such as \c class T::template apply<U>.
TypeResult ActOnTagTemplateIdType(TagUseKind TUK,
TypeSpecifierType TagSpec,
SourceLocation TagLoc,
CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
TemplateTy TemplateD,
SourceLocation TemplateLoc,
SourceLocation LAngleLoc,
ASTTemplateArgsPtr TemplateArgsIn,
SourceLocation RAngleLoc);
DeclResult ActOnVarTemplateSpecialization(
Scope *S, Declarator &D, TypeSourceInfo *DI,
SourceLocation TemplateKWLoc, TemplateParameterList *TemplateParams,
StorageClass SC, bool IsPartialSpecialization);
DeclResult CheckVarTemplateId(VarTemplateDecl *Template,
SourceLocation TemplateLoc,
SourceLocation TemplateNameLoc,
const TemplateArgumentListInfo &TemplateArgs);
ExprResult CheckVarTemplateId(const CXXScopeSpec &SS,
const DeclarationNameInfo &NameInfo,
VarTemplateDecl *Template,
SourceLocation TemplateLoc,
const TemplateArgumentListInfo *TemplateArgs);
ExprResult
CheckConceptTemplateId(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
SourceLocation ConceptNameLoc, NamedDecl *FoundDecl,
ConceptDecl *NamedConcept,
const TemplateArgumentListInfo *TemplateArgs);
void diagnoseMissingTemplateArguments(TemplateName Name, SourceLocation Loc);
ExprResult BuildTemplateIdExpr(const CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
LookupResult &R,
bool RequiresADL,
const TemplateArgumentListInfo *TemplateArgs);
ExprResult BuildQualifiedTemplateIdExpr(CXXScopeSpec &SS,
SourceLocation TemplateKWLoc,
const DeclarationNameInfo &NameInfo,
const TemplateArgumentListInfo *TemplateArgs);
TemplateNameKind ActOnDependentTemplateName(
Scope *S, CXXScopeSpec &SS, SourceLocation TemplateKWLoc,
const UnqualifiedId &Name, ParsedType ObjectType, bool EnteringContext,
TemplateTy &Template, bool AllowInjectedClassName = false);
DeclResult ActOnClassTemplateSpecialization(
Scope *S, unsigned TagSpec, TagUseKind TUK, SourceLocation KWLoc,
SourceLocation ModulePrivateLoc, TemplateIdAnnotation &TemplateId,
const ParsedAttributesView &Attr,
MultiTemplateParamsArg TemplateParameterLists,
SkipBodyInfo *SkipBody = nullptr);
bool CheckTemplatePartialSpecializationArgs(SourceLocation Loc,
TemplateDecl *PrimaryTemplate,
unsigned NumExplicitArgs,
ArrayRef<TemplateArgument> Args);
void CheckTemplatePartialSpecialization(
ClassTemplatePartialSpecializationDecl *Partial);
void CheckTemplatePartialSpecialization(
VarTemplatePartialSpecializationDecl *Partial);
Decl *ActOnTemplateDeclarator(Scope *S,
MultiTemplateParamsArg TemplateParameterLists,
Declarator &D);
bool
CheckSpecializationInstantiationRedecl(SourceLocation NewLoc,
TemplateSpecializationKind NewTSK,
NamedDecl *PrevDecl,
TemplateSpecializationKind PrevTSK,
SourceLocation PrevPtOfInstantiation,
bool &SuppressNew);
bool CheckDependentFunctionTemplateSpecialization(FunctionDecl *FD,
const TemplateArgumentListInfo &ExplicitTemplateArgs,
LookupResult &Previous);
bool CheckFunctionTemplateSpecialization(
FunctionDecl *FD, TemplateArgumentListInfo *ExplicitTemplateArgs,
LookupResult &Previous, bool QualifiedFriend = false);
bool CheckMemberSpecialization(NamedDecl *Member, LookupResult &Previous);
void CompleteMemberSpecialization(NamedDecl *Member, LookupResult &Previous);
DeclResult ActOnExplicitInstantiation(
Scope *S, SourceLocation ExternLoc, SourceLocation TemplateLoc,
unsigned TagSpec, SourceLocation KWLoc, const CXXScopeSpec &SS,
TemplateTy Template, SourceLocation TemplateNameLoc,
SourceLocation LAngleLoc, ASTTemplateArgsPtr TemplateArgs,
SourceLocation RAngleLoc, const ParsedAttributesView &Attr);
DeclResult ActOnExplicitInstantiation(Scope *S, SourceLocation ExternLoc,
SourceLocation TemplateLoc,
unsigned TagSpec, SourceLocation KWLoc,
CXXScopeSpec &SS, IdentifierInfo *Name,
SourceLocation NameLoc,
const ParsedAttributesView &Attr);
DeclResult ActOnExplicitInstantiation(Scope *S,
SourceLocation ExternLoc,
SourceLocation TemplateLoc,
Declarator &D);
TemplateArgumentLoc
SubstDefaultTemplateArgumentIfAvailable(TemplateDecl *Template,
SourceLocation TemplateLoc,
SourceLocation RAngleLoc,
Decl *Param,
SmallVectorImpl<TemplateArgument>
&Converted,
bool &HasDefaultArg);
/// Specifies the context in which a particular template
/// argument is being checked.
enum CheckTemplateArgumentKind {
/// The template argument was specified in the code or was
/// instantiated with some deduced template arguments.
CTAK_Specified,
/// The template argument was deduced via template argument
/// deduction.
CTAK_Deduced,
/// The template argument was deduced from an array bound
/// via template argument deduction.
CTAK_DeducedFromArrayBound
};
bool CheckTemplateArgument(NamedDecl *Param,
TemplateArgumentLoc &Arg,
NamedDecl *Template,
SourceLocation TemplateLoc,
SourceLocation RAngleLoc,
unsigned ArgumentPackIndex,
SmallVectorImpl<TemplateArgument> &Converted,
CheckTemplateArgumentKind CTAK = CTAK_Specified);
/// Check that the given template arguments can be be provided to
/// the given template, converting the arguments along the way.
///
/// \param Template The template to which the template arguments are being
/// provided.
///
/// \param TemplateLoc The location of the template name in the source.
///
/// \param TemplateArgs The list of template arguments. If the template is
/// a template template parameter, this function may extend the set of
/// template arguments to also include substituted, defaulted template
/// arguments.
///
/// \param PartialTemplateArgs True if the list of template arguments is
/// intentionally partial, e.g., because we're checking just the initial
/// set of template arguments.
///
/// \param Converted Will receive the converted, canonicalized template
/// arguments.
///
/// \param UpdateArgsWithConversions If \c true, update \p TemplateArgs to
/// contain the converted forms of the template arguments as written.
/// Otherwise, \p TemplateArgs will not be modified.
///
/// \returns true if an error occurred, false otherwise.
bool CheckTemplateArgumentList(TemplateDecl *Template,
SourceLocation TemplateLoc,
TemplateArgumentListInfo &TemplateArgs,
bool PartialTemplateArgs,
SmallVectorImpl<TemplateArgument> &Converted,
bool UpdateArgsWithConversions = true);
bool CheckTemplateTypeArgument(TemplateTypeParmDecl *Param,
TemplateArgumentLoc &Arg,
SmallVectorImpl<TemplateArgument> &Converted);
bool CheckTemplateArgument(TemplateTypeParmDecl *Param,
TypeSourceInfo *Arg);
ExprResult CheckTemplateArgument(NonTypeTemplateParmDecl *Param,
QualType InstantiatedParamType, Expr *Arg,
TemplateArgument &Converted,
CheckTemplateArgumentKind CTAK = CTAK_Specified);
bool CheckTemplateTemplateArgument(TemplateParameterList *Params,
TemplateArgumentLoc &Arg);
ExprResult
BuildExpressionFromDeclTemplateArgument(const TemplateArgument &Arg,
QualType ParamType,
SourceLocation Loc);
ExprResult
BuildExpressionFromIntegralTemplateArgument(const TemplateArgument &Arg,
SourceLocation Loc);
/// Enumeration describing how template parameter lists are compared
/// for equality.
enum TemplateParameterListEqualKind {
/// We are matching the template parameter lists of two templates
/// that might be redeclarations.
///
/// \code
/// template<typename T> struct X;
/// template<typename T> struct X;
/// \endcode
TPL_TemplateMatch,
/// We are matching the template parameter lists of two template
/// template parameters as part of matching the template parameter lists
/// of two templates that might be redeclarations.
///
/// \code
/// template<template<int I> class TT> struct X;
/// template<template<int Value> class Other> struct X;
/// \endcode
TPL_TemplateTemplateParmMatch,
/// We are matching the template parameter lists of a template
/// template argument against the template parameter lists of a template
/// template parameter.
///
/// \code
/// template<template<int Value> class Metafun> struct X;
/// template<int Value> struct integer_c;
/// X<integer_c> xic;
/// \endcode
TPL_TemplateTemplateArgumentMatch
};
bool TemplateParameterListsAreEqual(TemplateParameterList *New,
TemplateParameterList *Old,
bool Complain,
TemplateParameterListEqualKind Kind,
SourceLocation TemplateArgLoc
= SourceLocation());
bool CheckTemplateDeclScope(Scope *S, TemplateParameterList *TemplateParams);
/// Called when the parser has parsed a C++ typename
/// specifier, e.g., "typename T::type".
///
/// \param S The scope in which this typename type occurs.
/// \param TypenameLoc the location of the 'typename' keyword
/// \param SS the nested-name-specifier following the typename (e.g., 'T::').
/// \param II the identifier we're retrieving (e.g., 'type' in the example).
/// \param IdLoc the location of the identifier.
TypeResult
ActOnTypenameType(Scope *S, SourceLocation TypenameLoc,
const CXXScopeSpec &SS, const IdentifierInfo &II,
SourceLocation IdLoc);
/// Called when the parser has parsed a C++ typename
/// specifier that ends in a template-id, e.g.,
/// "typename MetaFun::template apply<T1, T2>".
///
/// \param S The scope in which this typename type occurs.
/// \param TypenameLoc the location of the 'typename' keyword
/// \param SS the nested-name-specifier following the typename (e.g., 'T::').
/// \param TemplateLoc the location of the 'template' keyword, if any.
/// \param TemplateName The template name.
/// \param TemplateII The identifier used to name the template.
/// \param TemplateIILoc The location of the template name.
/// \param LAngleLoc The location of the opening angle bracket ('<').
/// \param TemplateArgs The template arguments.
/// \param RAngleLoc The location of the closing angle bracket ('>').
TypeResult
ActOnTypenameType(Scope *S, SourceLocation TypenameLoc,
const CXXScopeSpec &SS,
SourceLocation TemplateLoc,
TemplateTy TemplateName,
IdentifierInfo *TemplateII,
SourceLocation TemplateIILoc,
SourceLocation LAngleLoc,
ASTTemplateArgsPtr TemplateArgs,
SourceLocation RAngleLoc);
QualType CheckTypenameType(ElaboratedTypeKeyword Keyword,
SourceLocation KeywordLoc,
NestedNameSpecifierLoc QualifierLoc,
const IdentifierInfo &II,
SourceLocation IILoc);
TypeSourceInfo *RebuildTypeInCurrentInstantiation(TypeSourceInfo *T,
SourceLocation Loc,
DeclarationName Name);
bool RebuildNestedNameSpecifierInCurrentInstantiation(CXXScopeSpec &SS);
ExprResult RebuildExprInCurrentInstantiation(Expr *E);
bool RebuildTemplateParamsInCurrentInstantiation(
TemplateParameterList *Params);
std::string
getTemplateArgumentBindingsText(const TemplateParameterList *Params,
const TemplateArgumentList &Args);
std::string
getTemplateArgumentBindingsText(const TemplateParameterList *Params,
const TemplateArgument *Args,
unsigned NumArgs);
// Concepts
Decl *ActOnConceptDefinition(
Scope *S, MultiTemplateParamsArg TemplateParameterLists,
IdentifierInfo *Name, SourceLocation NameLoc, Expr *ConstraintExpr);
//===--------------------------------------------------------------------===//
// C++ Variadic Templates (C++0x [temp.variadic])
//===--------------------------------------------------------------------===//
/// Determine whether an unexpanded parameter pack might be permitted in this
/// location. Useful for error recovery.
bool isUnexpandedParameterPackPermitted();
/// The context in which an unexpanded parameter pack is
/// being diagnosed.
///
/// Note that the values of this enumeration line up with the first
/// argument to the \c err_unexpanded_parameter_pack diagnostic.
enum UnexpandedParameterPackContext {
/// An arbitrary expression.
UPPC_Expression = 0,
/// The base type of a class type.
UPPC_BaseType,
/// The type of an arbitrary declaration.
UPPC_DeclarationType,
/// The type of a data member.
UPPC_DataMemberType,
/// The size of a bit-field.
UPPC_BitFieldWidth,
/// The expression in a static assertion.
UPPC_StaticAssertExpression,
/// The fixed underlying type of an enumeration.
UPPC_FixedUnderlyingType,
/// The enumerator value.
UPPC_EnumeratorValue,
/// A using declaration.
UPPC_UsingDeclaration,
/// A friend declaration.
UPPC_FriendDeclaration,
/// A declaration qualifier.
UPPC_DeclarationQualifier,
/// An initializer.
UPPC_Initializer,
/// A default argument.
UPPC_DefaultArgument,
/// The type of a non-type template parameter.
UPPC_NonTypeTemplateParameterType,
/// The type of an exception.
UPPC_ExceptionType,
/// Partial specialization.
UPPC_PartialSpecialization,
/// Microsoft __if_exists.
UPPC_IfExists,
/// Microsoft __if_not_exists.
UPPC_IfNotExists,
/// Lambda expression.
UPPC_Lambda,
/// Block expression,
UPPC_Block
};
/// Diagnose unexpanded parameter packs.
///
/// \param Loc The location at which we should emit the diagnostic.
///
/// \param UPPC The context in which we are diagnosing unexpanded
/// parameter packs.
///
/// \param Unexpanded the set of unexpanded parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPacks(SourceLocation Loc,
UnexpandedParameterPackContext UPPC,
ArrayRef<UnexpandedParameterPack> Unexpanded);
/// If the given type contains an unexpanded parameter pack,
/// diagnose the error.
///
/// \param Loc The source location where a diagnostc should be emitted.
///
/// \param T The type that is being checked for unexpanded parameter
/// packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(SourceLocation Loc, TypeSourceInfo *T,
UnexpandedParameterPackContext UPPC);
/// If the given expression contains an unexpanded parameter
/// pack, diagnose the error.
///
/// \param E The expression that is being checked for unexpanded
/// parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(Expr *E,
UnexpandedParameterPackContext UPPC = UPPC_Expression);
/// If the given nested-name-specifier contains an unexpanded
/// parameter pack, diagnose the error.
///
/// \param SS The nested-name-specifier that is being checked for
/// unexpanded parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(const CXXScopeSpec &SS,
UnexpandedParameterPackContext UPPC);
/// If the given name contains an unexpanded parameter pack,
/// diagnose the error.
///
/// \param NameInfo The name (with source location information) that
/// is being checked for unexpanded parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(const DeclarationNameInfo &NameInfo,
UnexpandedParameterPackContext UPPC);
/// If the given template name contains an unexpanded parameter pack,
/// diagnose the error.
///
/// \param Loc The location of the template name.
///
/// \param Template The template name that is being checked for unexpanded
/// parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(SourceLocation Loc,
TemplateName Template,
UnexpandedParameterPackContext UPPC);
/// If the given template argument contains an unexpanded parameter
/// pack, diagnose the error.
///
/// \param Arg The template argument that is being checked for unexpanded
/// parameter packs.
///
/// \returns true if an error occurred, false otherwise.
bool DiagnoseUnexpandedParameterPack(TemplateArgumentLoc Arg,
UnexpandedParameterPackContext UPPC);
/// Collect the set of unexpanded parameter packs within the given
/// template argument.
///
/// \param Arg The template argument that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(TemplateArgument Arg,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Collect the set of unexpanded parameter packs within the given
/// template argument.
///
/// \param Arg The template argument that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(TemplateArgumentLoc Arg,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Collect the set of unexpanded parameter packs within the given
/// type.
///
/// \param T The type that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(QualType T,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Collect the set of unexpanded parameter packs within the given
/// type.
///
/// \param TL The type that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(TypeLoc TL,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Collect the set of unexpanded parameter packs within the given
/// nested-name-specifier.
///
/// \param NNS The nested-name-specifier that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(NestedNameSpecifierLoc NNS,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Collect the set of unexpanded parameter packs within the given
/// name.
///
/// \param NameInfo The name that will be traversed to find
/// unexpanded parameter packs.
void collectUnexpandedParameterPacks(const DeclarationNameInfo &NameInfo,
SmallVectorImpl<UnexpandedParameterPack> &Unexpanded);
/// Invoked when parsing a template argument followed by an
/// ellipsis, which creates a pack expansion.
///
/// \param Arg The template argument preceding the ellipsis, which
/// may already be invalid.
///
/// \param EllipsisLoc The location of the ellipsis.
ParsedTemplateArgument ActOnPackExpansion(const ParsedTemplateArgument &Arg,
SourceLocation EllipsisLoc);
/// Invoked when parsing a type followed by an ellipsis, which
/// creates a pack expansion.
///
/// \param Type The type preceding the ellipsis, which will become
/// the pattern of the pack expansion.
///
/// \param EllipsisLoc The location of the ellipsis.
TypeResult ActOnPackExpansion(ParsedType Type, SourceLocation EllipsisLoc);
/// Construct a pack expansion type from the pattern of the pack
/// expansion.
TypeSourceInfo *CheckPackExpansion(TypeSourceInfo *Pattern,
SourceLocation EllipsisLoc,
Optional<unsigned> NumExpansions);
/// Construct a pack expansion type from the pattern of the pack
/// expansion.
QualType CheckPackExpansion(QualType Pattern,
SourceRange PatternRange,
SourceLocation EllipsisLoc,
Optional<unsigned> NumExpansions);
/// Invoked when parsing an expression followed by an ellipsis, which
/// creates a pack expansion.
///
/// \param Pattern The expression preceding the ellipsis, which will become
/// the pattern of the pack expansion.
///
/// \param EllipsisLoc The location of the ellipsis.
ExprResult ActOnPackExpansion(Expr *Pattern, SourceLocation EllipsisLoc);
/// Invoked when parsing an expression followed by an ellipsis, which
/// creates a pack expansion.
///
/// \param Pattern The expression preceding the ellipsis, which will become
/// the pattern of the pack expansion.
///
/// \param EllipsisLoc The location of the ellipsis.
ExprResult CheckPackExpansion(Expr *Pattern, SourceLocation EllipsisLoc,
Optional<unsigned> NumExpansions);
/// Determine whether we could expand a pack expansion with the
/// given set of parameter packs into separate arguments by repeatedly
/// transforming the pattern.
///
/// \param EllipsisLoc The location of the ellipsis that identifies the
/// pack expansion.
///
/// \param PatternRange The source range that covers the entire pattern of
/// the pack expansion.
///
/// \param Unexpanded The set of unexpanded parameter packs within the
/// pattern.
///
/// \param ShouldExpand Will be set to \c true if the transformer should
/// expand the corresponding pack expansions into separate arguments. When
/// set, \c NumExpansions must also be set.
///
/// \param RetainExpansion Whether the caller should add an unexpanded
/// pack expansion after all of the expanded arguments. This is used
/// when extending explicitly-specified template argument packs per
/// C++0x [temp.arg.explicit]p9.
///
/// \param NumExpansions The number of separate arguments that will be in
/// the expanded form of the corresponding pack expansion. This is both an
/// input and an output parameter, which can be set by the caller if the
/// number of expansions is known a priori (e.g., due to a prior substitution)
/// and will be set by the callee when the number of expansions is known.
/// The callee must set this value when \c ShouldExpand is \c true; it may
/// set this value in other cases.
///
/// \returns true if an error occurred (e.g., because the parameter packs
/// are to be instantiated with arguments of different lengths), false
/// otherwise. If false, \c ShouldExpand (and possibly \c NumExpansions)
/// must be set.
bool CheckParameterPacksForExpansion(SourceLocation EllipsisLoc,
SourceRange PatternRange,
ArrayRef<UnexpandedParameterPack> Unexpanded,
const MultiLevelTemplateArgumentList &TemplateArgs,
bool &ShouldExpand,
bool &RetainExpansion,
Optional<unsigned> &NumExpansions);
/// Determine the number of arguments in the given pack expansion
/// type.
///
/// This routine assumes that the number of arguments in the expansion is
/// consistent across all of the unexpanded parameter packs in its pattern.
///
/// Returns an empty Optional if the type can't be expanded.
Optional<unsigned> getNumArgumentsInExpansion(QualType T,
const MultiLevelTemplateArgumentList &TemplateArgs);
/// Determine whether the given declarator contains any unexpanded
/// parameter packs.
///
/// This routine is used by the parser to disambiguate function declarators
/// with an ellipsis prior to the ')', e.g.,
///
/// \code
/// void f(T...);
/// \endcode
///
/// To determine whether we have an (unnamed) function parameter pack or
/// a variadic function.
///
/// \returns true if the declarator contains any unexpanded parameter packs,
/// false otherwise.
bool containsUnexpandedParameterPacks(Declarator &D);
/// Returns the pattern of the pack expansion for a template argument.
///
/// \param OrigLoc The template argument to expand.
///
/// \param Ellipsis Will be set to the location of the ellipsis.
///
/// \param NumExpansions Will be set to the number of expansions that will
/// be generated from this pack expansion, if known a priori.
TemplateArgumentLoc getTemplateArgumentPackExpansionPattern(
TemplateArgumentLoc OrigLoc,
SourceLocation &Ellipsis,
Optional<unsigned> &NumExpansions) const;
/// Given a template argument that contains an unexpanded parameter pack, but
/// which has already been substituted, attempt to determine the number of
/// elements that will be produced once this argument is fully-expanded.
///
/// This is intended for use when transforming 'sizeof...(Arg)' in order to
/// avoid actually expanding the pack where possible.
Optional<unsigned> getFullyPackExpandedSize(TemplateArgument Arg);
//===--------------------------------------------------------------------===//
// C++ Template Argument Deduction (C++ [temp.deduct])
//===--------------------------------------------------------------------===//
/// Adjust the type \p ArgFunctionType to match the calling convention,
/// noreturn, and optionally the exception specification of \p FunctionType.
/// Deduction often wants to ignore these properties when matching function
/// types.
QualType adjustCCAndNoReturn(QualType ArgFunctionType, QualType FunctionType,
bool AdjustExceptionSpec = false);
/// Describes the result of template argument deduction.
///
/// The TemplateDeductionResult enumeration describes the result of
/// template argument deduction, as returned from
/// DeduceTemplateArguments(). The separate TemplateDeductionInfo
/// structure provides additional information about the results of
/// template argument deduction, e.g., the deduced template argument
/// list (if successful) or the specific template parameters or
/// deduced arguments that were involved in the failure.
enum TemplateDeductionResult {
/// Template argument deduction was successful.
TDK_Success = 0,
/// The declaration was invalid; do nothing.
TDK_Invalid,
/// Template argument deduction exceeded the maximum template
/// instantiation depth (which has already been diagnosed).
TDK_InstantiationDepth,
/// Template argument deduction did not deduce a value
/// for every template parameter.
TDK_Incomplete,
/// Template argument deduction did not deduce a value for every
/// expansion of an expanded template parameter pack.
TDK_IncompletePack,
/// Template argument deduction produced inconsistent
/// deduced values for the given template parameter.
TDK_Inconsistent,
/// Template argument deduction failed due to inconsistent
/// cv-qualifiers on a template parameter type that would
/// otherwise be deduced, e.g., we tried to deduce T in "const T"
/// but were given a non-const "X".
TDK_Underqualified,
/// Substitution of the deduced template argument values
/// resulted in an error.
TDK_SubstitutionFailure,
/// After substituting deduced template arguments, a dependent
/// parameter type did not match the corresponding argument.
TDK_DeducedMismatch,
/// After substituting deduced template arguments, an element of
/// a dependent parameter type did not match the corresponding element
/// of the corresponding argument (when deducing from an initializer list).
TDK_DeducedMismatchNested,
/// A non-depnedent component of the parameter did not match the
/// corresponding component of the argument.
TDK_NonDeducedMismatch,
/// When performing template argument deduction for a function
/// template, there were too many call arguments.
TDK_TooManyArguments,
/// When performing template argument deduction for a function
/// template, there were too few call arguments.
TDK_TooFewArguments,
/// The explicitly-specified template arguments were not valid
/// template arguments for the given template.
TDK_InvalidExplicitArguments,
/// Checking non-dependent argument conversions failed.
TDK_NonDependentConversionFailure,
/// Deduction failed; that's all we know.
TDK_MiscellaneousDeductionFailure,
/// CUDA Target attributes do not match.
TDK_CUDATargetMismatch
};
TemplateDeductionResult
DeduceTemplateArguments(ClassTemplatePartialSpecializationDecl *Partial,
const TemplateArgumentList &TemplateArgs,
sema::TemplateDeductionInfo &Info);
TemplateDeductionResult
DeduceTemplateArguments(VarTemplatePartialSpecializationDecl *Partial,
const TemplateArgumentList &TemplateArgs,
sema::TemplateDeductionInfo &Info);
TemplateDeductionResult SubstituteExplicitTemplateArguments(
FunctionTemplateDecl *FunctionTemplate,
TemplateArgumentListInfo &ExplicitTemplateArgs,
SmallVectorImpl<DeducedTemplateArgument> &Deduced,
SmallVectorImpl<QualType> &ParamTypes, QualType *FunctionType,
sema::TemplateDeductionInfo &Info);
/// brief A function argument from which we performed template argument
// deduction for a call.
struct OriginalCallArg {
OriginalCallArg(QualType OriginalParamType, bool DecomposedParam,
unsigned ArgIdx, QualType OriginalArgType)
: OriginalParamType(OriginalParamType),
DecomposedParam(DecomposedParam), ArgIdx(ArgIdx),
OriginalArgType(OriginalArgType) {}
QualType OriginalParamType;
bool DecomposedParam;
unsigned ArgIdx;
QualType OriginalArgType;
};
TemplateDeductionResult FinishTemplateArgumentDeduction(
FunctionTemplateDecl *FunctionTemplate,
SmallVectorImpl<DeducedTemplateArgument> &Deduced,
unsigned NumExplicitlySpecified, FunctionDecl *&Specialization,
sema::TemplateDeductionInfo &Info,
SmallVectorImpl<OriginalCallArg> const *OriginalCallArgs = nullptr,
bool PartialOverloading = false,
llvm::function_ref<bool()> CheckNonDependent = []{ return false; });
TemplateDeductionResult DeduceTemplateArguments(
FunctionTemplateDecl *FunctionTemplate,
TemplateArgumentListInfo *ExplicitTemplateArgs, ArrayRef<Expr *> Args,
FunctionDecl *&Specialization, sema::TemplateDeductionInfo &Info,
bool PartialOverloading,
llvm::function_ref<bool(ArrayRef<QualType>)> CheckNonDependent);
TemplateDeductionResult
DeduceTemplateArguments(FunctionTemplateDecl *FunctionTemplate,
TemplateArgumentListInfo *ExplicitTemplateArgs,
QualType ArgFunctionType,
FunctionDecl *&Specialization,
sema::TemplateDeductionInfo &Info,
bool IsAddressOfFunction = false);
TemplateDeductionResult
DeduceTemplateArguments(FunctionTemplateDecl *FunctionTemplate,
QualType ToType,
CXXConversionDecl *&Specialization,
sema::TemplateDeductionInfo &Info);
TemplateDeductionResult
DeduceTemplateArguments(FunctionTemplateDecl *FunctionTemplate,
TemplateArgumentListInfo *ExplicitTemplateArgs,
FunctionDecl *&Specialization,
sema::TemplateDeductionInfo &Info,
bool IsAddressOfFunction = false);
/// Substitute Replacement for \p auto in \p TypeWithAuto
QualType SubstAutoType(QualType TypeWithAuto, QualType Replacement);
/// Substitute Replacement for auto in TypeWithAuto
TypeSourceInfo* SubstAutoTypeSourceInfo(TypeSourceInfo *TypeWithAuto,
QualType Replacement);
/// Completely replace the \c auto in \p TypeWithAuto by
/// \p Replacement. This does not retain any \c auto type sugar.
QualType ReplaceAutoType(QualType TypeWithAuto, QualType Replacement);
/// Result type of DeduceAutoType.
enum DeduceAutoResult {
DAR_Succeeded,
DAR_Failed,
DAR_FailedAlreadyDiagnosed
};
DeduceAutoResult
DeduceAutoType(TypeSourceInfo *AutoType, Expr *&Initializer, QualType &Result,
Optional<unsigned> DependentDeductionDepth = None);
DeduceAutoResult
DeduceAutoType(TypeLoc AutoTypeLoc, Expr *&Initializer, QualType &Result,
Optional<unsigned> DependentDeductionDepth = None);
void DiagnoseAutoDeductionFailure(VarDecl *VDecl, Expr *Init);
bool DeduceReturnType(FunctionDecl *FD, SourceLocation Loc,
bool Diagnose = true);
/// Declare implicit deduction guides for a class template if we've
/// not already done so.
void DeclareImplicitDeductionGuides(TemplateDecl *Template,
SourceLocation Loc);
QualType DeduceTemplateSpecializationFromInitializer(
TypeSourceInfo *TInfo, const InitializedEntity &Entity,
const InitializationKind &Kind, MultiExprArg Init);
QualType deduceVarTypeFromInitializer(VarDecl *VDecl, DeclarationName Name,
QualType Type, TypeSourceInfo *TSI,
SourceRange Range, bool DirectInit,
Expr *Init);
TypeLoc getReturnTypeLoc(FunctionDecl *FD) const;
bool DeduceFunctionTypeFromReturnExpr(FunctionDecl *FD,
SourceLocation ReturnLoc,
Expr *&RetExpr, AutoType *AT);
FunctionTemplateDecl *getMoreSpecializedTemplate(FunctionTemplateDecl *FT1,
FunctionTemplateDecl *FT2,
SourceLocation Loc,
TemplatePartialOrderingContext TPOC,
unsigned NumCallArguments1,
unsigned NumCallArguments2);
UnresolvedSetIterator
getMostSpecialized(UnresolvedSetIterator SBegin, UnresolvedSetIterator SEnd,
TemplateSpecCandidateSet &FailedCandidates,
SourceLocation Loc,
const PartialDiagnostic &NoneDiag,
const PartialDiagnostic &AmbigDiag,
const PartialDiagnostic &CandidateDiag,
bool Complain = true, QualType TargetType = QualType());
ClassTemplatePartialSpecializationDecl *
getMoreSpecializedPartialSpecialization(
ClassTemplatePartialSpecializationDecl *PS1,
ClassTemplatePartialSpecializationDecl *PS2,
SourceLocation Loc);
bool isMoreSpecializedThanPrimary(ClassTemplatePartialSpecializationDecl *T,
sema::TemplateDeductionInfo &Info);
VarTemplatePartialSpecializationDecl *getMoreSpecializedPartialSpecialization(
VarTemplatePartialSpecializationDecl *PS1,
VarTemplatePartialSpecializationDecl *PS2, SourceLocation Loc);
bool isMoreSpecializedThanPrimary(VarTemplatePartialSpecializationDecl *T,
sema::TemplateDeductionInfo &Info);
bool isTemplateTemplateParameterAtLeastAsSpecializedAs(
TemplateParameterList *P, TemplateDecl *AArg, SourceLocation Loc);
void MarkUsedTemplateParameters(const TemplateArgumentList &TemplateArgs,
bool OnlyDeduced,
unsigned Depth,
llvm::SmallBitVector &Used);
void MarkDeducedTemplateParameters(
const FunctionTemplateDecl *FunctionTemplate,
llvm::SmallBitVector &Deduced) {
return MarkDeducedTemplateParameters(Context, FunctionTemplate, Deduced);
}
static void MarkDeducedTemplateParameters(ASTContext &Ctx,
const FunctionTemplateDecl *FunctionTemplate,
llvm::SmallBitVector &Deduced);
//===--------------------------------------------------------------------===//
// C++ Template Instantiation
//
MultiLevelTemplateArgumentList
getTemplateInstantiationArgs(NamedDecl *D,
const TemplateArgumentList *Innermost = nullptr,
bool RelativeToPrimary = false,
const FunctionDecl *Pattern = nullptr);
/// A context in which code is being synthesized (where a source location
/// alone is not sufficient to identify the context). This covers template
/// instantiation and various forms of implicitly-generated functions.
struct CodeSynthesisContext {
/// The kind of template instantiation we are performing
enum SynthesisKind {
/// We are instantiating a template declaration. The entity is
/// the declaration we're instantiating (e.g., a CXXRecordDecl).
TemplateInstantiation,
/// We are instantiating a default argument for a template
/// parameter. The Entity is the template parameter whose argument is
/// being instantiated, the Template is the template, and the
/// TemplateArgs/NumTemplateArguments provide the template arguments as
/// specified.
DefaultTemplateArgumentInstantiation,
/// We are instantiating a default argument for a function.
/// The Entity is the ParmVarDecl, and TemplateArgs/NumTemplateArgs
/// provides the template arguments as specified.
DefaultFunctionArgumentInstantiation,
/// We are substituting explicit template arguments provided for
/// a function template. The entity is a FunctionTemplateDecl.
ExplicitTemplateArgumentSubstitution,
/// We are substituting template argument determined as part of
/// template argument deduction for either a class template
/// partial specialization or a function template. The
/// Entity is either a {Class|Var}TemplatePartialSpecializationDecl or
/// a TemplateDecl.
DeducedTemplateArgumentSubstitution,
/// We are substituting prior template arguments into a new
/// template parameter. The template parameter itself is either a
/// NonTypeTemplateParmDecl or a TemplateTemplateParmDecl.
PriorTemplateArgumentSubstitution,
/// We are checking the validity of a default template argument that
/// has been used when naming a template-id.
DefaultTemplateArgumentChecking,
/// We are computing the exception specification for a defaulted special
/// member function.
ExceptionSpecEvaluation,
/// We are instantiating the exception specification for a function
/// template which was deferred until it was needed.
ExceptionSpecInstantiation,
/// We are declaring an implicit special member function.
DeclaringSpecialMember,
/// We are defining a synthesized function (such as a defaulted special
/// member).
DefiningSynthesizedFunction,
// We are checking the constraints associated with a constrained entity or
// the constraint expression of a concept. This includes the checks that
// atomic constraints have the type 'bool' and that they can be constant
// evaluated.
ConstraintsCheck,
// We are substituting template arguments into a constraint expression.
ConstraintSubstitution,
/// We are rewriting a comparison operator in terms of an operator<=>.
RewritingOperatorAsSpaceship,
/// Added for Template instantiation observation.
/// Memoization means we are _not_ instantiating a template because
/// it is already instantiated (but we entered a context where we
/// would have had to if it was not already instantiated).
Memoization
} Kind;
/// Was the enclosing context a non-instantiation SFINAE context?
bool SavedInNonInstantiationSFINAEContext;
/// The point of instantiation or synthesis within the source code.
SourceLocation PointOfInstantiation;
/// The entity that is being synthesized.
Decl *Entity;
/// The template (or partial specialization) in which we are
/// performing the instantiation, for substitutions of prior template
/// arguments.
NamedDecl *Template;
/// The list of template arguments we are substituting, if they
/// are not part of the entity.
const TemplateArgument *TemplateArgs;
// FIXME: Wrap this union around more members, or perhaps store the
// kind-specific members in the RAII object owning the context.
union {
/// The number of template arguments in TemplateArgs.
unsigned NumTemplateArgs;
/// The special member being declared or defined.
CXXSpecialMember SpecialMember;
};
ArrayRef<TemplateArgument> template_arguments() const {
assert(Kind != DeclaringSpecialMember);
return {TemplateArgs, NumTemplateArgs};
}
/// The template deduction info object associated with the
/// substitution or checking of explicit or deduced template arguments.
sema::TemplateDeductionInfo *DeductionInfo;
/// The source range that covers the construct that cause
/// the instantiation, e.g., the template-id that causes a class
/// template instantiation.
SourceRange InstantiationRange;
CodeSynthesisContext()
: Kind(TemplateInstantiation),
SavedInNonInstantiationSFINAEContext(false), Entity(nullptr),
Template(nullptr), TemplateArgs(nullptr), NumTemplateArgs(0),
DeductionInfo(nullptr) {}
/// Determines whether this template is an actual instantiation
/// that should be counted toward the maximum instantiation depth.
bool isInstantiationRecord() const;
};
/// List of active code synthesis contexts.
///
/// This vector is treated as a stack. As synthesis of one entity requires
/// synthesis of another, additional contexts are pushed onto the stack.
SmallVector<CodeSynthesisContext, 16> CodeSynthesisContexts;
/// Specializations whose definitions are currently being instantiated.
llvm::DenseSet<std::pair<Decl *, unsigned>> InstantiatingSpecializations;
/// Non-dependent types used in templates that have already been instantiated
/// by some template instantiation.
llvm::DenseSet<QualType> InstantiatedNonDependentTypes;
/// Extra modules inspected when performing a lookup during a template
/// instantiation. Computed lazily.
SmallVector<Module*, 16> CodeSynthesisContextLookupModules;
/// Cache of additional modules that should be used for name lookup
/// within the current template instantiation. Computed lazily; use
/// getLookupModules() to get a complete set.
llvm::DenseSet<Module*> LookupModulesCache;
/// Get the set of additional modules that should be checked during
/// name lookup. A module and its imports become visible when instanting a
/// template defined within it.
llvm::DenseSet<Module*> &getLookupModules();
/// Map from the most recent declaration of a namespace to the most
/// recent visible declaration of that namespace.
llvm::DenseMap<NamedDecl*, NamedDecl*> VisibleNamespaceCache;
/// Whether we are in a SFINAE context that is not associated with
/// template instantiation.
///
/// This is used when setting up a SFINAE trap (\c see SFINAETrap) outside
/// of a template instantiation or template argument deduction.
bool InNonInstantiationSFINAEContext;
/// The number of \p CodeSynthesisContexts that are not template
/// instantiations and, therefore, should not be counted as part of the
/// instantiation depth.
///
/// When the instantiation depth reaches the user-configurable limit
/// \p LangOptions::InstantiationDepth we will abort instantiation.
// FIXME: Should we have a similar limit for other forms of synthesis?
unsigned NonInstantiationEntries;
/// The depth of the context stack at the point when the most recent
/// error or warning was produced.
///
/// This value is used to suppress printing of redundant context stacks
/// when there are multiple errors or warnings in the same instantiation.
// FIXME: Does this belong in Sema? It's tough to implement it anywhere else.
unsigned LastEmittedCodeSynthesisContextDepth = 0;
/// The template instantiation callbacks to trace or track
/// instantiations (objects can be chained).
///
/// This callbacks is used to print, trace or track template
/// instantiations as they are being constructed.
std::vector<std::unique_ptr<TemplateInstantiationCallback>>
TemplateInstCallbacks;
/// The current index into pack expansion arguments that will be
/// used for substitution of parameter packs.
///
/// The pack expansion index will be -1 to indicate that parameter packs
/// should be instantiated as themselves. Otherwise, the index specifies
/// which argument within the parameter pack will be used for substitution.
int ArgumentPackSubstitutionIndex;
/// RAII object used to change the argument pack substitution index
/// within a \c Sema object.
///
/// See \c ArgumentPackSubstitutionIndex for more information.
class ArgumentPackSubstitutionIndexRAII {
Sema &Self;
int OldSubstitutionIndex;
public:
ArgumentPackSubstitutionIndexRAII(Sema &Self, int NewSubstitutionIndex)
: Self(Self), OldSubstitutionIndex(Self.ArgumentPackSubstitutionIndex) {
Self.ArgumentPackSubstitutionIndex = NewSubstitutionIndex;
}
~ArgumentPackSubstitutionIndexRAII() {
Self.ArgumentPackSubstitutionIndex = OldSubstitutionIndex;
}
};
friend class ArgumentPackSubstitutionRAII;
/// For each declaration that involved template argument deduction, the
/// set of diagnostics that were suppressed during that template argument
/// deduction.
///
/// FIXME: Serialize this structure to the AST file.
typedef llvm::DenseMap<Decl *, SmallVector<PartialDiagnosticAt, 1> >
SuppressedDiagnosticsMap;
SuppressedDiagnosticsMap SuppressedDiagnostics;
/// A stack object to be created when performing template
/// instantiation.
///
/// Construction of an object of type \c InstantiatingTemplate
/// pushes the current instantiation onto the stack of active
/// instantiations. If the size of this stack exceeds the maximum
/// number of recursive template instantiations, construction
/// produces an error and evaluates true.
///
/// Destruction of this object will pop the named instantiation off
/// the stack.
struct InstantiatingTemplate {
/// Note that we are instantiating a class template,
/// function template, variable template, alias template,
/// or a member thereof.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
Decl *Entity,
SourceRange InstantiationRange = SourceRange());
struct ExceptionSpecification {};
/// Note that we are instantiating an exception specification
/// of a function template.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
FunctionDecl *Entity, ExceptionSpecification,
SourceRange InstantiationRange = SourceRange());
/// Note that we are instantiating a default argument in a
/// template-id.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
TemplateParameter Param, TemplateDecl *Template,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange = SourceRange());
/// Note that we are substituting either explicitly-specified or
/// deduced template arguments during function template argument deduction.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
FunctionTemplateDecl *FunctionTemplate,
ArrayRef<TemplateArgument> TemplateArgs,
CodeSynthesisContext::SynthesisKind Kind,
sema::TemplateDeductionInfo &DeductionInfo,
SourceRange InstantiationRange = SourceRange());
/// Note that we are instantiating as part of template
/// argument deduction for a class template declaration.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
TemplateDecl *Template,
ArrayRef<TemplateArgument> TemplateArgs,
sema::TemplateDeductionInfo &DeductionInfo,
SourceRange InstantiationRange = SourceRange());
/// Note that we are instantiating as part of template
/// argument deduction for a class template partial
/// specialization.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
ClassTemplatePartialSpecializationDecl *PartialSpec,
ArrayRef<TemplateArgument> TemplateArgs,
sema::TemplateDeductionInfo &DeductionInfo,
SourceRange InstantiationRange = SourceRange());
/// Note that we are instantiating as part of template
/// argument deduction for a variable template partial
/// specialization.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
VarTemplatePartialSpecializationDecl *PartialSpec,
ArrayRef<TemplateArgument> TemplateArgs,
sema::TemplateDeductionInfo &DeductionInfo,
SourceRange InstantiationRange = SourceRange());
/// Note that we are instantiating a default argument for a function
/// parameter.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
ParmVarDecl *Param,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange = SourceRange());
/// Note that we are substituting prior template arguments into a
/// non-type parameter.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
NamedDecl *Template,
NonTypeTemplateParmDecl *Param,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange);
/// Note that we are substituting prior template arguments into a
/// template template parameter.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
NamedDecl *Template,
TemplateTemplateParmDecl *Param,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange);
/// Note that we are checking the default template argument
/// against the template parameter for a given template-id.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
TemplateDecl *Template,
NamedDecl *Param,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange);
struct ConstraintsCheck {};
/// \brief Note that we are checking the constraints associated with some
/// constrained entity (a concept declaration or a template with associated
/// constraints).
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
ConstraintsCheck, TemplateDecl *Template,
ArrayRef<TemplateArgument> TemplateArgs,
SourceRange InstantiationRange);
struct ConstraintSubstitution {};
/// \brief Note that we are checking a constraint expression associated
/// with a template declaration or as part of the satisfaction check of a
/// concept.
InstantiatingTemplate(Sema &SemaRef, SourceLocation PointOfInstantiation,
ConstraintSubstitution, TemplateDecl *Template,
sema::TemplateDeductionInfo &DeductionInfo,
SourceRange InstantiationRange);
/// Note that we have finished instantiating this template.
void Clear();
~InstantiatingTemplate() { Clear(); }
/// Determines whether we have exceeded the maximum
/// recursive template instantiations.
bool isInvalid() const { return Invalid; }
/// Determine whether we are already instantiating this
/// specialization in some surrounding active instantiation.
bool isAlreadyInstantiating() const { return AlreadyInstantiating; }
private:
Sema &SemaRef;
bool Invalid;
bool AlreadyInstantiating;
bool CheckInstantiationDepth(SourceLocation PointOfInstantiation,
SourceRange InstantiationRange);
InstantiatingTemplate(
Sema &SemaRef, CodeSynthesisContext::SynthesisKind Kind,
SourceLocation PointOfInstantiation, SourceRange InstantiationRange,
Decl *Entity, NamedDecl *Template = nullptr,
ArrayRef<TemplateArgument> TemplateArgs = None,
sema::TemplateDeductionInfo *DeductionInfo = nullptr);
InstantiatingTemplate(const InstantiatingTemplate&) = delete;
InstantiatingTemplate&
operator=(const InstantiatingTemplate&) = delete;
};
void pushCodeSynthesisContext(CodeSynthesisContext Ctx);
void popCodeSynthesisContext();
/// Determine whether we are currently performing template instantiation.
bool inTemplateInstantiation() const {
return CodeSynthesisContexts.size() > NonInstantiationEntries;
}
void PrintContextStack() {
if (!CodeSynthesisContexts.empty() &&
CodeSynthesisContexts.size() != LastEmittedCodeSynthesisContextDepth) {
PrintInstantiationStack();
LastEmittedCodeSynthesisContextDepth = CodeSynthesisContexts.size();
}
if (PragmaAttributeCurrentTargetDecl)
PrintPragmaAttributeInstantiationPoint();
}
void PrintInstantiationStack();
void PrintPragmaAttributeInstantiationPoint();
/// Determines whether we are currently in a context where
/// template argument substitution failures are not considered
/// errors.
///
/// \returns An empty \c Optional if we're not in a SFINAE context.
/// Otherwise, contains a pointer that, if non-NULL, contains the nearest
/// template-deduction context object, which can be used to capture
/// diagnostics that will be suppressed.
Optional<sema::TemplateDeductionInfo *> isSFINAEContext() const;
/// Determines whether we are currently in a context that
/// is not evaluated as per C++ [expr] p5.
bool isUnevaluatedContext() const {
assert(!ExprEvalContexts.empty() &&
"Must be in an expression evaluation context");
return ExprEvalContexts.back().isUnevaluated();
}
/// RAII class used to determine whether SFINAE has
/// trapped any errors that occur during template argument
/// deduction.
class SFINAETrap {
Sema &SemaRef;
unsigned PrevSFINAEErrors;
bool PrevInNonInstantiationSFINAEContext;
bool PrevAccessCheckingSFINAE;
bool PrevLastDiagnosticIgnored;
public:
explicit SFINAETrap(Sema &SemaRef, bool AccessCheckingSFINAE = false)
: SemaRef(SemaRef), PrevSFINAEErrors(SemaRef.NumSFINAEErrors),
PrevInNonInstantiationSFINAEContext(
SemaRef.InNonInstantiationSFINAEContext),
PrevAccessCheckingSFINAE(SemaRef.AccessCheckingSFINAE),
PrevLastDiagnosticIgnored(
SemaRef.getDiagnostics().isLastDiagnosticIgnored())
{
if (!SemaRef.isSFINAEContext())
SemaRef.InNonInstantiationSFINAEContext = true;
SemaRef.AccessCheckingSFINAE = AccessCheckingSFINAE;
}
~SFINAETrap() {
SemaRef.NumSFINAEErrors = PrevSFINAEErrors;
SemaRef.InNonInstantiationSFINAEContext
= PrevInNonInstantiationSFINAEContext;
SemaRef.AccessCheckingSFINAE = PrevAccessCheckingSFINAE;
SemaRef.getDiagnostics().setLastDiagnosticIgnored(
PrevLastDiagnosticIgnored);
}
/// Determine whether any SFINAE errors have been trapped.
bool hasErrorOccurred() const {
return SemaRef.NumSFINAEErrors > PrevSFINAEErrors;
}
};
/// RAII class used to indicate that we are performing provisional
/// semantic analysis to determine the validity of a construct, so
/// typo-correction and diagnostics in the immediate context (not within
/// implicitly-instantiated templates) should be suppressed.
class TentativeAnalysisScope {
Sema &SemaRef;
// FIXME: Using a SFINAETrap for this is a hack.
SFINAETrap Trap;
bool PrevDisableTypoCorrection;
public:
explicit TentativeAnalysisScope(Sema &SemaRef)
: SemaRef(SemaRef), Trap(SemaRef, true),
PrevDisableTypoCorrection(SemaRef.DisableTypoCorrection) {
SemaRef.DisableTypoCorrection = true;
}
~TentativeAnalysisScope() {
SemaRef.DisableTypoCorrection = PrevDisableTypoCorrection;
}
};
/// The current instantiation scope used to store local
/// variables.
LocalInstantiationScope *CurrentInstantiationScope;
/// Tracks whether we are in a context where typo correction is
/// disabled.
bool DisableTypoCorrection;
/// The number of typos corrected by CorrectTypo.
unsigned TyposCorrected;
typedef llvm::SmallSet<SourceLocation, 2> SrcLocSet;
typedef llvm::DenseMap<IdentifierInfo *, SrcLocSet> IdentifierSourceLocations;
/// A cache containing identifiers for which typo correction failed and
/// their locations, so that repeated attempts to correct an identifier in a
/// given location are ignored if typo correction already failed for it.
IdentifierSourceLocations TypoCorrectionFailures;
/// Worker object for performing CFG-based warnings.
sema::AnalysisBasedWarnings AnalysisWarnings;
threadSafety::BeforeSet *ThreadSafetyDeclCache;
/// An entity for which implicit template instantiation is required.
///
/// The source location associated with the declaration is the first place in
/// the source code where the declaration was "used". It is not necessarily
/// the point of instantiation (which will be either before or after the
/// namespace-scope declaration that triggered this implicit instantiation),
/// However, it is the location that diagnostics should generally refer to,
/// because users will need to know what code triggered the instantiation.
typedef std::pair<ValueDecl *, SourceLocation> PendingImplicitInstantiation;
/// The queue of implicit template instantiations that are required
/// but have not yet been performed.
std::deque<PendingImplicitInstantiation> PendingInstantiations;
/// Queue of implicit template instantiations that cannot be performed
/// eagerly.
SmallVector<PendingImplicitInstantiation, 1> LateParsedInstantiations;
class GlobalEagerInstantiationScope {
public:
GlobalEagerInstantiationScope(Sema &S, bool Enabled)
: S(S), Enabled(Enabled) {
if (!Enabled) return;
SavedPendingInstantiations.swap(S.PendingInstantiations);
SavedVTableUses.swap(S.VTableUses);
}
void perform() {
if (Enabled) {
S.DefineUsedVTables();
S.PerformPendingInstantiations();
}
}
~GlobalEagerInstantiationScope() {
if (!Enabled) return;
// Restore the set of pending vtables.
assert(S.VTableUses.empty() &&
"VTableUses should be empty before it is discarded.");
S.VTableUses.swap(SavedVTableUses);
// Restore the set of pending implicit instantiations.
assert(S.PendingInstantiations.empty() &&
"PendingInstantiations should be empty before it is discarded.");
S.PendingInstantiations.swap(SavedPendingInstantiations);
}
private:
Sema &S;
SmallVector<VTableUse, 16> SavedVTableUses;
std::deque<PendingImplicitInstantiation> SavedPendingInstantiations;
bool Enabled;
};
/// The queue of implicit template instantiations that are required
/// and must be performed within the current local scope.
///
/// This queue is only used for member functions of local classes in
/// templates, which must be instantiated in the same scope as their
/// enclosing function, so that they can reference function-local
/// types, static variables, enumerators, etc.
std::deque<PendingImplicitInstantiation> PendingLocalImplicitInstantiations;
class LocalEagerInstantiationScope {
public:
LocalEagerInstantiationScope(Sema &S) : S(S) {
SavedPendingLocalImplicitInstantiations.swap(
S.PendingLocalImplicitInstantiations);
}
void perform() { S.PerformPendingInstantiations(/*LocalOnly=*/true); }
~LocalEagerInstantiationScope() {
assert(S.PendingLocalImplicitInstantiations.empty() &&
"there shouldn't be any pending local implicit instantiations");
SavedPendingLocalImplicitInstantiations.swap(
S.PendingLocalImplicitInstantiations);
}
private:
Sema &S;
std::deque<PendingImplicitInstantiation>
SavedPendingLocalImplicitInstantiations;
};
/// A helper class for building up ExtParameterInfos.
class ExtParameterInfoBuilder {
SmallVector<FunctionProtoType::ExtParameterInfo, 16> Infos;
bool HasInteresting = false;
public:
/// Set the ExtParameterInfo for the parameter at the given index,
///
void set(unsigned index, FunctionProtoType::ExtParameterInfo info) {
assert(Infos.size() <= index);
Infos.resize(index);
Infos.push_back(info);
if (!HasInteresting)
HasInteresting = (info != FunctionProtoType::ExtParameterInfo());
}
/// Return a pointer (suitable for setting in an ExtProtoInfo) to the
/// ExtParameterInfo array we've built up.
const FunctionProtoType::ExtParameterInfo *
getPointerOrNull(unsigned numParams) {
if (!HasInteresting) return nullptr;
Infos.resize(numParams);
return Infos.data();
}
};
void PerformPendingInstantiations(bool LocalOnly = false);
TypeSourceInfo *SubstType(TypeSourceInfo *T,
const MultiLevelTemplateArgumentList &TemplateArgs,
SourceLocation Loc, DeclarationName Entity,
bool AllowDeducedTST = false);
QualType SubstType(QualType T,
const MultiLevelTemplateArgumentList &TemplateArgs,
SourceLocation Loc, DeclarationName Entity);
TypeSourceInfo *SubstType(TypeLoc TL,
const MultiLevelTemplateArgumentList &TemplateArgs,
SourceLocation Loc, DeclarationName Entity);
TypeSourceInfo *SubstFunctionDeclType(TypeSourceInfo *T,
const MultiLevelTemplateArgumentList &TemplateArgs,
SourceLocation Loc,
DeclarationName Entity,
CXXRecordDecl *ThisContext,
Qualifiers ThisTypeQuals);
void SubstExceptionSpec(FunctionDecl *New, const FunctionProtoType *Proto,
const MultiLevelTemplateArgumentList &Args);
bool SubstExceptionSpec(SourceLocation Loc,
FunctionProtoType::ExceptionSpecInfo &ESI,
SmallVectorImpl<QualType> &ExceptionStorage,
const MultiLevelTemplateArgumentList &Args);
ParmVarDecl *SubstParmVarDecl(ParmVarDecl *D,
const MultiLevelTemplateArgumentList &TemplateArgs,
int indexAdjustment,
Optional<unsigned> NumExpansions,
bool ExpectParameterPack);
bool SubstParmTypes(SourceLocation Loc, ArrayRef<ParmVarDecl *> Params,
const FunctionProtoType::ExtParameterInfo *ExtParamInfos,
const MultiLevelTemplateArgumentList &TemplateArgs,
SmallVectorImpl<QualType> &ParamTypes,
SmallVectorImpl<ParmVarDecl *> *OutParams,
ExtParameterInfoBuilder &ParamInfos);
ExprResult SubstExpr(Expr *E,
const MultiLevelTemplateArgumentList &TemplateArgs);
/// Substitute the given template arguments into a list of
/// expressions, expanding pack expansions if required.
///
/// \param Exprs The list of expressions to substitute into.
///
/// \param IsCall Whether this is some form of call, in which case
/// default arguments will be dropped.
///
/// \param TemplateArgs The set of template arguments to substitute.
///
/// \param Outputs Will receive all of the substituted arguments.
///
/// \returns true if an error occurred, false otherwise.
bool SubstExprs(ArrayRef<Expr *> Exprs, bool IsCall,
const MultiLevelTemplateArgumentList &TemplateArgs,
SmallVectorImpl<Expr *> &Outputs);
StmtResult SubstStmt(Stmt *S,
const MultiLevelTemplateArgumentList &TemplateArgs);
TemplateParameterList *
SubstTemplateParams(TemplateParameterList *Params, DeclContext *Owner,
const MultiLevelTemplateArgumentList &TemplateArgs);
Decl *SubstDecl(Decl *D, DeclContext *Owner,
const MultiLevelTemplateArgumentList &TemplateArgs);
ExprResult SubstInitializer(Expr *E,
const MultiLevelTemplateArgumentList &TemplateArgs,
bool CXXDirectInit);
bool
SubstBaseSpecifiers(CXXRecordDecl *Instantiation,
CXXRecordDecl *Pattern,
const MultiLevelTemplateArgumentList &TemplateArgs);
bool
InstantiateClass(SourceLocation PointOfInstantiation,
CXXRecordDecl *Instantiation, CXXRecordDecl *Pattern,
const MultiLevelTemplateArgumentList &TemplateArgs,
TemplateSpecializationKind TSK,
bool Complain = true);
bool InstantiateEnum(SourceLocation PointOfInstantiation,
EnumDecl *Instantiation, EnumDecl *Pattern,
const MultiLevelTemplateArgumentList &TemplateArgs,
TemplateSpecializationKind TSK);
bool InstantiateInClassInitializer(
SourceLocation PointOfInstantiation, FieldDecl *Instantiation,
FieldDecl *Pattern, const MultiLevelTemplateArgumentList &TemplateArgs);
struct LateInstantiatedAttribute {
const Attr *TmplAttr;
LocalInstantiationScope *Scope;
Decl *NewDecl;
LateInstantiatedAttribute(const Attr *A, LocalInstantiationScope *S,
Decl *D)
: TmplAttr(A), Scope(S), NewDecl(D)
{ }
};
typedef SmallVector<LateInstantiatedAttribute, 16> LateInstantiatedAttrVec;
void InstantiateAttrs(const MultiLevelTemplateArgumentList &TemplateArgs,
const Decl *Pattern, Decl *Inst,
LateInstantiatedAttrVec *LateAttrs = nullptr,
LocalInstantiationScope *OuterMostScope = nullptr);
void
InstantiateAttrsForDecl(const MultiLevelTemplateArgumentList &TemplateArgs,
const Decl *Pattern, Decl *Inst,
LateInstantiatedAttrVec *LateAttrs = nullptr,
LocalInstantiationScope *OuterMostScope = nullptr);
bool usesPartialOrExplicitSpecialization(
SourceLocation Loc, ClassTemplateSpecializationDecl *ClassTemplateSpec);
bool
InstantiateClassTemplateSpecialization(SourceLocation PointOfInstantiation,
ClassTemplateSpecializationDecl *ClassTemplateSpec,
TemplateSpecializationKind TSK,
bool Complain = true);
void InstantiateClassMembers(SourceLocation PointOfInstantiation,
CXXRecordDecl *Instantiation,
const MultiLevelTemplateArgumentList &TemplateArgs,
TemplateSpecializationKind TSK);
void InstantiateClassTemplateSpecializationMembers(
SourceLocation PointOfInstantiation,
ClassTemplateSpecializationDecl *ClassTemplateSpec,
TemplateSpecializationKind TSK);
NestedNameSpecifierLoc
SubstNestedNameSpecifierLoc(NestedNameSpecifierLoc NNS,
const MultiLevelTemplateArgumentList &TemplateArgs);
DeclarationNameInfo
SubstDeclarationNameInfo(const DeclarationNameInfo &NameInfo,
const MultiLevelTemplateArgumentList &TemplateArgs);
TemplateName
SubstTemplateName(NestedNameSpecifierLoc QualifierLoc, TemplateName Name,
SourceLocation Loc,
const MultiLevelTemplateArgumentList &TemplateArgs);
bool Subst(const TemplateArgumentLoc *Args, unsigned NumArgs,
TemplateArgumentListInfo &Result,
const MultiLevelTemplateArgumentList &TemplateArgs);
void InstantiateExceptionSpec(SourceLocation PointOfInstantiation,
FunctionDecl *Function);
FunctionDecl *InstantiateFunctionDeclaration(FunctionTemplateDecl *FTD,
const TemplateArgumentList *Args,
SourceLocation Loc);
void InstantiateFunctionDefinition(SourceLocation PointOfInstantiation,
FunctionDecl *Function,
bool Recursive = false,
bool DefinitionRequired = false,
bool AtEndOfTU = false);
VarTemplateSpecializationDecl *BuildVarTemplateInstantiation(
VarTemplateDecl *VarTemplate, VarDecl *FromVar,
const TemplateArgumentList &TemplateArgList,
const TemplateArgumentListInfo &TemplateArgsInfo,
SmallVectorImpl<TemplateArgument> &Converted,
SourceLocation PointOfInstantiation, void *InsertPos,
LateInstantiatedAttrVec *LateAttrs = nullptr,
LocalInstantiationScope *StartingScope = nullptr);
VarTemplateSpecializationDecl *CompleteVarTemplateSpecializationDecl(
VarTemplateSpecializationDecl *VarSpec, VarDecl *PatternDecl,
const MultiLevelTemplateArgumentList &TemplateArgs);
void
BuildVariableInstantiation(VarDecl *NewVar, VarDecl *OldVar,
const MultiLevelTemplateArgumentList &TemplateArgs,
LateInstantiatedAttrVec *LateAttrs,
DeclContext *Owner,
LocalInstantiationScope *StartingScope,
bool InstantiatingVarTemplate = false,
VarTemplateSpecializationDecl *PrevVTSD = nullptr);
VarDecl *getVarTemplateSpecialization(
VarTemplateDecl *VarTempl, const TemplateArgumentListInfo *TemplateArgs,
const DeclarationNameInfo &MemberNameInfo, SourceLocation TemplateKWLoc);
void InstantiateVariableInitializer(
VarDecl *Var, VarDecl *OldVar,
const MultiLevelTemplateArgumentList &TemplateArgs);
void InstantiateVariableDefinition(SourceLocation PointOfInstantiation,
VarDecl *Var, bool Recursive = false,
bool DefinitionRequired = false,
bool AtEndOfTU = false);
void InstantiateMemInitializers(CXXConstructorDecl *New,
const CXXConstructorDecl *Tmpl,
const MultiLevelTemplateArgumentList &TemplateArgs);
NamedDecl *FindInstantiatedDecl(SourceLocation Loc, NamedDecl *D,
const MultiLevelTemplateArgumentList &TemplateArgs,
bool FindingInstantiatedContext = false);
DeclContext *FindInstantiatedContext(SourceLocation Loc, DeclContext *DC,
const MultiLevelTemplateArgumentList &TemplateArgs);
// Objective-C declarations.
enum ObjCContainerKind {
OCK_None = -1,
OCK_Interface = 0,
OCK_Protocol,
OCK_Category,
OCK_ClassExtension,
OCK_Implementation,
OCK_CategoryImplementation
};
ObjCContainerKind getObjCContainerKind() const;
DeclResult actOnObjCTypeParam(Scope *S,
ObjCTypeParamVariance variance,
SourceLocation varianceLoc,
unsigned index,
IdentifierInfo *paramName,
SourceLocation paramLoc,
SourceLocation colonLoc,
ParsedType typeBound);
ObjCTypeParamList *actOnObjCTypeParamList(Scope *S, SourceLocation lAngleLoc,
ArrayRef<Decl *> typeParams,
SourceLocation rAngleLoc);
void popObjCTypeParamList(Scope *S, ObjCTypeParamList *typeParamList);
Decl *ActOnStartClassInterface(
Scope *S, SourceLocation AtInterfaceLoc, IdentifierInfo *ClassName,
SourceLocation ClassLoc, ObjCTypeParamList *typeParamList,
IdentifierInfo *SuperName, SourceLocation SuperLoc,
ArrayRef<ParsedType> SuperTypeArgs, SourceRange SuperTypeArgsRange,
Decl *const *ProtoRefs, unsigned NumProtoRefs,
const SourceLocation *ProtoLocs, SourceLocation EndProtoLoc,
const ParsedAttributesView &AttrList);
void ActOnSuperClassOfClassInterface(Scope *S,
SourceLocation AtInterfaceLoc,
ObjCInterfaceDecl *IDecl,
IdentifierInfo *ClassName,
SourceLocation ClassLoc,
IdentifierInfo *SuperName,
SourceLocation SuperLoc,
ArrayRef<ParsedType> SuperTypeArgs,
SourceRange SuperTypeArgsRange);
void ActOnTypedefedProtocols(SmallVectorImpl<Decl *> &ProtocolRefs,
SmallVectorImpl<SourceLocation> &ProtocolLocs,
IdentifierInfo *SuperName,
SourceLocation SuperLoc);
Decl *ActOnCompatibilityAlias(
SourceLocation AtCompatibilityAliasLoc,
IdentifierInfo *AliasName, SourceLocation AliasLocation,
IdentifierInfo *ClassName, SourceLocation ClassLocation);
bool CheckForwardProtocolDeclarationForCircularDependency(
IdentifierInfo *PName,
SourceLocation &PLoc, SourceLocation PrevLoc,
const ObjCList<ObjCProtocolDecl> &PList);
Decl *ActOnStartProtocolInterface(
SourceLocation AtProtoInterfaceLoc, IdentifierInfo *ProtocolName,
SourceLocation ProtocolLoc, Decl *const *ProtoRefNames,
unsigned NumProtoRefs, const SourceLocation *ProtoLocs,
SourceLocation EndProtoLoc, const ParsedAttributesView &AttrList);
Decl *ActOnStartCategoryInterface(
SourceLocation AtInterfaceLoc, IdentifierInfo *ClassName,
SourceLocation ClassLoc, ObjCTypeParamList *typeParamList,
IdentifierInfo *CategoryName, SourceLocation CategoryLoc,
Decl *const *ProtoRefs, unsigned NumProtoRefs,
const SourceLocation *ProtoLocs, SourceLocation EndProtoLoc,
const ParsedAttributesView &AttrList);
Decl *ActOnStartClassImplementation(SourceLocation AtClassImplLoc,
IdentifierInfo *ClassName,
SourceLocation ClassLoc,
IdentifierInfo *SuperClassname,
SourceLocation SuperClassLoc,
const ParsedAttributesView &AttrList);
Decl *ActOnStartCategoryImplementation(SourceLocation AtCatImplLoc,
IdentifierInfo *ClassName,
SourceLocation ClassLoc,
IdentifierInfo *CatName,
SourceLocation CatLoc,
const ParsedAttributesView &AttrList);
DeclGroupPtrTy ActOnFinishObjCImplementation(Decl *ObjCImpDecl,
ArrayRef<Decl *> Decls);
DeclGroupPtrTy ActOnForwardClassDeclaration(SourceLocation Loc,
IdentifierInfo **IdentList,
SourceLocation *IdentLocs,
ArrayRef<ObjCTypeParamList *> TypeParamLists,
unsigned NumElts);
DeclGroupPtrTy
ActOnForwardProtocolDeclaration(SourceLocation AtProtoclLoc,
ArrayRef<IdentifierLocPair> IdentList,
const ParsedAttributesView &attrList);
void FindProtocolDeclaration(bool WarnOnDeclarations, bool ForObjCContainer,
ArrayRef<IdentifierLocPair> ProtocolId,
SmallVectorImpl<Decl *> &Protocols);
void DiagnoseTypeArgsAndProtocols(IdentifierInfo *ProtocolId,
SourceLocation ProtocolLoc,
IdentifierInfo *TypeArgId,
SourceLocation TypeArgLoc,
bool SelectProtocolFirst = false);
/// Given a list of identifiers (and their locations), resolve the
/// names to either Objective-C protocol qualifiers or type
/// arguments, as appropriate.
void actOnObjCTypeArgsOrProtocolQualifiers(
Scope *S,
ParsedType baseType,
SourceLocation lAngleLoc,
ArrayRef<IdentifierInfo *> identifiers,
ArrayRef<SourceLocation> identifierLocs,
SourceLocation rAngleLoc,
SourceLocation &typeArgsLAngleLoc,
SmallVectorImpl<ParsedType> &typeArgs,
SourceLocation &typeArgsRAngleLoc,
SourceLocation &protocolLAngleLoc,
SmallVectorImpl<Decl *> &protocols,
SourceLocation &protocolRAngleLoc,
bool warnOnIncompleteProtocols);
/// Build a an Objective-C protocol-qualified 'id' type where no
/// base type was specified.
TypeResult actOnObjCProtocolQualifierType(
SourceLocation lAngleLoc,
ArrayRef<Decl *> protocols,
ArrayRef<SourceLocation> protocolLocs,
SourceLocation rAngleLoc);
/// Build a specialized and/or protocol-qualified Objective-C type.
TypeResult actOnObjCTypeArgsAndProtocolQualifiers(
Scope *S,
SourceLocation Loc,
ParsedType BaseType,
SourceLocation TypeArgsLAngleLoc,
ArrayRef<ParsedType> TypeArgs,
SourceLocation TypeArgsRAngleLoc,
SourceLocation ProtocolLAngleLoc,
ArrayRef<Decl *> Protocols,
ArrayRef<SourceLocation> ProtocolLocs,
SourceLocation ProtocolRAngleLoc);
/// Build an Objective-C type parameter type.
QualType BuildObjCTypeParamType(const ObjCTypeParamDecl *Decl,
SourceLocation ProtocolLAngleLoc,
ArrayRef<ObjCProtocolDecl *> Protocols,
ArrayRef<SourceLocation> ProtocolLocs,
SourceLocation ProtocolRAngleLoc,
bool FailOnError = false);
/// Build an Objective-C object pointer type.
QualType BuildObjCObjectType(QualType BaseType,
SourceLocation Loc,
SourceLocation TypeArgsLAngleLoc,
ArrayRef<TypeSourceInfo *> TypeArgs,
SourceLocation TypeArgsRAngleLoc,
SourceLocation ProtocolLAngleLoc,
ArrayRef<ObjCProtocolDecl *> Protocols,
ArrayRef<SourceLocation> ProtocolLocs,
SourceLocation ProtocolRAngleLoc,
bool FailOnError = false);
/// Ensure attributes are consistent with type.
/// \param [in, out] Attributes The attributes to check; they will
/// be modified to be consistent with \p PropertyTy.
void CheckObjCPropertyAttributes(Decl *PropertyPtrTy,
SourceLocation Loc,
unsigned &Attributes,
bool propertyInPrimaryClass);
/// Process the specified property declaration and create decls for the
/// setters and getters as needed.
/// \param property The property declaration being processed
void ProcessPropertyDecl(ObjCPropertyDecl *property);
void DiagnosePropertyMismatch(ObjCPropertyDecl *Property,
ObjCPropertyDecl *SuperProperty,
const IdentifierInfo *Name,
bool OverridingProtocolProperty);
void DiagnoseClassExtensionDupMethods(ObjCCategoryDecl *CAT,
ObjCInterfaceDecl *ID);
Decl *ActOnAtEnd(Scope *S, SourceRange AtEnd,
ArrayRef<Decl *> allMethods = None,
ArrayRef<DeclGroupPtrTy> allTUVars = None);
Decl *ActOnProperty(Scope *S, SourceLocation AtLoc,
SourceLocation LParenLoc,
FieldDeclarator &FD, ObjCDeclSpec &ODS,
Selector GetterSel, Selector SetterSel,
tok::ObjCKeywordKind MethodImplKind,
DeclContext *lexicalDC = nullptr);
Decl *ActOnPropertyImplDecl(Scope *S,
SourceLocation AtLoc,
SourceLocation PropertyLoc,
bool ImplKind,
IdentifierInfo *PropertyId,
IdentifierInfo *PropertyIvar,
SourceLocation PropertyIvarLoc,
ObjCPropertyQueryKind QueryKind);
enum ObjCSpecialMethodKind {
OSMK_None,
OSMK_Alloc,
OSMK_New,
OSMK_Copy,
OSMK_RetainingInit,
OSMK_NonRetainingInit
};
struct ObjCArgInfo {
IdentifierInfo *Name;
SourceLocation NameLoc;
// The Type is null if no type was specified, and the DeclSpec is invalid
// in this case.
ParsedType Type;
ObjCDeclSpec DeclSpec;
/// ArgAttrs - Attribute list for this argument.
ParsedAttributesView ArgAttrs;
};
Decl *ActOnMethodDeclaration(
Scope *S,
SourceLocation BeginLoc, // location of the + or -.
SourceLocation EndLoc, // location of the ; or {.
tok::TokenKind MethodType, ObjCDeclSpec &ReturnQT, ParsedType ReturnType,
ArrayRef<SourceLocation> SelectorLocs, Selector Sel,
// optional arguments. The number of types/arguments is obtained
// from the Sel.getNumArgs().
ObjCArgInfo *ArgInfo, DeclaratorChunk::ParamInfo *CParamInfo,
unsigned CNumArgs, // c-style args
const ParsedAttributesView &AttrList, tok::ObjCKeywordKind MethodImplKind,
bool isVariadic, bool MethodDefinition);
ObjCMethodDecl *LookupMethodInQualifiedType(Selector Sel,
const ObjCObjectPointerType *OPT,
bool IsInstance);
ObjCMethodDecl *LookupMethodInObjectType(Selector Sel, QualType Ty,
bool IsInstance);
bool CheckARCMethodDecl(ObjCMethodDecl *method);
bool inferObjCARCLifetime(ValueDecl *decl);
ExprResult
HandleExprPropertyRefExpr(const ObjCObjectPointerType *OPT,
Expr *BaseExpr,
SourceLocation OpLoc,
DeclarationName MemberName,
SourceLocation MemberLoc,
SourceLocation SuperLoc, QualType SuperType,
bool Super);
ExprResult
ActOnClassPropertyRefExpr(IdentifierInfo &receiverName,
IdentifierInfo &propertyName,
SourceLocation receiverNameLoc,
SourceLocation propertyNameLoc);
ObjCMethodDecl *tryCaptureObjCSelf(SourceLocation Loc);
/// Describes the kind of message expression indicated by a message
/// send that starts with an identifier.
enum ObjCMessageKind {
/// The message is sent to 'super'.
ObjCSuperMessage,
/// The message is an instance message.
ObjCInstanceMessage,
/// The message is a class message, and the identifier is a type
/// name.
ObjCClassMessage
};
ObjCMessageKind getObjCMessageKind(Scope *S,
IdentifierInfo *Name,
SourceLocation NameLoc,
bool IsSuper,
bool HasTrailingDot,
ParsedType &ReceiverType);
ExprResult ActOnSuperMessage(Scope *S, SourceLocation SuperLoc,
Selector Sel,
SourceLocation LBracLoc,
ArrayRef<SourceLocation> SelectorLocs,
SourceLocation RBracLoc,
MultiExprArg Args);
ExprResult BuildClassMessage(TypeSourceInfo *ReceiverTypeInfo,
QualType ReceiverType,
SourceLocation SuperLoc,
Selector Sel,
ObjCMethodDecl *Method,
SourceLocation LBracLoc,
ArrayRef<SourceLocation> SelectorLocs,
SourceLocation RBracLoc,
MultiExprArg Args,
bool isImplicit = false);
ExprResult BuildClassMessageImplicit(QualType ReceiverType,
bool isSuperReceiver,
SourceLocation Loc,
Selector Sel,
ObjCMethodDecl *Method,
MultiExprArg Args);
ExprResult ActOnClassMessage(Scope *S,
ParsedType Receiver,
Selector Sel,
SourceLocation LBracLoc,
ArrayRef<SourceLocation> SelectorLocs,
SourceLocation RBracLoc,
MultiExprArg Args);
ExprResult BuildInstanceMessage(Expr *Receiver,
QualType ReceiverType,
SourceLocation SuperLoc,
Selector Sel,
ObjCMethodDecl *Method,
SourceLocation LBracLoc,
ArrayRef<SourceLocation> SelectorLocs,
SourceLocation RBracLoc,
MultiExprArg Args,
bool isImplicit = false);
ExprResult BuildInstanceMessageImplicit(Expr *Receiver,
QualType ReceiverType,
SourceLocation Loc,
Selector Sel,
ObjCMethodDecl *Method,
MultiExprArg Args);
ExprResult ActOnInstanceMessage(Scope *S,
Expr *Receiver,
Selector Sel,
SourceLocation LBracLoc,
ArrayRef<SourceLocation> SelectorLocs,
SourceLocation RBracLoc,
MultiExprArg Args);
ExprResult BuildObjCBridgedCast(SourceLocation LParenLoc,
ObjCBridgeCastKind Kind,
SourceLocation BridgeKeywordLoc,
TypeSourceInfo *TSInfo,
Expr *SubExpr);
ExprResult ActOnObjCBridgedCast(Scope *S,
SourceLocation LParenLoc,
ObjCBridgeCastKind Kind,
SourceLocation BridgeKeywordLoc,
ParsedType Type,
SourceLocation RParenLoc,
Expr *SubExpr);
void CheckTollFreeBridgeCast(QualType castType, Expr *castExpr);
void CheckObjCBridgeRelatedCast(QualType castType, Expr *castExpr);
bool CheckTollFreeBridgeStaticCast(QualType castType, Expr *castExpr,
CastKind &Kind);
bool checkObjCBridgeRelatedComponents(SourceLocation Loc,
QualType DestType, QualType SrcType,
ObjCInterfaceDecl *&RelatedClass,
ObjCMethodDecl *&ClassMethod,
ObjCMethodDecl *&InstanceMethod,
TypedefNameDecl *&TDNDecl,
bool CfToNs, bool Diagnose = true);
bool CheckObjCBridgeRelatedConversions(SourceLocation Loc,
QualType DestType, QualType SrcType,
Expr *&SrcExpr, bool Diagnose = true);
bool ConversionToObjCStringLiteralCheck(QualType DstType, Expr *&SrcExpr,
bool Diagnose = true);
bool checkInitMethod(ObjCMethodDecl *method, QualType receiverTypeIfCall);
/// Check whether the given new method is a valid override of the
/// given overridden method, and set any properties that should be inherited.
void CheckObjCMethodOverride(ObjCMethodDecl *NewMethod,
const ObjCMethodDecl *Overridden);
/// Describes the compatibility of a result type with its method.
enum ResultTypeCompatibilityKind {
RTC_Compatible,
RTC_Incompatible,
RTC_Unknown
};
/// Check whether the declared result type of the given Objective-C
/// method declaration is compatible with the method's class.
ResultTypeCompatibilityKind
checkRelatedResultTypeCompatibility(const ObjCMethodDecl *Method,
const ObjCInterfaceDecl *CurrentClass);
void CheckObjCMethodOverrides(ObjCMethodDecl *ObjCMethod,
ObjCInterfaceDecl *CurrentClass,
ResultTypeCompatibilityKind RTC);
enum PragmaOptionsAlignKind {
POAK_Native, // #pragma options align=native
POAK_Natural, // #pragma options align=natural
POAK_Packed, // #pragma options align=packed
POAK_Power, // #pragma options align=power
POAK_Mac68k, // #pragma options align=mac68k
POAK_Reset // #pragma options align=reset
};
/// ActOnPragmaClangSection - Called on well formed \#pragma clang section
void ActOnPragmaClangSection(SourceLocation PragmaLoc,
PragmaClangSectionAction Action,
PragmaClangSectionKind SecKind, StringRef SecName);
/// ActOnPragmaOptionsAlign - Called on well formed \#pragma options align.
void ActOnPragmaOptionsAlign(PragmaOptionsAlignKind Kind,
SourceLocation PragmaLoc);
/// ActOnPragmaPack - Called on well formed \#pragma pack(...).
void ActOnPragmaPack(SourceLocation PragmaLoc, PragmaMsStackAction Action,
StringRef SlotLabel, Expr *Alignment);
enum class PragmaPackDiagnoseKind {
NonDefaultStateAtInclude,
ChangedStateAtExit
};
void DiagnoseNonDefaultPragmaPack(PragmaPackDiagnoseKind Kind,
SourceLocation IncludeLoc);
void DiagnoseUnterminatedPragmaPack();
/// ActOnPragmaMSStruct - Called on well formed \#pragma ms_struct [on|off].
void ActOnPragmaMSStruct(PragmaMSStructKind Kind);
/// ActOnPragmaMSComment - Called on well formed
/// \#pragma comment(kind, "arg").
void ActOnPragmaMSComment(SourceLocation CommentLoc, PragmaMSCommentKind Kind,
StringRef Arg);
/// ActOnPragmaMSPointersToMembers - called on well formed \#pragma
/// pointers_to_members(representation method[, general purpose
/// representation]).
void ActOnPragmaMSPointersToMembers(
LangOptions::PragmaMSPointersToMembersKind Kind,
SourceLocation PragmaLoc);
/// Called on well formed \#pragma vtordisp().
void ActOnPragmaMSVtorDisp(PragmaMsStackAction Action,
SourceLocation PragmaLoc,
MSVtorDispAttr::Mode Value);
enum PragmaSectionKind {
PSK_DataSeg,
PSK_BSSSeg,
PSK_ConstSeg,
PSK_CodeSeg,
};
bool UnifySection(StringRef SectionName,
int SectionFlags,
DeclaratorDecl *TheDecl);
bool UnifySection(StringRef SectionName,
int SectionFlags,
SourceLocation PragmaSectionLocation);
/// Called on well formed \#pragma bss_seg/data_seg/const_seg/code_seg.
void ActOnPragmaMSSeg(SourceLocation PragmaLocation,
PragmaMsStackAction Action,
llvm::StringRef StackSlotLabel,
StringLiteral *SegmentName,
llvm::StringRef PragmaName);
/// Called on well formed \#pragma section().
void ActOnPragmaMSSection(SourceLocation PragmaLocation,
int SectionFlags, StringLiteral *SegmentName);
/// Called on well-formed \#pragma init_seg().
void ActOnPragmaMSInitSeg(SourceLocation PragmaLocation,
StringLiteral *SegmentName);
/// Called on #pragma clang __debug dump II
void ActOnPragmaDump(Scope *S, SourceLocation Loc, IdentifierInfo *II);
/// ActOnPragmaDetectMismatch - Call on well-formed \#pragma detect_mismatch
void ActOnPragmaDetectMismatch(SourceLocation Loc, StringRef Name,
StringRef Value);
/// ActOnPragmaUnused - Called on well-formed '\#pragma unused'.
void ActOnPragmaUnused(const Token &Identifier,
Scope *curScope,
SourceLocation PragmaLoc);
/// ActOnPragmaVisibility - Called on well formed \#pragma GCC visibility... .
void ActOnPragmaVisibility(const IdentifierInfo* VisType,
SourceLocation PragmaLoc);
NamedDecl *DeclClonePragmaWeak(NamedDecl *ND, IdentifierInfo *II,
SourceLocation Loc);
void DeclApplyPragmaWeak(Scope *S, NamedDecl *ND, WeakInfo &W);
/// ActOnPragmaWeakID - Called on well formed \#pragma weak ident.
void ActOnPragmaWeakID(IdentifierInfo* WeakName,
SourceLocation PragmaLoc,
SourceLocation WeakNameLoc);
/// ActOnPragmaRedefineExtname - Called on well formed
/// \#pragma redefine_extname oldname newname.
void ActOnPragmaRedefineExtname(IdentifierInfo* WeakName,
IdentifierInfo* AliasName,
SourceLocation PragmaLoc,
SourceLocation WeakNameLoc,
SourceLocation AliasNameLoc);
/// ActOnPragmaWeakAlias - Called on well formed \#pragma weak ident = ident.
void ActOnPragmaWeakAlias(IdentifierInfo* WeakName,
IdentifierInfo* AliasName,
SourceLocation PragmaLoc,
SourceLocation WeakNameLoc,
SourceLocation AliasNameLoc);
/// ActOnPragmaFPContract - Called on well formed
/// \#pragma {STDC,OPENCL} FP_CONTRACT and
/// \#pragma clang fp contract
void ActOnPragmaFPContract(LangOptions::FPContractModeKind FPC);
/// ActOnPragmaFenvAccess - Called on well formed
/// \#pragma STDC FENV_ACCESS
void ActOnPragmaFEnvAccess(LangOptions::FEnvAccessModeKind FPC);
/// AddAlignmentAttributesForRecord - Adds any needed alignment attributes to
/// a the record decl, to handle '\#pragma pack' and '\#pragma options align'.
void AddAlignmentAttributesForRecord(RecordDecl *RD);
/// AddMsStructLayoutForRecord - Adds ms_struct layout attribute to record.
void AddMsStructLayoutForRecord(RecordDecl *RD);
/// FreePackedContext - Deallocate and null out PackContext.
void FreePackedContext();
/// PushNamespaceVisibilityAttr - Note that we've entered a
/// namespace with a visibility attribute.
void PushNamespaceVisibilityAttr(const VisibilityAttr *Attr,
SourceLocation Loc);
/// AddPushedVisibilityAttribute - If '\#pragma GCC visibility' was used,
/// add an appropriate visibility attribute.
void AddPushedVisibilityAttribute(Decl *RD);
/// PopPragmaVisibility - Pop the top element of the visibility stack; used
/// for '\#pragma GCC visibility' and visibility attributes on namespaces.
void PopPragmaVisibility(bool IsNamespaceEnd, SourceLocation EndLoc);
/// FreeVisContext - Deallocate and null out VisContext.
void FreeVisContext();
/// AddCFAuditedAttribute - Check whether we're currently within
/// '\#pragma clang arc_cf_code_audited' and, if so, consider adding
/// the appropriate attribute.
void AddCFAuditedAttribute(Decl *D);
void ActOnPragmaAttributeAttribute(ParsedAttr &Attribute,
SourceLocation PragmaLoc,
attr::ParsedSubjectMatchRuleSet Rules);
void ActOnPragmaAttributeEmptyPush(SourceLocation PragmaLoc,
const IdentifierInfo *Namespace);
/// Called on well-formed '\#pragma clang attribute pop'.
void ActOnPragmaAttributePop(SourceLocation PragmaLoc,
const IdentifierInfo *Namespace);
/// Adds the attributes that have been specified using the
/// '\#pragma clang attribute push' directives to the given declaration.
void AddPragmaAttributes(Scope *S, Decl *D);
void DiagnoseUnterminatedPragmaAttribute();
/// Called on well formed \#pragma clang optimize.
void ActOnPragmaOptimize(bool On, SourceLocation PragmaLoc);
/// Get the location for the currently active "\#pragma clang optimize
/// off". If this location is invalid, then the state of the pragma is "on".
SourceLocation getOptimizeOffPragmaLocation() const {
return OptimizeOffPragmaLocation;
}
/// Only called on function definitions; if there is a pragma in scope
/// with the effect of a range-based optnone, consider marking the function
/// with attribute optnone.
void AddRangeBasedOptnone(FunctionDecl *FD);
/// Adds the 'optnone' attribute to the function declaration if there
/// are no conflicts; Loc represents the location causing the 'optnone'
/// attribute to be added (usually because of a pragma).
void AddOptnoneAttributeIfNoConflicts(FunctionDecl *FD, SourceLocation Loc);
/// AddAlignedAttr - Adds an aligned attribute to a particular declaration.
void AddAlignedAttr(Decl *D, const AttributeCommonInfo &CI, Expr *E,
bool IsPackExpansion);
void AddAlignedAttr(Decl *D, const AttributeCommonInfo &CI, TypeSourceInfo *T,
bool IsPackExpansion);
/// AddAssumeAlignedAttr - Adds an assume_aligned attribute to a particular
/// declaration.
void AddAssumeAlignedAttr(Decl *D, const AttributeCommonInfo &CI, Expr *E,
Expr *OE);
/// AddAllocAlignAttr - Adds an alloc_align attribute to a particular
/// declaration.
void AddAllocAlignAttr(Decl *D, const AttributeCommonInfo &CI,
Expr *ParamExpr);
/// AddAlignValueAttr - Adds an align_value attribute to a particular
/// declaration.
void AddAlignValueAttr(Decl *D, const AttributeCommonInfo &CI, Expr *E);
/// AddLaunchBoundsAttr - Adds a launch_bounds attribute to a particular
/// declaration.
void AddLaunchBoundsAttr(Decl *D, const AttributeCommonInfo &CI,
Expr *MaxThreads, Expr *MinBlocks);
/// AddModeAttr - Adds a mode attribute to a particular declaration.
void AddModeAttr(Decl *D, const AttributeCommonInfo &CI, IdentifierInfo *Name,
bool InInstantiation = false);
void AddParameterABIAttr(Decl *D, const AttributeCommonInfo &CI,
ParameterABI ABI);
enum class RetainOwnershipKind {NS, CF, OS};
void AddXConsumedAttr(Decl *D, const AttributeCommonInfo &CI,
RetainOwnershipKind K, bool IsTemplateInstantiation);
/// addAMDGPUFlatWorkGroupSizeAttr - Adds an amdgpu_flat_work_group_size
/// attribute to a particular declaration.
void addAMDGPUFlatWorkGroupSizeAttr(Decl *D, const AttributeCommonInfo &CI,
Expr *Min, Expr *Max);
/// addAMDGPUWavePersEUAttr - Adds an amdgpu_waves_per_eu attribute to a
/// particular declaration.
void addAMDGPUWavesPerEUAttr(Decl *D, const AttributeCommonInfo &CI,
Expr *Min, Expr *Max);
bool checkNSReturnsRetainedReturnType(SourceLocation loc, QualType type);
//===--------------------------------------------------------------------===//
// C++ Coroutines TS
//
bool ActOnCoroutineBodyStart(Scope *S, SourceLocation KwLoc,
StringRef Keyword);
ExprResult ActOnCoawaitExpr(Scope *S, SourceLocation KwLoc, Expr *E);
ExprResult ActOnCoyieldExpr(Scope *S, SourceLocation KwLoc, Expr *E);
StmtResult ActOnCoreturnStmt(Scope *S, SourceLocation KwLoc, Expr *E);
ExprResult BuildResolvedCoawaitExpr(SourceLocation KwLoc, Expr *E,
bool IsImplicit = false);
ExprResult BuildUnresolvedCoawaitExpr(SourceLocation KwLoc, Expr *E,
UnresolvedLookupExpr* Lookup);
ExprResult BuildCoyieldExpr(SourceLocation KwLoc, Expr *E);
StmtResult BuildCoreturnStmt(SourceLocation KwLoc, Expr *E,
bool IsImplicit = false);
StmtResult BuildCoroutineBodyStmt(CoroutineBodyStmt::CtorArgs);
bool buildCoroutineParameterMoves(SourceLocation Loc);
VarDecl *buildCoroutinePromise(SourceLocation Loc);
void CheckCompletedCoroutineBody(FunctionDecl *FD, Stmt *&Body);
ClassTemplateDecl *lookupCoroutineTraits(SourceLocation KwLoc,
SourceLocation FuncLoc);
//===--------------------------------------------------------------------===//
// OpenCL extensions.
//
private:
std::string CurrOpenCLExtension;
/// Extensions required by an OpenCL type.
llvm::DenseMap<const Type*, std::set<std::string>> OpenCLTypeExtMap;
/// Extensions required by an OpenCL declaration.
llvm::DenseMap<const Decl*, std::set<std::string>> OpenCLDeclExtMap;
public:
llvm::StringRef getCurrentOpenCLExtension() const {
return CurrOpenCLExtension;
}
/// Check if a function declaration \p FD associates with any
/// extensions present in OpenCLDeclExtMap and if so return the
/// extension(s) name(s).
std::string getOpenCLExtensionsFromDeclExtMap(FunctionDecl *FD);
/// Check if a function type \p FT associates with any
/// extensions present in OpenCLTypeExtMap and if so return the
/// extension(s) name(s).
std::string getOpenCLExtensionsFromTypeExtMap(FunctionType *FT);
/// Find an extension in an appropriate extension map and return its name
template<typename T, typename MapT>
std::string getOpenCLExtensionsFromExtMap(T* FT, MapT &Map);
void setCurrentOpenCLExtension(llvm::StringRef Ext) {
CurrOpenCLExtension = Ext;
}
/// Set OpenCL extensions for a type which can only be used when these
/// OpenCL extensions are enabled. If \p Exts is empty, do nothing.
/// \param Exts A space separated list of OpenCL extensions.
void setOpenCLExtensionForType(QualType T, llvm::StringRef Exts);
/// Set OpenCL extensions for a declaration which can only be
/// used when these OpenCL extensions are enabled. If \p Exts is empty, do
/// nothing.
/// \param Exts A space separated list of OpenCL extensions.
void setOpenCLExtensionForDecl(Decl *FD, llvm::StringRef Exts);
/// Set current OpenCL extensions for a type which can only be used
/// when these OpenCL extensions are enabled. If current OpenCL extension is
/// empty, do nothing.
void setCurrentOpenCLExtensionForType(QualType T);
/// Set current OpenCL extensions for a declaration which
/// can only be used when these OpenCL extensions are enabled. If current
/// OpenCL extension is empty, do nothing.
void setCurrentOpenCLExtensionForDecl(Decl *FD);
bool isOpenCLDisabledDecl(Decl *FD);
/// Check if type \p T corresponding to declaration specifier \p DS
/// is disabled due to required OpenCL extensions being disabled. If so,
/// emit diagnostics.
/// \return true if type is disabled.
bool checkOpenCLDisabledTypeDeclSpec(const DeclSpec &DS, QualType T);
/// Check if declaration \p D used by expression \p E
/// is disabled due to required OpenCL extensions being disabled. If so,
/// emit diagnostics.
/// \return true if type is disabled.
bool checkOpenCLDisabledDecl(const NamedDecl &D, const Expr &E);
//===--------------------------------------------------------------------===//
// OpenMP directives and clauses.
//
private:
void *VarDataSharingAttributesStack;
/// Number of nested '#pragma omp declare target' directives.
unsigned DeclareTargetNestingLevel = 0;
/// Initialization of data-sharing attributes stack.
void InitDataSharingAttributesStack();
void DestroyDataSharingAttributesStack();
ExprResult
VerifyPositiveIntegerConstantInClause(Expr *Op, OpenMPClauseKind CKind,
bool StrictlyPositive = true);
/// Returns OpenMP nesting level for current directive.
unsigned getOpenMPNestingLevel() const;
/// Adjusts the function scopes index for the target-based regions.
void adjustOpenMPTargetScopeIndex(unsigned &FunctionScopesIndex,
unsigned Level) const;
/// Returns the number of scopes associated with the construct on the given
/// OpenMP level.
int getNumberOfConstructScopes(unsigned Level) const;
/// Push new OpenMP function region for non-capturing function.
void pushOpenMPFunctionRegion();
/// Pop OpenMP function region for non-capturing function.
void popOpenMPFunctionRegion(const sema::FunctionScopeInfo *OldFSI);
/// Check whether we're allowed to call Callee from the current function.
void checkOpenMPDeviceFunction(SourceLocation Loc, FunctionDecl *Callee,
bool CheckForDelayedContext = true);
/// Check whether we're allowed to call Callee from the current function.
void checkOpenMPHostFunction(SourceLocation Loc, FunctionDecl *Callee,
bool CheckCaller = true);
/// Check if the expression is allowed to be used in expressions for the
/// OpenMP devices.
void checkOpenMPDeviceExpr(const Expr *E);
/// Finishes analysis of the deferred functions calls that may be declared as
/// host/nohost during device/host compilation.
void finalizeOpenMPDelayedAnalysis();
/// Checks if a type or a declaration is disabled due to the owning extension
/// being disabled, and emits diagnostic messages if it is disabled.
/// \param D type or declaration to be checked.
/// \param DiagLoc source location for the diagnostic message.
/// \param DiagInfo information to be emitted for the diagnostic message.
/// \param SrcRange source range of the declaration.
/// \param Map maps type or declaration to the extensions.
/// \param Selector selects diagnostic message: 0 for type and 1 for
/// declaration.
/// \return true if the type or declaration is disabled.
template <typename T, typename DiagLocT, typename DiagInfoT, typename MapT>
bool checkOpenCLDisabledTypeOrDecl(T D, DiagLocT DiagLoc, DiagInfoT DiagInfo,
MapT &Map, unsigned Selector = 0,
SourceRange SrcRange = SourceRange());
/// Marks all the functions that might be required for the currently active
/// OpenMP context.
void markOpenMPDeclareVariantFuncsReferenced(SourceLocation Loc,
FunctionDecl *Func,
bool MightBeOdrUse);
public:
/// Struct to store the context selectors info for declare variant directive.
using OMPCtxStringType = SmallString<8>;
using OMPCtxSelectorData =
OpenMPCtxSelectorData<OMPCtxStringType, SmallVector<OMPCtxStringType, 4>,
ExprResult>;
/// Checks if the variant/multiversion functions are compatible.
bool areMultiversionVariantFunctionsCompatible(
const FunctionDecl *OldFD, const FunctionDecl *NewFD,
const PartialDiagnostic &NoProtoDiagID,
const PartialDiagnosticAt &NoteCausedDiagIDAt,
const PartialDiagnosticAt &NoSupportDiagIDAt,
const PartialDiagnosticAt &DiffDiagIDAt, bool TemplatesSupported,
bool ConstexprSupported, bool CLinkageMayDiffer);
/// Function tries to capture lambda's captured variables in the OpenMP region
/// before the original lambda is captured.
void tryCaptureOpenMPLambdas(ValueDecl *V);
/// Return true if the provided declaration \a VD should be captured by
/// reference.
/// \param Level Relative level of nested OpenMP construct for that the check
/// is performed.
/// \param OpenMPCaptureLevel Capture level within an OpenMP construct.
bool isOpenMPCapturedByRef(const ValueDecl *D, unsigned Level,
unsigned OpenMPCaptureLevel) const;
/// Check if the specified variable is used in one of the private
/// clauses (private, firstprivate, lastprivate, reduction etc.) in OpenMP
/// constructs.
VarDecl *isOpenMPCapturedDecl(ValueDecl *D, bool CheckScopeInfo = false,
unsigned StopAt = 0);
ExprResult getOpenMPCapturedExpr(VarDecl *Capture, ExprValueKind VK,
ExprObjectKind OK, SourceLocation Loc);
/// If the current region is a loop-based region, mark the start of the loop
/// construct.
void startOpenMPLoop();
/// If the current region is a range loop-based region, mark the start of the
/// loop construct.
void startOpenMPCXXRangeFor();
/// Check if the specified variable is used in 'private' clause.
/// \param Level Relative level of nested OpenMP construct for that the check
/// is performed.
bool isOpenMPPrivateDecl(const ValueDecl *D, unsigned Level) const;
/// Sets OpenMP capture kind (OMPC_private, OMPC_firstprivate, OMPC_map etc.)
/// for \p FD based on DSA for the provided corresponding captured declaration
/// \p D.
void setOpenMPCaptureKind(FieldDecl *FD, const ValueDecl *D, unsigned Level);
/// Check if the specified variable is captured by 'target' directive.
/// \param Level Relative level of nested OpenMP construct for that the check
/// is performed.
bool isOpenMPTargetCapturedDecl(const ValueDecl *D, unsigned Level) const;
ExprResult PerformOpenMPImplicitIntegerConversion(SourceLocation OpLoc,
Expr *Op);
/// Called on start of new data sharing attribute block.
void StartOpenMPDSABlock(OpenMPDirectiveKind K,
const DeclarationNameInfo &DirName, Scope *CurScope,
SourceLocation Loc);
/// Start analysis of clauses.
void StartOpenMPClause(OpenMPClauseKind K);
/// End analysis of clauses.
void EndOpenMPClause();
/// Called on end of data sharing attribute block.
void EndOpenMPDSABlock(Stmt *CurDirective);
/// Check if the current region is an OpenMP loop region and if it is,
/// mark loop control variable, used in \p Init for loop initialization, as
/// private by default.
/// \param Init First part of the for loop.
void ActOnOpenMPLoopInitialization(SourceLocation ForLoc, Stmt *Init);
// OpenMP directives and clauses.
/// Called on correct id-expression from the '#pragma omp
/// threadprivate'.
ExprResult ActOnOpenMPIdExpression(Scope *CurScope, CXXScopeSpec &ScopeSpec,
const DeclarationNameInfo &Id,
OpenMPDirectiveKind Kind);
/// Called on well-formed '#pragma omp threadprivate'.
DeclGroupPtrTy ActOnOpenMPThreadprivateDirective(
SourceLocation Loc,
ArrayRef<Expr *> VarList);
/// Builds a new OpenMPThreadPrivateDecl and checks its correctness.
OMPThreadPrivateDecl *CheckOMPThreadPrivateDecl(SourceLocation Loc,
ArrayRef<Expr *> VarList);
/// Called on well-formed '#pragma omp allocate'.
DeclGroupPtrTy ActOnOpenMPAllocateDirective(SourceLocation Loc,
ArrayRef<Expr *> VarList,
ArrayRef<OMPClause *> Clauses,
DeclContext *Owner = nullptr);
/// Called on well-formed '#pragma omp requires'.
DeclGroupPtrTy ActOnOpenMPRequiresDirective(SourceLocation Loc,
ArrayRef<OMPClause *> ClauseList);
/// Check restrictions on Requires directive
OMPRequiresDecl *CheckOMPRequiresDecl(SourceLocation Loc,
ArrayRef<OMPClause *> Clauses);
/// Check if the specified type is allowed to be used in 'omp declare
/// reduction' construct.
QualType ActOnOpenMPDeclareReductionType(SourceLocation TyLoc,
TypeResult ParsedType);
/// Called on start of '#pragma omp declare reduction'.
DeclGroupPtrTy ActOnOpenMPDeclareReductionDirectiveStart(
Scope *S, DeclContext *DC, DeclarationName Name,
ArrayRef<std::pair<QualType, SourceLocation>> ReductionTypes,
AccessSpecifier AS, Decl *PrevDeclInScope = nullptr);
/// Initialize declare reduction construct initializer.
void ActOnOpenMPDeclareReductionCombinerStart(Scope *S, Decl *D);
/// Finish current declare reduction construct initializer.
void ActOnOpenMPDeclareReductionCombinerEnd(Decl *D, Expr *Combiner);
/// Initialize declare reduction construct initializer.
/// \return omp_priv variable.
VarDecl *ActOnOpenMPDeclareReductionInitializerStart(Scope *S, Decl *D);
/// Finish current declare reduction construct initializer.
void ActOnOpenMPDeclareReductionInitializerEnd(Decl *D, Expr *Initializer,
VarDecl *OmpPrivParm);
/// Called at the end of '#pragma omp declare reduction'.
DeclGroupPtrTy ActOnOpenMPDeclareReductionDirectiveEnd(
Scope *S, DeclGroupPtrTy DeclReductions, bool IsValid);
/// Check variable declaration in 'omp declare mapper' construct.
TypeResult ActOnOpenMPDeclareMapperVarDecl(Scope *S, Declarator &D);
/// Check if the specified type is allowed to be used in 'omp declare
/// mapper' construct.
QualType ActOnOpenMPDeclareMapperType(SourceLocation TyLoc,
TypeResult ParsedType);
/// Called on start of '#pragma omp declare mapper'.
OMPDeclareMapperDecl *ActOnOpenMPDeclareMapperDirectiveStart(
Scope *S, DeclContext *DC, DeclarationName Name, QualType MapperType,
SourceLocation StartLoc, DeclarationName VN, AccessSpecifier AS,
Decl *PrevDeclInScope = nullptr);
/// Build the mapper variable of '#pragma omp declare mapper'.
void ActOnOpenMPDeclareMapperDirectiveVarDecl(OMPDeclareMapperDecl *DMD,
Scope *S, QualType MapperType,
SourceLocation StartLoc,
DeclarationName VN);
/// Called at the end of '#pragma omp declare mapper'.
DeclGroupPtrTy
ActOnOpenMPDeclareMapperDirectiveEnd(OMPDeclareMapperDecl *D, Scope *S,
ArrayRef<OMPClause *> ClauseList);
/// Called on the start of target region i.e. '#pragma omp declare target'.
bool ActOnStartOpenMPDeclareTargetDirective(SourceLocation Loc);
/// Called at the end of target region i.e. '#pragme omp end declare target'.
void ActOnFinishOpenMPDeclareTargetDirective();
/// Searches for the provided declaration name for OpenMP declare target
/// directive.
NamedDecl *
lookupOpenMPDeclareTargetName(Scope *CurScope, CXXScopeSpec &ScopeSpec,
const DeclarationNameInfo &Id,
NamedDeclSetType &SameDirectiveDecls);
/// Called on correct id-expression from the '#pragma omp declare target'.
void ActOnOpenMPDeclareTargetName(NamedDecl *ND, SourceLocation Loc,
OMPDeclareTargetDeclAttr::MapTypeTy MT,
OMPDeclareTargetDeclAttr::DevTypeTy DT);
/// Check declaration inside target region.
void
checkDeclIsAllowedInOpenMPTarget(Expr *E, Decl *D,
SourceLocation IdLoc = SourceLocation());
/// Return true inside OpenMP declare target region.
bool isInOpenMPDeclareTargetContext() const {
return DeclareTargetNestingLevel > 0;
}
/// Return true inside OpenMP target region.
bool isInOpenMPTargetExecutionDirective() const;
/// Return the number of captured regions created for an OpenMP directive.
static int getOpenMPCaptureLevels(OpenMPDirectiveKind Kind);
/// Initialization of captured region for OpenMP region.
void ActOnOpenMPRegionStart(OpenMPDirectiveKind DKind, Scope *CurScope);
/// End of OpenMP region.
///
/// \param S Statement associated with the current OpenMP region.
/// \param Clauses List of clauses for the current OpenMP region.
///
/// \returns Statement for finished OpenMP region.
StmtResult ActOnOpenMPRegionEnd(StmtResult S, ArrayRef<OMPClause *> Clauses);
StmtResult ActOnOpenMPExecutableDirective(
OpenMPDirectiveKind Kind, const DeclarationNameInfo &DirName,
OpenMPDirectiveKind CancelRegion, ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc, SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp parallel' after parsing
/// of the associated statement.
StmtResult ActOnOpenMPParallelDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt,
SourceLocation StartLoc,
SourceLocation EndLoc);
using VarsWithInheritedDSAType =
llvm::SmallDenseMap<const ValueDecl *, const Expr *, 4>;
/// Called on well-formed '\#pragma omp simd' after parsing
/// of the associated statement.
StmtResult
ActOnOpenMPSimdDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp for' after parsing
/// of the associated statement.
StmtResult
ActOnOpenMPForDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp for simd' after parsing
/// of the associated statement.
StmtResult
ActOnOpenMPForSimdDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp sections' after parsing
/// of the associated statement.
StmtResult ActOnOpenMPSectionsDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp section' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPSectionDirective(Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp single' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPSingleDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp master' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPMasterDirective(Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp critical' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPCriticalDirective(const DeclarationNameInfo &DirName,
ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp parallel for' after parsing
/// of the associated statement.
StmtResult ActOnOpenMPParallelForDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp parallel for simd' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPParallelForSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp parallel sections' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPParallelSectionsDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt,
SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp task' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPTaskDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp taskyield'.
StmtResult ActOnOpenMPTaskyieldDirective(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp barrier'.
StmtResult ActOnOpenMPBarrierDirective(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp taskwait'.
StmtResult ActOnOpenMPTaskwaitDirective(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp taskgroup'.
StmtResult ActOnOpenMPTaskgroupDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp flush'.
StmtResult ActOnOpenMPFlushDirective(ArrayRef<OMPClause *> Clauses,
SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp ordered' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPOrderedDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp atomic' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPAtomicDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp target' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPTargetDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp target data' after parsing of
/// the associated statement.
StmtResult ActOnOpenMPTargetDataDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp target enter data' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetEnterDataDirective(ArrayRef<OMPClause *> Clauses,
SourceLocation StartLoc,
SourceLocation EndLoc,
Stmt *AStmt);
/// Called on well-formed '\#pragma omp target exit data' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetExitDataDirective(ArrayRef<OMPClause *> Clauses,
SourceLocation StartLoc,
SourceLocation EndLoc,
Stmt *AStmt);
/// Called on well-formed '\#pragma omp target parallel' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetParallelDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt,
SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp target parallel for' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetParallelForDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp teams' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPTeamsDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp cancellation point'.
StmtResult
ActOnOpenMPCancellationPointDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
OpenMPDirectiveKind CancelRegion);
/// Called on well-formed '\#pragma omp cancel'.
StmtResult ActOnOpenMPCancelDirective(ArrayRef<OMPClause *> Clauses,
SourceLocation StartLoc,
SourceLocation EndLoc,
OpenMPDirectiveKind CancelRegion);
/// Called on well-formed '\#pragma omp taskloop' after parsing of the
/// associated statement.
StmtResult
ActOnOpenMPTaskLoopDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp taskloop simd' after parsing of
/// the associated statement.
StmtResult ActOnOpenMPTaskLoopSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp master taskloop' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPMasterTaskLoopDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp master taskloop simd' after parsing of
/// the associated statement.
StmtResult ActOnOpenMPMasterTaskLoopSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp parallel master taskloop' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPParallelMasterTaskLoopDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp parallel master taskloop simd' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPParallelMasterTaskLoopSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp distribute' after parsing
/// of the associated statement.
StmtResult
ActOnOpenMPDistributeDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target update'.
StmtResult ActOnOpenMPTargetUpdateDirective(ArrayRef<OMPClause *> Clauses,
SourceLocation StartLoc,
SourceLocation EndLoc,
Stmt *AStmt);
/// Called on well-formed '\#pragma omp distribute parallel for' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPDistributeParallelForDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp distribute parallel for simd'
/// after parsing of the associated statement.
StmtResult ActOnOpenMPDistributeParallelForSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp distribute simd' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPDistributeSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target parallel for simd' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetParallelForSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target simd' after parsing of
/// the associated statement.
StmtResult
ActOnOpenMPTargetSimdDirective(ArrayRef<OMPClause *> Clauses, Stmt *AStmt,
SourceLocation StartLoc, SourceLocation EndLoc,
VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp teams distribute' after parsing of
/// the associated statement.
StmtResult ActOnOpenMPTeamsDistributeDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp teams distribute simd' after parsing
/// of the associated statement.
StmtResult ActOnOpenMPTeamsDistributeSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp teams distribute parallel for simd'
/// after parsing of the associated statement.
StmtResult ActOnOpenMPTeamsDistributeParallelForSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp teams distribute parallel for'
/// after parsing of the associated statement.
StmtResult ActOnOpenMPTeamsDistributeParallelForDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target teams' after parsing of the
/// associated statement.
StmtResult ActOnOpenMPTargetTeamsDirective(ArrayRef<OMPClause *> Clauses,
Stmt *AStmt,
SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed '\#pragma omp target teams distribute' after parsing
/// of the associated statement.
StmtResult ActOnOpenMPTargetTeamsDistributeDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target teams distribute parallel for'
/// after parsing of the associated statement.
StmtResult ActOnOpenMPTargetTeamsDistributeParallelForDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target teams distribute parallel for
/// simd' after parsing of the associated statement.
StmtResult ActOnOpenMPTargetTeamsDistributeParallelForSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Called on well-formed '\#pragma omp target teams distribute simd' after
/// parsing of the associated statement.
StmtResult ActOnOpenMPTargetTeamsDistributeSimdDirective(
ArrayRef<OMPClause *> Clauses, Stmt *AStmt, SourceLocation StartLoc,
SourceLocation EndLoc, VarsWithInheritedDSAType &VarsWithImplicitDSA);
/// Checks correctness of linear modifiers.
bool CheckOpenMPLinearModifier(OpenMPLinearClauseKind LinKind,
SourceLocation LinLoc);
/// Checks that the specified declaration matches requirements for the linear
/// decls.
bool CheckOpenMPLinearDecl(const ValueDecl *D, SourceLocation ELoc,
OpenMPLinearClauseKind LinKind, QualType Type);
/// Called on well-formed '\#pragma omp declare simd' after parsing of
/// the associated method/function.
DeclGroupPtrTy ActOnOpenMPDeclareSimdDirective(
DeclGroupPtrTy DG, OMPDeclareSimdDeclAttr::BranchStateTy BS,
Expr *Simdlen, ArrayRef<Expr *> Uniforms, ArrayRef<Expr *> Aligneds,
ArrayRef<Expr *> Alignments, ArrayRef<Expr *> Linears,
ArrayRef<unsigned> LinModifiers, ArrayRef<Expr *> Steps, SourceRange SR);
/// Checks '\#pragma omp declare variant' variant function and original
/// functions after parsing of the associated method/function.
/// \param DG Function declaration to which declare variant directive is
/// applied to.
/// \param VariantRef Expression that references the variant function, which
/// must be used instead of the original one, specified in \p DG.
/// \returns None, if the function/variant function are not compatible with
/// the pragma, pair of original function/variant ref expression otherwise.
Optional<std::pair<FunctionDecl *, Expr *>> checkOpenMPDeclareVariantFunction(
DeclGroupPtrTy DG, Expr *VariantRef, SourceRange SR);
/// Called on well-formed '\#pragma omp declare variant' after parsing of
/// the associated method/function.
/// \param FD Function declaration to which declare variant directive is
/// applied to.
/// \param VariantRef Expression that references the variant function, which
/// must be used instead of the original one, specified in \p DG.
/// \param Data Set of context-specific data for the specified context
/// selector.
void ActOnOpenMPDeclareVariantDirective(FunctionDecl *FD, Expr *VariantRef,
SourceRange SR,
ArrayRef<OMPCtxSelectorData> Data);
OMPClause *ActOnOpenMPSingleExprClause(OpenMPClauseKind Kind,
Expr *Expr,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'allocator' clause.
OMPClause *ActOnOpenMPAllocatorClause(Expr *Allocator,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'if' clause.
OMPClause *ActOnOpenMPIfClause(OpenMPDirectiveKind NameModifier,
Expr *Condition, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation NameModifierLoc,
SourceLocation ColonLoc,
SourceLocation EndLoc);
/// Called on well-formed 'final' clause.
OMPClause *ActOnOpenMPFinalClause(Expr *Condition, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'num_threads' clause.
OMPClause *ActOnOpenMPNumThreadsClause(Expr *NumThreads,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'safelen' clause.
OMPClause *ActOnOpenMPSafelenClause(Expr *Length,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'simdlen' clause.
OMPClause *ActOnOpenMPSimdlenClause(Expr *Length, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'collapse' clause.
OMPClause *ActOnOpenMPCollapseClause(Expr *NumForLoops,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'ordered' clause.
OMPClause *
ActOnOpenMPOrderedClause(SourceLocation StartLoc, SourceLocation EndLoc,
SourceLocation LParenLoc = SourceLocation(),
Expr *NumForLoops = nullptr);
/// Called on well-formed 'grainsize' clause.
OMPClause *ActOnOpenMPGrainsizeClause(Expr *Size, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'num_tasks' clause.
OMPClause *ActOnOpenMPNumTasksClause(Expr *NumTasks, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'hint' clause.
OMPClause *ActOnOpenMPHintClause(Expr *Hint, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
OMPClause *ActOnOpenMPSimpleClause(OpenMPClauseKind Kind,
unsigned Argument,
SourceLocation ArgumentLoc,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'default' clause.
OMPClause *ActOnOpenMPDefaultClause(OpenMPDefaultClauseKind Kind,
SourceLocation KindLoc,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'proc_bind' clause.
OMPClause *ActOnOpenMPProcBindClause(OpenMPProcBindClauseKind Kind,
SourceLocation KindLoc,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
OMPClause *ActOnOpenMPSingleExprWithArgClause(
OpenMPClauseKind Kind, ArrayRef<unsigned> Arguments, Expr *Expr,
SourceLocation StartLoc, SourceLocation LParenLoc,
ArrayRef<SourceLocation> ArgumentsLoc, SourceLocation DelimLoc,
SourceLocation EndLoc);
/// Called on well-formed 'schedule' clause.
OMPClause *ActOnOpenMPScheduleClause(
OpenMPScheduleClauseModifier M1, OpenMPScheduleClauseModifier M2,
OpenMPScheduleClauseKind Kind, Expr *ChunkSize, SourceLocation StartLoc,
SourceLocation LParenLoc, SourceLocation M1Loc, SourceLocation M2Loc,
SourceLocation KindLoc, SourceLocation CommaLoc, SourceLocation EndLoc);
OMPClause *ActOnOpenMPClause(OpenMPClauseKind Kind, SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'nowait' clause.
OMPClause *ActOnOpenMPNowaitClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'untied' clause.
OMPClause *ActOnOpenMPUntiedClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'mergeable' clause.
OMPClause *ActOnOpenMPMergeableClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'read' clause.
OMPClause *ActOnOpenMPReadClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'write' clause.
OMPClause *ActOnOpenMPWriteClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'update' clause.
OMPClause *ActOnOpenMPUpdateClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'capture' clause.
OMPClause *ActOnOpenMPCaptureClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'seq_cst' clause.
OMPClause *ActOnOpenMPSeqCstClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'threads' clause.
OMPClause *ActOnOpenMPThreadsClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'simd' clause.
OMPClause *ActOnOpenMPSIMDClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'nogroup' clause.
OMPClause *ActOnOpenMPNogroupClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'unified_address' clause.
OMPClause *ActOnOpenMPUnifiedAddressClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'unified_address' clause.
OMPClause *ActOnOpenMPUnifiedSharedMemoryClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'reverse_offload' clause.
OMPClause *ActOnOpenMPReverseOffloadClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'dynamic_allocators' clause.
OMPClause *ActOnOpenMPDynamicAllocatorsClause(SourceLocation StartLoc,
SourceLocation EndLoc);
/// Called on well-formed 'atomic_default_mem_order' clause.
OMPClause *ActOnOpenMPAtomicDefaultMemOrderClause(
OpenMPAtomicDefaultMemOrderClauseKind Kind, SourceLocation KindLoc,
SourceLocation StartLoc, SourceLocation LParenLoc, SourceLocation EndLoc);
OMPClause *ActOnOpenMPVarListClause(
OpenMPClauseKind Kind, ArrayRef<Expr *> Vars, Expr *TailExpr,
const OMPVarListLocTy &Locs, SourceLocation ColonLoc,
CXXScopeSpec &ReductionOrMapperIdScopeSpec,
DeclarationNameInfo &ReductionOrMapperId, OpenMPDependClauseKind DepKind,
OpenMPLinearClauseKind LinKind,
ArrayRef<OpenMPMapModifierKind> MapTypeModifiers,
ArrayRef<SourceLocation> MapTypeModifiersLoc, OpenMPMapClauseKind MapType,
bool IsMapTypeImplicit, SourceLocation DepLinMapLoc);
/// Called on well-formed 'allocate' clause.
OMPClause *
ActOnOpenMPAllocateClause(Expr *Allocator, ArrayRef<Expr *> VarList,
SourceLocation StartLoc, SourceLocation ColonLoc,
SourceLocation LParenLoc, SourceLocation EndLoc);
/// Called on well-formed 'private' clause.
OMPClause *ActOnOpenMPPrivateClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'firstprivate' clause.
OMPClause *ActOnOpenMPFirstprivateClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'lastprivate' clause.
OMPClause *ActOnOpenMPLastprivateClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'shared' clause.
OMPClause *ActOnOpenMPSharedClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'reduction' clause.
OMPClause *ActOnOpenMPReductionClause(
ArrayRef<Expr *> VarList, SourceLocation StartLoc,
SourceLocation LParenLoc, SourceLocation ColonLoc, SourceLocation EndLoc,
CXXScopeSpec &ReductionIdScopeSpec,
const DeclarationNameInfo &ReductionId,
ArrayRef<Expr *> UnresolvedReductions = llvm::None);
/// Called on well-formed 'task_reduction' clause.
OMPClause *ActOnOpenMPTaskReductionClause(
ArrayRef<Expr *> VarList, SourceLocation StartLoc,
SourceLocation LParenLoc, SourceLocation ColonLoc, SourceLocation EndLoc,
CXXScopeSpec &ReductionIdScopeSpec,
const DeclarationNameInfo &ReductionId,
ArrayRef<Expr *> UnresolvedReductions = llvm::None);
/// Called on well-formed 'in_reduction' clause.
OMPClause *ActOnOpenMPInReductionClause(
ArrayRef<Expr *> VarList, SourceLocation StartLoc,
SourceLocation LParenLoc, SourceLocation ColonLoc, SourceLocation EndLoc,
CXXScopeSpec &ReductionIdScopeSpec,
const DeclarationNameInfo &ReductionId,
ArrayRef<Expr *> UnresolvedReductions = llvm::None);
/// Called on well-formed 'linear' clause.
OMPClause *
ActOnOpenMPLinearClause(ArrayRef<Expr *> VarList, Expr *Step,
SourceLocation StartLoc, SourceLocation LParenLoc,
OpenMPLinearClauseKind LinKind, SourceLocation LinLoc,
SourceLocation ColonLoc, SourceLocation EndLoc);
/// Called on well-formed 'aligned' clause.
OMPClause *ActOnOpenMPAlignedClause(ArrayRef<Expr *> VarList,
Expr *Alignment,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation ColonLoc,
SourceLocation EndLoc);
/// Called on well-formed 'copyin' clause.
OMPClause *ActOnOpenMPCopyinClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'copyprivate' clause.
OMPClause *ActOnOpenMPCopyprivateClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'flush' pseudo clause.
OMPClause *ActOnOpenMPFlushClause(ArrayRef<Expr *> VarList,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'depend' clause.
OMPClause *
ActOnOpenMPDependClause(OpenMPDependClauseKind DepKind, SourceLocation DepLoc,
SourceLocation ColonLoc, ArrayRef<Expr *> VarList,
SourceLocation StartLoc, SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'device' clause.
OMPClause *ActOnOpenMPDeviceClause(Expr *Device, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'map' clause.
OMPClause *
ActOnOpenMPMapClause(ArrayRef<OpenMPMapModifierKind> MapTypeModifiers,
ArrayRef<SourceLocation> MapTypeModifiersLoc,
CXXScopeSpec &MapperIdScopeSpec,
DeclarationNameInfo &MapperId,
OpenMPMapClauseKind MapType, bool IsMapTypeImplicit,
SourceLocation MapLoc, SourceLocation ColonLoc,
ArrayRef<Expr *> VarList, const OMPVarListLocTy &Locs,
ArrayRef<Expr *> UnresolvedMappers = llvm::None);
/// Called on well-formed 'num_teams' clause.
OMPClause *ActOnOpenMPNumTeamsClause(Expr *NumTeams, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'thread_limit' clause.
OMPClause *ActOnOpenMPThreadLimitClause(Expr *ThreadLimit,
SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'priority' clause.
OMPClause *ActOnOpenMPPriorityClause(Expr *Priority, SourceLocation StartLoc,
SourceLocation LParenLoc,
SourceLocation EndLoc);
/// Called on well-formed 'dist_schedule' clause.
OMPClause *ActOnOpenMPDistScheduleClause(
OpenMPDistScheduleClauseKind Kind, Expr *ChunkSize,
SourceLocation StartLoc, SourceLocation LParenLoc, SourceLocation KindLoc,
SourceLocation CommaLoc, SourceLocation EndLoc);
/// Called on well-formed 'defaultmap' clause.
OMPClause *ActOnOpenMPDefaultmapClause(
OpenMPDefaultmapClauseModifier M, OpenMPDefaultmapClauseKind Kind,
SourceLocation StartLoc, SourceLocation LParenLoc, SourceLocation MLoc,
SourceLocation KindLoc, SourceLocation EndLoc);
/// Called on well-formed 'to' clause.
OMPClause *
ActOnOpenMPToClause(ArrayRef<Expr *> VarList, CXXScopeSpec &MapperIdScopeSpec,
DeclarationNameInfo &MapperId,
const OMPVarListLocTy &Locs,
ArrayRef<Expr *> UnresolvedMappers = llvm::None);
/// Called on well-formed 'from' clause.
OMPClause *ActOnOpenMPFromClause(
ArrayRef<Expr *> VarList, CXXScopeSpec &MapperIdScopeSpec,
DeclarationNameInfo &MapperId, const OMPVarListLocTy &Locs,
ArrayRef<Expr *> UnresolvedMappers = llvm::None);
/// Called on well-formed 'use_device_ptr' clause.
OMPClause *ActOnOpenMPUseDevicePtrClause(ArrayRef<Expr *> VarList,
const OMPVarListLocTy &Locs);
/// Called on well-formed 'is_device_ptr' clause.
OMPClause *ActOnOpenMPIsDevicePtrClause(ArrayRef<Expr *> VarList,
const OMPVarListLocTy &Locs);
/// The kind of conversion being performed.
enum CheckedConversionKind {
/// An implicit conversion.
CCK_ImplicitConversion,
/// A C-style cast.
CCK_CStyleCast,
/// A functional-style cast.
CCK_FunctionalCast,
/// A cast other than a C-style cast.
CCK_OtherCast,
/// A conversion for an operand of a builtin overloaded operator.
CCK_ForBuiltinOverloadedOp
};
static bool isCast(CheckedConversionKind CCK) {
return CCK == CCK_CStyleCast || CCK == CCK_FunctionalCast ||
CCK == CCK_OtherCast;
}
/// ImpCastExprToType - If Expr is not of type 'Type', insert an implicit
/// cast. If there is already an implicit cast, merge into the existing one.
/// If isLvalue, the result of the cast is an lvalue.
ExprResult ImpCastExprToType(Expr *E, QualType Type, CastKind CK,
ExprValueKind VK = VK_RValue,
const CXXCastPath *BasePath = nullptr,
CheckedConversionKind CCK
= CCK_ImplicitConversion);
/// ScalarTypeToBooleanCastKind - Returns the cast kind corresponding
/// to the conversion from scalar type ScalarTy to the Boolean type.
static CastKind ScalarTypeToBooleanCastKind(QualType ScalarTy);
/// IgnoredValueConversions - Given that an expression's result is
/// syntactically ignored, perform any conversions that are
/// required.
ExprResult IgnoredValueConversions(Expr *E);
// UsualUnaryConversions - promotes integers (C99 6.3.1.1p2) and converts
// functions and arrays to their respective pointers (C99 6.3.2.1).
ExprResult UsualUnaryConversions(Expr *E);
/// CallExprUnaryConversions - a special case of an unary conversion
/// performed on a function designator of a call expression.
ExprResult CallExprUnaryConversions(Expr *E);
// DefaultFunctionArrayConversion - converts functions and arrays
// to their respective pointers (C99 6.3.2.1).
ExprResult DefaultFunctionArrayConversion(Expr *E, bool Diagnose = true);
// DefaultFunctionArrayLvalueConversion - converts functions and
// arrays to their respective pointers and performs the
// lvalue-to-rvalue conversion.
ExprResult DefaultFunctionArrayLvalueConversion(Expr *E,
bool Diagnose = true);
// DefaultLvalueConversion - performs lvalue-to-rvalue conversion on
// the operand. This is DefaultFunctionArrayLvalueConversion,
// except that it assumes the operand isn't of function or array
// type.
ExprResult DefaultLvalueConversion(Expr *E);
// DefaultArgumentPromotion (C99 6.5.2.2p6). Used for function calls that
// do not have a prototype. Integer promotions are performed on each
// argument, and arguments that have type float are promoted to double.
ExprResult DefaultArgumentPromotion(Expr *E);
/// If \p E is a prvalue denoting an unmaterialized temporary, materialize
/// it as an xvalue. In C++98, the result will still be a prvalue, because
/// we don't have xvalues there.
ExprResult TemporaryMaterializationConversion(Expr *E);
// Used for emitting the right warning by DefaultVariadicArgumentPromotion
enum VariadicCallType {
VariadicFunction,
VariadicBlock,
VariadicMethod,
VariadicConstructor,
VariadicDoesNotApply
};
VariadicCallType getVariadicCallType(FunctionDecl *FDecl,
const FunctionProtoType *Proto,
Expr *Fn);
// Used for determining in which context a type is allowed to be passed to a
// vararg function.
enum VarArgKind {
VAK_Valid,
VAK_ValidInCXX11,
VAK_Undefined,
VAK_MSVCUndefined,
VAK_Invalid
};
// Determines which VarArgKind fits an expression.
VarArgKind isValidVarArgType(const QualType &Ty);
/// Check to see if the given expression is a valid argument to a variadic
/// function, issuing a diagnostic if not.
void checkVariadicArgument(const Expr *E, VariadicCallType CT);
/// Check to see if a given expression could have '.c_str()' called on it.
bool hasCStrMethod(const Expr *E);
/// GatherArgumentsForCall - Collector argument expressions for various
/// form of call prototypes.
bool GatherArgumentsForCall(SourceLocation CallLoc, FunctionDecl *FDecl,
const FunctionProtoType *Proto,
unsigned FirstParam, ArrayRef<Expr *> Args,
SmallVectorImpl<Expr *> &AllArgs,
VariadicCallType CallType = VariadicDoesNotApply,
bool AllowExplicit = false,
bool IsListInitialization = false);
// DefaultVariadicArgumentPromotion - Like DefaultArgumentPromotion, but
// will create a runtime trap if the resulting type is not a POD type.
ExprResult DefaultVariadicArgumentPromotion(Expr *E, VariadicCallType CT,
FunctionDecl *FDecl);
// UsualArithmeticConversions - performs the UsualUnaryConversions on it's
// operands and then handles various conversions that are common to binary
// operators (C99 6.3.1.8). If both operands aren't arithmetic, this
// routine returns the first non-arithmetic type found. The client is
// responsible for emitting appropriate error diagnostics.
QualType UsualArithmeticConversions(ExprResult &LHS, ExprResult &RHS,
bool IsCompAssign = false);
/// AssignConvertType - All of the 'assignment' semantic checks return this
/// enum to indicate whether the assignment was allowed. These checks are
/// done for simple assignments, as well as initialization, return from
/// function, argument passing, etc. The query is phrased in terms of a
/// source and destination type.
enum AssignConvertType {
/// Compatible - the types are compatible according to the standard.
Compatible,
/// PointerToInt - The assignment converts a pointer to an int, which we
/// accept as an extension.
PointerToInt,
/// IntToPointer - The assignment converts an int to a pointer, which we
/// accept as an extension.
IntToPointer,
/// FunctionVoidPointer - The assignment is between a function pointer and
/// void*, which the standard doesn't allow, but we accept as an extension.
FunctionVoidPointer,
/// IncompatiblePointer - The assignment is between two pointers types that
/// are not compatible, but we accept them as an extension.
IncompatiblePointer,
/// IncompatiblePointerSign - The assignment is between two pointers types
/// which point to integers which have a different sign, but are otherwise
/// identical. This is a subset of the above, but broken out because it's by
/// far the most common case of incompatible pointers.
IncompatiblePointerSign,
/// CompatiblePointerDiscardsQualifiers - The assignment discards
/// c/v/r qualifiers, which we accept as an extension.
CompatiblePointerDiscardsQualifiers,
/// IncompatiblePointerDiscardsQualifiers - The assignment
/// discards qualifiers that we don't permit to be discarded,
/// like address spaces.
IncompatiblePointerDiscardsQualifiers,
/// IncompatibleNestedPointerAddressSpaceMismatch - The assignment
/// changes address spaces in nested pointer types which is not allowed.
/// For instance, converting __private int ** to __generic int ** is
/// illegal even though __private could be converted to __generic.
IncompatibleNestedPointerAddressSpaceMismatch,
/// IncompatibleNestedPointerQualifiers - The assignment is between two
/// nested pointer types, and the qualifiers other than the first two
/// levels differ e.g. char ** -> const char **, but we accept them as an
/// extension.
IncompatibleNestedPointerQualifiers,
/// IncompatibleVectors - The assignment is between two vector types that
/// have the same size, which we accept as an extension.
IncompatibleVectors,
/// IntToBlockPointer - The assignment converts an int to a block
/// pointer. We disallow this.
IntToBlockPointer,
/// IncompatibleBlockPointer - The assignment is between two block
/// pointers types that are not compatible.
IncompatibleBlockPointer,
/// IncompatibleObjCQualifiedId - The assignment is between a qualified
/// id type and something else (that is incompatible with it). For example,
/// "id <XXX>" = "Foo *", where "Foo *" doesn't implement the XXX protocol.
IncompatibleObjCQualifiedId,
/// IncompatibleObjCWeakRef - Assigning a weak-unavailable object to an
/// object with __weak qualifier.
IncompatibleObjCWeakRef,
/// Incompatible - We reject this conversion outright, it is invalid to
/// represent it in the AST.
Incompatible
};
/// DiagnoseAssignmentResult - Emit a diagnostic, if required, for the
/// assignment conversion type specified by ConvTy. This returns true if the
/// conversion was invalid or false if the conversion was accepted.
bool DiagnoseAssignmentResult(AssignConvertType ConvTy,
SourceLocation Loc,
QualType DstType, QualType SrcType,
Expr *SrcExpr, AssignmentAction Action,
bool *Complained = nullptr);
/// IsValueInFlagEnum - Determine if a value is allowed as part of a flag
/// enum. If AllowMask is true, then we also allow the complement of a valid
/// value, to be used as a mask.
bool IsValueInFlagEnum(const EnumDecl *ED, const llvm::APInt &Val,
bool AllowMask) const;
/// DiagnoseAssignmentEnum - Warn if assignment to enum is a constant
/// integer not in the range of enum values.
void DiagnoseAssignmentEnum(QualType DstType, QualType SrcType,
Expr *SrcExpr);
/// CheckAssignmentConstraints - Perform type checking for assignment,
/// argument passing, variable initialization, and function return values.
/// C99 6.5.16.
AssignConvertType CheckAssignmentConstraints(SourceLocation Loc,
QualType LHSType,
QualType RHSType);
/// Check assignment constraints and optionally prepare for a conversion of
/// the RHS to the LHS type. The conversion is prepared for if ConvertRHS
/// is true.
AssignConvertType CheckAssignmentConstraints(QualType LHSType,
ExprResult &RHS,
CastKind &Kind,
bool ConvertRHS = true);
/// Check assignment constraints for an assignment of RHS to LHSType.
///
/// \param LHSType The destination type for the assignment.
/// \param RHS The source expression for the assignment.
/// \param Diagnose If \c true, diagnostics may be produced when checking
/// for assignability. If a diagnostic is produced, \p RHS will be
/// set to ExprError(). Note that this function may still return
/// without producing a diagnostic, even for an invalid assignment.
/// \param DiagnoseCFAudited If \c true, the target is a function parameter
/// in an audited Core Foundation API and does not need to be checked
/// for ARC retain issues.
/// \param ConvertRHS If \c true, \p RHS will be updated to model the
/// conversions necessary to perform the assignment. If \c false,
/// \p Diagnose must also be \c false.
AssignConvertType CheckSingleAssignmentConstraints(
QualType LHSType, ExprResult &RHS, bool Diagnose = true,
bool DiagnoseCFAudited = false, bool ConvertRHS = true);
// If the lhs type is a transparent union, check whether we
// can initialize the transparent union with the given expression.
AssignConvertType CheckTransparentUnionArgumentConstraints(QualType ArgType,
ExprResult &RHS);
bool IsStringLiteralToNonConstPointerConversion(Expr *From, QualType ToType);
bool CheckExceptionSpecCompatibility(Expr *From, QualType ToType);
ExprResult PerformImplicitConversion(Expr *From, QualType ToType,
AssignmentAction Action,
bool AllowExplicit = false);
ExprResult PerformImplicitConversion(Expr *From, QualType ToType,
AssignmentAction Action,
bool AllowExplicit,
ImplicitConversionSequence& ICS);
ExprResult PerformImplicitConversion(Expr *From, QualType ToType,
const ImplicitConversionSequence& ICS,
AssignmentAction Action,
CheckedConversionKind CCK
= CCK_ImplicitConversion);
ExprResult PerformImplicitConversion(Expr *From, QualType ToType,
const StandardConversionSequence& SCS,
AssignmentAction Action,
CheckedConversionKind CCK);
ExprResult PerformQualificationConversion(
Expr *E, QualType Ty, ExprValueKind VK = VK_RValue,
CheckedConversionKind CCK = CCK_ImplicitConversion);
/// the following "Check" methods will return a valid/converted QualType
/// or a null QualType (indicating an error diagnostic was issued).
/// type checking binary operators (subroutines of CreateBuiltinBinOp).
QualType InvalidOperands(SourceLocation Loc, ExprResult &LHS,
ExprResult &RHS);
QualType InvalidLogicalVectorOperands(SourceLocation Loc, ExprResult &LHS,
ExprResult &RHS);
QualType CheckPointerToMemberOperands( // C++ 5.5
ExprResult &LHS, ExprResult &RHS, ExprValueKind &VK,
SourceLocation OpLoc, bool isIndirect);
QualType CheckMultiplyDivideOperands( // C99 6.5.5
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompAssign,
bool IsDivide);
QualType CheckRemainderOperands( // C99 6.5.5
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
bool IsCompAssign = false);
QualType CheckAdditionOperands( // C99 6.5.6
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
BinaryOperatorKind Opc, QualType* CompLHSTy = nullptr);
QualType CheckSubtractionOperands( // C99 6.5.6
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
QualType* CompLHSTy = nullptr);
QualType CheckShiftOperands( // C99 6.5.7
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
BinaryOperatorKind Opc, bool IsCompAssign = false);
void CheckPtrComparisonWithNullChar(ExprResult &E, ExprResult &NullE);
QualType CheckCompareOperands( // C99 6.5.8/9
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
BinaryOperatorKind Opc);
QualType CheckBitwiseOperands( // C99 6.5.[10...12]
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
BinaryOperatorKind Opc);
QualType CheckLogicalOperands( // C99 6.5.[13,14]
ExprResult &LHS, ExprResult &RHS, SourceLocation Loc,
BinaryOperatorKind Opc);
// CheckAssignmentOperands is used for both simple and compound assignment.
// For simple assignment, pass both expressions and a null converted type.
// For compound assignment, pass both expressions and the converted type.
QualType CheckAssignmentOperands( // C99 6.5.16.[1,2]
Expr *LHSExpr, ExprResult &RHS, SourceLocation Loc, QualType CompoundType);
ExprResult checkPseudoObjectIncDec(Scope *S, SourceLocation OpLoc,
UnaryOperatorKind Opcode, Expr *Op);
ExprResult checkPseudoObjectAssignment(Scope *S, SourceLocation OpLoc,
BinaryOperatorKind Opcode,
Expr *LHS, Expr *RHS);
ExprResult checkPseudoObjectRValue(Expr *E);
Expr *recreateSyntacticForm(PseudoObjectExpr *E);
QualType CheckConditionalOperands( // C99 6.5.15
ExprResult &Cond, ExprResult &LHS, ExprResult &RHS,
ExprValueKind &VK, ExprObjectKind &OK, SourceLocation QuestionLoc);
QualType CXXCheckConditionalOperands( // C++ 5.16
ExprResult &cond, ExprResult &lhs, ExprResult &rhs,
ExprValueKind &VK, ExprObjectKind &OK, SourceLocation questionLoc);
QualType FindCompositePointerType(SourceLocation Loc, Expr *&E1, Expr *&E2,
bool ConvertArgs = true);
QualType FindCompositePointerType(SourceLocation Loc,
ExprResult &E1, ExprResult &E2,
bool ConvertArgs = true) {
Expr *E1Tmp = E1.get(), *E2Tmp = E2.get();
QualType Composite =
FindCompositePointerType(Loc, E1Tmp, E2Tmp, ConvertArgs);
E1 = E1Tmp;
E2 = E2Tmp;
return Composite;
}
QualType FindCompositeObjCPointerType(ExprResult &LHS, ExprResult &RHS,
SourceLocation QuestionLoc);
bool DiagnoseConditionalForNull(Expr *LHSExpr, Expr *RHSExpr,
SourceLocation QuestionLoc);
void DiagnoseAlwaysNonNullPointer(Expr *E,
Expr::NullPointerConstantKind NullType,
bool IsEqual, SourceRange Range);
/// type checking for vector binary operators.
QualType CheckVectorOperands(ExprResult &LHS, ExprResult &RHS,
SourceLocation Loc, bool IsCompAssign,
bool AllowBothBool, bool AllowBoolConversion);
QualType GetSignedVectorType(QualType V);
QualType CheckVectorCompareOperands(ExprResult &LHS, ExprResult &RHS,
SourceLocation Loc,
BinaryOperatorKind Opc);
QualType CheckVectorLogicalOperands(ExprResult &LHS, ExprResult &RHS,
SourceLocation Loc);
bool areLaxCompatibleVectorTypes(QualType srcType, QualType destType);
bool isLaxVectorConversion(QualType srcType, QualType destType);
/// type checking declaration initializers (C99 6.7.8)
bool CheckForConstantInitializer(Expr *e, QualType t);
// type checking C++ declaration initializers (C++ [dcl.init]).
/// ReferenceCompareResult - Expresses the result of comparing two
/// types (cv1 T1 and cv2 T2) to determine their compatibility for the
/// purposes of initialization by reference (C++ [dcl.init.ref]p4).
enum ReferenceCompareResult {
/// Ref_Incompatible - The two types are incompatible, so direct
/// reference binding is not possible.
Ref_Incompatible = 0,
/// Ref_Related - The two types are reference-related, which means
/// that their unqualified forms (T1 and T2) are either the same
/// or T1 is a base class of T2.
Ref_Related,
/// Ref_Compatible - The two types are reference-compatible.
Ref_Compatible
};
ReferenceCompareResult
CompareReferenceRelationship(SourceLocation Loc, QualType T1, QualType T2,
bool &DerivedToBase, bool &ObjCConversion,
bool &ObjCLifetimeConversion,
bool &FunctionConversion);
ExprResult checkUnknownAnyCast(SourceRange TypeRange, QualType CastType,
Expr *CastExpr, CastKind &CastKind,
ExprValueKind &VK, CXXCastPath &Path);
/// Force an expression with unknown-type to an expression of the
/// given type.
ExprResult forceUnknownAnyToType(Expr *E, QualType ToType);
/// Type-check an expression that's being passed to an
/// __unknown_anytype parameter.
ExprResult checkUnknownAnyArg(SourceLocation callLoc,
Expr *result, QualType ¶mType);
// CheckVectorCast - check type constraints for vectors.
// Since vectors are an extension, there are no C standard reference for this.
// We allow casting between vectors and integer datatypes of the same size.
// returns true if the cast is invalid
bool CheckVectorCast(SourceRange R, QualType VectorTy, QualType Ty,
CastKind &Kind);
/// Prepare `SplattedExpr` for a vector splat operation, adding
/// implicit casts if necessary.
ExprResult prepareVectorSplat(QualType VectorTy, Expr *SplattedExpr);
// CheckExtVectorCast - check type constraints for extended vectors.
// Since vectors are an extension, there are no C standard reference for this.
// We allow casting between vectors and integer datatypes of the same size,
// or vectors and the element type of that vector.
// returns the cast expr
ExprResult CheckExtVectorCast(SourceRange R, QualType DestTy, Expr *CastExpr,
CastKind &Kind);
ExprResult BuildCXXFunctionalCastExpr(TypeSourceInfo *TInfo, QualType Type,
SourceLocation LParenLoc,
Expr *CastExpr,
SourceLocation RParenLoc);
enum ARCConversionResult { ACR_okay, ACR_unbridged, ACR_error };
/// Checks for invalid conversions and casts between
/// retainable pointers and other pointer kinds for ARC and Weak.
ARCConversionResult CheckObjCConversion(SourceRange castRange,
QualType castType, Expr *&op,
CheckedConversionKind CCK,
bool Diagnose = true,
bool DiagnoseCFAudited = false,
BinaryOperatorKind Opc = BO_PtrMemD
);
Expr *stripARCUnbridgedCast(Expr *e);
void diagnoseARCUnbridgedCast(Expr *e);
bool CheckObjCARCUnavailableWeakConversion(QualType castType,
QualType ExprType);
/// checkRetainCycles - Check whether an Objective-C message send
/// might create an obvious retain cycle.
void checkRetainCycles(ObjCMessageExpr *msg);
void checkRetainCycles(Expr *receiver, Expr *argument);
void checkRetainCycles(VarDecl *Var, Expr *Init);
/// checkUnsafeAssigns - Check whether +1 expr is being assigned
/// to weak/__unsafe_unretained type.
bool checkUnsafeAssigns(SourceLocation Loc, QualType LHS, Expr *RHS);
/// checkUnsafeExprAssigns - Check whether +1 expr is being assigned
/// to weak/__unsafe_unretained expression.
void checkUnsafeExprAssigns(SourceLocation Loc, Expr *LHS, Expr *RHS);
/// CheckMessageArgumentTypes - Check types in an Obj-C message send.
/// \param Method - May be null.
/// \param [out] ReturnType - The return type of the send.
/// \return true iff there were any incompatible types.
bool CheckMessageArgumentTypes(const Expr *Receiver, QualType ReceiverType,
MultiExprArg Args, Selector Sel,
ArrayRef<SourceLocation> SelectorLocs,
ObjCMethodDecl *Method, bool isClassMessage,
bool isSuperMessage, SourceLocation lbrac,
SourceLocation rbrac, SourceRange RecRange,
QualType &ReturnType, ExprValueKind &VK);
/// Determine the result of a message send expression based on
/// the type of the receiver, the method expected to receive the message,
/// and the form of the message send.
QualType getMessageSendResultType(const Expr *Receiver, QualType ReceiverType,
ObjCMethodDecl *Method, bool isClassMessage,
bool isSuperMessage);
/// If the given expression involves a message send to a method
/// with a related result type, emit a note describing what happened.
void EmitRelatedResultTypeNote(const Expr *E);
/// Given that we had incompatible pointer types in a return
/// statement, check whether we're in a method with a related result
/// type, and if so, emit a note describing what happened.
void EmitRelatedResultTypeNoteForReturn(QualType destType);
class ConditionResult {
Decl *ConditionVar;
FullExprArg Condition;
bool Invalid;
bool HasKnownValue;
bool KnownValue;
friend class Sema;
ConditionResult(Sema &S, Decl *ConditionVar, FullExprArg Condition,
bool IsConstexpr)
: ConditionVar(ConditionVar), Condition(Condition), Invalid(false),
HasKnownValue(IsConstexpr && Condition.get() &&
!Condition.get()->isValueDependent()),
KnownValue(HasKnownValue &&
!!Condition.get()->EvaluateKnownConstInt(S.Context)) {}
explicit ConditionResult(bool Invalid)
: ConditionVar(nullptr), Condition(nullptr), Invalid(Invalid),
HasKnownValue(false), KnownValue(false) {}
public:
ConditionResult() : ConditionResult(false) {}
bool isInvalid() const { return Invalid; }
std::pair<VarDecl *, Expr *> get() const {
return std::make_pair(cast_or_null<VarDecl>(ConditionVar),
Condition.get());
}
llvm::Optional<bool> getKnownValue() const {
if (!HasKnownValue)
return None;
return KnownValue;
}
};
static ConditionResult ConditionError() { return ConditionResult(true); }
enum class ConditionKind {
Boolean, ///< A boolean condition, from 'if', 'while', 'for', or 'do'.
ConstexprIf, ///< A constant boolean condition from 'if constexpr'.
Switch ///< An integral condition for a 'switch' statement.
};
ConditionResult ActOnCondition(Scope *S, SourceLocation Loc,
Expr *SubExpr, ConditionKind CK);
ConditionResult ActOnConditionVariable(Decl *ConditionVar,
SourceLocation StmtLoc,
ConditionKind CK);
DeclResult ActOnCXXConditionDeclaration(Scope *S, Declarator &D);
ExprResult CheckConditionVariable(VarDecl *ConditionVar,
SourceLocation StmtLoc,
ConditionKind CK);
ExprResult CheckSwitchCondition(SourceLocation SwitchLoc, Expr *Cond);
/// CheckBooleanCondition - Diagnose problems involving the use of
/// the given expression as a boolean condition (e.g. in an if
/// statement). Also performs the standard function and array
/// decays, possibly changing the input variable.
///
/// \param Loc - A location associated with the condition, e.g. the
/// 'if' keyword.
/// \return true iff there were any errors
ExprResult CheckBooleanCondition(SourceLocation Loc, Expr *E,
bool IsConstexpr = false);
/// ActOnExplicitBoolSpecifier - Build an ExplicitSpecifier from an expression
/// found in an explicit(bool) specifier.
ExplicitSpecifier ActOnExplicitBoolSpecifier(Expr *E);
/// tryResolveExplicitSpecifier - Attempt to resolve the explict specifier.
/// Returns true if the explicit specifier is now resolved.
bool tryResolveExplicitSpecifier(ExplicitSpecifier &ExplicitSpec);
/// DiagnoseAssignmentAsCondition - Given that an expression is
/// being used as a boolean condition, warn if it's an assignment.
void DiagnoseAssignmentAsCondition(Expr *E);
/// Redundant parentheses over an equality comparison can indicate
/// that the user intended an assignment used as condition.
void DiagnoseEqualityWithExtraParens(ParenExpr *ParenE);
/// CheckCXXBooleanCondition - Returns true if conversion to bool is invalid.
ExprResult CheckCXXBooleanCondition(Expr *CondExpr, bool IsConstexpr = false);
/// ConvertIntegerToTypeWarnOnOverflow - Convert the specified APInt to have
/// the specified width and sign. If an overflow occurs, detect it and emit
/// the specified diagnostic.
void ConvertIntegerToTypeWarnOnOverflow(llvm::APSInt &OldVal,
unsigned NewWidth, bool NewSign,
SourceLocation Loc, unsigned DiagID);
/// Checks that the Objective-C declaration is declared in the global scope.
/// Emits an error and marks the declaration as invalid if it's not declared
/// in the global scope.
bool CheckObjCDeclScope(Decl *D);
/// Abstract base class used for diagnosing integer constant
/// expression violations.
class VerifyICEDiagnoser {
public:
bool Suppress;
VerifyICEDiagnoser(bool Suppress = false) : Suppress(Suppress) { }
virtual void diagnoseNotICE(Sema &S, SourceLocation Loc, SourceRange SR) =0;
virtual void diagnoseFold(Sema &S, SourceLocation Loc, SourceRange SR);
virtual ~VerifyICEDiagnoser() { }
};
/// VerifyIntegerConstantExpression - Verifies that an expression is an ICE,
/// and reports the appropriate diagnostics. Returns false on success.
/// Can optionally return the value of the expression.
ExprResult VerifyIntegerConstantExpression(Expr *E, llvm::APSInt *Result,
VerifyICEDiagnoser &Diagnoser,
bool AllowFold = true);
ExprResult VerifyIntegerConstantExpression(Expr *E, llvm::APSInt *Result,
unsigned DiagID,
bool AllowFold = true);
ExprResult VerifyIntegerConstantExpression(Expr *E,
llvm::APSInt *Result = nullptr);
/// VerifyBitField - verifies that a bit field expression is an ICE and has
/// the correct width, and that the field type is valid.
/// Returns false on success.
/// Can optionally return whether the bit-field is of width 0
ExprResult VerifyBitField(SourceLocation FieldLoc, IdentifierInfo *FieldName,
QualType FieldTy, bool IsMsStruct,
Expr *BitWidth, bool *ZeroWidth = nullptr);
private:
unsigned ForceCUDAHostDeviceDepth = 0;
public:
/// Increments our count of the number of times we've seen a pragma forcing
/// functions to be __host__ __device__. So long as this count is greater
/// than zero, all functions encountered will be __host__ __device__.
void PushForceCUDAHostDevice();
/// Decrements our count of the number of times we've seen a pragma forcing
/// functions to be __host__ __device__. Returns false if the count is 0
/// before incrementing, so you can emit an error.
bool PopForceCUDAHostDevice();
/// Diagnostics that are emitted only if we discover that the given function
/// must be codegen'ed. Because handling these correctly adds overhead to
/// compilation, this is currently only enabled for CUDA compilations.
llvm::DenseMap<CanonicalDeclPtr<FunctionDecl>,
std::vector<PartialDiagnosticAt>>
DeviceDeferredDiags;
/// A pair of a canonical FunctionDecl and a SourceLocation. When used as the
/// key in a hashtable, both the FD and location are hashed.
struct FunctionDeclAndLoc {
CanonicalDeclPtr<FunctionDecl> FD;
SourceLocation Loc;
};
/// FunctionDecls and SourceLocations for which CheckCUDACall has emitted a
/// (maybe deferred) "bad call" diagnostic. We use this to avoid emitting the
/// same deferred diag twice.
llvm::DenseSet<FunctionDeclAndLoc> LocsWithCUDACallDiags;
/// An inverse call graph, mapping known-emitted functions to one of their
/// known-emitted callers (plus the location of the call).
///
/// Functions that we can tell a priori must be emitted aren't added to this
/// map.
llvm::DenseMap</* Callee = */ CanonicalDeclPtr<FunctionDecl>,
/* Caller = */ FunctionDeclAndLoc>
DeviceKnownEmittedFns;
/// A partial call graph maintained during CUDA/OpenMP device code compilation
/// to support deferred diagnostics.
///
/// Functions are only added here if, at the time they're considered, they are
/// not known-emitted. As soon as we discover that a function is
/// known-emitted, we remove it and everything it transitively calls from this
/// set and add those functions to DeviceKnownEmittedFns.
llvm::DenseMap</* Caller = */ CanonicalDeclPtr<FunctionDecl>,
/* Callees = */ llvm::MapVector<CanonicalDeclPtr<FunctionDecl>,
SourceLocation>>
DeviceCallGraph;
/// Diagnostic builder for CUDA/OpenMP devices errors which may or may not be
/// deferred.
///
/// In CUDA, there exist constructs (e.g. variable-length arrays, try/catch)
/// which are not allowed to appear inside __device__ functions and are
/// allowed to appear in __host__ __device__ functions only if the host+device
/// function is never codegen'ed.
///
/// To handle this, we use the notion of "deferred diagnostics", where we
/// attach a diagnostic to a FunctionDecl that's emitted iff it's codegen'ed.
///
/// This class lets you emit either a regular diagnostic, a deferred
/// diagnostic, or no diagnostic at all, according to an argument you pass to
/// its constructor, thus simplifying the process of creating these "maybe
/// deferred" diagnostics.
class DeviceDiagBuilder {
public:
enum Kind {
/// Emit no diagnostics.
K_Nop,
/// Emit the diagnostic immediately (i.e., behave like Sema::Diag()).
K_Immediate,
/// Emit the diagnostic immediately, and, if it's a warning or error, also
/// emit a call stack showing how this function can be reached by an a
/// priori known-emitted function.
K_ImmediateWithCallStack,
/// Create a deferred diagnostic, which is emitted only if the function
/// it's attached to is codegen'ed. Also emit a call stack as with
/// K_ImmediateWithCallStack.
K_Deferred
};
DeviceDiagBuilder(Kind K, SourceLocation Loc, unsigned DiagID,
FunctionDecl *Fn, Sema &S);
DeviceDiagBuilder(DeviceDiagBuilder &&D);
DeviceDiagBuilder(const DeviceDiagBuilder &) = default;
~DeviceDiagBuilder();
/// Convertible to bool: True if we immediately emitted an error, false if
/// we didn't emit an error or we created a deferred error.
///
/// Example usage:
///
/// if (DeviceDiagBuilder(...) << foo << bar)
/// return ExprError();
///
/// But see CUDADiagIfDeviceCode() and CUDADiagIfHostCode() -- you probably
/// want to use these instead of creating a DeviceDiagBuilder yourself.
operator bool() const { return ImmediateDiag.hasValue(); }
template <typename T>
friend const DeviceDiagBuilder &operator<<(const DeviceDiagBuilder &Diag,
const T &Value) {
if (Diag.ImmediateDiag.hasValue())
*Diag.ImmediateDiag << Value;
else if (Diag.PartialDiagId.hasValue())
Diag.S.DeviceDeferredDiags[Diag.Fn][*Diag.PartialDiagId].second
<< Value;
return Diag;
}
private:
Sema &S;
SourceLocation Loc;
unsigned DiagID;
FunctionDecl *Fn;
bool ShowCallStack;
// Invariant: At most one of these Optionals has a value.
// FIXME: Switch these to a Variant once that exists.
llvm::Optional<SemaDiagnosticBuilder> ImmediateDiag;
llvm::Optional<unsigned> PartialDiagId;
};
/// Indicate that this function (and thus everything it transtively calls)
/// will be codegen'ed, and emit any deferred diagnostics on this function and
/// its (transitive) callees.
void markKnownEmitted(
Sema &S, FunctionDecl *OrigCaller, FunctionDecl *OrigCallee,
SourceLocation OrigLoc,
const llvm::function_ref<bool(Sema &, FunctionDecl *)> IsKnownEmitted);
/// Creates a DeviceDiagBuilder that emits the diagnostic if the current context
/// is "used as device code".
///
/// - If CurContext is a __host__ function, does not emit any diagnostics.
/// - If CurContext is a __device__ or __global__ function, emits the
/// diagnostics immediately.
/// - If CurContext is a __host__ __device__ function and we are compiling for
/// the device, creates a diagnostic which is emitted if and when we realize
/// that the function will be codegen'ed.
///
/// Example usage:
///
/// // Variable-length arrays are not allowed in CUDA device code.
/// if (CUDADiagIfDeviceCode(Loc, diag::err_cuda_vla) << CurrentCUDATarget())
/// return ExprError();
/// // Otherwise, continue parsing as normal.
DeviceDiagBuilder CUDADiagIfDeviceCode(SourceLocation Loc, unsigned DiagID);
/// Creates a DeviceDiagBuilder that emits the diagnostic if the current context
/// is "used as host code".
///
/// Same as CUDADiagIfDeviceCode, with "host" and "device" switched.
DeviceDiagBuilder CUDADiagIfHostCode(SourceLocation Loc, unsigned DiagID);
/// Creates a DeviceDiagBuilder that emits the diagnostic if the current
/// context is "used as device code".
///
/// - If CurContext is a `declare target` function or it is known that the
/// function is emitted for the device, emits the diagnostics immediately.
/// - If CurContext is a non-`declare target` function and we are compiling
/// for the device, creates a diagnostic which is emitted if and when we
/// realize that the function will be codegen'ed.
///
/// Example usage:
///
/// // Variable-length arrays are not allowed in NVPTX device code.
/// if (diagIfOpenMPDeviceCode(Loc, diag::err_vla_unsupported))
/// return ExprError();
/// // Otherwise, continue parsing as normal.
DeviceDiagBuilder diagIfOpenMPDeviceCode(SourceLocation Loc, unsigned DiagID);
/// Creates a DeviceDiagBuilder that emits the diagnostic if the current
/// context is "used as host code".
///
/// - If CurContext is a `declare target` function or it is known that the
/// function is emitted for the host, emits the diagnostics immediately.
/// - If CurContext is a non-host function, just ignore it.
///
/// Example usage:
///
/// // Variable-length arrays are not allowed in NVPTX device code.
/// if (diagIfOpenMPHostode(Loc, diag::err_vla_unsupported))
/// return ExprError();
/// // Otherwise, continue parsing as normal.
DeviceDiagBuilder diagIfOpenMPHostCode(SourceLocation Loc, unsigned DiagID);
DeviceDiagBuilder targetDiag(SourceLocation Loc, unsigned DiagID);
enum CUDAFunctionTarget {
CFT_Device,
CFT_Global,
CFT_Host,
CFT_HostDevice,
CFT_InvalidTarget
};
/// Determines whether the given function is a CUDA device/host/kernel/etc.
/// function.
///
/// Use this rather than examining the function's attributes yourself -- you
/// will get it wrong. Returns CFT_Host if D is null.
CUDAFunctionTarget IdentifyCUDATarget(const FunctionDecl *D,
bool IgnoreImplicitHDAttr = false);
CUDAFunctionTarget IdentifyCUDATarget(const ParsedAttributesView &Attrs);
/// Gets the CUDA target for the current context.
CUDAFunctionTarget CurrentCUDATarget() {
return IdentifyCUDATarget(dyn_cast<FunctionDecl>(CurContext));
}
// CUDA function call preference. Must be ordered numerically from
// worst to best.
enum CUDAFunctionPreference {
CFP_Never, // Invalid caller/callee combination.
CFP_WrongSide, // Calls from host-device to host or device
// function that do not match current compilation
// mode.
CFP_HostDevice, // Any calls to host/device functions.
CFP_SameSide, // Calls from host-device to host or device
// function matching current compilation mode.
CFP_Native, // host-to-host or device-to-device calls.
};
/// Identifies relative preference of a given Caller/Callee
/// combination, based on their host/device attributes.
/// \param Caller function which needs address of \p Callee.
/// nullptr in case of global context.
/// \param Callee target function
///
/// \returns preference value for particular Caller/Callee combination.
CUDAFunctionPreference IdentifyCUDAPreference(const FunctionDecl *Caller,
const FunctionDecl *Callee);
/// Determines whether Caller may invoke Callee, based on their CUDA
/// host/device attributes. Returns false if the call is not allowed.
///
/// Note: Will return true for CFP_WrongSide calls. These may appear in
/// semantically correct CUDA programs, but only if they're never codegen'ed.
bool IsAllowedCUDACall(const FunctionDecl *Caller,
const FunctionDecl *Callee) {
return IdentifyCUDAPreference(Caller, Callee) != CFP_Never;
}
/// May add implicit CUDAHostAttr and CUDADeviceAttr attributes to FD,
/// depending on FD and the current compilation settings.
void maybeAddCUDAHostDeviceAttrs(FunctionDecl *FD,
const LookupResult &Previous);
public:
/// Check whether we're allowed to call Callee from the current context.
///
/// - If the call is never allowed in a semantically-correct program
/// (CFP_Never), emits an error and returns false.
///
/// - If the call is allowed in semantically-correct programs, but only if
/// it's never codegen'ed (CFP_WrongSide), creates a deferred diagnostic to
/// be emitted if and when the caller is codegen'ed, and returns true.
///
/// Will only create deferred diagnostics for a given SourceLocation once,
/// so you can safely call this multiple times without generating duplicate
/// deferred errors.
///
/// - Otherwise, returns true without emitting any diagnostics.
bool CheckCUDACall(SourceLocation Loc, FunctionDecl *Callee);
/// Set __device__ or __host__ __device__ attributes on the given lambda
/// operator() method.
///
/// CUDA lambdas declared inside __device__ or __global__ functions inherit
/// the __device__ attribute. Similarly, lambdas inside __host__ __device__
/// functions become __host__ __device__ themselves.
void CUDASetLambdaAttrs(CXXMethodDecl *Method);
/// Finds a function in \p Matches with highest calling priority
/// from \p Caller context and erases all functions with lower
/// calling priority.
void EraseUnwantedCUDAMatches(
const FunctionDecl *Caller,
SmallVectorImpl<std::pair<DeclAccessPair, FunctionDecl *>> &Matches);
/// Given a implicit special member, infer its CUDA target from the
/// calls it needs to make to underlying base/field special members.
/// \param ClassDecl the class for which the member is being created.
/// \param CSM the kind of special member.
/// \param MemberDecl the special member itself.
/// \param ConstRHS true if this is a copy operation with a const object on
/// its RHS.
/// \param Diagnose true if this call should emit diagnostics.
/// \return true if there was an error inferring.
/// The result of this call is implicit CUDA target attribute(s) attached to
/// the member declaration.
bool inferCUDATargetForImplicitSpecialMember(CXXRecordDecl *ClassDecl,
CXXSpecialMember CSM,
CXXMethodDecl *MemberDecl,
bool ConstRHS,
bool Diagnose);
/// \return true if \p CD can be considered empty according to CUDA
/// (E.2.3.1 in CUDA 7.5 Programming guide).
bool isEmptyCudaConstructor(SourceLocation Loc, CXXConstructorDecl *CD);
bool isEmptyCudaDestructor(SourceLocation Loc, CXXDestructorDecl *CD);
// \brief Checks that initializers of \p Var satisfy CUDA restrictions. In
// case of error emits appropriate diagnostic and invalidates \p Var.
//
// \details CUDA allows only empty constructors as initializers for global
// variables (see E.2.3.1, CUDA 7.5). The same restriction also applies to all
// __shared__ variables whether they are local or not (they all are implicitly
// static in CUDA). One exception is that CUDA allows constant initializers
// for __constant__ and __device__ variables.
void checkAllowedCUDAInitializer(VarDecl *VD);
/// Check whether NewFD is a valid overload for CUDA. Emits
/// diagnostics and invalidates NewFD if not.
void checkCUDATargetOverload(FunctionDecl *NewFD,
const LookupResult &Previous);
/// Copies target attributes from the template TD to the function FD.
void inheritCUDATargetAttrs(FunctionDecl *FD, const FunctionTemplateDecl &TD);
/// Returns the name of the launch configuration function. This is the name
/// of the function that will be called to configure kernel call, with the
/// parameters specified via <<<>>>.
std::string getCudaConfigureFuncName() const;
/// \name Code completion
//@{
/// Describes the context in which code completion occurs.
enum ParserCompletionContext {
/// Code completion occurs at top-level or namespace context.
PCC_Namespace,
/// Code completion occurs within a class, struct, or union.
PCC_Class,
/// Code completion occurs within an Objective-C interface, protocol,
/// or category.
PCC_ObjCInterface,
/// Code completion occurs within an Objective-C implementation or
/// category implementation
PCC_ObjCImplementation,
/// Code completion occurs within the list of instance variables
/// in an Objective-C interface, protocol, category, or implementation.
PCC_ObjCInstanceVariableList,
/// Code completion occurs following one or more template
/// headers.
PCC_Template,
/// Code completion occurs following one or more template
/// headers within a class.
PCC_MemberTemplate,
/// Code completion occurs within an expression.
PCC_Expression,
/// Code completion occurs within a statement, which may
/// also be an expression or a declaration.
PCC_Statement,
/// Code completion occurs at the beginning of the
/// initialization statement (or expression) in a for loop.
PCC_ForInit,
/// Code completion occurs within the condition of an if,
/// while, switch, or for statement.
PCC_Condition,
/// Code completion occurs within the body of a function on a
/// recovery path, where we do not have a specific handle on our position
/// in the grammar.
PCC_RecoveryInFunction,
/// Code completion occurs where only a type is permitted.
PCC_Type,
/// Code completion occurs in a parenthesized expression, which
/// might also be a type cast.
PCC_ParenthesizedExpression,
/// Code completion occurs within a sequence of declaration
/// specifiers within a function, method, or block.
PCC_LocalDeclarationSpecifiers
};
void CodeCompleteModuleImport(SourceLocation ImportLoc, ModuleIdPath Path);
void CodeCompleteOrdinaryName(Scope *S,
ParserCompletionContext CompletionContext);
void CodeCompleteDeclSpec(Scope *S, DeclSpec &DS,
bool AllowNonIdentifiers,
bool AllowNestedNameSpecifiers);
struct CodeCompleteExpressionData;
void CodeCompleteExpression(Scope *S,
const CodeCompleteExpressionData &Data);
void CodeCompleteExpression(Scope *S, QualType PreferredType,
bool IsParenthesized = false);
void CodeCompleteMemberReferenceExpr(Scope *S, Expr *Base, Expr *OtherOpBase,
SourceLocation OpLoc, bool IsArrow,
bool IsBaseExprStatement,
QualType PreferredType);
void CodeCompletePostfixExpression(Scope *S, ExprResult LHS,
QualType PreferredType);
void CodeCompleteTag(Scope *S, unsigned TagSpec);
void CodeCompleteTypeQualifiers(DeclSpec &DS);
void CodeCompleteFunctionQualifiers(DeclSpec &DS, Declarator &D,
const VirtSpecifiers *VS = nullptr);
void CodeCompleteBracketDeclarator(Scope *S);
void CodeCompleteCase(Scope *S);
/// Reports signatures for a call to CodeCompleteConsumer and returns the
/// preferred type for the current argument. Returned type can be null.
QualType ProduceCallSignatureHelp(Scope *S, Expr *Fn, ArrayRef<Expr *> Args,
SourceLocation OpenParLoc);
QualType ProduceConstructorSignatureHelp(Scope *S, QualType Type,
SourceLocation Loc,
ArrayRef<Expr *> Args,
SourceLocation OpenParLoc);
QualType ProduceCtorInitMemberSignatureHelp(Scope *S, Decl *ConstructorDecl,
CXXScopeSpec SS,
ParsedType TemplateTypeTy,
ArrayRef<Expr *> ArgExprs,
IdentifierInfo *II,
SourceLocation OpenParLoc);
void CodeCompleteInitializer(Scope *S, Decl *D);
void CodeCompleteAfterIf(Scope *S);
void CodeCompleteQualifiedId(Scope *S, CXXScopeSpec &SS, bool EnteringContext,
bool IsUsingDeclaration, QualType BaseType,
QualType PreferredType);
void CodeCompleteUsing(Scope *S);
void CodeCompleteUsingDirective(Scope *S);
void CodeCompleteNamespaceDecl(Scope *S);
void CodeCompleteNamespaceAliasDecl(Scope *S);
void CodeCompleteOperatorName(Scope *S);
void CodeCompleteConstructorInitializer(
Decl *Constructor,
ArrayRef<CXXCtorInitializer *> Initializers);
void CodeCompleteLambdaIntroducer(Scope *S, LambdaIntroducer &Intro,
bool AfterAmpersand);
void CodeCompleteObjCAtDirective(Scope *S);
void CodeCompleteObjCAtVisibility(Scope *S);
void CodeCompleteObjCAtStatement(Scope *S);
void CodeCompleteObjCAtExpression(Scope *S);
void CodeCompleteObjCPropertyFlags(Scope *S, ObjCDeclSpec &ODS);
void CodeCompleteObjCPropertyGetter(Scope *S);
void CodeCompleteObjCPropertySetter(Scope *S);
void CodeCompleteObjCPassingType(Scope *S, ObjCDeclSpec &DS,
bool IsParameter);
void CodeCompleteObjCMessageReceiver(Scope *S);
void CodeCompleteObjCSuperMessage(Scope *S, SourceLocation SuperLoc,
ArrayRef<IdentifierInfo *> SelIdents,
bool AtArgumentExpression);
void CodeCompleteObjCClassMessage(Scope *S, ParsedType Receiver,
ArrayRef<IdentifierInfo *> SelIdents,
bool AtArgumentExpression,
bool IsSuper = false);
void CodeCompleteObjCInstanceMessage(Scope *S, Expr *Receiver,
ArrayRef<IdentifierInfo *> SelIdents,
bool AtArgumentExpression,
ObjCInterfaceDecl *Super = nullptr);
void CodeCompleteObjCForCollection(Scope *S,
DeclGroupPtrTy IterationVar);
void CodeCompleteObjCSelector(Scope *S,
ArrayRef<IdentifierInfo *> SelIdents);
void CodeCompleteObjCProtocolReferences(
ArrayRef<IdentifierLocPair> Protocols);
void CodeCompleteObjCProtocolDecl(Scope *S);
void CodeCompleteObjCInterfaceDecl(Scope *S);
void CodeCompleteObjCSuperclass(Scope *S,
IdentifierInfo *ClassName,
SourceLocation ClassNameLoc);
void CodeCompleteObjCImplementationDecl(Scope *S);
void CodeCompleteObjCInterfaceCategory(Scope *S,
IdentifierInfo *ClassName,
SourceLocation ClassNameLoc);
void CodeCompleteObjCImplementationCategory(Scope *S,
IdentifierInfo *ClassName,
SourceLocation ClassNameLoc);
void CodeCompleteObjCPropertyDefinition(Scope *S);
void CodeCompleteObjCPropertySynthesizeIvar(Scope *S,
IdentifierInfo *PropertyName);
void CodeCompleteObjCMethodDecl(Scope *S, Optional<bool> IsInstanceMethod,
ParsedType ReturnType);
void CodeCompleteObjCMethodDeclSelector(Scope *S,
bool IsInstanceMethod,
bool AtParameterName,
ParsedType ReturnType,
ArrayRef<IdentifierInfo *> SelIdents);
void CodeCompleteObjCClassPropertyRefExpr(Scope *S, IdentifierInfo &ClassName,
SourceLocation ClassNameLoc,
bool IsBaseExprStatement);
void CodeCompletePreprocessorDirective(bool InConditional);
void CodeCompleteInPreprocessorConditionalExclusion(Scope *S);
void CodeCompletePreprocessorMacroName(bool IsDefinition);
void CodeCompletePreprocessorExpression();
void CodeCompletePreprocessorMacroArgument(Scope *S,
IdentifierInfo *Macro,
MacroInfo *MacroInfo,
unsigned Argument);
void CodeCompleteIncludedFile(llvm::StringRef Dir, bool IsAngled);
void CodeCompleteNaturalLanguage();
void CodeCompleteAvailabilityPlatformName();
void GatherGlobalCodeCompletions(CodeCompletionAllocator &Allocator,
CodeCompletionTUInfo &CCTUInfo,
SmallVectorImpl<CodeCompletionResult> &Results);
//@}
//===--------------------------------------------------------------------===//
// Extra semantic analysis beyond the C type system
public:
SourceLocation getLocationOfStringLiteralByte(const StringLiteral *SL,
unsigned ByteNo) const;
private:
void CheckArrayAccess(const Expr *BaseExpr, const Expr *IndexExpr,
const ArraySubscriptExpr *ASE=nullptr,
bool AllowOnePastEnd=true, bool IndexNegated=false);
void CheckArrayAccess(const Expr *E);
// Used to grab the relevant information from a FormatAttr and a
// FunctionDeclaration.
struct FormatStringInfo {
unsigned FormatIdx;
unsigned FirstDataArg;
bool HasVAListArg;
};
static bool getFormatStringInfo(const FormatAttr *Format, bool IsCXXMember,
FormatStringInfo *FSI);
bool CheckFunctionCall(FunctionDecl *FDecl, CallExpr *TheCall,
const FunctionProtoType *Proto);
bool CheckObjCMethodCall(ObjCMethodDecl *Method, SourceLocation loc,
ArrayRef<const Expr *> Args);
bool CheckPointerCall(NamedDecl *NDecl, CallExpr *TheCall,
const FunctionProtoType *Proto);
bool CheckOtherCall(CallExpr *TheCall, const FunctionProtoType *Proto);
void CheckConstructorCall(FunctionDecl *FDecl,
ArrayRef<const Expr *> Args,
const FunctionProtoType *Proto,
SourceLocation Loc);
void checkCall(NamedDecl *FDecl, const FunctionProtoType *Proto,
const Expr *ThisArg, ArrayRef<const Expr *> Args,
bool IsMemberFunction, SourceLocation Loc, SourceRange Range,
VariadicCallType CallType);
bool CheckObjCString(Expr *Arg);
ExprResult CheckOSLogFormatStringArg(Expr *Arg);
ExprResult CheckBuiltinFunctionCall(FunctionDecl *FDecl,
unsigned BuiltinID, CallExpr *TheCall);
void checkFortifiedBuiltinMemoryFunction(FunctionDecl *FD, CallExpr *TheCall);
bool CheckARMBuiltinExclusiveCall(unsigned BuiltinID, CallExpr *TheCall,
unsigned MaxWidth);
bool CheckNeonBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckMVEBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckARMBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckAArch64BuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckBPFBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckHexagonBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckHexagonBuiltinCpu(unsigned BuiltinID, CallExpr *TheCall);
bool CheckHexagonBuiltinArgument(unsigned BuiltinID, CallExpr *TheCall);
bool CheckMipsBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckSystemZBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckX86BuiltinRoundingOrSAE(unsigned BuiltinID, CallExpr *TheCall);
bool CheckX86BuiltinGatherScatterScale(unsigned BuiltinID, CallExpr *TheCall);
bool CheckX86BuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool CheckPPCBuiltinFunctionCall(unsigned BuiltinID, CallExpr *TheCall);
bool SemaBuiltinVAStart(unsigned BuiltinID, CallExpr *TheCall);
bool SemaBuiltinVAStartARMMicrosoft(CallExpr *Call);
bool SemaBuiltinUnorderedCompare(CallExpr *TheCall);
bool SemaBuiltinFPClassification(CallExpr *TheCall, unsigned NumArgs);
bool SemaBuiltinVSX(CallExpr *TheCall);
bool SemaBuiltinOSLogFormat(CallExpr *TheCall);
public:
// Used by C++ template instantiation.
ExprResult SemaBuiltinShuffleVector(CallExpr *TheCall);
ExprResult SemaConvertVectorExpr(Expr *E, TypeSourceInfo *TInfo,
SourceLocation BuiltinLoc,
SourceLocation RParenLoc);
private:
bool SemaBuiltinPrefetch(CallExpr *TheCall);
bool SemaBuiltinAllocaWithAlign(CallExpr *TheCall);
bool SemaBuiltinAssume(CallExpr *TheCall);
bool SemaBuiltinAssumeAligned(CallExpr *TheCall);
bool SemaBuiltinLongjmp(CallExpr *TheCall);
bool SemaBuiltinSetjmp(CallExpr *TheCall);
ExprResult SemaBuiltinAtomicOverloaded(ExprResult TheCallResult);
ExprResult SemaBuiltinNontemporalOverloaded(ExprResult TheCallResult);
ExprResult SemaAtomicOpsOverloaded(ExprResult TheCallResult,
AtomicExpr::AtomicOp Op);
ExprResult SemaBuiltinOperatorNewDeleteOverloaded(ExprResult TheCallResult,
bool IsDelete);
bool SemaBuiltinConstantArg(CallExpr *TheCall, int ArgNum,
llvm::APSInt &Result);
bool SemaBuiltinConstantArgRange(CallExpr *TheCall, int ArgNum, int Low,
int High, bool RangeIsError = true);
bool SemaBuiltinConstantArgMultiple(CallExpr *TheCall, int ArgNum,
unsigned Multiple);
bool SemaBuiltinConstantArgPower2(CallExpr *TheCall, int ArgNum);
bool SemaBuiltinConstantArgShiftedByte(CallExpr *TheCall, int ArgNum);
bool SemaBuiltinConstantArgShiftedByteOrXXFF(CallExpr *TheCall, int ArgNum);
bool SemaBuiltinARMSpecialReg(unsigned BuiltinID, CallExpr *TheCall,
int ArgNum, unsigned ExpectedFieldNum,
bool AllowName);
bool SemaBuiltinARMMemoryTaggingCall(unsigned BuiltinID, CallExpr *TheCall);
public:
enum FormatStringType {
FST_Scanf,
FST_Printf,
FST_NSString,
FST_Strftime,
FST_Strfmon,
FST_Kprintf,
FST_FreeBSDKPrintf,
FST_OSTrace,
FST_OSLog,
FST_Unknown
};
static FormatStringType GetFormatStringType(const FormatAttr *Format);
bool FormatStringHasSArg(const StringLiteral *FExpr);
static bool GetFormatNSStringIdx(const FormatAttr *Format, unsigned &Idx);
private:
bool CheckFormatArguments(const FormatAttr *Format,
ArrayRef<const Expr *> Args,
bool IsCXXMember,
VariadicCallType CallType,
SourceLocation Loc, SourceRange Range,
llvm::SmallBitVector &CheckedVarArgs);
bool CheckFormatArguments(ArrayRef<const Expr *> Args,
bool HasVAListArg, unsigned format_idx,
unsigned firstDataArg, FormatStringType Type,
VariadicCallType CallType,
SourceLocation Loc, SourceRange range,
llvm::SmallBitVector &CheckedVarArgs);
void CheckAbsoluteValueFunction(const CallExpr *Call,
const FunctionDecl *FDecl);
void CheckMaxUnsignedZero(const CallExpr *Call, const FunctionDecl *FDecl);
void CheckMemaccessArguments(const CallExpr *Call,
unsigned BId,
IdentifierInfo *FnName);
void CheckStrlcpycatArguments(const CallExpr *Call,
IdentifierInfo *FnName);
void CheckStrncatArguments(const CallExpr *Call,
IdentifierInfo *FnName);
void CheckReturnValExpr(Expr *RetValExp, QualType lhsType,
SourceLocation ReturnLoc,
bool isObjCMethod = false,
const AttrVec *Attrs = nullptr,
const FunctionDecl *FD = nullptr);
public:
void CheckFloatComparison(SourceLocation Loc, Expr *LHS, Expr *RHS);
private:
void CheckImplicitConversions(Expr *E, SourceLocation CC = SourceLocation());
void CheckBoolLikeConversion(Expr *E, SourceLocation CC);
void CheckForIntOverflow(Expr *E);
void CheckUnsequencedOperations(Expr *E);
/// Perform semantic checks on a completed expression. This will either
/// be a full-expression or a default argument expression.
void CheckCompletedExpr(Expr *E, SourceLocation CheckLoc = SourceLocation(),
bool IsConstexpr = false);
void CheckBitFieldInitialization(SourceLocation InitLoc, FieldDecl *Field,
Expr *Init);
/// Check if there is a field shadowing.
void CheckShadowInheritedFields(const SourceLocation &Loc,
DeclarationName FieldName,
const CXXRecordDecl *RD,
bool DeclIsField = true);
/// Check if the given expression contains 'break' or 'continue'
/// statement that produces control flow different from GCC.
void CheckBreakContinueBinding(Expr *E);
/// Check whether receiver is mutable ObjC container which
/// attempts to add itself into the container
void CheckObjCCircularContainer(ObjCMessageExpr *Message);
void AnalyzeDeleteExprMismatch(const CXXDeleteExpr *DE);
void AnalyzeDeleteExprMismatch(FieldDecl *Field, SourceLocation DeleteLoc,
bool DeleteWasArrayForm);
public:
/// Register a magic integral constant to be used as a type tag.
void RegisterTypeTagForDatatype(const IdentifierInfo *ArgumentKind,
uint64_t MagicValue, QualType Type,
bool LayoutCompatible, bool MustBeNull);
struct TypeTagData {
TypeTagData() {}
TypeTagData(QualType Type, bool LayoutCompatible, bool MustBeNull) :
Type(Type), LayoutCompatible(LayoutCompatible),
MustBeNull(MustBeNull)
{}
QualType Type;
/// If true, \c Type should be compared with other expression's types for
/// layout-compatibility.
unsigned LayoutCompatible : 1;
unsigned MustBeNull : 1;
};
/// A pair of ArgumentKind identifier and magic value. This uniquely
/// identifies the magic value.
typedef std::pair<const IdentifierInfo *, uint64_t> TypeTagMagicValue;
private:
/// A map from magic value to type information.
std::unique_ptr<llvm::DenseMap<TypeTagMagicValue, TypeTagData>>
TypeTagForDatatypeMagicValues;
/// Peform checks on a call of a function with argument_with_type_tag
/// or pointer_with_type_tag attributes.
void CheckArgumentWithTypeTag(const ArgumentWithTypeTagAttr *Attr,
const ArrayRef<const Expr *> ExprArgs,
SourceLocation CallSiteLoc);
/// Check if we are taking the address of a packed field
/// as this may be a problem if the pointer value is dereferenced.
void CheckAddressOfPackedMember(Expr *rhs);
/// The parser's current scope.
///
/// The parser maintains this state here.
Scope *CurScope;
mutable IdentifierInfo *Ident_super;
mutable IdentifierInfo *Ident___float128;
/// Nullability type specifiers.
IdentifierInfo *Ident__Nonnull = nullptr;
IdentifierInfo *Ident__Nullable = nullptr;
IdentifierInfo *Ident__Null_unspecified = nullptr;
IdentifierInfo *Ident_NSError = nullptr;
/// The handler for the FileChanged preprocessor events.
///
/// Used for diagnostics that implement custom semantic analysis for #include
/// directives, like -Wpragma-pack.
sema::SemaPPCallbacks *SemaPPCallbackHandler;
protected:
friend class Parser;
friend class InitializationSequence;
friend class ASTReader;
friend class ASTDeclReader;
friend class ASTWriter;
public:
/// Retrieve the keyword associated
IdentifierInfo *getNullabilityKeyword(NullabilityKind nullability);
/// The struct behind the CFErrorRef pointer.
RecordDecl *CFError = nullptr;
bool isCFError(RecordDecl *D);
/// Retrieve the identifier "NSError".
IdentifierInfo *getNSErrorIdent();
/// Retrieve the parser's current scope.
///
/// This routine must only be used when it is certain that semantic analysis
/// and the parser are in precisely the same context, which is not the case
/// when, e.g., we are performing any kind of template instantiation.
/// Therefore, the only safe places to use this scope are in the parser
/// itself and in routines directly invoked from the parser and *never* from
/// template substitution or instantiation.
Scope *getCurScope() const { return CurScope; }
void incrementMSManglingNumber() const {
return CurScope->incrementMSManglingNumber();
}
IdentifierInfo *getSuperIdentifier() const;
IdentifierInfo *getFloat128Identifier() const;
Decl *getObjCDeclContext() const;
DeclContext *getCurLexicalContext() const {
return OriginalLexicalContext ? OriginalLexicalContext : CurContext;
}
const DeclContext *getCurObjCLexicalContext() const {
const DeclContext *DC = getCurLexicalContext();
// A category implicitly has the attribute of the interface.
if (const ObjCCategoryDecl *CatD = dyn_cast<ObjCCategoryDecl>(DC))
DC = CatD->getClassInterface();
return DC;
}
/// To be used for checking whether the arguments being passed to
/// function exceeds the number of parameters expected for it.
static bool TooManyArguments(size_t NumParams, size_t NumArgs,
bool PartialOverloading = false) {
// We check whether we're just after a comma in code-completion.
if (NumArgs > 0 && PartialOverloading)
return NumArgs + 1 > NumParams; // If so, we view as an extra argument.
return NumArgs > NumParams;
}
// Emitting members of dllexported classes is delayed until the class
// (including field initializers) is fully parsed.
SmallVector<CXXRecordDecl*, 4> DelayedDllExportClasses;
SmallVector<CXXMethodDecl*, 4> DelayedDllExportMemberFunctions;
private:
class SavePendingParsedClassStateRAII {
public:
SavePendingParsedClassStateRAII(Sema &S) : S(S) { swapSavedState(); }
~SavePendingParsedClassStateRAII() {
assert(S.DelayedOverridingExceptionSpecChecks.empty() &&
"there shouldn't be any pending delayed exception spec checks");
assert(S.DelayedEquivalentExceptionSpecChecks.empty() &&
"there shouldn't be any pending delayed exception spec checks");
assert(S.DelayedDllExportClasses.empty() &&
"there shouldn't be any pending delayed DLL export classes");
swapSavedState();
}
private:
Sema &S;
decltype(DelayedOverridingExceptionSpecChecks)
SavedOverridingExceptionSpecChecks;
decltype(DelayedEquivalentExceptionSpecChecks)
SavedEquivalentExceptionSpecChecks;
decltype(DelayedDllExportClasses) SavedDllExportClasses;
void swapSavedState() {
SavedOverridingExceptionSpecChecks.swap(
S.DelayedOverridingExceptionSpecChecks);
SavedEquivalentExceptionSpecChecks.swap(
S.DelayedEquivalentExceptionSpecChecks);
SavedDllExportClasses.swap(S.DelayedDllExportClasses);
}
};
/// Helper class that collects misaligned member designations and
/// their location info for delayed diagnostics.
struct MisalignedMember {
Expr *E;
RecordDecl *RD;
ValueDecl *MD;
CharUnits Alignment;
MisalignedMember() : E(), RD(), MD(), Alignment() {}
MisalignedMember(Expr *E, RecordDecl *RD, ValueDecl *MD,
CharUnits Alignment)
: E(E), RD(RD), MD(MD), Alignment(Alignment) {}
explicit MisalignedMember(Expr *E)
: MisalignedMember(E, nullptr, nullptr, CharUnits()) {}
bool operator==(const MisalignedMember &m) { return this->E == m.E; }
};
/// Small set of gathered accesses to potentially misaligned members
/// due to the packed attribute.
SmallVector<MisalignedMember, 4> MisalignedMembers;
/// Adds an expression to the set of gathered misaligned members.
void AddPotentialMisalignedMembers(Expr *E, RecordDecl *RD, ValueDecl *MD,
CharUnits Alignment);
public:
/// Diagnoses the current set of gathered accesses. This typically
/// happens at full expression level. The set is cleared after emitting the
/// diagnostics.
void DiagnoseMisalignedMembers();
/// This function checks if the expression is in the sef of potentially
/// misaligned members and it is converted to some pointer type T with lower
/// or equal alignment requirements. If so it removes it. This is used when
/// we do not want to diagnose such misaligned access (e.g. in conversions to
/// void*).
void DiscardMisalignedMemberAddress(const Type *T, Expr *E);
/// This function calls Action when it determines that E designates a
/// misaligned member due to the packed attribute. This is used to emit
/// local diagnostics like in reference binding.
void RefersToMemberWithReducedAlignment(
Expr *E,
llvm::function_ref<void(Expr *, RecordDecl *, FieldDecl *, CharUnits)>
Action);
/// Describes the reason a calling convention specification was ignored, used
/// for diagnostics.
enum class CallingConventionIgnoredReason {
ForThisTarget = 0,
VariadicFunction,
ConstructorDestructor,
BuiltinFunction
};
};
/// RAII object that enters a new expression evaluation context.
class EnterExpressionEvaluationContext {
Sema &Actions;
bool Entered = true;
public:
EnterExpressionEvaluationContext(
Sema &Actions, Sema::ExpressionEvaluationContext NewContext,
Decl *LambdaContextDecl = nullptr,
Sema::ExpressionEvaluationContextRecord::ExpressionKind ExprContext =
Sema::ExpressionEvaluationContextRecord::EK_Other,
bool ShouldEnter = true)
: Actions(Actions), Entered(ShouldEnter) {
if (Entered)
Actions.PushExpressionEvaluationContext(NewContext, LambdaContextDecl,
ExprContext);
}
EnterExpressionEvaluationContext(
Sema &Actions, Sema::ExpressionEvaluationContext NewContext,
Sema::ReuseLambdaContextDecl_t,
Sema::ExpressionEvaluationContextRecord::ExpressionKind ExprContext =
Sema::ExpressionEvaluationContextRecord::EK_Other)
: Actions(Actions) {
Actions.PushExpressionEvaluationContext(
NewContext, Sema::ReuseLambdaContextDecl, ExprContext);
}
enum InitListTag { InitList };
EnterExpressionEvaluationContext(Sema &Actions, InitListTag,
bool ShouldEnter = true)
: Actions(Actions), Entered(false) {
// In C++11 onwards, narrowing checks are performed on the contents of
// braced-init-lists, even when they occur within unevaluated operands.
// Therefore we still need to instantiate constexpr functions used in such
// a context.
if (ShouldEnter && Actions.isUnevaluatedContext() &&
Actions.getLangOpts().CPlusPlus11) {
Actions.PushExpressionEvaluationContext(
Sema::ExpressionEvaluationContext::UnevaluatedList);
Entered = true;
}
}
~EnterExpressionEvaluationContext() {
if (Entered)
Actions.PopExpressionEvaluationContext();
}
};
DeductionFailureInfo
MakeDeductionFailureInfo(ASTContext &Context, Sema::TemplateDeductionResult TDK,
sema::TemplateDeductionInfo &Info);
/// Contains a late templated function.
/// Will be parsed at the end of the translation unit, used by Sema & Parser.
struct LateParsedTemplate {
CachedTokens Toks;
/// The template function declaration to be late parsed.
Decl *D;
};
} // end namespace clang
namespace llvm {
// Hash a FunctionDeclAndLoc by looking at both its FunctionDecl and its
// SourceLocation.
template <> struct DenseMapInfo<clang::Sema::FunctionDeclAndLoc> {
using FunctionDeclAndLoc = clang::Sema::FunctionDeclAndLoc;
using FDBaseInfo = DenseMapInfo<clang::CanonicalDeclPtr<clang::FunctionDecl>>;
static FunctionDeclAndLoc getEmptyKey() {
return {FDBaseInfo::getEmptyKey(), clang::SourceLocation()};
}
static FunctionDeclAndLoc getTombstoneKey() {
return {FDBaseInfo::getTombstoneKey(), clang::SourceLocation()};
}
static unsigned getHashValue(const FunctionDeclAndLoc &FDL) {
return hash_combine(FDBaseInfo::getHashValue(FDL.FD),
FDL.Loc.getRawEncoding());
}
static bool isEqual(const FunctionDeclAndLoc &LHS,
const FunctionDeclAndLoc &RHS) {
return LHS.FD == RHS.FD && LHS.Loc == RHS.Loc;
}
};
} // namespace llvm
#endif
|
inneronly2-orig-no_2pragmas.c | /*
Copyright (c) 2017, Lawrence Livermore National Security, LLC.
Produced at the Lawrence Livermore National Laboratory
Written by Chunhua Liao, Pei-Hung Lin, Joshua Asplund,
Markus Schordan, and Ian Karlin
(email: liao6@llnl.gov, lin32@llnl.gov, asplund1@llnl.gov,
schordan1@llnl.gov, karlin1@llnl.gov)
LLNL-CODE-732144
All rights reserved.
This file is part of DataRaceBench. For details, see
https://github.com/LLNL/dataracebench. Please also see the LICENSE file
for our additional BSD notice.
Redistribution and use in source and binary forms, with
or without modification, are permitted provided that the following
conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the disclaimer below.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the disclaimer (as noted below)
in the documentation and/or other materials provided with the
distribution.
* Neither the name of the LLNS/LLNL nor the names of its contributors
may be used to endorse or promote products derived from this
software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL LAWRENCE LIVERMORE NATIONAL
SECURITY, LLC, THE U.S. DEPARTMENT OF ENERGY OR CONTRIBUTORS BE
LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
THE POSSIBILITY OF SUCH DAMAGE.
*/
//Example with loop-carried data dependence at the outer level loop.
int main()
{
int i,j;
int n=100, m=100;
double b[n][m];
for(i=0;i<n; i++)
for(j=0;j<n; j++)
b[i][j]=(double)(i*j);
for (i=1;i<n;i++)
#pragma omp parallel
#pragma omp for
for (j=1;j<m;j++)
b[i][j]=b[i-1][j-1];
return 0;
}
|
weighted_sptree.h | /*
*
* Copyright (c) 2014, Laurens van der Maaten (Delft University of Technology)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Delft University of Technology.
* 4. Neither the name of the Delft University of Technology nor the names of
* its contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY LAURENS VAN DER MAATEN ''AS IS'' AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL LAURENS VAN DER MAATEN BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
*
*/
/*
*
* Copyright (c) 2014, Nicola Pezzotti (Delft University of Technology)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the Delft University of Technology.
* 4. Neither the name of the Delft University of Technology nor the names of
* its contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY NICOLA PEZZOTTI ''AS IS'' AND ANY EXPRESS
* OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
* EVENT SHALL NICOLA PEZZOTTI BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING
* IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY
* OF SUCH DAMAGE.
*
*/
#ifndef WEIGHTED_SPTREE_H
#define WEIGHTED_SPTREE_H
#include <iostream>
#include <vector>
#include <unordered_map>
#ifdef __USE_GCD__
#include <dispatch/dispatch.h>
#endif
namespace hdi{
namespace dr{
//! Sparse Partitioning Tree used for the Barnes Hut approximation
/*!
Sparse Partitioning Tree used for the Barnes Hut approximation.
The original version was implemented by Laurens van der Maaten,
\author Laurens van der Maaten
\author Nicola Pezzotti
*/
template <typename scalar_type>
class WeightedSPTree{
public:
typedef double hp_scalar_type;
private:
class Cell {
unsigned int _emb_dimension;
hp_scalar_type* corner;
hp_scalar_type* width;
public:
Cell(unsigned int emb_dimension);
Cell(unsigned int emb_dimension, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
~Cell();
hp_scalar_type getCorner(unsigned int d);
hp_scalar_type getWidth(unsigned int d);
void setCorner(unsigned int d, hp_scalar_type val);
void setWidth(unsigned int d, hp_scalar_type val);
bool containsPoint(scalar_type point[]);
};
// Fixed constants
static const unsigned int QT_NODE_CAPACITY = 1;
// A buffer we use when doing force computations
//hp_scalar_type* buff;
// Properties of this node in the tree
WeightedSPTree* parent;
unsigned int _emb_dimension;
bool is_leaf;
unsigned int size;
hp_scalar_type cum_size;
// Axis-aligned bounding box stored as a center with half-_emb_dimensions to represent the boundaries of this quad tree
Cell* boundary;
// Indices in this space-partitioning tree node, corresponding center-of-mass, and list of all children
scalar_type* _emb_positions;
const scalar_type* _weights;
hp_scalar_type* _center_of_mass;
unsigned int index[QT_NODE_CAPACITY];
// Children
WeightedSPTree** children;
unsigned int no_children;
public:
WeightedSPTree(unsigned int D, scalar_type* inp_data, const scalar_type* weights, unsigned int N);
private:
WeightedSPTree(unsigned int D, scalar_type* inp_data, const scalar_type* weights, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
WeightedSPTree(unsigned int D, scalar_type* inp_data, const scalar_type* weights, unsigned int N, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
WeightedSPTree(WeightedSPTree* inp_parent, unsigned int D, scalar_type* inp_data, const scalar_type* weights, unsigned int N, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
WeightedSPTree(WeightedSPTree* inp_parent, unsigned int D, scalar_type* inp_data, const scalar_type* weights, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
public:
~WeightedSPTree();
void setData(scalar_type* inp_data, const scalar_type* weights);
WeightedSPTree* getParent();
void construct(Cell boundary);
bool insert(unsigned int new_index);
void subdivide();
bool isCorrect();
void rebuildTree();
void getAllIndices(unsigned int* indices);
unsigned int getDepth();
void computeNonEdgeForces(unsigned int point_index, hp_scalar_type theta, hp_scalar_type neg_f[], hp_scalar_type& sum_Q)const;
template <class sparse_scalar_matrix_type>
void computeEdgeForces(const sparse_scalar_matrix_type& matrix, hp_scalar_type multiplier, hp_scalar_type* pos_f)const;
void print();
private:
void init(WeightedSPTree* inp_parent, unsigned int D, scalar_type* inp_data, const scalar_type* weights, hp_scalar_type* inp_corner, hp_scalar_type* inp_width);
void fill(unsigned int N);
unsigned int getAllIndices(unsigned int* indices, unsigned int loc);
bool isChild(unsigned int test_index, unsigned int start, unsigned int end);
};
/////////////////////////////////////////////////////////////////
template <typename scalar_type>
template <class sparse_scalar_matrix_type>
void WeightedSPTree<scalar_type>::computeEdgeForces(const sparse_scalar_matrix_type& sparse_matrix, hp_scalar_type multiplier, hp_scalar_type* pos_f)const{
const int n = sparse_matrix.size();
// Loop over all edges in the graph
#ifdef __USE_GCD__
std::cout << "GCD dispatch, weighted_sptree 176.\n";
dispatch_apply(n, dispatch_get_global_queue(0, 0), ^(size_t j) {
#else
#pragma omp parallel for
for(int j = 0; j < n; ++j){
#endif //__USE_GCD__
std::vector<hp_scalar_type> buff(_emb_dimension,0);
unsigned int ind1, ind2;
hp_scalar_type q_ij_1;
ind1 = j * _emb_dimension;
for(auto elem: sparse_matrix[j]) {
// Compute pairwise distance and Q-value
q_ij_1 = 1.0;
ind2 = elem.first * _emb_dimension;
for(unsigned int d = 0; d < _emb_dimension; d++)
buff[d] = _emb_positions[ind1 + d] - _emb_positions[ind2 + d]; //buff contains (yi-yj) per each _emb_dimension
for(unsigned int d = 0; d < _emb_dimension; d++)
q_ij_1 += buff[d] * buff[d];
hp_scalar_type p_ij = elem.second;
hp_scalar_type res = hp_scalar_type(p_ij) * multiplier / q_ij_1 / n;
// Sum positive force
for(unsigned int d = 0; d < _emb_dimension; d++)
pos_f[ind1 + d] += res * buff[d] * multiplier; //(p_ij*q_j*mult) * (yi-yj)
}
}
#ifdef __USE_GCD__
);
#endif
}
}
}
#endif
|
decorate.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% DDDD EEEEE CCCC OOO RRRR AAA TTTTT EEEEE %
% D D E C O O R R A A T E %
% D D EEE C O O RRRR AAAAA T EEE %
% D D E C O O R R A A T E %
% DDDD EEEEE CCCC OOO R R A A T EEEEE %
% %
% %
% MagickCore Image Decoration Methods %
% %
% Software Design %
% Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2017 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% http://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
%
*/
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/color-private.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/composite.h"
#include "MagickCore/decorate.h"
#include "MagickCore/exception.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/image.h"
#include "MagickCore/memory_.h"
#include "MagickCore/monitor.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/pixel-accessor.h"
#include "MagickCore/quantum.h"
#include "MagickCore/quantum-private.h"
#include "MagickCore/resource_.h"
#include "MagickCore/thread-private.h"
#include "MagickCore/transform.h"
/*
Define declarations.
*/
#define AccentuateModulate ScaleCharToQuantum(80)
#define HighlightModulate ScaleCharToQuantum(125)
#define ShadowModulate ScaleCharToQuantum(135)
#define DepthModulate ScaleCharToQuantum(185)
#define TroughModulate ScaleCharToQuantum(110)
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% B o r d e r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% BorderImage() surrounds the image with a border of the color defined by
% the bordercolor member of the image structure. The width and height
% of the border are defined by the corresponding members of the border_info
% structure.
%
% The format of the BorderImage method is:
%
% Image *BorderImage(const Image *image,const RectangleInfo *border_info,
% const CompositeOperator compose,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o border_info: define the width and height of the border.
%
% o compose: the composite operator.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *BorderImage(const Image *image,
const RectangleInfo *border_info,const CompositeOperator compose,
ExceptionInfo *exception)
{
Image
*border_image,
*clone_image;
FrameInfo
frame_info;
assert(image != (const Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(border_info != (RectangleInfo *) NULL);
frame_info.width=image->columns+(border_info->width << 1);
frame_info.height=image->rows+(border_info->height << 1);
frame_info.x=(ssize_t) border_info->width;
frame_info.y=(ssize_t) border_info->height;
frame_info.inner_bevel=0;
frame_info.outer_bevel=0;
clone_image=CloneImage(image,0,0,MagickTrue,exception);
if (clone_image == (Image *) NULL)
return((Image *) NULL);
clone_image->matte_color=image->border_color;
border_image=FrameImage(clone_image,&frame_info,compose,exception);
clone_image=DestroyImage(clone_image);
if (border_image != (Image *) NULL)
border_image->matte_color=image->matte_color;
return(border_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% F r a m e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% FrameImage() adds a simulated three-dimensional border around the image.
% The color of the border is defined by the matte_color member of image.
% Members width and height of frame_info specify the border width of the
% vertical and horizontal sides of the frame. Members inner and outer
% indicate the width of the inner and outer shadows of the frame.
%
% The format of the FrameImage method is:
%
% Image *FrameImage(const Image *image,const FrameInfo *frame_info,
% const CompositeOperator compose,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o frame_info: Define the width and height of the frame and its bevels.
%
% o compose: the composite operator.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *FrameImage(const Image *image,const FrameInfo *frame_info,
const CompositeOperator compose,ExceptionInfo *exception)
{
#define FrameImageTag "Frame/Image"
CacheView
*image_view,
*frame_view;
Image
*frame_image;
MagickBooleanType
status;
MagickOffsetType
progress;
PixelInfo
accentuate,
highlight,
matte,
shadow,
trough;
register ssize_t
x;
size_t
bevel_width,
height,
width;
ssize_t
y;
/*
Check frame geometry.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(frame_info != (FrameInfo *) NULL);
if ((frame_info->outer_bevel < 0) || (frame_info->inner_bevel < 0))
ThrowImageException(OptionError,"FrameIsLessThanImageSize");
bevel_width=(size_t) (frame_info->outer_bevel+frame_info->inner_bevel);
x=(ssize_t) frame_info->width-frame_info->x-bevel_width;
y=(ssize_t) frame_info->height-frame_info->y-bevel_width;
if ((x < (ssize_t) image->columns) | (y < (ssize_t) image->rows))
ThrowImageException(OptionError,"FrameIsLessThanImageSize");
/*
Initialize framed image attributes.
*/
frame_image=CloneImage(image,frame_info->width,frame_info->height,MagickTrue,
exception);
if (frame_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(frame_image,DirectClass,exception) == MagickFalse)
{
frame_image=DestroyImage(frame_image);
return((Image *) NULL);
}
if ((IsPixelInfoGray(&frame_image->border_color) == MagickFalse) &&
(IsGrayColorspace(frame_image->colorspace) != MagickFalse))
(void) SetImageColorspace(frame_image,sRGBColorspace,exception);
if ((frame_image->matte_color.alpha_trait != UndefinedPixelTrait) &&
(frame_image->alpha_trait == UndefinedPixelTrait))
(void) SetImageAlpha(frame_image,OpaqueAlpha,exception);
frame_image->page=image->page;
if ((image->page.width != 0) && (image->page.height != 0))
{
frame_image->page.width+=frame_image->columns-image->columns;
frame_image->page.height+=frame_image->rows-image->rows;
}
/*
Initialize 3D effects color.
*/
matte=image->matte_color;
accentuate=matte;
accentuate.red=(double) (QuantumScale*((QuantumRange-
AccentuateModulate)*matte.red+(QuantumRange*AccentuateModulate)));
accentuate.green=(double) (QuantumScale*((QuantumRange-
AccentuateModulate)*matte.green+(QuantumRange*AccentuateModulate)));
accentuate.blue=(double) (QuantumScale*((QuantumRange-
AccentuateModulate)*matte.blue+(QuantumRange*AccentuateModulate)));
accentuate.black=(double) (QuantumScale*((QuantumRange-
AccentuateModulate)*matte.black+(QuantumRange*AccentuateModulate)));
accentuate.alpha=matte.alpha;
highlight=matte;
highlight.red=(double) (QuantumScale*((QuantumRange-
HighlightModulate)*matte.red+(QuantumRange*HighlightModulate)));
highlight.green=(double) (QuantumScale*((QuantumRange-
HighlightModulate)*matte.green+(QuantumRange*HighlightModulate)));
highlight.blue=(double) (QuantumScale*((QuantumRange-
HighlightModulate)*matte.blue+(QuantumRange*HighlightModulate)));
highlight.black=(double) (QuantumScale*((QuantumRange-
HighlightModulate)*matte.black+(QuantumRange*HighlightModulate)));
highlight.alpha=matte.alpha;
shadow=matte;
shadow.red=QuantumScale*matte.red*ShadowModulate;
shadow.green=QuantumScale*matte.green*ShadowModulate;
shadow.blue=QuantumScale*matte.blue*ShadowModulate;
shadow.black=QuantumScale*matte.black*ShadowModulate;
shadow.alpha=matte.alpha;
trough=matte;
trough.red=QuantumScale*matte.red*TroughModulate;
trough.green=QuantumScale*matte.green*TroughModulate;
trough.blue=QuantumScale*matte.blue*TroughModulate;
trough.black=QuantumScale*matte.black*TroughModulate;
trough.alpha=matte.alpha;
status=MagickTrue;
progress=0;
image_view=AcquireVirtualCacheView(image,exception);
frame_view=AcquireAuthenticCacheView(frame_image,exception);
height=(size_t) (frame_info->outer_bevel+(frame_info->y-bevel_width)+
frame_info->inner_bevel);
if (height != 0)
{
register ssize_t
x;
register Quantum
*magick_restrict q;
/*
Draw top of ornamental border.
*/
q=QueueCacheViewAuthenticPixels(frame_view,0,0,frame_image->columns,
height,exception);
if (q != (Quantum *) NULL)
{
/*
Draw top of ornamental border.
*/
for (y=0; y < (ssize_t) frame_info->outer_bevel; y++)
{
for (x=0; x < (ssize_t) (frame_image->columns-y); x++)
{
if (x < y)
SetPixelViaPixelInfo(frame_image,&highlight,q);
else
SetPixelViaPixelInfo(frame_image,&accentuate,q);
q+=GetPixelChannels(frame_image);
}
for ( ; x < (ssize_t) frame_image->columns; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
}
for (y=0; y < (ssize_t) (frame_info->y-bevel_width); y++)
{
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
width=frame_image->columns-2*frame_info->outer_bevel;
for (x=0; x < (ssize_t) width; x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
}
for (y=0; y < (ssize_t) frame_info->inner_bevel; y++)
{
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) (frame_info->x-bevel_width); x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
width=image->columns+((size_t) frame_info->inner_bevel << 1)-
y;
for (x=0; x < (ssize_t) width; x++)
{
if (x < y)
SetPixelViaPixelInfo(frame_image,&shadow,q);
else
SetPixelViaPixelInfo(frame_image,&trough,q);
q+=GetPixelChannels(frame_image);
}
for ( ; x < (ssize_t) (image->columns+2*frame_info->inner_bevel); x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
width=frame_info->width-frame_info->x-image->columns-bevel_width;
for (x=0; x < (ssize_t) width; x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
}
(void) SyncCacheViewAuthenticPixels(frame_view,exception);
}
}
/*
Draw sides of ornamental border.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,frame_image,1,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register ssize_t
x;
register Quantum
*magick_restrict q;
size_t
width;
/*
Initialize scanline with matte color.
*/
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(frame_view,0,frame_info->y+y,
frame_image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) (frame_info->x-bevel_width); x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->inner_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
/*
Set frame interior pixels.
*/
{
register const Quantum
*p;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
register ssize_t
i;
if (GetPixelWriteMask(image,q) == 0)
{
SetPixelBackgoundColor(frame_image,q);
p+=GetPixelChannels(image);
q+=GetPixelChannels(frame_image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
PixelTrait frame_traits=GetPixelChannelTraits(frame_image,channel);
if ((traits == UndefinedPixelTrait) ||
(frame_traits == UndefinedPixelTrait))
continue;
SetPixelChannel(frame_image,channel,p[i],q);
}
SetPixelRed(frame_image,GetPixelRed(image,p),q);
SetPixelGreen(frame_image,GetPixelGreen(image,p),q);
SetPixelBlue(frame_image,GetPixelBlue(image,p),q);
SetPixelAlpha(frame_image,GetPixelAlpha(image,p),q);
p+=GetPixelChannels(image);
q+=GetPixelChannels(frame_image);
}
}
for (x=0; x < (ssize_t) frame_info->inner_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
width=frame_info->width-frame_info->x-image->columns-bevel_width;
for (x=0; x < (ssize_t) width; x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
if (SyncCacheViewAuthenticPixels(frame_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_FrameImage)
#endif
proceed=SetImageProgress(image,FrameImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
height=(size_t) (frame_info->inner_bevel+frame_info->height-
frame_info->y-image->rows-bevel_width+frame_info->outer_bevel);
if (height != 0)
{
register ssize_t
x;
register Quantum
*magick_restrict q;
/*
Draw bottom of ornamental border.
*/
q=QueueCacheViewAuthenticPixels(frame_view,0,(ssize_t) (frame_image->rows-
height),frame_image->columns,height,exception);
if (q != (Quantum *) NULL)
{
/*
Draw bottom of ornamental border.
*/
for (y=frame_info->inner_bevel-1; y >= 0; y--)
{
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) (frame_info->x-bevel_width); x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < y; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
for ( ; x < (ssize_t) (image->columns+2*frame_info->inner_bevel); x++)
{
if (x >= (ssize_t) (image->columns+2*frame_info->inner_bevel-y))
SetPixelViaPixelInfo(frame_image,&highlight,q);
else
SetPixelViaPixelInfo(frame_image,&accentuate,q);
q+=GetPixelChannels(frame_image);
}
width=frame_info->width-frame_info->x-image->columns-bevel_width;
for (x=0; x < (ssize_t) width; x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
}
height=frame_info->height-frame_info->y-image->rows-bevel_width;
for (y=0; y < (ssize_t) height; y++)
{
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
width=frame_image->columns-2*frame_info->outer_bevel;
for (x=0; x < (ssize_t) width; x++)
{
SetPixelViaPixelInfo(frame_image,&matte,q);
q+=GetPixelChannels(frame_image);
}
for (x=0; x < (ssize_t) frame_info->outer_bevel; x++)
{
SetPixelViaPixelInfo(frame_image,&shadow,q);
q+=GetPixelChannels(frame_image);
}
}
for (y=frame_info->outer_bevel-1; y >= 0; y--)
{
for (x=0; x < y; x++)
{
SetPixelViaPixelInfo(frame_image,&highlight,q);
q+=GetPixelChannels(frame_image);
}
for ( ; x < (ssize_t) frame_image->columns; x++)
{
if (x >= (ssize_t) (frame_image->columns-y))
SetPixelViaPixelInfo(frame_image,&shadow,q);
else
SetPixelViaPixelInfo(frame_image,&trough,q);
q+=GetPixelChannels(frame_image);
}
}
(void) SyncCacheViewAuthenticPixels(frame_view,exception);
}
}
frame_view=DestroyCacheView(frame_view);
image_view=DestroyCacheView(image_view);
x=(ssize_t) (frame_info->outer_bevel+(frame_info->x-bevel_width)+
frame_info->inner_bevel);
y=(ssize_t) (frame_info->outer_bevel+(frame_info->y-bevel_width)+
frame_info->inner_bevel);
if (status != MagickFalse)
status=CompositeImage(frame_image,image,compose,MagickTrue,x,y,
exception);
if (status == MagickFalse)
frame_image=DestroyImage(frame_image);
return(frame_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R a i s e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% RaiseImage() creates a simulated three-dimensional button-like effect
% by lightening and darkening the edges of the image. Members width and
% height of raise_info define the width of the vertical and horizontal
% edge of the effect.
%
% The format of the RaiseImage method is:
%
% MagickBooleanType RaiseImage(const Image *image,
% const RectangleInfo *raise_info,const MagickBooleanType raise,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o raise_info: Define the width and height of the raise area.
%
% o raise: A value other than zero creates a 3-D raise effect,
% otherwise it has a lowered effect.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType RaiseImage(Image *image,
const RectangleInfo *raise_info,const MagickBooleanType raise,
ExceptionInfo *exception)
{
#define AccentuateFactor ScaleCharToQuantum(135)
#define HighlightFactor ScaleCharToQuantum(190)
#define ShadowFactor ScaleCharToQuantum(190)
#define RaiseImageTag "Raise/Image"
#define TroughFactor ScaleCharToQuantum(135)
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
Quantum
foreground,
background;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(raise_info != (RectangleInfo *) NULL);
if ((image->columns <= (raise_info->width << 1)) ||
(image->rows <= (raise_info->height << 1)))
ThrowBinaryException(OptionError,"ImageSizeMustExceedBevelWidth",
image->filename);
foreground=QuantumRange;
background=(Quantum) 0;
if (raise == MagickFalse)
{
foreground=(Quantum) 0;
background=QuantumRange;
}
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
return(MagickFalse);
/*
Raise image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,image,1,1)
#endif
for (y=0; y < (ssize_t) raise_info->height; y++)
{
register ssize_t
i,
x;
register Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < y; x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*HighlightFactor+(double)
foreground*(QuantumRange-HighlightFactor)));
}
q+=GetPixelChannels(image);
}
for ( ; x < (ssize_t) (image->columns-y); x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*AccentuateFactor+
(double) foreground*(QuantumRange-AccentuateFactor)));
}
q+=GetPixelChannels(image);
}
for ( ; x < (ssize_t) image->columns; x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*ShadowFactor+(double)
background*(QuantumRange-ShadowFactor)));
}
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_RaiseImage)
#endif
proceed=SetImageProgress(image,RaiseImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,image,1,1)
#endif
for (y=(ssize_t) raise_info->height; y < (ssize_t) (image->rows-raise_info->height); y++)
{
register ssize_t
i,
x;
register Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) raise_info->width; x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*HighlightFactor+(double)
foreground*(QuantumRange-HighlightFactor)));
}
q+=GetPixelChannels(image);
}
for ( ; x < (ssize_t) (image->columns-raise_info->width); x++)
q+=GetPixelChannels(image);
for ( ; x < (ssize_t) image->columns; x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*ShadowFactor+(double)
background*(QuantumRange-ShadowFactor)));
}
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_RaiseImage)
#endif
proceed=SetImageProgress(image,RaiseImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,image,1,1)
#endif
for (y=(ssize_t) (image->rows-raise_info->height); y < (ssize_t) image->rows; y++)
{
register ssize_t
i,
x;
register Quantum
*magick_restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) (image->rows-y); x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*HighlightFactor+(double)
foreground*(QuantumRange-HighlightFactor)));
}
q+=GetPixelChannels(image);
}
for ( ; x < (ssize_t) (image->columns-(image->rows-y)); x++)
{
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*TroughFactor+
(double) background*(QuantumRange-TroughFactor)));
}
q+=GetPixelChannels(image);
}
for ( ; x < (ssize_t) image->columns; x++)
{
if (GetPixelWriteMask(image,q) == 0)
{
q+=GetPixelChannels(image);
continue;
}
for (i=0; i < (ssize_t) GetPixelChannels(image); i++)
{
PixelChannel channel=GetPixelChannelChannel(image,i);
PixelTrait traits=GetPixelChannelTraits(image,channel);
if ((traits & UpdatePixelTrait) == 0)
continue;
q[i]=ClampToQuantum(QuantumScale*((double) q[i]*ShadowFactor+(double)
background*(QuantumRange-ShadowFactor)));
}
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_RaiseImage)
#endif
proceed=SetImageProgress(image,RaiseImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
|
omp_sections_nowait.c | <ompts:test>
<ompts:description>Test which checks the omp parallel for nowait directive. It fills an array with values and operates on these in the following.</ompts:description>
<ompts:directive>omp parallel sections nowait</ompts:directive>
<ompts:version>1.0</ompts:version>
<ompts:dependences>omp parallel sections, omp flush</ompts:dependences>
<ompts:testcode>
#include <stdio.h>
#include "omp_testsuite.h"
#include "omp_my_sleep.h"
int <ompts:testcode:functionname>omp_sections_nowait</ompts:testcode:functionname> (FILE * logFile)
{
<ompts:orphan:vars>
int result;
int count;
</ompts:orphan:vars>
int j;
result = 0;
count = 0;
#pragma omp parallel
{
<ompts:orphan>
int rank;
rank = omp_get_thread_num ();
#pragma omp sections <ompts:check>nowait</ompts:check>
{
#pragma omp section
{
fprintf (logFile, "Thread nr %d enters first section and gets sleeping.\n", rank);
my_sleep(SLEEPTIME);
count = 1;
fprintf (logFile, "Thread nr %d woke up an set count to 1.\n", rank);
#pragma omp flush(count)
}
#pragma omp section
{
fprintf (logFile, "Thread nr %d executed work in the first section.\n", rank);
}
}
/* Begin of second sections environment */
#pragma omp sections
{
#pragma omp section
{
fprintf (logFile, "Thread nr %d executed work in the second section.\n", rank);
}
#pragma omp section
{
fprintf (logFile, "Thread nr %d executed work in the second section and controls the value of count\n", rank);
if (count == 0)
result = 1;
fprintf (logFile, "cout was %d", count);
}
}
</ompts:orphan>
}
return result;
}
</ompts:testcode>
</ompts:test>
|
nanort.h | //
// NanoRT, single header only modern ray tracing kernel.
//
/*
The MIT License (MIT)
Copyright (c) 2015 - 2016 Light Transport Entertainment, Inc.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#ifndef NANORT_H_
#define NANORT_H_
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <limits>
#include <memory>
#include <queue>
#include <string>
#include <vector>
namespace nanort {
#ifdef __clang__
#pragma clang diagnostic push
#if __has_warning("-Wzero-as-null-pointer-constant")
#pragma clang diagnostic ignored "-Wzero-as-null-pointer-constant"
#endif
#endif
// Parallelized BVH build is not yet fully tested,
// thus turn off if you face a problem when building BVH.
#define NANORT_ENABLE_PARALLEL_BUILD (1)
// ----------------------------------------------------------------------------
// Small vector class useful for multi-threaded environment.
//
// stack_container.h
//
// Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// This allocator can be used with STL containers to provide a stack buffer
// from which to allocate memory and overflows onto the heap. This stack buffer
// would be allocated on the stack and allows us to avoid heap operations in
// some situations.
//
// STL likes to make copies of allocators, so the allocator itself can't hold
// the data. Instead, we make the creator responsible for creating a
// StackAllocator::Source which contains the data. Copying the allocator
// merely copies the pointer to this shared source, so all allocators created
// based on our allocator will share the same stack buffer.
//
// This stack buffer implementation is very simple. The first allocation that
// fits in the stack buffer will use the stack buffer. Any subsequent
// allocations will not use the stack buffer, even if there is unused room.
// This makes it appropriate for array-like containers, but the caller should
// be sure to reserve() in the container up to the stack buffer size. Otherwise
// the container will allocate a small array which will "use up" the stack
// buffer.
template <typename T, size_t stack_capacity>
class StackAllocator : public std::allocator<T> {
public:
typedef typename std::allocator<T>::pointer pointer;
typedef typename std::allocator<T>::size_type size_type;
// Backing store for the allocator. The container owner is responsible for
// maintaining this for as long as any containers using this allocator are
// live.
struct Source {
Source() : used_stack_buffer_(false) {}
// Casts the buffer in its right type.
T *stack_buffer() { return reinterpret_cast<T *>(stack_buffer_); }
const T *stack_buffer() const {
return reinterpret_cast<const T *>(stack_buffer_);
}
//
// IMPORTANT: Take care to ensure that stack_buffer_ is aligned
// since it is used to mimic an array of T.
// Be careful while declaring any unaligned types (like bool)
// before stack_buffer_.
//
// The buffer itself. It is not of type T because we don't want the
// constructors and destructors to be automatically called. Define a POD
// buffer of the right size instead.
char stack_buffer_[sizeof(T[stack_capacity])];
// Set when the stack buffer is used for an allocation. We do not track
// how much of the buffer is used, only that somebody is using it.
bool used_stack_buffer_;
};
// Used by containers when they want to refer to an allocator of type U.
template <typename U>
struct rebind {
typedef StackAllocator<U, stack_capacity> other;
};
// For the straight up copy c-tor, we can share storage.
StackAllocator(const StackAllocator<T, stack_capacity> &rhs)
: source_(rhs.source_) {}
// ISO C++ requires the following constructor to be defined,
// and std::vector in VC++2008SP1 Release fails with an error
// in the class _Container_base_aux_alloc_real (from <xutility>)
// if the constructor does not exist.
// For this constructor, we cannot share storage; there's
// no guarantee that the Source buffer of Ts is large enough
// for Us.
// TODO(Google): If we were fancy pants, perhaps we could share storage
// iff sizeof(T) == sizeof(U).
template <typename U, size_t other_capacity>
StackAllocator(const StackAllocator<U, other_capacity> &other)
: source_(NULL) {
(void)other;
}
explicit StackAllocator(Source *source) : source_(source) {}
// Actually do the allocation. Use the stack buffer if nobody has used it yet
// and the size requested fits. Otherwise, fall through to the standard
// allocator.
pointer allocate(size_type n, void *hint = 0) {
if (source_ != NULL && !source_->used_stack_buffer_ &&
n <= stack_capacity) {
source_->used_stack_buffer_ = true;
return source_->stack_buffer();
} else {
return std::allocator<T>::allocate(n, hint);
}
}
// Free: when trying to free the stack buffer, just mark it as free. For
// non-stack-buffer pointers, just fall though to the standard allocator.
void deallocate(pointer p, size_type n) {
if (source_ != NULL && p == source_->stack_buffer())
source_->used_stack_buffer_ = false;
else
std::allocator<T>::deallocate(p, n);
}
private:
Source *source_;
};
// A wrapper around STL containers that maintains a stack-sized buffer that the
// initial capacity of the vector is based on. Growing the container beyond the
// stack capacity will transparently overflow onto the heap. The container must
// support reserve().
//
// WATCH OUT: the ContainerType MUST use the proper StackAllocator for this
// type. This object is really intended to be used only internally. You'll want
// to use the wrappers below for different types.
template <typename TContainerType, int stack_capacity>
class StackContainer {
public:
typedef TContainerType ContainerType;
typedef typename ContainerType::value_type ContainedType;
typedef StackAllocator<ContainedType, stack_capacity> Allocator;
// Allocator must be constructed before the container!
StackContainer() : allocator_(&stack_data_), container_(allocator_) {
// Make the container use the stack allocation by reserving our buffer size
// before doing anything else.
container_.reserve(stack_capacity);
}
// Getters for the actual container.
//
// Danger: any copies of this made using the copy constructor must have
// shorter lifetimes than the source. The copy will share the same allocator
// and therefore the same stack buffer as the original. Use std::copy to
// copy into a "real" container for longer-lived objects.
ContainerType &container() { return container_; }
const ContainerType &container() const { return container_; }
// Support operator-> to get to the container. This allows nicer syntax like:
// StackContainer<...> foo;
// std::sort(foo->begin(), foo->end());
ContainerType *operator->() { return &container_; }
const ContainerType *operator->() const { return &container_; }
#ifdef UNIT_TEST
// Retrieves the stack source so that that unit tests can verify that the
// buffer is being used properly.
const typename Allocator::Source &stack_data() const { return stack_data_; }
#endif
protected:
typename Allocator::Source stack_data_;
unsigned char pad_[7];
Allocator allocator_;
ContainerType container_;
// DISALLOW_EVIL_CONSTRUCTORS(StackContainer);
StackContainer(const StackContainer &);
void operator=(const StackContainer &);
};
// StackVector
//
// Example:
// StackVector<int, 16> foo;
// foo->push_back(22); // we have overloaded operator->
// foo[0] = 10; // as well as operator[]
template <typename T, size_t stack_capacity>
class StackVector
: public StackContainer<std::vector<T, StackAllocator<T, stack_capacity> >,
stack_capacity> {
public:
StackVector()
: StackContainer<std::vector<T, StackAllocator<T, stack_capacity> >,
stack_capacity>() {}
// We need to put this in STL containers sometimes, which requires a copy
// constructor. We can't call the regular copy constructor because that will
// take the stack buffer from the original. Here, we create an empty object
// and make a stack buffer of its own.
StackVector(const StackVector<T, stack_capacity> &other)
: StackContainer<std::vector<T, StackAllocator<T, stack_capacity> >,
stack_capacity>() {
this->container().assign(other->begin(), other->end());
}
StackVector<T, stack_capacity> &operator=(
const StackVector<T, stack_capacity> &other) {
this->container().assign(other->begin(), other->end());
return *this;
}
// Vectors are commonly indexed, which isn't very convenient even with
// operator-> (using "->at()" does exception stuff we don't want).
T &operator[](size_t i) { return this->container().operator[](i); }
const T &operator[](size_t i) const {
return this->container().operator[](i);
}
};
// ----------------------------------------------------------------------------
template <typename T = float>
class real3 {
public:
real3() {}
real3(T x) {
v[0] = x;
v[1] = x;
v[2] = x;
}
real3(T xx, T yy, T zz) {
v[0] = xx;
v[1] = yy;
v[2] = zz;
}
explicit real3(const T *p) {
v[0] = p[0];
v[1] = p[1];
v[2] = p[2];
}
inline T x() const { return v[0]; }
inline T y() const { return v[1]; }
inline T z() const { return v[2]; }
real3 operator*(T f) const { return real3(x() * f, y() * f, z() * f); }
real3 operator-(const real3 &f2) const {
return real3(x() - f2.x(), y() - f2.y(), z() - f2.z());
}
real3 operator*(const real3 &f2) const {
return real3(x() * f2.x(), y() * f2.y(), z() * f2.z());
}
real3 operator+(const real3 &f2) const {
return real3(x() + f2.x(), y() + f2.y(), z() + f2.z());
}
real3 &operator+=(const real3 &f2) {
v[0] += f2.x();
v[1] += f2.y();
v[2] += f2.z();
return (*this);
}
real3 operator/(const real3 &f2) const {
return real3(x() / f2.x(), y() / f2.y(), z() / f2.z());
}
real3 operator-() const { return real3(-x(), -y(), -z()); }
T operator[](int i) const { return v[i]; }
T &operator[](int i) { return v[i]; }
T v[3];
// T pad; // for alignment(when T = float)
};
template <typename T>
inline real3<T> operator*(T f, const real3<T> &v) {
return real3<T>(v.x() * f, v.y() * f, v.z() * f);
}
template <typename T>
inline real3<T> vneg(const real3<T> &rhs) {
return real3<T>(-rhs.x(), -rhs.y(), -rhs.z());
}
template <typename T>
inline T vlength(const real3<T> &rhs) {
return std::sqrt(rhs.x() * rhs.x() + rhs.y() * rhs.y() + rhs.z() * rhs.z());
}
template <typename T>
inline real3<T> vnormalize(const real3<T> &rhs) {
real3<T> v = rhs;
T len = vlength(rhs);
if (std::fabs(len) > std::numeric_limits<T>::epsilon()) {
T inv_len = static_cast<T>(1.0) / len;
v.v[0] *= inv_len;
v.v[1] *= inv_len;
v.v[2] *= inv_len;
}
return v;
}
template <typename T>
inline real3<T> vcross(const real3<T> a, const real3<T> b) {
real3<T> c;
c[0] = a[1] * b[2] - a[2] * b[1];
c[1] = a[2] * b[0] - a[0] * b[2];
c[2] = a[0] * b[1] - a[1] * b[0];
return c;
}
template <typename T>
inline T vdot(const real3<T> a, const real3<T> b) {
return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];
}
template <typename T>
inline real3<T> vsafe_inverse(const real3<T> v) {
real3<T> r;
// TODO(LTE): Handle signed zero using std::signbit() or std::copysign() when C++11 compiler is available.
if (std::fabs(v[0]) < std::numeric_limits<T>::epsilon()) {
r[0] = std::numeric_limits<T>::infinity();
} else {
r[0] = static_cast<T>(1.0) / v[0];
}
if (std::fabs(v[1]) < std::numeric_limits<T>::epsilon()) {
r[1] = std::numeric_limits<T>::infinity();
} else {
r[1] = static_cast<T>(1.0) / v[1];
}
if (std::fabs(v[2]) < std::numeric_limits<T>::epsilon()) {
r[2] = std::numeric_limits<T>::infinity();
} else {
r[2] = static_cast<T>(1.0) / v[2];
}
return r;
}
template <typename real>
inline const real *get_vertex_addr(const real *p, const size_t idx,
const size_t stride_bytes) {
return reinterpret_cast<const real *>(
reinterpret_cast<const unsigned char *>(p) + idx * stride_bytes);
}
template <typename T = float>
class Ray {
public:
Ray() : min_t(static_cast<T>(0.0)), max_t(std::numeric_limits<T>::max()) {
org[0] = static_cast<T>(0.0);
org[1] = static_cast<T>(0.0);
org[2] = static_cast<T>(0.0);
dir[0] = static_cast<T>(0.0);
dir[1] = static_cast<T>(0.0);
dir[2] = static_cast<T>(-1.0);
}
T org[3]; // must set
T dir[3]; // must set
T min_t; // minimum ray hit distance.
T max_t; // maximum ray hit distance.
T inv_dir[3]; // filled internally
int dir_sign[3]; // filled internally
};
template <typename T = float>
class BVHNode {
public:
BVHNode() {}
BVHNode(const BVHNode &rhs) {
bmin[0] = rhs.bmin[0];
bmin[1] = rhs.bmin[1];
bmin[2] = rhs.bmin[2];
flag = rhs.flag;
bmax[0] = rhs.bmax[0];
bmax[1] = rhs.bmax[1];
bmax[2] = rhs.bmax[2];
axis = rhs.axis;
data[0] = rhs.data[0];
data[1] = rhs.data[1];
}
BVHNode &operator=(const BVHNode &rhs) {
bmin[0] = rhs.bmin[0];
bmin[1] = rhs.bmin[1];
bmin[2] = rhs.bmin[2];
flag = rhs.flag;
bmax[0] = rhs.bmax[0];
bmax[1] = rhs.bmax[1];
bmax[2] = rhs.bmax[2];
axis = rhs.axis;
data[0] = rhs.data[0];
data[1] = rhs.data[1];
return (*this);
}
~BVHNode() {}
T bmin[3];
T bmax[3];
int flag; // 1 = leaf node, 0 = branch node
int axis;
// leaf
// data[0] = npoints
// data[1] = index
//
// branch
// data[0] = child[0]
// data[1] = child[1]
unsigned int data[2];
};
template <class H>
class IntersectComparator {
public:
bool operator()(const H &a, const H &b) const { return a.t < b.t; }
};
/// BVH build option.
template <typename T = float>
struct BVHBuildOptions {
T cost_t_aabb;
unsigned int min_leaf_primitives;
unsigned int max_tree_depth;
unsigned int bin_size;
unsigned int shallow_depth;
unsigned int min_primitives_for_parallel_build;
// Cache bounding box computation.
// Requires more memory, but BVHbuild can be faster.
bool cache_bbox;
unsigned char pad[3];
// Set default value: Taabb = 0.2
BVHBuildOptions()
: cost_t_aabb(static_cast<T>(0.2)),
min_leaf_primitives(4),
max_tree_depth(256),
bin_size(64),
shallow_depth(3),
min_primitives_for_parallel_build(1024 * 128),
cache_bbox(false) {}
};
/// BVH build statistics.
class BVHBuildStatistics {
public:
unsigned int max_tree_depth;
unsigned int num_leaf_nodes;
unsigned int num_branch_nodes;
float build_secs;
// Set default value: Taabb = 0.2
BVHBuildStatistics()
: max_tree_depth(0),
num_leaf_nodes(0),
num_branch_nodes(0),
build_secs(0.0f) {}
};
/// BVH trace option.
class BVHTraceOptions {
public:
// Hit only for face IDs in indexRange.
// This feature is good to mimic something like glDrawArrays()
unsigned int prim_ids_range[2];
bool cull_back_face;
unsigned char pad[3]; ///< Padding(not used)
BVHTraceOptions() {
prim_ids_range[0] = 0;
prim_ids_range[1] = 0x7FFFFFFF; // Up to 2G face IDs.
cull_back_face = false;
}
};
template <typename T>
class BBox {
public:
real3<T> bmin;
real3<T> bmax;
BBox() {
bmin[0] = bmin[1] = bmin[2] = std::numeric_limits<T>::max();
bmax[0] = bmax[1] = bmax[2] = -std::numeric_limits<T>::max();
}
};
template <typename T>
class NodeHit {
public:
NodeHit()
: t_min(std::numeric_limits<T>::max()),
t_max(-std::numeric_limits<T>::max()),
node_id(static_cast<unsigned int>(-1)) {}
NodeHit(const NodeHit<T> &rhs) {
t_min = rhs.t_min;
t_max = rhs.t_max;
node_id = rhs.node_id;
}
NodeHit &operator=(const NodeHit<T> &rhs) {
t_min = rhs.t_min;
t_max = rhs.t_max;
node_id = rhs.node_id;
return (*this);
}
~NodeHit() {}
T t_min;
T t_max;
unsigned int node_id;
};
template <typename T>
class NodeHitComparator {
public:
inline bool operator()(const NodeHit<T> &a, const NodeHit<T> &b) {
return a.t_min < b.t_min;
}
};
template <typename T>
class BVHAccel {
public:
BVHAccel() : pad0_(0) { (void)pad0_; }
~BVHAccel() {}
///
/// Build BVH for input primitives.
///
template <class P, class Pred>
bool Build(const unsigned int num_primitives, const P &p, const Pred &pred,
const BVHBuildOptions<T> &options = BVHBuildOptions<T>());
///
/// Get statistics of built BVH tree. Valid after Build()
///
BVHBuildStatistics GetStatistics() const { return stats_; }
///
/// Dump built BVH to the file.
///
bool Dump(const char *filename);
///
/// Load BVH binary
///
bool Load(const char *filename);
void Debug();
///
/// Traverse into BVH along ray and find closest hit point & primitive if
/// found
///
template <class I, class H>
bool Traverse(const Ray<T> &ray, const I &intersector, H *isect,
const BVHTraceOptions &options = BVHTraceOptions()) const;
#if 0
/// Multi-hit ray traversal
/// Returns `max_intersections` frontmost intersections
template<class I, class H, class Comp>
bool MultiHitTraverse(const Ray<T> &ray,
int max_intersections,
const I &intersector,
StackVector<H, 128> *isects,
const BVHTraceOptions &options = BVHTraceOptions()) const;
#endif
///
/// List up nodes which intersects along the ray.
/// This function is useful for two-level BVH traversal.
///
template <class I>
bool ListNodeIntersections(const Ray<T> &ray, int max_intersections,
const I &intersector,
StackVector<NodeHit<T>, 128> *hits) const;
const std::vector<BVHNode<T> > &GetNodes() const { return nodes_; }
const std::vector<unsigned int> &GetIndices() const { return indices_; }
///
/// Returns bounding box of built BVH.
///
void BoundingBox(T bmin[3], T bmax[3]) const {
if (nodes_.empty()) {
bmin[0] = bmin[1] = bmin[2] = std::numeric_limits<T>::max();
bmax[0] = bmax[1] = bmax[2] = -std::numeric_limits<T>::max();
} else {
bmin[0] = nodes_[0].bmin[0];
bmin[1] = nodes_[0].bmin[1];
bmin[2] = nodes_[0].bmin[2];
bmax[0] = nodes_[0].bmax[0];
bmax[1] = nodes_[0].bmax[1];
bmax[2] = nodes_[0].bmax[2];
}
}
bool IsValid() const { return nodes_.size() > 0; }
private:
#if NANORT_ENABLE_PARALLEL_BUILD
typedef struct {
unsigned int left_idx;
unsigned int right_idx;
unsigned int offset;
} ShallowNodeInfo;
// Used only during BVH construction
std::vector<ShallowNodeInfo> shallow_node_infos_;
/// Builds shallow BVH tree recursively.
template <class P, class Pred>
unsigned int BuildShallowTree(std::vector<BVHNode<T> > *out_nodes,
unsigned int left_idx, unsigned int right_idx,
unsigned int depth,
unsigned int max_shallow_depth, const P &p,
const Pred &pred);
#endif
/// Builds BVH tree recursively.
template <class P, class Pred>
unsigned int BuildTree(BVHBuildStatistics *out_stat,
std::vector<BVHNode<T> > *out_nodes,
unsigned int left_idx, unsigned int right_idx,
unsigned int depth, const P &p, const Pred &pred);
template <class I>
bool TestLeafNode(const BVHNode<T> &node, const Ray<T> &ray,
const I &intersector) const;
template <class I>
bool TestLeafNodeIntersections(
const BVHNode<T> &node, const Ray<T> &ray, const int max_intersections,
const I &intersector,
std::priority_queue<NodeHit<T>, std::vector<NodeHit<T> >,
NodeHitComparator<T> > *isect_pq) const;
#if 0
template<class I, class H, class Comp>
bool MultiHitTestLeafNode(std::priority_queue<H, std::vector<H>, Comp> *isect_pq,
int max_intersections,
const BVHNode<T> &node, const Ray<T> &ray,
const I &intersector) const;
#endif
std::vector<BVHNode<T> > nodes_;
std::vector<unsigned int> indices_; // max 4G triangles.
std::vector<BBox<T> > bboxes_;
BVHBuildOptions<T> options_;
BVHBuildStatistics stats_;
unsigned int pad0_;
};
// Predefined SAH predicator for triangle.
template <typename T = float>
class TriangleSAHPred {
public:
TriangleSAHPred(
const T *vertices, const unsigned int *faces,
size_t vertex_stride_bytes) // e.g. 12 for sizeof(float) * XYZ
: axis_(0),
pos_(static_cast<T>(0.0)),
vertices_(vertices),
faces_(faces),
vertex_stride_bytes_(vertex_stride_bytes) {}
void Set(int axis, T pos) const {
axis_ = axis;
pos_ = pos;
}
bool operator()(unsigned int i) const {
int axis = axis_;
T pos = pos_;
unsigned int i0 = faces_[3 * i + 0];
unsigned int i1 = faces_[3 * i + 1];
unsigned int i2 = faces_[3 * i + 2];
real3<T> p0(get_vertex_addr<T>(vertices_, i0, vertex_stride_bytes_));
real3<T> p1(get_vertex_addr<T>(vertices_, i1, vertex_stride_bytes_));
real3<T> p2(get_vertex_addr<T>(vertices_, i2, vertex_stride_bytes_));
T center = p0[axis] + p1[axis] + p2[axis];
return (center < pos * static_cast<T>(3.0));
}
private:
mutable int axis_;
mutable T pos_;
const T *vertices_;
const unsigned int *faces_;
const size_t vertex_stride_bytes_;
};
// Predefined Triangle mesh geometry.
template <typename T = float>
class TriangleMesh {
public:
TriangleMesh(
const T *vertices, const unsigned int *faces,
const size_t vertex_stride_bytes) // e.g. 12 for sizeof(float) * XYZ
: vertices_(vertices),
faces_(faces),
vertex_stride_bytes_(vertex_stride_bytes) {}
/// Compute bounding box for `prim_index`th triangle.
/// This function is called for each primitive in BVH build.
void BoundingBox(real3<T> *bmin, real3<T> *bmax,
unsigned int prim_index) const {
(*bmin)[0] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[0];
(*bmin)[1] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[1];
(*bmin)[2] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[2];
(*bmax)[0] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[0];
(*bmax)[1] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[1];
(*bmax)[2] = get_vertex_addr(vertices_, faces_[3 * prim_index + 0],
vertex_stride_bytes_)[2];
for (unsigned int i = 1; i < 3; i++) {
for (unsigned int k = 0; k < 3; k++) {
if ((*bmin)[static_cast<int>(k)] >
get_vertex_addr<T>(vertices_, faces_[3 * prim_index + i],
vertex_stride_bytes_)[k]) {
(*bmin)[static_cast<int>(k)] = get_vertex_addr<T>(
vertices_, faces_[3 * prim_index + i], vertex_stride_bytes_)[k];
}
if ((*bmax)[static_cast<int>(k)] <
get_vertex_addr<T>(vertices_, faces_[3 * prim_index + i],
vertex_stride_bytes_)[k]) {
(*bmax)[static_cast<int>(k)] = get_vertex_addr<T>(
vertices_, faces_[3 * prim_index + i], vertex_stride_bytes_)[k];
}
}
}
}
const T *vertices_;
const unsigned int *faces_;
const size_t vertex_stride_bytes_;
};
template <typename T = float>
class TriangleIntersection {
public:
T u;
T v;
// Required member variables.
T t;
unsigned int prim_id;
};
template <typename T = float, class H = TriangleIntersection<T> >
class TriangleIntersector {
public:
TriangleIntersector(const T *vertices, const unsigned int *faces,
const size_t vertex_stride_bytes) // e.g.
// vertex_stride_bytes
// = 12 = sizeof(float)
// * 3
: vertices_(vertices),
faces_(faces),
vertex_stride_bytes_(vertex_stride_bytes) {}
// For Watertight Ray/Triangle Intersection.
typedef struct {
T Sx;
T Sy;
T Sz;
int kx;
int ky;
int kz;
} RayCoeff;
/// Do ray interesection stuff for `prim_index` th primitive and return hit
/// distance `t`,
/// varycentric coordinate `u` and `v`.
/// Returns true if there's intersection.
bool Intersect(T *t_inout, const unsigned int prim_index) const {
if ((prim_index < trace_options_.prim_ids_range[0]) ||
(prim_index >= trace_options_.prim_ids_range[1])) {
return false;
}
const unsigned int f0 = faces_[3 * prim_index + 0];
const unsigned int f1 = faces_[3 * prim_index + 1];
const unsigned int f2 = faces_[3 * prim_index + 2];
const real3<T> p0(get_vertex_addr(vertices_, f0 + 0, vertex_stride_bytes_));
const real3<T> p1(get_vertex_addr(vertices_, f1 + 0, vertex_stride_bytes_));
const real3<T> p2(get_vertex_addr(vertices_, f2 + 0, vertex_stride_bytes_));
const real3<T> A = p0 - ray_org_;
const real3<T> B = p1 - ray_org_;
const real3<T> C = p2 - ray_org_;
const T Ax = A[ray_coeff_.kx] - ray_coeff_.Sx * A[ray_coeff_.kz];
const T Ay = A[ray_coeff_.ky] - ray_coeff_.Sy * A[ray_coeff_.kz];
const T Bx = B[ray_coeff_.kx] - ray_coeff_.Sx * B[ray_coeff_.kz];
const T By = B[ray_coeff_.ky] - ray_coeff_.Sy * B[ray_coeff_.kz];
const T Cx = C[ray_coeff_.kx] - ray_coeff_.Sx * C[ray_coeff_.kz];
const T Cy = C[ray_coeff_.ky] - ray_coeff_.Sy * C[ray_coeff_.kz];
T U = Cx * By - Cy * Bx;
T V = Ax * Cy - Ay * Cx;
T W = Bx * Ay - By * Ax;
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wfloat-equal"
#endif
// Fall back to test against edges using double precision.
if (U == static_cast<T>(0.0) || V == static_cast<T>(0.0) || W == static_cast<T>(0.0)) {
double CxBy = static_cast<double>(Cx) * static_cast<double>(By);
double CyBx = static_cast<double>(Cy) * static_cast<double>(Bx);
U = static_cast<T>(CxBy - CyBx);
double AxCy = static_cast<double>(Ax) * static_cast<double>(Cy);
double AyCx = static_cast<double>(Ay) * static_cast<double>(Cx);
V = static_cast<T>(AxCy - AyCx);
double BxAy = static_cast<double>(Bx) * static_cast<double>(Ay);
double ByAx = static_cast<double>(By) * static_cast<double>(Ax);
W = static_cast<T>(BxAy - ByAx);
}
if (trace_options_.cull_back_face) {
if (U < static_cast<T>(0.0) || V < static_cast<T>(0.0) || W < static_cast<T>(0.0)) return false;
} else {
if ((U < static_cast<T>(0.0) || V < static_cast<T>(0.0) || W < static_cast<T>(0.0)) && (U > static_cast<T>(0.0) || V > static_cast<T>(0.0) || W > static_cast<T>(0.0))) {
return false;
}
}
T det = U + V + W;
if (det == static_cast<T>(0.0)) return false;
#ifdef __clang__
#pragma clang diagnostic pop
#endif
const T Az = ray_coeff_.Sz * A[ray_coeff_.kz];
const T Bz = ray_coeff_.Sz * B[ray_coeff_.kz];
const T Cz = ray_coeff_.Sz * C[ray_coeff_.kz];
const T D = U * Az + V * Bz + W * Cz;
const T rcpDet = static_cast<T>(1.0) / det;
T tt = D * rcpDet;
if (tt > (*t_inout)) {
return false;
}
if (tt < t_min_) {
return false;
}
(*t_inout) = tt;
// Use Thomas-Mueller style barycentric coord.
// U + V + W = 1.0 and interp(p) = U * p0 + V * p1 + W * p2
// We want interp(p) = (1 - u - v) * p0 + u * v1 + v * p2;
// => u = V, v = W.
u_ = V * rcpDet;
v_ = W * rcpDet;
return true;
}
/// Returns the nearest hit distance.
T GetT() const { return t_; }
/// Update is called when initializing intesection and nearest hit is found.
void Update(T t, unsigned int prim_idx) const {
t_ = t;
prim_id_ = prim_idx;
}
/// Prepare BVH traversal(e.g. compute inverse ray direction)
/// This function is called only once in BVH traversal.
void PrepareTraversal(const Ray<T> &ray,
const BVHTraceOptions &trace_options) const {
ray_org_[0] = ray.org[0];
ray_org_[1] = ray.org[1];
ray_org_[2] = ray.org[2];
// Calculate dimension where the ray direction is maximal.
ray_coeff_.kz = 0;
T absDir = std::fabs(ray.dir[0]);
if (absDir < std::fabs(ray.dir[1])) {
ray_coeff_.kz = 1;
absDir = std::fabs(ray.dir[1]);
}
if (absDir < std::fabs(ray.dir[2])) {
ray_coeff_.kz = 2;
absDir = std::fabs(ray.dir[2]);
}
ray_coeff_.kx = ray_coeff_.kz + 1;
if (ray_coeff_.kx == 3) ray_coeff_.kx = 0;
ray_coeff_.ky = ray_coeff_.kx + 1;
if (ray_coeff_.ky == 3) ray_coeff_.ky = 0;
// Swap kx and ky dimension to preserve widing direction of triangles.
if (ray.dir[ray_coeff_.kz] < static_cast<T>(0.0)) std::swap(ray_coeff_.kx, ray_coeff_.ky);
// Calculate shear constants.
ray_coeff_.Sx = ray.dir[ray_coeff_.kx] / ray.dir[ray_coeff_.kz];
ray_coeff_.Sy = ray.dir[ray_coeff_.ky] / ray.dir[ray_coeff_.kz];
ray_coeff_.Sz = static_cast<T>(1.0) / ray.dir[ray_coeff_.kz];
trace_options_ = trace_options;
t_min_ = ray.min_t;
u_ = static_cast<T>(0.0);
v_ = static_cast<T>(0.0);
}
/// Post BVH traversal stuff.
/// Fill `isect` if there is a hit.
void PostTraversal(const Ray<T> &ray, bool hit, H *isect) const {
if (hit && isect) {
(*isect).t = t_;
(*isect).u = u_;
(*isect).v = v_;
(*isect).prim_id = prim_id_;
}
(void)ray;
}
private:
const T *vertices_;
const unsigned int *faces_;
const size_t vertex_stride_bytes_;
mutable real3<T> ray_org_;
mutable RayCoeff ray_coeff_;
mutable BVHTraceOptions trace_options_;
mutable T t_min_;
mutable T t_;
mutable T u_;
mutable T v_;
mutable unsigned int prim_id_;
int _pad_;
};
//
// Robust BVH Ray Traversal : http://jcgt.org/published/0002/02/02/paper.pdf
//
// NaN-safe min and max function.
template <class T>
const T &safemin(const T &a, const T &b) {
return (a < b) ? a : b;
}
template <class T>
const T &safemax(const T &a, const T &b) {
return (a > b) ? a : b;
}
//
// SAH functions
//
struct BinBuffer {
explicit BinBuffer(unsigned int size) {
bin_size = size;
bin.resize(2 * 3 * size);
clear();
}
void clear() { memset(&bin[0], 0, sizeof(size_t) * 2 * 3 * bin_size); }
std::vector<size_t> bin; // (min, max) * xyz * binsize
unsigned int bin_size;
unsigned int pad0;
};
template <typename T>
inline T CalculateSurfaceArea(const real3<T> &min, const real3<T> &max) {
real3<T> box = max - min;
return static_cast<T>(2.0) *
(box[0] * box[1] + box[1] * box[2] + box[2] * box[0]);
}
template <typename T>
inline void GetBoundingBoxOfTriangle(real3<T> *bmin, real3<T> *bmax,
const T *vertices,
const unsigned int *faces,
unsigned int index) {
unsigned int f0 = faces[3 * index + 0];
unsigned int f1 = faces[3 * index + 1];
unsigned int f2 = faces[3 * index + 2];
real3<T> p[3];
p[0] = real3<T>(&vertices[3 * f0]);
p[1] = real3<T>(&vertices[3 * f1]);
p[2] = real3<T>(&vertices[3 * f2]);
(*bmin) = p[0];
(*bmax) = p[0];
for (int i = 1; i < 3; i++) {
(*bmin)[0] = std::min((*bmin)[0], p[i][0]);
(*bmin)[1] = std::min((*bmin)[1], p[i][1]);
(*bmin)[2] = std::min((*bmin)[2], p[i][2]);
(*bmax)[0] = std::max((*bmax)[0], p[i][0]);
(*bmax)[1] = std::max((*bmax)[1], p[i][1]);
(*bmax)[2] = std::max((*bmax)[2], p[i][2]);
}
}
template <typename T, class P>
inline void ContributeBinBuffer(BinBuffer *bins, // [out]
const real3<T> &scene_min,
const real3<T> &scene_max,
unsigned int *indices, unsigned int left_idx,
unsigned int right_idx, const P &p) {
T bin_size = static_cast<T>(bins->bin_size);
// Calculate extent
real3<T> scene_size, scene_inv_size;
scene_size = scene_max - scene_min;
for (int i = 0; i < 3; ++i) {
assert(scene_size[i] >= static_cast<T>(0.0));
if (scene_size[i] > static_cast<T>(0.0)) {
scene_inv_size[i] = bin_size / scene_size[i];
} else {
scene_inv_size[i] = static_cast<T>(0.0);
}
}
// Clear bin data
std::fill(bins->bin.begin(), bins->bin.end(), 0);
// memset(&bins->bin[0], 0, sizeof(2 * 3 * bins->bin_size));
size_t idx_bmin[3];
size_t idx_bmax[3];
for (size_t i = left_idx; i < right_idx; i++) {
//
// Quantize the position into [0, BIN_SIZE)
//
// q[i] = (int)(p[i] - scene_bmin) / scene_size
//
real3<T> bmin;
real3<T> bmax;
p.BoundingBox(&bmin, &bmax, indices[i]);
// GetBoundingBoxOfTriangle(&bmin, &bmax, vertices, faces, indices[i]);
real3<T> quantized_bmin = (bmin - scene_min) * scene_inv_size;
real3<T> quantized_bmax = (bmax - scene_min) * scene_inv_size;
// idx is now in [0, BIN_SIZE)
for (int j = 0; j < 3; ++j) {
int q0 = static_cast<int>(quantized_bmin[j]);
if (q0 < 0) q0 = 0;
int q1 = static_cast<int>(quantized_bmax[j]);
if (q1 < 0) q1 = 0;
idx_bmin[j] = static_cast<unsigned int>(q0);
idx_bmax[j] = static_cast<unsigned int>(q1);
if (idx_bmin[j] >= bin_size)
idx_bmin[j] = static_cast<unsigned int>(bin_size) - 1;
if (idx_bmax[j] >= bin_size)
idx_bmax[j] = static_cast<unsigned int>(bin_size) - 1;
assert(idx_bmin[j] < bin_size);
assert(idx_bmax[j] < bin_size);
// Increment bin counter
bins->bin[0 * (bins->bin_size * 3) +
static_cast<size_t>(j) * bins->bin_size + idx_bmin[j]] += 1;
bins->bin[1 * (bins->bin_size * 3) +
static_cast<size_t>(j) * bins->bin_size + idx_bmax[j]] += 1;
}
}
}
template <typename T>
inline T SAH(size_t ns1, T leftArea, size_t ns2, T rightArea, T invS, T Taabb,
T Ttri) {
T sah;
sah = static_cast<T>(2.0) * Taabb +
(leftArea * invS) * static_cast<T>(ns1) * Ttri +
(rightArea * invS) * static_cast<T>(ns2) * Ttri;
return sah;
}
template <typename T>
inline bool FindCutFromBinBuffer(T *cut_pos, // [out] xyz
int *minCostAxis, // [out]
const BinBuffer *bins, const real3<T> &bmin,
const real3<T> &bmax, size_t num_primitives,
T costTaabb) { // should be in [0.0, 1.0]
const T kEPS = std::numeric_limits<T>::epsilon(); // * epsScale;
size_t left, right;
real3<T> bsize, bstep;
real3<T> bminLeft, bmaxLeft;
real3<T> bminRight, bmaxRight;
T saLeft, saRight, saTotal;
T pos;
T minCost[3];
T costTtri = static_cast<T>(1.0) - costTaabb;
(*minCostAxis) = 0;
bsize = bmax - bmin;
bstep = bsize * (static_cast<T>(1.0) / bins->bin_size);
saTotal = CalculateSurfaceArea(bmin, bmax);
T invSaTotal = static_cast<T>(0.0);
if (saTotal > kEPS) {
invSaTotal = static_cast<T>(1.0) / saTotal;
}
for (int j = 0; j < 3; ++j) {
//
// Compute SAH cost for the right side of each cell of the bbox.
// Exclude both extreme side of the bbox.
//
// i: 0 1 2 3
// +----+----+----+----+----+
// | | | | | |
// +----+----+----+----+----+
//
T minCostPos = bmin[j] + static_cast<T>(1.0) * bstep[j];
minCost[j] = std::numeric_limits<T>::max();
left = 0;
right = num_primitives;
bminLeft = bminRight = bmin;
bmaxLeft = bmaxRight = bmax;
for (int i = 0; i < static_cast<int>(bins->bin_size) - 1; ++i) {
left += bins->bin[0 * (3 * bins->bin_size) +
static_cast<size_t>(j) * bins->bin_size +
static_cast<size_t>(i)];
right -= bins->bin[1 * (3 * bins->bin_size) +
static_cast<size_t>(j) * bins->bin_size +
static_cast<size_t>(i)];
assert(left <= num_primitives);
assert(right <= num_primitives);
//
// Split pos bmin + (i + 1) * (bsize / BIN_SIZE)
// +1 for i since we want a position on right side of the cell.
//
pos = bmin[j] + (i + static_cast<T>(1.0)) * bstep[j];
bmaxLeft[j] = pos;
bminRight[j] = pos;
saLeft = CalculateSurfaceArea(bminLeft, bmaxLeft);
saRight = CalculateSurfaceArea(bminRight, bmaxRight);
T cost =
SAH(left, saLeft, right, saRight, invSaTotal, costTaabb, costTtri);
if (cost < minCost[j]) {
//
// Update the min cost
//
minCost[j] = cost;
minCostPos = pos;
// minCostAxis = j;
}
}
cut_pos[j] = minCostPos;
}
// cut_axis = minCostAxis;
// cut_pos = minCostPos;
// Find min cost axis
T cost = minCost[0];
(*minCostAxis) = 0;
if (cost > minCost[1]) {
(*minCostAxis) = 1;
cost = minCost[1];
}
if (cost > minCost[2]) {
(*minCostAxis) = 2;
cost = minCost[2];
}
return true;
}
#ifdef _OPENMP
template <typename T, class P>
void ComputeBoundingBoxOMP(real3<T> *bmin, real3<T> *bmax,
const unsigned int *indices, unsigned int left_index,
unsigned int right_index, const P &p) {
{ p.BoundingBox(bmin, bmax, indices[left_index]); }
T local_bmin[3] = {(*bmin)[0], (*bmin)[1], (*bmin)[2]};
T local_bmax[3] = {(*bmax)[0], (*bmax)[1], (*bmax)[2]};
unsigned int n = right_index - left_index;
#pragma omp parallel firstprivate(local_bmin, local_bmax) if (n > (1024 * 128))
{
#pragma omp parallel for
for (int i = int(left_index); i < int(right_index); i++) { // for each faces
unsigned int idx = indices[i];
real3<T> bbox_min, bbox_max;
p.BoundingBox(&bbox_min, &bbox_max, idx);
for (int k = 0; k < 3; k++) { // xyz
if ((*bmin)[k] > bbox_min[k]) (*bmin)[k] = bbox_min[k];
if ((*bmax)[k] < bbox_max[k]) (*bmax)[k] = bbox_max[k];
}
}
#pragma omp critical
{
for (int k = 0; k < 3; k++) {
if (local_bmin[k] < (*bmin)[k]) {
{
if (local_bmin[k] < (*bmin)[k]) (*bmin)[k] = local_bmin[k];
}
}
if (local_bmax[k] > (*bmax)[k]) {
{
if (local_bmax[k] > (*bmax)[k]) (*bmax)[k] = local_bmax[k];
}
}
}
}
}
}
#endif
template <typename T, class P>
inline void ComputeBoundingBox(real3<T> *bmin, real3<T> *bmax,
const unsigned int *indices,
unsigned int left_index,
unsigned int right_index, const P &p) {
{
unsigned int idx = indices[left_index];
p.BoundingBox(bmin, bmax, idx);
}
{
for (unsigned int i = left_index + 1; i < right_index;
i++) { // for each primitives
unsigned int idx = indices[i];
real3<T> bbox_min, bbox_max;
p.BoundingBox(&bbox_min, &bbox_max, idx);
for (int k = 0; k < 3; k++) { // xyz
if ((*bmin)[k] > bbox_min[k]) (*bmin)[k] = bbox_min[k];
if ((*bmax)[k] < bbox_max[k]) (*bmax)[k] = bbox_max[k];
}
}
}
}
template <typename T>
inline void GetBoundingBox(real3<T> *bmin, real3<T> *bmax,
const std::vector<BBox<T> > &bboxes,
unsigned int *indices, unsigned int left_index,
unsigned int right_index) {
{
unsigned int i = left_index;
unsigned int idx = indices[i];
(*bmin)[0] = bboxes[idx].bmin[0];
(*bmin)[1] = bboxes[idx].bmin[1];
(*bmin)[2] = bboxes[idx].bmin[2];
(*bmax)[0] = bboxes[idx].bmax[0];
(*bmax)[1] = bboxes[idx].bmax[1];
(*bmax)[2] = bboxes[idx].bmax[2];
}
T local_bmin[3] = {(*bmin)[0], (*bmin)[1], (*bmin)[2]};
T local_bmax[3] = {(*bmax)[0], (*bmax)[1], (*bmax)[2]};
{
for (unsigned int i = left_index; i < right_index; i++) { // for each faces
unsigned int idx = indices[i];
for (int k = 0; k < 3; k++) { // xyz
T minval = bboxes[idx].bmin[k];
T maxval = bboxes[idx].bmax[k];
if (local_bmin[k] > minval) local_bmin[k] = minval;
if (local_bmax[k] < maxval) local_bmax[k] = maxval;
}
}
for (int k = 0; k < 3; k++) {
(*bmin)[k] = local_bmin[k];
(*bmax)[k] = local_bmax[k];
}
}
}
//
// --
//
#if NANORT_ENABLE_PARALLEL_BUILD
template <typename T>
template <class P, class Pred>
unsigned int BVHAccel<T>::BuildShallowTree(std::vector<BVHNode<T> > *out_nodes,
unsigned int left_idx,
unsigned int right_idx,
unsigned int depth,
unsigned int max_shallow_depth,
const P &p, const Pred &pred) {
assert(left_idx <= right_idx);
unsigned int offset = static_cast<unsigned int>(out_nodes->size());
if (stats_.max_tree_depth < depth) {
stats_.max_tree_depth = depth;
}
real3<T> bmin, bmax;
ComputeBoundingBox(&bmin, &bmax, &indices_.at(0), left_idx, right_idx, p);
unsigned int n = right_idx - left_idx;
if ((n <= options_.min_leaf_primitives) ||
(depth >= options_.max_tree_depth)) {
// Create leaf node.
BVHNode<T> leaf;
leaf.bmin[0] = bmin[0];
leaf.bmin[1] = bmin[1];
leaf.bmin[2] = bmin[2];
leaf.bmax[0] = bmax[0];
leaf.bmax[1] = bmax[1];
leaf.bmax[2] = bmax[2];
assert(left_idx < std::numeric_limits<unsigned int>::max());
leaf.flag = 1; // leaf
leaf.data[0] = n;
leaf.data[1] = left_idx;
out_nodes->push_back(leaf); // atomic update
stats_.num_leaf_nodes++;
return offset;
}
//
// Create branch node.
//
if (depth >= max_shallow_depth) {
// Delay to build tree
ShallowNodeInfo info;
info.left_idx = left_idx;
info.right_idx = right_idx;
info.offset = offset;
shallow_node_infos_.push_back(info);
// Add dummy node.
BVHNode<T> node;
node.axis = -1;
node.flag = -1;
out_nodes->push_back(node);
return offset;
} else {
//
// Compute SAH and find best split axis and position
//
int min_cut_axis = 0;
T cut_pos[3] = {0.0, 0.0, 0.0};
BinBuffer bins(options_.bin_size);
ContributeBinBuffer(&bins, bmin, bmax, &indices_.at(0), left_idx, right_idx,
p);
FindCutFromBinBuffer(cut_pos, &min_cut_axis, &bins, bmin, bmax, n,
options_.cost_t_aabb);
// Try all 3 axis until good cut position avaiable.
unsigned int mid_idx = left_idx;
int cut_axis = min_cut_axis;
for (int axis_try = 0; axis_try < 3; axis_try++) {
unsigned int *begin = &indices_[left_idx];
unsigned int *end =
&indices_[right_idx - 1] + 1; // mimics end() iterator.
unsigned int *mid = 0;
// try min_cut_axis first.
cut_axis = (min_cut_axis + axis_try) % 3;
// @fixme { We want some thing like: std::partition(begin, end,
// pred(cut_axis, cut_pos[cut_axis])); }
pred.Set(cut_axis, cut_pos[cut_axis]);
//
// Split at (cut_axis, cut_pos)
// indices_ will be modified.
//
mid = std::partition(begin, end, pred);
mid_idx = left_idx + static_cast<unsigned int>((mid - begin));
if ((mid_idx == left_idx) || (mid_idx == right_idx)) {
// Can't split well.
// Switch to object median(which may create unoptimized tree, but
// stable)
mid_idx = left_idx + (n >> 1);
// Try another axis if there's axis to try.
} else {
// Found good cut. exit loop.
break;
}
}
BVHNode<T> node;
node.axis = cut_axis;
node.flag = 0; // 0 = branch
out_nodes->push_back(node);
unsigned int left_child_index = 0;
unsigned int right_child_index = 0;
left_child_index = BuildShallowTree(out_nodes, left_idx, mid_idx, depth + 1,
max_shallow_depth, p, pred);
right_child_index = BuildShallowTree(out_nodes, mid_idx, right_idx,
depth + 1, max_shallow_depth, p, pred);
(*out_nodes)[offset].data[0] = left_child_index;
(*out_nodes)[offset].data[1] = right_child_index;
(*out_nodes)[offset].bmin[0] = bmin[0];
(*out_nodes)[offset].bmin[1] = bmin[1];
(*out_nodes)[offset].bmin[2] = bmin[2];
(*out_nodes)[offset].bmax[0] = bmax[0];
(*out_nodes)[offset].bmax[1] = bmax[1];
(*out_nodes)[offset].bmax[2] = bmax[2];
}
stats_.num_branch_nodes++;
return offset;
}
#endif
template <typename T>
template <class P, class Pred>
unsigned int BVHAccel<T>::BuildTree(BVHBuildStatistics *out_stat,
std::vector<BVHNode<T> > *out_nodes,
unsigned int left_idx,
unsigned int right_idx, unsigned int depth,
const P &p, const Pred &pred) {
assert(left_idx <= right_idx);
unsigned int offset = static_cast<unsigned int>(out_nodes->size());
if (out_stat->max_tree_depth < depth) {
out_stat->max_tree_depth = depth;
}
real3<T> bmin, bmax;
if (!bboxes_.empty()) {
GetBoundingBox(&bmin, &bmax, bboxes_, &indices_.at(0), left_idx, right_idx);
} else {
ComputeBoundingBox(&bmin, &bmax, &indices_.at(0), left_idx, right_idx, p);
}
unsigned int n = right_idx - left_idx;
if ((n <= options_.min_leaf_primitives) ||
(depth >= options_.max_tree_depth)) {
// Create leaf node.
BVHNode<T> leaf;
leaf.bmin[0] = bmin[0];
leaf.bmin[1] = bmin[1];
leaf.bmin[2] = bmin[2];
leaf.bmax[0] = bmax[0];
leaf.bmax[1] = bmax[1];
leaf.bmax[2] = bmax[2];
assert(left_idx < std::numeric_limits<unsigned int>::max());
leaf.flag = 1; // leaf
leaf.data[0] = n;
leaf.data[1] = left_idx;
out_nodes->push_back(leaf); // atomic update
out_stat->num_leaf_nodes++;
return offset;
}
//
// Create branch node.
//
//
// Compute SAH and find best split axis and position
//
int min_cut_axis = 0;
T cut_pos[3] = {0.0, 0.0, 0.0};
BinBuffer bins(options_.bin_size);
ContributeBinBuffer(&bins, bmin, bmax, &indices_.at(0), left_idx, right_idx,
p);
FindCutFromBinBuffer(cut_pos, &min_cut_axis, &bins, bmin, bmax, n,
options_.cost_t_aabb);
// Try all 3 axis until good cut position avaiable.
unsigned int mid_idx = left_idx;
int cut_axis = min_cut_axis;
for (int axis_try = 0; axis_try < 3; axis_try++) {
unsigned int *begin = &indices_[left_idx];
unsigned int *end = &indices_[right_idx - 1] + 1; // mimics end() iterator.
unsigned int *mid = 0;
// try min_cut_axis first.
cut_axis = (min_cut_axis + axis_try) % 3;
pred.Set(cut_axis, cut_pos[cut_axis]);
//
// Split at (cut_axis, cut_pos)
// indices_ will be modified.
//
mid = std::partition(begin, end, pred);
mid_idx = left_idx + static_cast<unsigned int>((mid - begin));
if ((mid_idx == left_idx) || (mid_idx == right_idx)) {
// Can't split well.
// Switch to object median(which may create unoptimized tree, but
// stable)
mid_idx = left_idx + (n >> 1);
// Try another axis to find better cut.
} else {
// Found good cut. exit loop.
break;
}
}
BVHNode<T> node;
node.axis = cut_axis;
node.flag = 0; // 0 = branch
out_nodes->push_back(node);
unsigned int left_child_index = 0;
unsigned int right_child_index = 0;
left_child_index =
BuildTree(out_stat, out_nodes, left_idx, mid_idx, depth + 1, p, pred);
right_child_index =
BuildTree(out_stat, out_nodes, mid_idx, right_idx, depth + 1, p, pred);
{
(*out_nodes)[offset].data[0] = left_child_index;
(*out_nodes)[offset].data[1] = right_child_index;
(*out_nodes)[offset].bmin[0] = bmin[0];
(*out_nodes)[offset].bmin[1] = bmin[1];
(*out_nodes)[offset].bmin[2] = bmin[2];
(*out_nodes)[offset].bmax[0] = bmax[0];
(*out_nodes)[offset].bmax[1] = bmax[1];
(*out_nodes)[offset].bmax[2] = bmax[2];
}
out_stat->num_branch_nodes++;
return offset;
}
template <typename T>
template <class P, class Pred>
bool BVHAccel<T>::Build(unsigned int num_primitives, const P &p,
const Pred &pred, const BVHBuildOptions<T> &options) {
options_ = options;
stats_ = BVHBuildStatistics();
nodes_.clear();
bboxes_.clear();
assert(options_.bin_size > 1);
if (num_primitives == 0) {
return false;
}
unsigned int n = num_primitives;
//
// 1. Create triangle indices(this will be permutated in BuildTree)
//
indices_.resize(n);
#ifdef _OPENMP
#pragma omp parallel for
#endif
for (int i = 0; i < static_cast<int>(n); i++) {
indices_[static_cast<size_t>(i)] = static_cast<unsigned int>(i);
}
//
// 2. Compute bounding box(optional).
//
real3<T> bmin, bmax;
if (options.cache_bbox) {
bmin[0] = bmin[1] = bmin[2] = std::numeric_limits<T>::max();
bmax[0] = bmax[1] = bmax[2] = -std::numeric_limits<T>::max();
bboxes_.resize(n);
for (size_t i = 0; i < n; i++) { // for each primitived
unsigned int idx = indices_[i];
BBox<T> bbox;
p.BoundingBox(&(bbox.bmin), &(bbox.bmax), static_cast<unsigned int>(i));
bboxes_[idx] = bbox;
for (int k = 0; k < 3; k++) { // xyz
if (bmin[k] > bbox.bmin[k]) {
bmin[k] = bbox.bmin[k];
}
if (bmax[k] < bbox.bmax[k]) {
bmax[k] = bbox.bmax[k];
}
}
}
} else {
#ifdef _OPENMP
ComputeBoundingBoxOMP(&bmin, &bmax, &indices_.at(0), 0, n, p);
#else
ComputeBoundingBox(&bmin, &bmax, &indices_.at(0), 0, n, p);
#endif
}
//
// 3. Build tree
//
#ifdef _OPENMP
#if NANORT_ENABLE_PARALLEL_BUILD
// Do parallel build for enoughly large dataset.
if (n > options.min_primitives_for_parallel_build) {
BuildShallowTree(&nodes_, 0, n, /* root depth */ 0, options.shallow_depth,
p, pred); // [0, n)
assert(shallow_node_infos_.size() > 0);
// Build deeper tree in parallel
std::vector<std::vector<BVHNode<T> > > local_nodes(
shallow_node_infos_.size());
std::vector<BVHBuildStatistics> local_stats(shallow_node_infos_.size());
#pragma omp parallel for
for (int i = 0; i < static_cast<int>(shallow_node_infos_.size()); i++) {
unsigned int left_idx = shallow_node_infos_[i].left_idx;
unsigned int right_idx = shallow_node_infos_[i].right_idx;
BuildTree(&(local_stats[i]), &(local_nodes[i]), left_idx, right_idx,
options.shallow_depth, p, pred);
}
// Join local nodes
for (int i = 0; i < static_cast<int>(local_nodes.size()); i++) {
assert(!local_nodes[i].empty());
size_t offset = nodes_.size();
// Add offset to child index(for branch node).
for (size_t j = 0; j < local_nodes[i].size(); j++) {
if (local_nodes[i][j].flag == 0) { // branch
local_nodes[i][j].data[0] += offset - 1;
local_nodes[i][j].data[1] += offset - 1;
}
}
// replace
nodes_[shallow_node_infos_[i].offset] = local_nodes[i][0];
// Skip root element of the local node.
nodes_.insert(nodes_.end(), local_nodes[i].begin() + 1,
local_nodes[i].end());
}
// Join statistics
for (int i = 0; i < static_cast<int>(local_nodes.size()); i++) {
stats_.max_tree_depth =
std::max(stats_.max_tree_depth, local_stats[i].max_tree_depth);
stats_.num_leaf_nodes += local_stats[i].num_leaf_nodes;
stats_.num_branch_nodes += local_stats[i].num_branch_nodes;
}
} else {
BuildTree(&stats_, &nodes_, 0, n,
/* root depth */ 0, p, pred); // [0, n)
}
#else // !NANORT_ENABLE_PARALLEL_BUILD
{
BuildTree(&stats_, &nodes_, 0, n,
/* root depth */ 0, p, pred); // [0, n)
}
#endif
#else // !_OPENMP
{
BuildTree(&stats_, &nodes_, 0, n,
/* root depth */ 0, p, pred); // [0, n)
}
#endif
return true;
}
template <typename T>
void BVHAccel<T>::Debug() {
for (size_t i = 0; i < indices_.size(); i++) {
printf("index[%d] = %d\n", int(i), int(indices_[i]));
}
for (size_t i = 0; i < nodes_.size(); i++) {
printf("node[%d] : bmin %f, %f, %f, bmax %f, %f, %f\n", int(i),
nodes_[i].bmin[0], nodes_[i].bmin[1], nodes_[i].bmin[1],
nodes_[i].bmax[0], nodes_[i].bmax[1], nodes_[i].bmax[1]);
}
}
template <typename T>
bool BVHAccel<T>::Dump(const char *filename) {
FILE *fp = fopen(filename, "wb");
if (!fp) {
// fprintf(stderr, "[BVHAccel] Cannot write a file: %s\n", filename);
return false;
}
size_t numNodes = nodes_.size();
assert(nodes_.size() > 0);
size_t numIndices = indices_.size();
size_t r = 0;
r = fwrite(&numNodes, sizeof(size_t), 1, fp);
assert(r == 1);
r = fwrite(&nodes_.at(0), sizeof(BVHNode<T>), numNodes, fp);
assert(r == numNodes);
r = fwrite(&numIndices, sizeof(size_t), 1, fp);
assert(r == 1);
r = fwrite(&indices_.at(0), sizeof(unsigned int), numIndices, fp);
assert(r == numIndices);
fclose(fp);
return true;
}
template <typename T>
bool BVHAccel<T>::Load(const char *filename) {
FILE *fp = fopen(filename, "rb");
if (!fp) {
// fprintf(stderr, "Cannot open file: %s\n", filename);
return false;
}
size_t numNodes;
size_t numIndices;
size_t r = 0;
r = fread(&numNodes, sizeof(size_t), 1, fp);
assert(r == 1);
assert(numNodes > 0);
nodes_.resize(numNodes);
r = fread(&nodes_.at(0), sizeof(BVHNode<T>), numNodes, fp);
assert(r == numNodes);
r = fread(&numIndices, sizeof(size_t), 1, fp);
assert(r == 1);
indices_.resize(numIndices);
r = fread(&indices_.at(0), sizeof(unsigned int), numIndices, fp);
assert(r == numIndices);
fclose(fp);
return true;
}
template <typename T>
inline bool IntersectRayAABB(T *tminOut, // [out]
T *tmaxOut, // [out]
T min_t, T max_t, const T bmin[3], const T bmax[3],
real3<T> ray_org, real3<T> ray_inv_dir,
int ray_dir_sign[3]);
template <>
inline bool IntersectRayAABB<float>(float *tminOut, // [out]
float *tmaxOut, // [out]
float min_t, float max_t, const float bmin[3], const float bmax[3],
real3<float> ray_org, real3<float> ray_inv_dir,
int ray_dir_sign[3]) {
float tmin, tmax;
const float min_x = ray_dir_sign[0] ? bmax[0] : bmin[0];
const float min_y = ray_dir_sign[1] ? bmax[1] : bmin[1];
const float min_z = ray_dir_sign[2] ? bmax[2] : bmin[2];
const float max_x = ray_dir_sign[0] ? bmin[0] : bmax[0];
const float max_y = ray_dir_sign[1] ? bmin[1] : bmax[1];
const float max_z = ray_dir_sign[2] ? bmin[2] : bmax[2];
// X
const float tmin_x = (min_x - ray_org[0]) * ray_inv_dir[0];
// MaxMult robust BVH traversal(up to 4 ulp).
// 1.0000000000000004 for double precision.
const float tmax_x = (max_x - ray_org[0]) * ray_inv_dir[0] * 1.00000024f;
// Y
const float tmin_y = (min_y - ray_org[1]) * ray_inv_dir[1];
const float tmax_y = (max_y - ray_org[1]) * ray_inv_dir[1] * 1.00000024f;
// Z
const float tmin_z = (min_z - ray_org[2]) * ray_inv_dir[2];
const float tmax_z = (max_z - ray_org[2]) * ray_inv_dir[2] * 1.00000024f;
tmin = safemax(tmin_z, safemax(tmin_y, safemax(tmin_x, min_t)));
tmax = safemin(tmax_z, safemin(tmax_y, safemin(tmax_x, max_t)));
if (tmin <= tmax) {
(*tminOut) = tmin;
(*tmaxOut) = tmax;
return true;
}
return false; // no hit
}
template <>
inline bool IntersectRayAABB<double>(double *tminOut, // [out]
double *tmaxOut, // [out]
double min_t, double max_t, const double bmin[3], const double bmax[3],
real3<double> ray_org, real3<double> ray_inv_dir,
int ray_dir_sign[3]) {
double tmin, tmax;
const double min_x = ray_dir_sign[0] ? bmax[0] : bmin[0];
const double min_y = ray_dir_sign[1] ? bmax[1] : bmin[1];
const double min_z = ray_dir_sign[2] ? bmax[2] : bmin[2];
const double max_x = ray_dir_sign[0] ? bmin[0] : bmax[0];
const double max_y = ray_dir_sign[1] ? bmin[1] : bmax[1];
const double max_z = ray_dir_sign[2] ? bmin[2] : bmax[2];
// X
const double tmin_x = (min_x - ray_org[0]) * ray_inv_dir[0];
// MaxMult robust BVH traversal(up to 4 ulp).
const double tmax_x = (max_x - ray_org[0]) * ray_inv_dir[0] * 1.0000000000000004;
// Y
const double tmin_y = (min_y - ray_org[1]) * ray_inv_dir[1];
const double tmax_y = (max_y - ray_org[1]) * ray_inv_dir[1] * 1.0000000000000004;
// Z
const double tmin_z = (min_z - ray_org[2]) * ray_inv_dir[2];
const double tmax_z = (max_z - ray_org[2]) * ray_inv_dir[2] * 1.0000000000000004;
tmin = safemax(tmin_z, safemax(tmin_y, safemax(tmin_x, min_t)));
tmax = safemin(tmax_z, safemin(tmax_y, safemin(tmax_x, max_t)));
if (tmin <= tmax) {
(*tminOut) = tmin;
(*tmaxOut) = tmax;
return true;
}
return false; // no hit
}
template <typename T>
template <class I>
inline bool BVHAccel<T>::TestLeafNode(const BVHNode<T> &node, const Ray<T> &ray,
const I &intersector) const {
bool hit = false;
unsigned int num_primitives = node.data[0];
unsigned int offset = node.data[1];
T t = intersector.GetT(); // current hit distance
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
for (unsigned int i = 0; i < num_primitives; i++) {
unsigned int prim_idx = indices_[i + offset];
T local_t = t;
if (intersector.Intersect(&local_t, prim_idx)) {
// Update isect state
t = local_t;
intersector.Update(t, prim_idx);
hit = true;
}
}
return hit;
}
#if 0 // TODO(LTE): Implement
template <typename T> template<class I, class H, class Comp>
bool BVHAccel<T>::MultiHitTestLeafNode(
std::priority_queue<H, std::vector<H>, Comp> *isect_pq,
int max_intersections,
const BVHNode<T> &node,
const Ray<T> &ray,
const I &intersector) const {
bool hit = false;
unsigned int num_primitives = node.data[0];
unsigned int offset = node.data[1];
T t = std::numeric_limits<T>::max();
if (isect_pq->size() >= static_cast<size_t>(max_intersections)) {
t = isect_pq->top().t; // current furthest hit distance
}
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
for (unsigned int i = 0; i < num_primitives; i++) {
unsigned int prim_idx = indices_[i + offset];
T local_t = t, u = 0.0f, v = 0.0f;
if (intersector.Intersect(&local_t, &u, &v, prim_idx)) {
// Update isect state
if ((local_t > ray.min_t)) {
if (isect_pq->size() < static_cast<size_t>(max_intersections)) {
H isect;
t = local_t;
isect.t = t;
isect.u = u;
isect.v = v;
isect.prim_id = prim_idx;
isect_pq->push(isect);
// Update t to furthest distance.
t = ray.max_t;
hit = true;
} else {
if (local_t < isect_pq->top().t) {
// delete furthest intersection and add new intersection.
isect_pq->pop();
H hit;
hit.t = local_t;
hit.u = u;
hit.v = v;
hit.prim_id = prim_idx;
isect_pq->push(hit);
// Update furthest hit distance
t = isect_pq->top().t;
hit = true;
}
}
}
}
}
return hit;
}
#endif
template <typename T>
template <class I, class H>
bool BVHAccel<T>::Traverse(const Ray<T> &ray, const I &intersector, H *isect,
const BVHTraceOptions &options) const {
const int kMaxStackDepth = 512;
T hit_t = ray.max_t;
int node_stack_index = 0;
unsigned int node_stack[512];
node_stack[0] = 0;
// Init isect info as no hit
intersector.Update(hit_t, static_cast<unsigned int>(-1));
intersector.PrepareTraversal(ray, options);
int dir_sign[3];
dir_sign[0] = ray.dir[0] < static_cast<T>(0.0) ? 1 : 0;
dir_sign[1] = ray.dir[1] < static_cast<T>(0.0) ? 1 : 0;
dir_sign[2] = ray.dir[2] < static_cast<T>(0.0) ? 1 : 0;
real3<T> ray_inv_dir;
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
ray_inv_dir = vsafe_inverse(ray_dir);
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
T min_t = std::numeric_limits<T>::max();
T max_t = -std::numeric_limits<T>::max();
while (node_stack_index >= 0) {
unsigned int index = node_stack[node_stack_index];
const BVHNode<T> &node = nodes_[index];
node_stack_index--;
bool hit = IntersectRayAABB(&min_t, &max_t, ray.min_t, hit_t, node.bmin,
node.bmax, ray_org, ray_inv_dir, dir_sign);
if (node.flag == 0) { // branch node
if (hit) {
int order_near = dir_sign[node.axis];
int order_far = 1 - order_near;
// Traverse near first.
node_stack[++node_stack_index] = node.data[order_far];
node_stack[++node_stack_index] = node.data[order_near];
}
} else { // leaf node
if (hit) {
if (TestLeafNode(node, ray, intersector)) {
hit_t = intersector.GetT();
}
}
}
}
assert(node_stack_index < kMaxStackDepth);
bool hit = (intersector.GetT() < ray.max_t);
intersector.PostTraversal(ray, hit, isect);
return hit;
}
template <typename T>
template <class I>
inline bool BVHAccel<T>::TestLeafNodeIntersections(
const BVHNode<T> &node, const Ray<T> &ray, const int max_intersections,
const I &intersector,
std::priority_queue<NodeHit<T>, std::vector<NodeHit<T> >,
NodeHitComparator<T> > *isect_pq) const {
bool hit = false;
unsigned int num_primitives = node.data[0];
unsigned int offset = node.data[1];
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
intersector.PrepareTraversal(ray);
for (unsigned int i = 0; i < num_primitives; i++) {
unsigned int prim_idx = indices_[i + offset];
T min_t, max_t;
if (intersector.Intersect(&min_t, &max_t, prim_idx)) {
// Always add to isect lists.
NodeHit<T> isect;
isect.t_min = min_t;
isect.t_max = max_t;
isect.node_id = prim_idx;
if (isect_pq->size() < static_cast<size_t>(max_intersections)) {
isect_pq->push(isect);
} else {
if (min_t < isect_pq->top().t_min) {
// delete the furthest intersection and add a new intersection.
isect_pq->pop();
isect_pq->push(isect);
}
}
}
}
return hit;
}
template <typename T>
template <class I>
bool BVHAccel<T>::ListNodeIntersections(
const Ray<T> &ray, int max_intersections, const I &intersector,
StackVector<NodeHit<T>, 128> *hits) const {
const int kMaxStackDepth = 512;
T hit_t = ray.max_t;
int node_stack_index = 0;
unsigned int node_stack[512];
node_stack[0] = 0;
// Stores furthest intersection at top
std::priority_queue<NodeHit<T>, std::vector<NodeHit<T> >,
NodeHitComparator<T> >
isect_pq;
(*hits)->clear();
int dir_sign[3];
dir_sign[0] =
ray.dir[0] < static_cast<T>(0.0) ? 1 : 0;
dir_sign[1] =
ray.dir[1] < static_cast<T>(0.0) ? 1 : 0;
dir_sign[2] =
ray.dir[2] < static_cast<T>(0.0) ? 1 : 0;
real3<T> ray_inv_dir;
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
ray_inv_dir = vsafe_inverse(ray_dir);
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
T min_t, max_t;
while (node_stack_index >= 0) {
unsigned int index = node_stack[node_stack_index];
const BVHNode<T> &node = nodes_[static_cast<size_t>(index)];
node_stack_index--;
bool hit = IntersectRayAABB(&min_t, &max_t, ray.min_t, hit_t, node.bmin,
node.bmax, ray_org, ray_inv_dir, dir_sign);
if (node.flag == 0) { // branch node
if (hit) {
int order_near = dir_sign[node.axis];
int order_far = 1 - order_near;
// Traverse near first.
node_stack[++node_stack_index] = node.data[order_far];
node_stack[++node_stack_index] = node.data[order_near];
}
} else { // leaf node
if (hit) {
TestLeafNodeIntersections(node, ray, max_intersections, intersector,
&isect_pq);
}
}
}
assert(node_stack_index < kMaxStackDepth);
(void)kMaxStackDepth;
if (!isect_pq.empty()) {
// Store intesection in reverse order(make it frontmost order)
size_t n = isect_pq.size();
(*hits)->resize(n);
for (size_t i = 0; i < n; i++) {
const NodeHit<T> &isect = isect_pq.top();
(*hits)[n - i - 1] = isect;
isect_pq.pop();
}
return true;
}
return false;
}
#if 0 // TODO(LTE): Implement
template <typename T> template<class I, class H, class Comp>
bool BVHAccel<T>::MultiHitTraverse(const Ray<T> &ray,
int max_intersections,
const I &intersector,
StackVector<H, 128> *hits,
const BVHTraceOptions& options) const {
const int kMaxStackDepth = 512;
T hit_t = ray.max_t;
int node_stack_index = 0;
unsigned int node_stack[512];
node_stack[0] = 0;
// Stores furthest intersection at top
std::priority_queue<H, std::vector<H>, Comp> isect_pq;
(*hits)->clear();
// Init isect info as no hit
intersector.Update(hit_t, static_cast<unsigned int>(-1));
intersector.PrepareTraversal(ray, options);
int dir_sign[3];
dir_sign[0] = ray.dir[0] < static_cast<T>(0.0) ? static_cast<T>(1) : static_cast<T>(0);
dir_sign[1] = ray.dir[1] < static_cast<T>(0.0) ? static_cast<T>(1) : static_cast<T>(0);
dir_sign[2] = ray.dir[2] < static_cast<T>(0.0) ? static_cast<T>(1) : static_cast<T>(0);
real3<T> ray_inv_dir;
real3<T> ray_dir;
ray_dir[0] = ray.dir[0];
ray_dir[1] = ray.dir[1];
ray_dir[2] = ray.dir[2];
ray_inv_dir = vsafe_inverse(ray_dir);
real3<T> ray_org;
ray_org[0] = ray.org[0];
ray_org[1] = ray.org[1];
ray_org[2] = ray.org[2];
T min_t, max_t;
while (node_stack_index >= 0) {
unsigned int index = node_stack[node_stack_index];
const BVHNode<T> &node = nodes_[static_cast<size_t>(index)];
node_stack_index--;
bool hit = IntersectRayAABB(&min_t, &max_t, ray.min_t, hit_t, node.bmin,
node.bmax, ray_org, ray_inv_dir, dir_sign);
if (node.flag == 0) { // branch node
if (hit) {
int order_near = dir_sign[node.axis];
int order_far = 1 - order_near;
// Traverse near first.
node_stack[++node_stack_index] = node.data[order_far];
node_stack[++node_stack_index] = node.data[order_near];
}
} else { // leaf node
if (hit) {
if (MultiHitTestLeafNode(&isect_pq, max_intersections, node, ray, intersector)) {
// Only update `hit_t` when queue is full.
if (isect_pq.size() >= static_cast<size_t>(max_intersections)) {
hit_t = isect_pq.top().t;
}
}
}
}
}
assert(node_stack_index < kMaxStackDepth);
(void)kMaxStackDepth;
if (!isect_pq.empty()) {
// Store intesection in reverse order(make it frontmost order)
size_t n = isect_pq.size();
(*hits)->resize(n);
for (size_t i = 0; i < n; i++) {
const H &isect = isect_pq.top();
(*hits)[n - i - 1] = isect;
isect_pq.pop();
}
return true;
}
return false;
}
#endif
#ifdef __clang__
#pragma clang diagnostic pop
#endif
} // namespace nanort
#endif // NANORT_H_
|
GB_unop__identity_fc32_uint32.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_atomics.h"
#include "GB_unop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB (_unop_apply__identity_fc32_uint32)
// op(A') function: GB (_unop_tran__identity_fc32_uint32)
// C type: GxB_FC32_t
// A type: uint32_t
// cast: GxB_FC32_t cij = GxB_CMPLXF ((float) (aij), 0)
// unaryop: cij = aij
#define GB_ATYPE \
uint32_t
#define GB_CTYPE \
GxB_FC32_t
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
uint32_t aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = x ;
// casting
#define GB_CAST(z, aij) \
GxB_FC32_t z = GxB_CMPLXF ((float) (aij), 0) ;
// cij = op (aij)
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
uint32_t aij = Ax [pA] ; \
/* Cx [pC] = op (cast (aij)) */ \
GxB_FC32_t z = GxB_CMPLXF ((float) (aij), 0) ; \
Cx [pC] = z ; \
}
// true if operator is the identity op with no typecasting
#define GB_OP_IS_IDENTITY_WITH_NO_TYPECAST \
0
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_IDENTITY || GxB_NO_FC32 || GxB_NO_UINT32)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_apply__identity_fc32_uint32)
(
GxB_FC32_t *Cx, // Cx and Ax may be aliased
const uint32_t *Ax,
const int8_t *restrict Ab, // A->b if A is bitmap
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
// TODO: if OP is ONE and uniform-valued matrices are exploited, then
// do this in O(1) time
if (Ab == NULL)
{
#if ( GB_OP_IS_IDENTITY_WITH_NO_TYPECAST )
GB_memcpy (Cx, Ax, anz * sizeof (uint32_t), nthreads) ;
#else
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
uint32_t aij = Ax [p] ;
GxB_FC32_t z = GxB_CMPLXF ((float) (aij), 0) ;
Cx [p] = z ;
}
#endif
}
else
{
// bitmap case, no transpose; A->b already memcpy'd into C->b
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!Ab [p]) continue ;
uint32_t aij = Ax [p] ;
GxB_FC32_t z = GxB_CMPLXF ((float) (aij), 0) ;
Cx [p] = z ;
}
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_tran__identity_fc32_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
target_teams_distribute_parallel_for_simd_misc_messages.c | // RUN: %clang_cc1 -fsyntax-only -fopenmp -verify %s
// expected-error@+1 {{unexpected OpenMP directive '#pragma omp target teams distribute parallel for simd'}}
#pragma omp target teams distribute parallel for simd
// expected-error@+1 {{unexpected OpenMP directive '#pragma omp target teams distribute parallel for simd'}}
#pragma omp target teams distribute parallel for simd foo
void test_no_clause() {
int i;
#pragma omp target teams distribute parallel for simd
for (i = 0; i < 16; ++i)
;
// expected-error@+2 {{statement after '#pragma omp target teams distribute parallel for simd' must be a for loop}}
#pragma omp target teams distribute parallel for simd
++i;
}
void test_branch_protected_scope() {
int i = 0;
L1:
++i;
int x[24];
#pragma omp target teams distribute parallel for simd
for (i = 0; i < 16; ++i) {
if (i == 5)
goto L1; // expected-error {{use of undeclared label 'L1'}}
else if (i == 6)
return; // expected-error {{cannot return from OpenMP region}}
else if (i == 7)
goto L2;
else if (i == 8) {
L2:
x[i]++;
}
}
if (x[0] == 0)
goto L2; // expected-error {{use of undeclared label 'L2'}}
else if (x[1] == 1)
goto L1;
}
void test_invalid_clause() {
int i;
// expected-warning@+1 {{extra tokens at the end of '#pragma omp target teams distribute parallel for simd' are ignored}}
#pragma omp target teams distribute parallel for simd foo bar
for (i = 0; i < 16; ++i)
;
}
void test_non_identifiers() {
int i, x;
// expected-warning@+1 {{extra tokens at the end of '#pragma omp target teams distribute parallel for simd' are ignored}}
#pragma omp target teams distribute parallel for simd;
for (i = 0; i < 16; ++i)
;
// expected-warning@+1 {{extra tokens at the end of '#pragma omp target teams distribute parallel for simd' are ignored}}
#pragma omp target teams distribute parallel for simd private(x);
for (i = 0; i < 16; ++i)
;
// expected-warning@+1 {{extra tokens at the end of '#pragma omp target teams distribute parallel for simd' are ignored}}
#pragma omp target teams distribute parallel for simd, private(x);
for (i = 0; i < 16; ++i)
;
}
extern int foo();
void test_collapse() {
int i;
// expected-error@+1 {{expected '('}}
#pragma omp target teams distribute parallel for simd collapse
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
#pragma omp target teams distribute parallel for simd collapse(
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd collapse()
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
#pragma omp target teams distribute parallel for simd collapse(,
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}} expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
#pragma omp target teams distribute parallel for simd collapse(, )
for (i = 0; i < 16; ++i)
;
// expected-warning@+2 {{extra tokens at the end of '#pragma omp target teams distribute parallel for simd' are ignored}}
// expected-error@+1 {{expected '('}}
#pragma omp target teams distribute parallel for simd collapse 4)
for (i = 0; i < 16; ++i)
;
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4,
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4, )
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4)
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4 4)
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4, , 4)
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
#pragma omp target teams distribute parallel for simd collapse(4)
for (int i1 = 0; i1 < 16; ++i1)
for (int i2 = 0; i2 < 16; ++i2)
for (int i3 = 0; i3 < 16; ++i3)
for (int i4 = 0; i4 < 16; ++i4)
foo();
// expected-error@+2 {{expected ')'}}
// expected-note@+1 {{to match this '('}} expected-note@+1 {{as specified in 'collapse' clause}}
#pragma omp target teams distribute parallel for simd collapse(4, 8)
for (i = 0; i < 16; ++i)
; // expected-error {{expected 4 for loops after '#pragma omp target teams distribute parallel for simd', but found only 1}}
// expected-error@+1 {{expression is not an integer constant expression}}
#pragma omp target teams distribute parallel for simd collapse(2.5)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expression is not an integer constant expression}}
#pragma omp target teams distribute parallel for simd collapse(foo())
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
#pragma omp target teams distribute parallel for simd collapse(-5)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
#pragma omp target teams distribute parallel for simd collapse(0)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{argument to 'collapse' clause must be a strictly positive integer value}}
#pragma omp target teams distribute parallel for simd collapse(5 - 5)
for (i = 0; i < 16; ++i)
;
// expected-error@+4 {{OpenMP constructs may not be nested inside a simd region}}
#pragma omp target teams distribute parallel for simd collapse(2) firstprivate(i)
for (i = 0; i < 16; ++i)
for (int j = 0; j < 16; ++j)
#pragma omp parallel for reduction(+ : i, j)
for (int k = 0; k < 16; ++k)
i += j;
}
void test_private() {
int i;
// expected-error@+2 {{expected expression}}
// expected-error@+1 {{expected ')'}} expected-note@+1 {{to match this '('}}
#pragma omp target teams distribute parallel for simd private(
for (i = 0; i < 16; ++i)
;
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd private(,
for (i = 0; i < 16; ++i)
;
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd private(, )
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd private()
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd private(int)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected variable name}}
#pragma omp target teams distribute parallel for simd private(0)
for (i = 0; i < 16; ++i)
;
int x, y, z;
#pragma omp target teams distribute parallel for simd private(x)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd private(x, y)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd private(x, y, z)
for (i = 0; i < 16; ++i) {
x = y * i + z;
}
}
void test_lastprivate() {
int i;
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd lastprivate(
for (i = 0; i < 16; ++i)
;
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd lastprivate(,
for (i = 0; i < 16; ++i)
;
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd lastprivate(, )
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd lastprivate()
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd lastprivate(int)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected variable name}}
#pragma omp target teams distribute parallel for simd lastprivate(0)
for (i = 0; i < 16; ++i)
;
int x, y, z;
#pragma omp target teams distribute parallel for simd lastprivate(x)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd lastprivate(x, y)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd lastprivate(x, y, z)
for (i = 0; i < 16; ++i)
;
}
void test_firstprivate() {
int i;
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd firstprivate(
for (i = 0; i < 16; ++i)
;
// expected-error@+2 {{expected ')'}} expected-note@+2 {{to match this '('}}
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd firstprivate(,
for (i = 0; i < 16; ++i)
;
// expected-error@+1 2 {{expected expression}}
#pragma omp target teams distribute parallel for simd firstprivate(, )
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd firstprivate()
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected expression}}
#pragma omp target teams distribute parallel for simd firstprivate(int)
for (i = 0; i < 16; ++i)
;
// expected-error@+1 {{expected variable name}}
#pragma omp target teams distribute parallel for simd firstprivate(0)
for (i = 0; i < 16; ++i)
;
int x, y, z;
#pragma omp target teams distribute parallel for simd lastprivate(x) firstprivate(x)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd lastprivate(x, y) firstprivate(x, y)
for (i = 0; i < 16; ++i)
;
#pragma omp target teams distribute parallel for simd lastprivate(x, y, z) firstprivate(x, y, z)
for (i = 0; i < 16; ++i)
;
}
void test_loop_messages() {
float a[100], b[100], c[100];
// expected-error@+2 {{variable must be of integer or pointer type}}
#pragma omp target teams distribute parallel for simd
for (float fi = 0; fi < 10.0; fi++) {
c[(int)fi] = a[(int)fi] + b[(int)fi];
}
// expected-error@+2 {{variable must be of integer or pointer type}}
#pragma omp target teams distribute parallel for simd
for (double fi = 0; fi < 10.0; fi++) {
c[(int)fi] = a[(int)fi] + b[(int)fi];
}
}
|
GB_unop__identity_fp32_fc32.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCUDA_DEV
#include "GB_control.h"
#include "GB_atomics.h"
#include "GB_unop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB (_unop_apply__identity_fp32_fc32)
// op(A') function: GB (_unop_tran__identity_fp32_fc32)
// C type: float
// A type: GxB_FC32_t
// cast: float cij = (float) crealf (aij)
// unaryop: cij = aij
#define GB_ATYPE \
GxB_FC32_t
#define GB_CTYPE \
float
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
GxB_FC32_t aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = x ;
// casting
#define GB_CAST(z, aij) \
float z = (float) crealf (aij) ;
// cij = op (aij)
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
GxB_FC32_t aij = Ax [pA] ; \
/* Cx [pC] = op (cast (aij)) */ \
float z = (float) crealf (aij) ; \
Cx [pC] = z ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_IDENTITY || GxB_NO_FP32 || GxB_NO_FC32)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_apply__identity_fp32_fc32)
(
float *Cx, // Cx and Ax may be aliased
const GxB_FC32_t *Ax,
const int8_t *restrict Ab, // A->b if A is bitmap
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
if (Ab == NULL)
{
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
GxB_FC32_t aij = Ax [p] ;
float z = (float) crealf (aij) ;
Cx [p] = z ;
}
}
else
{
// bitmap case, no transpose; A->b already memcpy'd into C->b
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!Ab [p]) continue ;
GxB_FC32_t aij = Ax [p] ;
float z = (float) crealf (aij) ;
Cx [p] = z ;
}
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_tran__identity_fp32_fc32)
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
quantize.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% QQQ U U AAA N N TTTTT IIIII ZZZZZ EEEEE %
% Q Q U U A A NN N T I ZZ E %
% Q Q U U AAAAA N N N T I ZZZ EEEEE %
% Q QQ U U A A N NN T I ZZ E %
% QQQQ UUU A A N N T IIIII ZZZZZ EEEEE %
% %
% %
% MagickCore Methods to Reduce the Number of Unique Colors in an Image %
% %
% Software Design %
% Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2017 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% https://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Realism in computer graphics typically requires using 24 bits/pixel to
% generate an image. Yet many graphic display devices do not contain the
% amount of memory necessary to match the spatial and color resolution of
% the human eye. The Quantize methods takes a 24 bit image and reduces
% the number of colors so it can be displayed on raster device with less
% bits per pixel. In most instances, the quantized image closely
% resembles the original reference image.
%
% A reduction of colors in an image is also desirable for image
% transmission and real-time animation.
%
% QuantizeImage() takes a standard RGB or monochrome images and quantizes
% them down to some fixed number of colors.
%
% For purposes of color allocation, an image is a set of n pixels, where
% each pixel is a point in RGB space. RGB space is a 3-dimensional
% vector space, and each pixel, Pi, is defined by an ordered triple of
% red, green, and blue coordinates, (Ri, Gi, Bi).
%
% Each primary color component (red, green, or blue) represents an
% intensity which varies linearly from 0 to a maximum value, Cmax, which
% corresponds to full saturation of that color. Color allocation is
% defined over a domain consisting of the cube in RGB space with opposite
% vertices at (0,0,0) and (Cmax, Cmax, Cmax). QUANTIZE requires Cmax =
% 255.
%
% The algorithm maps this domain onto a tree in which each node
% represents a cube within that domain. In the following discussion
% these cubes are defined by the coordinate of two opposite vertices (vertex
% nearest the origin in RGB space and the vertex farthest from the origin).
%
% The tree's root node represents the entire domain, (0,0,0) through
% (Cmax,Cmax,Cmax). Each lower level in the tree is generated by
% subdividing one node's cube into eight smaller cubes of equal size.
% This corresponds to bisecting the parent cube with planes passing
% through the midpoints of each edge.
%
% The basic algorithm operates in three phases: Classification,
% Reduction, and Assignment. Classification builds a color description
% tree for the image. Reduction collapses the tree until the number it
% represents, at most, the number of colors desired in the output image.
% Assignment defines the output image's color map and sets each pixel's
% color by restorage_class in the reduced tree. Our goal is to minimize
% the numerical discrepancies between the original colors and quantized
% colors (quantization error).
%
% Classification begins by initializing a color description tree of
% sufficient depth to represent each possible input color in a leaf.
% However, it is impractical to generate a fully-formed color description
% tree in the storage_class phase for realistic values of Cmax. If
% colors components in the input image are quantized to k-bit precision,
% so that Cmax= 2k-1, the tree would need k levels below the root node to
% allow representing each possible input color in a leaf. This becomes
% prohibitive because the tree's total number of nodes is 1 +
% sum(i=1, k, 8k).
%
% A complete tree would require 19,173,961 nodes for k = 8, Cmax = 255.
% Therefore, to avoid building a fully populated tree, QUANTIZE: (1)
% Initializes data structures for nodes only as they are needed; (2)
% Chooses a maximum depth for the tree as a function of the desired
% number of colors in the output image (currently log2(colormap size)).
%
% For each pixel in the input image, storage_class scans downward from
% the root of the color description tree. At each level of the tree it
% identifies the single node which represents a cube in RGB space
% containing the pixel's color. It updates the following data for each
% such node:
%
% n1: Number of pixels whose color is contained in the RGB cube which
% this node represents;
%
% n2: Number of pixels whose color is not represented in a node at
% lower depth in the tree; initially, n2 = 0 for all nodes except
% leaves of the tree.
%
% Sr, Sg, Sb: Sums of the red, green, and blue component values for all
% pixels not classified at a lower depth. The combination of these sums
% and n2 will ultimately characterize the mean color of a set of pixels
% represented by this node.
%
% E: the distance squared in RGB space between each pixel contained
% within a node and the nodes' center. This represents the
% quantization error for a node.
%
% Reduction repeatedly prunes the tree until the number of nodes with n2
% > 0 is less than or equal to the maximum number of colors allowed in
% the output image. On any given iteration over the tree, it selects
% those nodes whose E count is minimal for pruning and merges their color
% statistics upward. It uses a pruning threshold, Ep, to govern node
% selection as follows:
%
% Ep = 0
% while number of nodes with (n2 > 0) > required maximum number of colors
% prune all nodes such that E <= Ep
% Set Ep to minimum E in remaining nodes
%
% This has the effect of minimizing any quantization error when merging
% two nodes together.
%
% When a node to be pruned has offspring, the pruning procedure invokes
% itself recursively in order to prune the tree from the leaves upward.
% n2, Sr, Sg, and Sb in a node being pruned are always added to the
% corresponding data in that node's parent. This retains the pruned
% node's color characteristics for later averaging.
%
% For each node, n2 pixels exist for which that node represents the
% smallest volume in RGB space containing those pixel's colors. When n2
% > 0 the node will uniquely define a color in the output image. At the
% beginning of reduction, n2 = 0 for all nodes except a the leaves of
% the tree which represent colors present in the input image.
%
% The other pixel count, n1, indicates the total number of colors within
% the cubic volume which the node represents. This includes n1 - n2
% pixels whose colors should be defined by nodes at a lower level in the
% tree.
%
% Assignment generates the output image from the pruned tree. The output
% image consists of two parts: (1) A color map, which is an array of
% color descriptions (RGB triples) for each color present in the output
% image; (2) A pixel array, which represents each pixel as an index
% into the color map array.
%
% First, the assignment phase makes one pass over the pruned color
% description tree to establish the image's color map. For each node
% with n2 > 0, it divides Sr, Sg, and Sb by n2 . This produces the mean
% color of all pixels that classify no lower than this node. Each of
% these colors becomes an entry in the color map.
%
% Finally, the assignment phase reclassifies each pixel in the pruned
% tree to identify the deepest node containing the pixel's color. The
% pixel's value in the pixel array becomes the index of this node's mean
% color in the color map.
%
% This method is based on a similar algorithm written by Paul Raveling.
%
*/
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/attribute.h"
#include "MagickCore/cache-view.h"
#include "MagickCore/color.h"
#include "MagickCore/color-private.h"
#include "MagickCore/colormap.h"
#include "MagickCore/colorspace.h"
#include "MagickCore/colorspace-private.h"
#include "MagickCore/enhance.h"
#include "MagickCore/exception.h"
#include "MagickCore/exception-private.h"
#include "MagickCore/histogram.h"
#include "MagickCore/image.h"
#include "MagickCore/image-private.h"
#include "MagickCore/list.h"
#include "MagickCore/memory_.h"
#include "MagickCore/monitor.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/option.h"
#include "MagickCore/pixel-accessor.h"
#include "MagickCore/pixel-private.h"
#include "MagickCore/quantize.h"
#include "MagickCore/quantum.h"
#include "MagickCore/quantum-private.h"
#include "MagickCore/resource_.h"
#include "MagickCore/string_.h"
#include "MagickCore/thread-private.h"
/*
Define declarations.
*/
#if !defined(__APPLE__) && !defined(TARGET_OS_IPHONE)
#define CacheShift 2
#else
#define CacheShift 3
#endif
#define ErrorQueueLength 16
#define MaxNodes 266817
#define MaxTreeDepth 8
#define NodesInAList 1920
/*
Typdef declarations.
*/
typedef struct _DoublePixelPacket
{
double
red,
green,
blue,
alpha;
} DoublePixelPacket;
typedef struct _NodeInfo
{
struct _NodeInfo
*parent,
*child[16];
MagickSizeType
number_unique;
DoublePixelPacket
total_color;
double
quantize_error;
size_t
color_number,
id,
level;
} NodeInfo;
typedef struct _Nodes
{
NodeInfo
*nodes;
struct _Nodes
*next;
} Nodes;
typedef struct _CubeInfo
{
NodeInfo
*root;
size_t
colors,
maximum_colors;
ssize_t
transparent_index;
MagickSizeType
transparent_pixels;
DoublePixelPacket
target;
double
distance,
pruning_threshold,
next_threshold;
size_t
nodes,
free_nodes,
color_number;
NodeInfo
*next_node;
Nodes
*node_queue;
MemoryInfo
*memory_info;
ssize_t
*cache;
DoublePixelPacket
error[ErrorQueueLength];
double
weights[ErrorQueueLength];
QuantizeInfo
*quantize_info;
MagickBooleanType
associate_alpha;
ssize_t
x,
y;
size_t
depth;
MagickOffsetType
offset;
MagickSizeType
span;
} CubeInfo;
/*
Method prototypes.
*/
static CubeInfo
*GetCubeInfo(const QuantizeInfo *,const size_t,const size_t);
static NodeInfo
*GetNodeInfo(CubeInfo *,const size_t,const size_t,NodeInfo *);
static MagickBooleanType
AssignImageColors(Image *,CubeInfo *,ExceptionInfo *),
ClassifyImageColors(CubeInfo *,const Image *,ExceptionInfo *),
DitherImage(Image *,CubeInfo *,ExceptionInfo *),
SetGrayscaleImage(Image *,ExceptionInfo *);
static size_t
DefineImageColormap(Image *,CubeInfo *,NodeInfo *);
static void
ClosestColor(const Image *,CubeInfo *,const NodeInfo *),
DestroyCubeInfo(CubeInfo *),
PruneLevel(CubeInfo *,const NodeInfo *),
PruneToCubeDepth(CubeInfo *,const NodeInfo *),
ReduceImageColors(const Image *,CubeInfo *);
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% A c q u i r e Q u a n t i z e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% AcquireQuantizeInfo() allocates the QuantizeInfo structure.
%
% The format of the AcquireQuantizeInfo method is:
%
% QuantizeInfo *AcquireQuantizeInfo(const ImageInfo *image_info)
%
% A description of each parameter follows:
%
% o image_info: the image info.
%
*/
MagickExport QuantizeInfo *AcquireQuantizeInfo(const ImageInfo *image_info)
{
QuantizeInfo
*quantize_info;
quantize_info=(QuantizeInfo *) AcquireMagickMemory(sizeof(*quantize_info));
if (quantize_info == (QuantizeInfo *) NULL)
ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed");
GetQuantizeInfo(quantize_info);
if (image_info != (ImageInfo *) NULL)
{
const char
*option;
quantize_info->dither_method=image_info->dither == MagickFalse ?
NoDitherMethod : RiemersmaDitherMethod;
option=GetImageOption(image_info,"dither");
if (option != (const char *) NULL)
quantize_info->dither_method=(DitherMethod) ParseCommandOption(
MagickDitherOptions,MagickFalse,option);
quantize_info->measure_error=image_info->verbose;
}
return(quantize_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ A s s i g n I m a g e C o l o r s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% AssignImageColors() generates the output image from the pruned tree. The
% output image consists of two parts: (1) A color map, which is an array
% of color descriptions (RGB triples) for each color present in the
% output image; (2) A pixel array, which represents each pixel as an
% index into the color map array.
%
% First, the assignment phase makes one pass over the pruned color
% description tree to establish the image's color map. For each node
% with n2 > 0, it divides Sr, Sg, and Sb by n2 . This produces the mean
% color of all pixels that classify no lower than this node. Each of
% these colors becomes an entry in the color map.
%
% Finally, the assignment phase reclassifies each pixel in the pruned
% tree to identify the deepest node containing the pixel's color. The
% pixel's value in the pixel array becomes the index of this node's mean
% color in the color map.
%
% The format of the AssignImageColors() method is:
%
% MagickBooleanType AssignImageColors(Image *image,CubeInfo *cube_info)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o cube_info: A pointer to the Cube structure.
%
*/
static inline void AssociateAlphaPixel(const Image *image,
const CubeInfo *cube_info,const Quantum *pixel,DoublePixelPacket *alpha_pixel)
{
double
alpha;
if ((cube_info->associate_alpha == MagickFalse) ||
(GetPixelAlpha(image,pixel) == OpaqueAlpha))
{
alpha_pixel->red=(double) GetPixelRed(image,pixel);
alpha_pixel->green=(double) GetPixelGreen(image,pixel);
alpha_pixel->blue=(double) GetPixelBlue(image,pixel);
alpha_pixel->alpha=(double) GetPixelAlpha(image,pixel);
return;
}
alpha=(double) (QuantumScale*GetPixelAlpha(image,pixel));
alpha_pixel->red=alpha*GetPixelRed(image,pixel);
alpha_pixel->green=alpha*GetPixelGreen(image,pixel);
alpha_pixel->blue=alpha*GetPixelBlue(image,pixel);
alpha_pixel->alpha=(double) GetPixelAlpha(image,pixel);
}
static inline void AssociateAlphaPixelInfo(const CubeInfo *cube_info,
const PixelInfo *pixel,DoublePixelPacket *alpha_pixel)
{
double
alpha;
if ((cube_info->associate_alpha == MagickFalse) ||
(pixel->alpha == OpaqueAlpha))
{
alpha_pixel->red=(double) pixel->red;
alpha_pixel->green=(double) pixel->green;
alpha_pixel->blue=(double) pixel->blue;
alpha_pixel->alpha=(double) pixel->alpha;
return;
}
alpha=(double) (QuantumScale*pixel->alpha);
alpha_pixel->red=alpha*pixel->red;
alpha_pixel->green=alpha*pixel->green;
alpha_pixel->blue=alpha*pixel->blue;
alpha_pixel->alpha=(double) pixel->alpha;
}
static inline size_t ColorToNodeId(const CubeInfo *cube_info,
const DoublePixelPacket *pixel,size_t index)
{
size_t
id;
id=(size_t) (((ScaleQuantumToChar(ClampPixel(pixel->red)) >> index) & 0x01) |
((ScaleQuantumToChar(ClampPixel(pixel->green)) >> index) & 0x01) << 1 |
((ScaleQuantumToChar(ClampPixel(pixel->blue)) >> index) & 0x01) << 2);
if (cube_info->associate_alpha != MagickFalse)
id|=((ScaleQuantumToChar(ClampPixel(pixel->alpha)) >> index) & 0x1) << 3;
return(id);
}
static MagickBooleanType AssignImageColors(Image *image,CubeInfo *cube_info,
ExceptionInfo *exception)
{
#define AssignImageTag "Assign/Image"
ssize_t
y;
/*
Allocate image colormap.
*/
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace(image,cube_info->quantize_info->colorspace,
exception);
else
if (IssRGBCompatibleColorspace(image->colorspace) == MagickFalse)
(void) TransformImageColorspace(image,sRGBColorspace,exception);
if (AcquireImageColormap(image,cube_info->colors,exception) == MagickFalse)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);;
image->colors=0;
cube_info->transparent_pixels=0;
cube_info->transparent_index=(-1);
(void) DefineImageColormap(image,cube_info,cube_info->root);
/*
Create a reduced color image.
*/
if (cube_info->quantize_info->dither_method != NoDitherMethod)
(void) DitherImage(image,cube_info,exception);
else
{
CacheView
*image_view;
MagickBooleanType
status;
status=MagickTrue;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(status) \
magick_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
CubeInfo
cube;
register Quantum
*magick_restrict q;
register ssize_t
x;
ssize_t
count;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
cube=(*cube_info);
for (x=0; x < (ssize_t) image->columns; x+=count)
{
DoublePixelPacket
pixel;
register const NodeInfo
*node_info;
register ssize_t
i;
size_t
id,
index;
/*
Identify the deepest node containing the pixel's color.
*/
for (count=1; (x+count) < (ssize_t) image->columns; count++)
{
PixelInfo
packet;
GetPixelInfoPixel(image,q+count*GetPixelChannels(image),&packet);
if (IsPixelEquivalent(image,q,&packet) == MagickFalse)
break;
}
AssociateAlphaPixel(image,&cube,q,&pixel);
node_info=cube.root;
for (index=MaxTreeDepth-1; (ssize_t) index > 0; index--)
{
id=ColorToNodeId(&cube,&pixel,index);
if (node_info->child[id] == (NodeInfo *) NULL)
break;
node_info=node_info->child[id];
}
/*
Find closest color among siblings and their children.
*/
cube.target=pixel;
cube.distance=(double) (4.0*(QuantumRange+1.0)*(QuantumRange+1.0)+
1.0);
ClosestColor(image,&cube,node_info->parent);
index=cube.color_number;
for (i=0; i < (ssize_t) count; i++)
{
if (image->storage_class == PseudoClass)
SetPixelIndex(image,(Quantum) index,q);
if (cube.quantize_info->measure_error == MagickFalse)
{
SetPixelRed(image,ClampToQuantum(
image->colormap[index].red),q);
SetPixelGreen(image,ClampToQuantum(
image->colormap[index].green),q);
SetPixelBlue(image,ClampToQuantum(
image->colormap[index].blue),q);
if (cube.associate_alpha != MagickFalse)
SetPixelAlpha(image,ClampToQuantum(
image->colormap[index].alpha),q);
}
q+=GetPixelChannels(image);
}
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_AssignImageColors)
#endif
proceed=SetImageProgress(image,AssignImageTag,(MagickOffsetType) y,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
}
if (cube_info->quantize_info->measure_error != MagickFalse)
(void) GetImageQuantizeError(image,exception);
if ((cube_info->quantize_info->number_colors == 2) &&
(cube_info->quantize_info->colorspace == GRAYColorspace))
{
double
intensity;
/*
Monochrome image.
*/
intensity=0.0;
if ((image->colors > 1) &&
(GetPixelInfoLuma(image->colormap+0) >
GetPixelInfoLuma(image->colormap+1)))
intensity=(double) QuantumRange;
image->colormap[0].red=intensity;
image->colormap[0].green=intensity;
image->colormap[0].blue=intensity;
if (image->colors > 1)
{
image->colormap[1].red=(double) QuantumRange-intensity;
image->colormap[1].green=(double) QuantumRange-intensity;
image->colormap[1].blue=(double) QuantumRange-intensity;
}
}
(void) SyncImage(image,exception);
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace((Image *) image,sRGBColorspace,exception);
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C l a s s i f y I m a g e C o l o r s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ClassifyImageColors() begins by initializing a color description tree
% of sufficient depth to represent each possible input color in a leaf.
% However, it is impractical to generate a fully-formed color
% description tree in the storage_class phase for realistic values of
% Cmax. If colors components in the input image are quantized to k-bit
% precision, so that Cmax= 2k-1, the tree would need k levels below the
% root node to allow representing each possible input color in a leaf.
% This becomes prohibitive because the tree's total number of nodes is
% 1 + sum(i=1,k,8k).
%
% A complete tree would require 19,173,961 nodes for k = 8, Cmax = 255.
% Therefore, to avoid building a fully populated tree, QUANTIZE: (1)
% Initializes data structures for nodes only as they are needed; (2)
% Chooses a maximum depth for the tree as a function of the desired
% number of colors in the output image (currently log2(colormap size)).
%
% For each pixel in the input image, storage_class scans downward from
% the root of the color description tree. At each level of the tree it
% identifies the single node which represents a cube in RGB space
% containing It updates the following data for each such node:
%
% n1 : Number of pixels whose color is contained in the RGB cube
% which this node represents;
%
% n2 : Number of pixels whose color is not represented in a node at
% lower depth in the tree; initially, n2 = 0 for all nodes except
% leaves of the tree.
%
% Sr, Sg, Sb : Sums of the red, green, and blue component values for
% all pixels not classified at a lower depth. The combination of
% these sums and n2 will ultimately characterize the mean color of a
% set of pixels represented by this node.
%
% E: the distance squared in RGB space between each pixel contained
% within a node and the nodes' center. This represents the quantization
% error for a node.
%
% The format of the ClassifyImageColors() method is:
%
% MagickBooleanType ClassifyImageColors(CubeInfo *cube_info,
% const Image *image,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o image: the image.
%
*/
static inline void SetAssociatedAlpha(const Image *image,CubeInfo *cube_info)
{
MagickBooleanType
associate_alpha;
associate_alpha=image->alpha_trait == BlendPixelTrait ? MagickTrue :
MagickFalse;
if ((cube_info->quantize_info->number_colors == 2) &&
(cube_info->quantize_info->colorspace == GRAYColorspace))
associate_alpha=MagickFalse;
cube_info->associate_alpha=associate_alpha;
}
static MagickBooleanType ClassifyImageColors(CubeInfo *cube_info,
const Image *image,ExceptionInfo *exception)
{
#define ClassifyImageTag "Classify/Image"
CacheView
*image_view;
DoublePixelPacket
error,
mid,
midpoint,
pixel;
MagickBooleanType
proceed;
double
bisect;
NodeInfo
*node_info;
size_t
count,
id,
index,
level;
ssize_t
y;
/*
Classify the first cube_info->maximum_colors colors to a tree depth of 8.
*/
SetAssociatedAlpha(image,cube_info);
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace((Image *) image,
cube_info->quantize_info->colorspace,exception);
else
if (IssRGBCompatibleColorspace(image->colorspace) == MagickFalse)
(void) TransformImageColorspace((Image *) image,sRGBColorspace,exception);
midpoint.red=(double) QuantumRange/2.0;
midpoint.green=(double) QuantumRange/2.0;
midpoint.blue=(double) QuantumRange/2.0;
midpoint.alpha=(double) QuantumRange/2.0;
error.alpha=0.0;
image_view=AcquireVirtualCacheView(image,exception);
for (y=0; y < (ssize_t) image->rows; y++)
{
register const Quantum
*magick_restrict p;
register ssize_t
x;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const Quantum *) NULL)
break;
if (cube_info->nodes > MaxNodes)
{
/*
Prune one level if the color tree is too large.
*/
PruneLevel(cube_info,cube_info->root);
cube_info->depth--;
}
for (x=0; x < (ssize_t) image->columns; x+=(ssize_t) count)
{
/*
Start at the root and descend the color cube tree.
*/
for (count=1; (x+(ssize_t) count) < (ssize_t) image->columns; count++)
{
PixelInfo
packet;
GetPixelInfoPixel(image,p+count*GetPixelChannels(image),&packet);
if (IsPixelEquivalent(image,p,&packet) == MagickFalse)
break;
}
AssociateAlphaPixel(image,cube_info,p,&pixel);
index=MaxTreeDepth-1;
bisect=((double) QuantumRange+1.0)/2.0;
mid=midpoint;
node_info=cube_info->root;
for (level=1; level <= MaxTreeDepth; level++)
{
double
distance;
bisect*=0.5;
id=ColorToNodeId(cube_info,&pixel,index);
mid.red+=(id & 1) != 0 ? bisect : -bisect;
mid.green+=(id & 2) != 0 ? bisect : -bisect;
mid.blue+=(id & 4) != 0 ? bisect : -bisect;
mid.alpha+=(id & 8) != 0 ? bisect : -bisect;
if (node_info->child[id] == (NodeInfo *) NULL)
{
/*
Set colors of new node to contain pixel.
*/
node_info->child[id]=GetNodeInfo(cube_info,id,level,node_info);
if (node_info->child[id] == (NodeInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",
image->filename);
continue;
}
if (level == MaxTreeDepth)
cube_info->colors++;
}
/*
Approximate the quantization error represented by this node.
*/
node_info=node_info->child[id];
error.red=QuantumScale*(pixel.red-mid.red);
error.green=QuantumScale*(pixel.green-mid.green);
error.blue=QuantumScale*(pixel.blue-mid.blue);
if (cube_info->associate_alpha != MagickFalse)
error.alpha=QuantumScale*(pixel.alpha-mid.alpha);
distance=(double) (error.red*error.red+error.green*error.green+
error.blue*error.blue+error.alpha*error.alpha);
if (IsNaN(distance))
distance=0.0;
node_info->quantize_error+=count*sqrt(distance);
cube_info->root->quantize_error+=node_info->quantize_error;
index--;
}
/*
Sum RGB for this leaf for later derivation of the mean cube color.
*/
node_info->number_unique+=count;
node_info->total_color.red+=count*QuantumScale*ClampPixel(pixel.red);
node_info->total_color.green+=count*QuantumScale*ClampPixel(pixel.green);
node_info->total_color.blue+=count*QuantumScale*ClampPixel(pixel.blue);
if (cube_info->associate_alpha != MagickFalse)
node_info->total_color.alpha+=count*QuantumScale*
ClampPixel(pixel.alpha);
else
node_info->total_color.alpha+=count*QuantumScale*
ClampPixel(OpaqueAlpha);
p+=count*GetPixelChannels(image);
}
if (cube_info->colors > cube_info->maximum_colors)
{
PruneToCubeDepth(cube_info,cube_info->root);
break;
}
proceed=SetImageProgress(image,ClassifyImageTag,(MagickOffsetType) y,
image->rows);
if (proceed == MagickFalse)
break;
}
for (y++; y < (ssize_t) image->rows; y++)
{
register const Quantum
*magick_restrict p;
register ssize_t
x;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const Quantum *) NULL)
break;
if (cube_info->nodes > MaxNodes)
{
/*
Prune one level if the color tree is too large.
*/
PruneLevel(cube_info,cube_info->root);
cube_info->depth--;
}
for (x=0; x < (ssize_t) image->columns; x+=(ssize_t) count)
{
/*
Start at the root and descend the color cube tree.
*/
for (count=1; (x+(ssize_t) count) < (ssize_t) image->columns; count++)
{
PixelInfo
packet;
GetPixelInfoPixel(image,p+count*GetPixelChannels(image),&packet);
if (IsPixelEquivalent(image,p,&packet) == MagickFalse)
break;
}
AssociateAlphaPixel(image,cube_info,p,&pixel);
index=MaxTreeDepth-1;
bisect=((double) QuantumRange+1.0)/2.0;
mid=midpoint;
node_info=cube_info->root;
for (level=1; level <= cube_info->depth; level++)
{
double
distance;
bisect*=0.5;
id=ColorToNodeId(cube_info,&pixel,index);
mid.red+=(id & 1) != 0 ? bisect : -bisect;
mid.green+=(id & 2) != 0 ? bisect : -bisect;
mid.blue+=(id & 4) != 0 ? bisect : -bisect;
mid.alpha+=(id & 8) != 0 ? bisect : -bisect;
if (node_info->child[id] == (NodeInfo *) NULL)
{
/*
Set colors of new node to contain pixel.
*/
node_info->child[id]=GetNodeInfo(cube_info,id,level,node_info);
if (node_info->child[id] == (NodeInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","%s",
image->filename);
continue;
}
if (level == cube_info->depth)
cube_info->colors++;
}
/*
Approximate the quantization error represented by this node.
*/
node_info=node_info->child[id];
error.red=QuantumScale*(pixel.red-mid.red);
error.green=QuantumScale*(pixel.green-mid.green);
error.blue=QuantumScale*(pixel.blue-mid.blue);
if (cube_info->associate_alpha != MagickFalse)
error.alpha=QuantumScale*(pixel.alpha-mid.alpha);
distance=(double) (error.red*error.red+error.green*error.green+
error.blue*error.blue+error.alpha*error.alpha);
if (IsNaN(distance) != MagickFalse)
distance=0.0;
node_info->quantize_error+=count*sqrt(distance);
cube_info->root->quantize_error+=node_info->quantize_error;
index--;
}
/*
Sum RGB for this leaf for later derivation of the mean cube color.
*/
node_info->number_unique+=count;
node_info->total_color.red+=count*QuantumScale*ClampPixel(pixel.red);
node_info->total_color.green+=count*QuantumScale*ClampPixel(pixel.green);
node_info->total_color.blue+=count*QuantumScale*ClampPixel(pixel.blue);
if (cube_info->associate_alpha != MagickFalse)
node_info->total_color.alpha+=count*QuantumScale*
ClampPixel(pixel.alpha);
else
node_info->total_color.alpha+=count*QuantumScale*
ClampPixel(OpaqueAlpha);
p+=count*GetPixelChannels(image);
}
proceed=SetImageProgress(image,ClassifyImageTag,(MagickOffsetType) y,
image->rows);
if (proceed == MagickFalse)
break;
}
image_view=DestroyCacheView(image_view);
if ((cube_info->quantize_info->colorspace != UndefinedColorspace) &&
(cube_info->quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace((Image *) image,sRGBColorspace,exception);
return(y < (ssize_t) image->rows ? MagickFalse : MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C l o n e Q u a n t i z e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CloneQuantizeInfo() makes a duplicate of the given quantize info structure,
% or if quantize info is NULL, a new one.
%
% The format of the CloneQuantizeInfo method is:
%
% QuantizeInfo *CloneQuantizeInfo(const QuantizeInfo *quantize_info)
%
% A description of each parameter follows:
%
% o clone_info: Method CloneQuantizeInfo returns a duplicate of the given
% quantize info, or if image info is NULL a new one.
%
% o quantize_info: a structure of type info.
%
*/
MagickExport QuantizeInfo *CloneQuantizeInfo(const QuantizeInfo *quantize_info)
{
QuantizeInfo
*clone_info;
clone_info=(QuantizeInfo *) AcquireMagickMemory(sizeof(*clone_info));
if (clone_info == (QuantizeInfo *) NULL)
ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed");
GetQuantizeInfo(clone_info);
if (quantize_info == (QuantizeInfo *) NULL)
return(clone_info);
clone_info->number_colors=quantize_info->number_colors;
clone_info->tree_depth=quantize_info->tree_depth;
clone_info->dither_method=quantize_info->dither_method;
clone_info->colorspace=quantize_info->colorspace;
clone_info->measure_error=quantize_info->measure_error;
return(clone_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C l o s e s t C o l o r %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ClosestColor() traverses the color cube tree at a particular node and
% determines which colormap entry best represents the input color.
%
% The format of the ClosestColor method is:
%
% void ClosestColor(const Image *image,CubeInfo *cube_info,
% const NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: the address of a structure of type NodeInfo which points to a
% node in the color cube tree that is to be pruned.
%
*/
static void ClosestColor(const Image *image,CubeInfo *cube_info,
const NodeInfo *node_info)
{
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
ClosestColor(image,cube_info,node_info->child[i]);
if (node_info->number_unique != 0)
{
double
pixel;
register double
alpha,
beta,
distance;
register DoublePixelPacket
*magick_restrict q;
register PixelInfo
*magick_restrict p;
/*
Determine if this color is "closest".
*/
p=image->colormap+node_info->color_number;
q=(&cube_info->target);
alpha=1.0;
beta=1.0;
if (cube_info->associate_alpha != MagickFalse)
{
alpha=(double) (QuantumScale*p->alpha);
beta=(double) (QuantumScale*q->alpha);
}
pixel=alpha*p->red-beta*q->red;
distance=pixel*pixel;
if (distance <= cube_info->distance)
{
pixel=alpha*p->green-beta*q->green;
distance+=pixel*pixel;
if (distance <= cube_info->distance)
{
pixel=alpha*p->blue-beta*q->blue;
distance+=pixel*pixel;
if (distance <= cube_info->distance)
{
if (cube_info->associate_alpha != MagickFalse)
{
pixel=p->alpha-q->alpha;
distance+=pixel*pixel;
}
if (distance <= cube_info->distance)
{
cube_info->distance=distance;
cube_info->color_number=node_info->color_number;
}
}
}
}
}
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o m p r e s s I m a g e C o l o r m a p %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CompressImageColormap() compresses an image colormap by removing any
% duplicate or unused color entries.
%
% The format of the CompressImageColormap method is:
%
% MagickBooleanType CompressImageColormap(Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType CompressImageColormap(Image *image,
ExceptionInfo *exception)
{
QuantizeInfo
quantize_info;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (IsPaletteImage(image) == MagickFalse)
return(MagickFalse);
GetQuantizeInfo(&quantize_info);
quantize_info.number_colors=image->colors;
quantize_info.tree_depth=MaxTreeDepth;
return(QuantizeImage(&quantize_info,image,exception));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D e f i n e I m a g e C o l o r m a p %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DefineImageColormap() traverses the color cube tree and notes each colormap
% entry. A colormap entry is any node in the color cube tree where the
% of unique colors is not zero. DefineImageColormap() returns the number of
% colors in the image colormap.
%
% The format of the DefineImageColormap method is:
%
% size_t DefineImageColormap(Image *image,CubeInfo *cube_info,
% NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: the address of a structure of type NodeInfo which points to a
% node in the color cube tree that is to be pruned.
%
*/
static size_t DefineImageColormap(Image *image,CubeInfo *cube_info,
NodeInfo *node_info)
{
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
(void) DefineImageColormap(image,cube_info,node_info->child[i]);
if (node_info->number_unique != 0)
{
register double
alpha;
register PixelInfo
*magick_restrict q;
/*
Colormap entry is defined by the mean color in this cube.
*/
q=image->colormap+image->colors;
alpha=(double) ((MagickOffsetType) node_info->number_unique);
alpha=PerceptibleReciprocal(alpha);
if (cube_info->associate_alpha == MagickFalse)
{
q->red=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.red);
q->green=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.green);
q->blue=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.blue);
q->alpha=(double) OpaqueAlpha;
}
else
{
double
opacity;
opacity=(double) (alpha*QuantumRange*node_info->total_color.alpha);
q->alpha=(double) ClampToQuantum(opacity);
if (q->alpha == OpaqueAlpha)
{
q->red=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.red);
q->green=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.green);
q->blue=(double) ClampToQuantum(alpha*QuantumRange*
node_info->total_color.blue);
}
else
{
double
gamma;
gamma=(double) (QuantumScale*q->alpha);
gamma=PerceptibleReciprocal(gamma);
q->red=(double) ClampToQuantum(alpha*gamma*QuantumRange*
node_info->total_color.red);
q->green=(double) ClampToQuantum(alpha*gamma*QuantumRange*
node_info->total_color.green);
q->blue=(double) ClampToQuantum(alpha*gamma*QuantumRange*
node_info->total_color.blue);
if (node_info->number_unique > cube_info->transparent_pixels)
{
cube_info->transparent_pixels=node_info->number_unique;
cube_info->transparent_index=(ssize_t) image->colors;
}
}
}
node_info->color_number=image->colors++;
}
return(image->colors);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D e s t r o y C u b e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DestroyCubeInfo() deallocates memory associated with an image.
%
% The format of the DestroyCubeInfo method is:
%
% DestroyCubeInfo(CubeInfo *cube_info)
%
% A description of each parameter follows:
%
% o cube_info: the address of a structure of type CubeInfo.
%
*/
static void DestroyCubeInfo(CubeInfo *cube_info)
{
register Nodes
*nodes;
/*
Release color cube tree storage.
*/
do
{
nodes=cube_info->node_queue->next;
cube_info->node_queue->nodes=(NodeInfo *) RelinquishMagickMemory(
cube_info->node_queue->nodes);
cube_info->node_queue=(Nodes *) RelinquishMagickMemory(
cube_info->node_queue);
cube_info->node_queue=nodes;
} while (cube_info->node_queue != (Nodes *) NULL);
if (cube_info->memory_info != (MemoryInfo *) NULL)
cube_info->memory_info=RelinquishVirtualMemory(cube_info->memory_info);
cube_info->quantize_info=DestroyQuantizeInfo(cube_info->quantize_info);
cube_info=(CubeInfo *) RelinquishMagickMemory(cube_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e s t r o y Q u a n t i z e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DestroyQuantizeInfo() deallocates memory associated with an QuantizeInfo
% structure.
%
% The format of the DestroyQuantizeInfo method is:
%
% QuantizeInfo *DestroyQuantizeInfo(QuantizeInfo *quantize_info)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
*/
MagickExport QuantizeInfo *DestroyQuantizeInfo(QuantizeInfo *quantize_info)
{
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"...");
assert(quantize_info != (QuantizeInfo *) NULL);
assert(quantize_info->signature == MagickCoreSignature);
quantize_info->signature=(~MagickCoreSignature);
quantize_info=(QuantizeInfo *) RelinquishMagickMemory(quantize_info);
return(quantize_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D i t h e r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DitherImage() distributes the difference between an original image and
% the corresponding color reduced algorithm to neighboring pixels using
% serpentine-scan Floyd-Steinberg error diffusion. DitherImage returns
% MagickTrue if the image is dithered otherwise MagickFalse.
%
% The format of the DitherImage method is:
%
% MagickBooleanType DitherImage(Image *image,CubeInfo *cube_info,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o cube_info: A pointer to the Cube structure.
%
% o exception: return any errors or warnings in this structure.
%
*/
static DoublePixelPacket **DestroyPixelThreadSet(DoublePixelPacket **pixels)
{
register ssize_t
i;
assert(pixels != (DoublePixelPacket **) NULL);
for (i=0; i < (ssize_t) GetMagickResourceLimit(ThreadResource); i++)
if (pixels[i] != (DoublePixelPacket *) NULL)
pixels[i]=(DoublePixelPacket *) RelinquishMagickMemory(pixels[i]);
pixels=(DoublePixelPacket **) RelinquishMagickMemory(pixels);
return(pixels);
}
static DoublePixelPacket **AcquirePixelThreadSet(const size_t count)
{
DoublePixelPacket
**pixels;
register ssize_t
i;
size_t
number_threads;
number_threads=(size_t) GetMagickResourceLimit(ThreadResource);
pixels=(DoublePixelPacket **) AcquireQuantumMemory(number_threads,
sizeof(*pixels));
if (pixels == (DoublePixelPacket **) NULL)
return((DoublePixelPacket **) NULL);
(void) ResetMagickMemory(pixels,0,number_threads*sizeof(*pixels));
for (i=0; i < (ssize_t) number_threads; i++)
{
pixels[i]=(DoublePixelPacket *) AcquireQuantumMemory(count,2*
sizeof(**pixels));
if (pixels[i] == (DoublePixelPacket *) NULL)
return(DestroyPixelThreadSet(pixels));
}
return(pixels);
}
static inline ssize_t CacheOffset(CubeInfo *cube_info,
const DoublePixelPacket *pixel)
{
#define RedShift(pixel) (((pixel) >> CacheShift) << (0*(8-CacheShift)))
#define GreenShift(pixel) (((pixel) >> CacheShift) << (1*(8-CacheShift)))
#define BlueShift(pixel) (((pixel) >> CacheShift) << (2*(8-CacheShift)))
#define AlphaShift(pixel) (((pixel) >> CacheShift) << (3*(8-CacheShift)))
ssize_t
offset;
offset=(ssize_t) (RedShift(ScaleQuantumToChar(ClampPixel(pixel->red))) |
GreenShift(ScaleQuantumToChar(ClampPixel(pixel->green))) |
BlueShift(ScaleQuantumToChar(ClampPixel(pixel->blue))));
if (cube_info->associate_alpha != MagickFalse)
offset|=AlphaShift(ScaleQuantumToChar(ClampPixel(pixel->alpha)));
return(offset);
}
static MagickBooleanType FloydSteinbergDither(Image *image,CubeInfo *cube_info,
ExceptionInfo *exception)
{
#define DitherImageTag "Dither/Image"
CacheView
*image_view;
DoublePixelPacket
**pixels;
MagickBooleanType
status;
ssize_t
y;
/*
Distribute quantization error using Floyd-Steinberg.
*/
pixels=AcquirePixelThreadSet(image->columns);
if (pixels == (DoublePixelPacket **) NULL)
return(MagickFalse);
status=MagickTrue;
image_view=AcquireAuthenticCacheView(image,exception);
for (y=0; y < (ssize_t) image->rows; y++)
{
const int
id = GetOpenMPThreadId();
CubeInfo
cube;
DoublePixelPacket
*current,
*previous;
register Quantum
*magick_restrict q;
register ssize_t
x;
size_t
index;
ssize_t
v;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
cube=(*cube_info);
current=pixels[id]+(y & 0x01)*image->columns;
previous=pixels[id]+((y+1) & 0x01)*image->columns;
v=(ssize_t) ((y & 0x01) != 0 ? -1 : 1);
for (x=0; x < (ssize_t) image->columns; x++)
{
DoublePixelPacket
color,
pixel;
register ssize_t
i;
ssize_t
u;
u=(y & 0x01) != 0 ? (ssize_t) image->columns-1-x : x;
AssociateAlphaPixel(image,&cube,q+u*GetPixelChannels(image),&pixel);
if (x > 0)
{
pixel.red+=7*current[u-v].red/16;
pixel.green+=7*current[u-v].green/16;
pixel.blue+=7*current[u-v].blue/16;
if (cube.associate_alpha != MagickFalse)
pixel.alpha+=7*current[u-v].alpha/16;
}
if (y > 0)
{
if (x < (ssize_t) (image->columns-1))
{
pixel.red+=previous[u+v].red/16;
pixel.green+=previous[u+v].green/16;
pixel.blue+=previous[u+v].blue/16;
if (cube.associate_alpha != MagickFalse)
pixel.alpha+=previous[u+v].alpha/16;
}
pixel.red+=5*previous[u].red/16;
pixel.green+=5*previous[u].green/16;
pixel.blue+=5*previous[u].blue/16;
if (cube.associate_alpha != MagickFalse)
pixel.alpha+=5*previous[u].alpha/16;
if (x > 0)
{
pixel.red+=3*previous[u-v].red/16;
pixel.green+=3*previous[u-v].green/16;
pixel.blue+=3*previous[u-v].blue/16;
if (cube.associate_alpha != MagickFalse)
pixel.alpha+=3*previous[u-v].alpha/16;
}
}
pixel.red=(double) ClampPixel(pixel.red);
pixel.green=(double) ClampPixel(pixel.green);
pixel.blue=(double) ClampPixel(pixel.blue);
if (cube.associate_alpha != MagickFalse)
pixel.alpha=(double) ClampPixel(pixel.alpha);
i=CacheOffset(&cube,&pixel);
if (cube.cache[i] < 0)
{
register NodeInfo
*node_info;
register size_t
node_id;
/*
Identify the deepest node containing the pixel's color.
*/
node_info=cube.root;
for (index=MaxTreeDepth-1; (ssize_t) index > 0; index--)
{
node_id=ColorToNodeId(&cube,&pixel,index);
if (node_info->child[node_id] == (NodeInfo *) NULL)
break;
node_info=node_info->child[node_id];
}
/*
Find closest color among siblings and their children.
*/
cube.target=pixel;
cube.distance=(double) (4.0*(QuantumRange+1.0)*(QuantumRange+1.0)+
1.0);
ClosestColor(image,&cube,node_info->parent);
cube.cache[i]=(ssize_t) cube.color_number;
}
/*
Assign pixel to closest colormap entry.
*/
index=(size_t) cube.cache[i];
if (image->storage_class == PseudoClass)
SetPixelIndex(image,(Quantum) index,q+u*GetPixelChannels(image));
if (cube.quantize_info->measure_error == MagickFalse)
{
SetPixelRed(image,ClampToQuantum(image->colormap[index].red),
q+u*GetPixelChannels(image));
SetPixelGreen(image,ClampToQuantum(image->colormap[index].green),
q+u*GetPixelChannels(image));
SetPixelBlue(image,ClampToQuantum(image->colormap[index].blue),
q+u*GetPixelChannels(image));
if (cube.associate_alpha != MagickFalse)
SetPixelAlpha(image,ClampToQuantum(image->colormap[index].alpha),
q+u*GetPixelChannels(image));
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
/*
Store the error.
*/
AssociateAlphaPixelInfo(&cube,image->colormap+index,&color);
current[u].red=pixel.red-color.red;
current[u].green=pixel.green-color.green;
current[u].blue=pixel.blue-color.blue;
if (cube.associate_alpha != MagickFalse)
current[u].alpha=pixel.alpha-color.alpha;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
proceed=SetImageProgress(image,DitherImageTag,(MagickOffsetType) y,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
}
image_view=DestroyCacheView(image_view);
pixels=DestroyPixelThreadSet(pixels);
return(MagickTrue);
}
static MagickBooleanType
RiemersmaDither(Image *,CacheView *,CubeInfo *,const unsigned int,
ExceptionInfo *);
static void Riemersma(Image *image,CacheView *image_view,CubeInfo *cube_info,
const size_t level,const unsigned int direction,ExceptionInfo *exception)
{
if (level == 1)
switch (direction)
{
case WestGravity:
{
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
break;
}
case EastGravity:
{
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
break;
}
case NorthGravity:
{
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
break;
}
case SouthGravity:
{
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
break;
}
default:
break;
}
else
switch (direction)
{
case WestGravity:
{
Riemersma(image,image_view,cube_info,level-1,NorthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,WestGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,WestGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,SouthGravity,
exception);
break;
}
case EastGravity:
{
Riemersma(image,image_view,cube_info,level-1,SouthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,EastGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,EastGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,NorthGravity,
exception);
break;
}
case NorthGravity:
{
Riemersma(image,image_view,cube_info,level-1,WestGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,NorthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,EastGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,NorthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,EastGravity,
exception);
break;
}
case SouthGravity:
{
Riemersma(image,image_view,cube_info,level-1,EastGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,NorthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,SouthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,WestGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,SouthGravity,
exception);
(void) RiemersmaDither(image,image_view,cube_info,SouthGravity,
exception);
Riemersma(image,image_view,cube_info,level-1,WestGravity,
exception);
break;
}
default:
break;
}
}
static MagickBooleanType RiemersmaDither(Image *image,CacheView *image_view,
CubeInfo *cube_info,const unsigned int direction,ExceptionInfo *exception)
{
#define DitherImageTag "Dither/Image"
DoublePixelPacket
color,
pixel;
MagickBooleanType
proceed;
register CubeInfo
*p;
size_t
index;
p=cube_info;
if ((p->x >= 0) && (p->x < (ssize_t) image->columns) &&
(p->y >= 0) && (p->y < (ssize_t) image->rows))
{
register Quantum
*magick_restrict q;
register ssize_t
i;
/*
Distribute error.
*/
q=GetCacheViewAuthenticPixels(image_view,p->x,p->y,1,1,exception);
if (q == (Quantum *) NULL)
return(MagickFalse);
AssociateAlphaPixel(image,cube_info,q,&pixel);
for (i=0; i < ErrorQueueLength; i++)
{
pixel.red+=p->weights[i]*p->error[i].red;
pixel.green+=p->weights[i]*p->error[i].green;
pixel.blue+=p->weights[i]*p->error[i].blue;
if (cube_info->associate_alpha != MagickFalse)
pixel.alpha+=p->weights[i]*p->error[i].alpha;
}
pixel.red=(double) ClampPixel(pixel.red);
pixel.green=(double) ClampPixel(pixel.green);
pixel.blue=(double) ClampPixel(pixel.blue);
if (cube_info->associate_alpha != MagickFalse)
pixel.alpha=(double) ClampPixel(pixel.alpha);
i=CacheOffset(cube_info,&pixel);
if (p->cache[i] < 0)
{
register NodeInfo
*node_info;
register size_t
id;
/*
Identify the deepest node containing the pixel's color.
*/
node_info=p->root;
for (index=MaxTreeDepth-1; (ssize_t) index > 0; index--)
{
id=ColorToNodeId(cube_info,&pixel,index);
if (node_info->child[id] == (NodeInfo *) NULL)
break;
node_info=node_info->child[id];
}
/*
Find closest color among siblings and their children.
*/
p->target=pixel;
p->distance=(double) (4.0*(QuantumRange+1.0)*((double)
QuantumRange+1.0)+1.0);
ClosestColor(image,p,node_info->parent);
p->cache[i]=(ssize_t) p->color_number;
}
/*
Assign pixel to closest colormap entry.
*/
index=(size_t) p->cache[i];
if (image->storage_class == PseudoClass)
SetPixelIndex(image,(Quantum) index,q);
if (cube_info->quantize_info->measure_error == MagickFalse)
{
SetPixelRed(image,ClampToQuantum(image->colormap[index].red),q);
SetPixelGreen(image,ClampToQuantum(image->colormap[index].green),q);
SetPixelBlue(image,ClampToQuantum(image->colormap[index].blue),q);
if (cube_info->associate_alpha != MagickFalse)
SetPixelAlpha(image,ClampToQuantum(image->colormap[index].alpha),q);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
return(MagickFalse);
/*
Propagate the error as the last entry of the error queue.
*/
(void) CopyMagickMemory(p->error,p->error+1,(ErrorQueueLength-1)*
sizeof(p->error[0]));
AssociateAlphaPixelInfo(cube_info,image->colormap+index,&color);
p->error[ErrorQueueLength-1].red=pixel.red-color.red;
p->error[ErrorQueueLength-1].green=pixel.green-color.green;
p->error[ErrorQueueLength-1].blue=pixel.blue-color.blue;
if (cube_info->associate_alpha != MagickFalse)
p->error[ErrorQueueLength-1].alpha=pixel.alpha-color.alpha;
proceed=SetImageProgress(image,DitherImageTag,p->offset,p->span);
if (proceed == MagickFalse)
return(MagickFalse);
p->offset++;
}
switch (direction)
{
case WestGravity: p->x--; break;
case EastGravity: p->x++; break;
case NorthGravity: p->y--; break;
case SouthGravity: p->y++; break;
}
return(MagickTrue);
}
static MagickBooleanType DitherImage(Image *image,CubeInfo *cube_info,
ExceptionInfo *exception)
{
CacheView
*image_view;
MagickBooleanType
status;
register ssize_t
i;
size_t
depth;
if (cube_info->quantize_info->dither_method != RiemersmaDitherMethod)
return(FloydSteinbergDither(image,cube_info,exception));
/*
Distribute quantization error along a Hilbert curve.
*/
(void) ResetMagickMemory(cube_info->error,0,ErrorQueueLength*
sizeof(*cube_info->error));
cube_info->x=0;
cube_info->y=0;
i=MagickMax((ssize_t) image->columns,(ssize_t) image->rows);
for (depth=1; i != 0; depth++)
i>>=1;
if ((ssize_t) (1L << depth) < MagickMax((ssize_t) image->columns,(ssize_t) image->rows))
depth++;
cube_info->offset=0;
cube_info->span=(MagickSizeType) image->columns*image->rows;
image_view=AcquireAuthenticCacheView(image,exception);
if (depth > 1)
Riemersma(image,image_view,cube_info,depth-1,NorthGravity,exception);
status=RiemersmaDither(image,image_view,cube_info,ForgetGravity,exception);
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ G e t C u b e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetCubeInfo() initialize the Cube data structure.
%
% The format of the GetCubeInfo method is:
%
% CubeInfo GetCubeInfo(const QuantizeInfo *quantize_info,
% const size_t depth,const size_t maximum_colors)
%
% A description of each parameter follows.
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
% o depth: Normally, this integer value is zero or one. A zero or
% one tells Quantize to choose a optimal tree depth of Log4(number_colors).
% A tree of this depth generally allows the best representation of the
% reference image with the least amount of memory and the fastest
% computational speed. In some cases, such as an image with low color
% dispersion (a few number of colors), a value other than
% Log4(number_colors) is required. To expand the color tree completely,
% use a value of 8.
%
% o maximum_colors: maximum colors.
%
*/
static CubeInfo *GetCubeInfo(const QuantizeInfo *quantize_info,
const size_t depth,const size_t maximum_colors)
{
CubeInfo
*cube_info;
double
sum,
weight;
register ssize_t
i;
size_t
length;
/*
Initialize tree to describe color cube_info.
*/
cube_info=(CubeInfo *) AcquireMagickMemory(sizeof(*cube_info));
if (cube_info == (CubeInfo *) NULL)
return((CubeInfo *) NULL);
(void) ResetMagickMemory(cube_info,0,sizeof(*cube_info));
cube_info->depth=depth;
if (cube_info->depth > MaxTreeDepth)
cube_info->depth=MaxTreeDepth;
if (cube_info->depth < 2)
cube_info->depth=2;
cube_info->maximum_colors=maximum_colors;
/*
Initialize root node.
*/
cube_info->root=GetNodeInfo(cube_info,0,0,(NodeInfo *) NULL);
if (cube_info->root == (NodeInfo *) NULL)
return((CubeInfo *) NULL);
cube_info->root->parent=cube_info->root;
cube_info->quantize_info=CloneQuantizeInfo(quantize_info);
if (cube_info->quantize_info->dither_method == NoDitherMethod)
return(cube_info);
/*
Initialize dither resources.
*/
length=(size_t) (1UL << (4*(8-CacheShift)));
cube_info->memory_info=AcquireVirtualMemory(length,sizeof(*cube_info->cache));
if (cube_info->memory_info == (MemoryInfo *) NULL)
return((CubeInfo *) NULL);
cube_info->cache=(ssize_t *) GetVirtualMemoryBlob(cube_info->memory_info);
/*
Initialize color cache.
*/
(void) ResetMagickMemory(cube_info->cache,(-1),sizeof(*cube_info->cache)*
length);
/*
Distribute weights along a curve of exponential decay.
*/
weight=1.0;
for (i=0; i < ErrorQueueLength; i++)
{
cube_info->weights[ErrorQueueLength-i-1]=PerceptibleReciprocal(weight);
weight*=exp(log(((double) QuantumRange+1.0))/(ErrorQueueLength-1.0));
}
/*
Normalize the weighting factors.
*/
weight=0.0;
for (i=0; i < ErrorQueueLength; i++)
weight+=cube_info->weights[i];
sum=0.0;
for (i=0; i < ErrorQueueLength; i++)
{
cube_info->weights[i]/=weight;
sum+=cube_info->weights[i];
}
cube_info->weights[0]+=1.0-sum;
return(cube_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ G e t N o d e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetNodeInfo() allocates memory for a new node in the color cube tree and
% presets all fields to zero.
%
% The format of the GetNodeInfo method is:
%
% NodeInfo *GetNodeInfo(CubeInfo *cube_info,const size_t id,
% const size_t level,NodeInfo *parent)
%
% A description of each parameter follows.
%
% o node: The GetNodeInfo method returns a pointer to a queue of nodes.
%
% o id: Specifies the child number of the node.
%
% o level: Specifies the level in the storage_class the node resides.
%
*/
static NodeInfo *GetNodeInfo(CubeInfo *cube_info,const size_t id,
const size_t level,NodeInfo *parent)
{
NodeInfo
*node_info;
if (cube_info->free_nodes == 0)
{
Nodes
*nodes;
/*
Allocate a new queue of nodes.
*/
nodes=(Nodes *) AcquireMagickMemory(sizeof(*nodes));
if (nodes == (Nodes *) NULL)
return((NodeInfo *) NULL);
nodes->nodes=(NodeInfo *) AcquireQuantumMemory(NodesInAList,
sizeof(*nodes->nodes));
if (nodes->nodes == (NodeInfo *) NULL)
return((NodeInfo *) NULL);
nodes->next=cube_info->node_queue;
cube_info->node_queue=nodes;
cube_info->next_node=nodes->nodes;
cube_info->free_nodes=NodesInAList;
}
cube_info->nodes++;
cube_info->free_nodes--;
node_info=cube_info->next_node++;
(void) ResetMagickMemory(node_info,0,sizeof(*node_info));
node_info->parent=parent;
node_info->id=id;
node_info->level=level;
return(node_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t I m a g e Q u a n t i z e E r r o r %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetImageQuantizeError() measures the difference between the original
% and quantized images. This difference is the total quantization error.
% The error is computed by summing over all pixels in an image the distance
% squared in RGB space between each reference pixel value and its quantized
% value. These values are computed:
%
% o mean_error_per_pixel: This value is the mean error for any single
% pixel in the image.
%
% o normalized_mean_square_error: This value is the normalized mean
% quantization error for any single pixel in the image. This distance
% measure is normalized to a range between 0 and 1. It is independent
% of the range of red, green, and blue values in the image.
%
% o normalized_maximum_square_error: Thsi value is the normalized
% maximum quantization error for any single pixel in the image. This
% distance measure is normalized to a range between 0 and 1. It is
% independent of the range of red, green, and blue values in your image.
%
% The format of the GetImageQuantizeError method is:
%
% MagickBooleanType GetImageQuantizeError(Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType GetImageQuantizeError(Image *image,
ExceptionInfo *exception)
{
CacheView
*image_view;
double
alpha,
area,
beta,
distance,
maximum_error,
mean_error,
mean_error_per_pixel;
size_t
index;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
image->total_colors=GetNumberColors(image,(FILE *) NULL,exception);
(void) ResetMagickMemory(&image->error,0,sizeof(image->error));
if (image->storage_class == DirectClass)
return(MagickTrue);
alpha=1.0;
beta=1.0;
area=3.0*image->columns*image->rows;
maximum_error=0.0;
mean_error_per_pixel=0.0;
mean_error=0.0;
image_view=AcquireVirtualCacheView(image,exception);
for (y=0; y < (ssize_t) image->rows; y++)
{
register const Quantum
*magick_restrict p;
register ssize_t
x;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const Quantum *) NULL)
break;
for (x=0; x < (ssize_t) image->columns; x++)
{
index=GetPixelIndex(image,p);
if (image->alpha_trait == BlendPixelTrait)
{
alpha=(double) (QuantumScale*GetPixelAlpha(image,p));
beta=(double) (QuantumScale*image->colormap[index].alpha);
}
distance=fabs((double) (alpha*GetPixelRed(image,p)-beta*
image->colormap[index].red));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
maximum_error=distance;
distance=fabs((double) (alpha*GetPixelGreen(image,p)-beta*
image->colormap[index].green));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
maximum_error=distance;
distance=fabs((double) (alpha*GetPixelBlue(image,p)-beta*
image->colormap[index].blue));
mean_error_per_pixel+=distance;
mean_error+=distance*distance;
if (distance > maximum_error)
maximum_error=distance;
p+=GetPixelChannels(image);
}
}
image_view=DestroyCacheView(image_view);
image->error.mean_error_per_pixel=(double) mean_error_per_pixel/area;
image->error.normalized_mean_error=(double) QuantumScale*QuantumScale*
mean_error/area;
image->error.normalized_maximum_error=(double) QuantumScale*maximum_error;
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t Q u a n t i z e I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetQuantizeInfo() initializes the QuantizeInfo structure.
%
% The format of the GetQuantizeInfo method is:
%
% GetQuantizeInfo(QuantizeInfo *quantize_info)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to a QuantizeInfo structure.
%
*/
MagickExport void GetQuantizeInfo(QuantizeInfo *quantize_info)
{
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"...");
assert(quantize_info != (QuantizeInfo *) NULL);
(void) ResetMagickMemory(quantize_info,0,sizeof(*quantize_info));
quantize_info->number_colors=256;
quantize_info->dither_method=RiemersmaDitherMethod;
quantize_info->colorspace=UndefinedColorspace;
quantize_info->measure_error=MagickFalse;
quantize_info->signature=MagickCoreSignature;
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P o s t e r i z e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PosterizeImage() reduces the image to a limited number of colors for a
% "poster" effect.
%
% The format of the PosterizeImage method is:
%
% MagickBooleanType PosterizeImage(Image *image,const size_t levels,
% const DitherMethod dither_method,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: Specifies a pointer to an Image structure.
%
% o levels: Number of color levels allowed in each channel. Very low values
% (2, 3, or 4) have the most visible effect.
%
% o dither_method: choose from UndefinedDitherMethod, NoDitherMethod,
% RiemersmaDitherMethod, FloydSteinbergDitherMethod.
%
% o exception: return any errors or warnings in this structure.
%
*/
static inline double MagickRound(double x)
{
/*
Round the fraction to nearest integer.
*/
if ((x-floor(x)) < (ceil(x)-x))
return(floor(x));
return(ceil(x));
}
MagickExport MagickBooleanType PosterizeImage(Image *image,const size_t levels,
const DitherMethod dither_method,ExceptionInfo *exception)
{
#define PosterizeImageTag "Posterize/Image"
#define PosterizePixel(pixel) (Quantum) (QuantumRange*(MagickRound( \
QuantumScale*pixel*(levels-1)))/MagickMax((ssize_t) levels-1,1))
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
QuantizeInfo
*quantize_info;
register ssize_t
i;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
if (image->storage_class == PseudoClass)
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,image,1,1)
#endif
for (i=0; i < (ssize_t) image->colors; i++)
{
/*
Posterize colormap.
*/
if ((GetPixelRedTraits(image) & UpdatePixelTrait) != 0)
image->colormap[i].red=(double)
PosterizePixel(image->colormap[i].red);
if ((GetPixelGreenTraits(image) & UpdatePixelTrait) != 0)
image->colormap[i].green=(double)
PosterizePixel(image->colormap[i].green);
if ((GetPixelBlueTraits(image) & UpdatePixelTrait) != 0)
image->colormap[i].blue=(double)
PosterizePixel(image->colormap[i].blue);
if ((GetPixelAlphaTraits(image) & UpdatePixelTrait) != 0)
image->colormap[i].alpha=(double)
PosterizePixel(image->colormap[i].alpha);
}
/*
Posterize image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register Quantum
*magick_restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
if ((GetPixelRedTraits(image) & UpdatePixelTrait) != 0)
SetPixelRed(image,PosterizePixel(GetPixelRed(image,q)),q);
if ((GetPixelGreenTraits(image) & UpdatePixelTrait) != 0)
SetPixelGreen(image,PosterizePixel(GetPixelGreen(image,q)),q);
if ((GetPixelBlueTraits(image) & UpdatePixelTrait) != 0)
SetPixelBlue(image,PosterizePixel(GetPixelBlue(image,q)),q);
if (((GetPixelBlackTraits(image) & UpdatePixelTrait) != 0) &&
(image->colorspace == CMYKColorspace))
SetPixelBlack(image,PosterizePixel(GetPixelBlack(image,q)),q);
if (((GetPixelAlphaTraits(image) & UpdatePixelTrait) != 0) &&
(image->alpha_trait == BlendPixelTrait))
SetPixelAlpha(image,PosterizePixel(GetPixelAlpha(image,q)),q);
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_PosterizeImage)
#endif
proceed=SetImageProgress(image,PosterizeImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
quantize_info=AcquireQuantizeInfo((ImageInfo *) NULL);
quantize_info->number_colors=(size_t) MagickMin((ssize_t) levels*levels*
levels,MaxColormapSize+1);
quantize_info->dither_method=dither_method;
quantize_info->tree_depth=MaxTreeDepth;
status=QuantizeImage(quantize_info,image,exception);
quantize_info=DestroyQuantizeInfo(quantize_info);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ P r u n e C h i l d %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PruneChild() deletes the given node and merges its statistics into its
% parent.
%
% The format of the PruneSubtree method is:
%
% PruneChild(CubeInfo *cube_info,const NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: pointer to node in color cube tree that is to be pruned.
%
*/
static void PruneChild(CubeInfo *cube_info,const NodeInfo *node_info)
{
NodeInfo
*parent;
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
PruneChild(cube_info,node_info->child[i]);
/*
Merge color statistics into parent.
*/
parent=node_info->parent;
parent->number_unique+=node_info->number_unique;
parent->total_color.red+=node_info->total_color.red;
parent->total_color.green+=node_info->total_color.green;
parent->total_color.blue+=node_info->total_color.blue;
parent->total_color.alpha+=node_info->total_color.alpha;
parent->child[node_info->id]=(NodeInfo *) NULL;
cube_info->nodes--;
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ P r u n e L e v e l %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PruneLevel() deletes all nodes at the bottom level of the color tree merging
% their color statistics into their parent node.
%
% The format of the PruneLevel method is:
%
% PruneLevel(CubeInfo *cube_info,const NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: pointer to node in color cube tree that is to be pruned.
%
*/
static void PruneLevel(CubeInfo *cube_info,const NodeInfo *node_info)
{
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
PruneLevel(cube_info,node_info->child[i]);
if (node_info->level == cube_info->depth)
PruneChild(cube_info,node_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ P r u n e T o C u b e D e p t h %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PruneToCubeDepth() deletes any nodes at a depth greater than
% cube_info->depth while merging their color statistics into their parent
% node.
%
% The format of the PruneToCubeDepth method is:
%
% PruneToCubeDepth(CubeInfo *cube_info,const NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: pointer to node in color cube tree that is to be pruned.
%
*/
static void PruneToCubeDepth(CubeInfo *cube_info,const NodeInfo *node_info)
{
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
PruneToCubeDepth(cube_info,node_info->child[i]);
if (node_info->level > cube_info->depth)
PruneChild(cube_info,node_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% Q u a n t i z e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% QuantizeImage() analyzes the colors within a reference image and chooses a
% fixed number of colors to represent the image. The goal of the algorithm
% is to minimize the color difference between the input and output image while
% minimizing the processing time.
%
% The format of the QuantizeImage method is:
%
% MagickBooleanType QuantizeImage(const QuantizeInfo *quantize_info,
% Image *image,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
% o image: the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType QuantizeImage(const QuantizeInfo *quantize_info,
Image *image,ExceptionInfo *exception)
{
CubeInfo
*cube_info;
MagickBooleanType
status;
size_t
depth,
maximum_colors;
assert(quantize_info != (const QuantizeInfo *) NULL);
assert(quantize_info->signature == MagickCoreSignature);
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
maximum_colors=quantize_info->number_colors;
if (maximum_colors == 0)
maximum_colors=MaxColormapSize;
if (maximum_colors > MaxColormapSize)
maximum_colors=MaxColormapSize;
if (image->alpha_trait != BlendPixelTrait)
{
if (SetImageGray(image,exception) != MagickFalse)
(void) SetGrayscaleImage(image,exception);
}
if ((image->storage_class == PseudoClass) &&
(image->colors <= maximum_colors))
{
if ((quantize_info->colorspace != UndefinedColorspace) &&
(quantize_info->colorspace != CMYKColorspace))
(void) TransformImageColorspace(image,quantize_info->colorspace,
exception);
return(MagickTrue);
}
depth=quantize_info->tree_depth;
if (depth == 0)
{
size_t
colors;
/*
Depth of color tree is: Log4(colormap size)+2.
*/
colors=maximum_colors;
for (depth=1; colors != 0; depth++)
colors>>=2;
if ((quantize_info->dither_method != NoDitherMethod) && (depth > 2))
depth--;
if ((image->alpha_trait == BlendPixelTrait) && (depth > 5))
depth--;
if (SetImageGray(image,exception) != MagickFalse)
depth=MaxTreeDepth;
}
/*
Initialize color cube.
*/
cube_info=GetCubeInfo(quantize_info,depth,maximum_colors);
if (cube_info == (CubeInfo *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
status=ClassifyImageColors(cube_info,image,exception);
if (status != MagickFalse)
{
/*
Reduce the number of colors in the image if it contains more than the
maximum, otherwise we can disable dithering to improve the performance.
*/
if (cube_info->colors > cube_info->maximum_colors)
ReduceImageColors(image,cube_info);
else
cube_info->quantize_info->dither_method=NoDitherMethod;
status=AssignImageColors(image,cube_info,exception);
}
DestroyCubeInfo(cube_info);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% Q u a n t i z e I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% QuantizeImages() analyzes the colors within a set of reference images and
% chooses a fixed number of colors to represent the set. The goal of the
% algorithm is to minimize the color difference between the input and output
% images while minimizing the processing time.
%
% The format of the QuantizeImages method is:
%
% MagickBooleanType QuantizeImages(const QuantizeInfo *quantize_info,
% Image *images,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
% o images: Specifies a pointer to a list of Image structures.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType QuantizeImages(const QuantizeInfo *quantize_info,
Image *images,ExceptionInfo *exception)
{
CubeInfo
*cube_info;
Image
*image;
MagickBooleanType
proceed,
status;
MagickProgressMonitor
progress_monitor;
register ssize_t
i;
size_t
depth,
maximum_colors,
number_images;
assert(quantize_info != (const QuantizeInfo *) NULL);
assert(quantize_info->signature == MagickCoreSignature);
assert(images != (Image *) NULL);
assert(images->signature == MagickCoreSignature);
if (images->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
if (GetNextImageInList(images) == (Image *) NULL)
{
/*
Handle a single image with QuantizeImage.
*/
status=QuantizeImage(quantize_info,images,exception);
return(status);
}
status=MagickFalse;
maximum_colors=quantize_info->number_colors;
if (maximum_colors == 0)
maximum_colors=MaxColormapSize;
if (maximum_colors > MaxColormapSize)
maximum_colors=MaxColormapSize;
depth=quantize_info->tree_depth;
if (depth == 0)
{
size_t
colors;
/*
Depth of color tree is: Log4(colormap size)+2.
*/
colors=maximum_colors;
for (depth=1; colors != 0; depth++)
colors>>=2;
if (quantize_info->dither_method != NoDitherMethod)
depth--;
}
/*
Initialize color cube.
*/
cube_info=GetCubeInfo(quantize_info,depth,maximum_colors);
if (cube_info == (CubeInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",images->filename);
return(MagickFalse);
}
number_images=GetImageListLength(images);
image=images;
for (i=0; image != (Image *) NULL; i++)
{
progress_monitor=SetImageProgressMonitor(image,(MagickProgressMonitor) NULL,
image->client_data);
status=ClassifyImageColors(cube_info,image,exception);
if (status == MagickFalse)
break;
(void) SetImageProgressMonitor(image,progress_monitor,image->client_data);
proceed=SetImageProgress(image,AssignImageTag,(MagickOffsetType) i,
number_images);
if (proceed == MagickFalse)
break;
image=GetNextImageInList(image);
}
if (status != MagickFalse)
{
/*
Reduce the number of colors in an image sequence.
*/
ReduceImageColors(images,cube_info);
image=images;
for (i=0; image != (Image *) NULL; i++)
{
progress_monitor=SetImageProgressMonitor(image,(MagickProgressMonitor)
NULL,image->client_data);
status=AssignImageColors(image,cube_info,exception);
if (status == MagickFalse)
break;
(void) SetImageProgressMonitor(image,progress_monitor,
image->client_data);
proceed=SetImageProgress(image,AssignImageTag,(MagickOffsetType) i,
number_images);
if (proceed == MagickFalse)
break;
image=GetNextImageInList(image);
}
}
DestroyCubeInfo(cube_info);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ Q u a n t i z e E r r o r F l a t t e n %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% QuantizeErrorFlatten() traverses the color cube and flattens the quantization
% error into a sorted 1D array. This accelerates the color reduction process.
%
% Contributed by Yoya.
%
% The format of the QuantizeErrorFlatten method is:
%
% size_t QuantizeErrorFlatten(const CubeInfo *cube_info,
% const NodeInfo *node_info,const ssize_t offset,
% double *quantize_error)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: pointer to node in color cube tree that is current pointer.
%
% o offset: quantize error offset.
%
% o quantize_error: the quantization error vector.
%
*/
static size_t QuantizeErrorFlatten(const CubeInfo *cube_info,
const NodeInfo *node_info,const ssize_t offset,double *quantize_error)
{
register ssize_t
i;
size_t
n,
number_children;
if (offset >= (ssize_t) cube_info->nodes)
return(0);
quantize_error[offset]=node_info->quantize_error;
n=1;
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children ; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
n+=QuantizeErrorFlatten(cube_info,node_info->child[i],offset+n,
quantize_error);
return(n);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ R e d u c e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% Reduce() traverses the color cube tree and prunes any node whose
% quantization error falls below a particular threshold.
%
% The format of the Reduce method is:
%
% Reduce(CubeInfo *cube_info,const NodeInfo *node_info)
%
% A description of each parameter follows.
%
% o cube_info: A pointer to the Cube structure.
%
% o node_info: pointer to node in color cube tree that is to be pruned.
%
*/
static void Reduce(CubeInfo *cube_info,const NodeInfo *node_info)
{
register ssize_t
i;
size_t
number_children;
/*
Traverse any children.
*/
number_children=cube_info->associate_alpha == MagickFalse ? 8UL : 16UL;
for (i=0; i < (ssize_t) number_children; i++)
if (node_info->child[i] != (NodeInfo *) NULL)
Reduce(cube_info,node_info->child[i]);
if (node_info->quantize_error <= cube_info->pruning_threshold)
PruneChild(cube_info,node_info);
else
{
/*
Find minimum pruning threshold.
*/
if (node_info->number_unique > 0)
cube_info->colors++;
if (node_info->quantize_error < cube_info->next_threshold)
cube_info->next_threshold=node_info->quantize_error;
}
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ R e d u c e I m a g e C o l o r s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ReduceImageColors() repeatedly prunes the tree until the number of nodes
% with n2 > 0 is less than or equal to the maximum number of colors allowed
% in the output image. On any given iteration over the tree, it selects
% those nodes whose E value is minimal for pruning and merges their
% color statistics upward. It uses a pruning threshold, Ep, to govern
% node selection as follows:
%
% Ep = 0
% while number of nodes with (n2 > 0) > required maximum number of colors
% prune all nodes such that E <= Ep
% Set Ep to minimum E in remaining nodes
%
% This has the effect of minimizing any quantization error when merging
% two nodes together.
%
% When a node to be pruned has offspring, the pruning procedure invokes
% itself recursively in order to prune the tree from the leaves upward.
% n2, Sr, Sg, and Sb in a node being pruned are always added to the
% corresponding data in that node's parent. This retains the pruned
% node's color characteristics for later averaging.
%
% For each node, n2 pixels exist for which that node represents the
% smallest volume in RGB space containing those pixel's colors. When n2
% > 0 the node will uniquely define a color in the output image. At the
% beginning of reduction, n2 = 0 for all nodes except a the leaves of
% the tree which represent colors present in the input image.
%
% The other pixel count, n1, indicates the total number of colors
% within the cubic volume which the node represents. This includes n1 -
% n2 pixels whose colors should be defined by nodes at a lower level in
% the tree.
%
% The format of the ReduceImageColors method is:
%
% ReduceImageColors(const Image *image,CubeInfo *cube_info)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o cube_info: A pointer to the Cube structure.
%
*/
static int QuantizeErrorCompare(const void *error_p,const void *error_q)
{
double
*p,
*q;
p=(double *) error_p;
q=(double *) error_q;
if (*p > *q)
return(1);
if (fabs(*q-*p) <= MagickEpsilon)
return(0);
return(-1);
}
static void ReduceImageColors(const Image *image,CubeInfo *cube_info)
{
#define ReduceImageTag "Reduce/Image"
MagickBooleanType
proceed;
MagickOffsetType
offset;
size_t
span;
cube_info->next_threshold=0.0;
if (cube_info->colors > cube_info->maximum_colors)
{
double
*quantize_error;
/*
Enable rapid reduction of the number of unique colors.
*/
quantize_error=(double *) AcquireQuantumMemory(cube_info->nodes,
sizeof(*quantize_error));
if (quantize_error != (double *) NULL)
{
(void) QuantizeErrorFlatten(cube_info,cube_info->root,0,
quantize_error);
qsort(quantize_error,cube_info->nodes,sizeof(double),
QuantizeErrorCompare);
if (cube_info->nodes > (110*(cube_info->maximum_colors+1)/100))
cube_info->next_threshold=quantize_error[cube_info->nodes-110*
(cube_info->maximum_colors+1)/100];
quantize_error=(double *) RelinquishMagickMemory(quantize_error);
}
}
for (span=cube_info->colors; cube_info->colors > cube_info->maximum_colors; )
{
cube_info->pruning_threshold=cube_info->next_threshold;
cube_info->next_threshold=cube_info->root->quantize_error-1;
cube_info->colors=0;
Reduce(cube_info,cube_info->root);
offset=(MagickOffsetType) span-cube_info->colors;
proceed=SetImageProgress(image,ReduceImageTag,offset,span-
cube_info->maximum_colors+1);
if (proceed == MagickFalse)
break;
}
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e m a p I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% RemapImage() replaces the colors of an image with the closest of the colors
% from the reference image.
%
% The format of the RemapImage method is:
%
% MagickBooleanType RemapImage(const QuantizeInfo *quantize_info,
% Image *image,const Image *remap_image,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
% o image: the image.
%
% o remap_image: the reference image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType RemapImage(const QuantizeInfo *quantize_info,
Image *image,const Image *remap_image,ExceptionInfo *exception)
{
CubeInfo
*cube_info;
MagickBooleanType
status;
/*
Initialize color cube.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(remap_image != (Image *) NULL);
assert(remap_image->signature == MagickCoreSignature);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
cube_info=GetCubeInfo(quantize_info,MaxTreeDepth,
quantize_info->number_colors);
if (cube_info == (CubeInfo *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
status=ClassifyImageColors(cube_info,remap_image,exception);
if (status != MagickFalse)
{
/*
Classify image colors from the reference image.
*/
cube_info->quantize_info->number_colors=cube_info->colors;
status=AssignImageColors(image,cube_info,exception);
}
DestroyCubeInfo(cube_info);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e m a p I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% RemapImages() replaces the colors of a sequence of images with the
% closest color from a reference image.
%
% The format of the RemapImage method is:
%
% MagickBooleanType RemapImages(const QuantizeInfo *quantize_info,
% Image *images,Image *remap_image,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o quantize_info: Specifies a pointer to an QuantizeInfo structure.
%
% o images: the image sequence.
%
% o remap_image: the reference image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport MagickBooleanType RemapImages(const QuantizeInfo *quantize_info,
Image *images,const Image *remap_image,ExceptionInfo *exception)
{
CubeInfo
*cube_info;
Image
*image;
MagickBooleanType
status;
assert(images != (Image *) NULL);
assert(images->signature == MagickCoreSignature);
if (images->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
image=images;
if (remap_image == (Image *) NULL)
{
/*
Create a global colormap for an image sequence.
*/
status=QuantizeImages(quantize_info,images,exception);
return(status);
}
/*
Classify image colors from the reference image.
*/
cube_info=GetCubeInfo(quantize_info,MaxTreeDepth,
quantize_info->number_colors);
if (cube_info == (CubeInfo *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
status=ClassifyImageColors(cube_info,remap_image,exception);
if (status != MagickFalse)
{
/*
Classify image colors from the reference image.
*/
cube_info->quantize_info->number_colors=cube_info->colors;
image=images;
for ( ; image != (Image *) NULL; image=GetNextImageInList(image))
{
status=AssignImageColors(image,cube_info,exception);
if (status == MagickFalse)
break;
}
}
DestroyCubeInfo(cube_info);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e t G r a y s c a l e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SetGrayscaleImage() converts an image to a PseudoClass grayscale image.
%
% The format of the SetGrayscaleImage method is:
%
% MagickBooleanType SetGrayscaleImage(Image *image,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: The image.
%
% o exception: return any errors or warnings in this structure.
%
*/
#if defined(__cplusplus) || defined(c_plusplus)
extern "C" {
#endif
static int IntensityCompare(const void *x,const void *y)
{
double
intensity;
PixelInfo
*color_1,
*color_2;
color_1=(PixelInfo *) x;
color_2=(PixelInfo *) y;
intensity=GetPixelInfoIntensity((const Image *) NULL,color_1)-
GetPixelInfoIntensity((const Image *) NULL,color_2);
return((int) intensity);
}
#if defined(__cplusplus) || defined(c_plusplus)
}
#endif
static MagickBooleanType SetGrayscaleImage(Image *image,
ExceptionInfo *exception)
{
CacheView
*image_view;
MagickBooleanType
status;
PixelInfo
*colormap;
register ssize_t
i;
ssize_t
*colormap_index,
j,
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->type != GrayscaleType)
(void) TransformImageColorspace(image,GRAYColorspace,exception);
colormap_index=(ssize_t *) AcquireQuantumMemory(MaxColormapSize,
sizeof(*colormap_index));
if (colormap_index == (ssize_t *) NULL)
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
if (image->storage_class != PseudoClass)
{
(void) ResetMagickMemory(colormap_index,(-1),MaxColormapSize*
sizeof(*colormap_index));
if (AcquireImageColormap(image,MaxColormapSize,exception) == MagickFalse)
{
colormap_index=(ssize_t *) RelinquishMagickMemory(colormap_index);
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
}
image->colors=0;
status=MagickTrue;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(status) \
magick_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register Quantum
*magick_restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
register size_t
intensity;
intensity=ScaleQuantumToMap(GetPixelRed(image,q));
if (colormap_index[intensity] < 0)
{
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_SetGrayscaleImage)
#endif
if (colormap_index[intensity] < 0)
{
colormap_index[intensity]=(ssize_t) image->colors;
image->colormap[image->colors].red=(double)
GetPixelRed(image,q);
image->colormap[image->colors].green=(double)
GetPixelGreen(image,q);
image->colormap[image->colors].blue=(double)
GetPixelBlue(image,q);
image->colors++;
}
}
SetPixelIndex(image,(Quantum) colormap_index[intensity],q);
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
}
for (i=0; i < (ssize_t) image->colors; i++)
image->colormap[i].alpha=(double) i;
qsort((void *) image->colormap,image->colors,sizeof(PixelInfo),
IntensityCompare);
colormap=(PixelInfo *) AcquireQuantumMemory(image->colors,sizeof(*colormap));
if (colormap == (PixelInfo *) NULL)
{
colormap_index=(ssize_t *) RelinquishMagickMemory(colormap_index);
ThrowBinaryException(ResourceLimitError,"MemoryAllocationFailed",
image->filename);
}
j=0;
colormap[j]=image->colormap[0];
for (i=0; i < (ssize_t) image->colors; i++)
{
if (IsPixelInfoEquivalent(&colormap[j],&image->colormap[i]) == MagickFalse)
{
j++;
colormap[j]=image->colormap[i];
}
colormap_index[(ssize_t) image->colormap[i].alpha]=j;
}
image->colors=(size_t) (j+1);
image->colormap=(PixelInfo *) RelinquishMagickMemory(image->colormap);
image->colormap=colormap;
status=MagickTrue;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(status) \
magick_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register Quantum
*magick_restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,exception);
if (q == (Quantum *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
SetPixelIndex(image,(Quantum) colormap_index[ScaleQuantumToMap(
GetPixelIndex(image,q))],q);
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
}
image_view=DestroyCacheView(image_view);
colormap_index=(ssize_t *) RelinquishMagickMemory(colormap_index);
image->type=GrayscaleType;
if (SetImageMonochrome(image,exception) != MagickFalse)
image->type=BilevelType;
return(status);
}
|
pr64824.c | /* PR c/64824 */
/* { dg-do run } */
int
main ()
{
long long a;
long long b = 1LL;
int c = 3;
#pragma omp atomic capture
a = b = c << b;
if (b != 6LL || a != 6LL)
__builtin_abort ();
return 0;
}
|
profile.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% PPPP RRRR OOO FFFFF IIIII L EEEEE %
% P P R R O O F I L E %
% PPPP RRRR O O FFF I L EEE %
% P R R O O F I L E %
% P R R OOO F IIIII LLLLL EEEEE %
% %
% %
% MagickCore Image Profile Methods %
% %
% Software Design %
% John Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2012 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% http://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
*/
/*
Include declarations.
*/
#include "magick/studio.h"
#include "magick/cache.h"
#include "magick/color.h"
#include "magick/colorspace-private.h"
#include "magick/configure.h"
#include "magick/exception.h"
#include "magick/exception-private.h"
#include "magick/hashmap.h"
#include "magick/image.h"
#include "magick/memory_.h"
#include "magick/monitor.h"
#include "magick/monitor-private.h"
#include "magick/option.h"
#include "magick/profile.h"
#include "magick/property.h"
#include "magick/quantum.h"
#include "magick/quantum-private.h"
#include "magick/splay-tree.h"
#include "magick/string_.h"
#include "magick/thread-private.h"
#include "magick/token.h"
#include "magick/utility.h"
#if defined(MAGICKCORE_LCMS_DELEGATE)
#if defined(MAGICKCORE_HAVE_LCMS_LCMS2_H)
#include <wchar.h>
#include <lcms/lcms2.h>
#elif defined(MAGICKCORE_HAVE_LCMS2_H)
#include <wchar.h>
#include "lcms2.h"
#elif defined(MAGICKCORE_HAVE_LCMS_LCMS_H)
#include <lcms/lcms.h>
#else
#include "lcms.h"
#endif
#endif
/*
Define declarations.
*/
#if !defined(LCMS_VERSION) || (LCMS_VERSION < 2000)
#define cmsSigCmykData icSigCmykData
#define cmsSigGrayData icSigGrayData
#define cmsSigLabData icSigLabData
#define cmsSigLuvData icSigLuvData
#define cmsSigRgbData icSigRgbData
#define cmsSigXYZData icSigXYZData
#define cmsSigYCbCrData icSigYCbCrData
#define cmsSigLinkClass icSigLinkClass
#define cmsColorSpaceSignature icColorSpaceSignature
#define cmsUInt32Number DWORD
#define cmsSetLogErrorHandler(handler) cmsSetErrorHandler(handler)
#define cmsCreateTransformTHR(context,source_profile,source_type, \
target_profile,target_type,intent,flags) cmsCreateTransform(source_profile, \
source_type,target_profile,target_type,intent,flags);
#define cmsOpenProfileFromMemTHR(context,profile,length) \
cmsOpenProfileFromMem(profile,length)
#endif
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C l o n e I m a g e P r o f i l e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CloneImageProfiles() clones one or more image profiles.
%
% The format of the CloneImageProfiles method is:
%
% MagickBooleanType CloneImageProfiles(Image *image,
% const Image *clone_image)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o clone_image: the clone image.
%
*/
MagickExport MagickBooleanType CloneImageProfiles(Image *image,
const Image *clone_image)
{
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(clone_image != (const Image *) NULL);
assert(clone_image->signature == MagickSignature);
image->color_profile.length=clone_image->color_profile.length;
image->color_profile.info=clone_image->color_profile.info;
image->iptc_profile.length=clone_image->iptc_profile.length;
image->iptc_profile.info=clone_image->iptc_profile.info;
if (clone_image->profiles != (void *) NULL)
image->profiles=CloneSplayTree((SplayTreeInfo *) clone_image->profiles,
(void *(*)(void *)) ConstantString,(void *(*)(void *)) CloneStringInfo);
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e l e t e I m a g e P r o f i l e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DeleteImageProfile() deletes a profile from the image by its name.
%
% The format of the DeleteImageProfile method is:
%
% MagickBooleanTyupe DeleteImageProfile(Image *image,const char *name)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o name: the profile name.
%
*/
MagickExport MagickBooleanType DeleteImageProfile(Image *image,const char *name)
{
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
return(MagickFalse);
if (LocaleCompare(name,"icc") == 0)
{
/*
Continue to support deprecated color profile for now.
*/
image->color_profile.length=0;
image->color_profile.info=(unsigned char *) NULL;
}
if (LocaleCompare(name,"iptc") == 0)
{
/*
Continue to support deprecated IPTC profile for now.
*/
image->iptc_profile.length=0;
image->iptc_profile.info=(unsigned char *) NULL;
}
return(DeleteNodeFromSplayTree((SplayTreeInfo *) image->profiles,name));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e s t r o y I m a g e P r o f i l e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DestroyImageProfiles() releases memory associated with an image profile map.
%
% The format of the DestroyProfiles method is:
%
% void DestroyImageProfiles(Image *image)
%
% A description of each parameter follows:
%
% o image: the image.
%
*/
MagickExport void DestroyImageProfiles(Image *image)
{
if (image->profiles != (SplayTreeInfo *) NULL)
image->profiles=DestroySplayTree((SplayTreeInfo *) image->profiles);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t I m a g e P r o f i l e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetImageProfile() gets a profile associated with an image by name.
%
% The format of the GetImageProfile method is:
%
% const StringInfo *GetImageProfile(const Image *image,const char *name)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o name: the profile name.
%
*/
MagickExport const StringInfo *GetImageProfile(const Image *image,
const char *name)
{
char
key[MaxTextExtent];
const StringInfo
*profile;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
return((StringInfo *) NULL);
(void) CopyMagickString(key,name,MaxTextExtent);
profile=(const StringInfo *) GetValueFromSplayTree((SplayTreeInfo *)
image->profiles,key);
return(profile);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% G e t N e x t I m a g e P r o f i l e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% GetNextImageProfile() gets the next profile name for an image.
%
% The format of the GetNextImageProfile method is:
%
% char *GetNextImageProfile(const Image *image)
%
% A description of each parameter follows:
%
% o hash_info: the hash info.
%
*/
MagickExport char *GetNextImageProfile(const Image *image)
{
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
return((char *) NULL);
return((char *) GetNextKeyInSplayTree((SplayTreeInfo *) image->profiles));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P r o f i l e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ProfileImage() associates, applies, or removes an ICM, IPTC, or generic
% profile with / to / from an image. If the profile is NULL, it is removed
% from the image otherwise added or applied. Use a name of '*' and a profile
% of NULL to remove all profiles from the image.
%
% ICC and ICM profiles are handled as follows: If the image does not have
% an associated color profile, the one you provide is associated with the
% image and the image pixels are not transformed. Otherwise, the colorspace
% transform defined by the existing and new profile are applied to the image
% pixels and the new profile is associated with the image.
%
% The format of the ProfileImage method is:
%
% MagickBooleanType ProfileImage(Image *image,const char *name,
% const void *datum,const size_t length,const MagickBooleanType clone)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o name: Name of profile to add or remove: ICC, IPTC, or generic profile.
%
% o datum: the profile data.
%
% o length: the length of the profile.
%
% o clone: should be MagickFalse.
%
*/
#if defined(MAGICKCORE_LCMS_DELEGATE)
static unsigned short **DestroyPixelThreadSet(unsigned short **pixels)
{
register ssize_t
i;
assert(pixels != (unsigned short **) NULL);
for (i=0; i < (ssize_t) GetOpenMPMaximumThreads(); i++)
if (pixels[i] != (unsigned short *) NULL)
pixels[i]=(unsigned short *) RelinquishMagickMemory(pixels[i]);
pixels=(unsigned short **) RelinquishMagickMemory(pixels);
return(pixels);
}
static unsigned short **AcquirePixelThreadSet(const size_t columns,
const size_t channels)
{
register ssize_t
i;
unsigned short
**pixels;
size_t
number_threads;
number_threads=GetOpenMPMaximumThreads();
pixels=(unsigned short **) AcquireQuantumMemory(number_threads,
sizeof(*pixels));
if (pixels == (unsigned short **) NULL)
return((unsigned short **) NULL);
(void) ResetMagickMemory(pixels,0,number_threads*sizeof(*pixels));
for (i=0; i < (ssize_t) number_threads; i++)
{
pixels[i]=(unsigned short *) AcquireQuantumMemory(columns,channels*
sizeof(**pixels));
if (pixels[i] == (unsigned short *) NULL)
return(DestroyPixelThreadSet(pixels));
}
return(pixels);
}
static cmsHTRANSFORM *DestroyTransformThreadSet(cmsHTRANSFORM *transform)
{
register ssize_t
i;
assert(transform != (cmsHTRANSFORM *) NULL);
for (i=0; i < (ssize_t) GetOpenMPMaximumThreads(); i++)
if (transform[i] != (cmsHTRANSFORM) NULL)
cmsDeleteTransform(transform[i]);
transform=(cmsHTRANSFORM *) RelinquishMagickMemory(transform);
return(transform);
}
static cmsHTRANSFORM *AcquireTransformThreadSet(Image *image,
const cmsHPROFILE source_profile,const cmsUInt32Number source_type,
const cmsHPROFILE target_profile,const cmsUInt32Number target_type,
const int intent,const cmsUInt32Number flags)
{
cmsHTRANSFORM
*transform;
register ssize_t
i;
size_t
number_threads;
number_threads=GetOpenMPMaximumThreads();
transform=(cmsHTRANSFORM *) AcquireQuantumMemory(number_threads,
sizeof(*transform));
if (transform == (cmsHTRANSFORM *) NULL)
return((cmsHTRANSFORM *) NULL);
(void) ResetMagickMemory(transform,0,number_threads*sizeof(*transform));
for (i=0; i < (ssize_t) number_threads; i++)
{
transform[i]=cmsCreateTransformTHR(image,source_profile,source_type,
target_profile,target_type,intent,flags);
if (transform[i] == (cmsHTRANSFORM) NULL)
return(DestroyTransformThreadSet(transform));
}
return(transform);
}
#endif
static MagickBooleanType SetAdobeRGB1998ImageProfile(Image *image)
{
static unsigned char
AdobeRGB1998Profile[] =
{
0x00, 0x00, 0x02, 0x30, 0x41, 0x44, 0x42, 0x45, 0x02, 0x10, 0x00,
0x00, 0x6d, 0x6e, 0x74, 0x72, 0x52, 0x47, 0x42, 0x20, 0x58, 0x59,
0x5a, 0x20, 0x07, 0xd0, 0x00, 0x08, 0x00, 0x0b, 0x00, 0x13, 0x00,
0x33, 0x00, 0x3b, 0x61, 0x63, 0x73, 0x70, 0x41, 0x50, 0x50, 0x4c,
0x00, 0x00, 0x00, 0x00, 0x6e, 0x6f, 0x6e, 0x65, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xf6, 0xd6, 0x00, 0x01, 0x00, 0x00, 0x00,
0x00, 0xd3, 0x2d, 0x41, 0x44, 0x42, 0x45, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x0a,
0x63, 0x70, 0x72, 0x74, 0x00, 0x00, 0x00, 0xfc, 0x00, 0x00, 0x00,
0x32, 0x64, 0x65, 0x73, 0x63, 0x00, 0x00, 0x01, 0x30, 0x00, 0x00,
0x00, 0x6b, 0x77, 0x74, 0x70, 0x74, 0x00, 0x00, 0x01, 0x9c, 0x00,
0x00, 0x00, 0x14, 0x62, 0x6b, 0x70, 0x74, 0x00, 0x00, 0x01, 0xb0,
0x00, 0x00, 0x00, 0x14, 0x72, 0x54, 0x52, 0x43, 0x00, 0x00, 0x01,
0xc4, 0x00, 0x00, 0x00, 0x0e, 0x67, 0x54, 0x52, 0x43, 0x00, 0x00,
0x01, 0xd4, 0x00, 0x00, 0x00, 0x0e, 0x62, 0x54, 0x52, 0x43, 0x00,
0x00, 0x01, 0xe4, 0x00, 0x00, 0x00, 0x0e, 0x72, 0x58, 0x59, 0x5a,
0x00, 0x00, 0x01, 0xf4, 0x00, 0x00, 0x00, 0x14, 0x67, 0x58, 0x59,
0x5a, 0x00, 0x00, 0x02, 0x08, 0x00, 0x00, 0x00, 0x14, 0x62, 0x58,
0x59, 0x5a, 0x00, 0x00, 0x02, 0x1c, 0x00, 0x00, 0x00, 0x14, 0x74,
0x65, 0x78, 0x74, 0x00, 0x00, 0x00, 0x00, 0x43, 0x6f, 0x70, 0x79,
0x72, 0x69, 0x67, 0x68, 0x74, 0x20, 0x32, 0x30, 0x30, 0x30, 0x20,
0x41, 0x64, 0x6f, 0x62, 0x65, 0x20, 0x53, 0x79, 0x73, 0x74, 0x65,
0x6d, 0x73, 0x20, 0x49, 0x6e, 0x63, 0x6f, 0x72, 0x70, 0x6f, 0x72,
0x61, 0x74, 0x65, 0x64, 0x00, 0x00, 0x00, 0x64, 0x65, 0x73, 0x63,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x11, 0x41, 0x64, 0x6f,
0x62, 0x65, 0x20, 0x52, 0x47, 0x42, 0x20, 0x28, 0x31, 0x39, 0x39,
0x38, 0x29, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x58, 0x59, 0x5a, 0x20, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0xf3, 0x51, 0x00, 0x01, 0x00, 0x00, 0x00,
0x01, 0x16, 0xcc, 0x58, 0x59, 0x5a, 0x20, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x02, 0x33, 0x00, 0x00, 0x63, 0x75, 0x72, 0x76, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x02, 0x33, 0x00, 0x00,
0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x01, 0x02, 0x33, 0x00, 0x00, 0x58, 0x59, 0x5a, 0x20, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x9c, 0x18, 0x00, 0x00, 0x4f, 0xa5, 0x00,
0x00, 0x04, 0xfc, 0x58, 0x59, 0x5a, 0x20, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x34, 0x8d, 0x00, 0x00, 0xa0, 0x2c, 0x00, 0x00, 0x0f,
0x95, 0x58, 0x59, 0x5a, 0x20, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x26, 0x31, 0x00, 0x00, 0x10, 0x2f, 0x00, 0x00, 0xbe, 0x9c
};
StringInfo
*profile;
MagickBooleanType
status;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (GetImageProfile(image,"icm") != (const StringInfo *) NULL)
return(MagickFalse);
profile=AcquireStringInfo(sizeof(AdobeRGB1998Profile));
SetStringInfoDatum(profile,AdobeRGB1998Profile);
status=SetImageProfile(image,"icm",profile);
profile=DestroyStringInfo(profile);
return(status);
}
static MagickBooleanType SetsRGBImageProfile(Image *image)
{
static unsigned char
sRGBProfile[] =
{
0x00, 0x00, 0xee, 0x20, 0x00, 0x00, 0x00, 0x00, 0x04, 0x20, 0x00, 0x00,
0x73, 0x70, 0x61, 0x63, 0x52, 0x47, 0x42, 0x20, 0x4c, 0x61, 0x62, 0x20,
0x07, 0xd7, 0x00, 0x07, 0x00, 0x19, 0x00, 0x00, 0x00, 0x05, 0x00, 0x25,
0x61, 0x63, 0x73, 0x70, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xf6, 0xd6,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0xd3, 0x2d, 0x00, 0x00, 0x00, 0x00,
0x34, 0x56, 0x2a, 0xbf, 0x99, 0x4c, 0xcd, 0x06, 0x6d, 0x2c, 0x57, 0x21,
0xd0, 0xd6, 0x8c, 0x5d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x09,
0x64, 0x65, 0x73, 0x63, 0x00, 0x00, 0x00, 0xf0, 0x00, 0x00, 0x00, 0x76,
0x41, 0x32, 0x42, 0x30, 0x00, 0x00, 0x01, 0x68, 0x00, 0x00, 0x74, 0x10,
0x41, 0x32, 0x42, 0x31, 0x00, 0x00, 0x75, 0x78, 0x00, 0x00, 0x01, 0xb4,
0x42, 0x32, 0x41, 0x30, 0x00, 0x00, 0x77, 0x2c, 0x00, 0x00, 0x74, 0x34,
0x42, 0x32, 0x41, 0x31, 0x00, 0x00, 0xeb, 0x60, 0x00, 0x00, 0x01, 0xfc,
0x72, 0x69, 0x67, 0x30, 0x00, 0x00, 0xed, 0x5c, 0x00, 0x00, 0x00, 0x0c,
0x77, 0x74, 0x70, 0x74, 0x00, 0x00, 0xed, 0x68, 0x00, 0x00, 0x00, 0x14,
0x63, 0x70, 0x72, 0x74, 0x00, 0x00, 0xed, 0x7c, 0x00, 0x00, 0x00, 0x76,
0x63, 0x68, 0x61, 0x64, 0x00, 0x00, 0xed, 0xf4, 0x00, 0x00, 0x00, 0x2c,
0x6d, 0x6c, 0x75, 0x63, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
0x00, 0x00, 0x00, 0x0c, 0x65, 0x6e, 0x55, 0x53, 0x00, 0x00, 0x00, 0x5a,
0x00, 0x00, 0x00, 0x1c, 0x00, 0x73, 0x00, 0x52, 0x00, 0x47, 0x00, 0x42,
0x00, 0x20, 0x00, 0x76, 0x00, 0x34, 0x00, 0x20, 0x00, 0x49, 0x00, 0x43,
0x00, 0x43, 0x00, 0x20, 0x00, 0x70, 0x00, 0x72, 0x00, 0x65, 0x00, 0x66,
0x00, 0x65, 0x00, 0x72, 0x00, 0x65, 0x00, 0x6e, 0x00, 0x63, 0x00, 0x65,
0x00, 0x20, 0x00, 0x70, 0x00, 0x65, 0x00, 0x72, 0x00, 0x63, 0x00, 0x65,
0x00, 0x70, 0x00, 0x74, 0x00, 0x75, 0x00, 0x61, 0x00, 0x6c, 0x00, 0x20,
0x00, 0x69, 0x00, 0x6e, 0x00, 0x74, 0x00, 0x65, 0x00, 0x6e, 0x00, 0x74,
0x00, 0x20, 0x00, 0x62, 0x00, 0x65, 0x00, 0x74, 0x00, 0x61, 0x00, 0x00,
0x6d, 0x41, 0x42, 0x20, 0x00, 0x00, 0x00, 0x00, 0x03, 0x03, 0x00, 0x00,
0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00, 0x50, 0x00, 0x00, 0x00, 0x80,
0x00, 0x00, 0x00, 0xb0, 0x00, 0x00, 0x73, 0xec, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x11, 0x11, 0x11, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x02, 0x00, 0x00, 0x00, 0x07, 0xf7, 0x80, 0x80, 0x80, 0x80, 0x07, 0xb9,
0x84, 0x8b, 0x77, 0x79, 0x08, 0x42, 0x88, 0x52, 0x6e, 0xa3, 0x09, 0x61,
0x8c, 0x4a, 0x65, 0xcf, 0x0c, 0x7a, 0x90, 0x54, 0x5d, 0xda, 0x0e, 0x9b,
0x94, 0x6f, 0x56, 0x76, 0x11, 0x50, 0x98, 0x8f, 0x4f, 0x12, 0x15, 0x38,
0x9c, 0x52, 0x48, 0xda, 0x19, 0x01, 0x9f, 0xe2, 0x42, 0x8a, 0x1b, 0xc9,
0xa2, 0xab, 0x3d, 0xed, 0x1e, 0x44, 0xa4, 0xf7, 0x3a, 0x07, 0x20, 0xea,
0xa6, 0xf5, 0x36, 0x4e, 0x23, 0xb9, 0xa8, 0xc8, 0x32, 0x8e, 0x26, 0x3f,
0xaa, 0x95, 0x2e, 0xb6, 0x28, 0x93, 0xac, 0x8a, 0x2a, 0x00, 0x2c, 0x1a,
0xae, 0x50, 0x25, 0xb4, 0x2f, 0xd0, 0xb0, 0x03, 0x1f, 0xae, 0x09, 0x99,
0x78, 0x06, 0x86, 0x58, 0x0e, 0x30, 0x7a, 0x97, 0x7c, 0x67, 0x0f, 0xe9,
0x7e, 0xdc, 0x73, 0x23, 0x11, 0xc0, 0x83, 0x38, 0x6a, 0x65, 0x13, 0xf7,
0x87, 0x57, 0x61, 0xb0, 0x16, 0xab, 0x8c, 0x2a, 0x59, 0x90, 0x19, 0x4c,
0x90, 0xb3, 0x51, 0x93, 0x1c, 0x1d, 0x94, 0xdc, 0x4a, 0xc6, 0x1f, 0x61,
0x98, 0xb2, 0x44, 0x5d, 0x22, 0xf0, 0x9c, 0x26, 0x3e, 0xe5, 0x26, 0x09,
0x9e, 0xf0, 0x3a, 0xf2, 0x28, 0x93, 0xa1, 0x42, 0x37, 0x50, 0x2a, 0xfa,
0xa3, 0x41, 0x33, 0xc2, 0x2d, 0x94, 0xa5, 0x12, 0x30, 0x4e, 0x30, 0x7a,
0xa6, 0xe2, 0x2c, 0x40, 0x33, 0x7c, 0xa8, 0x97, 0x28, 0x53, 0x36, 0x46,
0xaa, 0x11, 0x24, 0xb9, 0x14, 0xa0, 0x6f, 0xfd, 0x8b, 0x7e, 0x16, 0x12,
0x72, 0x51, 0x82, 0x38, 0x17, 0x8e, 0x75, 0x89, 0x78, 0xb8, 0x19, 0x41,
0x79, 0x8d, 0x6f, 0x58, 0x1b, 0x5b, 0x7e, 0x44, 0x66, 0x03, 0x1d, 0x91,
0x83, 0x28, 0x5d, 0x2e, 0x20, 0x02, 0x88, 0x51, 0x54, 0xe0, 0x22, 0xee,
0x8c, 0xf9, 0x4d, 0x69, 0x25, 0xb5, 0x90, 0xfb, 0x46, 0xfd, 0x28, 0xd7,
0x94, 0xde, 0x40, 0xde, 0x2b, 0xed, 0x98, 0x02, 0x3c, 0x7c, 0x2e, 0xeb,
0x9a, 0xef, 0x38, 0xa2, 0x31, 0x2d, 0x9d, 0x34, 0x34, 0xc0, 0x34, 0x81,
0xa0, 0x1c, 0x31, 0x6d, 0x37, 0x3c, 0xa2, 0x00, 0x2d, 0xdc, 0x3a, 0x18,
0xa3, 0xaa, 0x2a, 0x60, 0x3c, 0xea, 0xa5, 0x39, 0x26, 0xf8, 0x1e, 0x94,
0x67, 0x75, 0x91, 0x82, 0x1e, 0xa4, 0x69, 0x88, 0x88, 0x21, 0x1e, 0xe3,
0x6b, 0xe5, 0x7e, 0xb3, 0x20, 0x35, 0x70, 0x06, 0x74, 0xad, 0x21, 0xdf,
0x74, 0x1d, 0x6b, 0x22, 0x24, 0x66, 0x79, 0x12, 0x61, 0xdc, 0x27, 0x4c,
0x7f, 0x05, 0x59, 0x16, 0x29, 0x82, 0x84, 0x14, 0x50, 0xb9, 0x2c, 0x47,
0x88, 0x95, 0x49, 0xf7, 0x2e, 0xe9, 0x8c, 0xb6, 0x43, 0xd3, 0x31, 0xca,
0x90, 0x89, 0x3e, 0x96, 0x34, 0xa8, 0x93, 0xc3, 0x3a, 0x2d, 0x36, 0x9e,
0x96, 0x42, 0x35, 0xdd, 0x3a, 0x21, 0x99, 0xb5, 0x32, 0x62, 0x3d, 0xa8,
0x9d, 0x00, 0x2f, 0x16, 0x40, 0xa8, 0x9f, 0x35, 0x2b, 0xbe, 0x43, 0x60,
0xa0, 0xb3, 0x28, 0x71, 0x29, 0xe2, 0x5f, 0x52, 0x97, 0xba, 0x2a, 0x28,
0x60, 0x90, 0x8e, 0xff, 0x27, 0x5c, 0x61, 0x56, 0x84, 0xf9, 0x28, 0x0f,
0x65, 0x30, 0x7b, 0x76, 0x28, 0x8d, 0x69, 0x34, 0x70, 0xfd, 0x2b, 0xb8,
0x6e, 0xb3, 0x67, 0x7e, 0x2e, 0x03, 0x73, 0xfe, 0x5e, 0x2c, 0x30, 0xba,
0x7a, 0x2d, 0x55, 0x63, 0x33, 0x3e, 0x7f, 0xb7, 0x4d, 0x5a, 0x35, 0xcd,
0x84, 0x17, 0x46, 0xe6, 0x37, 0x97, 0x87, 0xee, 0x40, 0x51, 0x39, 0x92,
0x8b, 0x6d, 0x3b, 0x98, 0x3c, 0x0f, 0x8e, 0xd5, 0x37, 0x44, 0x40, 0x6e,
0x93, 0x15, 0x34, 0x12, 0x43, 0x82, 0x96, 0x65, 0x30, 0x77, 0x46, 0x54,
0x99, 0x05, 0x2d, 0x13, 0x49, 0x16, 0x9b, 0x48, 0x29, 0xb2, 0x36, 0x51,
0x56, 0x9d, 0x9f, 0x6b, 0x35, 0x31, 0x57, 0x96, 0x96, 0xa7, 0x33, 0xe1,
0x58, 0xbd, 0x8d, 0xba, 0x31, 0xa5, 0x5a, 0xed, 0x83, 0x91, 0x30, 0xc1,
0x5e, 0x2a, 0x78, 0xa8, 0x32, 0x72, 0x63, 0x12, 0x6d, 0xf8, 0x35, 0x37,
0x68, 0xbf, 0x64, 0x17, 0x38, 0x47, 0x6e, 0xfc, 0x5b, 0x0c, 0x3a, 0x54,
0x74, 0xd4, 0x52, 0x29, 0x3c, 0xd9, 0x7a, 0x56, 0x4a, 0xfa, 0x3e, 0x76,
0x7e, 0xd2, 0x44, 0x73, 0x41, 0xe3, 0x83, 0xf0, 0x3f, 0x20, 0x44, 0x04,
0x87, 0xff, 0x3a, 0x4a, 0x47, 0x70, 0x8c, 0x34, 0x36, 0x59, 0x49, 0xfc,
0x8f, 0xc0, 0x32, 0x50, 0x4c, 0x75, 0x92, 0xd1, 0x2e, 0x96, 0x4f, 0x1c,
0x95, 0x83, 0x2b, 0x0e, 0x41, 0xa7, 0x4e, 0x2e, 0xa6, 0xe8, 0x41, 0x83,
0x4f, 0x0e, 0x9e, 0xac, 0x3f, 0xbb, 0x4f, 0xb4, 0x95, 0xf3, 0x3d, 0x72,
0x50, 0xa2, 0x8c, 0x7f, 0x39, 0xf4, 0x52, 0x60, 0x81, 0x9d, 0x3a, 0x93,
0x57, 0x0f, 0x76, 0x2f, 0x3c, 0xb3, 0x5d, 0x0e, 0x6a, 0xba, 0x3f, 0x2d,
0x63, 0x34, 0x60, 0xbf, 0x41, 0x19, 0x69, 0x5e, 0x57, 0x0f, 0x43, 0xdd,
0x6f, 0xc6, 0x4f, 0x24, 0x46, 0x36, 0x75, 0x5f, 0x48, 0x32, 0x49, 0x01,
0x7a, 0xd3, 0x42, 0x17, 0x4b, 0xe5, 0x80, 0x21, 0x3d, 0x3b, 0x4e, 0x64,
0x84, 0x86, 0x38, 0xab, 0x50, 0xd7, 0x88, 0x76, 0x34, 0x6a, 0x53, 0x26,
0x8b, 0xf6, 0x30, 0x4d, 0x55, 0xea, 0x8f, 0x33, 0x2c, 0x73, 0x4d, 0xf6,
0x46, 0x11, 0xaf, 0x9c, 0x4c, 0xfd, 0x46, 0x5d, 0xa7, 0x32, 0x4c, 0x05,
0x46, 0xc8, 0x9e, 0xd0, 0x49, 0xa4, 0x47, 0x4d, 0x95, 0xb6, 0x45, 0x8c,
0x47, 0x08, 0x8b, 0xd4, 0x45, 0x18, 0x4b, 0x30, 0x80, 0x86, 0x44, 0xb0,
0x50, 0x4e, 0x73, 0x74, 0x46, 0xb3, 0x56, 0xf7, 0x67, 0x96, 0x48, 0xcf,
0x5d, 0xbd, 0x5c, 0xef, 0x4b, 0x59, 0x64, 0x53, 0x54, 0x0b, 0x4d, 0xd4,
0x6a, 0xb8, 0x4c, 0x81, 0x50, 0x4b, 0x70, 0xf5, 0x45, 0xfc, 0x53, 0x2b,
0x76, 0x96, 0x3f, 0xd8, 0x56, 0x1c, 0x7b, 0xd3, 0x3b, 0x5e, 0x58, 0x72,
0x80, 0x77, 0x36, 0xe7, 0x5a, 0x86, 0x84, 0x38, 0x32, 0x8c, 0x5c, 0xd7,
0x87, 0xc1, 0x2e, 0x56, 0x5b, 0xdb, 0x3e, 0xa8, 0xb6, 0xa9, 0x5c, 0x3f,
0x3f, 0xc7, 0xae, 0xc5, 0x59, 0xbd, 0x3f, 0x54, 0xa7, 0x01, 0x56, 0xf5,
0x3e, 0xa9, 0x9f, 0x11, 0x52, 0x65, 0x3d, 0x76, 0x95, 0x7f, 0x50, 0x92,
0x3f, 0xfc, 0x8a, 0x5d, 0x4e, 0xec, 0x43, 0x42, 0x7d, 0xfe, 0x4f, 0x22,
0x48, 0xdf, 0x70, 0xe6, 0x50, 0x52, 0x51, 0x18, 0x63, 0xbb, 0x53, 0x2a,
0x58, 0x87, 0x59, 0xe2, 0x55, 0xb7, 0x5f, 0x4a, 0x51, 0x37, 0x58, 0x53,
0x65, 0xdb, 0x4a, 0x4b, 0x5a, 0xc6, 0x6c, 0x22, 0x43, 0xc0, 0x5d, 0xfa,
0x72, 0x39, 0x3e, 0x52, 0x60, 0x4f, 0x77, 0x45, 0x39, 0x9d, 0x62, 0x64,
0x7b, 0xf7, 0x35, 0x07, 0x64, 0x4f, 0x80, 0x50, 0x30, 0x6f, 0x69, 0x29,
0x39, 0x52, 0xbc, 0x17, 0x68, 0x89, 0x39, 0x1d, 0xb5, 0x2f, 0x67, 0xa8,
0x38, 0xcc, 0xae, 0x48, 0x65, 0x09, 0x37, 0x42, 0xa7, 0x28, 0x61, 0x6e,
0x35, 0x0f, 0x9f, 0xc8, 0x5d, 0xc2, 0x35, 0x36, 0x95, 0x38, 0x5b, 0x74,
0x36, 0xf2, 0x89, 0xd0, 0x5a, 0x24, 0x3a, 0xa1, 0x7c, 0x7b, 0x5a, 0x18,
0x42, 0xc8, 0x6e, 0x14, 0x5c, 0x08, 0x4c, 0x7e, 0x60, 0xba, 0x5e, 0x2a,
0x53, 0xe5, 0x57, 0x4b, 0x61, 0x04, 0x5a, 0x9a, 0x4f, 0x60, 0x62, 0xa5,
0x61, 0x02, 0x48, 0x4e, 0x65, 0xb2, 0x67, 0x84, 0x42, 0x4a, 0x68, 0x73,
0x6d, 0xaf, 0x3c, 0xd7, 0x6a, 0x8c, 0x72, 0xe6, 0x37, 0xd2, 0x6c, 0x5c,
0x77, 0x8c, 0x32, 0xdf, 0x76, 0x98, 0x35, 0xc7, 0xc0, 0x60, 0x75, 0xb6,
0x35, 0x08, 0xb9, 0x92, 0x74, 0xa1, 0x34, 0x23, 0xb3, 0x81, 0x72, 0x89,
0x32, 0x62, 0xad, 0x41, 0x6f, 0x12, 0x2e, 0xab, 0xa6, 0xfb, 0x6d, 0x9e,
0x2c, 0xd6, 0xa0, 0x87, 0x68, 0x70, 0x27, 0xbd, 0x96, 0xf7, 0x66, 0x36,
0x2e, 0x4e, 0x88, 0xb0, 0x64, 0x9f, 0x33, 0x3a, 0x7a, 0x39, 0x65, 0xee,
0x3d, 0x4e, 0x6b, 0x73, 0x67, 0x3d, 0x46, 0xc9, 0x5e, 0xaa, 0x69, 0x7e,
0x4e, 0xf6, 0x55, 0x1c, 0x6a, 0xdb, 0x55, 0x5c, 0x4d, 0x23, 0x6d, 0x41,
0x5c, 0x55, 0x46, 0xd5, 0x6f, 0xd8, 0x62, 0xda, 0x40, 0xc7, 0x72, 0xa3,
0x69, 0x2e, 0x3b, 0x63, 0x74, 0xc8, 0x6e, 0xc5, 0x35, 0xe2, 0x82, 0x4d,
0x33, 0x40, 0xc2, 0x49, 0x82, 0x11, 0x32, 0xad, 0xbc, 0x78, 0x81, 0x6d,
0x31, 0x69, 0xb7, 0x34, 0x80, 0x6a, 0x2f, 0xaa, 0xb2, 0x18, 0x7d, 0xd6,
0x2d, 0x34, 0xac, 0x2c, 0x7a, 0xcf, 0x2a, 0xdd, 0xa5, 0x6a, 0x77, 0xd9,
0x28, 0x05, 0x9e, 0x7f, 0x74, 0x2b, 0x25, 0x74, 0x94, 0x3c, 0x71, 0xa5,
0x27, 0x0a, 0x87, 0x7e, 0x70, 0xdb, 0x2f, 0x37, 0x78, 0x00, 0x71, 0x2b,
0x38, 0x14, 0x68, 0xb5, 0x72, 0x5c, 0x42, 0x16, 0x5c, 0x86, 0x73, 0xe1,
0x49, 0xfb, 0x52, 0xd4, 0x76, 0x24, 0x51, 0xba, 0x4b, 0xcd, 0x78, 0x6b,
0x58, 0xc3, 0x45, 0xb3, 0x7a, 0xcc, 0x5f, 0x68, 0x3f, 0xce, 0x7c, 0xbe,
0x65, 0x5c, 0x39, 0xcb, 0x8c, 0x5f, 0x31, 0xaa, 0xc3, 0xa1, 0x8c, 0x4f,
0x31, 0x69, 0xbe, 0x08, 0x8b, 0xc6, 0x30, 0x09, 0xb9, 0x36, 0x89, 0x9e,
0x2c, 0x91, 0xb4, 0xbb, 0x89, 0x65, 0x2b, 0xf4, 0xaf, 0xe0, 0x86, 0x7a,
0x29, 0x70, 0xa9, 0x9b, 0x82, 0xa8, 0x25, 0x8f, 0xa3, 0x61, 0x80, 0x8d,
0x24, 0xe3, 0x9b, 0x42, 0x7d, 0x4b, 0x23, 0x46, 0x91, 0x15, 0x7b, 0x7f,
0x25, 0x1b, 0x84, 0x29, 0x78, 0xfa, 0x26, 0xbc, 0x74, 0xd7, 0x7a, 0x0d,
0x32, 0x6c, 0x65, 0x6c, 0x79, 0x72, 0x3b, 0xc2, 0x58, 0x72, 0x7c, 0xbd,
0x45, 0xc7, 0x50, 0x81, 0x7e, 0xe0, 0x4d, 0x48, 0x49, 0xab, 0x82, 0xc7,
0x55, 0x66, 0x44, 0x65, 0x84, 0xde, 0x5c, 0x08, 0x3d, 0xeb, 0x94, 0xfd,
0x30, 0x41, 0xc4, 0xc4, 0x95, 0x28, 0x30, 0x45, 0xbf, 0x49, 0x94, 0xeb,
0x2f, 0x4e, 0xba, 0xba, 0x94, 0x83, 0x2e, 0x1b, 0xb6, 0x43, 0x93, 0xeb,
0x2c, 0xad, 0xb1, 0xcb, 0x92, 0x90, 0x2b, 0x21, 0xac, 0x81, 0x90, 0x64,
0x29, 0x1f, 0xa6, 0x8f, 0x8e, 0x89, 0x27, 0xe7, 0xa0, 0x73, 0x8b, 0x2a,
0x25, 0xcb, 0x97, 0x97, 0x87, 0x3b, 0x23, 0x09, 0x8d, 0xa5, 0x86, 0xde,
0x26, 0x61, 0x81, 0x16, 0x85, 0xb1, 0x28, 0x7c, 0x72, 0xa5, 0x84, 0xc3,
0x31, 0xfd, 0x63, 0xe5, 0x87, 0x22, 0x3d, 0x36, 0x59, 0x39, 0x89, 0x4b,
0x45, 0xcf, 0x51, 0x22, 0x8b, 0x83, 0x4c, 0xd7, 0x4a, 0x3f, 0x8d, 0x55,
0x53, 0x38, 0x43, 0x82, 0x9c, 0xec, 0x2e, 0x8f, 0xc6, 0x17, 0x9d, 0x65,
0x2e, 0xf3, 0xc0, 0x8e, 0x9d, 0x5c, 0x2e, 0x63, 0xbc, 0x0d, 0x9d, 0x1f,
0x2d, 0x95, 0xb7, 0xaf, 0x9c, 0xcf, 0x2c, 0xaa, 0xb3, 0x4f, 0x9c, 0x29,
0x2b, 0x97, 0xae, 0xad, 0x9a, 0x6a, 0x2a, 0x22, 0xa8, 0xef, 0x98, 0x9c,
0x28, 0x95, 0xa3, 0x35, 0x96, 0xae, 0x27, 0x3d, 0x9c, 0x92, 0x94, 0xbe,
0x26, 0x82, 0x94, 0x0d, 0x93, 0x20, 0x26, 0xd8, 0x89, 0xfa, 0x92, 0x49,
0x28, 0xed, 0x7e, 0x0f, 0x91, 0x2b, 0x2b, 0xc1, 0x70, 0x7d, 0x91, 0x66,
0x35, 0x27, 0x63, 0xeb, 0x92, 0xcc, 0x3e, 0x0c, 0x59, 0x67, 0x93, 0xa1,
0x45, 0x06, 0x50, 0xca, 0x95, 0x88, 0x4b, 0x97, 0x49, 0x27, 0xa4, 0xaa,
0x2c, 0x45, 0xc7, 0x7c, 0xa5, 0x3c, 0x2c, 0xde, 0xc1, 0xe9, 0xa5, 0x4a,
0x2c, 0x51, 0xbd, 0x54, 0xa5, 0x21, 0x2b, 0x86, 0xb8, 0xfc, 0xa4, 0xe4,
0x2a, 0x94, 0xb4, 0xb2, 0xa4, 0x9c, 0x29, 0xa0, 0xb0, 0x62, 0xa3, 0xa7,
0x28, 0xd5, 0xab, 0x19, 0xa2, 0x6b, 0x27, 0xf4, 0xa5, 0xaf, 0xa0, 0xdf,
0x26, 0xfc, 0xa0, 0x39, 0x9f, 0x3a, 0x26, 0xcf, 0x98, 0xa1, 0x9d, 0x86,
0x26, 0x2e, 0x90, 0xc1, 0x9c, 0x76, 0x27, 0xb9, 0x86, 0x76, 0x9b, 0xe6,
0x2a, 0x97, 0x7b, 0x2d, 0x9b, 0x77, 0x2f, 0x5d, 0x6f, 0x0d, 0x9b, 0xb5,
0x36, 0xb3, 0x63, 0x1a, 0x9c, 0x83, 0x3e, 0x53, 0x58, 0xdd, 0x9d, 0x4f,
0x44, 0x68, 0x50, 0x24, 0xad, 0x53, 0x29, 0xae, 0xc8, 0xbb, 0xad, 0xaa,
0x2a, 0x17, 0xc3, 0x3e, 0xad, 0x8c, 0x29, 0x8a, 0xbe, 0x8b, 0xad, 0x85,
0x28, 0x3f, 0xba, 0x5a, 0xad, 0x69, 0x27, 0x20, 0xb6, 0x02, 0xad, 0x69,
0x25, 0xb6, 0xb1, 0xcf, 0xad, 0x3f, 0x24, 0xbd, 0xad, 0x01, 0xad, 0x2e,
0x23, 0xa6, 0xa7, 0xd1, 0xad, 0x0a, 0x22, 0x8a, 0xa2, 0xba, 0xac, 0x5d,
0x22, 0x20, 0x9c, 0xac, 0xaa, 0xe1, 0x22, 0x87, 0x95, 0x1b, 0xa8, 0x9e,
0x23, 0x62, 0x8d, 0x14, 0xa6, 0x68, 0x25, 0xe6, 0x83, 0x24, 0xa5, 0x34,
0x2a, 0x3e, 0x78, 0xb7, 0xa5, 0x30, 0x2f, 0x4f, 0x6e, 0x51, 0xa5, 0x2b,
0x36, 0x11, 0x62, 0xcc, 0xa5, 0x35, 0x3d, 0x7b, 0x57, 0xfb, 0x08, 0x6b,
0x87, 0x9b, 0x85, 0x31, 0x0b, 0xb6, 0x8a, 0xea, 0x7b, 0x53, 0x0d, 0x77,
0x8d, 0xea, 0x72, 0xc3, 0x0f, 0xc9, 0x91, 0x52, 0x6a, 0x49, 0x11, 0xce,
0x94, 0xba, 0x61, 0xe9, 0x14, 0x20, 0x98, 0xae, 0x5a, 0x3f, 0x16, 0xe0,
0x9c, 0x78, 0x52, 0x6c, 0x1a, 0x29, 0xa0, 0x27, 0x4b, 0xac, 0x1c, 0xfe,
0xa3, 0x54, 0x45, 0xd4, 0x1f, 0xae, 0xa6, 0x0c, 0x40, 0x50, 0x22, 0x31,
0xa8, 0x42, 0x3c, 0x4e, 0x24, 0xfa, 0xaa, 0x15, 0x38, 0x6f, 0x27, 0xc8,
0xab, 0xca, 0x34, 0xac, 0x2a, 0xc8, 0xad, 0x4c, 0x31, 0x11, 0x2d, 0xd2,
0xaf, 0x01, 0x2c, 0xc5, 0x30, 0xf0, 0xb0, 0xa7, 0x28, 0x25, 0x33, 0xbf,
0xb1, 0xee, 0x24, 0xa8, 0x12, 0xcb, 0x7e, 0xef, 0x89, 0xc4, 0x16, 0x0d,
0x80, 0x80, 0x80, 0x80, 0x16, 0xc7, 0x84, 0x95, 0x77, 0x6f, 0x18, 0x23,
0x88, 0x43, 0x6e, 0x78, 0x1a, 0x45, 0x8c, 0x52, 0x65, 0x8d, 0x1c, 0xab,
0x90, 0x90, 0x5c, 0xfe, 0x1e, 0x84, 0x94, 0xac, 0x55, 0x04, 0x21, 0x1b,
0x98, 0x92, 0x4d, 0x9e, 0x24, 0x72, 0x9c, 0x49, 0x47, 0x4f, 0x28, 0x02,
0x9f, 0xe1, 0x40, 0xca, 0x2a, 0x4f, 0xa2, 0x45, 0x3c, 0xdf, 0x2c, 0xb1,
0xa4, 0x5d, 0x39, 0x3e, 0x2f, 0x36, 0xa6, 0x3e, 0x35, 0xb9, 0x31, 0xf4,
0xa7, 0xf3, 0x32, 0x47, 0x34, 0xe0, 0xa9, 0x8f, 0x2e, 0xa6, 0x37, 0xcb,
0xab, 0x0d, 0x2a, 0xea, 0x3a, 0xa5, 0xac, 0x5e, 0x27, 0x75, 0x1b, 0x59,
0x77, 0x11, 0x8e, 0x94, 0x1d, 0x20, 0x78, 0xe1, 0x85, 0xa4, 0x1e, 0xf2,
0x7b, 0x36, 0x7c, 0xb7, 0x20, 0xc7, 0x7f, 0x0a, 0x73, 0x5f, 0x22, 0x53,
0x83, 0x4e, 0x6a, 0x1f, 0x24, 0x10, 0x87, 0x8b, 0x60, 0xf1, 0x26, 0x4b,
0x8c, 0x52, 0x58, 0x95, 0x28, 0x8e, 0x90, 0x97, 0x50, 0x66, 0x2b, 0x30,
0x94, 0x8e, 0x4a, 0x1c, 0x2e, 0x22, 0x98, 0x68, 0x43, 0x98, 0x31, 0x30,
0x9b, 0xbe, 0x3e, 0x41, 0x34, 0x0c, 0x9e, 0x87, 0x3a, 0x63, 0x36, 0x99,
0xa0, 0xf2, 0x36, 0xcd, 0x39, 0x1a, 0xa2, 0xfa, 0x33, 0x59, 0x3b, 0xc6,
0xa4, 0xcf, 0x2f, 0xe8, 0x3e, 0x94, 0xa6, 0x48, 0x2c, 0x91, 0x41, 0x41,
0xa7, 0x95, 0x29, 0x49, 0x25, 0x6d, 0x6f, 0x0e, 0x94, 0x00, 0x26, 0xc3,
0x70, 0xbf, 0x8b, 0x1e, 0x27, 0xc4, 0x72, 0xae, 0x82, 0x5b, 0x28, 0xd2,
0x75, 0xc0, 0x78, 0xfc, 0x2a, 0x2d, 0x79, 0x6a, 0x6f, 0x84, 0x2c, 0x48,
0x7e, 0x54, 0x66, 0x0b, 0x2e, 0x10, 0x83, 0x32, 0x5c, 0xec, 0x2f, 0xd7,
0x87, 0xe9, 0x54, 0x72, 0x32, 0x5d, 0x8c, 0x38, 0x4d, 0x36, 0x35, 0x3b,
0x90, 0x79, 0x47, 0x1c, 0x37, 0xe1, 0x94, 0x68, 0x40, 0x8c, 0x3a, 0x8b,
0x97, 0x9c, 0x3c, 0x38, 0x3d, 0x33, 0x9a, 0xa8, 0x38, 0x46, 0x3f, 0xf0,
0x9d, 0xb9, 0x34, 0x88, 0x42, 0xa6, 0xa0, 0x36, 0x31, 0x00, 0x45, 0x2f,
0xa1, 0xac, 0x2d, 0xba, 0x47, 0xbd, 0xa3, 0x0b, 0x2a, 0x6d, 0x2f, 0xb6,
0x66, 0xef, 0x9a, 0x3a, 0x31, 0x11, 0x67, 0xf0, 0x91, 0xa9, 0x31, 0x74,
0x69, 0xde, 0x88, 0xb3, 0x32, 0x40, 0x6c, 0x12, 0x7f, 0xba, 0x33, 0x73,
0x70, 0x0a, 0x75, 0x59, 0x34, 0x65, 0x74, 0x0d, 0x6b, 0xd4, 0x36, 0x1b,
0x78, 0xd3, 0x62, 0x72, 0x38, 0x58, 0x7e, 0x58, 0x59, 0x92, 0x3a, 0x34,
0x83, 0x33, 0x51, 0x32, 0x3c, 0x84, 0x87, 0xb8, 0x4a, 0x9a, 0x3f, 0x36,
0x8c, 0x52, 0x44, 0x0a, 0x41, 0xee, 0x90, 0x63, 0x3e, 0x79, 0x44, 0x21,
0x93, 0x89, 0x3a, 0x64, 0x46, 0x77, 0x96, 0x8b, 0x36, 0x7a, 0x48, 0xe7,
0x99, 0x66, 0x32, 0xae, 0x4b, 0x71, 0x9b, 0xf4, 0x2f, 0x10, 0x4e, 0x27,
0x9e, 0x12, 0x2b, 0xb8, 0x3c, 0xb2, 0x5e, 0x60, 0xa1, 0x0c, 0x3d, 0x96,
0x5f, 0x9b, 0x98, 0xc8, 0x3e, 0x74, 0x60, 0xd3, 0x90, 0xc3, 0x3d, 0x4d,
0x62, 0xb8, 0x87, 0x2e, 0x3c, 0xca, 0x65, 0x41, 0x7d, 0x52, 0x3d, 0x67,
0x69, 0x8b, 0x72, 0x65, 0x3f, 0x35, 0x6e, 0x91, 0x68, 0xa8, 0x40, 0x8a,
0x73, 0x65, 0x5f, 0x4a, 0x42, 0x59, 0x79, 0x03, 0x56, 0x9a, 0x44, 0xba,
0x7e, 0x3c, 0x4e, 0xc2, 0x46, 0xc6, 0x83, 0x1c, 0x48, 0x75, 0x48, 0xe9,
0x87, 0xae, 0x41, 0xde, 0x4b, 0x43, 0x8b, 0xc7, 0x3c, 0xf7, 0x4d, 0x97,
0x8f, 0x80, 0x38, 0xbe, 0x4f, 0xac, 0x92, 0xb3, 0x34, 0xae, 0x51, 0xeb,
0x95, 0x7e, 0x30, 0xbb, 0x54, 0x7c, 0x97, 0xdd, 0x2d, 0x2d, 0x47, 0xa3,
0x55, 0xf3, 0xa8, 0x3b, 0x49, 0x26, 0x57, 0x0d, 0x9f, 0xf1, 0x48, 0xd0,
0x58, 0x0c, 0x97, 0xb4, 0x48, 0xd5, 0x59, 0x29, 0x8f, 0x77, 0x47, 0xdf,
0x5b, 0x8c, 0x85, 0x43, 0x48, 0x10, 0x5f, 0x49, 0x7a, 0x65, 0x48, 0x39,
0x63, 0xea, 0x6f, 0x37, 0x49, 0x40, 0x69, 0x00, 0x65, 0x80, 0x4b, 0x4c,
0x6e, 0x94, 0x5c, 0xac, 0x4c, 0xce, 0x74, 0x17, 0x54, 0x0c, 0x4e, 0xc0,
0x79, 0x5f, 0x4c, 0x82, 0x51, 0x09, 0x7e, 0xbe, 0x46, 0x17, 0x52, 0xef,
0x83, 0x6b, 0x3f, 0xce, 0x54, 0xfd, 0x87, 0x6b, 0x3b, 0x44, 0x57, 0x20,
0x8b, 0x13, 0x36, 0xf2, 0x59, 0x51, 0x8e, 0x6f, 0x32, 0xc9, 0x5b, 0x8f,
0x91, 0x67, 0x2e, 0xc2, 0x53, 0xe9, 0x4d, 0xcf, 0xaf, 0x9b, 0x55, 0x00,
0x4e, 0xf5, 0xa7, 0x28, 0x56, 0x47, 0x50, 0x4b, 0x9e, 0xd9, 0x54, 0xeb,
0x51, 0x3e, 0x96, 0x81, 0x53, 0xc8, 0x52, 0x5e, 0x8d, 0xe7, 0x52, 0x71,
0x54, 0xcc, 0x83, 0x41, 0x52, 0x32, 0x58, 0xfd, 0x77, 0x9b, 0x53, 0x48,
0x5e, 0xe2, 0x6c, 0x04, 0x53, 0x9d, 0x63, 0xe2, 0x62, 0x10, 0x55, 0x50,
0x69, 0x88, 0x59, 0x96, 0x57, 0x73, 0x6f, 0x6f, 0x51, 0xb0, 0x59, 0x28,
0x74, 0xcb, 0x4a, 0x80, 0x5b, 0x1e, 0x7a, 0x05, 0x43, 0xd3, 0x5d, 0x55,
0x7f, 0x0b, 0x3e, 0x36, 0x5f, 0x21, 0x83, 0x20, 0x39, 0x9d, 0x60, 0xf1,
0x86, 0xbd, 0x35, 0x22, 0x62, 0xe1, 0x8a, 0x24, 0x30, 0x9f, 0x60, 0xa9,
0x46, 0x1b, 0xb6, 0xcb, 0x61, 0xf9, 0x47, 0x64, 0xae, 0xaa, 0x61, 0x99,
0x47, 0xef, 0xa6, 0xd9, 0x61, 0x77, 0x48, 0xb7, 0x9e, 0xd4, 0x60, 0x48,
0x4a, 0x10, 0x95, 0xc2, 0x5f, 0x7e, 0x4b, 0xfc, 0x8c, 0x42, 0x5f, 0x45,
0x4f, 0x3b, 0x81, 0x88, 0x5d, 0x55, 0x53, 0xa6, 0x74, 0xf3, 0x5d, 0x47,
0x59, 0x6f, 0x69, 0x08, 0x5e, 0xec, 0x5f, 0xd7, 0x5e, 0xf4, 0x60, 0x02,
0x64, 0xe2, 0x56, 0xc1, 0x61, 0xaa, 0x6a, 0x52, 0x4f, 0x1d, 0x63, 0xcb,
0x70, 0x52, 0x48, 0x8e, 0x65, 0x68, 0x75, 0x63, 0x41, 0xbd, 0x67, 0x49,
0x7a, 0x40, 0x3c, 0x75, 0x69, 0x1e, 0x7e, 0xd4, 0x37, 0xaa, 0x6a, 0xc5,
0x82, 0xb0, 0x32, 0xd2, 0x6d, 0xf2, 0x40, 0x9d, 0xbc, 0x14, 0x6f, 0x09,
0x41, 0x75, 0xb4, 0xc1, 0x6f, 0x94, 0x42, 0x05, 0xad, 0x89, 0x6e, 0xf8,
0x42, 0x1f, 0xa6, 0x63, 0x6e, 0x37, 0x42, 0x50, 0x9f, 0x02, 0x6c, 0x02,
0x43, 0x37, 0x95, 0x8a, 0x6a, 0x04, 0x44, 0xbe, 0x8b, 0x3d, 0x68, 0x81,
0x47, 0x5e, 0x7f, 0xaf, 0x68, 0x32, 0x4e, 0x12, 0x72, 0x7e, 0x67, 0xf8,
0x54, 0x37, 0x66, 0x40, 0x68, 0xfa, 0x5a, 0x16, 0x5c, 0x7c, 0x6a, 0xc2,
0x60, 0x06, 0x54, 0x73, 0x6c, 0x3e, 0x65, 0x8b, 0x4d, 0x3b, 0x6e, 0x12,
0x6b, 0x73, 0x46, 0xaa, 0x70, 0x06, 0x70, 0xfd, 0x40, 0x00, 0x71, 0x83,
0x75, 0xc6, 0x3a, 0xc0, 0x73, 0x14, 0x7a, 0x56, 0x35, 0x7a, 0x7b, 0x0c,
0x3c, 0x47, 0xc0, 0x26, 0x7b, 0x68, 0x3c, 0x88, 0xb9, 0x73, 0x7b, 0xe4,
0x3c, 0xe8, 0xb2, 0xf5, 0x7b, 0xa7, 0x3d, 0x0b, 0xac, 0x37, 0x7a, 0x9e,
0x3c, 0xb9, 0xa5, 0x64, 0x79, 0x4b, 0x3c, 0x78, 0x9e, 0x18, 0x77, 0x1d,
0x3d, 0x0a, 0x94, 0xba, 0x75, 0x61, 0x3e, 0xf6, 0x89, 0xe3, 0x73, 0x91,
0x42, 0x24, 0x7d, 0x45, 0x72, 0x8f, 0x48, 0x1f, 0x6f, 0xd2, 0x73, 0x7b,
0x4f, 0x67, 0x63, 0xab, 0x73, 0xcc, 0x55, 0x0f, 0x5a, 0x35, 0x74, 0xe8,
0x5a, 0xce, 0x52, 0x22, 0x76, 0xc0, 0x61, 0x2f, 0x4b, 0x82, 0x78, 0x38,
0x66, 0xef, 0x45, 0x08, 0x79, 0xea, 0x6c, 0x5e, 0x3e, 0xae, 0x7b, 0xa5,
0x71, 0x8f, 0x38, 0xdb, 0x86, 0x2b, 0x39, 0x21, 0xc2, 0xa4, 0x86, 0x76,
0x39, 0x38, 0xbc, 0x70, 0x86, 0x73, 0x38, 0xe6, 0xb6, 0xbe, 0x86, 0x5c,
0x38, 0x75, 0xb1, 0x20, 0x85, 0x46, 0x37, 0xdd, 0xaa, 0xbc, 0x83, 0xe3,
0x37, 0x23, 0xa4, 0x1d, 0x82, 0x5b, 0x36, 0xaf, 0x9c, 0x8f, 0x80, 0xb2,
0x37, 0x11, 0x93, 0x37, 0x7f, 0x72, 0x39, 0x2c, 0x87, 0xf2, 0x7e, 0xaf,
0x3d, 0x67, 0x7b, 0x27, 0x7d, 0x63, 0x43, 0x34, 0x6d, 0x46, 0x7d, 0xcb,
0x4a, 0x68, 0x60, 0xa0, 0x7e, 0x7a, 0x50, 0xf7, 0x57, 0xde, 0x7e, 0xd8,
0x56, 0x57, 0x4f, 0xdc, 0x80, 0xd8, 0x5d, 0x22, 0x49, 0xc3, 0x82, 0x78,
0x63, 0x11, 0x43, 0x79, 0x84, 0x08, 0x68, 0x8a, 0x3c, 0xf4, 0x90, 0x19,
0x36, 0xf1, 0xc4, 0x54, 0x90, 0x87, 0x37, 0x1d, 0xbe, 0x4f, 0x90, 0x85,
0x36, 0x8f, 0xb9, 0x2a, 0x90, 0x70, 0x35, 0xde, 0xb4, 0x1e, 0x90, 0x16,
0x35, 0x0c, 0xae, 0xfb, 0x8e, 0x85, 0x34, 0x55, 0xa8, 0x99, 0x8c, 0xc9,
0x33, 0x83, 0xa2, 0x27, 0x8b, 0x03, 0x33, 0x46, 0x9a, 0x1b, 0x89, 0x41,
0x33, 0x7a, 0x91, 0x0c, 0x88, 0x6c, 0x35, 0xdf, 0x85, 0x1b, 0x87, 0xd1,
0x39, 0xea, 0x78, 0x1d, 0x87, 0x95, 0x40, 0x6a, 0x6a, 0xd2, 0x87, 0x94,
0x47, 0x21, 0x5e, 0xb7, 0x88, 0x9b, 0x4e, 0x1e, 0x56, 0x4b, 0x89, 0x4f,
0x53, 0xc5, 0x4e, 0xe2, 0x8a, 0xe9, 0x59, 0xe2, 0x48, 0x5c, 0x8c, 0x81,
0x5f, 0xb4, 0x41, 0x94, 0x98, 0x52, 0x35, 0x14, 0xc5, 0xaa, 0x98, 0xe9,
0x35, 0x6c, 0xbf, 0xae, 0x98, 0xef, 0x34, 0xfb, 0xba, 0xd7, 0x98, 0xea,
0x34, 0x83, 0xb6, 0x09, 0x98, 0xd7, 0x33, 0xed, 0xb1, 0x53, 0x97, 0xe9,
0x33, 0x45, 0xab, 0xb0, 0x96, 0x83, 0x32, 0x7a, 0xa5, 0x9e, 0x94, 0xf8,
0x31, 0x96, 0x9f, 0x65, 0x93, 0x7a, 0x31, 0x82, 0x97, 0x14, 0x92, 0x0b,
0x31, 0xbb, 0x8e, 0x2c, 0x91, 0xc4, 0x34, 0x57, 0x82, 0x27, 0x91, 0x61,
0x38, 0x70, 0x75, 0x5f, 0x91, 0x7b, 0x3e, 0xe3, 0x68, 0xe7, 0x91, 0xa2,
0x45, 0x6e, 0x5d, 0x9e, 0x92, 0x7d, 0x4c, 0x17, 0x55, 0x45, 0x93, 0x7b,
0x51, 0xc4, 0x4d, 0xf8, 0x94, 0xd7, 0x57, 0x52, 0x46, 0xd6, 0xa0, 0x73,
0x33, 0x63, 0xc6, 0xe4, 0xa1, 0x08, 0x33, 0xc5, 0xc0, 0xff, 0xa1, 0x29,
0x33, 0x86, 0xbc, 0x3d, 0xa1, 0x31, 0x33, 0x33, 0xb7, 0xa5, 0xa1, 0x31,
0x32, 0xd3, 0xb3, 0x1a, 0xa0, 0xe5, 0x32, 0x71, 0xae, 0x3d, 0x9f, 0xd6,
0x31, 0xf7, 0xa8, 0x74, 0x9e, 0x76, 0x31, 0x36, 0xa2, 0x98, 0x9d, 0x0b,
0x30, 0xc2, 0x9b, 0xb6, 0x9b, 0xaf, 0x30, 0xb7, 0x93, 0xbc, 0x9a, 0xba,
0x31, 0xb2, 0x8a, 0x4f, 0x9a, 0x69, 0x34, 0x15, 0x7f, 0x42, 0x9a, 0x6a,
0x38, 0x1b, 0x73, 0x1b, 0x9a, 0xad, 0x3e, 0x7c, 0x67, 0x2f, 0x9a, 0xe3,
0x44, 0xcb, 0x5c, 0x85, 0x9b, 0xad, 0x4a, 0x99, 0x54, 0x40, 0x9c, 0xe4,
0x50, 0x0a, 0x4c, 0xbc, 0xa8, 0x03, 0x31, 0xa6, 0xc7, 0xc7, 0xa8, 0x86,
0x32, 0x08, 0xc2, 0x29, 0xa8, 0xa8, 0x31, 0xe4, 0xbd, 0x4c, 0xa8, 0x92,
0x31, 0x72, 0xb8, 0xcf, 0xa8, 0x71, 0x30, 0xf6, 0xb4, 0x5c, 0xa8, 0x46,
0x30, 0x6f, 0xaf, 0xf8, 0xa7, 0x81, 0x30, 0x01, 0xaa, 0x9d, 0xa6, 0xb0,
0x2f, 0x62, 0xa5, 0x36, 0xa5, 0xca, 0x2e, 0xb9, 0x9f, 0xba, 0xa4, 0xcc,
0x2e, 0xef, 0x98, 0x32, 0xa3, 0xb8, 0x2f, 0x30, 0x90, 0x98, 0xa3, 0x1b,
0x31, 0x0e, 0x87, 0x01, 0xa2, 0xd1, 0x33, 0x86, 0x7c, 0x99, 0xa2, 0xfe,
0x37, 0x61, 0x71, 0x32, 0xa3, 0x24, 0x3d, 0x98, 0x65, 0xc4, 0xa3, 0x78,
0x43, 0xa8, 0x5b, 0x70, 0xa4, 0x44, 0x49, 0x14, 0x52, 0xd8, 0xaf, 0xb1,
0x2f, 0xef, 0xc8, 0xb5, 0xb0, 0x3c, 0x30, 0x76, 0xc3, 0x16, 0xb0, 0x6a,
0x30, 0x65, 0xbe, 0x36, 0xb0, 0x35, 0x2f, 0xc4, 0xb9, 0xcb, 0xb0, 0x00,
0x2e, 0xd6, 0xb5, 0x80, 0xaf, 0xd8, 0x2d, 0xd7, 0xb1, 0x39, 0xaf, 0x97,
0x2d, 0x19, 0xac, 0x6e, 0xaf, 0x58, 0x2c, 0x64, 0xa7, 0x6b, 0xaf, 0x23,
0x2b, 0x96, 0xa2, 0x5f, 0xae, 0x92, 0x2b, 0x5a, 0x9c, 0x51, 0xad, 0xb6,
0x2b, 0xbd, 0x94, 0xee, 0xac, 0x6d, 0x2c, 0xa4, 0x8d, 0x44, 0xab, 0x1d,
0x2f, 0x4e, 0x84, 0x31, 0xaa, 0xbc, 0x32, 0x18, 0x7a, 0x63, 0xaa, 0xf3,
0x36, 0x01, 0x6f, 0xa8, 0xab, 0x03, 0x3c, 0x03, 0x64, 0xa6, 0xab, 0x8e,
0x42, 0x18, 0x5a, 0x35, 0x0e, 0xed, 0x8d, 0xe7, 0x88, 0x64, 0x11, 0x77,
0x90, 0x3a, 0x7f, 0xa1, 0x13, 0x65, 0x93, 0x22, 0x77, 0x12, 0x15, 0x32,
0x95, 0xfb, 0x6e, 0xc0, 0x17, 0x0b, 0x99, 0x55, 0x66, 0x24, 0x18, 0xee,
0x9c, 0xb7, 0x5d, 0xa2, 0x1b, 0x9c, 0xa0, 0x6d, 0x55, 0xb2, 0x1e, 0x0f,
0xa3, 0xd3, 0x4e, 0xb8, 0x20, 0x82, 0xa7, 0x08, 0x49, 0x21, 0x23, 0x42,
0xa9, 0x96, 0x43, 0x20, 0x25, 0xfb, 0xab, 0xab, 0x3e, 0x3c, 0x28, 0xe8,
0xad, 0x57, 0x3a, 0x52, 0x2b, 0xd1, 0xae, 0xf4, 0x36, 0x93, 0x2e, 0xfb,
0xb0, 0x43, 0x33, 0x12, 0x31, 0xcc, 0xb1, 0x80, 0x2f, 0x72, 0x34, 0x8e,
0xb2, 0xe4, 0x2b, 0x58, 0x37, 0x47, 0xb4, 0x17, 0x27, 0x9f, 0x18, 0x2d,
0x85, 0xc9, 0x8c, 0xc9, 0x1a, 0xb9, 0x87, 0x8a, 0x84, 0x15, 0x1c, 0x91,
0x8a, 0x3f, 0x7b, 0x3f, 0x1e, 0x2a, 0x8d, 0x72, 0x72, 0x43, 0x20, 0x27,
0x91, 0x24, 0x69, 0x6c, 0x21, 0xbc, 0x94, 0x8e, 0x60, 0xa4, 0x23, 0xa1,
0x98, 0x7b, 0x58, 0x93, 0x25, 0xfa, 0x9c, 0x2f, 0x50, 0x65, 0x29, 0x4e,
0x9f, 0xe5, 0x49, 0xe2, 0x2b, 0xdc, 0xa3, 0x13, 0x43, 0xb9, 0x2e, 0x45,
0xa5, 0x9d, 0x3e, 0x9d, 0x30, 0xc6, 0xa7, 0x8c, 0x3b, 0x05, 0x33, 0x7e,
0xa9, 0x43, 0x37, 0x8f, 0x36, 0x5c, 0xaa, 0xc8, 0x34, 0x2c, 0x39, 0x53,
0xac, 0x1d, 0x30, 0xcc, 0x3c, 0x3c, 0xad, 0x65, 0x2d, 0x50, 0x3f, 0x11,
0xae, 0x92, 0x2a, 0x01, 0x20, 0x9f, 0x7e, 0x62, 0x91, 0x63, 0x23, 0x1c,
0x7f, 0x9e, 0x88, 0xc8, 0x25, 0xd0, 0x80, 0x80, 0x80, 0x80, 0x27, 0x01,
0x84, 0x7d, 0x77, 0x3d, 0x28, 0x5b, 0x88, 0x22, 0x6e, 0x10, 0x2a, 0x20,
0x8c, 0x4b, 0x64, 0xca, 0x2c, 0x23, 0x90, 0x6e, 0x5c, 0x0d, 0x2d, 0xe7,
0x94, 0x44, 0x53, 0xe8, 0x30, 0x43, 0x98, 0x16, 0x4c, 0xb8, 0x33, 0x37,
0x9b, 0xde, 0x46, 0x31, 0x36, 0x3c, 0x9f, 0x5a, 0x3f, 0xba, 0x38, 0x8d,
0xa1, 0xbb, 0x3c, 0x23, 0x3a, 0xfb, 0xa3, 0xd4, 0x38, 0xa3, 0x3d, 0x97,
0xa5, 0xb4, 0x35, 0x3b, 0x40, 0x51, 0xa7, 0x56, 0x31, 0xdc, 0x42, 0xee,
0xa8, 0xb1, 0x2e, 0x84, 0x45, 0x79, 0xa9, 0xe9, 0x2b, 0x34, 0x2a, 0x39,
0x76, 0x83, 0x96, 0xde, 0x2c, 0x65, 0x77, 0xa4, 0x8e, 0x2a, 0x2e, 0x41,
0x79, 0x1e, 0x85, 0xa8, 0x30, 0x15, 0x7b, 0x23, 0x7c, 0xdf, 0x31, 0x72,
0x7e, 0xce, 0x73, 0x63, 0x32, 0xd2, 0x83, 0x18, 0x6a, 0x01, 0x34, 0x5c,
0x87, 0x3f, 0x60, 0xad, 0x36, 0x25, 0x8b, 0xb5, 0x58, 0x48, 0x38, 0x45,
0x8f, 0xc1, 0x50, 0x1d, 0x3a, 0x9b, 0x93, 0xe1, 0x49, 0xbb, 0x3d, 0x16,
0x97, 0xc3, 0x42, 0xe2, 0x3f, 0x92, 0x9b, 0x0d, 0x3d, 0xd6, 0x42, 0x35,
0x9d, 0xf2, 0x3a, 0x10, 0x44, 0xcf, 0xa0, 0x75, 0x36, 0x7f, 0x47, 0x33,
0xa2, 0x54, 0x33, 0x15, 0x49, 0x94, 0xa3, 0xf9, 0x2f, 0xa3, 0x4c, 0x0f,
0xa5, 0x56, 0x2c, 0x57, 0x34, 0xb9, 0x6e, 0x4e, 0x9c, 0xa9, 0x36, 0xf7,
0x6f, 0x38, 0x94, 0x18, 0x38, 0xaf, 0x70, 0xc0, 0x8b, 0x77, 0x3a, 0x12,
0x72, 0xa6, 0x82, 0xdf, 0x3a, 0xf7, 0x75, 0x88, 0x79, 0x76, 0x3b, 0xe2,
0x79, 0x0b, 0x6f, 0xcb, 0x3d, 0x76, 0x7d, 0xb1, 0x66, 0x68, 0x3f, 0x1f,
0x82, 0x47, 0x5d, 0x67, 0x40, 0xa1, 0x86, 0xd1, 0x55, 0x11, 0x42, 0x8e,
0x8b, 0x21, 0x4d, 0x97, 0x45, 0x0e, 0x8f, 0x94, 0x47, 0x23, 0x47, 0x3c,
0x93, 0x5f, 0x40, 0xac, 0x49, 0x66, 0x96, 0x86, 0x3c, 0x71, 0x4b, 0xb0,
0x99, 0x75, 0x38, 0x88, 0x4e, 0x0d, 0x9c, 0x2d, 0x34, 0xc3, 0x50, 0x75,
0x9e, 0xae, 0x31, 0x0c, 0x53, 0x07, 0xa0, 0x8a, 0x2d, 0x9b, 0x40, 0xfe,
0x65, 0xd6, 0xa3, 0x0d, 0x42, 0x8e, 0x66, 0xda, 0x9a, 0xd2, 0x43, 0xf1,
0x67, 0xf1, 0x92, 0xaa, 0x44, 0x94, 0x69, 0xbf, 0x89, 0xb1, 0x45, 0x67,
0x6b, 0xf4, 0x80, 0x8b, 0x46, 0x43, 0x6f, 0xd8, 0x76, 0x43, 0x46, 0xdf,
0x73, 0xae, 0x6c, 0xa5, 0x48, 0x0e, 0x78, 0x1e, 0x63, 0x73, 0x49, 0xb5,
0x7c, 0xf6, 0x5a, 0xb7, 0x4b, 0x7f, 0x81, 0xbb, 0x52, 0x6e, 0x4d, 0x06,
0x86, 0x5c, 0x4b, 0x79, 0x4e, 0xf4, 0x8a, 0xd1, 0x45, 0x05, 0x51, 0x30,
0x8e, 0xd6, 0x3f, 0x32, 0x53, 0x39, 0x92, 0x38, 0x3a, 0xf5, 0x55, 0x4a,
0x95, 0x2c, 0x36, 0xe2, 0x57, 0x6f, 0x97, 0xd5, 0x32, 0xf3, 0x59, 0xc2,
0x9a, 0x44, 0x2f, 0x18, 0x4c, 0x7c, 0x5d, 0x48, 0xa9, 0x9e, 0x4f, 0x5d,
0x5e, 0x88, 0xa1, 0x2c, 0x50, 0x6c, 0x5f, 0xb6, 0x99, 0x25, 0x51, 0x29,
0x60, 0xe6, 0x91, 0x35, 0x50, 0xbf, 0x63, 0x1d, 0x87, 0xab, 0x50, 0xae,
0x65, 0xe0, 0x7d, 0xd0, 0x50, 0xf1, 0x69, 0xe2, 0x73, 0x44, 0x51, 0xe5,
0x6e, 0x69, 0x69, 0xc8, 0x53, 0x0b, 0x72, 0xe7, 0x60, 0xde, 0x54, 0x34,
0x77, 0xf2, 0x58, 0x39, 0x55, 0xf6, 0x7c, 0xb4, 0x50, 0x03, 0x57, 0xbb,
0x81, 0xcb, 0x49, 0x7c, 0x59, 0x5e, 0x86, 0x49, 0x42, 0xdf, 0x5b, 0x42,
0x8a, 0x37, 0x3d, 0xab, 0x5d, 0x3e, 0x8d, 0xbd, 0x39, 0x57, 0x5f, 0x36,
0x90, 0xe4, 0x35, 0x18, 0x61, 0x27, 0x93, 0xb5, 0x30, 0xc0, 0x58, 0x38,
0x54, 0xf1, 0xb0, 0x83, 0x5a, 0x05, 0x56, 0x2d, 0xa8, 0x55, 0x5c, 0x2e,
0x57, 0x6d, 0xa0, 0x52, 0x5c, 0x11, 0x58, 0xc8, 0x97, 0xf4, 0x5c, 0x2d,
0x5a, 0x39, 0x8f, 0x92, 0x5b, 0xd2, 0x5d, 0x03, 0x85, 0x34, 0x5b, 0xc2,
0x60, 0xbc, 0x7a, 0x65, 0x5b, 0xa9, 0x64, 0xa2, 0x70, 0x01, 0x5c, 0x4d,
0x69, 0x4f, 0x66, 0xab, 0x5d, 0x93, 0x6d, 0xe9, 0x5e, 0x1b, 0x5e, 0xeb,
0x73, 0x31, 0x55, 0xec, 0x60, 0x6e, 0x78, 0x14, 0x4e, 0x22, 0x62, 0x27,
0x7d, 0x27, 0x47, 0x78, 0x63, 0xdc, 0x81, 0xdd, 0x40, 0xe2, 0x65, 0x68,
0x85, 0xbf, 0x3c, 0x05, 0x67, 0x1e, 0x89, 0x4f, 0x37, 0x63, 0x68, 0xf7,
0x8c, 0xa6, 0x32, 0xb6, 0x64, 0xeb, 0x4d, 0x30, 0xb6, 0xf1, 0x67, 0x5b,
0x4e, 0xbb, 0xae, 0x4a, 0x68, 0xb1, 0x50, 0x02, 0xa6, 0x7e, 0x69, 0xc4,
0x51, 0x47, 0x9e, 0xdd, 0x68, 0xa8, 0x52, 0xa4, 0x96, 0x6b, 0x67, 0xd9,
0x54, 0x42, 0x8d, 0xa2, 0x66, 0xfe, 0x56, 0xcf, 0x83, 0x4d, 0x66, 0x38,
0x5a, 0xee, 0x77, 0xdb, 0x66, 0x65, 0x5f, 0xec, 0x6c, 0xc4, 0x66, 0xea,
0x64, 0x70, 0x63, 0x88, 0x67, 0xf7, 0x69, 0x2f, 0x5b, 0x3c, 0x69, 0x7c,
0x6e, 0x6b, 0x53, 0x7f, 0x6a, 0xee, 0x73, 0x84, 0x4c, 0x3b, 0x6c, 0x68,
0x78, 0x71, 0x45, 0x7d, 0x6e, 0x01, 0x7d, 0x2b, 0x3f, 0x2c, 0x6f, 0x8a,
0x81, 0x6f, 0x3a, 0x30, 0x71, 0x0d, 0x85, 0x1f, 0x35, 0x24, 0x71, 0x59,
0x47, 0x16, 0xbc, 0xe0, 0x73, 0x34, 0x48, 0x3c, 0xb4, 0xda, 0x74, 0x67,
0x49, 0x28, 0xad, 0x2b, 0x74, 0xbf, 0x49, 0xe3, 0xa5, 0xdf, 0x74, 0xf8,
0x4a, 0xce, 0x9e, 0x48, 0x74, 0x03, 0x4c, 0x3b, 0x95, 0x72, 0x73, 0x31,
0x4e, 0x0e, 0x8c, 0x19, 0x72, 0x54, 0x50, 0x6f, 0x81, 0xb9, 0x71, 0x12,
0x55, 0x51, 0x75, 0x9c, 0x70, 0xe3, 0x5a, 0x64, 0x6a, 0x5c, 0x71, 0x89,
0x5f, 0x4f, 0x60, 0xa0, 0x72, 0x98, 0x64, 0x66, 0x58, 0xc2, 0x73, 0xdd,
0x69, 0x68, 0x51, 0x18, 0x75, 0x65, 0x6e, 0xff, 0x4a, 0x66, 0x76, 0xb8,
0x73, 0xde, 0x43, 0xb9, 0x78, 0x16, 0x78, 0x78, 0x3d, 0x92, 0x79, 0x93,
0x7c, 0xf9, 0x37, 0xfd, 0x7f, 0x0c, 0x42, 0x1f, 0xc0, 0xc3, 0x7f, 0xd6,
0x42, 0xf4, 0xb9, 0xd0, 0x80, 0xa2, 0x43, 0xd2, 0xb2, 0xd5, 0x80, 0xc9,
0x44, 0x5d, 0xab, 0xcf, 0x80, 0x84, 0x44, 0xb2, 0xa4, 0xdc, 0x7f, 0xfb,
0x45, 0x3d, 0x9d, 0x59, 0x7e, 0x91, 0x46, 0x32, 0x94, 0x87, 0x7d, 0x56,
0x47, 0xdd, 0x8a, 0xaf, 0x7c, 0x51, 0x4a, 0x1d, 0x7f, 0xf8, 0x7b, 0xf2,
0x50, 0x13, 0x73, 0x55, 0x7b, 0xc8, 0x55, 0x73, 0x67, 0xcb, 0x7c, 0x3a,
0x5a, 0x5e, 0x5e, 0x37, 0x7d, 0x14, 0x5f, 0xc7, 0x56, 0x59, 0x7e, 0x1e,
0x64, 0xd9, 0x4e, 0xfe, 0x7f, 0x82, 0x6a, 0x64, 0x48, 0xa6, 0x80, 0xfb,
0x6f, 0x75, 0x42, 0x21, 0x82, 0x45, 0x74, 0x42, 0x3b, 0xc1, 0x8a, 0x0f,
0x3e, 0x66, 0xc3, 0x42, 0x8a, 0xfe, 0x3e, 0xf3, 0xbc, 0xa8, 0x8b, 0x91,
0x3f, 0x62, 0xb6, 0x98, 0x8c, 0x4a, 0x40, 0x07, 0xb0, 0x65, 0x8b, 0x98,
0x40, 0x0f, 0xa9, 0xd0, 0x8a, 0xd2, 0x40, 0x10, 0xa3, 0x32, 0x89, 0xb5,
0x40, 0x6b, 0x9b, 0x9d, 0x88, 0x43, 0x41, 0x23, 0x93, 0x0b, 0x87, 0x50,
0x43, 0x06, 0x88, 0xa8, 0x86, 0x85, 0x45, 0xe3, 0x7d, 0x3d, 0x85, 0xfb,
0x4b, 0x21, 0x70, 0xb3, 0x86, 0x85, 0x51, 0x5b, 0x64, 0x99, 0x86, 0xa7,
0x56, 0x7f, 0x5b, 0xd2, 0x87, 0x2a, 0x5b, 0xa7, 0x54, 0x50, 0x88, 0x62,
0x61, 0x05, 0x4d, 0x4e, 0x89, 0xb0, 0x66, 0x74, 0x46, 0xc2, 0x8b, 0x01,
0x6b, 0x94, 0x3f, 0xe7, 0x93, 0x45, 0x3b, 0xb3, 0xc5, 0x53, 0x94, 0x37,
0x3c, 0x35, 0xbe, 0xb3, 0x94, 0x82, 0x3c, 0x35, 0xb9, 0x42, 0x94, 0xd0,
0x3c, 0x3e, 0xb3, 0xcb, 0x94, 0xc9, 0x3c, 0x36, 0xae, 0x1c, 0x93, 0xf0,
0x3c, 0x08, 0xa7, 0xbf, 0x93, 0x0c, 0x3b, 0xce, 0xa1, 0x5f, 0x91, 0xfe,
0x3c, 0x26, 0x99, 0x86, 0x90, 0xdc, 0x3c, 0xb6, 0x91, 0x32, 0x90, 0xd9,
0x3f, 0x28, 0x86, 0x1e, 0x90, 0x79, 0x42, 0xb3, 0x7a, 0x3b, 0x8f, 0xee,
0x47, 0xc5, 0x6e, 0x13, 0x90, 0x75, 0x4d, 0xc7, 0x61, 0x50, 0x90, 0xd1,
0x53, 0x79, 0x59, 0xca, 0x91, 0x47, 0x58, 0x82, 0x52, 0xc1, 0x92, 0x64,
0x5d, 0xb4, 0x4b, 0xa9, 0x93, 0xc0, 0x63, 0x06, 0x44, 0x74, 0x9b, 0x72,
0x39, 0x82, 0xc6, 0xcb, 0x9c, 0x99, 0x3a, 0x16, 0xc0, 0x36, 0x9c, 0xd7,
0x39, 0xfb, 0xbb, 0x29, 0x9d, 0x0f, 0x39, 0xe3, 0xb6, 0x21, 0x9d, 0x42,
0x39, 0xc5, 0xb1, 0x23, 0x9c, 0xb1, 0x39, 0x8e, 0xab, 0x55, 0x9b, 0xd0,
0x39, 0x4a, 0xa5, 0x38, 0x9a, 0xe0, 0x39, 0x0f, 0x9e, 0xdf, 0x99, 0xe1,
0x39, 0x66, 0x96, 0xf0, 0x98, 0xf1, 0x3a, 0x06, 0x8e, 0xa2, 0x99, 0x01,
0x3c, 0xec, 0x83, 0x4c, 0x99, 0x38, 0x40, 0xec, 0x77, 0x59, 0x98, 0xef,
0x45, 0xeb, 0x6b, 0xb4, 0x99, 0x3d, 0x4b, 0xb4, 0x5f, 0xb7, 0x99, 0xf6,
0x51, 0x3e, 0x58, 0x0d, 0x9a, 0x9d, 0x56, 0x0a, 0x51, 0x21, 0x9c, 0x03,
0x5b, 0x03, 0x49, 0x9f, 0xa3, 0x4c, 0x37, 0x76, 0xc8, 0x1d, 0xa4, 0x37,
0x37, 0xfb, 0xc1, 0xd3, 0xa4, 0x88, 0x37, 0xee, 0xbc, 0xb9, 0xa4, 0xad,
0x37, 0xc3, 0xb7, 0xea, 0xa4, 0xcb, 0x37, 0x8f, 0xb3, 0x26, 0xa4, 0xa8,
0x37, 0x5a, 0xae, 0x15, 0xa3, 0xfc, 0x37, 0x23, 0xa8, 0x4a, 0xa3, 0x43,
0x36, 0xea, 0xa2, 0x78, 0xa2, 0x84, 0x36, 0xfc, 0x9b, 0xb3, 0xa1, 0xc3,
0x37, 0x58, 0x94, 0x1e, 0xa1, 0x3d, 0x38, 0x99, 0x8b, 0x48, 0xa1, 0x2b,
0x3b, 0x51, 0x80, 0x8a, 0xa1, 0xb6, 0x3f, 0x3b, 0x74, 0xe8, 0xa1, 0xa7,
0x44, 0x74, 0x69, 0xb4, 0xa1, 0xe2, 0x4a, 0x0e, 0x5e, 0x8b, 0xa2, 0x9d,
0x4f, 0x26, 0x56, 0x89, 0xa3, 0x87, 0x53, 0xe4, 0x4f, 0x22, 0xaa, 0xdd,
0x35, 0x8b, 0xc9, 0x11, 0xab, 0x91, 0x36, 0x06, 0xc3, 0x33, 0xab, 0xef,
0x36, 0x12, 0xbd, 0xff, 0xab, 0xfc, 0x35, 0xcd, 0xb9, 0x50, 0xab, 0xfe,
0x35, 0x79, 0xb4, 0xb1, 0xab, 0xfa, 0x35, 0x20, 0xb0, 0x19, 0xab, 0x77,
0x34, 0xef, 0xaa, 0xab, 0xaa, 0xe6, 0x34, 0xb9, 0xa5, 0x35, 0xaa, 0x48,
0x34, 0x7d, 0x9f, 0xaf, 0xa9, 0xb1, 0x34, 0xd6, 0x98, 0x5d, 0xa9, 0x16,
0x35, 0x33, 0x91, 0x0b, 0xa8, 0xc0, 0x36, 0xda, 0x87, 0xf9, 0xa8, 0xa1,
0x39, 0x25, 0x7e, 0x25, 0xa8, 0xeb, 0x3d, 0x4b, 0x73, 0x1a, 0xa9, 0x15,
0x42, 0x8c, 0x68, 0x1d, 0xa9, 0x84, 0x47, 0xf7, 0x5d, 0x83, 0xaa, 0x71,
0x4c, 0xfe, 0x54, 0xc6, 0xb3, 0x22, 0x33, 0x68, 0xca, 0x2b, 0xb3, 0x47,
0x34, 0x19, 0xc4, 0x82, 0xb3, 0xad, 0x34, 0x5f, 0xbf, 0x3d, 0xb3, 0xa4,
0x34, 0x02, 0xba, 0xaa, 0xb3, 0x89, 0x33, 0x97, 0xb6, 0x26, 0xb3, 0x71,
0x33, 0x1d, 0xb1, 0xad, 0xb3, 0x21, 0x32, 0xce, 0xac, 0xc8, 0xb2, 0xc5,
0x32, 0x93, 0xa7, 0xa6, 0xb2, 0x5b, 0x32, 0x58, 0xa2, 0x80, 0xb1, 0xd1,
0x32, 0x66, 0x9c, 0x6e, 0xb1, 0x73, 0x32, 0xba, 0x95, 0x55, 0xb0, 0xe9,
0x33, 0x59, 0x8d, 0xfc, 0xb0, 0x93, 0x35, 0x03, 0x85, 0x4f, 0xb0, 0x5d,
0x37, 0x70, 0x7b, 0xfb, 0xb0, 0x90, 0x3b, 0x8e, 0x71, 0x7f, 0xb0, 0xa9,
0x40, 0xb5, 0x66, 0xc4, 0xb1, 0x41, 0x45, 0xf7, 0x5c, 0x48, 0x15, 0x13,
0x94, 0x44, 0x8c, 0x12, 0x17, 0x79, 0x96, 0x25, 0x83, 0xc9, 0x19, 0x58,
0x98, 0x89, 0x7b, 0x84, 0x1a, 0xdf, 0x9b, 0x20, 0x73, 0x51, 0x1c, 0x5a,
0x9e, 0x00, 0x6a, 0xa6, 0x1d, 0x9c, 0xa0, 0xde, 0x61, 0x3c, 0x20, 0x01,
0xa4, 0x77, 0x59, 0xe3, 0x22, 0x07, 0xa7, 0xde, 0x52, 0x5a, 0x24, 0x76,
0xaa, 0xc9, 0x4c, 0x22, 0x27, 0x02, 0xad, 0x41, 0x46, 0x03, 0x29, 0xbe,
0xaf, 0x35, 0x3f, 0xf6, 0x2c, 0xbd, 0xb0, 0xb8, 0x3c, 0x17, 0x2f, 0x24,
0xb2, 0x61, 0x38, 0x75, 0x32, 0x19, 0xb3, 0x7d, 0x34, 0xff, 0x35, 0x5a,
0xb4, 0x3d, 0x31, 0x8f, 0x38, 0x33, 0xb5, 0x49, 0x2d, 0xeb, 0x3b, 0x0c,
0xb6, 0x61, 0x2a, 0x6a, 0x1d, 0x9e, 0x8c, 0x70, 0x90, 0x49, 0x20, 0x0b,
0x8e, 0x49, 0x87, 0x7f, 0x22, 0x35, 0x90, 0x53, 0x7e, 0xdc, 0x23, 0xd9,
0x93, 0x03, 0x76, 0x77, 0x25, 0x5a, 0x95, 0xcd, 0x6e, 0x07, 0x26, 0xe1,
0x99, 0x09, 0x64, 0xf2, 0x28, 0xa1, 0x9c, 0x68, 0x5c, 0x27, 0x2b, 0x01,
0xa0, 0x02, 0x53, 0xc0, 0x2d, 0x4d, 0xa3, 0x6c, 0x4c, 0xe8, 0x2f, 0xc4,
0xa6, 0x78, 0x46, 0xa7, 0x32, 0x31, 0xa8, 0xfa, 0x40, 0x78, 0x34, 0xe3,
0xaa, 0xbe, 0x3c, 0xd4, 0x37, 0xc3, 0xac, 0x46, 0x39, 0x5e, 0x3a, 0xbf,
0xad, 0x96, 0x36, 0x06, 0x3d, 0xca, 0xae, 0xb3, 0x32, 0xbb, 0x40, 0xb8,
0xaf, 0xb4, 0x2f, 0x70, 0x43, 0x1c, 0xb0, 0xf8, 0x2c, 0x02, 0x25, 0xd7,
0x85, 0x55, 0x94, 0xea, 0x28, 0x87, 0x86, 0x72, 0x8c, 0x39, 0x2a, 0xf0,
0x87, 0xd1, 0x83, 0xcd, 0x2c, 0xa5, 0x8a, 0x62, 0x7a, 0xee, 0x2d, 0xf2,
0x8d, 0x7b, 0x71, 0xc7, 0x2f, 0xa5, 0x91, 0x21, 0x68, 0xa5, 0x31, 0x4f,
0x94, 0x62, 0x5f, 0xb5, 0x33, 0x2e, 0x98, 0x1e, 0x57, 0x97, 0x35, 0x4b,
0x9b, 0xa9, 0x4f, 0x73, 0x38, 0x1e, 0x9f, 0x5f, 0x48, 0xd8, 0x3a, 0x72,
0xa2, 0x6d, 0x42, 0x5b, 0x3c, 0xc9, 0xa4, 0xc1, 0x3d, 0xf0, 0x3f, 0x59,
0xa6, 0xb6, 0x3a, 0x73, 0x42, 0x04, 0xa8, 0x5e, 0x37, 0x1d, 0x44, 0xa8,
0xa9, 0xcf, 0x33, 0xca, 0x47, 0x33, 0xab, 0x17, 0x30, 0x61, 0x49, 0xb1,
0xac, 0x4b, 0x2d, 0x10, 0x2e, 0x6b, 0x7e, 0x09, 0x99, 0xd8, 0x30, 0xf1,
0x7e, 0xf5, 0x90, 0xf9, 0x33, 0xa6, 0x7f, 0xd0, 0x88, 0xae, 0x36, 0x71,
0x80, 0x80, 0x80, 0x80, 0x37, 0x81, 0x84, 0x63, 0x77, 0x1d, 0x38, 0xb7,
0x87, 0xee, 0x6d, 0xd9, 0x3a, 0x4a, 0x8b, 0xd8, 0x64, 0x9c, 0x3c, 0x12,
0x8f, 0xbe, 0x5b, 0xe4, 0x3d, 0xb7, 0x93, 0x84, 0x53, 0xb8, 0x3f, 0xc0,
0x97, 0x5a, 0x4c, 0x68, 0x42, 0x23, 0x9b, 0x00, 0x45, 0xda, 0x44, 0x9c,
0x9e, 0x2c, 0x3f, 0xab, 0x47, 0x16, 0xa0, 0xc9, 0x3c, 0x05, 0x49, 0x6b,
0xa2, 0xdd, 0x38, 0x8b, 0x4b, 0xbe, 0xa4, 0xac, 0x35, 0x16, 0x4e, 0x05,
0xa6, 0x44, 0x31, 0x9b, 0x50, 0x68, 0xa7, 0xae, 0x2e, 0x22, 0x38, 0xda,
0x75, 0xbb, 0x9f, 0x72, 0x3b, 0x57, 0x76, 0x8a, 0x96, 0xe4, 0x3d, 0xc2,
0x77, 0x6e, 0x8e, 0x86, 0x3f, 0xbc, 0x78, 0xf8, 0x86, 0x02, 0x41, 0x83,
0x7b, 0x00, 0x7d, 0x22, 0x42, 0x8f, 0x7e, 0x79, 0x73, 0x86, 0x43, 0xd3,
0x82, 0x77, 0x6a, 0x44, 0x45, 0x2c, 0x86, 0x54, 0x61, 0x38, 0x46, 0xa4,
0x8a, 0x9d, 0x58, 0xda, 0x48, 0x60, 0x8e, 0x86, 0x50, 0xb9, 0x4a, 0x66,
0x92, 0xac, 0x4a, 0x3e, 0x4c, 0x7c, 0x96, 0x53, 0x43, 0xc0, 0x4e, 0xa4,
0x99, 0x79, 0x3e, 0x76, 0x50, 0xe4, 0x9c, 0x51, 0x3a, 0x8a, 0x53, 0x3f,
0x9e, 0xdf, 0x36, 0xc5, 0x55, 0x6f, 0xa0, 0xf9, 0x33, 0x20, 0x57, 0xa1,
0xa2, 0xb9, 0x2f, 0x6c, 0x44, 0x29, 0x6d, 0x4a, 0xa5, 0x3b, 0x46, 0xb5,
0x6d, 0xf9, 0x9c, 0xe0, 0x48, 0xc0, 0x6e, 0xff, 0x94, 0x85, 0x4a, 0x7f,
0x70, 0x93, 0x8b, 0xde, 0x4b, 0xe1, 0x72, 0x9f, 0x83, 0x32, 0x4c, 0xc5,
0x75, 0x69, 0x79, 0xe1, 0x4d, 0x88, 0x78, 0xb6, 0x70, 0x4a, 0x4e, 0xd1,
0x7c, 0xdc, 0x67, 0x4a, 0x50, 0x5f, 0x80, 0xd3, 0x5e, 0x8b, 0x51, 0x8f,
0x85, 0x65, 0x56, 0x3f, 0x53, 0x15, 0x89, 0x96, 0x4e, 0x95, 0x54, 0xf1,
0x8d, 0xea, 0x48, 0x3a, 0x56, 0xf6, 0x91, 0xc0, 0x41, 0xb8, 0x58, 0xd5,
0x94, 0xfa, 0x3d, 0x10, 0x5a, 0xcd, 0x97, 0xd0, 0x39, 0x02, 0x5c, 0xd3,
0x9a, 0x5b, 0x35, 0x11, 0x5e, 0xf4, 0x9c, 0xb3, 0x31, 0x16, 0x4f, 0xce,
0x64, 0xbb, 0xab, 0x81, 0x52, 0xcf, 0x65, 0xb0, 0xa3, 0x3d, 0x54, 0xa0,
0x66, 0xc4, 0x9b, 0x19, 0x55, 0xd8, 0x67, 0xfc, 0x92, 0xd6, 0x56, 0x92,
0x6a, 0x01, 0x89, 0xc3, 0x57, 0x78, 0x6c, 0x63, 0x80, 0x90, 0x58, 0x16,
0x6f, 0xec, 0x76, 0xbc, 0x58, 0xab, 0x73, 0x77, 0x6d, 0x72, 0x59, 0xa0,
0x77, 0x8a, 0x64, 0x9d, 0x5a, 0xeb, 0x7b, 0xe0, 0x5c, 0x14, 0x5c, 0xa2,
0x80, 0x6d, 0x53, 0xfd, 0x5d, 0xfc, 0x84, 0xde, 0x4c, 0xb7, 0x5f, 0x8d,
0x89, 0x3b, 0x46, 0x3c, 0x61, 0x60, 0x8d, 0x1b, 0x3f, 0xf7, 0x63, 0x30,
0x90, 0x7c, 0x3b, 0x8e, 0x64, 0xda, 0x93, 0x70, 0x37, 0x29, 0x66, 0xb6,
0x96, 0x30, 0x32, 0xa9, 0x5b, 0x61, 0x5b, 0xe5, 0xb1, 0xf8, 0x5e, 0x05,
0x5d, 0x0c, 0xa9, 0xc4, 0x60, 0xeb, 0x5e, 0x40, 0xa1, 0xc0, 0x61, 0xe6,
0x5f, 0xc5, 0x99, 0x57, 0x62, 0x65, 0x61, 0x64, 0x90, 0xf0, 0x62, 0x58,
0x63, 0xf8, 0x87, 0x41, 0x62, 0x95, 0x66, 0xcd, 0x7d, 0x96, 0x62, 0xd2,
0x6a, 0x6f, 0x73, 0xb1, 0x63, 0xa1, 0x6e, 0x65, 0x6a, 0x98, 0x64, 0x95,
0x72, 0x52, 0x62, 0x01, 0x65, 0xab, 0x77, 0x01, 0x59, 0xb6, 0x67, 0x2e,
0x7b, 0x72, 0x51, 0xc9, 0x68, 0xcb, 0x80, 0x2f, 0x4a, 0xe7, 0x6a, 0x0e,
0x84, 0x95, 0x44, 0x47, 0x6b, 0x92, 0x88, 0x75, 0x3e, 0x6e, 0x6d, 0x31,
0x8b, 0xf5, 0x39, 0xac, 0x6e, 0xfb, 0x8f, 0x49, 0x34, 0xba, 0x68, 0x34,
0x54, 0x33, 0xb8, 0x06, 0x6b, 0x14, 0x55, 0xbc, 0xaf, 0x5a, 0x6c, 0xa7,
0x56, 0xdd, 0xa7, 0xb9, 0x6e, 0x6f, 0x57, 0xf6, 0xa0, 0x12, 0x6e, 0x11,
0x59, 0x7d, 0x97, 0x97, 0x6d, 0xf0, 0x5b, 0x2c, 0x8e, 0xef, 0x6d, 0x91,
0x5d, 0xec, 0x84, 0xd3, 0x6d, 0x6b, 0x61, 0x76, 0x7a, 0x71, 0x6d, 0x7f,
0x65, 0x33, 0x70, 0x6b, 0x6e, 0x30, 0x69, 0x58, 0x67, 0x90, 0x6f, 0x46,
0x6d, 0x5e, 0x5f, 0x2d, 0x70, 0x7e, 0x72, 0x4f, 0x57, 0x61, 0x71, 0xc1,
0x76, 0xa6, 0x4f, 0xb1, 0x73, 0x15, 0x7b, 0x6c, 0x49, 0x01, 0x74, 0x83,
0x7f, 0xf5, 0x42, 0x5f, 0x75, 0xc9, 0x83, 0xf1, 0x3c, 0xab, 0x77, 0x44,
0x87, 0x9e, 0x37, 0x50, 0x74, 0x76, 0x4d, 0x3b, 0xbd, 0xdd, 0x77, 0x17,
0x4e, 0x95, 0xb5, 0x1c, 0x78, 0xf1, 0x4f, 0xd6, 0xac, 0xec, 0x79, 0xbb,
0x50, 0xf9, 0xa5, 0xba, 0x7a, 0x50, 0x52, 0x26, 0x9e, 0x4c, 0x79, 0xae,
0x53, 0xa1, 0x95, 0xf5, 0x79, 0x25, 0x55, 0x50, 0x8d, 0x31, 0x78, 0x80,
0x57, 0xaa, 0x83, 0x36, 0x78, 0x12, 0x5b, 0xd4, 0x78, 0x0f, 0x78, 0x32,
0x60, 0x4f, 0x6d, 0x56, 0x78, 0xd9, 0x64, 0x5a, 0x64, 0xb0, 0x79, 0xc6,
0x68, 0xbc, 0x5c, 0x9f, 0x7a, 0xf7, 0x6d, 0x95, 0x55, 0x12, 0x7c, 0x39,
0x72, 0x32, 0x4d, 0xdb, 0x7d, 0x5b, 0x76, 0xc8, 0x47, 0x3a, 0x7e, 0x93,
0x7b, 0x1c, 0x40, 0x98, 0x7f, 0xff, 0x7f, 0x95, 0x3a, 0x8f, 0x81, 0x7f,
0x47, 0xd0, 0xc2, 0x1a, 0x82, 0xb1, 0x48, 0xd3, 0xba, 0x86, 0x83, 0xfa,
0x49, 0xd8, 0xb2, 0xfc, 0x84, 0x9b, 0x4a, 0xac, 0xab, 0xb1, 0x84, 0xde,
0x4b, 0x6d, 0xa4, 0x98, 0x84, 0xde, 0x4c, 0x71, 0x9c, 0xf8, 0x84, 0x45,
0x4d, 0xd8, 0x94, 0x73, 0x83, 0xc2, 0x4f, 0x8d, 0x8b, 0x3e, 0x83, 0x1f,
0x51, 0x6e, 0x81, 0x74, 0x82, 0xbb, 0x56, 0x63, 0x75, 0xd2, 0x82, 0xe1,
0x5b, 0x38, 0x6b, 0x00, 0x83, 0xa6, 0x5f, 0x84, 0x61, 0xd9, 0x84, 0x56,
0x64, 0x3d, 0x5a, 0x2d, 0x85, 0x62, 0x68, 0xd7, 0x52, 0xce, 0x86, 0xbf,
0x6d, 0xc0, 0x4b, 0xf9, 0x87, 0xd0, 0x72, 0x9b, 0x45, 0x37, 0x88, 0xdc,
0x77, 0x6f, 0x3e, 0x30, 0x8c, 0xfb, 0x43, 0x7b, 0xc4, 0xd2, 0x8e, 0x1a,
0x44, 0x60, 0xbd, 0x8e, 0x8e, 0xd7, 0x45, 0x08, 0xb7, 0x28, 0x8f, 0xa6,
0x45, 0xc1, 0xb0, 0xab, 0x8f, 0x74, 0x46, 0x29, 0xa9, 0xed, 0x8f, 0x3a,
0x46, 0x97, 0xa3, 0x21, 0x8e, 0xaf, 0x47, 0x61, 0x9b, 0x80, 0x8d, 0xea,
0x48, 0x88, 0x93, 0x20, 0x8d, 0x71, 0x4a, 0x4f, 0x89, 0x64, 0x8d, 0x0c,
0x4c, 0x87, 0x7e, 0xf7, 0x8d, 0x39, 0x51, 0xa1, 0x73, 0x3c, 0x8d, 0x62,
0x56, 0xd2, 0x68, 0x42, 0x8e, 0x24, 0x5b, 0x67, 0x5f, 0x1e, 0x8e, 0xc3,
0x60, 0x3d, 0x57, 0xf4, 0x8f, 0xbb, 0x64, 0x92, 0x50, 0xdd, 0x90, 0xf9,
0x69, 0xb0, 0x49, 0xff, 0x92, 0x50, 0x6e, 0xfe, 0x42, 0x51, 0x95, 0xfc,
0x3f, 0xfa, 0xc8, 0x09, 0x97, 0xb8, 0x40, 0xf7, 0xbf, 0x62, 0x98, 0x30,
0x41, 0x53, 0xb9, 0xb2, 0x98, 0xae, 0x41, 0xbb, 0xb3, 0xfa, 0x98, 0xee,
0x42, 0x10, 0xae, 0x0f, 0x98, 0x8e, 0x42, 0x38, 0xa7, 0xa8, 0x98, 0x33,
0x42, 0x64, 0xa1, 0x3f, 0x97, 0x86, 0x43, 0x0c, 0x99, 0x96, 0x96, 0xce,
0x43, 0xe5, 0x91, 0x8f, 0x96, 0x86, 0x46, 0x52, 0x87, 0x18, 0x96, 0x5d,
0x49, 0x77, 0x7c, 0x14, 0x96, 0xb4, 0x4e, 0x01, 0x70, 0xba, 0x97, 0x15,
0x53, 0x6a, 0x65, 0x2b, 0x97, 0xa1, 0x58, 0x3e, 0x5c, 0xe9, 0x98, 0x5c,
0x5c, 0xe5, 0x55, 0xcb, 0x99, 0x81, 0x61, 0x35, 0x4e, 0x6a, 0x9b, 0x29,
0x66, 0xc5, 0x46, 0x50, 0x9e, 0x5b, 0x3d, 0xa8, 0xc8, 0x5d, 0xa0, 0x13,
0x3e, 0x55, 0xc1, 0x1d, 0xa0, 0x93, 0x3e, 0x7a, 0xbb, 0xa6, 0xa0, 0xec,
0x3e, 0x95, 0xb6, 0x6e, 0xa1, 0x47, 0x3e, 0xb1, 0xb1, 0x3a, 0xa1, 0x16,
0x3e, 0xc1, 0xab, 0x5c, 0xa0, 0xb9, 0x3e, 0xc9, 0xa5, 0x49, 0xa0, 0x58,
0x3e, 0xdb, 0x9f, 0x09, 0x9f, 0xd5, 0x3f, 0x50, 0x97, 0x87, 0x9f, 0x41,
0x3f, 0xd0, 0x8f, 0xfc, 0x9f, 0x31, 0x43, 0x6e, 0x84, 0x88, 0x9f, 0x59,
0x47, 0x30, 0x79, 0x53, 0x9f, 0xc8, 0x4b, 0x89, 0x6e, 0x37, 0xa0, 0x47,
0x50, 0xcf, 0x61, 0xe8, 0xa0, 0xc2, 0x55, 0xa6, 0x5a, 0xf0, 0xa1, 0x93,
0x5a, 0x1c, 0x53, 0xd1, 0xa3, 0x11, 0x5e, 0x9a, 0x4b, 0x9e, 0xa5, 0xf4,
0x3b, 0x52, 0xc9, 0xb3, 0xa7, 0x1c, 0x3b, 0xd5, 0xc3, 0x25, 0xa7, 0xc9,
0x3c, 0x0c, 0xbd, 0x7b, 0xa8, 0x16, 0x3c, 0x08, 0xb8, 0x7d, 0xa8, 0x5f,
0x3c, 0x04, 0xb3, 0x86, 0xa8, 0x7a, 0x3c, 0x03, 0xae, 0x52, 0xa8, 0x14,
0x3c, 0x0d, 0xa8, 0x71, 0xa7, 0xae, 0x3c, 0x14, 0xa2, 0x8f, 0xa7, 0x47,
0x3c, 0x58, 0x9b, 0xe5, 0xa6, 0xe5, 0x3c, 0xd9, 0x94, 0x92, 0xa6, 0xa1,
0x3e, 0x05, 0x8c, 0x46, 0xa6, 0xab, 0x40, 0x88, 0x81, 0xf8, 0xa6, 0xfa,
0x44, 0x93, 0x77, 0x0f, 0xa7, 0x59, 0x49, 0x19, 0x6c, 0x29, 0xa7, 0xc1,
0x4e, 0x58, 0x60, 0x69, 0xa8, 0xac, 0x53, 0x15, 0x58, 0xdd, 0xaa, 0x05,
0x58, 0x30, 0x50, 0x15, 0xad, 0x8d, 0x39, 0x3c, 0xca, 0xa6, 0xae, 0x6a,
0x39, 0xb0, 0xc4, 0x96, 0xaf, 0x19, 0x39, 0xf4, 0xbe, 0xf0, 0xaf, 0x53,
0x39, 0xd8, 0xba, 0x1b, 0xaf, 0x87, 0x39, 0xb5, 0xb5, 0x51, 0xaf, 0xb5,
0x39, 0x90, 0xb0, 0x8a, 0xaf, 0x6f, 0x39, 0x8f, 0xab, 0x13, 0xaf, 0x17,
0x39, 0x95, 0xa5, 0x7b, 0xae, 0xba, 0x39, 0x9b, 0x9f, 0xdd, 0xae, 0x74,
0x3a, 0x18, 0x98, 0xc0, 0xae, 0x31, 0x3a, 0x9e, 0x91, 0xa7, 0xae, 0x08,
0x3c, 0x15, 0x89, 0x0b, 0xad, 0xff, 0x3d, 0xf1, 0x7f, 0xb4, 0xae, 0x5e,
0x42, 0x5c, 0x75, 0x13, 0xae, 0xd7, 0x46, 0xfd, 0x6a, 0x6d, 0xaf, 0x4f,
0x4c, 0x16, 0x5f, 0x77, 0xb0, 0x83, 0x50, 0xc8, 0x56, 0x51, 0xb5, 0xb4,
0x36, 0xe1, 0xcb, 0xef, 0xb6, 0x47, 0x37, 0x76, 0xc6, 0x48, 0xb6, 0xf8,
0x38, 0x16, 0xc0, 0xac, 0xb7, 0x27, 0x37, 0xf3, 0xbb, 0xe5, 0xb7, 0x4a,
0x37, 0xba, 0xb7, 0x39, 0xb7, 0x68, 0x37, 0x78, 0xb2, 0x93, 0xb7, 0x4f,
0x37, 0x50, 0xad, 0xa2, 0xb7, 0x05, 0x37, 0x48, 0xa8, 0x49, 0xb6, 0xb5,
0x37, 0x3e, 0xa2, 0xed, 0xb6, 0x64, 0x37, 0x64, 0x9c, 0xf2, 0xb6, 0x30,
0x37, 0xc5, 0x96, 0x0c, 0xb5, 0xef, 0x38, 0x45, 0x8f, 0x19, 0xb5, 0xdd,
0x39, 0xfe, 0x86, 0x76, 0xb5, 0xe8, 0x3c, 0x1f, 0x7d, 0x6e, 0xb6, 0x03,
0x3f, 0xd9, 0x73, 0x3d, 0xb6, 0x59, 0x44, 0x7a, 0x68, 0xa6, 0xb7, 0x1b,
0x49, 0x8a, 0x5d, 0xc8, 0x1b, 0xc4, 0x9a, 0x3f, 0x90, 0x63, 0x1d, 0xe5,
0x9c, 0x39, 0x88, 0x2b, 0x1f, 0xaf, 0x9e, 0x45, 0x80, 0x1e, 0x20, 0xef,
0xa0, 0xa2, 0x77, 0xf1, 0x22, 0x0e, 0xa2, 0xf9, 0x6f, 0xdf, 0x23, 0x3f,
0xa5, 0xfa, 0x66, 0xb9, 0x24, 0x65, 0xa9, 0x3f, 0x5e, 0x35, 0x26, 0x52,
0xac, 0x63, 0x56, 0x80, 0x28, 0x58, 0xae, 0xeb, 0x4e, 0xf0, 0x2b, 0x00,
0xb0, 0xf5, 0x48, 0xd6, 0x2d, 0x2f, 0xb2, 0xe5, 0x42, 0x86, 0x30, 0x11,
0xb4, 0x34, 0x3e, 0x20, 0x31, 0x77, 0xb6, 0x66, 0x3a, 0x75, 0x34, 0xba,
0xb7, 0x29, 0x36, 0xe6, 0x38, 0xf8, 0xb7, 0x21, 0x33, 0x85, 0x3b, 0xeb,
0xb7, 0xca, 0x30, 0x15, 0x3e, 0xdf, 0xb8, 0xc5, 0x2c, 0xb3, 0x23, 0x72,
0x93, 0x30, 0x94, 0x5b, 0x26, 0x17, 0x94, 0x90, 0x8b, 0xc0, 0x28, 0x2a,
0x96, 0x49, 0x83, 0x80, 0x29, 0xce, 0x98, 0x7d, 0x7b, 0x27, 0x2b, 0x07,
0x9b, 0x12, 0x72, 0xc0, 0x2c, 0x4f, 0x9d, 0xe0, 0x69, 0x96, 0x2d, 0x90,
0xa0, 0x84, 0x5f, 0xd7, 0x2f, 0xaa, 0xa4, 0x19, 0x58, 0x0b, 0x31, 0x66,
0xa7, 0x39, 0x4f, 0xec, 0x33, 0xe9, 0xa9, 0xfc, 0x49, 0xd0, 0x36, 0x50,
0xac, 0x48, 0x43, 0x5d, 0x39, 0x00, 0xae, 0x03, 0x3e, 0x8c, 0x3c, 0x0b,
0xaf, 0x53, 0x3b, 0x1f, 0x3f, 0x0b, 0xb0, 0x72, 0x37, 0xd1, 0x41, 0xbb,
0xb1, 0x85, 0x34, 0x8f, 0x44, 0x3c, 0xb2, 0x7e, 0x31, 0x35, 0x46, 0xa3,
0xb3, 0x93, 0x2d, 0xc8, 0x2b, 0x25, 0x8c, 0x3c, 0x98, 0xe3, 0x2e, 0x18,
0x8d, 0x16, 0x8f, 0xb5, 0x30, 0x2f, 0x8e, 0xbf, 0x87, 0x2c, 0x32, 0x1d,
0x90, 0x9f, 0x7e, 0x99, 0x33, 0xb6, 0x93, 0x26, 0x76, 0x04, 0x35, 0x31,
0x95, 0xed, 0x6d, 0x5e, 0x36, 0xb3, 0x98, 0xf7, 0x64, 0x2a, 0x38, 0x5c,
0x9c, 0x3e, 0x5b, 0x61, 0x3a, 0x57, 0x9f, 0x95, 0x52, 0xcf, 0x3c, 0x85,
0xa2, 0xce, 0x4b, 0xf3, 0x3e, 0xc3, 0xa5, 0x98, 0x45, 0xa1, 0x41, 0x0c,
0xa7, 0xe2, 0x3f, 0xb2, 0x43, 0xbd, 0xa9, 0xa6, 0x3c, 0x58, 0x46, 0x64,
0xab, 0x2d, 0x38, 0xfd, 0x48, 0xfb, 0xac, 0x82, 0x35, 0xa2, 0x4b, 0x7a,
0xad, 0xad, 0x32, 0x3e, 0x4d, 0xf7, 0xae, 0xcd, 0x2e, 0xba, 0x33, 0x6c,
0x85, 0x0f, 0x9d, 0xa4, 0x36, 0x57, 0x85, 0xb6, 0x94, 0xb2, 0x39, 0x16,
0x86, 0x8b, 0x8c, 0x28, 0x3b, 0x6d, 0x87, 0xe9, 0x83, 0xa6, 0x3d, 0x01,
0x8a, 0x70, 0x7a, 0xa6, 0x3e, 0x47, 0x8d, 0x53, 0x71, 0x77, 0x3f, 0xde,
0x90, 0xbd, 0x68, 0x6d, 0x41, 0x6c, 0x93, 0xe0, 0x5f, 0xad, 0x43, 0x0f,
0x97, 0x88, 0x57, 0x85, 0x44, 0xe1, 0x9a, 0xdf, 0x4f, 0x6d, 0x47, 0x3b,
0x9e, 0x58, 0x48, 0xf5, 0x49, 0x89, 0xa1, 0x39, 0x42, 0x81, 0x4b, 0xbd,
0xa3, 0x8e, 0x3e, 0x0c, 0x4e, 0x04, 0xa5, 0x8c, 0x3a, 0x84, 0x50, 0x48,
0xa7, 0x43, 0x37, 0x05, 0x52, 0x88, 0xa8, 0xc5, 0x33, 0x89, 0x54, 0xdb,
0xaa, 0x2f, 0x2f, 0xda, 0x3c, 0x15, 0x7d, 0x97, 0xa2, 0x3c, 0x3f, 0x19,
0x7e, 0x0d, 0x99, 0xad, 0x42, 0x10, 0x7e, 0x80, 0x91, 0x62, 0x44, 0xa7,
0x7f, 0x90, 0x88, 0xec, 0x47, 0x47, 0x80, 0x80, 0x80, 0x80, 0x48, 0x5c,
0x84, 0x2b, 0x77, 0x28, 0x49, 0x8d, 0x87, 0x72, 0x6d, 0xfe, 0x4a, 0xe0,
0x8b, 0x0c, 0x65, 0x00, 0x4c, 0x4e, 0x8e, 0xb7, 0x5c, 0x5c, 0x4d, 0xe9,
0x92, 0x6a, 0x54, 0x6b, 0x4f, 0xaf, 0x96, 0x0c, 0x4d, 0x3b, 0x51, 0xc0,
0x99, 0x8b, 0x46, 0xe2, 0x53, 0xf2, 0x9c, 0x90, 0x40, 0x77, 0x56, 0x29,
0x9f, 0x47, 0x3c, 0x78, 0x58, 0x36, 0xa1, 0x80, 0x38, 0xc7, 0x5a, 0x2d,
0xa3, 0x5f, 0x35, 0x27, 0x5c, 0x54, 0xa5, 0x2e, 0x31, 0x28, 0x47, 0x10,
0x75, 0x2b, 0xa7, 0xe4, 0x4a, 0x6a, 0x75, 0x77, 0x9f, 0x78, 0x4c, 0xdf,
0x76, 0x52, 0x97, 0x25, 0x4f, 0x47, 0x77, 0x43, 0x8e, 0xc3, 0x51, 0x16,
0x78, 0xf2, 0x86, 0x20, 0x52, 0xaf, 0x7a, 0xfa, 0x7d, 0x44, 0x53, 0x99,
0x7e, 0x3d, 0x73, 0xd9, 0x54, 0xca, 0x81, 0xd4, 0x6a, 0xe3, 0x55, 0xfd,
0x85, 0x5b, 0x62, 0x2a, 0x57, 0x52, 0x89, 0x60, 0x59, 0xe6, 0x58, 0xf5,
0x8d, 0x29, 0x51, 0xf3, 0x5a, 0xb6, 0x91, 0x2c, 0x4b, 0x48, 0x5c, 0x78,
0x94, 0xd6, 0x44, 0xe2, 0x5e, 0x51, 0x97, 0xfc, 0x3f, 0x12, 0x60, 0x32,
0x9a, 0xae, 0x3b, 0x08, 0x62, 0x25, 0x9d, 0x1c, 0x37, 0x06, 0x64, 0x42,
0x9f, 0x69, 0x32, 0xd8, 0x52, 0x72, 0x6c, 0x79, 0xad, 0xce, 0x55, 0xb0,
0x6d, 0x06, 0xa5, 0x70, 0x58, 0x70, 0x6d, 0xc7, 0x9d, 0x25, 0x5a, 0x40,
0x6e, 0xfd, 0x94, 0x8e, 0x5b, 0xd8, 0x70, 0xb5, 0x8b, 0xcb, 0x5d, 0x2b,
0x72, 0xc7, 0x83, 0x31, 0x5e, 0x05, 0x75, 0x83, 0x7a, 0x22, 0x5e, 0xcb,
0x78, 0xad, 0x70, 0xec, 0x5f, 0xd6, 0x7c, 0x67, 0x68, 0x32, 0x61, 0x29,
0x80, 0x05, 0x5f, 0xa6, 0x62, 0x76, 0x84, 0x45, 0x57, 0xa2, 0x64, 0x00,
0x88, 0x1c, 0x4f, 0xcf, 0x65, 0x7e, 0x8c, 0x53, 0x49, 0x5b, 0x67, 0x46,
0x90, 0x0e, 0x43, 0x04, 0x68, 0xc8, 0x93, 0x4b, 0x3d, 0xb3, 0x6a, 0x61,
0x96, 0x2a, 0x39, 0x33, 0x6c, 0x42, 0x98, 0xf2, 0x34, 0x5d, 0x5e, 0x11,
0x63, 0x3f, 0xb3, 0xce, 0x61, 0x34, 0x64, 0x5a, 0xab, 0x80, 0x64, 0x4f,
0x65, 0x74, 0xa3, 0x69, 0x66, 0x07, 0x66, 0xc6, 0x9b, 0x14, 0x67, 0x0d,
0x68, 0x47, 0x92, 0x90, 0x67, 0xc8, 0x6a, 0x6f, 0x89, 0x83, 0x68, 0xaa,
0x6c, 0xba, 0x80, 0x84, 0x69, 0x45, 0x70, 0x2f, 0x77, 0x01, 0x69, 0xe8,
0x73, 0x86, 0x6e, 0x00, 0x6a, 0xe0, 0x77, 0x2d, 0x65, 0x84, 0x6c, 0x28,
0x7b, 0x0d, 0x5d, 0x47, 0x6d, 0xa9, 0x7f, 0x3a, 0x55, 0x8a, 0x6e, 0xee,
0x83, 0x42, 0x4e, 0x14, 0x70, 0x21, 0x87, 0x8a, 0x47, 0x79, 0x71, 0xa0,
0x8b, 0x4a, 0x41, 0x13, 0x73, 0x38, 0x8e, 0xb6, 0x3b, 0xf1, 0x74, 0xd1,
0x91, 0xec, 0x36, 0xa2, 0x6a, 0x6d, 0x5b, 0x38, 0xba, 0x78, 0x6e, 0x23,
0x5c, 0x9e, 0xb0, 0xd7, 0x70, 0x4a, 0x5d, 0x9b, 0xa8, 0xf3, 0x72, 0x50,
0x5e, 0x8b, 0xa1, 0x18, 0x72, 0xc5, 0x60, 0x1d, 0x98, 0xa9, 0x73, 0x33,
0x61, 0xd9, 0x90, 0x54, 0x73, 0x49, 0x64, 0x71, 0x86, 0xfe, 0x73, 0x9f,
0x67, 0x31, 0x7d, 0xaa, 0x74, 0x08, 0x6a, 0xd3, 0x73, 0xf0, 0x74, 0xe6,
0x6e, 0x91, 0x6b, 0x23, 0x75, 0xdb, 0x72, 0x30, 0x62, 0xdf, 0x76, 0xe6,
0x76, 0x4c, 0x5a, 0xed, 0x78, 0x36, 0x7a, 0x49, 0x53, 0x55, 0x79, 0x97,
0x7e, 0x69, 0x4c, 0x58, 0x7a, 0xab, 0x82, 0xbb, 0x45, 0xa6, 0x7b, 0xeb,
0x86, 0x94, 0x3f, 0x48, 0x7d, 0x72, 0x8a, 0x59, 0x39, 0x6e, 0x77, 0x08,
0x53, 0x9d, 0xbf, 0x75, 0x79, 0xd3, 0x55, 0x2a, 0xb6, 0xb0, 0x7c, 0x23,
0x56, 0x80, 0xae, 0x6d, 0x7d, 0x53, 0x57, 0x92, 0xa7, 0x01, 0x7e, 0x89,
0x58, 0xa6, 0x9f, 0x76, 0x7e, 0x71, 0x5a, 0x41, 0x97, 0x1b, 0x7e, 0x88,
0x5c, 0x07, 0x8e, 0x87, 0x7e, 0x6d, 0x5e, 0xb8, 0x84, 0xae, 0x7e, 0x79,
0x62, 0x0e, 0x7a, 0xa3, 0x7e, 0xbe, 0x65, 0xa7, 0x70, 0xbe, 0x7f, 0x96,
0x69, 0x7e, 0x68, 0x5d, 0x80, 0xa0, 0x6d, 0x3b, 0x60, 0x4d, 0x81, 0xaf,
0x71, 0xaf, 0x58, 0xbb, 0x82, 0xe7, 0x75, 0x86, 0x51, 0x3b, 0x83, 0xf9,
0x79, 0xed, 0x4a, 0x6d, 0x85, 0x0d, 0x7e, 0x47, 0x43, 0xb6, 0x86, 0x4c,
0x82, 0xca, 0x3c, 0xc1, 0x83, 0x8d, 0x4d, 0x13, 0xc4, 0x8b, 0x85, 0x6e,
0x4e, 0x66, 0xbb, 0x79, 0x87, 0x33, 0x4f, 0x88, 0xb3, 0x6b, 0x88, 0x54,
0x50, 0xb0, 0xab, 0xf4, 0x89, 0x05, 0x51, 0xd5, 0xa4, 0xe3, 0x89, 0x79,
0x53, 0x18, 0x9d, 0x69, 0x89, 0x4a, 0x54, 0xa1, 0x95, 0x40, 0x89, 0x29,
0x56, 0x63, 0x8c, 0x88, 0x88, 0xf5, 0x58, 0xb8, 0x82, 0xc8, 0x88, 0xf8,
0x5c, 0xc4, 0x78, 0x00, 0x89, 0x44, 0x60, 0xe0, 0x6d, 0xba, 0x8a, 0x36,
0x64, 0xbe, 0x65, 0x74, 0x8b, 0x3c, 0x68, 0xc1, 0x5d, 0xa7, 0x8c, 0x77,
0x6c, 0xf8, 0x56, 0x75, 0x8e, 0x07, 0x70, 0xd8, 0x4f, 0x51, 0x8e, 0x8c,
0x75, 0xc2, 0x48, 0x5c, 0x8f, 0x63, 0x7b, 0x01, 0x40, 0x4e, 0x8e, 0xde,
0x48, 0x93, 0xc7, 0xe9, 0x90, 0xaa, 0x49, 0x9b, 0xbe, 0xc1, 0x91, 0x9a,
0x4a, 0x61, 0xb8, 0x02, 0x92, 0xa8, 0x4b, 0x40, 0xb1, 0x27, 0x93, 0x09,
0x4b, 0xfd, 0xaa, 0x3c, 0x93, 0x67, 0x4c, 0xca, 0xa3, 0x45, 0x93, 0x80,
0x4d, 0xe2, 0x9b, 0xa0, 0x93, 0x60, 0x4f, 0x48, 0x93, 0x64, 0x93, 0x31,
0x51, 0x08, 0x8a, 0x3e, 0x92, 0xf2, 0x53, 0x1c, 0x80, 0x81, 0x93, 0x2c,
0x57, 0xd4, 0x75, 0x97, 0x93, 0x9e, 0x5c, 0x4c, 0x6b, 0x58, 0x94, 0xa5,
0x60, 0x5f, 0x62, 0x90, 0x95, 0x79, 0x64, 0x96, 0x5b, 0x35, 0x96, 0xb4,
0x68, 0x9b, 0x54, 0x12, 0x98, 0x42, 0x6c, 0xc7, 0x4c, 0xe0, 0x99, 0x80,
0x72, 0x1d, 0x44, 0xbd, 0x97, 0xcc, 0x44, 0x79, 0xcb, 0xb3, 0x9a, 0x37,
0x45, 0xde, 0xc1, 0x0d, 0x9b, 0x0c, 0x46, 0x68, 0xba, 0xe6, 0x9b, 0xd2,
0x46, 0xf8, 0xb4, 0xdd, 0x9c, 0x7d, 0x47, 0x86, 0xae, 0xb7, 0x9c, 0x8d,
0x47, 0xfc, 0xa8, 0x1c, 0x9c, 0xb5, 0x48, 0x7f, 0xa1, 0x7b, 0x9c, 0x89,
0x49, 0x64, 0x99, 0xd6, 0x9c, 0x58, 0x4a, 0x75, 0x91, 0xdf, 0x9c, 0x48,
0x4c, 0xa1, 0x88, 0x02, 0x9c, 0x5b, 0x4f, 0x33, 0x7d, 0xb7, 0x9c, 0xd1,
0x53, 0xbc, 0x73, 0x0a, 0x9d, 0x53, 0x58, 0x87, 0x68, 0xd0, 0x9e, 0x4a,
0x5c, 0xa7, 0x5f, 0xe6, 0x9f, 0x43, 0x60, 0xed, 0x58, 0xb3, 0xa0, 0x92,
0x64, 0xd1, 0x51, 0x87, 0xa2, 0x91, 0x6a, 0x2f, 0x48, 0x85, 0xa0, 0x6f,
0x41, 0x6a, 0xcc, 0x1b, 0xa2, 0x96, 0x42, 0x82, 0xc3, 0x03, 0xa3, 0x8b,
0x42, 0xfd, 0xbc, 0xdd, 0xa4, 0x16, 0x43, 0x50, 0xb7, 0x62, 0xa4, 0xa7,
0x43, 0xa8, 0xb1, 0xe4, 0xa4, 0xcb, 0x44, 0x00, 0xab, 0xdf, 0xa4, 0xbb,
0x44, 0x57, 0xa5, 0x94, 0xa4, 0xb2, 0x44, 0xc1, 0x9f, 0x20, 0xa4, 0x87,
0x45, 0x95, 0x97, 0x98, 0xa4, 0x68, 0x46, 0x7b, 0x90, 0x02, 0xa4, 0x7a,
0x49, 0x28, 0x85, 0xa2, 0xa4, 0xc0, 0x4c, 0x3f, 0x7b, 0x30, 0xa5, 0x5d,
0x4f, 0xef, 0x70, 0x89, 0xa5, 0xda, 0x55, 0x41, 0x66, 0x31, 0xa6, 0xc9,
0x59, 0xae, 0x5d, 0xbb, 0xa7, 0xf1, 0x5d, 0xfa, 0x56, 0x20, 0xa9, 0xeb,
0x62, 0x8f, 0x4d, 0x34, 0xa8, 0x7d, 0x3e, 0xff, 0xcb, 0x7e, 0xa9, 0xdb,
0x3f, 0x7d, 0xc4, 0xb2, 0xaa, 0xea, 0x3f, 0xd8, 0xbe, 0x80, 0xab, 0x67,
0x3f, 0xff, 0xb9, 0x5c, 0xab, 0xe9, 0x40, 0x2c, 0xb4, 0x3e, 0xac, 0x53,
0x40, 0x64, 0xae, 0xfa, 0xac, 0x21, 0x40, 0xb1, 0xa8, 0xef, 0xab, 0xf7,
0x41, 0x05, 0xa2, 0xde, 0xab, 0xdc, 0x41, 0x93, 0x9c, 0x39, 0xab, 0xd0,
0x42, 0x5f, 0x95, 0x03, 0xab, 0xda, 0x43, 0xa6, 0x8d, 0x0d, 0xac, 0x06,
0x45, 0xf3, 0x83, 0x3f, 0xac, 0x73, 0x49, 0x6a, 0x78, 0xf0, 0xad, 0x09,
0x4d, 0x3e, 0x6e, 0x61, 0xad, 0x99, 0x52, 0x73, 0x63, 0xb7, 0xae, 0xd3,
0x56, 0xf9, 0x5b, 0x9b, 0xb0, 0xc5, 0x5c, 0x89, 0x50, 0xf6, 0xb0, 0x31,
0x3c, 0xcd, 0xcc, 0x6e, 0xb1, 0x39, 0x3d, 0x2f, 0xc6, 0x51, 0xb2, 0x52,
0x3d, 0xa1, 0xc0, 0x59, 0xb2, 0xcb, 0x3d, 0xb3, 0xbb, 0x5f, 0xb3, 0x40,
0x3d, 0xc4, 0xb6, 0x70, 0xb3, 0xb4, 0x3d, 0xd4, 0xb1, 0x7f, 0xb3, 0xb5,
0x3d, 0xfc, 0xab, 0xf5, 0xb3, 0x86, 0x3e, 0x30, 0xa6, 0x22, 0xb3, 0x53,
0x3e, 0x69, 0xa0, 0x47, 0xb3, 0x42, 0x3e, 0xf4, 0x99, 0x68, 0xb3, 0x39,
0x3f, 0x8a, 0x92, 0x7e, 0xb3, 0x48, 0x40, 0xed, 0x8a, 0x3a, 0xb3, 0x81,
0x42, 0xf0, 0x81, 0x04, 0xb4, 0x03, 0x46, 0xd4, 0x76, 0xdf, 0xb4, 0x8f,
0x4a, 0xd4, 0x6c, 0x77, 0xb5, 0x0e, 0x4f, 0xd3, 0x61, 0x61, 0xb6, 0xc7,
0x54, 0x81, 0x58, 0x1e, 0xb8, 0x62, 0x3a, 0x23, 0xcd, 0xc5, 0xb9, 0x2f,
0x3a, 0xc4, 0xc8, 0x1f, 0xba, 0x32, 0x3b, 0x81, 0xc2, 0x90, 0xba, 0xc4,
0x3b, 0xc3, 0xbd, 0x75, 0xbb, 0x18, 0x3b, 0xba, 0xb8, 0x99, 0xbb, 0x6b,
0x3b, 0xac, 0xb3, 0xbf, 0xbb, 0xa2, 0x3b, 0xa4, 0xae, 0xc2, 0xbb, 0x82,
0x3b, 0xc5, 0xa9, 0x2c, 0xbb, 0x6d, 0x3b, 0xe4, 0xa3, 0x97, 0xbb, 0x49,
0x3c, 0x20, 0x9d, 0xa1, 0xbb, 0x3c, 0x3c, 0x85, 0x96, 0xea, 0xbb, 0x2a,
0x3c, 0xf4, 0x90, 0x3c, 0xbb, 0x4a, 0x3e, 0x95, 0x87, 0xbc, 0xbb, 0x84,
0x40, 0x70, 0x7e, 0xe5, 0xbc, 0x0d, 0x43, 0xcf, 0x75, 0x60, 0xbc, 0x1c,
0x48, 0x3d, 0x6a, 0xa8, 0xbc, 0xe8, 0x4d, 0x55, 0x5f, 0x36, 0x22, 0xb7,
0xa0, 0xa5, 0x95, 0x0b, 0x24, 0xed, 0xa2, 0x10, 0x8c, 0xce, 0x26, 0x6d,
0xa3, 0xdb, 0x84, 0xe2, 0x27, 0x9d, 0xa5, 0xe4, 0x7c, 0xd7, 0x28, 0x7b,
0xa8, 0x61, 0x74, 0x9a, 0x29, 0x5c, 0xab, 0x07, 0x6c, 0x08, 0x2a, 0x3e,
0xad, 0xe7, 0x63, 0x23, 0x2b, 0xb5, 0xb0, 0x88, 0x5a, 0xd4, 0x2c, 0x8b,
0xb3, 0x0f, 0x52, 0x73, 0x2e, 0x72, 0xb5, 0x1b, 0x4c, 0x0e, 0x30, 0x2d,
0xb7, 0x24, 0x46, 0x2a, 0x33, 0x95, 0xb7, 0xd4, 0x40, 0x72, 0x34, 0x9e,
0xba, 0x19, 0x3c, 0x91, 0x39, 0x44, 0xb9, 0xc9, 0x38, 0xf3, 0x3c, 0xa9,
0xba, 0x29, 0x35, 0x72, 0x3f, 0xa6, 0xba, 0xa7, 0x32, 0x09, 0x42, 0x58,
0xbb, 0x5f, 0x2e, 0x84, 0x2a, 0x24, 0x99, 0xc0, 0x99, 0x27, 0x2c, 0xdc,
0x9a, 0xb0, 0x90, 0x45, 0x2e, 0xa8, 0x9c, 0x45, 0x88, 0x0d, 0x30, 0x4e,
0x9d, 0xcb, 0x7f, 0xd3, 0x31, 0x4d, 0xa0, 0x84, 0x77, 0x59, 0x32, 0x3a,
0xa3, 0x2c, 0x6e, 0xf2, 0x33, 0x74, 0xa5, 0xc3, 0x65, 0x8e, 0x34, 0xda,
0xa8, 0x98, 0x5c, 0xc7, 0x36, 0x57, 0xab, 0x67, 0x54, 0x3f, 0x38, 0x49,
0xad, 0xd3, 0x4c, 0xe5, 0x3a, 0xbf, 0xaf, 0xd2, 0x46, 0x93, 0x3c, 0xfc,
0xb1, 0x72, 0x40, 0x76, 0x3f, 0xdb, 0xb2, 0x9f, 0x3c, 0xf5, 0x42, 0x99,
0xb3, 0xb0, 0x39, 0xb4, 0x45, 0x3c, 0xb4, 0x9e, 0x36, 0x67, 0x47, 0xb9,
0xb5, 0x73, 0x33, 0x04, 0x4a, 0x1e, 0xb6, 0x39, 0x2f, 0x86, 0x30, 0xe9,
0x93, 0x0b, 0x9d, 0xfb, 0x34, 0x1b, 0x93, 0xbd, 0x94, 0x22, 0x36, 0x90,
0x94, 0xe6, 0x8b, 0x86, 0x38, 0x7a, 0x96, 0x93, 0x83, 0x21, 0x39, 0xfc,
0x98, 0xd5, 0x7a, 0xa4, 0x3b, 0x14, 0x9b, 0x73, 0x72, 0x30, 0x3c, 0x43,
0x9e, 0x2d, 0x68, 0xed, 0x3d, 0x7b, 0xa0, 0xc1, 0x5f, 0x58, 0x3f, 0x64,
0xa3, 0xda, 0x57, 0x3b, 0x41, 0x17, 0xa6, 0x8c, 0x4f, 0x2d, 0x43, 0x65,
0xa9, 0x19, 0x49, 0x07, 0x45, 0xa0, 0xab, 0x38, 0x42, 0xa4, 0x48, 0x26,
0xac, 0xe5, 0x3e, 0x2d, 0x4a, 0xc8, 0xae, 0x47, 0x3a, 0xca, 0x4d, 0x54,
0xaf, 0x78, 0x37, 0x69, 0x4f, 0xa8, 0xb0, 0x81, 0x34, 0x05, 0x51, 0xde,
0xb1, 0x85, 0x30, 0x84, 0x38, 0x5b, 0x8c, 0x48, 0xa1, 0x69, 0x3b, 0x93,
0x8c, 0xb3, 0x98, 0x6e, 0x3e, 0xc1, 0x8d, 0x16, 0x8f, 0xbc, 0x40, 0xa7,
0x8e, 0xd6, 0x86, 0xef, 0x42, 0x75, 0x90, 0xcf, 0x7e, 0x2d, 0x44, 0x19,
0x93, 0x36, 0x75, 0xa8, 0x45, 0x87, 0x95, 0xdf, 0x6d, 0x1c, 0x46, 0xd7,
0x98, 0xc4, 0x64, 0x0d, 0x48, 0x4f, 0x9b, 0xdd, 0x5b, 0x5f, 0x4a, 0x19,
0x9e, 0xf4, 0x53, 0x0b, 0x4c, 0x29, 0xa1, 0xee, 0x4c, 0x33, 0x4e, 0x4a,
0xa4, 0x85, 0x46, 0x0f, 0x50, 0x66, 0xa6, 0xb0, 0x3f, 0xf6, 0x52, 0xa3,
0xa8, 0x91, 0x3c, 0x70, 0x54, 0xdd, 0xaa, 0x2c, 0x38, 0xef, 0x57, 0x0b,
0xab, 0x99, 0x35, 0x70, 0x59, 0x51, 0xac, 0xf6, 0x31, 0xab, 0x40, 0x47,
0x85, 0x27, 0xa5, 0xc6, 0x44, 0x09, 0x85, 0x4e, 0x9d, 0x1c, 0x47, 0x4b,
0x85, 0xa7, 0x94, 0xb7, 0x4a, 0x25, 0x86, 0x75, 0x8c, 0x3d, 0x4c, 0x63,
0x87, 0xea, 0x83, 0xa7, 0x4d, 0xf1, 0x8a, 0x4b, 0x7a, 0xb6, 0x4f, 0x33,
0x8c, 0xe4, 0x71, 0x9f, 0x50, 0x72, 0x90, 0x0f, 0x68, 0xa0, 0x51, 0xa4,
0x93, 0x19, 0x5f, 0xf3, 0x53, 0x49, 0x96, 0xa0, 0x58, 0x29, 0x55, 0x02,
0x99, 0xce, 0x50, 0x3e, 0x57, 0x09, 0x9d, 0x20, 0x49, 0xdd, 0x59, 0x2f,
0x9f, 0xfe, 0x43, 0x5d, 0x5b, 0x11, 0xa2, 0x54, 0x3e, 0x6f, 0x5c, 0xf8,
0xa4, 0x59, 0x3a, 0xc6, 0x5e, 0xdb, 0xa6, 0x21, 0x37, 0x1f, 0x60, 0xf5,
0xa7, 0xe1, 0x33, 0x01, 0x49, 0xd9, 0x7d, 0x6b, 0xaa, 0xda, 0x4d, 0xa2,
0x7d, 0x85, 0xa2, 0x48, 0x50, 0xac, 0x7d, 0xf3, 0x99, 0xe8, 0x53, 0x9a,
0x7e, 0x68, 0x91, 0x79, 0x55, 0xf0, 0x7f, 0x82, 0x88, 0xf2, 0x58, 0x17,
0x80, 0x80, 0x80, 0x80, 0x59, 0x3b, 0x83, 0xfa, 0x77, 0x65, 0x5a, 0x59,
0x87, 0x0a, 0x6e, 0x74, 0x5b, 0x87, 0x8a, 0x47, 0x65, 0xc9, 0x5c, 0xdf,
0x8d, 0x86, 0x5d, 0x60, 0x5e, 0x8f, 0x91, 0x2d, 0x55, 0x92, 0x60, 0x31,
0x94, 0xbb, 0x4e, 0x3f, 0x61, 0xda, 0x98, 0x39, 0x47, 0xe1, 0x63, 0xa8,
0x9b, 0x34, 0x41, 0x63, 0x65, 0x7f, 0x9d, 0xc3, 0x3c, 0xf0, 0x67, 0x66,
0xa0, 0x14, 0x38, 0xd7, 0x69, 0x2a, 0xa2, 0x13, 0x34, 0xb0, 0x55, 0x4a,
0x74, 0x96, 0xb0, 0x6d, 0x58, 0xc4, 0x74, 0xef, 0xa7, 0xf5, 0x5c, 0x36,
0x75, 0x4d, 0x9f, 0xbf, 0x5e, 0x8b, 0x76, 0x46, 0x97, 0x2f, 0x60, 0xc7,
0x77, 0x4e, 0x8e, 0x99, 0x62, 0x35, 0x79, 0x03, 0x86, 0x12, 0x63, 0x76,
0x7b, 0x04, 0x7d, 0x64, 0x64, 0x76, 0x7e, 0x1d, 0x74, 0x5b, 0x65, 0xa5,
0x81, 0x6f, 0x6b, 0xa7, 0x66, 0xc8, 0x84, 0xc1, 0x63, 0x2b, 0x68, 0x12,
0x88, 0x5b, 0x5b, 0x0f, 0x69, 0xaa, 0x8b, 0xf4, 0x53, 0x3c, 0x6b, 0x51,
0x8f, 0xa7, 0x4c, 0x4c, 0x6c, 0xb6, 0x93, 0x3e, 0x46, 0x05, 0x6e, 0x3a,
0x96, 0x4d, 0x3f, 0xe5, 0x6f, 0xc7, 0x99, 0x13, 0x3b, 0x4a, 0x71, 0x8d,
0x9b, 0x9f, 0x36, 0x7f, 0x60, 0x91, 0x6b, 0x72, 0xb6, 0x0f, 0x64, 0x1e,
0x6c, 0x36, 0xad, 0x7c, 0x67, 0x5a, 0x6c, 0xe4, 0xa5, 0x4e, 0x69, 0xdf,
0x6d, 0xcb, 0x9c, 0xf5, 0x6b, 0x82, 0x6f, 0x23, 0x94, 0x5e, 0x6c, 0xf1,
0x70, 0xde, 0x8b, 0xbf, 0x6d, 0xfc, 0x72, 0xdd, 0x83, 0x35, 0x6e, 0xbc,
0x75, 0x98, 0x7a, 0x51, 0x6f, 0x9f, 0x78, 0xb3, 0x71, 0x61, 0x70, 0xd1,
0x7c, 0x1b, 0x68, 0xf6, 0x72, 0x56, 0x7f, 0x7a, 0x60, 0xb1, 0x73, 0x6a,
0x83, 0x47, 0x58, 0xe4, 0x74, 0xb9, 0x86, 0xc8, 0x51, 0x23, 0x75, 0xf5,
0x8a, 0xc4, 0x4a, 0x65, 0x77, 0x77, 0x8e, 0x5f, 0x44, 0x18, 0x78, 0xf8,
0x91, 0x95, 0x3e, 0x47, 0x7a, 0x5f, 0x94, 0x96, 0x38, 0xd8, 0x6d, 0x12,
0x62, 0xbe, 0xbb, 0xec, 0x70, 0xaf, 0x63, 0xe3, 0xb2, 0xff, 0x73, 0x4f,
0x64, 0xce, 0xaa, 0xce, 0x75, 0x9d, 0x65, 0xaf, 0xa2, 0xd4, 0x76, 0xe9,
0x67, 0x0a, 0x9a, 0x96, 0x77, 0xe9, 0x68, 0x96, 0x92, 0x31, 0x78, 0x9b,
0x6a, 0xc0, 0x89, 0x56, 0x79, 0x66, 0x6d, 0x04, 0x80, 0x8f, 0x7a, 0x1b,
0x70, 0x6c, 0x77, 0x3f, 0x7a, 0xcf, 0x73, 0xaa, 0x6e, 0x6f, 0x7b, 0xc4,
0x77, 0x1b, 0x66, 0x43, 0x7d, 0x00, 0x7a, 0x99, 0x5e, 0x40, 0x7e, 0x65,
0x7e, 0x40, 0x56, 0xcd, 0x7f, 0xcd, 0x81, 0x99, 0x4f, 0x70, 0x80, 0x9d,
0x85, 0xde, 0x48, 0xa3, 0x81, 0xdc, 0x89, 0x9e, 0x42, 0x2c, 0x83, 0x61,
0x8d, 0x3a, 0x3c, 0x04, 0x79, 0x4b, 0x5a, 0x87, 0xc1, 0x69, 0x7c, 0x3a,
0x5b, 0xd8, 0xb8, 0xa4, 0x7f, 0x23, 0x5d, 0x1a, 0xb0, 0x33, 0x80, 0xc7,
0x5e, 0x1d, 0xa8, 0x71, 0x82, 0x7b, 0x5f, 0x24, 0xa0, 0x8e, 0x82, 0xff,
0x60, 0xd0, 0x98, 0x52, 0x83, 0xa3, 0x62, 0x7e, 0x90, 0x22, 0x83, 0xe1,
0x65, 0x06, 0x86, 0xe9, 0x84, 0x53, 0x67, 0xb2, 0x7d, 0xc3, 0x84, 0xe3,
0x6b, 0x28, 0x74, 0x43, 0x85, 0xda, 0x6e, 0xb8, 0x6b, 0xb8, 0x86, 0xd1,
0x72, 0x36, 0x63, 0xb8, 0x87, 0xe7, 0x75, 0xd4, 0x5c, 0x01, 0x89, 0x3f,
0x79, 0x79, 0x54, 0xa5, 0x8a, 0x8c, 0x7d, 0x52, 0x4d, 0x8a, 0x8b, 0x4f,
0x81, 0xa2, 0x46, 0xb3, 0x8c, 0x31, 0x85, 0xb8, 0x3f, 0xa7, 0x85, 0xa1,
0x52, 0xfb, 0xc6, 0x4a, 0x87, 0xfd, 0x54, 0xaa, 0xbd, 0x14, 0x8a, 0x06,
0x56, 0x03, 0xb5, 0x32, 0x8b, 0xb7, 0x57, 0x42, 0xad, 0x96, 0x8c, 0xc3,
0x58, 0x5e, 0xa6, 0x25, 0x8d, 0xba, 0x59, 0x90, 0x9e, 0x76, 0x8e, 0x16,
0x5b, 0x20, 0x96, 0x62, 0x8e, 0x90, 0x5c, 0xe0, 0x8e, 0x02, 0x8e, 0xcb,
0x5f, 0x94, 0x84, 0x50, 0x8f, 0x00, 0x62, 0xb5, 0x7a, 0xac, 0x8f, 0x65,
0x66, 0x1c, 0x71, 0x15, 0x90, 0x71, 0x69, 0xd3, 0x68, 0xe4, 0x91, 0xa9,
0x6d, 0x6a, 0x61, 0x04, 0x92, 0xff, 0x71, 0x21, 0x59, 0xc2, 0x94, 0x5b,
0x74, 0xa7, 0x52, 0x72, 0x95, 0x3d, 0x79, 0x07, 0x4b, 0x3c, 0x96, 0x1f,
0x7d, 0xbe, 0x43, 0x99, 0x90, 0xf7, 0x4d, 0x98, 0xc9, 0xc4, 0x93, 0x0d,
0x4e, 0x8e, 0xc0, 0x61, 0x94, 0x5d, 0x4f, 0x79, 0xb9, 0x3c, 0x95, 0xd6,
0x50, 0x9d, 0xb2, 0x0f, 0x96, 0xcc, 0x51, 0xce, 0xab, 0x0c, 0x97, 0x98,
0x52, 0xef, 0xa3, 0xf4, 0x98, 0x1c, 0x54, 0x35, 0x9c, 0x67, 0x98, 0x4f,
0x55, 0xae, 0x94, 0x6e, 0x98, 0x84, 0x57, 0x88, 0x8b, 0xc2, 0x98, 0xae,
0x5a, 0x01, 0x82, 0x32, 0x99, 0x12, 0x5d, 0xca, 0x77, 0xea, 0x99, 0x9c,
0x61, 0x85, 0x6e, 0x2b, 0x9a, 0xa1, 0x65, 0x40, 0x66, 0x23, 0x9b, 0xdb,
0x68, 0xdb, 0x5e, 0x7c, 0x9d, 0x6e, 0x6c, 0x82, 0x57, 0x4d, 0x9f, 0x8e,
0x6f, 0xa2, 0x50, 0x02, 0xa0, 0x3c, 0x74, 0xfc, 0x47, 0xf5, 0x9a, 0x39,
0x49, 0x1d, 0xcd, 0x4e, 0x9c, 0x9f, 0x4a, 0x59, 0xc3, 0x75, 0x9e, 0x0c,
0x4b, 0x2d, 0xbc, 0x79, 0x9f, 0x21, 0x4b, 0xeb, 0xb6, 0x1d, 0xa0, 0x3e,
0x4c, 0xb8, 0xaf, 0xac, 0xa0, 0xb6, 0x4d, 0x71, 0xa8, 0xd3, 0xa1, 0x4e,
0x4e, 0x3c, 0xa1, 0xe7, 0xa1, 0x9a, 0x4f, 0x50, 0x9a, 0x3a, 0xa1, 0xd0,
0x50, 0x92, 0x92, 0x4c, 0xa1, 0xdc, 0x52, 0xa2, 0x89, 0x37, 0xa1, 0xfe,
0x55, 0x15, 0x7f, 0xb8, 0xa2, 0x7e, 0x59, 0x4f, 0x75, 0x79, 0xa3, 0x3c,
0x5d, 0x5e, 0x6b, 0xbc, 0xa4, 0x52, 0x61, 0x24, 0x63, 0x52, 0xa5, 0x72,
0x65, 0x13, 0x5b, 0xcd, 0xa7, 0x22, 0x68, 0xec, 0x54, 0x5c, 0xa9, 0x9c,
0x6d, 0x0e, 0x4c, 0x13, 0xa3, 0x09, 0x45, 0xdf, 0xcd, 0xa8, 0xa4, 0xfb,
0x46, 0xd3, 0xc5, 0x8c, 0xa6, 0x7b, 0x47, 0x90, 0xbe, 0xa4, 0xa7, 0x45,
0x48, 0x11, 0xb8, 0xd0, 0xa8, 0x1f, 0x48, 0x9f, 0xb2, 0xf1, 0xa8, 0xac,
0x49, 0x32, 0xac, 0xb6, 0xa8, 0xf0, 0x49, 0xc8, 0xa6, 0x28, 0xa9, 0x47,
0x4a, 0x6f, 0x9f, 0x7a, 0xa9, 0x77, 0x4b, 0x72, 0x97, 0xf5, 0xa9, 0xbf,
0x4c, 0x86, 0x90, 0x65, 0xa9, 0xf7, 0x4e, 0x8e, 0x86, 0xc1, 0xaa, 0x4a,
0x51, 0x1b, 0x7c, 0xef, 0xaa, 0xdb, 0x55, 0x25, 0x72, 0xf3, 0xab, 0xb4,
0x59, 0xb6, 0x69, 0x6b, 0xad, 0x0c, 0x5d, 0x9d, 0x60, 0xc6, 0xae, 0x71,
0x61, 0xd5, 0x58, 0xde, 0xb0, 0x7f, 0x66, 0x39, 0x50, 0x69, 0xab, 0x0f,
0x43, 0x04, 0xce, 0x0a, 0xac, 0x9f, 0x43, 0xb1, 0xc6, 0xff, 0xae, 0x16,
0x44, 0x46, 0xc0, 0x5b, 0xae, 0xcf, 0x44, 0xa0, 0xba, 0xe5, 0xaf, 0x8b,
0x44, 0xff, 0xb5, 0x77, 0xb0, 0x54, 0x45, 0x6a, 0xb0, 0x01, 0xb0, 0x6b,
0x45, 0xeb, 0xa9, 0xc0, 0xb0, 0x90, 0x46, 0x72, 0xa3, 0x72, 0xb0, 0xc6,
0x47, 0x26, 0x9c, 0xbe, 0xb1, 0x0b, 0x48, 0x11, 0x95, 0x90, 0xb1, 0x5a,
0x49, 0x3f, 0x8d, 0xe8, 0xb1, 0x9e, 0x4b, 0x37, 0x84, 0x7d, 0xb2, 0x16,
0x4d, 0xfe, 0x7a, 0xa2, 0xb2, 0xc1, 0x51, 0x31, 0x70, 0x84, 0xb3, 0x9f,
0x56, 0x84, 0x67, 0x08, 0xb5, 0x07, 0x5a, 0xb2, 0x5e, 0x3e, 0xb7, 0x07,
0x5f, 0x4a, 0x54, 0xaf, 0xb2, 0xc1, 0x40, 0x1a, 0xce, 0x71, 0xb4, 0x0c,
0x40, 0xa1, 0xc8, 0x5a, 0xb5, 0x7d, 0x41, 0x54, 0xc2, 0x7c, 0xb6, 0x74,
0x41, 0xc5, 0xbd, 0x1a, 0xb7, 0x1b, 0x42, 0x0b, 0xb7, 0xf2, 0xb7, 0xc4,
0x42, 0x56, 0xb2, 0xbf, 0xb8, 0x26, 0x42, 0xad, 0xad, 0x25, 0xb8, 0x3e,
0x43, 0x15, 0xa7, 0x19, 0xb8, 0x5f, 0x43, 0x82, 0xa1, 0x06, 0xb8, 0x85,
0x44, 0x27, 0x9a, 0x47, 0xb8, 0xb5, 0x44, 0xde, 0x93, 0x5b, 0xb8, 0xed,
0x46, 0x43, 0x8b, 0x5f, 0xb9, 0x29, 0x48, 0x45, 0x82, 0x50, 0xb9, 0xa0,
0x4b, 0x4a, 0x78, 0x98, 0xba, 0x4b, 0x4e, 0xa0, 0x6e, 0x7a, 0xbb, 0x33,
0x53, 0x9b, 0x64, 0x9c, 0xbc, 0xf4, 0x58, 0x04, 0x5a, 0xf5, 0xba, 0xe1,
0x3d, 0x58, 0xcf, 0x7d, 0xbb, 0xe7, 0x3e, 0x07, 0xc9, 0xeb, 0xbd, 0x2b,
0x3e, 0xb8, 0xc4, 0x90, 0xbe, 0x5f, 0x3f, 0x5c, 0xbf, 0x68, 0xbe, 0xe6,
0x3f, 0x7c, 0xba, 0x5b, 0xbf, 0x6e, 0x3f, 0xa1, 0xb5, 0x47, 0xbf, 0xf4,
0x3f, 0xc7, 0xb0, 0x31, 0xc0, 0x25, 0x40, 0x01, 0xaa, 0x68, 0xc0, 0x5c,
0x40, 0x3e, 0xa4, 0x97, 0xc0, 0x6f, 0x40, 0x9e, 0x9e, 0x8c, 0xc0, 0x83,
0x41, 0x16, 0x97, 0xf1, 0xc0, 0x8b, 0x41, 0xa4, 0x91, 0x45, 0xc0, 0xe1,
0x43, 0x41, 0x89, 0x1b, 0xc1, 0x25, 0x45, 0x36, 0x80, 0x6e, 0xc2, 0x2d,
0x47, 0xb3, 0x77, 0x9e, 0xc2, 0x00, 0x4b, 0xf9, 0x6c, 0xae, 0xc2, 0xc0,
0x50, 0xc9, 0x61, 0xd7, 0x2a, 0x65, 0xa6, 0xe7, 0x9a, 0x77, 0x2c, 0x7c,
0xa8, 0x07, 0x91, 0xee, 0x2d, 0xbe, 0xa9, 0xac, 0x89, 0xc5, 0x2e, 0xb0,
0xab, 0x74, 0x81, 0xab, 0x2f, 0x5e, 0xad, 0xd1, 0x79, 0x67, 0x2f, 0xd9,
0xb0, 0x3d, 0x71, 0x27, 0x30, 0x87, 0xb2, 0x9d, 0x68, 0x85, 0x30, 0x64,
0xb5, 0x72, 0x5f, 0xd8, 0x31, 0x30, 0xb7, 0xab, 0x57, 0x84, 0x32, 0x2b,
0xb9, 0x88, 0x4f, 0x88, 0x34, 0x0a, 0xbb, 0x4b, 0x49, 0xcf, 0x37, 0x88,
0xbb, 0x9d, 0x43, 0x9e, 0x38, 0xc9, 0xbd, 0x5b, 0x3e, 0x9a, 0x3d, 0x28,
0xbd, 0x06, 0x3a, 0xdd, 0x40, 0x56, 0xbd, 0x5d, 0x37, 0x50, 0x43, 0x1b,
0xbd, 0xc2, 0x33, 0xe0, 0x45, 0xc7, 0xbe, 0x16, 0x30, 0x52, 0x31, 0x2e,
0xa0, 0x4c, 0x9e, 0x03, 0x33, 0x9f, 0xa1, 0x3a, 0x95, 0x24, 0x35, 0xae,
0xa2, 0x6a, 0x8c, 0xae, 0x37, 0x22, 0xa4, 0x11, 0x84, 0x77, 0x38, 0x3c,
0xa6, 0x2c, 0x7c, 0x3a, 0x39, 0x06, 0xa8, 0xb2, 0x74, 0x01, 0x39, 0xea,
0xab, 0x33, 0x6b, 0x3b, 0x3a, 0xd3, 0xad, 0xb0, 0x61, 0xf0, 0x3b, 0xf4,
0xb0, 0x0b, 0x59, 0x00, 0x3c, 0xc6, 0xb1, 0xf7, 0x50, 0x53, 0x3e, 0xfa,
0xb3, 0xaa, 0x4a, 0x39, 0x41, 0x1b, 0xb5, 0x19, 0x44, 0x06, 0x43, 0x82,
0xb6, 0x34, 0x3f, 0x04, 0x46, 0x45, 0xb7, 0x12, 0x3b, 0xb7, 0x48, 0xe4,
0xb7, 0xd5, 0x38, 0x54, 0x4b, 0x5c, 0xb8, 0x7e, 0x34, 0xe4, 0x4d, 0xb8,
0xb9, 0x11, 0x31, 0x55, 0x37, 0x35, 0x99, 0xce, 0xa2, 0xb5, 0x3a, 0x86,
0x9a, 0x6f, 0x98, 0xba, 0x3d, 0x68, 0x9b, 0x0f, 0x90, 0x09, 0x3f, 0x17,
0x9c, 0xdf, 0x87, 0x8c, 0x40, 0x96, 0x9e, 0xda, 0x7f, 0x0c, 0x41, 0x87,
0xa1, 0x53, 0x76, 0xcb, 0x42, 0x7a, 0xa3, 0xb8, 0x6e, 0x75, 0x43, 0xa0,
0xa6, 0x11, 0x64, 0xfd, 0x44, 0xee, 0xa8, 0x91, 0x5c, 0x24, 0x46, 0x45,
0xaa, 0xee, 0x53, 0x89, 0x48, 0x21, 0xad, 0x1f, 0x4c, 0x6a, 0x4a, 0x5d,
0xae, 0xfa, 0x46, 0x22, 0x4c, 0x88, 0xb0, 0x76, 0x3f, 0xf8, 0x4e, 0xf9,
0xb1, 0x98, 0x3c, 0xb5, 0x51, 0x47, 0xb2, 0x9f, 0x39, 0x5f, 0x53, 0x77,
0xb3, 0x99, 0x35, 0xfd, 0x55, 0xaf, 0xb4, 0x85, 0x32, 0x5b, 0x3d, 0xef,
0x93, 0x72, 0xa5, 0x90, 0x41, 0x5b, 0x93, 0xb0, 0x9c, 0x79, 0x44, 0xbc,
0x94, 0x05, 0x93, 0xd1, 0x47, 0x45, 0x95, 0x29, 0x8b, 0x3b, 0x49, 0x0c,
0x96, 0xfa, 0x82, 0xae, 0x4a, 0x66, 0x99, 0x3c, 0x7a, 0x33, 0x4b, 0x68,
0x9b, 0xad, 0x71, 0xe2, 0x4c, 0x6a, 0x9e, 0x38, 0x68, 0xb5, 0x4d, 0x78,
0xa0, 0x97, 0x5f, 0x3b, 0x4f, 0x5a, 0xa3, 0x77, 0x57, 0x71, 0x50, 0xfe,
0xa5, 0xf8, 0x4f, 0x94, 0x53, 0x14, 0xa8, 0x52, 0x49, 0x73, 0x55, 0x1f,
0xaa, 0x48, 0x43, 0x1c, 0x57, 0x38, 0xab, 0xf5, 0x3e, 0x53, 0x59, 0x62,
0xad, 0x6c, 0x3a, 0xcf, 0x5b, 0x7f, 0xae, 0xbe, 0x37, 0x4b, 0x5d, 0xcd,
0xb0, 0x16, 0x33, 0x41, 0x45, 0x66, 0x8c, 0x8f, 0xa9, 0xe1, 0x49, 0x48,
0x8c, 0x9b, 0xa0, 0xc6, 0x4c, 0xaf, 0x8c, 0xe5, 0x98, 0x2f, 0x4f, 0xf7,
0x8d, 0x45, 0x8f, 0xa0, 0x51, 0xd9, 0x8e, 0xe4, 0x86, 0xf1, 0x53, 0x7f,
0x90, 0xb3, 0x7e, 0x3c, 0x54, 0xd9, 0x92, 0xf8, 0x75, 0xab, 0x56, 0x08,
0x95, 0x7b, 0x6d, 0x32, 0x57, 0x30, 0x98, 0x33, 0x64, 0x5b, 0x58, 0x9c,
0x9b, 0x1f, 0x5b, 0xef, 0x5a, 0x54, 0x9e, 0x26, 0x53, 0xf2, 0x5c, 0x29,
0xa1, 0x04, 0x4c, 0xe3, 0x5e, 0x01, 0xa3, 0x8d, 0x46, 0xc5, 0x5f, 0xd6,
0xa5, 0xb1, 0x40, 0x8c, 0x61, 0xa8, 0xa7, 0x87, 0x3c, 0xbc, 0x63, 0x84,
0xa9, 0x30, 0x38, 0xfc, 0x65, 0x96, 0xaa, 0xd7, 0x34, 0xaf, 0x4e, 0x5f,
0x85, 0x1a, 0xae, 0x5d, 0x52, 0x2f, 0x85, 0x28, 0xa5, 0xad, 0x55, 0xbe,
0x85, 0x46, 0x9d, 0x32, 0x58, 0xf1, 0x85, 0x8a, 0x94, 0xb3, 0x5b, 0x93,
0x86, 0x4c, 0x8c, 0x2d, 0x5d, 0x5f, 0x87, 0xbe, 0x83, 0x99, 0x5e, 0xb3,
0x8a, 0x11, 0x7a, 0xc9, 0x5f, 0xc6, 0x8c, 0xaa, 0x71, 0xe8, 0x60, 0xf4,
0x8f, 0x6b, 0x69, 0x4a, 0x62, 0x39, 0x92, 0x11, 0x60, 0xed, 0x63, 0xce,
0x95, 0x8e, 0x59, 0x25, 0x65, 0x6e, 0x98, 0xc0, 0x51, 0x48, 0x67, 0x0e,
0x9b, 0xee, 0x4a, 0xc3, 0x68, 0xd1, 0x9e, 0xaa, 0x44, 0x78, 0x6a, 0x8c,
0xa0, 0xf4, 0x3e, 0xfe, 0x6c, 0x2c, 0xa3, 0x09, 0x3a, 0xe8, 0x6d, 0xf1,
0xa5, 0x03, 0x36, 0x71, 0x58, 0x3f, 0x7d, 0x1d, 0xb3, 0x80, 0x5c, 0x01,
0x7d, 0x50, 0xaa, 0xbe, 0x5f, 0x96, 0x7d, 0x81, 0xa2, 0x85, 0x62, 0xac,
0x7d, 0xcf, 0x99, 0xfb, 0x65, 0x79, 0x7e, 0x3c, 0x91, 0x62, 0x67, 0x18,
0x7f, 0x6e, 0x88, 0xe8, 0x68, 0x85, 0x80, 0x80, 0x80, 0x80, 0x69, 0xc0,
0x83, 0xd1, 0x77, 0xb6, 0x6a, 0xf0, 0x86, 0xb1, 0x6f, 0x11, 0x6c, 0x20,
0x89, 0xbf, 0x66, 0xa0, 0x6d, 0x60, 0x8c, 0xad, 0x5e, 0x50, 0x6f, 0x11,
0x90, 0x11, 0x56, 0x89, 0x70, 0xa7, 0x93, 0x69, 0x4f, 0x13, 0x71, 0xf6,
0x96, 0xc7, 0x48, 0xe2, 0x73, 0x7b, 0x99, 0x98, 0x42, 0xbb, 0x75, 0x17,
0x9c, 0x20, 0x3d, 0x6c, 0x76, 0xd7, 0x9e, 0x85, 0x38, 0x78, 0x63, 0x7c,
0x73, 0xe4, 0xb8, 0xb1, 0x67, 0x57, 0x74, 0x54, 0xaf, 0xf4, 0x6a, 0xbd,
0x74, 0xb4, 0xa7, 0xb4, 0x6d, 0xe4, 0x75, 0x25, 0x9f, 0x64, 0x70, 0x07,
0x76, 0x39, 0x96, 0xf6, 0x71, 0xf6, 0x77, 0x5d, 0x8e, 0x8a, 0x72, 0xe9,
0x79, 0x0d, 0x86, 0x0f, 0x73, 0xd7, 0x7b, 0x0a, 0x7d, 0x7c, 0x74, 0xee,
0x7e, 0x07, 0x74, 0xb8, 0x76, 0x3f, 0x81, 0x26, 0x6c, 0x43, 0x77, 0x82,
0x84, 0x5c, 0x63, 0xfd, 0x78, 0xbd, 0x87, 0x97, 0x5c, 0x01, 0x7a, 0x1d,
0x8a, 0xe2, 0x54, 0x3b, 0x7b, 0x87, 0x8e, 0x4f, 0x4d, 0x0c, 0x7c, 0xe9,
0x91, 0xbb, 0x46, 0xe2, 0x7e, 0x56, 0x94, 0xa4, 0x40, 0xe1, 0x7f, 0xc3,
0x97, 0x76, 0x3b, 0x2d, 0x6f, 0x9b, 0x6a, 0xfd, 0xbe, 0x7a, 0x73, 0x24,
0x6b, 0xae, 0xb5, 0x7f, 0x76, 0x38, 0x6c, 0x4e, 0xad, 0x0d, 0x78, 0xd4,
0x6c, 0xf8, 0xa4, 0xdb, 0x7a, 0xee, 0x6d, 0xeb, 0x9c, 0x87, 0x7c, 0x79,
0x6f, 0x3c, 0x94, 0x09, 0x7d, 0xbd, 0x71, 0x02, 0x8b, 0x8c, 0x7e, 0x95,
0x73, 0x13, 0x83, 0x36, 0x7f, 0x4c, 0x75, 0xc6, 0x7a, 0x7d, 0x80, 0x36,
0x78, 0xcf, 0x71, 0xb2, 0x81, 0x55, 0x7c, 0x0e, 0x69, 0x80, 0x82, 0xc1,
0x7f, 0x39, 0x61, 0x7a, 0x84, 0x04, 0x82, 0x8a, 0x59, 0xe8, 0x85, 0x57,
0x85, 0xbf, 0x52, 0x4b, 0x86, 0x65, 0x89, 0x74, 0x4b, 0x53, 0x87, 0x93,
0x8d, 0x0d, 0x44, 0xf4, 0x89, 0x0b, 0x90, 0x7b, 0x3e, 0x99, 0x7b, 0x50,
0x61, 0xa0, 0xc3, 0x98, 0x7e, 0xab, 0x62, 0xf7, 0xba, 0xc6, 0x81, 0xc7,
0x64, 0x2a, 0xb2, 0x71, 0x84, 0x12, 0x65, 0x34, 0xaa, 0x5e, 0x86, 0x0f,
0x66, 0x27, 0xa2, 0x4e, 0x87, 0x44, 0x67, 0x83, 0x9a, 0x21, 0x88, 0x58,
0x68, 0xf4, 0x91, 0xe7, 0x89, 0x13, 0x6b, 0x1c, 0x89, 0x2f, 0x89, 0xe2,
0x6d, 0x61, 0x80, 0x93, 0x8a, 0xaa, 0x70, 0x99, 0x77, 0x83, 0x8b, 0x66,
0x73, 0xb7, 0x6e, 0xda, 0x8c, 0x70, 0x76, 0xff, 0x66, 0xf0, 0x8d, 0xc6,
0x7a, 0x20, 0x5f, 0x2c, 0x8f, 0x3a, 0x7d, 0xa4, 0x57, 0xe8, 0x90, 0xc9,
0x81, 0x05, 0x50, 0x8c, 0x91, 0x4c, 0x85, 0x08, 0x49, 0x80, 0x92, 0x2c,
0x88, 0xe0, 0x42, 0x86, 0x87, 0x97, 0x59, 0xf9, 0xc8, 0xbb, 0x8a, 0x93,
0x5b, 0x53, 0xbe, 0xfb, 0x8c, 0xeb, 0x5c, 0x93, 0xb7, 0x25, 0x8f, 0x30,
0x5d, 0xcb, 0xaf, 0x77, 0x90, 0x95, 0x5e, 0xdc, 0xa7, 0x8e, 0x91, 0xff,
0x5f, 0xf1, 0x9f, 0x7c, 0x92, 0xc0, 0x61, 0x85, 0x97, 0xac, 0x93, 0x9d,
0x63, 0x0a, 0x8f, 0xc9, 0x93, 0xf6, 0x65, 0x91, 0x86, 0xb3, 0x94, 0x7e,
0x68, 0x30, 0x7d, 0xbe, 0x95, 0x2f, 0x6b, 0x77, 0x74, 0x86, 0x96, 0x49,
0x6e, 0xce, 0x6c, 0x2c, 0x97, 0x6f, 0x72, 0x15, 0x64, 0x6c, 0x98, 0xb7,
0x75, 0x5a, 0x5c, 0xdc, 0x9a, 0x39, 0x78, 0xd4, 0x55, 0x7c, 0x9b, 0xad,
0x7c, 0x8d, 0x4e, 0x23, 0x9c, 0x9d, 0x80, 0xea, 0x46, 0x8f, 0x93, 0x00,
0x53, 0x1f, 0xcc, 0x91, 0x95, 0x86, 0x54, 0x7e, 0xc2, 0xea, 0x97, 0x6c,
0x55, 0xc0, 0xbb, 0x48, 0x99, 0x3a, 0x57, 0x02, 0xb4, 0x01, 0x9a, 0xb1,
0x58, 0x2a, 0xac, 0xac, 0x9b, 0xbd, 0x59, 0x3e, 0xa5, 0x35, 0x9c, 0xa9,
0x5a, 0x70, 0x9d, 0x88, 0x9d, 0x42, 0x5b, 0xe4, 0x95, 0xa9, 0x9d, 0xec,
0x5d, 0xa3, 0x8d, 0x6a, 0x9e, 0x6b, 0x60, 0x3f, 0x84, 0x1a, 0x9e, 0xc7,
0x63, 0x4a, 0x7a, 0xc9, 0x9f, 0x70, 0x66, 0x98, 0x71, 0x77, 0xa0, 0x86,
0x6a, 0x0d, 0x69, 0x7e, 0xa1, 0xe3, 0x6d, 0x4d, 0x61, 0xe4, 0xa3, 0xac,
0x70, 0xac, 0x5a, 0x72, 0xa5, 0x44, 0x74, 0x3c, 0x52, 0xc7, 0xa6, 0x75,
0x78, 0xa2, 0x4a, 0xc6, 0x9c, 0xb5, 0x4d, 0x48, 0xcf, 0xb6, 0x9f, 0x1d,
0x4e, 0x79, 0xc6, 0x53, 0xa1, 0x04, 0x4f, 0x9f, 0xbe, 0x77, 0xa2, 0x62,
0x50, 0xbf, 0xb7, 0xbc, 0xa3, 0xd9, 0x52, 0x10, 0xb0, 0xe9, 0xa4, 0xb5,
0x53, 0x23, 0xa9, 0xe5, 0xa5, 0x88, 0x54, 0x2d, 0xa2, 0xc3, 0xa6, 0x15,
0x55, 0x6b, 0x9b, 0x3d, 0xa6, 0x89, 0x56, 0xcc, 0x93, 0x83, 0xa6, 0xf1,
0x58, 0xb8, 0x8a, 0xe8, 0xa7, 0x63, 0x5b, 0x1d, 0x81, 0xad, 0xa8, 0x1a,
0x5e, 0x9f, 0x77, 0xd6, 0xa8, 0xe5, 0x62, 0x2c, 0x6e, 0x8e, 0xaa, 0x03,
0x65, 0xc8, 0x66, 0xb6, 0xab, 0x74, 0x69, 0x3b, 0x5f, 0x0c, 0xad, 0xad,
0x6c, 0xf9, 0x57, 0x62, 0xb0, 0x9a, 0x70, 0x89, 0x4f, 0x43, 0xa5, 0x67,
0x49, 0xef, 0xd0, 0xc3, 0xa7, 0x9c, 0x4b, 0x06, 0xc8, 0x35, 0xa9, 0x89,
0x4b, 0xdc, 0xc0, 0xe2, 0xaa, 0xb3, 0x4c, 0x8f, 0xba, 0x96, 0xab, 0xda,
0x4d, 0x51, 0xb4, 0x52, 0xac, 0xdd, 0x4e, 0x19, 0xad, 0xd2, 0xad, 0x7a,
0x4e, 0xd6, 0xa7, 0x05, 0xae, 0x32, 0x4f, 0x9e, 0xa0, 0x25, 0xae, 0xa4,
0x50, 0xd4, 0x98, 0xbc, 0xaf, 0x19, 0x52, 0x2a, 0x91, 0x53, 0xaf, 0x65,
0x54, 0x3e, 0x88, 0x55, 0xaf, 0xd4, 0x56, 0x9a, 0x7f, 0x22, 0xb0, 0x96,
0x5a, 0x58, 0x75, 0x5e, 0xb1, 0xb5, 0x5e, 0x35, 0x6c, 0x11, 0xb3, 0x0e,
0x61, 0xdd, 0x63, 0xd2, 0xb4, 0x7b, 0x65, 0xc7, 0x5b, 0xe9, 0xb6, 0x8f,
0x69, 0xf8, 0x53, 0x58, 0xad, 0xa8, 0x47, 0x1f, 0xd1, 0x2a, 0xaf, 0x99,
0x47, 0xee, 0xc9, 0x83, 0xb1, 0x46, 0x48, 0x89, 0xc2, 0xe9, 0xb2, 0x89,
0x49, 0x21, 0xbc, 0xdf, 0xb3, 0x7b, 0x49, 0xb4, 0xb7, 0x20, 0xb4, 0x73,
0x4a, 0x4e, 0xb1, 0x4d, 0xb4, 0xfb, 0x4a, 0xec, 0xaa, 0xfd, 0xb5, 0x71,
0x4b, 0x90, 0xa4, 0x83, 0xb5, 0xee, 0x4c, 0x4d, 0x9d, 0xcb, 0xb6, 0x5f,
0x4d, 0x3d, 0x96, 0x95, 0xb6, 0xdc, 0x4e, 0x4d, 0x8f, 0x2a, 0xb7, 0x1f,
0x50, 0x4a, 0x85, 0xed, 0xb7, 0x84, 0x52, 0xff, 0x7c, 0xad, 0xb8, 0x63,
0x56, 0x8c, 0x73, 0x14, 0xb9, 0x93, 0x5a, 0xbf, 0x69, 0xc9, 0xbb, 0x36,
0x5e, 0x7b, 0x60, 0xf0, 0xbd, 0x43, 0x62, 0xfe, 0x57, 0x88, 0xb5, 0xb8,
0x44, 0x17, 0xd0, 0xe6, 0xb7, 0x50, 0x44, 0xd3, 0xca, 0xc1, 0xb8, 0xe2,
0x45, 0x8a, 0xc4, 0xe0, 0xba, 0x5a, 0x46, 0x40, 0xbf, 0x2c, 0xbb, 0x1b,
0x46, 0xa6, 0xb9, 0xb4, 0xbb, 0xe2, 0x47, 0x12, 0xb4, 0x32, 0xbc, 0x90,
0x47, 0x83, 0xae, 0x82, 0xbc, 0xec, 0x48, 0x07, 0xa8, 0x50, 0xbd, 0x54,
0x48, 0x90, 0xa2, 0x19, 0xbd, 0xb0, 0x49, 0x39, 0x9b, 0x64, 0xbe, 0x0d,
0x49, 0xf8, 0x94, 0x68, 0xbe, 0x64, 0x4b, 0x32, 0x8c, 0xb5, 0xbe, 0x9c,
0x4d, 0x36, 0x83, 0xc9, 0xbf, 0x1b, 0x4f, 0xc5, 0x7a, 0x5a, 0xc0, 0x09,
0x52, 0xfa, 0x70, 0xcc, 0xc1, 0x45, 0x57, 0x9c, 0x67, 0x5c, 0xc3, 0x10,
0x5b, 0xcc, 0x5d, 0x8b, 0xbc, 0xfd, 0x40, 0x8b, 0xd1, 0x59, 0xbe, 0xb4,
0x41, 0x88, 0xcb, 0xc6, 0xc0, 0x53, 0x42, 0x6b, 0xc6, 0x90, 0xc2, 0x0d,
0x42, 0xfe, 0xc1, 0x99, 0xc3, 0x04, 0x43, 0x28, 0xbc, 0x7a, 0xc3, 0xaf,
0x43, 0x53, 0xb7, 0x36, 0xc4, 0x5a, 0x43, 0x84, 0xb1, 0xe8, 0xc4, 0xd7,
0x43, 0xd0, 0xac, 0x2f, 0xc5, 0x7c, 0x44, 0x07, 0xa6, 0x59, 0xc5, 0x97,
0x44, 0xa2, 0xa0, 0x30, 0xc5, 0xe9, 0x45, 0x39, 0x99, 0x6d, 0xc6, 0x3c,
0x45, 0xe2, 0x92, 0x91, 0xc6, 0xef, 0x47, 0x07, 0x8b, 0x00, 0xc7, 0x3d,
0x48, 0xf4, 0x82, 0x7c, 0xc8, 0x04, 0x4b, 0xad, 0x79, 0x82, 0xc8, 0x04,
0x4f, 0x9a, 0x6e, 0x9a, 0xc8, 0xe0, 0x54, 0xa2, 0x64, 0x07, 0x33, 0x1d,
0xac, 0xac, 0x9f, 0x79, 0x34, 0x89, 0xae, 0x09, 0x96, 0xf6, 0x35, 0xa3,
0xaf, 0x88, 0x8e, 0xa2, 0x36, 0x4b, 0xb1, 0x53, 0x86, 0x87, 0x36, 0x99,
0xb3, 0x3d, 0x7e, 0x6b, 0x36, 0xed, 0xb5, 0x62, 0x76, 0x58, 0x37, 0x2e,
0xb7, 0x79, 0x6e, 0x24, 0x37, 0x69, 0xb9, 0xd6, 0x65, 0x8b, 0x37, 0x24,
0xbc, 0x5c, 0x5d, 0x06, 0x37, 0xfe, 0xbd, 0xb2, 0x54, 0x84, 0x39, 0x42,
0xbf, 0x04, 0x4d, 0x46, 0x3b, 0xc6, 0xbf, 0xa8, 0x47, 0x13, 0x3d, 0xd8,
0xc0, 0x46, 0x40, 0x91, 0x40, 0x67, 0xc0, 0xd7, 0x3c, 0xbc, 0x43, 0xcf,
0xc0, 0xce, 0x39, 0x54, 0x46, 0x95, 0xc1, 0x01, 0x35, 0xd3, 0x49, 0x26,
0xc1, 0x38, 0x32, 0x2b, 0x38, 0xe6, 0xa6, 0x9b, 0xa2, 0xde, 0x3b, 0x4f,
0xa7, 0x66, 0x9a, 0x0b, 0x3d, 0x52, 0xa8, 0x66, 0x91, 0x9d, 0x3e, 0x9e,
0xaa, 0x0c, 0x89, 0x51, 0x3f, 0x8b, 0xab, 0xdc, 0x81, 0x08, 0x40, 0x46,
0xae, 0x42, 0x78, 0xda, 0x40, 0xcf, 0xb0, 0xac, 0x70, 0xb9, 0x41, 0x51,
0xb2, 0xd3, 0x67, 0xaa, 0x41, 0xc2, 0xb4, 0xf2, 0x5e, 0xd5, 0x42, 0x5a,
0xb6, 0x96, 0x56, 0x1b, 0x43, 0x65, 0xb8, 0x09, 0x4e, 0x44, 0x45, 0x8c,
0xb9, 0x20, 0x48, 0x47, 0x47, 0x94, 0xb9, 0xf3, 0x41, 0xf4, 0x4a, 0x21,
0xba, 0x99, 0x3d, 0xe3, 0x4c, 0xba, 0xbb, 0x21, 0x3a, 0x6b, 0x4f, 0x2a,
0xbb, 0x9d, 0x36, 0xe3, 0x51, 0x71, 0xbc, 0x24, 0x33, 0x40, 0x3e, 0x1b,
0xa0, 0xd1, 0xa6, 0x63, 0x41, 0x38, 0xa1, 0x1b, 0x9d, 0x0b, 0x44, 0x05,
0xa1, 0xb6, 0x94, 0x7d, 0x46, 0x2a, 0xa2, 0xea, 0x8c, 0x0a, 0x47, 0x7d,
0xa4, 0xc5, 0x83, 0xa6, 0x48, 0x74, 0xa6, 0xec, 0x7b, 0x64, 0x49, 0x28,
0xa9, 0x5d, 0x73, 0x47, 0x49, 0xf8, 0xab, 0xbc, 0x6a, 0x73, 0x4a, 0xda,
0xad, 0xf9, 0x61, 0x3c, 0x4b, 0xee, 0xaf, 0xfc, 0x58, 0x86, 0x4c, 0xdf,
0xb1, 0x9b, 0x50, 0x23, 0x4e, 0xf9, 0xb3, 0x00, 0x4a, 0x27, 0x50, 0xf6,
0xb4, 0x1c, 0x43, 0xfe, 0x52, 0xf6, 0xb5, 0x14, 0x3e, 0xff, 0x55, 0x30,
0xb6, 0x00, 0x3b, 0x9a, 0x57, 0x54, 0xb6, 0xe0, 0x38, 0x1a, 0x59, 0x83,
0xb7, 0xa7, 0x34, 0x63, 0x44, 0x7d, 0x9a, 0x6d, 0xaa, 0x39, 0x48, 0x13,
0x9a, 0x67, 0xa0, 0x9c, 0x4b, 0x2d, 0x9a, 0xd2, 0x97, 0xfa, 0x4e, 0x26,
0x9b, 0x59, 0x8f, 0x6e, 0x4f, 0x97, 0x9d, 0x5b, 0x86, 0xd4, 0x50, 0xbc,
0x9f, 0x82, 0x7e, 0x4a, 0x51, 0xa5, 0xa1, 0xb6, 0x76, 0x3c, 0x52, 0x83,
0xa3, 0xf6, 0x6d, 0xf6, 0x53, 0x99, 0xa6, 0x11, 0x64, 0xb2, 0x54, 0xe5,
0xa8, 0x5d, 0x5c, 0x2e, 0x56, 0x37, 0xaa, 0xa1, 0x54, 0x02, 0x57, 0xd4,
0xac, 0x9d, 0x4c, 0xd7, 0x59, 0xd0, 0xae, 0x4b, 0x46, 0x95, 0x5b, 0xc3,
0xaf, 0xaf, 0x40, 0x4b, 0x5d, 0xc2, 0xb0, 0xe7, 0x3c, 0xcf, 0x5f, 0xa9,
0xb2, 0x01, 0x39, 0x59, 0x61, 0xb9, 0xb3, 0x11, 0x35, 0x61, 0x4b, 0x40,
0x93, 0xd1, 0xae, 0x07, 0x4f, 0x0f, 0x93, 0xce, 0xa4, 0xbb, 0x52, 0xac,
0x93, 0xd3, 0x9b, 0xf8, 0x55, 0xfc, 0x94, 0x0a, 0x93, 0x72, 0x58, 0x3f,
0x95, 0x26, 0x8a, 0xe8, 0x59, 0xaa, 0x96, 0xe6, 0x82, 0x55, 0x5a, 0xc4,
0x99, 0x13, 0x79, 0xef, 0x5b, 0xa4, 0x9b, 0x6a, 0x71, 0xc3, 0x5c, 0xb8,
0x9d, 0xc4, 0x68, 0xe6, 0x5d, 0xe2, 0x9f, 0xf0, 0x5f, 0xaf, 0x5f, 0x9b,
0xa2, 0xc8, 0x58, 0x1a, 0x61, 0x03, 0xa5, 0x42, 0x50, 0x4d, 0x62, 0xbf,
0xa7, 0x7f, 0x4a, 0x2b, 0x64, 0x7b, 0xa9, 0x58, 0x44, 0x0a, 0x66, 0x3a,
0xaa, 0xf1, 0x3e, 0xd2, 0x68, 0x0e, 0xac, 0x7a, 0x3a, 0xf4, 0x6a, 0x10,
0xad, 0xfb, 0x36, 0x96, 0x53, 0x37, 0x8c, 0xcf, 0xb2, 0x20, 0x57, 0x44,
0x8c, 0x94, 0xa9, 0x33, 0x5b, 0x16, 0x8c, 0x65, 0xa0, 0x9d, 0x5e, 0x67,
0x8c, 0x92, 0x98, 0x12, 0x61, 0x75, 0x8c, 0xe1, 0x8f, 0x83, 0x62, 0xd3,
0x8e, 0x8d, 0x86, 0xc9, 0x64, 0x10, 0x90, 0x71, 0x7e, 0x0c, 0x65, 0x39,
0x92, 0xaf, 0x75, 0xbd, 0x66, 0x52, 0x95, 0x08, 0x6d, 0x83, 0x67, 0x87,
0x97, 0x85, 0x64, 0xff, 0x68, 0xdc, 0x9a, 0x41, 0x5c, 0xa9, 0x6a, 0x75,
0x9d, 0x43, 0x54, 0xc1, 0x6c, 0x11, 0xa0, 0x0a, 0x4d, 0x85, 0x6d, 0xa5,
0xa2, 0x61, 0x47, 0xb5, 0x6f, 0x37, 0xa4, 0x5a, 0x41, 0xc9, 0x70, 0xcc,
0xa6, 0x40, 0x3d, 0x27, 0x72, 0x91, 0xa8, 0x2e, 0x38, 0x74, 0x5c, 0xaf,
0x85, 0x0d, 0xb6, 0xf5, 0x60, 0xa3, 0x85, 0x01, 0xad, 0xf7, 0x64, 0x59,
0x84, 0xdd, 0xa5, 0x92, 0x67, 0xbf, 0x84, 0xe0, 0x9d, 0x17, 0x6a, 0x94,
0x85, 0x41, 0x94, 0x8f, 0x6c, 0x99, 0x86, 0x30, 0x8c, 0x11, 0x6d, 0xcd,
0x87, 0xb7, 0x83, 0x86, 0x6e, 0xfb, 0x89, 0xfc, 0x7a, 0xf1, 0x70, 0x20,
0x8c, 0x62, 0x72, 0x74, 0x71, 0x49, 0x8e, 0xf4, 0x6a, 0x03, 0x72, 0x78,
0x91, 0x7c, 0x61, 0xa9, 0x73, 0xfb, 0x94, 0xa9, 0x59, 0xe6, 0x75, 0x81,
0x97, 0xb6, 0x52, 0x24, 0x76, 0xf1, 0x9a, 0xaa, 0x4b, 0xa9, 0x78, 0x85,
0x9d, 0x32, 0x45, 0xa5, 0x7a, 0x3c, 0x9f, 0x5a, 0x3f, 0xc0, 0x7b, 0xcf,
0xa1, 0xaa, 0x3a, 0xa3, 0x66, 0xe1, 0x7c, 0xb4, 0xbb, 0xde, 0x6a, 0xdc,
0x7c, 0xc0, 0xb2, 0xf9, 0x6e, 0x7d, 0x7c, 0xc7, 0xaa, 0x84, 0x71, 0xce,
0x7c, 0xe7, 0xa2, 0x12, 0x74, 0x68, 0x7d, 0x7c, 0x99, 0xa9, 0x76, 0xc3,
0x7e, 0x2c, 0x91, 0x45, 0x77, 0xd4, 0x7f, 0x6a, 0x88, 0xdd, 0x78, 0xb9,
0x80, 0x80, 0x80, 0x80, 0x7a, 0x0e, 0x83, 0xb4, 0x77, 0xeb, 0x7b, 0x55,
0x86, 0x74, 0x6f, 0x76, 0x7c, 0x9f, 0x89, 0x63, 0x67, 0x3c, 0x7d, 0xef,
0x8c, 0x15, 0x5f, 0x0e, 0x7f, 0x57, 0x8f, 0x2f, 0x57, 0x39, 0x80, 0xab,
0x92, 0x35, 0x4f, 0xa1, 0x81, 0xec, 0x95, 0x6c, 0x49, 0xb3, 0x83, 0x4e,
0x98, 0x33, 0x43, 0xc8, 0x84, 0xda, 0x9a, 0xe1, 0x3d, 0xb0, 0x72, 0x72,
0x73, 0x7e, 0xc0, 0xf9, 0x76, 0x23, 0x73, 0xd4, 0xb8, 0x33, 0x79, 0x9a,
0x74, 0x0e, 0xaf, 0xba, 0x7c, 0x87, 0x74, 0x89, 0xa7, 0x65, 0x7f, 0x45,
0x75, 0x13, 0x9f, 0x07, 0x81, 0x14, 0x76, 0x31, 0x96, 0xab, 0x82, 0xaa,
0x77, 0x68, 0x8e, 0x52, 0x83, 0x64, 0x79, 0x27, 0x86, 0x00, 0x84, 0x25,
0x7b, 0x21, 0x7d, 0x90, 0x85, 0x3c, 0x7e, 0x0e, 0x74, 0xee, 0x86, 0x88,
0x81, 0x06, 0x6c, 0xab, 0x87, 0xdb, 0x83, 0xfa, 0x64, 0xb3, 0x89, 0x2a,
0x86, 0xe5, 0x5c, 0xe0, 0x8a, 0xa2, 0x89, 0xf5, 0x55, 0x37, 0x8c, 0x16,
0x8d, 0x17, 0x4d, 0xe4, 0x8d, 0x23, 0x90, 0x8c, 0x47, 0xa7, 0x8e, 0x19,
0x93, 0xf7, 0x41, 0x3f, 0x7d, 0xfc, 0x6a, 0x6b, 0xc6, 0x07, 0x81, 0x80,
0x6b, 0x45, 0xbd, 0x3d, 0x84, 0xab, 0x6b, 0xde, 0xb4, 0xe5, 0x87, 0x6b,
0x6c, 0x7f, 0xac, 0xa0, 0x89, 0xb1, 0x6d, 0x33, 0xa4, 0x5a, 0x8b, 0x81,
0x6e, 0x2c, 0x9c, 0x0c, 0x8c, 0xf5, 0x6f, 0x62, 0x93, 0xc0, 0x8e, 0x1c,
0x71, 0x27, 0x8b, 0x6c, 0x8e, 0xe6, 0x73, 0x3f, 0x83, 0x34, 0x8f, 0x9c,
0x75, 0xde, 0x7a, 0xa8, 0x90, 0x83, 0x78, 0xcf, 0x72, 0x0d, 0x91, 0xb9,
0x7b, 0xd4, 0x6a, 0x19, 0x93, 0x3c, 0x7e, 0xb2, 0x62, 0x64, 0x94, 0x9b,
0x81, 0xed, 0x5a, 0xdc, 0x95, 0xfe, 0x85, 0x24, 0x53, 0x4e, 0x97, 0x17,
0x88, 0x91, 0x4c, 0x20, 0x98, 0x22, 0x8c, 0x2a, 0x45, 0x2d, 0x89, 0xd2,
0x61, 0x28, 0xca, 0xd1, 0x8d, 0x5a, 0x62, 0x6d, 0xc1, 0x4d, 0x90, 0x0e,
0x63, 0xad, 0xb9, 0x68, 0x92, 0x88, 0x64, 0xbe, 0xb1, 0xa7, 0x94, 0x58,
0x65, 0xb9, 0xa9, 0x9e, 0x95, 0xff, 0x66, 0xac, 0xa1, 0x85, 0x97, 0x1c,
0x68, 0x03, 0x99, 0x8a, 0x98, 0x2f, 0x69, 0x65, 0x91, 0x87, 0x98, 0xe3,
0x6b, 0x8c, 0x88, 0xf2, 0x99, 0xa8, 0x6d, 0xc1, 0x80, 0x7c, 0x9a, 0x93,
0x70, 0xce, 0x77, 0xa9, 0x9b, 0x81, 0x73, 0xbb, 0x6f, 0x38, 0x9c, 0xb4,
0x76, 0xcb, 0x67, 0x90, 0x9e, 0x30, 0x79, 0xaf, 0x5f, 0xed, 0x9f, 0xd3,
0x7d, 0x24, 0x58, 0x81, 0xa1, 0x6a, 0x80, 0x9a, 0x51, 0x07, 0xa2, 0x4b,
0x84, 0x6d, 0x49, 0x5c, 0x95, 0x72, 0x59, 0xf1, 0xcf, 0x09, 0x98, 0x39,
0x5b, 0x09, 0xc5, 0xd6, 0x9a, 0xb5, 0x5c, 0x17, 0xbd, 0xb6, 0x9c, 0xd5,
0x5d, 0x35, 0xb6, 0x2c, 0x9e, 0xd6, 0x5e, 0x47, 0xae, 0x78, 0xa0, 0x1a,
0x5f, 0x55, 0xa6, 0xa6, 0xa1, 0x3e, 0x60, 0x80, 0x9e, 0xc5, 0xa1, 0xff,
0x62, 0x0e, 0x97, 0x15, 0xa2, 0xc5, 0x63, 0xa4, 0x8f, 0x3a, 0xa3, 0x34,
0x66, 0x1b, 0x86, 0x69, 0xa3, 0xcf, 0x68, 0xa9, 0x7d, 0xac, 0xa4, 0xbc,
0x6b, 0xd3, 0x74, 0xbb, 0xa6, 0x08, 0x6e, 0xf0, 0x6c, 0x98, 0xa7, 0x54,
0x72, 0x09, 0x65, 0x04, 0xa8, 0xc9, 0x75, 0x36, 0x5d, 0x5a, 0xaa, 0x65,
0x78, 0xc5, 0x55, 0x9f, 0xab, 0xed, 0x7c, 0x94, 0x4d, 0xa7, 0x9f, 0x73,
0x51, 0xe8, 0xd2, 0x24, 0xa1, 0xe6, 0x54, 0x17, 0xc9, 0x42, 0xa4, 0x45,
0x55, 0xb5, 0xc1, 0x10, 0xa5, 0xfb, 0x56, 0xf3, 0xb9, 0xe1, 0xa7, 0x9a,
0x58, 0x19, 0xb2, 0xbe, 0xa8, 0xd4, 0x59, 0x23, 0xab, 0x77, 0xa9, 0xdf,
0x5a, 0x25, 0xa4, 0x0e, 0xaa, 0xc2, 0x5b, 0x51, 0x9c, 0x7b, 0xab, 0x7a,
0x5c, 0xb2, 0x94, 0xc6, 0xac, 0x35, 0x5e, 0x6f, 0x8c, 0x86, 0xac, 0xe4,
0x60, 0xc3, 0x83, 0x9b, 0xad, 0x6f, 0x63, 0xd0, 0x7a, 0xa6, 0xae, 0x53,
0x67, 0x1f, 0x71, 0xbd, 0xaf, 0xa8, 0x6a, 0x7a, 0x69, 0xe5, 0xb1, 0x43,
0x6d, 0xa8, 0x62, 0x48, 0xb3, 0x4e, 0x71, 0x1e, 0x5a, 0x6a, 0xb4, 0xe3,
0x74, 0xf9, 0x51, 0xf8, 0xa8, 0x15, 0x4e, 0x25, 0xd3, 0x3b, 0xaa, 0x6d,
0x4f, 0x26, 0xcb, 0x08, 0xac, 0x96, 0x4f, 0xf8, 0xc3, 0xaa, 0xae, 0x6f,
0x51, 0x0f, 0xbc, 0xc5, 0xaf, 0xd8, 0x52, 0x4b, 0xb6, 0x23, 0xb1, 0x25,
0x53, 0x7a, 0xaf, 0x6e, 0xb1, 0xeb, 0x54, 0x7b, 0xa8, 0x7e, 0xb2, 0xc3,
0x55, 0x79, 0xa1, 0x7c, 0xb3, 0x64, 0x56, 0xb7, 0x9a, 0x24, 0xb3, 0xfe,
0x58, 0x09, 0x92, 0xae, 0xb4, 0x84, 0x59, 0xf5, 0x8a, 0x31, 0xb5, 0x1c,
0x5c, 0x2f, 0x81, 0x46, 0xb6, 0x22, 0x5f, 0x74, 0x77, 0xca, 0xb7, 0x29,
0x62, 0xd8, 0x6e, 0xf3, 0xb8, 0x86, 0x66, 0x64, 0x67, 0x02, 0xba, 0x3f,
0x69, 0xb9, 0x5f, 0x26, 0xbc, 0x4f, 0x6d, 0xd6, 0x56, 0x6e, 0xb0, 0x77,
0x4b, 0x36, 0xd3, 0xcc, 0xb2, 0xbc, 0x4c, 0x17, 0xcc, 0x29, 0xb4, 0x9a,
0x4c, 0xc1, 0xc5, 0x88, 0xb6, 0x58, 0x4d, 0x72, 0xbf, 0x1b, 0xb7, 0x6b,
0x4e, 0x27, 0xb9, 0x07, 0xb8, 0x89, 0x4e, 0xe4, 0xb2, 0xde, 0xb9, 0x6a,
0x4f, 0xa0, 0xac, 0x76, 0xba, 0x22, 0x50, 0x68, 0xa5, 0xdd, 0xba, 0xe2,
0x51, 0x5a, 0x9f, 0x2a, 0xbb, 0x6e, 0x52, 0x83, 0x97, 0xeb, 0xbc, 0x03,
0x53, 0xb3, 0x90, 0xa3, 0xbc, 0x58, 0x55, 0xe5, 0x87, 0xe2, 0xbc, 0xd9,
0x58, 0x42, 0x7e, 0xf8, 0xbe, 0x06, 0x5b, 0x8e, 0x75, 0x8a, 0xbf, 0x87,
0x5f, 0x0a, 0x6c, 0x51, 0xc1, 0x0e, 0x62, 0xae, 0x63, 0xe1, 0xc3, 0x07,
0x67, 0x3f, 0x5a, 0x11, 0xb8, 0xb3, 0x47, 0xf9, 0xd3, 0xba, 0xba, 0xae,
0x48, 0xef, 0xcd, 0x1a, 0xbc, 0x5f, 0x49, 0xae, 0xc7, 0x27, 0xbe, 0x12,
0x4a, 0x73, 0xc1, 0x52, 0xbf, 0x1b, 0x4b, 0x02, 0xbb, 0x96, 0xbf, 0xfd,
0x4b, 0x88, 0xb5, 0xd5, 0xc0, 0xef, 0x4b, 0xf6, 0xb0, 0x1e, 0xc1, 0x8d,
0x4c, 0x7f, 0xa9, 0xdf, 0xc2, 0x34, 0x4d, 0x10, 0xa3, 0x93, 0xc2, 0xcf,
0x4d, 0xbf, 0x9c, 0xe7, 0xc3, 0x58, 0x4e, 0x95, 0x95, 0xbd, 0xc3, 0xe0,
0x4f, 0xb7, 0x8e, 0x31, 0xc4, 0x26, 0x51, 0xf9, 0x85, 0x8d, 0xc4, 0xbb,
0x54, 0x9f, 0x7c, 0xa3, 0xc5, 0xd5, 0x57, 0xea, 0x73, 0x2e, 0xc7, 0x2e,
0x5b, 0xd9, 0x69, 0xaf, 0xc9, 0x07, 0x5f, 0xeb, 0x5f, 0xcc, 0xc0, 0x6e,
0x44, 0x88, 0xd4, 0x0f, 0xc2, 0x74, 0x45, 0x90, 0xce, 0x0a, 0xc4, 0x36,
0x46, 0x1d, 0xc8, 0xe6, 0xc5, 0xe6, 0x46, 0x77, 0xc3, 0xe6, 0xc7, 0x58,
0x46, 0xad, 0xbe, 0xdf, 0xc8, 0x18, 0x46, 0xfc, 0xb9, 0x60, 0xc8, 0xdb,
0x47, 0x50, 0xb3, 0xd7, 0xc9, 0x8c, 0x47, 0xb7, 0xae, 0x1a, 0xca, 0x1c,
0x48, 0x3a, 0xa7, 0xfc, 0xca, 0xab, 0x48, 0xcd, 0xa1, 0xd1, 0xcb, 0x28,
0x49, 0x8c, 0x9b, 0x04, 0xcb, 0x8a, 0x4a, 0x78, 0x93, 0xd6, 0xcc, 0x09,
0x4b, 0xd7, 0x8c, 0x23, 0xcc, 0x7a, 0x4d, 0xd4, 0x83, 0xc5, 0xcd, 0x03,
0x50, 0xb0, 0x7a, 0x8a, 0xcd, 0xd1, 0x54, 0x2b, 0x70, 0xef, 0xce, 0xff,
0x58, 0xd2, 0x66, 0x43, 0x3b, 0x3b, 0xb3, 0x06, 0xa4, 0xd7, 0x3d, 0x01,
0xb3, 0xed, 0x9c, 0x2b, 0x3d, 0xba, 0xb5, 0x5a, 0x93, 0xf2, 0x3e, 0x22,
0xb6, 0xf8, 0x8b, 0xb9, 0x3e, 0x36, 0xb8, 0xb5, 0x83, 0x76, 0x3e, 0x41,
0xba, 0x98, 0x7b, 0x4a, 0x3e, 0x35, 0xbc, 0x85, 0x73, 0x29, 0x3e, 0x0c,
0xbe, 0xc3, 0x6a, 0xcc, 0x3e, 0x1c, 0xc0, 0xe9, 0x62, 0xac, 0x3d, 0xff,
0xc2, 0x46, 0x5a, 0x04, 0x3d, 0x80, 0xc3, 0x64, 0x50, 0xd9, 0x3f, 0xa6,
0xc3, 0xbd, 0x4a, 0x88, 0x41, 0x08, 0xc4, 0x73, 0x44, 0x54, 0x44, 0x39,
0xc4, 0x24, 0x3f, 0x3d, 0x47, 0x23, 0xc4, 0x47, 0x3b, 0xb3, 0x49, 0xdd,
0xc4, 0x63, 0x38, 0x09, 0x4c, 0x8d, 0xc4, 0x63, 0x34, 0x38, 0x41, 0x00,
0xad, 0x10, 0xa7, 0xea, 0x43, 0xa4, 0xad, 0x64, 0x9e, 0xb4, 0x45, 0x10,
0xae, 0x8b, 0x96, 0x4b, 0x46, 0x34, 0xaf, 0xec, 0x8d, 0xe4, 0x46, 0xbc,
0xb1, 0xb2, 0x85, 0x95, 0x47, 0x21, 0xb3, 0x9c, 0x7d, 0x5c, 0x47, 0x64,
0xb5, 0xca, 0x75, 0x56, 0x47, 0xa8, 0xb7, 0xd7, 0x6d, 0x13, 0x48, 0x11,
0xb9, 0xec, 0x64, 0x95, 0x48, 0x7a, 0xbb, 0xaa, 0x5c, 0x2b, 0x48, 0xe5,
0xbc, 0xe7, 0x53, 0x8b, 0x4a, 0x53, 0xbd, 0xa9, 0x4c, 0x8f, 0x4c, 0x56,
0xbe, 0x0a, 0x46, 0x52, 0x4e, 0x47, 0xbe, 0x40, 0x40, 0x51, 0x50, 0xbc,
0xbe, 0xa1, 0x3c, 0xb6, 0x52, 0xfc, 0xbf, 0x18, 0x39, 0x18, 0x55, 0x3f,
0xbf, 0x7e, 0x35, 0x57, 0x46, 0x01, 0xa7, 0x35, 0xab, 0x64, 0x49, 0x2b,
0xa7, 0x41, 0xa1, 0xb9, 0x4b, 0x77, 0xa7, 0xf7, 0x99, 0x1d, 0x4d, 0x87,
0xa8, 0xd7, 0x90, 0xa4, 0x4e, 0x9b, 0xaa, 0xa9, 0x88, 0x23, 0x4f, 0x74,
0xac, 0x8b, 0x7f, 0x97, 0x4f, 0xea, 0xaf, 0x1f, 0x77, 0x7f, 0x50, 0x3e,
0xb1, 0x7c, 0x6f, 0x7d, 0x51, 0x0e, 0xb3, 0x45, 0x66, 0xca, 0x51, 0xc9,
0xb5, 0x05, 0x5e, 0x62, 0x52, 0x9b, 0xb6, 0x64, 0x56, 0x18, 0x53, 0xac,
0xb7, 0x88, 0x4e, 0x81, 0x55, 0x79, 0xb8, 0x51, 0x48, 0x8f, 0x57, 0x1d,
0xb8, 0xf6, 0x42, 0x5a, 0x59, 0x16, 0xb9, 0x9f, 0x3e, 0x15, 0x5b, 0x32,
0xba, 0x59, 0x3a, 0x72, 0x5d, 0x87, 0xbb, 0x01, 0x36, 0x49, 0x4b, 0x0a,
0xa1, 0x5e, 0xae, 0xe7, 0x4e, 0x9d, 0xa1, 0x4b, 0xa4, 0xe9, 0x51, 0xc9,
0xa1, 0x6b, 0x9b, 0xf8, 0x54, 0x95, 0xa1, 0xdf, 0x93, 0x8e, 0x56, 0x67,
0xa3, 0x2e, 0x8b, 0x22, 0x57, 0x78, 0xa5, 0x02, 0x82, 0xa6, 0x58, 0x4c,
0xa7, 0x2a, 0x7a, 0x7e, 0x58, 0xe8, 0xa9, 0x95, 0x72, 0x7e, 0x59, 0xc2,
0xab, 0xcb, 0x69, 0xde, 0x5a, 0xb3, 0xad, 0xd7, 0x61, 0x20, 0x5b, 0xb3,
0xaf, 0xc9, 0x58, 0xc7, 0x5c, 0x97, 0xb1, 0x52, 0x50, 0xa5, 0x5e, 0x64,
0xb2, 0x8a, 0x4a, 0x9a, 0x60, 0x1e, 0xb3, 0x8b, 0x44, 0xa5, 0x61, 0xc1,
0xb4, 0x5d, 0x3f, 0x56, 0x63, 0x9a, 0xb5, 0x49, 0x3b, 0xb4, 0x65, 0xa1,
0xb6, 0x2b, 0x37, 0x7f, 0x51, 0x81, 0x9b, 0x08, 0xb2, 0x44, 0x55, 0x7c,
0x9a, 0x9f, 0xa8, 0xd3, 0x59, 0x14, 0x9a, 0x54, 0x9f, 0xca, 0x5c, 0x25,
0x9a, 0xad, 0x97, 0x53, 0x5e, 0xe9, 0x9b, 0x43, 0x8e, 0xdf, 0x5f, 0xea,
0x9d, 0x19, 0x86, 0x4d, 0x60, 0xbe, 0x9f, 0x19, 0x7d, 0xdf, 0x61, 0x94,
0xa1, 0x56, 0x75, 0xe6, 0x62, 0x7b, 0xa3, 0x8a, 0x6d, 0xbd, 0x63, 0xa6,
0xa5, 0x93, 0x64, 0xe1, 0x64, 0xd8, 0xa7, 0xcd, 0x5c, 0x9e, 0x66, 0x0a,
0xaa, 0x01, 0x54, 0xbd, 0x67, 0x5e, 0xab, 0xe4, 0x4d, 0x99, 0x69, 0x0c,
0xad, 0x6e, 0x47, 0x99, 0x6a, 0xb0, 0xae, 0xb5, 0x41, 0x82, 0x6c, 0x72,
0xb0, 0x05, 0x3d, 0x1c, 0x6e, 0x4c, 0xb1, 0x3f, 0x38, 0x9e, 0x59, 0x38,
0x94, 0x20, 0xb6, 0x45, 0x5d, 0x39, 0x93, 0xa8, 0xac, 0xf4, 0x60, 0xd1,
0x93, 0x5a, 0xa4, 0x33, 0x64, 0x25, 0x93, 0x4e, 0x9b, 0x9d, 0x67, 0x03,
0x93, 0xaa, 0x93, 0x1c, 0x68, 0xc8, 0x94, 0xf0, 0x8a, 0x91, 0x69, 0xf7,
0x96, 0xb1, 0x82, 0x05, 0x6a, 0xfb, 0x98, 0xc4, 0x79, 0xd5, 0x6b, 0xd7,
0x9a, 0xef, 0x71, 0xe0, 0x6c, 0xd7, 0x9d, 0x27, 0x69, 0x3e, 0x6d, 0xce,
0x9f, 0x39, 0x60, 0x26, 0x6f, 0x64, 0xa2, 0x02, 0x58, 0x95, 0x70, 0xc2,
0xa4, 0x6a, 0x51, 0x05, 0x72, 0x3e, 0xa6, 0x74, 0x4b, 0x1b, 0x73, 0xc2,
0xa8, 0x31, 0x45, 0x54, 0x75, 0x46, 0xa9, 0xc1, 0x3f, 0xaf, 0x77, 0x16,
0xab, 0xb7, 0x3a, 0x9d, 0x61, 0xa6, 0x8c, 0xc4, 0xba, 0xc3, 0x65, 0xf7,
0x8c, 0x3d, 0xb1, 0x74, 0x69, 0xb6, 0x8b, 0xe5, 0xa8, 0xdf, 0x6d, 0x4f,
0x8b, 0x9d, 0xa0, 0x64, 0x6f, 0xe8, 0x8c, 0x17, 0x97, 0xdc, 0x72, 0x1e,
0x8c, 0xc8, 0x8f, 0x4d, 0x73, 0x2f, 0x8e, 0x7e, 0x86, 0xa6, 0x74, 0x47,
0x90, 0x5b, 0x7e, 0x0f, 0x75, 0x77, 0x92, 0x5e, 0x75, 0xf8, 0x76, 0x8d,
0x94, 0x89, 0x6d, 0xec, 0x77, 0xa3, 0x96, 0xee, 0x65, 0x91, 0x78, 0xc2,
0x99, 0x74, 0x5d, 0x5b, 0x7a, 0x34, 0x9c, 0x51, 0x55, 0xa3, 0x7b, 0xb2,
0x9e, 0xee, 0x4e, 0x6d, 0x7d, 0x45, 0xa1, 0x1e, 0x48, 0xae, 0x7e, 0xcb,
0xa2, 0xff, 0x43, 0x0d, 0x80, 0x72, 0xa5, 0x43, 0x3c, 0xeb, 0x6b, 0x5f,
0x84, 0xbe, 0xbf, 0x41, 0x6f, 0x76, 0x84, 0x77, 0xb6, 0x4d, 0x73, 0x4b,
0x84, 0x2f, 0xad, 0xb8, 0x76, 0x9f, 0x84, 0x21, 0xa5, 0x34, 0x79, 0x83,
0x84, 0x5b, 0x9c, 0xb8, 0x7b, 0xc7, 0x84, 0xfe, 0x94, 0x53, 0x7d, 0x4d,
0x86, 0x09, 0x8b, 0xed, 0x7e, 0x28, 0x87, 0x83, 0x83, 0x7e, 0x7f, 0x42,
0x89, 0xb3, 0x7b, 0x0d, 0x80, 0x71, 0x8c, 0x15, 0x72, 0xb0, 0x81, 0xaa,
0x8e, 0x8a, 0x6a, 0x75, 0x82, 0xe7, 0x90, 0xea, 0x62, 0x4f, 0x84, 0x1a,
0x93, 0xc6, 0x5a, 0xa3, 0x85, 0x71, 0x96, 0x9f, 0x53, 0x1e, 0x86, 0xb7,
0x99, 0x76, 0x4c, 0xa1, 0x88, 0x0c, 0x9c, 0x19, 0x46, 0xbc, 0x89, 0xc2,
0x9e, 0xbb, 0x3f, 0xfa, 0x75, 0xcb, 0x7c, 0x75, 0xc3, 0xf1, 0x79, 0xc8,
0x7c, 0x58, 0xbb, 0x47, 0x7d, 0x68, 0x7c, 0x42, 0xb2, 0xd8, 0x80, 0x9c,
0x7c, 0x62, 0xaa, 0x61, 0x83, 0x83, 0x7c, 0x9a, 0xa1, 0xd4, 0x85, 0x97,
0x7d, 0x4e, 0x99, 0x6c, 0x87, 0x6c, 0x7e, 0x1c, 0x91, 0x0c, 0x88, 0x32,
0x7f, 0x68, 0x88, 0xc0, 0x88, 0xdc, 0x80, 0x80, 0x80, 0x80, 0x8a, 0x2f,
0x83, 0x99, 0x78, 0x19, 0x8b, 0x62, 0x86, 0x42, 0x6f, 0xcc, 0x8c, 0xb0,
0x88, 0xee, 0x67, 0xd6, 0x8d, 0xfd, 0x8b, 0x54, 0x5f, 0xd2, 0x8f, 0xa7,
0x8e, 0x35, 0x58, 0x20, 0x91, 0x75, 0x90, 0xe9, 0x50, 0x89, 0x92, 0x13,
0x94, 0x51, 0x4a, 0x93, 0x93, 0x43, 0x97, 0xed, 0x43, 0x30, 0x81, 0x24,
0x73, 0x4f, 0xc8, 0xca, 0x84, 0xf2, 0x73, 0xb4, 0xc0, 0x1f, 0x88, 0x37,
0x73, 0xd1, 0xb7, 0xba, 0x8b, 0x51, 0x73, 0xf6, 0xaf, 0x54, 0x8d, 0xcf,
0x74, 0x7c, 0xa6, 0xf3, 0x90, 0x0c, 0x75, 0x1d, 0x9e, 0x91, 0x91, 0x88,
0x76, 0x3c, 0x96, 0x53, 0x92, 0xcc, 0x77, 0x81, 0x8e, 0x16, 0x93, 0x75,
0x79, 0x3e, 0x85, 0xe7, 0x94, 0x2e, 0x7b, 0x2f, 0x7d, 0xa4, 0x95, 0x4b,
0x7d, 0xff, 0x75, 0x39, 0x96, 0xa4, 0x80, 0xca, 0x6d, 0x2b, 0x98, 0x01,
0x83, 0x94, 0x65, 0x69, 0x99, 0x53, 0x86, 0x63, 0x5d, 0xad, 0x9a, 0xda,
0x89, 0x6e, 0x56, 0x31, 0x9c, 0x7e, 0x8c, 0x50, 0x4e, 0xdb, 0x9d, 0xbd,
0x8f, 0xba, 0x47, 0xd2, 0x8d, 0x0c, 0x6a, 0x32, 0xcd, 0x92, 0x90, 0x74,
0x6a, 0xf6, 0xc4, 0xa4, 0x93, 0x53, 0x6b, 0x89, 0xbc, 0x53, 0x95, 0xf1,
0x6c, 0x13, 0xb4, 0x1f, 0x98, 0x27, 0x6c, 0xb4, 0xab, 0xe0, 0x99, 0xfd,
0x6d, 0x75, 0xa3, 0xaa, 0x9b, 0x77, 0x6e, 0x84, 0x9b, 0x81, 0x9c, 0xb6,
0x6f, 0xcc, 0x93, 0x54, 0x9d, 0xab, 0x71, 0x99, 0x8b, 0x2a, 0x9e, 0x5d,
0x73, 0x8f, 0x83, 0x12, 0x9f, 0x37, 0x76, 0x08, 0x7a, 0xbb, 0xa0, 0x57,
0x78, 0xcb, 0x72, 0x65, 0xa1, 0xa9, 0x7b, 0xa5, 0x6a, 0x97, 0xa3, 0x41,
0x7e, 0x6f, 0x62, 0xef, 0xa4, 0xac, 0x81, 0x9c, 0x5b, 0x56, 0xa5, 0xde,
0x84, 0xdf, 0x53, 0xcc, 0xa7, 0x3a, 0x88, 0x4f, 0x4c, 0x15, 0x98, 0x1d,
0x61, 0x06, 0xd1, 0xd6, 0x9b, 0x36, 0x62, 0x01, 0xc8, 0xfb, 0x9e, 0x2a,
0x62, 0xe0, 0xc0, 0xb7, 0xa0, 0x86, 0x63, 0xfc, 0xb8, 0xb8, 0xa2, 0xa5,
0x64, 0xff, 0xb0, 0xa1, 0xa4, 0x03, 0x66, 0x0c, 0xa8, 0xb9, 0xa5, 0x5f,
0x67, 0x0a, 0xa0, 0xd0, 0xa6, 0x4a, 0x68, 0x74, 0x98, 0xef, 0xa7, 0x32,
0x69, 0xdf, 0x90, 0xf8, 0xa7, 0xe4, 0x6c, 0x01, 0x88, 0x8e, 0xa8, 0xaa,
0x6e, 0x16, 0x80, 0x47, 0xa9, 0xca, 0x71, 0x0a, 0x77, 0xc0, 0xaa, 0xe0,
0x73, 0xdc, 0x6f, 0x8c, 0xac, 0x33, 0x76, 0xd7, 0x67, 0xf2, 0xad, 0xca,
0x79, 0xac, 0x60, 0x50, 0xaf, 0x54, 0x7d, 0x2b, 0x58, 0x89, 0xb0, 0xad,
0x80, 0xc9, 0x50, 0x6d, 0xa2, 0x22, 0x59, 0x6e, 0xd5, 0xba, 0xa5, 0x25,
0x5b, 0x27, 0xcc, 0x00, 0xa7, 0xb4, 0x5c, 0x27, 0xc3, 0xfa, 0xa9, 0xdf,
0x5d, 0x06, 0xbc, 0x5c, 0xab, 0x9f, 0x5d, 0xfa, 0xb4, 0xe6, 0xad, 0x2b,
0x5e, 0xe3, 0xad, 0x5a, 0xae, 0x7b, 0x5f, 0xdb, 0xa5, 0xaf, 0xaf, 0xa4,
0x61, 0x10, 0x9e, 0x02, 0xb0, 0x55, 0x62, 0x9b, 0x96, 0x53, 0xb0, 0xfe,
0x64, 0x49, 0x8e, 0x6e, 0xb1, 0x91, 0x66, 0x99, 0x85, 0xf2, 0xb2, 0x4c,
0x69, 0x16, 0x7d, 0x7f, 0xb3, 0x79, 0x6c, 0x2f, 0x74, 0xf1, 0xb5, 0x04,
0x6f, 0x2e, 0x6c, 0xf2, 0xb6, 0x79, 0x72, 0x3c, 0x65, 0x43, 0xb7, 0xfc,
0x75, 0x6c, 0x5d, 0x60, 0xb9, 0x9b, 0x79, 0x48, 0x54, 0xcc, 0xaa, 0xf9,
0x53, 0xf3, 0xd6, 0xf7, 0xad, 0xfa, 0x55, 0x91, 0xcd, 0xaa, 0xb0, 0x5a,
0x56, 0x7d, 0xc6, 0x52, 0xb2, 0x80, 0x57, 0x49, 0xbf, 0x3a, 0xb3, 0xe8,
0x58, 0x56, 0xb8, 0x5c, 0xb5, 0x4d, 0x59, 0x46, 0xb1, 0x72, 0xb6, 0x63,
0x5a, 0x38, 0xaa, 0x5a, 0xb7, 0x74, 0x5b, 0x2e, 0xa3, 0x28, 0xb8, 0x4e,
0x5c, 0x56, 0x9b, 0xc7, 0xb8, 0xfe, 0x5d, 0xab, 0x94, 0x44, 0xb9, 0xad,
0x5f, 0x63, 0x8c, 0x26, 0xba, 0x47, 0x61, 0xab, 0x83, 0x72, 0xbb, 0x1e,
0x64, 0x8e, 0x7a, 0xc1, 0xbc, 0x62, 0x67, 0xa8, 0x72, 0x31, 0xbe, 0x05,
0x6a, 0xe0, 0x6a, 0x31, 0xc0, 0x06, 0x6d, 0xf3, 0x62, 0x60, 0xc1, 0xc0,
0x71, 0xfa, 0x59, 0x44, 0xb3, 0x50, 0x4f, 0x65, 0xd7, 0x82, 0xb6, 0x0f,
0x50, 0x53, 0xce, 0xd5, 0xb8, 0x2d, 0x51, 0x58, 0xc8, 0x1d, 0xba, 0x32,
0x52, 0x52, 0xc1, 0x8a, 0xbb, 0x9a, 0x53, 0x4c, 0xbb, 0x2b, 0xbc, 0xd4,
0x54, 0x3c, 0xb4, 0xcd, 0xbd, 0xf4, 0x55, 0x1d, 0xae, 0x53, 0xbe, 0xdc,
0x56, 0x06, 0xa7, 0x97, 0xbf, 0xce, 0x56, 0xee, 0xa0, 0xcd, 0xc0, 0x79,
0x58, 0x0e, 0x99, 0x91, 0xc1, 0x1b, 0x59, 0x45, 0x92, 0x3a, 0xc1, 0xa6,
0x5b, 0x33, 0x89, 0xe0, 0xc2, 0x46, 0x5d, 0x59, 0x81, 0x21, 0xc3, 0x92,
0x60, 0x65, 0x77, 0xea, 0xc4, 0xdb, 0x63, 0xaa, 0x6f, 0x3e, 0xc6, 0x5e,
0x67, 0x4a, 0x66, 0xde, 0xc8, 0xd1, 0x6b, 0xf9, 0x5b, 0xc6, 0xbc, 0x05,
0x4c, 0x35, 0xd6, 0xb6, 0xbe, 0x4c, 0x4d, 0x1b, 0xcf, 0x7f, 0xc0, 0x11,
0x4d, 0xd3, 0xc9, 0x72, 0xc1, 0xec, 0x4e, 0x5d, 0xc3, 0xb4, 0xc3, 0x6e,
0x4e, 0xd4, 0xbd, 0xf2, 0xc4, 0x78, 0x4f, 0x5a, 0xb8, 0x10, 0xc5, 0x83,
0x4f, 0xe5, 0xb2, 0x21, 0xc6, 0x66, 0x50, 0xa0, 0xab, 0xe0, 0xc7, 0x38,
0x51, 0x84, 0xa5, 0x68, 0xc8, 0x02, 0x52, 0x76, 0x9e, 0xbb, 0xc8, 0x96,
0x53, 0xa8, 0x97, 0x61, 0xc9, 0x2d, 0x54, 0xe8, 0x8f, 0xfd, 0xc9, 0xa4,
0x57, 0x20, 0x87, 0x8a, 0xca, 0x42, 0x59, 0x69, 0x7e, 0xfa, 0xcb, 0x76,
0x5c, 0xb4, 0x75, 0x86, 0xcc, 0xee, 0x60, 0x47, 0x6c, 0x22, 0xce, 0x95,
0x64, 0xa4, 0x62, 0x1b, 0xc4, 0x94, 0x48, 0xa8, 0xd7, 0x83, 0xc6, 0xc3,
0x49, 0xbe, 0xd0, 0xe5, 0xc8, 0x87, 0x4a, 0x2e, 0xcb, 0x87, 0xca, 0x27,
0x4a, 0x6f, 0xc6, 0x56, 0xcb, 0xc0, 0x4a, 0x86, 0xc1, 0x3d, 0xcc, 0xb4,
0x4a, 0xdf, 0xbb, 0xaa, 0xcd, 0x8e, 0x4b, 0x4c, 0xb5, 0xf0, 0xce, 0x5d,
0x4b, 0xc3, 0xb0, 0x28, 0xcf, 0x13, 0x4c, 0x6c, 0xa9, 0xe8, 0xcf, 0xc8,
0x4d, 0x26, 0xa3, 0x95, 0xd0, 0x6f, 0x4e, 0x0b, 0x9c, 0xcb, 0xd0, 0xd6,
0x4f, 0x3e, 0x95, 0x4c, 0xd1, 0x59, 0x50, 0xc5, 0x8d, 0x9b, 0xd1, 0xf5,
0x52, 0xd3, 0x85, 0x8c, 0xd2, 0x9e, 0x55, 0x5f, 0x7c, 0xe9, 0xd3, 0xa7,
0x58, 0xc4, 0x73, 0x45, 0xd5, 0x80, 0x5c, 0xd9, 0x68, 0x96, 0x43, 0x5d,
0xb9, 0x17, 0xaa, 0x49, 0x44, 0xdb, 0xb9, 0xd8, 0xa1, 0x82, 0x45, 0x72,
0xbb, 0x3a, 0x99, 0x17, 0x45, 0xa4, 0xbc, 0xd6, 0x90, 0xb8, 0x45, 0xab,
0xbe, 0x6c, 0x88, 0x4e, 0x45, 0x88, 0xbf, 0xfe, 0x7f, 0xd8, 0x45, 0x5b,
0xc1, 0xae, 0x77, 0xea, 0x45, 0x01, 0xc3, 0x36, 0x70, 0x11, 0x44, 0xef,
0xc5, 0x09, 0x68, 0x2a, 0x45, 0x16, 0xc6, 0x87, 0x60, 0x5e, 0x44, 0x8b,
0xc7, 0x5e, 0x57, 0x98, 0x44, 0x73, 0xc7, 0xee, 0x4f, 0x23, 0x44, 0x8c,
0xc8, 0xf9, 0x48, 0xed, 0x48, 0x29, 0xc7, 0xf4, 0x43, 0x4e, 0x4a, 0xb2,
0xc7, 0xc1, 0x3e, 0x6d, 0x4d, 0x70, 0xc7, 0xb2, 0x3a, 0xa4, 0x4f, 0xf1,
0xc7, 0xb3, 0x36, 0xa0, 0x48, 0xb8, 0xb3, 0x42, 0xac, 0xd9, 0x4b, 0x01,
0xb3, 0xa1, 0xa3, 0xdb, 0x4c, 0x7d, 0xb4, 0x88, 0x9b, 0x4d, 0x4d, 0x4f,
0xb5, 0xe2, 0x92, 0xe2, 0x4d, 0xd1, 0xb7, 0x72, 0x8a, 0x6d, 0x4e, 0x2d,
0xb9, 0x06, 0x81, 0xe9, 0x4e, 0x58, 0xba, 0xfc, 0x79, 0xd1, 0x4e, 0x60,
0xbc, 0xef, 0x71, 0xcd, 0x4e, 0xb5, 0xbe, 0xe5, 0x69, 0xac, 0x4f, 0x03,
0xc0, 0xae, 0x61, 0xd2, 0x4f, 0x6d, 0xc1, 0x8e, 0x59, 0xcc, 0x4f, 0xdc,
0xc2, 0x36, 0x51, 0xcc, 0x51, 0x3c, 0xc2, 0x59, 0x4b, 0x54, 0x52, 0xb6,
0xc2, 0x5f, 0x45, 0x04, 0x54, 0x51, 0xc2, 0x6d, 0x3f, 0x8c, 0x56, 0x85,
0xc2, 0xbe, 0x3b, 0xca, 0x58, 0xb8, 0xc3, 0x05, 0x37, 0xd1, 0x4d, 0xb9,
0xad, 0xa4, 0xaf, 0xb7, 0x50, 0x8e, 0xad, 0xbc, 0xa6, 0x80, 0x52, 0xf1,
0xae, 0x0a, 0x9d, 0x9f, 0x54, 0x76, 0xaf, 0x1b, 0x95, 0x12, 0x55, 0x97,
0xb0, 0x75, 0x8c, 0x87, 0x56, 0x3f, 0xb2, 0x19, 0x84, 0x08, 0x56, 0xb0,
0xb4, 0x16, 0x7b, 0xe0, 0x56, 0xe2, 0xb6, 0x53, 0x73, 0xfe, 0x57, 0x43,
0xb8, 0x58, 0x6b, 0xec, 0x57, 0xd1, 0xba, 0x40, 0x63, 0xeb, 0x58, 0x66,
0xbb, 0xb6, 0x5b, 0xe9, 0x59, 0x04, 0xbc, 0xa3, 0x53, 0xa9, 0x5a, 0x2e,
0xbd, 0x29, 0x4c, 0xdf, 0x5b, 0xa7, 0xbd, 0x73, 0x46, 0xff, 0x5d, 0x03,
0xbd, 0xa3, 0x41, 0x1c, 0x5f, 0x06, 0xbe, 0x27, 0x3d, 0x09, 0x61, 0x2e,
0xbe, 0x76, 0x38, 0xde, 0x52, 0xf1, 0xa7, 0xca, 0xb3, 0x1b, 0x56, 0x1d,
0xa7, 0x96, 0xa9, 0x94, 0x59, 0x06, 0xa7, 0x77, 0xa0, 0x86, 0x5b, 0x49,
0xa8, 0x29, 0x97, 0xfe, 0x5d, 0x5f, 0xa8, 0xfd, 0x8f, 0x78, 0x5e, 0x34,
0xaa, 0xc1, 0x86, 0xe9, 0x5e, 0xf4, 0xac, 0xa4, 0x7e, 0x6f, 0x5f, 0x70,
0xaf, 0x26, 0x76, 0x7a, 0x5f, 0xdd, 0xb1, 0x72, 0x6e, 0x8d, 0x60, 0xa6,
0xb3, 0x44, 0x66, 0x5c, 0x61, 0x59, 0xb5, 0x04, 0x5e, 0x6d, 0x62, 0x24,
0xb6, 0x33, 0x56, 0x70, 0x63, 0x0e, 0xb7, 0x2e, 0x4e, 0xec, 0x64, 0x7f,
0xb7, 0xca, 0x49, 0x1e, 0x65, 0xd3, 0xb8, 0x3c, 0x43, 0x37, 0x67, 0x5f,
0xb8, 0xc1, 0x3e, 0x52, 0x69, 0x52, 0xb9, 0x6a, 0x3a, 0x03, 0x58, 0xa4,
0xa1, 0xc9, 0xb6, 0xa8, 0x5c, 0x3a, 0xa1, 0x47, 0xac, 0xd8, 0x5f, 0x5d,
0xa1, 0x04, 0xa3, 0xb9, 0x62, 0x47, 0xa1, 0x28, 0x9b, 0x18, 0x64, 0xe8,
0xa1, 0xae, 0x92, 0xbb, 0x66, 0x58, 0xa3, 0x0e, 0x8a, 0x59, 0x67, 0x46,
0xa4, 0xc6, 0x81, 0xec, 0x68, 0x04, 0xa6, 0xe1, 0x79, 0xec, 0x68, 0x8e,
0xa9, 0x30, 0x72, 0x09, 0x69, 0x61, 0xab, 0x4d, 0x69, 0xaa, 0x6a, 0x43,
0xad, 0x50, 0x61, 0x56, 0x6b, 0x38, 0xaf, 0x2b, 0x59, 0x61, 0x6c, 0x0c,
0xb0, 0xb5, 0x51, 0x6c, 0x6d, 0x84, 0xb1, 0xce, 0x4b, 0x69, 0x6e, 0xf2,
0xb2, 0xa7, 0x45, 0xa5, 0x70, 0x48, 0xb3, 0x5b, 0x3f, 0xf4, 0x72, 0x30,
0xb4, 0x7f, 0x3b, 0x3b, 0x60, 0x1b, 0x9b, 0x0b, 0xba, 0x9c, 0x63, 0xd3,
0x9a, 0x5c, 0xb0, 0xda, 0x67, 0x24, 0x99, 0xf7, 0xa7, 0xf8, 0x6a, 0x58,
0x99, 0xab, 0x9f, 0x3b, 0x6c, 0xd1, 0x9a, 0x39, 0x96, 0xc5, 0x6e, 0xda,
0x9b, 0x1a, 0x8e, 0x4f, 0x6f, 0xee, 0x9c, 0xe5, 0x85, 0xd4, 0x70, 0xe5,
0x9e, 0xc7, 0x7d, 0x92, 0x71, 0xa4, 0xa0, 0xd9, 0x75, 0xcc, 0x72, 0x5d,
0xa2, 0xea, 0x6d, 0xcf, 0x73, 0x3f, 0xa4, 0xe6, 0x65, 0x22, 0x74, 0x46,
0xa7, 0x08, 0x5d, 0x23, 0x75, 0x7c, 0xa9, 0x27, 0x55, 0xab, 0x76, 0xb1,
0xaa, 0xf4, 0x4e, 0xa8, 0x78, 0x2b, 0xac, 0x74, 0x48, 0xec, 0x79, 0xa2,
0xad, 0xc6, 0x43, 0x25, 0x7b, 0x5d, 0xaf, 0x72, 0x3d, 0x48, 0x67, 0xb7,
0x93, 0xfd, 0xbe, 0x98, 0x6b, 0xc4, 0x93, 0x4d, 0xb5, 0x35, 0x6f, 0x86,
0x92, 0xc2, 0xac, 0x5c, 0x72, 0xe4, 0x92, 0x62, 0xa3, 0xc3, 0x75, 0x8c,
0x92, 0x97, 0x9b, 0x2f, 0x77, 0xa8, 0x93, 0x47, 0x92, 0xaf, 0x79, 0x10,
0x94, 0xa4, 0x8a, 0x3b, 0x7a, 0x28, 0x96, 0x4a, 0x81, 0xd1, 0x7b, 0x27,
0x98, 0x44, 0x79, 0xcc, 0x7b, 0xf7, 0x9a, 0x61, 0x71, 0xfb, 0x7c, 0xc3,
0x9c, 0x86, 0x69, 0xa4, 0x7d, 0x66, 0x9e, 0x7d, 0x60, 0xf0, 0x7e, 0xc6,
0xa1, 0x18, 0x59, 0x6a, 0x80, 0x2b, 0xa3, 0x6e, 0x52, 0x30, 0x81, 0x94,
0xa5, 0x63, 0x4c, 0x36, 0x83, 0x03, 0xa7, 0x2b, 0x46, 0x86, 0x84, 0x97,
0xa8, 0xf8, 0x40, 0x29, 0x70, 0x99, 0x8c, 0x67, 0xc2, 0xd0, 0x74, 0xde,
0x8b, 0xab, 0xb9, 0xc4, 0x78, 0xbc, 0x8b, 0x24, 0xb1, 0x14, 0x7c, 0x0e,
0x8a, 0xe5, 0xa8, 0x7a, 0x7f, 0x29, 0x8a, 0xc0, 0x9f, 0xd7, 0x81, 0x18,
0x8b, 0x89, 0x97, 0x6b, 0x82, 0xc4, 0x8c, 0x76, 0x8f, 0x00, 0x83, 0x8e,
0x8e, 0x13, 0x86, 0x89, 0x84, 0x6a, 0x8f, 0xe2, 0x7e, 0x18, 0x85, 0x80,
0x91, 0xf0, 0x76, 0x17, 0x86, 0x77, 0x94, 0x18, 0x6e, 0x2f, 0x87, 0x7f,
0x96, 0x5a, 0x66, 0x1d, 0x88, 0x83, 0x98, 0x9f, 0x5e, 0x26, 0x89, 0xda,
0x9b, 0x4d, 0x56, 0xcf, 0x8b, 0x2d, 0x9d, 0xce, 0x4f, 0xac, 0x8c, 0x86,
0xa0, 0x41, 0x49, 0xcf, 0x8e, 0x0c, 0xa2, 0xa3, 0x43, 0x52, 0x7a, 0x9e,
0x84, 0x7b, 0xc7, 0x76, 0x7e, 0xc7, 0x83, 0xfc, 0xbe, 0x89, 0x82, 0x40,
0x83, 0xb0, 0xb6, 0x09, 0x85, 0x81, 0x83, 0x7a, 0xad, 0x75, 0x88, 0x56,
0x83, 0x90, 0xa4, 0xd4, 0x8a, 0xa4, 0x83, 0xf9, 0x9c, 0x55, 0x8c, 0x5d,
0x84, 0xbe, 0x93, 0xfb, 0x8d, 0x85, 0x85, 0xdd, 0x8b, 0xb3, 0x8e, 0x3e,
0x87, 0x52, 0x83, 0x75, 0x8f, 0x36, 0x89, 0x78, 0x7b, 0x32, 0x90, 0x36,
0x8b, 0xcf, 0x72, 0xff, 0x91, 0x57, 0x8e, 0x1a, 0x6a, 0xf3, 0x92, 0x91,
0x90, 0x4b, 0x62, 0xe5, 0x93, 0xf3, 0x92, 0xf3, 0x5b, 0x71, 0x95, 0x69,
0x95, 0xaa, 0x54, 0x44, 0x96, 0x95, 0x98, 0x70, 0x4d, 0x8c, 0x97, 0xd9,
0x9b, 0x89, 0x46, 0x7b, 0x84, 0xf9, 0x7c, 0x39, 0xcc, 0x23, 0x88, 0xe1,
0x7c, 0x03, 0xc3, 0x6d, 0x8c, 0x65, 0x7b, 0xcf, 0xba, 0xf3, 0x8f, 0xb5,
0x7b, 0x9e, 0xb2, 0x6b, 0x92, 0x52, 0x7b, 0xd4, 0xa9, 0xd4, 0x94, 0x8e,
0x7c, 0x42, 0xa1, 0x4f, 0x96, 0x10, 0x7d, 0x26, 0x98, 0xfa, 0x97, 0x67,
0x7e, 0x14, 0x90, 0xaa, 0x98, 0x09, 0x7f, 0x66, 0x88, 0x8d, 0x98, 0xa1,
0x80, 0x80, 0x80, 0x80, 0x99, 0xfc, 0x83, 0x74, 0x78, 0x57, 0x9b, 0x32,
0x86, 0x06, 0x70, 0x44, 0x9c, 0x80, 0x88, 0xa6, 0x68, 0x73, 0x9d, 0xbb,
0x8b, 0x17, 0x60, 0x8a, 0x9f, 0x60, 0x8d, 0xe9, 0x59, 0x1f, 0xa1, 0x20,
0x90, 0x88, 0x51, 0xcf, 0xa2, 0x33, 0x93, 0xc7, 0x4a, 0xa9, 0x90, 0xa9,
0x73, 0x31, 0xd0, 0x7a, 0x94, 0x00, 0x73, 0x5b, 0xc7, 0xe3, 0x97, 0x23,
0x73, 0x77, 0xbf, 0x87, 0x99, 0xee, 0x73, 0x93, 0xb6, 0xf2, 0x9c, 0x7c,
0x73, 0xca, 0xae, 0x63, 0x9e, 0x67, 0x74, 0x73, 0xa6, 0x29, 0xa0, 0x13,
0x75, 0x46, 0x9d, 0xfa, 0xa1, 0x38, 0x76, 0x78, 0x95, 0xdb, 0xa2, 0x31,
0x77, 0xca, 0x8d, 0xc0, 0xa2, 0xd3, 0x79, 0x6c, 0x85, 0xbc, 0xa3, 0x98,
0x7b, 0x45, 0x7d, 0xa8, 0xa4, 0xd5, 0x7d, 0xf4, 0x75, 0x7c, 0xa6, 0x3a,
0x80, 0xa1, 0x6d, 0x8f, 0xa7, 0xa3, 0x83, 0x5e, 0x65, 0xe3, 0xa8, 0xeb,
0x86, 0x18, 0x5e, 0x33, 0xaa, 0x24, 0x89, 0x41, 0x56, 0xb0, 0xab, 0xa5,
0x8c, 0x6e, 0x4e, 0xdc, 0x9b, 0xd1, 0x69, 0xfe, 0xd4, 0xb5, 0x9e, 0xee,
0x6a, 0x7a, 0xcc, 0x0e, 0xa1, 0xc1, 0x6b, 0x0c, 0xc3, 0xc3, 0xa4, 0x38,
0x6b, 0xa2, 0xbb, 0x71, 0xa6, 0x65, 0x6c, 0x2c, 0xb3, 0x19, 0xa8, 0x1e,
0x6c, 0xdd, 0xaa, 0xff, 0xa9, 0x9a, 0x6d, 0xa4, 0xa3, 0x05, 0xaa, 0xbf,
0x6e, 0xc7, 0x9a, 0xf8, 0xab, 0xb4, 0x70, 0x20, 0x92, 0xce, 0xac, 0x86,
0x71, 0xee, 0x8a, 0xc9, 0xad, 0x45, 0x73, 0xc4, 0x82, 0xd9, 0xae, 0x42,
0x76, 0x31, 0x7a, 0xbd, 0xaf, 0x6f, 0x78, 0xea, 0x72, 0xa1, 0xb0, 0xda,
0x7b, 0xb1, 0x6a, 0xde, 0xb2, 0x94, 0x7e, 0x62, 0x63, 0x31, 0xb4, 0x08,
0x81, 0x80, 0x5b, 0x6c, 0xb5, 0x39, 0x84, 0xf8, 0x53, 0x43, 0xa5, 0xa1,
0x61, 0x30, 0xd8, 0x9c, 0xa8, 0xf2, 0x62, 0xc9, 0xce, 0xd0, 0xab, 0x97,
0x63, 0x67, 0xc6, 0xe1, 0xae, 0x13, 0x63, 0xd4, 0xbf, 0x26, 0xaf, 0xd7,
0x64, 0xb7, 0xb7, 0x61, 0xb1, 0x7a, 0x65, 0x7d, 0xaf, 0x9b, 0xb2, 0xc1,
0x66, 0x82, 0xa7, 0xe9, 0xb3, 0xff, 0x67, 0x79, 0xa0, 0x37, 0xb4, 0xb9,
0x68, 0xee, 0x98, 0x67, 0xb5, 0x78, 0x6a, 0x5a, 0x90, 0x87, 0xb6, 0x37,
0x6c, 0x6b, 0x88, 0x46, 0xb7, 0x0b, 0x6e, 0x65, 0x80, 0x2c, 0xb8, 0x60,
0x71, 0x3f, 0x77, 0xf3, 0xb9, 0x8f, 0x73, 0xf7, 0x6f, 0xe6, 0xbb, 0x10,
0x76, 0xe9, 0x68, 0x24, 0xbc, 0xcd, 0x79, 0xbb, 0x60, 0x5a, 0xbe, 0x9c,
0x7d, 0x67, 0x57, 0xd8, 0xae, 0xf5, 0x5b, 0x70, 0xd9, 0xd8, 0xb2, 0x2c,
0x5c, 0xa2, 0xd0, 0x86, 0xb4, 0x7d, 0x5d, 0x19, 0xc9, 0x39, 0xb6, 0xb1,
0x5d, 0x7b, 0xc2, 0x06, 0xb8, 0x5a, 0x5e, 0x23, 0xba, 0xe0, 0xb9, 0xcc,
0x5e, 0xd6, 0xb3, 0xaf, 0xbb, 0x1f, 0x5f, 0xa0, 0xac, 0x69, 0xbc, 0x56,
0x60, 0xaa, 0xa5, 0x0f, 0xbd, 0x4d, 0x61, 0xef, 0x9d, 0xa8, 0xbd, 0xdf,
0x63, 0x7b, 0x96, 0x21, 0xbe, 0x78, 0x65, 0x1e, 0x8e, 0x5d, 0xbf, 0x20,
0x67, 0x52, 0x85, 0xea, 0xc0, 0x0d, 0x69, 0xaa, 0x7d, 0x96, 0xc1, 0x94,
0x6c, 0x95, 0x75, 0x40, 0xc3, 0x59, 0x6f, 0x89, 0x6d, 0x1c, 0xc4, 0xc4,
0x72, 0xbc, 0x64, 0xfd, 0xc6, 0x66, 0x76, 0x6d, 0x5b, 0xeb, 0xb7, 0x82,
0x56, 0x1f, 0xda, 0xc2, 0xba, 0x73, 0x57, 0x22, 0xd1, 0xf1, 0xbc, 0x9d,
0x57, 0xd5, 0xca, 0xfa, 0xbe, 0x9a, 0x58, 0x73, 0xc4, 0x45, 0xc0, 0x4c,
0x59, 0x0f, 0xbd, 0xad, 0xc1, 0x9a, 0x59, 0xb3, 0xb7, 0x24, 0xc2, 0xda,
0x5a, 0x4e, 0xb0, 0x88, 0xc3, 0xe4, 0x5b, 0x2f, 0xa9, 0xa8, 0xc4, 0xeb,
0x5c, 0x1c, 0xa2, 0xae, 0xc5, 0xb1, 0x5d, 0x48, 0x9b, 0x63, 0xc6, 0x55,
0x5e, 0xa3, 0x93, 0xe8, 0xc6, 0xfb, 0x60, 0x67, 0x8b, 0xe0, 0xc7, 0x92,
0x62, 0xa0, 0x83, 0x73, 0xc8, 0x9d, 0x65, 0x64, 0x7a, 0xdd, 0xca, 0x19,
0x68, 0x76, 0x72, 0x3f, 0xcb, 0xba, 0x6b, 0xe0, 0x69, 0xb3, 0xcd, 0xdf,
0x70, 0x14, 0x5f, 0x31, 0xbf, 0xdc, 0x51, 0x0f, 0xd9, 0xe6, 0xc2, 0x9f,
0x51, 0xfd, 0xd2, 0xf3, 0xc4, 0xd3, 0x52, 0xc5, 0xcc, 0xc1, 0xc6, 0xa9,
0x53, 0x53, 0xc6, 0xc5, 0xc8, 0x5c, 0x53, 0xbc, 0xc0, 0xc3, 0xc9, 0x83,
0x54, 0x5b, 0xba, 0xa2, 0xca, 0x91, 0x54, 0xfd, 0xb4, 0x6f, 0xcb, 0x88,
0x55, 0xb2, 0xae, 0x10, 0xcc, 0x60, 0x56, 0xa7, 0xa7, 0x60, 0xcd, 0x36,
0x57, 0xa2, 0xa0, 0x9b, 0xcd, 0xd2, 0x58, 0xee, 0x99, 0x2e, 0xce, 0x6d,
0x5a, 0x4e, 0x91, 0xaa, 0xcf, 0x08, 0x5c, 0x43, 0x89, 0x84, 0xcf, 0xb1,
0x5e, 0x53, 0x81, 0x33, 0xd0, 0xf0, 0x61, 0x75, 0x78, 0x0a, 0xd2, 0x69,
0x64, 0xb2, 0x6f, 0x18, 0xd4, 0x43, 0x68, 0xab, 0x65, 0x53, 0xc9, 0xa1,
0x4c, 0xea, 0xdb, 0x1a, 0xcb, 0xc5, 0x4d, 0xdb, 0xd4, 0xb6, 0xcd, 0xaf,
0x4e, 0x8f, 0xce, 0xd4, 0xcf, 0x24, 0x4e, 0xc8, 0xc9, 0x44, 0xd0, 0xac,
0x4e, 0xd2, 0xc3, 0xc5, 0xd1, 0xd8, 0x4f, 0x1b, 0xbe, 0x1c, 0xd2, 0xcc,
0x4f, 0xa4, 0xb8, 0x34, 0xd3, 0xb3, 0x50, 0x3d, 0xb2, 0x39, 0xd4, 0x84,
0x51, 0x14, 0xab, 0xeb, 0xd5, 0x3f, 0x52, 0x04, 0xa5, 0x65, 0xd5, 0xf7,
0x52, 0xfc, 0x9e, 0xb0, 0xd6, 0x79, 0x54, 0x52, 0x97, 0x45, 0xd7, 0x09,
0x55, 0xb2, 0x8f, 0xd4, 0xd7, 0xaa, 0x57, 0xb9, 0x87, 0xa9, 0xd8, 0x5e,
0x59, 0xff, 0x7f, 0x3a, 0xd9, 0x8d, 0x5d, 0x5d, 0x75, 0x75, 0xdb, 0x4b,
0x60, 0xf9, 0x6b, 0x4c, 0x4b, 0xdf, 0xbe, 0x93, 0xaf, 0x32, 0x4c, 0xd1,
0xbf, 0x93, 0xa6, 0xb4, 0x4d, 0x59, 0xc0, 0xcb, 0x9e, 0x6c, 0x4d, 0x1d,
0xc2, 0x7a, 0x95, 0xd1, 0x4c, 0xc1, 0xc4, 0x1a, 0x8d, 0x3f, 0x4c, 0xca,
0xc5, 0x52, 0x84, 0xcc, 0x4c, 0x9e, 0xc6, 0xa8, 0x7c, 0xa5, 0x4c, 0x67,
0xc7, 0xec, 0x74, 0xef, 0x4c, 0x3b, 0xc9, 0x26, 0x6d, 0x4c, 0x4c, 0x2a,
0xca, 0x71, 0x65, 0xc7, 0x4b, 0xfa, 0xcb, 0x80, 0x5e, 0x46, 0x4b, 0x9a,
0xcc, 0x09, 0x56, 0x6c, 0x4a, 0x65, 0xcc, 0xfb, 0x4e, 0x91, 0x4a, 0xfb,
0xcd, 0x2c, 0x48, 0x59, 0x4d, 0x79, 0xcc, 0x3d, 0x42, 0x4e, 0x51, 0x14,
0xcb, 0x3e, 0x3d, 0xac, 0x53, 0x64, 0xcb, 0x4f, 0x39, 0x81, 0x50, 0xdc,
0xb8, 0xf7, 0xb1, 0xb7, 0x52, 0x92, 0xb9, 0x7b, 0xa8, 0xee, 0x53, 0xf6,
0xba, 0x31, 0xa0, 0x6f, 0x54, 0x8c, 0xbb, 0x94, 0x97, 0xd0, 0x54, 0xe3,
0xbd, 0x18, 0x8f, 0x2c, 0x55, 0x2d, 0xbe, 0x98, 0x86, 0x92, 0x55, 0x51,
0xc0, 0x30, 0x7e, 0x1d, 0x55, 0x35, 0xc1, 0xec, 0x76, 0x4d, 0x55, 0x2e,
0xc3, 0x7a, 0x6e, 0x96, 0x55, 0x6b, 0xc4, 0xee, 0x67, 0x2d, 0x55, 0x90,
0xc6, 0x48, 0x5f, 0xf0, 0x55, 0xed, 0xc6, 0x9e, 0x58, 0x44, 0x56, 0x44,
0xc6, 0xfc, 0x50, 0xa6, 0x57, 0x6f, 0xc6, 0xcc, 0x4a, 0x7c, 0x58, 0x9f,
0xc6, 0x89, 0x44, 0x58, 0x5a, 0x21, 0xc6, 0x72, 0x3e, 0xf8, 0x5c, 0x3c,
0xc6, 0x9d, 0x3a, 0xc0, 0x55, 0x91, 0xb3, 0xa3, 0xb4, 0x4e, 0x57, 0xe3,
0xb3, 0xba, 0xab, 0x1e, 0x59, 0xe4, 0xb4, 0x10, 0xa2, 0x78, 0x5b, 0x50,
0xb4, 0xf3, 0x99, 0xde, 0x5c, 0x70, 0xb6, 0x10, 0x91, 0x3a, 0x5d, 0x10,
0xb7, 0x94, 0x88, 0xaa, 0x5d, 0x8f, 0xb9, 0x24, 0x80, 0x0e, 0x5d, 0x9a,
0xbb, 0x6a, 0x78, 0x32, 0x5d, 0x73, 0xbd, 0xad, 0x70, 0x43, 0x5d, 0xe1,
0xbf, 0xa0, 0x68, 0xaa, 0x5e, 0x4d, 0xc1, 0x34, 0x61, 0x7b, 0x5e, 0xd5,
0xc1, 0xc4, 0x59, 0xb8, 0x5f, 0x61, 0xc2, 0x1b, 0x51, 0xc1, 0x60, 0x70,
0xc2, 0x1b, 0x4b, 0xa4, 0x61, 0x89, 0xc1, 0xfb, 0x45, 0xd1, 0x62, 0xa0,
0xc1, 0xd5, 0x40, 0x0c, 0x64, 0xb4, 0xc1, 0xfc, 0x3b, 0x81, 0x5a, 0x82,
0xae, 0x4b, 0xb7, 0x64, 0x5d, 0x52, 0xad, 0xf7, 0xad, 0xa2, 0x5f, 0xb9,
0xae, 0x07, 0xa4, 0xee, 0x61, 0xe8, 0xae, 0x5b, 0x9c, 0x4d, 0x63, 0xb1,
0xaf, 0x32, 0x93, 0xa4, 0x64, 0xd6, 0xb0, 0x82, 0x8b, 0x15, 0x65, 0x8f,
0xb2, 0x0b, 0x82, 0xa2, 0x65, 0xf8, 0xb4, 0x17, 0x7a, 0xb0, 0x66, 0x22,
0xb6, 0x5a, 0x72, 0xf3, 0x66, 0x89, 0xb8, 0x60, 0x6b, 0x38, 0x67, 0x06,
0xba, 0x4f, 0x63, 0xba, 0x67, 0x8f, 0xbb, 0xac, 0x5c, 0x1d, 0x68, 0x35,
0xbc, 0x62, 0x54, 0x25, 0x69, 0x14, 0xbc, 0xb6, 0x4d, 0x53, 0x6a, 0x27,
0xbc, 0xac, 0x47, 0x82, 0x6b, 0x23, 0xbc, 0x9c, 0x41, 0x8d, 0x6c, 0xe5,
0xbc, 0xe7, 0x3c, 0xaa, 0x60, 0x70, 0xa8, 0x40, 0xbb, 0x24, 0x63, 0x9a,
0xa7, 0x86, 0xb1, 0x08, 0x66, 0x51, 0xa7, 0x51, 0xa8, 0x2a, 0x68, 0xfa,
0xa7, 0x29, 0x9f, 0x6c, 0x6b, 0x1b, 0xa7, 0xe1, 0x96, 0xe8, 0x6c, 0xe6,
0xa8, 0xd6, 0x8e, 0x65, 0x6d, 0xc1, 0xaa, 0x82, 0x86, 0x00, 0x6e, 0x6d,
0xac, 0x5a, 0x7d, 0xc1, 0x6e, 0xb9, 0xae, 0xb6, 0x75, 0xdf, 0x6f, 0x14,
0xb0, 0xef, 0x6e, 0x02, 0x6f, 0xe0, 0xb2, 0xc1, 0x66, 0x43, 0x70, 0x85,
0xb4, 0x84, 0x5e, 0xc5, 0x71, 0x47, 0xb5, 0xa9, 0x57, 0x1c, 0x72, 0x0a,
0xb6, 0x9f, 0x4f, 0xa2, 0x73, 0x40, 0xb7, 0x13, 0x49, 0xe6, 0x74, 0x73,
0xb7, 0x7e, 0x44, 0x20, 0x76, 0x1d, 0xb8, 0x21, 0x3e, 0x10, 0x66, 0xd7,
0xa1, 0xe9, 0xbe, 0xaf, 0x6a, 0x2e, 0xa1, 0x29, 0xb4, 0xeb, 0x6d, 0x60,
0xa0, 0x95, 0xab, 0xb7, 0x70, 0x4d, 0xa0, 0x37, 0xa2, 0xcb, 0x72, 0xae,
0xa0, 0x8f, 0x9a, 0x45, 0x74, 0xc1, 0xa1, 0x3f, 0x91, 0xeb, 0x76, 0x17,
0xa2, 0xaf, 0x89, 0xa4, 0x77, 0x23, 0xa4, 0x4c, 0x81, 0x61, 0x77, 0xbe,
0xa6, 0x55, 0x79, 0x9b, 0x78, 0x1a, 0xa8, 0x86, 0x71, 0xeb, 0x78, 0xad,
0xaa, 0x91, 0x69, 0xd8, 0x79, 0x4c, 0xac, 0x8d, 0x61, 0xe1, 0x7a, 0x40,
0xae, 0x56, 0x5a, 0x65, 0x7b, 0x36, 0xaf, 0xd9, 0x52, 0xe5, 0x7c, 0x77,
0xb1, 0x09, 0x4c, 0xb4, 0x7d, 0xda, 0xb2, 0x0a, 0x47, 0x0c, 0x7f, 0x5f,
0xb3, 0x03, 0x40, 0xbb, 0x6d, 0xfa, 0x9b, 0x3e, 0xc2, 0x88, 0x71, 0xfa,
0x9a, 0x33, 0xb9, 0x07, 0x75, 0xc5, 0x99, 0x53, 0xaf, 0xfb, 0x78, 0xc8,
0x98, 0xf7, 0xa7, 0x36, 0x7b, 0x7d, 0x98, 0xd8, 0x9e, 0x81, 0x7d, 0x63,
0x99, 0x9b, 0x96, 0x1b, 0x7e, 0xfe, 0x9a, 0x9f, 0x8d, 0xc0, 0x80, 0x0d,
0x9c, 0x3a, 0x85, 0x76, 0x80, 0xf2, 0x9e, 0x0a, 0x7d, 0x61, 0x81, 0x7e,
0xa0, 0x39, 0x75, 0xb8, 0x81, 0xfb, 0xa2, 0x4c, 0x6d, 0xf6, 0x82, 0x8d,
0xa4, 0x2e, 0x65, 0xac, 0x83, 0x51, 0xa6, 0x31, 0x5d, 0xec, 0x84, 0x8d,
0xa8, 0x3d, 0x56, 0xd1, 0x85, 0xae, 0xa9, 0xfd, 0x4f, 0xc5, 0x87, 0x19,
0xab, 0x9d, 0x49, 0xf7, 0x88, 0x9e, 0xad, 0x30, 0x43, 0xbf, 0x76, 0xbe,
0x93, 0xaa, 0xc6, 0xaf, 0x7a, 0xed, 0x92, 0x91, 0xbd, 0x3b, 0x7e, 0x81,
0x91, 0xf0, 0xb4, 0x77, 0x81, 0xa7, 0x91, 0x84, 0xab, 0xbf, 0x84, 0x71,
0x91, 0x57, 0xa2, 0xff, 0x86, 0x7a, 0x91, 0xeb, 0x9a, 0x88, 0x88, 0x1c,
0x92, 0xcb, 0x92, 0x37, 0x89, 0x29, 0x94, 0x3d, 0x89, 0xec, 0x8a, 0x04,
0x95, 0xe1, 0x81, 0xaa, 0x8a, 0xcb, 0x97, 0xe6, 0x79, 0xc5, 0x8b, 0x63,
0x9a, 0x0f, 0x72, 0x12, 0x8c, 0x24, 0x9c, 0x13, 0x6a, 0x07, 0x8c, 0xe1,
0x9d, 0xd6, 0x61, 0xc2, 0x8e, 0x13, 0xa0, 0x32, 0x5a, 0x6d, 0x8f, 0x54,
0xa2, 0x71, 0x53, 0x95, 0x90, 0x96, 0xa4, 0x85, 0x4d, 0x3f, 0x92, 0x1d,
0xa6, 0xb0, 0x46, 0xaa, 0x80, 0x4d, 0x8b, 0xec, 0xcb, 0x19, 0x84, 0x4e,
0x8b, 0x02, 0xc1, 0xeb, 0x87, 0xba, 0x8a, 0x75, 0xb9, 0x38, 0x8a, 0xfb,
0x89, 0xfc, 0xb0, 0x83, 0x8d, 0xa3, 0x8a, 0x0d, 0xa7, 0xde, 0x90, 0x08,
0x8a, 0x4f, 0x9f, 0x48, 0x91, 0x7f, 0x8b, 0x2b, 0x96, 0xf9, 0x92, 0xc2,
0x8c, 0x25, 0x8e, 0xb1, 0x93, 0x73, 0x8d, 0xbf, 0x86, 0x75, 0x94, 0x30,
0x8f, 0x87, 0x7e, 0x3d, 0x95, 0x0d, 0x91, 0x9b, 0x76, 0x55, 0x95, 0xd7,
0x93, 0xbe, 0x6e, 0x97, 0x96, 0xe5, 0x95, 0xe7, 0x66, 0xbc, 0x97, 0xef,
0x97, 0xfc, 0x5e, 0xee, 0x99, 0x56, 0x9a, 0x83, 0x57, 0xd1, 0x9a, 0xab,
0x9c, 0xe0, 0x50, 0xae, 0x9c, 0x14, 0x9f, 0x89, 0x49, 0xa8, 0x89, 0xb9,
0x84, 0x52, 0xcf, 0x98, 0x8d, 0x98, 0x83, 0xb8, 0xc6, 0xc5, 0x91, 0x3d,
0x83, 0x2f, 0xbe, 0x39, 0x94, 0x7a, 0x82, 0xd8, 0xb5, 0x67, 0x97, 0x43,
0x82, 0xc1, 0xac, 0xad, 0x99, 0x69, 0x83, 0x1d, 0xa4, 0x2d, 0x9b, 0x11,
0x83, 0xbd, 0x9b, 0xd1, 0x9c, 0x49, 0x84, 0x93, 0x93, 0x8f, 0x9d, 0x29,
0x85, 0xbb, 0x8b, 0x74, 0x9d, 0xcc, 0x87, 0x2a, 0x83, 0x72, 0x9e, 0xc2,
0x89, 0x3b, 0x7b, 0x6d, 0x9f, 0xd6, 0x8b, 0x87, 0x73, 0x77, 0xa0, 0xe8,
0x8d, 0xdb, 0x6b, 0x90, 0xa2, 0x01, 0x90, 0x2a, 0x63, 0x9c, 0xa3, 0x47,
0x92, 0xa9, 0x5c, 0x40, 0xa4, 0xb2, 0x95, 0x4a, 0x55, 0x1e, 0xa6, 0x19,
0x98, 0x14, 0x4d, 0x9f, 0x94, 0x46, 0x7c, 0x4b, 0xd3, 0xe0, 0x98, 0x10,
0x7b, 0xdc, 0xcb, 0x10, 0x9b, 0x76, 0x7b, 0x77, 0xc2, 0xb4, 0x9e, 0x82,
0x7b, 0x30, 0xba, 0x06, 0xa1, 0x46, 0x7b, 0x03, 0xb1, 0x26, 0xa3, 0x1b,
0x7b, 0x8a, 0xa8, 0xe0, 0xa4, 0xbc, 0x7c, 0x1f, 0xa0, 0xa9, 0xa5, 0xc3,
0x7d, 0x26, 0x98, 0x7f, 0xa6, 0xb0, 0x7e, 0x2d, 0x90, 0x53, 0xa7, 0x56,
0x7f, 0x74, 0x88, 0x62, 0xa8, 0x05, 0x80, 0x80, 0x80, 0x80, 0xa9, 0x47,
0x83, 0x66, 0x78, 0x86, 0xaa, 0x65, 0x85, 0xf3, 0x70, 0x9d, 0xab, 0xba,
0x88, 0x78, 0x68, 0xe8, 0xac, 0xfe, 0x8a, 0xc7, 0x61, 0x2b, 0xae, 0x41,
0x8d, 0xb5, 0x59, 0xa9, 0xaf, 0xba, 0x90, 0xd6, 0x51, 0xaa, 0x9f, 0xf5,
0x72, 0xfe, 0xd7, 0xfc, 0xa3, 0x12, 0x73, 0x37, 0xcf, 0x12, 0xa5, 0xe0,
0x73, 0x5a, 0xc6, 0xcc, 0xa8, 0x8d, 0x73, 0x71, 0xbe, 0x7b, 0xaa, 0xd5,
0x73, 0x8f, 0xb5, 0xf0, 0xac, 0xd1, 0x73, 0xd1, 0xad, 0x98, 0xae, 0x43,
0x74, 0x78, 0xa5, 0x97, 0xaf, 0x7a, 0x75, 0x51, 0x9d, 0x8d, 0xb0, 0x45,
0x76, 0xa5, 0x95, 0x74, 0xb1, 0x04, 0x78, 0x0d, 0x8d, 0x6e, 0xb1, 0xc4,
0x79, 0x92, 0x85, 0x90, 0xb2, 0xa5, 0x7b, 0x59, 0x7d, 0xa7, 0xb3, 0xd7,
0x7d, 0xf8, 0x75, 0xa2, 0xb5, 0x2f, 0x80, 0x90, 0x6d, 0xc3, 0xb6, 0xc3,
0x83, 0x3c, 0x66, 0x19, 0xb8, 0x3c, 0x85, 0xe6, 0x5e, 0x5d, 0xb9, 0x9d,
0x89, 0x2b, 0x56, 0x38, 0xa9, 0xe1, 0x6a, 0xa5, 0xdb, 0xd4, 0xad, 0x30,
0x6b, 0x67, 0xd2, 0x54, 0xaf, 0xdd, 0x6b, 0xbf, 0xca, 0x2b, 0xb2, 0x48,
0x6b, 0xdb, 0xc2, 0x2f, 0xb4, 0x3b, 0x6c, 0x26, 0xba, 0x22, 0xb5, 0xf6,
0x6c, 0x7e, 0xb2, 0x16, 0xb7, 0x51, 0x6d, 0x2c, 0xaa, 0x3d, 0xb8, 0x83,
0x6d, 0xf0, 0xa2, 0x72, 0xb9, 0x6b, 0x6f, 0x17, 0x9a, 0x89, 0xba, 0x36,
0x70, 0x65, 0x92, 0x8f, 0xba, 0xf5, 0x72, 0x30, 0x8a, 0xac, 0xbb, 0xb4,
0x73, 0xfb, 0x82, 0xd7, 0xbc, 0xc4, 0x76, 0x50, 0x7a, 0xe1, 0xbd, 0xfb,
0x78, 0xe8, 0x72, 0xe3, 0xbf, 0x86, 0x7b, 0x9f, 0x6b, 0x03, 0xc1, 0x55,
0x7e, 0x6c, 0x63, 0x21, 0xc3, 0x1a, 0x81, 0xb4, 0x5a, 0xd1, 0xb3, 0xa1,
0x63, 0x5a, 0xdd, 0x0b, 0xb6, 0x8e, 0x64, 0x1e, 0xd4, 0x6c, 0xb9, 0x01,
0x64, 0x72, 0xcc, 0x99, 0xbb, 0x30, 0x64, 0xa0, 0xc5, 0x16, 0xbd, 0x1b,
0x64, 0xef, 0xbd, 0x9e, 0xbe, 0x91, 0x65, 0x88, 0xb6, 0x27, 0xbf, 0xf0,
0x66, 0x27, 0xae, 0xb4, 0xc1, 0x06, 0x67, 0x26, 0xa7, 0x46, 0xc2, 0x0b,
0x68, 0x1e, 0x9f, 0xc9, 0xc2, 0xac, 0x69, 0x8d, 0x98, 0x20, 0xc3, 0x56,
0x6a, 0xea, 0x90, 0x67, 0xc4, 0x23, 0x6c, 0xe2, 0x88, 0x3d, 0xc5, 0x04,
0x6e, 0xc1, 0x80, 0x35, 0xc6, 0x7e, 0x71, 0x8e, 0x78, 0x05, 0xc7, 0xc1,
0x74, 0x3f, 0x6f, 0xf6, 0xc9, 0x1c, 0x77, 0x71, 0x67, 0xc9, 0xca, 0xdc,
0x7a, 0xf5, 0x5e, 0xb9, 0xbc, 0xc4, 0x5d, 0x86, 0xdd, 0xf0, 0xbf, 0x52,
0x5d, 0xec, 0xd5, 0xe0, 0xc1, 0x95, 0x5e, 0x16, 0xce, 0x93, 0xc3, 0x93,
0x5e, 0x4f, 0xc7, 0xb3, 0xc5, 0x6f, 0x5e, 0x79, 0xc0, 0xd9, 0xc6, 0xc0,
0x5e, 0xf8, 0xb9, 0xf0, 0xc7, 0xf3, 0x5f, 0x80, 0xb2, 0xf4, 0xc9, 0x07,
0x60, 0x59, 0xab, 0xdd, 0xc9, 0xfb, 0x61, 0x8a, 0xa4, 0xb2, 0xca, 0xc5,
0x62, 0xd9, 0x9d, 0x5f, 0xcb, 0x5a, 0x64, 0x65, 0x95, 0xce, 0xcb, 0xf8,
0x66, 0x07, 0x8e, 0x0c, 0xcc, 0xb1, 0x68, 0x0f, 0x85, 0xdc, 0xcd, 0xb4,
0x6a, 0x4a, 0x7d, 0x9d, 0xcf, 0x6a, 0x6d, 0x41, 0x75, 0x11, 0xd1, 0x2f,
0x70, 0x60, 0x6c, 0x7c, 0xd2, 0xa9, 0x74, 0x82, 0x62, 0x0c, 0xc5, 0xbc,
0x57, 0xbc, 0xde, 0x0c, 0xc8, 0x1e, 0x58, 0x4f, 0xd7, 0x30, 0xca, 0x48,
0x58, 0xe7, 0xd0, 0x9a, 0xcb, 0xfb, 0x59, 0x31, 0xca, 0x32, 0xcd, 0x8b,
0x59, 0x5f, 0xc3, 0xd1, 0xce, 0xd7, 0x59, 0xaf, 0xbd, 0x68, 0xcf, 0xd4,
0x5a, 0x3d, 0xb6, 0xe0, 0xd0, 0xd0, 0x5a, 0xcc, 0xb0, 0x4a, 0xd1, 0xac,
0x5b, 0xcb, 0xa9, 0x69, 0xd2, 0x81, 0x5c, 0xd0, 0xa2, 0x71, 0xd3, 0x37,
0x5e, 0x10, 0x9b, 0x17, 0xd3, 0xe7, 0x5f, 0x71, 0x93, 0x91, 0xd4, 0x8f,
0x61, 0x4e, 0x8b, 0xa4, 0xd5, 0x3b, 0x63, 0x7d, 0x83, 0x6d, 0xd6, 0x57,
0x66, 0x2b, 0x7a, 0xc3, 0xd7, 0xf1, 0x69, 0x3f, 0x71, 0xdc, 0xd9, 0xec,
0x6c, 0xe4, 0x68, 0x4f, 0xcf, 0x76, 0x51, 0xcf, 0xde, 0x40, 0xd1, 0x92,
0x52, 0x95, 0xd8, 0x6a, 0xd3, 0xae, 0x53, 0x06, 0xd2, 0xbe, 0xd5, 0x44,
0x53, 0x64, 0xcc, 0xe8, 0xd6, 0xa2, 0x53, 0xaf, 0xc7, 0x02, 0xd7, 0xae,
0x54, 0x40, 0xc0, 0xf8, 0xd8, 0xae, 0x54, 0xd7, 0xba, 0xd1, 0xd9, 0x6a,
0x55, 0x91, 0xb4, 0x7b, 0xda, 0x19, 0x56, 0x56, 0xad, 0xfd, 0xda, 0xd5,
0x57, 0x2b, 0xa7, 0x55, 0xdb, 0x86, 0x58, 0x06, 0xa0, 0x98, 0xdc, 0x2f,
0x59, 0x41, 0x99, 0x4d, 0xdc, 0xe6, 0x5a, 0x82, 0x91, 0xf7, 0xdd, 0x71,
0x5c, 0xa1, 0x89, 0xb6, 0xde, 0x54, 0x5e, 0xfe, 0x81, 0x3d, 0xdf, 0x47,
0x62, 0x12, 0x77, 0xdb, 0xe0, 0xd7, 0x65, 0x62, 0x6e, 0x2b, 0x53, 0x47,
0xc3, 0xc7, 0xb3, 0xac, 0x54, 0x42, 0xc4, 0xcc, 0xab, 0x4e, 0x54, 0x8a,
0xc6, 0x40, 0xa3, 0x25, 0x54, 0x73, 0xc7, 0xc3, 0x9a, 0xb0, 0x54, 0x14,
0xc9, 0x3b, 0x92, 0x09, 0x53, 0xe4, 0xca, 0x81, 0x89, 0x8e, 0x53, 0xae,
0xcb, 0xb9, 0x81, 0x19, 0x53, 0x8a, 0xcc, 0xd4, 0x79, 0x6b, 0x53, 0x61,
0xcd, 0xcd, 0x71, 0xd7, 0x53, 0x21, 0xce, 0xed, 0x6a, 0xa8, 0x52, 0xfb,
0xcf, 0xe4, 0x63, 0xa7, 0x52, 0xcc, 0xd0, 0x6b, 0x5c, 0xae, 0x52, 0x1a,
0xd0, 0xdd, 0x55, 0x92, 0x52, 0xab, 0xd0, 0xbb, 0x4e, 0xb7, 0x54, 0x3e,
0xcf, 0xd4, 0x48, 0x55, 0x54, 0xb8, 0xcf, 0x6c, 0x41, 0xcb, 0x56, 0xf8,
0xce, 0xfe, 0x3c, 0xc2, 0x58, 0x9d, 0xbe, 0x5e, 0xb6, 0x1c, 0x5a, 0x7e,
0xbe, 0xb3, 0xad, 0x54, 0x5b, 0x63, 0xbf, 0xc4, 0xa5, 0x05, 0x5b, 0xde,
0xc1, 0x07, 0x9c, 0x94, 0x5c, 0x00, 0xc2, 0x6b, 0x93, 0xd5, 0x5c, 0x1d,
0xc3, 0xc8, 0x8b, 0x37, 0x5c, 0x36, 0xc5, 0x1a, 0x82, 0xac, 0x5c, 0x1e,
0xc6, 0xa6, 0x7a, 0xc3, 0x5b, 0xf8, 0xc8, 0x25, 0x73, 0x1e, 0x5c, 0x05,
0xc9, 0x7f, 0x6b, 0xe8, 0x5c, 0x1d, 0xca, 0xc7, 0x65, 0x0d, 0x5c, 0x2e,
0xcb, 0xc5, 0x5e, 0x2f, 0x5c, 0x64, 0xcb, 0xc2, 0x56, 0xb4, 0x5c, 0xa5,
0xcb, 0xb5, 0x4f, 0x77, 0x5d, 0xa3, 0xcb, 0x1c, 0x49, 0x89, 0x5e, 0xa5,
0xca, 0x8b, 0x43, 0x92, 0x60, 0x13, 0xca, 0x40, 0x3e, 0x2a, 0x5d, 0x53,
0xb9, 0x16, 0xb8, 0xd8, 0x5f, 0xb4, 0xb9, 0x0e, 0xaf, 0x86, 0x61, 0x24,
0xb9, 0xbe, 0xa7, 0x18, 0x62, 0x72, 0xba, 0x85, 0x9e, 0xa2, 0x63, 0x52,
0xbb, 0xa8, 0x95, 0xdd, 0x63, 0xf3, 0xbc, 0xf5, 0x8d, 0x28, 0x64, 0x4c,
0xbe, 0x7c, 0x84, 0x7a, 0x64, 0x60, 0xc0, 0x57, 0x7c, 0x4c, 0x64, 0x40,
0xc2, 0x3a, 0x74, 0xbe, 0x64, 0x4d, 0xc3, 0xe2, 0x6d, 0x6b, 0x64, 0x94,
0xc5, 0x5a, 0x66, 0x8f, 0x64, 0xbb, 0xc6, 0xcb, 0x5f, 0xe4, 0x65, 0x0e,
0xc6, 0xd1, 0x58, 0x32, 0x65, 0x5b, 0xc6, 0xf3, 0x50, 0x81, 0x66, 0x3f,
0xc6, 0x72, 0x4a, 0x9f, 0x67, 0x27, 0xc5, 0xf6, 0x44, 0xad, 0x68, 0x51,
0xc5, 0x95, 0x3e, 0xe1, 0x62, 0x1b, 0xb4, 0x0b, 0xbc, 0x2b, 0x64, 0xc3,
0xb3, 0xa5, 0xb2, 0x22, 0x66, 0xde, 0xb3, 0xc3, 0xa9, 0x5e, 0x68, 0xd9,
0xb3, 0xff, 0xa0, 0xe2, 0x6a, 0x5c, 0xb4, 0xd9, 0x98, 0x38, 0x6b, 0xac,
0xb5, 0xd6, 0x8f, 0x8e, 0x6c, 0x36, 0xb7, 0x5c, 0x87, 0x15, 0x6c, 0x9a,
0xb9, 0x03, 0x7e, 0xb3, 0x6c, 0xa3, 0xbb, 0x43, 0x77, 0x11, 0x6c, 0x93,
0xbd, 0x80, 0x6f, 0x7d, 0x6c, 0xe7, 0xbf, 0x77, 0x68, 0x5d, 0x6d, 0x32,
0xc1, 0x19, 0x61, 0x98, 0x6d, 0xa1, 0xc1, 0xa9, 0x5a, 0x13, 0x6e, 0x17,
0xc1, 0xfb, 0x52, 0x32, 0x6e, 0xcb, 0xc1, 0xa1, 0x4b, 0xde, 0x6f, 0x8c,
0xc1, 0x1c, 0x45, 0xe0, 0x70, 0x55, 0xc0, 0xa4, 0x3f, 0xd9, 0x66, 0xe1,
0xaf, 0x17, 0xc0, 0xc3, 0x6a, 0x41, 0xae, 0x17, 0xb5, 0x7d, 0x6c, 0xf9,
0xad, 0x93, 0xac, 0x2b, 0x6f, 0x67, 0xad, 0x7a, 0xa3, 0xa2, 0x71, 0x7c,
0xad, 0xea, 0x9b, 0x09, 0x73, 0x41, 0xae, 0xc7, 0x92, 0x56, 0x74, 0x35,
0xb0, 0x2b, 0x89, 0xf1, 0x74, 0xdc, 0xb1, 0xa4, 0x81, 0xb5, 0x75, 0x20,
0xb3, 0xab, 0x79, 0xf8, 0x75, 0x36, 0xb5, 0xd4, 0x72, 0x6d, 0x75, 0x8e,
0xb7, 0xca, 0x6b, 0x07, 0x75, 0xe6, 0xb9, 0xb7, 0x63, 0xe3, 0x76, 0x4c,
0xbb, 0x1f, 0x5c, 0xa2, 0x76, 0xe0, 0xbb, 0xcd, 0x54, 0xf8, 0x77, 0x9f,
0xbc, 0x29, 0x4e, 0x12, 0x78, 0xbd, 0xbc, 0x3b, 0x48, 0x44, 0x7a, 0x14,
0xbc, 0x5a, 0x41, 0x9e, 0x6d, 0x76, 0xa8, 0xd5, 0xc3, 0x8c, 0x70, 0xec,
0xa7, 0xb7, 0xb9, 0x44, 0x74, 0x42, 0xa6, 0xc6, 0xaf, 0xba, 0x76, 0xd9,
0xa6, 0x8e, 0xa7, 0x02, 0x79, 0x31, 0xa6, 0x89, 0x9e, 0x5a, 0x7b, 0x03,
0xa7, 0x4f, 0x95, 0xdf, 0x7c, 0x80, 0xa8, 0x58, 0x8d, 0x78, 0x7d, 0x59,
0xa9, 0xe8, 0x85, 0x4a, 0x7d, 0xea, 0xab, 0xb0, 0x7d, 0x53, 0x7e, 0x04,
0xad, 0xee, 0x75, 0xb9, 0x7e, 0x1a, 0xb0, 0x22, 0x6e, 0x18, 0x7e, 0xa5,
0xb1, 0xf3, 0x66, 0xa3, 0x7f, 0x0e, 0xb3, 0xc6, 0x5f, 0x68, 0x7f, 0xec,
0xb4, 0xda, 0x58, 0x2f, 0x80, 0xae, 0xb5, 0xce, 0x50, 0xde, 0x81, 0xef,
0xb6, 0x92, 0x4a, 0xf3, 0x83, 0x61, 0xb7, 0x62, 0x44, 0x73, 0x74, 0xb0,
0xa2, 0x23, 0xc6, 0xe8, 0x78, 0xbd, 0xa0, 0xca, 0xbc, 0xa9, 0x7b, 0xfc,
0xa0, 0x02, 0xb3, 0x91, 0x7e, 0xc3, 0x9f, 0x8f, 0xaa, 0xaa, 0x81, 0x38,
0x9f, 0x50, 0xa1, 0xd7, 0x83, 0x0d, 0x9f, 0xe9, 0x99, 0x71, 0x84, 0xb4,
0xa0, 0xb2, 0x91, 0x31, 0x85, 0xd1, 0xa2, 0x30, 0x89, 0x13, 0x86, 0xb5,
0xa3, 0xc5, 0x80, 0xf4, 0x87, 0x1b, 0xa5, 0xda, 0x79, 0x64, 0x87, 0x4e,
0xa8, 0x05, 0x71, 0xea, 0x87, 0xb1, 0xa9, 0xf8, 0x6a, 0x26, 0x88, 0x16,
0xab, 0xda, 0x62, 0x74, 0x88, 0xe9, 0xad, 0x90, 0x5b, 0x37, 0x89, 0xdc,
0xae, 0xf9, 0x54, 0x08, 0x8b, 0x03, 0xb0, 0x48, 0x4d, 0x71, 0x8c, 0x89,
0xb1, 0x9e, 0x47, 0x36, 0x7d, 0x4d, 0x9a, 0xb7, 0xca, 0xcc, 0x81, 0xba,
0x99, 0x36, 0xc0, 0xd0, 0x84, 0xca, 0x98, 0x97, 0xb7, 0xff, 0x87, 0xb4,
0x98, 0x11, 0xaf, 0x33, 0x8a, 0x2c, 0x97, 0xfe, 0xa6, 0x7f, 0x8c, 0x51,
0x98, 0x38, 0x9d, 0xeb, 0x8d, 0xba, 0x99, 0x1b, 0x95, 0x9c, 0x8e, 0xdb,
0x9a, 0x46, 0x8d, 0x55, 0x8f, 0x94, 0x9b, 0xf9, 0x85, 0x25, 0x90, 0x28,
0x9d, 0xdb, 0x7d, 0x2d, 0x90, 0x79, 0xa0, 0x0d, 0x75, 0xa5, 0x90, 0xe3,
0xa2, 0x0f, 0x6e, 0x20, 0x91, 0x98, 0xa3, 0xad, 0x66, 0x27, 0x92, 0x54,
0xa5, 0x73, 0x5e, 0x96, 0x93, 0x82, 0xa7, 0x68, 0x57, 0xbc, 0x94, 0xa4,
0xa9, 0x1f, 0x50, 0xcd, 0x96, 0x1b, 0xaa, 0xf8, 0x4a, 0x2d, 0x85, 0xd4,
0x93, 0x5f, 0xcf, 0x44, 0x89, 0xe5, 0x92, 0x1c, 0xc5, 0x81, 0x8d, 0x5d,
0x91, 0x28, 0xbc, 0x82, 0x90, 0x5f, 0x90, 0x90, 0xb3, 0x98, 0x93, 0x04,
0x90, 0x8b, 0xaa, 0xee, 0x95, 0x4c, 0x90, 0xd1, 0xa2, 0x66, 0x96, 0xd5,
0x91, 0x89, 0x9a, 0x16, 0x98, 0x07, 0x92, 0x66, 0x91, 0xd2, 0x98, 0xd7,
0x93, 0xe2, 0x89, 0xb4, 0x99, 0x83, 0x95, 0x85, 0x81, 0xaa, 0x9a, 0x1e,
0x97, 0x8c, 0x79, 0xf5, 0x9a, 0x80, 0x99, 0xb9, 0x72, 0x79, 0x9b, 0x30,
0x9b, 0xb0, 0x6a, 0xb2, 0x9c, 0x0e, 0x9d, 0x57, 0x62, 0xa3, 0x9d, 0x3d,
0x9f, 0x70, 0x5b, 0x42, 0x9e, 0x99, 0xa1, 0xa2, 0x54, 0x5d, 0xa0, 0x19,
0xa3, 0xda, 0x4d, 0x2d, 0x8f, 0x02, 0x8b, 0xe9, 0xd3, 0x3f, 0x93, 0x25,
0x8a, 0xea, 0xca, 0x0e, 0x96, 0xd2, 0x8a, 0x17, 0xc1, 0x4c, 0x99, 0xed,
0x89, 0xa6, 0xb8, 0x82, 0x9c, 0xd4, 0x89, 0x49, 0xaf, 0xbb, 0x9e, 0xce,
0x89, 0xa4, 0xa7, 0x48, 0xa0, 0x87, 0x8a, 0x15, 0x9e, 0xe0, 0xa1, 0x7e,
0x8a, 0xf3, 0x96, 0x9f, 0xa2, 0x53, 0x8b, 0xf5, 0x8e, 0x6b, 0xa2, 0xe2,
0x8d, 0x81, 0x86, 0x6f, 0xa3, 0x7e, 0x8f, 0x39, 0x7e, 0x73, 0xa4, 0x59,
0x91, 0x53, 0x76, 0xad, 0xa5, 0x08, 0x93, 0x70, 0x6f, 0x1a, 0xa6, 0x08,
0x95, 0x97, 0x67, 0x64, 0xa7, 0x01, 0x97, 0x92, 0x5f, 0xa9, 0xa8, 0x60,
0x9a, 0x17, 0x58, 0x75, 0xa9, 0xca, 0x9c, 0x8c, 0x50, 0xbd, 0x99, 0xa7,
0x84, 0x3d, 0xd7, 0x5a, 0x9d, 0x5e, 0x83, 0xb9, 0xce, 0x20, 0xa0, 0x9a,
0x83, 0x20, 0xc5, 0xbe, 0xa3, 0x94, 0x82, 0xa8, 0xbd, 0x3f, 0xa6, 0x43,
0x82, 0x57, 0xb4, 0x6e, 0xa8, 0x50, 0x82, 0x69, 0xab, 0xed, 0xa9, 0xc2,
0x82, 0xdd, 0xa3, 0xa1, 0xaa, 0xd3, 0x83, 0x9e, 0x9b, 0x6a, 0xab, 0x9e,
0x84, 0x9e, 0x93, 0x42, 0xac, 0x50, 0x85, 0xcf, 0x8b, 0x4a, 0xac, 0xed,
0x87, 0x2a, 0x83, 0x71, 0xad, 0xc5, 0x89, 0x32, 0x7b, 0x93, 0xae, 0xb8,
0x8b, 0x82, 0x73, 0xbc, 0xaf, 0xc9, 0x8d, 0xb8, 0x6b, 0xfc, 0xb1, 0x04,
0x8f, 0xce, 0x64, 0x3c, 0xb2, 0x3f, 0x92, 0x47, 0x5c, 0xc0, 0xb3, 0xaf,
0x95, 0x45, 0x54, 0xae, 0xa4, 0x8c, 0x7c, 0x2b, 0xdb, 0x77, 0xa7, 0xa3,
0x7c, 0x1b, 0xd2, 0x75, 0xaa, 0x9e, 0x7b, 0xc9, 0xca, 0x00, 0xad, 0x79,
0x7b, 0x6f, 0xc1, 0xa5, 0xaf, 0xe9, 0x7b, 0x31, 0xb9, 0x1d, 0xb2, 0x0e,
0x7a, 0xfb, 0xb0, 0x96, 0xb3, 0x43, 0x7b, 0x7d, 0xa8, 0x72, 0xb4, 0x59,
0x7c, 0x06, 0xa0, 0x56, 0xb4, 0xfd, 0x7d, 0x35, 0x98, 0x38, 0xb5, 0x8b,
0x7e, 0x5f, 0x90, 0x15, 0xb6, 0x52, 0x7f, 0x8d, 0x88, 0x44, 0xb7, 0x16,
0x80, 0x80, 0x80, 0x80, 0xb8, 0x39, 0x83, 0x4d, 0x78, 0xa3, 0xb9, 0x45,
0x85, 0xc0, 0x70, 0xd1, 0xba, 0xd0, 0x88, 0x3c, 0x69, 0x1c, 0xbc, 0x65,
0x8a, 0x8f, 0x61, 0x59, 0xbd, 0xf0, 0x8d, 0x76, 0x59, 0x37, 0xae, 0xd4,
0x73, 0xe1, 0xdf, 0x32, 0xb1, 0xe2, 0x73, 0xf4, 0xd6, 0x29, 0xb4, 0x99,
0x73, 0xe9, 0xcd, 0xb6, 0xb7, 0x0f, 0x73, 0xbe, 0xc5, 0x69, 0xb9, 0x40,
0x73, 0x9f, 0xbd, 0x26, 0xba, 0xfd, 0x73, 0xb3, 0xb4, 0xf0, 0xbc, 0x6d,
0x74, 0x07, 0xac, 0xe8, 0xbd, 0x79, 0x74, 0xb1, 0xa5, 0x0e, 0xbe, 0x59,
0x75, 0x93, 0x9d, 0x2e, 0xbe, 0xf4, 0x76, 0xdb, 0x95, 0x3e, 0xbf, 0x91,
0x78, 0x3b, 0x8d, 0x53, 0xc0, 0x58, 0x79, 0xb5, 0x85, 0x8b, 0xc1, 0x3e,
0x7b, 0x65, 0x7d, 0xb7, 0xc2, 0x6e, 0x7d, 0xdf, 0x75, 0xc3, 0xc3, 0xc1,
0x80, 0x60, 0x6d, 0xde, 0xc5, 0x5a, 0x83, 0x4d, 0x66, 0x0f, 0xc7, 0x01,
0x86, 0x5d, 0x5d, 0xa0, 0xb8, 0x7b, 0x6c, 0x2e, 0xe1, 0x80, 0xbb, 0x5d,
0x6c, 0x5d, 0xd8, 0xa5, 0xbd, 0xe7, 0x6c, 0x70, 0xd0, 0x79, 0xc0, 0x24,
0x6c, 0x61, 0xc8, 0x80, 0xc2, 0x3b, 0x6c, 0x4c, 0xc0, 0xae, 0xc3, 0xaa,
0x6c, 0x94, 0xb8, 0xfb, 0xc4, 0xf4, 0x6c, 0xde, 0xb1, 0x49, 0xc5, 0xf8,
0x6d, 0x95, 0xa9, 0xa7, 0xc6, 0xe7, 0x6e, 0x56, 0xa2, 0x02, 0xc7, 0xa7,
0x6f, 0x7d, 0x9a, 0x3d, 0xc8, 0x52, 0x70, 0xcc, 0x92, 0x74, 0xc9, 0x08,
0x72, 0x86, 0x8a, 0xa6, 0xc9, 0xc5, 0x74, 0x3a, 0x82, 0xd9, 0xca, 0xe1,
0x76, 0x85, 0x7a, 0xe2, 0xcc, 0x2c, 0x79, 0x0c, 0x72, 0xe8, 0xcd, 0x90,
0x7b, 0xf4, 0x6a, 0xcd, 0xcf, 0x50, 0x7f, 0x62, 0x61, 0xfb, 0xc2, 0x1c,
0x65, 0x4d, 0xe2, 0x81, 0xc4, 0xa3, 0x65, 0x5d, 0xda, 0x34, 0xc6, 0xde,
0x65, 0x5b, 0xd2, 0xb0, 0xc8, 0xda, 0x65, 0x66, 0xcb, 0x56, 0xca, 0xa3,
0x65, 0x6e, 0xc4, 0x0f, 0xcc, 0x15, 0x65, 0xad, 0xbc, 0xd0, 0xcd, 0x27,
0x66, 0x2f, 0xb5, 0x8a, 0xce, 0x23, 0x66, 0xce, 0xae, 0x3f, 0xcf, 0x00,
0x67, 0xd0, 0xa6, 0xee, 0xcf, 0xd4, 0x68, 0xc9, 0x9f, 0x8d, 0xd0, 0x73,
0x6a, 0x34, 0x97, 0xe4, 0xd1, 0x14, 0x6b, 0x8d, 0x90, 0x34, 0xd1, 0xe9,
0x6d, 0x5c, 0x88, 0x2c, 0xd2, 0xc8, 0x6f, 0x0b, 0x80, 0x30, 0xd4, 0x5c,
0x71, 0xf6, 0x77, 0xcc, 0xd5, 0xcb, 0x74, 0xc9, 0x6f, 0x93, 0xd7, 0x64,
0x78, 0x69, 0x66, 0x03, 0xcb, 0xbc, 0x5e, 0x32, 0xe2, 0x77, 0xcd, 0xcb,
0x5e, 0x7a, 0xdb, 0x5e, 0xcf, 0xc5, 0x5e, 0xc1, 0xd4, 0x9b, 0xd1, 0xb8,
0x5e, 0xd5, 0xcd, 0xfc, 0xd3, 0x35, 0x5e, 0xde, 0xc7, 0x3c, 0xd4, 0x87,
0x5e, 0xf9, 0xc0, 0x73, 0xd5, 0x7d, 0x5f, 0x79, 0xb9, 0x97, 0xd6, 0x63,
0x5f, 0xff, 0xb2, 0xa8, 0xd7, 0x2b, 0x61, 0x06, 0xab, 0x9e, 0xd7, 0xe3,
0x62, 0x35, 0xa4, 0x7a, 0xd8, 0x8f, 0x63, 0x7b, 0x9d, 0x2e, 0xd9, 0x2f,
0x64, 0xf2, 0x95, 0xae, 0xd9, 0xcf, 0x66, 0x8a, 0x8d, 0xfd, 0xda, 0x80,
0x68, 0x8e, 0x85, 0xd0, 0xdb, 0x76, 0x6a, 0xbc, 0x7d, 0x71, 0xdd, 0x45,
0x6d, 0xda, 0x74, 0x89, 0xdf, 0x3e, 0x71, 0x46, 0x6b, 0x45, 0xd5, 0xe3,
0x57, 0x51, 0xe2, 0xf8, 0xd8, 0x09, 0x57, 0x81, 0xdc, 0xbb, 0xd9, 0xfc,
0x57, 0xd1, 0xd6, 0xc2, 0xdb, 0xcf, 0x58, 0x1f, 0xd0, 0xca, 0xdd, 0x03,
0x58, 0x98, 0xca, 0x90, 0xdd, 0xc9, 0x59, 0x4f, 0xc4, 0x21, 0xde, 0x7a,
0x5a, 0x01, 0xbd, 0x97, 0xdf, 0x3c, 0x5a, 0x9c, 0xb7, 0x04, 0xdf, 0xd4,
0x5b, 0x47, 0xb0, 0x53, 0xe0, 0x66, 0x5c, 0x2b, 0xa9, 0x6f, 0xe0, 0xfa,
0x5d, 0x17, 0xa2, 0x77, 0xe1, 0x9c, 0x5e, 0x49, 0x9b, 0x2d, 0xe2, 0x54,
0x5f, 0x92, 0x93, 0xbe, 0xe2, 0xfc, 0x61, 0x7a, 0x8b, 0xd0, 0xe3, 0xb9,
0x63, 0xa0, 0x83, 0x88, 0xe4, 0xb7, 0x66, 0x5a, 0x7a, 0xab, 0xe6, 0x54,
0x69, 0xb7, 0x71, 0x21, 0x5a, 0x8c, 0xc8, 0x37, 0xb7, 0x9b, 0x5b, 0xc2,
0xc9, 0x3e, 0xaf, 0x71, 0x5b, 0x8d, 0xcb, 0x52, 0xa7, 0x4b, 0x5b, 0x7c,
0xcd, 0x40, 0x9f, 0x57, 0x5a, 0x9b, 0xcf, 0x13, 0x96, 0x82, 0x5a, 0x83,
0xd0, 0x12, 0x8d, 0xfe, 0x59, 0xdc, 0xd1, 0x45, 0x85, 0x9d, 0x59, 0xd3,
0xd1, 0xf6, 0x7d, 0x9f, 0x59, 0xec, 0xd2, 0x8d, 0x76, 0x3b, 0x59, 0xf0,
0xd3, 0x24, 0x6e, 0xfc, 0x59, 0x9c, 0xd3, 0xf2, 0x68, 0x6a, 0x59, 0x3e,
0xd4, 0xb1, 0x61, 0xdc, 0x58, 0x6b, 0xd5, 0x16, 0x5a, 0xfc, 0x58, 0xe6,
0xd4, 0xbc, 0x54, 0x22, 0x58, 0x41, 0xd4, 0xd0, 0x4d, 0x58, 0x5a, 0xa6,
0xd3, 0x64, 0x47, 0x4b, 0x5b, 0x13, 0xd2, 0xe1, 0x40, 0xcf, 0x60, 0x0f,
0xc3, 0x00, 0xba, 0x1d, 0x61, 0xd5, 0xc3, 0x80, 0xb1, 0x89, 0x62, 0x8f,
0xc4, 0xae, 0xa9, 0x4b, 0x62, 0xee, 0xc6, 0x2c, 0xa1, 0x29, 0x63, 0x27,
0xc7, 0x6d, 0x98, 0x86, 0x63, 0x4d, 0xc8, 0x9c, 0x8f, 0xcd, 0x63, 0x56,
0xc9, 0xe4, 0x87, 0x5a, 0x63, 0x49, 0xcb, 0x31, 0x7f, 0x0b, 0x63, 0x12,
0xcc, 0xa8, 0x77, 0x8e, 0x62, 0xdd, 0xcd, 0xfc, 0x70, 0x0d, 0x62, 0xd5,
0xcf, 0x4e, 0x69, 0x96, 0x62, 0xb4, 0xd0, 0x5c, 0x63, 0x3c, 0x62, 0x9b,
0xd0, 0xbc, 0x5c, 0x83, 0x62, 0x8f, 0xd0, 0x93, 0x55, 0x33, 0x62, 0xc0,
0xd0, 0x42, 0x4e, 0x50, 0x63, 0x88, 0xcf, 0x58, 0x48, 0x6b, 0x64, 0x5b,
0xce, 0x70, 0x42, 0x50, 0x64, 0xa7, 0xbe, 0x7f, 0xbd, 0xa8, 0x67, 0x12,
0xbe, 0x7b, 0xb3, 0xd6, 0x68, 0x9f, 0xbe, 0xf8, 0xab, 0x47, 0x69, 0xa2,
0xbf, 0xf6, 0xa2, 0xe0, 0x6a, 0x5e, 0xc0, 0xfb, 0x9a, 0x54, 0x6a, 0xf6,
0xc2, 0x08, 0x91, 0xab, 0x6b, 0x46, 0xc3, 0x4c, 0x89, 0x1d, 0x6b, 0x77,
0xc4, 0x9b, 0x80, 0x97, 0x6b, 0x5d, 0xc6, 0x50, 0x79, 0x38, 0x6b, 0x26,
0xc7, 0xec, 0x71, 0xe3, 0x6b, 0x1f, 0xc9, 0x73, 0x6b, 0x28, 0x6b, 0x0b,
0xca, 0xfc, 0x64, 0xb8, 0x6a, 0xe1, 0xcc, 0x3c, 0x5e, 0x2b, 0x6a, 0xf2,
0xcb, 0xf5, 0x56, 0x9b, 0x6b, 0x15, 0xcb, 0xc0, 0x4f, 0x4c, 0x6b, 0xeb,
0xca, 0xce, 0x49, 0x6e, 0x6c, 0xbd, 0xc9, 0xea, 0x43, 0x44, 0x69, 0x63,
0xb9, 0x9f, 0xc1, 0x49, 0x6c, 0x1f, 0xb9, 0x3f, 0xb6, 0x9d, 0x6e, 0x3f,
0xb9, 0x15, 0xad, 0xa2, 0x6f, 0xd1, 0xb9, 0xa2, 0xa5, 0x24, 0x71, 0x3d,
0xba, 0x59, 0x9c, 0x9f, 0x72, 0x50, 0xbb, 0x60, 0x93, 0xf7, 0x72, 0xf0,
0xbc, 0xac, 0x8b, 0x64, 0x73, 0x32, 0xbe, 0x2b, 0x82, 0xbf, 0x73, 0x3a,
0xc0, 0x1f, 0x7a, 0xfd, 0x73, 0x40, 0xc1, 0xdd, 0x73, 0xd6, 0x73, 0x4d,
0xc3, 0x7c, 0x6c, 0xee, 0x73, 0x62, 0xc5, 0x0c, 0x66, 0x62, 0x73, 0x50,
0xc6, 0xa9, 0x60, 0x01, 0x73, 0x83, 0xc6, 0xa1, 0x58, 0x6b, 0x73, 0xad,
0xc6, 0xaf, 0x50, 0xc6, 0x74, 0x72, 0xc6, 0x04, 0x4a, 0xc6, 0x75, 0x55,
0xc5, 0x63, 0x44, 0x63, 0x6e, 0x49, 0xb4, 0xd5, 0xc5, 0x7a, 0x71, 0x95,
0xb3, 0xec, 0xb9, 0xd7, 0x74, 0x3c, 0xb3, 0x36, 0xb0, 0x4b, 0x76, 0x55,
0xb3, 0x56, 0xa7, 0xd3, 0x78, 0x48, 0xb3, 0x87, 0x9f, 0x64, 0x79, 0xc0,
0xb4, 0x68, 0x96, 0xb8, 0x7a, 0xeb, 0xb5, 0x6e, 0x8e, 0x2c, 0x7b, 0x68,
0xb6, 0xe1, 0x85, 0xed, 0x7b, 0xb4, 0xb8, 0x87, 0x7d, 0xe3, 0x7b, 0xa9,
0xba, 0x9e, 0x76, 0x8e, 0x7b, 0x90, 0xbc, 0xb0, 0x6f, 0x4e, 0x7b, 0xa2,
0xbe, 0xb4, 0x68, 0x63, 0x7b, 0xa2, 0xc0, 0x88, 0x61, 0xbd, 0x7b, 0xeb,
0xc1, 0x13, 0x5a, 0x81, 0x7c, 0x43, 0xc1, 0x43, 0x52, 0xf7, 0x7d, 0x10,
0xc1, 0x39, 0x4c, 0x83, 0x7e, 0x68, 0xc1, 0x1b, 0x45, 0x8d, 0x74, 0x68,
0xaf, 0x72, 0xc8, 0xa6, 0x78, 0x54, 0xad, 0xd5, 0xbc, 0xf3, 0x7b, 0x14,
0xad, 0x21, 0xb3, 0xac, 0x7d, 0x70, 0xac, 0xd9, 0xaa, 0xf7, 0x7f, 0x90,
0xac, 0xc0, 0xa2, 0x72, 0x81, 0x52, 0xad, 0x55, 0x99, 0xe0, 0x82, 0xda,
0xae, 0x2e, 0x91, 0x40, 0x83, 0x87, 0xaf, 0xa5, 0x89, 0x11, 0x84, 0x0c,
0xb1, 0x1a, 0x80, 0xfa, 0x84, 0x2d, 0xb3, 0x18, 0x79, 0x94, 0x84, 0x2c,
0xb5, 0x20, 0x72, 0x54, 0x84, 0x52, 0xb7, 0x07, 0x6b, 0x27, 0x84, 0x6c,
0xb8, 0xea, 0x64, 0x26, 0x84, 0xa7, 0xba, 0x5c, 0x5d, 0x1e, 0x85, 0x38,
0xba, 0xf7, 0x55, 0xc8, 0x85, 0xe9, 0xbb, 0x88, 0x4e, 0xc1, 0x87, 0x44,
0xbc, 0x2f, 0x48, 0x25, 0x7c, 0x20, 0xa8, 0x52, 0xcb, 0xf3, 0x80, 0x8b,
0xa6, 0xa7, 0xc0, 0x1b, 0x83, 0x1a, 0xa6, 0x36, 0xb7, 0x68, 0x85, 0x96,
0xa5, 0xd4, 0xae, 0xb8, 0x87, 0xbf, 0xa5, 0xbd, 0xa6, 0x18, 0x89, 0xa5,
0xa5, 0xf4, 0x9d, 0x8e, 0x8b, 0x00, 0xa6, 0xce, 0x95, 0x28, 0x8c, 0x04,
0xa7, 0xf7, 0x8c, 0xdb, 0x8c, 0x95, 0xa9, 0x92, 0x84, 0xbc, 0x8c, 0xe2,
0xab, 0x6b, 0x7c, 0xea, 0x8c, 0xdf, 0xad, 0x9f, 0x75, 0x8b, 0x8c, 0xd5,
0xaf, 0xc5, 0x6e, 0x2a, 0x8d, 0x36, 0xb1, 0x74, 0x66, 0xe5, 0x8d, 0x76,
0xb3, 0x24, 0x5f, 0xce, 0x8e, 0x4b, 0xb4, 0x1c, 0x58, 0xb6, 0x8f, 0x09,
0xb4, 0xfd, 0x51, 0x8f, 0x90, 0x5f, 0xb6, 0x34, 0x4a, 0xe6, 0x83, 0xc7,
0xa1, 0xa3, 0xcf, 0x20, 0x87, 0xea, 0xa0, 0x37, 0xc4, 0xbe, 0x8b, 0x3f,
0x9f, 0x44, 0xbb, 0x9f, 0x8d, 0xef, 0x9e, 0xb8, 0xb2, 0xc4, 0x90, 0x40,
0x9e, 0x8b, 0xaa, 0x0f, 0x92, 0x4b, 0x9e, 0x9d, 0xa1, 0x70, 0x93, 0x81,
0x9f, 0x6b, 0x99, 0x07, 0x94, 0x83, 0xa0, 0x55, 0x90, 0xa1, 0x95, 0x40,
0xa1, 0xe8, 0x88, 0xa5, 0x95, 0xde, 0xa3, 0x7f, 0x80, 0xa8, 0x96, 0x12,
0xa5, 0x98, 0x79, 0x4d, 0x96, 0x1d, 0xa7, 0xc2, 0x72, 0x04, 0x96, 0x7b,
0xa9, 0x8a, 0x6a, 0x78, 0x96, 0xe5, 0xab, 0x2f, 0x62, 0xf3, 0x97, 0xba,
0xac, 0xcd, 0x5b, 0xe1, 0x98, 0xdf, 0xae, 0x3c, 0x55, 0x00, 0x9a, 0x29,
0xaf, 0xaf, 0x4d, 0xc7, 0x8b, 0xe7, 0x9a, 0xa0, 0xd3, 0x21, 0x90, 0x32,
0x99, 0x1f, 0xc9, 0x33, 0x94, 0x0b, 0x97, 0xfa, 0xc0, 0x1f, 0x96, 0xc1,
0x97, 0x8b, 0xb7, 0x4b, 0x99, 0x40, 0x97, 0x3e, 0xae, 0x9d, 0x9b, 0x33,
0x97, 0x7a, 0xa6, 0x13, 0x9c, 0xc6, 0x97, 0xe8, 0x9d, 0x95, 0x9d, 0xab,
0x98, 0xc3, 0x95, 0x2c, 0x9e, 0x6a, 0x99, 0xec, 0x8c, 0xee, 0x9e, 0xfb,
0x9b, 0x8d, 0x85, 0x06, 0x9f, 0x64, 0x9d, 0x63, 0x7d, 0x55, 0x9f, 0x6b,
0x9f, 0x9f, 0x76, 0x13, 0x9f, 0x91, 0xa1, 0xb6, 0x6e, 0xce, 0xa0, 0x74,
0xa3, 0x25, 0x66, 0xe1, 0xa1, 0x44, 0xa4, 0xb0, 0x5f, 0x40, 0xa2, 0x98,
0xa6, 0xb0, 0x58, 0x6c, 0xa3, 0xf8, 0xa8, 0xa4, 0x50, 0xe7, 0x95, 0x87,
0x93, 0x1a, 0xd6, 0xdc, 0x99, 0x94, 0x91, 0xf3, 0xcd, 0x1b, 0x9c, 0xc7,
0x91, 0x18, 0xc4, 0x58, 0x9f, 0x9e, 0x90, 0x89, 0xbb, 0xb7, 0xa2, 0x5b,
0x90, 0x24, 0xb3, 0x23, 0xa4, 0x60, 0x90, 0x35, 0xaa, 0x9c, 0xa5, 0xf5,
0x90, 0x87, 0xa2, 0x14, 0xa6, 0xe3, 0x91, 0x55, 0x99, 0xc6, 0xa7, 0x9a,
0x92, 0x45, 0x91, 0x85, 0xa8, 0x25, 0x93, 0xbf, 0x89, 0x99, 0xa8, 0x96,
0x95, 0x50, 0x81, 0xbe, 0xa9, 0x19, 0x97, 0x43, 0x7a, 0x26, 0xa9, 0x6e,
0x99, 0x53, 0x72, 0xc6, 0xaa, 0x12, 0x9b, 0x3f, 0x6b, 0x31, 0xaa, 0xf2,
0x9c, 0xf8, 0x63, 0x64, 0xac, 0x15, 0x9f, 0x00, 0x5b, 0xe1, 0xad, 0x8f,
0xa1, 0x52, 0x54, 0x11, 0xa0, 0x40, 0x8b, 0x60, 0xda, 0xd5, 0xa3, 0xc5,
0x8a, 0xbb, 0xd1, 0x3a, 0xa6, 0xbd, 0x8a, 0x1e, 0xc8, 0xc9, 0xa9, 0x9b,
0x89, 0x88, 0xc0, 0x70, 0xac, 0x0b, 0x89, 0x33, 0xb7, 0xd7, 0xae, 0x33,
0x88, 0xf5, 0xaf, 0x4b, 0xaf, 0x61, 0x89, 0x5c, 0xa6, 0xdd, 0xb0, 0x5e,
0x89, 0xe6, 0x9e, 0x78, 0xb0, 0xec, 0x8a, 0xf6, 0x96, 0x4e, 0xb1, 0x6d,
0x8c, 0x18, 0x8e, 0x35, 0xb1, 0xdb, 0x8d, 0x8a, 0x86, 0x65, 0xb2, 0x4a,
0x8f, 0x29, 0x7e, 0x94, 0xb3, 0x28, 0x91, 0x33, 0x76, 0xe4, 0xb3, 0xe0,
0x93, 0x2e, 0x6f, 0x61, 0xb5, 0x07, 0x95, 0x3a, 0x67, 0xcb, 0xb6, 0x1a,
0x97, 0x27, 0x60, 0x21, 0xb7, 0x92, 0x9a, 0x03, 0x57, 0x84, 0xaa, 0x64,
0x84, 0x42, 0xdf, 0x1c, 0xad, 0x81, 0x83, 0xda, 0xd5, 0xed, 0xb0, 0x67,
0x83, 0x62, 0xcd, 0x3f, 0xb3, 0x13, 0x82, 0xeb, 0xc4, 0xd2, 0xb5, 0x71,
0x82, 0x82, 0xbc, 0x55, 0xb7, 0x67, 0x82, 0x45, 0xb3, 0xcf, 0xb8, 0xc1,
0x82, 0x6b, 0xab, 0x81, 0xb9, 0xae, 0x82, 0xd6, 0xa3, 0x57, 0xba, 0x52,
0x83, 0xa7, 0x9b, 0x33, 0xba, 0xc2, 0x84, 0xbb, 0x93, 0x10, 0xbb, 0x52,
0x85, 0xe2, 0x8b, 0x2c, 0xbb, 0xdf, 0x87, 0x1c, 0x83, 0x6e, 0xbc, 0xab,
0x88, 0xfc, 0x7b, 0xa9, 0xbd, 0xac, 0x8b, 0x29, 0x73, 0xea, 0xbe, 0xfa,
0x8d, 0x51, 0x6c, 0x2f, 0xc0, 0x94, 0x8f, 0x84, 0x64, 0x67, 0xc1, 0xea,
0x92, 0x23, 0x5c, 0x4a, 0xb4, 0x00, 0x7d, 0x0f, 0xe3, 0x23, 0xb7, 0x12,
0x7c, 0xa4, 0xd9, 0xe0, 0xb9, 0xda, 0x7c, 0x49, 0xd1, 0x49, 0xbc, 0x6c,
0x7b, 0xc2, 0xc8, 0xca, 0xbe, 0xda, 0x7b, 0x2b, 0xc0, 0x52, 0xc0, 0x7e,
0x7b, 0x22, 0xb8, 0x0c, 0xc1, 0xf1, 0x7b, 0x28, 0xaf, 0xdc, 0xc2, 0xc0,
0x7b, 0xae, 0xa7, 0xf8, 0xc3, 0x83, 0x7c, 0x2e, 0xa0, 0x12, 0xc3, 0xe5,
0x7d, 0x5c, 0x98, 0x05, 0xc4, 0x35, 0x7e, 0x7f, 0x8f, 0xeb, 0xc4, 0xfd,
0x7f, 0x9c, 0x88, 0x32, 0xc5, 0xbc, 0x80, 0x80, 0x80, 0x80, 0xc6, 0xd5,
0x83, 0x22, 0x78, 0xc5, 0xc7, 0xdd, 0x85, 0x74, 0x71, 0x14, 0xc9, 0x55,
0x88, 0x39, 0x69, 0x40, 0xcb, 0x01, 0x8b, 0x3e, 0x60, 0x6a, 0xbd, 0xd6,
0x74, 0xed, 0xe5, 0xe7, 0xc0, 0xc3, 0x74, 0xa8, 0xdc, 0xbb, 0xc3, 0x3f,
0x74, 0x76, 0xd4, 0x6e, 0xc5, 0x87, 0x74, 0x35, 0xcc, 0x3b, 0xc7, 0x91,
0x73, 0xee, 0xc4, 0x18, 0xc9, 0x29, 0x73, 0xdd, 0xbc, 0x19, 0xca, 0x52,
0x73, 0xf8, 0xb4, 0x34, 0xcb, 0x4b, 0x74, 0x58, 0xac, 0x69, 0xcc, 0x15,
0x75, 0x02, 0xa4, 0xb7, 0xcc, 0xbd, 0x75, 0xeb, 0x9c, 0xf9, 0xcd, 0x36,
0x77, 0x30, 0x95, 0x23, 0xcd, 0xc1, 0x78, 0x82, 0x8d, 0x4c, 0xce, 0x7d,
0x79, 0xe1, 0x85, 0x89, 0xcf, 0x60, 0x7b, 0x7d, 0x7d, 0xba, 0xd0, 0xb5,
0x7d, 0xd6, 0x75, 0xd8, 0xd2, 0x1d, 0x80, 0x4f, 0x6d, 0xeb, 0xd3, 0xa5,
0x83, 0xda, 0x65, 0x27, 0xc7, 0x4d, 0x6d, 0x43, 0xe7, 0xa8, 0xca, 0x15,
0x6d, 0x18, 0xde, 0x86, 0xcc, 0x4a, 0x6d, 0x07, 0xd6, 0xc1, 0xce, 0x5e,
0x6c, 0xfa, 0xcf, 0x22, 0xd0, 0x21, 0x6c, 0xe4, 0xc7, 0x74, 0xd1, 0xb9,
0x6c, 0xcc, 0xbf, 0xdb, 0xd2, 0x9a, 0x6d, 0x0f, 0xb8, 0x54, 0xd3, 0x74,
0x6d, 0x4e, 0xb0, 0xc9, 0xd4, 0x43, 0x6e, 0x07, 0xa9, 0x4c, 0xd5, 0x0b,
0x6e, 0xc0, 0xa1, 0xc7, 0xd5, 0xb0, 0x6f, 0xe5, 0x9a, 0x21, 0xd6, 0x3e,
0x71, 0x3b, 0x92, 0x83, 0xd6, 0xe9, 0x72, 0xce, 0x8a, 0xba, 0xd7, 0xa8,
0x74, 0x59, 0x82, 0xdc, 0xd8, 0xee, 0x76, 0xb7, 0x7a, 0xb9, 0xda, 0x7a,
0x79, 0x61, 0x72, 0x91, 0xdc, 0x22, 0x7c, 0x62, 0x69, 0xe2, 0xd1, 0x1f,
0x65, 0xb4, 0xe7, 0xe7, 0xd3, 0x92, 0x65, 0xb1, 0xdf, 0xb9, 0xd5, 0x9a,
0x65, 0xaf, 0xd8, 0xc5, 0xd7, 0x98, 0x65, 0xa1, 0xd1, 0xe4, 0xd9, 0x05,
0x65, 0xac, 0xca, 0xcb, 0xda, 0x25, 0x65, 0xcc, 0xc3, 0x96, 0xdb, 0x0e,
0x66, 0x23, 0xbc, 0x68, 0xdb, 0xcf, 0x66, 0xa4, 0xb5, 0x3e, 0xdc, 0x84,
0x67, 0x46, 0xae, 0x0a, 0xdd, 0x2a, 0x68, 0x46, 0xa6, 0xbe, 0xdd, 0xcd,
0x69, 0x3f, 0x9f, 0x63, 0xde, 0x64, 0x6a, 0x97, 0x97, 0xdf, 0xde, 0xf5,
0x6b, 0xe2, 0x90, 0x58, 0xdf, 0x9f, 0x6d, 0x93, 0x88, 0x3d, 0xe0, 0x54,
0x6f, 0x11, 0x80, 0x22, 0xe2, 0x53, 0x72, 0x59, 0x77, 0x77, 0xe4, 0x5b,
0x75, 0x52, 0x6e, 0xe1, 0xdb, 0xc8, 0x5d, 0xd2, 0xe8, 0x56, 0xde, 0x47,
0x5d, 0xbb, 0xe1, 0x52, 0xe0, 0xe2, 0x5d, 0x46, 0xdb, 0x08, 0xe2, 0x6d,
0x5d, 0x7d, 0xd4, 0xbd, 0xe4, 0x13, 0x5d, 0x8f, 0xce, 0x75, 0xe4, 0x30,
0x5e, 0x6f, 0xc7, 0x8b, 0xe4, 0x51, 0x5f, 0x34, 0xc0, 0x89, 0xe4, 0xef,
0x5f, 0xd2, 0xb9, 0xba, 0xe5, 0x8a, 0x60, 0x7b, 0xb2, 0xe2, 0xe6, 0x13,
0x61, 0x84, 0xab, 0xe5, 0xe6, 0x96, 0x62, 0xaf, 0xa4, 0xc8, 0xe7, 0x17,
0x63, 0xe9, 0x9d, 0x7b, 0xe7, 0xa5, 0x65, 0x44, 0x95, 0xf7, 0xe8, 0x48,
0x66, 0xb2, 0x8e, 0x45, 0xe9, 0x31, 0x68, 0x84, 0x86, 0x07, 0xea, 0x42,
0x6a, 0xc9, 0x7d, 0x7a, 0xec, 0x06, 0x6e, 0x1a, 0x74, 0x28, 0x62, 0xa2,
0xcb, 0xfc, 0xba, 0xff, 0x63, 0x5f, 0xcd, 0x42, 0xb3, 0x2f, 0x62, 0x7d,
0xd0, 0x0b, 0xab, 0x16, 0x62, 0x69, 0xd1, 0xe7, 0xa3, 0x56, 0x62, 0x6a,
0xd3, 0x23, 0x9b, 0x40, 0x62, 0x37, 0xd4, 0x14, 0x92, 0xb4, 0x61, 0xee,
0xd4, 0xed, 0x8a, 0x73, 0x61, 0xcb, 0xd5, 0x85, 0x82, 0x59, 0x61, 0xc2,
0xd6, 0x11, 0x7a, 0xe5, 0x61, 0x74, 0xd6, 0xbc, 0x73, 0xa2, 0x61, 0x2e,
0xd7, 0x5c, 0x6c, 0xea, 0x60, 0xcc, 0xd7, 0xfc, 0x66, 0xa8, 0x5f, 0xe3,
0xd8, 0xce, 0x60, 0x50, 0x5f, 0x75, 0xd8, 0xa7, 0x59, 0x92, 0x5f, 0xed,
0xd8, 0x1c, 0x52, 0xda, 0x60, 0x29, 0xd7, 0xa2, 0x4c, 0x61, 0x60, 0xdc,
0xd6, 0xd2, 0x46, 0x44, 0x67, 0xc3, 0xc7, 0x48, 0xbd, 0x6b, 0x69, 0x29,
0xc7, 0xee, 0xb5, 0x5f, 0x6a, 0x36, 0xc8, 0xd2, 0xad, 0x7c, 0x6a, 0xa4,
0xca, 0x3a, 0xa5, 0x63, 0x6a, 0xed, 0xcb, 0xa3, 0x9d, 0x2a, 0x6b, 0x1a,
0xcc, 0xc9, 0x94, 0x6c, 0x6b, 0x1c, 0xce, 0x0c, 0x8b, 0xe0, 0x6a, 0xf9,
0xcf, 0x63, 0x83, 0x8a, 0x6a, 0x9b, 0xd0, 0xa1, 0x7b, 0xed, 0x6a, 0x1f,
0xd1, 0xa9, 0x74, 0xcf, 0x69, 0xb5, 0xd2, 0xa0, 0x6e, 0x09, 0x69, 0x63,
0xd3, 0x8f, 0x67, 0xe7, 0x69, 0x08, 0xd4, 0x67, 0x61, 0xc5, 0x68, 0xc2,
0xd4, 0x7a, 0x5b, 0x04, 0x68, 0x89, 0xd4, 0x42, 0x53, 0xef, 0x68, 0xab,
0xd3, 0xd1, 0x4d, 0x46, 0x69, 0x45, 0xd3, 0x03, 0x47, 0x21, 0x6c, 0x7a,
0xc3, 0x33, 0xbf, 0xf6, 0x6e, 0x49, 0xc3, 0x5f, 0xb7, 0x9d, 0x70, 0x04,
0xc3, 0x83, 0xaf, 0x79, 0x70, 0xfd, 0xc4, 0x6f, 0xa7, 0x2e, 0x71, 0xd2,
0xc5, 0x6c, 0x9e, 0xef, 0x72, 0x63, 0xc6, 0x72, 0x96, 0x4f, 0x72, 0xc6,
0xc7, 0x97, 0x8d, 0xbd, 0x72, 0xd8, 0xc8, 0xeb, 0x85, 0x55, 0x72, 0xbf,
0xca, 0x5e, 0x7d, 0x6f, 0x72, 0x65, 0xcb, 0xe9, 0x76, 0x51, 0x71, 0xf8,
0xcd, 0x6d, 0x6f, 0x45, 0x71, 0xa7, 0xcf, 0x12, 0x69, 0x10, 0x71, 0x41,
0xd0, 0x6c, 0x63, 0x03, 0x70, 0xec, 0xd0, 0xe0, 0x5c, 0x67, 0x70, 0xad,
0xd0, 0xa5, 0x55, 0x08, 0x70, 0xaf, 0xd0, 0x61, 0x4d, 0xf5, 0x71, 0x7f,
0xcf, 0x06, 0x48, 0x05, 0x71, 0x1a, 0xbf, 0x41, 0xc3, 0x05, 0x73, 0x7d,
0xbe, 0xcc, 0xba, 0x0c, 0x75, 0xc1, 0xbe, 0x52, 0xb1, 0x9f, 0x77, 0x35,
0xbe, 0xe3, 0xa9, 0x35, 0x78, 0x69, 0xbf, 0xbc, 0xa0, 0xda, 0x79, 0x44,
0xc0, 0xa5, 0x98, 0x56, 0x7a, 0x03, 0xc1, 0x92, 0x8f, 0xd5, 0x7a, 0x46,
0xc2, 0xd1, 0x87, 0x72, 0x7a, 0x6f, 0xc4, 0x24, 0x7f, 0x3b, 0x7a, 0x4c,
0xc5, 0xc4, 0x78, 0x3f, 0x7a, 0x07, 0xc7, 0x57, 0x71, 0x3f, 0x79, 0xd4,
0xc8, 0xe7, 0x6a, 0xc9, 0x79, 0x8c, 0xca, 0x79, 0x64, 0x85, 0x79, 0x37,
0xcb, 0xa9, 0x5e, 0x1b, 0x79, 0x2e, 0xcb, 0x41, 0x56, 0xc0, 0x79, 0x34,
0xca, 0xf4, 0x4f, 0x86, 0x79, 0xfe, 0xca, 0x2d, 0x49, 0x5a, 0x76, 0xce,
0xb9, 0xa7, 0xc7, 0xc2, 0x79, 0xa9, 0xb8, 0xf6, 0xbc, 0xec, 0x7b, 0xe4,
0xb8, 0x97, 0xb4, 0x58, 0x7d, 0xc2, 0xb8, 0xa7, 0xab, 0xeb, 0x7f, 0x4e,
0xb9, 0x20, 0xa3, 0x8b, 0x80, 0x96, 0xb9, 0xe6, 0x9b, 0x0b, 0x81, 0x98,
0xba, 0xe1, 0x92, 0x75, 0x82, 0x0d, 0xbc, 0x32, 0x8a, 0x1c, 0x82, 0x44,
0xbd, 0xa0, 0x81, 0xbc, 0x82, 0x26, 0xbf, 0x87, 0x7a, 0x62, 0x82, 0x0d,
0xc1, 0x37, 0x73, 0x75, 0x81, 0xf5, 0xc2, 0xce, 0x6c, 0xc3, 0x81, 0xd3,
0xc4, 0x5d, 0x66, 0x52, 0x81, 0x94, 0xc5, 0xed, 0x60, 0x05, 0x81, 0xb7,
0xc5, 0xcf, 0x58, 0xbf, 0x81, 0xda, 0xc5, 0xc4, 0x51, 0x77, 0x82, 0xcd,
0xc5, 0x88, 0x4a, 0x44, 0x7d, 0x22, 0xb4, 0x06, 0xcc, 0x02, 0x80, 0x71,
0xb3, 0x04, 0xbf, 0xc2, 0x82, 0xa2, 0xb2, 0xcd, 0xb7, 0x62, 0x84, 0xc0,
0xb2, 0xa4, 0xaf, 0x05, 0x86, 0x92, 0xb2, 0xce, 0xa6, 0xa3, 0x88, 0x33,
0xb3, 0x24, 0x9e, 0x38, 0x89, 0x5a, 0xb4, 0x00, 0x95, 0xa1, 0x8a, 0x23,
0xb5, 0x13, 0x8d, 0x39, 0x8a, 0x74, 0xb6, 0x79, 0x85, 0x17, 0x8a, 0x94,
0xb8, 0x18, 0x7d, 0x55, 0x8a, 0x6e, 0xba, 0x1c, 0x76, 0x3f, 0x8a, 0x38,
0xbc, 0x16, 0x6f, 0x3d, 0x8a, 0x1b, 0xbd, 0xee, 0x68, 0x71, 0x89, 0xdd,
0xbf, 0xce, 0x61, 0xd3, 0x8a, 0x15, 0xc0, 0x69, 0x5a, 0xbc, 0x8a, 0x70,
0xc0, 0xa4, 0x53, 0x68, 0x8b, 0x45, 0xc1, 0x01, 0x4c, 0x6a, 0x84, 0x2e,
0xae, 0x5b, 0xcf, 0x1c, 0x87, 0xa1, 0xad, 0x17, 0xc4, 0x11, 0x8a, 0x43,
0xac, 0x6e, 0xbb, 0x1c, 0x8c, 0x87, 0xac, 0x24, 0xb2, 0xab, 0x8e, 0x84,
0xac, 0x16, 0xaa, 0x36, 0x90, 0x51, 0xac, 0x2c, 0xa1, 0xba, 0x91, 0x76,
0xac, 0xec, 0x99, 0x39, 0x92, 0x5b, 0xad, 0xd0, 0x90, 0xa7, 0x92, 0xad,
0xaf, 0x5d, 0x88, 0x7d, 0x92, 0xf0, 0xb0, 0xdb, 0x80, 0x63, 0x92, 0xee,
0xb2, 0xd9, 0x79, 0x43, 0x92, 0xcf, 0xb4, 0xd7, 0x72, 0x3a, 0x92, 0xdb,
0xb6, 0x91, 0x6b, 0x3d, 0x92, 0xe2, 0xb8, 0x35, 0x64, 0x60, 0x93, 0x11,
0xb9, 0x8b, 0x5d, 0x7c, 0x93, 0xb8, 0xba, 0x34, 0x56, 0x5a, 0x94, 0x77,
0xba, 0xf1, 0x4f, 0x05, 0x8b, 0x8c, 0xa8, 0x19, 0xd2, 0x4c, 0x8f, 0x26,
0xa6, 0xa6, 0xc8, 0x58, 0x92, 0x88, 0xa5, 0x8d, 0xbf, 0x41, 0x94, 0xda,
0xa5, 0x45, 0xb6, 0xaa, 0x96, 0xf4, 0xa5, 0x14, 0xae, 0x22, 0x98, 0xb0,
0xa5, 0x3e, 0xa5, 0x97, 0x9a, 0x0b, 0xa5, 0xac, 0x9d, 0x12, 0x9a, 0xc7,
0xa6, 0x89, 0x94, 0x8c, 0x9b, 0x5d, 0xa7, 0xbc, 0x8c, 0x4c, 0x9b, 0xcc,
0xa9, 0x47, 0x84, 0x57, 0x9b, 0xf0, 0xab, 0x1c, 0x7c, 0xb6, 0x9b, 0xbc,
0xad, 0x53, 0x75, 0x83, 0x9b, 0x90, 0xaf, 0x68, 0x6e, 0x4b, 0x9b, 0xe2,
0xb0, 0xdc, 0x67, 0x28, 0x9c, 0x1e, 0xb2, 0x4e, 0x60, 0x2f, 0x9d, 0x40,
0xb3, 0x6a, 0x59, 0x6e, 0x9e, 0x6e, 0xb4, 0x89, 0x52, 0x24, 0x93, 0x63,
0xa1, 0x69, 0xd6, 0x3a, 0x97, 0x7f, 0x9f, 0xdd, 0xcc, 0x4e, 0x9a, 0xec,
0x9e, 0xe6, 0xc3, 0x7f, 0x9d, 0x72, 0x9e, 0x5c, 0xba, 0xdc, 0x9f, 0x85,
0x9e, 0x04, 0xb2, 0x47, 0xa1, 0x3f, 0x9e, 0x25, 0xa9, 0xbb, 0xa2, 0xbb,
0x9e, 0x6b, 0xa1, 0x24, 0xa3, 0x79, 0x9f, 0x33, 0x98, 0xa0, 0xa4, 0x17,
0xa0, 0x0c, 0x90, 0x20, 0xa4, 0x92, 0xa1, 0xa1, 0x88, 0x67, 0xa4, 0xf5,
0xa3, 0x27, 0x80, 0x99, 0xa5, 0x02, 0xa5, 0x36, 0x79, 0x6c, 0xa4, 0xee,
0xa7, 0x57, 0x72, 0x54, 0xa5, 0x46, 0xa9, 0x09, 0x6a, 0xf0, 0xa5, 0xbd,
0xaa, 0x81, 0x63, 0x80, 0xa6, 0x91, 0xac, 0x19, 0x5c, 0x69, 0xa7, 0xc9,
0xad, 0xcb, 0x55, 0x04, 0x9d, 0xbc, 0x99, 0xc7, 0xda, 0x46, 0xa1, 0x72,
0x98, 0x85, 0xcf, 0xfe, 0xa4, 0x3e, 0x97, 0xe9, 0xc7, 0xa3, 0xa6, 0xdb,
0x97, 0x56, 0xbf, 0x4b, 0xa8, 0xf1, 0x97, 0x10, 0xb6, 0xcb, 0xaa, 0xbf,
0x96, 0xef, 0xae, 0x4b, 0xab, 0xec, 0x97, 0x3e, 0xa5, 0xa8, 0xac, 0xd2,
0x97, 0xc9, 0x9d, 0x28, 0xad, 0x63, 0x98, 0xbc, 0x94, 0xf0, 0xad, 0xd1,
0x99, 0xec, 0x8c, 0xe3, 0xad, 0xff, 0x9b, 0x74, 0x85, 0x0f, 0xae, 0x23,
0x9d, 0x26, 0x7d, 0x68, 0xae, 0x33, 0x9f, 0x1d, 0x76, 0x2c, 0xae, 0x50,
0xa1, 0x09, 0x6f, 0x00, 0xaf, 0x3a, 0xa2, 0xa8, 0x67, 0x5e, 0xaf, 0xf8,
0xa4, 0x42, 0x5f, 0xe1, 0xb1, 0x5a, 0xa6, 0x6a, 0x58, 0x30, 0xa7, 0xbd,
0x92, 0x7a, 0xde, 0x0b, 0xaa, 0xd1, 0x91, 0x9f, 0xd4, 0xb0, 0xad, 0x90,
0x90, 0xe3, 0xcb, 0xf3, 0xb0, 0x2a, 0x90, 0x41, 0xc3, 0x9e, 0xb2, 0x50,
0x8f, 0xf2, 0xbb, 0x35, 0xb4, 0x1b, 0x8f, 0xc8, 0xb2, 0xbf, 0xb5, 0x46,
0x90, 0x04, 0xaa, 0x3e, 0xb6, 0x29, 0x90, 0x71, 0xa1, 0xb6, 0xb6, 0xa6,
0x91, 0x63, 0x99, 0x81, 0xb7, 0x08, 0x92, 0x6a, 0x91, 0x58, 0xb7, 0x4d,
0x93, 0xcd, 0x89, 0x8d, 0xb7, 0x7a, 0x95, 0x42, 0x81, 0xd2, 0xb7, 0xf4,
0x97, 0x15, 0x7a, 0x4f, 0xb8, 0x48, 0x98, 0xf7, 0x72, 0xf8, 0xb8, 0xf8,
0x9a, 0xd4, 0x6b, 0x74, 0xb9, 0xf8, 0x9c, 0x99, 0x63, 0xba, 0xbb, 0x25,
0x9e, 0xab, 0x5b, 0xa4, 0xb1, 0x9e, 0x8b, 0x65, 0xe2, 0x8a, 0xb4, 0x98,
0x8a, 0xcb, 0xd9, 0x3f, 0xb7, 0x46, 0x8a, 0x40, 0xd0, 0x77, 0xb9, 0xb3,
0x89, 0xc9, 0xc8, 0x0b, 0xbb, 0xf3, 0x89, 0x56, 0xbf, 0x9f, 0xbd, 0x89,
0x89, 0x2c, 0xb7, 0x37, 0xbe, 0xeb, 0x89, 0x1c, 0xae, 0xdb, 0xbf, 0x9e,
0x89, 0x86, 0xa6, 0x98, 0xc0, 0x31, 0x8a, 0x12, 0x9e, 0x5b, 0xc0, 0x71,
0x8b, 0x1c, 0x96, 0x35, 0xc0, 0xb1, 0x8c, 0x2f, 0x8e, 0x28, 0xc0, 0xea,
0x8d, 0x71, 0x86, 0x68, 0xc1, 0x2c, 0x8e, 0xda, 0x7e, 0xa7, 0xc2, 0x21,
0x90, 0xcc, 0x77, 0x12, 0xc2, 0xe0, 0x92, 0xb9, 0x6f, 0xa4, 0xc4, 0x29,
0x95, 0x03, 0x68, 0x08, 0xc5, 0x67, 0x97, 0x3b, 0x60, 0x1d, 0xba, 0xef,
0x84, 0x83, 0xe6, 0xa9, 0xbd, 0xe3, 0x84, 0x21, 0xdd, 0x4c, 0xc0, 0x69,
0x83, 0xba, 0xd4, 0xc8, 0xc2, 0xaa, 0x83, 0x42, 0xcc, 0x50, 0xc4, 0xbb,
0x82, 0xb4, 0xc3, 0xd5, 0xc6, 0x5d, 0x82, 0x6c, 0xbb, 0x78, 0xc7, 0xa7,
0x82, 0x54, 0xb3, 0x39, 0xc8, 0x77, 0x82, 0x92, 0xab, 0x25, 0xc8, 0xff,
0x83, 0x05, 0xa3, 0x25, 0xc9, 0x5e, 0x83, 0xd8, 0x9b, 0x19, 0xc9, 0x9e,
0x84, 0xe1, 0x93, 0x03, 0xca, 0x10, 0x85, 0xf3, 0x8b, 0x32, 0xca, 0x8b,
0x87, 0x10, 0x83, 0x88, 0xcb, 0x4b, 0x88, 0xca, 0x7b, 0xe2, 0xcc, 0x42,
0x8a, 0xdf, 0x74, 0x4a, 0xcd, 0x6a, 0x8d, 0x29, 0x6c, 0x99, 0xcf, 0x00,
0x8f, 0xe1, 0x64, 0x62, 0xc3, 0xd8, 0x7d, 0x69, 0xe9, 0xc4, 0xc6, 0x8f,
0x7d, 0x17, 0xe0, 0xdb, 0xc8, 0xfe, 0x7c, 0xa2, 0xd8, 0x67, 0xcb, 0x59,
0x7c, 0x24, 0xd0, 0x02, 0xcd, 0x51, 0x7b, 0xb1, 0xc7, 0xa9, 0xcf, 0x1d,
0x7b, 0x55, 0xbf, 0x64, 0xd0, 0x2a, 0x7b, 0x47, 0xb7, 0x6b, 0xd1, 0x15,
0x7b, 0x4a, 0xaf, 0x7a, 0xd1, 0x95, 0x7b, 0xe3, 0xa7, 0xae, 0xd2, 0x0c,
0x7c, 0x77, 0x9f, 0xde, 0xd2, 0x62, 0x7d, 0x92, 0x97, 0xf6, 0xd2, 0xaf,
0x7e, 0x9a, 0x90, 0x05, 0xd3, 0x6b, 0x7f, 0xa7, 0x88, 0x44, 0xd4, 0x2e,
0x80, 0x80, 0x80, 0x80, 0xd5, 0x5b, 0x83, 0x24, 0x78, 0xce, 0xd6, 0x6d,
0x85, 0x7e, 0x71, 0x17, 0xd7, 0xcb, 0x88, 0x7d, 0x68, 0xca, 0xcd, 0x2a,
0x75, 0x9e, 0xec, 0x1c, 0xcf, 0xe7, 0x75, 0x3f, 0xe2, 0xe6, 0xd1, 0xfd,
0x74, 0xf8, 0xda, 0xe1, 0xd3, 0xf3, 0x74, 0xb4, 0xd3, 0x00, 0xd5, 0xa6,
0x74, 0x77, 0xcb, 0x1b, 0xd7, 0x20, 0x74, 0x40, 0xc3, 0x30, 0xd8, 0x30,
0x74, 0x38, 0xbb, 0x6a, 0xd8, 0xfe, 0x74, 0x52, 0xb3, 0xb8, 0xd9, 0xb8,
0x74, 0xbd, 0xac, 0x18, 0xda, 0x59, 0x75, 0x6c, 0xa4, 0x84, 0xda, 0xe7,
0x76, 0x50, 0x9c, 0xec, 0xdb, 0x60, 0x77, 0x78, 0x95, 0x50, 0xdb, 0xee,
0x78, 0xa3, 0x8d, 0x9a, 0xdc, 0xb9, 0x79, 0xea, 0x85, 0xab, 0xdd, 0xc9,
0x7b, 0x8b, 0x7d, 0xa2, 0xdf, 0x68, 0x7e, 0x0c, 0x75, 0x8b, 0xe1, 0x26,
0x80, 0xac, 0x6d, 0x44, 0xd6, 0x6b, 0x6d, 0xf7, 0xec, 0xf3, 0xd8, 0xc4,
0x6d, 0xb5, 0xe4, 0xa5, 0xda, 0xd4, 0x6d, 0x84, 0xdd, 0x12, 0xdc, 0xb3,
0x6d, 0x5c, 0xd5, 0xbb, 0xde, 0x66, 0x6d, 0x33, 0xce, 0x69, 0xdf, 0x80,
0x6d, 0x1f, 0xc6, 0xd0, 0xe0, 0x7f, 0x6d, 0x1d, 0xbf, 0x47, 0xe1, 0x33,
0x6d, 0x69, 0xb7, 0xf3, 0xe1, 0xe7, 0x6d, 0xb0, 0xb0, 0xa0, 0xe2, 0x8b,
0x6e, 0x77, 0xa9, 0x3a, 0xe3, 0x2f, 0x6f, 0x38, 0xa1, 0xc7, 0xe3, 0xc4,
0x70, 0x5d, 0x9a, 0x40, 0xe4, 0x4e, 0x71, 0xa9, 0x92, 0xbe, 0xe5, 0x0a,
0x73, 0x25, 0x8a, 0xe5, 0xe5, 0xee, 0x74, 0xaa, 0x82, 0xdd, 0xe7, 0x6d,
0x77, 0x0e, 0x7a, 0x90, 0xe9, 0x32, 0x79, 0xcb, 0x72, 0x14, 0xe0, 0x96,
0x66, 0x0f, 0xed, 0x63, 0xe2, 0xf2, 0x65, 0xd9, 0xe6, 0x00, 0xe5, 0x3b,
0x65, 0x8a, 0xdf, 0x02, 0xe6, 0xc5, 0x65, 0x96, 0xd8, 0x48, 0xe8, 0x3f,
0x65, 0xa9, 0xd1, 0x9a, 0xe8, 0xfc, 0x66, 0x0c, 0xca, 0x9a, 0xe9, 0x9d,
0x66, 0x6b, 0xc3, 0x89, 0xea, 0x51, 0x66, 0xce, 0xbc, 0x8f, 0xea, 0xfc,
0x67, 0x46, 0xb5, 0x9d, 0xeb, 0x7c, 0x67, 0xee, 0xae, 0x88, 0xec, 0x10,
0x68, 0xd4, 0xa7, 0x51, 0xec, 0x81, 0x69, 0xc6, 0x9f, 0xf4, 0xed, 0x0b,
0x6a, 0xfe, 0x98, 0x58, 0xed, 0x9a, 0x6c, 0x33, 0x90, 0xb2, 0xee, 0xa1,
0x6e, 0x04, 0x88, 0x70, 0xef, 0xe6, 0x6f, 0xee, 0x80, 0x23, 0xf2, 0x7e,
0x72, 0xa0, 0x77, 0x09, 0x6a, 0xd0, 0xcf, 0x73, 0xbd, 0xff, 0x6b, 0x8f,
0xd0, 0xba, 0xb6, 0xae, 0x6b, 0xb0, 0xd2, 0x7c, 0xaf, 0x76, 0x6a, 0x9b,
0xd5, 0x09, 0xa7, 0x53, 0x6a, 0xc9, 0xd6, 0x5f, 0x9f, 0xd0, 0x6a, 0x74,
0xd7, 0x6c, 0x97, 0x5e, 0x6a, 0x14, 0xd8, 0x64, 0x8f, 0x10, 0x69, 0xab,
0xd9, 0x15, 0x87, 0x3a, 0x69, 0x6d, 0xd9, 0x93, 0x7f, 0x80, 0x68, 0xb9,
0xda, 0x51, 0x78, 0x88, 0x68, 0x5d, 0xda, 0xc4, 0x71, 0x81, 0x67, 0xc3,
0xdb, 0x5d, 0x6b, 0x42, 0x66, 0xaa, 0xdc, 0x26, 0x65, 0x0e, 0x66, 0x93,
0xdc, 0x46, 0x5e, 0xf2, 0x65, 0xed, 0xdc, 0x1e, 0x58, 0x55, 0x66, 0x16,
0xdb, 0xa1, 0x51, 0xc1, 0x66, 0x05, 0xdb, 0x39, 0x4b, 0x29, 0x6f, 0xd1,
0xcb, 0x08, 0xc0, 0x55, 0x71, 0x23, 0xcb, 0xbe, 0xb8, 0xbb, 0x72, 0x4c,
0xcc, 0x98, 0xb1, 0x6e, 0x72, 0xd9, 0xcd, 0xd2, 0xa9, 0x8e, 0x73, 0x1a,
0xcf, 0x3c, 0xa1, 0x98, 0x73, 0x2b, 0xd0, 0x87, 0x99, 0x10, 0x73, 0x0e,
0xd1, 0xbc, 0x90, 0x75, 0x72, 0xb5, 0xd2, 0xe6, 0x88, 0x68, 0x72, 0x44,
0xd3, 0xfa, 0x80, 0x74, 0x71, 0xa1, 0xd4, 0xf5, 0x79, 0x93, 0x70, 0xfa,
0xd5, 0xd6, 0x72, 0xaf, 0x70, 0x70, 0xd6, 0xb2, 0x6c, 0x66, 0x6f, 0xf0,
0xd7, 0x7d, 0x66, 0x68, 0x6f, 0x6a, 0xd8, 0x37, 0x60, 0x6a, 0x6f, 0x07,
0xd8, 0x07, 0x59, 0xa9, 0x6e, 0xa8, 0xd7, 0xca, 0x52, 0xc8, 0x6e, 0xad,
0xd7, 0x4f, 0x4c, 0x1e, 0x74, 0xd1, 0xc6, 0xf0, 0xc2, 0xe9, 0x76, 0x96,
0xc7, 0x22, 0xba, 0xd2, 0x78, 0x18, 0xc7, 0x8a, 0xb3, 0x34, 0x79, 0x1c,
0xc8, 0x52, 0xab, 0x53, 0x79, 0xac, 0xc9, 0x68, 0xa3, 0x3f, 0x7a, 0x11,
0xca, 0x8d, 0x9a, 0xe9, 0x7a, 0x5a, 0xcb, 0xc4, 0x92, 0x5a, 0x7a, 0x59,
0xcd, 0x20, 0x89, 0xf7, 0x7a, 0x33, 0xce, 0x8f, 0x81, 0x92, 0x79, 0xb5,
0xd0, 0x03, 0x7a, 0x7a, 0x79, 0x16, 0xd1, 0x26, 0x73, 0xbf, 0x78, 0x89,
0xd2, 0x3b, 0x6d, 0x67, 0x78, 0x10, 0xd3, 0x42, 0x67, 0x7b, 0x77, 0x90,
0xd4, 0x35, 0x61, 0x8f, 0x77, 0x20, 0xd4, 0x31, 0x5a, 0xe3, 0x76, 0xc0,
0xd3, 0xec, 0x53, 0xd0, 0x76, 0xb6, 0xd3, 0x5e, 0x4c, 0xf8, 0x79, 0xe6,
0xc2, 0xd5, 0xc5, 0xec, 0x7b, 0xd7, 0xc2, 0xbd, 0xbd, 0x19, 0x7d, 0x9c,
0xc2, 0xcd, 0xb5, 0x3c, 0x7f, 0x1c, 0xc3, 0x1f, 0xad, 0x52, 0x80, 0x18,
0xc3, 0xf3, 0xa5, 0x27, 0x80, 0xe7, 0xc4, 0xe4, 0x9c, 0xf2, 0x81, 0x78,
0xc5, 0xef, 0x94, 0x7f, 0x81, 0xc1, 0xc7, 0x20, 0x8c, 0x26, 0x81, 0xc8,
0xc8, 0x71, 0x83, 0xd6, 0x81, 0x90, 0xc9, 0xe4, 0x7c, 0x5e, 0x81, 0x1f,
0xcb, 0x65, 0x75, 0x89, 0x80, 0x99, 0xcc, 0xe2, 0x6e, 0xd5, 0x80, 0x1b,
0xce, 0x67, 0x68, 0xb4, 0x7f, 0x89, 0xcf, 0xd7, 0x62, 0xb5, 0x7f, 0x18,
0xd0, 0x1c, 0x5c, 0x37, 0x7e, 0xc7, 0xcf, 0x98, 0x55, 0x13, 0x7e, 0xc6,
0xce, 0xf4, 0x4d, 0xf2, 0x7f, 0x30, 0xbe, 0x6c, 0xca, 0x3f, 0x81, 0x8f,
0xbe, 0x00, 0xbf, 0xaa, 0x83, 0xaa, 0xbd, 0xdf, 0xb7, 0xc1, 0x85, 0x9e,
0xbd, 0xd0, 0xaf, 0xda, 0x86, 0xd8, 0xbe, 0xa3, 0xa7, 0x92, 0x87, 0xe8,
0xbf, 0x8d, 0x9f, 0x52, 0x88, 0x8a, 0xc0, 0x79, 0x96, 0xd2, 0x89, 0x11,
0xc1, 0x64, 0x8e, 0x76, 0x89, 0x40, 0xc2, 0x84, 0x86, 0x58, 0x89, 0x49,
0xc3, 0xca, 0x7e, 0x8d, 0x89, 0x09, 0xc5, 0x63, 0x77, 0xd0, 0x88, 0xac,
0xc6, 0xed, 0x71, 0x11, 0x88, 0x54, 0xc8, 0x66, 0x6a, 0xb5, 0x87, 0xe7,
0xc9, 0xdb, 0x64, 0x7c, 0x87, 0x89, 0xca, 0xeb, 0x5e, 0x21, 0x87, 0x9b,
0xca, 0xaa, 0x57, 0x11, 0x87, 0xb8, 0xca, 0x76, 0x4f, 0x6f, 0x86, 0x1e,
0xb8, 0xef, 0xce, 0xa8, 0x88, 0xda, 0xb8, 0x42, 0xc3, 0x78, 0x8a, 0xe8,
0xb8, 0x02, 0xba, 0xfe, 0x8c, 0xc4, 0xb7, 0xfb, 0xb2, 0xee, 0x8e, 0x49,
0xb8, 0x51, 0xaa, 0xb6, 0x8f, 0x88, 0xb8, 0xe6, 0xa2, 0x66, 0x90, 0x58,
0xb9, 0xbf, 0x99, 0xed, 0x90, 0xef, 0xba, 0xb2, 0x91, 0x63, 0x91, 0x1d,
0xbb, 0xee, 0x89, 0x3a, 0x91, 0x31, 0xbd, 0x25, 0x81, 0x12, 0x90, 0xe2,
0xbf, 0x11, 0x7a, 0x00, 0x90, 0x97, 0xc0, 0xe0, 0x73, 0x3d, 0x90, 0x61,
0xc2, 0x64, 0x6c, 0xb8, 0x90, 0x20, 0xc3, 0xce, 0x66, 0x5b, 0x8f, 0xc5,
0xc5, 0x3c, 0x60, 0x13, 0x90, 0x13, 0xc5, 0x60, 0x58, 0xfd, 0x90, 0x61,
0xc5, 0x8e, 0x51, 0xb2, 0x8c, 0xe3, 0xb3, 0xef, 0xd1, 0xa7, 0x8f, 0xaf,
0xb2, 0xeb, 0xc7, 0x6d, 0x92, 0x2b, 0xb2, 0x3e, 0xbe, 0x95, 0x94, 0x28,
0xb2, 0x40, 0xb6, 0x79, 0x95, 0xfb, 0xb2, 0x4e, 0xae, 0x59, 0x97, 0x6e,
0xb2, 0x9f, 0xa5, 0xf3, 0x98, 0x8f, 0xb3, 0x1d, 0x9d, 0x83, 0x99, 0x12,
0xb3, 0xf4, 0x94, 0xf2, 0x99, 0x6d, 0xb5, 0x05, 0x8c, 0xa7, 0x99, 0x96,
0xb6, 0x55, 0x84, 0xaf, 0x99, 0x84, 0xb7, 0xe8, 0x7d, 0x27, 0x99, 0x2a,
0xb9, 0xdb, 0x76, 0x3f, 0x98, 0xc1, 0xbb, 0xc1, 0x6f, 0x5d, 0x98, 0x9c,
0xbd, 0x50, 0x68, 0xae, 0x98, 0x5a, 0xbe, 0xe9, 0x62, 0x1d, 0x98, 0x93,
0xbf, 0xbc, 0x5b, 0x29, 0x99, 0x11, 0xc0, 0x2c, 0x53, 0xe5, 0x94, 0x00,
0xae, 0xb7, 0xd5, 0x1b, 0x97, 0x5f, 0xad, 0x24, 0xcb, 0x6e, 0x9a, 0x23,
0xac, 0x38, 0xc2, 0xbd, 0x9c, 0x48, 0xab, 0xde, 0xba, 0x67, 0x9e, 0x1c,
0xab, 0xb3, 0xb2, 0x2d, 0x9f, 0xa2, 0xab, 0xd9, 0xa9, 0xbe, 0xa1, 0x04,
0xac, 0x29, 0xa1, 0x3f, 0xa1, 0x6e, 0xac, 0xf3, 0x98, 0xa1, 0xa1, 0xa4,
0xad, 0xd1, 0x8f, 0xf9, 0xa1, 0xde, 0xaf, 0x44, 0x87, 0xfe, 0xa2, 0x0f,
0xb0, 0xa1, 0x80, 0x09, 0xa1, 0xe4, 0xb2, 0xa2, 0x79, 0x3a, 0xa1, 0x95,
0xb4, 0x97, 0x72, 0x66, 0xa1, 0x8c, 0xb6, 0x23, 0x6b, 0x8d, 0xa1, 0x9c,
0xb7, 0x82, 0x64, 0xc4, 0xa1, 0xdc, 0xb8, 0xc6, 0x5e, 0x05, 0xa2, 0xb8,
0xb9, 0xb9, 0x56, 0xed, 0x9c, 0xfa, 0xa7, 0x89, 0xd9, 0xb3, 0xa0, 0x5d,
0xa6, 0x11, 0xcf, 0x03, 0xa3, 0x02, 0xa5, 0x91, 0xc6, 0xc8, 0xa5, 0x54,
0xa5, 0x25, 0xbe, 0x94, 0xa6, 0xfb, 0xa5, 0x02, 0xb6, 0x40, 0xa8, 0x6d,
0xa4, 0xfb, 0xad, 0xdf, 0xa9, 0x83, 0xa5, 0x43, 0xa5, 0x3d, 0xaa, 0x4d,
0xa5, 0xc7, 0x9c, 0xb5, 0xaa, 0xb8, 0xa6, 0xa5, 0x94, 0x51, 0xaa, 0xe9,
0xa7, 0xcc, 0x8c, 0x2a, 0xaa, 0xe4, 0xa9, 0x32, 0x84, 0x3a, 0xaa, 0xcd,
0xaa, 0xe3, 0x7c, 0xb6, 0xaa, 0x9f, 0xac, 0xfa, 0x75, 0xba, 0xaa, 0x6d,
0xae, 0xff, 0x6e, 0xbc, 0xaa, 0xb5, 0xb0, 0x5c, 0x67, 0x9a, 0xaa, 0xf5,
0xb1, 0xa8, 0x60, 0xaa, 0xab, 0xf1, 0xb3, 0x04, 0x59, 0x9d, 0xa6, 0xdc,
0xa0, 0x60, 0xdd, 0x82, 0xa9, 0xed, 0x9f, 0x63, 0xd3, 0x82, 0xac, 0x69,
0x9e, 0xc7, 0xca, 0xf4, 0xae, 0x9a, 0x9e, 0x49, 0xc2, 0xc2, 0xb0, 0x3c,
0x9e, 0x0b, 0xba, 0x76, 0xb1, 0x8d, 0x9d, 0xf4, 0xb2, 0x1c, 0xb2, 0x67,
0x9e, 0x28, 0xa9, 0x71, 0xb3, 0x0d, 0x9e, 0x76, 0xa0, 0xa9, 0xb3, 0x7b,
0x9f, 0x5a, 0x98, 0x71, 0xb3, 0xde, 0xa0, 0x41, 0x90, 0x3d, 0xb3, 0xe9,
0xa1, 0xc1, 0x88, 0x83, 0xb3, 0xd5, 0xa3, 0x30, 0x80, 0xb9, 0xb3, 0xde,
0xa5, 0x08, 0x79, 0x9d, 0xb3, 0xcf, 0xa6, 0xf0, 0x72, 0xa1, 0xb4, 0x28,
0xa8, 0xa3, 0x6b, 0x67, 0xb4, 0xac, 0xaa, 0x22, 0x64, 0x0f, 0xb5, 0x60,
0xab, 0xc9, 0x5c, 0x93, 0xb0, 0xfd, 0x99, 0x17, 0xe1, 0x79, 0xb3, 0xac,
0x98, 0x7a, 0xd8, 0x26, 0xb6, 0x0b, 0x97, 0xed, 0xcf, 0x78, 0xb8, 0x08,
0x97, 0x8a, 0xc7, 0x3d, 0xb9, 0xd2, 0x97, 0x3a, 0xbe, 0xf7, 0xbb, 0x1a,
0x97, 0x0f, 0xb6, 0x91, 0xbc, 0x2e, 0x97, 0x08, 0xae, 0x23, 0xbc, 0xb3,
0x97, 0x83, 0xa5, 0x91, 0xbd, 0x0f, 0x98, 0x2b, 0x9d, 0x1e, 0xbd, 0x2e,
0x99, 0x1c, 0x94, 0xdd, 0xbd, 0x39, 0x9a, 0x3f, 0x8c, 0xd7, 0xbd, 0x2c,
0x9b, 0xad, 0x85, 0x2b, 0xbd, 0x23, 0x9d, 0x3c, 0x7d, 0xa2, 0xbd, 0x11,
0x9e, 0xf7, 0x76, 0x69, 0xbd, 0x03, 0xa0, 0xad, 0x6f, 0x3e, 0xbe, 0x26,
0xa2, 0x57, 0x67, 0xa2, 0xbf, 0x19, 0xa3, 0xfd, 0x5f, 0xf3, 0xba, 0x14,
0x92, 0x46, 0xe6, 0x2e, 0xbc, 0xeb, 0x91, 0x9d, 0xdc, 0x96, 0xbf, 0x28,
0x91, 0x1a, 0xd3, 0xf5, 0xc1, 0x1f, 0x90, 0xba, 0xcb, 0x83, 0xc2, 0xdd,
0x90, 0x70, 0xc3, 0x30, 0xc4, 0x31, 0x90, 0x3f, 0xba, 0xe0, 0xc5, 0x3d,
0x90, 0x25, 0xb2, 0x8b, 0xc5, 0xcf, 0x90, 0x6c, 0xaa, 0x2d, 0xc6, 0x2a,
0x90, 0xda, 0xa1, 0xc9, 0xc6, 0x5f, 0x91, 0xbf, 0x99, 0xa0, 0xc6, 0x7f,
0x92, 0xb7, 0x91, 0x78, 0xc6, 0x94, 0x93, 0xf7, 0x89, 0xbc, 0xc6, 0x94,
0x95, 0x4a, 0x82, 0x13, 0xc6, 0xf7, 0x97, 0x06, 0x7a, 0xa2, 0xc7, 0x40,
0x98, 0xd3, 0x73, 0x53, 0xc7, 0xf9, 0x9a, 0xc8, 0x6b, 0xd2, 0xc9, 0x35,
0x9c, 0xd2, 0x64, 0x06, 0xc2, 0xfd, 0x8b, 0x85, 0xea, 0x48, 0xc5, 0xc9,
0x8a, 0xfe, 0xe0, 0xa8, 0xc7, 0xe5, 0x8a, 0x95, 0xd8, 0x37, 0xc9, 0xef,
0x8a, 0x2d, 0xcf, 0xdd, 0xcb, 0xaa, 0x89, 0xd0, 0xc7, 0x87, 0xcd, 0x41,
0x89, 0x80, 0xbf, 0x35, 0xce, 0x2b, 0x89, 0x75, 0xb6, 0xf3, 0xce, 0xee,
0x89, 0x81, 0xae, 0xb7, 0xcf, 0x28, 0x89, 0xf2, 0xa6, 0x95, 0xcf, 0x57,
0x8a, 0x7b, 0x9e, 0x70, 0xcf, 0x6f, 0x8b, 0x6a, 0x96, 0x4f, 0xcf, 0x8b,
0x8c, 0x5d, 0x8e, 0x46, 0xcf, 0xc5, 0x8d, 0x6f, 0x86, 0xa3, 0xd0, 0x05,
0x8e, 0x9f, 0x7f, 0x02, 0xd0, 0xdf, 0x90, 0x91, 0x77, 0x83, 0xd1, 0x86,
0x92, 0x8a, 0x70, 0x20, 0xd2, 0xeb, 0x95, 0x44, 0x68, 0x44, 0xcb, 0x68,
0x84, 0xdd, 0xed, 0x8b, 0xcd, 0xf0, 0x84, 0x77, 0xe4, 0x7d, 0xd0, 0x17,
0x84, 0x0e, 0xdc, 0x39, 0xd1, 0xf5, 0x83, 0x9b, 0xd3, 0xc6, 0xd3, 0x9b,
0x83, 0x38, 0xcb, 0x61, 0xd5, 0x0d, 0x82, 0xe4, 0xc3, 0x0c, 0xd6, 0x1a,
0x82, 0xbd, 0xba, 0xe3, 0xd6, 0xef, 0x82, 0xae, 0xb2, 0xd0, 0xd7, 0x74,
0x82, 0xfe, 0xaa, 0xe4, 0xd7, 0xcb, 0x83, 0x78, 0xa3, 0x08, 0xd8, 0x21,
0x84, 0x39, 0x9b, 0x32, 0xd8, 0x6e, 0x85, 0x21, 0x93, 0x5b, 0xd8, 0xdd,
0x86, 0x29, 0x8b, 0x87, 0xd9, 0x50, 0x87, 0x50, 0x83, 0xb3, 0xda, 0x07,
0x89, 0x18, 0x7b, 0xea, 0xda, 0xee, 0x8b, 0x40, 0x74, 0x2d, 0xdb, 0xff,
0x8d, 0x8b, 0x6c, 0x3d, 0xd2, 0xc2, 0x7e, 0x26, 0xf0, 0xf0, 0xd5, 0x63,
0x7d, 0xce, 0xe7, 0xb3, 0xd7, 0x7b, 0x7d, 0x62, 0xdf, 0x96, 0xd9, 0x7a,
0x7c, 0xd4, 0xd7, 0x1d, 0xdb, 0x5c, 0x7c, 0x50, 0xce, 0xcc, 0xdc, 0xbb,
0x7c, 0x00, 0xc6, 0xb8, 0xdd, 0xf5, 0x7b, 0xbf, 0xbe, 0xb8, 0xde, 0xbc,
0x7b, 0xc1, 0xb6, 0xe3, 0xdf, 0x75, 0x7b, 0xd6, 0xaf, 0x15, 0xdf, 0xe8,
0x7c, 0x64, 0xa7, 0x6a, 0xe0, 0x56, 0x7c, 0xf0, 0x9f, 0xbe, 0xe0, 0xc7,
0x7d, 0xd8, 0x98, 0x27, 0xe1, 0x31, 0x7e, 0xab, 0x90, 0x89, 0xe2, 0x0c,
0x7f, 0xb1, 0x88, 0x86, 0xe2, 0xe1, 0x80, 0x80, 0x80, 0x80, 0xe4, 0x46,
0x83, 0x7c, 0x78, 0xa4, 0xe5, 0x91, 0x86, 0x11, 0x70, 0xa6, 0xdb, 0xb6,
0x76, 0xaa, 0xf1, 0xf2, 0xde, 0x0e, 0x76, 0x4b, 0xe9, 0x87, 0xe0, 0x1d,
0x75, 0xde, 0xe1, 0x9e, 0xe1, 0xf0, 0x75, 0x94, 0xd9, 0xc7, 0xe3, 0x9d,
0x75, 0x5a, 0xd2, 0x09, 0xe4, 0xde, 0x75, 0x28, 0xca, 0x57, 0xe5, 0xfb,
0x74, 0xf3, 0xc2, 0xb3, 0xe6, 0xd9, 0x74, 0xf9, 0xbb, 0x31, 0xe7, 0x97,
0x75, 0x1e, 0xb3, 0xbd, 0xe8, 0x3c, 0x75, 0x8a, 0xac, 0x3f, 0xe8, 0xc4,
0x76, 0x32, 0xa4, 0xb0, 0xe9, 0x43, 0x77, 0x04, 0x9d, 0x15, 0xe9, 0xba,
0x78, 0x0f, 0x95, 0x70, 0xea, 0x51, 0x79, 0x21, 0x8d, 0xa9, 0xeb, 0x47,
0x7a, 0x51, 0x85, 0xa7, 0xec, 0x7e, 0x7b, 0xd5, 0x7d, 0x8f, 0xee, 0x51,
0x7e, 0x7a, 0x75, 0x06, 0xe5, 0x58, 0x6e, 0xca, 0xf2, 0xfa, 0xe7, 0x7d,
0x6e, 0x7e, 0xeb, 0x12, 0xe9, 0x85, 0x6e, 0x2c, 0xe3, 0x82, 0xeb, 0x28,
0x6e, 0x14, 0xdc, 0x2c, 0xec, 0x86, 0x6e, 0x1f, 0xd5, 0x09, 0xed, 0xb7,
0x6e, 0x25, 0xcd, 0xe5, 0xee, 0xad, 0x6e, 0x07, 0xc6, 0xb4, 0xef, 0x97,
0x6d, 0xf3, 0xbf, 0x94, 0xf0, 0x49, 0x6e, 0x35, 0xb8, 0x81, 0xf0, 0xf0,
0x6e, 0x7c, 0xb1, 0x66, 0xf1, 0x7f, 0x6f, 0x20, 0xaa, 0x01, 0xf1, 0xff,
0x6f, 0xdc, 0xa2, 0x79, 0xf2, 0x85, 0x71, 0x03, 0x9a, 0xcf, 0xf3, 0x11,
0x72, 0x36, 0x93, 0x1a, 0xf3, 0xf7, 0x73, 0xaf, 0x8b, 0x19, 0xf5, 0x2a,
0x75, 0x07, 0x82, 0xf4, 0xf9, 0x73, 0x77, 0x19, 0x79, 0x69, 0x73, 0x33,
0xd2, 0xf4, 0xc1, 0x26, 0x74, 0x02, 0xd4, 0x02, 0xb9, 0xe6, 0x74, 0x94,
0xd5, 0x4f, 0xb2, 0xe6, 0x74, 0x6f, 0xd6, 0xfe, 0xab, 0x77, 0x74, 0x32,
0xd8, 0x88, 0xa3, 0xe1, 0x73, 0xab, 0xda, 0x0a, 0x9c, 0x0b, 0x73, 0x08,
0xdb, 0x44, 0x93, 0xd6, 0x72, 0x48, 0xdc, 0x44, 0x8b, 0xfc, 0x71, 0x76,
0xdd, 0x0c, 0x84, 0x61, 0x70, 0xad, 0xdd, 0xac, 0x7d, 0x38, 0x6f, 0xf2,
0xde, 0x30, 0x76, 0x79, 0x6f, 0x3e, 0xde, 0xa7, 0x6f, 0xc3, 0x6e, 0x8e,
0xdf, 0x12, 0x69, 0xc5, 0x6d, 0xdf, 0xdf, 0x6e, 0x63, 0xc3, 0x6d, 0x44,
0xdf, 0x87, 0x5d, 0x9b, 0x6c, 0xc9, 0xdf, 0x43, 0x57, 0x3c, 0x6c, 0x4c,
0xde, 0xff, 0x50, 0xb8, 0x78, 0x99, 0xce, 0x7c, 0xc3, 0x0f, 0x79, 0xf8,
0xcf, 0x01, 0xbb, 0x84, 0x7a, 0xed, 0xd0, 0x00, 0xb4, 0x7c, 0x7b, 0x70,
0xd1, 0x2f, 0xad, 0x47, 0x7b, 0x4b, 0xd2, 0x98, 0xa5, 0x78, 0x7b, 0x13,
0xd4, 0x09, 0x9d, 0x99, 0x7a, 0xdf, 0xd5, 0x54, 0x95, 0x4f, 0x7a, 0x73,
0xd6, 0x90, 0x8d, 0x3b, 0x79, 0xd4, 0xd7, 0xa3, 0x85, 0x76, 0x79, 0x1d,
0xd8, 0x9a, 0x7e, 0x1c, 0x78, 0x60, 0xd9, 0x6f, 0x77, 0x75, 0x77, 0xa0,
0xda, 0x2e, 0x70, 0xc2, 0x77, 0x01, 0xda, 0xd8, 0x6a, 0xcd, 0x76, 0x62,
0xdb, 0x6f, 0x64, 0xe4, 0x75, 0xc4, 0xdb, 0xd4, 0x5e, 0xdf, 0x75, 0x3e,
0xdb, 0x81, 0x58, 0x52, 0x74, 0xb5, 0xdb, 0x2e, 0x51, 0xa3, 0x7d, 0xb3,
0xca, 0x69, 0xc5, 0xb2, 0x7f, 0x5c, 0xca, 0x76, 0xbd, 0x99, 0x80, 0xa2,
0xcb, 0x25, 0xb6, 0x5c, 0x81, 0xc1, 0xcb, 0xfd, 0xaf, 0x33, 0x81, 0xfe,
0xcd, 0x2f, 0xa7, 0x42, 0x82, 0x0b, 0xce, 0x77, 0x9f, 0x5e, 0x82, 0x29,
0xcf, 0xd7, 0x96, 0xf3, 0x82, 0x18, 0xd1, 0x2d, 0x8e, 0xb3, 0x81, 0xb8,
0xd2, 0x66, 0x86, 0xa9, 0x81, 0x32, 0xd3, 0x8d, 0x7e, 0xf8, 0x80, 0x7d,
0xd4, 0x99, 0x78, 0x69, 0x7f, 0xc0, 0xd5, 0x93, 0x71, 0xcd, 0x7f, 0x23,
0xd6, 0x7e, 0x6b, 0xce, 0x7e, 0x8c, 0xd7, 0x52, 0x65, 0xf5, 0x7d, 0xf0,
0xd8, 0x13, 0x60, 0x1c, 0x7d, 0x5e, 0xd7, 0xb0, 0x59, 0x73, 0x7c, 0xd2,
0xd7, 0x46, 0x52, 0x9f, 0x83, 0x3e, 0xc6, 0x73, 0xc8, 0xb6, 0x85, 0x2e,
0xc6, 0x4f, 0xc0, 0x24, 0x86, 0xa7, 0xc6, 0xc5, 0xb8, 0xb0, 0x87, 0xff,
0xc7, 0x49, 0xb1, 0x51, 0x88, 0xc1, 0xc8, 0x3e, 0xa9, 0x7c, 0x89, 0x43,
0xc9, 0x59, 0xa1, 0xa6, 0x89, 0x84, 0xca, 0x80, 0x99, 0x5f, 0x89, 0x9d,
0xcb, 0xb9, 0x90, 0xfd, 0x89, 0x68, 0xcd, 0x07, 0x88, 0xdb, 0x89, 0x15,
0xce, 0x66, 0x80, 0xb0, 0x88, 0x76, 0xcf, 0xd0, 0x79, 0xec, 0x87, 0xc6,
0xd0, 0xf9, 0x73, 0x5d, 0x87, 0x22, 0xd2, 0x0e, 0x6d, 0x28, 0x86, 0x8f,
0xd3, 0x16, 0x67, 0x42, 0x85, 0xfa, 0xd4, 0x0d, 0x61, 0x5e, 0x85, 0x8e,
0xd3, 0xfd, 0x5a, 0xd4, 0x85, 0x2f, 0xd3, 0x90, 0x53, 0xe8, 0x89, 0x5b,
0xc2, 0x6e, 0xcb, 0xd2, 0x8b, 0x27, 0xc2, 0x3d, 0xc3, 0x24, 0x8c, 0xc0,
0xc2, 0x54, 0xbb, 0x30, 0x8e, 0x2e, 0xc2, 0x9a, 0xb3, 0x8a, 0x8f, 0x4a,
0xc3, 0x38, 0xab, 0xb8, 0x90, 0x19, 0xc4, 0x25, 0xa3, 0xcb, 0x90, 0xa0,
0xc5, 0x20, 0x9b, 0xb1, 0x90, 0xdf, 0xc6, 0x1e, 0x93, 0x56, 0x90, 0xe0,
0xc7, 0x34, 0x8b, 0x40, 0x90, 0xb6, 0xc8, 0x5a, 0x83, 0x3f, 0x90, 0x56,
0xc9, 0xc3, 0x7c, 0x1e, 0x8f, 0xcb, 0xcb, 0x3b, 0x75, 0x7f, 0x8f, 0x2d,
0xcc, 0xa2, 0x6e, 0xf6, 0x8e, 0x8b, 0xce, 0x07, 0x68, 0xd0, 0x8d, 0xd3,
0xcf, 0x63, 0x62, 0xbc, 0x8d, 0x87, 0xcf, 0xec, 0x5c, 0x54, 0x8d, 0xa3,
0xcf, 0xbb, 0x55, 0x2b, 0x8f, 0xf0, 0xbd, 0xde, 0xcf, 0x18, 0x91, 0xeb,
0xbd, 0x92, 0xc6, 0x70, 0x93, 0xce, 0xbd, 0x79, 0xbe, 0x44, 0x95, 0x5c,
0xbd, 0xcb, 0xb6, 0x7e, 0x96, 0xbc, 0xbe, 0x35, 0xae, 0xb8, 0x97, 0x81,
0xbf, 0x17, 0xa6, 0x8e, 0x98, 0x12, 0xbf, 0xff, 0x9e, 0x63, 0x98, 0x5e,
0xc0, 0xb7, 0x96, 0x11, 0x98, 0x84, 0xc1, 0x85, 0x8d, 0xec, 0x98, 0x69,
0xc2, 0x80, 0x86, 0x1c, 0x98, 0x33, 0xc3, 0xa4, 0x7e, 0x99, 0x97, 0xcd,
0xc5, 0x2c, 0x78, 0x04, 0x97, 0x53, 0xc6, 0xa5, 0x71, 0x69, 0x96, 0xf4,
0xc7, 0xfa, 0x6b, 0x13, 0x96, 0x87, 0xc9, 0x4c, 0x64, 0xd3, 0x96, 0x21,
0xca, 0x79, 0x5e, 0x7d, 0x96, 0x3d, 0xca, 0xe5, 0x57, 0x63, 0x96, 0xfd,
0xb9, 0x26, 0xd2, 0xc3, 0x99, 0x60, 0xb8, 0x88, 0xca, 0x22, 0x9b, 0x75,
0xb8, 0x31, 0xc2, 0x00, 0x9d, 0x21, 0xb8, 0x40, 0xba, 0x1a, 0x9e, 0x9a,
0xb8, 0x6e, 0xb2, 0x4a, 0x9f, 0xa4, 0xb8, 0xe7, 0xaa, 0x26, 0xa0, 0x71,
0xb9, 0x80, 0xa1, 0xee, 0xa0, 0xac, 0xba, 0x3c, 0x99, 0x8a, 0xa0, 0xbb,
0xba, 0xfe, 0x91, 0x18, 0xa0, 0x97, 0xbc, 0x21, 0x89, 0x2d, 0xa0, 0x57,
0xbd, 0x3b, 0x81, 0x3b, 0x9f, 0xc2, 0xbf, 0x03, 0x7a, 0x43, 0x9f, 0x34,
0xc0, 0xb2, 0x73, 0x94, 0x9e, 0xee, 0xc2, 0x0d, 0x6d, 0x25, 0x9e, 0xce,
0xc3, 0x43, 0x66, 0xd7, 0x9e, 0x9a, 0xc4, 0x84, 0x60, 0x96, 0x9e, 0xd5,
0xc5, 0x50, 0x59, 0x82, 0x9e, 0x95, 0xb3, 0xc6, 0xd6, 0x8a, 0xa0, 0xe2,
0xb3, 0x00, 0xcd, 0xe6, 0xa3, 0x16, 0xb2, 0xb4, 0xc5, 0xfa, 0xa5, 0x09,
0xb2, 0x7c, 0xbe, 0x1c, 0xa6, 0x88, 0xb2, 0x8b, 0xb6, 0x2d, 0xa7, 0xd1,
0xb2, 0xab, 0xae, 0x28, 0xa8, 0xb3, 0xb3, 0x0a, 0xa5, 0xc4, 0xa9, 0x3f,
0xb3, 0x8c, 0x9d, 0x5c, 0xa9, 0x3c, 0xb4, 0x5a, 0x94, 0xe6, 0xa9, 0x25,
0xb5, 0x54, 0x8c, 0xc1, 0xa8, 0xf0, 0xb6, 0x82, 0x84, 0xf9, 0xa8, 0xac,
0xb7, 0xf5, 0x7d, 0x9e, 0xa8, 0x42, 0xb9, 0xd5, 0x76, 0xdd, 0xa7, 0xb1,
0xbb, 0xad, 0x70, 0x0c, 0xa7, 0x98, 0xbc, 0xf8, 0x69, 0x5c, 0xa7, 0x6a,
0xbe, 0x4a, 0x62, 0xc2, 0xa7, 0x86, 0xbf, 0x4a, 0x5b, 0xc5, 0xa7, 0xd2,
0xad, 0xce, 0xdb, 0x1e, 0xaa, 0x4c, 0xad, 0x2a, 0xd2, 0x1c, 0xac, 0x52,
0xac, 0xbe, 0xca, 0x15, 0xae, 0x25, 0xac, 0x59, 0xc2, 0x3e, 0xaf, 0x77,
0xac, 0x3b, 0xba, 0x3e, 0xb0, 0x8a, 0xac, 0x3e, 0xb2, 0x30, 0xb1, 0x47,
0xac, 0x7d, 0xa9, 0xbc, 0xb1, 0xda, 0xac, 0xd1, 0xa1, 0x25, 0xb1, 0xed,
0xad, 0x94, 0x98, 0xa2, 0xb1, 0xdb, 0xae, 0x63, 0x90, 0x13, 0xb1, 0x5c,
0xaf, 0x8d, 0x88, 0x05, 0xb0, 0xe8, 0xb0, 0xa9, 0x80, 0x13, 0xb0, 0xe1,
0xb2, 0x92, 0x79, 0xa1, 0xb0, 0xb0, 0xb4, 0x71, 0x73, 0x16, 0xb0, 0xa4,
0xb5, 0xf3, 0x6c, 0x54, 0xb0, 0xc2, 0xb7, 0x2c, 0x65, 0x84, 0xb0, 0xe6,
0xb8, 0x65, 0x5e, 0x8f, 0xb1, 0xc4, 0xa6, 0xb7, 0xdf, 0xa8, 0xb4, 0x14,
0xa6, 0x53, 0xd6, 0xaf, 0xb6, 0x03, 0xa5, 0xf3, 0xce, 0x79, 0xb7, 0x87,
0xa5, 0xaa, 0xc6, 0x8a, 0xb8, 0xd7, 0xa5, 0x76, 0xbe, 0x89, 0xb9, 0xbb,
0xa5, 0x72, 0xb6, 0x4a, 0xba, 0x75, 0xa5, 0x8c, 0xad, 0xf2, 0xba, 0xc8,
0xa6, 0x08, 0xa5, 0x4f, 0xba, 0xf3, 0xa6, 0xa7, 0x9c, 0xca, 0xba, 0xe7,
0xa7, 0x77, 0x94, 0x6c, 0xba, 0xc2, 0xa8, 0x8a, 0x8c, 0x61, 0xba, 0x78,
0xa9, 0xda, 0x84, 0xa8, 0xba, 0x2d, 0xab, 0x55, 0x7d, 0x3a, 0xb9, 0xe7,
0xad, 0x21, 0x76, 0x50, 0xb9, 0x95, 0xae, 0xf1, 0x6f, 0x6d, 0xb9, 0xd2,
0xb0, 0x4b, 0x68, 0x41, 0xba, 0x00, 0xb1, 0x94, 0x61, 0x25, 0xbb, 0x8b,
0x9f, 0xf7, 0xe4, 0x7b, 0xbd, 0xba, 0x9f, 0x71, 0xdb, 0xaa, 0xbf, 0x88,
0x9f, 0x00, 0xd3, 0x7a, 0xc0, 0xe4, 0x9e, 0xc2, 0xcb, 0x47, 0xc1, 0xfd,
0x9e, 0xa2, 0xc3, 0x09, 0xc2, 0xdd, 0x9e, 0x84, 0xba, 0xb1, 0xc3, 0x96,
0x9e, 0x68, 0xb2, 0x47, 0xc3, 0xdc, 0x9e, 0xcc, 0xa9, 0xbd, 0xc3, 0xf7,
0x9f, 0x5b, 0xa1, 0x21, 0xc3, 0xcc, 0xa0, 0x25, 0x98, 0xb8, 0xc3, 0xa2,
0xa0, 0xfb, 0x90, 0x5a, 0xc3, 0x88, 0xa2, 0x6d, 0x88, 0xd6, 0xc3, 0x58,
0xa3, 0xd5, 0x81, 0x47, 0xc3, 0x32, 0xa5, 0x6b, 0x7a, 0x28, 0xc2, 0xfd,
0xa7, 0x0b, 0x73, 0x26, 0xc3, 0x45, 0xa8, 0xa5, 0x6b, 0xea, 0xc3, 0xd2,
0xaa, 0x29, 0x64, 0x58, 0xc4, 0x88, 0x99, 0x4e, 0xe8, 0xc6, 0xc6, 0xc7,
0x98, 0xc7, 0xdf, 0xe6, 0xc8, 0x59, 0x98, 0x7a, 0xd7, 0xc0, 0xc9, 0xda,
0x98, 0x33, 0xcf, 0xa8, 0xcb, 0x1c, 0x98, 0x04, 0xc7, 0x75, 0xcc, 0x47,
0x97, 0xd9, 0xbf, 0x44, 0xcc, 0xd5, 0x97, 0xdf, 0xb6, 0xdc, 0xcd, 0x44,
0x97, 0xfa, 0xae, 0x75, 0xcd, 0x45, 0x98, 0x66, 0xa6, 0x0a, 0xcd, 0x3d,
0x98, 0xf4, 0x9d, 0xac, 0xcd, 0x22, 0x99, 0xd1, 0x95, 0x71, 0xcc, 0xfe,
0x9a, 0xd7, 0x8d, 0x67, 0xcc, 0xc2, 0x9c, 0x31, 0x85, 0xb9, 0xcc, 0x83,
0x9d, 0xa8, 0x7e, 0x21, 0xcc, 0x54, 0x9f, 0x4a, 0x76, 0xe1, 0xcc, 0x1c,
0xa0, 0xdf, 0x6f, 0xb5, 0xcd, 0x81, 0xa2, 0xc0, 0x68, 0x02, 0xcc, 0x9f,
0x92, 0xad, 0xec, 0xb7, 0xce, 0xbb, 0x92, 0x15, 0xe3, 0xe7, 0xd0, 0x75,
0x91, 0xa5, 0xdb, 0xb5, 0xd1, 0xf2, 0x91, 0x5e, 0xd3, 0x96, 0xd3, 0x41,
0x91, 0x21, 0xcb, 0x68, 0xd4, 0x68, 0x90, 0xf0, 0xc3, 0x2a, 0xd5, 0x1f,
0x90, 0xf2, 0xba, 0xdc, 0xd5, 0x96, 0x91, 0x14, 0xb2, 0x84, 0xd5, 0xcc,
0x91, 0x62, 0xaa, 0x52, 0xd5, 0xe1, 0x91, 0xc1, 0xa2, 0x2c, 0xd5, 0xec,
0x92, 0x7d, 0x9a, 0x16, 0xd5, 0xeb, 0x93, 0x51, 0x92, 0x00, 0xd5, 0xed,
0x94, 0x7b, 0x8a, 0x3a, 0xd5, 0xdf, 0x95, 0xc2, 0x82, 0x87, 0xd6, 0x35,
0x97, 0x70, 0x7b, 0x08, 0xd6, 0x88, 0x99, 0x34, 0x73, 0xa9, 0xd7, 0x3d,
0x9b, 0x33, 0x6c, 0x01, 0xd4, 0x3e, 0x8c, 0x2f, 0xf0, 0x64, 0xd6, 0x46,
0x8b, 0xb9, 0xe7, 0x98, 0xd7, 0xfb, 0x8b, 0x52, 0xdf, 0x77, 0xd9, 0x85,
0x8a, 0xf5, 0xd7, 0x40, 0xda, 0xfe, 0x8a, 0x99, 0xcf, 0x10, 0xdc, 0x1a,
0x8a, 0x63, 0xc6, 0xdf, 0xdd, 0x16, 0x8a, 0x3a, 0xbe, 0xb4, 0xdd, 0x9a,
0x8a, 0x51, 0xb6, 0x8b, 0xde, 0x0f, 0x8a, 0x78, 0xae, 0x74, 0xde, 0x50,
0x8a, 0xdd, 0xa6, 0x98, 0xde, 0x8e, 0x8b, 0x51, 0x9e, 0xbe, 0xde, 0xc0,
0x8c, 0x19, 0x96, 0xe7, 0xde, 0xe8, 0x8c, 0xeb, 0x8f, 0x05, 0xde, 0xed,
0x8e, 0x29, 0x87, 0x07, 0xde, 0xe5, 0x8f, 0x82, 0x7f, 0x0e, 0xdf, 0xbb,
0x91, 0x7d, 0x77, 0x6c, 0xe0, 0x82, 0x93, 0x6e, 0x6f, 0xb6, 0xda, 0xf7,
0x85, 0xe1, 0xf3, 0xba, 0xdd, 0x16, 0x85, 0x8a, 0xeb, 0x45, 0xde, 0xc9,
0x85, 0x10, 0xe3, 0x33, 0xe0, 0x66, 0x84, 0x93, 0xda, 0xf2, 0xe1, 0xe7,
0x84, 0x29, 0xd2, 0x92, 0xe3, 0x18, 0x83, 0xe8, 0xca, 0x6c, 0xe4, 0x25,
0x83, 0xb8, 0xc2, 0x68, 0xe4, 0xec, 0x83, 0xb1, 0xba, 0x75, 0xe5, 0x99,
0x83, 0xb8, 0xb2, 0x8b, 0xe6, 0x13, 0x84, 0x03, 0xaa, 0xc3, 0xe6, 0x74,
0x84, 0x69, 0xa3, 0x04, 0xe6, 0xd8, 0x85, 0x0e, 0x9b, 0x4e, 0xe7, 0x3d,
0x85, 0xd8, 0x93, 0x99, 0xe7, 0xc8, 0x86, 0xcd, 0x8b, 0xc5, 0xe8, 0x66,
0x87, 0xef, 0x83, 0xd9, 0xe9, 0x6d, 0x89, 0xcd, 0x7b, 0xea, 0xea, 0xe9,
0x8c, 0x20, 0x73, 0xce, 0xe1, 0xf4, 0x7f, 0xb4, 0xf7, 0x2c, 0xe3, 0x4d,
0x7f, 0x93, 0xee, 0xeb, 0xe5, 0x3f, 0x7e, 0xf2, 0xe6, 0xae, 0xe6, 0xf8,
0x7e, 0x71, 0xde, 0x80, 0xe8, 0xaf, 0x7d, 0xf5, 0xd6, 0x0c, 0xea, 0x2c,
0x7d, 0x93, 0xcd, 0xde, 0xeb, 0x4c, 0x7d, 0x56, 0xc6, 0x1b, 0xec, 0x5a,
0x7d, 0x25, 0xbe, 0x69, 0xed, 0x2a, 0x7d, 0x24, 0xb6, 0xc9, 0xed, 0xef,
0x7d, 0x2d, 0xaf, 0x2d, 0xee, 0x57, 0x7d, 0x99, 0xa7, 0x7c, 0xee, 0xbd,
0x7d, 0xff, 0x9f, 0xc7, 0xef, 0x21, 0x7e, 0xbd, 0x98, 0x02, 0xef, 0x7f,
0x7f, 0x68, 0x90, 0x39, 0xf0, 0x7d, 0x80, 0x1a, 0x88, 0x5d, 0xf1, 0x70,
0x80, 0x80, 0x80, 0x80, 0xf5, 0xd4, 0x83, 0xf5, 0x77, 0xa1, 0xeb, 0x5e,
0x77, 0xab, 0xf8, 0x75, 0xec, 0xd8, 0x77, 0xad, 0xf0, 0x4e, 0xee, 0x7d,
0x77, 0x4b, 0xe8, 0x6c, 0xf0, 0x07, 0x76, 0xee, 0xe0, 0x96, 0xf1, 0x64,
0x76, 0xbf, 0xd8, 0xe5, 0xf2, 0xaa, 0x76, 0x99, 0xd1, 0x47, 0xf3, 0xbf,
0x76, 0x67, 0xc9, 0xf1, 0xf4, 0xce, 0x76, 0x3d, 0xc2, 0xb9, 0xf5, 0xae,
0x76, 0x44, 0xbb, 0x77, 0xf6, 0x6e, 0x76, 0x64, 0xb4, 0x26, 0xf7, 0x13,
0x76, 0xc8, 0xac, 0xb6, 0xf7, 0xa2, 0x77, 0x72, 0xa5, 0x21, 0xf8, 0x32,
0x78, 0x2c, 0x9d, 0x7b, 0xf8, 0xc1, 0x78, 0xfb, 0x95, 0xc0, 0xf9, 0x69,
0x79, 0xbe, 0x8d, 0xe4, 0xfa, 0x6b, 0x7a, 0x5e, 0x85, 0xc8, 0xfe, 0x21,
0x7b, 0xb4, 0x7c, 0x51, 0x7b, 0xa9, 0xd7, 0x96, 0xc5, 0x82, 0x7c, 0xcd,
0xd7, 0x4a, 0xbc, 0xf6, 0x7d, 0x5a, 0xd8, 0x5c, 0xb6, 0x02, 0x7d, 0xb7,
0xd9, 0xb2, 0xaf, 0x33, 0x7d, 0x3f, 0xdb, 0x77, 0xa7, 0xb4, 0x7c, 0x73,
0xdd, 0x49, 0xa0, 0x55, 0x7b, 0xc6, 0xde, 0xb2, 0x98, 0x68, 0x7a, 0xe1,
0xdf, 0xfd, 0x90, 0x85, 0x79, 0xe2, 0xe1, 0x3c, 0x89, 0x2d, 0x78, 0xc5,
0xe2, 0x28, 0x81, 0xb5, 0x77, 0xea, 0xe2, 0xad, 0x7b, 0x0b, 0x77, 0x15,
0xe2, 0xf2, 0x74, 0x7a, 0x76, 0x4c, 0xe3, 0x32, 0x6e, 0x32, 0x75, 0xa4,
0xe3, 0x80, 0x68, 0x64, 0x75, 0x02, 0xe3, 0xd6, 0x62, 0x92, 0x74, 0x45,
0xe3, 0xb4, 0x5c, 0x76, 0x73, 0x92, 0xe3, 0x3c, 0x56, 0x0f, 0x81, 0xaf,
0xd2, 0xb2, 0xc6, 0x8c, 0x83, 0x36, 0xd2, 0x9d, 0xbe, 0x8a, 0x83, 0xed,
0xd3, 0xb7, 0xb7, 0xaf, 0x84, 0x6f, 0xd4, 0xd5, 0xb0, 0xeb, 0x84, 0x43,
0xd6, 0x3c, 0xa9, 0x7d, 0x83, 0xdd, 0xd7, 0xce, 0xa2, 0x0e, 0x83, 0x76,
0xd9, 0x33, 0x9a, 0x29, 0x82, 0xee, 0xda, 0x78, 0x92, 0x1a, 0x82, 0x1e,
0xdb, 0x8a, 0x8a, 0x6f, 0x81, 0x2e, 0xdc, 0x82, 0x82, 0xec, 0x80, 0x3f,
0xdd, 0x4a, 0x7c, 0x12, 0x7f, 0x54, 0xdd, 0xfe, 0x75, 0x80, 0x7e, 0x76,
0xde, 0xa2, 0x6f, 0x14, 0x7d, 0xc4, 0xdf, 0x1f, 0x69, 0x49, 0x7d, 0x25,
0xdf, 0x9b, 0x63, 0x84, 0x7c, 0x66, 0xdf, 0xae, 0x5d, 0x7f, 0x7b, 0xe7,
0xdf, 0x65, 0x57, 0x45, 0x87, 0x61, 0xce, 0x95, 0xc8, 0x8d, 0x89, 0x4e,
0xce, 0x81, 0xc0, 0xc6, 0x8a, 0x4a, 0xcf, 0x61, 0xb9, 0xb3, 0x8b, 0x0e,
0xd0, 0x65, 0xb2, 0xc4, 0x8b, 0x55, 0xd1, 0x96, 0xab, 0x80, 0x8b, 0x33,
0xd2, 0xf0, 0xa4, 0x04, 0x8a, 0xf8, 0xd4, 0x4e, 0x9c, 0x42, 0x8a, 0x9e,
0xd5, 0x8f, 0x94, 0x0d, 0x8a, 0x0e, 0xd6, 0xbc, 0x8c, 0x24, 0x89, 0x44,
0xd7, 0xcc, 0x84, 0x6f, 0x88, 0x67, 0xd8, 0xc7, 0x7d, 0x55, 0x87, 0x82,
0xd9, 0xa9, 0x76, 0xd8, 0x86, 0x9c, 0xda, 0x7c, 0x70, 0x57, 0x85, 0xf2,
0xdb, 0x40, 0x6a, 0x7d, 0x85, 0x53, 0xdb, 0xf8, 0x64, 0xac, 0x84, 0xbd,
0xdc, 0x74, 0x5e, 0xcd, 0x84, 0x90, 0xdc, 0x56, 0x58, 0xb2, 0x8d, 0x56,
0xca, 0xaa, 0xcb, 0x53, 0x8f, 0x25, 0xca, 0x94, 0xc3, 0x7d, 0x90, 0x96,
0xcb, 0x20, 0xbc, 0x1c, 0x91, 0x83, 0xcc, 0x00, 0xb4, 0xf3, 0x92, 0x53,
0xcd, 0x0a, 0xad, 0xca, 0x92, 0x70, 0xce, 0x22, 0xa6, 0x29, 0x92, 0x78,
0xcf, 0x51, 0x9e, 0x88, 0x92, 0x31, 0xd0, 0x8d, 0x96, 0x46, 0x91, 0xc1,
0xd1, 0xbb, 0x8e, 0x26, 0x91, 0x20, 0xd2, 0xd8, 0x86, 0x56, 0x90, 0x6b,
0xd3, 0xf5, 0x7e, 0xd4, 0x8f, 0x8f, 0xd4, 0xfd, 0x78, 0x5d, 0x8e, 0xae,
0xd5, 0xf8, 0x71, 0xe4, 0x8d, 0xfe, 0xd6, 0xfe, 0x6b, 0xe0, 0x8d, 0x67,
0xd7, 0xfe, 0x66, 0x03, 0x8c, 0xc4, 0xd8, 0xec, 0x60, 0x29, 0x8c, 0xe9,
0xd8, 0xfb, 0x5a, 0x08, 0x93, 0xc0, 0xc7, 0x0c, 0xce, 0x33, 0x95, 0x9a,
0xc7, 0x34, 0xc6, 0x55, 0x97, 0x43, 0xc7, 0x7f, 0xbe, 0xbf, 0x98, 0x5e,
0xc8, 0x25, 0xb7, 0x7b, 0x99, 0x7e, 0xc8, 0xd3, 0xb0, 0x60, 0x99, 0xc6,
0xc9, 0x94, 0xa8, 0xb0, 0x99, 0xe5, 0xca, 0x4e, 0xa1, 0x0c, 0x99, 0xcd,
0xcb, 0x47, 0x99, 0x0c, 0x99, 0xba, 0xcc, 0x6f, 0x91, 0x19, 0x99, 0x1c,
0xcd, 0x7d, 0x89, 0x58, 0x98, 0x8b, 0xce, 0xaa, 0x81, 0xa2, 0x97, 0xc6,
0xcf, 0xe8, 0x7a, 0xce, 0x96, 0xec, 0xd0, 0xf8, 0x74, 0x25, 0x96, 0x44,
0xd2, 0x1c, 0x6d, 0xd6, 0x95, 0xbe, 0xd3, 0x4a, 0x67, 0xda, 0x95, 0x28,
0xd4, 0x6d, 0x61, 0xe1, 0x95, 0x90, 0xd5, 0x3c, 0x5b, 0xad, 0x9a, 0x7a,
0xc3, 0x88, 0xd1, 0x3b, 0x9c, 0x67, 0xc3, 0x77, 0xc9, 0x3a, 0x9e, 0x33,
0xc3, 0x92, 0xc1, 0xa7, 0x9f, 0x82, 0xc3, 0xf3, 0xba, 0x41, 0xa0, 0xb9,
0xc4, 0x66, 0xb3, 0x05, 0xa1, 0x5a, 0xc4, 0xe7, 0xab, 0x77, 0xa1, 0x89,
0xc5, 0x72, 0xa3, 0xac, 0xa1, 0x82, 0xc6, 0x17, 0x9b, 0xc2, 0xa1, 0x6b,
0xc6, 0xf0, 0x93, 0xc8, 0xa0, 0xee, 0xc7, 0xc7, 0x8b, 0xfd, 0xa0, 0x5a,
0xc8, 0xb6, 0x84, 0x65, 0x9f, 0xc9, 0xc9, 0xdf, 0x7d, 0x53, 0x9f, 0x1b,
0xcb, 0x28, 0x76, 0xb9, 0x9e, 0x7d, 0xcc, 0x74, 0x70, 0x30, 0x9e, 0x19,
0xcd, 0xc2, 0x6a, 0x03, 0x9d, 0xa3, 0xcf, 0x1a, 0x63, 0xe2, 0x9d, 0x86,
0xd0, 0x86, 0x5d, 0xac, 0xa1, 0xa9, 0xbf, 0x34, 0xd4, 0x5f, 0xa3, 0xe8,
0xbe, 0xe2, 0xcc, 0x8a, 0xa5, 0xcf, 0xbe, 0xce, 0xc5, 0x2e, 0xa7, 0x72,
0xbe, 0xde, 0xbd, 0xd8, 0xa8, 0x89, 0xbf, 0x36, 0xb6, 0x5b, 0xa9, 0x6f,
0xbf, 0x9c, 0xae, 0xd5, 0xa9, 0xa7, 0xc0, 0x3c, 0xa6, 0xe8, 0xa9, 0xb1,
0xc0, 0xcc, 0x9e, 0xfd, 0xa9, 0x5f, 0xc1, 0x7f, 0x96, 0xe0, 0xa9, 0x09,
0xc2, 0x46, 0x8e, 0xe5, 0xa8, 0x72, 0xc3, 0x31, 0x87, 0x45, 0xa7, 0xf1,
0xc4, 0x3c, 0x7f, 0xcd, 0xa7, 0x42, 0xc5, 0x9e, 0x79, 0x1c, 0xa6, 0x94,
0xc6, 0xfc, 0x72, 0x7b, 0xa6, 0x3b, 0xc8, 0x48, 0x6c, 0x1f, 0xa5, 0xfe,
0xc9, 0x8b, 0x65, 0xed, 0xa6, 0x1e, 0xcb, 0x28, 0x60, 0x00, 0xaa, 0x60,
0xba, 0x02, 0xd8, 0x8e, 0xac, 0x99, 0xb9, 0x7f, 0xd0, 0xa2, 0xae, 0x79,
0xb9, 0x6d, 0xc9, 0x3e, 0xb0, 0x0d, 0xb9, 0x4c, 0xc1, 0xec, 0xb1, 0x18,
0xb9, 0x79, 0xba, 0x58, 0xb1, 0xd2, 0xb9, 0xaf, 0xb2, 0xa9, 0xb2, 0x33,
0xba, 0x19, 0xaa, 0xb4, 0xb2, 0x4a, 0xba, 0x8f, 0xa2, 0x96, 0xb2, 0x02,
0xbb, 0x44, 0x9a, 0x71, 0xb1, 0x8f, 0xbc, 0x10, 0x92, 0x49, 0xb0, 0xfd,
0xbd, 0x13, 0x8a, 0xa1, 0xb0, 0x64, 0xbe, 0x2c, 0x83, 0x1f, 0xaf, 0xba,
0xbf, 0xa9, 0x7c, 0x05, 0xae, 0xfe, 0xc1, 0x2b, 0x75, 0x1a, 0xae, 0x73,
0xc2, 0x8b, 0x6e, 0x65, 0xae, 0x4b, 0xc3, 0xa2, 0x67, 0xf3, 0xae, 0x4e,
0xc4, 0xf1, 0x61, 0xa5, 0xb3, 0xd2, 0xb4, 0x4f, 0xdc, 0xdb, 0xb5, 0xc1,
0xb4, 0x0d, 0xd5, 0x02, 0xb7, 0xc0, 0xb4, 0x11, 0xcd, 0x7b, 0xb8, 0xd8,
0xb3, 0xe3, 0xc5, 0xf7, 0xb9, 0xd6, 0xb3, 0xd8, 0xbe, 0x69, 0xba, 0x60,
0xb4, 0x08, 0xb6, 0x89, 0xba, 0xcf, 0xb4, 0x47, 0xae, 0x9c, 0xba, 0xc9,
0xb4, 0xb7, 0xa6, 0x34, 0xba, 0xae, 0xb5, 0x41, 0x9d, 0xdc, 0xba, 0x2b,
0xb5, 0xe2, 0x95, 0x7a, 0xb9, 0xa3, 0xb6, 0xb3, 0x8d, 0x6f, 0xb9, 0x06,
0xb7, 0xbf, 0x85, 0xeb, 0xb8, 0x72, 0xb8, 0xf3, 0x7e, 0xa1, 0xb7, 0xdd,
0xba, 0x7d, 0x77, 0xe7, 0xb7, 0x3a, 0xbc, 0x0a, 0x71, 0x1f, 0xb6, 0xfb,
0xbd, 0x55, 0x6a, 0x4f, 0xb6, 0xd0, 0xbe, 0xab, 0x63, 0x83, 0xbd, 0xb6,
0xae, 0x1c, 0xe1, 0xc1, 0xbf, 0x67, 0xad, 0xcd, 0xd9, 0xbe, 0xc1, 0x06,
0xad, 0xa9, 0xd2, 0x17, 0xc2, 0x03, 0xad, 0x97, 0xca, 0x63, 0xc2, 0xd4,
0xad, 0x93, 0xc2, 0xb0, 0xc3, 0x53, 0xad, 0xb8, 0xba, 0xbf, 0xc3, 0x9c,
0xad, 0xed, 0xb2, 0xaa, 0xc3, 0x89, 0xae, 0x4c, 0xaa, 0x3b, 0xc3, 0x55,
0xae, 0xc7, 0xa1, 0xa1, 0xc2, 0xe5, 0xaf, 0x66, 0x99, 0x2e, 0xc2, 0x6c,
0xb0, 0x0a, 0x90, 0xbb, 0xc1, 0xec, 0xb1, 0x1c, 0x89, 0x1a, 0xc1, 0x5c,
0xb2, 0x2e, 0x81, 0x86, 0xc0, 0xe6, 0xb3, 0x98, 0x7a, 0xb6, 0xc0, 0x61,
0xb5, 0x07, 0x73, 0xff, 0xc0, 0x07, 0xb6, 0x64, 0x6d, 0x29, 0xbf, 0xf1,
0xb7, 0xbe, 0x66, 0x12, 0xc7, 0x92, 0xa7, 0xb4, 0xe6, 0xf8, 0xc9, 0x13,
0xa7, 0x41, 0xde, 0xae, 0xca, 0x82, 0xa7, 0x54, 0xd7, 0x10, 0xcb, 0x57,
0xa7, 0x1b, 0xcf, 0x54, 0xcc, 0x17, 0xa7, 0x13, 0xc7, 0x6f, 0xcc, 0xab,
0xa6, 0xf6, 0xbf, 0x7d, 0xcc, 0xc8, 0xa7, 0x1b, 0xb7, 0x26, 0xcc, 0xb9,
0xa7, 0x2f, 0xae, 0xbb, 0xcc, 0x61, 0xa7, 0x90, 0xa6, 0x26, 0xcc, 0x0d,
0xa8, 0x1c, 0x9d, 0xae, 0xcb, 0x97, 0xa8, 0xdd, 0x95, 0x66, 0xcb, 0x18,
0xa9, 0xcd, 0x8d, 0x57, 0xca, 0x8a, 0xab, 0x0a, 0x85, 0xa6, 0xca, 0x09,
0xac, 0x56, 0x7e, 0x25, 0xc9, 0xa1, 0xad, 0xd7, 0x77, 0x23, 0xc9, 0x28,
0xaf, 0x58, 0x70, 0x2e, 0xc9, 0x53, 0xb0, 0xa2, 0x68, 0xa1, 0xd0, 0x69,
0xa0, 0xbd, 0xeb, 0x79, 0xd1, 0x9d, 0xa0, 0x5f, 0xe3, 0x59, 0xd2, 0xa3,
0xa0, 0x41, 0xdb, 0x7d, 0xd3, 0x7d, 0xa0, 0x30, 0xd3, 0xb3, 0xd4, 0x3b,
0xa0, 0x1d, 0xcb, 0xc3, 0xd4, 0xc2, 0x9f, 0xfc, 0xc3, 0xa1, 0xd5, 0x17,
0xa0, 0x03, 0xbb, 0x5d, 0xd5, 0x36, 0xa0, 0x1f, 0xb2, 0xf5, 0xd5, 0x17,
0xa0, 0x6e, 0xaa, 0x8e, 0xd4, 0xd3, 0xa0, 0xd9, 0xa2, 0x21, 0xd4, 0x93,
0xa1, 0x88, 0x99, 0xde, 0xd4, 0x51, 0xa2, 0x4e, 0x91, 0xac, 0xd3, 0xfc,
0xa3, 0x95, 0x89, 0xeb, 0xd3, 0x77, 0xa4, 0xda, 0x82, 0x31, 0xd3, 0x38,
0xa6, 0x56, 0x7a, 0xee, 0xd2, 0xf4, 0xa7, 0xd5, 0x73, 0xdb, 0xd2, 0xed,
0xa9, 0x2c, 0x6c, 0x5c, 0xd7, 0xfc, 0x9a, 0x0a, 0xef, 0x25, 0xd9, 0x02,
0x99, 0xc3, 0xe7, 0x0c, 0xda, 0x04, 0x99, 0x95, 0xdf, 0x25, 0xdb, 0x16,
0x99, 0x64, 0xd7, 0x47, 0xdc, 0x1d, 0x99, 0x34, 0xcf, 0x6c, 0xdc, 0xae,
0x99, 0x21, 0xc7, 0x47, 0xdd, 0x34, 0x99, 0x17, 0xbf, 0x22, 0xdd, 0x64,
0x99, 0x4b, 0xb6, 0xe0, 0xdd, 0x8b, 0x99, 0x89, 0xae, 0xa5, 0xdd, 0x60,
0x99, 0xe5, 0xa6, 0x82, 0xdd, 0x35, 0x9a, 0x5a, 0x9e, 0x5f, 0xdd, 0x13,
0x9b, 0x13, 0x96, 0x4d, 0xdc, 0xef, 0x9b, 0xf0, 0x8e, 0x4d, 0xdc, 0xc2,
0x9d, 0x47, 0x86, 0x90, 0xdc, 0x96, 0x9e, 0xa6, 0x7e, 0xe1, 0xdc, 0x9e,
0xa0, 0x34, 0x77, 0x7d, 0xdc, 0xbe, 0xa2, 0x0b, 0x70, 0x14, 0xdf, 0x1b,
0x93, 0x6e, 0xf2, 0xd0, 0xe0, 0x60, 0x93, 0x2d, 0xea, 0x9e, 0xe1, 0x59,
0x93, 0x04, 0xe2, 0xb5, 0xe2, 0x55, 0x92, 0xcf, 0xda, 0xc7, 0xe3, 0x4a,
0x92, 0x91, 0xd2, 0xdd, 0xe4, 0x02, 0x92, 0x6f, 0xca, 0xd5, 0xe4, 0xa1,
0x92, 0x5b, 0xc2, 0xc0, 0xe5, 0x0e, 0x92, 0x7f, 0xba, 0xa8, 0xe5, 0x63,
0x92, 0xbf, 0xb2, 0x8c, 0xe5, 0x8f, 0x93, 0x03, 0xaa, 0x8e, 0xe5, 0xb6,
0x93, 0x56, 0xa2, 0xa1, 0xe5, 0xd4, 0x93, 0xf3, 0x9a, 0xb8, 0xe5, 0xf7,
0x94, 0xb4, 0x92, 0xd2, 0xe6, 0x2b, 0x95, 0xdd, 0x8a, 0xf9, 0xe6, 0x44,
0x97, 0x27, 0x83, 0x27, 0xe6, 0xdf, 0x98, 0xe5, 0x7b, 0x86, 0xe7, 0xaf,
0x9a, 0xfd, 0x73, 0x3d, 0xe5, 0x13, 0x8d, 0x6d, 0xf6, 0xbe, 0xe6, 0x5d,
0x8d, 0x27, 0xee, 0x63, 0xe7, 0x74, 0x8c, 0xe8, 0xe6, 0x67, 0xe8, 0x7e,
0x8c, 0xa9, 0xde, 0x69, 0xe9, 0x89, 0x8c, 0x5f, 0xd6, 0x56, 0xea, 0x84,
0x8c, 0x1d, 0xce, 0x4a, 0xeb, 0x50, 0x8b, 0xfe, 0xc6, 0x54, 0xec, 0x09,
0x8b, 0xec, 0xbe, 0x66, 0xec, 0x83, 0x8c, 0x10, 0xb6, 0x7f, 0xec, 0xf3,
0x8c, 0x3a, 0xae, 0x9c, 0xed, 0x4d, 0x8c, 0x86, 0xa6, 0xc6, 0xed, 0xaa,
0x8c, 0xe1, 0x9e, 0xef, 0xee, 0x04, 0x8d, 0xa8, 0x97, 0x1e, 0xee, 0x63,
0x8e, 0x7a, 0x8f, 0x46, 0xee, 0xd8, 0x8f, 0xb1, 0x87, 0x5e, 0xef, 0x6d,
0x90, 0xf8, 0x7f, 0x72, 0xf2, 0x5a, 0x93, 0x2d, 0x76, 0xfc, 0xeb, 0x7b,
0x87, 0x50, 0xfa, 0x32, 0xec, 0xa7, 0x87, 0x21, 0xf2, 0x05, 0xed, 0xc6,
0x86, 0xe6, 0xea, 0x07, 0xee, 0xc9, 0x86, 0xa6, 0xe2, 0x13, 0xef, 0xe7,
0x86, 0x4f, 0xd9, 0xeb, 0xf1, 0x24, 0x85, 0xf2, 0xd1, 0xae, 0xf2, 0x29,
0x85, 0xc0, 0xc9, 0xd8, 0xf3, 0x28, 0x85, 0xaf, 0xc2, 0x2b, 0xf3, 0xfd,
0x85, 0xbb, 0xba, 0x7f, 0xf4, 0xb8, 0x85, 0xc6, 0xb2, 0xd1, 0xf5, 0x54,
0x86, 0x0e, 0xab, 0x21, 0xf5, 0xe0, 0x86, 0x6e, 0xa3, 0x6c, 0xf6, 0x7b,
0x87, 0x06, 0x9b, 0xb8, 0xf7, 0x14, 0x87, 0xbd, 0x94, 0x03, 0xf8, 0x23,
0x88, 0xb6, 0x8c, 0x4a, 0xf9, 0xf3, 0x8a, 0x1c, 0x84, 0x83, 0xfe, 0x8c,
0x8b, 0x51, 0x7a, 0xfc, 0xf2, 0x9e, 0x80, 0xad, 0xfd, 0x9a, 0xf3, 0x8b,
0x80, 0xcb, 0xf5, 0x8c, 0xf4, 0x8e, 0x80, 0xbd, 0xed, 0xa7, 0xf5, 0x8d,
0x80, 0x79, 0xe5, 0xa6, 0xf6, 0x8c, 0x80, 0x27, 0xdd, 0x99, 0xf7, 0xd1,
0x7f, 0xa2, 0xd5, 0x52, 0xf9, 0x24, 0x7f, 0x33, 0xcd, 0x70, 0xfa, 0x24,
0x7f, 0x13, 0xc5, 0xf8, 0xfb, 0x21, 0x7e, 0xfb, 0xbe, 0x85, 0xfb, 0xf9,
0x7e, 0xf7, 0xb7, 0x03, 0xfc, 0xca, 0x7f, 0x04, 0xaf, 0x7d, 0xfd, 0x74,
0x7f, 0x67, 0xa7, 0xdd, 0xfe, 0x1c, 0x7f, 0xd0, 0xa0, 0x37, 0xfe, 0xbf,
0x80, 0x47, 0x98, 0x8d, 0xff, 0x9f, 0x80, 0x93, 0x90, 0xd3, 0xff, 0xff,
0x80, 0xf1, 0x88, 0xd7, 0xff, 0xff, 0x80, 0x80, 0x80, 0x80, 0x00, 0x00,
0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x6d, 0x41, 0x42, 0x20, 0x00, 0x00, 0x00, 0x00, 0x03, 0x03, 0x00, 0x00,
0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00, 0x50, 0x00, 0x00, 0x00, 0x80,
0x00, 0x00, 0x00, 0xf8, 0x00, 0x00, 0x01, 0x3c, 0x63, 0x75, 0x72, 0x76,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0xff, 0xff,
0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02,
0x00, 0x00, 0xff, 0xff, 0x63, 0x75, 0x72, 0x76, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0xb0, 0xba,
0xff, 0xfe, 0x4f, 0x46, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0xad, 0x17, 0xff, 0xff, 0x52, 0xe9, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x80, 0x81, 0x00, 0x00, 0x80, 0x81, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x55, 0x55,
0x00, 0x01, 0x9e, 0x6d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x09, 0x5e, 0x4c,
0x00, 0x00, 0x02, 0x30, 0xff, 0xff, 0xd7, 0x0a, 0x00, 0x00, 0x00, 0x00,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00,
0x00, 0x00, 0x55, 0x55, 0x00, 0x01, 0x8f, 0x97, 0x00, 0x00, 0x00, 0x00,
0x00, 0x09, 0x08, 0x70, 0x00, 0x00, 0x02, 0x44, 0xff, 0xff, 0xd7, 0x0a,
0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x55, 0x55, 0x00, 0x01, 0xe4, 0x69,
0x00, 0x00, 0x00, 0x00, 0x00, 0x0a, 0xf3, 0x4d, 0x00, 0x00, 0x01, 0xdf,
0xff, 0xff, 0xd7, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x02, 0x02, 0x02, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x24, 0x9f,
0x0f, 0x84, 0xb6, 0xc2, 0x62, 0x96, 0xb7, 0x86, 0x18, 0xd9, 0x87, 0x35,
0xc7, 0x0a, 0xcf, 0x9c, 0x6f, 0xa0, 0x38, 0xf5, 0x03, 0x90, 0x94, 0x3e,
0x48, 0x79, 0xba, 0x53, 0xd2, 0x36, 0xf0, 0x7b, 0x1c, 0x6a, 0xf6, 0xd5,
0xff, 0xff, 0xd3, 0x2c, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x04, 0x00, 0x00, 0x00, 0x02, 0x66, 0x66, 0x00, 0x00, 0xf1, 0x63,
0x00, 0x00, 0x0d, 0x47, 0x00, 0x00, 0x13, 0x90, 0x00, 0x00, 0x0a, 0x0f,
0x00, 0x00, 0x03, 0x33, 0x00, 0x00, 0x03, 0x33, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x02, 0x66, 0x66,
0x00, 0x00, 0xf1, 0x63, 0x00, 0x00, 0x0d, 0x47, 0x00, 0x00, 0x13, 0x90,
0x00, 0x00, 0x0a, 0x0f, 0x00, 0x00, 0x03, 0x33, 0x00, 0x00, 0x03, 0x33,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00,
0x00, 0x02, 0x66, 0x66, 0x00, 0x00, 0xf1, 0x63, 0x00, 0x00, 0x0d, 0x47,
0x00, 0x00, 0x13, 0x90, 0x00, 0x00, 0x0a, 0x0f, 0x00, 0x00, 0x03, 0x33,
0x00, 0x00, 0x03, 0x33, 0x6d, 0x42, 0x41, 0x20, 0x00, 0x00, 0x00, 0x00,
0x03, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00, 0x50,
0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x00, 0xb0, 0x00, 0x00, 0x73, 0xec,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x11, 0x11, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x1b, 0x3f, 0xa2, 0xc4,
0xaa, 0x74, 0x1f, 0x99, 0xa0, 0x5a, 0xa3, 0xd1, 0x20, 0x6b, 0x9f, 0x0e,
0xa1, 0x1a, 0x22, 0x7a, 0x9d, 0xa0, 0x9b, 0xa8, 0x25, 0x65, 0x9a, 0xdb,
0x94, 0xc2, 0x24, 0x38, 0x9c, 0x4c, 0x8f, 0x4e, 0x26, 0xf4, 0x9a, 0xb1,
0x8a, 0x8a, 0x26, 0xbd, 0x99, 0x7f, 0x88, 0x14, 0x28, 0x73, 0x8e, 0x71,
0x74, 0x7a, 0x28, 0xe8, 0x8c, 0xaa, 0x66, 0xa3, 0x28, 0xb5, 0x8c, 0x5d,
0x64, 0x91, 0x28, 0x80, 0x8c, 0x11, 0x62, 0x79, 0x20, 0xee, 0x87, 0xb3,
0x4a, 0xc5, 0x21, 0x0d, 0x88, 0xc9, 0x27, 0x85, 0x21, 0x95, 0x89, 0x20,
0x24, 0xad, 0x22, 0x1f, 0x89, 0x6e, 0x22, 0x33, 0x20, 0x61, 0x87, 0x83,
0x1c, 0xd3, 0x17, 0xca, 0xa1, 0x46, 0xb7, 0xba, 0x1a, 0x79, 0x9f, 0x8e,
0xa8, 0xfb, 0x20, 0x13, 0x9d, 0x11, 0xa0, 0x5a, 0x21, 0x12, 0x9b, 0x51,
0x9c, 0xeb, 0x23, 0xf6, 0x99, 0x9e, 0x95, 0x6b, 0x25, 0x92, 0x97, 0x1c,
0x8f, 0xa2, 0x24, 0x29, 0x98, 0xc6, 0x89, 0x8a, 0x29, 0xe5, 0x86, 0x64,
0x75, 0x1a, 0x29, 0x99, 0x8a, 0xb9, 0x72, 0xac, 0x27, 0xcf, 0x8b, 0xdc,
0x64, 0x36, 0x28, 0xd3, 0x8a, 0xd8, 0x62, 0xd8, 0x28, 0x31, 0x89, 0x8c,
0x5c, 0xf8, 0x21, 0xc5, 0x7f, 0x65, 0x28, 0xea, 0x22, 0xb0, 0x80, 0xd6,
0x26, 0x1d, 0x22, 0x0f, 0x86, 0xf7, 0x22, 0x4c, 0x22, 0xdf, 0x87, 0x95,
0x1f, 0xe4, 0x23, 0x9d, 0x88, 0x1c, 0x1d, 0xd9, 0x16, 0xb0, 0x9f, 0x0d,
0xb7, 0x7a, 0x15, 0xfd, 0x9c, 0xc5, 0xb3, 0x12, 0x1a, 0x31, 0x9a, 0xec,
0xa5, 0xbb, 0x20, 0xb7, 0x98, 0x65, 0x9b, 0x64, 0x21, 0xfa, 0x95, 0xe7,
0x96, 0xcd, 0x25, 0x15, 0x93, 0xfc, 0x8d, 0xdb, 0x23, 0x4e, 0x83, 0xc5,
0x78, 0x74, 0x27, 0xc7, 0x88, 0x45, 0x78, 0x0b, 0x29, 0x16, 0x84, 0x63,
0x6b, 0xa0, 0x29, 0xe3, 0x84, 0xe1, 0x63, 0x30, 0x29, 0x1d, 0x86, 0x55,
0x5e, 0x11, 0x23, 0xae, 0x7d, 0xd6, 0x49, 0x0c, 0x23, 0x9f, 0x78, 0x66,
0x27, 0xb8, 0x23, 0xca, 0x7e, 0x1e, 0x24, 0x44, 0x24, 0x98, 0x80, 0xdf,
0x21, 0x7d, 0x24, 0x64, 0x85, 0xbd, 0x1d, 0xc8, 0x25, 0x21, 0x86, 0x75,
0x1b, 0xca, 0x0f, 0xe2, 0x9d, 0xc8, 0xc8, 0x38, 0x12, 0x22, 0x98, 0xc5,
0xb5, 0x60, 0x16, 0x01, 0x96, 0x94, 0xac, 0x3a, 0x1a, 0x61, 0x90, 0xa4,
0x9c, 0xa3, 0x1d, 0x7f, 0x8f, 0xca, 0x94, 0x8e, 0x1f, 0x46, 0x81, 0x4c,
0x7d, 0xeb, 0x23, 0xf4, 0x7e, 0x04, 0x75, 0x79, 0x27, 0x59, 0x7c, 0x13,
0x6d, 0x1c, 0x29, 0x2b, 0x79, 0x72, 0x63, 0x0b, 0x29, 0x62, 0x73, 0x7b,
0x51, 0x6f, 0x28, 0xff, 0x76, 0x79, 0x4d, 0x31, 0x25, 0x35, 0x6d, 0xa1,
0x2a, 0x66, 0x26, 0xec, 0x74, 0x5c, 0x26, 0xcc, 0x25, 0xf6, 0x77, 0x40,
0x22, 0xe2, 0x26, 0x41, 0x7c, 0xfa, 0x1f, 0xcf, 0x27, 0x09, 0x80, 0xe9,
0x1c, 0xc1, 0x26, 0xfa, 0x84, 0x87, 0x19, 0x6f, 0x0c, 0x33, 0x94, 0xcb,
0xc8, 0x74, 0x10, 0x4e, 0x8b, 0x2f, 0xb2, 0xb9, 0x11, 0x81, 0x88, 0x5b,
0xa5, 0x66, 0x15, 0x19, 0x84, 0xbd, 0x98, 0x3a, 0x1b, 0x8f, 0x7b, 0x05,
0x85, 0x38, 0x1d, 0x38, 0x73, 0x90, 0x75, 0x64, 0x22, 0x92, 0x73, 0x11,
0x6e, 0x0c, 0x27, 0x99, 0x6e, 0xd5, 0x63, 0x78, 0x29, 0x4b, 0x68, 0xff,
0x52, 0xc3, 0x29, 0x25, 0x6d, 0x11, 0x4e, 0xcd, 0x26, 0xf0, 0x66, 0xdb,
0x36, 0xb3, 0x25, 0x5c, 0x66, 0x0f, 0x25, 0xab, 0x27, 0x4e, 0x6a, 0x99,
0x22, 0xbe, 0x28, 0xca, 0x72, 0x46, 0x21, 0x75, 0x28, 0xb5, 0x76, 0x30,
0x1e, 0x4d, 0x29, 0x01, 0x7b, 0xe0, 0x1b, 0x97, 0x57, 0xc9, 0x8b, 0x8e,
0x15, 0x45, 0x09, 0x38, 0x89, 0x7a, 0xca, 0x5d, 0x0a, 0x15, 0x88, 0xbd,
0xc0, 0x75, 0x0f, 0xa7, 0x7c, 0x8b, 0xa1, 0xae, 0x14, 0x84, 0x74, 0xf7,
0x8e, 0x4d, 0x19, 0x90, 0x6f, 0x45, 0x81, 0x83, 0x1a, 0xaf, 0x67, 0xeb,
0x71, 0x1d, 0x20, 0xe4, 0x64, 0x05, 0x63, 0xdd, 0x27, 0x13, 0x61, 0xd9,
0x59, 0x7e, 0x28, 0x0f, 0x5e, 0xec, 0x4b, 0xb5, 0x28, 0xa6, 0x58, 0x98,
0x38, 0xf9, 0x28, 0x4e, 0x58, 0x00, 0x28, 0xab, 0x28, 0x65, 0x5d, 0x09,
0x23, 0xc8, 0x27, 0x8d, 0x62, 0xe7, 0x1c, 0xfd, 0x29, 0x4f, 0x68, 0x68,
0x1b, 0xf4, 0x45, 0x94, 0x72, 0x05, 0x19, 0xb9, 0x58, 0xcb, 0x7f, 0xca,
0x18, 0x4e, 0x69, 0x41, 0x8e, 0x5b, 0x19, 0xba, 0x07, 0x04, 0x7d, 0xae,
0xcb, 0xa1, 0x06, 0x55, 0x7d, 0xf8, 0xc2, 0xa2, 0x0d, 0xc4, 0x6e, 0xfb,
0x9e, 0x00, 0x12, 0x22, 0x69, 0xae, 0x8d, 0x76, 0x16, 0xa1, 0x60, 0xd8,
0x7a, 0xdd, 0x16, 0x7b, 0x59, 0xac, 0x6a, 0x90, 0x1f, 0x2f, 0x54, 0xb7,
0x5b, 0x33, 0x25, 0x15, 0x51, 0xac, 0x4f, 0x1a, 0x28, 0xc4, 0x4d, 0xe7,
0x3e, 0x80, 0x2b, 0x08, 0x49, 0xce, 0x2c, 0xe0, 0x2a, 0x85, 0x4e, 0xc6,
0x27, 0xcd, 0x2c, 0x55, 0x53, 0x00, 0x1d, 0x61, 0x39, 0xff, 0x5a, 0xe6,
0x17, 0x62, 0x49, 0xdc, 0x67, 0x5a, 0x17, 0xa1, 0x59, 0x3e, 0x72, 0x34,
0x18, 0xa8, 0x64, 0x29, 0x7c, 0x19, 0x19, 0x03, 0x70, 0x11, 0x87, 0xdf,
0x19, 0x0f, 0x02, 0x2c, 0x6c, 0x56, 0xce, 0x38, 0x01, 0x6a, 0x6a, 0x88,
0xc4, 0x64, 0x09, 0xeb, 0x5d, 0x3a, 0x9e, 0x92, 0x0a, 0xa3, 0x57, 0x7f,
0x88, 0x18, 0x0f, 0x2e, 0x51, 0x79, 0x74, 0x3f, 0x13, 0x34, 0x48, 0x2e,
0x60, 0x8c, 0x1e, 0x0c, 0x43, 0xe1, 0x53, 0xa3, 0x24, 0x7b, 0x40, 0x79,
0x44, 0x6e, 0x29, 0x88, 0x3d, 0x2c, 0x35, 0x06, 0x2c, 0xde, 0x3e, 0xee,
0x2b, 0x51, 0x34, 0x48, 0x45, 0x33, 0x23, 0x54, 0x3e, 0xca, 0x4d, 0xc2,
0x1c, 0xf9, 0x4b, 0xbd, 0x58, 0x78, 0x19, 0x0a, 0x56, 0x7f, 0x61, 0xdf,
0x16, 0xc7, 0x63, 0x74, 0x6e, 0x43, 0x18, 0xfc, 0x71, 0x61, 0x79, 0x48,
0x19, 0xd6, 0x7e, 0xe0, 0x84, 0xe5, 0x1a, 0x09, 0x0c, 0x5d, 0x5b, 0x46,
0xce, 0x93, 0x03, 0xd4, 0x59, 0xc8, 0xc5, 0x69, 0x04, 0x89, 0x4d, 0x3a,
0xa0, 0xe7, 0x06, 0xc3, 0x48, 0x98, 0x89, 0x80, 0x0c, 0x83, 0x40, 0xb8,
0x6f, 0x73, 0x16, 0x3e, 0x39, 0x2b, 0x5d, 0xfe, 0x1b, 0xee, 0x30, 0xe6,
0x4a, 0x6c, 0x23, 0x93, 0x2e, 0x1c, 0x3a, 0xdc, 0x28, 0xf6, 0x28, 0xf6,
0x28, 0xf6, 0x37, 0x64, 0x35, 0x31, 0x29, 0x14, 0x42, 0x82, 0x3e, 0xb7,
0x23, 0xd5, 0x4e, 0x2a, 0x49, 0x49, 0x1f, 0x55, 0x58, 0x96, 0x54, 0x28,
0x1c, 0x0f, 0x62, 0x73, 0x5d, 0xd3, 0x18, 0x86, 0x6e, 0xa8, 0x69, 0x78,
0x19, 0xd2, 0x7a, 0xcc, 0x75, 0xa7, 0x1b, 0x53, 0x87, 0x9e, 0x80, 0x01,
0x1c, 0x37, 0x2b, 0x67, 0x30, 0x11, 0xd1, 0x03, 0x1a, 0x21, 0x33, 0x49,
0xc8, 0x70, 0x04, 0x3e, 0x3d, 0x75, 0xa6, 0x64, 0x08, 0x4d, 0x36, 0xfa,
0x89, 0xb6, 0x16, 0xd4, 0x30, 0xd9, 0x73, 0x41, 0x20, 0xf9, 0x2c, 0x2b,
0x5e, 0x4c, 0x28, 0xc6, 0x27, 0xa3, 0x4c, 0xa4, 0x31, 0x23, 0x25, 0xe0,
0x3d, 0x9b, 0x38, 0x57, 0x24, 0x9c, 0x2e, 0x71, 0x44, 0x92, 0x2c, 0x59,
0x29, 0xb6, 0x4f, 0x6a, 0x35, 0xd1, 0x24, 0xdc, 0x5a, 0x9f, 0x3f, 0x36,
0x21, 0x6e, 0x64, 0xe1, 0x4b, 0x34, 0x1e, 0x2d, 0x6d, 0x8e, 0x56, 0x63,
0x1a, 0x2b, 0x79, 0x63, 0x62, 0x66, 0x1b, 0x4f, 0x8a, 0xa4, 0x72, 0x7e,
0x1e, 0x21, 0x91, 0xfd, 0x78, 0xb0, 0x1e, 0x9b, 0x2b, 0x7e, 0x30, 0x00,
0xd1, 0x09, 0x2b, 0x43, 0x2f, 0xf1, 0xd0, 0xe0, 0x17, 0x13, 0x29, 0xef,
0xb2, 0x35, 0x18, 0x75, 0x27, 0x84, 0x8f, 0xf3, 0x23, 0xee, 0x25, 0xfb,
0x77, 0x2e, 0x2d, 0x1c, 0x23, 0x06, 0x61, 0xd7, 0x36, 0xbf, 0x1d, 0xf9,
0x4f, 0x5c, 0x3e, 0x34, 0x1d, 0x46, 0x3f, 0xb9, 0x45, 0xf9, 0x1c, 0x00,
0x31, 0x52, 0x51, 0xb5, 0x26, 0x5e, 0x28, 0xaf, 0x5b, 0xa1, 0x2a, 0x1a,
0x25, 0x98, 0x64, 0xa2, 0x34, 0xde, 0x21, 0x94, 0x6f, 0xa8, 0x40, 0x24,
0x1e, 0xb0, 0x76, 0xea, 0x4a, 0x6a, 0x1b, 0x17, 0x85, 0xf6, 0x57, 0xfa,
0x1c, 0x77, 0x92, 0xfe, 0x65, 0x14, 0x1f, 0xd7, 0x96, 0xde, 0x70, 0x60,
0x1f, 0x5d, 0x2b, 0x95, 0x2f, 0xf1, 0xd1, 0x0f, 0x2b, 0x70, 0x2f, 0xd3,
0xd0, 0xec, 0x1f, 0x92, 0x24, 0xed, 0xbe, 0x3c, 0x22, 0xe0, 0x1e, 0xb2,
0x9b, 0x30, 0x34, 0x86, 0x1e, 0xa5, 0x7e, 0x4c, 0x42, 0x0b, 0x1f, 0x72,
0x6c, 0xf6, 0x4c, 0x54, 0x1f, 0x35, 0x5d, 0x09, 0x52, 0x9b, 0x1c, 0xcb,
0x4e, 0x21, 0x57, 0x95, 0x1a, 0x8d, 0x3c, 0x9b, 0x5e, 0x45, 0x1d, 0x19,
0x2d, 0xf9, 0x65, 0x55, 0x23, 0x0e, 0x24, 0xfb, 0x6f, 0xdd, 0x25, 0xad,
0x21, 0xa2, 0x77, 0x8c, 0x2f, 0x75, 0x1d, 0xf6, 0x86, 0x31, 0x43, 0x06,
0x1b, 0x84, 0x90, 0x18, 0x48, 0xab, 0x1d, 0x1d, 0x96, 0xe9, 0x54, 0xf8,
0x1e, 0xa3, 0xa0, 0x4b, 0x61, 0x89, 0x1f, 0xeb, 0x2b, 0xab, 0x2f, 0xe2,
0xd1, 0x16, 0x2b, 0x9d, 0x2f, 0xb4, 0xd0, 0xfa, 0x27, 0x15, 0x20, 0xa8,
0xc6, 0xa2, 0x42, 0xec, 0x1b, 0xe3, 0xa5, 0x15, 0x50, 0x81, 0x1e, 0xd8,
0x8b, 0xfd, 0x5b, 0x78, 0x20, 0x37, 0x7b, 0x94, 0x60, 0x5b, 0x1f, 0xc6,
0x69, 0x04, 0x66, 0x19, 0x1c, 0x22, 0x5a, 0x6b, 0x68, 0xc5, 0x18, 0x9e,
0x48, 0xed, 0x6e, 0xef, 0x1a, 0xe1, 0x39, 0x04, 0x73, 0xad, 0x1e, 0xfa,
0x28, 0xc4, 0x7b, 0xd4, 0x20, 0x7e, 0x22, 0xfe, 0x83, 0xfd, 0x21, 0xf7,
0x20, 0x01, 0x8b, 0x4a, 0x2a, 0xb6, 0x18, 0x91, 0x95, 0x53, 0x3f, 0xb4,
0x1a, 0x67, 0x9b, 0x44, 0x4c, 0x52, 0x1d, 0xf7, 0xa5, 0xe9, 0x55, 0x2a,
0x1e, 0x60, 0x2b, 0xc2, 0x2f, 0xd2, 0xd1, 0x1c, 0x2b, 0xca, 0x2f, 0x95,
0xd1, 0x06, 0x4d, 0x51, 0x14, 0x5d, 0xc6, 0xae, 0x5f, 0x75, 0x1b, 0x52,
0xaa, 0xd5, 0x6e, 0x81, 0x1e, 0x42, 0x9a, 0x52, 0x72, 0x67, 0x1f, 0xd4,
0x86, 0xfc, 0x75, 0x0c, 0x1e, 0x71, 0x78, 0xa7, 0x79, 0x2a, 0x1a, 0xd3,
0x67, 0xa0, 0x7c, 0x34, 0x18, 0xe8, 0x56, 0x5e, 0x80, 0x62, 0x19, 0x3e,
0x46, 0x03, 0x84, 0x6e, 0x1a, 0xe4, 0x37, 0x9f, 0x87, 0xee, 0x1e, 0x80,
0x25, 0xdd, 0x91, 0x74, 0x20, 0x80, 0x22, 0xfb, 0x97, 0xc4, 0x21, 0x10,
0x1f, 0xd4, 0xa1, 0x04, 0x22, 0xc4, 0x1e, 0x71, 0xa8, 0x99, 0x40, 0xe8,
0x1b, 0x1f, 0xac, 0x4f, 0x4a, 0xce, 0x1c, 0x74, 0x2c, 0x77, 0x2e, 0xe3,
0xd0, 0x78, 0x2c, 0x9a, 0x2e, 0x99, 0xd0, 0x69, 0x77, 0xca, 0x16, 0x54,
0xca, 0x59, 0x83, 0xd5, 0x17, 0x67, 0xc0, 0x4c, 0x85, 0xec, 0x1b, 0x71,
0xa7, 0x04, 0x88, 0xa3, 0x1c, 0xd5, 0x99, 0x0f, 0x8b, 0xe3, 0x1c, 0x1c,
0x88, 0x20, 0x90, 0x70, 0x1a, 0x9c, 0x76, 0xef, 0x92, 0x97, 0x1b, 0xd5,
0x63, 0xd8, 0x95, 0x62, 0x1b, 0x7c, 0x54, 0x65, 0x97, 0x95, 0x1b, 0x75,
0x44, 0xd0, 0x9b, 0xf8, 0x1c, 0xa9, 0x35, 0xfb, 0x9a, 0xc4, 0x1f, 0x40,
0x25, 0x2a, 0xa2, 0x7a, 0x1e, 0xc1, 0x21, 0x98, 0xae, 0x38, 0x1f, 0xdc,
0x1f, 0x5b, 0xc1, 0xb4, 0x24, 0xf1, 0x21, 0xe0, 0xc3, 0xb7, 0x27, 0x6a,
0x23, 0x1d, 0x2d, 0xc2, 0x36, 0xec, 0xca, 0x1f, 0x81, 0x40, 0x1c, 0xbf,
0xd2, 0x0a, 0x90, 0x23, 0x1b, 0x9a, 0xcc, 0xfa, 0x9a, 0xcf, 0x1a, 0x87,
0xc5, 0x30, 0x9a, 0x2c, 0x1c, 0x8c, 0xb4, 0x0b, 0x9f, 0xd9, 0x1d, 0x84,
0xab, 0x6f, 0xa1, 0xec, 0x1d, 0x08, 0x9a, 0x58, 0x9f, 0xc6, 0x1c, 0x03,
0x82, 0x9d, 0x9e, 0x80, 0x1c, 0x79, 0x6b, 0x94, 0xa0, 0xd8, 0x1d, 0x54,
0x5b, 0x92, 0xa2, 0xf6, 0x1c, 0x2f, 0x4a, 0xeb, 0xa2, 0xfd, 0x1b, 0x8e,
0x3b, 0x96, 0xa6, 0xed, 0x1b, 0x2d, 0x25, 0xd0, 0xbc, 0xc3, 0x1b, 0x27,
0x21, 0xc1, 0xc3, 0x25, 0x22, 0x1e, 0x23, 0xf9, 0xc4, 0xd6, 0x25, 0x35,
0x24, 0xb6, 0xc5, 0xe4, 0x27, 0x2a, 0x25, 0x2e, 0x88, 0x14, 0x1f, 0xb6,
0xd4, 0xe7, 0x97, 0x5f, 0x1f, 0xa7, 0xd1, 0xd6, 0x9f, 0x85, 0x1d, 0x54,
0xcd, 0xaf, 0xa2, 0xcd, 0x1b, 0x5a, 0xc8, 0xe9, 0xb2, 0xaf, 0x1c, 0xbe,
0xc6, 0x7a, 0xbd, 0x1e, 0x1d, 0x23, 0xc2, 0x40, 0xb2, 0x50, 0x1e, 0x12,
0xa5, 0xd8, 0xb5, 0x4d, 0x1d, 0x0d, 0x96, 0x09, 0xbe, 0xbc, 0x1c, 0x02,
0x81, 0xf2, 0xaf, 0xe4, 0x1d, 0x1b, 0x64, 0x53, 0xaf, 0x13, 0x1c, 0x3d,
0x53, 0x5d, 0xae, 0x2b, 0x1a, 0xbe, 0x41, 0x99, 0xb3, 0xf2, 0x14, 0xf1,
0x2f, 0x22, 0xc4, 0x8c, 0x1f, 0x68, 0x26, 0x2f, 0xc5, 0xf1, 0x23, 0x0e,
0x26, 0x63, 0xc6, 0xcd, 0x25, 0x63, 0x26, 0x86, 0xc7, 0x62, 0x26, 0xff,
0x26, 0xa0, 0x1b, 0xb9, 0xa4, 0x53, 0xac, 0x88, 0x1f, 0x4f, 0xa1, 0xee,
0xa5, 0x97, 0x20, 0x28, 0xa0, 0xa5, 0xa2, 0xd2, 0x22, 0x41, 0x9f, 0x2c,
0x9d, 0x3e, 0x25, 0x46, 0x9c, 0x37, 0x96, 0x17, 0x24, 0x24, 0x9d, 0x80,
0x90, 0x7b, 0x26, 0xd7, 0x9b, 0xcd, 0x8b, 0x9b, 0x26, 0x9d, 0x9a, 0x97,
0x89, 0x04, 0x28, 0x2e, 0x8f, 0x59, 0x75, 0x4f, 0x28, 0xdd, 0x8d, 0x45,
0x67, 0x5e, 0x28, 0xa5, 0x8c, 0xf0, 0x65, 0x0d, 0x28, 0x67, 0x8c, 0x9a,
0x62, 0xb2, 0x20, 0xea, 0x88, 0xde, 0x4b, 0x41, 0x20, 0xfa, 0x89, 0xd5,
0x28, 0x02, 0x21, 0x8a, 0x8a, 0x1f, 0x24, 0xef, 0x1f, 0x8d, 0x88, 0xfa,
0x1f, 0x37, 0x1e, 0x1f, 0x8f, 0xd5, 0x1a, 0xc4, 0x18, 0x89, 0xa3, 0x1a,
0xb9, 0xc7, 0x1a, 0x78, 0xa1, 0x57, 0xab, 0x73, 0x1f, 0xc5, 0x9e, 0xb8,
0xa2, 0x3d, 0x20, 0xd2, 0x9c, 0xf7, 0x9e, 0xb0, 0x23, 0xd0, 0x9b, 0x21,
0x96, 0xed, 0x25, 0x74, 0x98, 0x6c, 0x90, 0xeb, 0x24, 0x1a, 0x99, 0xdb,
0x8a, 0x9b, 0x27, 0x15, 0x96, 0xfc, 0x86, 0x2d, 0x29, 0x30, 0x8c, 0x23,
0x73, 0x4e, 0x27, 0xc5, 0x8c, 0x65, 0x64, 0xa0, 0x28, 0xc4, 0x8b, 0x46,
0x63, 0x26, 0x27, 0xef, 0x89, 0xa7, 0x5b, 0xa7, 0x20, 0xea, 0x86, 0x0f,
0x47, 0xf4, 0x21, 0xac, 0x85, 0x99, 0x25, 0xad, 0x22, 0x0d, 0x87, 0xf2,
0x22, 0x6a, 0x22, 0xbc, 0x88, 0x69, 0x1f, 0x9d, 0x23, 0x8b, 0x88, 0xeb,
0x1d, 0x70, 0x17, 0x8e, 0xa1, 0x1c, 0xb9, 0xcd, 0x16, 0xdf, 0x9f, 0x1b,
0xb5, 0xb7, 0x19, 0xbc, 0x9c, 0xb3, 0xa8, 0x54, 0x20, 0x69, 0x9a, 0x0d,
0x9d, 0x55, 0x21, 0xc3, 0x97, 0x78, 0x98, 0x7f, 0x24, 0xfb, 0x95, 0x4b,
0x8f, 0x2e, 0x23, 0x1b, 0x85, 0x10, 0x79, 0xf1, 0x27, 0xb6, 0x88, 0xed,
0x78, 0xe9, 0x28, 0xb5, 0x87, 0xdf, 0x6f, 0x9e, 0x28, 0x65, 0x87, 0x10,
0x63, 0x6c, 0x28, 0xfd, 0x87, 0xf4, 0x5f, 0x80, 0x22, 0x76, 0x7f, 0xd6,
0x48, 0x8d, 0x22, 0xeb, 0x7b, 0xe2, 0x27, 0xd1, 0x23, 0xa2, 0x7e, 0xcf,
0x24, 0x40, 0x23, 0xf2, 0x85, 0x3f, 0x20, 0x02, 0x24, 0x64, 0x86, 0x79,
0x1d, 0x4a, 0x25, 0x33, 0x87, 0x30, 0x1b, 0x2b, 0x10, 0x36, 0xa0, 0x60,
0xca, 0xad, 0x12, 0x39, 0x9b, 0x40, 0xb8, 0x08, 0x15, 0xdb, 0x98, 0xc3,
0xae, 0xf5, 0x1a, 0x00, 0x92, 0x9c, 0x9e, 0xe3, 0x1d, 0x7a, 0x92, 0x05,
0x96, 0xa3, 0x1f, 0x68, 0x86, 0x3f, 0x83, 0x7f, 0x25, 0xdd, 0x7e, 0xec,
0x78, 0x77, 0x27, 0x55, 0x7d, 0x6f, 0x6e, 0x13, 0x29, 0x25, 0x7b, 0x94,
0x64, 0xf4, 0x29, 0xc1, 0x77, 0xed, 0x56, 0xac, 0x28, 0x89, 0x77, 0xec,
0x4c, 0xb2, 0x24, 0x6f, 0x70, 0xc7, 0x2d, 0x33, 0x26, 0xe3, 0x75, 0xe5,
0x27, 0x00, 0x25, 0xa9, 0x7a, 0x82, 0x22, 0x24, 0x26, 0x66, 0x7d, 0x86,
0x1f, 0x48, 0x26, 0x7e, 0x84, 0x28, 0x1a, 0x93, 0x27, 0x3f, 0x85, 0x27,
0x18, 0x8d, 0x0c, 0xb6, 0x97, 0xe1, 0xcb, 0x17, 0x0f, 0xbc, 0x96, 0x3c,
0xc4, 0x46, 0x11, 0x40, 0x8a, 0x9f, 0xa8, 0xe5, 0x14, 0xdc, 0x87, 0x88,
0x9a, 0xdd, 0x1b, 0x03, 0x7d, 0xfe, 0x88, 0x08, 0x1e, 0x38, 0x78, 0x3e,
0x79, 0x82, 0x22, 0x2b, 0x74, 0x5f, 0x6f, 0x80, 0x27, 0x9c, 0x70, 0x55,
0x64, 0x7c, 0x28, 0xd3, 0x6c, 0x8d, 0x56, 0xb7, 0x29, 0x0e, 0x6d, 0xd6,
0x4e, 0xe7, 0x26, 0xb4, 0x67, 0xef, 0x36, 0x7a, 0x24, 0xe5, 0x67, 0x9d,
0x25, 0x76, 0x27, 0xa1, 0x6c, 0xfe, 0x22, 0xb2, 0x29, 0x18, 0x73, 0xf3,
0x20, 0xe6, 0x28, 0xf0, 0x79, 0x3b, 0x1c, 0xcf, 0x29, 0xc7, 0x7c, 0xbc,
0x1a, 0x8c, 0x58, 0x35, 0x8e, 0x8a, 0x15, 0x3d, 0x0a, 0xc0, 0x8d, 0x3d,
0xcd, 0x5f, 0x0a, 0xee, 0x8c, 0xa4, 0xc4, 0xc9, 0x0b, 0x10, 0x86, 0x6c,
0xaf, 0xe4, 0x12, 0x56, 0x7c, 0x6e, 0x98, 0xa4, 0x19, 0x79, 0x72, 0xce,
0x85, 0x55, 0x1a, 0x6d, 0x6b, 0xe4, 0x75, 0x53, 0x20, 0x2e, 0x67, 0x43,
0x67, 0x6d, 0x26, 0xe5, 0x63, 0x89, 0x5a, 0xa7, 0x27, 0xcf, 0x61, 0x3a,
0x4d, 0xc9, 0x28, 0x89, 0x5c, 0x36, 0x3b, 0xf6, 0x27, 0xe4, 0x59, 0xd2,
0x28, 0xb8, 0x28, 0x35, 0x5e, 0x1c, 0x22, 0x54, 0x28, 0xa7, 0x64, 0xa6,
0x1c, 0x39, 0x32, 0x44, 0x6c, 0xfd, 0x1a, 0x4a, 0x47, 0xbb, 0x75, 0x11,
0x19, 0x35, 0x5a, 0x4d, 0x80, 0xc1, 0x18, 0x3a, 0x6d, 0xcf, 0x93, 0x36,
0x1a, 0x83, 0x09, 0x8c, 0x81, 0xd7, 0xce, 0xa6, 0x07, 0x1c, 0x81, 0x8e,
0xc6, 0x20, 0x0d, 0x17, 0x77, 0x3a, 0xab, 0xb8, 0x0f, 0x78, 0x70, 0x11,
0x95, 0x09, 0x16, 0xa7, 0x65, 0x61, 0x80, 0x51, 0x17, 0x85, 0x5d, 0x42,
0x6e, 0x55, 0x1e, 0x65, 0x57, 0xdf, 0x5e, 0x98, 0x25, 0x1f, 0x54, 0x4e,
0x50, 0xf5, 0x27, 0x75, 0x50, 0x94, 0x40, 0xcd, 0x29, 0xaa, 0x4c, 0xce,
0x2f, 0x42, 0x2a, 0x79, 0x50, 0x2d, 0x25, 0xa2, 0x32, 0x20, 0x55, 0x59,
0x1b, 0xc2, 0x3f, 0x4d, 0x5e, 0xf8, 0x16, 0x79, 0x4b, 0x91, 0x69, 0xac,
0x17, 0xa5, 0x5b, 0x0b, 0x75, 0x30, 0x18, 0xdd, 0x67, 0x53, 0x80, 0x94,
0x18, 0xcc, 0x73, 0xee, 0x8b, 0xe0, 0x19, 0x98, 0x05, 0x1d, 0x6f, 0xf8,
0xd1, 0xc7, 0x01, 0x36, 0x6e, 0xee, 0xc8, 0x58, 0x07, 0x4c, 0x6b, 0xd1,
0xb2, 0xdc, 0x0b, 0x86, 0x5e, 0xaf, 0x91, 0x6b, 0x0e, 0xa8, 0x57, 0x07,
0x7a, 0x3d, 0x12, 0x76, 0x4a, 0xb4, 0x65, 0x21, 0x1c, 0x5e, 0x47, 0x3c,
0x55, 0xc4, 0x23, 0x69, 0x42, 0xda, 0x46, 0xd0, 0x29, 0x88, 0x40, 0xd3,
0x38, 0x0a, 0x2d, 0xaf, 0x3f, 0x8e, 0x28, 0x17, 0x36, 0xd8, 0x47, 0x77,
0x21, 0xd2, 0x41, 0xb9, 0x50, 0x85, 0x1c, 0x61, 0x4d, 0xac, 0x5a, 0xc9,
0x17, 0xf0, 0x5a, 0x6a, 0x66, 0x7f, 0x18, 0x62, 0x67, 0x36, 0x71, 0xe3,
0x19, 0x33, 0x74, 0x82, 0x7c, 0xd4, 0x19, 0xe7, 0x7f, 0x75, 0x86, 0x19,
0x19, 0xeb, 0x0e, 0x95, 0x60, 0x24, 0xd2, 0x11, 0x03, 0x6c, 0x5e, 0x9a,
0xca, 0x2f, 0x04, 0x57, 0x51, 0x3d, 0xa6, 0xa9, 0x06, 0x64, 0x4c, 0xa1,
0x8e, 0xc2, 0x09, 0x79, 0x45, 0x3c, 0x73, 0xf3, 0x1c, 0x68, 0x3f, 0xd8,
0x64, 0xae, 0x26, 0x0c, 0x3b, 0xa6, 0x54, 0xfd, 0x2e, 0x1b, 0x38, 0xf2,
0x45, 0xbc, 0x34, 0x77, 0x35, 0x6a, 0x35, 0x89, 0x3a, 0x77, 0x37, 0x42,
0x27, 0x86, 0x45, 0x1c, 0x41, 0x36, 0x22, 0xd5, 0x50, 0x35, 0x4b, 0xf3,
0x1e, 0x9b, 0x5a, 0xdf, 0x56, 0xd4, 0x1a, 0xf5, 0x65, 0xa3, 0x61, 0x20,
0x18, 0x8f, 0x72, 0x97, 0x6d, 0xb8, 0x1a, 0x3b, 0x7f, 0xc6, 0x7a, 0xb6,
0x1b, 0xa2, 0x89, 0xd3, 0x81, 0xd7, 0x1b, 0xae, 0x2b, 0x74, 0x30, 0x1b,
0xd1, 0x0e, 0x0d, 0xbf, 0x4a, 0x53, 0xcb, 0x10, 0x04, 0x85, 0x43, 0x6a,
0xaf, 0xd5, 0x02, 0x0a, 0x37, 0x6c, 0x8d, 0xcc, 0x15, 0x9c, 0x36, 0xf9,
0x75, 0xb8, 0x26, 0x71, 0x33, 0xb3, 0x65, 0xe6, 0x32, 0x85, 0x31, 0x14,
0x55, 0x98, 0x3a, 0xfe, 0x2f, 0x7f, 0x46, 0xcc, 0x41, 0xb7, 0x2e, 0x7e,
0x37, 0xd6, 0x47, 0x88, 0x2e, 0x95, 0x28, 0x36, 0x52, 0xa8, 0x39, 0x21,
0x23, 0xce, 0x5c, 0xf0, 0x43, 0x47, 0x20, 0x47, 0x66, 0xa8, 0x4e, 0x3f,
0x1d, 0x0a, 0x6f, 0xb2, 0x5a, 0x12, 0x1a, 0x48, 0x7c, 0xff, 0x65, 0x90,
0x1b, 0x97, 0x8b, 0xa3, 0x73, 0x7d, 0x1e, 0x2f, 0x94, 0xa1, 0x7b, 0xac,
0x1e, 0xa3, 0x2b, 0x8b, 0x30, 0x0b, 0xd1, 0x14, 0x2b, 0x5c, 0x30, 0x06,
0xd0, 0xf7, 0x10, 0xbb, 0x30, 0x13, 0xba, 0x2a, 0x12, 0x22, 0x29, 0xf8,
0x94, 0x08, 0x25, 0x7c, 0x29, 0x73, 0x7b, 0x1c, 0x35, 0x04, 0x28, 0xa7,
0x69, 0x12, 0x40, 0xe1, 0x27, 0xb2, 0x59, 0x65, 0x48, 0x50, 0x26, 0x2e,
0x4a, 0x7d, 0x4e, 0xfb, 0x25, 0x21, 0x3a, 0x31, 0x53, 0xb1, 0x24, 0x40,
0x29, 0x0a, 0x5d, 0x9d, 0x2c, 0x2d, 0x24, 0xbf, 0x67, 0x49, 0x36, 0xe5,
0x20, 0xa0, 0x70, 0xbc, 0x42, 0x59, 0x1e, 0x1b, 0x7a, 0x01, 0x4e, 0x4c,
0x1a, 0xf5, 0x89, 0x03, 0x5b, 0xbc, 0x1d, 0x33, 0x95, 0x76, 0x68, 0x7f,
0x1f, 0xb6, 0x9b, 0x9f, 0x74, 0x30, 0x1f, 0x2a, 0x2b, 0xa0, 0x2f, 0xfb,
0xd1, 0x1b, 0x2b, 0x89, 0x2f, 0xe7, 0xd1, 0x03, 0x1f, 0x90, 0x25, 0x61,
0xc1, 0xfe, 0x25, 0x83, 0x1c, 0xe8, 0x9a, 0x4b, 0x37, 0x8e, 0x1d, 0xa6,
0x81, 0x39, 0x46, 0xd3, 0x1e, 0xcb, 0x6b, 0x65, 0x4f, 0x5c, 0x1e, 0x9b,
0x5e, 0x26, 0x56, 0xe8, 0x1c, 0xe9, 0x4f, 0x35, 0x5a, 0xd6, 0x1a, 0x6c,
0x3d, 0xe9, 0x61, 0x38, 0x1c, 0x77, 0x2f, 0x95, 0x68, 0x16, 0x22, 0x39,
0x24, 0x7d, 0x71, 0x36, 0x27, 0x25, 0x20, 0xe8, 0x7a, 0x3d, 0x31, 0xdc,
0x1c, 0x97, 0x88, 0x7d, 0x44, 0x7c, 0x1b, 0xdf, 0x94, 0x9f, 0x50, 0xb0,
0x1e, 0x75, 0x97, 0xe6, 0x57, 0xe0, 0x1e, 0xaa, 0xa1, 0x6e, 0x64, 0xd8,
0x1f, 0xc4, 0x2b, 0xb7, 0x2f, 0xeb, 0xd1, 0x21, 0x2b, 0xb5, 0x2f, 0xc7,
0xd1, 0x10, 0x2c, 0x68, 0x1d, 0x58, 0xc7, 0x3d, 0x45, 0x42, 0x1b, 0x7c,
0xa8, 0xce, 0x53, 0xe4, 0x1e, 0x82, 0x90, 0x96, 0x60, 0x39, 0x21, 0xf4,
0x7a, 0x10, 0x66, 0x28, 0x1f, 0xdc, 0x6b, 0xde, 0x69, 0x9a, 0x1b, 0x43,
0x5c, 0x78, 0x6c, 0x43, 0x18, 0x54, 0x4a, 0x75, 0x72, 0x12, 0x1a, 0xa4,
0x3b, 0x3f, 0x76, 0x87, 0x1c, 0xf7, 0x2b, 0x5e, 0x7c, 0xcd, 0x20, 0x43,
0x23, 0x1d, 0x86, 0x39, 0x22, 0x43, 0x1f, 0x61, 0x8f, 0x50, 0x2e, 0x7a,
0x18, 0xe8, 0x96, 0xcf, 0x42, 0xc5, 0x1a, 0xa0, 0x9f, 0xe0, 0x50, 0xbe,
0x1d, 0xf2, 0xaa, 0x86, 0x55, 0x77, 0x1d, 0x8b, 0x2b, 0xce, 0x2f, 0xdc,
0xd1, 0x27, 0x2c, 0x83, 0x2e, 0xca, 0xd0, 0x74, 0x53, 0xba, 0x13, 0x51,
0xcc, 0xa7, 0x69, 0x93, 0x15, 0xf3, 0xb7, 0xe4, 0x71, 0xde, 0x1e, 0x1b,
0x9b, 0xf1, 0x77, 0x43, 0x20, 0xc4, 0x88, 0x18, 0x7b, 0xf7, 0x1f, 0x99,
0x78, 0x90, 0x7b, 0xec, 0x19, 0xa4, 0x68, 0x98, 0x80, 0x6c, 0x19, 0x1e,
0x57, 0xa8, 0x82, 0xb9, 0x19, 0xe1, 0x47, 0xfe, 0x88, 0x2b, 0x1a, 0xa7,
0x38, 0xd5, 0x8b, 0xc5, 0x1d, 0xa8, 0x27, 0x90, 0x95, 0x00, 0x20, 0x3a,
0x22, 0xb7, 0x9b, 0x49, 0x21, 0x18, 0x1f, 0x2f, 0xa5, 0x98, 0x25, 0xf5,
0x1e, 0x62, 0xaa, 0xf4, 0x42, 0xbc, 0x1b, 0x26, 0xad, 0x5f, 0x4e, 0x1f,
0x1c, 0x50, 0x2a, 0xf7, 0x33, 0x32, 0xd0, 0x1f, 0x6d, 0xeb, 0x1c, 0xc5,
0xd6, 0x41, 0x7d, 0x7d, 0x19, 0x9a, 0xce, 0x12, 0x89, 0x37, 0x17, 0xe6,
0xc3, 0x9a, 0x88, 0x21, 0x1b, 0x99, 0xaa, 0x4c, 0x8c, 0x55, 0x1d, 0x39,
0x9a, 0xd8, 0x93, 0x82, 0x1d, 0x37, 0x8e, 0x70, 0x92, 0xe1, 0x1a, 0xee,
0x77, 0x7e, 0x96, 0x4b, 0x1c, 0x8c, 0x65, 0xeb, 0x96, 0xba, 0x1b, 0x91,
0x54, 0xd7, 0x9a, 0xcc, 0x1b, 0x95, 0x45, 0x92, 0x9f, 0x65, 0x1b, 0xf0,
0x36, 0x1f, 0x9f, 0xe2, 0x1e, 0x3a, 0x25, 0x13, 0xa8, 0xf0, 0x1e, 0x21,
0x20, 0xf4, 0xbf, 0xcd, 0x22, 0x11, 0x20, 0xd7, 0xc2, 0xf7, 0x26, 0x1c,
0x22, 0xbe, 0xc4, 0xaf, 0x28, 0x52, 0x23, 0xc8, 0x7b, 0x3b, 0x1f, 0xd5,
0xd8, 0x7d, 0x85, 0xa3, 0x1e, 0xc6, 0xd4, 0x11, 0x95, 0x6d, 0x1d, 0xd3,
0xcf, 0x68, 0x9f, 0x3d, 0x1a, 0xdb, 0xc8, 0x3d, 0xaa, 0x73, 0x1c, 0x00,
0xc2, 0x87, 0xa2, 0xaf, 0x1d, 0xdb, 0xac, 0x3e, 0xa6, 0x4a, 0x1d, 0x50,
0x9b, 0x8c, 0xa8, 0xde, 0x1b, 0xf6, 0x88, 0x99, 0xa5, 0xbb, 0x1c, 0x9f,
0x6f, 0x84, 0xa5, 0x82, 0x1d, 0x54, 0x5e, 0x37, 0xa4, 0x9c, 0x1c, 0xb2,
0x4c, 0x71, 0xab, 0x1c, 0x1a, 0x80, 0x3f, 0x5c, 0xae, 0x01, 0x18, 0x7c,
0x27, 0xb3, 0xc1, 0xcd, 0x1e, 0x29, 0x23, 0xdf, 0xc4, 0x68, 0x23, 0x47,
0x24, 0xd8, 0xc5, 0xcf, 0x26, 0x1b, 0x25, 0x61, 0xc6, 0xae, 0x27, 0xe5,
0x25, 0xba, 0x8d, 0x04, 0x21, 0x40, 0xd6, 0x05, 0x99, 0x3d, 0x21, 0x05,
0xd3, 0x91, 0xa3, 0xd0, 0x1e, 0xd0, 0xcf, 0xe0, 0xa7, 0xa5, 0x1a, 0xd3,
0xcc, 0xaa, 0xb4, 0xb5, 0x1c, 0xd7, 0xc8, 0x7a, 0xc1, 0x8a, 0x1d, 0x7a,
0xc3, 0xef, 0xc3, 0x6d, 0x1e, 0x7d, 0xb2, 0xfb, 0xc3, 0x1d, 0x1d, 0xbc,
0x9d, 0xfc, 0xc1, 0xe2, 0x1c, 0x2f, 0x83, 0x92, 0xc0, 0x03, 0x1c, 0x2b,
0x70, 0x40, 0xb0, 0xc5, 0x1c, 0x57, 0x54, 0x10, 0xaf, 0xf4, 0x1a, 0xc4,
0x42, 0x53, 0xbd, 0x1f, 0x11, 0x99, 0x27, 0x36, 0xc5, 0xd3, 0x20, 0x8f,
0x27, 0x10, 0xc6, 0xeb, 0x23, 0xf4, 0x27, 0x0f, 0xc7, 0x98, 0x26, 0x1e,
0x27, 0x12, 0xc8, 0x0d, 0x27, 0x9d, 0x27, 0x16, 0x1c, 0x37, 0xa5, 0xe4,
0xae, 0x9d, 0x1f, 0x13, 0xa3, 0xb0, 0xa7, 0x8d, 0x1f, 0xdc, 0xa2, 0x6d,
0xa4, 0xbe, 0x21, 0xfe, 0xa0, 0xee, 0x9f, 0x09, 0x25, 0x21, 0x9d, 0xc6,
0x97, 0x9a, 0x24, 0x0d, 0x9e, 0xe5, 0x91, 0xd7, 0x26, 0xb3, 0x9d, 0x1a,
0x8c, 0xdc, 0x26, 0x76, 0x9b, 0xe4, 0x8a, 0x21, 0x28, 0x58, 0x91, 0xb6,
0x77, 0x12, 0x2a, 0xe6, 0x8a, 0xfd, 0x67, 0x60, 0x28, 0x8f, 0x8d, 0xaa,
0x65, 0xab, 0x22, 0xcf, 0x8d, 0x2f, 0x5f, 0xe1, 0x23, 0x2e, 0x9a, 0x63,
0x5c, 0x55, 0x20, 0xe3, 0x8b, 0x09, 0x28, 0x92, 0x1e, 0x9e, 0x8a, 0xa8,
0x22, 0x79, 0x1d, 0x4e, 0x90, 0xcb, 0x1d, 0xcc, 0x1d, 0xc0, 0x91, 0x3f,
0x1a, 0x4a, 0x19, 0x4a, 0xa4, 0xef, 0xbb, 0xd0, 0x1b, 0x1d, 0xa3, 0x59,
0xae, 0x01, 0x1f, 0x6a, 0xa0, 0x9b, 0xa4, 0x63, 0x20, 0x85, 0x9e, 0xda,
0xa0, 0xbb, 0x23, 0x9a, 0x9c, 0xe4, 0x98, 0xb4, 0x25, 0x50, 0x99, 0xf9,
0x92, 0x6d, 0x24, 0x05, 0x9b, 0x27, 0x8b, 0xe2, 0x26, 0xf6, 0x98, 0x23,
0x87, 0x34, 0x28, 0xc2, 0x8d, 0x8b, 0x74, 0x2a, 0x28, 0xfd, 0x8c, 0x4a,
0x66, 0xa8, 0x28, 0xb1, 0x8b, 0xd8, 0x63, 0x90, 0x27, 0xa5, 0x89, 0xfb,
0x5a, 0x79, 0x20, 0xab, 0x88, 0x32, 0x46, 0xdf, 0x21, 0x49, 0x88, 0xa1,
0x26, 0x30, 0x22, 0x09, 0x89, 0x19, 0x22, 0x8d, 0x20, 0xb7, 0x86, 0x9f,
0x1c, 0x74, 0x1f, 0x78, 0x8d, 0xdd, 0x17, 0x37, 0x18, 0x6b, 0xa3, 0x2e,
0xbc, 0x1e, 0x17, 0xd9, 0xa1, 0x7d, 0xb8, 0x67, 0x19, 0x4f, 0x9e, 0xd3,
0xab, 0x51, 0x20, 0x0a, 0x9b, 0xfe, 0x9f, 0x9a, 0x21, 0x80, 0x99, 0x59,
0x9a, 0x83, 0x24, 0xd8, 0x96, 0xe2, 0x90, 0xc9, 0x27, 0x78, 0x8e, 0xa3,
0x84, 0xe5, 0x27, 0xa1, 0x89, 0xd5, 0x7a, 0x18, 0x28, 0x97, 0x89, 0x4e,
0x71, 0x28, 0x28, 0x49, 0x88, 0xbc, 0x65, 0x09, 0x28, 0xdf, 0x89, 0x52,
0x60, 0x9f, 0x21, 0x1d, 0x81, 0xe4, 0x48, 0x18, 0x22, 0x2c, 0x7e, 0xd3,
0x28, 0x15, 0x23, 0x52, 0x81, 0x74, 0x24, 0x03, 0x23, 0x60, 0x86, 0x7f,
0x1f, 0x7f, 0x24, 0x66, 0x87, 0x5b, 0x1c, 0xb1, 0x25, 0x48, 0x88, 0x10,
0x1a, 0x6e, 0x10, 0x6d, 0xa2, 0x97, 0xcd, 0x67, 0x12, 0x50, 0x9d, 0xf4,
0xba, 0xf9, 0x15, 0xf9, 0x9b, 0x62, 0xb2, 0x28, 0x17, 0x69, 0x97, 0xec,
0xa6, 0x96, 0x1d, 0x22, 0x94, 0xfd, 0x99, 0xd7, 0x23, 0x36, 0x8f, 0x75,
0x8e, 0xae, 0x22, 0xee, 0x85, 0x47, 0x7b, 0x8e, 0x27, 0x6c, 0x81, 0xb2,
0x73, 0x9e, 0x29, 0x08, 0x7e, 0x37, 0x67, 0xe1, 0x29, 0xa9, 0x7a, 0xa0,
0x59, 0x67, 0x28, 0x2a, 0x79, 0x6d, 0x4c, 0x71, 0x24, 0x2f, 0x72, 0xa4,
0x2d, 0xa0, 0x24, 0xcd, 0x75, 0x8a, 0x25, 0xff, 0x25, 0x68, 0x7d, 0x0d,
0x21, 0x66, 0x26, 0x8d, 0x80, 0xf3, 0x1d, 0x9a, 0x26, 0xc3, 0x84, 0xe1,
0x19, 0x9d, 0x27, 0xbd, 0x86, 0x1e, 0x17, 0xf3, 0x0e, 0x2e, 0x9a, 0x10,
0xcd, 0xe2, 0x0f, 0xff, 0x99, 0xe2, 0xc7, 0x72, 0x12, 0x21, 0x94, 0x63,
0xb5, 0x47, 0x14, 0x12, 0x89, 0xe0, 0x9e, 0x33, 0x1c, 0x09, 0x84, 0xb8,
0x92, 0x0e, 0x1e, 0x2c, 0x7d, 0x67, 0x7f, 0x5d, 0x21, 0xdd, 0x77, 0xb5,
0x74, 0x02, 0x27, 0x0b, 0x75, 0x09, 0x69, 0xff, 0x28, 0xb3, 0x71, 0xb7,
0x5d, 0x16, 0x29, 0xc1, 0x6e, 0xdc, 0x4f, 0xdd, 0x26, 0x58, 0x6a, 0x6b,
0x38, 0xa4, 0x25, 0x31, 0x69, 0x87, 0x25, 0xff, 0x28, 0x04, 0x6f, 0x56,
0x22, 0x7b, 0x28, 0xca, 0x73, 0xd8, 0x1e, 0xec, 0x29, 0x62, 0x7b, 0x6e,
0x1b, 0x2e, 0x2d, 0xe8, 0x81, 0x9a, 0x1a, 0x96, 0x5a, 0xf9, 0x90, 0x3c,
0x15, 0x50, 0x0e, 0xc3, 0x90, 0x16, 0xce, 0xf4, 0x0b, 0x9e, 0x90, 0x4d,
0xc8, 0x22, 0x0a, 0xe0, 0x89, 0x6c, 0xb3, 0x65, 0x13, 0xeb, 0x7f, 0x03,
0x9c, 0x11, 0x19, 0x93, 0x76, 0xa1, 0x88, 0xf9, 0x1a, 0x50, 0x70, 0x4f,
0x7a, 0x58, 0x1f, 0x0f, 0x6a, 0x92, 0x6a, 0xe0, 0x26, 0x86, 0x65, 0x90,
0x5d, 0x09, 0x27, 0x96, 0x63, 0x62, 0x4f, 0xa4, 0x27, 0xbc, 0x5e, 0xaf,
0x3d, 0x7f, 0x28, 0x30, 0x5c, 0xb7, 0x2a, 0xfc, 0x27, 0xc9, 0x5f, 0x52,
0x1f, 0xbc, 0x2c, 0x27, 0x66, 0x7c, 0x1a, 0x61, 0x36, 0xc8, 0x6f, 0xae,
0x19, 0x1a, 0x4d, 0xbc, 0x7a, 0x2b, 0x18, 0x9a, 0x5d, 0xcb, 0x80, 0xc9,
0x16, 0xfe, 0x6e, 0xab, 0x94, 0x34, 0x1a, 0xa8, 0x0c, 0x7a, 0x86, 0x01,
0xd1, 0xa3, 0x08, 0xbd, 0x84, 0x37, 0xc9, 0xc9, 0x09, 0x5b, 0x7f, 0x6d,
0xb7, 0x89, 0x0e, 0xa2, 0x74, 0xb5, 0x9a, 0xa6, 0x14, 0x7b, 0x6a, 0x6d,
0x83, 0xf9, 0x17, 0xd8, 0x61, 0x1b, 0x72, 0x49, 0x1e, 0x55, 0x5b, 0x92,
0x62, 0xa8, 0x25, 0x2a, 0x58, 0x4e, 0x53, 0xec, 0x28, 0x25, 0x53, 0xa0,
0x44, 0x10, 0x29, 0x8f, 0x50, 0x8a, 0x32, 0x3c, 0x2b, 0x8d, 0x4f, 0xdb,
0x1f, 0xeb, 0x35, 0x11, 0x57, 0x7c, 0x1a, 0x0c, 0x41, 0xed, 0x61, 0xb9,
0x16, 0x8c, 0x4d, 0x0d, 0x6b, 0xdd, 0x17, 0xab, 0x5e, 0x1d, 0x78, 0x53,
0x18, 0xfc, 0x69, 0x69, 0x82, 0x56, 0x18, 0xdf, 0x79, 0x54, 0x91, 0xb5,
0x1a, 0x69, 0x08, 0x84, 0x73, 0x1a, 0xd5, 0x42, 0x01, 0x90, 0x73, 0xcf,
0xcd, 0x24, 0x07, 0x35, 0x6f, 0xed, 0xb7, 0x5d, 0x0a, 0x6a, 0x65, 0xce,
0x9b, 0x73, 0x0e, 0x4d, 0x5c, 0x0a, 0x80, 0x4b, 0x1b, 0xe3, 0x54, 0x29,
0x6e, 0x67, 0x26, 0x4f, 0x50, 0x76, 0x5f, 0xbd, 0x2c, 0xfa, 0x4d, 0x0f,
0x50, 0xc6, 0x32, 0x61, 0x4a, 0x0b, 0x41, 0x03, 0x35, 0xd9, 0x48, 0x89,
0x30, 0x32, 0x39, 0x6f, 0x49, 0x69, 0x1f, 0xa7, 0x44, 0xc5, 0x53, 0x74,
0x1b, 0x10, 0x50, 0x56, 0x5d, 0x8a, 0x16, 0xa8, 0x5d, 0xa5, 0x69, 0xf5,
0x18, 0x89, 0x6a, 0x40, 0x75, 0x4b, 0x19, 0x64, 0x76, 0x0f, 0x7f, 0x17,
0x19, 0xeb, 0x83, 0x0e, 0x8b, 0x2b, 0x1a, 0xbc, 0x10, 0xf2, 0x65, 0x16,
0xd5, 0xab, 0x08, 0x30, 0x65, 0x88, 0xce, 0x97, 0x01, 0xcd, 0x60, 0x06,
0xba, 0x83, 0x07, 0x00, 0x54, 0x38, 0x98, 0xc5, 0x17, 0x16, 0x4e, 0x30,
0x7f, 0x0a, 0x24, 0xc2, 0x49, 0xe9, 0x6d, 0xda, 0x30, 0x13, 0x45, 0x79,
0x5e, 0x15, 0x37, 0xb8, 0x42, 0x0b, 0x4e, 0xe7, 0x3e, 0x87, 0x3f, 0x88,
0x3f, 0xa5, 0x43, 0x3b, 0x41, 0x4f, 0x30, 0x22, 0x47, 0x98, 0x43, 0x78,
0x20, 0xd6, 0x52, 0x68, 0x4e, 0x9c, 0x1d, 0x89, 0x5d, 0x1a, 0x59, 0x99,
0x19, 0xc0, 0x68, 0xc2, 0x65, 0x44, 0x19, 0x4f, 0x75, 0xd0, 0x71, 0x1d,
0x1a, 0x72, 0x82, 0x02, 0x7c, 0x3f, 0x1b, 0xd0, 0x8c, 0x76, 0x85, 0x99,
0x1c, 0x18, 0x2b, 0x80, 0x30, 0x25, 0xd1, 0x1a, 0x11, 0x61, 0x51, 0xeb,
0xd0, 0x5d, 0x03, 0x60, 0x4c, 0x23, 0xbd, 0xb9, 0x0e, 0x42, 0x41, 0xfd,
0x97, 0xf2, 0x23, 0x05, 0x41, 0x2c, 0x80, 0x98, 0x32, 0x28, 0x3e, 0x19,
0x6e, 0x37, 0x3c, 0x88, 0x3a, 0xb1, 0x5e, 0x33, 0x44, 0xed, 0x38, 0xb1,
0x4f, 0x86, 0x4b, 0x1e, 0x37, 0xb6, 0x40, 0x26, 0x50, 0x6e, 0x38, 0x69,
0x30, 0xe4, 0x54, 0xdf, 0x3a, 0xc2, 0x22, 0x6b, 0x5e, 0xf8, 0x46, 0x26,
0x1f, 0x67, 0x68, 0x98, 0x51, 0x95, 0x1b, 0xf8, 0x73, 0x0d, 0x5d, 0x49,
0x1a, 0xa9, 0x80, 0xd8, 0x69, 0xe8, 0x1c, 0x89, 0x8e, 0x33, 0x76, 0x5d,
0x1e, 0x60, 0x96, 0xba, 0x7e, 0x81, 0x1e, 0x9b, 0x31, 0xb1, 0x2e, 0x91,
0xd0, 0x71, 0x2b, 0x75, 0x30, 0x19, 0xd1, 0x0e, 0x09, 0x40, 0x35, 0x83,
0xbe, 0xc1, 0x1d, 0x50, 0x34, 0xeb, 0xa0, 0xff, 0x31, 0xfc, 0x33, 0xc8,
0x82, 0xfb, 0x41, 0xa1, 0x32, 0xb0, 0x70, 0x87, 0x4c, 0xb2, 0x31, 0x36,
0x61, 0x96, 0x52, 0x59, 0x2f, 0xb2, 0x53, 0xd3, 0x57, 0x56, 0x2e, 0x62,
0x43, 0x38, 0x5c, 0x52, 0x2d, 0xb4, 0x32, 0x77, 0x60, 0xa1, 0x2f, 0x10,
0x23, 0x05, 0x69, 0x96, 0x39, 0x56, 0x1f, 0xde, 0x73, 0x9d, 0x45, 0xcb,
0x1c, 0x8e, 0x7e, 0x17, 0x52, 0x90, 0x1b, 0x7a, 0x8d, 0x08, 0x62, 0x4b,
0x1f, 0x51, 0x96, 0xcd, 0x6d, 0xc5, 0x20, 0x4e, 0x9e, 0x94, 0x74, 0xea,
0x1f, 0x1e, 0x2b, 0xae, 0x30, 0x04, 0xd1, 0x25, 0x2b, 0xa2, 0x2f, 0xfb,
0xd1, 0x1b, 0x21, 0x99, 0x25, 0x6d, 0xc4, 0x22, 0x33, 0x3c, 0x26, 0x14,
0xa8, 0xc3, 0x44, 0x65, 0x28, 0x1e, 0x8c, 0xb7, 0x50, 0xf3, 0x29, 0x07,
0x78, 0x2f, 0x59, 0x56, 0x28, 0x38, 0x67, 0xcb, 0x5f, 0x2d, 0x26, 0x01,
0x58, 0x27, 0x63, 0xd9, 0x23, 0xbb, 0x47, 0x92, 0x67, 0x5e, 0x21, 0x62,
0x35, 0x11, 0x6a, 0xa6, 0x20, 0x43, 0x23, 0xf9, 0x73, 0x4d, 0x29, 0x7b,
0x1f, 0x98, 0x7c, 0xec, 0x35, 0x1a, 0x1b, 0x78, 0x89, 0xa1, 0x45, 0xc3,
0x1c, 0x10, 0x95, 0xc2, 0x53, 0xe8, 0x1e, 0x97, 0x9d, 0xd3, 0x5f, 0x2c,
0x20, 0x56, 0xa8, 0xa2, 0x6c, 0x75, 0x1d, 0xa5, 0x2b, 0xc4, 0x2f, 0xf6,
0xd1, 0x2d, 0x2b, 0xce, 0x2f, 0xdc, 0xd1, 0x27, 0x39, 0x29, 0x16, 0x34,
0xcb, 0x7c, 0x49, 0x60, 0x1a, 0x18, 0xaf, 0xea, 0x5a, 0x12, 0x1d, 0xd5,
0x91, 0xfb, 0x62, 0xdf, 0x20, 0xbb, 0x7e, 0xcd, 0x69, 0x6b, 0x1f, 0xa7,
0x6d, 0xfc, 0x6c, 0x06, 0x1c, 0x84, 0x5d, 0x2d, 0x70, 0xb4, 0x1a, 0x3f,
0x4c, 0xf8, 0x75, 0x2d, 0x1a, 0x6c, 0x3c, 0xa4, 0x7a, 0xb6, 0x1d, 0x54,
0x2e, 0xa8, 0x7f, 0xd7, 0x20, 0x54, 0x23, 0x27, 0x88, 0x12, 0x24, 0x3a,
0x1e, 0x46, 0x92, 0x5e, 0x33, 0x50, 0x19, 0x75, 0x99, 0xf0, 0x44, 0xdd,
0x1a, 0xcf, 0xa6, 0x5b, 0x53, 0xd1, 0x1e, 0x2a, 0xac, 0x02, 0x59, 0x97,
0x1d, 0x9e, 0x2b, 0x83, 0x31, 0xa4, 0xcf, 0xe7, 0x2c, 0x9b, 0x2e, 0xdd,
0xd0, 0x8b, 0x63, 0x98, 0x19, 0x07, 0xd2, 0x77, 0x71, 0x09, 0x14, 0x64,
0xbe, 0x3a, 0x76, 0x7b, 0x1a, 0xea, 0xa1, 0xff, 0x7d, 0x62, 0x1c, 0xd2,
0x8f, 0x7c, 0x7f, 0x60, 0x1b, 0xbb, 0x7c, 0x74, 0x80, 0x70, 0x19, 0x0e,
0x6a, 0x95, 0x83, 0xed, 0x19, 0x45, 0x59, 0xdf, 0x86, 0xc0, 0x1a, 0x3b,
0x49, 0xc4, 0x8b, 0x9a, 0x1a, 0x68, 0x3a, 0x39, 0x8f, 0x2c, 0x1c, 0xe2,
0x29, 0x19, 0x97, 0xf0, 0x20, 0x0d, 0x22, 0x76, 0xa0, 0x71, 0x21, 0xa7,
0x1e, 0xdb, 0xaa, 0xd4, 0x2a, 0x89, 0x1e, 0x0e, 0xad, 0x5c, 0x47, 0x44,
0x1c, 0xb1, 0xae, 0xb8, 0x51, 0x99, 0x1c, 0x68, 0x2c, 0x90, 0x2e, 0xf6,
0xd0, 0x91, 0x75, 0xb2, 0x1f, 0x88, 0xd8, 0xf3, 0x82, 0x1c, 0x1c, 0xbd,
0xd1, 0xcc, 0x8f, 0x17, 0x18, 0x5b, 0xc7, 0xee, 0x92, 0x54, 0x1b, 0x3c,
0xb6, 0x12, 0x99, 0x12, 0x1e, 0x8f, 0xa5, 0xc5, 0x98, 0xec, 0x1e, 0x08,
0x92, 0x38, 0x98, 0xec, 0x1b, 0xf8, 0x7c, 0x19, 0x98, 0x4f, 0x1c, 0xed,
0x67, 0x0c, 0x9a, 0x19, 0x1c, 0x23, 0x56, 0x6c, 0x9d, 0x0e, 0x1b, 0xa8,
0x45, 0x94, 0xa0, 0xe5, 0x1b, 0x8f, 0x36, 0x7a, 0xa3, 0xc8, 0x1d, 0x5c,
0x25, 0x39, 0xae, 0x88, 0x1d, 0x39, 0x20, 0x2a, 0xc1, 0x98, 0x23, 0xb9,
0x22, 0x13, 0xc4, 0x3a, 0x27, 0x46, 0x23, 0x9d, 0xc5, 0xa7, 0x29, 0x38,
0x24, 0x73, 0x80, 0xbf, 0x21, 0xb0, 0xd9, 0xe7, 0x8b, 0x1f, 0x20, 0xd4,
0xd5, 0xd9, 0x98, 0x41, 0x1f, 0xe2, 0xd2, 0x08, 0xa2, 0x91, 0x1b, 0xb7,
0xcb, 0xe1, 0xae, 0xd8, 0x1c, 0x87, 0xc5, 0x44, 0xaf, 0x67, 0x1d, 0xe2,
0xb7, 0x5f, 0xaf, 0x2f, 0x1d, 0xd9, 0xa2, 0xdf, 0xaf, 0x54, 0x1c, 0x63,
0x8d, 0x49, 0xae, 0x64, 0x1c, 0x9f, 0x75, 0xa8, 0xae, 0x47, 0x1c, 0xe8,
0x61, 0x50, 0xad, 0xd0, 0x1b, 0xbf, 0x50, 0x09, 0xad, 0x38, 0x1a, 0x81,
0x40, 0x13, 0xb8, 0x98, 0x13, 0x68, 0x27, 0x6e, 0xc3, 0x9b, 0x1f, 0xcd,
0x25, 0x1f, 0xc5, 0xac, 0x24, 0x71, 0x25, 0xb8, 0xc6, 0xc7, 0x27, 0x01,
0x26, 0x0e, 0xc7, 0x78, 0x28, 0xa0, 0x26, 0x45, 0x91, 0x11, 0x23, 0x37,
0xd8, 0x2f, 0x9b, 0x1a, 0x22, 0x66, 0xd5, 0x48, 0xa6, 0x62, 0x20, 0x65,
0xd2, 0x22, 0xb5, 0x06, 0x1c, 0xce, 0xcf, 0x3b, 0xb7, 0xfb, 0x1d, 0x33,
0xcb, 0x39, 0xc6, 0x1f, 0x1d, 0xd9, 0xc5, 0xe1, 0xc5, 0x08, 0x1e, 0xa5,
0xb3, 0xdb, 0xc4, 0xd3, 0x1d, 0xd5, 0x9e, 0xd8, 0xc3, 0x8f, 0x1c, 0x46,
0x84, 0x2a, 0xc2, 0x39, 0x1c, 0x2a, 0x71, 0x19, 0xc1, 0xe5, 0x1a, 0x48,
0x5d, 0x63, 0xc2, 0x51, 0x18, 0xf9, 0x4d, 0x29, 0xc3, 0x2b, 0x14, 0xda,
0x30, 0x50, 0xc7, 0x18, 0x21, 0xb8, 0x27, 0xef, 0xc7, 0xe4, 0x24, 0xd8,
0x27, 0xba, 0xc8, 0x62, 0x26, 0xd9, 0x27, 0x9e, 0xc8, 0xb7, 0x28, 0x3b,
0x27, 0x8c, 0x1c, 0xb8, 0xa7, 0x78, 0xb0, 0xb4, 0x1f, 0x73, 0xa5, 0x93,
0xa9, 0x85, 0x1f, 0x85, 0xa4, 0x70, 0xa6, 0xeb, 0x21, 0xb0, 0xa2, 0xee,
0xa1, 0x14, 0x24, 0xf7, 0x9f, 0x91, 0x99, 0x59, 0x23, 0xf0, 0xa0, 0x84,
0x93, 0x6c, 0x26, 0x86, 0x9e, 0xa7, 0x8e, 0x59, 0x26, 0x76, 0x9d, 0xcc,
0x8b, 0xbb, 0x28, 0x7e, 0x94, 0x19, 0x78, 0xd8, 0x28, 0xc8, 0x94, 0xe4,
0x70, 0x8e, 0x28, 0x74, 0x8e, 0xa3, 0x66, 0x7e, 0x26, 0xa8, 0x9b, 0x16,
0x64, 0x05, 0x23, 0xa2, 0x9c, 0x6b, 0x5d, 0x7b, 0x1d, 0x9e, 0x8c, 0x9e,
0x27, 0x07, 0x1c, 0x62, 0x92, 0x06, 0x21, 0xd2, 0x1c, 0xd2, 0x92, 0x7a,
0x1d, 0x78, 0x1d, 0x4b, 0x97, 0xe1, 0x1a, 0x37, 0x1a, 0x0c, 0xa6, 0xc3,
0xbd, 0xd9, 0x1b, 0xc9, 0xa5, 0x5d, 0xb0, 0x8f, 0x1f, 0x03, 0xa2, 0xc4,
0xa6, 0xd8, 0x20, 0x2a, 0xa1, 0x0d, 0xa3, 0x16, 0x23, 0x4c, 0x9e, 0xfe,
0x9a, 0xd8, 0x25, 0x26, 0x9b, 0xd4, 0x94, 0x3d, 0x23, 0xec, 0x9c, 0xc0,
0x8d, 0x71, 0x26, 0xd0, 0x99, 0x96, 0x88, 0x7f, 0x28, 0x67, 0x8e, 0xb6,
0x75, 0x5c, 0x28, 0xf0, 0x8d, 0x2d, 0x67, 0xd4, 0x28, 0x97, 0x8c, 0xa6,
0x64, 0x21, 0x21, 0x22, 0x8c, 0xb7, 0x57, 0xd2, 0x20, 0x67, 0x8b, 0x77,
0x45, 0x00, 0x21, 0x33, 0x8a, 0x12, 0x26, 0xbb, 0x1f, 0xa7, 0x88, 0x56,
0x1f, 0xd5, 0x1e, 0x5a, 0x8f, 0x86, 0x1a, 0x0f, 0x1f, 0xb3, 0x90, 0x9f,
0x17, 0x4a, 0x19, 0x4a, 0xa5, 0x3f, 0xbe, 0x6f, 0x18, 0xd5, 0xa3, 0xe3,
0xbb, 0x15, 0x1a, 0x40, 0xa1, 0x9c, 0xae, 0xb2, 0x1f, 0x9a, 0x9e, 0x4f,
0xa2, 0x4b, 0x21, 0x2b, 0x9b, 0x9f, 0x9c, 0xf2, 0x24, 0xaa, 0x98, 0xdb,
0x92, 0xc6, 0x25, 0x06, 0x96, 0x1c, 0x8c, 0x65, 0x27, 0x7f, 0x8b, 0x23,
0x7b, 0xcb, 0x2a, 0x59, 0x87, 0xa6, 0x72, 0x49, 0x28, 0x37, 0x89, 0xde,
0x65, 0xc3, 0x28, 0xc8, 0x89, 0xb1, 0x60, 0x9b, 0x20, 0xe5, 0x83, 0xa1,
0x48, 0xa9, 0x21, 0xac, 0x80, 0x0a, 0x28, 0xc8, 0x22, 0x59, 0x86, 0x0d,
0x23, 0x27, 0x23, 0x3c, 0x87, 0x9e, 0x1f, 0x07, 0x24, 0x64, 0x88, 0x71,
0x1b, 0xf4, 0x21, 0xa9, 0x8a, 0xc8, 0x12, 0x3f, 0x11, 0x93, 0xa4, 0xf3,
0xd0, 0x2a, 0x12, 0xb8, 0xa0, 0xef, 0xbe, 0x2c, 0x16, 0x86, 0x9e, 0x74,
0xb5, 0xca, 0x16, 0xdd, 0x9a, 0xb1, 0xaa, 0x39, 0x1c, 0xe0, 0x97, 0x61,
0x9c, 0x83, 0x23, 0x0a, 0x91, 0xb6, 0x91, 0x17, 0x23, 0x47, 0x88, 0x25,
0x7e, 0x7f, 0x26, 0x2a, 0x80, 0x5f, 0x72, 0xe0, 0x28, 0xee, 0x81, 0x2e,
0x6b, 0x1e, 0x2a, 0x1e, 0x7f, 0x14, 0x5e, 0xcf, 0x27, 0xcd, 0x7b, 0x17,
0x4c, 0x7b, 0x21, 0x40, 0x75, 0xe3, 0x34, 0x25, 0x24, 0x3c, 0x78, 0xed,
0x25, 0xec, 0x25, 0x76, 0x7d, 0xeb, 0x20, 0xd9, 0x26, 0x05, 0x84, 0x70,
0x1b, 0x52, 0x27, 0x1a, 0x85, 0xc9, 0x18, 0x6b, 0x44, 0x49, 0x90, 0xe9,
0x11, 0x90, 0x13, 0x56, 0x9c, 0x22, 0xcf, 0xcb, 0x10, 0x41, 0x9d, 0xd0,
0xca, 0xfd, 0x12, 0x57, 0x97, 0xca, 0xb9, 0x2f, 0x12, 0x3d, 0x94, 0x72,
0xad, 0x0f, 0x1b, 0xb7, 0x89, 0x96, 0x97, 0x93, 0x1d, 0xad, 0x82, 0x64,
0x85, 0x4d, 0x21, 0x62, 0x7b, 0x2f, 0x75, 0x3c, 0x26, 0xc1, 0x77, 0x80,
0x6c, 0xd7, 0x28, 0xac, 0x74, 0x35, 0x5f, 0x90, 0x29, 0xae, 0x70, 0x8a,
0x50, 0x87, 0x26, 0x0a, 0x6c, 0xd4, 0x3a, 0xf5, 0x24, 0xc7, 0x6b, 0x5f,
0x26, 0xbf, 0x28, 0x83, 0x71, 0x96, 0x21, 0xf2, 0x29, 0x60, 0x76, 0xc0,
0x1d, 0x04, 0x2d, 0xe2, 0x7c, 0xbe, 0x1c, 0x0d, 0x51, 0xce, 0x8c, 0xad,
0x14, 0xbd, 0x5d, 0xd1, 0x92, 0x16, 0x15, 0x67, 0x11, 0x0b, 0x92, 0xc6,
0xd1, 0xd6, 0x0c, 0xa5, 0x94, 0x42, 0xcb, 0xec, 0x0a, 0xff, 0x8d, 0x75,
0xb8, 0x89, 0x11, 0x40, 0x87, 0x2a, 0xa7, 0x4e, 0x15, 0x7c, 0x7e, 0xc3,
0x93, 0x01, 0x1c, 0x40, 0x74, 0x81, 0x7d, 0x8a, 0x1e, 0x42, 0x6d, 0xa9,
0x6e, 0x35, 0x26, 0x09, 0x6a, 0x75, 0x62, 0xba, 0x28, 0xe0, 0x66, 0x9a,
0x53, 0x22, 0x27, 0xe8, 0x62, 0x01, 0x40, 0x98, 0x25, 0x74, 0x5e, 0x50,
0x2b, 0x1d, 0x27, 0xa7, 0x5d, 0xf9, 0x17, 0xf9, 0x32, 0xad, 0x68, 0xe2,
0x19, 0xca, 0x43, 0xfb, 0x72, 0xa5, 0x19, 0xcf, 0x53, 0xd1, 0x7f, 0x51,
0x18, 0x52, 0x67, 0x2d, 0x89, 0x5d, 0x17, 0x05, 0x6f, 0xa8, 0x95, 0x56,
0x1a, 0xd1, 0x0f, 0x48, 0x89, 0x8b, 0xd4, 0xa8, 0x0b, 0x54, 0x88, 0xc9,
0xce, 0x2e, 0x08, 0x2c, 0x86, 0xc9, 0xc2, 0xb2, 0x0f, 0x0d, 0x7a, 0x15,
0xa2, 0xab, 0x14, 0x85, 0x70, 0xaf, 0x8a, 0xc6, 0x1c, 0xd2, 0x68, 0x5d,
0x7a, 0x90, 0x26, 0x1a, 0x63, 0xb0, 0x6b, 0x7f, 0x2c, 0xde, 0x5f, 0xfa,
0x5d, 0x3d, 0x30, 0x74, 0x5c, 0x55, 0x4d, 0xc3, 0x31, 0xe5, 0x59, 0x22,
0x3b, 0x2c, 0x33, 0xcc, 0x58, 0x7f, 0x29, 0x23, 0x36, 0x69, 0x58, 0x9b,
0x16, 0xfa, 0x45, 0xf1, 0x64, 0x00, 0x17, 0x3c, 0x54, 0x1c, 0x70, 0x35,
0x18, 0xb0, 0x61, 0x5e, 0x7b, 0x71, 0x18, 0xdf, 0x6d, 0xe2, 0x87, 0xc4,
0x18, 0xe4, 0x7c, 0xb9, 0x95, 0x7e, 0x1a, 0xcf, 0x0b, 0xcd, 0x77, 0xc0,
0xd8, 0xca, 0x06, 0x30, 0x79, 0x43, 0xd2, 0x15, 0x06, 0x14, 0x79, 0x0e,
0xc2, 0xb4, 0x0a, 0x21, 0x6b, 0x8c, 0xa3, 0x48, 0x14, 0x96, 0x64, 0x37,
0x8b, 0x59, 0x24, 0x77, 0x5d, 0xd3, 0x78, 0x90, 0x2e, 0x67, 0x59, 0x19,
0x69, 0x0d, 0x35, 0xbe, 0x55, 0x3a, 0x59, 0x5d, 0x3a, 0x55, 0x52, 0x4b,
0x49, 0xc7, 0x3e, 0x70, 0x51, 0x63, 0x38, 0xec, 0x42, 0x46, 0x53, 0x26,
0x29, 0x3f, 0x46, 0x50, 0x56, 0x04, 0x19, 0x2d, 0x53, 0x22, 0x60, 0x8e,
0x16, 0x3f, 0x60, 0x4d, 0x6c, 0xf4, 0x18, 0xc6, 0x6d, 0xd8, 0x79, 0x24,
0x19, 0xa7, 0x7b, 0xb8, 0x84, 0x6e, 0x19, 0xf7, 0x88, 0x07, 0x91, 0xe2,
0x1c, 0x31, 0x13, 0xe9, 0x68, 0xd5, 0xd8, 0xf8, 0x0c, 0x79, 0x6a, 0xef,
0xd3, 0xce, 0x01, 0x63, 0x66, 0xfd, 0xc4, 0x40, 0x10, 0x2d, 0x5d, 0xaf,
0xa3, 0x4b, 0x21, 0xf0, 0x57, 0x94, 0x89, 0x2e, 0x2f, 0x77, 0x53, 0x44,
0x77, 0x56, 0x39, 0x3d, 0x4e, 0x86, 0x67, 0x25, 0x41, 0x3f, 0x4b, 0x35,
0x58, 0x31, 0x47, 0xd8, 0x48, 0xd3, 0x48, 0xf7, 0x4c, 0x5c, 0x4b, 0x31,
0x39, 0x4f, 0x50, 0x68, 0x4d, 0x3b, 0x2a, 0x9d, 0x54, 0xe9, 0x51, 0x5a,
0x1c, 0x51, 0x5f, 0x50, 0x5c, 0x99, 0x19, 0x3a, 0x6c, 0x1d, 0x68, 0xb8,
0x19, 0x92, 0x78, 0x42, 0x74, 0xb9, 0x1b, 0x15, 0x85, 0x8b, 0x80, 0x40,
0x1b, 0xf4, 0x8f, 0x4d, 0x89, 0x9d, 0x1c, 0xf3, 0x2b, 0x8d, 0x30, 0x2f,
0xd1, 0x25, 0x15, 0x78, 0x57, 0xdb, 0xd5, 0x37, 0x03, 0x10, 0x52, 0xe2,
0xc7, 0xc7, 0x1a, 0x6e, 0x4e, 0xf2, 0xa7, 0x4e, 0x2e, 0x49, 0x4b, 0x56,
0x8c, 0x81, 0x3d, 0x4c, 0x47, 0x7b, 0x77, 0x8e, 0x47, 0x3e, 0x44, 0x73,
0x67, 0x5a, 0x4f, 0x09, 0x42, 0xa7, 0x58, 0xe4, 0x54, 0xa6, 0x41, 0xa4,
0x49, 0x99, 0x59, 0x71, 0x42, 0x22, 0x39, 0xd7, 0x5d, 0x4a, 0x44, 0x8b,
0x2c, 0x22, 0x61, 0xf7, 0x49, 0xb0, 0x1e, 0xed, 0x6b, 0x11, 0x54, 0xaa,
0x1a, 0xfb, 0x77, 0x8f, 0x61, 0x94, 0x1b, 0x8f, 0x86, 0x2f, 0x6f, 0xce,
0x1d, 0xaf, 0x90, 0xcf, 0x79, 0x50, 0x1e, 0x67, 0x97, 0xe3, 0x80, 0x1d,
0x1d, 0x94, 0x2b, 0xa2, 0x30, 0x1f, 0xd1, 0x2b, 0x2b, 0x8d, 0x30, 0x2e,
0xd1, 0x25, 0x15, 0x1b, 0x3f, 0x32, 0xca, 0xc0, 0x2a, 0x17, 0x3f, 0xb0,
0xad, 0x0c, 0x3e, 0xa8, 0x3e, 0x1d, 0x8b, 0x31, 0x4d, 0x88, 0x3c, 0x60,
0x79, 0x0b, 0x57, 0x2c, 0x3a, 0xb2, 0x6a, 0x2f, 0x5c, 0x17, 0x39, 0x6f,
0x5c, 0x8c, 0x61, 0x28, 0x37, 0x4f, 0x4c, 0x49, 0x65, 0x1c, 0x37, 0x35,
0x3b, 0x96, 0x68, 0xc4, 0x38, 0x94, 0x2c, 0xaa, 0x6c, 0xa0, 0x3c, 0x2e,
0x1f, 0x63, 0x75, 0x37, 0x48, 0xe1, 0x1b, 0xb6, 0x83, 0x1c, 0x57, 0x10,
0x1c, 0x27, 0x90, 0x6d, 0x65, 0x59, 0x1f, 0xbf, 0x97, 0xd7, 0x70, 0x33,
0x1f, 0x5d, 0xa2, 0x37, 0x77, 0x5c, 0x1e, 0xd8, 0x2b, 0xb9, 0x30, 0x0f,
0xd1, 0x32, 0x2b, 0xb9, 0x30, 0x0f, 0xd1, 0x32, 0x2f, 0x4e, 0x2f, 0x4e,
0xc9, 0xae, 0x3f, 0x3a, 0x2f, 0x72, 0xb3, 0x8f, 0x53, 0x0c, 0x32, 0xa0,
0x92, 0x2e, 0x5e, 0x1d, 0x32, 0xfb, 0x7e, 0xb1, 0x64, 0x0e, 0x31, 0x8f,
0x6f, 0xc3, 0x68, 0xcb, 0x2f, 0x9c, 0x60, 0xc5, 0x6c, 0xeb, 0x2d, 0x1f,
0x4f, 0xb5, 0x70, 0x51, 0x2b, 0x74, 0x3e, 0x2b, 0x73, 0x6a, 0x2a, 0x44,
0x2d, 0x07, 0x76, 0xc0, 0x2c, 0xc5, 0x1e, 0x6b, 0x7e, 0xa3, 0x38, 0xee,
0x1b, 0x3a, 0x8c, 0x80, 0x47, 0xb8, 0x1c, 0x9e, 0x97, 0x2e, 0x55, 0x12,
0x1e, 0x99, 0xa1, 0x2b, 0x62, 0x3a, 0x1f, 0xd5, 0xab, 0xe0, 0x6f, 0xca,
0x1d, 0x4c, 0x2b, 0xd0, 0x30, 0x00, 0xd1, 0x38, 0x2c, 0x85, 0x2f, 0x0f,
0xd0, 0x96, 0x45, 0x7a, 0x1e, 0x75, 0xd9, 0x88, 0x58, 0x83, 0x22, 0x81,
0xbc, 0xaf, 0x65, 0xf9, 0x27, 0x09, 0x9e, 0xdc, 0x6e, 0xab, 0x29, 0x44,
0x88, 0x4d, 0x72, 0xac, 0x27, 0xa9, 0x77, 0xc0, 0x76, 0x9a, 0x25, 0x5c,
0x67, 0x02, 0x79, 0xcf, 0x23, 0x34, 0x54, 0xfe, 0x7b, 0x89, 0x1f, 0x86,
0x42, 0xac, 0x7d, 0x01, 0x1b, 0xc4, 0x2f, 0xde, 0x82, 0xea, 0x20, 0x62,
0x23, 0x40, 0x89, 0x8d, 0x26, 0x71, 0x1b, 0x4b, 0x94, 0x80, 0x36, 0x8d,
0x19, 0xae, 0x9f, 0x34, 0x48, 0xd5, 0x1d, 0x1d, 0xaa, 0xea, 0x54, 0x32,
0x1d, 0x54, 0xad, 0x3e, 0x5d, 0xaa, 0x1d, 0xb6, 0x2c, 0x85, 0x2f, 0x10,
0xd0, 0x96, 0x2c, 0xb2, 0x2e, 0xf2, 0xd0, 0xa4, 0x6c, 0x87, 0x1d, 0xfd,
0xd8, 0x57, 0x73, 0xdb, 0x17, 0x07, 0xc4, 0xf3, 0x7f, 0x58, 0x1d, 0x3f,
0xa4, 0xb8, 0x85, 0x0d, 0x21, 0x0b, 0x8d, 0xd0, 0x82, 0xd6, 0x1d, 0x4c,
0x80, 0x5e, 0x85, 0xa6, 0x1a, 0xc8, 0x6f, 0x86, 0x88, 0x20, 0x19, 0xa3,
0x5c, 0x05, 0x8a, 0xf0, 0x1a, 0x83, 0x4b, 0xcf, 0x8d, 0xf4, 0x1c, 0x3c,
0x3d, 0x4a, 0x93, 0x42, 0x1d, 0xb1, 0x2c, 0x27, 0x99, 0xc9, 0x20, 0x3d,
0x22, 0x9a, 0xa4, 0xf2, 0x23, 0x12, 0x1e, 0xe7, 0xb0, 0x2c, 0x30, 0x84,
0x1c, 0x22, 0xb0, 0x4d, 0x46, 0xc0, 0x1c, 0x88, 0xb0, 0x36, 0x53, 0x1e,
0x1c, 0x49, 0x2c, 0x9b, 0x2f, 0x01, 0xd0, 0x9c, 0x7b, 0xed, 0x21, 0xb8,
0xdb, 0x3a, 0x88, 0xd0, 0x1f, 0xfe, 0xd5, 0x26, 0x95, 0x2a, 0x1c, 0x64,
0xcd, 0x3f, 0x9d, 0xaa, 0x1a, 0x5b, 0xbf, 0x69, 0x9d, 0xd4, 0x1d, 0x45,
0xaa, 0x8b, 0x9b, 0xf6, 0x1e, 0x7c, 0x94, 0x28, 0x9d, 0x36, 0x1b, 0x6f,
0x7e, 0x6e, 0x9c, 0x0f, 0x1d, 0x8b, 0x69, 0x21, 0x9e, 0xf1, 0x1d, 0x11,
0x58, 0x87, 0xa1, 0xdb, 0x1b, 0xca, 0x47, 0xa1, 0xa3, 0x1a, 0x1a, 0xff,
0x36, 0xff, 0xa9, 0x94, 0x1a, 0xe2, 0x24, 0x90, 0xbb, 0xec, 0x1e, 0x34,
0x20, 0xb1, 0xc3, 0x61, 0x25, 0x5f, 0x23, 0x4f, 0xc5, 0x7a, 0x28, 0x72,
0x24, 0x7b, 0xc6, 0x9f, 0x2a, 0x1e, 0x25, 0x1d, 0x86, 0x29, 0x23, 0x7e,
0xdb, 0x3b, 0x90, 0x79, 0x22, 0xd8, 0xd7, 0x95, 0x9b, 0x12, 0x21, 0xf6,
0xd4, 0xa3, 0xa6, 0x13, 0x1e, 0x75, 0xcf, 0xa5, 0xb3, 0xc8, 0x1c, 0x99,
0xc9, 0xf2, 0xba, 0x0f, 0x1c, 0xe6, 0xc1, 0xc5, 0xb3, 0x34, 0x1e, 0x0c,
0xa5, 0xf0, 0xb6, 0x58, 0x1c, 0xde, 0x92, 0xe6, 0xb4, 0x66, 0x1c, 0xe8,
0x79, 0x42, 0xb1, 0x1c, 0x1d, 0x20, 0x63, 0x2f, 0xb0, 0x4e, 0x1b, 0xeb,
0x51, 0x23, 0xaf, 0xde, 0x1a, 0x83, 0x40, 0xff, 0xbb, 0xf2, 0x12, 0x2d,
0x26, 0xdd, 0xc5, 0x67, 0x21, 0x71, 0x26, 0x5c, 0xc6, 0xee, 0x25, 0x9a,
0x26, 0x95, 0xc7, 0xbf, 0x27, 0xe7, 0x26, 0xb9, 0xc8, 0x41, 0x29, 0x5c,
0x26, 0xd0, 0x94, 0x35, 0x24, 0x87, 0xd9, 0xb8, 0x9c, 0xf5, 0x23, 0xca,
0xd6, 0xfe, 0xa8, 0x7a, 0x22, 0x13, 0xd4, 0x51, 0xba, 0x17, 0x1d, 0x65,
0xd2, 0xcf, 0xbd, 0x13, 0x1d, 0x87, 0xce, 0x1c, 0xc5, 0xce, 0x1f, 0x81,
0xc4, 0x8c, 0xc7, 0x07, 0x1e, 0xd9, 0xb5, 0x11, 0xc6, 0xf8, 0x1d, 0xf6,
0xa0, 0x07, 0xc5, 0xa4, 0x1c, 0x61, 0x85, 0x03, 0xc4, 0x50, 0x1c, 0x27,
0x71, 0xd7, 0xc4, 0x13, 0x1a, 0x34, 0x5e, 0x30, 0xc5, 0x1b, 0x1b, 0x08,
0x4e, 0xca, 0xc5, 0xde, 0x17, 0x28, 0x32, 0x6c, 0xc8, 0x5b, 0x22, 0xe0,
0x28, 0xd0, 0xc8, 0xdd, 0x25, 0xbe, 0x28, 0x67, 0xc9, 0x97, 0x2a, 0x17,
0x29, 0x3f, 0xc9, 0xd4, 0x29, 0xb0, 0x28, 0x00, 0x1d, 0x3d, 0xa9, 0x0d,
0xb2, 0xce, 0x1f, 0xd3, 0xa7, 0x79, 0xab, 0x7d, 0x1f, 0xe7, 0xa6, 0x9a,
0xa9, 0x29, 0x21, 0x53, 0xa5, 0x3b, 0xa3, 0x6e, 0x24, 0xc3, 0xa1, 0xa9,
0x9b, 0x60, 0x23, 0xce, 0xa2, 0x71, 0x95, 0x49, 0x26, 0x82, 0xa0, 0xbd,
0x90, 0x38, 0x26, 0xb6, 0xa0, 0x4d, 0x8d, 0xc8, 0x28, 0xa0, 0x96, 0x83,
0x7a, 0xa1, 0x29, 0x58, 0x9a, 0xae, 0x75, 0x11, 0x2a, 0xff, 0x91, 0x39,
0x6a, 0x56, 0x24, 0xa9, 0x9f, 0x00, 0x62, 0x40, 0x24, 0x12, 0x9e, 0x77,
0x5e, 0xa3, 0x1b, 0x73, 0x93, 0xb2, 0x27, 0x57, 0x1b, 0xbb, 0x94, 0x13,
0x21, 0xc8, 0x1c, 0xb2, 0x9c, 0x41, 0x1d, 0x7a, 0x20, 0x23, 0xa0, 0xd7,
0x1d, 0x0f, 0x1a, 0xcf, 0xa8, 0x99, 0xbf, 0xe0, 0x1c, 0x77, 0xa7, 0x65,
0xb3, 0x21, 0x1f, 0x53, 0xa5, 0x3b, 0xa9, 0x75, 0x1f, 0xbe, 0xa3, 0x9f,
0xa5, 0xdb, 0x22, 0xea, 0xa1, 0x7f, 0x9d, 0x66, 0x24, 0xf1, 0x9e, 0x18,
0x96, 0x6f, 0x23, 0xca, 0x9e, 0xbf, 0x8f, 0x63, 0x26, 0x9c, 0x9b, 0x79,
0x8a, 0x2b, 0x28, 0x4e, 0x91, 0x7e, 0x77, 0xa4, 0x28, 0x83, 0x91, 0xeb,
0x6f, 0x5a, 0x28, 0x6f, 0x8d, 0xd8, 0x64, 0xfc, 0x22, 0xa5, 0x95, 0xb7,
0x5c, 0x19, 0x20, 0x04, 0x90, 0x2b, 0x44, 0x9b, 0x1e, 0x6c, 0x8a, 0x75,
0x25, 0x06, 0x1d, 0x31, 0x90, 0xe1, 0x1e, 0x62, 0x1e, 0x51, 0x91, 0xc0,
0x19, 0xe5, 0x20, 0x84, 0x99, 0x75, 0x18, 0xbe, 0x1a, 0x2c, 0xa7, 0x50,
0xc0, 0xbf, 0x19, 0xd3, 0xa6, 0x49, 0xbd, 0xc0, 0x19, 0xe4, 0xa4, 0xfc,
0xb4, 0xc9, 0x1c, 0x26, 0xa2, 0x7c, 0xa7, 0x68, 0x20, 0xbe, 0x9e, 0x6d,
0x9f, 0xf0, 0x24, 0x68, 0x9b, 0x5f, 0x95, 0x4d, 0x24, 0xe7, 0x98, 0x21,
0x8e, 0x62, 0x27, 0x87, 0x92, 0xea, 0x82, 0xa4, 0x29, 0xf8, 0x89, 0x5d,
0x73, 0x6c, 0x28, 0x1e, 0x8b, 0x8a, 0x67, 0xac, 0x28, 0x94, 0x8a, 0x2d,
0x60, 0x15, 0x20, 0xec, 0x85, 0xac, 0x49, 0x95, 0x20, 0xe2, 0x83, 0x34,
0x29, 0xf1, 0x21, 0xd6, 0x88, 0x4d, 0x23, 0x67, 0x23, 0x0c, 0x89, 0x0f,
0x1e, 0x6c, 0x20, 0x91, 0x8c, 0x52, 0x14, 0x9e, 0x22, 0xa5, 0x8f, 0xc6,
0x13, 0x5a, 0x13, 0x25, 0xa7, 0x50, 0xd2, 0xe0, 0x14, 0x48, 0xa4, 0x11,
0xc1, 0x45, 0x17, 0xf5, 0xa1, 0xe8, 0xb9, 0xae, 0x17, 0x48, 0x9e, 0x79,
0xae, 0xda, 0x1c, 0x55, 0x9a, 0xd5, 0xa0, 0xb2, 0x22, 0xcb, 0x94, 0x18,
0x93, 0x9f, 0x23, 0x0e, 0x8d, 0x8c, 0x86, 0x0b, 0x25, 0x91, 0x82, 0x69,
0x74, 0xf0, 0x28, 0xd9, 0x83, 0x1a, 0x6d, 0x23, 0x2a, 0x1b, 0x80, 0x9f,
0x60, 0x3c, 0x27, 0xd1, 0x7d, 0x5a, 0x4e, 0x02, 0x20, 0xa2, 0x79, 0xa9,
0x38, 0x2f, 0x23, 0x77, 0x7c, 0x67, 0x25, 0xf7, 0x25, 0x78, 0x81, 0x4a,
0x1f, 0x70, 0x26, 0x55, 0x85, 0x94, 0x19, 0xfe, 0x27, 0xcb, 0x87, 0x3c,
0x17, 0x8c, 0x45, 0x19, 0x93, 0x3c, 0x11, 0x38, 0x14, 0xe7, 0x9f, 0xc8,
0xd2, 0xb8, 0x11, 0x14, 0xa2, 0x0d, 0xce, 0xdf, 0x12, 0x90, 0x9b, 0xaa,
0xbd, 0xb1, 0x11, 0xed, 0x98, 0x71, 0xb1, 0xc7, 0x1b, 0x79, 0x8d, 0x91,
0x9b, 0xbb, 0x1c, 0xcb, 0x86, 0xc9, 0x8b, 0xc7, 0x21, 0xe7, 0x7d, 0x12,
0x79, 0x61, 0x26, 0xc3, 0x79, 0x7d, 0x6e, 0x41, 0x28, 0xa7, 0x76, 0xff,
0x62, 0x7d, 0x28, 0x70, 0x73, 0x4d, 0x52, 0x4f, 0x25, 0x7c, 0x70, 0x38,
0x3d, 0xf2, 0x24, 0xf1, 0x6e, 0x7a, 0x2a, 0x29, 0x29, 0x49, 0x73, 0x9b,
0x20, 0xa7, 0x2d, 0xdb, 0x7a, 0x0a, 0x1b, 0xbd, 0x31, 0xaa, 0x80, 0xe3,
0x19, 0xaa, 0x54, 0x51, 0x8e, 0xdc, 0x14, 0xb8, 0x60, 0xc0, 0x94, 0x1d,
0x15, 0x7e, 0x13, 0x44, 0x96, 0x4f, 0xd4, 0x94, 0x0f, 0x8e, 0x98, 0x68,
0xcf, 0xcb, 0x0f, 0xf9, 0x95, 0xa0, 0xc6, 0x1b, 0x10, 0xd8, 0x8b, 0x6d,
0xad, 0x3e, 0x14, 0xe2, 0x83, 0x8b, 0x98, 0xd2, 0x1d, 0xbd, 0x7a, 0xd4,
0x85, 0x05, 0x27, 0x44, 0x76, 0x02, 0x77, 0xb5, 0x2c, 0x46, 0x71, 0xc0,
0x6a, 0x1c, 0x2f, 0x86, 0x6d, 0xe2, 0x5b, 0xd8, 0x2f, 0xad, 0x6a, 0x01,
0x4a, 0x15, 0x2f, 0x25, 0x67, 0xce, 0x36, 0x28, 0x30, 0x89, 0x67, 0x2e,
0x22, 0x3b, 0x38, 0xb3, 0x6c, 0x50, 0x18, 0xb3, 0x46, 0x63, 0x75, 0xe0,
0x19, 0x35, 0x55, 0xcd, 0x81, 0x15, 0x18, 0x29, 0x6b, 0x35, 0x8e, 0xdc,
0x17, 0x4c, 0x6f, 0x61, 0x97, 0xaa, 0x18, 0xc2, 0x12, 0xc0, 0x8b, 0x98,
0xd7, 0x1c, 0x0e, 0xf0, 0x8d, 0x6d, 0xd2, 0x88, 0x09, 0x33, 0x8b, 0xfe,
0xc8, 0x74, 0x0b, 0x82, 0x82, 0x53, 0xaf, 0x0a, 0x1a, 0x5b, 0x77, 0x5c,
0x94, 0x94, 0x25, 0x3d, 0x71, 0x06, 0x82, 0xd8, 0x2d, 0x13, 0x6c, 0x00,
0x74, 0x8b, 0x33, 0x71, 0x67, 0x5e, 0x64, 0xe8, 0x37, 0x8e, 0x63, 0x76,
0x56, 0x46, 0x38, 0xc6, 0x60, 0xa5, 0x44, 0x81, 0x3b, 0xac, 0x60, 0x77,
0x31, 0xc3, 0x3f, 0x5d, 0x61, 0x85, 0x20, 0x67, 0x48, 0x6d, 0x67, 0xff,
0x17, 0xb5, 0x57, 0xcf, 0x74, 0x2a, 0x18, 0xf4, 0x64, 0x9f, 0x7f, 0xf0,
0x18, 0x9b, 0x71, 0xf3, 0x8c, 0x0e, 0x19, 0x6d, 0x7e, 0x92, 0x96, 0xb2,
0x1b, 0x0a, 0x0f, 0x7b, 0x7c, 0x5f, 0xdc, 0x25, 0x0e, 0xe1, 0x80, 0xef,
0xd6, 0x06, 0x07, 0x11, 0x7f, 0x2a, 0xc9, 0xba, 0x0c, 0xef, 0x73, 0x39,
0xad, 0xe9, 0x23, 0x64, 0x6c, 0xbb, 0x94, 0x85, 0x2d, 0x69, 0x66, 0xb1,
0x82, 0xb7, 0x36, 0x99, 0x61, 0x34, 0x72, 0x16, 0x3d, 0x7b, 0x5d, 0x31,
0x62, 0x12, 0x42, 0x76, 0x5a, 0x69, 0x52, 0x99, 0x47, 0x2b, 0x59, 0xfb,
0x42, 0x13, 0x4b, 0x47, 0x5b, 0xa6, 0x32, 0x0d, 0x4f, 0x2e, 0x5e, 0x84,
0x22, 0x6a, 0x56, 0x08, 0x63, 0xc4, 0x16, 0xe9, 0x65, 0x37, 0x70, 0xcb,
0x19, 0x60, 0x71, 0xa2, 0x7c, 0x5e, 0x19, 0xda, 0x7d, 0xe3, 0x86, 0xfc,
0x19, 0xe3, 0x8a, 0x25, 0x94, 0xb4, 0x1c, 0x85, 0x17, 0x41, 0x6d, 0xb8,
0xdb, 0x8d, 0x10, 0xfa, 0x70, 0x73, 0xd9, 0x2a, 0x00, 0x00, 0x6f, 0x82,
0xd1, 0x73, 0x16, 0x5e, 0x69, 0x45, 0xb1, 0xe2, 0x2a, 0xa2, 0x61, 0x27,
0x97, 0x49, 0x38, 0x85, 0x5b, 0x6b, 0x81, 0x47, 0x42, 0xa1, 0x57, 0x09,
0x70, 0x9c, 0x4a, 0xa9, 0x54, 0x14, 0x61, 0x54, 0x51, 0x08, 0x52, 0x03,
0x52, 0x2d, 0x55, 0xc5, 0x53, 0xf0, 0x42, 0xd3, 0x59, 0xc6, 0x56, 0xf2,
0x33, 0x9b, 0x5e, 0x00, 0x5b, 0x26, 0x25, 0xad, 0x61, 0xc2, 0x5f, 0xec,
0x18, 0x8d, 0x6f, 0x6d, 0x6c, 0x47, 0x19, 0xd8, 0x7c, 0x6d, 0x79, 0x0e,
0x1b, 0x54, 0x88, 0x10, 0x82, 0x47, 0x1b, 0x6d, 0x96, 0x48, 0x90, 0x7d,
0x1e, 0x71, 0x1d, 0x61, 0x5b, 0x89, 0xdb, 0x6b, 0x19, 0xc1, 0x5d, 0xde,
0xda, 0x2c, 0x0e, 0xbe, 0x60, 0x86, 0xd4, 0x2b, 0x25, 0x87, 0x59, 0x8d,
0xb3, 0xde, 0x39, 0x12, 0x54, 0xa6, 0x95, 0x04, 0x47, 0xde, 0x50, 0x76,
0x81, 0x65, 0x51, 0x7e, 0x4d, 0x94, 0x71, 0x09, 0x58, 0xc6, 0x4b, 0xfd,
0x62, 0x0e, 0x5e, 0x2a, 0x4b, 0x47, 0x52, 0xa3, 0x62, 0xb2, 0x4b, 0x6d,
0x43, 0x23, 0x66, 0xad, 0x4e, 0xd4, 0x34, 0xeb, 0x6a, 0x49, 0x52, 0x4f,
0x27, 0x40, 0x6d, 0x9f, 0x58, 0x6e, 0x1b, 0x0a, 0x7a, 0x25, 0x64, 0x28,
0x1b, 0x4f, 0x89, 0x3b, 0x72, 0xde, 0x1d, 0xe4, 0x93, 0x8a, 0x7c, 0x6b,
0x1e, 0x79, 0x9d, 0x13, 0x85, 0x29, 0x1e, 0xc7, 0x2b, 0xb0, 0x30, 0x28,
0xd1, 0x36, 0x2a, 0xef, 0x31, 0xd4, 0xd1, 0xc5, 0x20, 0xba, 0x4a, 0xbc,
0xd9, 0x54, 0x34, 0xfc, 0x4b, 0x22, 0xb6, 0x6c, 0x4b, 0x9a, 0x48, 0x2c,
0x95, 0x61, 0x58, 0xad, 0x46, 0x06, 0x82, 0x9c, 0x60, 0xc9, 0x44, 0x8c,
0x73, 0x79, 0x65, 0x53, 0x43, 0x59, 0x65, 0x86, 0x69, 0xff, 0x41, 0x6b,
0x54, 0xbd, 0x6e, 0x40, 0x40, 0xe4, 0x44, 0x88, 0x72, 0x25, 0x43, 0x54,
0x35, 0x85, 0x75, 0x45, 0x46, 0x91, 0x28, 0x0d, 0x78, 0xa7, 0x4c, 0xae,
0x1a, 0xaf, 0x85, 0x9b, 0x5a, 0x3a, 0x1c, 0xd7, 0x93, 0x66, 0x68, 0x87,
0x1f, 0xa9, 0x9c, 0x67, 0x74, 0x23, 0x1f, 0x29, 0xa6, 0xb0, 0x7b, 0x9a,
0x1f, 0x83, 0x2b, 0xc6, 0x30, 0x19, 0xd1, 0x3c, 0x2b, 0xd3, 0x30, 0x23,
0xd1, 0x49, 0x39, 0x52, 0x37, 0x10, 0xe0, 0xc4, 0x4c, 0xb3, 0x38, 0x23,
0xbe, 0x99, 0x5f, 0xdd, 0x3b, 0xa8, 0x9a, 0xb7, 0x69, 0x52, 0x3b, 0xf8,
0x87, 0x10, 0x6d, 0x9f, 0x3a, 0xc4, 0x77, 0xfe, 0x71, 0x90, 0x38, 0xff,
0x69, 0x4e, 0x75, 0xf6, 0x36, 0x82, 0x58, 0x20, 0x79, 0x37, 0x34, 0xa7,
0x46, 0xb7, 0x7c, 0x33, 0x34, 0x0f, 0x35, 0x9e, 0x7f, 0x4c, 0x36, 0xce,
0x27, 0x75, 0x81, 0xca, 0x3a, 0x48, 0x19, 0x2d, 0x90, 0x2b, 0x4b, 0xe8,
0x1d, 0x4a, 0x99, 0xd5, 0x5b, 0x39, 0x20, 0x58, 0xa2, 0xee, 0x65, 0xad,
0x1f, 0x8c, 0xad, 0x2a, 0x72, 0xc1, 0x1d, 0x84, 0x2b, 0x8b, 0x30, 0x72,
0xcd, 0xab, 0x2c, 0x9d, 0x2f, 0x23, 0xd0, 0xae, 0x53, 0x42, 0x25, 0xe6,
0xe9, 0x5a, 0x66, 0x89, 0x29, 0xee, 0xc7, 0xe4, 0x74, 0x1d, 0x30, 0x7c,
0xa4, 0x87, 0x79, 0xc2, 0x32, 0x7f, 0x8f, 0xe0, 0x7c, 0x00, 0x31, 0x2b,
0x7f, 0xb0, 0x80, 0x16, 0x2e, 0x3f, 0x6e, 0xcc, 0x82, 0xc7, 0x2b, 0xd6,
0x5c, 0xbf, 0x84, 0xd1, 0x29, 0x4d, 0x4a, 0xd3, 0x87, 0x19, 0x26, 0xdb,
0x39, 0x04, 0x89, 0x2e, 0x25, 0xb9, 0x27, 0xcb, 0x8b, 0xd1, 0x28, 0x3f,
0x18, 0x71, 0x98, 0x86, 0x3b, 0x11, 0x1a, 0x13, 0xa5, 0x32, 0x4d, 0x46,
0x1d, 0x76, 0xac, 0x78, 0x55, 0x8e, 0x1d, 0x34, 0xae, 0xd8, 0x63, 0x08,
0x1d, 0x85, 0x2c, 0x91, 0x2f, 0x18, 0xd0, 0xa2, 0x2c, 0xcb, 0x2f, 0x05,
0xd0, 0xbc, 0x76, 0x57, 0x22, 0xe8, 0xdd, 0xdf, 0x81, 0x11, 0x1e, 0xbb,
0xd0, 0x5f, 0x8a, 0x80, 0x24, 0xe7, 0xb1, 0xfe, 0x8e, 0x1e, 0x28, 0x41,
0x99, 0xfa, 0x8c, 0xdf, 0x25, 0xa8, 0x89, 0x85, 0x8f, 0x5e, 0x23, 0x9a,
0x77, 0x86, 0x8f, 0xd1, 0x20, 0xd7, 0x62, 0x16, 0x91, 0x19, 0x1e, 0x55,
0x50, 0x03, 0x91, 0x64, 0x1c, 0x09, 0x3e, 0x7a, 0x97, 0xa0, 0x1d, 0xaf,
0x2f, 0x4d, 0x9e, 0x8e, 0x1f, 0x83, 0x21, 0xd2, 0xab, 0x19, 0x26, 0xfd,
0x1e, 0xf8, 0xb7, 0x22, 0x36, 0xf8, 0x1b, 0x7e, 0xbf, 0x74, 0x44, 0x0b,
0x1b, 0xd8, 0xc3, 0x8f, 0x55, 0x6a, 0x1e, 0x0c, 0x2c, 0xa8, 0x2f, 0x09,
0xd0, 0xa9, 0x82, 0x30, 0x24, 0x4f, 0xdd, 0x8d, 0x8f, 0x5d, 0x23, 0x36,
0xd8, 0x69, 0x9d, 0x19, 0x20, 0xc4, 0xd2, 0x62, 0xa4, 0x96, 0x1a, 0xe4,
0xc5, 0xa2, 0xa3, 0x08, 0x1d, 0xe3, 0xad, 0xd9, 0xa4, 0x56, 0x1d, 0x25,
0x99, 0xf7, 0xa3, 0x99, 0x1c, 0x23, 0x82, 0x3d, 0xa4, 0x94, 0x1d, 0x59,
0x6d, 0xe4, 0xa4, 0xcf, 0x1d, 0x4e, 0x5b, 0xa7, 0xa5, 0x7c, 0x1c, 0xc9,
0x4a, 0x6a, 0xaa, 0x9a, 0x19, 0xe7, 0x39, 0xe3, 0xaf, 0x96, 0x18, 0xc8,
0x25, 0x2c, 0xc1, 0x4d, 0x20, 0xcc, 0x22, 0x98, 0xc5, 0x2a, 0x27, 0x07,
0x24, 0x8a, 0xc6, 0xbb, 0x29, 0x9b, 0x25, 0x57, 0xc6, 0xc3, 0x43, 0x89,
0x21, 0xa8, 0x88, 0xa4, 0x25, 0x13, 0xdc, 0xf9, 0x94, 0x2d, 0x25, 0x30,
0xda, 0xb1, 0x9f, 0x80, 0x24, 0x4f, 0xd6, 0xf0, 0xa9, 0x94, 0x21, 0x42,
0xd3, 0x5c, 0xb8, 0x06, 0x1c, 0xc7, 0xce, 0x9f, 0xbf, 0x75, 0x1d, 0x4c,
0xc4, 0xda, 0xbe, 0xa1, 0x1e, 0x60, 0xad, 0x89, 0xc0, 0x27, 0x1c, 0xac,
0x97, 0x9a, 0xc0, 0x36, 0x1b, 0xfe, 0x7f, 0x5f, 0xbe, 0x21, 0x1b, 0xfe,
0x6b, 0x46, 0xbe, 0x3c, 0x1a, 0x26, 0x58, 0x11, 0xbc, 0x8e, 0x17, 0x31,
0x43, 0x65, 0xc2, 0x5a, 0x13, 0xdb, 0x29, 0x32, 0xc7, 0x31, 0x23, 0x14,
0x27, 0x9a, 0xc8, 0x30, 0x26, 0xc3, 0x27, 0x74, 0xc8, 0xb7, 0x28, 0xcd,
0x27, 0x64, 0xc8, 0x30, 0x2d, 0xd3, 0x29, 0xef, 0x98, 0xc1, 0x25, 0xdf,
0xda, 0xcb, 0x9e, 0xd1, 0x25, 0x2f, 0xd8, 0xb1, 0xaa, 0x96, 0x23, 0xc6,
0xd6, 0x7a, 0xbd, 0xc8, 0x1e, 0xcb, 0xd7, 0x64, 0xc2, 0xc6, 0x1d, 0xe3,
0xd1, 0xcf, 0xc8, 0x75, 0x1f, 0xd8, 0xc7, 0x20, 0xc9, 0x99, 0x1f, 0x1c,
0xb6, 0xc3, 0xc9, 0xbe, 0x1e, 0x21, 0xa1, 0xa9, 0xc8, 0x49, 0x1c, 0x84,
0x86, 0x37, 0xc6, 0xf4, 0x1c, 0x24, 0x72, 0xe0, 0xc7, 0x1c, 0x1c, 0x66,
0x60, 0x22, 0xc7, 0xe2, 0x1d, 0x19, 0x50, 0x6e, 0xc9, 0x92, 0x19, 0xc5,
0x34, 0x4d, 0xca, 0x29, 0x24, 0xf6, 0x29, 0xb7, 0xca, 0x50, 0x27, 0x84,
0x29, 0x16, 0xca, 0x66, 0x29, 0x27, 0x28, 0xb5, 0xca, 0x74, 0x2a, 0x48,
0x28, 0x73, 0x1d, 0xc6, 0xaa, 0xa5, 0xb4, 0xea, 0x20, 0x32, 0xa9, 0x5f,
0xad, 0x74, 0x20, 0x4f, 0xa8, 0xc4, 0xab, 0x67, 0x21, 0x2e, 0xa8, 0xc7,
0xa8, 0x57, 0x24, 0x86, 0xa4, 0x20, 0x9d, 0xc6, 0x23, 0xa4, 0xa4, 0xc0,
0x97, 0x87, 0x26, 0xc4, 0xa3, 0x41, 0x92, 0x4e, 0x26, 0xf4, 0xa2, 0xd4,
0x8f, 0xdb, 0x28, 0x30, 0xa3, 0x71, 0x85, 0xc8, 0x29, 0xac, 0xa3, 0x23,
0x7d, 0x2c, 0x28, 0x81, 0x9a, 0xfd, 0x6f, 0xb5, 0x25, 0x15, 0xa1, 0x0d,
0x63, 0x6e, 0x24, 0x7f, 0xa0, 0x84, 0x5f, 0xcc, 0x15, 0x21, 0x97, 0x73,
0x23, 0xb4, 0x1a, 0xe8, 0x9f, 0x47, 0x20, 0xe5, 0x20, 0x26, 0xa6, 0xdc,
0x20, 0xa2, 0x23, 0xad, 0xb3, 0x71, 0x21, 0x25, 0x1b, 0x95, 0xaa, 0x6e,
0xc1, 0xe6, 0x1d, 0x2c, 0xa9, 0x6f, 0xb5, 0xb5, 0x1f, 0xd3, 0xa7, 0xb9,
0xac, 0x0b, 0x1f, 0xee, 0xa6, 0x93, 0xa8, 0xf2, 0x22, 0x6e, 0xa4, 0x8d,
0xa0, 0x7f, 0x24, 0xad, 0xa0, 0xeb, 0x99, 0x29, 0x23, 0xa0, 0xa1, 0x51,
0x91, 0xe2, 0x26, 0x79, 0x9e, 0x4b, 0x8c, 0x9c, 0x28, 0x8d, 0x95, 0x89,
0x7a, 0xa6, 0x28, 0xcf, 0x95, 0xa3, 0x71, 0xb9, 0x24, 0xf6, 0x8e, 0xae,
0x65, 0x79, 0x23, 0xc3, 0x9b, 0xf4, 0x5e, 0xc4, 0x16, 0x79, 0x98, 0x30,
0x3d, 0x92, 0x1b, 0xda, 0x92, 0xd8, 0x24, 0xf6, 0x19, 0x0f, 0x93, 0x84,
0x1a, 0xfd, 0x1f, 0xbc, 0x9d, 0x8b, 0x1b, 0xb2, 0x23, 0x69, 0xa3, 0x01,
0x1b, 0xfc, 0x1b, 0x10, 0xa9, 0x63, 0xc3, 0x0a, 0x1a, 0xd5, 0xa8, 0xaf,
0xc0, 0x67, 0x1a, 0xf5, 0xa7, 0xcd, 0xb8, 0x26, 0x1c, 0x79, 0xa5, 0xb0,
0xab, 0x54, 0x20, 0x30, 0xa1, 0xfa, 0xa3, 0xb6, 0x24, 0x09, 0x9e, 0xae,
0x98, 0x9b, 0x24, 0xb8, 0x9a, 0xee, 0x91, 0x20, 0x27, 0x53, 0x96, 0x4f,
0x85, 0xd2, 0x29, 0x57, 0x8b, 0xcb, 0x75, 0x90, 0x28, 0x02, 0x8d, 0x6d,
0x69, 0xe2, 0x23, 0xc1, 0x8a, 0xbd, 0x5e, 0x65, 0x20, 0xe9, 0x88, 0xb8,
0x4a, 0xd7, 0x20, 0x1d, 0x89, 0xbc, 0x2f, 0x42, 0x1f, 0x9a, 0x87, 0xe1,
0x21, 0x3a, 0x1f, 0x0b, 0x8e, 0x4c, 0x18, 0x93, 0x21, 0x81, 0x90, 0xf8,
0x15, 0x7a, 0x24, 0xbe, 0x9a, 0xd5, 0x16, 0xae, 0x14, 0xba, 0xa9, 0xae,
0xd5, 0x96, 0x11, 0x8a, 0xac, 0x22, 0xd2, 0xcb, 0x19, 0x66, 0xa5, 0x60,
0xbd, 0x8f, 0x18, 0xf8, 0xa2, 0xee, 0xb4, 0x03, 0x1b, 0x95, 0x9e, 0x8a,
0xa5, 0x80, 0x22, 0x61, 0x97, 0x86, 0x97, 0x3f, 0x26, 0x95, 0x8d, 0x14,
0x88, 0x75, 0x27, 0xcd, 0x85, 0xd8, 0x78, 0xf9, 0x29, 0xe9, 0x83, 0x1a,
0x6d, 0xd1, 0x28, 0xaa, 0x83, 0x2a, 0x62, 0xdf, 0x27, 0x59, 0x7e, 0xf7,
0x50, 0x3c, 0x20, 0xf2, 0x7d, 0x5e, 0x3a, 0xa5, 0x22, 0xa3, 0x7f, 0x56,
0x26, 0x75, 0x24, 0xd3, 0x85, 0x2a, 0x1d, 0x42, 0x26, 0xc9, 0x87, 0x33,
0x18, 0x1d, 0x26, 0x60, 0x8a, 0x0c, 0x10, 0x03, 0x46, 0x08, 0x95, 0xef,
0x10, 0xca, 0x16, 0x77, 0xa3, 0x7c, 0xd5, 0xb1, 0x13, 0x52, 0xa5, 0xfb,
0xd2, 0x98, 0x10, 0x08, 0xa3, 0x97, 0xcb, 0x50, 0x12, 0x1a, 0x9d, 0x8f,
0xb7, 0xcc, 0x17, 0x51, 0x95, 0x1f, 0xa5, 0x67, 0x1d, 0x50, 0x89, 0xa7,
0x8f, 0x10, 0x25, 0xf6, 0x85, 0x23, 0x81, 0xf9, 0x2b, 0xb3, 0x82, 0x3b,
0x76, 0xd5, 0x2e, 0x18, 0x7e, 0x5f, 0x69, 0x19, 0x2e, 0xdd, 0x7b, 0x0b,
0x59, 0xd6, 0x2d, 0x11, 0x78, 0x3e, 0x46, 0xf4, 0x2a, 0x5f, 0x76, 0x1e,
0x31, 0xc7, 0x2c, 0x5a, 0x74, 0x22, 0x1d, 0x52, 0x32, 0xfa, 0x7c, 0xc8,
0x1a, 0x7e, 0x44, 0x7e, 0x85, 0xd0, 0x13, 0x40, 0x56, 0xec, 0x91, 0x5f,
0x14, 0xaf, 0x6b, 0x3c, 0x9d, 0xca, 0x16, 0x23, 0x15, 0x7a, 0x99, 0xdb,
0xd7, 0x60, 0x12, 0x74, 0x9c, 0x96, 0xd3, 0xad, 0x10, 0x87, 0x9a, 0xf0,
0xcb, 0xc7, 0x12, 0x28, 0x92, 0xec, 0xb8, 0x6d, 0x15, 0x63, 0x8a, 0x0a,
0xa1, 0x5e, 0x23, 0xf9, 0x83, 0x68, 0x8e, 0xf3, 0x2c, 0x46, 0x7e, 0x37,
0x7f, 0xd2, 0x32, 0x1e, 0x79, 0x0e, 0x71, 0xe6, 0x35, 0x1c, 0x75, 0x2b,
0x63, 0x5d, 0x36, 0x2a, 0x71, 0xe3, 0x52, 0xa5, 0x36, 0x27, 0x6f, 0xc2,
0x3e, 0x30, 0x39, 0x2a, 0x70, 0x07, 0x2c, 0x45, 0x40, 0x06, 0x6f, 0x68,
0x1b, 0x2e, 0x4a, 0xb8, 0x7a, 0x42, 0x18, 0xa2, 0x5a, 0x97, 0x81, 0xcd,
0x16, 0x73, 0x6d, 0xda, 0x91, 0xc6, 0x17, 0x75, 0x71, 0x8d, 0x99, 0x48,
0x19, 0x01, 0x15, 0x6e, 0x8f, 0x96, 0xda, 0x37, 0x12, 0x85, 0x92, 0x16,
0xd6, 0xda, 0x0d, 0xe1, 0x91, 0x05, 0xcd, 0xc4, 0x0a, 0x33, 0x88, 0xda,
0xb8, 0x05, 0x21, 0x3a, 0x7f, 0xf2, 0x9f, 0x35, 0x2c, 0x03, 0x79, 0x7b,
0x8d, 0x89, 0x34, 0x8a, 0x74, 0x08, 0x7c, 0xd7, 0x39, 0x6b, 0x6f, 0x30,
0x6c, 0xe5, 0x3e, 0x3b, 0x6b, 0x6a, 0x5e, 0x19, 0x40, 0xea, 0x68, 0xe2,
0x4d, 0x2d, 0x43, 0xd3, 0x68, 0xbf, 0x3a, 0x25, 0x49, 0x58, 0x6b, 0x24,
0x2a, 0x75, 0x4e, 0x34, 0x6d, 0xef, 0x1b, 0xe8, 0x5b, 0x0f, 0x77, 0xdd,
0x19, 0x1f, 0x67, 0x4b, 0x82, 0x97, 0x18, 0xb5, 0x77, 0xf0, 0x91, 0x46,
0x1a, 0x4c, 0x80, 0x88, 0x98, 0x17, 0x1b, 0x47, 0x13, 0x1d, 0x80, 0xfa,
0xdf, 0x7b, 0x13, 0x6f, 0x86, 0x20, 0xda, 0xa3, 0x0c, 0xe0, 0x86, 0x44,
0xd2, 0x1d, 0x15, 0xa0, 0x7e, 0x0d, 0xb9, 0xab, 0x28, 0x25, 0x75, 0xe7,
0xa0, 0xbd, 0x34, 0xc5, 0x6f, 0x1f, 0x8c, 0xc4, 0x3d, 0xea, 0x69, 0x97,
0x7b, 0xa3, 0x45, 0xcb, 0x65, 0x9d, 0x6b, 0x27, 0x4b, 0x09, 0x63, 0x26,
0x5b, 0x76, 0x50, 0x03, 0x62, 0xaa, 0x4b, 0x22, 0x54, 0x47, 0x64, 0x36,
0x3b, 0x15, 0x58, 0x74, 0x67, 0x79, 0x2c, 0x1f, 0x5d, 0x1a, 0x6a, 0xce,
0x1d, 0xb3, 0x67, 0x71, 0x74, 0x69, 0x19, 0x40, 0x74, 0x30, 0x7f, 0x73,
0x19, 0xe4, 0x81, 0xbe, 0x8b, 0x51, 0x1a, 0x7d, 0x8e, 0xeb, 0x99, 0x08,
0x1d, 0x25, 0x19, 0xe0, 0x72, 0x45, 0xdf, 0x46, 0x15, 0xb1, 0x76, 0x13,
0xde, 0xa8, 0x0a, 0xcb, 0x78, 0xc9, 0xdc, 0xa2, 0x21, 0x8c, 0x72, 0x23,
0xbc, 0x64, 0x34, 0x0a, 0x6a, 0x43, 0xa0, 0xcc, 0x42, 0x01, 0x63, 0xa9,
0x8b, 0x90, 0x4c, 0x29, 0x5f, 0x6c, 0x7a, 0xb2, 0x53, 0xf3, 0x5d, 0x03,
0x6a, 0xb4, 0x5a, 0x2b, 0x5b, 0x22, 0x5b, 0x4e, 0x5e, 0xaa, 0x5c, 0xc5,
0x4b, 0xcb, 0x62, 0x7c, 0x5f, 0x97, 0x3c, 0x97, 0x66, 0x5a, 0x63, 0x18,
0x2e, 0x13, 0x6a, 0x4f, 0x67, 0x28, 0x20, 0x6b, 0x72, 0xa8, 0x6f, 0xe9,
0x1a, 0x24, 0x7f, 0xca, 0x7c, 0x5a, 0x1b, 0xb7, 0x8b, 0xb8, 0x86, 0x98,
0x1b, 0xf0, 0x98, 0x8d, 0x94, 0x26, 0x1f, 0x06, 0x1f, 0xcf, 0x60, 0xa5,
0xde, 0xd7, 0x1f, 0xc2, 0x64, 0x5e, 0xde, 0x6b, 0x1a, 0x7c, 0x69, 0xc4,
0xdf, 0xae, 0x30, 0x56, 0x64, 0x26, 0xbf, 0x17, 0x43, 0xfb, 0x5d, 0xaa,
0xa0, 0xb5, 0x52, 0x20, 0x59, 0x3b, 0x8c, 0x0b, 0x5b, 0xab, 0x56, 0xa7,
0x7a, 0xf6, 0x62, 0x3e, 0x54, 0xdd, 0x6b, 0x64, 0x67, 0x1c, 0x54, 0x42,
0x5b, 0xbe, 0x6b, 0x83, 0x54, 0x82, 0x4b, 0xf1, 0x6f, 0x6d, 0x57, 0xd6,
0x3d, 0x66, 0x73, 0x3e, 0x5b, 0xe1, 0x2f, 0xb2, 0x76, 0x3e, 0x60, 0x40,
0x22, 0x74, 0x7e, 0x3f, 0x69, 0x00, 0x1c, 0x4e, 0x8b, 0xd5, 0x75, 0x43,
0x1d, 0x9e, 0x96, 0xe9, 0x7e, 0x98, 0x1d, 0x8b, 0xa2, 0xfd, 0x8c, 0x1c,
0x1f, 0xf3, 0x2b, 0xbc, 0x30, 0x33, 0xd1, 0x42, 0x2b, 0x03, 0x36, 0x32,
0xd3, 0xc6, 0x2d, 0x02, 0x56, 0x2e, 0xe5, 0x2d, 0x42, 0x5e, 0x54, 0x9b,
0xc2, 0x30, 0x56, 0xe7, 0x51, 0x16, 0xa1, 0x22, 0x62, 0xca, 0x4f, 0x48,
0x8d, 0x1f, 0x6a, 0xa1, 0x4e, 0x0a, 0x7d, 0x1b, 0x6e, 0xbe, 0x4c, 0xf8,
0x6e, 0xb2, 0x73, 0x3c, 0x4b, 0x61, 0x5d, 0x55, 0x77, 0x8f, 0x4a, 0x5d,
0x4c, 0xf6, 0x7b, 0x6c, 0x4d, 0x13, 0x3d, 0xb2, 0x7e, 0xcb, 0x51, 0x0e,
0x30, 0x86, 0x81, 0xe8, 0x55, 0xdc, 0x22, 0xca, 0x89, 0x28, 0x5e, 0x43,
0x1d, 0x65, 0x96, 0x83, 0x6d, 0x3a, 0x20, 0x54, 0xa1, 0x61, 0x75, 0xa8,
0x1f, 0x20, 0xab, 0x82, 0x7f, 0xbe, 0x1f, 0xbe, 0x2b, 0xd3, 0x30, 0x24,
0xd1, 0x49, 0x2b, 0xd0, 0x30, 0x30, 0xd1, 0x80, 0x48, 0xf7, 0x40, 0xe8,
0xed, 0xe8, 0x5b, 0x09, 0x42, 0xb0, 0xc9, 0x0b, 0x6b, 0x14, 0x44, 0xfc,
0xa4, 0xe2, 0x73, 0x16, 0x45, 0x89, 0x91, 0x08, 0x77, 0x49, 0x44, 0xaa,
0x81, 0x2e, 0x7b, 0x24, 0x43, 0x76, 0x71, 0xbe, 0x7f, 0x9b, 0x40, 0x87,
0x5f, 0xf1, 0x82, 0xe5, 0x3f, 0x0d, 0x4f, 0x35, 0x86, 0x04, 0x3e, 0xed,
0x3e, 0xa6, 0x89, 0x19, 0x42, 0x09, 0x30, 0x15, 0x8b, 0xd0, 0x45, 0x20,
0x21, 0xd0, 0x94, 0x00, 0x52, 0x1f, 0x1e, 0x80, 0x9f, 0x8e, 0x5f, 0xa8,
0x20, 0x32, 0xab, 0x58, 0x6c, 0x12, 0x1d, 0x5f, 0xae, 0x8e, 0x74, 0x7c,
0x1d, 0xa9, 0x2c, 0x86, 0x2f, 0x31, 0xd0, 0xa7, 0x2c, 0xb4, 0x2f, 0x37,
0xd0, 0xc6, 0x63, 0xe0, 0x2f, 0xa7, 0xf6, 0x39, 0x75, 0xd6, 0x33, 0x69,
0xd2, 0x11, 0x7f, 0xf7, 0x38, 0x63, 0xaf, 0x92, 0x83, 0x51, 0x3a, 0xe0,
0x99, 0x7d, 0x85, 0x86, 0x3a, 0x52, 0x88, 0x2d, 0x89, 0x72, 0x38, 0x15,
0x76, 0xa1, 0x8c, 0x90, 0x35, 0x77, 0x64, 0x6f, 0x8e, 0xda, 0x33, 0xc4,
0x53, 0x5c, 0x91, 0x0f, 0x31, 0x43, 0x42, 0x31, 0x93, 0x7f, 0x30, 0x30,
0x30, 0x86, 0x96, 0x31, 0x33, 0x38, 0x21, 0x2e, 0x9e, 0x3c, 0x3e, 0x7c,
0x1a, 0x7a, 0xaa, 0xc8, 0x50, 0x78, 0x1c, 0xfe, 0xae, 0x69, 0x59, 0xbe,
0x1d, 0x33, 0xb5, 0xac, 0x66, 0xa3, 0x1b, 0x71, 0x2c, 0x9d, 0x2f, 0x23,
0xd0, 0xae, 0x6f, 0xbb, 0x28, 0xf8, 0xe7, 0x4c, 0x7e, 0x9d, 0x27, 0xdc,
0xe3, 0x1d, 0x90, 0xb0, 0x26, 0x12, 0xdc, 0x53, 0x96, 0xeb, 0x2b, 0x7e,
0xbf, 0x85, 0x96, 0xb0, 0x2d, 0x8d, 0xa8, 0xb3, 0x97, 0x82, 0x2d, 0x85,
0x93, 0x09, 0x99, 0x5d, 0x2b, 0x7e, 0x7e, 0x46, 0x9a, 0xa4, 0x2a, 0x15,
0x6a, 0x45, 0x9c, 0x07, 0x28, 0x06, 0x58, 0x33, 0x9d, 0x21, 0x25, 0x35,
0x46, 0x3d, 0x9f, 0xc0, 0x21, 0xe3, 0x33, 0xc8, 0xa4, 0x74, 0x1e, 0x49,
0x20, 0x4f, 0xb1, 0x0d, 0x29, 0x2d, 0x1d, 0x5a, 0xbb, 0xe5, 0x3a, 0x8b,
0x1b, 0xd6, 0xc2, 0xee, 0x4c, 0x25, 0x1e, 0x10, 0xc5, 0x56, 0x5a, 0x7f,
0x1e, 0xd4, 0x2c, 0xb4, 0x2f, 0x14, 0xd0, 0xb5, 0x88, 0x4d, 0x26, 0xda,
0xdf, 0xbe, 0x95, 0x18, 0x26, 0xd0, 0xdc, 0xda, 0xa4, 0x11, 0x25, 0x06,
0xd7, 0xd1, 0xaf, 0x2b, 0x1b, 0xd6, 0xcf, 0xcb, 0xad, 0x58, 0x1d, 0x2e,
0xb8, 0x40, 0xab, 0xa4, 0x1d, 0xad, 0x9f, 0x6b, 0xab, 0xd9, 0x1b, 0xec,
0x87, 0x1d, 0xab, 0xec, 0x1d, 0x1f, 0x71, 0xc2, 0xac, 0x24, 0x1d, 0xf3,
0x5f, 0x6b, 0xae, 0x53, 0x1b, 0x5e, 0x4d, 0x70, 0xaf, 0x7e, 0x19, 0x53,
0x3a, 0xf9, 0xb8, 0xfc, 0x13, 0xc5, 0x25, 0x83, 0xc4, 0x60, 0x23, 0x9f,
0x24, 0xb6, 0xc6, 0xf0, 0x28, 0xad, 0x25, 0xc4, 0xc7, 0xfb, 0x2a, 0xc6,
0x26, 0x34, 0xc8, 0x2c, 0x49, 0x82, 0x22, 0xb2, 0x8a, 0xbb, 0x26, 0xa2,
0xde, 0xc5, 0x99, 0x39, 0x27, 0x07, 0xdc, 0x60, 0xa4, 0x4c, 0x26, 0x62,
0xd9, 0x84, 0xaf, 0x52, 0x23, 0xec, 0xd7, 0xe3, 0xbe, 0x5b, 0x1d, 0x11,
0xd5, 0x98, 0xc5, 0xbd, 0x1d, 0xc8, 0xc9, 0x48, 0xc5, 0x23, 0x1e, 0xa0,
0xb3, 0x47, 0xc4, 0xce, 0x1c, 0xd0, 0x9a, 0x17, 0xc3, 0xfb, 0x1c, 0x31,
0x81, 0x48, 0xc2, 0xf0, 0x1b, 0xf8, 0x6d, 0x72, 0xc3, 0x21, 0x19, 0xf2,
0x5a, 0x1d, 0xc4, 0x7b, 0x19, 0x80, 0x47, 0xd8, 0xc6, 0xe1, 0x17, 0xca,
0x2c, 0x9d, 0xc9, 0x75, 0x27, 0xbe, 0x29, 0xae, 0xc9, 0xe7, 0x28, 0xc8,
0x28, 0x54, 0xca, 0x1a, 0x2a, 0x85, 0x28, 0x0b, 0xca, 0x39, 0x2b, 0xa0,
0x27, 0xde, 0x9d, 0x3c, 0x27, 0x31, 0xdb, 0xdd, 0xa3, 0xae, 0x26, 0xd6,
0xda, 0x17, 0xac, 0xb5, 0x25, 0x7f, 0xd8, 0x9c, 0xc0, 0xc1, 0x21, 0x56,
0xda, 0x42, 0xcb, 0xd4, 0x1e, 0x1e, 0xd6, 0xe7, 0xcc, 0x01, 0x20, 0x52,
0xca, 0x94, 0xcc, 0xef, 0x1f, 0x86, 0xb9, 0x23, 0xcc, 0xc9, 0x1d, 0x2a,
0xa1, 0x84, 0xcb, 0xb5, 0x1c, 0xb2, 0x87, 0xe5, 0xca, 0x51, 0x1d, 0x63,
0x74, 0xb5, 0xca, 0x26, 0x1e, 0xb5, 0x62, 0x16, 0xca, 0xa6, 0x1f, 0x2e,
0x52, 0x0d, 0xcc, 0x1e, 0x1c, 0x10, 0x36, 0x60, 0xcb, 0x58, 0x26, 0x12,
0x2a, 0x90, 0xcb, 0x39, 0x28, 0x61, 0x29, 0xbd, 0xcb, 0x24, 0x29, 0xdb,
0x29, 0x3c, 0xcb, 0x14, 0x2a, 0xe2, 0x28, 0xe5, 0x1e, 0x52, 0xac, 0x3f,
0xb7, 0x07, 0x20, 0x91, 0xab, 0x46, 0xaf, 0x6b, 0x20, 0xb7, 0xaa, 0xf0,
0xad, 0xa4, 0x21, 0xa5, 0xac, 0x75, 0xaa, 0xd3, 0x22, 0x09, 0xaf, 0xc5,
0xa7, 0xa1, 0x23, 0x71, 0xa7, 0x95, 0x9a, 0x43, 0x27, 0x03, 0xa5, 0xca,
0x94, 0x68, 0x27, 0x31, 0xa5, 0x61, 0x91, 0xf2, 0x28, 0x78, 0xa5, 0x39,
0x87, 0x27, 0x29, 0xd0, 0xa4, 0x7e, 0x7e, 0x08, 0x29, 0x68, 0xa3, 0x93,
0x74, 0xc1, 0x25, 0x7f, 0xa3, 0x1d, 0x64, 0x9f, 0x24, 0xae, 0xa2, 0x70,
0x5f, 0xb4, 0x18, 0x77, 0xa4, 0x19, 0x26, 0x2c, 0x1f, 0xa0, 0xb0, 0x47,
0x24, 0x88, 0x24, 0x03, 0xbb, 0xf2, 0x24, 0xfb, 0x26, 0x29, 0xbf, 0x24,
0x24, 0x6a, 0x1c, 0x5e, 0xac, 0x43, 0xc3, 0xea, 0x1d, 0xe5, 0xab, 0x7c,
0xb8, 0x4b, 0x20, 0x50, 0xaa, 0x39, 0xae, 0xa3, 0x20, 0x7c, 0xa9, 0x8e,
0xac, 0x09, 0x21, 0xca, 0xaa, 0x76, 0xa7, 0x7a, 0x24, 0x55, 0xa4, 0x88,
0x9c, 0xa3, 0x23, 0x64, 0xa4, 0xc2, 0x95, 0x34, 0x26, 0xe1, 0xa2, 0x86,
0x90, 0x14, 0x27, 0x75, 0xa2, 0xbc, 0x86, 0x25, 0x29, 0xe7, 0xa1, 0x76,
0x7a, 0xb3, 0x28, 0x69, 0x9b, 0x8a, 0x6d, 0x72, 0x24, 0x83, 0x9f, 0x78,
0x60, 0xc8, 0x15, 0x7a, 0x9c, 0x11, 0x3e, 0x5d, 0x16, 0x2b, 0x98, 0xc1,
0x21, 0x8f, 0x1d, 0x37, 0x9f, 0xa9, 0x1e, 0xaa, 0x22, 0xad, 0xaa, 0x50,
0x1e, 0xb5, 0x25, 0xb1, 0xb2, 0x61, 0x1f, 0x51, 0x16, 0x36, 0xb4, 0xe6,
0xd7, 0x1e, 0x1b, 0xd9, 0xab, 0x14, 0xc3, 0x0e, 0x1c, 0x0b, 0xaa, 0xa0,
0xbb, 0x7e, 0x1d, 0x91, 0xa9, 0x07, 0xaf, 0x35, 0x1f, 0xfd, 0xa6, 0x83,
0xa8, 0x7a, 0x23, 0x75, 0xa3, 0x3c, 0x9d, 0x1f, 0x24, 0x6f, 0x9f, 0x17,
0x95, 0x2e, 0x24, 0xa3, 0x9a, 0x76, 0x89, 0x22, 0x29, 0xf4, 0x8f, 0xcf,
0x7a, 0x56, 0x2b, 0x1d, 0x8c, 0xa0, 0x6e, 0xea, 0x28, 0x9c, 0x88, 0xf1,
0x60, 0xd2, 0x20, 0x76, 0x8f, 0x36, 0x4c, 0xcb, 0x1d, 0x3d, 0x8c, 0x83,
0x30, 0x52, 0x1c, 0xe3, 0x91, 0x1b, 0x20, 0x0d, 0x1d, 0xec, 0x94, 0x8b,
0x17, 0x98, 0x23, 0xb9, 0x9d, 0x25, 0x18, 0x9d, 0x27, 0xa3, 0xa5, 0x01,
0x1a, 0x68, 0x16, 0x4f, 0xac, 0x0b, 0xd8, 0x49, 0x13, 0xe3, 0xb0, 0x36,
0xd5, 0xdf, 0x1a, 0xde, 0xa8, 0xd9, 0xc1, 0x6a, 0x1a, 0xb1, 0xa7, 0x67,
0xb9, 0x26, 0x1b, 0x99, 0xa3, 0xe9, 0xab, 0xfa, 0x21, 0xa7, 0x9c, 0xdd,
0x9c, 0xda, 0x25, 0xaf, 0x93, 0x4f, 0x8b, 0x29, 0x29, 0xd2, 0x90, 0x10,
0x82, 0x34, 0x2d, 0x59, 0x8d, 0xdb, 0x77, 0x15, 0x2d, 0xba, 0x8a, 0xe9,
0x68, 0x62, 0x2c, 0xd6, 0x87, 0xbd, 0x57, 0xa3, 0x26, 0xe7, 0x85, 0xd2,
0x42, 0x23, 0x21, 0x31, 0x83, 0xe0, 0x28, 0x12, 0x24, 0xfe, 0x87, 0xc6,
0x1b, 0x2f, 0x25, 0x34, 0x8a, 0xc0, 0x0f, 0xfd, 0x42, 0x07, 0x95, 0xc8,
0x10, 0x67, 0x55, 0xa1, 0xa0, 0x6d, 0x12, 0x72, 0x18, 0x04, 0xa7, 0x3d,
0xd8, 0xb6, 0x15, 0x87, 0xa9, 0x3c, 0xd6, 0x55, 0x10, 0x54, 0xa9, 0xd8,
0xd2, 0x53, 0x14, 0x49, 0xa3, 0xd4, 0xbe, 0xbf, 0x1d, 0x4a, 0x97, 0x1c,
0xa8, 0xda, 0x24, 0xeb, 0x93, 0x42, 0x99, 0x3f, 0x29, 0xa3, 0x8f, 0x63,
0x8c, 0x57, 0x30, 0x41, 0x8a, 0x07, 0x7e, 0xc8, 0x33, 0x45, 0x85, 0xbb,
0x71, 0x21, 0x33, 0x97, 0x82, 0xe3, 0x61, 0x8b, 0x32, 0xf3, 0x80, 0x4b,
0x4e, 0xd5, 0x30, 0x87, 0x7e, 0x14, 0x38, 0xce, 0x34, 0x0f, 0x7e, 0x3d,
0x24, 0xbf, 0x38, 0x97, 0x81, 0x7c, 0x17, 0x40, 0x46, 0xec, 0x8d, 0x2f,
0x13, 0xbf, 0x58, 0xdb, 0x94, 0x52, 0x14, 0x74, 0x6c, 0x03, 0xa1, 0x59,
0x15, 0x85, 0x17, 0xb3, 0x9d, 0x68, 0xda, 0x3e, 0x15, 0x5e, 0xa0, 0x41,
0xd7, 0x90, 0x13, 0xdc, 0xa0, 0xd2, 0xd1, 0xd2, 0x0f, 0xa2, 0x9c, 0x78,
0xc4, 0x5c, 0x1f, 0x86, 0x92, 0x3d, 0xab, 0xe2, 0x29, 0x42, 0x8c, 0x20,
0x99, 0x48, 0x31, 0xca, 0x86, 0x8a, 0x87, 0xfc, 0x36, 0x6b, 0x81, 0x6c,
0x79, 0xd3, 0x39, 0x3a, 0x7c, 0xb3, 0x6a, 0xdf, 0x3b, 0xb3, 0x79, 0xd5,
0x5a, 0x0c, 0x3d, 0x09, 0x77, 0xbf, 0x46, 0x17, 0x41, 0x08, 0x78, 0x26,
0x33, 0x91, 0x46, 0x8d, 0x79, 0xbc, 0x22, 0xc7, 0x4e, 0x63, 0x7e, 0x7b,
0x18, 0x41, 0x5e, 0x28, 0x86, 0xb6, 0x16, 0x16, 0x6f, 0x32, 0x96, 0x66,
0x1a, 0xda, 0x77, 0xdb, 0x9d, 0x50, 0x1a, 0xed, 0x18, 0x1d, 0x93, 0x8a,
0xdd, 0x57, 0x16, 0x16, 0x96, 0xc0, 0xdb, 0x24, 0x13, 0x31, 0x97, 0x10,
0xd4, 0x7b, 0x12, 0x1e, 0x91, 0xf7, 0xc3, 0x93, 0x25, 0x85, 0x89, 0x07,
0xab, 0xfa, 0x32, 0x4e, 0x81, 0xe4, 0x97, 0x4e, 0x39, 0xe7, 0x7c, 0xa0,
0x85, 0x86, 0x40, 0xcc, 0x77, 0xec, 0x75, 0x98, 0x45, 0x9a, 0x74, 0x5d,
0x66, 0x0a, 0x49, 0x5e, 0x72, 0x01, 0x55, 0xe0, 0x4c, 0xd8, 0x71, 0x61,
0x43, 0xa2, 0x52, 0xc5, 0x73, 0xfe, 0x33, 0xa2, 0x57, 0xc8, 0x76, 0x9a,
0x24, 0x4c, 0x5e, 0xaf, 0x7b, 0xb2, 0x19, 0x39, 0x6c, 0x80, 0x88, 0x14,
0x18, 0xbc, 0x7a, 0x6a, 0x95, 0x7b, 0x1a, 0x7c, 0x82, 0xa1, 0x99, 0xb6,
0x1b, 0x87, 0x19, 0x5d, 0x87, 0x9e, 0xe1, 0x8f, 0x17, 0xf3, 0x8b, 0x4f,
0xdf, 0x27, 0x14, 0x3b, 0x8d, 0x43, 0xda, 0x59, 0x1e, 0x2a, 0x86, 0xd5,
0xc5, 0x76, 0x30, 0x37, 0x7e, 0x4c, 0xab, 0x4d, 0x3c, 0x6e, 0x77, 0x8e,
0x97, 0x22, 0x46, 0xac, 0x72, 0x25, 0x85, 0x86, 0x4e, 0x2e, 0x6e, 0xa5,
0x74, 0x89, 0x53, 0xc2, 0x6c, 0x39, 0x64, 0x6b, 0x58, 0xd8, 0x6b, 0xba,
0x53, 0xd0, 0x5d, 0x0e, 0x6c, 0xe1, 0x43, 0xfb, 0x61, 0xae, 0x70, 0x4d,
0x34, 0xcd, 0x66, 0x6a, 0x73, 0xad, 0x26, 0x58, 0x6a, 0xe5, 0x78, 0x2f,
0x19, 0x79, 0x78, 0x34, 0x83, 0x46, 0x19, 0xc1, 0x85, 0xca, 0x91, 0xd3,
0x1c, 0x07, 0x91, 0x24, 0x9a, 0x9c, 0x1d, 0x4c, 0x1c, 0xac, 0x76, 0xeb,
0xe3, 0x1f, 0x1a, 0xc8, 0x7b, 0x39, 0xe4, 0x16, 0x15, 0xb7, 0x82, 0x21,
0xe7, 0x7b, 0x2b, 0x65, 0x7a, 0xc7, 0xc7, 0xe9, 0x3d, 0x52, 0x72, 0xa2,
0xab, 0x4f, 0x4b, 0x36, 0x6c, 0x41, 0x96, 0x61, 0x55, 0x75, 0x68, 0x79,
0x85, 0x05, 0x5c, 0xff, 0x66, 0x13, 0x74, 0x70, 0x63, 0x6c, 0x64, 0x67,
0x64, 0x98, 0x67, 0x71, 0x65, 0x42, 0x54, 0x49, 0x6a, 0xf8, 0x68, 0x11,
0x45, 0x62, 0x6e, 0xf0, 0x6b, 0xc1, 0x36, 0x6f, 0x72, 0xd0, 0x6f, 0x2a,
0x28, 0x50, 0x75, 0xf8, 0x73, 0x7d, 0x1a, 0x52, 0x82, 0xe8, 0x80, 0x03,
0x1b, 0xaa, 0x8e, 0xe5, 0x8a, 0xdd, 0x1c, 0xfb, 0x9c, 0xff, 0x98, 0xbf,
0x1f, 0x8a, 0x23, 0xe9, 0x65, 0xe5, 0xe1, 0x73, 0x24, 0x62, 0x6a, 0x7d,
0xe3, 0x8d, 0x26, 0x86, 0x73, 0x11, 0xea, 0xac, 0x3c, 0x3a, 0x6c, 0x5b,
0xca, 0x31, 0x4e, 0x80, 0x66, 0x34, 0xab, 0xca, 0x5b, 0xd8, 0x61, 0xdf,
0x96, 0xb1, 0x65, 0x8e, 0x5f, 0x71, 0x85, 0x68, 0x6b, 0xc9, 0x5e, 0x28,
0x75, 0x0d, 0x70, 0xa7, 0x5d, 0x44, 0x64, 0xc2, 0x74, 0xb1, 0x5d, 0x22,
0x54, 0xac, 0x78, 0x7d, 0x60, 0x3a, 0x45, 0xe2, 0x7b, 0xe4, 0x64, 0x1d,
0x37, 0x7f, 0x7f, 0x30, 0x68, 0x4d, 0x29, 0xf6, 0x81, 0x9a, 0x6d, 0x18,
0x1d, 0x06, 0x8f, 0x2c, 0x79, 0x8d, 0x1e, 0x3e, 0x99, 0xb4, 0x82, 0xb0,
0x1e, 0x60, 0xa7, 0xcc, 0x91, 0x5f, 0x20, 0x32, 0x2b, 0xc8, 0x30, 0x3d,
0xd1, 0x4d, 0x2e, 0x91, 0x54, 0x36, 0xe2, 0x18, 0x3a, 0x40, 0x5f, 0xdb,
0xef, 0x9f, 0x4f, 0xf5, 0x5d, 0x40, 0xcd, 0xf9, 0x61, 0xbd, 0x5a, 0x29,
0xac, 0x3b, 0x6c, 0xa8, 0x58, 0x56, 0x97, 0xc4, 0x74, 0x56, 0x57, 0x0c,
0x87, 0x29, 0x78, 0xc0, 0x56, 0x59, 0x78, 0x3b, 0x7d, 0x5b, 0x54, 0xc7,
0x66, 0x85, 0x81, 0x15, 0x53, 0xa7, 0x55, 0x98, 0x85, 0x1c, 0x56, 0x3f,
0x46, 0x2e, 0x88, 0x05, 0x59, 0xb3, 0x37, 0xe8, 0x8a, 0x7a, 0x5d, 0x68,
0x2a, 0xb3, 0x8c, 0x87, 0x64, 0xd3, 0x1f, 0x37, 0x98, 0xd0, 0x70, 0x07,
0x1f, 0x5f, 0xa4, 0xb0, 0x79, 0x35, 0x1e, 0xfa, 0xad, 0xf7, 0x83, 0x4f,
0x1f, 0xfb, 0x2b, 0xc3, 0x30, 0x26, 0xd1, 0x75, 0x2c, 0xfe, 0x2e, 0x97,
0xd2, 0x7b, 0x57, 0x0d, 0x4b, 0x13, 0xf7, 0xb0, 0x67, 0xe1, 0x4d, 0x9e,
0xd3, 0xb5, 0x76, 0x03, 0x4e, 0x8b, 0xb0, 0x32, 0x7d, 0x14, 0x4f, 0x34,
0x9b, 0xbf, 0x81, 0x39, 0x4e, 0x54, 0x8b, 0x16, 0x85, 0x57, 0x4d, 0x2a,
0x7a, 0xaf, 0x89, 0xe2, 0x4a, 0x80, 0x68, 0x61, 0x8d, 0x38, 0x49, 0x49,
0x57, 0xa6, 0x90, 0x77, 0x4a, 0x0e, 0x47, 0xb4, 0x93, 0x62, 0x4c, 0xc9,
0x38, 0x0c, 0x95, 0x9c, 0x50, 0x83, 0x2b, 0x1f, 0x97, 0xb8, 0x55, 0xa3,
0x1e, 0x9b, 0xa2, 0xca, 0x63, 0x1b, 0x1f, 0x9d, 0xad, 0x3f, 0x6f, 0x1d,
0x1d, 0x45, 0xb2, 0xb3, 0x77, 0x4f, 0x1d, 0xff, 0x2c, 0xef, 0x2e, 0x69,
0xd2, 0x5f, 0x2d, 0x30, 0x2e, 0x74, 0xd2, 0x8a, 0x71, 0x63, 0x3a, 0x03,
0xff, 0xff, 0x82, 0xdf, 0x3d, 0xf9, 0xdb, 0xfe, 0x8a, 0xf2, 0x42, 0x90,
0xbc, 0x4d, 0x8d, 0x7c, 0x44, 0xa8, 0xa3, 0xc3, 0x8f, 0x26, 0x44, 0xe2,
0x91, 0xc8, 0x93, 0x59, 0x42, 0xcd, 0x7e, 0xb7, 0x96, 0xfc, 0x3f, 0x57,
0x6c, 0x13, 0x99, 0x96, 0x3d, 0xab, 0x5b, 0x35, 0x9b, 0xe9, 0x3c, 0x38,
0x4a, 0x8c, 0x9e, 0x92, 0x3b, 0x3a, 0x39, 0x12, 0xa1, 0x9b, 0x3d, 0x89,
0x29, 0x69, 0xa3, 0xf8, 0x42, 0x10, 0x1a, 0x81, 0xad, 0xb7, 0x53, 0x55,
0x1c, 0xbf, 0xb4, 0x1e, 0x5e, 0x85, 0x19, 0xe0, 0xbc, 0x9a, 0x6d, 0xe2,
0x1a, 0x35, 0x2c, 0xa9, 0x2f, 0x2d, 0xd0, 0xba, 0x76, 0xd1, 0x2c, 0x60,
0xea, 0xbe, 0x88, 0xe7, 0x2c, 0x93, 0xe7, 0xdc, 0x9f, 0x1f, 0x30, 0xf4,
0xe7, 0x16, 0xa2, 0x50, 0x34, 0x23, 0xcc, 0x66, 0xa0, 0xb7, 0x37, 0xac,
0xb1, 0x90, 0xa0, 0x34, 0x38, 0x0d, 0x9b, 0xf3, 0xa3, 0x1c, 0x35, 0x9a,
0x85, 0x73, 0xa5, 0x50, 0x33, 0x78, 0x71, 0xc6, 0xa6, 0xf5, 0x31, 0xae,
0x5f, 0xee, 0xa8, 0x8b, 0x2f, 0xd0, 0x4e, 0x8b, 0xab, 0xf1, 0x2a, 0xb6,
0x3b, 0x70, 0xaf, 0x61, 0x27, 0x37, 0x27, 0x90, 0xb9, 0x77, 0x2d, 0x2d,
0x1d, 0x24, 0xc2, 0x37, 0x40, 0xa9, 0x1e, 0x32, 0xc5, 0x9c, 0x52, 0x36,
0x1f, 0x92, 0xc6, 0xb6, 0x61, 0xb5, 0x1f, 0x60, 0x7f, 0x38, 0x29, 0x91,
0xe5, 0x5d, 0x8c, 0xad, 0x29, 0x43, 0xe2, 0x2b, 0x9b, 0x4b, 0x29, 0xd8,
0xdf, 0xf8, 0xab, 0x06, 0x29, 0x6f, 0xdd, 0x32, 0xba, 0xb1, 0x24, 0xeb,
0xdc, 0x71, 0xb8, 0xee, 0x26, 0xc9, 0xc3, 0x80, 0xb7, 0x15, 0x26, 0xe1,
0xa9, 0xe9, 0xb6, 0xdc, 0x25, 0x54, 0x90, 0x4d, 0xb6, 0xcc, 0x24, 0x25,
0x7a, 0x34, 0xb6, 0x5b, 0x23, 0x1f, 0x66, 0x11, 0xb6, 0xf1, 0x1f, 0xf1,
0x53, 0x40, 0xb9, 0xa8, 0x19, 0x75, 0x3e, 0x01, 0xbd, 0x7c, 0x12, 0xb9,
0x28, 0xf4, 0xc7, 0x6e, 0x26, 0x71, 0x26, 0xd2, 0xc8, 0xb5, 0x2a, 0x53,
0x26, 0xfc, 0xc9, 0x4a, 0x3f, 0x7b, 0x23, 0xc8, 0xc9, 0xbe, 0x52, 0x16,
0x22, 0xe8, 0x8d, 0x88, 0x28, 0x45, 0xe0, 0x7a, 0x9e, 0x2b, 0x28, 0xd7,
0xde, 0x07, 0xa9, 0x1e, 0x28, 0x81, 0xdc, 0x16, 0xb5, 0x30, 0x27, 0x14,
0xdb, 0xae, 0xc5, 0x2c, 0x21, 0xe7, 0xdb, 0xf2, 0xcd, 0xde, 0x1e, 0x6d,
0xd0, 0x83, 0xca, 0x96, 0x1f, 0x38, 0xb7, 0x72, 0xca, 0x9e, 0x1d, 0x06,
0x9d, 0xb5, 0xc9, 0x34, 0x1d, 0x50, 0x84, 0x3d, 0xc8, 0x01, 0x1e, 0x2d,
0x70, 0x53, 0xc8, 0xf2, 0x1e, 0x58, 0x5d, 0x0d, 0xc9, 0x88, 0x1c, 0xd5,
0x4b, 0x0e, 0xcb, 0x13, 0x1b, 0x74, 0x2f, 0xcf, 0xcb, 0x36, 0x27, 0x3a,
0x2a, 0x11, 0xcb, 0x16, 0x29, 0xe7, 0x29, 0x2b, 0xcb, 0x02, 0x2b, 0x63,
0x28, 0xb1, 0xca, 0xf5, 0x2c, 0x53, 0x28, 0x65, 0xa0, 0x31, 0x28, 0x72,
0xdd, 0x1c, 0xa7, 0xd0, 0x28, 0x38, 0xdb, 0xc0, 0xae, 0xd8, 0x27, 0x3e,
0xda, 0xb8, 0xc3, 0xb6, 0x23, 0xe6, 0xdd, 0x1f, 0xd3, 0x70, 0x1f, 0x48,
0xdd, 0x5d, 0xd0, 0xfd, 0x21, 0x03, 0xcf, 0x6e, 0xd1, 0xbb, 0x20, 0x11,
0xbc, 0xc1, 0xd1, 0xd2, 0x1d, 0x76, 0xa4, 0x9c, 0xd0, 0x10, 0x1e, 0x05,
0x8a, 0x84, 0xcd, 0xd7, 0x20, 0x20, 0x77, 0x1b, 0xcd, 0x26, 0x21, 0x09,
0x64, 0x14, 0xcd, 0x6b, 0x21, 0x4a, 0x53, 0xb1, 0xce, 0xa6, 0x1e, 0x5a,
0x38, 0x71, 0xcc, 0x88, 0x27, 0x31, 0x2b, 0x69, 0xcc, 0x22, 0x29, 0x3f,
0x2a, 0x64, 0xcb, 0xe1, 0x2a, 0x90, 0x29, 0xc3, 0xcb, 0xb4, 0x2b, 0x7a,
0x29, 0x57, 0x1e, 0xe1, 0xad, 0xdb, 0xb9, 0x26, 0x20, 0xf0, 0xad, 0x2c,
0xb1, 0x62, 0x21, 0x1e, 0xad, 0x1d, 0xaf, 0xe1, 0x22, 0x48, 0xaf, 0xea,
0xad, 0x45, 0x22, 0x63, 0xb3, 0x4b, 0xaa, 0xe7, 0x23, 0x2c, 0xab, 0x21,
0x9d, 0xae, 0x27, 0x3b, 0xa8, 0x5e, 0x96, 0x8b, 0x27, 0x99, 0xa7, 0x76,
0x93, 0xdc, 0x28, 0xc0, 0xa7, 0x02, 0x88, 0x79, 0x29, 0xf3, 0xa5, 0xd8,
0x7e, 0xe6, 0x29, 0x80, 0xa5, 0x47, 0x75, 0x2d, 0x25, 0xe6, 0xa5, 0x2e,
0x65, 0xd0, 0x18, 0x93, 0xa5, 0x97, 0x45, 0x55, 0x1e, 0x0c, 0xbc, 0xd5,
0x28, 0xdf, 0x23, 0x85, 0xc3, 0x5c, 0x28, 0x32, 0x26, 0x8a, 0xc6, 0xbf,
0x27, 0xcf, 0x28, 0x26, 0xc7, 0x2e, 0x27, 0x0d, 0x1d, 0x26, 0xae, 0x18,
0xc5, 0xea, 0x1d, 0x81, 0xae, 0x2d, 0xbe, 0x86, 0x20, 0xcf, 0xac, 0xba,
0xb1, 0x3a, 0x21, 0x0a, 0xac, 0x8f, 0xaf, 0x1e, 0x22, 0x7b, 0xaf, 0x2b,
0xab, 0x3c, 0x21, 0xb5, 0xb0, 0xb4, 0xa7, 0x3d, 0x23, 0x7c, 0xa9, 0x6c,
0x99, 0x83, 0x27, 0x46, 0xa6, 0xd1, 0x93, 0x9d, 0x27, 0xe8, 0xa6, 0x2b,
0x88, 0xba, 0x29, 0xda, 0xa4, 0xdb, 0x7e, 0x6e, 0x29, 0x06, 0xa3, 0x14,
0x71, 0x02, 0x25, 0x39, 0xa3, 0x05, 0x62, 0xcd, 0x16, 0x95, 0xa1, 0xcb,
0x40, 0x7a, 0x1a, 0xf0, 0xa6, 0x53, 0x25, 0x0d, 0x22, 0x0b, 0xb1, 0x3e,
0x23, 0x01, 0x25, 0xe8, 0xbb, 0x2f, 0x23, 0x4f, 0x27, 0xfa, 0xbd, 0xea,
0x22, 0xc0, 0x17, 0xbe, 0xb7, 0xad, 0xd9, 0x4b, 0x1c, 0xe0, 0xad, 0x7c,
0xc5, 0xaf, 0x1d, 0x28, 0xad, 0x73, 0xbe, 0xd4, 0x1e, 0xb1, 0xac, 0x62,
0xb3, 0x17, 0x20, 0xdf, 0xab, 0x53, 0xad, 0x70, 0x22, 0x66, 0xab, 0xa7,
0xa6, 0x4c, 0x23, 0xec, 0xa5, 0xe3, 0x9b, 0xc3, 0x23, 0xed, 0xa1, 0xc2,
0x90, 0x14, 0x29, 0x97, 0x9c, 0xd1, 0x84, 0x69, 0x2d, 0x55, 0x98, 0x71,
0x76, 0xcf, 0x2b, 0x5c, 0x95, 0xc2, 0x66, 0xcf, 0x1f, 0xc2, 0x96, 0x78,
0x4f, 0xd8, 0x16, 0xb0, 0x99, 0x28, 0x36, 0x67, 0x1a, 0x2c, 0x99, 0xcd,
0x1e, 0x2b, 0x22, 0x2a, 0xa1, 0x77, 0x1b, 0xf2, 0x26, 0xb8, 0xab, 0x1a,
0x1c, 0x68, 0x29, 0xd2, 0xb1, 0xd1, 0x1e, 0x04, 0x17, 0xe9, 0xae, 0x66,
0xda, 0xfa, 0x16, 0x2b, 0xb4, 0x3f, 0xd8, 0xde, 0x1c, 0x5c, 0xac, 0x52,
0xc5, 0x3f, 0x1c, 0x77, 0xab, 0xe2, 0xbe, 0x40, 0x1d, 0xbd, 0xaa, 0x2e,
0xb2, 0xde, 0x25, 0x4a, 0xa3, 0x09, 0xa3, 0x6f, 0x28, 0xfb, 0x9e, 0x16,
0x96, 0xb4, 0x2d, 0x76, 0x9a, 0xf7, 0x8b, 0xe9, 0x31, 0x14, 0x96, 0x33,
0x7e, 0xe6, 0x32, 0x70, 0x93, 0x16, 0x70, 0xd0, 0x31, 0x1d, 0x8f, 0xfd,
0x60, 0x40, 0x2b, 0xb5, 0x8f, 0x72, 0x48, 0x20, 0x25, 0x3b, 0x8d, 0x8d,
0x2d, 0xd5, 0x25, 0xd7, 0x8c, 0x9c, 0x15, 0xee, 0x27, 0x4c, 0x94, 0xb8,
0x11, 0x51, 0x41, 0xce, 0x9d, 0x77, 0x0f, 0x40, 0x62, 0xd0, 0xaa, 0x32,
0x11, 0x45, 0x19, 0x92, 0xab, 0x0d, 0xdb, 0xc8, 0x17, 0xc1, 0xac, 0x7c,
0xda, 0x0d, 0x13, 0xaa, 0xaf, 0x57, 0xd7, 0x51, 0x17, 0x68, 0xaa, 0x69,
0xc6, 0x0b, 0x1d, 0x1d, 0xa3, 0xa4, 0xb7, 0x00, 0x28, 0xa8, 0x9d, 0xd8,
0xa4, 0x53, 0x2e, 0xbb, 0x97, 0xdf, 0x95, 0x5c, 0x33, 0xc2, 0x92, 0xaa,
0x86, 0xa5, 0x37, 0x2b, 0x8e, 0x24, 0x78, 0xdc, 0x38, 0x1a, 0x8a, 0xb1,
0x69, 0xb3, 0x37, 0xaa, 0x87, 0xff, 0x56, 0xd5, 0x36, 0xe1, 0x87, 0x04,
0x40, 0x1c, 0x39, 0x93, 0x87, 0xb7, 0x2a, 0xba, 0x3c, 0xe3, 0x86, 0xf3,
0x16, 0x6a, 0x4a, 0x35, 0x91, 0x8b, 0x13, 0x7a, 0x5d, 0x25, 0x9c, 0x5d,
0x14, 0x3b, 0x6b, 0xf5, 0xa7, 0xaf, 0x14, 0x53, 0x19, 0xe9, 0xa0, 0xfd,
0xdd, 0x22, 0x1a, 0xc9, 0xa3, 0x6a, 0xda, 0x68, 0x17, 0x6a, 0xa6, 0xc5,
0xd7, 0xe0, 0x0f, 0x2d, 0xa6, 0x8c, 0xcf, 0xcb, 0x21, 0xac, 0x9d, 0x17,
0xb8, 0x38, 0x2f, 0x83, 0x94, 0x72, 0xa2, 0xbb, 0x36, 0xae, 0x8e, 0x8b,
0x91, 0x1b, 0x3c, 0x38, 0x8a, 0x13, 0x82, 0x82, 0x40, 0xcf, 0x85, 0x49,
0x73, 0x7d, 0x42, 0xa5, 0x82, 0x89, 0x62, 0x4f, 0x44, 0x52, 0x80, 0x4b,
0x4e, 0x56, 0x48, 0x42, 0x80, 0xb2, 0x3a, 0x15, 0x4e, 0x5e, 0x83, 0x05,
0x2b, 0x3e, 0x55, 0x1e, 0x83, 0x55, 0x19, 0x8a, 0x63, 0xfe, 0x8d, 0xe5,
0x16, 0x82, 0x70, 0x6e, 0x98, 0x34, 0x17, 0x6a, 0x7c, 0x65, 0xa1, 0x9a,
0x1b, 0xb1, 0x1a, 0xc5, 0x97, 0x83, 0xe0, 0x74, 0x1b, 0x38, 0x99, 0xb0,
0xdd, 0xdb, 0x18, 0x89, 0x9d, 0x1d, 0xdb, 0x36, 0x1b, 0x04, 0x9b, 0x57,
0xcf, 0x31, 0x2b, 0xa9, 0x92, 0x54, 0xb7, 0xe9, 0x38, 0x89, 0x8a, 0x76,
0xa2, 0x06, 0x42, 0x12, 0x85, 0x0a, 0x8f, 0x6c, 0x48, 0xd9, 0x80, 0xf4,
0x7e, 0xa2, 0x4e, 0x14, 0x7d, 0x93, 0x6e, 0xfd, 0x52, 0x42, 0x7b, 0x55,
0x5e, 0x47, 0x55, 0xdc, 0x7a, 0x6f, 0x4b, 0xee, 0x5a, 0x62, 0x7c, 0x76,
0x3a, 0xbc, 0x5f, 0xca, 0x7f, 0x84, 0x2c, 0xe5, 0x66, 0xcf, 0x82, 0x3c,
0x1f, 0x22, 0x6f, 0xf6, 0x8c, 0x3d, 0x19, 0x42, 0x7c, 0xd3, 0x97, 0xa0,
0x1a, 0xc5, 0x8d, 0x80, 0xa1, 0xeb, 0x1d, 0x69, 0x1d, 0xee, 0x8b, 0x1c,
0xe2, 0xc7, 0x1d, 0x6e, 0x8f, 0xd3, 0xe2, 0x39, 0x1c, 0xb2, 0x93, 0x60,
0xe1, 0x42, 0x27, 0x20, 0x8f, 0x74, 0xd0, 0x3d, 0x37, 0xfb, 0x86, 0xdc,
0xb6, 0x5e, 0x44, 0xf8, 0x80, 0x1d, 0xa1, 0xac, 0x4f, 0x58, 0x7a, 0xfc,
0x8f, 0x3f, 0x56, 0xc8, 0x77, 0xdb, 0x7d, 0xd6, 0x5c, 0xe6, 0x75, 0x7f,
0x6d, 0xb4, 0x61, 0xbc, 0x74, 0xca, 0x5c, 0xc0, 0x66, 0x00, 0x75, 0xc8,
0x4c, 0x6a, 0x6a, 0x2f, 0x78, 0xa7, 0x3c, 0xcd, 0x6e, 0x67, 0x7b, 0xde,
0x2e, 0x64, 0x73, 0x88, 0x7f, 0xff, 0x20, 0x36, 0x7c, 0x19, 0x87, 0xea,
0x19, 0xf4, 0x89, 0x03, 0x95, 0xb5, 0x1c, 0x7f, 0x97, 0x78, 0xa2, 0x5c,
0x1e, 0x41, 0x20, 0x54, 0x7b, 0x2f, 0xe5, 0xd1, 0x22, 0x09, 0x7f, 0x0a,
0xe5, 0x9b, 0x26, 0x1f, 0x84, 0xe2, 0xe5, 0x75, 0x36, 0x87, 0x82, 0xee,
0xd1, 0x8c, 0x47, 0x70, 0x7b, 0x09, 0xb6, 0x60, 0x54, 0xa1, 0x74, 0xd5,
0xa1, 0x48, 0x5e, 0x5b, 0x71, 0x3f, 0x8f, 0x02, 0x66, 0x48, 0x6f, 0x53,
0x7e, 0x57, 0x6c, 0xf9, 0x6d, 0xf4, 0x6e, 0x28, 0x70, 0x5b, 0x6e, 0x13,
0x5d, 0x0d, 0x74, 0x16, 0x70, 0x61, 0x4d, 0x72, 0x77, 0xad, 0x73, 0xb6,
0x3e, 0x8f, 0x7b, 0x6a, 0x77, 0xb1, 0x30, 0x57, 0x7e, 0xe2, 0x7b, 0x7b,
0x21, 0xfc, 0x86, 0x4c, 0x82, 0xb6, 0x1b, 0x2d, 0x94, 0x53, 0x90, 0x60,
0x1e, 0x23, 0xa0, 0x5c, 0x9b, 0x11, 0x20, 0x28, 0x26, 0xa0, 0x6b, 0x2a,
0xe5, 0x16, 0x29, 0x6b, 0x70, 0x63, 0xe8, 0x6a, 0x33, 0x72, 0x74, 0x3f,
0xe6, 0xdb, 0x49, 0x1b, 0x74, 0x78, 0xd2, 0xfb, 0x59, 0x21, 0x6e, 0xb2,
0xb6, 0xfc, 0x65, 0xd0, 0x6a, 0x86, 0xa1, 0x22, 0x6f, 0x4d, 0x68, 0xa9,
0x8f, 0xc8, 0x75, 0x5d, 0x67, 0x7a, 0x7f, 0x30, 0x7a, 0x28, 0x66, 0xd7,
0x6e, 0x34, 0x7e, 0x2b, 0x66, 0x70, 0x5d, 0xcb, 0x81, 0xad, 0x68, 0x3f,
0x4e, 0x33, 0x84, 0xf4, 0x6b, 0xea, 0x3f, 0x5f, 0x88, 0x29, 0x70, 0x20,
0x31, 0x99, 0x8a, 0xd5, 0x74, 0x91, 0x24, 0x09, 0x92, 0x6d, 0x7d, 0x1e,
0x1e, 0x49, 0x9e, 0x8e, 0x87, 0x3f, 0x1f, 0x0b, 0xab, 0xf3, 0x94, 0x15,
0x21, 0x1c, 0x2b, 0xd5, 0x30, 0x47, 0xd1, 0x59, 0x33, 0x21, 0x5a, 0x64,
0xe6, 0x71, 0x47, 0x68, 0x65, 0x71, 0xed, 0x39, 0x5d, 0xbe, 0x65, 0xdc,
0xd5, 0xcf, 0x6c, 0xc0, 0x63, 0x16, 0xb8, 0x37, 0x76, 0xf5, 0x61, 0x9c,
0xa2, 0x52, 0x7e, 0x92, 0x60, 0x74, 0x91, 0x72, 0x82, 0xc5, 0x5f, 0x9b,
0x82, 0x08, 0x87, 0x41, 0x5e, 0x2a, 0x6f, 0xaa, 0x8b, 0x4f, 0x5d, 0x64,
0x5e, 0xb7, 0x8e, 0xf5, 0x5e, 0xfb, 0x4e, 0xaa, 0x91, 0xa7, 0x62, 0x48,
0x3f, 0xfa, 0x94, 0x3b, 0x66, 0xd5, 0x32, 0x74, 0x96, 0x50, 0x6b, 0x3c,
0x25, 0xba, 0x9d, 0x28, 0x74, 0x02, 0x1f, 0x29, 0xa9, 0xbc, 0x7d, 0xc8,
0x1f, 0xbc, 0xb2, 0xbb, 0x89, 0x11, 0x1f, 0xc7, 0x2b, 0xd0, 0x30, 0x30,
0xd1, 0x80, 0x2d, 0x18, 0x2e, 0xaa, 0xd2, 0x92, 0x63, 0x62, 0x53, 0xba,
0xf1, 0xeb, 0x75, 0xa8, 0x57, 0xbd, 0xda, 0xe2, 0x81, 0x22, 0x58, 0x26,
0xbd, 0x58, 0x87, 0x93, 0x58, 0xbc, 0xa7, 0x31, 0x8b, 0xc5, 0x58, 0x0f,
0x95, 0xb2, 0x90, 0x20, 0x56, 0xe8, 0x84, 0x48, 0x94, 0x6d, 0x54, 0x43,
0x71, 0x94, 0x97, 0xbe, 0x53, 0x0e, 0x60, 0x39, 0x9b, 0x1a, 0x53, 0xde,
0x50, 0x6a, 0x9d, 0xf4, 0x56, 0x9e, 0x40, 0x87, 0x9f, 0xcb, 0x5a, 0x7f,
0x33, 0xa2, 0xa1, 0x77, 0x5f, 0x66, 0x26, 0x34, 0xa8, 0x43, 0x67, 0xe3,
0x1e, 0xd4, 0xaf, 0xb5, 0x72, 0x71, 0x1d, 0x80, 0xb7, 0xd3, 0x7c, 0x17,
0x1e, 0x1e, 0x2c, 0xfc, 0x2e, 0x73, 0xd2, 0x6a, 0x2d, 0x4a, 0x2e, 0x87,
0xd2, 0xa2, 0x7d, 0x88, 0x40, 0xea, 0xf9, 0x73, 0x92, 0x22, 0x49, 0x0a,
0xe5, 0x5b, 0x98, 0x73, 0x4c, 0x9d, 0xc8, 0xbd, 0x98, 0x2c, 0x4e, 0xea,
0xaf, 0x48, 0x99, 0xb5, 0x4f, 0x23, 0x9c, 0xb1, 0x9e, 0x0d, 0x4c, 0xae,
0x88, 0x25, 0xa1, 0xfa, 0x49, 0x58, 0x74, 0x58, 0xa4, 0x8c, 0x47, 0x97,
0x63, 0x4f, 0xa7, 0x13, 0x46, 0xe3, 0x52, 0x84, 0xa9, 0xd7, 0x46, 0xbb,
0x41, 0x7e, 0xac, 0x1c, 0x4a, 0x59, 0x31, 0x5e, 0xae, 0x95, 0x4d, 0x00,
0x22, 0x22, 0xb3, 0xc3, 0x54, 0x4b, 0x19, 0xe0, 0xbc, 0xf1, 0x63, 0x8d,
0x17, 0xa1, 0xc3, 0x84, 0x70, 0xad, 0x1a, 0xe2, 0x2c, 0xb4, 0x2f, 0x37,
0xd0, 0xc6, 0x7e, 0x2e, 0x2f, 0xb4, 0xed, 0xd9, 0x8a, 0x9f, 0x34, 0x4f,
0xea, 0x83, 0xab, 0xb4, 0x3b, 0xa9, 0xf1, 0x72, 0xae, 0x24, 0x3e, 0xca,
0xd7, 0x1a, 0xab, 0x78, 0x42, 0xea, 0xbb, 0xf1, 0xaa, 0x80, 0x43, 0x17,
0xa6, 0x4f, 0xae, 0x1d, 0x3e, 0xfe, 0x8e, 0x90, 0xb0, 0x4b, 0x3b, 0x8b,
0x79, 0x6f, 0xb2, 0x76, 0x38, 0xe4, 0x67, 0x69, 0xb4, 0x78, 0x36, 0xd0,
0x56, 0x78, 0xb7, 0x5f, 0x33, 0xcc, 0x43, 0xe2, 0xbb, 0x18, 0x31, 0x3c,
0x2e, 0xdc, 0xbd, 0xf4, 0x33, 0xc6, 0x1c, 0xb8, 0xc5, 0xdb, 0x47, 0x12,
0x20, 0x8d, 0xc7, 0xba, 0x57, 0x9f, 0x21, 0x0e, 0xc8, 0x63, 0x66, 0x37,
0x20, 0x3a, 0x82, 0x07, 0x2b, 0x91, 0xe7, 0x88, 0x8f, 0xd9, 0x2b, 0xa0,
0xe4, 0xcd, 0xa1, 0x62, 0x2c, 0xd8, 0xe3, 0x02, 0xb2, 0x13, 0x2e, 0x04,
0xe2, 0x74, 0xc5, 0xff, 0x2f, 0xcf, 0xe6, 0xd3, 0xc4, 0x3e, 0x30, 0x3f,
0xce, 0xa5, 0xc2, 0x5f, 0x30, 0x34, 0xb4, 0xd9, 0xc2, 0x4a, 0x2e, 0x2c,
0x9a, 0x8d, 0xc2, 0x44, 0x2c, 0x29, 0x83, 0x36, 0xc2, 0x50, 0x29, 0xe5,
0x6e, 0x2e, 0xc3, 0x3a, 0x26, 0xaf, 0x5a, 0xdf, 0xc5, 0xaf, 0x20, 0xea,
0x45, 0x90, 0xc9, 0x49, 0x1b, 0x5a, 0x30, 0x5a, 0xca, 0xde, 0x2a, 0x13,
0x28, 0xe8, 0xca, 0xd1, 0x2c, 0xbe, 0x28, 0x27, 0xca, 0xaf, 0x45, 0xab,
0x24, 0xbe, 0xcb, 0x6f, 0x57, 0x4b, 0x23, 0xc4, 0x92, 0xa4, 0x29, 0xeb,
0xe1, 0x9d, 0xa2, 0x41, 0x2a, 0x9a, 0xdf, 0xc3, 0xad, 0xf7, 0x2a, 0xad,
0xde, 0xa6, 0xc0, 0x34, 0x2a, 0x26, 0xe0, 0x49, 0xcc, 0xa9, 0x26, 0xf4,
0xe1, 0xee, 0xda, 0x59, 0x1e, 0x21, 0xdf, 0x55, 0xd7, 0xf1, 0x1d, 0xf2,
0xc3, 0x7e, 0xd7, 0x2a, 0x1c, 0x9b, 0xa7, 0x91, 0xd1, 0x97, 0x1f, 0xb5,
0x89, 0xb5, 0xce, 0xf2, 0x21, 0x53, 0x74, 0xc8, 0xce, 0x23, 0x21, 0xe3,
0x61, 0x7a, 0xce, 0x82, 0x20, 0x3a, 0x4e, 0x3b, 0xcf, 0xe9, 0x1f, 0xac,
0x32, 0xcb, 0xcc, 0xe2, 0x28, 0xd0, 0x2b, 0x43, 0xcc, 0x42, 0x2b, 0x06,
0x2a, 0x02, 0xcb, 0xe9, 0x2c, 0x40, 0x29, 0x56, 0xcb, 0xb1, 0x2d, 0x09,
0x28, 0xea, 0xa1, 0xc9, 0x29, 0xaa, 0xde, 0x8b, 0xab, 0xf5, 0x29, 0xa1,
0xdd, 0x6c, 0xb3, 0x88, 0x29, 0x42, 0xdd, 0x9a, 0xc6, 0xa8, 0x26, 0x7c,
0xdf, 0xf7, 0xd9, 0xb6, 0x23, 0x21, 0xe1, 0xd2, 0xd6, 0x89, 0x23, 0xd3,
0xd4, 0xf2, 0xd6, 0x5e, 0x23, 0x74, 0xc0, 0xd2, 0xd6, 0x4d, 0x21, 0x53,
0xa8, 0x69, 0xd3, 0xb9, 0x22, 0x24, 0x8d, 0xa1, 0xd1, 0x1a, 0x23, 0x2c,
0x79, 0x72, 0xd0, 0x1e, 0x23, 0x63, 0x66, 0x11, 0xd0, 0x2c, 0x23, 0x6b,
0x55, 0x59, 0xd1, 0x2c, 0x20, 0xa4, 0x3a, 0x7f, 0xcd, 0xb6, 0x28, 0x50,
0x2c, 0x40, 0xcd, 0x0b, 0x2a, 0x1d, 0x2b, 0x0a, 0xcc, 0x9d, 0x2b, 0x45,
0x2a, 0x4a, 0xcc, 0x53, 0x2c, 0x13, 0x29, 0xc8, 0x1e, 0x58, 0xc1, 0x4b,
0xd5, 0xe6, 0x21, 0x4f, 0xaf, 0x15, 0xb3, 0x58, 0x21, 0x84, 0xaf, 0x4c,
0xb2, 0x1d, 0x22, 0xde, 0xb3, 0x78, 0xaf, 0xc5, 0x22, 0xbc, 0xb6, 0xda,
0xae, 0x2d, 0x23, 0x05, 0xb6, 0xe9, 0xa8, 0x2e, 0x27, 0x70, 0xaa, 0xfa,
0x98, 0xb3, 0x27, 0xda, 0xaa, 0x57, 0x95, 0xb5, 0x2a, 0x54, 0xad, 0x50,
0x8d, 0x05, 0x2a, 0xd1, 0xa7, 0xdc, 0x7f, 0x38, 0x29, 0x94, 0xa7, 0x11,
0x75, 0xa8, 0x26, 0x4b, 0xa7, 0x43, 0x67, 0x02, 0x19, 0xe9, 0xa9, 0xa9,
0x47, 0x0c, 0x21, 0x9b, 0xc7, 0x81, 0x2b, 0x7e, 0x24, 0xe8, 0xc7, 0xfa,
0x29, 0x75, 0x27, 0x14, 0xc8, 0x43, 0x28, 0x3b, 0x28, 0x9c, 0xc8, 0x76,
0x27, 0x6a, 0x1e, 0x38, 0xc0, 0xb0, 0xd7, 0x22, 0x1e, 0x2c, 0xc0, 0x98,
0xd5, 0x24, 0x1f, 0xe2, 0xaf, 0x63, 0xb4, 0x96, 0x21, 0x97, 0xaf, 0x91,
0xb2, 0x33, 0x23, 0x1b, 0xb4, 0x00, 0xaf, 0x0f, 0x22, 0x46, 0xb6, 0x6b,
0xac, 0x6a, 0x24, 0x3a, 0xb5, 0x1b, 0xa3, 0x5c, 0x27, 0xa9, 0xab, 0x2b,
0x97, 0x31, 0x2a, 0x40, 0xac, 0x09, 0x8d, 0xc6, 0x2a, 0xd6, 0xa8, 0x91,
0x7f, 0xff, 0x29, 0x3a, 0xa6, 0xcf, 0x72, 0xb4, 0x25, 0xea, 0xa6, 0x9a,
0x64, 0xd3, 0x18, 0xb3, 0xa8, 0x12, 0x43, 0x1b, 0x1f, 0xc3, 0xbb, 0xcc,
0x28, 0x3f, 0x25, 0x19, 0xc2, 0x20, 0x26, 0x8b, 0x28, 0x74, 0xc6, 0xae,
0x26, 0xa0, 0x2a, 0x08, 0xc7, 0x33, 0x25, 0xfb, 0x18, 0xff, 0xb9, 0xc9,
0xdb, 0x9c, 0x1b, 0x5a, 0xbf, 0x01, 0xd8, 0xbd, 0x1d, 0xe0, 0xbf, 0x61,
0xd3, 0xd1, 0x1f, 0xdc, 0xaf, 0xc0, 0xb6, 0xf8, 0x21, 0x73, 0xb0, 0x05,
0xb2, 0xd1, 0x23, 0x21, 0xb3, 0xe3, 0xad, 0xc6, 0x25, 0x81, 0xb0, 0x87,
0xa6, 0x44, 0x29, 0x1d, 0xab, 0xe7, 0x99, 0xb0, 0x2a, 0x90, 0xaa, 0xb3,
0x8e, 0xda, 0x2b, 0x34, 0xa7, 0xef, 0x80, 0xde, 0x28, 0xb1, 0xa4, 0xd8,
0x6f, 0xd0, 0x20, 0x95, 0xa1, 0xad, 0x57, 0x64, 0x17, 0xb8, 0xa1, 0xfa,
0x37, 0xf6, 0x1f, 0x07, 0xa8, 0x2a, 0x22, 0x56, 0x26, 0x15, 0xb1, 0xf6,
0x20, 0x67, 0x29, 0x09, 0xba, 0x0c, 0x20, 0xcf, 0x49, 0x77, 0xc4, 0x2b,
0x1c, 0xbb, 0x17, 0x5d, 0xb2, 0xec, 0xdf, 0x13, 0x18, 0x5e, 0xb8, 0x3d,
0xdb, 0xc8, 0x1a, 0x53, 0xbb, 0x89, 0xd7, 0xf7, 0x1e, 0x4b, 0xb0, 0x5e,
0xc3, 0x53, 0x1f, 0xfb, 0xb0, 0x76, 0xb9, 0xb8, 0x21, 0x7b, 0xb2, 0xaf,
0xb3, 0x80, 0x2b, 0xd5, 0xab, 0x0d, 0xa3, 0x2d, 0x31, 0xe9, 0xa4, 0x46,
0x94, 0xad, 0x34, 0x05, 0xa0, 0x75, 0x87, 0xa4, 0x34, 0xf6, 0x9d, 0x41,
0x79, 0x36, 0x34, 0x5e, 0x9a, 0x9a, 0x67, 0x9f, 0x30, 0x37, 0x98, 0xd2,
0x4f, 0xcf, 0x29, 0xf8, 0x99, 0x01, 0x32, 0x78, 0x2b, 0x39, 0x98, 0x75,
0x1a, 0x80, 0x2d, 0x58, 0xa2, 0x3a, 0x13, 0xe5, 0x45, 0xde, 0xa6, 0x82,
0x12, 0x52, 0x66, 0x0d, 0xae, 0x66, 0x13, 0x12, 0x1b, 0x54, 0xae, 0xbd,
0xde, 0xc4, 0x19, 0xfe, 0xaf, 0xbb, 0xdd, 0xc2, 0x16, 0xeb, 0xb4, 0xc8,
0xdc, 0x35, 0x18, 0x91, 0xb6, 0xd6, 0xd5, 0x8f, 0x1b, 0xa2, 0xb2, 0xb5,
0xc6, 0x99, 0x29, 0xd6, 0xa9, 0xd5, 0xb1, 0x09, 0x34, 0x03, 0xa1, 0x68,
0x9d, 0xd2, 0x38, 0x76, 0x9b, 0xcd, 0x8f, 0xa2, 0x3b, 0xa5, 0x97, 0x86,
0x81, 0xb9, 0x3d, 0xf7, 0x94, 0x7e, 0x72, 0x3f, 0x3d, 0x70, 0x91, 0xd1,
0x5e, 0xab, 0x3c, 0xd2, 0x90, 0xbd, 0x47, 0x47, 0x3f, 0xce, 0x90, 0xeb,
0x30, 0x44, 0x43, 0xd1, 0x91, 0xba, 0x1c, 0x3a, 0x4e, 0x27, 0x97, 0xa6,
0x12, 0xf9, 0x65, 0x5f, 0xa5, 0xd6, 0x13, 0xc9, 0x70, 0xaf, 0xac, 0x2a,
0x17, 0x15, 0x1c, 0x1a, 0xa4, 0x9a, 0xe0, 0x0c, 0x1d, 0x3f, 0xa7, 0xf1,
0xde, 0x85, 0x1b, 0x02, 0xac, 0xc7, 0xdd, 0xf7, 0x14, 0xfd, 0xb0, 0xd3,
0xdb, 0x91, 0x26, 0x97, 0xa7, 0x66, 0xc4, 0x84, 0x35, 0x19, 0x9e, 0x4a,
0xad, 0xbd, 0x3c, 0xae, 0x97, 0x73, 0x9a, 0x0d, 0x43, 0x08, 0x93, 0x05,
0x8b, 0x9c, 0x49, 0x28, 0x8e, 0xb6, 0x7c, 0xaf, 0x4b, 0x28, 0x8c, 0x5f,
0x6b, 0x52, 0x4d, 0x54, 0x8a, 0x5a, 0x57, 0x51, 0x51, 0x06, 0x8a, 0x67,
0x42, 0x26, 0x56, 0x81, 0x8c, 0x1f, 0x32, 0x13, 0x5c, 0xd2, 0x8d, 0x71,
0x21, 0x01, 0x67, 0x5c, 0x92, 0x9b, 0x16, 0x90, 0x74, 0x9d, 0xa0, 0x7d,
0x19, 0xe3, 0x7f, 0xc2, 0xab, 0x56, 0x18, 0x01, 0x1e, 0x8a, 0x9a, 0xb1,
0xe1, 0xf4, 0x1f, 0x96, 0x9d, 0x28, 0xe0, 0xd1, 0x1e, 0x5e, 0xa2, 0xd9,
0xe1, 0x47, 0x22, 0x00, 0xa5, 0x05, 0xda, 0x99, 0x31, 0xc3, 0x9c, 0x1a,
0xc3, 0x7b, 0x40, 0x57, 0x93, 0x9b, 0xac, 0xab, 0x4a, 0x01, 0x8d, 0xc4,
0x99, 0x33, 0x51, 0x3e, 0x8a, 0x30, 0x87, 0xd3, 0x56, 0x97, 0x87, 0x14,
0x78, 0x4d, 0x5a, 0xfa, 0x84, 0xff, 0x67, 0x8b, 0x5e, 0xec, 0x84, 0x2a,
0x55, 0x04, 0x63, 0x46, 0x85, 0xc6, 0x43, 0x7f, 0x69, 0x44, 0x88, 0x84,
0x34, 0x51, 0x6e, 0x6e, 0x8b, 0x51, 0x26, 0x43, 0x74, 0x86, 0x90, 0x59,
0x19, 0xd0, 0x7f, 0x9f, 0x9a, 0x6d, 0x1b, 0x16, 0x92, 0x76, 0xa9, 0xe5,
0x1a, 0xf5, 0x22, 0x51, 0x8e, 0x0d, 0xe2, 0xfd, 0x23, 0x73, 0x92, 0x74,
0xe2, 0xbc, 0x26, 0x5e, 0x96, 0xda, 0xe2, 0x8a, 0x31, 0x4b, 0x97, 0xd3,
0xd9, 0xa6, 0x40, 0xc8, 0x8f, 0xc8, 0xc2, 0x54, 0x4d, 0xd8, 0x88, 0xdf,
0xac, 0x6c, 0x57, 0xd4, 0x84, 0x2c, 0x99, 0x66, 0x5f, 0x84, 0x81, 0x2a,
0x87, 0x60, 0x65, 0xdf, 0x7e, 0xf0, 0x77, 0x15, 0x6a, 0xee, 0x7e, 0x00,
0x65, 0x9b, 0x6f, 0x0c, 0x7e, 0xdd, 0x55, 0x04, 0x73, 0x01, 0x81, 0x65,
0x45, 0x4e, 0x76, 0xda, 0x84, 0xc0, 0x36, 0x2c, 0x7b, 0x77, 0x88, 0x12,
0x27, 0xc6, 0x7f, 0xd6, 0x8b, 0xeb, 0x1a, 0x83, 0x8c, 0x9c, 0x99, 0x90,
0x1c, 0xf7, 0x98, 0xe3, 0xa4, 0x63, 0x1e, 0x9e, 0x24, 0xce, 0x7d, 0x5a,
0xe6, 0x0c, 0x28, 0x00, 0x82, 0x7c, 0xe5, 0xde, 0x2e, 0xbd, 0x88, 0xac,
0xe5, 0xfb, 0x42, 0xc5, 0x8a, 0x8f, 0xd9, 0x84, 0x51, 0xd7, 0x83, 0x57,
0xc1, 0xbc, 0x5e, 0x50, 0x7d, 0x66, 0xac, 0x2b, 0x67, 0x99, 0x7a, 0xa2,
0x99, 0x3f, 0x6f, 0x97, 0x78, 0xc5, 0x88, 0x0c, 0x76, 0x7e, 0x77, 0x7e,
0x77, 0xb4, 0x79, 0x8f, 0x77, 0x34, 0x66, 0x15, 0x7d, 0x07, 0x78, 0xef,
0x55, 0xf1, 0x80, 0x73, 0x7b, 0xe7, 0x46, 0xfd, 0x83, 0xc5, 0x7f, 0x70,
0x38, 0x08, 0x87, 0x36, 0x83, 0x6a, 0x29, 0xc5, 0x8a, 0x0e, 0x88, 0x4f,
0x1c, 0x9e, 0x98, 0x45, 0x94, 0xbc, 0x1e, 0xfe, 0xa4, 0x1c, 0x9f, 0xa4,
0x20, 0xdd, 0x29, 0xb2, 0x70, 0x2d, 0xe8, 0x78, 0x2e, 0xcc, 0x73, 0x70,
0xe8, 0x5a, 0x3c, 0xc1, 0x7a, 0x40, 0xe8, 0x39, 0x56, 0x80, 0x7b, 0xe4,
0xd9, 0xda, 0x63, 0xd9, 0x77, 0x34, 0xc1, 0xdc, 0x70, 0x53, 0x73, 0x98,
0xab, 0x7b, 0x78, 0xcf, 0x71, 0xb9, 0x99, 0xcf, 0x7f, 0x1b, 0x70, 0xc5,
0x88, 0xf2, 0x84, 0x0a, 0x70, 0x11, 0x77, 0xbb, 0x87, 0xcc, 0x6f, 0x80,
0x66, 0xab, 0x8b, 0x60, 0x70, 0x90, 0x56, 0x4c, 0x8e, 0x4c, 0x73, 0xac,
0x47, 0x66, 0x91, 0x26, 0x77, 0x56, 0x38, 0xa3, 0x93, 0x94, 0x7b, 0xae,
0x2b, 0x3e, 0x96, 0xa1, 0x81, 0x15, 0x1e, 0xba, 0xa3, 0x70, 0x8c, 0x61,
0x20, 0x02, 0xae, 0xa7, 0x97, 0xbd, 0x21, 0x8a, 0x2b, 0xc6, 0x30, 0x4a,
0xd1, 0x86, 0x3a, 0x20, 0x60, 0xcb, 0xec, 0xae, 0x53, 0x24, 0x6b, 0x06,
0xec, 0x32, 0x6c, 0x04, 0x6d, 0xfe, 0xdc, 0x2b, 0x77, 0xdf, 0x6b, 0xde,
0xc3, 0xf0, 0x81, 0x74, 0x6b, 0x08, 0xad, 0xc5, 0x89, 0x0f, 0x6a, 0x1a,
0x9c, 0x70, 0x8c, 0xfd, 0x68, 0xfd, 0x8b, 0xe6, 0x91, 0x98, 0x67, 0x47,
0x79, 0x06, 0x95, 0xa1, 0x66, 0xc4, 0x67, 0xac, 0x99, 0x01, 0x67, 0xde,
0x57, 0x08, 0x9b, 0x57, 0x6a, 0x77, 0x47, 0xd1, 0x9d, 0x93, 0x6d, 0xac,
0x38, 0xd9, 0x9f, 0xbe, 0x72, 0x95, 0x2c, 0x91, 0xa2, 0x22, 0x79, 0x3f,
0x20, 0xf8, 0xad, 0xc6, 0x81, 0xaf, 0x1f, 0xe8, 0xb7, 0x9a, 0x8d, 0x14,
0x20, 0x17, 0x2b, 0xdb, 0x30, 0x39, 0xd1, 0x8c, 0x2d, 0x31, 0x2e, 0xbd,
0xd2, 0xa9, 0x6e, 0xfb, 0x5a, 0x90, 0xf1, 0x12, 0x81, 0x1e, 0x62, 0xb7,
0xdf, 0xe4, 0x8b, 0xc7, 0x61, 0xf6, 0xca, 0x94, 0x92, 0x47, 0x62, 0x6f,
0xb4, 0x09, 0x96, 0xda, 0x62, 0x34, 0xa1, 0x7b, 0x9b, 0x1e, 0x60, 0x9a,
0x8e, 0xc7, 0x9f, 0x37, 0x5d, 0xd3, 0x7b, 0x01, 0xa2, 0x72, 0x5c, 0xa2,
0x68, 0xfa, 0xa5, 0x8d, 0x5d, 0x4a, 0x58, 0xfb, 0xa7, 0xea, 0x5f, 0x8e,
0x48, 0xaf, 0xaa, 0x04, 0x62, 0x38, 0x38, 0xa9, 0xab, 0xa4, 0x65, 0xcf,
0x2b, 0xe5, 0xac, 0xe0, 0x6b, 0xdc, 0x1f, 0xa3, 0xb6, 0x47, 0x75, 0x97,
0x1d, 0x3f, 0xbf, 0x0b, 0x81, 0xc0, 0x1b, 0xf4, 0x2d, 0x0a, 0x2e, 0x7c,
0xd2, 0x77, 0x2d, 0x63, 0x2e, 0x9a, 0xd2, 0xb8, 0x86, 0x0d, 0x4a, 0x77,
0xf5, 0x27, 0x9e, 0x31, 0x52, 0x09, 0xee, 0x75, 0xa1, 0xb3, 0x57, 0x08,
0xd3, 0xea, 0xa4, 0x17, 0x59, 0x45, 0xbc, 0x2c, 0xa5, 0x38, 0x59, 0x73,
0xa8, 0x38, 0xa9, 0x53, 0x56, 0x54, 0x92, 0x99, 0xac, 0xef, 0x53, 0x13,
0x7d, 0x77, 0xaf, 0x72, 0x51, 0x5c, 0x6b, 0xcb, 0xb1, 0xeb, 0x50, 0xb5,
0x5a, 0xc3, 0xb4, 0xcb, 0x50, 0xab, 0x49, 0x78, 0xb7, 0x2c, 0x53, 0x37,
0x37, 0xcb, 0xb8, 0xe3, 0x55, 0x5f, 0x28, 0xc4, 0xb9, 0x7f, 0x5d, 0x2d,
0x1c, 0xe8, 0xc3, 0x58, 0x6a, 0x60, 0x1b, 0xd2, 0xc6, 0x20, 0x76, 0x30,
0x1b, 0x8c, 0x2c, 0xc1, 0x2f, 0x40, 0xd0, 0xd2, 0x81, 0x76, 0x35, 0xf2,
0xed, 0x9c, 0x99, 0x20, 0x36, 0x2e, 0xf1, 0x03, 0xb2, 0x70, 0x42, 0xb1,
0xec, 0x75, 0xba, 0x7c, 0x4a, 0x10, 0xe1, 0xae, 0xb8, 0x89, 0x4c, 0x6d,
0xc8, 0xa7, 0xb6, 0x70, 0x4d, 0x1c, 0xb1, 0x60, 0xb9, 0x59, 0x48, 0xf7,
0x98, 0x69, 0xbb, 0x97, 0x45, 0x14, 0x81, 0xc9, 0xbd, 0xd3, 0x42, 0x35,
0x6f, 0xbf, 0xc0, 0x56, 0x3f, 0x8e, 0x5e, 0x24, 0xc2, 0x8b, 0x3c, 0x41,
0x4a, 0xc5, 0xc6, 0x1d, 0x3a, 0x42, 0x35, 0x57, 0xc8, 0x3a, 0x3d, 0x16,
0x23, 0x3d, 0xc9, 0x5b, 0x4f, 0x48, 0x22, 0xe0, 0xca, 0x26, 0x5d, 0x20,
0x22, 0x61, 0xca, 0x5d, 0x6a, 0x14, 0x20, 0x29, 0x87, 0x72, 0x2d, 0x66,
0xe9, 0x50, 0x95, 0x28, 0x2e, 0x0e, 0xe6, 0xf9, 0xa7, 0x2a, 0x2f, 0xcf,
0xe6, 0x05, 0xb2, 0x7f, 0x34, 0x85, 0xe3, 0xdd, 0xd1, 0x25, 0x3a, 0xed,
0xf1, 0x25, 0xcf, 0x13, 0x3b, 0x24, 0xd9, 0x0e, 0xcc, 0x39, 0x3a, 0xfc,
0xbe, 0x49, 0xcc, 0x68, 0x38, 0x5d, 0xa3, 0x55, 0xcc, 0xcc, 0x35, 0x53,
0x8b, 0x7f, 0xcd, 0x3b, 0x31, 0xd8, 0x75, 0xfa, 0xce, 0xb7, 0x2e, 0x01,
0x62, 0x5c, 0xd1, 0x69, 0x28, 0x28, 0x4d, 0x2b, 0xd5, 0x00, 0x23, 0xea,
0x36, 0xcc, 0xcd, 0xb4, 0x2a, 0xf0, 0x2a, 0xf0, 0xcc, 0x8c, 0x2f, 0x2f,
0x29, 0x1b, 0xcc, 0x99, 0x4b, 0x9e, 0x25, 0xaf, 0xcc, 0x5f, 0x5a, 0x73,
0x24, 0x8e, 0x97, 0xa2, 0x2b, 0x86, 0xe2, 0xb8, 0xa4, 0x7f, 0x2c, 0x55,
0xe1, 0xc4, 0xb1, 0xd8, 0x2c, 0xe6, 0xe1, 0x40, 0xc5, 0xd9, 0x2d, 0x8d,
0xe4, 0x27, 0xd4, 0x33, 0x2c, 0x55, 0xe8, 0x08, 0xd7, 0xbb, 0x2e, 0x5a,
0xda, 0x3c, 0xd8, 0x8b, 0x2c, 0xce, 0xc4, 0xe4, 0xd8, 0xa5, 0x2a, 0x26,
0xa9, 0xac, 0xd7, 0x6f, 0x28, 0x73, 0x8f, 0x9b, 0xd4, 0x2d, 0x27, 0xba,
0x79, 0x4a, 0xd2, 0xb4, 0x26, 0xf0, 0x65, 0x21, 0xd2, 0x98, 0x25, 0x54,
0x50, 0x1b, 0xd3, 0xd9, 0x23, 0x52, 0x35, 0xee, 0xce, 0x8b, 0x2a, 0x66,
0x2c, 0x75, 0xcd, 0x6d, 0x2c, 0x25, 0x2a, 0xd8, 0xcc, 0xd0, 0x2d, 0x1f,
0x29, 0xfa, 0xcd, 0x48, 0x48, 0x67, 0x26, 0xae, 0xa3, 0x60, 0x2a, 0xe4,
0xdf, 0xf8, 0xaf, 0xe2, 0x2b, 0x0c, 0xdf, 0x24, 0xb8, 0x6b, 0x2b, 0x43,
0xe0, 0x0f, 0xca, 0xf1, 0x29, 0x43, 0xe3, 0x6d, 0xd5, 0xde, 0x2b, 0x35,
0xdc, 0x66, 0xd7, 0xea, 0x29, 0xd2, 0xd6, 0x93, 0xd7, 0xb2, 0x29, 0x18,
0xc2, 0x92, 0xd7, 0xd2, 0x27, 0x23, 0xaa, 0xd1, 0xd6, 0x68, 0x26, 0x7b,
0x90, 0x34, 0xd3, 0x95, 0x26, 0xa8, 0x7b, 0x8c, 0xd2, 0x57, 0x26, 0x80,
0x67, 0xf4, 0xd2, 0x7f, 0x26, 0x0e, 0x57, 0x03, 0xd3, 0xae, 0x22, 0xf0,
0x3c, 0x8a, 0xce, 0xe3, 0x29, 0x6f, 0x2d, 0x19, 0xcd, 0xf2, 0x2a, 0xfb,
0x2b, 0xb0, 0xcd, 0x5a, 0x2b, 0xfa, 0x2a, 0xd1, 0xcc, 0xf1, 0x2c, 0xac,
0x2a, 0x3a, 0x1c, 0x9f, 0xc4, 0x6f, 0xd9, 0x49, 0x21, 0xac, 0xb1, 0x00,
0xb5, 0x4f, 0x21, 0xe9, 0xb1, 0x7b, 0xb4, 0x59, 0x23, 0x62, 0xb7, 0x1e,
0xb2, 0x52, 0x23, 0x18, 0xba, 0x6d, 0xb1, 0x75, 0x23, 0x9d, 0xba, 0xcb,
0xab, 0x7e, 0x27, 0x2d, 0xb5, 0x06, 0xa1, 0xc4, 0x28, 0x2e, 0xad, 0x32,
0x97, 0x43, 0x2a, 0x52, 0xaf, 0xbc, 0x8d, 0xf1, 0x2b, 0x1d, 0xb1, 0x55,
0x88, 0x14, 0x29, 0xa3, 0xa8, 0xf0, 0x76, 0x30, 0x26, 0xaf, 0xa9, 0x59,
0x68, 0x33, 0x26, 0x06, 0xcb, 0x0c, 0x5b, 0x53, 0x22, 0x67, 0xc9, 0xe7,
0x2c, 0x29, 0x25, 0x8e, 0xc9, 0xd4, 0x29, 0xfc, 0x27, 0x9f, 0xc9, 0xc7,
0x28, 0xaa, 0x29, 0x12, 0xc9, 0xbd, 0x27, 0xc7, 0x1e, 0xc7, 0xc2, 0xc2,
0xd9, 0x32, 0x1c, 0x8c, 0xc4, 0x50, 0xd9, 0x08, 0x20, 0xac, 0xb1, 0xb0,
0xb7, 0x61, 0x21, 0xdd, 0xb2, 0xa9, 0xb5, 0xb1, 0x1f, 0x3b, 0xbc, 0x13,
0xb5, 0xd6, 0x22, 0xdc, 0xbc, 0x35, 0xb1, 0x9a, 0x25, 0x19, 0xba, 0x59,
0xa7, 0xcd, 0x27, 0xa1, 0xb2, 0x11, 0x9c, 0x91, 0x2a, 0x4c, 0xb0, 0x54,
0x90, 0x44, 0x2b, 0x24, 0xb1, 0xcf, 0x88, 0x4f, 0x29, 0x5b, 0xaa, 0x5b,
0x74, 0x41, 0x26, 0x77, 0xab, 0x62, 0x67, 0xbd, 0x1d, 0x8d, 0xc7, 0x09,
0x50, 0x65, 0x22, 0xe8, 0xc7, 0xb3, 0x2a, 0xa9, 0x26, 0xdd, 0xc8, 0x3d,
0x28, 0x5b, 0x29, 0x21, 0xc8, 0x87, 0x27, 0x27, 0x2a, 0x96, 0xc8, 0xb5,
0x26, 0x6a, 0x1b, 0x2b, 0xbc, 0x9e, 0xde, 0x11, 0x1c, 0xa5, 0xc2, 0xed,
0xdb, 0x4c, 0x1c, 0x68, 0xc4, 0x09, 0xd8, 0x98, 0x1b, 0x5e, 0xca, 0xb7,
0xd6, 0x54, 0x22, 0x90, 0xb5, 0xab, 0xb7, 0x9d, 0x1f, 0x63, 0xbf, 0x8f,
0xb8, 0x56, 0x22, 0x48, 0xc1, 0x33, 0xb5, 0x6d, 0x26, 0x1a, 0xbc, 0x14,
0xa7, 0x2a, 0x29, 0x0f, 0xb9, 0xbe, 0x9a, 0x3c, 0x2a, 0x1c, 0xb6, 0xa5,
0x8a, 0xd6, 0x27, 0xf5, 0xb3, 0xa1, 0x78, 0x6f, 0x20, 0xee, 0xb1, 0x7b,
0x5d, 0x3b, 0x18, 0xa0, 0xb1, 0xcb, 0x3c, 0xc5, 0x22, 0x7c, 0xba, 0xab,
0x25, 0x7f, 0x28, 0x69, 0xc0, 0xe5, 0x23, 0xf0, 0x2b, 0x88, 0xc6, 0x90,
0x24, 0xda, 0x4b, 0xcd, 0xc6, 0xe3, 0x1d, 0x89, 0x18, 0xe1, 0xb6, 0xdb,
0xe1, 0xf8, 0x1a, 0x5b, 0xbb, 0xce, 0xde, 0xbd, 0x1c, 0x15, 0xc0, 0x74,
0xdb, 0xd3, 0x1c, 0x15, 0xc3, 0x56, 0xd7, 0xab, 0x1a, 0x11, 0xc7, 0xf9,
0xd2, 0xf1, 0x1c, 0x6e, 0xc3, 0xb7, 0xc4, 0xbc, 0x28, 0xce, 0xba, 0xfb,
0xb1, 0xda, 0x31, 0x92, 0xb2, 0xad, 0xa0, 0xa6, 0x34, 0xe1, 0xae, 0x88,
0x92, 0x79, 0x37, 0x9d, 0xab, 0x79, 0x83, 0xed, 0x37, 0x02, 0xa8, 0x86,
0x70, 0x57, 0x33, 0x91, 0xa5, 0xea, 0x56, 0xe2, 0x2d, 0x0a, 0xa7, 0x98,
0x36, 0x0a, 0x2d, 0xda, 0xa7, 0xa5, 0x1a, 0x9a, 0x42, 0x3d, 0xbb, 0xd5,
0x1a, 0xa4, 0x51, 0x50, 0xc0, 0xb3, 0x19, 0xb9, 0x72, 0xfa, 0xc5, 0x1d,
0x18, 0x43, 0x1d, 0x1e, 0xb1, 0x3c, 0xe1, 0x9f, 0x1c, 0x40, 0xb2, 0xf8,
0xe1, 0x75, 0x1a, 0x17, 0xba, 0x2a, 0xe0, 0xfd, 0x1b, 0x97, 0xbe, 0x42,
0xdc, 0xb6, 0x1a, 0x1c, 0xc1, 0x1f, 0xd5, 0xe1, 0x29, 0x90, 0xb7, 0xd9,
0xbf, 0x43, 0x35, 0xc8, 0xae, 0x0b, 0xaa, 0x94, 0x3c, 0x9f, 0xa7, 0xad,
0x9a, 0x1f, 0x41, 0xaf, 0xa2, 0xa8, 0x8a, 0xe5, 0x44, 0xf5, 0xa0, 0x40,
0x7b, 0xcb, 0x45, 0x2e, 0x9d, 0x9c, 0x67, 0x32, 0x44, 0x34, 0x9c, 0x1c,
0x4e, 0x96, 0x46, 0xd8, 0x9c, 0x8e, 0x35, 0x39, 0x4b, 0x4c, 0x9e, 0x31,
0x20, 0xff, 0x52, 0x62, 0xa1, 0x5f, 0x0e, 0xa2, 0x68, 0x09, 0xab, 0x6f,
0x13, 0x1c, 0x74, 0xac, 0xb0, 0x6f, 0x16, 0xd9, 0x1f, 0x03, 0xa7, 0x1e,
0xe1, 0xf6, 0x20, 0x24, 0xac, 0x22, 0xe2, 0x06, 0x1f, 0x12, 0xb2, 0x6a,
0xe3, 0x9c, 0x1b, 0x2b, 0xba, 0xf1, 0xe6, 0xfe, 0x29, 0x9b, 0xb3, 0x31,
0xd1, 0x62, 0x37, 0xe7, 0xaa, 0x57, 0xba, 0xad, 0x43, 0xa6, 0xa1, 0x7b,
0xa3, 0x49, 0x4a, 0xa3, 0x9c, 0xf7, 0x94, 0xf2, 0x51, 0x8d, 0x99, 0x05,
0x85, 0xac, 0x54, 0x08, 0x96, 0xfc, 0x74, 0xbc, 0x56, 0xde, 0x95, 0x45,
0x60, 0xba, 0x5a, 0xbc, 0x95, 0x3c, 0x4b, 0x43, 0x5f, 0xd9, 0x96, 0x9a,
0x38, 0x23, 0x64, 0x91, 0x98, 0xb2, 0x28, 0x3d, 0x6a, 0xd8, 0x9a, 0x26,
0x16, 0x93, 0x7a, 0x7e, 0xa7, 0x33, 0x1a, 0x00, 0x8d, 0x19, 0xb8, 0xe1,
0x16, 0x43, 0x23, 0xd0, 0x9b, 0xbb, 0xe1, 0x38, 0x24, 0x53, 0x9f, 0xcf,
0xe1, 0xca, 0x25, 0xab, 0xa5, 0xf4, 0xe2, 0xc5, 0x29, 0xa6, 0xae, 0x88,
0xe5, 0x96, 0x39, 0x7b, 0xa5, 0xc8, 0xce, 0x5e, 0x47, 0x6a, 0x9d, 0x71,
0xb8, 0x1d, 0x51, 0xd1, 0x97, 0x39, 0xa2, 0xdb, 0x59, 0xc6, 0x93, 0xda,
0x91, 0x5d, 0x5f, 0x56, 0x90, 0xd8, 0x81, 0x9c, 0x64, 0x02, 0x8e, 0xda,
0x70, 0xd0, 0x68, 0x31, 0x8e, 0x74, 0x5d, 0xc9, 0x6c, 0x35, 0x8f, 0x87,
0x4c, 0x36, 0x71, 0xce, 0x91, 0xc8, 0x3a, 0xdc, 0x76, 0x90, 0x94, 0x85,
0x2c, 0xb7, 0x79, 0x87, 0x97, 0x91, 0x1c, 0x2d, 0x89, 0x92, 0xa1, 0xa0,
0x1d, 0x5f, 0x96, 0x0d, 0xaf, 0x5a, 0x19, 0xfc, 0x25, 0xe6, 0x90, 0xe1,
0xe3, 0x22, 0x28, 0x86, 0x94, 0x63, 0xe2, 0xa5, 0x2c, 0xb0, 0x99, 0xea,
0xe3, 0x5f, 0x3a, 0xac, 0xa0, 0x6f, 0xe3, 0x91, 0x4a, 0x05, 0x98, 0x95,
0xcc, 0x3a, 0x56, 0xab, 0x91, 0x11, 0xb6, 0xc1, 0x60, 0x78, 0x8d, 0x64,
0xa3, 0x33, 0x68, 0x9b, 0x8a, 0xa0, 0x91, 0x20, 0x6f, 0x13, 0x88, 0x7e,
0x80, 0x91, 0x74, 0x4e, 0x87, 0x82, 0x6e, 0xe2, 0x78, 0x3c, 0x88, 0x46,
0x5d, 0xc7, 0x7b, 0xcf, 0x8a, 0x61, 0x4d, 0xb1, 0x7f, 0x47, 0x8d, 0x41,
0x3e, 0x10, 0x83, 0x2d, 0x90, 0x43, 0x2e, 0xd2, 0x86, 0x7f, 0x94, 0x50,
0x1f, 0xfc, 0x91, 0xc2, 0x9f, 0x5f, 0x1d, 0x87, 0x9f, 0xe2, 0xab, 0xfa,
0x1d, 0xd9, 0x28, 0x9b, 0x7f, 0xdf, 0xe6, 0x2c, 0x2c, 0x94, 0x85, 0xb3,
0xe6, 0x04, 0x35, 0x66, 0x8c, 0xad, 0xe4, 0xfc, 0x4d, 0x9a, 0x92, 0xbb,
0xe2, 0x8d, 0x5b, 0x78, 0x8c, 0x7d, 0xcc, 0x0b, 0x67, 0x34, 0x86, 0x70,
0xb6, 0x97, 0x71, 0x11, 0x83, 0xad, 0xa3, 0xb4, 0x79, 0x11, 0x82, 0x49,
0x91, 0xf9, 0x80, 0x14, 0x81, 0x1a, 0x81, 0x50, 0x83, 0x2f, 0x80, 0xad,
0x6f, 0x38, 0x86, 0x75, 0x81, 0xc0, 0x5e, 0x87, 0x89, 0xa2, 0x84, 0x0c,
0x4f, 0x06, 0x8c, 0xa3, 0x87, 0x88, 0x40, 0x43, 0x8f, 0xcd, 0x8b, 0x8e,
0x31, 0x4d, 0x92, 0x84, 0x8f, 0xbd, 0x23, 0x47, 0x9c, 0x51, 0x98, 0xc5,
0x1f, 0x6c, 0xa9, 0xbc, 0xa6, 0x23, 0x21, 0x0c, 0x2d, 0x44, 0x72, 0xdd,
0xe8, 0x4e, 0x32, 0xec, 0x74, 0xad, 0xe6, 0xd2, 0x49, 0xc8, 0x7d, 0xf1,
0xe7, 0x01, 0x61, 0x49, 0x84, 0x36, 0xe3, 0x46, 0x6e, 0x46, 0x80, 0x8a,
0xcc, 0xf1, 0x7a, 0x4f, 0x7c, 0x1f, 0xb5, 0xbf, 0x83, 0x22, 0x7b, 0x2c,
0xa4, 0x6c, 0x89, 0x33, 0x7a, 0x80, 0x93, 0x40, 0x8e, 0x0d, 0x79, 0x97,
0x81, 0x83, 0x91, 0xdd, 0x78, 0xe6, 0x6f, 0xeb, 0x95, 0x1f, 0x79, 0x9c,
0x5e, 0xe8, 0x98, 0x38, 0x7b, 0xe2, 0x4f, 0x5a, 0x9a, 0x99, 0x7f, 0x3e,
0x40, 0xb9, 0x9c, 0xd1, 0x83, 0xc7, 0x32, 0xde, 0x9f, 0x3d, 0x88, 0x1b,
0x24, 0xfe, 0xa8, 0x23, 0x90, 0xa8, 0x20, 0x2a, 0xb0, 0x8a, 0x9a, 0xf0,
0x22, 0x59, 0x33, 0x20, 0x5f, 0xe7, 0xe9, 0x43, 0x46, 0xc8, 0x67, 0xbf,
0xec, 0xac, 0x5c, 0xf6, 0x6f, 0xc3, 0xea, 0x9c, 0x77, 0x82, 0x76, 0xe2,
0xe6, 0x58, 0x82, 0x0c, 0x75, 0xe4, 0xcf, 0xde, 0x8b, 0xe3, 0x74, 0x9d,
0xba, 0x3b, 0x93, 0x82, 0x73, 0xd7, 0xa7, 0x92, 0x97, 0x7e, 0x73, 0x3e,
0x96, 0x57, 0x9c, 0x00, 0x71, 0x52, 0x82, 0xd2, 0x9f, 0xc8, 0x70, 0x4c,
0x70, 0xe2, 0xa2, 0xad, 0x70, 0x90, 0x5f, 0xc1, 0xa4, 0xfe, 0x72, 0xa7,
0x4f, 0xf7, 0xa7, 0x13, 0x75, 0x94, 0x40, 0xdd, 0xa9, 0x49, 0x7a, 0x50,
0x33, 0x28, 0xaa, 0xf4, 0x7f, 0x6b, 0x26, 0x10, 0xb1, 0x57, 0x85, 0x25,
0x1f, 0x9d, 0xb9, 0xf8, 0x90, 0x7b, 0x20, 0x6d, 0x2c, 0xfe, 0x2e, 0x97,
0xd2, 0x7c, 0x60, 0x2d, 0x57, 0x80, 0xf0, 0xd1, 0x76, 0xc4, 0x60, 0xe0,
0xef, 0xa7, 0x8c, 0x71, 0x6b, 0xdd, 0xea, 0x7d, 0x96, 0x9f, 0x6c, 0x15,
0xd5, 0x20, 0x9d, 0xdd, 0x6c, 0x9f, 0xc0, 0x47, 0xa1, 0xf7, 0x6c, 0x8f,
0xac, 0xfc, 0xa5, 0xdf, 0x6a, 0xf1, 0x99, 0x53, 0xa9, 0xfb, 0x67, 0xfe,
0x84, 0xaa, 0xac, 0xec, 0x66, 0x5d, 0x72, 0x5e, 0xaf, 0x58, 0x66, 0x67,
0x61, 0x94, 0xb1, 0x77, 0x68, 0x05, 0x51, 0x01, 0xb3, 0xa3, 0x6a, 0x67,
0x40, 0x4c, 0xb4, 0xdb, 0x6e, 0x98, 0x32, 0x03, 0xb5, 0xd6, 0x73, 0x96,
0x24, 0x6f, 0xbb, 0x97, 0x7a, 0x0a, 0x1c, 0x4d, 0xc3, 0x8f, 0x85, 0x6d,
0x1b, 0xca, 0x2d, 0x17, 0x2e, 0x86, 0xd2, 0x83, 0x78, 0x96, 0x4a, 0x1e,
0xf6, 0xff, 0x8b, 0x3c, 0x51, 0xaa, 0xf3, 0x23, 0xa1, 0x5f, 0x5b, 0xfb,
0xec, 0x12, 0xab, 0x3a, 0x63, 0x33, 0xdb, 0xfd, 0xaf, 0xcd, 0x63, 0x9e,
0xc8, 0x04, 0xb1, 0x0d, 0x63, 0xb8, 0xb3, 0xbf, 0xb4, 0x7a, 0x60, 0xa1,
0x9d, 0x2d, 0xb7, 0xfd, 0x5c, 0xf2, 0x87, 0x17, 0xb9, 0xf7, 0x5b, 0x63,
0x74, 0x89, 0xbb, 0xe7, 0x5a, 0x79, 0x63, 0x08, 0xbe, 0x71, 0x59, 0xe8,
0x51, 0x1d, 0xc0, 0x8f, 0x5b, 0x22, 0x3e, 0xa4, 0xc1, 0xe7, 0x5d, 0x4e,
0x2d, 0x90, 0xc2, 0x8d, 0x64, 0x5a, 0x20, 0xc3, 0xc6, 0xe3, 0x6f, 0x52,
0x1e, 0x2f, 0xc8, 0x38, 0x7a, 0x69, 0x1d, 0x35, 0x2d, 0x30, 0x2e, 0x74,
0xd2, 0x8b, 0x8d, 0x54, 0x36, 0x17, 0xf3, 0x7d, 0xa0, 0xf4, 0x3f, 0x2d,
0xf0, 0xf2, 0xb0, 0x5a, 0x4b, 0xc2, 0xec, 0xe9, 0xc6, 0x7e, 0x54, 0xa2,
0xeb, 0xf0, 0xc1, 0xd1, 0x57, 0x1a, 0xd3, 0x5a, 0xc1, 0xdc, 0x57, 0x79,
0xbc, 0x90, 0xc3, 0xfe, 0x53, 0x69, 0xa3, 0x5d, 0xc5, 0xc2, 0x4f, 0x84,
0x8b, 0xc7, 0xc7, 0x68, 0x4c, 0x80, 0x78, 0x7f, 0xc9, 0x34, 0x49, 0xa8,
0x66, 0x4c, 0xcb, 0xbe, 0x46, 0xa6, 0x52, 0x3e, 0xce, 0x8c, 0x44, 0xb5,
0x3c, 0xc3, 0xd0, 0xca, 0x47, 0x14, 0x29, 0x5b, 0xcd, 0x39, 0x56, 0x0d,
0x25, 0x65, 0xcb, 0xff, 0x63, 0xb5, 0x22, 0xbc, 0xcb, 0x7e, 0x6e, 0x0c,
0x21, 0x86, 0x8d, 0x2a, 0x2f, 0x44, 0xea, 0x72, 0x9a, 0x72, 0x31, 0x1d,
0xe8, 0xa7, 0xa9, 0xae, 0x32, 0xde, 0xe7, 0x3e, 0xc1, 0x58, 0x3a, 0x2f,
0xee, 0x0d, 0xd3, 0x34, 0x42, 0x1c, 0xef, 0x37, 0xd6, 0x66, 0x47, 0xbe,
0xe1, 0xbd, 0xd3, 0x88, 0x47, 0xa1, 0xc6, 0xb3, 0xd5, 0x39, 0x43, 0xe0,
0xac, 0x90, 0xd5, 0xb4, 0x40, 0x0b, 0x93, 0x8e, 0xd5, 0xd5, 0x3c, 0x44,
0x7d, 0xed, 0xd7, 0x42, 0x38, 0xe1, 0x6a, 0xba, 0xda, 0xcf, 0x33, 0x13,
0x53, 0xed, 0xd9, 0x08, 0x2e, 0xda, 0x3a, 0xa7, 0xd0, 0x7c, 0x2f, 0x8e,
0x2c, 0xfa, 0xcf, 0x60, 0x41, 0xd6, 0x28, 0xc2, 0xce, 0x73, 0x54, 0xb2,
0x26, 0x99, 0xcd, 0xea, 0x5f, 0xa5, 0x25, 0x43, 0x9b, 0x37, 0x2d, 0x9f,
0xe4, 0xfe, 0xa6, 0xbc, 0x2e, 0x14, 0xe3, 0xc2, 0xb4, 0x9a, 0x2f, 0x2f,
0xe3, 0xcc, 0xc7, 0x51, 0x32, 0xa1, 0xe5, 0x59, 0xd4, 0x23, 0x33, 0x17,
0xe2, 0x1c, 0xd8, 0x83, 0x34, 0x43, 0xda, 0x55, 0xd9, 0xf3, 0x32, 0xfe,
0xc6, 0xd8, 0xda, 0x48, 0x30, 0xc2, 0xac, 0x4a, 0xd9, 0xf1, 0x2f, 0x04,
0x92, 0xc6, 0xd7, 0xc0, 0x2d, 0x05, 0x7c, 0x8f, 0xd5, 0xe4, 0x2b, 0x80,
0x67, 0xf8, 0xd5, 0x67, 0x2a, 0x01, 0x53, 0x0c, 0xd6, 0xae, 0x27, 0xcf,
0x3b, 0xaa, 0xd0, 0x31, 0x2b, 0xfe, 0x2d, 0xa6, 0xce, 0x95, 0x2d, 0x45,
0x2b, 0xad, 0xcd, 0xb4, 0x2d, 0xff, 0x2a, 0xa1, 0xce, 0xaa, 0x52, 0xd6,
0x27, 0x00, 0xa4, 0xf7, 0x2c, 0x1e, 0xe1, 0x64, 0xb1, 0xb2, 0x2c, 0x8a,
0xe0, 0xd9, 0xc7, 0x1b, 0x2d, 0x04, 0xe3, 0xcf, 0xd0, 0x7a, 0x2b, 0xfc,
0xe6, 0xe6, 0xd6, 0x95, 0x2e, 0xfb, 0xdc, 0x27, 0xd8, 0xe5, 0x2e, 0x30,
0xd7, 0xbb, 0xd8, 0xa2, 0x2d, 0x21, 0xc3, 0xac, 0xd8, 0xe3, 0x2b, 0x58,
0xab, 0x92, 0xd8, 0x63, 0x2a, 0x40, 0x92, 0x2b, 0xd5, 0xa7, 0x29, 0xae,
0x7d, 0x46, 0xd4, 0x3c, 0x29, 0x35, 0x69, 0x8b, 0xd4, 0x5e, 0x28, 0xac,
0x58, 0x7b, 0xd5, 0x89, 0x25, 0xc9, 0x3e, 0x9f, 0xd0, 0x0e, 0x2a, 0x8f,
0x2d, 0xf1, 0xce, 0xd9, 0x2b, 0xd9, 0x2c, 0x55, 0xce, 0x15, 0x2c, 0xae,
0x2b, 0x58, 0xcd, 0x8f, 0x2d, 0x44, 0x2a, 0xab, 0x1c, 0x4f, 0xc7, 0xf3,
0xdb, 0xd1, 0x1c, 0xef, 0xce, 0x5e, 0xda, 0x46, 0x22, 0x0d, 0xb3, 0xd9,
0xb6, 0xfe, 0x1f, 0x68, 0xbe, 0x05, 0xb7, 0xd8, 0x23, 0x73, 0xbe, 0x06,
0xb4, 0xba, 0x24, 0x35, 0xbe, 0xa9, 0xae, 0xc7, 0x27, 0x3f, 0xb9, 0x64,
0xa5, 0xa4, 0x28, 0x52, 0xb6, 0x8c, 0x9e, 0xfe, 0x2a, 0x6a, 0xb1, 0xf9,
0x8e, 0xb6, 0x2b, 0x2c, 0xb2, 0xcf, 0x89, 0x1d, 0x2e, 0x84, 0xcb, 0x34,
0x85, 0x9f, 0x2d, 0xbc, 0xcb, 0x69, 0x76, 0xc0, 0x28, 0x8b, 0xcc, 0x55,
0x5c, 0xaa, 0x23, 0x36, 0xcc, 0x4e, 0x2c, 0xd4, 0x26, 0x34, 0xcb, 0xb1,
0x2a, 0x81, 0x28, 0x2a, 0xcb, 0x4b, 0x29, 0x18, 0x29, 0x8a, 0xcb, 0x04,
0x28, 0x25, 0x1f, 0x57, 0xc4, 0xd8, 0xdb, 0x43, 0x1c, 0x77, 0xc8, 0x41,
0xdc, 0x0c, 0x1c, 0xef, 0xce, 0x82, 0xda, 0x44, 0x1a, 0x5b, 0xd7, 0xd7,
0xd9, 0xfe, 0x1f, 0x90, 0xc1, 0x62, 0xba, 0x35, 0x23, 0x73, 0xc2, 0x0f,
0xb6, 0xcc, 0x25, 0xf9, 0xbf, 0x92, 0xac, 0x35, 0x27, 0xf1, 0xbc, 0x52,
0xa5, 0xb2, 0x2a, 0x6e, 0xb7, 0x54, 0x95, 0x0a, 0x2b, 0x3f, 0xb4, 0x7d,
0x8a, 0x2e, 0x2e, 0x75, 0xcb, 0x25, 0x84, 0xe2, 0x2b, 0xa2, 0xcb, 0xb9,
0x6d, 0x09, 0x26, 0x49, 0xcb, 0x77, 0x55, 0xaa, 0x24, 0x0e, 0xcb, 0x0e,
0x2b, 0x9a, 0x27, 0xb6, 0xca, 0x9f, 0x29, 0x08, 0x29, 0xce, 0xca, 0x5f,
0x27, 0xad, 0x2b, 0x27, 0xca, 0x37, 0x26, 0xd8, 0x1c, 0x86, 0xc0, 0x19,
0xe0, 0x19, 0x1f, 0x75, 0xc5, 0x26, 0xdc, 0x11, 0x1d, 0xb6, 0xc8, 0x63,
0xdb, 0xb9, 0x1c, 0xef, 0xce, 0xc7, 0xda, 0x40, 0x1b, 0x3d, 0xd7, 0x38,
0xd8, 0x1c, 0x20, 0x20, 0xc8, 0x6b, 0xc0, 0x72, 0x1c, 0xc9, 0xd2, 0x94,
0xc5, 0x34, 0x22, 0x63, 0xcd, 0x7b, 0xb5, 0x5e, 0x27, 0x94, 0xca, 0x98,
0xa6, 0x97, 0x29, 0x75, 0xc7, 0x06, 0x95, 0x1d, 0x27, 0xc7, 0xc4, 0x61,
0x7f, 0xca, 0x21, 0x4d, 0xc2, 0xb9, 0x62, 0x6d, 0x19, 0xb6, 0xc4, 0x0e,
0x3e, 0xcc, 0x26, 0x10, 0xc8, 0x24, 0x28, 0xcd, 0x2a, 0x7d, 0xc8, 0xb3,
0x26, 0x77, 0x40, 0x7f, 0xc9, 0x6d, 0x20, 0xfa, 0x4d, 0x64, 0xc9, 0xe9,
0x20, 0xb9, 0x1a, 0xdf, 0xba, 0x6c, 0xe4, 0x54, 0x1c, 0x14, 0xbe, 0xac,
0xe1, 0xe3, 0x1d, 0xd1, 0xc5, 0x57, 0xdf, 0x9a, 0x1e, 0x1c, 0xc9, 0x5c,
0xdc, 0xbe, 0x1b, 0x2f, 0xd1, 0xe3, 0xdb, 0x70, 0x17, 0xd7, 0xd6, 0x0c,
0xd6, 0xb7, 0x26, 0x14, 0xcb, 0xdf, 0xc1, 0x9d, 0x2f, 0xc9, 0xc4, 0x28,
0xaf, 0xbc, 0x35, 0x46, 0xbf, 0x79, 0x9f, 0x46, 0x38, 0x6f, 0xbc, 0x20,
0x8e, 0x27, 0x38, 0x13, 0xb9, 0x6d, 0x78, 0xaf, 0x34, 0x51, 0xb7, 0x1e,
0x5d, 0x28, 0x31, 0x62, 0xb8, 0x45, 0x3a, 0x53, 0x32, 0xdc, 0xb8, 0xb1,
0x1d, 0xa0, 0x48, 0x0f, 0xc3, 0x08, 0x1c, 0x88, 0x56, 0x34, 0xc5, 0x8d,
0x1a, 0xed, 0x74, 0x76, 0xc7, 0x9a, 0x19, 0xce, 0x1f, 0x42, 0xb3, 0x64,
0xe3, 0xf0, 0x1c, 0xfd, 0xb7, 0xee, 0xe6, 0x05, 0x1d, 0x83, 0xbf, 0x20,
0xe5, 0x27, 0x1e, 0xe3, 0xc5, 0x63, 0xe3, 0x61, 0x1d, 0xd9, 0xce, 0x5c,
0xe3, 0x2e, 0x2a, 0x69, 0xc6, 0xdc, 0xce, 0x14, 0x36, 0xc8, 0xbd, 0xe0,
0xb8, 0xf6, 0x40, 0x9c, 0xb5, 0x7c, 0xa5, 0xfc, 0x47, 0x05, 0xb1, 0x3e,
0x96, 0x78, 0x4c, 0xe1, 0xad, 0x22, 0x86, 0x8d, 0x4d, 0xa1, 0xab, 0x3e,
0x70, 0xc5, 0x4d, 0x63, 0xaa, 0x54, 0x56, 0xea, 0x4e, 0xfa, 0xab, 0x1a,
0x3a, 0x59, 0x54, 0x5e, 0xad, 0xdd, 0x27, 0x8b, 0x5f, 0x7a, 0xb0, 0xfb,
0x16, 0xc9, 0x6b, 0xd6, 0xb2, 0x9e, 0x14, 0x17, 0x80, 0x8e, 0xc4, 0x63,
0x15, 0x82, 0x24, 0x20, 0xa8, 0x52, 0xe1, 0x7a, 0x23, 0xd8, 0xaf, 0x09,
0xe3, 0x63, 0x24, 0xa3, 0xb4, 0xb2, 0xe5, 0x1c, 0x25, 0xb8, 0xbd, 0xbe,
0xe8, 0x2d, 0x2e, 0xef, 0xbf, 0x92, 0xde, 0x40, 0x3c, 0xa2, 0xb7, 0x37,
0xc7, 0xc2, 0x4a, 0x29, 0xad, 0xdd, 0xae, 0xcd, 0x52, 0x3e, 0xa8, 0xa8,
0x9f, 0xa7, 0x59, 0xb1, 0xa4, 0x88, 0x8f, 0x5e, 0x5d, 0x66, 0xa2, 0x28,
0x7e, 0x51, 0x60, 0x63, 0xa0, 0xdf, 0x6a, 0x4d, 0x64, 0x21, 0xa0, 0xf1,
0x54, 0xde, 0x69, 0xba, 0xa2, 0x2a, 0x40, 0x33, 0x70, 0x77, 0xa3, 0xde,
0x30, 0xd7, 0x76, 0x61, 0xa6, 0x86, 0x1f, 0xf3, 0x7d, 0x6b, 0xaf, 0x26,
0x16, 0xb2, 0x91, 0x57, 0xbe, 0xb2, 0x15, 0xc8, 0x26, 0xe7, 0x9c, 0xa9,
0xe1, 0xbf, 0x28, 0x14, 0xa2, 0x54, 0xe2, 0x9d, 0x2a, 0xd9, 0xa8, 0xb9,
0xe3, 0xec, 0x33, 0x38, 0xaf, 0x7a, 0xe4, 0x90, 0x42, 0xf8, 0xae, 0x7b,
0xd6, 0xbb, 0x4f, 0x82, 0xa7, 0x7e, 0xc2, 0x37, 0x5a, 0x39, 0xa1, 0xa0,
0xad, 0x72, 0x62, 0x90, 0x9d, 0xf6, 0x9b, 0x7b, 0x68, 0x9e, 0x9b, 0x0f,
0x8b, 0x82, 0x6d, 0x99, 0x99, 0x27, 0x7a, 0x60, 0x71, 0xdf, 0x98, 0xbf,
0x66, 0xf9, 0x75, 0xd4, 0x99, 0x6e, 0x54, 0xc1, 0x7a, 0xdd, 0x9b, 0x62,
0x43, 0xd3, 0x7f, 0xa6, 0x9e, 0x36, 0x34, 0x4a, 0x84, 0xf9, 0xa0, 0x97,
0x24, 0xb4, 0x8c, 0x98, 0xa9, 0x8c, 0x1a, 0x7d, 0x98, 0xac, 0xb5, 0xdd,
0x1a, 0x20, 0x28, 0xe5, 0x93, 0x0a, 0xe3, 0x4b, 0x2c, 0x0f, 0x97, 0x15,
0xe3, 0x27, 0x31, 0x25, 0x9c, 0xb1, 0xe4, 0x0e, 0x43, 0x2e, 0xa2, 0xf4,
0xe3, 0xbd, 0x54, 0x0e, 0xa0, 0x27, 0xd3, 0x8f, 0x60, 0x31, 0x99, 0x55,
0xc0, 0x47, 0x69, 0xb5, 0x96, 0xad, 0xad, 0xb1, 0x71, 0xfd, 0x94, 0x66,
0x9b, 0x20, 0x78, 0xc1, 0x92, 0xb3, 0x8a, 0x76, 0x7d, 0xd2, 0x91, 0xb4,
0x78, 0x6c, 0x81, 0xcc, 0x92, 0x14, 0x66, 0xc7, 0x85, 0x3f, 0x93, 0x94,
0x55, 0xc9, 0x88, 0x71, 0x96, 0x05, 0x46, 0x3b, 0x8b, 0xf6, 0x98, 0xf4,
0x36, 0x45, 0x8f, 0x43, 0x9c, 0x0d, 0x27, 0x42, 0x95, 0x71, 0xa3, 0xd2,
0x1e, 0x12, 0xa3, 0x31, 0xae, 0xb9, 0x1e, 0x5e, 0x2b, 0xbe, 0x82, 0xe5,
0xe6, 0x30, 0x30, 0x2a, 0x88, 0xbf, 0xe6, 0x1b, 0x40, 0x20, 0x8f, 0x72,
0xe4, 0x84, 0x56, 0xca, 0x95, 0x47, 0xe2, 0xa3, 0x65, 0xd2, 0x94, 0x05,
0xd4, 0x14, 0x70, 0x95, 0x8f, 0x65, 0xc0, 0x51, 0x7a, 0xa1, 0x8d, 0x0a,
0xad, 0xe7, 0x82, 0xcc, 0x8b, 0xf9, 0x9c, 0x3f, 0x8a, 0x01, 0x8b, 0x0b,
0x8b, 0x40, 0x8d, 0x3d, 0x8a, 0x9c, 0x78, 0xb6, 0x90, 0x32, 0x8b, 0x27,
0x67, 0x3c, 0x93, 0x34, 0x8c, 0xaf, 0x56, 0x91, 0x95, 0x93, 0x8f, 0xca,
0x47, 0xe4, 0x97, 0xf9, 0x93, 0x84, 0x38, 0x24, 0x9a, 0xbf, 0x96, 0x6a,
0x29, 0x43, 0xa0, 0x93, 0x9d, 0x1f, 0x20, 0x39, 0xad, 0xd9, 0xaa, 0xf1,
0x21, 0xc1, 0x30, 0x3d, 0x74, 0x20, 0xe8, 0x5f, 0x38, 0xde, 0x7a, 0x23,
0xe7, 0xfa, 0x54, 0xc7, 0x80, 0xcc, 0xe5, 0xba, 0x69, 0x47, 0x87, 0xfd,
0xe3, 0xcc, 0x78, 0xfe, 0x88, 0xaa, 0xd5, 0x7c, 0x83, 0xc3, 0x85, 0xbb,
0xc1, 0x2b, 0x8c, 0xde, 0x85, 0x1d, 0xaf, 0x41, 0x93, 0x40, 0x84, 0x4b,
0x9d, 0xd5, 0x98, 0x5e, 0x83, 0x6f, 0x8b, 0xc3, 0x9c, 0x0d, 0x82, 0x8f,
0x79, 0x67, 0x9e, 0xa9, 0x82, 0xbd, 0x67, 0xea, 0xa1, 0x2f, 0x84, 0x63,
0x57, 0xb2, 0xa3, 0x7b, 0x87, 0x7e, 0x48, 0x4e, 0xa5, 0x5c, 0x8a, 0xe1,
0x38, 0x83, 0xa7, 0x44, 0x8e, 0x7a, 0x2a, 0x81, 0xac, 0x9c, 0x94, 0x4c,
0x21, 0x27, 0xb5, 0x2e, 0x9e, 0x61, 0x20, 0xbf, 0x36, 0x7c, 0x63, 0x87,
0xea, 0x53, 0x53, 0x98, 0x6d, 0x53, 0xea, 0xd1, 0x69, 0xbe, 0x73, 0xba,
0xe8, 0xdd, 0x7f, 0x93, 0x7b, 0xcf, 0xe6, 0x6f, 0x8d, 0x9e, 0x7f, 0x08,
0xd8, 0xb9, 0x96, 0x9d, 0x7e, 0x46, 0xc5, 0x5e, 0x9e, 0x16, 0x7d, 0xd2,
0xb3, 0x0e, 0xa2, 0x25, 0x7d, 0x9d, 0xa1, 0xc9, 0xa6, 0x8e, 0x7b, 0x2a,
0x8d, 0x01, 0xaa, 0x2c, 0x7a, 0x03, 0x7a, 0x21, 0xac, 0x4a, 0x79, 0xe8,
0x68, 0xf1, 0xae, 0x64, 0x7b, 0x48, 0x58, 0x8f, 0xb0, 0x01, 0x7d, 0x88,
0x48, 0x4c, 0xb1, 0xd8, 0x80, 0xc9, 0x38, 0x34, 0xb2, 0xec, 0x84, 0x44,
0x29, 0xeb, 0xb7, 0x4a, 0x89, 0xdc, 0x1f, 0xc7, 0xbe, 0x6b, 0x91, 0xf3,
0x1e, 0xaa, 0x2d, 0x0b, 0x2e, 0xa1, 0xd2, 0x87, 0x6b, 0xe2, 0x5e, 0xc4,
0xef, 0xc3, 0x7e, 0x4f, 0x65, 0xae, 0xef, 0x29, 0x93, 0xc3, 0x71, 0x13,
0xeb, 0x91, 0xa2, 0xd1, 0x76, 0x4c, 0xdf, 0x9d, 0xa7, 0xef, 0x76, 0x2b,
0xcc, 0x03, 0xad, 0x41, 0x76, 0x8c, 0xb8, 0x6b, 0xb0, 0xa2, 0x75, 0x3c,
0xa3, 0xfe, 0xb4, 0x86, 0x71, 0xf1, 0x8e, 0x5e, 0xb7, 0x35, 0x70, 0x86,
0x7b, 0xb0, 0xb8, 0xa8, 0x6f, 0xbb, 0x6a, 0x47, 0xba, 0x7c, 0x70, 0xc1,
0x59, 0x75, 0xbc, 0x2b, 0x72, 0xb7, 0x48, 0x13, 0xbd, 0xab, 0x75, 0x95,
0x37, 0x21, 0xbe, 0x6c, 0x78, 0xe2, 0x27, 0x2a, 0xc1, 0xae, 0x7d, 0x7f,
0x1a, 0x9c, 0xc5, 0x7c, 0x87, 0x2c, 0x1b, 0x65, 0x2d, 0x24, 0x2e, 0x8f,
0xd2, 0x8f, 0x82, 0xa6, 0x52, 0x7e, 0xf5, 0x03, 0x90, 0xa6, 0x58, 0x96,
0xf0, 0x98, 0xa5, 0xb1, 0x62, 0xc5, 0xe9, 0x7e, 0xb6, 0x99, 0x6d, 0x86,
0xe7, 0x36, 0xba, 0x57, 0x6d, 0xa6, 0xd3, 0xb1, 0xbc, 0x7f, 0x6d, 0xbb,
0xbf, 0x69, 0xbf, 0x54, 0x6b, 0x2a, 0xa8, 0x6b, 0xc2, 0x00, 0x67, 0x53,
0x91, 0xaf, 0xc3, 0x54, 0x65, 0x4f, 0x7e, 0x02, 0xc4, 0x57, 0x64, 0x4c,
0x6b, 0xa9, 0xc5, 0xd3, 0x63, 0x9a, 0x59, 0x06, 0xc7, 0x99, 0x64, 0x56,
0x45, 0xb6, 0xc9, 0x60, 0x66, 0xc8, 0x32, 0xe4, 0xca, 0xb3, 0x6a, 0x0d,
0x22, 0x20, 0xca, 0xa5, 0x73, 0xd9, 0x1f, 0xc9, 0xca, 0x58, 0x7e, 0xa4,
0x1e, 0xd2, 0x83, 0xae, 0x36, 0x71, 0xf6, 0x24, 0x93, 0x14, 0x3c, 0x43,
0xf4, 0xbd, 0xa7, 0xa9, 0x48, 0xde, 0xed, 0x7c, 0xb4, 0xa3, 0x52, 0x97,
0xec, 0x0e, 0xc4, 0xf5, 0x5d, 0x2b, 0xe9, 0xb9, 0xc9, 0xc5, 0x64, 0x56,
0xdd, 0x2d, 0xcc, 0x24, 0x61, 0x1b, 0xc8, 0x2e, 0xce, 0x58, 0x5d, 0x89,
0xaf, 0xce, 0xcf, 0xbc, 0x59, 0xf2, 0x98, 0x29, 0xd0, 0x9a, 0x56, 0xde,
0x82, 0xed, 0xd1, 0xa1, 0x54, 0x2b, 0x6e, 0xf5, 0xd2, 0x0f, 0x52, 0xfc,
0x59, 0xfd, 0xd3, 0xe6, 0x53, 0x24, 0x44, 0x12, 0xd6, 0x05, 0x54, 0x36,
0x2f, 0xf1, 0xd0, 0x67, 0x5c, 0x25, 0x27, 0xd7, 0xcd, 0xfd, 0x68, 0xcb,
0x24, 0x5a, 0xcd, 0x19, 0x72, 0x77, 0x22, 0xc2, 0x8b, 0xfc, 0x33, 0xe8,
0xe9, 0xc4, 0xa2, 0x91, 0x33, 0x8a, 0xe9, 0x2b, 0xb0, 0x30, 0x36, 0x8d,
0xec, 0x12, 0xc6, 0x67, 0x40, 0x7a, 0xef, 0x36, 0xd0, 0x5b, 0x4b, 0x61,
0xeb, 0x89, 0xd8, 0x00, 0x4f, 0x42, 0xdf, 0x4f, 0xdc, 0xc5, 0x52, 0xf4,
0xd1, 0x25, 0xde, 0xd4, 0x4f, 0x0d, 0xb7, 0x54, 0xdf, 0x44, 0x4a, 0xd3,
0x9d, 0x32, 0xde, 0x8f, 0x47, 0x0a, 0x86, 0xa9, 0xdf, 0xc9, 0x43, 0x89,
0x73, 0x1a, 0xdd, 0xb1, 0x3a, 0x3c, 0x58, 0x05, 0xdb, 0x33, 0x34, 0xcd,
0x3d, 0xf5, 0xd3, 0xd1, 0x34, 0x16, 0x2f, 0x0f, 0xd1, 0x6b, 0x49, 0x86,
0x2a, 0x4e, 0xd0, 0x71, 0x59, 0xe2, 0x27, 0xbe, 0xce, 0x77, 0x66, 0x50,
0x25, 0x2a, 0x9e, 0x7b, 0x2f, 0x20, 0xe6, 0xa0, 0xa8, 0xf8, 0x2f, 0xd4,
0xe5, 0xbe, 0xb1, 0x94, 0x33, 0x39, 0xe2, 0x26, 0xcf, 0xa3, 0x35, 0x0b,
0xeb, 0xa7, 0xd9, 0x6a, 0x34, 0xfc, 0xe4, 0x1d, 0xd9, 0x0c, 0x38, 0x46,
0xda, 0x78, 0xdb, 0x02, 0x37, 0xbd, 0xc8, 0x38, 0xdb, 0x45, 0x34, 0xd1,
0xad, 0xb5, 0xdb, 0x35, 0x33, 0x37, 0x94, 0x72, 0xda, 0x68, 0x31, 0x2c,
0x7e, 0xfb, 0xd8, 0x5b, 0x2f, 0x21, 0x6a, 0x2c, 0xd7, 0xa7, 0x2d, 0xcf,
0x55, 0x66, 0xd8, 0x4e, 0x2b, 0xe7, 0x3e, 0x2e, 0xce, 0xd2, 0x32, 0x83,
0x31, 0xd9, 0xcf, 0xbc, 0x2e, 0x67, 0x2c, 0x84, 0xce, 0x95, 0x2e, 0xe1,
0x2b, 0x47, 0xd0, 0x35, 0x58, 0x85, 0x27, 0xb1, 0xa6, 0x8e, 0x2d, 0x5a,
0xe2, 0xcd, 0xb3, 0x84, 0x2e, 0x0c, 0xe2, 0x8a, 0xca, 0xc6, 0x2e, 0x41,
0xe7, 0x60, 0xd7, 0xb2, 0x2f, 0x53, 0xe6, 0x80, 0xd7, 0x1e, 0x31, 0xcb,
0xdb, 0xf6, 0xd9, 0x5c, 0x31, 0x7e, 0xd8, 0x58, 0xd9, 0x55, 0x30, 0x26,
0xc4, 0x5d, 0xd9, 0xb1, 0x2e, 0x8a, 0xac, 0x98, 0xd9, 0x60, 0x2d, 0x76,
0x93, 0x5a, 0xd7, 0x68, 0x2c, 0x53, 0x7e, 0xb7, 0xd5, 0xde, 0x2b, 0x91,
0x6a, 0xe7, 0xd6, 0x01, 0x2a, 0xfd, 0x59, 0xbc, 0xd7, 0x0e, 0x28, 0x78,
0x40, 0x83, 0xd1, 0x36, 0x2b, 0xaf, 0x2e, 0xc8, 0xcf, 0xbe, 0x2c, 0xb7,
0x2c, 0xfc, 0xce, 0xd0, 0x2d, 0x63, 0x2b, 0xdf, 0xce, 0x2c, 0x2d, 0xde,
0x2b, 0x1d, 0x1e, 0x1f, 0xca, 0xd8, 0xdc, 0xe5, 0x1d, 0xc4, 0xd0, 0x7c,
0xdc, 0x4f, 0x1b, 0x2b, 0xdb, 0x10, 0xdd, 0x35, 0x1f, 0xa1, 0xc2, 0x0d,
0xba, 0xe8, 0x23, 0xd0, 0xc1, 0xa4, 0xb8, 0x02, 0x24, 0xce, 0xc2, 0x81,
0xb2, 0x0b, 0x27, 0x59, 0xbc, 0xb4, 0xa8, 0x6d, 0x28, 0x78, 0xbb, 0x71,
0xa2, 0xdf, 0x2c, 0xf2, 0xcd, 0x85, 0x9f, 0xcb, 0x2e, 0xbb, 0xcb, 0x91,
0x94, 0x55, 0x2e, 0x97, 0xcb, 0x47, 0x85, 0xa8, 0x2e, 0x05, 0xcb, 0xa6,
0x76, 0x43, 0x2a, 0x20, 0xcd, 0x21, 0x5d, 0x82, 0x25, 0xc6, 0xcd, 0xf9,
0x2e, 0x12, 0x26, 0xde, 0xcd, 0x8b, 0x2b, 0x08, 0x28, 0xb7, 0xcc, 0xcf,
0x29, 0x86, 0x2a, 0x03, 0xcc, 0x4c, 0x28, 0x83, 0x1f, 0xe9, 0xc6, 0xed,
0xdd, 0x53, 0x1e, 0x6d, 0xcb, 0x9b, 0xdd, 0xa9, 0x1e, 0x09, 0xd1, 0x49,
0xdc, 0xef, 0x1c, 0x25, 0xdb, 0xd6, 0xdc, 0xe7, 0x1a, 0x3f, 0xde, 0x1d,
0xd9, 0x0e, 0x1e, 0xa5, 0xcb, 0xca, 0xc1, 0xb4, 0x22, 0x41, 0xce, 0x93,
0xbb, 0x1b, 0x27, 0x13, 0xc3, 0xdd, 0xab, 0x5b, 0x2c, 0x68, 0xce, 0xbb,
0xa4, 0x85, 0x2e, 0x7d, 0xcb, 0xe6, 0x96, 0x09, 0x2e, 0x91, 0xcb, 0x45,
0x84, 0x58, 0x2c, 0xe4, 0xcc, 0x7f, 0x6d, 0x3c, 0x29, 0xeb, 0xcd, 0x7e,
0x51, 0x19, 0x26, 0x25, 0xce, 0x04, 0x2c, 0xf5, 0x28, 0x94, 0xcd, 0x02,
0x29, 0xb5, 0x2a, 0x7d, 0xcc, 0x39, 0x28, 0x34, 0x2b, 0xb7, 0xcb, 0xb9,
0x27, 0x46, 0x1d, 0xc6, 0xc3, 0xa8, 0xe2, 0x31, 0x20, 0x39, 0xc7, 0xe0,
0xde, 0xc6, 0x1e, 0xf8, 0xcc, 0xdc, 0xde, 0xfb, 0x1c, 0x68, 0xd6, 0x18,
0xdf, 0xce, 0x1c, 0x48, 0xdd, 0x8f, 0xdd, 0xd1, 0x1c, 0xb8, 0xdf, 0xe5,
0xd7, 0x44, 0x22, 0x93, 0xdc, 0x1c, 0xca, 0xfb, 0x27, 0xbf, 0xd7, 0x55,
0xbc, 0x61, 0x2d, 0x53, 0xd1, 0x96, 0xaa, 0x65, 0x2e, 0xb5, 0xcc, 0xb6,
0x98, 0x0e, 0x2e, 0x93, 0xcb, 0x51, 0x82, 0x49, 0x2b, 0x4c, 0xcd, 0x4a,
0x65, 0x27, 0x26, 0x60, 0xce, 0xce, 0x42, 0xfb, 0x1e, 0xb8, 0xcf, 0x5b,
0x21, 0x48, 0x2b, 0xbb, 0xcc, 0x07, 0x27, 0x6a, 0x42, 0xe5, 0xcc, 0xd4,
0x20, 0xc4, 0x4e, 0xff, 0xcc, 0x81, 0x21, 0xe5, 0x1d, 0x3b, 0xbd, 0x76,
0xe5, 0xf0, 0x1e, 0x92, 0xc2, 0x8f, 0xe4, 0x84, 0x21, 0x69, 0xc8, 0xff,
0xe0, 0xaf, 0x20, 0xb9, 0xce, 0xc2, 0xe1, 0x09, 0x1d, 0xfb, 0xda, 0x42,
0xe2, 0x92, 0x19, 0xce, 0xe6, 0x66, 0xe5, 0xe2, 0x26, 0x3b, 0xdc, 0x9b,
0xd1, 0x94, 0x33, 0x28, 0xd4, 0x38, 0xbd, 0xdd, 0x3a, 0x1c, 0xcf, 0x3c,
0xab, 0xf4, 0x3d, 0xd5, 0xcb, 0xce, 0x97, 0xa8, 0x3e, 0x2c, 0xc9, 0xf3,
0x80, 0xfa, 0x3b, 0xbf, 0xc9, 0x27, 0x61, 0xe5, 0x37, 0x24, 0xca, 0x07,
0x3e, 0x3a, 0x3a, 0x90, 0xca, 0x4a, 0x21, 0xca, 0x4d, 0x81, 0xca, 0x7f,
0x21, 0x11, 0x5f, 0xb3, 0xcb, 0x54, 0x1e, 0x5e, 0x78, 0x36, 0xcb, 0x1b,
0x1b, 0x9f, 0x22, 0x16, 0xb4, 0x7f, 0xe4, 0xb0, 0x20, 0x65, 0xba, 0xde,
0xe7, 0x79, 0x22, 0x5f, 0xc1, 0x24, 0xe5, 0xa1, 0x24, 0x5f, 0xc8, 0x5e,
0xe4, 0x7e, 0x28, 0x1b, 0xd0, 0xe8, 0xe3, 0x61, 0x2e, 0x1f, 0xd6, 0xad,
0xdd, 0x06, 0x3d, 0x04, 0xcc, 0xeb, 0xc7, 0xc4, 0x46, 0xff, 0xc5, 0xe4,
0xb5, 0x3f, 0x50, 0x62, 0xbf, 0xc6, 0xa3, 0x40, 0x54, 0x8d, 0xbd, 0x00,
0x91, 0x0b, 0x56, 0xb5, 0xbb, 0x8a, 0x7a, 0x53, 0x57, 0xb8, 0xba, 0x50,
0x60, 0x03, 0x59, 0xcc, 0xbb, 0x9b, 0x42, 0x65, 0x5d, 0xb6, 0xbd, 0xbb,
0x2b, 0xe9, 0x68, 0xb2, 0xbf, 0xdc, 0x1a, 0x6a, 0x7b, 0x26, 0xc6, 0xec,
0x17, 0xe4, 0x89, 0x3f, 0xc8, 0xd9, 0x13, 0xea, 0x26, 0x7c, 0xaa, 0xdb,
0xe2, 0x83, 0x26, 0xdb, 0xb1, 0xd0, 0xe4, 0xa1, 0x28, 0xe7, 0xb6, 0x6a,
0xe6, 0x3c, 0x2b, 0xdb, 0xc0, 0x17, 0xe8, 0xb1, 0x35, 0x35, 0xc9, 0x5e,
0xe9, 0x38, 0x46, 0x4c, 0xc3, 0x2c, 0xd2, 0x35, 0x52, 0x32, 0xbc, 0x5c,
0xbd, 0x7c, 0x5c, 0x58, 0xb5, 0x48, 0xab, 0x93, 0x63, 0x1c, 0xb1, 0x57,
0x9a, 0x93, 0x67, 0x2c, 0xae, 0xfa, 0x89, 0x28, 0x6a, 0xd2, 0xad, 0xe1,
0x74, 0x01, 0x6e, 0x53, 0xad, 0xd3, 0x5e, 0x11, 0x73, 0xbf, 0xae, 0xcd,
0x48, 0x90, 0x79, 0x2a, 0xb1, 0xb8, 0x35, 0x96, 0x7e, 0x4e, 0xb4, 0xcb,
0x24, 0x23, 0x83, 0xd4, 0xba, 0x0a, 0x14, 0x0d, 0x93, 0x66, 0xc2, 0x5d,
0x15, 0x61, 0x29, 0x71, 0x9e, 0x74, 0xe2, 0x59, 0x2b, 0x19, 0xa4, 0xc2,
0xe3, 0x58, 0x2f, 0xc4, 0xaa, 0xc2, 0xe3, 0xa0, 0x38, 0x46, 0xb3, 0x49,
0xe7, 0x5c, 0x4d, 0xe2, 0xb5, 0x3f, 0xda, 0xc7, 0x58, 0xc0, 0xb2, 0xaf,
0xcb, 0xd9, 0x63, 0x58, 0xac, 0xc3, 0xb8, 0xbd, 0x6c, 0x1f, 0xa9, 0x0b,
0xa6, 0x6f, 0x72, 0xf1, 0xa6, 0x14, 0x95, 0xd7, 0x78, 0x05, 0xa4, 0x5d,
0x84, 0x36, 0x7c, 0x35, 0xa3, 0xc5, 0x70, 0xb2, 0x80, 0x3e, 0xa4, 0x8c,
0x5e, 0x15, 0x84, 0x46, 0xa6, 0x05, 0x4b, 0xab, 0x87, 0xe1, 0xa9, 0x4e,
0x39, 0x64, 0x8c, 0xa9, 0xac, 0x39, 0x29, 0xf8, 0x91, 0x46, 0xb0, 0x2e,
0x19, 0xeb, 0x9d, 0x82, 0xbc, 0xef, 0x19, 0x86, 0x2b, 0xdf, 0x94, 0x50,
0xe2, 0xff, 0x2e, 0xe1, 0x99, 0xb3, 0xe3, 0x93, 0x34, 0x6b, 0x9e, 0xdc,
0xe4, 0xa5, 0x4b, 0xff, 0xa5, 0xfd, 0xe4, 0x8e, 0x5e, 0x1f, 0xa7, 0x53,
0xd9, 0xe5, 0x68, 0xb1, 0xa2, 0xc1, 0xc8, 0xae, 0x73, 0x20, 0xa0, 0xcc,
0xb8, 0x0e, 0x7b, 0xc9, 0x9e, 0xc3, 0xa5, 0xb7, 0x83, 0x07, 0x9d, 0x41,
0x94, 0x9e, 0x88, 0x18, 0x9c, 0x5b, 0x82, 0x49, 0x8b, 0xda, 0x9c, 0x37,
0x70, 0x42, 0x8e, 0xea, 0x9d, 0x5a, 0x5e, 0x76, 0x91, 0x72, 0x9f, 0x8f,
0x4e, 0x0f, 0x94, 0x44, 0xa2, 0x6d, 0x3d, 0x9c, 0x97, 0x71, 0xa5, 0x7c,
0x2d, 0xd9, 0x99, 0xa5, 0xa9, 0x90, 0x1f, 0x09, 0xa8, 0x7b, 0xb5, 0xc3,
0x1e, 0xb9, 0x2e, 0x65, 0x85, 0xd4, 0xe6, 0x2e, 0x33, 0x7e, 0x8c, 0x65,
0xe4, 0xe3, 0x49, 0x7e, 0x91, 0xc8, 0xe4, 0x16, 0x5d, 0xb2, 0x98, 0xaa,
0xe3, 0xb7, 0x6f, 0x5a, 0x9b, 0x79, 0xda, 0x88, 0x7a, 0xea, 0x99, 0x92,
0xca, 0x2f, 0x84, 0x8d, 0x96, 0xf1, 0xb8, 0x3a, 0x8c, 0xe1, 0x96, 0x3b,
0xa6, 0xc3, 0x94, 0x1b, 0x95, 0x27, 0x95, 0x5c, 0x97, 0x67, 0x95, 0x07,
0x82, 0xbd, 0x9a, 0x3d, 0x94, 0xd1, 0x70, 0xa9, 0x9c, 0x5d, 0x95, 0xac,
0x5f, 0x3f, 0x9e, 0x3e, 0x98, 0x79, 0x4f, 0x84, 0xa0, 0x64, 0x9b, 0xcf,
0x3f, 0xad, 0xa2, 0xa6, 0x9f, 0x19, 0x30, 0x9c, 0xa4, 0xe4, 0xa2, 0x0b,
0x21, 0x79, 0xb0, 0xd7, 0xaf, 0x30, 0x20, 0xee, 0x32, 0xbc, 0x75, 0x25,
0xe6, 0xc1, 0x48, 0xd7, 0x7e, 0xc8, 0xe6, 0xd3, 0x5b, 0x87, 0x84, 0x65,
0xe6, 0x14, 0x70, 0xad, 0x8b, 0x86, 0xe4, 0xae, 0x82, 0xb7, 0x91, 0x85,
0xdf, 0x8c, 0x8d, 0xf0, 0x90, 0x88, 0xcc, 0x5e, 0x97, 0x54, 0x8f, 0x32,
0xba, 0x74, 0x9d, 0x9b, 0x8e, 0xba, 0xa8, 0xb3, 0xa2, 0xcc, 0x8d, 0xdb,
0x96, 0x59, 0xa6, 0x27, 0x8c, 0xc2, 0x83, 0x40, 0xa8, 0x91, 0x8c, 0x43,
0x71, 0x0b, 0xaa, 0x5d, 0x8c, 0xff, 0x60, 0x2b, 0xac, 0x11, 0x8f, 0x2c,
0x4f, 0xd6, 0xad, 0xc4, 0x92, 0x4c, 0x3f, 0xa3, 0xaf, 0x37, 0x95, 0x66,
0x30, 0xc0, 0xb1, 0x1a, 0x98, 0x84, 0x22, 0x11, 0xb9, 0x8e, 0xa3, 0x12,
0x21, 0x43, 0x46, 0x41, 0x6a, 0x10, 0xec, 0x29, 0x5a, 0x3a, 0x72, 0x0c,
0xea, 0x5c, 0x70, 0x83, 0x77, 0x72, 0xe8, 0xf6, 0x87, 0x35, 0x80, 0xbd,
0xe7, 0xc3, 0x98, 0x32, 0x88, 0x5b, 0xe3, 0xb5, 0xa1, 0x76, 0x88, 0x62,
0xcf, 0xe9, 0xa8, 0xac, 0x88, 0x21, 0xbe, 0x8f, 0xad, 0x48, 0x87, 0xb7,
0xac, 0x8c, 0xb1, 0x37, 0x85, 0x8f, 0x97, 0x91, 0xb3, 0xe1, 0x83, 0xd5,
0x84, 0x08, 0xb5, 0xfb, 0x83, 0x71, 0x71, 0xd7, 0xb7, 0x0b, 0x83, 0xef,
0x61, 0x15, 0xb8, 0x2b, 0x85, 0x57, 0x4f, 0xda, 0xb9, 0x74, 0x87, 0xbc,
0x3e, 0xa6, 0xba, 0xd1, 0x8a, 0x60, 0x2f, 0x63, 0xbb, 0xe3, 0x8c, 0x8b,
0x1f, 0x59, 0xc2, 0xf5, 0x96, 0x2f, 0x1e, 0x97, 0x2d, 0x17, 0x2e, 0xaa,
0xd2, 0x92, 0x72, 0x9d, 0x61, 0xa0, 0xef, 0x5a, 0x88, 0x8a, 0x6b, 0xa5,
0xec, 0xb0, 0x97, 0x91, 0x74, 0xd7, 0xeb, 0x74, 0xad, 0xa0, 0x80, 0x3a,
0xea, 0xef, 0xb3, 0x4b, 0x80, 0xf8, 0xd6, 0x91, 0xb8, 0x2b, 0x80, 0xb2,
0xc3, 0xc1, 0xbb, 0x43, 0x7f, 0x62, 0xaf, 0x2b, 0xbf, 0x13, 0x7c, 0x5b,
0x98, 0xb4, 0xc0, 0x54, 0x7a, 0x5c, 0x85, 0x38, 0xc1, 0x51, 0x79, 0x54,
0x73, 0x50, 0xc2, 0x48, 0x79, 0x9e, 0x61, 0xea, 0xc3, 0x43, 0x7a, 0xaa,
0x4f, 0x9b, 0xc4, 0x2b, 0x7c, 0xc2, 0x3c, 0xf8, 0xc5, 0x7d, 0x7e, 0xb4,
0x2b, 0x76, 0xc6, 0x10, 0x80, 0xc9, 0x1a, 0xd1, 0xc8, 0x3c, 0x8a, 0x99,
0x1b, 0x9e, 0x2d, 0x31, 0x2e, 0x99, 0xd2, 0x9b, 0x86, 0x19, 0x56, 0x95,
0xf3, 0xe1, 0x98, 0x97, 0x5f, 0xfc, 0xec, 0x34, 0xa9, 0x42, 0x66, 0x69,
0xe9, 0x79, 0xba, 0x4e, 0x70, 0xe4, 0xea, 0x9b, 0xc4, 0xa3, 0x78, 0xcb,
0xdf, 0xbf, 0xc6, 0xa4, 0x77, 0x64, 0xca, 0xc5, 0xc8, 0xaa, 0x75, 0x94,
0xb4, 0x33, 0xca, 0xcc, 0x71, 0xd7, 0x9d, 0xdd, 0xcb, 0xd7, 0x6f, 0x52,
0x88, 0xeb, 0xcc, 0xaf, 0x6d, 0x60, 0x75, 0x51, 0xcd, 0x69, 0x6c, 0x72,
0x61, 0xb3, 0xce, 0xa2, 0x6c, 0xc0, 0x4d, 0xd5, 0xcf, 0xe0, 0x6e, 0x98,
0x39, 0xaa, 0xd0, 0xc0, 0x71, 0xea, 0x26, 0xcb, 0xcd, 0x6a, 0x79, 0xf4,
0x22, 0xba, 0xcc, 0x83, 0x83, 0x18, 0x20, 0xad, 0x8c, 0xa1, 0x3c, 0x5e,
0xf6, 0x48, 0x9a, 0x3f, 0x45, 0x2d, 0xf1, 0x4f, 0xa7, 0x19, 0x4d, 0xdc,
0xec, 0x6f, 0xb7, 0x9a, 0x5b, 0x47, 0xe9, 0x60, 0xc8, 0x06, 0x62, 0xb8,
0xe9, 0x84, 0xd3, 0x35, 0x6e, 0xfb, 0xe8, 0xa4, 0xd4, 0xc9, 0x6d, 0x0a,
0xd3, 0x43, 0xd7, 0x16, 0x69, 0x9c, 0xba, 0xa6, 0xd8, 0x44, 0x65, 0x9f,
0xa2, 0x19, 0xd8, 0xb1, 0x62, 0x4b, 0x8c, 0x07, 0xd8, 0x89, 0x5f, 0xe1,
0x77, 0x53, 0xd8, 0xf8, 0x5d, 0x7d, 0x62, 0x45, 0xda, 0x4c, 0x5d, 0xc5,
0x4b, 0x84, 0xdc, 0x8c, 0x5d, 0x6f, 0x36, 0xbd, 0xd4, 0x0b, 0x62, 0x83,
0x2a, 0x59, 0xd0, 0x0a, 0x6d, 0xef, 0x26, 0x0e, 0xce, 0xc4, 0x76, 0xef,
0x24, 0x16, 0x96, 0x13, 0x32, 0xf3, 0xed, 0x62, 0xa6, 0x35, 0x36, 0x76,
0xec, 0xff, 0xb6, 0x4d, 0x3b, 0x7a, 0xf0, 0x05, 0xc5, 0x34, 0x4a, 0xf6,
0xec, 0xc3, 0xd0, 0x52, 0x53, 0xab, 0xe8, 0x5a, 0xd5, 0xfd, 0x57, 0x7a,
0xdd, 0x5b, 0xdb, 0xb7, 0x59, 0xd5, 0xd3, 0x5e, 0xe0, 0x0b, 0x54, 0x62,
0xb9, 0x68, 0xde, 0xd2, 0x51, 0x2e, 0x9f, 0xa8, 0xe0, 0xf7, 0x4b, 0xcf,
0x88, 0xeb, 0xe2, 0x46, 0x47, 0x14, 0x74, 0x34, 0xe0, 0x52, 0x41, 0x36,
0x5b, 0xcf, 0xdd, 0x46, 0x3a, 0xbc, 0x41, 0x34, 0xd8, 0xa5, 0x41, 0x17,
0x31, 0x80, 0xd3, 0xfd, 0x4f, 0xe2, 0x2b, 0xd3, 0xd1, 0xaa, 0x5d, 0x8e,
0x28, 0xcc, 0xcf, 0xb8, 0x6a, 0xef, 0x26, 0x0a, 0xa2, 0x65, 0x30, 0xad,
0xe6, 0xa2, 0xa7, 0xa1, 0x34, 0x03, 0xdf, 0xe9, 0xb5, 0x56, 0x35, 0xb6,
0xe4, 0xfe, 0xd2, 0xc8, 0x38, 0x65, 0xee, 0x50, 0xd9, 0xf3, 0x37, 0xc1,
0xe2, 0x05, 0xd9, 0xf6, 0x42, 0xc1, 0xda, 0xdc, 0xdd, 0x7b, 0x44, 0x36,
0xce, 0xdd, 0xdc, 0xae, 0x3a, 0xcd, 0xb0, 0x56, 0xdc, 0x11, 0x36, 0x11,
0x95, 0x74, 0xdc, 0x77, 0x34, 0x84, 0x80, 0xd4, 0xda, 0x51, 0x32, 0x15,
0x6b, 0xe8, 0xd9, 0x7f, 0x30, 0xfb, 0x57, 0x52, 0xd9, 0x93, 0x2f, 0x29,
0x40, 0x3b, 0xd3, 0x72, 0x2f, 0x31, 0x30, 0x04, 0xd0, 0xdf, 0x2f, 0x8c,
0x2d, 0x5d, 0xd1, 0xb0, 0x4b, 0x17, 0x2a, 0x57, 0xd1, 0x62, 0x5a, 0xb0,
0x28, 0x78, 0xa9, 0x7f, 0x2f, 0x1c, 0xe3, 0xe2, 0xb5, 0x58, 0x2f, 0x92,
0xe4, 0x36, 0xc8, 0x21, 0x32, 0xed, 0xe3, 0x2c, 0xd5, 0x76, 0x32, 0xd7,
0xdf, 0x44, 0xd7, 0x87, 0x33, 0xf9, 0xdb, 0xd0, 0xd9, 0x88, 0x33, 0xfd,
0xd8, 0xa3, 0xd9, 0xe0, 0x32, 0x7d, 0xc4, 0xc9, 0xda, 0x51, 0x31, 0x0b,
0xad, 0x4c, 0xda, 0x29, 0x2f, 0xfc, 0x94, 0x2d, 0xd8, 0xea, 0x2e, 0xa8,
0x7f, 0xec, 0xd7, 0x4a, 0x2d, 0xa7, 0x6c, 0x13, 0xd7, 0x73, 0x2d, 0x0f,
0x5a, 0xd1, 0xd8, 0x3b, 0x2a, 0xf3, 0x42, 0x39, 0xd2, 0x5f, 0x2c, 0xcf,
0x2f, 0x9e, 0xd0, 0xa2, 0x2d, 0x96, 0x2d, 0xa1, 0xcf, 0x8a, 0x2e, 0x1a,
0x2c, 0x64, 0xce, 0xc8, 0x2e, 0x7a, 0x2b, 0x8f, 0x1e, 0xd6, 0xce, 0x23,
0xde, 0xc8, 0x1e, 0x9e, 0xd2, 0x98, 0xde, 0x54, 0x1c, 0x9c, 0xdd, 0xf2,
0xdf, 0x18, 0x1c, 0x07, 0xdf, 0x57, 0xdd, 0x0d, 0x24, 0x2d, 0xc5, 0x47,
0xbb, 0x49, 0x20, 0x01, 0xcf, 0x01, 0xbe, 0x19, 0x23, 0xbb, 0xc5, 0x97,
0xb0, 0x40, 0x2b, 0x06, 0xd2, 0x2e, 0xae, 0x0b, 0x2d, 0xab, 0xcd, 0xf9,
0x9f, 0xcd, 0x2f, 0x07, 0xcb, 0xb7, 0x94, 0x00, 0x2e, 0xa3, 0xcb, 0x54,
0x85, 0xac, 0x2e, 0x3c, 0xcb, 0xd6, 0x75, 0xbb, 0x2b, 0x36, 0xcd, 0xad,
0x5e, 0x17, 0x28, 0x04, 0xcf, 0x16, 0x2f, 0x1c, 0x28, 0x5c, 0xce, 0xdf,
0x2c, 0x18, 0x29, 0x45, 0xce, 0x52, 0x29, 0xf5, 0x2a, 0x7c, 0xcd, 0x93,
0x28, 0xe0, 0x20, 0x7c, 0xc9, 0x05, 0xdf, 0x6a, 0x1f, 0x5b, 0xcf, 0x57,
0xe0, 0x08, 0x1c, 0xe0, 0xd7, 0xc0, 0xe1, 0x6d, 0x1c, 0xe0, 0xdf, 0xd0,
0xe0, 0x78, 0x1d, 0x37, 0xe1, 0x62, 0xdb, 0xc8, 0x22, 0xf0, 0xdd, 0x9a,
0xd0, 0xff, 0x24, 0x8c, 0xdb, 0x7a, 0xc6, 0x80, 0x2a, 0x7f, 0xd5, 0x35,
0xb5, 0x5c, 0x2d, 0xad, 0xcf, 0x9b, 0xa4, 0xd3, 0x2e, 0xeb, 0xcc, 0x2f,
0x95, 0xcc, 0x2e, 0x9e, 0xcb, 0x54, 0x83, 0xc4, 0x2d, 0x94, 0xcc, 0xed,
0x6d, 0x25, 0x2c, 0x6a, 0xce, 0xd2, 0x52, 0x36, 0x29, 0x36, 0xcf, 0x8d,
0x2e, 0xa2, 0x29, 0xa6, 0xcf, 0x3b, 0x2a, 0x94, 0x2b, 0x2c, 0xce, 0x12,
0x28, 0xbc, 0x2c, 0x48, 0xcd, 0x3b, 0x27, 0xb4, 0x1f, 0xa1, 0xc6, 0x78,
0xe3, 0x43, 0x21, 0xa2, 0xc9, 0xcb, 0xe0, 0x87, 0x20, 0xfb, 0xd0, 0x65,
0xe1, 0x1c, 0x1e, 0x8f, 0xda, 0x96, 0xe2, 0xc4, 0x1e, 0x82, 0xe2, 0x5e,
0xe2, 0x09, 0x22, 0x4a, 0xe1, 0x92, 0xd8, 0x4e, 0x27, 0xb3, 0xde, 0x5c,
0xcc, 0x79, 0x2b, 0xa4, 0xd9, 0xe7, 0xbe, 0x53, 0x2f, 0xa5, 0xd2, 0xe6,
0xab, 0x36, 0x2f, 0x42, 0xcc, 0xdc, 0x97, 0xb5, 0x2e, 0xb3, 0xcb, 0x45,
0x81, 0xa2, 0x2d, 0x5b, 0xce, 0x5c, 0x65, 0x9f, 0x2b, 0xb7, 0xd2, 0x11,
0x41, 0xa8, 0x2c, 0x0b, 0xd0, 0x9c, 0x2d, 0x96, 0x2c, 0xfc, 0xcf, 0x5b,
0x28, 0x5f, 0x49, 0xd0, 0xd0, 0x5b, 0x22, 0x0b, 0x53, 0x44, 0xcf, 0x5d,
0x20, 0x25, 0x20, 0x3f, 0xbf, 0x52, 0xe5, 0xe4, 0x21, 0x84, 0xc4, 0xbe,
0xe4, 0xbc, 0x23, 0xfe, 0xca, 0x83, 0xe1, 0xb9, 0x24, 0x85, 0xd1, 0x86,
0xe2, 0x42, 0x23, 0x36, 0xdd, 0x98, 0xe4, 0x48, 0x28, 0x4c, 0xe3, 0x48,
0xe1, 0x21, 0x2e, 0xa4, 0xe1, 0xa4, 0xd4, 0xc5, 0x37, 0xf1, 0xe3, 0x65,
0xcb, 0x4d, 0x3f, 0xbe, 0xdf, 0x22, 0xb8, 0xa6, 0x44, 0xf2, 0xdb, 0x50,
0xa2, 0xa0, 0x45, 0x2f, 0xda, 0x5b, 0x8a, 0x2b, 0x43, 0x84, 0xd9, 0x99,
0x69, 0x3b, 0x3f, 0x18, 0xdb, 0x12, 0x43, 0xd5, 0x44, 0x21, 0xd7, 0x4a,
0x29, 0x6a, 0x53, 0x19, 0xd1, 0xa7, 0x21, 0x42, 0x70, 0x95, 0xd1, 0x0b,
0x1e, 0x80, 0x7a, 0xb1, 0xce, 0x6f, 0x1d, 0x97, 0x24, 0x8c, 0xb5, 0x74,
0xe5, 0x57, 0x23, 0xab, 0xbd, 0x17, 0xe7, 0xf1, 0x25, 0x70, 0xc3, 0x6f,
0xe6, 0xbe, 0x28, 0x39, 0xca, 0xea, 0xe5, 0x16, 0x2f, 0x96, 0xd3, 0x10,
0xe3, 0x4d, 0x3a, 0xe8, 0xdf, 0xe9, 0xe5, 0x24, 0x47, 0x3a, 0xda, 0x4e,
0xd4, 0x2f, 0x50, 0xe4, 0xd3, 0x24, 0xc1, 0xfc, 0x57, 0xdf, 0xce, 0x1f,
0xaf, 0x00, 0x5c, 0xeb, 0xcb, 0x00, 0x9b, 0xb2, 0x5e, 0x7a, 0xca, 0x0b,
0x83, 0xda, 0x5f, 0xe3, 0xc9, 0xa4, 0x69, 0x89, 0x61, 0xb3, 0xca, 0xc3,
0x4c, 0x7e, 0x69, 0xb1, 0xcc, 0xe0, 0x31, 0xa3, 0x72, 0xf6, 0xce, 0x6f,
0x1d, 0xdb, 0x7b, 0x2d, 0xcb, 0xfa, 0x1b, 0xa4, 0x90, 0x6a, 0xcb, 0xc6,
0x17, 0x52, 0x28, 0x83, 0xad, 0x5d, 0xe3, 0x82, 0x29, 0x58, 0xb4, 0x7f,
0xe5, 0xc8, 0x2b, 0x19, 0xb9, 0x7b, 0xe8, 0x0d, 0x2f, 0xd8, 0xc2, 0x24,
0xe8, 0xd7, 0x3f, 0x5a, 0xcb, 0xee, 0xe6, 0xd9, 0x52, 0xfc, 0xcd, 0x42,
0xd9, 0xb9, 0x5b, 0x91, 0xc9, 0x4f, 0xca, 0x7a, 0x65, 0x94, 0xc2, 0xca,
0xb8, 0x6f, 0x6c, 0x71, 0xbf, 0x5d, 0xa7, 0x39, 0x71, 0x43, 0xbc, 0x66,
0x94, 0x8b, 0x74, 0xa8, 0xbb, 0xca, 0x7f, 0x5a, 0x78, 0x49, 0xbb, 0xdd,
0x68, 0x6e, 0x7c, 0xd1, 0xbc, 0xb2, 0x50, 0xc0, 0x82, 0x1d, 0xbf, 0x14,
0x3a, 0x4a, 0x87, 0x35, 0xc2, 0x07, 0x27, 0x90, 0x89, 0x61, 0xc2, 0x81,
0x15, 0xa5, 0x96, 0x9c, 0xc7, 0x67, 0x12, 0x8b, 0x2b, 0x8d, 0xa0, 0xb9,
0xe2, 0xe6, 0x2d, 0x96, 0xa7, 0x1d, 0xe4, 0x03, 0x31, 0xd4, 0xac, 0xba,
0xe4, 0xdc, 0x40, 0x47, 0xb6, 0xbc, 0xe8, 0x83, 0x57, 0x49, 0xbf, 0x40,
0xe3, 0x9c, 0x63, 0x0b, 0xbc, 0xef, 0xd4, 0x0a, 0x6d, 0x58, 0xb8, 0x9d,
0xc3, 0xc5, 0x76, 0x37, 0xb5, 0x12, 0xb2, 0x5f, 0x7d, 0x81, 0xb2, 0xa8,
0xa1, 0xbc, 0x82, 0x7d, 0xb0, 0xc2, 0x8f, 0xfd, 0x86, 0x9c, 0xaf, 0xa9,
0x7b, 0x8e, 0x8a, 0xa8, 0xb0, 0x1d, 0x67, 0xc1, 0x8d, 0xf3, 0xb1, 0x75,
0x54, 0x05, 0x90, 0xfe, 0xb4, 0x53, 0x40, 0xce, 0x93, 0x98, 0xb7, 0x77,
0x2e, 0x91, 0x97, 0xc2, 0xb9, 0xa1, 0x1c, 0x77, 0xa1, 0x3d, 0xc2, 0x1e,
0x19, 0x80, 0x2d, 0xf3, 0x96, 0xd6, 0xe3, 0x54, 0x31, 0x34, 0x9c, 0x39,
0xe4, 0x01, 0x3c, 0xbd, 0xa0, 0x4f, 0xe4, 0x81, 0x54, 0x5c, 0xa9, 0x27,
0xe5, 0x05, 0x67, 0x34, 0xaf, 0x61, 0xe1, 0xee, 0x73, 0x9e, 0xaf, 0x02,
0xd2, 0xc6, 0x7d, 0x32, 0xab, 0x49, 0xc2, 0x67, 0x86, 0x07, 0xa9, 0xa3,
0xb0, 0xfe, 0x8d, 0x93, 0xa8, 0x5a, 0x9f, 0xa5, 0x92, 0x9d, 0xa7, 0x4c,
0x8c, 0xfb, 0x96, 0x2b, 0xa6, 0xed, 0x7a, 0x2a, 0x98, 0xd6, 0xa7, 0x8d,
0x67, 0x8f, 0x9b, 0x03, 0xa9, 0x4a, 0x55, 0xd6, 0x9d, 0x45, 0xac, 0x22,
0x44, 0xfa, 0x9f, 0xef, 0xaf, 0x26, 0x34, 0x7e, 0xa2, 0x4d, 0xb2, 0x81,
0x24, 0xed, 0xac, 0x37, 0xbb, 0x0a, 0x1e, 0xbd, 0x30, 0xa4, 0x88, 0xac,
0xe6, 0x29, 0x3c, 0x77, 0x8f, 0x61, 0xe5, 0x44, 0x54, 0xa0, 0x93, 0x91,
0xe2, 0x68, 0x63, 0xc3, 0x9b, 0xc5, 0xe4, 0x7e, 0x78, 0xde, 0xa4, 0x7d,
0xe3, 0x1d, 0x85, 0x04, 0xa3, 0x18, 0xd3, 0x17, 0x8e, 0xf1, 0xa1, 0x3f,
0xc2, 0x7f, 0x97, 0xa0, 0xa0, 0xaa, 0xb1, 0x83, 0x9e, 0x7d, 0x9f, 0x8b,
0x9f, 0xc4, 0xa1, 0xc3, 0x9f, 0x85, 0x8c, 0xe3, 0xa4, 0x26, 0x9e, 0xc9,
0x7a, 0x5a, 0xa5, 0xd6, 0x9f, 0x5a, 0x68, 0x05, 0xa7, 0x7e, 0xa1, 0x3d,
0x57, 0x2f, 0xa8, 0xfc, 0xa4, 0x67, 0x47, 0x40, 0xab, 0x08, 0xa7, 0x7a,
0x37, 0x3b, 0xad, 0x69, 0xaa, 0x6a, 0x27, 0xe0, 0xb6, 0x05, 0xb4, 0x55,
0x21, 0xd2, 0x37, 0x73, 0x77, 0x9b, 0xe3, 0xad, 0x53, 0xd3, 0x80, 0x60,
0xe5, 0xb4, 0x63, 0x51, 0x86, 0x65, 0xe3, 0x24, 0x76, 0xe8, 0x8f, 0x33,
0xe5, 0x6c, 0x8d, 0x0e, 0x99, 0x5b, 0xe5, 0xa0, 0x99, 0x00, 0x99, 0xee,
0xd5, 0x3d, 0xa1, 0x61, 0x98, 0xd6, 0xc4, 0x64, 0xa8, 0x47, 0x98, 0xb0,
0xb3, 0x47, 0xad, 0x78, 0x98, 0x17, 0xa0, 0xce, 0xb0, 0x02, 0x96, 0xcf,
0x8d, 0x2a, 0xb1, 0xf3, 0x95, 0xfc, 0x7a, 0x86, 0xb3, 0x3a, 0x96, 0x1e,
0x68, 0xe0, 0xb4, 0x46, 0x97, 0xb1, 0x57, 0xac, 0xb5, 0xb1, 0x99, 0xf9,
0x47, 0x05, 0xb7, 0x1e, 0x9c, 0x91, 0x36, 0xf2, 0xb8, 0xc0, 0x9f, 0xa8,
0x27, 0xed, 0xbf, 0x2e, 0xa9, 0x37, 0x21, 0x88, 0x54, 0x03, 0x70, 0x02,
0xea, 0x75, 0x63, 0xe0, 0x74, 0xb1, 0xe8, 0x55, 0x78, 0x64, 0x7a, 0x34,
0xe9, 0x2c, 0x8a, 0x2c, 0x83, 0xf8, 0xe7, 0x1d, 0x9e, 0xe0, 0x8e, 0xe9,
0xe6, 0xd3, 0xac, 0xe9, 0x92, 0x6d, 0xd9, 0x5a, 0xb3, 0x4b, 0x92, 0x2e,
0xc9, 0x09, 0xb8, 0x17, 0x92, 0x14, 0xb7, 0x78, 0xbb, 0x0e, 0x8f, 0xf8,
0xa2, 0x20, 0xbd, 0x61, 0x8e, 0x1c, 0x8d, 0xbf, 0xbe, 0x73, 0x8d, 0x04,
0x7b, 0x46, 0xbf, 0x75, 0x8c, 0x9a, 0x69, 0xb1, 0xbf, 0xfc, 0x8d, 0x99,
0x58, 0x33, 0xc0, 0xbb, 0x8e, 0xde, 0x46, 0x8d, 0xc1, 0xa8, 0x90, 0xe9,
0x35, 0x0d, 0xc2, 0xcd, 0x93, 0x77, 0x24, 0xc9, 0xc5, 0xd3, 0x99, 0xea,
0x1e, 0xba, 0x6a, 0x58, 0x61, 0x5c, 0xef, 0x43, 0x7b, 0x6a, 0x67, 0x6a,
0xee, 0xb7, 0x8a, 0xf4, 0x70, 0x18, 0xed, 0xd6, 0x9c, 0x94, 0x78, 0x7b,
0xeb, 0x8d, 0xb1, 0xf1, 0x85, 0x1c, 0xea, 0xe0, 0xbe, 0x7e, 0x8b, 0xb0,
0xdf, 0x3e, 0xc2, 0x24, 0x8a, 0xe1, 0xce, 0xb6, 0xc4, 0xe0, 0x89, 0x9f,
0xba, 0x43, 0xc7, 0x38, 0x86, 0xd3, 0xa3, 0x99, 0xc8, 0x73, 0x84, 0xaa,
0x8f, 0x02, 0xc8, 0xdb, 0x83, 0x64, 0x7c, 0x63, 0xc9, 0x53, 0x82, 0xb0,
0x6a, 0x56, 0xca, 0x28, 0x82, 0xc5, 0x57, 0x62, 0xcb, 0x10, 0x83, 0xbd,
0x44, 0x20, 0xcb, 0xda, 0x85, 0x8d, 0x31, 0x75, 0xcc, 0xb2, 0x87, 0x8b,
0x20, 0xc6, 0xcc, 0x0d, 0x8e, 0xd6, 0x1d, 0xec, 0x76, 0xb3, 0x56, 0xe0,
0xf3, 0x17, 0x8a, 0xb2, 0x5d, 0xf3, 0xf1, 0x2e, 0x9c, 0xe6, 0x62, 0xd6,
0xeb, 0xb5, 0xad, 0x3d, 0x6b, 0x98, 0xe9, 0xb0, 0xbc, 0xcd, 0x77, 0x3d,
0xe8, 0x92, 0xcf, 0x3e, 0x83, 0x1e, 0xea, 0xd4, 0xd0, 0x13, 0x82, 0xa6,
0xd5, 0x28, 0xd2, 0x37, 0x80, 0x18, 0xbf, 0x56, 0xd3, 0xac, 0x7d, 0x0e,
0xa8, 0x02, 0xd3, 0xfa, 0x7a, 0x5e, 0x91, 0xe0, 0xd4, 0x2b, 0x78, 0x4f,
0x7e, 0x20, 0xd4, 0x13, 0x76, 0xb7, 0x6a, 0x67, 0xd4, 0xc1, 0x76, 0x70,
0x55, 0xcb, 0xd5, 0x8e, 0x77, 0x26, 0x40, 0x6e, 0xd6, 0xe7, 0x79, 0x4c,
0x2c, 0xe0, 0xd0, 0x9b, 0x7e, 0xf9, 0x25, 0xa5, 0xce, 0xc6, 0x87, 0x3d,
0x22, 0x92, 0x8e, 0x2c, 0x44, 0x64, 0xf4, 0xc5, 0x9f, 0x0b, 0x4a, 0xfc,
0xef, 0x82, 0xab, 0xbb, 0x54, 0x1b, 0xeb, 0x26, 0xba, 0x53, 0x61, 0x46,
0xe8, 0xd7, 0xc9, 0xda, 0x68, 0x23, 0xe8, 0xf1, 0xd6, 0xa8, 0x70, 0xeb,
0xe6, 0xfe, 0xd9, 0x46, 0x72, 0x47, 0xd7, 0xdc, 0xdc, 0xe5, 0x70, 0xe8,
0xc1, 0xae, 0xde, 0x0e, 0x6c, 0xb7, 0xa9, 0x5d, 0xdd, 0xd8, 0x69, 0x80,
0x91, 0xe4, 0xdd, 0x2a, 0x66, 0xb6, 0x7d, 0x1d, 0xda, 0xb6, 0x64, 0x9c,
0x66, 0xba, 0xde, 0xb1, 0x60, 0x42, 0x4f, 0x4b, 0xdf, 0x07, 0x63, 0x92,
0x39, 0xe7, 0xd5, 0x7d, 0x69, 0xf0, 0x2c, 0xa1, 0xd1, 0xba, 0x72, 0xa7,
0x28, 0x0d, 0xd0, 0x06, 0x7c, 0x45, 0x25, 0x5b, 0x98, 0xa5, 0x34, 0xe0,
0xef, 0x62, 0xac, 0x87, 0x39, 0xb6, 0xef, 0xd2, 0xbc, 0xba, 0x45, 0xf3,
0xee, 0x22, 0xc8, 0x17, 0x4e, 0x5f, 0xec, 0x6f, 0xd2, 0xcb, 0x5a, 0x5e,
0xe6, 0xb9, 0xd7, 0xab, 0x5d, 0xf5, 0xdd, 0xe2, 0xda, 0xd3, 0x5e, 0xd7,
0xd4, 0xf3, 0xdd, 0xba, 0x5b, 0xf3, 0xbb, 0xe3, 0xde, 0x99, 0x56, 0xab,
0xa1, 0x63, 0xde, 0x4b, 0x53, 0x52, 0x8b, 0x80, 0xde, 0xa4, 0x4f, 0xfc,
0x77, 0x00, 0xe0, 0xbe, 0x4a, 0x02, 0x5f, 0xf2, 0xdf, 0x6a, 0x45, 0x68,
0x46, 0x70, 0xdc, 0x34, 0x48, 0xf7, 0x34, 0x2b, 0xd6, 0x69, 0x59, 0x3c,
0x2d, 0x46, 0xd3, 0x99, 0x63, 0x05, 0x29, 0xe0, 0xd1, 0x03, 0x6f, 0x6d,
0x26, 0xfa, 0xa6, 0x9f, 0x32, 0x19, 0xe7, 0x51, 0xb1, 0xf5, 0x34, 0x07,
0xe9, 0x36, 0xc3, 0x03, 0x39, 0x2b, 0xed, 0xb5, 0xd3, 0xd4, 0x3e, 0x00,
0xee, 0x7e, 0xd8, 0x1b, 0x44, 0xa2, 0xde, 0x3b, 0xda, 0x7d, 0x48, 0x9c,
0xdb, 0x00, 0xde, 0xaa, 0x4a, 0x8a, 0xd1, 0x06, 0xde, 0xa2, 0x44, 0x3c,
0xb4, 0x44, 0xdd, 0xd9, 0x3c, 0x21, 0x98, 0x09, 0xdd, 0x66, 0x37, 0x35,
0x81, 0xdd, 0xdb, 0xea, 0x34, 0x86, 0x6d, 0x4d, 0xdb, 0x06, 0x33, 0xad,
0x58, 0xea, 0xda, 0x99, 0x31, 0xd2, 0x41, 0xf4, 0xd5, 0x09, 0x30, 0xd3,
0x31, 0x36, 0xd2, 0x00, 0x30, 0xb1, 0x2e, 0x34, 0xd3, 0x63, 0x55, 0x9e,
0x2a, 0xe8, 0xd2, 0x1a, 0x5e, 0x89, 0x29, 0x10, 0xad, 0x7c, 0x30, 0x63,
0xe5, 0x3b, 0xb7, 0x2e, 0x31, 0x19, 0xe5, 0xe2, 0xcf, 0x42, 0x33, 0xdb,
0xea, 0x8e, 0xd6, 0x5a, 0x35, 0x83, 0xdd, 0xf5, 0xd7, 0xda, 0x35, 0xb6,
0xdb, 0xb1, 0xd9, 0xaa, 0x35, 0xeb, 0xd8, 0xdd, 0xda, 0x50, 0x34, 0x5b,
0xc5, 0x04, 0xda, 0xd1, 0x33, 0x0f, 0xad, 0xc4, 0xda, 0xc9, 0x32, 0x05,
0x94, 0xc4, 0xda, 0x3a, 0x30, 0xb9, 0x80, 0xef, 0xd8, 0x89, 0x2f, 0x81,
0x6d, 0x14, 0xd7, 0xe8, 0x2e, 0x87, 0x59, 0xa6, 0xd9, 0x20, 0x2d, 0x2c,
0x43, 0xbb, 0xd3, 0x85, 0x2d, 0xf1, 0x30, 0x74, 0xd1, 0x86, 0x2e, 0x75,
0x2e, 0x45, 0xd0, 0x41, 0x2e, 0xd2, 0x2c, 0xed, 0xcf, 0x63, 0x2f, 0x15,
0x2c, 0x03, 0x1f, 0x9a, 0xd1, 0x6e, 0xe0, 0x9e, 0x1d, 0x1e, 0xd8, 0xaf,
0xe2, 0x46, 0x1d, 0x4a, 0xe0, 0xb1, 0xe1, 0x8b, 0x1d, 0x52, 0xe2, 0x6c,
0xdf, 0xc3, 0x22, 0xe4, 0xde, 0x41, 0xd3, 0xe1, 0x24, 0xe4, 0xdc, 0xde,
0xca, 0x44, 0x24, 0x37, 0xcf, 0xde, 0xba, 0x1a, 0x2c, 0x31, 0xd2, 0xd9,
0xae, 0x68, 0x2e, 0x32, 0xce, 0x45, 0x9f, 0xb3, 0x2f, 0x40, 0xcb, 0xc6,
0x93, 0x9f, 0x2e, 0xa8, 0xcb, 0x5a, 0x85, 0x3a, 0x2e, 0x69, 0xcb, 0xfe,
0x75, 0x2b, 0x2c, 0x00, 0xce, 0x12, 0x5e, 0x83, 0x29, 0xb7, 0xcf, 0xeb,
0x2f, 0xe5, 0x29, 0xf6, 0xcf, 0xb2, 0x2d, 0x37, 0x2a, 0x35, 0xcf, 0x7d,
0x2a, 0xc8, 0x2a, 0xf5, 0xce, 0xda, 0x29, 0x3e, 0x21, 0xbf, 0xca, 0x35,
0xe0, 0x74, 0x21, 0x1f, 0xd1, 0xfc, 0xe1, 0x21, 0x1e, 0xc5, 0xda, 0xcb,
0xe2, 0xd6, 0x1e, 0xf8, 0xe1, 0xe9, 0xe2, 0x33, 0x21, 0x32, 0xe2, 0x33,
0xdc, 0x30, 0x25, 0xc0, 0xde, 0xca, 0xd1, 0xd4, 0x26, 0xd2, 0xdc, 0xf6,
0xc7, 0x9a, 0x2c, 0x31, 0xd6, 0x3a, 0xb5, 0xfd, 0x2e, 0x7e, 0xd0, 0x1b,
0xa4, 0xe2, 0x2f, 0x31, 0xcc, 0x4c, 0x95, 0x74, 0x2e, 0xa4, 0xcb, 0x5e,
0x83, 0x2b, 0x2e, 0x07, 0xcd, 0x39, 0x6c, 0xec, 0x2e, 0x0e, 0xcf, 0xb2,
0x52, 0xda, 0x2b, 0x4b, 0xd0, 0x94, 0x2f, 0xc4, 0x2b, 0x91, 0xd0, 0x3f,
0x2c, 0x4b, 0x2b, 0xdd, 0xcf, 0xea, 0x29, 0x43, 0x2c, 0xda, 0xce, 0xbd,
0x28, 0x24, 0x21, 0xc8, 0xc8, 0x8f, 0xe3, 0x5d, 0x23, 0x6d, 0xca, 0xcf,
0xe1, 0x47, 0x24, 0x8c, 0xd2, 0x61, 0xe1, 0x2c, 0x21, 0x84, 0xdd, 0x40,
0xe3, 0xc4, 0x22, 0x0d, 0xe4, 0x0f, 0xe3, 0x5e, 0x26, 0x03, 0xe2, 0x90,
0xd8, 0xd3, 0x2a, 0xcb, 0xdf, 0x9d, 0xcd, 0x44, 0x2d, 0xdf, 0xdb, 0x4f,
0xbf, 0x6c, 0x30, 0xba, 0xd3, 0x75, 0xab, 0x7e, 0x30, 0x15, 0xcc, 0x55,
0x96, 0x8a, 0x2e, 0xa8, 0xc9, 0xc5, 0x80, 0x5b, 0x2e, 0xd2, 0xcd, 0xf4,
0x65, 0x93, 0x2e, 0xa2, 0xd3, 0x91, 0x42, 0x44, 0x2e, 0x7b, 0xd1, 0xdf,
0x2f, 0x8b, 0x2e, 0xb2, 0xd1, 0x49, 0x2a, 0x98, 0x4e, 0x9a, 0xd4, 0x1d,
0x22, 0xa7, 0x57, 0xbf, 0xd2, 0x79, 0x20, 0xb0, 0x22, 0xcd, 0xc1, 0x1a,
0xe5, 0xc7, 0x23, 0xf4, 0xc6, 0xde, 0xe4, 0xe0, 0x26, 0x21, 0xcb, 0xbb,
0xe2, 0x8a, 0x29, 0x54, 0xd3, 0x64, 0xe2, 0x04, 0x27, 0x0b, 0xe0, 0x63,
0xe5, 0x75, 0x2d, 0x8d, 0xe3, 0x63, 0xe0, 0xd5, 0x31, 0x82, 0xe2, 0x62,
0xd5, 0x2f, 0x3b, 0x5c, 0xe4, 0x4d, 0xcc, 0x1a, 0x44, 0x45, 0xe0, 0xe1,
0xba, 0x2d, 0x4a, 0xba, 0xdc, 0x16, 0xa3, 0xef, 0x49, 0x9f, 0xdc, 0x88,
0x8b, 0x46, 0x48, 0x7d, 0xdb, 0xc8, 0x6a, 0xa9, 0x45, 0x0f, 0xdd, 0x53,
0x45, 0xe0, 0x4b, 0x26, 0xda, 0x7b, 0x2e, 0x8c, 0x59, 0x69, 0xd9, 0x3c,
0x23, 0x95, 0x75, 0x03, 0xd3, 0x6d, 0x22, 0x64, 0x7d, 0x2f, 0xd1, 0xbf,
0x1f, 0x90, 0x26, 0xb9, 0xb6, 0x4b, 0xe5, 0xe6, 0x26, 0x86, 0xbe, 0xeb,
0xe7, 0xda, 0x28, 0x2c, 0xc5, 0x8f, 0xe6, 0xdd, 0x2b, 0x38, 0xcd, 0x49,
0xe4, 0xac, 0x33, 0x70, 0xd5, 0x59, 0xe3, 0xb3, 0x40, 0x70, 0xe0, 0x0d,
0xe3, 0x54, 0x4d, 0xcd, 0xe3, 0x5a, 0xdc, 0xb9, 0x5a, 0x77, 0xe0, 0xca,
0xce, 0xf2, 0x64, 0xbf, 0xd7, 0xc4, 0xb9, 0xc0, 0x68, 0xba, 0xd5, 0xda,
0xa5, 0x87, 0x6b, 0x57, 0xd4, 0xce, 0x8e, 0xde, 0x6e, 0x00, 0xd4, 0xb4,
0x75, 0x4a, 0x71, 0x39, 0xd5, 0x2f, 0x5a, 0x68, 0x74, 0x41, 0xda, 0xed,
0x37, 0x8c, 0x79, 0x21, 0xd8, 0xdd, 0x25, 0xa6, 0x83, 0x42, 0xd2, 0x16,
0x1f, 0x87, 0x95, 0x15, 0xcf, 0x3e, 0x1a, 0x5a, 0x2a, 0x43, 0xaf, 0xd5,
0xe4, 0x79, 0x2b, 0xd5, 0xb5, 0xad, 0xe6, 0x61, 0x2d, 0xcc, 0xbc, 0x4f,
0xe9, 0x5a, 0x32, 0x90, 0xc3, 0xe8, 0xe8, 0xd7, 0x4b, 0xab, 0xcf, 0x55,
0xe6, 0xa0, 0x5d, 0xd2, 0xd8, 0xa0, 0xe3, 0xf3, 0x67, 0x3f, 0xd4, 0xd1,
0xd4, 0x30, 0x6f, 0x5c, 0xcf, 0x79, 0xc4, 0x2b, 0x76, 0x3f, 0xcb, 0xa8,
0xb2, 0xf0, 0x7b, 0xa5, 0xc9, 0x01, 0x9f, 0x6c, 0x7f, 0x69, 0xc7, 0xcb,
0x8a, 0xd2, 0x83, 0x53, 0xc7, 0x74, 0x73, 0xe8, 0x86, 0xb5, 0xc7, 0xfe,
0x5b, 0x7c, 0x89, 0x4c, 0xca, 0x41, 0x43, 0x02, 0x8f, 0x1b, 0xcb, 0x89,
0x2b, 0xc8, 0x92, 0xf0, 0xcc, 0xbe, 0x17, 0xab, 0x9b, 0xd2, 0xcc, 0x37,
0x16, 0xe7, 0x2d, 0x5f, 0xa2, 0xf7, 0xe3, 0x6b, 0x30, 0x32, 0xa9, 0x1a,
0xe3, 0xff, 0x34, 0xcb, 0xae, 0xc5, 0xe4, 0x0d, 0x4c, 0xe1, 0xb8, 0xca,
0xe7, 0x77, 0x5d, 0x90, 0xc3, 0x56, 0xe5, 0x1d, 0x6e, 0x35, 0xc8, 0xe9,
0xde, 0x1a, 0x77, 0x78, 0xc5, 0x8d, 0xce, 0xf6, 0x80, 0x4b, 0xc1, 0xc5,
0xbe, 0x55, 0x87, 0xca, 0xbf, 0x1c, 0xad, 0xd1, 0x8c, 0xe3, 0xbd, 0x2a,
0x9b, 0x1a, 0x91, 0x1d, 0xbb, 0xf1, 0x86, 0xea, 0x95, 0x00, 0xbb, 0x95,
0x72, 0x20, 0x97, 0xba, 0xbc, 0x57, 0x5d, 0x79, 0x99, 0xee, 0xbe, 0x94,
0x49, 0x17, 0x9c, 0xf5, 0xc1, 0x22, 0x34, 0xcc, 0x9f, 0xce, 0xc3, 0x82,
0x21, 0x36, 0xa5, 0x06, 0xc7, 0x88, 0x19, 0x92, 0x2f, 0xb8, 0x99, 0x52,
0xe3, 0xa2, 0x33, 0x23, 0x9e, 0x7b, 0xe4, 0x7c, 0x45, 0x81, 0xa3, 0x35,
0xe3, 0xee, 0x5b, 0x41, 0xac, 0x2e, 0xe4, 0xa8, 0x6c, 0xf0, 0xb3, 0x80,
0xe2, 0xe9, 0x7e, 0x2c, 0xb8, 0xee, 0xda, 0x73, 0x87, 0xff, 0xb8, 0x10,
0xcc, 0x25, 0x90, 0x79, 0xb5, 0x2e, 0xbb, 0xaa, 0x98, 0x62, 0xb3, 0xbf,
0xaa, 0xcf, 0x9d, 0x38, 0xb2, 0xb8, 0x98, 0x14, 0xa0, 0xb0, 0xb2, 0x09,
0x84, 0xb5, 0xa3, 0x22, 0xb2, 0x6d, 0x71, 0x6e, 0xa4, 0x98, 0xb3, 0x7d,
0x5e, 0x90, 0xa6, 0x83, 0xb5, 0xe2, 0x4c, 0xc1, 0xa8, 0xc4, 0xb8, 0xa4,
0x3a, 0xb1, 0xaa, 0xf0, 0xbb, 0xc8, 0x29, 0xbd, 0xb1, 0x33, 0xc1, 0x84,
0x1e, 0x47, 0x33, 0x06, 0x8c, 0x4a, 0xe4, 0xdc, 0x44, 0xdf, 0x91, 0x92,
0xe4, 0xca, 0x5c, 0x03, 0x97, 0x13, 0xe3, 0x56, 0x6b, 0x1c, 0x9f, 0x50,
0xe5, 0x13, 0x7e, 0x7b, 0xa7, 0x22, 0xe4, 0x1b, 0x90, 0x29, 0xad, 0x71,
0xdc, 0x84, 0x99, 0x6a, 0xad, 0x06, 0xcc, 0xeb, 0xa2, 0x8b, 0xab, 0x49,
0xbc, 0x8e, 0xa9, 0x48, 0xaa, 0x58, 0xaa, 0x95, 0xac, 0x48, 0xaa, 0x30,
0x97, 0x82, 0xae, 0x75, 0xa9, 0x65, 0x84, 0x97, 0xaf, 0xd3, 0xa9, 0x4e,
0x71, 0x97, 0xb0, 0xe6, 0xaa, 0xc4, 0x5f, 0xa8, 0xb2, 0x45, 0xad, 0x4b,
0x4f, 0x16, 0xb3, 0xda, 0xb0, 0x50, 0x3e, 0xeb, 0xb5, 0xdd, 0xb3, 0x32,
0x2d, 0xed, 0xbb, 0x07, 0xb9, 0xed, 0x23, 0x7e, 0x47, 0xc9, 0x7f, 0x3c,
0xe6, 0xbb, 0x5a, 0xa5, 0x83, 0xf9, 0xe6, 0x05, 0x6a, 0x14, 0x8a, 0x0c,
0xe3, 0xf0, 0x7f, 0xb1, 0x92, 0xf0, 0xe6, 0x38, 0x93, 0x14, 0x9c, 0xd3,
0xe5, 0x15, 0xa3, 0xba, 0xa3, 0xe2, 0xde, 0xd7, 0xab, 0x62, 0xa3, 0xe7,
0xcf, 0x46, 0xb3, 0x17, 0xa3, 0x2e, 0xbe, 0xb9, 0xb7, 0xf5, 0xa2, 0x5a,
0xab, 0xa5, 0xba, 0x13, 0xa1, 0x44, 0x97, 0xa9, 0xbb, 0x6f, 0xa0, 0x47,
0x84, 0xca, 0xbc, 0x16, 0x9f, 0xf0, 0x72, 0x44, 0xbc, 0xcd, 0xa0, 0x95,
0x60, 0x86, 0xbd, 0xe6, 0xa2, 0x65, 0x4f, 0x38, 0xbf, 0x27, 0xa4, 0xa9,
0x3d, 0xe0, 0xc0, 0x41, 0xa7, 0x6f, 0x2c, 0xed, 0xc4, 0x1c, 0xad, 0xcc,
0x22, 0x2a, 0x59, 0x5e, 0x74, 0x98, 0xe9, 0xfd, 0x6e, 0x94, 0x78, 0x22,
0xe8, 0xa0, 0x7f, 0xcc, 0x7e, 0x53, 0xe6, 0xa2, 0x8d, 0x92, 0x87, 0x52,
0xe6, 0xd4, 0xa3, 0x4b, 0x92, 0xa6, 0xe7, 0x25, 0xb7, 0xcb, 0x9c, 0x83,
0xe3, 0xff, 0xbc, 0x31, 0x9c, 0x6b, 0xd3, 0x58, 0xc1, 0xc3, 0x9c, 0x5d,
0xc2, 0x1f, 0xc4, 0x2f, 0x9a, 0x43, 0xac, 0xc7, 0xc5, 0xc0, 0x98, 0x16,
0x98, 0x5e, 0xc6, 0x95, 0x96, 0xde, 0x85, 0x75, 0xc6, 0xdf, 0x96, 0x1e,
0x73, 0x1b, 0xc7, 0x29, 0x96, 0x3c, 0x61, 0x14, 0xc7, 0xc2, 0x97, 0x4b,
0x4e, 0xd9, 0xc8, 0x8d, 0x98, 0x68, 0x3c, 0x03, 0xc9, 0x98, 0x9a, 0x5c,
0x2a, 0x24, 0xcb, 0x40, 0x9f, 0xd7, 0x1f, 0xfc, 0x71, 0x7a, 0x64, 0x01,
0xee, 0xca, 0x82, 0x77, 0x6b, 0xf7, 0xeb, 0xaf, 0x8f, 0xff, 0x74, 0xd4,
0xea, 0xed, 0xa0, 0x1f, 0x7d, 0x82, 0xe9, 0xb9, 0xb6, 0x0d, 0x89, 0x48,
0xeb, 0x35, 0xc9, 0x3c, 0x95, 0xfe, 0xe9, 0xd0, 0xcc, 0x77, 0x95, 0x45,
0xd8, 0x65, 0xce, 0x52, 0x93, 0xc9, 0xc4, 0xe0, 0xd0, 0x0f, 0x91, 0x59,
0xae, 0xaa, 0xd0, 0xe5, 0x8f, 0x0a, 0x99, 0xe7, 0xd1, 0x12, 0x8d, 0x55,
0x86, 0x39, 0xd1, 0x31, 0x8c, 0x41, 0x73, 0x8e, 0xd1, 0x27, 0x8b, 0xa7,
0x60, 0x83, 0xd1, 0x97, 0x8c, 0x00, 0x4c, 0xc3, 0xd2, 0x1b, 0x8c, 0xa7,
0x38, 0x92, 0xd3, 0x1d, 0x8e, 0x40, 0x26, 0xa0, 0xd0, 0x08, 0x94, 0x24,
0x21, 0x56, 0x83, 0x42, 0x5b, 0xe6, 0xf2, 0xb6, 0x8e, 0xb3, 0x61, 0xc4,
0xed, 0x7a, 0x9e, 0x51, 0x67, 0x29, 0xe9, 0xc7, 0xb0, 0x08, 0x6f, 0x56,
0xea, 0xe8, 0xc0, 0x32, 0x7b, 0x7f, 0xe9, 0x30, 0xd0, 0x89, 0x85, 0xc3,
0xe7, 0xb2, 0xd7, 0x46, 0x89, 0xb0, 0xdc, 0x55, 0xdc, 0x07, 0x8a, 0xc2,
0xc9, 0xe1, 0xdd, 0x33, 0x87, 0x30, 0xb2, 0xe3, 0xdd, 0x18, 0x83, 0xd1,
0x9b, 0x72, 0xdb, 0x6d, 0x80, 0xe1, 0x86, 0x75, 0xda, 0x54, 0x7d, 0xbf,
0x71, 0x85, 0xd8, 0x63, 0x7c, 0xdd, 0x5b, 0x64, 0xd7, 0x50, 0x7c, 0xe2,
0x45, 0xd3, 0xd6, 0x5c, 0x7e, 0xf1, 0x32, 0x7c, 0xd3, 0xdb, 0x84, 0x06,
0x28, 0xa7, 0xd1, 0x1c, 0x8b, 0x6a, 0x24, 0x8e, 0x91, 0xff, 0x4b, 0x00,
0xf1, 0xd8, 0xa2, 0x88, 0x51, 0x25, 0xec, 0x97, 0xb0, 0x62, 0x5e, 0x8d,
0xe9, 0x18, 0xbd, 0x28, 0x63, 0x63, 0xe8, 0xc7, 0xcd, 0x72, 0x6d, 0xc3,
0xe9, 0x3b, 0xd7, 0xef, 0x74, 0x41, 0xe3, 0x19, 0xd8, 0xf9, 0x76, 0x7d,
0xd8, 0x5f, 0xdc, 0xa2, 0x75, 0xfe, 0xc4, 0x16, 0xdd, 0xda, 0x71, 0xf4,
0xab, 0x49, 0xdd, 0x7a, 0x6f, 0x08, 0x94, 0x11, 0xdb, 0xcc, 0x6c, 0xf4,
0x7e, 0xc1, 0xda, 0x5b, 0x69, 0xea, 0x69, 0x2c, 0xda, 0x55, 0x6a, 0x01,
0x53, 0x57, 0xdd, 0x51, 0x69, 0x59, 0x3c, 0x8c, 0xd8, 0x96, 0x6f, 0xfb,
0x2f, 0x75, 0xd3, 0xf2, 0x77, 0x8f, 0x29, 0xfc, 0xd1, 0xb5, 0x80, 0x4c,
0x26, 0xb7, 0x9d, 0x01, 0x37, 0x83, 0xf2, 0x09, 0xb1, 0x9b, 0x44, 0x4b,
0xec, 0x3f, 0xc0, 0x69, 0x4d, 0x52, 0xec, 0xd2, 0xcb, 0xe3, 0x57, 0x06,
0xeb, 0x06, 0xd5, 0x37, 0x60, 0x0f, 0xe5, 0xc5, 0xd8, 0x44, 0x60, 0x2f,
0xdd, 0xc2, 0xd9, 0xa5, 0x65, 0x5d, 0xd7, 0x23, 0xdd, 0x8d, 0x60, 0x15,
0xbd, 0x72, 0xde, 0xc3, 0x5c, 0x58, 0xa4, 0xed, 0xde, 0x1f, 0x58, 0xde,
0x8d, 0x99, 0xde, 0xc1, 0x56, 0x15, 0x79, 0x7d, 0xe0, 0x3b, 0x50, 0xab,
0x62, 0x75, 0xe1, 0x3a, 0x4d, 0xd1, 0x4a, 0xcb, 0xde, 0xf9, 0x52, 0x51,
0x36, 0xd0, 0xd8, 0xec, 0x5e, 0xa3, 0x2e, 0xf4, 0xd3, 0xa6, 0x69, 0xa2,
0x2a, 0x91, 0xd1, 0xeb, 0x73, 0x13, 0x28, 0x38, 0xac, 0x5d, 0x34, 0x22,
0xe9, 0x8b, 0xb6, 0x79, 0x35, 0xe6, 0xeb, 0x24, 0xcc, 0x34, 0x40, 0xa1,
0xef, 0xb8, 0xd1, 0x22, 0x46, 0xe3, 0xe9, 0x34, 0xd8, 0xb3, 0x4a, 0x49,
0xdd, 0xdd, 0xdb, 0x14, 0x50, 0x67, 0xdb, 0x7c, 0xdc, 0x64, 0x55, 0x17,
0xd2, 0x17, 0xe0, 0x33, 0x4b, 0xd7, 0xb8, 0x7c, 0xe0, 0xa4, 0x46, 0x39,
0x9c, 0xd1, 0xdf, 0x51, 0x3d, 0xbc, 0x84, 0xc0, 0xdd, 0x3e, 0x36, 0x97,
0x6e, 0x6e, 0xdc, 0x4d, 0x35, 0xfe, 0x5a, 0x3e, 0xdb, 0x6f, 0x34, 0x07,
0x43, 0x70, 0xd6, 0x9b, 0x32, 0x76, 0x32, 0x68, 0xd6, 0x8b, 0x45, 0x7f,
0x2e, 0xf0, 0xd5, 0x26, 0x5b, 0x74, 0x2b, 0xcc, 0xd3, 0x80, 0x63, 0xb8,
0x29, 0xb4, 0xab, 0xe9, 0x33, 0x81, 0xe2, 0x8d, 0xb4, 0x2b, 0x34, 0x7f,
0xe3, 0xdd, 0xd1, 0xaa, 0x36, 0x0a, 0xec, 0xd0, 0xd6, 0xb9, 0x36, 0xd5,
0xdd, 0xaf, 0xd8, 0x1e, 0x37, 0x21, 0xdb, 0x9a, 0xda, 0x0b, 0x39, 0xff,
0xd9, 0x3a, 0xda, 0xaf, 0x35, 0xf3, 0xc5, 0x36, 0xdb, 0x3b, 0x34, 0xb8,
0xae, 0x10, 0xdb, 0x4f, 0x33, 0xb1, 0x95, 0x2e, 0xdb, 0x5f, 0x32, 0x92,
0x81, 0xcb, 0xd9, 0xa4, 0x31, 0x27, 0x6d, 0xf3, 0xd8, 0xf2, 0x30, 0x50,
0x5a, 0xcd, 0xd9, 0xe5, 0x2f, 0x1c, 0x45, 0x15, 0xd4, 0xa9, 0x2f, 0x13,
0x31, 0x49, 0xd2, 0x66, 0x2f, 0x59, 0x2e, 0xee, 0xd0, 0xf9, 0x2f, 0x8b,
0x2d, 0x76, 0xd3, 0x6d, 0x58, 0x90, 0x2a, 0x92, 0x22, 0x02, 0xd3, 0x39,
0xe0, 0x7e, 0x1e, 0xe1, 0xda, 0xfa, 0xe2, 0xe0, 0x1f, 0x2f, 0xe1, 0xb3,
0xe2, 0x48, 0x20, 0x43, 0xe2, 0xfb, 0xe0, 0x02, 0x24, 0xdc, 0xdf, 0x0e,
0xd4, 0x66, 0x26, 0xb7, 0xdd, 0xa9, 0xca, 0xc3, 0x28, 0x47, 0xda, 0x8d,
0xc2, 0x0d, 0x2d, 0x1a, 0xd3, 0x58, 0xae, 0xa5, 0x2e, 0x95, 0xce, 0x75,
0x9f, 0x89, 0x2f, 0x6c, 0xcb, 0xc8, 0x93, 0x34, 0x2e, 0xaa, 0xcb, 0x60,
0x84, 0xa0, 0x2e, 0x8f, 0xcc, 0x22, 0x74, 0x99, 0x2c, 0x99, 0xce, 0x5e,
0x5e, 0xd5, 0x2b, 0x0c, 0xd0, 0x91, 0x30, 0x83, 0x2b, 0x3b, 0xd0, 0x56,
0x2e, 0x1a, 0x2b, 0x69, 0xd0, 0x22, 0x2b, 0xe3, 0x2b, 0x9a, 0xcf, 0xef,
0x29, 0xd6, 0x23, 0x1d, 0xca, 0xf9, 0xe1, 0x0b, 0x24, 0x18, 0xd3, 0xbb,
0xe0, 0xde, 0x20, 0xd6, 0xdd, 0x30, 0xe3, 0x8d, 0x21, 0x43, 0xe3, 0x0c,
0xe3, 0x0f, 0x24, 0x49, 0xe2, 0xd2, 0xdc, 0x79, 0x27, 0xe9, 0xdf, 0xa8,
0xd2, 0x6a, 0x28, 0x8f, 0xde, 0x0c, 0xc8, 0x67, 0x2d, 0x70, 0xd6, 0xee,
0xb6, 0x62, 0x2f, 0x0d, 0xd0, 0x69, 0xa4, 0xcf, 0x2f, 0x63, 0xcc, 0x53,
0x95, 0x0c, 0x2e, 0xa6, 0xcb, 0x63, 0x82, 0x90, 0x2e, 0x5a, 0xcd, 0x70,
0x6c, 0xa2, 0x2f, 0x3c, 0xd0, 0x52, 0x53, 0x3b, 0x2c, 0xcb, 0xd1, 0x4f,
0x30, 0x94, 0x2c, 0xf8, 0xd0, 0xfd, 0x2d, 0x8b, 0x2d, 0x26, 0xd0, 0xb3,
0x2a, 0xcd, 0x44, 0xb6, 0xd4, 0x35, 0x23, 0xbb, 0x24, 0x79, 0xca, 0x41,
0xe2, 0x1e, 0x24, 0xfe, 0xcb, 0xaf, 0xe1, 0xea, 0x27, 0x31, 0xd4, 0x70,
0xe1, 0x6b, 0x24, 0x07, 0xdf, 0xb4, 0xe4, 0x9d, 0x25, 0x52, 0xe4, 0x51,
0xe3, 0x69, 0x28, 0xa9, 0xe3, 0x36, 0xd9, 0x1f, 0x2c, 0xdc, 0xe0, 0x69,
0xcd, 0xbe, 0x2f, 0x51, 0xdc, 0x35, 0xc0, 0x2a, 0x30, 0xb6, 0xd3, 0x54,
0xaa, 0x91, 0x30, 0x1f, 0xcc, 0x20, 0x95, 0xdb, 0x2e, 0xdf, 0xc8, 0xff,
0x7f, 0x93, 0x2f, 0x31, 0xcd, 0xff, 0x65, 0x2b, 0x30, 0x6b, 0xd4, 0x79,
0x42, 0x5f, 0x2f, 0xf7, 0xd2, 0xa1, 0x30, 0xbc, 0x40, 0x96, 0xd6, 0x8f,
0x2a, 0x63, 0x52, 0x60, 0xd6, 0xd6, 0x27, 0x81, 0x77, 0x69, 0xd5, 0x0a,
0x23, 0x1f, 0x24, 0xce, 0xc1, 0xb6, 0xe6, 0x15, 0x26, 0x01, 0xc8, 0xee,
0xe4, 0xee, 0x27, 0xef, 0xcc, 0xbb, 0xe3, 0x30, 0x2c, 0x42, 0xd5, 0x85,
0xe2, 0x50, 0x29, 0xf1, 0xe2, 0xea, 0xe6, 0x54, 0x30, 0xab, 0xe3, 0x81,
0xe0, 0xbe, 0x33, 0x7e, 0xe3, 0x2e, 0xd5, 0xc7, 0x42, 0x9e, 0xe4, 0xb0,
0xcc, 0xa1, 0x4d, 0x60, 0xe0, 0x78, 0xba, 0x3b, 0x4f, 0x88, 0xdd, 0xd1,
0xa5, 0x83, 0x4e, 0x13, 0xde, 0x89, 0x8c, 0x70, 0x4d, 0xb0, 0xdd, 0xfe,
0x6c, 0x5b, 0x4e, 0x52, 0xdc, 0x81, 0x4c, 0x36, 0x52, 0xc9, 0xdc, 0x4b,
0x31, 0x8c, 0x5f, 0x25, 0xdc, 0x96, 0x27, 0xf9, 0x7a, 0x4b, 0xd8, 0x06,
0x24, 0xcf, 0x7f, 0xb0, 0xd5, 0x0b, 0x21, 0x8c, 0x27, 0x5f, 0xb8, 0x75,
0xe7, 0x4f, 0x28, 0xdf, 0xc0, 0xaf, 0xe7, 0xae, 0x2a, 0x56, 0xc7, 0x9c,
0xe6, 0xe8, 0x2d, 0x2d, 0xce, 0x69, 0xe5, 0x37, 0x36, 0x84, 0xd7, 0x83,
0xe3, 0xfa, 0x43, 0x1f, 0xe3, 0x4c, 0xe5, 0x75, 0x56, 0xc2, 0xe2, 0x07,
0xdb, 0x3f, 0x63, 0x1e, 0xe2, 0xea, 0xd0, 0x89, 0x6f, 0xc1, 0xe3, 0x0b,
0xc4, 0xba, 0x74, 0x43, 0xe1, 0x1c, 0xb0, 0x39, 0x76, 0x7c, 0xdf, 0xed,
0x9a, 0x30, 0x79, 0xd7, 0xdf, 0x9f, 0x80, 0x95, 0x7c, 0x9e, 0xdf, 0x96,
0x66, 0x35, 0x7d, 0x99, 0xe4, 0x4b, 0x3d, 0x2a, 0x81, 0xc4, 0xde, 0x8d,
0x2d, 0xca, 0x89, 0xa1, 0xd7, 0xef, 0x24, 0x1c, 0x98, 0xff, 0xd4, 0xb2,
0x20, 0xa0, 0x2b, 0xc8, 0xb2, 0x49, 0xe5, 0x69, 0x2d, 0xd7, 0xb6, 0x97,
0xe6, 0xed, 0x30, 0x0c, 0xbe, 0xc6, 0xea, 0x29, 0x36, 0x49, 0xc7, 0x18,
0xe9, 0xf8, 0x53, 0xfb, 0xd1, 0xcf, 0xe7, 0x14, 0x5f, 0x40, 0xdb, 0x1b,
0xe5, 0x9b, 0x6e, 0xe4, 0xdd, 0x35, 0xdd, 0x74, 0x79, 0xc4, 0xdb, 0x72,
0xcf, 0x7d, 0x81, 0x54, 0xd6, 0xda, 0xbe, 0xde, 0x85, 0x66, 0xd4, 0xfe,
0xab, 0x03, 0x89, 0x5b, 0xd3, 0x91, 0x95, 0x80, 0x8c, 0x2d, 0xd2, 0xe6,
0x7e, 0x06, 0x8f, 0x8f, 0xd2, 0xb4, 0x65, 0xfe, 0x94, 0x87, 0xd0, 0xc2,
0x4d, 0xa7, 0x99, 0x0d, 0xd0, 0xd0, 0x35, 0x5b, 0x9b, 0xe3, 0xd4, 0x75,
0x1f, 0xe2, 0xa1, 0x70, 0xd1, 0x57, 0x1a, 0xff, 0x2e, 0xf0, 0xa5, 0x2e,
0xe3, 0xea, 0x31, 0xa7, 0xaa, 0x3f, 0xe4, 0x77, 0x38, 0xdf, 0xb2, 0x69,
0xe7, 0x29, 0x55, 0x33, 0xbb, 0x6d, 0xe6, 0xdb, 0x61, 0x97, 0xc4, 0xd4,
0xe3, 0x59, 0x72, 0x93, 0xc9, 0x44, 0xdd, 0x6c, 0x82, 0x30, 0xcf, 0x75,
0xd7, 0xeb, 0x8a, 0xcc, 0xcd, 0x37, 0xc8, 0xdf, 0x91, 0x4e, 0xca, 0xca,
0xb8, 0x8c, 0x97, 0x7f, 0xc8, 0x47, 0xa6, 0x1c, 0x9b, 0xa7, 0xc7, 0x44,
0x91, 0xc2, 0x9f, 0x11, 0xc6, 0x7c, 0x7c, 0xa4, 0xa1, 0x75, 0xc6, 0x93,
0x67, 0x45, 0xa3, 0x1e, 0xc6, 0xb7, 0x52, 0x21, 0xa5, 0x93, 0xc9, 0x62,
0x3c, 0x7c, 0xa8, 0x71, 0xcc, 0xbb, 0x28, 0x8d, 0xab, 0x73, 0xcf, 0xbc,
0x17, 0x4e, 0x31, 0x3e, 0x9b, 0xc3, 0xe3, 0xf5, 0x36, 0x05, 0x9f, 0x37,
0xe4, 0xb4, 0x53, 0x53, 0xa6, 0xa6, 0xe5, 0x8c, 0x5f, 0xda, 0xae, 0x55,
0xe3, 0x94, 0x72, 0x42, 0xb4, 0xb2, 0xe0, 0x93, 0x82, 0xec, 0xbc, 0x53,
0xda, 0x48, 0x92, 0xa4, 0xc2, 0xf5, 0xd5, 0xd3, 0x9b, 0x08, 0xc0, 0xd5,
0xc5, 0xea, 0xa3, 0xed, 0xbf, 0x28, 0xb6, 0x34, 0xa7, 0xef, 0xbe, 0x31,
0xa3, 0x9b, 0xab, 0x48, 0xbd, 0x5e, 0x8f, 0x9e, 0xad, 0xa4, 0xbd, 0x65,
0x7b, 0xd2, 0xae, 0xef, 0xbe, 0x3a, 0x68, 0x24, 0xb0, 0x18, 0xbf, 0xff,
0x55, 0x79, 0xb2, 0x00, 0xc2, 0x94, 0x42, 0xa3, 0xb4, 0x05, 0xc5, 0x72,
0x30, 0x61, 0xb6, 0x05, 0xc8, 0x93, 0x1f, 0xa5, 0x39, 0x90, 0x8e, 0xc7,
0xe5, 0x20, 0x53, 0x2a, 0x92, 0x51, 0xe2, 0x16, 0x5e, 0x3d, 0x99, 0xe4,
0xe3, 0xf0, 0x73, 0x85, 0xa2, 0x21, 0xe5, 0x1e, 0x84, 0xb5, 0xa9, 0xb0,
0xe2, 0xc1, 0x93, 0x92, 0xb0, 0x62, 0xdc, 0xe1, 0xa4, 0xad, 0xb7, 0x7b,
0xd6, 0x8a, 0xac, 0xd1, 0xb5, 0xc8, 0xc6, 0x5c, 0xb3, 0xc1, 0xb4, 0xd5,
0xb5, 0x10, 0xb6, 0xd2, 0xb4, 0xcf, 0xa2, 0xea, 0xb8, 0xd3, 0xb4, 0x70,
0x8f, 0x2c, 0xba, 0x15, 0xb4, 0x73, 0x7b, 0xb4, 0xba, 0xfb, 0xb5, 0x8b,
0x69, 0x34, 0xbc, 0x14, 0xb7, 0x94, 0x57, 0x88, 0xbd, 0x56, 0xba, 0x9a,
0x47, 0x4d, 0xbe, 0xae, 0xbd, 0xf5, 0x36, 0x53, 0xbf, 0xe6, 0xbf, 0x81,
0x24, 0x37, 0x52, 0xe1, 0x80, 0x07, 0xe5, 0xbc, 0x5f, 0x04, 0x87, 0x3b,
0xe6, 0x43, 0x71, 0x0c, 0x8d, 0x31, 0xe5, 0xab, 0x84, 0xea, 0x95, 0x76,
0xe5, 0xdc, 0x97, 0x31, 0x9f, 0xa6, 0xe4, 0x59, 0xa7, 0x5c, 0xa6, 0x70,
0xde, 0xf6, 0xb6, 0xda, 0xae, 0xa9, 0xda, 0x09, 0xbd, 0x06, 0xae, 0x25,
0xc8, 0x9e, 0xc1, 0x60, 0xad, 0x32, 0xb6, 0x0f, 0xc3, 0x2c, 0xab, 0x99,
0xa2, 0x9c, 0xc4, 0x59, 0xaa, 0xdb, 0x8f, 0x37, 0xc5, 0x02, 0xaa, 0xa7,
0x7b, 0xe0, 0xc5, 0x98, 0xaa, 0xce, 0x69, 0x7c, 0xc6, 0x50, 0xac, 0x00,
0x57, 0x6c, 0xc7, 0x28, 0xad, 0xdb, 0x45, 0x42, 0xc8, 0x1d, 0xaf, 0xc2,
0x33, 0x3f, 0xc9, 0x53, 0xb2, 0x13, 0x22, 0x55, 0x5f, 0x25, 0x74, 0xa0,
0xe7, 0xe9, 0x71, 0x59, 0x7a, 0x67, 0xe8, 0xc2, 0x87, 0x63, 0x82, 0xf2,
0xe7, 0x16, 0x93, 0x1a, 0x8b, 0x16, 0xe6, 0x7e, 0xa7, 0xca, 0x96, 0x6a,
0xe7, 0x75, 0xb8, 0xb2, 0x9f, 0x0e, 0xe3, 0x92, 0xc6, 0x27, 0xa6, 0xf5,
0xdd, 0xc2, 0xca, 0x31, 0xa5, 0xed, 0xcb, 0x6b, 0xcc, 0xb6, 0xa4, 0x54,
0xb7, 0x30, 0xce, 0x93, 0xa2, 0x96, 0xa3, 0x1e, 0xcf, 0x3e, 0xa1, 0x85,
0x8f, 0xd5, 0xcf, 0x66, 0xa0, 0x8e, 0x7c, 0xa7, 0xcf, 0xbe, 0xa0, 0x5e,
0x69, 0xf9, 0xcf, 0xf8, 0xa0, 0x86, 0x57, 0x19, 0xd0, 0xcc, 0xa1, 0xda,
0x44, 0x03, 0xd0, 0xe3, 0xa1, 0xf5, 0x2f, 0xdc, 0xd1, 0xfc, 0xa3, 0x60,
0x1e, 0x1b, 0x75, 0x4a, 0x69, 0x28, 0xed, 0xfc, 0x88, 0x97, 0x71, 0x02,
0xed, 0x0f, 0x90, 0xa4, 0x76, 0xe8, 0xea, 0xbf, 0xa5, 0x01, 0x81, 0xea,
0xe9, 0x99, 0xb8, 0xee, 0x8d, 0x1e, 0xeb, 0x56, 0xca, 0xfb, 0x98, 0xe9,
0xea, 0xcd, 0xd3, 0x27, 0x9d, 0x0c, 0xe0, 0x33, 0xd8, 0x0d, 0x9e, 0x64,
0xcf, 0xf1, 0xd9, 0x93, 0x9b, 0xc3, 0xb9, 0x23, 0xd9, 0xa5, 0x99, 0x33,
0xa4, 0x04, 0xd9, 0x49, 0x97, 0x4c, 0x8f, 0xf3, 0xd8, 0xff, 0x95, 0x6f,
0x7c, 0xca, 0xd6, 0x51, 0x92, 0x61, 0x66, 0xf6, 0xd4, 0xe6, 0x91, 0x75,
0x51, 0x54, 0xd3, 0xb5, 0x91, 0x51, 0x3b, 0xb1, 0xd3, 0xc6, 0x94, 0x9f,
0x2e, 0xd0, 0xd3, 0x0a, 0x99, 0x52, 0x26, 0x1e, 0x89, 0x3b, 0x60, 0xf3,
0xf1, 0x16, 0x93, 0x7d, 0x63, 0xe4, 0xec, 0x5c, 0xa0, 0x8b, 0x6a, 0xcd,
0xea, 0x13, 0xb4, 0x28, 0x74, 0x4a, 0xeb, 0x06, 0xc4, 0x03, 0x7f, 0xff,
0xe9, 0xfc, 0xd1, 0xb4, 0x89, 0x33, 0xe5, 0x6a, 0xd7, 0xbc, 0x8c, 0xb9,
0xdb, 0x91, 0xdb, 0xc0, 0x8e, 0x9b, 0xcc, 0x03, 0xdd, 0x13, 0x8b, 0xc2,
0xb5, 0x06, 0xdd, 0x0d, 0x88, 0x4b, 0x9d, 0x69, 0xdb, 0x49, 0x85, 0x97,
0x88, 0x99, 0xda, 0x22, 0x82, 0x97, 0x73, 0xfb, 0xd7, 0xd4, 0x81, 0xa7,
0x5e, 0x1d, 0xd6, 0xae, 0x81, 0xd9, 0x48, 0xec, 0xd5, 0x4c, 0x82, 0x9f,
0x34, 0xb2, 0xd4, 0x16, 0x88, 0xb4, 0x2c, 0xae, 0xd3, 0x26, 0x8e, 0x8a,
0x27, 0x1a, 0x96, 0xa5, 0x4c, 0x41, 0xf0, 0xad, 0xa2, 0x59, 0x5a, 0x4b,
0xeb, 0xe7, 0xb3, 0xd2, 0x62, 0x56, 0xe8, 0xd9, 0xc0, 0x19, 0x68, 0x76,
0xe8, 0xee, 0xd0, 0x7a, 0x72, 0xc1, 0xe9, 0x69, 0xd7, 0x0e, 0x77, 0x3e,
0xdf, 0x00, 0xd8, 0xb6, 0x7a, 0xaa, 0xd8, 0xb5, 0xdc, 0x55, 0x7b, 0x31,
0xc6, 0x38, 0xdc, 0xde, 0x77, 0xf6, 0xad, 0xf0, 0xdd, 0x4e, 0x74, 0x4d,
0x95, 0xfb, 0xdb, 0xa4, 0x72, 0x14, 0x80, 0xf4, 0xda, 0x05, 0x6f, 0x5e,
0x6b, 0xef, 0xd9, 0xf3, 0x6f, 0x2b, 0x56, 0x06, 0xdc, 0x53, 0x6e, 0xde,
0x3f, 0x1e, 0xd8, 0x59, 0x75, 0x30, 0x31, 0xe5, 0xd6, 0x3e, 0x7c, 0x86,
0x2c, 0x05, 0xd3, 0x72, 0x84, 0x56, 0x28, 0x1f, 0xa8, 0x09, 0x45, 0x01,
0xed, 0xa1, 0xaf, 0x39, 0x4b, 0xc9, 0xeb, 0xd7, 0xc3, 0x12, 0x50, 0xcd,
0xec, 0x34, 0xcc, 0x77, 0x5c, 0x00, 0xea, 0xa7, 0xd6, 0xce, 0x61, 0x17,
0xe3, 0xf8, 0xd8, 0x3b, 0x64, 0xe4, 0xdc, 0xfe, 0xd9, 0x32, 0x69, 0xb8,
0xd7, 0x7d, 0xdd, 0x4c, 0x65, 0x64, 0xc0, 0x30, 0xde, 0x9e, 0x60, 0xed,
0xa7, 0x21, 0xde, 0x95, 0x5e, 0x4c, 0x8f, 0xff, 0xde, 0x7e, 0x5b, 0x85,
0x7b, 0x88, 0xdf, 0x79, 0x58, 0xfe, 0x65, 0x83, 0xe0, 0x26, 0x58, 0x76,
0x50, 0xd5, 0xe0, 0x5f, 0x5a, 0xdc, 0x39, 0xc8, 0xda, 0x9d, 0x63, 0x17,
0x30, 0x98, 0xd5, 0x43, 0x6e, 0x9c, 0x2b, 0xd8, 0xd3, 0x60, 0x77, 0x6d,
0x29, 0x55, 0xae, 0x34, 0x35, 0xa9, 0xeb, 0x2a, 0xbb, 0x03, 0x37, 0xcd,
0xed, 0x13, 0xca, 0xee, 0x48, 0x80, 0xed, 0x0d, 0xd5, 0x41, 0x4c, 0x02,
0xe4, 0x71, 0xd9, 0xa8, 0x51, 0xfc, 0xde, 0x25, 0xd8, 0x08, 0x57, 0x48,
0xda, 0x5d, 0xdb, 0x38, 0x59, 0xc0, 0xd5, 0x46, 0xe0, 0x08, 0x52, 0x7e,
0xbb, 0xd8, 0xe1, 0x50, 0x4b, 0x46, 0x9f, 0x37, 0xe1, 0x3c, 0x47, 0x60,
0x88, 0xaa, 0xe2, 0x70, 0x3f, 0x0e, 0x74, 0x36, 0xdd, 0x85, 0x39, 0x05,
0x5b, 0xde, 0xdc, 0x23, 0x35, 0xe4, 0x44, 0xbb, 0xd8, 0x2a, 0x34, 0x18,
0x33, 0x9a, 0xd8, 0x5f, 0x4f, 0x4b, 0x30, 0x28, 0xd6, 0x80, 0x5d, 0x97,
0x2c, 0xc9, 0xd3, 0x1b, 0x6a, 0x3a, 0x29, 0xe5, 0xb0, 0x12, 0x34, 0xd4,
0xe4, 0x3e, 0xbf, 0xec, 0x35, 0xa5, 0xea, 0x4c, 0xd3, 0xce, 0x36, 0xc1,
0xee, 0x24, 0xd7, 0x09, 0x37, 0xf1, 0xdd, 0x74, 0xd8, 0x9e, 0x3a, 0xee,
0xdb, 0xb7, 0xdb, 0x06, 0x47, 0x77, 0xd9, 0xd6, 0xde, 0x21, 0x47, 0x5c,
0xd0, 0x6f, 0xdb, 0x94, 0x36, 0x1b, 0xae, 0x3c, 0xdb, 0xc0, 0x35, 0x1a,
0x95, 0x74, 0xdc, 0x34, 0x34, 0x2f, 0x82, 0x69, 0xda, 0x9f, 0x32, 0xa3,
0x6e, 0xb5, 0xd9, 0xe1, 0x31, 0xec, 0x5b, 0xd5, 0xda, 0x94, 0x30, 0xd1,
0x46, 0x4e, 0xd5, 0xc9, 0x30, 0x39, 0x32, 0x22, 0xd3, 0x45, 0x30, 0x3b,
0x2f, 0x95, 0xd1, 0xae, 0x30, 0x44, 0x2d, 0xfd, 0xd4, 0x9b, 0x5c, 0x25,
0x2b, 0x36, 0x22, 0xb1, 0xd4, 0xc0, 0xe1, 0x8a, 0x20, 0x76, 0xdd, 0x37,
0xe3, 0x71, 0x20, 0xdf, 0xe2, 0x8e, 0xe2, 0xea, 0x22, 0xc7, 0xe3, 0x58,
0xe0, 0x1d, 0x26, 0x82, 0xdf, 0xb0, 0xd4, 0xcf, 0x28, 0x35, 0xde, 0x49,
0xcb, 0x24, 0x29, 0x6d, 0xdb, 0x5e, 0xc2, 0xc2, 0x2d, 0xd5, 0xd3, 0xb7,
0xae, 0xcb, 0x2e, 0xdf, 0xce, 0x92, 0x9f, 0x52, 0x2f, 0x90, 0xcb, 0xc2,
0x92, 0xc4, 0x2e, 0xaa, 0xcb, 0x63, 0x84, 0x06, 0x2e, 0x09, 0xcc, 0xe9,
0x71, 0xd1, 0x2d, 0x11, 0xce, 0x9b, 0x5f, 0x17, 0x2c, 0x1f, 0xd1, 0x14,
0x31, 0x01, 0x2c, 0x42, 0xd0, 0xdd, 0x2e, 0xd0, 0x2c, 0x64, 0xd0, 0xa8,
0x2c, 0xc9, 0x2c, 0x88, 0xd0, 0x76, 0x2a, 0xe4, 0x24, 0x03, 0xcc, 0x5f,
0xe2, 0x7f, 0x24, 0x9d, 0xd5, 0x5a, 0xe2, 0x1e, 0x22, 0xb2, 0xdf, 0x75,
0xe4, 0x38, 0x23, 0x3f, 0xe3, 0xfd, 0xe3, 0xc1, 0x26, 0xc1, 0xe3, 0x4d,
0xdc, 0xae, 0x29, 0x9d, 0xe0, 0x4e, 0xd2, 0xd9, 0x29, 0xf0, 0xde, 0xdf,
0xc9, 0x03, 0x2e, 0x63, 0xd7, 0x6f, 0xb6, 0xa2, 0x2f, 0x74, 0xd0, 0x98,
0xa4, 0xa5, 0x2f, 0x88, 0xcc, 0x4f, 0x94, 0x9e, 0x2e, 0x86, 0xca, 0xe8,
0x81, 0xcf, 0x2e, 0x9c, 0xcd, 0x9e, 0x6c, 0x50, 0x30, 0x21, 0xd0, 0xca,
0x53, 0x74, 0x2d, 0xed, 0xd1, 0xdc, 0x31, 0x32, 0x2e, 0x0a, 0xd1, 0x8e,
0x2e, 0x7e, 0x2e, 0x29, 0xd1, 0x46, 0x2c, 0x09, 0x4c, 0x88, 0xd6, 0xc8,
0x24, 0x62, 0x25, 0xbe, 0xca, 0xff, 0xe2, 0x96, 0x26, 0x67, 0xcd, 0x19,
0xe3, 0x43, 0x27, 0x6a, 0xd6, 0x32, 0xe2, 0xee, 0x26, 0x25, 0xe2, 0x09,
0xe5, 0x54, 0x27, 0xdc, 0xe4, 0x5c, 0xe3, 0x47, 0x2a, 0xa4, 0xe3, 0xaa,
0xd9, 0x4b, 0x2e, 0x7b, 0xe0, 0xbb, 0xcd, 0xbd, 0x30, 0x57, 0xdc, 0xd6,
0xc0, 0xb5, 0x31, 0xe3, 0xd2, 0xe8, 0xaa, 0x74, 0x2f, 0x23, 0xc9, 0x77,
0x94, 0x00, 0x2e, 0xd9, 0xc8, 0xe6, 0x7e, 0xd9, 0x31, 0x19, 0xcc, 0x57,
0x65, 0x66, 0x31, 0xa5, 0xd5, 0x1a, 0x42, 0x3c, 0x30, 0xf6, 0xd3, 0x23,
0x31, 0x88, 0x44, 0xd9, 0xd8, 0x00, 0x2b, 0xe1, 0x54, 0x7d, 0xd8, 0xd1,
0x29, 0xb0, 0x7b, 0xdc, 0xd7, 0xfb, 0x24, 0x7d, 0x25, 0xff, 0xc3, 0xae,
0xe6, 0xd3, 0x28, 0x41, 0xcb, 0xab, 0xe3, 0xbd, 0x29, 0xfa, 0xce, 0x19,
0xe4, 0x5a, 0x2b, 0xe4, 0xd7, 0x7d, 0xe4, 0x23, 0x2c, 0x4a, 0xe3, 0xe8,
0xe5, 0x44, 0x32, 0xcb, 0xe3, 0x88, 0xe0, 0x95, 0x39, 0x18, 0xe5, 0x33,
0xd8, 0xa5, 0x47, 0x0e, 0xe5, 0x65, 0xcd, 0x76, 0x51, 0x7c, 0xe1, 0xc1,
0xbb, 0xb1, 0x57, 0xe3, 0xde, 0xb9, 0xa8, 0x79, 0x57, 0x08, 0xdd, 0xe0,
0x8e, 0x35, 0x55, 0x3e, 0xde, 0x80, 0x70, 0x3e, 0x53, 0xa4, 0xde, 0x32,
0x4e, 0x93, 0x57, 0xc1, 0xdd, 0xe2, 0x32, 0xc0, 0x67, 0xe1, 0xdd, 0x77,
0x2c, 0x48, 0x7f, 0x99, 0xdc, 0x90, 0x27, 0x46, 0x85, 0x82, 0xd7, 0x6c,
0x24, 0x90, 0x28, 0xf0, 0xbb, 0x25, 0xe8, 0x76, 0x2a, 0xcb, 0xc2, 0x69,
0xe7, 0x77, 0x2c, 0x11, 0xc9, 0x99, 0xe6, 0xdb, 0x2f, 0xf1, 0xcf, 0x98,
0xe6, 0x03, 0x3b, 0xe1, 0xda, 0x89, 0xe5, 0xbc, 0x4f, 0xb2, 0xe1, 0x52,
0xe2, 0x8a, 0x5c, 0x6f, 0xe1, 0x8e, 0xdb, 0x33, 0x68, 0x94, 0xe2, 0xbf,
0xd0, 0x84, 0x72, 0xeb, 0xe6, 0x14, 0xc6, 0x0c, 0x75, 0xb4, 0xe4, 0x51,
0xb2, 0x45, 0x78, 0x75, 0xe3, 0x78, 0x9a, 0x9e, 0x7d, 0xd0, 0xde, 0xf6,
0x81, 0x1d, 0x7c, 0x31, 0xe3, 0xf3, 0x62, 0x3a, 0x81, 0xea, 0xe1, 0x8e,
0x46, 0x26, 0x88, 0x14, 0xe0, 0x3d, 0x32, 0xed, 0x95, 0x45, 0xda, 0x81,
0x25, 0x45, 0x9d, 0xfd, 0xd8, 0xf4, 0x23, 0x30, 0x2d, 0x1b, 0xb4, 0xb8,
0xe6, 0x54, 0x2f, 0x97, 0xb7, 0x64, 0xe7, 0x66, 0x31, 0xd2, 0xc0, 0x78,
0xe9, 0xe5, 0x52, 0x14, 0xca, 0xba, 0xe5, 0x52, 0x58, 0xd7, 0xd3, 0x73,
0xe7, 0x8c, 0x64, 0x7e, 0xdb, 0x03, 0xe3, 0xce, 0x75, 0x40, 0xdb, 0x69,
0xdb, 0x1d, 0x80, 0x77, 0xde, 0xea, 0xd2, 0xc2, 0x8c, 0x08, 0xe3, 0x3a,
0xca, 0x20, 0x91, 0x6e, 0xdd, 0xf9, 0xb4, 0xab, 0x95, 0x45, 0xdc, 0xf7,
0x9f, 0x9c, 0x98, 0xce, 0xdb, 0x87, 0x88, 0x71, 0x9b, 0xbc, 0xd9, 0xe3,
0x6f, 0xf2, 0x9e, 0x59, 0xd8, 0x34, 0x57, 0x7a, 0xa3, 0x27, 0xd6, 0x66,
0x3e, 0xbf, 0xa4, 0xf3, 0xdb, 0xf8, 0x27, 0xda, 0xa7, 0x1f, 0xd6, 0x8a,
0x1f, 0x1b, 0x30, 0xc0, 0xa7, 0x1e, 0xe3, 0xc2, 0x32, 0xab, 0xac, 0x53,
0xe4, 0x10, 0x4e, 0x85, 0xb7, 0x22, 0xe6, 0xee, 0x5c, 0x7e, 0xbd, 0xdf,
0xe6, 0x2e, 0x64, 0xf8, 0xc5, 0xcb, 0xe2, 0x11, 0x77, 0x56, 0xca, 0x1a,
0xdb, 0xe4, 0x85, 0xef, 0xd1, 0x91, 0xd7, 0xd7, 0x95, 0x32, 0xd8, 0x7e,
0xd3, 0x16, 0x9d, 0xe8, 0xd3, 0xa0, 0xc3, 0x19, 0xa1, 0xb3, 0xd3, 0x6b,
0xb1, 0x29, 0xa4, 0xf7, 0xd2, 0xc0, 0x9d, 0x1f, 0xa8, 0x27, 0xd1, 0xe0,
0x87, 0x8f, 0xaa, 0x61, 0xd1, 0xd8, 0x71, 0x5b, 0xac, 0x81, 0xd1, 0x3c,
0x5b, 0x4a, 0xae, 0xcc, 0xd1, 0xda, 0x44, 0xc7, 0xb1, 0x57, 0xd5, 0xb1,
0x2f, 0x8c, 0xb3, 0x0c, 0xd5, 0x3e, 0x25, 0x04, 0x34, 0x2e, 0x9b, 0x84,
0xe2, 0x14, 0x40, 0x57, 0xa0, 0x6b, 0xe3, 0x1b, 0x5a, 0x6b, 0xaa, 0x35,
0xe5, 0x98, 0x66, 0x0e, 0xb2, 0x5f, 0xe5, 0x44, 0x75, 0xa6, 0xb5, 0xc6,
0xde, 0x52, 0x86, 0xeb, 0xbe, 0x9b, 0xd8, 0x97, 0x96, 0x49, 0xc4, 0xae,
0xd5, 0xc4, 0xa5, 0xd0, 0xcb, 0x4c, 0xd0, 0x6c, 0xac, 0xc4, 0xc9, 0xf8,
0xc0, 0x37, 0xb1, 0xf8, 0xc9, 0x1a, 0xae, 0xaa, 0xb5, 0x21, 0xc8, 0x5c,
0x9b, 0x1a, 0xb7, 0x2a, 0xc8, 0x4e, 0x87, 0x43, 0xb8, 0x82, 0xc9, 0x16,
0x72, 0xc3, 0xb9, 0x5a, 0xca, 0xf9, 0x5e, 0x8d, 0xbb, 0x12, 0xcc, 0x92,
0x4a, 0x96, 0xbc, 0xad, 0xcf, 0x51, 0x38, 0x1e, 0xbe, 0x81, 0xd2, 0x2a,
0x26, 0xb9, 0x41, 0x97, 0x90, 0xce, 0xe4, 0x92, 0x5a, 0xf6, 0x95, 0x93,
0xe3, 0x0a, 0x62, 0x9b, 0x9c, 0xc6, 0xe4, 0x8e, 0x77, 0xb5, 0xa5, 0x95,
0xe6, 0x13, 0x87, 0xc2, 0xaa, 0xc2, 0xdf, 0xed, 0x98, 0x67, 0xb2, 0x69,
0xda, 0x09, 0xa7, 0x79, 0xb9, 0xa9, 0xd5, 0xd1, 0xb6, 0xa9, 0xc0, 0x88,
0xd0, 0x34, 0xbe, 0x5c, 0xbf, 0x7f, 0xbf, 0xb0, 0xc0, 0xe4, 0xc0, 0x0c,
0xad, 0x47, 0xc2, 0x74, 0xbf, 0xd4, 0x99, 0xd9, 0xc3, 0x71, 0xc0, 0x0a,
0x86, 0x59, 0xc4, 0x60, 0xc1, 0x66, 0x73, 0x63, 0xc5, 0x59, 0xc3, 0x52,
0x60, 0xc9, 0xc6, 0x49, 0xc5, 0xe5, 0x4f, 0xfa, 0xc7, 0x15, 0xc7, 0xb5,
0x3d, 0xb6, 0xc8, 0x3f, 0xc8, 0xfc, 0x2b, 0x11, 0x5a, 0x44, 0x83, 0x9d,
0xe5, 0xfe, 0x64, 0xeb, 0x88, 0x97, 0xe3, 0x69, 0x77, 0x14, 0x8f, 0xf0,
0xe5, 0x74, 0x8a, 0x7e, 0x99, 0x44, 0xe5, 0xa5, 0x9a, 0x9c, 0xa1, 0x99,
0xe2, 0x90, 0xaa, 0x89, 0xa8, 0xd8, 0xdc, 0x8f, 0xb8, 0xd5, 0xb0, 0x55,
0xd8, 0x4e, 0xc4, 0xb4, 0xb7, 0x3d, 0xd0, 0xec, 0xc9, 0x83, 0xb7, 0x33,
0xbf, 0xa5, 0xcb, 0xc3, 0xb6, 0x70, 0xac, 0xc0, 0xcd, 0x54, 0xb6, 0x07,
0x99, 0x89, 0xce, 0x1b, 0xb6, 0x40, 0x86, 0x7a, 0xce, 0xc8, 0xb6, 0x9b,
0x73, 0x66, 0xcf, 0x74, 0xb7, 0xc3, 0x60, 0xc6, 0xd0, 0x1d, 0xb9, 0x51,
0x4e, 0x52, 0xd0, 0xce, 0xba, 0xcc, 0x3b, 0xe1, 0xd2, 0x05, 0xbd, 0x15,
0x2a, 0x88, 0x6c, 0x08, 0x78, 0xa3, 0xe9, 0x1f, 0x75, 0xd2, 0x7d, 0xfc,
0xe8, 0xca, 0x89, 0x28, 0x86, 0x0b, 0xe6, 0xb9, 0x98, 0x5e, 0x8e, 0xb8,
0xe6, 0x5a, 0xae, 0x99, 0x9a, 0x74, 0xe6, 0xa2, 0xba, 0x37, 0xa1, 0x18,
0xe1, 0xee, 0xc8, 0xaa, 0xa9, 0x0b, 0xdb, 0xab, 0xd3, 0x5a, 0xaf, 0xd7,
0xd4, 0xed, 0xd4, 0xe2, 0xad, 0xf6, 0xc0, 0xa0, 0xd7, 0xa1, 0xac, 0xfa,
0xad, 0xb1, 0xd8, 0x28, 0xab, 0xd6, 0x9a, 0x01, 0xd7, 0xea, 0xaa, 0xc8,
0x86, 0x20, 0xd8, 0x43, 0xaa, 0x2a, 0x72, 0xfe, 0xd6, 0x2e, 0xa8, 0x61,
0x5d, 0xeb, 0xd4, 0xe3, 0xa8, 0x32, 0x48, 0xfb, 0xd3, 0x4a, 0xa7, 0xde,
0x34, 0xda, 0xd3, 0x47, 0xad, 0x56, 0x2b, 0xfd, 0x7d, 0x27, 0x6c, 0x75,
0xec, 0x2b, 0x89, 0xf7, 0x75, 0x1e, 0xec, 0x66, 0x94, 0xf7, 0x7a, 0x73,
0xea, 0x75, 0xa9, 0x4b, 0x85, 0xd0, 0xe9, 0xa6, 0xbc, 0xef, 0x91, 0x01,
0xeb, 0x33, 0xcb, 0xcc, 0x9b, 0x01, 0xe8, 0x7a, 0xd4, 0xd1, 0x9f, 0x43,
0xdc, 0xf6, 0xda, 0xa7, 0xa4, 0x06, 0xd4, 0xb7, 0xde, 0xb5, 0xa3, 0x14,
0xc0, 0x52, 0xdd, 0xdd, 0x9f, 0xd9, 0xa9, 0xf8, 0xdb, 0x62, 0x9c, 0x63,
0x93, 0xdc, 0xd8, 0xec, 0x98, 0xe5, 0x7e, 0x9b, 0xd6, 0x2a, 0x96, 0x27,
0x69, 0x27, 0xd4, 0x9b, 0x95, 0x53, 0x53, 0xd7, 0xd3, 0x80, 0x94, 0xdd,
0x3e, 0x1f, 0xd3, 0xaa, 0x98, 0x94, 0x31, 0xc7, 0xd3, 0x50, 0x9d, 0x68,
0x2b, 0x7a, 0x8a, 0xd8, 0x62, 0x1e, 0xf0, 0x9a, 0x98, 0x6a, 0x6a, 0x23,
0xeb, 0x04, 0xa4, 0xbe, 0x6e, 0x9c, 0xea, 0x44, 0xb6, 0x2d, 0x7a, 0x25,
0xe8, 0xff, 0xc7, 0x6c, 0x84, 0x3f, 0xea, 0xa5, 0xd3, 0x8f, 0x8b, 0xba,
0xe2, 0x84, 0xd7, 0xd8, 0x8f, 0xd0, 0xdb, 0x24, 0xdb, 0x56, 0x92, 0xfc,
0xcd, 0x81, 0xdd, 0x3b, 0x90, 0x0d, 0xb7, 0x69, 0xdc, 0xc7, 0x8c, 0xfd,
0x9f, 0xfd, 0xda, 0xe2, 0x89, 0xee, 0x8a, 0x5e, 0xd9, 0x79, 0x87, 0x2e,
0x75, 0xce, 0xd7, 0x7b, 0x85, 0x1d, 0x5f, 0xfc, 0xd5, 0xf9, 0x84, 0xe6,
0x4a, 0xe2, 0xd4, 0xcd, 0x86, 0x14, 0x35, 0xb9, 0xd3, 0x9e, 0x8c, 0x92,
0x2f, 0x3b, 0xd3, 0xdd, 0x91, 0x2c, 0x2b, 0x82, 0x9a, 0xe5, 0x52, 0xb2,
0xee, 0xc8, 0xa6, 0x74, 0x61, 0xf6, 0xe9, 0x4f, 0xb6, 0x97, 0x63, 0x8d,
0xe8, 0xc4, 0xc2, 0x6a, 0x6d, 0xd1, 0xe9, 0x4e, 0xd3, 0x80, 0x78, 0x18,
0xe9, 0xaa, 0xd7, 0x3c, 0x7a, 0xf2, 0xdd, 0xbc, 0xd8, 0x13, 0x7f, 0x06,
0xd8, 0x5e, 0xdb, 0xe2, 0x80, 0x03, 0xc8, 0xa0, 0xdc, 0xe5, 0x7d, 0x16,
0xb0, 0xe1, 0xdd, 0x70, 0x78, 0x9f, 0x99, 0x35, 0xdb, 0x86, 0x75, 0x96,
0x82, 0x5c, 0xda, 0xd1, 0x73, 0x88, 0x6d, 0xcd, 0xd9, 0xbd, 0x74, 0x01,
0x59, 0x2e, 0xd8, 0xb6, 0x75, 0x1b, 0x43, 0xe6, 0xd7, 0x50, 0x79, 0x52,
0x33, 0xe3, 0xd5, 0x74, 0x80, 0x87, 0x2e, 0x68, 0xd4, 0x13, 0x88, 0x4b,
0x2a, 0x35, 0xa7, 0x9e, 0x4b, 0x1c, 0xed, 0x59, 0xaf, 0x4a, 0x4e, 0xac,
0xec, 0xbb, 0xc0, 0x56, 0x5c, 0xf8, 0xe9, 0x54, 0xce, 0xf4, 0x62, 0x57,
0xe9, 0x91, 0xd8, 0x43, 0x63, 0x90, 0xe2, 0x6c, 0xd8, 0x33, 0x68, 0xd2,
0xdc, 0x43, 0xd8, 0xe6, 0x6e, 0x72, 0xd7, 0x9b, 0xdc, 0xf2, 0x6b, 0x79,
0xc3, 0x45, 0xde, 0x11, 0x64, 0x7c, 0xa6, 0x5c, 0xde, 0x80, 0x61, 0xe2,
0x91, 0x44, 0xde, 0x43, 0x60, 0x6e, 0x7d, 0x22, 0xdb, 0x17, 0x60, 0x8d,
0x67, 0x6d, 0xde, 0xbb, 0x5e, 0x5c, 0x52, 0x8e, 0xdf, 0x09, 0x63, 0x9e,
0x3c, 0xbd, 0xdd, 0x2e, 0x69, 0x06, 0x32, 0x60, 0xd6, 0xef, 0x73, 0x9c,
0x2d, 0x31, 0xd4, 0xe3, 0x7b, 0xd1, 0x2a, 0x85, 0xb0, 0x0a, 0x37, 0x31,
0xec, 0xc9, 0xb9, 0xb6, 0x3f, 0xc3, 0xeb, 0x26, 0xcd, 0xdd, 0x4d, 0x2d,
0xec, 0x60, 0xd7, 0x4b, 0x53, 0xf5, 0xe1, 0xf2, 0xd6, 0x5e, 0x57, 0x10,
0xdc, 0x9f, 0xd8, 0xfd, 0x5d, 0x83, 0xdb, 0x50, 0xda, 0x44, 0x5d, 0x48,
0xd7, 0xc2, 0xdd, 0xad, 0x58, 0xd7, 0xbd, 0x7c, 0xde, 0xb7, 0x52, 0xed,
0xa2, 0x06, 0xe0, 0xce, 0x4c, 0x1f, 0x8b, 0x2b, 0xe2, 0x26, 0x48, 0x4a,
0x77, 0x56, 0xdf, 0xb8, 0x3e, 0xbb, 0x5e, 0x96, 0xdd, 0x94, 0x3d, 0xd1,
0x4a, 0x29, 0xdb, 0x00, 0x38, 0x41, 0x35, 0x5d, 0xda, 0x81, 0x59, 0xf5,
0x31, 0x27, 0xd7, 0x6c, 0x61, 0xf0, 0x2d, 0x9c, 0xd4, 0x40, 0x6e, 0xdc,
0x2a, 0xaf, 0xba, 0x26, 0x35, 0x7b, 0xe9, 0x58, 0xd1, 0x0d, 0x3a, 0x4f,
0xf0, 0x53, 0xd8, 0x69, 0x38, 0x94, 0xe6, 0x34, 0xd7, 0x99, 0x3b, 0x91,
0xdd, 0x74, 0xd9, 0xce, 0x48, 0x77, 0xdc, 0x0d, 0xdb, 0x2c, 0x4b, 0x3d,
0xda, 0x19, 0xde, 0xe9, 0x4b, 0xb7, 0xd1, 0x6f, 0xde, 0x2e, 0x42, 0xe2,
0xb5, 0x11, 0xdc, 0x21, 0x36, 0x4c, 0x95, 0x9f, 0xdc, 0xaa, 0x35, 0x85,
0x82, 0xbb, 0xdb, 0x81, 0x33, 0xfc, 0x6f, 0x5e, 0xda, 0xb8, 0x33, 0x62,
0x5c, 0xc6, 0xdb, 0x2e, 0x32, 0x55, 0x47, 0x6d, 0xd6, 0xe5, 0x31, 0x62,
0x32, 0xfb, 0xd4, 0x23, 0x31, 0x20, 0x30, 0x3b, 0xd6, 0x4b, 0x4f, 0x75,
0x2e, 0x17, 0xd5, 0x82, 0x5d, 0x2d, 0x2b, 0xe9, 0x24, 0x01, 0xd5, 0x53,
0xe1, 0xed, 0x21, 0xf1, 0xdf, 0x60, 0xe3, 0xff, 0x22, 0x65, 0xe3, 0x4d,
0xe3, 0x74, 0x25, 0x00, 0xe3, 0x6d, 0xdf, 0xfd, 0x27, 0xe8, 0xe0, 0x37,
0xd5, 0x24, 0x29, 0x73, 0xde, 0xcc, 0xcb, 0x6f, 0x2a, 0x64, 0xdc, 0x0c,
0xc3, 0x5c, 0x2e, 0x6d, 0xd4, 0x01, 0xae, 0xe2, 0x2f, 0x1a, 0xce, 0xa2,
0x9f, 0x13, 0x2f, 0x28, 0xcc, 0x20, 0x91, 0x08, 0x2e, 0xaa, 0xcb, 0x65,
0x83, 0x6a, 0x2e, 0x26, 0xcc, 0xfb, 0x71, 0xde, 0x2d, 0x74, 0xce, 0xcb,
0x5f, 0x4b, 0x2d, 0x00, 0xd1, 0x81, 0x31, 0x6a, 0x2d, 0x1b, 0xd1, 0x49,
0x2f, 0x68, 0x2d, 0x35, 0xd1, 0x16, 0x2d, 0x87, 0x2d, 0x52, 0xd0, 0xe6,
0x2b, 0xc6, 0x25, 0x44, 0xce, 0x53, 0xe2, 0x2d, 0x26, 0x0e, 0xd5, 0xfb,
0xe2, 0x87, 0x24, 0x57, 0xe1, 0xaa, 0xe4, 0xd0, 0x25, 0x32, 0xe4, 0x41,
0xe3, 0xd4, 0x28, 0xc6, 0xe3, 0xae, 0xdc, 0xd6, 0x2b, 0x01, 0xe0, 0xd0,
0xd3, 0x2c, 0x2b, 0x0e, 0xdf, 0x86, 0xc9, 0x7f, 0x2f, 0x22, 0xd7, 0xcd,
0xb6, 0xc9, 0x2f, 0xf3, 0xd0, 0xd9, 0xa4, 0x54, 0x2f, 0x9b, 0xcc, 0x3e,
0x94, 0x28, 0x2e, 0xb1, 0xcb, 0x45, 0x81, 0x3b, 0x2d, 0x91, 0xcd, 0xa2,
0x6b, 0xb1, 0x30, 0xd5, 0xd1, 0x2b, 0x53, 0x93, 0x2e, 0xd0, 0xd2, 0x48,
0x31, 0xac, 0x2e, 0xe3, 0xd1, 0xfe, 0x2f, 0x3e, 0x2e, 0xf6, 0xd1, 0xba,
0x2d, 0x02, 0x51, 0x0e, 0xd9, 0x16, 0x24, 0xf7, 0x26, 0xe1, 0xcb, 0xa8,
0xe2, 0xfe, 0x27, 0xfd, 0xce, 0xfc, 0xe3, 0x60, 0x28, 0xfd, 0xd6, 0xe3,
0xe3, 0x58, 0x28, 0x06, 0xe3, 0xc4, 0xe5, 0x29, 0x29, 0xd8, 0xe4, 0x60,
0xe3, 0x28, 0x2c, 0x2b, 0xe3, 0xff, 0xd9, 0x65, 0x2f, 0x97, 0xe1, 0x1d,
0xcd, 0xef, 0x31, 0x19, 0xdd, 0x52, 0xc1, 0x26, 0x32, 0x8e, 0xd3, 0x96,
0xab, 0x52, 0x31, 0xba, 0xcf, 0x73, 0x96, 0x1a, 0x2e, 0xd2, 0xc8, 0xd6,
0x7e, 0x22, 0x31, 0x69, 0xcc, 0x62, 0x64, 0xfb, 0x32, 0x8d, 0xd5, 0x92,
0x41, 0xf4, 0x31, 0xe7, 0xd2, 0x26, 0x32, 0x7d, 0x49, 0x28, 0xd9, 0x84,
0x2c, 0xc3, 0x57, 0x59, 0xda, 0xa3, 0x28, 0x3b, 0x80, 0x07, 0xda, 0xde,
0x25, 0xea, 0x27, 0x8a, 0xc5, 0x8d, 0xe6, 0xa8, 0x29, 0x7f, 0xcc, 0x66,
0xe4, 0x1f, 0x2b, 0xa6, 0xcf, 0xfe, 0xe4, 0x6f, 0x2b, 0x87, 0xdb, 0x50,
0xe6, 0x73, 0x2e, 0x04, 0xe3, 0xf3, 0xe4, 0xd2, 0x34, 0x53, 0xe3, 0x8b,
0xe0, 0x72, 0x3d, 0x1c, 0xe5, 0xa5, 0xd8, 0xdb, 0x53, 0x3b, 0xe4, 0x35,
0xcd, 0x4e, 0x5b, 0x40, 0xe2, 0xd3, 0xbd, 0xf7, 0x5d, 0x3e, 0xe0, 0x39,
0xaa, 0x26, 0x5f, 0x78, 0xdf, 0x82, 0x90, 0xd0, 0x5a, 0x70, 0xe0, 0x09,
0x72, 0xd0, 0x5c, 0xe3, 0xdf, 0x57, 0x53, 0x9c, 0x5b, 0xc7, 0xdc, 0xcd,
0x38, 0x0b, 0x72, 0xac, 0xe0, 0x3f, 0x2e, 0x69, 0x83, 0xba, 0xde, 0x8b,
0x2a, 0x8f, 0x8a, 0x73, 0xda, 0xcd, 0x26, 0xf4, 0x2a, 0x6a, 0xbd, 0xa9,
0xe9, 0x5e, 0x2b, 0x71, 0xc4, 0x03, 0xe8, 0x70, 0x2d, 0x79, 0xcb, 0x8a,
0xe6, 0xbf, 0x34, 0x75, 0xd0, 0xae, 0xe4, 0x88, 0x4b, 0xb3, 0xdd, 0x93,
0xe6, 0x8f, 0x58, 0x35, 0xdf, 0xc2, 0xe0, 0x5b, 0x63, 0x09, 0xdf, 0x6f,
0xd9, 0xb2, 0x71, 0x1c, 0xe0, 0xc2, 0xcf, 0x7f, 0x77, 0x6f, 0xe3, 0xd9,
0xc5, 0x0f, 0x79, 0xf3, 0xe3, 0xfc, 0xb2, 0x7f, 0x7f, 0xa6, 0xdf, 0x81,
0x9b, 0xac, 0x82, 0x9a, 0xde, 0xb9, 0x82, 0xc8, 0x82, 0x67, 0xe3, 0x21,
0x65, 0x05, 0x8a, 0x9e, 0xe0, 0x26, 0x4d, 0x94, 0x8e, 0x16, 0xdf, 0x14,
0x38, 0xc0, 0x9a, 0x8f, 0xdb, 0xc3, 0x2a, 0xcd, 0xa3, 0x06, 0xdd, 0x22,
0x25, 0xd3, 0x2e, 0x9c, 0xb6, 0x07, 0xe6, 0xd7, 0x30, 0x37, 0xb9, 0x2d,
0xe8, 0x63, 0x33, 0x22, 0xc2, 0x2e, 0xe9, 0x9b, 0x59, 0x93, 0xcc, 0x5c,
0xe5, 0xa2, 0x5c, 0xce, 0xd3, 0x84, 0xe6, 0x2b, 0x6c, 0x54, 0xda, 0x51,
0xe1, 0x73, 0x7a, 0x58, 0xdb, 0x82, 0xdb, 0x17, 0x84, 0xfb, 0xde, 0xcc,
0xd3, 0x3a, 0x8f, 0x43, 0xe2, 0x94, 0xc8, 0xe3, 0x94, 0x6e, 0xe0, 0x08,
0xb6, 0x6e, 0x98, 0x67, 0xde, 0x49, 0xa1, 0xcf, 0x9a, 0x8a, 0xdd, 0x9f,
0x89, 0xf4, 0x9e, 0x5c, 0xdc, 0x6f, 0x72, 0x47, 0xa2, 0x01, 0xdb, 0xb3,
0x5a, 0x40, 0xa5, 0xbf, 0xd9, 0x21, 0x41, 0xc5, 0xa9, 0xe9, 0xda, 0xeb,
0x2f, 0x77, 0xab, 0xef, 0xd8, 0xfb, 0x25, 0x21, 0x31, 0x94, 0xa9, 0x22,
0xe4, 0x56, 0x35, 0xf5, 0xaf, 0xa7, 0xe6, 0x0e, 0x53, 0x58, 0xb7, 0xdf,
0xe6, 0xed, 0x5e, 0x71, 0xbf, 0x59, 0xe5, 0x27, 0x6b, 0xf5, 0xc6, 0x23,
0xdf, 0xb4, 0x7d, 0xaa, 0xca, 0x78, 0xda, 0x20, 0x8b, 0x0d, 0xd2, 0xc1,
0xd6, 0x78, 0x99, 0x04, 0xd6, 0x42, 0xd3, 0x4b, 0xa7, 0xf3, 0xde, 0x1f,
0xcd, 0xb6, 0xac, 0x92, 0xdd, 0x33, 0xbb, 0x25, 0xb0, 0x0e, 0xdc, 0x44,
0xa7, 0xf7, 0xb2, 0x54, 0xdb, 0xd4, 0x93, 0x0d, 0xb4, 0x63, 0xdc, 0x16,
0x7d, 0xc7, 0xb4, 0x68, 0xd7, 0xf7, 0x62, 0xd8, 0xb5, 0x27, 0xd5, 0xb6,
0x4a, 0xa1, 0xb6, 0x67, 0xd8, 0xf5, 0x35, 0x1b, 0xb8, 0x30, 0xd7, 0xed,
0x2b, 0xca, 0x33, 0xe2, 0x9e, 0xd4, 0xe4, 0x99, 0x4e, 0x06, 0xa4, 0x8b,
0xe4, 0x57, 0x5c, 0x6b, 0xac, 0xfd, 0xe4, 0xd2, 0x6d, 0x0a, 0xb3, 0xc3,
0xe2, 0xcb, 0x79, 0x5d, 0xb7, 0xad, 0xdd, 0x08, 0x89, 0xd5, 0xc0, 0x8f,
0xd7, 0x57, 0x9a, 0x3b, 0xc5, 0xea, 0xd4, 0x8c, 0xa9, 0xf1, 0xcd, 0x26,
0xce, 0xc1, 0xb6, 0x99, 0xd3, 0xae, 0xca, 0x0f, 0xbb, 0xb2, 0xd3, 0xdd,
0xb9, 0x5f, 0xbd, 0xee, 0xd3, 0xce, 0xa6, 0x34, 0xc0, 0x54, 0xd3, 0x6b,
0x92, 0x5c, 0xc1, 0x7b, 0xd4, 0x60, 0x7d, 0xa7, 0xc3, 0x3f, 0xd5, 0x9c,
0x68, 0x05, 0xc4, 0xde, 0xd7, 0x24, 0x53, 0xdb, 0xc4, 0x40, 0xd7, 0x79,
0x3f, 0x1e, 0xc4, 0x8e, 0xd5, 0xc0, 0x2f, 0x12, 0x4c, 0x3d, 0x93, 0x7b,
0xe4, 0x75, 0x5d, 0x03, 0x98, 0x5c, 0xe3, 0x9c, 0x6b, 0x7d, 0xa0, 0x60,
0xe5, 0x37, 0x7d, 0xb8, 0xa7, 0x50, 0xe4, 0x31, 0x8b, 0x64, 0xac, 0xa9,
0xde, 0x54, 0x9b, 0x2d, 0xb4, 0x96, 0xd9, 0x53, 0xa9, 0xd8, 0xbb, 0xc2,
0xd4, 0xcb, 0xbb, 0x0e, 0xc2, 0xcf, 0xce, 0x4d, 0xc9, 0xae, 0xc9, 0xae,
0xca, 0x3d, 0xc9, 0x6c, 0xca, 0x9c, 0xb7, 0xbe, 0xca, 0xe8, 0xca, 0xf5,
0xa4, 0x9d, 0xcc, 0x61, 0xcb, 0xa2, 0x91, 0x50, 0xcd, 0x59, 0xcc, 0xe2,
0x7d, 0xf4, 0xce, 0x7c, 0xce, 0xb4, 0x6a, 0x57, 0xce, 0xe3, 0xd0, 0x78,
0x58, 0x0d, 0xcf, 0xb1, 0xd2, 0x35, 0x45, 0xf1, 0xd0, 0xa4, 0xd3, 0x7a,
0x33, 0x80, 0x5b, 0x98, 0x86, 0x8f, 0xe6, 0x24, 0x6a, 0x92, 0x8a, 0xe6,
0xe4, 0x05, 0x7f, 0xe1, 0x93, 0x5f, 0xe6, 0x2e, 0x8d, 0xd8, 0x9c, 0x6d,
0xe5, 0xe4, 0x9e, 0x3b, 0xa3, 0xe7, 0xe1, 0x1e, 0xad, 0xb3, 0xab, 0x34,
0xdb, 0x25, 0xba, 0xb5, 0xb2, 0xce, 0xd6, 0x47, 0xc8, 0x2e, 0xb9, 0xa5,
0xce, 0x64, 0xd0, 0x5e, 0xbf, 0xb5, 0xc7, 0x72, 0xd5, 0xab, 0xc1, 0x31,
0xb7, 0x20, 0xd7, 0x44, 0xc1, 0x80, 0xa4, 0x18, 0xd7, 0x82, 0xc1, 0xa1,
0x90, 0xc5, 0xd7, 0xfe, 0xc2, 0x42, 0x7d, 0x36, 0xd6, 0x4e, 0xc1, 0x0d,
0x68, 0x20, 0xd4, 0x81, 0xc0, 0xc3, 0x53, 0xc7, 0xd2, 0xd7, 0xbf, 0xfc,
0x3f, 0x1f, 0xd1, 0xe5, 0xc2, 0x6a, 0x30, 0xd1, 0x6d, 0xdc, 0x7a, 0x75,
0xe8, 0x41, 0x82, 0x73, 0x81, 0x8d, 0xe7, 0x22, 0x8a, 0x88, 0x89, 0x3b,
0xe6, 0xa4, 0x9d, 0xad, 0x92, 0xb5, 0xe6, 0xb5, 0xb1, 0x31, 0x9d, 0x17,
0xe4, 0xb9, 0xbc, 0x79, 0xa3, 0x6e, 0xdf, 0x64, 0xcb, 0x6f, 0xab, 0x6d,
0xd9, 0xd0, 0xd2, 0x76, 0xb2, 0x15, 0xd3, 0x73, 0xdc, 0x44, 0xb7, 0x05,
0xc8, 0xc4, 0xde, 0xda, 0xb5, 0xe8, 0xb5, 0x93, 0xdd, 0x2e, 0xb3, 0x84,
0xa0, 0x21, 0xd9, 0xf0, 0xaf, 0xdd, 0x89, 0x94, 0xd8, 0x17, 0xad, 0x65,
0x74, 0x78, 0xd6, 0x15, 0xab, 0xb3, 0x5f, 0x82, 0xd4, 0xeb, 0xab, 0xed,
0x4a, 0xd5, 0xd3, 0xdf, 0xab, 0xd2, 0x36, 0x9a, 0xd3, 0x0a, 0xb2, 0x5d,
0x30, 0x06, 0x81, 0xc0, 0x71, 0x59, 0xeb, 0x69, 0x8b, 0x07, 0x77, 0xe6,
0xeb, 0x84, 0x98, 0x1e, 0x7e, 0x4c, 0xea, 0x1c, 0xae, 0x51, 0x8a, 0x80,
0xe9, 0xa1, 0xc0, 0x8f, 0x95, 0x2f, 0xeb, 0x6d, 0xce, 0x25, 0x9d, 0xad,
0xe5, 0xff, 0xd5, 0xa0, 0xa1, 0xcd, 0xdc, 0x36, 0xd9, 0x64, 0xa7, 0x39,
0xd6, 0x0e, 0xde, 0xd0, 0xa7, 0x02, 0xc3, 0x0a, 0xde, 0x1b, 0xa3, 0x88,
0xac, 0x31, 0xdc, 0x40, 0xa0, 0x3f, 0x96, 0x51, 0xd9, 0x5a, 0x9c, 0x6b,
0x80, 0x51, 0xd7, 0xcb, 0x9a, 0xa0, 0x6b, 0x92, 0xd5, 0x50, 0x98, 0xa4,
0x56, 0x5a, 0xd4, 0x68, 0x99, 0x5d, 0x42, 0x57, 0xd3, 0x91, 0x9b, 0xef,
0x33, 0x50, 0xd3, 0x5a, 0xa1, 0x2f, 0x2e, 0x61, 0x8d, 0xfc, 0x63, 0xf7,
0xed, 0x65, 0x99, 0x7b, 0x6d, 0x10, 0xeb, 0x3f, 0xa8, 0x5c, 0x71, 0x5e,
0xea, 0x35, 0xb9, 0x9b, 0x7e, 0x8d, 0xe9, 0xbb, 0xcb, 0x95, 0x89, 0x06,
0xeb, 0x13, 0xd5, 0x41, 0x8e, 0x8e, 0xdf, 0x9f, 0xd7, 0x82, 0x93, 0x85,
0xd9, 0xfc, 0xdb, 0x08, 0x96, 0xed, 0xd0, 0x2c, 0xdc, 0xb0, 0x94, 0x9f,
0xb9, 0x42, 0xdc, 0xfa, 0x91, 0x3b, 0xa2, 0xc8, 0xdb, 0x03, 0x8d, 0xac,
0x8c, 0x4a, 0xd9, 0x5c, 0x8b, 0xd2, 0x78, 0x47, 0xd6, 0xd7, 0x89, 0x26,
0x62, 0x75, 0xd5, 0x8c, 0x88, 0x99, 0x4c, 0xcd, 0xd4, 0x3e, 0x8a, 0x28,
0x38, 0x4a, 0xd3, 0x47, 0x8f, 0xf5, 0x30, 0xc8, 0xd3, 0xb7, 0x94, 0xd3,
0x2d, 0xcd, 0x9e, 0xbb, 0x5f, 0x2a, 0xec, 0x73, 0xa9, 0x83, 0x63, 0x02,
0xe9, 0x21, 0xb7, 0x30, 0x65, 0x6a, 0xe9, 0x08, 0xc4, 0xcb, 0x72, 0x04,
0xe8, 0x67, 0xd3, 0xae, 0x7b, 0xa3, 0xe8, 0x1a, 0xd6, 0xd0, 0x7e, 0x79,
0xdc, 0x60, 0xd8, 0x1d, 0x82, 0xce, 0xd8, 0xc4, 0xdb, 0xd2, 0x84, 0xdd,
0xcb, 0x41, 0xdc, 0xed, 0x80, 0x03, 0xb2, 0x13, 0xdd, 0x8a, 0x7d, 0xa3,
0x9b, 0xbf, 0xdb, 0xe7, 0x7a, 0x1e, 0x84, 0xb7, 0xda, 0xa3, 0x78, 0x60,
0x70, 0x2a, 0xd9, 0x46, 0x78, 0x1c, 0x5a, 0xed, 0xd7, 0xbe, 0x7a, 0xcc,
0x47, 0x86, 0xd6, 0xb1, 0x7d, 0x36, 0x34, 0xd4, 0xd4, 0xed, 0x84, 0x38,
0x30, 0x00, 0xd3, 0x9e, 0x8b, 0xf1, 0x2c, 0x49, 0xa8, 0x66, 0x4c, 0x4d,
0xed, 0x18, 0xb6, 0xd2, 0x5c, 0xd3, 0xe9, 0x42, 0xc2, 0xf5, 0x61, 0x73,
0xe9, 0xac, 0xd1, 0x4d, 0x63, 0xa5, 0xe9, 0xa6, 0xd7, 0x6a, 0x67, 0xdb,
0xdf, 0x89, 0xd7, 0xff, 0x6d, 0x07, 0xdb, 0xae, 0xd8, 0xd1, 0x71, 0x63,
0xd7, 0xbd, 0xdc, 0xb2, 0x70, 0xf1, 0xc5, 0xb6, 0xdd, 0xf7, 0x69, 0x57,
0xa8, 0x91, 0xdd, 0xdb, 0x67, 0x21, 0x92, 0x69, 0xdd, 0x56, 0x66, 0x32,
0x7f, 0x47, 0xda, 0xb2, 0x66, 0x6b, 0x69, 0xff, 0xde, 0x43, 0x63, 0xa9,
0x54, 0x36, 0xdd, 0xbe, 0x67, 0x5a, 0x3e, 0xb9, 0xd9, 0x7c, 0x6e, 0xcf,
0x33, 0x58, 0xd7, 0x76, 0x77, 0xc1, 0x2f, 0x09, 0xd5, 0x76, 0x80, 0x05,
0x2b, 0xca, 0xb2, 0xb5, 0x39, 0xca, 0xef, 0x82, 0xc7, 0x7f, 0x4b, 0xcc,
0xed, 0x75, 0xcd, 0x74, 0x50, 0x8b, 0xeb, 0x72, 0xd7, 0x00, 0x55, 0xab,
0xde, 0x93, 0xd7, 0xc7, 0x5d, 0xc2, 0xdd, 0xa1, 0xd9, 0x2f, 0x5e, 0x8b,
0xdb, 0x78, 0xd9, 0xbd, 0x61, 0x96, 0xd7, 0xc4, 0xdd, 0x72, 0x5e, 0x91,
0xc1, 0x07, 0xde, 0xdd, 0x57, 0x2c, 0xa4, 0xa7, 0xde, 0x30, 0x53, 0xb7,
0x8d, 0xae, 0xdf, 0x0e, 0x50, 0xa9, 0x79, 0xee, 0xe1, 0xfa, 0x4a, 0xc2,
0x64, 0x54, 0xe0, 0x65, 0x49, 0xc3, 0x50, 0x35, 0xde, 0x52, 0x4a, 0xef,
0x37, 0xaf, 0xdc, 0x99, 0x60, 0x09, 0x32, 0x62, 0xd9, 0x1d, 0x67, 0x51,
0x2e, 0x8d, 0xd5, 0x63, 0x72, 0xac, 0x2b, 0x8b, 0xbb, 0xbd, 0x36, 0xe3,
0xea, 0xb6, 0xd2, 0x11, 0x3e, 0x58, 0xf0, 0x52, 0xd8, 0x72, 0x3b, 0xd7,
0xe5, 0x11, 0xd8, 0xea, 0x49, 0x2d, 0xdd, 0xa3, 0xda, 0x19, 0x4c, 0xa0,
0xdc, 0x2e, 0xdb, 0xb7, 0x51, 0x5a, 0xda, 0xab, 0xdc, 0x0e, 0x56, 0x45,
0xd3, 0x15, 0xdf, 0x8e, 0x4a, 0x1c, 0xb9, 0xfe, 0xdd, 0xf1, 0x3c, 0x7b,
0x98, 0x44, 0xdd, 0x0f, 0x36, 0xb1, 0x82, 0xf8, 0xdc, 0x4d, 0x35, 0x33,
0x6f, 0xf0, 0xdb, 0x7a, 0x34, 0xba, 0x5d, 0xa1, 0xda, 0xee, 0x35, 0x8a,
0x4b, 0x5a, 0xd8, 0x00, 0x32, 0x8a, 0x33, 0xd3, 0xd4, 0xfe, 0x32, 0x03,
0x30, 0xe3, 0xd8, 0x10, 0x5b, 0x72, 0x2e, 0x8e, 0xd6, 0x29, 0x61, 0xf6,
0x2c, 0x64, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0xa8, 0x80,
0xff, 0xff, 0xb1, 0x8f, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0xa8, 0x80,
0xff, 0xff, 0xb1, 0x8f, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0xa8, 0x80,
0xff, 0xff, 0xb1, 0x8f, 0x6d, 0x42, 0x41, 0x20, 0x00, 0x00, 0x00, 0x00,
0x03, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00, 0x20, 0x00, 0x00, 0x00, 0x98,
0x00, 0x00, 0x00, 0xc8, 0x00, 0x00, 0x01, 0x40, 0x00, 0x00, 0x01, 0x84,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x97, 0x73, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xff, 0xfe, 0x85, 0x60,
0xff, 0xff, 0xb3, 0xfa, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xbe, 0x0e,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00,
0x00, 0x03, 0x00, 0x00, 0x00, 0x00, 0xad, 0x0c, 0x00, 0x00, 0x1b, 0xb0,
0x00, 0x00, 0x0d, 0xaa, 0x00, 0x00, 0x14, 0x7b, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x04, 0x00, 0x00, 0x00, 0x03, 0x00, 0x00, 0x00, 0x00, 0xaf, 0x2a,
0x00, 0x00, 0x1c, 0x07, 0x00, 0x00, 0x0e, 0x2c, 0x00, 0x00, 0x14, 0x7b,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x03, 0x00, 0x00,
0x00, 0x00, 0xa4, 0x47, 0x00, 0x00, 0x1a, 0x49, 0x00, 0x00, 0x0b, 0xb0,
0x00, 0x00, 0x14, 0x7b, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x02, 0x02, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x00, 0x02, 0x00, 0x00, 0x00, 0x66, 0xf0, 0x55, 0x90,
0x22, 0x59, 0x4e, 0xfa, 0x58, 0x7c, 0xf5, 0x33, 0x17, 0xf7, 0xfd, 0x13,
0x00, 0x00, 0x00, 0x00, 0xff, 0xff, 0xd2, 0xdb, 0xff, 0xff, 0x00, 0x00,
0x2d, 0x24, 0xe8, 0x08, 0x02, 0xec, 0xff, 0xff, 0xb1, 0x05, 0xa7, 0x83,
0x0a, 0xcb, 0x99, 0x0f, 0xaa, 0x6f, 0xdd, 0xa6, 0x70, 0x61, 0x72, 0x61,
0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x6a, 0xab,
0x00, 0x0c, 0x12, 0x9c, 0xff, 0xfb, 0x21, 0x8d, 0x00, 0x89, 0x34, 0x39,
0x00, 0x00, 0x67, 0x52, 0xff, 0xff, 0xf1, 0xec, 0xff, 0xc8, 0xaa, 0x3d,
0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x00, 0x00,
0x00, 0x00, 0x6a, 0xab, 0x00, 0x06, 0xbe, 0x75, 0xff, 0xfd, 0xbb, 0x45,
0x00, 0x4c, 0xa4, 0xf7, 0x00, 0x00, 0x56, 0x3e, 0xff, 0xff, 0xf1, 0xec,
0xff, 0xe6, 0x38, 0x17, 0x70, 0x61, 0x72, 0x61, 0x00, 0x00, 0x00, 0x00,
0x00, 0x04, 0x00, 0x00, 0x00, 0x00, 0x6a, 0xab, 0x00, 0x03, 0xee, 0x3c,
0xff, 0xff, 0x75, 0x4e, 0x00, 0x2c, 0xab, 0xba, 0x00, 0x00, 0x23, 0x83,
0xff, 0xff, 0xf1, 0xec, 0xff, 0xf9, 0xd7, 0xc3, 0x73, 0x69, 0x67, 0x20,
0x00, 0x00, 0x00, 0x00, 0x70, 0x72, 0x6d, 0x67, 0x58, 0x59, 0x5a, 0x20,
0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xf6, 0xd6, 0x00, 0x01, 0x00, 0x00,
0x00, 0x00, 0xd3, 0x2d, 0x6d, 0x6c, 0x75, 0x63, 0x00, 0x00, 0x00, 0x00,
0x00, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x0c, 0x65, 0x6e, 0x55, 0x53,
0x00, 0x00, 0x00, 0x5a, 0x00, 0x00, 0x00, 0x1c, 0x00, 0x43, 0x00, 0x6f,
0x00, 0x70, 0x00, 0x79, 0x00, 0x72, 0x00, 0x69, 0x00, 0x67, 0x00, 0x68,
0x00, 0x74, 0x00, 0x20, 0x00, 0x32, 0x00, 0x30, 0x00, 0x30, 0x00, 0x37,
0x00, 0x20, 0x00, 0x49, 0x00, 0x6e, 0x00, 0x74, 0x00, 0x65, 0x00, 0x72,
0x00, 0x6e, 0x00, 0x61, 0x00, 0x74, 0x00, 0x69, 0x00, 0x6f, 0x00, 0x6e,
0x00, 0x61, 0x00, 0x6c, 0x00, 0x20, 0x00, 0x43, 0x00, 0x6f, 0x00, 0x6c,
0x00, 0x6f, 0x00, 0x72, 0x00, 0x20, 0x00, 0x43, 0x00, 0x6f, 0x00, 0x6e,
0x00, 0x73, 0x00, 0x6f, 0x00, 0x72, 0x00, 0x74, 0x00, 0x69, 0x00, 0x75,
0x00, 0x6d, 0x00, 0x00, 0x73, 0x66, 0x33, 0x32, 0x00, 0x00, 0x00, 0x00,
0x00, 0x01, 0x0c, 0x4b, 0x00, 0x00, 0x05, 0xe4, 0xff, 0xff, 0xf3, 0x28,
0x00, 0x00, 0x07, 0x9c, 0x00, 0x00, 0xfd, 0x87, 0xff, 0xff, 0xfb, 0xa1,
0xff, 0xff, 0xfd, 0xa3, 0x00, 0x00, 0x02, 0xa2, 0x00, 0x00, 0xc0, 0x8c
};
StringInfo
*profile;
MagickBooleanType
status;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (GetImageProfile(image,"icm") != (const StringInfo *) NULL)
return(MagickFalse);
profile=AcquireStringInfo(sizeof(sRGBProfile));
SetStringInfoDatum(profile,sRGBProfile);
status=SetImageProfile(image,"icm",profile);
profile=DestroyStringInfo(profile);
return(status);
}
#if defined(MAGICKCORE_LCMS_DELEGATE)
#if defined(LCMS_VERSION) && (LCMS_VERSION >= 2000)
static void LCMSExceptionHandler(cmsContext context,cmsUInt32Number severity,
const char *message)
{
Image
*image;
(void) LogMagickEvent(TransformEvent,GetMagickModule(),"lcms: #%u, %s",
severity,message != (char *) NULL ? message : "no message");
image=(Image *) context;
if (image != (Image *) NULL)
(void) ThrowMagickException(&image->exception,GetMagickModule(),
ImageWarning,"UnableToTransformColorspace","`%s'",image->filename);
}
#else
static int LCMSExceptionHandler(int severity,const char *message)
{
(void) LogMagickEvent(TransformEvent,GetMagickModule(),"lcms: #%d, %s",
severity,message != (char *) NULL ? message : "no message");
return(1);
}
#endif
#endif
MagickExport MagickBooleanType ProfileImage(Image *image,const char *name,
const void *datum,const size_t length,
const MagickBooleanType magick_unused(clone))
{
#define ProfileImageTag "Profile/Image"
#define ThrowProfileException(severity,tag,context) \
{ \
if (source_profile != (cmsHPROFILE) NULL) \
(void) cmsCloseProfile(source_profile); \
if (target_profile != (cmsHPROFILE) NULL) \
(void) cmsCloseProfile(target_profile); \
ThrowBinaryException(severity,tag,context); \
}
MagickBooleanType
status;
StringInfo
*profile;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(name != (const char *) NULL);
if ((datum == (const void *) NULL) || (length == 0))
{
char
**arguments,
*names;
int
number_arguments;
register ssize_t
i;
/*
Delete image profile(s).
*/
names=ConstantString(name);
(void) SubstituteString(&names,","," ");
arguments=StringToArgv(names,&number_arguments);
names=DestroyString(names);
if (arguments == (char **) NULL)
return(MagickTrue);
ResetImageProfileIterator(image);
for (name=GetNextImageProfile(image); name != (const char *) NULL; )
{
for (i=1; i < (ssize_t) number_arguments; i++)
{
if ((*arguments[i] == '!') &&
(LocaleCompare(name,arguments[i]+1) == 0))
break;
if (GlobExpression(name,arguments[i],MagickTrue) != MagickFalse)
{
(void) DeleteImageProfile(image,name);
ResetImageProfileIterator(image);
break;
}
}
name=GetNextImageProfile(image);
}
for (i=0; i < (ssize_t) number_arguments; i++)
arguments[i]=DestroyString(arguments[i]);
arguments=(char **) RelinquishMagickMemory(arguments);
return(MagickTrue);
}
/*
Add a ICC, IPTC, or generic profile to the image.
*/
status=MagickTrue;
profile=AcquireStringInfo((size_t) length);
SetStringInfoDatum(profile,(unsigned char *) datum);
if ((LocaleCompare(name,"icc") != 0) && (LocaleCompare(name,"icm") != 0))
status=SetImageProfile(image,name,profile);
else
{
const StringInfo
*icc_profile;
icc_profile=GetImageProfile(image,"icc");
if ((icc_profile != (const StringInfo *) NULL) &&
(CompareStringInfo(icc_profile,profile) == 0))
{
const char
*value;
value=GetImageProperty(image,"exif:ColorSpace");
if (LocaleCompare(value,"1") != 0)
(void) SetsRGBImageProfile(image);
value=GetImageProperty(image,"exif:InteroperabilityIndex");
if (LocaleCompare(value,"R98.") != 0)
(void) SetsRGBImageProfile(image);
value=GetImageProperty(image,"exif:InteroperabilityIndex");
if (LocaleCompare(value,"R03.") != 0)
(void) SetAdobeRGB1998ImageProfile(image);
icc_profile=GetImageProfile(image,"icc");
}
if ((icc_profile != (const StringInfo *) NULL) &&
(CompareStringInfo(icc_profile,profile) == 0))
{
profile=DestroyStringInfo(profile);
return(MagickTrue);
}
#if !defined(MAGICKCORE_LCMS_DELEGATE)
(void) ThrowMagickException(&image->exception,GetMagickModule(),
MissingDelegateWarning,"DelegateLibrarySupportNotBuiltIn","`%s' (LCMS)",
image->filename);
#else
{
cmsHPROFILE
source_profile;
/*
Transform pixel colors as defined by the color profiles.
*/
cmsSetLogErrorHandler(LCMSExceptionHandler);
source_profile=cmsOpenProfileFromMemTHR(image,
GetStringInfoDatum(profile),(cmsUInt32Number)
GetStringInfoLength(profile));
if (source_profile == (cmsHPROFILE) NULL)
ThrowBinaryException(ResourceLimitError,
"ColorspaceColorProfileMismatch",name);
if ((cmsGetDeviceClass(source_profile) != cmsSigLinkClass) &&
(icc_profile == (StringInfo *) NULL))
status=SetImageProfile(image,name,profile);
else
{
CacheView
*image_view;
ColorspaceType
source_colorspace,
target_colorspace;
cmsColorSpaceSignature
signature;
cmsHPROFILE
target_profile;
cmsHTRANSFORM
*restrict transform;
cmsUInt32Number
flags,
source_type,
target_type;
ExceptionInfo
*exception;
int
intent;
MagickBooleanType
status;
MagickOffsetType
progress;
size_t
source_channels,
target_channels;
ssize_t
y;
unsigned short
**restrict source_pixels,
**restrict target_pixels;
exception=(&image->exception);
target_profile=(cmsHPROFILE) NULL;
if (icc_profile != (StringInfo *) NULL)
{
target_profile=source_profile;
source_profile=cmsOpenProfileFromMemTHR(image,
GetStringInfoDatum(icc_profile),(cmsUInt32Number)
GetStringInfoLength(icc_profile));
if (source_profile == (cmsHPROFILE) NULL)
ThrowProfileException(ResourceLimitError,
"ColorspaceColorProfileMismatch",name);
}
switch (cmsGetColorSpace(source_profile))
{
case cmsSigCmykData:
{
source_colorspace=CMYKColorspace;
source_type=(cmsUInt32Number) TYPE_CMYK_16;
source_channels=4;
break;
}
case cmsSigGrayData:
{
source_colorspace=GRAYColorspace;
source_type=(cmsUInt32Number) TYPE_GRAY_16;
source_channels=1;
break;
}
case cmsSigLabData:
{
source_colorspace=LabColorspace;
source_type=(cmsUInt32Number) TYPE_Lab_16;
source_channels=3;
break;
}
case cmsSigLuvData:
{
source_colorspace=YUVColorspace;
source_type=(cmsUInt32Number) TYPE_YUV_16;
source_channels=3;
break;
}
case cmsSigRgbData:
{
source_colorspace=RGBColorspace;
source_type=(cmsUInt32Number) TYPE_RGB_16;
source_channels=3;
break;
}
case cmsSigXYZData:
{
source_colorspace=XYZColorspace;
source_type=(cmsUInt32Number) TYPE_XYZ_16;
source_channels=3;
break;
}
case cmsSigYCbCrData:
{
source_colorspace=YCbCrColorspace;
source_type=(cmsUInt32Number) TYPE_YCbCr_16;
source_channels=3;
break;
}
default:
{
source_colorspace=UndefinedColorspace;
source_type=(cmsUInt32Number) TYPE_RGB_16;
source_channels=3;
break;
}
}
signature=cmsGetPCS(source_profile);
if (target_profile != (cmsHPROFILE) NULL)
signature=cmsGetColorSpace(target_profile);
switch (signature)
{
case cmsSigCmykData:
{
target_colorspace=CMYKColorspace;
target_type=(cmsUInt32Number) TYPE_CMYK_16;
target_channels=4;
break;
}
case cmsSigLabData:
{
target_colorspace=LabColorspace;
target_type=(cmsUInt32Number) TYPE_Lab_16;
target_channels=3;
break;
}
case cmsSigGrayData:
{
target_colorspace=GRAYColorspace;
target_type=(cmsUInt32Number) TYPE_GRAY_16;
target_channels=1;
break;
}
case cmsSigLuvData:
{
target_colorspace=YUVColorspace;
target_type=(cmsUInt32Number) TYPE_YUV_16;
target_channels=3;
break;
}
case cmsSigRgbData:
{
target_colorspace=RGBColorspace;
target_type=(cmsUInt32Number) TYPE_RGB_16;
target_channels=3;
break;
}
case cmsSigXYZData:
{
target_colorspace=XYZColorspace;
target_type=(cmsUInt32Number) TYPE_XYZ_16;
target_channels=3;
break;
}
case cmsSigYCbCrData:
{
target_colorspace=YCbCrColorspace;
target_type=(cmsUInt32Number) TYPE_YCbCr_16;
target_channels=3;
break;
}
default:
{
target_colorspace=UndefinedColorspace;
target_type=(cmsUInt32Number) TYPE_RGB_16;
target_channels=3;
break;
}
}
if ((source_colorspace == UndefinedColorspace) ||
(target_colorspace == UndefinedColorspace))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
if ((source_colorspace == GRAYColorspace) &&
(IsGrayImage(image,exception) == MagickFalse))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
if ((source_colorspace == CMYKColorspace) &&
(image->colorspace != CMYKColorspace))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
if ((source_colorspace == XYZColorspace) &&
(image->colorspace != XYZColorspace))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
if ((source_colorspace == YCbCrColorspace) &&
(image->colorspace != YCbCrColorspace))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
if ((source_colorspace != CMYKColorspace) &&
(source_colorspace != GRAYColorspace) &&
(source_colorspace != LabColorspace) &&
(source_colorspace != XYZColorspace) &&
(source_colorspace != YCbCrColorspace) &&
(IsRGBColorspace(image->colorspace) == MagickFalse))
ThrowProfileException(ImageError,"ColorspaceColorProfileMismatch",
name);
switch (image->rendering_intent)
{
case AbsoluteIntent: intent=INTENT_ABSOLUTE_COLORIMETRIC; break;
case PerceptualIntent: intent=INTENT_PERCEPTUAL; break;
case RelativeIntent: intent=INTENT_RELATIVE_COLORIMETRIC; break;
case SaturationIntent: intent=INTENT_SATURATION; break;
default: intent=INTENT_PERCEPTUAL; break;
}
flags=cmsFLAGS_HIGHRESPRECALC;
#if defined(cmsFLAGS_BLACKPOINTCOMPENSATION)
if (image->black_point_compensation != MagickFalse)
flags|=cmsFLAGS_BLACKPOINTCOMPENSATION;
#endif
transform=AcquireTransformThreadSet(image,source_profile,
source_type,target_profile,target_type,intent,flags);
if (transform == (cmsHTRANSFORM *) NULL)
ThrowProfileException(ImageError,"UnableToCreateColorTransform",
name);
/*
Transform image as dictated by the source & target image profiles.
*/
source_pixels=AcquirePixelThreadSet(image->columns,source_channels);
target_pixels=AcquirePixelThreadSet(image->columns,target_channels);
if ((source_pixels == (unsigned short **) NULL) ||
(target_pixels == (unsigned short **) NULL))
{
transform=DestroyTransformThreadSet(transform);
ThrowProfileException(ResourceLimitError,
"MemoryAllocationFailed",image->filename);
}
if (SetImageStorageClass(image,DirectClass) == MagickFalse)
{
target_pixels=DestroyPixelThreadSet(target_pixels);
source_pixels=DestroyPixelThreadSet(source_pixels);
transform=DestroyTransformThreadSet(transform);
if (source_profile != (cmsHPROFILE) NULL)
(void) cmsCloseProfile(source_profile);
if (target_profile != (cmsHPROFILE) NULL)
(void) cmsCloseProfile(target_profile);
return(MagickFalse);
}
if (target_colorspace == CMYKColorspace)
(void) SetImageColorspace(image,target_colorspace);
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
const int
id = GetOpenMPThreadId();
MagickBooleanType
sync;
register IndexPacket
*restrict indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
register unsigned short
*p;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(image_view);
p=source_pixels[id];
for (x=0; x < (ssize_t) image->columns; x++)
{
*p++=ScaleQuantumToShort(GetPixelRed(q));
if (source_channels > 1)
{
*p++=ScaleQuantumToShort(GetPixelGreen(q));
*p++=ScaleQuantumToShort(GetPixelBlue(q));
}
if (source_channels > 3)
*p++=ScaleQuantumToShort(GetPixelIndex(indexes+x));
q++;
}
cmsDoTransform(transform[id],source_pixels[id],target_pixels[id],
(unsigned int) image->columns);
p=target_pixels[id];
q-=image->columns;
for (x=0; x < (ssize_t) image->columns; x++)
{
SetPixelRed(q,ScaleShortToQuantum(*p));
SetPixelGreen(q,GetPixelRed(q));
SetPixelBlue(q,GetPixelRed(q));
p++;
if (target_channels > 1)
{
SetPixelGreen(q,ScaleShortToQuantum(*p));
p++;
SetPixelBlue(q,ScaleShortToQuantum(*p));
p++;
}
if (target_channels > 3)
{
SetPixelIndex(indexes+x,ScaleShortToQuantum(*p));
p++;
}
q++;
}
sync=SyncCacheViewAuthenticPixels(image_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ProfileImage)
#endif
proceed=SetImageProgress(image,ProfileImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
(void) SetImageColorspace(image,target_colorspace);
switch (signature)
{
case cmsSigRgbData:
{
image->type=image->matte == MagickFalse ? TrueColorType :
TrueColorMatteType;
break;
}
case cmsSigCmykData:
{
image->type=image->matte == MagickFalse ? ColorSeparationType :
ColorSeparationMatteType;
break;
}
case cmsSigGrayData:
{
image->type=image->matte == MagickFalse ? GrayscaleType :
GrayscaleMatteType;
break;
}
default:
break;
}
target_pixels=DestroyPixelThreadSet(target_pixels);
source_pixels=DestroyPixelThreadSet(source_pixels);
transform=DestroyTransformThreadSet(transform);
if (cmsGetDeviceClass(source_profile) != cmsSigLinkClass)
status=SetImageProfile(image,name,profile);
if (target_profile != (cmsHPROFILE) NULL)
(void) cmsCloseProfile(target_profile);
}
(void) cmsCloseProfile(source_profile);
}
#endif
}
profile=DestroyStringInfo(profile);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e m o v e I m a g e P r o f i l e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% RemoveImageProfile() removes a named profile from the image and returns its
% value.
%
% The format of the RemoveImageProfile method is:
%
% void *RemoveImageProfile(Image *image,const char *name)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o name: the profile name.
%
*/
MagickExport StringInfo *RemoveImageProfile(Image *image,const char *name)
{
StringInfo
*profile;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
return((StringInfo *) NULL);
if (LocaleCompare(name,"icc") == 0)
{
/*
Continue to support deprecated color profile for now.
*/
image->color_profile.length=0;
image->color_profile.info=(unsigned char *) NULL;
}
if (LocaleCompare(name,"iptc") == 0)
{
/*
Continue to support deprecated IPTC profile for now.
*/
image->iptc_profile.length=0;
image->iptc_profile.info=(unsigned char *) NULL;
}
profile=(StringInfo *) RemoveNodeFromSplayTree((SplayTreeInfo *)
image->profiles,name);
return(profile);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R e s e t P r o f i l e I t e r a t o r %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ResetImageProfileIterator() resets the image profile iterator. Use it in
% conjunction with GetNextImageProfile() to iterate over all the profiles
% associated with an image.
%
% The format of the ResetImageProfileIterator method is:
%
% ResetImageProfileIterator(Image *image)
%
% A description of each parameter follows:
%
% o image: the image.
%
*/
MagickExport void ResetImageProfileIterator(const Image *image)
{
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
return;
ResetSplayTreeIterator((SplayTreeInfo *) image->profiles);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e t I m a g e P r o f i l e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SetImageProfile() adds a named profile to the image. If a profile with the
% same name already exists, it is replaced. This method differs from the
% ProfileImage() method in that it does not apply CMS color profiles.
%
% The format of the SetImageProfile method is:
%
% MagickBooleanType SetImageProfile(Image *image,const char *name,
% const StringInfo *profile)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o name: the profile name, for example icc, exif, and 8bim (8bim is the
% Photoshop wrapper for iptc profiles).
%
% o profile: A StringInfo structure that contains the named profile.
%
*/
static void *DestroyProfile(void *profile)
{
return((void *) DestroyStringInfo((StringInfo *) profile));
}
static inline const unsigned char *ReadResourceByte(const unsigned char *p,
unsigned char *quantum)
{
*quantum=(*p++);
return(p);
}
static inline const unsigned char *ReadResourceBytes(const unsigned char *p,
const ssize_t count,unsigned char *quantum)
{
register ssize_t
i;
for (i=0; i < count; i++)
*quantum++=(*p++);
return(p);
}
static inline const unsigned char *ReadResourceLong(const unsigned char *p,
size_t *quantum)
{
*quantum=(size_t) (*p++ << 24);
*quantum|=(size_t) (*p++ << 16);
*quantum|=(size_t) (*p++ << 8);
*quantum|=(size_t) (*p++ << 0);
return(p);
}
static inline const unsigned char *ReadResourceShort(const unsigned char *p,
unsigned short *quantum)
{
*quantum=(unsigned short) (*p++ << 8);
*quantum|=(unsigned short) (*p++ << 0);
return(p);
}
static MagickBooleanType GetProfilesFromResourceBlock(Image *image,
const StringInfo *resource_block)
{
const unsigned char
*datum;
register const unsigned char
*p;
size_t
length;
StringInfo
*profile;
unsigned char
length_byte;
size_t
count;
unsigned short
id;
datum=GetStringInfoDatum(resource_block);
length=GetStringInfoLength(resource_block);
for (p=datum; p < (datum+length-16); )
{
if (LocaleNCompare((char *) p,"8BIM",4) != 0)
break;
p+=4;
p=ReadResourceShort(p,&id);
p=ReadResourceByte(p,&length_byte);
p+=length_byte;
if (((length_byte+1) & 0x01) != 0)
p++;
if (p > (datum+length-4))
break;
p=ReadResourceLong(p,&count);
if ((p > (datum+length-count)) || (count > length))
break;
switch (id)
{
case 0x03ed:
{
unsigned short
resolution;
/*
Resolution.
*/
p=ReadResourceShort(p,&resolution)+6;
image->x_resolution=(double) resolution;
p=ReadResourceShort(p,&resolution)+6;
image->y_resolution=(double) resolution;
break;
}
case 0x0404:
{
/*
IPTC Profile
*/
profile=AcquireStringInfo(count);
SetStringInfoDatum(profile,p);
(void) SetImageProfile(image,"iptc",profile);
profile=DestroyStringInfo(profile);
p+=count;
break;
}
case 0x040c:
{
/*
Thumbnail.
*/
p+=count;
break;
}
case 0x040f:
{
/*
ICC Profile.
*/
profile=AcquireStringInfo(count);
SetStringInfoDatum(profile,p);
(void) SetImageProfile(image,"icc",profile);
profile=DestroyStringInfo(profile);
p+=count;
break;
}
case 0x0422:
{
/*
EXIF Profile.
*/
profile=AcquireStringInfo(count);
SetStringInfoDatum(profile,p);
(void) SetImageProfile(image,"exif",profile);
profile=DestroyStringInfo(profile);
p+=count;
break;
}
case 0x0424:
{
/*
XMP Profile.
*/
profile=AcquireStringInfo(count);
SetStringInfoDatum(profile,p);
(void) SetImageProfile(image,"xmp",profile);
profile=DestroyStringInfo(profile);
p+=count;
break;
}
default:
{
p+=count;
break;
}
}
if ((count & 0x01) != 0)
p++;
}
return(MagickTrue);
}
MagickExport MagickBooleanType SetImageProfile(Image *image,const char *name,
const StringInfo *profile)
{
char
key[MaxTextExtent],
property[MaxTextExtent];
MagickBooleanType
status;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->profiles == (SplayTreeInfo *) NULL)
image->profiles=NewSplayTree(CompareSplayTreeString,RelinquishMagickMemory,
DestroyProfile);
(void) CopyMagickString(key,name,MaxTextExtent);
status=AddValueToSplayTree((SplayTreeInfo *) image->profiles,
ConstantString(key),CloneStringInfo(profile));
if ((status != MagickFalse) &&
((LocaleCompare(name,"icc") == 0) || (LocaleCompare(name,"icm") == 0)))
{
const StringInfo
*icc_profile;
/*
Continue to support deprecated color profile member.
*/
icc_profile=GetImageProfile(image,name);
if (icc_profile != (const StringInfo *) NULL)
{
image->color_profile.length=GetStringInfoLength(icc_profile);
image->color_profile.info=GetStringInfoDatum(icc_profile);
}
}
if ((status != MagickFalse) &&
((LocaleCompare(name,"iptc") == 0) || (LocaleCompare(name,"8bim") == 0)))
{
const StringInfo
*iptc_profile;
/*
Continue to support deprecated IPTC profile member.
*/
iptc_profile=GetImageProfile(image,name);
if (iptc_profile != (const StringInfo *) NULL)
{
image->iptc_profile.length=GetStringInfoLength(iptc_profile);
image->iptc_profile.info=GetStringInfoDatum(iptc_profile);
}
(void) GetProfilesFromResourceBlock(image,profile);
}
/*
Inject profile into image properties.
*/
(void) FormatLocaleString(property,MaxTextExtent,"%s:sans",name);
(void) GetImageProperty(image,property);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S y n c I m a g e P r o f i l e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SyncImageProfiles() synchronizes image properties with the image profiles.
% Currently we only support updating the EXIF resolution and orientation.
%
% The format of the SyncImageProfiles method is:
%
% MagickBooleanType SyncImageProfiles(Image *image)
%
% A description of each parameter follows:
%
% o image: the image.
%
*/
static inline int ReadProfileByte(unsigned char **p,size_t *length)
{
int
c;
if (*length < 1)
return(EOF);
c=(int) (*(*p)++);
(*length)--;
return(c);
}
static inline unsigned short ReadProfileShort(const EndianType endian,
unsigned char *buffer)
{
unsigned short
value;
if (endian == MSBEndian)
{
value=(unsigned short) ((((unsigned char *) buffer)[0] << 8) |
((unsigned char *) buffer)[1]);
return((unsigned short) (value & 0xffff));
}
value=(unsigned short) ((buffer[1] << 8) | buffer[0]);
return((unsigned short) (value & 0xffff));
}
static inline size_t ReadProfileLong(const EndianType endian,
unsigned char *buffer)
{
size_t
value;
if (endian == MSBEndian)
{
value=(size_t) ((buffer[0] << 24) | (buffer[1] << 16) |
(buffer[2] << 8) | buffer[3]);
return((size_t) (value & 0xffffffff));
}
value=(size_t) ((buffer[3] << 24) | (buffer[2] << 16) |
(buffer[1] << 8 ) | (buffer[0]));
return((size_t) (value & 0xffffffff));
}
static inline void WriteProfileLong(const EndianType endian,
const size_t value,unsigned char *p)
{
unsigned char
buffer[4];
if (endian == MSBEndian)
{
buffer[0]=(unsigned char) (value >> 24);
buffer[1]=(unsigned char) (value >> 16);
buffer[2]=(unsigned char) (value >> 8);
buffer[3]=(unsigned char) value;
(void) CopyMagickMemory(p,buffer,4);
return;
}
buffer[0]=(unsigned char) value;
buffer[1]=(unsigned char) (value >> 8);
buffer[2]=(unsigned char) (value >> 16);
buffer[3]=(unsigned char) (value >> 24);
(void) CopyMagickMemory(p,buffer,4);
}
static void WriteProfileShort(const EndianType endian,
const unsigned short value,unsigned char *p)
{
unsigned char
buffer[2];
if (endian == MSBEndian)
{
buffer[0]=(unsigned char) (value >> 8);
buffer[1]=(unsigned char) value;
(void) CopyMagickMemory(p,buffer,2);
return;
}
buffer[0]=(unsigned char) value;
buffer[1]=(unsigned char) (value >> 8);
(void) CopyMagickMemory(p,buffer,2);
}
MagickExport MagickBooleanType SyncImageProfiles(Image *image)
{
#define MaxDirectoryStack 16
#define EXIF_DELIMITER "\n"
#define EXIF_NUM_FORMATS 12
#define TAG_EXIF_OFFSET 0x8769
#define TAG_INTEROP_OFFSET 0xa005
typedef struct _DirectoryInfo
{
unsigned char
*directory;
size_t
entry;
} DirectoryInfo;
DirectoryInfo
directory_stack[MaxDirectoryStack];
EndianType
endian;
int
offset;
size_t
entry,
length,
number_entries;
ssize_t
id,
level;
static int
format_bytes[] = {0, 1, 1, 2, 4, 8, 1, 1, 2, 4, 8, 4, 8};
StringInfo
*profile;
unsigned char
*directory,
*exif;
/*
Set EXIF resolution tag.
*/
profile=(StringInfo *) GetImageProfile(image,"EXIF");
if (profile == (StringInfo *) NULL)
return(MagickTrue);
length=GetStringInfoLength(profile);
exif=GetStringInfoDatum(profile);
while (length != 0)
{
if (ReadProfileByte(&exif,&length) != 0x45)
continue;
if (ReadProfileByte(&exif,&length) != 0x78)
continue;
if (ReadProfileByte(&exif,&length) != 0x69)
continue;
if (ReadProfileByte(&exif,&length) != 0x66)
continue;
if (ReadProfileByte(&exif,&length) != 0x00)
continue;
if (ReadProfileByte(&exif,&length) != 0x00)
continue;
break;
}
if (length < 16)
return(MagickFalse);
id=(ssize_t) ReadProfileShort(LSBEndian,exif);
endian=LSBEndian;
if (id == 0x4949)
endian=LSBEndian;
else
if (id == 0x4D4D)
endian=MSBEndian;
else
return(MagickFalse);
if (ReadProfileShort(endian,exif+2) != 0x002a)
return(MagickFalse);
/*
This the offset to the first IFD.
*/
offset=(int) ReadProfileLong(endian,exif+4);
if ((size_t) offset >= length)
return(MagickFalse);
directory=exif+offset;
level=0;
entry=0;
do
{
if (level > 0)
{
level--;
directory=directory_stack[level].directory;
entry=directory_stack[level].entry;
}
/*
Determine how many entries there are in the current IFD.
*/
number_entries=ReadProfileShort(endian,directory);
for ( ; entry < number_entries; entry++)
{
int
components;
register unsigned char
*p,
*q;
size_t
number_bytes;
ssize_t
format,
tag_value;
q=(unsigned char *) (directory+2+(12*entry));
tag_value=(ssize_t) ReadProfileShort(endian,q);
format=(ssize_t) ReadProfileShort(endian,q+2);
if ((format-1) >= EXIF_NUM_FORMATS)
break;
components=(int) ReadProfileLong(endian,q+4);
number_bytes=(size_t) components*format_bytes[format];
if (number_bytes <= 4)
p=q+8;
else
{
int
offset;
/*
The directory entry contains an offset.
*/
offset=(int) ReadProfileLong(endian,q+8);
if ((size_t) (offset+number_bytes) > length)
continue;
p=(unsigned char *) (exif+offset);
}
switch (tag_value)
{
case 0x011a:
{
(void) WriteProfileLong(endian,(size_t)
(image->x_resolution+0.5),p);
(void) WriteProfileLong(endian,1UL,p+4);
break;
}
case 0x011b:
{
(void) WriteProfileLong(endian,(size_t)
(image->y_resolution+0.5),p);
(void) WriteProfileLong(endian,1UL,p+4);
break;
}
case 0x0112:
{
(void) WriteProfileShort(endian,(unsigned short)
image->orientation,p);
break;
}
case 0x0128:
{
(void) WriteProfileShort(endian,(unsigned short)
(image->units+1),p);
break;
}
default:
break;
}
if ((tag_value == TAG_EXIF_OFFSET) || (tag_value == TAG_INTEROP_OFFSET))
{
size_t
offset;
offset=(size_t) ReadProfileLong(endian,p);
if ((offset < length) && (level < (MaxDirectoryStack-2)))
{
directory_stack[level].directory=directory;
entry++;
directory_stack[level].entry=entry;
level++;
directory_stack[level].directory=exif+offset;
directory_stack[level].entry=0;
level++;
if ((directory+2+(12*number_entries)) > (exif+length))
break;
offset=(size_t) ReadProfileLong(endian,directory+2+(12*
number_entries));
if ((offset != 0) && (offset < length) &&
(level < (MaxDirectoryStack-2)))
{
directory_stack[level].directory=exif+offset;
directory_stack[level].entry=0;
level++;
}
}
break;
}
}
} while (level > 0);
return(MagickTrue);
}
|
sgemm.c | #include "blas.h"
#include "error.h"
#include <stdio.h>
#include "handle.h"
#include "config.h"
#include "sgemm.fatbin.c"
static inline size_t min(size_t a, size_t b) { return (a < b) ? a : b; }
static inline size_t max(size_t a, size_t b) { return (a > b) ? a : b; }
static inline CUresult cuMemcpyHtoD2DAsync(CUdeviceptr A, size_t lda, size_t ai, size_t aj,
const void * B, size_t ldb, size_t bi, size_t bj,
size_t m, size_t n, size_t elemSize, CUstream stream) {
CUDA_MEMCPY2D copy = {
bi * elemSize, bj, CU_MEMORYTYPE_HOST, B, 0, 0, ldb * elemSize,
ai * elemSize, aj, CU_MEMORYTYPE_DEVICE, NULL, A, 0, lda * elemSize,
m * elemSize, n };
return cuMemcpy2DAsync(©, stream);
}
static inline CUresult cuMemcpyDtoH2DAsync(void * A, size_t lda, size_t ai, size_t aj,
CUdeviceptr B, size_t ldb, size_t bi, size_t bj,
size_t m, size_t n, size_t elemSize, CUstream stream) {
CUDA_MEMCPY2D copy = {
bi * elemSize, bj, CU_MEMORYTYPE_DEVICE, NULL, B, 0, ldb * elemSize,
ai * elemSize, aj, CU_MEMORYTYPE_HOST, A, 0, 0, lda * elemSize,
m * elemSize, n };
return cuMemcpy2DAsync(©, stream);
}
static const float zero = 0.0f;
static const float one = 1.0f;
void sgemm(CBlasTranspose transA, CBlasTranspose transB,
size_t m, size_t n, size_t k,
float alpha, const float * restrict A, size_t lda, const float * restrict B, size_t ldb,
float beta, float * restrict C, size_t ldc) {
const size_t nRowA = (transA == CBlasNoTrans) ? m : k;
const size_t nRowB = (transB == CBlasNoTrans) ? k : n;
int info = 0;
if (lda < nRowA)
info = 8;
else if (ldb < nRowB)
info = 10;
else if (ldc < m)
info = 13;
if (info != 0) {
XERBLA(info);
return;
}
if (m == 0 || n == 0 || ((alpha == zero || k == 0) && beta == one))
return;
if (alpha == zero) {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] = zero;
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] *= beta;
}
}
return;
}
if (transB == CBlasNoTrans) {
if (transA == CBlasNoTrans) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
if (beta == zero) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] = zero;
}
else if (beta != one) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] *= beta;
}
for (size_t l = 0; l < k; l++) {
if (B[j * ldb + l] != zero) {
register float temp = alpha * B[j * ldb + l];
for (size_t i = 0; i < m; i++)
C[j * ldc + i] += temp * A[l * lda + i];
}
}
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i < m; i++) {
register float temp = zero;
for (size_t l = 0; l < k; l++)
temp += A[i * lda + l] * B[j * ldb + l];
if (beta == zero)
C[j * ldc + i] = alpha * temp;
else
C[j * ldc + i] = alpha * temp + beta * C[j * ldc + i];
}
}
}
}
else {
if (transA == CBlasNoTrans) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
if (beta == zero) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] = zero;
}
else if (beta != one) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] *= beta;
}
for (size_t l = 0; l < k; l++) {
if (B[l * ldb + j] != zero) {
register float temp = alpha * B[l * ldb + j];
for (size_t i = 0; i < m; i++)
C[j * ldc + i] += temp * A[l * lda + i];
}
}
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i < m; i++) {
register float temp = zero;
for (size_t l = 0; l < k; l++)
temp += A[i * lda + l] * B[l * ldb + j];
if (beta == zero)
C[j * ldc + i] = alpha * temp;
else
C[j * ldc + i] = alpha * temp + beta * C[j * ldc + i];
}
}
}
}
}
CUresult cuSgemm2(CUBLAShandle handle, CBlasTranspose transA, CBlasTranspose transB,
size_t m, size_t n, size_t k,
float alpha, CUdeviceptr A, size_t lda, CUdeviceptr B, size_t ldb,
float beta, CUdeviceptr C, size_t ldc, CUdeviceptr D, size_t ldd,
CUstream stream) {
const size_t nRowA = (transA == CBlasNoTrans) ? m : k;
const size_t nRowB = (transB == CBlasNoTrans) ? k : n;
int info = 0;
if (lda < nRowA)
info = 8;
else if (ldb < nRowB)
info = 10;
else if (ldc < m)
info = 13;
else if (ldd < m)
info = 15;
if (info != 0) {
XERBLA(info);
return CUDA_ERROR_INVALID_VALUE;
}
if (m == 0 || n == 0 || (C == D && (alpha == zero || k == 0) && beta == one))
return CUDA_SUCCESS;
CU_ERROR_CHECK(cuCtxPushCurrent(handle->context));
if (handle->sgemm2 == NULL)
CU_ERROR_CHECK(cuModuleLoadData(&handle->sgemm2, imageBytes));
const unsigned int mb = (transA == CBlasNoTrans) ? 64 : 32;
const unsigned int nb = (transA == CBlasNoTrans) ? 16 : 32;
const unsigned int kb = (transA == CBlasNoTrans) ? 16 : 8;
const unsigned int bx = (transA == CBlasNoTrans) ? 16 : 8;
const unsigned int by = (transA == CBlasNoTrans) ? 4 : 8;
char name[85];
snprintf(name, 85,
"_Z6sgemm2IL14CBlasTranspose%dELS0_%dELj%uELj%uELj%uELj%uELj%uEEvPKfS2_S2_Pfffiiiiiii",
transA, transB, mb, nb, kb, bx, by);
CUfunction function;
CU_ERROR_CHECK(cuModuleGetFunction(&function, handle->sgemm2, name));
void * params[] = { &A, &B, &C, &D, &alpha, &beta, &lda, &ldb, &ldc, &ldd, &m, &n, &k };
CU_ERROR_CHECK(cuLaunchKernel(function, (unsigned int)(m + mb - 1) / mb, (unsigned int)(n + nb - 1) / nb, 1,
bx, by, 1, 0, stream, params, NULL));
CU_ERROR_CHECK(cuCtxPopCurrent(&handle->context));
return CUDA_SUCCESS;
}
struct sgemm_args {
CUBLAShandle handle;
const float * A, * B;
float * C;
size_t m, n, k, lda, ldb, ldc;
float alpha, beta;
CBlasTranspose transA, transB;
};
static CUresult background_sgemm(const void * a) {
struct sgemm_args * args = (struct sgemm_args *)a;
CUBLAShandle handle = args->handle;
// Block sizes
const size_t mb = (args->transA == CBlasNoTrans) ? SGEMM_N_MB : SGEMM_T_MB;
const size_t nb = (args->transA == CBlasNoTrans) ? SGEMM_N_NB : SGEMM_T_NB;
const size_t kb = (args->transA == CBlasNoTrans) ? SGEMM_N_KB : SGEMM_T_KB;
// Temporary device memory and streams
CUdeviceptr A0, A1, B0, B1, C;
size_t lda, ldb, ldc;
CUstream copy, compute;
// Allocate two matrices for blocks of A and B on the device and one for a
// block of C
if (args->transA == CBlasNoTrans) {
CU_ERROR_CHECK(cuMemAllocPitch(&A0, &lda, mb * sizeof(float), kb, sizeof(float)));
CU_ERROR_CHECK(cuMemAllocPitch(&A1, &lda, mb * sizeof(float), kb, sizeof(float)));
}
else {
CU_ERROR_CHECK(cuMemAllocPitch(&A0, &lda, kb * sizeof(float), mb, sizeof(float)));
CU_ERROR_CHECK(cuMemAllocPitch(&A1, &lda, kb * sizeof(float), mb, sizeof(float)));
}
lda /= sizeof(float);
if (args->transB == CBlasNoTrans) {
CU_ERROR_CHECK(cuMemAllocPitch(&B0, &ldb, kb * sizeof(float), nb, sizeof(float)));
CU_ERROR_CHECK(cuMemAllocPitch(&B1, &ldb, kb * sizeof(float), nb, sizeof(float)));
}
else {
CU_ERROR_CHECK(cuMemAllocPitch(&B0, &ldb, nb * sizeof(float), kb, sizeof(float)));
CU_ERROR_CHECK(cuMemAllocPitch(&B1, &ldb, nb * sizeof(float), kb, sizeof(float)));
}
ldb /= sizeof(float);
CU_ERROR_CHECK(cuMemAllocPitch(&C, &ldc, mb * sizeof(float), nb, sizeof(float)));
ldc /= sizeof(float);
// Create streams
CU_ERROR_CHECK(cuStreamCreate(©, CU_STREAM_NON_BLOCKING));
CU_ERROR_CHECK(cuStreamCreate(&compute, CU_STREAM_NON_BLOCKING));
// Copy C onto the device using the compute stream
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(C, ldc, 0, 0,
args->C, args->ldc, 0, 0,
args->m, args->n, sizeof(float), compute));
// Perform C *= beta on the compute stream to ensure C has finished copying
CU_ERROR_CHECK(cuSgemm(handle, CBlasNoTrans, CBlasNoTrans,
args->m, args->n, 0,
zero, 0, ldc, 0, 0,
args->beta, C, ldc, compute));
// Can exit early if alpha * op(A) * op(B) will evaluate to zero
if (args->alpha != zero && args->k > 0) {
// Perform C += alpha * op(A) * op(B)
if (args->transB == CBlasNoTrans) {
if (args->transA == CBlasNoTrans) {
// Copy A and B onto the device asynchronously on the same stream as C
const size_t lb = min(args->k, kb);
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A0, lda, 0, 0,
args->A, args->lda, 0, 0,
args->m, lb, sizeof(float), compute));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B0, ldb, 0, 0,
args->B, args->ldb, 0, 0,
lb, args->n, sizeof(float), compute));
for (size_t l = 0; l < args->k; l += kb) {
// Compute C on the same stream as the copies to ensure they have finished first
CU_ERROR_CHECK(cuSgemm(handle, args->transA, args->transB,
args->m, args->n, min(args->k - l, kb),
args->alpha, A0, lda, B0, ldb,
one, C, ldc, compute));
// If there is more work to do
if (l + kb < args->k) {
const size_t lb = min(args->k - l - kb, kb);
// Copy the next blocks of A and B on the opposite stream from the sgemm
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A1, lda, 0, 0,
args->A, args->lda, 0, l + kb,
args->m, lb, sizeof(float), copy));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B1, ldb, 0, 0,
args->B, args->ldb, l + kb, 0,
lb, args->n, sizeof(float), copy));
// Swap the streams and pointers so that the compute starts after the copy
CUstream stream = compute; compute = copy; copy = stream;
CUdeviceptr ptr = A0; A0 = A1; A1 = ptr;
ptr = B0; B0 = B1; B1 = ptr;
}
}
}
else {
// Copy A and B onto the device asynchronously on the same stream as C
const size_t lb = min(args->k, kb);
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A0, lda, 0, 0,
args->A, args->lda, 0, 0,
lb, args->m, sizeof(float), compute));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B0, ldb, 0, 0,
args->B, args->ldb, 0, 0,
lb, args->n, sizeof(float), compute));
for (size_t l = 0; l < args->k; l += kb) {
// Compute C on the same stream as the copies to ensure they have finished first
CU_ERROR_CHECK(cuSgemm(handle, args->transA, args->transB,
args->m, args->n, min(args->k - l, kb),
args->alpha, A0, lda, B0, ldb,
one, C, ldc, compute));
// If there is more work to do
if (l + kb < args->k) {
const size_t lb = min(args->k - l - kb, kb);
// Copy the next blocks of A and B on the opposite stream from the sgemm
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A1, lda, 0, 0,
args->A, args->lda, l + kb, 0,
lb, args->m, sizeof(float), copy));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B1, ldb, 0, 0,
args->B, args->ldb, l + kb, 0,
lb, args->n, sizeof(float), copy));
// Swap the streams and pointers so that the compute starts after the copy
CUstream stream = compute; compute = copy; copy = stream;
CUdeviceptr ptr = A0; A0 = A1; A1 = ptr;
ptr = B0; B0 = B1; B1 = ptr;
}
}
}
}
else {
if (args->transA == CBlasNoTrans) {
// Copy A and B onto the device asynchronously on the same stream as C
const size_t lb = min(args->k, kb);
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A0, lda, 0, 0,
args->A, args->lda, 0, 0,
args->m, lb, sizeof(float), compute));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B0, ldb, 0, 0,
args->B, args->ldb, 0, 0,
args->n, lb, sizeof(float), compute));
for (size_t l = 0; l < args->k; l += kb) {
// Compute C on the same stream as the copies to ensure they have finished first
CU_ERROR_CHECK(cuSgemm(handle, args->transA, args->transB,
args->m, args->n, min(args->k - l, kb),
args->alpha, A0, lda, B0, ldb,
one, C, ldc, compute));
// If there is more work to do
if (l + kb < args->k) {
const size_t lb = min(args->k - l - kb, kb);
// Copy the next blocks of A and B on the opposite stream from the sgemm
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A1, lda, 0, 0,
args->A, args->lda, 0, l + kb,
args->m, lb, sizeof(float), copy));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B1, ldb, 0, 0,
args->B, args->ldb, 0, l + kb,
args->n, lb, sizeof(float), copy));
// Swap the streams and pointers so that the compute starts after the copy
CUstream stream = compute; compute = copy; copy = stream;
CUdeviceptr ptr = A0; A0 = A1; A1 = ptr;
ptr = B0; B0 = B1; B1 = ptr;
}
}
}
else {
// Copy A and B onto the device asynchronously on the same stream as C
const size_t lb = min(args->k, kb);
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A0, lda, 0, 0,
args->A, args->lda, 0, 0,
lb, args->m, sizeof(float), compute));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B0, ldb, 0, 0,
args->B, args->ldb, 0, 0,
args->n, lb, sizeof(float), compute));
for (size_t l = 0; l < args->k; l += kb) {
// Compute C on the same stream as the copies to ensure they have finished first
CU_ERROR_CHECK(cuSgemm(handle, args->transA, args->transB,
args->m, args->n, min(args->k - l, kb),
args->alpha, A0, lda, B0, ldb,
one, C, ldc, compute));
// If there is more work to do
if (l + kb < args->k) {
const size_t lb = min(args->k - l - kb, kb);
// Copy the next blocks of A and B on the opposite stream from the sgemm
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(A1, lda, 0, 0,
args->A, args->lda, l + kb, 0,
lb, args->m, sizeof(float), copy));
CU_ERROR_CHECK(cuMemcpyHtoD2DAsync(B1, ldb, 0, 0,
args->B, args->ldb, 0, l + kb,
args->n, lb, sizeof(float), copy));
// Swap the streams and pointers so that the compute starts after the copy
CUstream stream = compute; compute = copy; copy = stream;
CUdeviceptr ptr = A0; A0 = A1; A1 = ptr;
ptr = B0; B0 = B1; B1 = ptr;
}
}
}
}
}
// Copy C back onto the host on the compute stream
CU_ERROR_CHECK(cuMemcpyDtoH2DAsync(args->C, args->ldc, 0, 0, C, ldc, 0, 0,
args->m, args->n, sizeof(float), compute));
// Clean up temporary memory and streams
CU_ERROR_CHECK(cuMemFree(A0));
CU_ERROR_CHECK(cuMemFree(A1));
CU_ERROR_CHECK(cuMemFree(B0));
CU_ERROR_CHECK(cuMemFree(B1));
CU_ERROR_CHECK(cuMemFree(C));
CU_ERROR_CHECK(cuStreamDestroy(copy));
CU_ERROR_CHECK(cuStreamDestroy(compute));
return CUDA_SUCCESS;
}
CUresult cuMultiGPUSgemm(CUmultiGPUBLAShandle handle,
CBlasTranspose transA, CBlasTranspose transB,
size_t m, size_t n, size_t k,
float alpha, const float * restrict A, size_t lda,
const float * restrict B, size_t ldb,
float beta, float * restrict C, size_t ldc) {
const size_t nRowA = (transA == CBlasNoTrans) ? m : k;
const size_t nRowB = (transB == CBlasNoTrans) ? k : n;
int info = 0;
if (lda < nRowA)
info = 8;
else if (ldb < nRowB)
info = 10;
else if (ldc < m)
info = 13;
if (info != 0) {
XERBLA(info);
return CUDA_ERROR_INVALID_VALUE;
}
if (m == 0 || n == 0 || ((alpha == zero || k == 0) && beta == one))
return CUDA_SUCCESS;
if (alpha == zero) {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i < m; i++)
C[j * ldc + i] = zero;
}
}
else {
for (size_t j = 0; j < n; j++) {
#pragma omp parallel for
for (size_t i = 0; i < m; i++)
C[j * ldc + i] *= beta;
}
}
return CUDA_SUCCESS;
}
const size_t mb = (transA == CBlasNoTrans) ? SGEMM_N_MB : SGEMM_T_MB;
const size_t nb = (transA == CBlasNoTrans) ? SGEMM_N_NB : SGEMM_T_NB;
if (m < mb && n < nb) {
sgemm(transA, transB, m, n, k, alpha, A, lda, B, ldb, beta, C, ldc);
return CUDA_SUCCESS;
}
int task = 0, nTasks = (int)(((m + mb - 1) / mb) * ((n + nb - 1) / nb));
CUtask tasks[nTasks];
int ctx = 0;
int nCtxs = cuMultiGPUGetContextCount(handle->mGPU);
struct sgemm_args args = { .transA = transA, .transB = transB,
.k = k,
.alpha = alpha, .lda = lda, .ldb = ldb,
.beta = beta, .ldc = ldc };
if (transB == CBlasNoTrans) {
if (transA == CBlasNoTrans) {
for (size_t j = 0; j < n; j += nb) {
args.n = min(n - j, nb);
for (size_t i = 0; i < m; i += mb) {
args.m = min(m - i, mb);
args.A = &A[i];
args.B = &B[j * ldb];
args.C = &C[j * ldc + i];
args.handle = &handle->handles[ctx];
CU_ERROR_CHECK(cuTaskCreate(&tasks[task], background_sgemm, &args, sizeof(struct sgemm_args)));
CU_ERROR_CHECK(cuMultiGPURunTask(handle->mGPU, ctx++, tasks[task++]));
if (ctx == nCtxs)
ctx = 0;
}
}
}
else {
for (size_t j = 0; j < n; j += nb) {
args.n = min(n - j, nb);
for (size_t i = 0; i < m; i += mb) {
args.m = min(m - i, mb);
args.A = &A[i * lda];
args.B = &B[j * ldb];
args.C = &C[j * ldc + i];
args.handle = &handle->handles[ctx];
CU_ERROR_CHECK(cuTaskCreate(&tasks[task], background_sgemm, &args, sizeof(struct sgemm_args)));
CU_ERROR_CHECK(cuMultiGPURunTask(handle->mGPU, ctx++, tasks[task++]));
if (ctx == nCtxs)
ctx = 0;
}
}
}
}
else {
if (transA == CBlasNoTrans) {
for (size_t j = 0; j < n; j += nb) {
args.n = min(n - j, nb);
for (size_t i = 0; i < m; i += mb) {
args.m = min(m - i, mb);
args.A = &A[i];
args.B = &B[j];
args.C = &C[j * ldc + i];
args.handle = &handle->handles[ctx];
CU_ERROR_CHECK(cuTaskCreate(&tasks[task], background_sgemm, &args, sizeof(struct sgemm_args)));
CU_ERROR_CHECK(cuMultiGPURunTask(handle->mGPU, ctx++, tasks[task++]));
if (ctx == nCtxs)
ctx = 0;
}
}
}
else {
for (size_t j = 0; j < n; j += nb) {
args.n = min(n - j, nb);
for (size_t i = 0; i < m; i += mb) {
args.m = min(m - i, mb);
args.A = &A[i * lda];
args.B = &B[j];
args.C = &C[j * ldc + i];
args.handle = &handle->handles[ctx];
CU_ERROR_CHECK(cuTaskCreate(&tasks[task], background_sgemm, &args, sizeof(struct sgemm_args)));
CU_ERROR_CHECK(cuMultiGPURunTask(handle->mGPU, ctx++, tasks[task++]));
if (ctx == nCtxs)
ctx = 0;
}
}
}
}
CUresult result;
for (task = 0; task < nTasks; task++)
CU_ERROR_CHECK(cuTaskDestroy(tasks[task], &result));
return result;
}
|
Stmt.h | //===- Stmt.h - Classes for representing statements -------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// This file defines the Stmt interface and subclasses.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_CLANG_AST_STMT_H
#define LLVM_CLANG_AST_STMT_H
#include "clang/AST/DeclGroup.h"
#include "clang/AST/DependenceFlags.h"
#include "clang/AST/StmtIterator.h"
#include "clang/Basic/CapturedStmt.h"
#include "clang/Basic/IdentifierTable.h"
#include "clang/Basic/LLVM.h"
#include "clang/Basic/SourceLocation.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/BitmaskEnum.h"
#include "llvm/ADT/PointerIntPair.h"
#include "llvm/ADT/StringRef.h"
#include "llvm/ADT/iterator.h"
#include "llvm/ADT/iterator_range.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/Compiler.h"
#include "llvm/Support/ErrorHandling.h"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <iterator>
#include <string>
namespace llvm {
class FoldingSetNodeID;
} // namespace llvm
namespace clang {
class ASTContext;
class Attr;
class CapturedDecl;
class Decl;
class Expr;
class AddrLabelExpr;
class LabelDecl;
class ODRHash;
class PrinterHelper;
struct PrintingPolicy;
class RecordDecl;
class SourceManager;
class StringLiteral;
class Token;
class VarDecl;
//===----------------------------------------------------------------------===//
// AST classes for statements.
//===----------------------------------------------------------------------===//
/// Stmt - This represents one statement.
///
class alignas(void *) Stmt {
public:
enum StmtClass {
NoStmtClass = 0,
#define STMT(CLASS, PARENT) CLASS##Class,
#define STMT_RANGE(BASE, FIRST, LAST) \
first##BASE##Constant=FIRST##Class, last##BASE##Constant=LAST##Class,
#define LAST_STMT_RANGE(BASE, FIRST, LAST) \
first##BASE##Constant=FIRST##Class, last##BASE##Constant=LAST##Class
#define ABSTRACT_STMT(STMT)
#include "clang/AST/StmtNodes.inc"
};
// Make vanilla 'new' and 'delete' illegal for Stmts.
protected:
friend class ASTStmtReader;
friend class ASTStmtWriter;
void *operator new(size_t bytes) noexcept {
llvm_unreachable("Stmts cannot be allocated with regular 'new'.");
}
void operator delete(void *data) noexcept {
llvm_unreachable("Stmts cannot be released with regular 'delete'.");
}
//===--- Statement bitfields classes ---===//
class StmtBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class Stmt;
/// The statement class.
unsigned sClass : 8;
};
enum { NumStmtBits = 8 };
class NullStmtBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class NullStmt;
unsigned : NumStmtBits;
/// True if the null statement was preceded by an empty macro, e.g:
/// @code
/// #define CALL(x)
/// CALL(0);
/// @endcode
unsigned HasLeadingEmptyMacro : 1;
/// The location of the semi-colon.
SourceLocation SemiLoc;
};
class CompoundStmtBitfields {
friend class ASTStmtReader;
friend class CompoundStmt;
unsigned : NumStmtBits;
unsigned NumStmts : 32 - NumStmtBits;
/// The location of the opening "{".
SourceLocation LBraceLoc;
};
class LabelStmtBitfields {
friend class LabelStmt;
unsigned : NumStmtBits;
SourceLocation IdentLoc;
};
class AttributedStmtBitfields {
friend class ASTStmtReader;
friend class AttributedStmt;
unsigned : NumStmtBits;
/// Number of attributes.
unsigned NumAttrs : 32 - NumStmtBits;
/// The location of the attribute.
SourceLocation AttrLoc;
};
class IfStmtBitfields {
friend class ASTStmtReader;
friend class IfStmt;
unsigned : NumStmtBits;
/// True if this if statement is a constexpr if.
unsigned IsConstexpr : 1;
/// True if this if statement has storage for an else statement.
unsigned HasElse : 1;
/// True if this if statement has storage for a variable declaration.
unsigned HasVar : 1;
/// True if this if statement has storage for an init statement.
unsigned HasInit : 1;
/// The location of the "if".
SourceLocation IfLoc;
};
class SwitchStmtBitfields {
friend class SwitchStmt;
unsigned : NumStmtBits;
/// True if the SwitchStmt has storage for an init statement.
unsigned HasInit : 1;
/// True if the SwitchStmt has storage for a condition variable.
unsigned HasVar : 1;
/// If the SwitchStmt is a switch on an enum value, records whether all
/// the enum values were covered by CaseStmts. The coverage information
/// value is meant to be a hint for possible clients.
unsigned AllEnumCasesCovered : 1;
/// The location of the "switch".
SourceLocation SwitchLoc;
};
class WhileStmtBitfields {
friend class ASTStmtReader;
friend class WhileStmt;
unsigned : NumStmtBits;
/// True if the WhileStmt has storage for a condition variable.
unsigned HasVar : 1;
/// The location of the "while".
SourceLocation WhileLoc;
};
class DoStmtBitfields {
friend class DoStmt;
unsigned : NumStmtBits;
/// The location of the "do".
SourceLocation DoLoc;
};
class ForStmtBitfields {
friend class ForStmt;
unsigned : NumStmtBits;
/// The location of the "for".
SourceLocation ForLoc;
};
class GotoStmtBitfields {
friend class GotoStmt;
friend class IndirectGotoStmt;
unsigned : NumStmtBits;
/// The location of the "goto".
SourceLocation GotoLoc;
};
class ContinueStmtBitfields {
friend class ContinueStmt;
unsigned : NumStmtBits;
/// The location of the "continue".
SourceLocation ContinueLoc;
};
class BreakStmtBitfields {
friend class BreakStmt;
unsigned : NumStmtBits;
/// The location of the "break".
SourceLocation BreakLoc;
};
class ReturnStmtBitfields {
friend class ReturnStmt;
unsigned : NumStmtBits;
/// True if this ReturnStmt has storage for an NRVO candidate.
unsigned HasNRVOCandidate : 1;
/// The location of the "return".
SourceLocation RetLoc;
};
class SwitchCaseBitfields {
friend class SwitchCase;
friend class CaseStmt;
unsigned : NumStmtBits;
/// Used by CaseStmt to store whether it is a case statement
/// of the form case LHS ... RHS (a GNU extension).
unsigned CaseStmtIsGNURange : 1;
/// The location of the "case" or "default" keyword.
SourceLocation KeywordLoc;
};
//===--- Expression bitfields classes ---===//
class ExprBitfields {
friend class ASTStmtReader; // deserialization
friend class AtomicExpr; // ctor
friend class BlockDeclRefExpr; // ctor
friend class CallExpr; // ctor
friend class CXXConstructExpr; // ctor
friend class CXXDependentScopeMemberExpr; // ctor
friend class CXXNewExpr; // ctor
friend class CXXUnresolvedConstructExpr; // ctor
friend class DeclRefExpr; // computeDependence
friend class DependentScopeDeclRefExpr; // ctor
friend class DesignatedInitExpr; // ctor
friend class Expr;
friend class InitListExpr; // ctor
friend class ObjCArrayLiteral; // ctor
friend class ObjCDictionaryLiteral; // ctor
friend class ObjCMessageExpr; // ctor
friend class OffsetOfExpr; // ctor
friend class OpaqueValueExpr; // ctor
friend class OverloadExpr; // ctor
friend class ParenListExpr; // ctor
friend class PseudoObjectExpr; // ctor
friend class ShuffleVectorExpr; // ctor
unsigned : NumStmtBits;
unsigned ValueKind : 2;
unsigned ObjectKind : 3;
unsigned /*ExprDependence*/ Dependent : llvm::BitWidth<ExprDependence>;
};
enum { NumExprBits = NumStmtBits + 5 + llvm::BitWidth<ExprDependence> };
class ConstantExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class ConstantExpr;
unsigned : NumExprBits;
/// The kind of result that is tail-allocated.
unsigned ResultKind : 2;
/// The kind of Result as defined by APValue::Kind.
unsigned APValueKind : 4;
/// When ResultKind == RSK_Int64, true if the tail-allocated integer is
/// unsigned.
unsigned IsUnsigned : 1;
/// When ResultKind == RSK_Int64. the BitWidth of the tail-allocated
/// integer. 7 bits because it is the minimal number of bits to represent a
/// value from 0 to 64 (the size of the tail-allocated integer).
unsigned BitWidth : 7;
/// When ResultKind == RSK_APValue, true if the ASTContext will cleanup the
/// tail-allocated APValue.
unsigned HasCleanup : 1;
/// True if this ConstantExpr was created for immediate invocation.
unsigned IsImmediateInvocation : 1;
};
class PredefinedExprBitfields {
friend class ASTStmtReader;
friend class PredefinedExpr;
unsigned : NumExprBits;
/// The kind of this PredefinedExpr. One of the enumeration values
/// in PredefinedExpr::IdentKind.
unsigned Kind : 4;
/// True if this PredefinedExpr has a trailing "StringLiteral *"
/// for the predefined identifier.
unsigned HasFunctionName : 1;
/// The location of this PredefinedExpr.
SourceLocation Loc;
};
class DeclRefExprBitfields {
friend class ASTStmtReader; // deserialization
friend class DeclRefExpr;
unsigned : NumExprBits;
unsigned HasQualifier : 1;
unsigned HasTemplateKWAndArgsInfo : 1;
unsigned HasFoundDecl : 1;
unsigned HadMultipleCandidates : 1;
unsigned RefersToEnclosingVariableOrCapture : 1;
unsigned NonOdrUseReason : 2;
/// The location of the declaration name itself.
SourceLocation Loc;
};
class FloatingLiteralBitfields {
friend class FloatingLiteral;
unsigned : NumExprBits;
unsigned Semantics : 3; // Provides semantics for APFloat construction
unsigned IsExact : 1;
};
class StringLiteralBitfields {
friend class ASTStmtReader;
friend class StringLiteral;
unsigned : NumExprBits;
/// The kind of this string literal.
/// One of the enumeration values of StringLiteral::StringKind.
unsigned Kind : 3;
/// The width of a single character in bytes. Only values of 1, 2,
/// and 4 bytes are supported. StringLiteral::mapCharByteWidth maps
/// the target + string kind to the appropriate CharByteWidth.
unsigned CharByteWidth : 3;
unsigned IsPascal : 1;
/// The number of concatenated token this string is made of.
/// This is the number of trailing SourceLocation.
unsigned NumConcatenated;
};
class CharacterLiteralBitfields {
friend class CharacterLiteral;
unsigned : NumExprBits;
unsigned Kind : 3;
};
class UnaryOperatorBitfields {
friend class UnaryOperator;
unsigned : NumExprBits;
unsigned Opc : 5;
unsigned CanOverflow : 1;
//
/// This is only meaningful for operations on floating point
/// types when additional values need to be in trailing storage.
/// It is 0 otherwise.
unsigned HasFPFeatures : 1;
SourceLocation Loc;
};
class UnaryExprOrTypeTraitExprBitfields {
friend class UnaryExprOrTypeTraitExpr;
unsigned : NumExprBits;
unsigned Kind : 3;
unsigned IsType : 1; // true if operand is a type, false if an expression.
};
class ArrayOrMatrixSubscriptExprBitfields {
friend class ArraySubscriptExpr;
friend class MatrixSubscriptExpr;
unsigned : NumExprBits;
SourceLocation RBracketLoc;
};
class CallExprBitfields {
friend class CallExpr;
unsigned : NumExprBits;
unsigned NumPreArgs : 1;
/// True if the callee of the call expression was found using ADL.
unsigned UsesADL : 1;
/// Padding used to align OffsetToTrailingObjects to a byte multiple.
unsigned : 24 - 2 - NumExprBits;
/// The offset in bytes from the this pointer to the start of the
/// trailing objects belonging to CallExpr. Intentionally byte sized
/// for faster access.
unsigned OffsetToTrailingObjects : 8;
};
enum { NumCallExprBits = 32 };
class MemberExprBitfields {
friend class ASTStmtReader;
friend class MemberExpr;
unsigned : NumExprBits;
/// IsArrow - True if this is "X->F", false if this is "X.F".
unsigned IsArrow : 1;
/// True if this member expression used a nested-name-specifier to
/// refer to the member, e.g., "x->Base::f", or found its member via
/// a using declaration. When true, a MemberExprNameQualifier
/// structure is allocated immediately after the MemberExpr.
unsigned HasQualifierOrFoundDecl : 1;
/// True if this member expression specified a template keyword
/// and/or a template argument list explicitly, e.g., x->f<int>,
/// x->template f, x->template f<int>.
/// When true, an ASTTemplateKWAndArgsInfo structure and its
/// TemplateArguments (if any) are present.
unsigned HasTemplateKWAndArgsInfo : 1;
/// True if this member expression refers to a method that
/// was resolved from an overloaded set having size greater than 1.
unsigned HadMultipleCandidates : 1;
/// Value of type NonOdrUseReason indicating why this MemberExpr does
/// not constitute an odr-use of the named declaration. Meaningful only
/// when naming a static member.
unsigned NonOdrUseReason : 2;
/// This is the location of the -> or . in the expression.
SourceLocation OperatorLoc;
};
class CastExprBitfields {
friend class CastExpr;
friend class ImplicitCastExpr;
unsigned : NumExprBits;
unsigned Kind : 6;
unsigned PartOfExplicitCast : 1; // Only set for ImplicitCastExpr.
/// The number of CXXBaseSpecifiers in the cast. 14 bits would be enough
/// here. ([implimits] Direct and indirect base classes [16384]).
unsigned BasePathSize;
};
class BinaryOperatorBitfields {
friend class BinaryOperator;
unsigned : NumExprBits;
unsigned Opc : 6;
/// This is only meaningful for operations on floating point
/// types when additional values need to be in trailing storage.
/// It is 0 otherwise.
unsigned HasFPFeatures : 1;
SourceLocation OpLoc;
};
class InitListExprBitfields {
friend class InitListExpr;
unsigned : NumExprBits;
/// Whether this initializer list originally had a GNU array-range
/// designator in it. This is a temporary marker used by CodeGen.
unsigned HadArrayRangeDesignator : 1;
};
class ParenListExprBitfields {
friend class ASTStmtReader;
friend class ParenListExpr;
unsigned : NumExprBits;
/// The number of expressions in the paren list.
unsigned NumExprs;
};
class GenericSelectionExprBitfields {
friend class ASTStmtReader;
friend class GenericSelectionExpr;
unsigned : NumExprBits;
/// The location of the "_Generic".
SourceLocation GenericLoc;
};
class PseudoObjectExprBitfields {
friend class ASTStmtReader; // deserialization
friend class PseudoObjectExpr;
unsigned : NumExprBits;
// These don't need to be particularly wide, because they're
// strictly limited by the forms of expressions we permit.
unsigned NumSubExprs : 8;
unsigned ResultIndex : 32 - 8 - NumExprBits;
};
class SourceLocExprBitfields {
friend class ASTStmtReader;
friend class SourceLocExpr;
unsigned : NumExprBits;
/// The kind of source location builtin represented by the SourceLocExpr.
/// Ex. __builtin_LINE, __builtin_FUNCTION, ect.
unsigned Kind : 2;
};
class StmtExprBitfields {
friend class ASTStmtReader;
friend class StmtExpr;
unsigned : NumExprBits;
/// The number of levels of template parameters enclosing this statement
/// expression. Used to determine if a statement expression remains
/// dependent after instantiation.
unsigned TemplateDepth;
};
//===--- C++ Expression bitfields classes ---===//
class CXXOperatorCallExprBitfields {
friend class ASTStmtReader;
friend class CXXOperatorCallExpr;
unsigned : NumCallExprBits;
/// The kind of this overloaded operator. One of the enumerator
/// value of OverloadedOperatorKind.
unsigned OperatorKind : 6;
};
class CXXRewrittenBinaryOperatorBitfields {
friend class ASTStmtReader;
friend class CXXRewrittenBinaryOperator;
unsigned : NumCallExprBits;
unsigned IsReversed : 1;
};
class CXXBoolLiteralExprBitfields {
friend class CXXBoolLiteralExpr;
unsigned : NumExprBits;
/// The value of the boolean literal.
unsigned Value : 1;
/// The location of the boolean literal.
SourceLocation Loc;
};
class CXXNullPtrLiteralExprBitfields {
friend class CXXNullPtrLiteralExpr;
unsigned : NumExprBits;
/// The location of the null pointer literal.
SourceLocation Loc;
};
class CXXThisExprBitfields {
friend class CXXThisExpr;
unsigned : NumExprBits;
/// Whether this is an implicit "this".
unsigned IsImplicit : 1;
/// The location of the "this".
SourceLocation Loc;
};
class CXXThrowExprBitfields {
friend class ASTStmtReader;
friend class CXXThrowExpr;
unsigned : NumExprBits;
/// Whether the thrown variable (if any) is in scope.
unsigned IsThrownVariableInScope : 1;
/// The location of the "throw".
SourceLocation ThrowLoc;
};
class CXXDefaultArgExprBitfields {
friend class ASTStmtReader;
friend class CXXDefaultArgExpr;
unsigned : NumExprBits;
/// The location where the default argument expression was used.
SourceLocation Loc;
};
class CXXDefaultInitExprBitfields {
friend class ASTStmtReader;
friend class CXXDefaultInitExpr;
unsigned : NumExprBits;
/// The location where the default initializer expression was used.
SourceLocation Loc;
};
class CXXScalarValueInitExprBitfields {
friend class ASTStmtReader;
friend class CXXScalarValueInitExpr;
unsigned : NumExprBits;
SourceLocation RParenLoc;
};
class CXXNewExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class CXXNewExpr;
unsigned : NumExprBits;
/// Was the usage ::new, i.e. is the global new to be used?
unsigned IsGlobalNew : 1;
/// Do we allocate an array? If so, the first trailing "Stmt *" is the
/// size expression.
unsigned IsArray : 1;
/// Should the alignment be passed to the allocation function?
unsigned ShouldPassAlignment : 1;
/// If this is an array allocation, does the usual deallocation
/// function for the allocated type want to know the allocated size?
unsigned UsualArrayDeleteWantsSize : 1;
/// What kind of initializer do we have? Could be none, parens, or braces.
/// In storage, we distinguish between "none, and no initializer expr", and
/// "none, but an implicit initializer expr".
unsigned StoredInitializationStyle : 2;
/// True if the allocated type was expressed as a parenthesized type-id.
unsigned IsParenTypeId : 1;
/// The number of placement new arguments.
unsigned NumPlacementArgs;
};
class CXXDeleteExprBitfields {
friend class ASTStmtReader;
friend class CXXDeleteExpr;
unsigned : NumExprBits;
/// Is this a forced global delete, i.e. "::delete"?
unsigned GlobalDelete : 1;
/// Is this the array form of delete, i.e. "delete[]"?
unsigned ArrayForm : 1;
/// ArrayFormAsWritten can be different from ArrayForm if 'delete' is
/// applied to pointer-to-array type (ArrayFormAsWritten will be false
/// while ArrayForm will be true).
unsigned ArrayFormAsWritten : 1;
/// Does the usual deallocation function for the element type require
/// a size_t argument?
unsigned UsualArrayDeleteWantsSize : 1;
/// Location of the expression.
SourceLocation Loc;
};
class TypeTraitExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class TypeTraitExpr;
unsigned : NumExprBits;
/// The kind of type trait, which is a value of a TypeTrait enumerator.
unsigned Kind : 8;
/// If this expression is not value-dependent, this indicates whether
/// the trait evaluated true or false.
unsigned Value : 1;
/// The number of arguments to this type trait. According to [implimits]
/// 8 bits would be enough, but we require (and test for) at least 16 bits
/// to mirror FunctionType.
unsigned NumArgs;
};
class DependentScopeDeclRefExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class DependentScopeDeclRefExpr;
unsigned : NumExprBits;
/// Whether the name includes info for explicit template
/// keyword and arguments.
unsigned HasTemplateKWAndArgsInfo : 1;
};
class CXXConstructExprBitfields {
friend class ASTStmtReader;
friend class CXXConstructExpr;
unsigned : NumExprBits;
unsigned Elidable : 1;
unsigned HadMultipleCandidates : 1;
unsigned ListInitialization : 1;
unsigned StdInitListInitialization : 1;
unsigned ZeroInitialization : 1;
unsigned ConstructionKind : 3;
SourceLocation Loc;
};
class ExprWithCleanupsBitfields {
friend class ASTStmtReader; // deserialization
friend class ExprWithCleanups;
unsigned : NumExprBits;
// When false, it must not have side effects.
unsigned CleanupsHaveSideEffects : 1;
unsigned NumObjects : 32 - 1 - NumExprBits;
};
class CXXUnresolvedConstructExprBitfields {
friend class ASTStmtReader;
friend class CXXUnresolvedConstructExpr;
unsigned : NumExprBits;
/// The number of arguments used to construct the type.
unsigned NumArgs;
};
class CXXDependentScopeMemberExprBitfields {
friend class ASTStmtReader;
friend class CXXDependentScopeMemberExpr;
unsigned : NumExprBits;
/// Whether this member expression used the '->' operator or
/// the '.' operator.
unsigned IsArrow : 1;
/// Whether this member expression has info for explicit template
/// keyword and arguments.
unsigned HasTemplateKWAndArgsInfo : 1;
/// See getFirstQualifierFoundInScope() and the comment listing
/// the trailing objects.
unsigned HasFirstQualifierFoundInScope : 1;
/// The location of the '->' or '.' operator.
SourceLocation OperatorLoc;
};
class OverloadExprBitfields {
friend class ASTStmtReader;
friend class OverloadExpr;
unsigned : NumExprBits;
/// Whether the name includes info for explicit template
/// keyword and arguments.
unsigned HasTemplateKWAndArgsInfo : 1;
/// Padding used by the derived classes to store various bits. If you
/// need to add some data here, shrink this padding and add your data
/// above. NumOverloadExprBits also needs to be updated.
unsigned : 32 - NumExprBits - 1;
/// The number of results.
unsigned NumResults;
};
enum { NumOverloadExprBits = NumExprBits + 1 };
class UnresolvedLookupExprBitfields {
friend class ASTStmtReader;
friend class UnresolvedLookupExpr;
unsigned : NumOverloadExprBits;
/// True if these lookup results should be extended by
/// argument-dependent lookup if this is the operand of a function call.
unsigned RequiresADL : 1;
/// True if these lookup results are overloaded. This is pretty trivially
/// rederivable if we urgently need to kill this field.
unsigned Overloaded : 1;
};
static_assert(sizeof(UnresolvedLookupExprBitfields) <= 4,
"UnresolvedLookupExprBitfields must be <= than 4 bytes to"
"avoid trashing OverloadExprBitfields::NumResults!");
class UnresolvedMemberExprBitfields {
friend class ASTStmtReader;
friend class UnresolvedMemberExpr;
unsigned : NumOverloadExprBits;
/// Whether this member expression used the '->' operator or
/// the '.' operator.
unsigned IsArrow : 1;
/// Whether the lookup results contain an unresolved using declaration.
unsigned HasUnresolvedUsing : 1;
};
static_assert(sizeof(UnresolvedMemberExprBitfields) <= 4,
"UnresolvedMemberExprBitfields must be <= than 4 bytes to"
"avoid trashing OverloadExprBitfields::NumResults!");
class CXXNoexceptExprBitfields {
friend class ASTStmtReader;
friend class CXXNoexceptExpr;
unsigned : NumExprBits;
unsigned Value : 1;
};
class SubstNonTypeTemplateParmExprBitfields {
friend class ASTStmtReader;
friend class SubstNonTypeTemplateParmExpr;
unsigned : NumExprBits;
/// The location of the non-type template parameter reference.
SourceLocation NameLoc;
};
class LambdaExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class LambdaExpr;
unsigned : NumExprBits;
/// The default capture kind, which is a value of type
/// LambdaCaptureDefault.
unsigned CaptureDefault : 2;
/// Whether this lambda had an explicit parameter list vs. an
/// implicit (and empty) parameter list.
unsigned ExplicitParams : 1;
/// Whether this lambda had the result type explicitly specified.
unsigned ExplicitResultType : 1;
/// The number of captures.
unsigned NumCaptures : 16;
};
class RequiresExprBitfields {
friend class ASTStmtReader;
friend class ASTStmtWriter;
friend class RequiresExpr;
unsigned : NumExprBits;
unsigned IsSatisfied : 1;
SourceLocation RequiresKWLoc;
};
//===--- C++ Coroutines TS bitfields classes ---===//
class CoawaitExprBitfields {
friend class CoawaitExpr;
unsigned : NumExprBits;
unsigned IsImplicit : 1;
};
//===--- Obj-C Expression bitfields classes ---===//
class ObjCIndirectCopyRestoreExprBitfields {
friend class ObjCIndirectCopyRestoreExpr;
unsigned : NumExprBits;
unsigned ShouldCopy : 1;
};
//===--- Clang Extensions bitfields classes ---===//
class OpaqueValueExprBitfields {
friend class ASTStmtReader;
friend class OpaqueValueExpr;
unsigned : NumExprBits;
/// The OVE is a unique semantic reference to its source expression if this
/// bit is set to true.
unsigned IsUnique : 1;
SourceLocation Loc;
};
union {
// Same order as in StmtNodes.td.
// Statements
StmtBitfields StmtBits;
NullStmtBitfields NullStmtBits;
CompoundStmtBitfields CompoundStmtBits;
LabelStmtBitfields LabelStmtBits;
AttributedStmtBitfields AttributedStmtBits;
IfStmtBitfields IfStmtBits;
SwitchStmtBitfields SwitchStmtBits;
WhileStmtBitfields WhileStmtBits;
DoStmtBitfields DoStmtBits;
ForStmtBitfields ForStmtBits;
GotoStmtBitfields GotoStmtBits;
ContinueStmtBitfields ContinueStmtBits;
BreakStmtBitfields BreakStmtBits;
ReturnStmtBitfields ReturnStmtBits;
SwitchCaseBitfields SwitchCaseBits;
// Expressions
ExprBitfields ExprBits;
ConstantExprBitfields ConstantExprBits;
PredefinedExprBitfields PredefinedExprBits;
DeclRefExprBitfields DeclRefExprBits;
FloatingLiteralBitfields FloatingLiteralBits;
StringLiteralBitfields StringLiteralBits;
CharacterLiteralBitfields CharacterLiteralBits;
UnaryOperatorBitfields UnaryOperatorBits;
UnaryExprOrTypeTraitExprBitfields UnaryExprOrTypeTraitExprBits;
ArrayOrMatrixSubscriptExprBitfields ArrayOrMatrixSubscriptExprBits;
CallExprBitfields CallExprBits;
MemberExprBitfields MemberExprBits;
CastExprBitfields CastExprBits;
BinaryOperatorBitfields BinaryOperatorBits;
InitListExprBitfields InitListExprBits;
ParenListExprBitfields ParenListExprBits;
GenericSelectionExprBitfields GenericSelectionExprBits;
PseudoObjectExprBitfields PseudoObjectExprBits;
SourceLocExprBitfields SourceLocExprBits;
// GNU Extensions.
StmtExprBitfields StmtExprBits;
// C++ Expressions
CXXOperatorCallExprBitfields CXXOperatorCallExprBits;
CXXRewrittenBinaryOperatorBitfields CXXRewrittenBinaryOperatorBits;
CXXBoolLiteralExprBitfields CXXBoolLiteralExprBits;
CXXNullPtrLiteralExprBitfields CXXNullPtrLiteralExprBits;
CXXThisExprBitfields CXXThisExprBits;
CXXThrowExprBitfields CXXThrowExprBits;
CXXDefaultArgExprBitfields CXXDefaultArgExprBits;
CXXDefaultInitExprBitfields CXXDefaultInitExprBits;
CXXScalarValueInitExprBitfields CXXScalarValueInitExprBits;
CXXNewExprBitfields CXXNewExprBits;
CXXDeleteExprBitfields CXXDeleteExprBits;
TypeTraitExprBitfields TypeTraitExprBits;
DependentScopeDeclRefExprBitfields DependentScopeDeclRefExprBits;
CXXConstructExprBitfields CXXConstructExprBits;
ExprWithCleanupsBitfields ExprWithCleanupsBits;
CXXUnresolvedConstructExprBitfields CXXUnresolvedConstructExprBits;
CXXDependentScopeMemberExprBitfields CXXDependentScopeMemberExprBits;
OverloadExprBitfields OverloadExprBits;
UnresolvedLookupExprBitfields UnresolvedLookupExprBits;
UnresolvedMemberExprBitfields UnresolvedMemberExprBits;
CXXNoexceptExprBitfields CXXNoexceptExprBits;
SubstNonTypeTemplateParmExprBitfields SubstNonTypeTemplateParmExprBits;
LambdaExprBitfields LambdaExprBits;
RequiresExprBitfields RequiresExprBits;
// C++ Coroutines TS expressions
CoawaitExprBitfields CoawaitBits;
// Obj-C Expressions
ObjCIndirectCopyRestoreExprBitfields ObjCIndirectCopyRestoreExprBits;
// Clang Extensions
OpaqueValueExprBitfields OpaqueValueExprBits;
};
public:
// Only allow allocation of Stmts using the allocator in ASTContext
// or by doing a placement new.
void* operator new(size_t bytes, const ASTContext& C,
unsigned alignment = 8);
void* operator new(size_t bytes, const ASTContext* C,
unsigned alignment = 8) {
return operator new(bytes, *C, alignment);
}
void *operator new(size_t bytes, void *mem) noexcept { return mem; }
void operator delete(void *, const ASTContext &, unsigned) noexcept {}
void operator delete(void *, const ASTContext *, unsigned) noexcept {}
void operator delete(void *, size_t) noexcept {}
void operator delete(void *, void *) noexcept {}
public:
/// A placeholder type used to construct an empty shell of a
/// type, that will be filled in later (e.g., by some
/// de-serialization).
struct EmptyShell {};
protected:
/// Iterator for iterating over Stmt * arrays that contain only T *.
///
/// This is needed because AST nodes use Stmt* arrays to store
/// references to children (to be compatible with StmtIterator).
template<typename T, typename TPtr = T *, typename StmtPtr = Stmt *>
struct CastIterator
: llvm::iterator_adaptor_base<CastIterator<T, TPtr, StmtPtr>, StmtPtr *,
std::random_access_iterator_tag, TPtr> {
using Base = typename CastIterator::iterator_adaptor_base;
CastIterator() : Base(nullptr) {}
CastIterator(StmtPtr *I) : Base(I) {}
typename Base::value_type operator*() const {
return cast_or_null<T>(*this->I);
}
};
/// Const iterator for iterating over Stmt * arrays that contain only T *.
template <typename T>
using ConstCastIterator = CastIterator<T, const T *const, const Stmt *const>;
using ExprIterator = CastIterator<Expr>;
using ConstExprIterator = ConstCastIterator<Expr>;
private:
/// Whether statistic collection is enabled.
static bool StatisticsEnabled;
protected:
/// Construct an empty statement.
explicit Stmt(StmtClass SC, EmptyShell) : Stmt(SC) {}
public:
Stmt() = delete;
Stmt(const Stmt &) = delete;
Stmt(Stmt &&) = delete;
Stmt &operator=(const Stmt &) = delete;
Stmt &operator=(Stmt &&) = delete;
Stmt(StmtClass SC) {
static_assert(sizeof(*this) <= 8,
"changing bitfields changed sizeof(Stmt)");
static_assert(sizeof(*this) % alignof(void *) == 0,
"Insufficient alignment!");
StmtBits.sClass = SC;
if (StatisticsEnabled) Stmt::addStmtClass(SC);
}
StmtClass getStmtClass() const {
return static_cast<StmtClass>(StmtBits.sClass);
}
const char *getStmtClassName() const;
/// SourceLocation tokens are not useful in isolation - they are low level
/// value objects created/interpreted by SourceManager. We assume AST
/// clients will have a pointer to the respective SourceManager.
SourceRange getSourceRange() const LLVM_READONLY;
SourceLocation getBeginLoc() const LLVM_READONLY;
SourceLocation getEndLoc() const LLVM_READONLY;
// global temp stats (until we have a per-module visitor)
static void addStmtClass(const StmtClass s);
static void EnableStatistics();
static void PrintStats();
/// Dumps the specified AST fragment and all subtrees to
/// \c llvm::errs().
void dump() const;
void dump(raw_ostream &OS, const ASTContext &Context) const;
/// \return Unique reproducible object identifier
int64_t getID(const ASTContext &Context) const;
/// dumpColor - same as dump(), but forces color highlighting.
void dumpColor() const;
/// dumpPretty/printPretty - These two methods do a "pretty print" of the AST
/// back to its original source language syntax.
void dumpPretty(const ASTContext &Context) const;
void printPretty(raw_ostream &OS, PrinterHelper *Helper,
const PrintingPolicy &Policy, unsigned Indentation = 0,
StringRef NewlineSymbol = "\n",
const ASTContext *Context = nullptr) const;
/// Pretty-prints in JSON format.
void printJson(raw_ostream &Out, PrinterHelper *Helper,
const PrintingPolicy &Policy, bool AddQuotes) const;
/// viewAST - Visualize an AST rooted at this Stmt* using GraphViz. Only
/// works on systems with GraphViz (Mac OS X) or dot+gv installed.
void viewAST() const;
/// Skip no-op (attributed, compound) container stmts and skip captured
/// stmt at the top, if \a IgnoreCaptured is true.
Stmt *IgnoreContainers(bool IgnoreCaptured = false);
const Stmt *IgnoreContainers(bool IgnoreCaptured = false) const {
return const_cast<Stmt *>(this)->IgnoreContainers(IgnoreCaptured);
}
const Stmt *stripLabelLikeStatements() const;
Stmt *stripLabelLikeStatements() {
return const_cast<Stmt*>(
const_cast<const Stmt*>(this)->stripLabelLikeStatements());
}
/// Child Iterators: All subclasses must implement 'children'
/// to permit easy iteration over the substatements/subexpessions of an
/// AST node. This permits easy iteration over all nodes in the AST.
using child_iterator = StmtIterator;
using const_child_iterator = ConstStmtIterator;
using child_range = llvm::iterator_range<child_iterator>;
using const_child_range = llvm::iterator_range<const_child_iterator>;
child_range children();
const_child_range children() const {
auto Children = const_cast<Stmt *>(this)->children();
return const_child_range(Children.begin(), Children.end());
}
child_iterator child_begin() { return children().begin(); }
child_iterator child_end() { return children().end(); }
const_child_iterator child_begin() const { return children().begin(); }
const_child_iterator child_end() const { return children().end(); }
/// Produce a unique representation of the given statement.
///
/// \param ID once the profiling operation is complete, will contain
/// the unique representation of the given statement.
///
/// \param Context the AST context in which the statement resides
///
/// \param Canonical whether the profile should be based on the canonical
/// representation of this statement (e.g., where non-type template
/// parameters are identified by index/level rather than their
/// declaration pointers) or the exact representation of the statement as
/// written in the source.
void Profile(llvm::FoldingSetNodeID &ID, const ASTContext &Context,
bool Canonical) const;
/// Calculate a unique representation for a statement that is
/// stable across compiler invocations.
///
/// \param ID profile information will be stored in ID.
///
/// \param Hash an ODRHash object which will be called where pointers would
/// have been used in the Profile function.
void ProcessODRHash(llvm::FoldingSetNodeID &ID, ODRHash& Hash) const;
};
/// DeclStmt - Adaptor class for mixing declarations with statements and
/// expressions. For example, CompoundStmt mixes statements, expressions
/// and declarations (variables, types). Another example is ForStmt, where
/// the first statement can be an expression or a declaration.
class DeclStmt : public Stmt {
DeclGroupRef DG;
SourceLocation StartLoc, EndLoc;
public:
DeclStmt(DeclGroupRef dg, SourceLocation startLoc, SourceLocation endLoc)
: Stmt(DeclStmtClass), DG(dg), StartLoc(startLoc), EndLoc(endLoc) {}
/// Build an empty declaration statement.
explicit DeclStmt(EmptyShell Empty) : Stmt(DeclStmtClass, Empty) {}
/// isSingleDecl - This method returns true if this DeclStmt refers
/// to a single Decl.
bool isSingleDecl() const { return DG.isSingleDecl(); }
const Decl *getSingleDecl() const { return DG.getSingleDecl(); }
Decl *getSingleDecl() { return DG.getSingleDecl(); }
const DeclGroupRef getDeclGroup() const { return DG; }
DeclGroupRef getDeclGroup() { return DG; }
void setDeclGroup(DeclGroupRef DGR) { DG = DGR; }
void setStartLoc(SourceLocation L) { StartLoc = L; }
SourceLocation getEndLoc() const { return EndLoc; }
void setEndLoc(SourceLocation L) { EndLoc = L; }
SourceLocation getBeginLoc() const LLVM_READONLY { return StartLoc; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == DeclStmtClass;
}
// Iterators over subexpressions.
child_range children() {
return child_range(child_iterator(DG.begin(), DG.end()),
child_iterator(DG.end(), DG.end()));
}
const_child_range children() const {
auto Children = const_cast<DeclStmt *>(this)->children();
return const_child_range(Children);
}
using decl_iterator = DeclGroupRef::iterator;
using const_decl_iterator = DeclGroupRef::const_iterator;
using decl_range = llvm::iterator_range<decl_iterator>;
using decl_const_range = llvm::iterator_range<const_decl_iterator>;
decl_range decls() { return decl_range(decl_begin(), decl_end()); }
decl_const_range decls() const {
return decl_const_range(decl_begin(), decl_end());
}
decl_iterator decl_begin() { return DG.begin(); }
decl_iterator decl_end() { return DG.end(); }
const_decl_iterator decl_begin() const { return DG.begin(); }
const_decl_iterator decl_end() const { return DG.end(); }
using reverse_decl_iterator = std::reverse_iterator<decl_iterator>;
reverse_decl_iterator decl_rbegin() {
return reverse_decl_iterator(decl_end());
}
reverse_decl_iterator decl_rend() {
return reverse_decl_iterator(decl_begin());
}
};
/// NullStmt - This is the null statement ";": C99 6.8.3p3.
///
class NullStmt : public Stmt {
public:
NullStmt(SourceLocation L, bool hasLeadingEmptyMacro = false)
: Stmt(NullStmtClass) {
NullStmtBits.HasLeadingEmptyMacro = hasLeadingEmptyMacro;
setSemiLoc(L);
}
/// Build an empty null statement.
explicit NullStmt(EmptyShell Empty) : Stmt(NullStmtClass, Empty) {}
SourceLocation getSemiLoc() const { return NullStmtBits.SemiLoc; }
void setSemiLoc(SourceLocation L) { NullStmtBits.SemiLoc = L; }
bool hasLeadingEmptyMacro() const {
return NullStmtBits.HasLeadingEmptyMacro;
}
SourceLocation getBeginLoc() const { return getSemiLoc(); }
SourceLocation getEndLoc() const { return getSemiLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == NullStmtClass;
}
child_range children() {
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// CompoundStmt - This represents a group of statements like { stmt stmt }.
class CompoundStmt final : public Stmt,
private llvm::TrailingObjects<CompoundStmt, Stmt *> {
friend class ASTStmtReader;
friend TrailingObjects;
/// The location of the closing "}". LBraceLoc is stored in CompoundStmtBits.
SourceLocation RBraceLoc;
CompoundStmt(ArrayRef<Stmt *> Stmts, SourceLocation LB, SourceLocation RB);
explicit CompoundStmt(EmptyShell Empty) : Stmt(CompoundStmtClass, Empty) {}
void setStmts(ArrayRef<Stmt *> Stmts);
public:
static CompoundStmt *Create(const ASTContext &C, ArrayRef<Stmt *> Stmts,
SourceLocation LB, SourceLocation RB);
// Build an empty compound statement with a location.
explicit CompoundStmt(SourceLocation Loc)
: Stmt(CompoundStmtClass), RBraceLoc(Loc) {
CompoundStmtBits.NumStmts = 0;
CompoundStmtBits.LBraceLoc = Loc;
}
// Build an empty compound statement.
static CompoundStmt *CreateEmpty(const ASTContext &C, unsigned NumStmts);
bool body_empty() const { return CompoundStmtBits.NumStmts == 0; }
unsigned size() const { return CompoundStmtBits.NumStmts; }
using body_iterator = Stmt **;
using body_range = llvm::iterator_range<body_iterator>;
body_range body() { return body_range(body_begin(), body_end()); }
body_iterator body_begin() { return getTrailingObjects<Stmt *>(); }
body_iterator body_end() { return body_begin() + size(); }
Stmt *body_front() { return !body_empty() ? body_begin()[0] : nullptr; }
Stmt *body_back() {
return !body_empty() ? body_begin()[size() - 1] : nullptr;
}
using const_body_iterator = Stmt *const *;
using body_const_range = llvm::iterator_range<const_body_iterator>;
body_const_range body() const {
return body_const_range(body_begin(), body_end());
}
const_body_iterator body_begin() const {
return getTrailingObjects<Stmt *>();
}
const_body_iterator body_end() const { return body_begin() + size(); }
const Stmt *body_front() const {
return !body_empty() ? body_begin()[0] : nullptr;
}
const Stmt *body_back() const {
return !body_empty() ? body_begin()[size() - 1] : nullptr;
}
using reverse_body_iterator = std::reverse_iterator<body_iterator>;
reverse_body_iterator body_rbegin() {
return reverse_body_iterator(body_end());
}
reverse_body_iterator body_rend() {
return reverse_body_iterator(body_begin());
}
using const_reverse_body_iterator =
std::reverse_iterator<const_body_iterator>;
const_reverse_body_iterator body_rbegin() const {
return const_reverse_body_iterator(body_end());
}
const_reverse_body_iterator body_rend() const {
return const_reverse_body_iterator(body_begin());
}
// Get the Stmt that StmtExpr would consider to be the result of this
// compound statement. This is used by StmtExpr to properly emulate the GCC
// compound expression extension, which ignores trailing NullStmts when
// getting the result of the expression.
// i.e. ({ 5;;; })
// ^^ ignored
// If we don't find something that isn't a NullStmt, just return the last
// Stmt.
Stmt *getStmtExprResult() {
for (auto *B : llvm::reverse(body())) {
if (!isa<NullStmt>(B))
return B;
}
return body_back();
}
const Stmt *getStmtExprResult() const {
return const_cast<CompoundStmt *>(this)->getStmtExprResult();
}
SourceLocation getBeginLoc() const { return CompoundStmtBits.LBraceLoc; }
SourceLocation getEndLoc() const { return RBraceLoc; }
SourceLocation getLBracLoc() const { return CompoundStmtBits.LBraceLoc; }
SourceLocation getRBracLoc() const { return RBraceLoc; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == CompoundStmtClass;
}
// Iterators
child_range children() { return child_range(body_begin(), body_end()); }
const_child_range children() const {
return const_child_range(body_begin(), body_end());
}
};
// SwitchCase is the base class for CaseStmt and DefaultStmt,
class SwitchCase : public Stmt {
protected:
/// The location of the ":".
SourceLocation ColonLoc;
// The location of the "case" or "default" keyword. Stored in SwitchCaseBits.
// SourceLocation KeywordLoc;
/// A pointer to the following CaseStmt or DefaultStmt class,
/// used by SwitchStmt.
SwitchCase *NextSwitchCase = nullptr;
SwitchCase(StmtClass SC, SourceLocation KWLoc, SourceLocation ColonLoc)
: Stmt(SC), ColonLoc(ColonLoc) {
setKeywordLoc(KWLoc);
}
SwitchCase(StmtClass SC, EmptyShell) : Stmt(SC) {}
public:
const SwitchCase *getNextSwitchCase() const { return NextSwitchCase; }
SwitchCase *getNextSwitchCase() { return NextSwitchCase; }
void setNextSwitchCase(SwitchCase *SC) { NextSwitchCase = SC; }
SourceLocation getKeywordLoc() const { return SwitchCaseBits.KeywordLoc; }
void setKeywordLoc(SourceLocation L) { SwitchCaseBits.KeywordLoc = L; }
SourceLocation getColonLoc() const { return ColonLoc; }
void setColonLoc(SourceLocation L) { ColonLoc = L; }
inline Stmt *getSubStmt();
const Stmt *getSubStmt() const {
return const_cast<SwitchCase *>(this)->getSubStmt();
}
SourceLocation getBeginLoc() const { return getKeywordLoc(); }
inline SourceLocation getEndLoc() const LLVM_READONLY;
static bool classof(const Stmt *T) {
return T->getStmtClass() == CaseStmtClass ||
T->getStmtClass() == DefaultStmtClass;
}
};
/// CaseStmt - Represent a case statement. It can optionally be a GNU case
/// statement of the form LHS ... RHS representing a range of cases.
class CaseStmt final
: public SwitchCase,
private llvm::TrailingObjects<CaseStmt, Stmt *, SourceLocation> {
friend TrailingObjects;
// CaseStmt is followed by several trailing objects, some of which optional.
// Note that it would be more convenient to put the optional trailing objects
// at the end but this would impact children().
// The trailing objects are in order:
//
// * A "Stmt *" for the LHS of the case statement. Always present.
//
// * A "Stmt *" for the RHS of the case statement. This is a GNU extension
// which allow ranges in cases statement of the form LHS ... RHS.
// Present if and only if caseStmtIsGNURange() is true.
//
// * A "Stmt *" for the substatement of the case statement. Always present.
//
// * A SourceLocation for the location of the ... if this is a case statement
// with a range. Present if and only if caseStmtIsGNURange() is true.
enum { LhsOffset = 0, SubStmtOffsetFromRhs = 1 };
enum { NumMandatoryStmtPtr = 2 };
unsigned numTrailingObjects(OverloadToken<Stmt *>) const {
return NumMandatoryStmtPtr + caseStmtIsGNURange();
}
unsigned numTrailingObjects(OverloadToken<SourceLocation>) const {
return caseStmtIsGNURange();
}
unsigned lhsOffset() const { return LhsOffset; }
unsigned rhsOffset() const { return LhsOffset + caseStmtIsGNURange(); }
unsigned subStmtOffset() const { return rhsOffset() + SubStmtOffsetFromRhs; }
/// Build a case statement assuming that the storage for the
/// trailing objects has been properly allocated.
CaseStmt(Expr *lhs, Expr *rhs, SourceLocation caseLoc,
SourceLocation ellipsisLoc, SourceLocation colonLoc)
: SwitchCase(CaseStmtClass, caseLoc, colonLoc) {
// Handle GNU case statements of the form LHS ... RHS.
bool IsGNURange = rhs != nullptr;
SwitchCaseBits.CaseStmtIsGNURange = IsGNURange;
setLHS(lhs);
setSubStmt(nullptr);
if (IsGNURange) {
setRHS(rhs);
setEllipsisLoc(ellipsisLoc);
}
}
/// Build an empty switch case statement.
explicit CaseStmt(EmptyShell Empty, bool CaseStmtIsGNURange)
: SwitchCase(CaseStmtClass, Empty) {
SwitchCaseBits.CaseStmtIsGNURange = CaseStmtIsGNURange;
}
public:
/// Build a case statement.
static CaseStmt *Create(const ASTContext &Ctx, Expr *lhs, Expr *rhs,
SourceLocation caseLoc, SourceLocation ellipsisLoc,
SourceLocation colonLoc);
/// Build an empty case statement.
static CaseStmt *CreateEmpty(const ASTContext &Ctx, bool CaseStmtIsGNURange);
/// True if this case statement is of the form case LHS ... RHS, which
/// is a GNU extension. In this case the RHS can be obtained with getRHS()
/// and the location of the ellipsis can be obtained with getEllipsisLoc().
bool caseStmtIsGNURange() const { return SwitchCaseBits.CaseStmtIsGNURange; }
SourceLocation getCaseLoc() const { return getKeywordLoc(); }
void setCaseLoc(SourceLocation L) { setKeywordLoc(L); }
/// Get the location of the ... in a case statement of the form LHS ... RHS.
SourceLocation getEllipsisLoc() const {
return caseStmtIsGNURange() ? *getTrailingObjects<SourceLocation>()
: SourceLocation();
}
/// Set the location of the ... in a case statement of the form LHS ... RHS.
/// Assert that this case statement is of this form.
void setEllipsisLoc(SourceLocation L) {
assert(
caseStmtIsGNURange() &&
"setEllipsisLoc but this is not a case stmt of the form LHS ... RHS!");
*getTrailingObjects<SourceLocation>() = L;
}
Expr *getLHS() {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[lhsOffset()]);
}
const Expr *getLHS() const {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[lhsOffset()]);
}
void setLHS(Expr *Val) {
getTrailingObjects<Stmt *>()[lhsOffset()] = reinterpret_cast<Stmt *>(Val);
}
Expr *getRHS() {
return caseStmtIsGNURange() ? reinterpret_cast<Expr *>(
getTrailingObjects<Stmt *>()[rhsOffset()])
: nullptr;
}
const Expr *getRHS() const {
return caseStmtIsGNURange() ? reinterpret_cast<Expr *>(
getTrailingObjects<Stmt *>()[rhsOffset()])
: nullptr;
}
void setRHS(Expr *Val) {
assert(caseStmtIsGNURange() &&
"setRHS but this is not a case stmt of the form LHS ... RHS!");
getTrailingObjects<Stmt *>()[rhsOffset()] = reinterpret_cast<Stmt *>(Val);
}
Stmt *getSubStmt() { return getTrailingObjects<Stmt *>()[subStmtOffset()]; }
const Stmt *getSubStmt() const {
return getTrailingObjects<Stmt *>()[subStmtOffset()];
}
void setSubStmt(Stmt *S) {
getTrailingObjects<Stmt *>()[subStmtOffset()] = S;
}
SourceLocation getBeginLoc() const { return getKeywordLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
// Handle deeply nested case statements with iteration instead of recursion.
const CaseStmt *CS = this;
while (const auto *CS2 = dyn_cast<CaseStmt>(CS->getSubStmt()))
CS = CS2;
return CS->getSubStmt()->getEndLoc();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == CaseStmtClass;
}
// Iterators
child_range children() {
return child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
const_child_range children() const {
return const_child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
};
class DefaultStmt : public SwitchCase {
Stmt *SubStmt;
public:
DefaultStmt(SourceLocation DL, SourceLocation CL, Stmt *substmt)
: SwitchCase(DefaultStmtClass, DL, CL), SubStmt(substmt) {}
/// Build an empty default statement.
explicit DefaultStmt(EmptyShell Empty)
: SwitchCase(DefaultStmtClass, Empty) {}
Stmt *getSubStmt() { return SubStmt; }
const Stmt *getSubStmt() const { return SubStmt; }
void setSubStmt(Stmt *S) { SubStmt = S; }
SourceLocation getDefaultLoc() const { return getKeywordLoc(); }
void setDefaultLoc(SourceLocation L) { setKeywordLoc(L); }
SourceLocation getBeginLoc() const { return getKeywordLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
return SubStmt->getEndLoc();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == DefaultStmtClass;
}
// Iterators
child_range children() { return child_range(&SubStmt, &SubStmt + 1); }
const_child_range children() const {
return const_child_range(&SubStmt, &SubStmt + 1);
}
};
SourceLocation SwitchCase::getEndLoc() const {
if (const auto *CS = dyn_cast<CaseStmt>(this))
return CS->getEndLoc();
else if (const auto *DS = dyn_cast<DefaultStmt>(this))
return DS->getEndLoc();
llvm_unreachable("SwitchCase is neither a CaseStmt nor a DefaultStmt!");
}
Stmt *SwitchCase::getSubStmt() {
if (auto *CS = dyn_cast<CaseStmt>(this))
return CS->getSubStmt();
else if (auto *DS = dyn_cast<DefaultStmt>(this))
return DS->getSubStmt();
llvm_unreachable("SwitchCase is neither a CaseStmt nor a DefaultStmt!");
}
/// Represents a statement that could possibly have a value and type. This
/// covers expression-statements, as well as labels and attributed statements.
///
/// Value statements have a special meaning when they are the last non-null
/// statement in a GNU statement expression, where they determine the value
/// of the statement expression.
class ValueStmt : public Stmt {
protected:
using Stmt::Stmt;
public:
const Expr *getExprStmt() const;
Expr *getExprStmt() {
const ValueStmt *ConstThis = this;
return const_cast<Expr*>(ConstThis->getExprStmt());
}
static bool classof(const Stmt *T) {
return T->getStmtClass() >= firstValueStmtConstant &&
T->getStmtClass() <= lastValueStmtConstant;
}
};
/// LabelStmt - Represents a label, which has a substatement. For example:
/// foo: return;
class LabelStmt : public ValueStmt {
LabelDecl *TheDecl;
Stmt *SubStmt;
public:
/// Build a label statement.
LabelStmt(SourceLocation IL, LabelDecl *D, Stmt *substmt)
: ValueStmt(LabelStmtClass), TheDecl(D), SubStmt(substmt) {
setIdentLoc(IL);
}
/// Build an empty label statement.
explicit LabelStmt(EmptyShell Empty) : ValueStmt(LabelStmtClass, Empty) {}
SourceLocation getIdentLoc() const { return LabelStmtBits.IdentLoc; }
void setIdentLoc(SourceLocation L) { LabelStmtBits.IdentLoc = L; }
LabelDecl *getDecl() const { return TheDecl; }
void setDecl(LabelDecl *D) { TheDecl = D; }
const char *getName() const;
Stmt *getSubStmt() { return SubStmt; }
const Stmt *getSubStmt() const { return SubStmt; }
void setSubStmt(Stmt *SS) { SubStmt = SS; }
SourceLocation getBeginLoc() const { return getIdentLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY { return SubStmt->getEndLoc();}
child_range children() { return child_range(&SubStmt, &SubStmt + 1); }
const_child_range children() const {
return const_child_range(&SubStmt, &SubStmt + 1);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == LabelStmtClass;
}
};
/// Represents an attribute applied to a statement.
///
/// Represents an attribute applied to a statement. For example:
/// [[omp::for(...)]] for (...) { ... }
class AttributedStmt final
: public ValueStmt,
private llvm::TrailingObjects<AttributedStmt, const Attr *> {
friend class ASTStmtReader;
friend TrailingObjects;
Stmt *SubStmt;
AttributedStmt(SourceLocation Loc, ArrayRef<const Attr *> Attrs,
Stmt *SubStmt)
: ValueStmt(AttributedStmtClass), SubStmt(SubStmt) {
AttributedStmtBits.NumAttrs = Attrs.size();
AttributedStmtBits.AttrLoc = Loc;
std::copy(Attrs.begin(), Attrs.end(), getAttrArrayPtr());
}
explicit AttributedStmt(EmptyShell Empty, unsigned NumAttrs)
: ValueStmt(AttributedStmtClass, Empty) {
AttributedStmtBits.NumAttrs = NumAttrs;
AttributedStmtBits.AttrLoc = SourceLocation{};
std::fill_n(getAttrArrayPtr(), NumAttrs, nullptr);
}
const Attr *const *getAttrArrayPtr() const {
return getTrailingObjects<const Attr *>();
}
const Attr **getAttrArrayPtr() { return getTrailingObjects<const Attr *>(); }
public:
static AttributedStmt *Create(const ASTContext &C, SourceLocation Loc,
ArrayRef<const Attr *> Attrs, Stmt *SubStmt);
// Build an empty attributed statement.
static AttributedStmt *CreateEmpty(const ASTContext &C, unsigned NumAttrs);
SourceLocation getAttrLoc() const { return AttributedStmtBits.AttrLoc; }
ArrayRef<const Attr *> getAttrs() const {
return llvm::makeArrayRef(getAttrArrayPtr(), AttributedStmtBits.NumAttrs);
}
Stmt *getSubStmt() { return SubStmt; }
const Stmt *getSubStmt() const { return SubStmt; }
SourceLocation getBeginLoc() const { return getAttrLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY { return SubStmt->getEndLoc();}
child_range children() { return child_range(&SubStmt, &SubStmt + 1); }
const_child_range children() const {
return const_child_range(&SubStmt, &SubStmt + 1);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == AttributedStmtClass;
}
};
/// IfStmt - This represents an if/then/else.
class IfStmt final
: public Stmt,
private llvm::TrailingObjects<IfStmt, Stmt *, SourceLocation> {
friend TrailingObjects;
// IfStmt is followed by several trailing objects, some of which optional.
// Note that it would be more convenient to put the optional trailing
// objects at then end but this would change the order of the children.
// The trailing objects are in order:
//
// * A "Stmt *" for the init statement.
// Present if and only if hasInitStorage().
//
// * A "Stmt *" for the condition variable.
// Present if and only if hasVarStorage(). This is in fact a "DeclStmt *".
//
// * A "Stmt *" for the condition.
// Always present. This is in fact a "Expr *".
//
// * A "Stmt *" for the then statement.
// Always present.
//
// * A "Stmt *" for the else statement.
// Present if and only if hasElseStorage().
//
// * A "SourceLocation" for the location of the "else".
// Present if and only if hasElseStorage().
enum { InitOffset = 0, ThenOffsetFromCond = 1, ElseOffsetFromCond = 2 };
enum { NumMandatoryStmtPtr = 2 };
unsigned numTrailingObjects(OverloadToken<Stmt *>) const {
return NumMandatoryStmtPtr + hasElseStorage() + hasVarStorage() +
hasInitStorage();
}
unsigned numTrailingObjects(OverloadToken<SourceLocation>) const {
return hasElseStorage();
}
unsigned initOffset() const { return InitOffset; }
unsigned varOffset() const { return InitOffset + hasInitStorage(); }
unsigned condOffset() const {
return InitOffset + hasInitStorage() + hasVarStorage();
}
unsigned thenOffset() const { return condOffset() + ThenOffsetFromCond; }
unsigned elseOffset() const { return condOffset() + ElseOffsetFromCond; }
/// Build an if/then/else statement.
IfStmt(const ASTContext &Ctx, SourceLocation IL, bool IsConstexpr, Stmt *Init,
VarDecl *Var, Expr *Cond, Stmt *Then, SourceLocation EL, Stmt *Else);
/// Build an empty if/then/else statement.
explicit IfStmt(EmptyShell Empty, bool HasElse, bool HasVar, bool HasInit);
public:
/// Create an IfStmt.
static IfStmt *Create(const ASTContext &Ctx, SourceLocation IL,
bool IsConstexpr, Stmt *Init, VarDecl *Var, Expr *Cond,
Stmt *Then, SourceLocation EL = SourceLocation(),
Stmt *Else = nullptr);
/// Create an empty IfStmt optionally with storage for an else statement,
/// condition variable and init expression.
static IfStmt *CreateEmpty(const ASTContext &Ctx, bool HasElse, bool HasVar,
bool HasInit);
/// True if this IfStmt has the storage for an init statement.
bool hasInitStorage() const { return IfStmtBits.HasInit; }
/// True if this IfStmt has storage for a variable declaration.
bool hasVarStorage() const { return IfStmtBits.HasVar; }
/// True if this IfStmt has storage for an else statement.
bool hasElseStorage() const { return IfStmtBits.HasElse; }
Expr *getCond() {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
const Expr *getCond() const {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
void setCond(Expr *Cond) {
getTrailingObjects<Stmt *>()[condOffset()] = reinterpret_cast<Stmt *>(Cond);
}
Stmt *getThen() { return getTrailingObjects<Stmt *>()[thenOffset()]; }
const Stmt *getThen() const {
return getTrailingObjects<Stmt *>()[thenOffset()];
}
void setThen(Stmt *Then) {
getTrailingObjects<Stmt *>()[thenOffset()] = Then;
}
Stmt *getElse() {
return hasElseStorage() ? getTrailingObjects<Stmt *>()[elseOffset()]
: nullptr;
}
const Stmt *getElse() const {
return hasElseStorage() ? getTrailingObjects<Stmt *>()[elseOffset()]
: nullptr;
}
void setElse(Stmt *Else) {
assert(hasElseStorage() &&
"This if statement has no storage for an else statement!");
getTrailingObjects<Stmt *>()[elseOffset()] = Else;
}
/// Retrieve the variable declared in this "if" statement, if any.
///
/// In the following example, "x" is the condition variable.
/// \code
/// if (int x = foo()) {
/// printf("x is %d", x);
/// }
/// \endcode
VarDecl *getConditionVariable();
const VarDecl *getConditionVariable() const {
return const_cast<IfStmt *>(this)->getConditionVariable();
}
/// Set the condition variable for this if statement.
/// The if statement must have storage for the condition variable.
void setConditionVariable(const ASTContext &Ctx, VarDecl *V);
/// If this IfStmt has a condition variable, return the faux DeclStmt
/// associated with the creation of that condition variable.
DeclStmt *getConditionVariableDeclStmt() {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
const DeclStmt *getConditionVariableDeclStmt() const {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
Stmt *getInit() {
return hasInitStorage() ? getTrailingObjects<Stmt *>()[initOffset()]
: nullptr;
}
const Stmt *getInit() const {
return hasInitStorage() ? getTrailingObjects<Stmt *>()[initOffset()]
: nullptr;
}
void setInit(Stmt *Init) {
assert(hasInitStorage() &&
"This if statement has no storage for an init statement!");
getTrailingObjects<Stmt *>()[initOffset()] = Init;
}
SourceLocation getIfLoc() const { return IfStmtBits.IfLoc; }
void setIfLoc(SourceLocation IfLoc) { IfStmtBits.IfLoc = IfLoc; }
SourceLocation getElseLoc() const {
return hasElseStorage() ? *getTrailingObjects<SourceLocation>()
: SourceLocation();
}
void setElseLoc(SourceLocation ElseLoc) {
assert(hasElseStorage() &&
"This if statement has no storage for an else statement!");
*getTrailingObjects<SourceLocation>() = ElseLoc;
}
bool isConstexpr() const { return IfStmtBits.IsConstexpr; }
void setConstexpr(bool C) { IfStmtBits.IsConstexpr = C; }
/// If this is an 'if constexpr', determine which substatement will be taken.
/// Otherwise, or if the condition is value-dependent, returns None.
Optional<const Stmt*> getNondiscardedCase(const ASTContext &Ctx) const;
bool isObjCAvailabilityCheck() const;
SourceLocation getBeginLoc() const { return getIfLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
if (getElse())
return getElse()->getEndLoc();
return getThen()->getEndLoc();
}
// Iterators over subexpressions. The iterators will include iterating
// over the initialization expression referenced by the condition variable.
child_range children() {
return child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
const_child_range children() const {
return const_child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == IfStmtClass;
}
};
/// SwitchStmt - This represents a 'switch' stmt.
class SwitchStmt final : public Stmt,
private llvm::TrailingObjects<SwitchStmt, Stmt *> {
friend TrailingObjects;
/// Points to a linked list of case and default statements.
SwitchCase *FirstCase;
// SwitchStmt is followed by several trailing objects,
// some of which optional. Note that it would be more convenient to
// put the optional trailing objects at the end but this would change
// the order in children().
// The trailing objects are in order:
//
// * A "Stmt *" for the init statement.
// Present if and only if hasInitStorage().
//
// * A "Stmt *" for the condition variable.
// Present if and only if hasVarStorage(). This is in fact a "DeclStmt *".
//
// * A "Stmt *" for the condition.
// Always present. This is in fact an "Expr *".
//
// * A "Stmt *" for the body.
// Always present.
enum { InitOffset = 0, BodyOffsetFromCond = 1 };
enum { NumMandatoryStmtPtr = 2 };
unsigned numTrailingObjects(OverloadToken<Stmt *>) const {
return NumMandatoryStmtPtr + hasInitStorage() + hasVarStorage();
}
unsigned initOffset() const { return InitOffset; }
unsigned varOffset() const { return InitOffset + hasInitStorage(); }
unsigned condOffset() const {
return InitOffset + hasInitStorage() + hasVarStorage();
}
unsigned bodyOffset() const { return condOffset() + BodyOffsetFromCond; }
/// Build a switch statement.
SwitchStmt(const ASTContext &Ctx, Stmt *Init, VarDecl *Var, Expr *Cond);
/// Build a empty switch statement.
explicit SwitchStmt(EmptyShell Empty, bool HasInit, bool HasVar);
public:
/// Create a switch statement.
static SwitchStmt *Create(const ASTContext &Ctx, Stmt *Init, VarDecl *Var,
Expr *Cond);
/// Create an empty switch statement optionally with storage for
/// an init expression and a condition variable.
static SwitchStmt *CreateEmpty(const ASTContext &Ctx, bool HasInit,
bool HasVar);
/// True if this SwitchStmt has storage for an init statement.
bool hasInitStorage() const { return SwitchStmtBits.HasInit; }
/// True if this SwitchStmt has storage for a condition variable.
bool hasVarStorage() const { return SwitchStmtBits.HasVar; }
Expr *getCond() {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
const Expr *getCond() const {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
void setCond(Expr *Cond) {
getTrailingObjects<Stmt *>()[condOffset()] = reinterpret_cast<Stmt *>(Cond);
}
Stmt *getBody() { return getTrailingObjects<Stmt *>()[bodyOffset()]; }
const Stmt *getBody() const {
return getTrailingObjects<Stmt *>()[bodyOffset()];
}
void setBody(Stmt *Body) {
getTrailingObjects<Stmt *>()[bodyOffset()] = Body;
}
Stmt *getInit() {
return hasInitStorage() ? getTrailingObjects<Stmt *>()[initOffset()]
: nullptr;
}
const Stmt *getInit() const {
return hasInitStorage() ? getTrailingObjects<Stmt *>()[initOffset()]
: nullptr;
}
void setInit(Stmt *Init) {
assert(hasInitStorage() &&
"This switch statement has no storage for an init statement!");
getTrailingObjects<Stmt *>()[initOffset()] = Init;
}
/// Retrieve the variable declared in this "switch" statement, if any.
///
/// In the following example, "x" is the condition variable.
/// \code
/// switch (int x = foo()) {
/// case 0: break;
/// // ...
/// }
/// \endcode
VarDecl *getConditionVariable();
const VarDecl *getConditionVariable() const {
return const_cast<SwitchStmt *>(this)->getConditionVariable();
}
/// Set the condition variable in this switch statement.
/// The switch statement must have storage for it.
void setConditionVariable(const ASTContext &Ctx, VarDecl *VD);
/// If this SwitchStmt has a condition variable, return the faux DeclStmt
/// associated with the creation of that condition variable.
DeclStmt *getConditionVariableDeclStmt() {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
const DeclStmt *getConditionVariableDeclStmt() const {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
SwitchCase *getSwitchCaseList() { return FirstCase; }
const SwitchCase *getSwitchCaseList() const { return FirstCase; }
void setSwitchCaseList(SwitchCase *SC) { FirstCase = SC; }
SourceLocation getSwitchLoc() const { return SwitchStmtBits.SwitchLoc; }
void setSwitchLoc(SourceLocation L) { SwitchStmtBits.SwitchLoc = L; }
void setBody(Stmt *S, SourceLocation SL) {
setBody(S);
setSwitchLoc(SL);
}
void addSwitchCase(SwitchCase *SC) {
assert(!SC->getNextSwitchCase() &&
"case/default already added to a switch");
SC->setNextSwitchCase(FirstCase);
FirstCase = SC;
}
/// Set a flag in the SwitchStmt indicating that if the 'switch (X)' is a
/// switch over an enum value then all cases have been explicitly covered.
void setAllEnumCasesCovered() { SwitchStmtBits.AllEnumCasesCovered = true; }
/// Returns true if the SwitchStmt is a switch of an enum value and all cases
/// have been explicitly covered.
bool isAllEnumCasesCovered() const {
return SwitchStmtBits.AllEnumCasesCovered;
}
SourceLocation getBeginLoc() const { return getSwitchLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
return getBody() ? getBody()->getEndLoc()
: reinterpret_cast<const Stmt *>(getCond())->getEndLoc();
}
// Iterators
child_range children() {
return child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
const_child_range children() const {
return const_child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == SwitchStmtClass;
}
};
/// WhileStmt - This represents a 'while' stmt.
class WhileStmt final : public Stmt,
private llvm::TrailingObjects<WhileStmt, Stmt *> {
friend TrailingObjects;
// WhileStmt is followed by several trailing objects,
// some of which optional. Note that it would be more
// convenient to put the optional trailing object at the end
// but this would affect children().
// The trailing objects are in order:
//
// * A "Stmt *" for the condition variable.
// Present if and only if hasVarStorage(). This is in fact a "DeclStmt *".
//
// * A "Stmt *" for the condition.
// Always present. This is in fact an "Expr *".
//
// * A "Stmt *" for the body.
// Always present.
//
enum { VarOffset = 0, BodyOffsetFromCond = 1 };
enum { NumMandatoryStmtPtr = 2 };
unsigned varOffset() const { return VarOffset; }
unsigned condOffset() const { return VarOffset + hasVarStorage(); }
unsigned bodyOffset() const { return condOffset() + BodyOffsetFromCond; }
unsigned numTrailingObjects(OverloadToken<Stmt *>) const {
return NumMandatoryStmtPtr + hasVarStorage();
}
/// Build a while statement.
WhileStmt(const ASTContext &Ctx, VarDecl *Var, Expr *Cond, Stmt *Body,
SourceLocation WL);
/// Build an empty while statement.
explicit WhileStmt(EmptyShell Empty, bool HasVar);
public:
/// Create a while statement.
static WhileStmt *Create(const ASTContext &Ctx, VarDecl *Var, Expr *Cond,
Stmt *Body, SourceLocation WL);
/// Create an empty while statement optionally with storage for
/// a condition variable.
static WhileStmt *CreateEmpty(const ASTContext &Ctx, bool HasVar);
/// True if this WhileStmt has storage for a condition variable.
bool hasVarStorage() const { return WhileStmtBits.HasVar; }
Expr *getCond() {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
const Expr *getCond() const {
return reinterpret_cast<Expr *>(getTrailingObjects<Stmt *>()[condOffset()]);
}
void setCond(Expr *Cond) {
getTrailingObjects<Stmt *>()[condOffset()] = reinterpret_cast<Stmt *>(Cond);
}
Stmt *getBody() { return getTrailingObjects<Stmt *>()[bodyOffset()]; }
const Stmt *getBody() const {
return getTrailingObjects<Stmt *>()[bodyOffset()];
}
void setBody(Stmt *Body) {
getTrailingObjects<Stmt *>()[bodyOffset()] = Body;
}
/// Retrieve the variable declared in this "while" statement, if any.
///
/// In the following example, "x" is the condition variable.
/// \code
/// while (int x = random()) {
/// // ...
/// }
/// \endcode
VarDecl *getConditionVariable();
const VarDecl *getConditionVariable() const {
return const_cast<WhileStmt *>(this)->getConditionVariable();
}
/// Set the condition variable of this while statement.
/// The while statement must have storage for it.
void setConditionVariable(const ASTContext &Ctx, VarDecl *V);
/// If this WhileStmt has a condition variable, return the faux DeclStmt
/// associated with the creation of that condition variable.
DeclStmt *getConditionVariableDeclStmt() {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
const DeclStmt *getConditionVariableDeclStmt() const {
return hasVarStorage() ? static_cast<DeclStmt *>(
getTrailingObjects<Stmt *>()[varOffset()])
: nullptr;
}
SourceLocation getWhileLoc() const { return WhileStmtBits.WhileLoc; }
void setWhileLoc(SourceLocation L) { WhileStmtBits.WhileLoc = L; }
SourceLocation getBeginLoc() const { return getWhileLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
return getBody()->getEndLoc();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == WhileStmtClass;
}
// Iterators
child_range children() {
return child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
const_child_range children() const {
return const_child_range(getTrailingObjects<Stmt *>(),
getTrailingObjects<Stmt *>() +
numTrailingObjects(OverloadToken<Stmt *>()));
}
};
/// DoStmt - This represents a 'do/while' stmt.
class DoStmt : public Stmt {
enum { BODY, COND, END_EXPR };
Stmt *SubExprs[END_EXPR];
SourceLocation WhileLoc;
SourceLocation RParenLoc; // Location of final ')' in do stmt condition.
public:
DoStmt(Stmt *Body, Expr *Cond, SourceLocation DL, SourceLocation WL,
SourceLocation RP)
: Stmt(DoStmtClass), WhileLoc(WL), RParenLoc(RP) {
setCond(Cond);
setBody(Body);
setDoLoc(DL);
}
/// Build an empty do-while statement.
explicit DoStmt(EmptyShell Empty) : Stmt(DoStmtClass, Empty) {}
Expr *getCond() { return reinterpret_cast<Expr *>(SubExprs[COND]); }
const Expr *getCond() const {
return reinterpret_cast<Expr *>(SubExprs[COND]);
}
void setCond(Expr *Cond) { SubExprs[COND] = reinterpret_cast<Stmt *>(Cond); }
Stmt *getBody() { return SubExprs[BODY]; }
const Stmt *getBody() const { return SubExprs[BODY]; }
void setBody(Stmt *Body) { SubExprs[BODY] = Body; }
SourceLocation getDoLoc() const { return DoStmtBits.DoLoc; }
void setDoLoc(SourceLocation L) { DoStmtBits.DoLoc = L; }
SourceLocation getWhileLoc() const { return WhileLoc; }
void setWhileLoc(SourceLocation L) { WhileLoc = L; }
SourceLocation getRParenLoc() const { return RParenLoc; }
void setRParenLoc(SourceLocation L) { RParenLoc = L; }
SourceLocation getBeginLoc() const { return getDoLoc(); }
SourceLocation getEndLoc() const { return getRParenLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == DoStmtClass;
}
// Iterators
child_range children() {
return child_range(&SubExprs[0], &SubExprs[0] + END_EXPR);
}
const_child_range children() const {
return const_child_range(&SubExprs[0], &SubExprs[0] + END_EXPR);
}
};
/// ForStmt - This represents a 'for (init;cond;inc)' stmt. Note that any of
/// the init/cond/inc parts of the ForStmt will be null if they were not
/// specified in the source.
class ForStmt : public Stmt {
enum { INIT, CONDVAR, COND, INC, BODY, END_EXPR };
Stmt* SubExprs[END_EXPR]; // SubExprs[INIT] is an expression or declstmt.
SourceLocation LParenLoc, RParenLoc;
public:
ForStmt(const ASTContext &C, Stmt *Init, Expr *Cond, VarDecl *condVar,
Expr *Inc, Stmt *Body, SourceLocation FL, SourceLocation LP,
SourceLocation RP);
/// Build an empty for statement.
explicit ForStmt(EmptyShell Empty) : Stmt(ForStmtClass, Empty) {}
Stmt *getInit() { return SubExprs[INIT]; }
/// Retrieve the variable declared in this "for" statement, if any.
///
/// In the following example, "y" is the condition variable.
/// \code
/// for (int x = random(); int y = mangle(x); ++x) {
/// // ...
/// }
/// \endcode
VarDecl *getConditionVariable() const;
void setConditionVariable(const ASTContext &C, VarDecl *V);
/// If this ForStmt has a condition variable, return the faux DeclStmt
/// associated with the creation of that condition variable.
const DeclStmt *getConditionVariableDeclStmt() const {
return reinterpret_cast<DeclStmt*>(SubExprs[CONDVAR]);
}
Expr *getCond() { return reinterpret_cast<Expr*>(SubExprs[COND]); }
Expr *getInc() { return reinterpret_cast<Expr*>(SubExprs[INC]); }
Stmt *getBody() { return SubExprs[BODY]; }
const Stmt *getInit() const { return SubExprs[INIT]; }
const Expr *getCond() const { return reinterpret_cast<Expr*>(SubExprs[COND]);}
const Expr *getInc() const { return reinterpret_cast<Expr*>(SubExprs[INC]); }
const Stmt *getBody() const { return SubExprs[BODY]; }
void setInit(Stmt *S) { SubExprs[INIT] = S; }
void setCond(Expr *E) { SubExprs[COND] = reinterpret_cast<Stmt*>(E); }
void setInc(Expr *E) { SubExprs[INC] = reinterpret_cast<Stmt*>(E); }
void setBody(Stmt *S) { SubExprs[BODY] = S; }
SourceLocation getForLoc() const { return ForStmtBits.ForLoc; }
void setForLoc(SourceLocation L) { ForStmtBits.ForLoc = L; }
SourceLocation getLParenLoc() const { return LParenLoc; }
void setLParenLoc(SourceLocation L) { LParenLoc = L; }
SourceLocation getRParenLoc() const { return RParenLoc; }
void setRParenLoc(SourceLocation L) { RParenLoc = L; }
SourceLocation getBeginLoc() const { return getForLoc(); }
SourceLocation getEndLoc() const { return getBody()->getEndLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == ForStmtClass;
}
// Iterators
child_range children() {
return child_range(&SubExprs[0], &SubExprs[0]+END_EXPR);
}
const_child_range children() const {
return const_child_range(&SubExprs[0], &SubExprs[0] + END_EXPR);
}
};
/// GotoStmt - This represents a direct goto.
class GotoStmt : public Stmt {
LabelDecl *Label;
SourceLocation LabelLoc;
public:
GotoStmt(LabelDecl *label, SourceLocation GL, SourceLocation LL)
: Stmt(GotoStmtClass), Label(label), LabelLoc(LL) {
setGotoLoc(GL);
}
/// Build an empty goto statement.
explicit GotoStmt(EmptyShell Empty) : Stmt(GotoStmtClass, Empty) {}
LabelDecl *getLabel() const { return Label; }
void setLabel(LabelDecl *D) { Label = D; }
SourceLocation getGotoLoc() const { return GotoStmtBits.GotoLoc; }
void setGotoLoc(SourceLocation L) { GotoStmtBits.GotoLoc = L; }
SourceLocation getLabelLoc() const { return LabelLoc; }
void setLabelLoc(SourceLocation L) { LabelLoc = L; }
SourceLocation getBeginLoc() const { return getGotoLoc(); }
SourceLocation getEndLoc() const { return getLabelLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == GotoStmtClass;
}
// Iterators
child_range children() {
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// IndirectGotoStmt - This represents an indirect goto.
class IndirectGotoStmt : public Stmt {
SourceLocation StarLoc;
Stmt *Target;
public:
IndirectGotoStmt(SourceLocation gotoLoc, SourceLocation starLoc, Expr *target)
: Stmt(IndirectGotoStmtClass), StarLoc(starLoc) {
setTarget(target);
setGotoLoc(gotoLoc);
}
/// Build an empty indirect goto statement.
explicit IndirectGotoStmt(EmptyShell Empty)
: Stmt(IndirectGotoStmtClass, Empty) {}
void setGotoLoc(SourceLocation L) { GotoStmtBits.GotoLoc = L; }
SourceLocation getGotoLoc() const { return GotoStmtBits.GotoLoc; }
void setStarLoc(SourceLocation L) { StarLoc = L; }
SourceLocation getStarLoc() const { return StarLoc; }
Expr *getTarget() { return reinterpret_cast<Expr *>(Target); }
const Expr *getTarget() const {
return reinterpret_cast<const Expr *>(Target);
}
void setTarget(Expr *E) { Target = reinterpret_cast<Stmt *>(E); }
/// getConstantTarget - Returns the fixed target of this indirect
/// goto, if one exists.
LabelDecl *getConstantTarget();
const LabelDecl *getConstantTarget() const {
return const_cast<IndirectGotoStmt *>(this)->getConstantTarget();
}
SourceLocation getBeginLoc() const { return getGotoLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY { return Target->getEndLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == IndirectGotoStmtClass;
}
// Iterators
child_range children() { return child_range(&Target, &Target + 1); }
const_child_range children() const {
return const_child_range(&Target, &Target + 1);
}
};
/// ContinueStmt - This represents a continue.
class ContinueStmt : public Stmt {
public:
ContinueStmt(SourceLocation CL) : Stmt(ContinueStmtClass) {
setContinueLoc(CL);
}
/// Build an empty continue statement.
explicit ContinueStmt(EmptyShell Empty) : Stmt(ContinueStmtClass, Empty) {}
SourceLocation getContinueLoc() const { return ContinueStmtBits.ContinueLoc; }
void setContinueLoc(SourceLocation L) { ContinueStmtBits.ContinueLoc = L; }
SourceLocation getBeginLoc() const { return getContinueLoc(); }
SourceLocation getEndLoc() const { return getContinueLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == ContinueStmtClass;
}
// Iterators
child_range children() {
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// BreakStmt - This represents a break.
class BreakStmt : public Stmt {
public:
BreakStmt(SourceLocation BL) : Stmt(BreakStmtClass) {
setBreakLoc(BL);
}
/// Build an empty break statement.
explicit BreakStmt(EmptyShell Empty) : Stmt(BreakStmtClass, Empty) {}
SourceLocation getBreakLoc() const { return BreakStmtBits.BreakLoc; }
void setBreakLoc(SourceLocation L) { BreakStmtBits.BreakLoc = L; }
SourceLocation getBeginLoc() const { return getBreakLoc(); }
SourceLocation getEndLoc() const { return getBreakLoc(); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == BreakStmtClass;
}
// Iterators
child_range children() {
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// ReturnStmt - This represents a return, optionally of an expression:
/// return;
/// return 4;
///
/// Note that GCC allows return with no argument in a function declared to
/// return a value, and it allows returning a value in functions declared to
/// return void. We explicitly model this in the AST, which means you can't
/// depend on the return type of the function and the presence of an argument.
class ReturnStmt final
: public Stmt,
private llvm::TrailingObjects<ReturnStmt, const VarDecl *> {
friend TrailingObjects;
/// The return expression.
Stmt *RetExpr;
// ReturnStmt is followed optionally by a trailing "const VarDecl *"
// for the NRVO candidate. Present if and only if hasNRVOCandidate().
/// True if this ReturnStmt has storage for an NRVO candidate.
bool hasNRVOCandidate() const { return ReturnStmtBits.HasNRVOCandidate; }
unsigned numTrailingObjects(OverloadToken<const VarDecl *>) const {
return hasNRVOCandidate();
}
/// Build a return statement.
ReturnStmt(SourceLocation RL, Expr *E, const VarDecl *NRVOCandidate);
/// Build an empty return statement.
explicit ReturnStmt(EmptyShell Empty, bool HasNRVOCandidate);
public:
/// Create a return statement.
static ReturnStmt *Create(const ASTContext &Ctx, SourceLocation RL, Expr *E,
const VarDecl *NRVOCandidate);
/// Create an empty return statement, optionally with
/// storage for an NRVO candidate.
static ReturnStmt *CreateEmpty(const ASTContext &Ctx, bool HasNRVOCandidate);
Expr *getRetValue() { return reinterpret_cast<Expr *>(RetExpr); }
const Expr *getRetValue() const { return reinterpret_cast<Expr *>(RetExpr); }
void setRetValue(Expr *E) { RetExpr = reinterpret_cast<Stmt *>(E); }
/// Retrieve the variable that might be used for the named return
/// value optimization.
///
/// The optimization itself can only be performed if the variable is
/// also marked as an NRVO object.
const VarDecl *getNRVOCandidate() const {
return hasNRVOCandidate() ? *getTrailingObjects<const VarDecl *>()
: nullptr;
}
/// Set the variable that might be used for the named return value
/// optimization. The return statement must have storage for it,
/// which is the case if and only if hasNRVOCandidate() is true.
void setNRVOCandidate(const VarDecl *Var) {
assert(hasNRVOCandidate() &&
"This return statement has no storage for an NRVO candidate!");
*getTrailingObjects<const VarDecl *>() = Var;
}
SourceLocation getReturnLoc() const { return ReturnStmtBits.RetLoc; }
void setReturnLoc(SourceLocation L) { ReturnStmtBits.RetLoc = L; }
SourceLocation getBeginLoc() const { return getReturnLoc(); }
SourceLocation getEndLoc() const LLVM_READONLY {
return RetExpr ? RetExpr->getEndLoc() : getReturnLoc();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == ReturnStmtClass;
}
// Iterators
child_range children() {
if (RetExpr)
return child_range(&RetExpr, &RetExpr + 1);
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
if (RetExpr)
return const_child_range(&RetExpr, &RetExpr + 1);
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// AsmStmt is the base class for GCCAsmStmt and MSAsmStmt.
class AsmStmt : public Stmt {
protected:
friend class ASTStmtReader;
SourceLocation AsmLoc;
/// True if the assembly statement does not have any input or output
/// operands.
bool IsSimple;
/// If true, treat this inline assembly as having side effects.
/// This assembly statement should not be optimized, deleted or moved.
bool IsVolatile;
unsigned NumOutputs;
unsigned NumInputs;
unsigned NumClobbers;
Stmt **Exprs = nullptr;
AsmStmt(StmtClass SC, SourceLocation asmloc, bool issimple, bool isvolatile,
unsigned numoutputs, unsigned numinputs, unsigned numclobbers)
: Stmt (SC), AsmLoc(asmloc), IsSimple(issimple), IsVolatile(isvolatile),
NumOutputs(numoutputs), NumInputs(numinputs),
NumClobbers(numclobbers) {}
public:
/// Build an empty inline-assembly statement.
explicit AsmStmt(StmtClass SC, EmptyShell Empty) : Stmt(SC, Empty) {}
SourceLocation getAsmLoc() const { return AsmLoc; }
void setAsmLoc(SourceLocation L) { AsmLoc = L; }
bool isSimple() const { return IsSimple; }
void setSimple(bool V) { IsSimple = V; }
bool isVolatile() const { return IsVolatile; }
void setVolatile(bool V) { IsVolatile = V; }
SourceLocation getBeginLoc() const LLVM_READONLY { return {}; }
SourceLocation getEndLoc() const LLVM_READONLY { return {}; }
//===--- Asm String Analysis ---===//
/// Assemble final IR asm string.
std::string generateAsmString(const ASTContext &C) const;
//===--- Output operands ---===//
unsigned getNumOutputs() const { return NumOutputs; }
/// getOutputConstraint - Return the constraint string for the specified
/// output operand. All output constraints are known to be non-empty (either
/// '=' or '+').
StringRef getOutputConstraint(unsigned i) const;
/// isOutputPlusConstraint - Return true if the specified output constraint
/// is a "+" constraint (which is both an input and an output) or false if it
/// is an "=" constraint (just an output).
bool isOutputPlusConstraint(unsigned i) const {
return getOutputConstraint(i)[0] == '+';
}
const Expr *getOutputExpr(unsigned i) const;
/// getNumPlusOperands - Return the number of output operands that have a "+"
/// constraint.
unsigned getNumPlusOperands() const;
//===--- Input operands ---===//
unsigned getNumInputs() const { return NumInputs; }
/// getInputConstraint - Return the specified input constraint. Unlike output
/// constraints, these can be empty.
StringRef getInputConstraint(unsigned i) const;
const Expr *getInputExpr(unsigned i) const;
//===--- Other ---===//
unsigned getNumClobbers() const { return NumClobbers; }
StringRef getClobber(unsigned i) const;
static bool classof(const Stmt *T) {
return T->getStmtClass() == GCCAsmStmtClass ||
T->getStmtClass() == MSAsmStmtClass;
}
// Input expr iterators.
using inputs_iterator = ExprIterator;
using const_inputs_iterator = ConstExprIterator;
using inputs_range = llvm::iterator_range<inputs_iterator>;
using inputs_const_range = llvm::iterator_range<const_inputs_iterator>;
inputs_iterator begin_inputs() {
return &Exprs[0] + NumOutputs;
}
inputs_iterator end_inputs() {
return &Exprs[0] + NumOutputs + NumInputs;
}
inputs_range inputs() { return inputs_range(begin_inputs(), end_inputs()); }
const_inputs_iterator begin_inputs() const {
return &Exprs[0] + NumOutputs;
}
const_inputs_iterator end_inputs() const {
return &Exprs[0] + NumOutputs + NumInputs;
}
inputs_const_range inputs() const {
return inputs_const_range(begin_inputs(), end_inputs());
}
// Output expr iterators.
using outputs_iterator = ExprIterator;
using const_outputs_iterator = ConstExprIterator;
using outputs_range = llvm::iterator_range<outputs_iterator>;
using outputs_const_range = llvm::iterator_range<const_outputs_iterator>;
outputs_iterator begin_outputs() {
return &Exprs[0];
}
outputs_iterator end_outputs() {
return &Exprs[0] + NumOutputs;
}
outputs_range outputs() {
return outputs_range(begin_outputs(), end_outputs());
}
const_outputs_iterator begin_outputs() const {
return &Exprs[0];
}
const_outputs_iterator end_outputs() const {
return &Exprs[0] + NumOutputs;
}
outputs_const_range outputs() const {
return outputs_const_range(begin_outputs(), end_outputs());
}
child_range children() {
return child_range(&Exprs[0], &Exprs[0] + NumOutputs + NumInputs);
}
const_child_range children() const {
return const_child_range(&Exprs[0], &Exprs[0] + NumOutputs + NumInputs);
}
};
/// This represents a GCC inline-assembly statement extension.
class GCCAsmStmt : public AsmStmt {
friend class ASTStmtReader;
SourceLocation RParenLoc;
StringLiteral *AsmStr;
// FIXME: If we wanted to, we could allocate all of these in one big array.
StringLiteral **Constraints = nullptr;
StringLiteral **Clobbers = nullptr;
IdentifierInfo **Names = nullptr;
unsigned NumLabels = 0;
public:
GCCAsmStmt(const ASTContext &C, SourceLocation asmloc, bool issimple,
bool isvolatile, unsigned numoutputs, unsigned numinputs,
IdentifierInfo **names, StringLiteral **constraints, Expr **exprs,
StringLiteral *asmstr, unsigned numclobbers,
StringLiteral **clobbers, unsigned numlabels,
SourceLocation rparenloc);
/// Build an empty inline-assembly statement.
explicit GCCAsmStmt(EmptyShell Empty) : AsmStmt(GCCAsmStmtClass, Empty) {}
SourceLocation getRParenLoc() const { return RParenLoc; }
void setRParenLoc(SourceLocation L) { RParenLoc = L; }
//===--- Asm String Analysis ---===//
const StringLiteral *getAsmString() const { return AsmStr; }
StringLiteral *getAsmString() { return AsmStr; }
void setAsmString(StringLiteral *E) { AsmStr = E; }
/// AsmStringPiece - this is part of a decomposed asm string specification
/// (for use with the AnalyzeAsmString function below). An asm string is
/// considered to be a concatenation of these parts.
class AsmStringPiece {
public:
enum Kind {
String, // String in .ll asm string form, "$" -> "$$" and "%%" -> "%".
Operand // Operand reference, with optional modifier %c4.
};
private:
Kind MyKind;
std::string Str;
unsigned OperandNo;
// Source range for operand references.
CharSourceRange Range;
public:
AsmStringPiece(const std::string &S) : MyKind(String), Str(S) {}
AsmStringPiece(unsigned OpNo, const std::string &S, SourceLocation Begin,
SourceLocation End)
: MyKind(Operand), Str(S), OperandNo(OpNo),
Range(CharSourceRange::getCharRange(Begin, End)) {}
bool isString() const { return MyKind == String; }
bool isOperand() const { return MyKind == Operand; }
const std::string &getString() const { return Str; }
unsigned getOperandNo() const {
assert(isOperand());
return OperandNo;
}
CharSourceRange getRange() const {
assert(isOperand() && "Range is currently used only for Operands.");
return Range;
}
/// getModifier - Get the modifier for this operand, if present. This
/// returns '\0' if there was no modifier.
char getModifier() const;
};
/// AnalyzeAsmString - Analyze the asm string of the current asm, decomposing
/// it into pieces. If the asm string is erroneous, emit errors and return
/// true, otherwise return false. This handles canonicalization and
/// translation of strings from GCC syntax to LLVM IR syntax, and handles
//// flattening of named references like %[foo] to Operand AsmStringPiece's.
unsigned AnalyzeAsmString(SmallVectorImpl<AsmStringPiece> &Pieces,
const ASTContext &C, unsigned &DiagOffs) const;
/// Assemble final IR asm string.
std::string generateAsmString(const ASTContext &C) const;
//===--- Output operands ---===//
IdentifierInfo *getOutputIdentifier(unsigned i) const { return Names[i]; }
StringRef getOutputName(unsigned i) const {
if (IdentifierInfo *II = getOutputIdentifier(i))
return II->getName();
return {};
}
StringRef getOutputConstraint(unsigned i) const;
const StringLiteral *getOutputConstraintLiteral(unsigned i) const {
return Constraints[i];
}
StringLiteral *getOutputConstraintLiteral(unsigned i) {
return Constraints[i];
}
Expr *getOutputExpr(unsigned i);
const Expr *getOutputExpr(unsigned i) const {
return const_cast<GCCAsmStmt*>(this)->getOutputExpr(i);
}
//===--- Input operands ---===//
IdentifierInfo *getInputIdentifier(unsigned i) const {
return Names[i + NumOutputs];
}
StringRef getInputName(unsigned i) const {
if (IdentifierInfo *II = getInputIdentifier(i))
return II->getName();
return {};
}
StringRef getInputConstraint(unsigned i) const;
const StringLiteral *getInputConstraintLiteral(unsigned i) const {
return Constraints[i + NumOutputs];
}
StringLiteral *getInputConstraintLiteral(unsigned i) {
return Constraints[i + NumOutputs];
}
Expr *getInputExpr(unsigned i);
void setInputExpr(unsigned i, Expr *E);
const Expr *getInputExpr(unsigned i) const {
return const_cast<GCCAsmStmt*>(this)->getInputExpr(i);
}
//===--- Labels ---===//
bool isAsmGoto() const {
return NumLabels > 0;
}
unsigned getNumLabels() const {
return NumLabels;
}
IdentifierInfo *getLabelIdentifier(unsigned i) const {
return Names[i + NumOutputs + NumInputs];
}
AddrLabelExpr *getLabelExpr(unsigned i) const;
StringRef getLabelName(unsigned i) const;
using labels_iterator = CastIterator<AddrLabelExpr>;
using const_labels_iterator = ConstCastIterator<AddrLabelExpr>;
using labels_range = llvm::iterator_range<labels_iterator>;
using labels_const_range = llvm::iterator_range<const_labels_iterator>;
labels_iterator begin_labels() {
return &Exprs[0] + NumOutputs + NumInputs;
}
labels_iterator end_labels() {
return &Exprs[0] + NumOutputs + NumInputs + NumLabels;
}
labels_range labels() {
return labels_range(begin_labels(), end_labels());
}
const_labels_iterator begin_labels() const {
return &Exprs[0] + NumOutputs + NumInputs;
}
const_labels_iterator end_labels() const {
return &Exprs[0] + NumOutputs + NumInputs + NumLabels;
}
labels_const_range labels() const {
return labels_const_range(begin_labels(), end_labels());
}
private:
void setOutputsAndInputsAndClobbers(const ASTContext &C,
IdentifierInfo **Names,
StringLiteral **Constraints,
Stmt **Exprs,
unsigned NumOutputs,
unsigned NumInputs,
unsigned NumLabels,
StringLiteral **Clobbers,
unsigned NumClobbers);
public:
//===--- Other ---===//
/// getNamedOperand - Given a symbolic operand reference like %[foo],
/// translate this into a numeric value needed to reference the same operand.
/// This returns -1 if the operand name is invalid.
int getNamedOperand(StringRef SymbolicName) const;
StringRef getClobber(unsigned i) const;
StringLiteral *getClobberStringLiteral(unsigned i) { return Clobbers[i]; }
const StringLiteral *getClobberStringLiteral(unsigned i) const {
return Clobbers[i];
}
SourceLocation getBeginLoc() const LLVM_READONLY { return AsmLoc; }
SourceLocation getEndLoc() const LLVM_READONLY { return RParenLoc; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == GCCAsmStmtClass;
}
};
/// This represents a Microsoft inline-assembly statement extension.
class MSAsmStmt : public AsmStmt {
friend class ASTStmtReader;
SourceLocation LBraceLoc, EndLoc;
StringRef AsmStr;
unsigned NumAsmToks = 0;
Token *AsmToks = nullptr;
StringRef *Constraints = nullptr;
StringRef *Clobbers = nullptr;
public:
MSAsmStmt(const ASTContext &C, SourceLocation asmloc,
SourceLocation lbraceloc, bool issimple, bool isvolatile,
ArrayRef<Token> asmtoks, unsigned numoutputs, unsigned numinputs,
ArrayRef<StringRef> constraints,
ArrayRef<Expr*> exprs, StringRef asmstr,
ArrayRef<StringRef> clobbers, SourceLocation endloc);
/// Build an empty MS-style inline-assembly statement.
explicit MSAsmStmt(EmptyShell Empty) : AsmStmt(MSAsmStmtClass, Empty) {}
SourceLocation getLBraceLoc() const { return LBraceLoc; }
void setLBraceLoc(SourceLocation L) { LBraceLoc = L; }
SourceLocation getEndLoc() const { return EndLoc; }
void setEndLoc(SourceLocation L) { EndLoc = L; }
bool hasBraces() const { return LBraceLoc.isValid(); }
unsigned getNumAsmToks() { return NumAsmToks; }
Token *getAsmToks() { return AsmToks; }
//===--- Asm String Analysis ---===//
StringRef getAsmString() const { return AsmStr; }
/// Assemble final IR asm string.
std::string generateAsmString(const ASTContext &C) const;
//===--- Output operands ---===//
StringRef getOutputConstraint(unsigned i) const {
assert(i < NumOutputs);
return Constraints[i];
}
Expr *getOutputExpr(unsigned i);
const Expr *getOutputExpr(unsigned i) const {
return const_cast<MSAsmStmt*>(this)->getOutputExpr(i);
}
//===--- Input operands ---===//
StringRef getInputConstraint(unsigned i) const {
assert(i < NumInputs);
return Constraints[i + NumOutputs];
}
Expr *getInputExpr(unsigned i);
void setInputExpr(unsigned i, Expr *E);
const Expr *getInputExpr(unsigned i) const {
return const_cast<MSAsmStmt*>(this)->getInputExpr(i);
}
//===--- Other ---===//
ArrayRef<StringRef> getAllConstraints() const {
return llvm::makeArrayRef(Constraints, NumInputs + NumOutputs);
}
ArrayRef<StringRef> getClobbers() const {
return llvm::makeArrayRef(Clobbers, NumClobbers);
}
ArrayRef<Expr*> getAllExprs() const {
return llvm::makeArrayRef(reinterpret_cast<Expr**>(Exprs),
NumInputs + NumOutputs);
}
StringRef getClobber(unsigned i) const { return getClobbers()[i]; }
private:
void initialize(const ASTContext &C, StringRef AsmString,
ArrayRef<Token> AsmToks, ArrayRef<StringRef> Constraints,
ArrayRef<Expr*> Exprs, ArrayRef<StringRef> Clobbers);
public:
SourceLocation getBeginLoc() const LLVM_READONLY { return AsmLoc; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == MSAsmStmtClass;
}
child_range children() {
return child_range(&Exprs[0], &Exprs[NumInputs + NumOutputs]);
}
const_child_range children() const {
return const_child_range(&Exprs[0], &Exprs[NumInputs + NumOutputs]);
}
};
class SEHExceptStmt : public Stmt {
friend class ASTReader;
friend class ASTStmtReader;
SourceLocation Loc;
Stmt *Children[2];
enum { FILTER_EXPR, BLOCK };
SEHExceptStmt(SourceLocation Loc, Expr *FilterExpr, Stmt *Block);
explicit SEHExceptStmt(EmptyShell E) : Stmt(SEHExceptStmtClass, E) {}
public:
static SEHExceptStmt* Create(const ASTContext &C,
SourceLocation ExceptLoc,
Expr *FilterExpr,
Stmt *Block);
SourceLocation getBeginLoc() const LLVM_READONLY { return getExceptLoc(); }
SourceLocation getExceptLoc() const { return Loc; }
SourceLocation getEndLoc() const { return getBlock()->getEndLoc(); }
Expr *getFilterExpr() const {
return reinterpret_cast<Expr*>(Children[FILTER_EXPR]);
}
CompoundStmt *getBlock() const {
return cast<CompoundStmt>(Children[BLOCK]);
}
child_range children() {
return child_range(Children, Children+2);
}
const_child_range children() const {
return const_child_range(Children, Children + 2);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == SEHExceptStmtClass;
}
};
class SEHFinallyStmt : public Stmt {
friend class ASTReader;
friend class ASTStmtReader;
SourceLocation Loc;
Stmt *Block;
SEHFinallyStmt(SourceLocation Loc, Stmt *Block);
explicit SEHFinallyStmt(EmptyShell E) : Stmt(SEHFinallyStmtClass, E) {}
public:
static SEHFinallyStmt* Create(const ASTContext &C,
SourceLocation FinallyLoc,
Stmt *Block);
SourceLocation getBeginLoc() const LLVM_READONLY { return getFinallyLoc(); }
SourceLocation getFinallyLoc() const { return Loc; }
SourceLocation getEndLoc() const { return Block->getEndLoc(); }
CompoundStmt *getBlock() const { return cast<CompoundStmt>(Block); }
child_range children() {
return child_range(&Block,&Block+1);
}
const_child_range children() const {
return const_child_range(&Block, &Block + 1);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == SEHFinallyStmtClass;
}
};
class SEHTryStmt : public Stmt {
friend class ASTReader;
friend class ASTStmtReader;
bool IsCXXTry;
SourceLocation TryLoc;
Stmt *Children[2];
enum { TRY = 0, HANDLER = 1 };
SEHTryStmt(bool isCXXTry, // true if 'try' otherwise '__try'
SourceLocation TryLoc,
Stmt *TryBlock,
Stmt *Handler);
explicit SEHTryStmt(EmptyShell E) : Stmt(SEHTryStmtClass, E) {}
public:
static SEHTryStmt* Create(const ASTContext &C, bool isCXXTry,
SourceLocation TryLoc, Stmt *TryBlock,
Stmt *Handler);
SourceLocation getBeginLoc() const LLVM_READONLY { return getTryLoc(); }
SourceLocation getTryLoc() const { return TryLoc; }
SourceLocation getEndLoc() const { return Children[HANDLER]->getEndLoc(); }
bool getIsCXXTry() const { return IsCXXTry; }
CompoundStmt* getTryBlock() const {
return cast<CompoundStmt>(Children[TRY]);
}
Stmt *getHandler() const { return Children[HANDLER]; }
/// Returns 0 if not defined
SEHExceptStmt *getExceptHandler() const;
SEHFinallyStmt *getFinallyHandler() const;
child_range children() {
return child_range(Children, Children+2);
}
const_child_range children() const {
return const_child_range(Children, Children + 2);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == SEHTryStmtClass;
}
};
/// Represents a __leave statement.
class SEHLeaveStmt : public Stmt {
SourceLocation LeaveLoc;
public:
explicit SEHLeaveStmt(SourceLocation LL)
: Stmt(SEHLeaveStmtClass), LeaveLoc(LL) {}
/// Build an empty __leave statement.
explicit SEHLeaveStmt(EmptyShell Empty) : Stmt(SEHLeaveStmtClass, Empty) {}
SourceLocation getLeaveLoc() const { return LeaveLoc; }
void setLeaveLoc(SourceLocation L) { LeaveLoc = L; }
SourceLocation getBeginLoc() const LLVM_READONLY { return LeaveLoc; }
SourceLocation getEndLoc() const LLVM_READONLY { return LeaveLoc; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == SEHLeaveStmtClass;
}
// Iterators
child_range children() {
return child_range(child_iterator(), child_iterator());
}
const_child_range children() const {
return const_child_range(const_child_iterator(), const_child_iterator());
}
};
/// This captures a statement into a function. For example, the following
/// pragma annotated compound statement can be represented as a CapturedStmt,
/// and this compound statement is the body of an anonymous outlined function.
/// @code
/// #pragma omp parallel
/// {
/// compute();
/// }
/// @endcode
class CapturedStmt : public Stmt {
public:
/// The different capture forms: by 'this', by reference, capture for
/// variable-length array type etc.
enum VariableCaptureKind {
VCK_This,
VCK_ByRef,
VCK_ByCopy,
VCK_VLAType,
};
/// Describes the capture of either a variable, or 'this', or
/// variable-length array type.
class Capture {
llvm::PointerIntPair<VarDecl *, 2, VariableCaptureKind> VarAndKind;
SourceLocation Loc;
public:
friend class ASTStmtReader;
/// Create a new capture.
///
/// \param Loc The source location associated with this capture.
///
/// \param Kind The kind of capture (this, ByRef, ...).
///
/// \param Var The variable being captured, or null if capturing this.
Capture(SourceLocation Loc, VariableCaptureKind Kind,
VarDecl *Var = nullptr);
/// Determine the kind of capture.
VariableCaptureKind getCaptureKind() const;
/// Retrieve the source location at which the variable or 'this' was
/// first used.
SourceLocation getLocation() const { return Loc; }
/// Determine whether this capture handles the C++ 'this' pointer.
bool capturesThis() const { return getCaptureKind() == VCK_This; }
/// Determine whether this capture handles a variable (by reference).
bool capturesVariable() const { return getCaptureKind() == VCK_ByRef; }
/// Determine whether this capture handles a variable by copy.
bool capturesVariableByCopy() const {
return getCaptureKind() == VCK_ByCopy;
}
/// Determine whether this capture handles a variable-length array
/// type.
bool capturesVariableArrayType() const {
return getCaptureKind() == VCK_VLAType;
}
/// Retrieve the declaration of the variable being captured.
///
/// This operation is only valid if this capture captures a variable.
VarDecl *getCapturedVar() const;
};
private:
/// The number of variable captured, including 'this'.
unsigned NumCaptures;
/// The pointer part is the implicit the outlined function and the
/// int part is the captured region kind, 'CR_Default' etc.
llvm::PointerIntPair<CapturedDecl *, 2, CapturedRegionKind> CapDeclAndKind;
/// The record for captured variables, a RecordDecl or CXXRecordDecl.
RecordDecl *TheRecordDecl = nullptr;
/// Construct a captured statement.
CapturedStmt(Stmt *S, CapturedRegionKind Kind, ArrayRef<Capture> Captures,
ArrayRef<Expr *> CaptureInits, CapturedDecl *CD, RecordDecl *RD);
/// Construct an empty captured statement.
CapturedStmt(EmptyShell Empty, unsigned NumCaptures);
Stmt **getStoredStmts() { return reinterpret_cast<Stmt **>(this + 1); }
Stmt *const *getStoredStmts() const {
return reinterpret_cast<Stmt *const *>(this + 1);
}
Capture *getStoredCaptures() const;
void setCapturedStmt(Stmt *S) { getStoredStmts()[NumCaptures] = S; }
public:
friend class ASTStmtReader;
static CapturedStmt *Create(const ASTContext &Context, Stmt *S,
CapturedRegionKind Kind,
ArrayRef<Capture> Captures,
ArrayRef<Expr *> CaptureInits,
CapturedDecl *CD, RecordDecl *RD);
static CapturedStmt *CreateDeserialized(const ASTContext &Context,
unsigned NumCaptures);
/// Retrieve the statement being captured.
Stmt *getCapturedStmt() { return getStoredStmts()[NumCaptures]; }
const Stmt *getCapturedStmt() const { return getStoredStmts()[NumCaptures]; }
/// Retrieve the outlined function declaration.
CapturedDecl *getCapturedDecl();
const CapturedDecl *getCapturedDecl() const;
/// Set the outlined function declaration.
void setCapturedDecl(CapturedDecl *D);
/// Retrieve the captured region kind.
CapturedRegionKind getCapturedRegionKind() const;
/// Set the captured region kind.
void setCapturedRegionKind(CapturedRegionKind Kind);
/// Retrieve the record declaration for captured variables.
const RecordDecl *getCapturedRecordDecl() const { return TheRecordDecl; }
/// Set the record declaration for captured variables.
void setCapturedRecordDecl(RecordDecl *D) {
assert(D && "null RecordDecl");
TheRecordDecl = D;
}
/// True if this variable has been captured.
bool capturesVariable(const VarDecl *Var) const;
/// An iterator that walks over the captures.
using capture_iterator = Capture *;
using const_capture_iterator = const Capture *;
using capture_range = llvm::iterator_range<capture_iterator>;
using capture_const_range = llvm::iterator_range<const_capture_iterator>;
capture_range captures() {
return capture_range(capture_begin(), capture_end());
}
capture_const_range captures() const {
return capture_const_range(capture_begin(), capture_end());
}
/// Retrieve an iterator pointing to the first capture.
capture_iterator capture_begin() { return getStoredCaptures(); }
const_capture_iterator capture_begin() const { return getStoredCaptures(); }
/// Retrieve an iterator pointing past the end of the sequence of
/// captures.
capture_iterator capture_end() const {
return getStoredCaptures() + NumCaptures;
}
/// Retrieve the number of captures, including 'this'.
unsigned capture_size() const { return NumCaptures; }
/// Iterator that walks over the capture initialization arguments.
using capture_init_iterator = Expr **;
using capture_init_range = llvm::iterator_range<capture_init_iterator>;
/// Const iterator that walks over the capture initialization
/// arguments.
using const_capture_init_iterator = Expr *const *;
using const_capture_init_range =
llvm::iterator_range<const_capture_init_iterator>;
capture_init_range capture_inits() {
return capture_init_range(capture_init_begin(), capture_init_end());
}
const_capture_init_range capture_inits() const {
return const_capture_init_range(capture_init_begin(), capture_init_end());
}
/// Retrieve the first initialization argument.
capture_init_iterator capture_init_begin() {
return reinterpret_cast<Expr **>(getStoredStmts());
}
const_capture_init_iterator capture_init_begin() const {
return reinterpret_cast<Expr *const *>(getStoredStmts());
}
/// Retrieve the iterator pointing one past the last initialization
/// argument.
capture_init_iterator capture_init_end() {
return capture_init_begin() + NumCaptures;
}
const_capture_init_iterator capture_init_end() const {
return capture_init_begin() + NumCaptures;
}
SourceLocation getBeginLoc() const LLVM_READONLY {
return getCapturedStmt()->getBeginLoc();
}
SourceLocation getEndLoc() const LLVM_READONLY {
return getCapturedStmt()->getEndLoc();
}
SourceRange getSourceRange() const LLVM_READONLY {
return getCapturedStmt()->getSourceRange();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == CapturedStmtClass;
}
child_range children();
const_child_range children() const;
};
} // namespace clang
#endif // LLVM_CLANG_AST_STMT_H
|
lsm3d_blsm_openmp_v2.c | #include "openst/eikonal/lsm.h"
#define M_LSM3D_IMP_NAME "BLSMv2"
const char OPENST_LSM3D_COMPUTEPARTIAL_IMP_NAME[] = M_LSM3D_IMP_NAME;
const size_t OPENST_LSM3D_COMPUTEPARTIAL_IMP_NAME_LENGTH = sizeof(M_LSM3D_IMP_NAME);
#include <pthread.h>
#include <semaphore.h>
#include <errno.h>
sem_t *sem;
int OpenST_LSM3D_ComputePartial(OPENST_FLOAT *U, char *LSM_UNLOCKED, OPENST_FLOAT *V,
size_t NI, size_t NJ, size_t NK,
OPENST_FLOAT HI, OPENST_FLOAT HJ, OPENST_FLOAT HK,
int start_iter, int max_iter, int *converged,
size_t BSIZE_I, size_t BSIZE_J, size_t BSIZE_K,
OPENST_FLOAT EPS){
int total_it, it, notconvergedl;
int REVI, REVJ, REVK;
int nth, tid, tid_prev, notconvergedt;
size_t NBI, NBJ, NBK;
int nth_max, nth_limit;
size_t bi, bj, bk;
if(start_iter >= max_iter){
return max_iter;
}
total_it = start_iter;
notconvergedl = 0;
NBI = NI/BSIZE_I + (NI % BSIZE_I > 0);
NBJ = NJ/BSIZE_J + (NJ % BSIZE_J > 0);
NBK = NK/BSIZE_K + (NK % BSIZE_K > 0);
nth_max = omp_get_max_threads();
if(nth_max > NBI){
nth_limit = NBI;
} else {
nth_limit = nth_max;
}
#pragma omp parallel num_threads(nth_limit) default(none) \
shared(sem, BSIZE_I, BSIZE_J, BSIZE_K, nth, NBI, NBJ, NBK, total_it, notconvergedl, \
NI, NJ, NK, \
U, LSM_UNLOCKED, V, HI, HJ, HK, max_iter, EPS, start_iter) \
private(tid, tid_prev, it, notconvergedt, \
REVI, REVJ, REVK, \
bi, bj, bk)
{
#pragma omp single
{
nth = omp_get_num_threads();
sem = (sem_t *) malloc(sizeof(sem_t) * (nth));
for(int i = 0; i < nth; ++i){
sem_init(&sem[i], 0, 0);
}
}
tid = omp_get_thread_num();
tid_prev = (tid + nth - 1) % nth;
for(it = start_iter; it < max_iter; ++it){
#pragma omp single nowait
{
++total_it;
notconvergedl = 0;
}
notconvergedt = 0;
OpenST_FSM3D_GetSweepOrder(it, &REVI, &REVJ, &REVK);
for(bi = tid; bi < NBI; bi += nth){
for(bj = 0; bj < NBJ; ++bj){
for(bk = 0; bk < NBK; ++bk){
if(bi != 0){
sem_wait(&sem[tid_prev]);
}
if(OpenST_LSM3D_BlockSerial(U, LSM_UNLOCKED, V,
NI, NJ, NK,
HI, HJ, HK,
REVI, REVJ, REVK,
bi * BSIZE_I, bj * BSIZE_J,
bk * BSIZE_K,
BSIZE_I, BSIZE_J, BSIZE_K,
EPS)){
notconvergedt = 1;
}
if(bi != (NBI - 1)){
sem_post(&sem[tid]);
}
}
}
}
#pragma omp atomic
notconvergedl += notconvergedt;
#pragma omp barrier
#pragma omp flush(notconvergedl)
if(!notconvergedl){
break;
}
#pragma omp barrier
}
#pragma omp single
{
for(int i = 0; i < nth; ++i){
sem_destroy(&sem[i]);
}
}
}
*converged = (notconvergedl == 0);
return total_it;
}
|
GB_binop__isne_fc64.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCUDA_DEV
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__isne_fc64)
// A.*B function (eWiseMult): GB (_AemultB_08__isne_fc64)
// A.*B function (eWiseMult): GB (_AemultB_02__isne_fc64)
// A.*B function (eWiseMult): GB (_AemultB_04__isne_fc64)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__isne_fc64)
// A*D function (colscale): GB ((none))
// D*A function (rowscale): GB ((none))
// C+=B function (dense accum): GB (_Cdense_accumB__isne_fc64)
// C+=b function (dense accum): GB (_Cdense_accumb__isne_fc64)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__isne_fc64)
// C=scalar+B GB (_bind1st__isne_fc64)
// C=scalar+B' GB (_bind1st_tran__isne_fc64)
// C=A+scalar GB (_bind2nd__isne_fc64)
// C=A'+scalar GB (_bind2nd_tran__isne_fc64)
// C type: GxB_FC64_t
// A type: GxB_FC64_t
// A pattern? 0
// B type: GxB_FC64_t
// B pattern? 0
// BinaryOp: cij = GB_FC64_isne (aij, bij)
#define GB_ATYPE \
GxB_FC64_t
#define GB_BTYPE \
GxB_FC64_t
#define GB_CTYPE \
GxB_FC64_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
GxB_FC64_t aij = GBX (Ax, pA, A_iso)
// true if values of A are not used
#define GB_A_IS_PATTERN \
0 \
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
GxB_FC64_t bij = GBX (Bx, pB, B_iso)
// true if values of B are not used
#define GB_B_IS_PATTERN \
0 \
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
GxB_FC64_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = GB_FC64_isne (x, y) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
0
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_ISNE || GxB_NO_FC64 || GxB_NO_ISNE_FC64)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
void GB (_Cdense_ewise3_noaccum__isne_fc64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_noaccum_template.c"
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__isne_fc64)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__isne_fc64)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type GxB_FC64_t
GxB_FC64_t bwork = (*((GxB_FC64_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix D,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GxB_FC64_t *restrict Cx = (GxB_FC64_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix D,
const GrB_Matrix B,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GxB_FC64_t *restrict Cx = (GxB_FC64_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__isne_fc64)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool is_eWiseUnion,
const GB_void *alpha_scalar_in,
const GB_void *beta_scalar_in,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
GxB_FC64_t alpha_scalar ;
GxB_FC64_t beta_scalar ;
if (is_eWiseUnion)
{
alpha_scalar = (*((GxB_FC64_t *) alpha_scalar_in)) ;
beta_scalar = (*((GxB_FC64_t *) beta_scalar_in )) ;
}
#include "GB_add_template.c"
GB_FREE_WORKSPACE ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__isne_fc64)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__isne_fc64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__isne_fc64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__isne_fc64)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__isne_fc64)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GxB_FC64_t *Cx = (GxB_FC64_t *) Cx_output ;
GxB_FC64_t x = (*((GxB_FC64_t *) x_input)) ;
GxB_FC64_t *Bx = (GxB_FC64_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
GxB_FC64_t bij = GBX (Bx, p, false) ;
Cx [p] = GB_FC64_isne (x, bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__isne_fc64)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
GxB_FC64_t *Cx = (GxB_FC64_t *) Cx_output ;
GxB_FC64_t *Ax = (GxB_FC64_t *) Ax_input ;
GxB_FC64_t y = (*((GxB_FC64_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
GxB_FC64_t aij = GBX (Ax, p, false) ;
Cx [p] = GB_FC64_isne (aij, y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
GxB_FC64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_FC64_isne (x, aij) ; \
}
GrB_Info GB (_bind1st_tran__isne_fc64)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
GxB_FC64_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GxB_FC64_t x = (*((const GxB_FC64_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
GxB_FC64_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
GxB_FC64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_FC64_isne (aij, y) ; \
}
GrB_Info GB (_bind2nd_tran__isne_fc64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GxB_FC64_t y = (*((const GxB_FC64_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
shear.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% SSSSS H H EEEEE AAA RRRR %
% SS H H E A A R R %
% SSS HHHHH EEE AAAAA RRRR %
% SS H H E A A R R %
% SSSSS H H EEEEE A A R R %
% %
% %
% MagickCore Methods to Shear or Rotate an Image by an Arbitrary Angle %
% %
% Software Design %
% Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2018 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% https://imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% The XShearImage() and YShearImage() methods are based on the paper "A Fast
% Algorithm for General Raster Rotation" by Alan W. Paeth, Graphics
% Interface '86 (Vancouver). ShearRotateImage() is adapted from a similar
% method based on the Paeth paper written by Michael Halle of the Spatial
% Imaging Group, MIT Media Lab.
%
*/
/*
Include declarations.
*/
#include "magick/studio.h"
#include "magick/artifact.h"
#include "magick/attribute.h"
#include "magick/blob-private.h"
#include "magick/cache-private.h"
#include "magick/channel.h"
#include "magick/color-private.h"
#include "magick/colorspace-private.h"
#include "magick/composite.h"
#include "magick/composite-private.h"
#include "magick/decorate.h"
#include "magick/distort.h"
#include "magick/draw.h"
#include "magick/exception.h"
#include "magick/exception-private.h"
#include "magick/gem.h"
#include "magick/geometry.h"
#include "magick/image.h"
#include "magick/image-private.h"
#include "magick/memory_.h"
#include "magick/list.h"
#include "magick/matrix.h"
#include "magick/monitor.h"
#include "magick/monitor-private.h"
#include "magick/nt-base-private.h"
#include "magick/pixel-private.h"
#include "magick/quantum.h"
#include "magick/resource_.h"
#include "magick/shear.h"
#include "magick/statistic.h"
#include "magick/string_.h"
#include "magick/string-private.h"
#include "magick/thread-private.h"
#include "magick/threshold.h"
#include "magick/token.h"
#include "magick/transform.h"
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C r o p T o F i t I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CropToFitImage() crops the sheared image as determined by the bounding box
% as defined by width and height and shearing angles.
%
% The format of the CropToFitImage method is:
%
% MagickBooleanType CropToFitImage(Image **image,
% const MagickRealType x_shear,const MagickRealType x_shear,
% const MagickRealType width,const MagickRealType height,
% const MagickBooleanType rotate,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o x_shear, y_shear, width, height: Defines a region of the image to crop.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType CropToFitImage(Image **image,
const MagickRealType x_shear,const MagickRealType y_shear,
const MagickRealType width,const MagickRealType height,
const MagickBooleanType rotate,ExceptionInfo *exception)
{
Image
*crop_image;
PointInfo
extent[4],
min,
max;
RectangleInfo
geometry,
page;
register ssize_t
i;
/*
Calculate the rotated image size.
*/
extent[0].x=(double) (-width/2.0);
extent[0].y=(double) (-height/2.0);
extent[1].x=(double) width/2.0;
extent[1].y=(double) (-height/2.0);
extent[2].x=(double) (-width/2.0);
extent[2].y=(double) height/2.0;
extent[3].x=(double) width/2.0;
extent[3].y=(double) height/2.0;
for (i=0; i < 4; i++)
{
extent[i].x+=x_shear*extent[i].y;
extent[i].y+=y_shear*extent[i].x;
if (rotate != MagickFalse)
extent[i].x+=x_shear*extent[i].y;
extent[i].x+=(double) (*image)->columns/2.0;
extent[i].y+=(double) (*image)->rows/2.0;
}
min=extent[0];
max=extent[0];
for (i=1; i < 4; i++)
{
if (min.x > extent[i].x)
min.x=extent[i].x;
if (min.y > extent[i].y)
min.y=extent[i].y;
if (max.x < extent[i].x)
max.x=extent[i].x;
if (max.y < extent[i].y)
max.y=extent[i].y;
}
geometry.x=(ssize_t) ceil(min.x-0.5);
geometry.y=(ssize_t) ceil(min.y-0.5);
geometry.width=(size_t) floor(max.x-min.x+0.5);
geometry.height=(size_t) floor(max.y-min.y+0.5);
page=(*image)->page;
(void) ParseAbsoluteGeometry("0x0+0+0",&(*image)->page);
crop_image=CropImage(*image,&geometry,exception);
if (crop_image == (Image *) NULL)
return(MagickFalse);
crop_image->page=page;
*image=DestroyImage(*image);
*image=crop_image;
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e s k e w I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DeskewImage() removes skew from the image. Skew is an artifact that
% occurs in scanned images because of the camera being misaligned,
% imperfections in the scanning or surface, or simply because the paper was
% not placed completely flat when scanned.
%
% The amount of rotation calculated to deskew the image is saved in the
% artifact "deskew:angle".
%
% If the artifact "deskew:auto-crop" is given the image will be automatically
% cropped of the excess background.
%
% The format of the DeskewImage method is:
%
% Image *DeskewImage(const Image *image,const double threshold,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o threshold: separate background from foreground.
%
% o exception: return any errors or warnings in this structure.
%
*/
static void RadonProjection(const Image *image,MatrixInfo *source_matrix,
MatrixInfo *destination_matrix,const ssize_t sign,size_t *projection)
{
MatrixInfo
*swap;
register MatrixInfo
*p,
*q;
register ssize_t
x;
size_t
step;
p=source_matrix;
q=destination_matrix;
for (step=1; step < GetMatrixColumns(p); step*=2)
{
for (x=0; x < (ssize_t) GetMatrixColumns(p); x+=2*(ssize_t) step)
{
register ssize_t
i;
ssize_t
y;
unsigned short
element,
neighbor;
for (i=0; i < (ssize_t) step; i++)
{
for (y=0; y < (ssize_t) (GetMatrixRows(p)-i-1); y++)
{
if (GetMatrixElement(p,x+i,y,&element) == MagickFalse)
continue;
if (GetMatrixElement(p,x+i+step,y+i,&neighbor) == MagickFalse)
continue;
neighbor+=element;
if (SetMatrixElement(q,x+2*i,y,&neighbor) == MagickFalse)
continue;
if (GetMatrixElement(p,x+i+step,y+i+1,&neighbor) == MagickFalse)
continue;
neighbor+=element;
if (SetMatrixElement(q,x+2*i+1,y,&neighbor) == MagickFalse)
continue;
}
for ( ; y < (ssize_t) (GetMatrixRows(p)-i); y++)
{
if (GetMatrixElement(p,x+i,y,&element) == MagickFalse)
continue;
if (GetMatrixElement(p,x+i+step,y+i,&neighbor) == MagickFalse)
continue;
neighbor+=element;
if (SetMatrixElement(q,x+2*i,y,&neighbor) == MagickFalse)
continue;
if (SetMatrixElement(q,x+2*i+1,y,&element) == MagickFalse)
continue;
}
for ( ; y < (ssize_t) GetMatrixRows(p); y++)
{
if (GetMatrixElement(p,x+i,y,&element) == MagickFalse)
continue;
if (SetMatrixElement(q,x+2*i,y,&element) == MagickFalse)
continue;
if (SetMatrixElement(q,x+2*i+1,y,&element) == MagickFalse)
continue;
}
}
}
swap=p;
p=q;
q=swap;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) \
magick_number_threads(image,image,GetMatrixColumns(p),1)
#endif
for (x=0; x < (ssize_t) GetMatrixColumns(p); x++)
{
register ssize_t
y;
size_t
sum;
sum=0;
for (y=0; y < (ssize_t) (GetMatrixRows(p)-1); y++)
{
ssize_t
delta;
unsigned short
element,
neighbor;
if (GetMatrixElement(p,x,y,&element) == MagickFalse)
continue;
if (GetMatrixElement(p,x,y+1,&neighbor) == MagickFalse)
continue;
delta=(ssize_t) element-(ssize_t) neighbor;
sum+=delta*delta;
}
projection[GetMatrixColumns(p)+sign*x-1]=sum;
}
}
static MagickBooleanType RadonTransform(const Image *image,
const double threshold,size_t *projection,ExceptionInfo *exception)
{
CacheView
*image_view;
MatrixInfo
*destination_matrix,
*source_matrix;
MagickBooleanType
status;
register ssize_t
i;
size_t
count,
width;
ssize_t
y;
unsigned char
byte;
unsigned short
bits[256];
for (width=1; width < ((image->columns+7)/8); width<<=1) ;
source_matrix=AcquireMatrixInfo(width,image->rows,sizeof(unsigned short),
exception);
destination_matrix=AcquireMatrixInfo(width,image->rows,sizeof(unsigned short),
exception);
if ((source_matrix == (MatrixInfo *) NULL) ||
(destination_matrix == (MatrixInfo *) NULL))
{
if (destination_matrix != (MatrixInfo *) NULL)
destination_matrix=DestroyMatrixInfo(destination_matrix);
if (source_matrix != (MatrixInfo *) NULL)
source_matrix=DestroyMatrixInfo(source_matrix);
return(MagickFalse);
}
if (NullMatrix(source_matrix) == MagickFalse)
{
destination_matrix=DestroyMatrixInfo(destination_matrix);
source_matrix=DestroyMatrixInfo(source_matrix);
return(MagickFalse);
}
for (i=0; i < 256; i++)
{
byte=(unsigned char) i;
for (count=0; byte != 0; byte>>=1)
count+=byte & 0x01;
bits[i]=(unsigned short) count;
}
status=MagickTrue;
image_view=AcquireVirtualCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*magick_restrict p;
register ssize_t
i,
x;
size_t
bit,
byte;
unsigned short
value;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
bit=0;
byte=0;
i=(ssize_t) (image->columns+7)/8;
for (x=0; x < (ssize_t) image->columns; x++)
{
byte<<=1;
if (((MagickRealType) GetPixelRed(p) < threshold) ||
((MagickRealType) GetPixelGreen(p) < threshold) ||
((MagickRealType) GetPixelBlue(p) < threshold))
byte|=0x01;
bit++;
if (bit == 8)
{
value=bits[byte];
(void) SetMatrixElement(source_matrix,--i,y,&value);
bit=0;
byte=0;
}
p++;
}
if (bit != 0)
{
byte<<=(8-bit);
value=bits[byte];
(void) SetMatrixElement(source_matrix,--i,y,&value);
}
}
RadonProjection(image,source_matrix,destination_matrix,-1,projection);
(void) NullMatrix(source_matrix);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*magick_restrict p;
register ssize_t
i,
x;
size_t
bit,
byte;
unsigned short
value;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
bit=0;
byte=0;
i=0;
for (x=0; x < (ssize_t) image->columns; x++)
{
byte<<=1;
if (((MagickRealType) GetPixelRed(p) < threshold) ||
((MagickRealType) GetPixelGreen(p) < threshold) ||
((MagickRealType) GetPixelBlue(p) < threshold))
byte|=0x01;
bit++;
if (bit == 8)
{
value=bits[byte];
(void) SetMatrixElement(source_matrix,i++,y,&value);
bit=0;
byte=0;
}
p++;
}
if (bit != 0)
{
byte<<=(8-bit);
value=bits[byte];
(void) SetMatrixElement(source_matrix,i++,y,&value);
}
}
RadonProjection(image,source_matrix,destination_matrix,1,projection);
image_view=DestroyCacheView(image_view);
destination_matrix=DestroyMatrixInfo(destination_matrix);
source_matrix=DestroyMatrixInfo(source_matrix);
return(MagickTrue);
}
static void GetImageBackgroundColor(Image *image,const ssize_t offset,
ExceptionInfo *exception)
{
CacheView
*image_view;
MagickPixelPacket
background;
MagickRealType
count;
ssize_t
y;
/*
Compute average background color.
*/
if (offset <= 0)
return;
GetMagickPixelPacket(image,&background);
count=0.0;
image_view=AcquireVirtualCacheView(image,exception);
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*magick_restrict p;
register ssize_t
x;
if ((y >= offset) && (y < ((ssize_t) image->rows-offset)))
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
continue;
for (x=0; x < (ssize_t) image->columns; x++)
{
if ((x >= offset) && (x < ((ssize_t) image->columns-offset)))
continue;
background.red+=QuantumScale*GetPixelRed(p);
background.green+=QuantumScale*GetPixelGreen(p);
background.blue+=QuantumScale*GetPixelBlue(p);
background.opacity+=QuantumScale*GetPixelOpacity(p);
count++;
p++;
}
}
image_view=DestroyCacheView(image_view);
image->background_color.red=ClampToQuantum((MagickRealType) QuantumRange*
background.red/count);
image->background_color.green=ClampToQuantum((MagickRealType) QuantumRange*
background.green/count);
image->background_color.blue=ClampToQuantum((MagickRealType) QuantumRange*
background.blue/count);
image->background_color.opacity=ClampToQuantum((MagickRealType) QuantumRange*
background.opacity/count);
}
MagickExport Image *DeskewImage(const Image *image,const double threshold,
ExceptionInfo *exception)
{
AffineMatrix
affine_matrix;
const char
*artifact;
double
degrees;
Image
*clone_image,
*crop_image,
*deskew_image,
*median_image;
MagickBooleanType
status;
RectangleInfo
geometry;
register ssize_t
i;
size_t
max_projection,
*projection,
width;
ssize_t
skew;
/*
Compute deskew angle.
*/
for (width=1; width < ((image->columns+7)/8); width<<=1) ;
projection=(size_t *) AcquireQuantumMemory((size_t) (2*width-1),
sizeof(*projection));
if (projection == (size_t *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
status=RadonTransform(image,threshold,projection,exception);
if (status == MagickFalse)
{
projection=(size_t *) RelinquishMagickMemory(projection);
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
}
max_projection=0;
skew=0;
for (i=0; i < (ssize_t) (2*width-1); i++)
{
if (projection[i] > max_projection)
{
skew=i-(ssize_t) width+1;
max_projection=projection[i];
}
}
projection=(size_t *) RelinquishMagickMemory(projection);
degrees=RadiansToDegrees(-atan((double) skew/width/8));
if (image->debug != MagickFalse)
(void) LogMagickEvent(TransformEvent,GetMagickModule(),
" Deskew angle: %g",degrees);
/*
Deskew image.
*/
clone_image=CloneImage(image,0,0,MagickTrue,exception);
if (clone_image == (Image *) NULL)
return((Image *) NULL);
{
char
angle[MaxTextExtent];
(void) FormatLocaleString(angle,MaxTextExtent,"%g",degrees);
(void) SetImageArtifact(clone_image,"deskew:angle",angle);
}
(void) SetImageVirtualPixelMethod(clone_image,BackgroundVirtualPixelMethod);
affine_matrix.sx=cos(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.rx=sin(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.ry=(-sin(DegreesToRadians(fmod((double) degrees,360.0))));
affine_matrix.sy=cos(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.tx=0.0;
affine_matrix.ty=0.0;
artifact=GetImageArtifact(image,"deskew:auto-crop");
if (IsMagickTrue(artifact) == MagickFalse)
{
deskew_image=AffineTransformImage(clone_image,&affine_matrix,exception);
clone_image=DestroyImage(clone_image);
return(deskew_image);
}
/*
Auto-crop image.
*/
GetImageBackgroundColor(clone_image,(ssize_t) StringToLong(artifact),
exception);
deskew_image=AffineTransformImage(clone_image,&affine_matrix,exception);
clone_image=DestroyImage(clone_image);
if (deskew_image == (Image *) NULL)
return((Image *) NULL);
median_image=StatisticImage(deskew_image,MedianStatistic,3,3,exception);
if (median_image == (Image *) NULL)
{
deskew_image=DestroyImage(deskew_image);
return((Image *) NULL);
}
geometry=GetImageBoundingBox(median_image,exception);
median_image=DestroyImage(median_image);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TransformEvent,GetMagickModule()," Deskew geometry: "
"%.20gx%.20g%+.20g%+.20g",(double) geometry.width,(double)
geometry.height,(double) geometry.x,(double) geometry.y);
crop_image=CropImage(deskew_image,&geometry,exception);
deskew_image=DestroyImage(deskew_image);
return(crop_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% I n t e g r a l R o t a t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% IntegralRotateImage() rotates the image an integral of 90 degrees. It
% allocates the memory necessary for the new Image structure and returns a
% pointer to the rotated image.
%
% The format of the IntegralRotateImage method is:
%
% Image *IntegralRotateImage(const Image *image,size_t rotations,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o rotations: Specifies the number of 90 degree rotations.
%
*/
MagickExport Image *IntegralRotateImage(const Image *image,size_t rotations,
ExceptionInfo *exception)
{
#define RotateImageTag "Rotate/Image"
CacheView
*image_view,
*rotate_view;
Image
*rotate_image;
MagickBooleanType
status;
MagickOffsetType
progress;
RectangleInfo
page;
ssize_t
y;
/*
Initialize rotated image attributes.
*/
assert(image != (Image *) NULL);
page=image->page;
rotations%=4;
if (rotations == 0)
return(CloneImage(image,0,0,MagickTrue,exception));
if ((rotations == 1) || (rotations == 3))
rotate_image=CloneImage(image,image->rows,image->columns,MagickTrue,
exception);
else
rotate_image=CloneImage(image,0,0,MagickTrue,exception);
if (rotate_image == (Image *) NULL)
return((Image *) NULL);
/*
Integral rotate the image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireVirtualCacheView(image,exception);
rotate_view=AcquireAuthenticCacheView(rotate_image,exception);
switch (rotations)
{
case 1:
{
size_t
tile_height,
tile_width;
ssize_t
tile_y;
/*
Rotate 90 degrees.
*/
GetPixelCacheTileSize(image,&tile_width,&tile_height);
tile_width=image->columns;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows/tile_height,1)
#endif
for (tile_y=0; tile_y < (ssize_t) image->rows; tile_y+=(ssize_t) tile_height)
{
register ssize_t
tile_x;
if (status == MagickFalse)
continue;
for (tile_x=0; tile_x < (ssize_t) image->columns; tile_x+=(ssize_t) tile_width)
{
MagickBooleanType
sync;
register const IndexPacket
*magick_restrict indexes;
register const PixelPacket
*magick_restrict p;
register IndexPacket
*magick_restrict rotate_indexes;
register PixelPacket
*magick_restrict q;
register ssize_t
y;
size_t
height,
width;
width=tile_width;
if ((tile_x+(ssize_t) tile_width) > (ssize_t) image->columns)
width=(size_t) (tile_width-(tile_x+tile_width-image->columns));
height=tile_height;
if ((tile_y+(ssize_t) tile_height) > (ssize_t) image->rows)
height=(size_t) (tile_height-(tile_y+tile_height-image->rows));
p=GetCacheViewVirtualPixels(image_view,tile_x,tile_y,width,height,
exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
break;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
for (y=0; y < (ssize_t) width; y++)
{
register const PixelPacket
*magick_restrict tile_pixels;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(rotate_view,(ssize_t)
(rotate_image->columns-(tile_y+height)),y+tile_x,height,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
tile_pixels=p+(height-1)*width+y;
for (x=0; x < (ssize_t) height; x++)
{
*q++=(*tile_pixels);
tile_pixels-=width;
}
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
{
register const IndexPacket
*magick_restrict tile_indexes;
tile_indexes=indexes+(height-1)*width+y;
for (x=0; x < (ssize_t) height; x++)
{
*rotate_indexes++=(*tile_indexes);
tile_indexes-=width;
}
}
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
}
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress+=tile_height,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
(void) SetImageProgress(image,RotateImageTag,(MagickOffsetType)
image->rows-1,image->rows);
Swap(page.width,page.height);
Swap(page.x,page.y);
if (page.width != 0)
page.x=(ssize_t) (page.width-rotate_image->columns-page.x);
break;
}
case 2:
{
/*
Rotate 180 degrees.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows,1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
register const IndexPacket
*magick_restrict indexes;
register const PixelPacket
*magick_restrict p;
register IndexPacket
*magick_restrict rotate_indexes;
register PixelPacket
*magick_restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,
exception);
q=QueueCacheViewAuthenticPixels(rotate_view,0,(ssize_t) (image->rows-y-
1),image->columns,1,exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
q+=image->columns;
for (x=0; x < (ssize_t) image->columns; x++)
*--q=(*p++);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
for (x=0; x < (ssize_t) image->columns; x++)
SetPixelIndex(rotate_indexes+image->columns-x-1,
GetPixelIndex(indexes+x));
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
if (page.width != 0)
page.x=(ssize_t) (page.width-rotate_image->columns-page.x);
if (page.height != 0)
page.y=(ssize_t) (page.height-rotate_image->rows-page.y);
break;
}
case 3:
{
size_t
tile_height,
tile_width;
ssize_t
tile_y;
/*
Rotate 270 degrees.
*/
GetPixelCacheTileSize(image,&tile_width,&tile_height);
tile_width=image->columns;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(status) \
magick_number_threads(image,image,image->rows/tile_height,1)
#endif
for (tile_y=0; tile_y < (ssize_t) image->rows; tile_y+=(ssize_t) tile_height)
{
register ssize_t
tile_x;
if (status == MagickFalse)
continue;
for (tile_x=0; tile_x < (ssize_t) image->columns; tile_x+=(ssize_t) tile_width)
{
MagickBooleanType
sync;
register const IndexPacket
*magick_restrict indexes;
register const PixelPacket
*magick_restrict p;
register IndexPacket
*magick_restrict rotate_indexes;
register PixelPacket
*magick_restrict q;
register ssize_t
y;
size_t
height,
width;
width=tile_width;
if ((tile_x+(ssize_t) tile_width) > (ssize_t) image->columns)
width=(size_t) (tile_width-(tile_x+tile_width-image->columns));
height=tile_height;
if ((tile_y+(ssize_t) tile_height) > (ssize_t) image->rows)
height=(size_t) (tile_height-(tile_y+tile_height-image->rows));
p=GetCacheViewVirtualPixels(image_view,tile_x,tile_y,width,height,
exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
break;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
for (y=0; y < (ssize_t) width; y++)
{
register const PixelPacket
*magick_restrict tile_pixels;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(rotate_view,tile_y,(ssize_t) (y+
rotate_image->rows-(tile_x+width)),height,1,exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
tile_pixels=p+(width-1)-y;
for (x=0; x < (ssize_t) height; x++)
{
*q++=(*tile_pixels);
tile_pixels+=width;
}
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
{
register const IndexPacket
*magick_restrict tile_indexes;
tile_indexes=indexes+(width-1)-y;
for (x=0; x < (ssize_t) height; x++)
{
*rotate_indexes++=(*tile_indexes);
tile_indexes+=width;
}
}
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
}
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress+=tile_height,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
(void) SetImageProgress(image,RotateImageTag,(MagickOffsetType)
image->rows-1,image->rows);
Swap(page.width,page.height);
Swap(page.x,page.y);
if (page.height != 0)
page.y=(ssize_t) (page.height-rotate_image->rows-page.y);
break;
}
default:
break;
}
rotate_view=DestroyCacheView(rotate_view);
image_view=DestroyCacheView(image_view);
rotate_image->type=image->type;
rotate_image->page=page;
if (status == MagickFalse)
rotate_image=DestroyImage(rotate_image);
return(rotate_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ X S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% XShearImage() shears the image in the X direction with a shear angle of
% 'degrees'. Positive angles shear counter-clockwise (right-hand rule), and
% negative angles shear clockwise. Angles are measured relative to a vertical
% Y-axis. X shears will widen an image creating 'empty' triangles on the left
% and right sides of the source image.
%
% The format of the XShearImage method is:
%
% MagickBooleanType XShearImage(Image *image,const MagickRealType degrees,
% const size_t width,const size_t height,
% const ssize_t x_offset,const ssize_t y_offset,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: A MagickRealType representing the shearing angle along the X
% axis.
%
% o width, height, x_offset, y_offset: Defines a region of the image
% to shear.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType XShearImage(Image *image,const MagickRealType degrees,
const size_t width,const size_t height,const ssize_t x_offset,
const ssize_t y_offset,ExceptionInfo *exception)
{
#define XShearImageTag "XShear/Image"
typedef enum
{
LEFT,
RIGHT
} ShearDirection;
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
background;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
GetMagickPixelPacket(image,&background);
SetMagickPixelPacket(image,&image->background_color,(IndexPacket *) NULL,
&background);
if (image->colorspace == CMYKColorspace)
ConvertRGBToCMYK(&background);
/*
X shear image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(progress,status) \
magick_number_threads(image,image,height,1)
#endif
for (y=0; y < (ssize_t) height; y++)
{
MagickPixelPacket
pixel,
source,
destination;
MagickRealType
area,
displacement;
register IndexPacket
*magick_restrict indexes,
*magick_restrict shear_indexes;
register PixelPacket
*magick_restrict p,
*magick_restrict q;
register ssize_t
i;
ShearDirection
direction;
ssize_t
step;
if (status == MagickFalse)
continue;
p=GetCacheViewAuthenticPixels(image_view,0,y_offset+y,image->columns,1,
exception);
if (p == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(image_view);
p+=x_offset;
indexes+=x_offset;
displacement=degrees*(MagickRealType) (y-height/2.0);
if (displacement == 0.0)
continue;
if (displacement > 0.0)
direction=RIGHT;
else
{
displacement*=(-1.0);
direction=LEFT;
}
step=(ssize_t) floor((double) displacement);
area=(MagickRealType) (displacement-step);
step++;
pixel=background;
GetMagickPixelPacket(image,&source);
GetMagickPixelPacket(image,&destination);
switch (direction)
{
case LEFT:
{
/*
Transfer pixels left-to-right.
*/
if (step > x_offset)
break;
q=p-step;
shear_indexes=indexes-step;
for (i=0; i < (ssize_t) width; i++)
{
if ((x_offset+i) < step)
{
SetMagickPixelPacket(image,++p,++indexes,&pixel);
q++;
shear_indexes++;
continue;
}
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
SetMagickPixelPacket(image,p++,indexes++,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,q++,shear_indexes++);
break;
}
case RIGHT:
{
/*
Transfer pixels right-to-left.
*/
p+=width;
indexes+=width;
q=p+step;
shear_indexes=indexes+step;
for (i=0; i < (ssize_t) width; i++)
{
p--;
indexes--;
q--;
shear_indexes--;
if ((size_t) (x_offset+width+step-i) > image->columns)
continue;
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q,shear_indexes);
SetMagickPixelPacket(image,p,indexes,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,--q,--shear_indexes);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,--q,--shear_indexes);
break;
}
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_XShearImage)
#endif
proceed=SetImageProgress(image,XShearImageTag,progress++,height);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ Y S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% YShearImage shears the image in the Y direction with a shear angle of
% 'degrees'. Positive angles shear counter-clockwise (right-hand rule), and
% negative angles shear clockwise. Angles are measured relative to a
% horizontal X-axis. Y shears will increase the height of an image creating
% 'empty' triangles on the top and bottom of the source image.
%
% The format of the YShearImage method is:
%
% MagickBooleanType YShearImage(Image *image,const MagickRealType degrees,
% const size_t width,const size_t height,
% const ssize_t x_offset,const ssize_t y_offset,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: A MagickRealType representing the shearing angle along the Y
% axis.
%
% o width, height, x_offset, y_offset: Defines a region of the image
% to shear.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType YShearImage(Image *image,const MagickRealType degrees,
const size_t width,const size_t height,const ssize_t x_offset,
const ssize_t y_offset,ExceptionInfo *exception)
{
#define YShearImageTag "YShear/Image"
typedef enum
{
UP,
DOWN
} ShearDirection;
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
background;
ssize_t
x;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
GetMagickPixelPacket(image,&background);
SetMagickPixelPacket(image,&image->background_color,(IndexPacket *) NULL,
&background);
if (image->colorspace == CMYKColorspace)
ConvertRGBToCMYK(&background);
/*
Y Shear image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireAuthenticCacheView(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static) shared(progress,status) \
magick_number_threads(image,image,width,1)
#endif
for (x=0; x < (ssize_t) width; x++)
{
ssize_t
step;
MagickPixelPacket
pixel,
source,
destination;
MagickRealType
area,
displacement;
register IndexPacket
*magick_restrict indexes,
*magick_restrict shear_indexes;
register ssize_t
i;
register PixelPacket
*magick_restrict p,
*magick_restrict q;
ShearDirection
direction;
if (status == MagickFalse)
continue;
p=GetCacheViewAuthenticPixels(image_view,x_offset+x,0,1,image->rows,
exception);
if (p == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(image_view);
p+=y_offset;
indexes+=y_offset;
displacement=degrees*(MagickRealType) (x-width/2.0);
if (displacement == 0.0)
continue;
if (displacement > 0.0)
direction=DOWN;
else
{
displacement*=(-1.0);
direction=UP;
}
step=(ssize_t) floor((double) displacement);
area=(MagickRealType) (displacement-step);
step++;
pixel=background;
GetMagickPixelPacket(image,&source);
GetMagickPixelPacket(image,&destination);
switch (direction)
{
case UP:
{
/*
Transfer pixels top-to-bottom.
*/
if (step > y_offset)
break;
q=p-step;
shear_indexes=indexes-step;
for (i=0; i < (ssize_t) height; i++)
{
if ((y_offset+i) < step)
{
SetMagickPixelPacket(image,++p,++indexes,&pixel);
q++;
shear_indexes++;
continue;
}
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
SetMagickPixelPacket(image,p++,indexes++,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,q++,shear_indexes++);
break;
}
case DOWN:
{
/*
Transfer pixels bottom-to-top.
*/
p+=height;
indexes+=height;
q=p+step;
shear_indexes=indexes+step;
for (i=0; i < (ssize_t) height; i++)
{
p--;
indexes--;
q--;
shear_indexes--;
if ((size_t) (y_offset+height+step-i) > image->rows)
continue;
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q,shear_indexes);
SetMagickPixelPacket(image,p,indexes,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,--q,--shear_indexes);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,--q,--shear_indexes);
break;
}
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_YShearImage)
#endif
proceed=SetImageProgress(image,YShearImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ShearImage() creates a new image that is a shear_image copy of an existing
% one. Shearing slides one edge of an image along the X or Y axis, creating
% a parallelogram. An X direction shear slides an edge along the X axis,
% while a Y direction shear slides an edge along the Y axis. The amount of
% the shear is controlled by a shear angle. For X direction shears, x_shear
% is measured relative to the Y axis, and similarly, for Y direction shears
% y_shear is measured relative to the X axis. Empty triangles left over from
% shearing the image are filled with the background color defined by member
% 'background_color' of the image.. ShearImage() allocates the memory
% necessary for the new Image structure and returns a pointer to the new image.
%
% ShearImage() is based on the paper "A Fast Algorithm for General Raster
% Rotatation" by Alan W. Paeth.
%
% The format of the ShearImage method is:
%
% Image *ShearImage(const Image *image,const double x_shear,
% const double y_shear,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o x_shear, y_shear: Specifies the number of degrees to shear the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ShearImage(const Image *image,const double x_shear,
const double y_shear,ExceptionInfo *exception)
{
Image
*integral_image,
*shear_image;
MagickBooleanType
status;
PointInfo
shear;
RectangleInfo
border_info,
bounds;
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
if ((x_shear != 0.0) && (fmod(x_shear,90.0) == 0.0))
ThrowImageException(ImageError,"AngleIsDiscontinuous");
if ((y_shear != 0.0) && (fmod(y_shear,90.0) == 0.0))
ThrowImageException(ImageError,"AngleIsDiscontinuous");
/*
Initialize shear angle.
*/
integral_image=CloneImage(image,0,0,MagickTrue,exception);
if (integral_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
shear.x=(-tan(DegreesToRadians(fmod(x_shear,360.0))));
shear.y=tan(DegreesToRadians(fmod(y_shear,360.0)));
if ((shear.x == 0.0) && (shear.y == 0.0))
return(integral_image);
if (SetImageStorageClass(integral_image,DirectClass) == MagickFalse)
{
InheritException(exception,&integral_image->exception);
integral_image=DestroyImage(integral_image);
return(integral_image);
}
if (integral_image->matte == MagickFalse)
(void) SetImageAlphaChannel(integral_image,OpaqueAlphaChannel);
/*
Compute image size.
*/
bounds.width=image->columns+(ssize_t) floor(fabs(shear.x)*image->rows+0.5);
bounds.x=(ssize_t) ceil((double) image->columns+((fabs(shear.x)*image->rows)-
image->columns)/2.0-0.5);
bounds.y=(ssize_t) ceil((double) image->rows+((fabs(shear.y)*bounds.width)-
image->rows)/2.0-0.5);
/*
Surround image with border.
*/
integral_image->border_color=integral_image->background_color;
integral_image->compose=CopyCompositeOp;
border_info.width=(size_t) bounds.x;
border_info.height=(size_t) bounds.y;
shear_image=BorderImage(integral_image,&border_info,exception);
integral_image=DestroyImage(integral_image);
if (shear_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
/*
Shear the image.
*/
if (shear_image->matte == MagickFalse)
(void) SetImageAlphaChannel(shear_image,OpaqueAlphaChannel);
status=XShearImage(shear_image,shear.x,image->columns,image->rows,bounds.x,
(ssize_t) (shear_image->rows-image->rows)/2,exception);
if (status == MagickFalse)
{
shear_image=DestroyImage(shear_image);
return((Image *) NULL);
}
status=YShearImage(shear_image,shear.y,bounds.width,image->rows,(ssize_t)
(shear_image->columns-bounds.width)/2,bounds.y,exception);
if (status == MagickFalse)
{
shear_image=DestroyImage(shear_image);
return((Image *) NULL);
}
status=CropToFitImage(&shear_image,shear.x,shear.y,(MagickRealType)
image->columns,(MagickRealType) image->rows,MagickFalse,exception);
shear_image->matte=image->matte;
shear_image->compose=image->compose;
shear_image->page.width=0;
shear_image->page.height=0;
if (status == MagickFalse)
shear_image=DestroyImage(shear_image);
return(shear_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S h e a r R o t a t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ShearRotateImage() creates a new image that is a rotated copy of an existing
% one. Positive angles rotate counter-clockwise (right-hand rule), while
% negative angles rotate clockwise. Rotated images are usually larger than
% the originals and have 'empty' triangular corners. X axis. Empty
% triangles left over from shearing the image are filled with the background
% color defined by member 'background_color' of the image. ShearRotateImage
% allocates the memory necessary for the new Image structure and returns a
% pointer to the new image.
%
% ShearRotateImage() is based on the paper "A Fast Algorithm for General
% Raster Rotatation" by Alan W. Paeth. ShearRotateImage is adapted from a
% similar method based on the Paeth paper written by Michael Halle of the
% Spatial Imaging Group, MIT Media Lab.
%
% The format of the ShearRotateImage method is:
%
% Image *ShearRotateImage(const Image *image,const double degrees,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: Specifies the number of degrees to rotate the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ShearRotateImage(const Image *image,const double degrees,
ExceptionInfo *exception)
{
Image
*integral_image,
*rotate_image;
MagickBooleanType
status;
MagickRealType
angle;
PointInfo
shear;
RectangleInfo
border_info,
bounds;
size_t
height,
rotations,
shear_width,
width;
/*
Adjust rotation angle.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickCoreSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickCoreSignature);
angle=fmod(degrees,360.0);
if (angle < -45.0)
angle+=360.0;
for (rotations=0; angle > 45.0; rotations++)
angle-=90.0;
rotations%=4;
/*
Calculate shear equations.
*/
integral_image=IntegralRotateImage(image,rotations,exception);
if (integral_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
shear.x=(-tan((double) DegreesToRadians(angle)/2.0));
shear.y=sin((double) DegreesToRadians(angle));
if ((shear.x == 0.0) && (shear.y == 0.0))
return(integral_image);
if (SetImageStorageClass(integral_image,DirectClass) == MagickFalse)
{
InheritException(exception,&integral_image->exception);
integral_image=DestroyImage(integral_image);
return(integral_image);
}
if (integral_image->matte == MagickFalse)
(void) SetImageAlphaChannel(integral_image,OpaqueAlphaChannel);
/*
Compute maximum bounds for 3 shear operations.
*/
width=integral_image->columns;
height=integral_image->rows;
bounds.width=(size_t) floor(fabs((double) height*shear.x)+width+0.5);
bounds.height=(size_t) floor(fabs((double) bounds.width*shear.y)+height+0.5);
shear_width=(size_t) floor(fabs((double) bounds.height*shear.x)+
bounds.width+0.5);
bounds.x=(ssize_t) floor((double) ((shear_width > bounds.width) ? width :
bounds.width-shear_width+2)/2.0+0.5);
bounds.y=(ssize_t) floor(((double) bounds.height-height+2)/2.0+0.5);
/*
Surround image with a border.
*/
integral_image->border_color=integral_image->background_color;
integral_image->compose=CopyCompositeOp;
border_info.width=(size_t) bounds.x;
border_info.height=(size_t) bounds.y;
rotate_image=BorderImage(integral_image,&border_info,exception);
integral_image=DestroyImage(integral_image);
if (rotate_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
/*
Rotate the image.
*/
status=XShearImage(rotate_image,shear.x,width,height,bounds.x,(ssize_t)
(rotate_image->rows-height)/2,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=YShearImage(rotate_image,shear.y,bounds.width,height,(ssize_t)
(rotate_image->columns-bounds.width)/2,bounds.y,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=XShearImage(rotate_image,shear.x,bounds.width,bounds.height,(ssize_t)
(rotate_image->columns-bounds.width)/2,(ssize_t) (rotate_image->rows-
bounds.height)/2,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=CropToFitImage(&rotate_image,shear.x,shear.y,(MagickRealType) width,
(MagickRealType) height,MagickTrue,exception);
rotate_image->matte=image->matte;
rotate_image->compose=image->compose;
rotate_image->page.width=0;
rotate_image->page.height=0;
if (status == MagickFalse)
rotate_image=DestroyImage(rotate_image);
return(rotate_image);
}
|
fx.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% FFFFF X X %
% F X X %
% FFF X %
% F X X %
% F X X %
% %
% %
% MagickCore Image Special Effects Methods %
% %
% Software Design %
% John Cristy %
% October 1996 %
% %
% %
% Copyright 1999-2011 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% http://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
%
*/
/*
Include declarations.
*/
#include "magick/studio.h"
#include "magick/annotate.h"
#include "magick/artifact.h"
#include "magick/attribute.h"
#include "magick/cache.h"
#include "magick/cache-view.h"
#include "magick/color.h"
#include "magick/color-private.h"
#include "magick/composite.h"
#include "magick/decorate.h"
#include "magick/draw.h"
#include "magick/effect.h"
#include "magick/enhance.h"
#include "magick/exception.h"
#include "magick/exception-private.h"
#include "magick/fx.h"
#include "magick/fx-private.h"
#include "magick/gem.h"
#include "magick/geometry.h"
#include "magick/layer.h"
#include "magick/list.h"
#include "magick/log.h"
#include "magick/image.h"
#include "magick/image-private.h"
#include "magick/magick.h"
#include "magick/memory_.h"
#include "magick/monitor.h"
#include "magick/monitor-private.h"
#include "magick/option.h"
#include "magick/pixel-private.h"
#include "magick/property.h"
#include "magick/quantum.h"
#include "magick/quantum-private.h"
#include "magick/random_.h"
#include "magick/random-private.h"
#include "magick/resample.h"
#include "magick/resample-private.h"
#include "magick/resize.h"
#include "magick/shear.h"
#include "magick/splay-tree.h"
#include "magick/statistic.h"
#include "magick/string_.h"
#include "magick/string-private.h"
#include "magick/thread-private.h"
#include "magick/transform.h"
#include "magick/utility.h"
/*
Define declarations.
*/
#define LeftShiftOperator 0xf5
#define RightShiftOperator 0xf6
#define LessThanEqualOperator 0xf7
#define GreaterThanEqualOperator 0xf8
#define EqualOperator 0xf9
#define NotEqualOperator 0xfa
#define LogicalAndOperator 0xfb
#define LogicalOrOperator 0xfc
#define ExponentialNotation 0xfd
struct _FxInfo
{
const Image
*images;
char
*expression;
FILE
*file;
SplayTreeInfo
*colors,
*symbols;
CacheView
**view;
RandomInfo
*random_info;
ExceptionInfo
*exception;
};
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ A c q u i r e F x I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% AcquireFxInfo() allocates the FxInfo structure.
%
% The format of the AcquireFxInfo method is:
%
% FxInfo *AcquireFxInfo(Image *image,const char *expression)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o expression: the expression.
%
*/
MagickExport FxInfo *AcquireFxInfo(const Image *image,const char *expression)
{
char
fx_op[2];
const Image
*next;
FxInfo
*fx_info;
register ssize_t
i;
fx_info=(FxInfo *) AcquireMagickMemory(sizeof(*fx_info));
if (fx_info == (FxInfo *) NULL)
ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed");
(void) ResetMagickMemory(fx_info,0,sizeof(*fx_info));
fx_info->exception=AcquireExceptionInfo();
fx_info->images=image;
fx_info->colors=NewSplayTree(CompareSplayTreeString,RelinquishMagickMemory,
RelinquishMagickMemory);
fx_info->symbols=NewSplayTree(CompareSplayTreeString,RelinquishMagickMemory,
RelinquishMagickMemory);
fx_info->view=(CacheView **) AcquireQuantumMemory(GetImageListLength(
fx_info->images),sizeof(*fx_info->view));
if (fx_info->view == (CacheView **) NULL)
ThrowFatalException(ResourceLimitFatalError,"MemoryAllocationFailed");
i=0;
next=GetFirstImageInList(fx_info->images);
for ( ; next != (Image *) NULL; next=next->next)
{
fx_info->view[i]=AcquireCacheView(next);
i++;
}
fx_info->random_info=AcquireRandomInfo();
fx_info->expression=ConstantString(expression);
fx_info->file=stderr;
(void) SubstituteString(&fx_info->expression," ",""); /* compact string */
/*
Force right-to-left associativity for unary negation.
*/
(void) SubstituteString(&fx_info->expression,"-","-1.0*");
if ((strstr(fx_info->expression,"e+") != (char *) NULL) ||
(strstr(fx_info->expression,"e-") != (char *) NULL))
{
/*
Convert scientific notation.
*/
(void) SubstituteString(&fx_info->expression,"0e+","0**10^");
(void) SubstituteString(&fx_info->expression,"1e+","1**10^");
(void) SubstituteString(&fx_info->expression,"2e+","2**10^");
(void) SubstituteString(&fx_info->expression,"3e+","3**10^");
(void) SubstituteString(&fx_info->expression,"4e+","4**10^");
(void) SubstituteString(&fx_info->expression,"5e+","5**10^");
(void) SubstituteString(&fx_info->expression,"6e+","6**10^");
(void) SubstituteString(&fx_info->expression,"7e+","7**10^");
(void) SubstituteString(&fx_info->expression,"8e+","8**10^");
(void) SubstituteString(&fx_info->expression,"9e+","9**10^");
(void) SubstituteString(&fx_info->expression,"0e-1.0*","0**10^-");
(void) SubstituteString(&fx_info->expression,"1e-1.0*","1**10^-");
(void) SubstituteString(&fx_info->expression,"2e-1.0*","2**10^-");
(void) SubstituteString(&fx_info->expression,"3e-1.0*","3**10^-");
(void) SubstituteString(&fx_info->expression,"4e-1.0*","4**10^-");
(void) SubstituteString(&fx_info->expression,"5e-1.0*","5**10^-");
(void) SubstituteString(&fx_info->expression,"6e-1.0*","6**10^-");
(void) SubstituteString(&fx_info->expression,"7e-1.0*","7**10^-");
(void) SubstituteString(&fx_info->expression,"8e-1.0*","8**10^-");
(void) SubstituteString(&fx_info->expression,"9e-1.0*","9**10^-");
}
if ((strstr(fx_info->expression,"E+") != (char *) NULL) ||
(strstr(fx_info->expression,"E-") != (char *) NULL))
{
/*
Convert scientific notation.
*/
(void) SubstituteString(&fx_info->expression,"0E+","0**10^");
(void) SubstituteString(&fx_info->expression,"1E+","1**10^");
(void) SubstituteString(&fx_info->expression,"2E+","2**10^");
(void) SubstituteString(&fx_info->expression,"3E+","3**10^");
(void) SubstituteString(&fx_info->expression,"4E+","4**10^");
(void) SubstituteString(&fx_info->expression,"5E+","5**10^");
(void) SubstituteString(&fx_info->expression,"6E+","6**10^");
(void) SubstituteString(&fx_info->expression,"7E+","7**10^");
(void) SubstituteString(&fx_info->expression,"8E+","8**10^");
(void) SubstituteString(&fx_info->expression,"9E+","9**10^");
(void) SubstituteString(&fx_info->expression,"0E-1.0*","0**10^-");
(void) SubstituteString(&fx_info->expression,"1E-1.0*","1**10^-");
(void) SubstituteString(&fx_info->expression,"2E-1.0*","2**10^-");
(void) SubstituteString(&fx_info->expression,"3E-1.0*","3**10^-");
(void) SubstituteString(&fx_info->expression,"4E-1.0*","4**10^-");
(void) SubstituteString(&fx_info->expression,"5E-1.0*","5**10^-");
(void) SubstituteString(&fx_info->expression,"6E-1.0*","6**10^-");
(void) SubstituteString(&fx_info->expression,"7E-1.0*","7**10^-");
(void) SubstituteString(&fx_info->expression,"8E-1.0*","8**10^-");
(void) SubstituteString(&fx_info->expression,"9E-1.0*","9**10^-");
}
/*
Convert complex to simple operators.
*/
fx_op[1]='\0';
*fx_op=(char) LeftShiftOperator;
(void) SubstituteString(&fx_info->expression,"<<",fx_op);
*fx_op=(char) RightShiftOperator;
(void) SubstituteString(&fx_info->expression,">>",fx_op);
*fx_op=(char) LessThanEqualOperator;
(void) SubstituteString(&fx_info->expression,"<=",fx_op);
*fx_op=(char) GreaterThanEqualOperator;
(void) SubstituteString(&fx_info->expression,">=",fx_op);
*fx_op=(char) EqualOperator;
(void) SubstituteString(&fx_info->expression,"==",fx_op);
*fx_op=(char) NotEqualOperator;
(void) SubstituteString(&fx_info->expression,"!=",fx_op);
*fx_op=(char) LogicalAndOperator;
(void) SubstituteString(&fx_info->expression,"&&",fx_op);
*fx_op=(char) LogicalOrOperator;
(void) SubstituteString(&fx_info->expression,"||",fx_op);
*fx_op=(char) ExponentialNotation;
(void) SubstituteString(&fx_info->expression,"**",fx_op);
return(fx_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% A d d N o i s e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% AddNoiseImage() adds random noise to the image.
%
% The format of the AddNoiseImage method is:
%
% Image *AddNoiseImage(const Image *image,const NoiseType noise_type,
% ExceptionInfo *exception)
% Image *AddNoiseImageChannel(const Image *image,const ChannelType channel,
% const NoiseType noise_type,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o channel: the channel type.
%
% o noise_type: The type of noise: Uniform, Gaussian, Multiplicative,
% Impulse, Laplacian, or Poisson.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *AddNoiseImage(const Image *image,const NoiseType noise_type,
ExceptionInfo *exception)
{
Image
*noise_image;
noise_image=AddNoiseImageChannel(image,DefaultChannels,noise_type,exception);
return(noise_image);
}
MagickExport Image *AddNoiseImageChannel(const Image *image,
const ChannelType channel,const NoiseType noise_type,ExceptionInfo *exception)
{
#define AddNoiseImageTag "AddNoise/Image"
CacheView
*image_view,
*noise_view;
const char
*option;
Image
*noise_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickRealType
attenuate;
RandomInfo
**restrict random_info;
ssize_t
y;
/*
Initialize noise image attributes.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
noise_image=CloneImage(image,0,0,MagickTrue,exception);
if (noise_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(noise_image,DirectClass) == MagickFalse)
{
InheritException(exception,&noise_image->exception);
noise_image=DestroyImage(noise_image);
return((Image *) NULL);
}
/*
Add noise in each row.
*/
attenuate=1.0;
option=GetImageArtifact(image,"attenuate");
if (option != (char *) NULL)
attenuate=InterpretLocaleValue(option,(char **) NULL);
status=MagickTrue;
progress=0;
random_info=AcquireRandomInfoThreadSet();
image_view=AcquireCacheView(image);
noise_view=AcquireCacheView(noise_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
const int
id = GetOpenMPThreadId();
MagickBooleanType
sync;
register const IndexPacket
*restrict indexes;
register const PixelPacket
*restrict p;
register IndexPacket
*restrict noise_indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=GetCacheViewAuthenticPixels(noise_view,0,y,noise_image->columns,1,
exception);
if ((p == (PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
noise_indexes=GetCacheViewAuthenticIndexQueue(noise_view);
for (x=0; x < (ssize_t) image->columns; x++)
{
if ((channel & RedChannel) != 0)
SetRedPixelComponent(q,ClampToQuantum(GenerateDifferentialNoise(
random_info[id],GetRedPixelComponent(p),noise_type,attenuate)));
if ((channel & GreenChannel) != 0)
SetGreenPixelComponent(q,ClampToQuantum(GenerateDifferentialNoise(
random_info[id],GetGreenPixelComponent(p),noise_type,attenuate)));
if ((channel & BlueChannel) != 0)
SetBluePixelComponent(q,ClampToQuantum(GenerateDifferentialNoise(
random_info[id],GetBluePixelComponent(p),noise_type,attenuate)));
if ((channel & OpacityChannel) != 0)
SetOpacityPixelComponent(q,ClampToQuantum(GenerateDifferentialNoise(
random_info[id],GetOpacityPixelComponent(p),noise_type,attenuate)));
if (((channel & IndexChannel) != 0) &&
(image->colorspace == CMYKColorspace))
SetIndexPixelComponent(noise_indexes+x,ClampToQuantum(
GenerateDifferentialNoise(random_info[id],GetIndexPixelComponent(
indexes+x),noise_type,attenuate)));
p++;
q++;
}
sync=SyncCacheViewAuthenticPixels(noise_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_AddNoiseImage)
#endif
proceed=SetImageProgress(image,AddNoiseImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
noise_view=DestroyCacheView(noise_view);
image_view=DestroyCacheView(image_view);
random_info=DestroyRandomInfoThreadSet(random_info);
if (status == MagickFalse)
noise_image=DestroyImage(noise_image);
return(noise_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% B l u e S h i f t I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% BlueShiftImage() mutes the colors of the image to simulate a scene at
% nighttime in the moonlight.
%
% The format of the BlueShiftImage method is:
%
% Image *BlueShiftImage(const Image *image,const double factor,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o factor: the shift factor.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *BlueShiftImage(const Image *image,const double factor,
ExceptionInfo *exception)
{
#define BlueShiftImageTag "BlueShift/Image"
CacheView
*image_view,
*shift_view;
Image
*shift_image;
MagickBooleanType
status;
MagickOffsetType
progress;
ssize_t
y;
/*
Allocate blue shift image.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
shift_image=CloneImage(image,image->columns,image->rows,MagickTrue,
exception);
if (shift_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(shift_image,DirectClass) == MagickFalse)
{
InheritException(exception,&shift_image->exception);
shift_image=DestroyImage(shift_image);
return((Image *) NULL);
}
/*
Blue-shift DirectClass image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
shift_view=AcquireCacheView(shift_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
MagickPixelPacket
pixel;
Quantum
quantum;
register const PixelPacket
*restrict p;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=QueueCacheViewAuthenticPixels(shift_view,0,y,shift_image->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
quantum=GetRedPixelComponent(p);
if (GetGreenPixelComponent(p) < quantum)
quantum=GetGreenPixelComponent(p);
if (GetBluePixelComponent(p) < quantum)
quantum=GetBluePixelComponent(p);
pixel.red=0.5*(GetRedPixelComponent(p)+factor*quantum);
pixel.green=0.5*(GetGreenPixelComponent(p)+factor*quantum);
pixel.blue=0.5*(GetBluePixelComponent(p)+factor*quantum);
quantum=GetRedPixelComponent(p);
if (GetGreenPixelComponent(p) > quantum)
quantum=GetGreenPixelComponent(p);
if (GetBluePixelComponent(p) > quantum)
quantum=GetBluePixelComponent(p);
pixel.red=0.5*(pixel.red+factor*quantum);
pixel.green=0.5*(pixel.green+factor*quantum);
pixel.blue=0.5*(pixel.blue+factor*quantum);
SetRedPixelComponent(q,ClampToQuantum(pixel.red));
SetGreenPixelComponent(q,ClampToQuantum(pixel.green));
SetBluePixelComponent(q,ClampToQuantum(pixel.blue));
p++;
q++;
}
sync=SyncCacheViewAuthenticPixels(shift_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_BlueShiftImage)
#endif
proceed=SetImageProgress(image,BlueShiftImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
shift_view=DestroyCacheView(shift_view);
if (status == MagickFalse)
shift_image=DestroyImage(shift_image);
return(shift_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C h a r c o a l I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CharcoalImage() creates a new image that is a copy of an existing one with
% the edge highlighted. It allocates the memory necessary for the new Image
% structure and returns a pointer to the new image.
%
% The format of the CharcoalImage method is:
%
% Image *CharcoalImage(const Image *image,const double radius,
% const double sigma,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o radius: the radius of the pixel neighborhood.
%
% o sigma: the standard deviation of the Gaussian, in pixels.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *CharcoalImage(const Image *image,const double radius,
const double sigma,ExceptionInfo *exception)
{
Image
*charcoal_image,
*clone_image,
*edge_image;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
clone_image=CloneImage(image,0,0,MagickTrue,exception);
if (clone_image == (Image *) NULL)
return((Image *) NULL);
(void) SetImageType(clone_image,GrayscaleType);
edge_image=EdgeImage(clone_image,radius,exception);
clone_image=DestroyImage(clone_image);
if (edge_image == (Image *) NULL)
return((Image *) NULL);
charcoal_image=BlurImage(edge_image,radius,sigma,exception);
edge_image=DestroyImage(edge_image);
if (charcoal_image == (Image *) NULL)
return((Image *) NULL);
(void) NormalizeImage(charcoal_image);
(void) NegateImage(charcoal_image,MagickFalse);
(void) SetImageType(charcoal_image,GrayscaleType);
return(charcoal_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o l o r i z e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ColorizeImage() blends the fill color with each pixel in the image.
% A percentage blend is specified with opacity. Control the application
% of different color components by specifying a different percentage for
% each component (e.g. 90/100/10 is 90% red, 100% green, and 10% blue).
%
% The format of the ColorizeImage method is:
%
% Image *ColorizeImage(const Image *image,const char *opacity,
% const PixelPacket colorize,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o opacity: A character string indicating the level of opacity as a
% percentage.
%
% o colorize: A color value.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ColorizeImage(const Image *image,const char *opacity,
const PixelPacket colorize,ExceptionInfo *exception)
{
#define ColorizeImageTag "Colorize/Image"
CacheView
*colorize_view,
*image_view;
GeometryInfo
geometry_info;
Image
*colorize_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
pixel;
MagickStatusType
flags;
ssize_t
y;
/*
Allocate colorized image.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
colorize_image=CloneImage(image,image->columns,image->rows,MagickTrue,
exception);
if (colorize_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(colorize_image,DirectClass) == MagickFalse)
{
InheritException(exception,&colorize_image->exception);
colorize_image=DestroyImage(colorize_image);
return((Image *) NULL);
}
if (opacity == (const char *) NULL)
return(colorize_image);
/*
Determine RGB values of the pen color.
*/
flags=ParseGeometry(opacity,&geometry_info);
pixel.red=geometry_info.rho;
pixel.green=geometry_info.rho;
pixel.blue=geometry_info.rho;
pixel.opacity=(MagickRealType) OpaqueOpacity;
if ((flags & SigmaValue) != 0)
pixel.green=geometry_info.sigma;
if ((flags & XiValue) != 0)
pixel.blue=geometry_info.xi;
if ((flags & PsiValue) != 0)
pixel.opacity=geometry_info.psi;
/*
Colorize DirectClass image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
colorize_view=AcquireCacheView(colorize_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
register const PixelPacket
*restrict p;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=QueueCacheViewAuthenticPixels(colorize_view,0,y,colorize_image->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
SetRedPixelComponent(q,((GetRedPixelComponent(p)*(100.0-pixel.red)+
colorize.red*pixel.red)/100.0));
SetGreenPixelComponent(q,((GetGreenPixelComponent(p)*(100.0-pixel.green)+
colorize.green*pixel.green)/100.0));
SetBluePixelComponent(q,((GetBluePixelComponent(p)*(100.0-pixel.blue)+
colorize.blue*pixel.blue)/100.0));
SetOpacityPixelComponent(q,((GetOpacityPixelComponent(p)*(100.0-
pixel.opacity)+colorize.opacity*pixel.opacity)/100.0));
p++;
q++;
}
sync=SyncCacheViewAuthenticPixels(colorize_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ColorizeImage)
#endif
proceed=SetImageProgress(image,ColorizeImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
colorize_view=DestroyCacheView(colorize_view);
if (status == MagickFalse)
colorize_image=DestroyImage(colorize_image);
return(colorize_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o l o r M a t r i x I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ColorMatrixImage() applies color transformation to an image. This method
% permits saturation changes, hue rotation, luminance to alpha, and various
% other effects. Although variable-sized transformation matrices can be used,
% typically one uses a 5x5 matrix for an RGBA image and a 6x6 for CMYKA
% (or RGBA with offsets). The matrix is similar to those used by Adobe Flash
% except offsets are in column 6 rather than 5 (in support of CMYKA images)
% and offsets are normalized (divide Flash offset by 255).
%
% The format of the ColorMatrixImage method is:
%
% Image *ColorMatrixImage(const Image *image,
% const KernelInfo *color_matrix,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o color_matrix: the color matrix.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ColorMatrixImage(const Image *image,
const KernelInfo *color_matrix,ExceptionInfo *exception)
{
#define ColorMatrixImageTag "ColorMatrix/Image"
CacheView
*color_view,
*image_view;
double
ColorMatrix[6][6] =
{
{ 1.0, 0.0, 0.0, 0.0, 0.0, 0.0 },
{ 0.0, 1.0, 0.0, 0.0, 0.0, 0.0 },
{ 0.0, 0.0, 1.0, 0.0, 0.0, 0.0 },
{ 0.0, 0.0, 0.0, 1.0, 0.0, 0.0 },
{ 0.0, 0.0, 0.0, 0.0, 1.0, 0.0 },
{ 0.0, 0.0, 0.0, 0.0, 0.0, 1.0 }
};
Image
*color_image;
MagickBooleanType
status;
MagickOffsetType
progress;
register ssize_t
i;
ssize_t
u,
v,
y;
/*
Create color matrix.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
i=0;
for (v=0; v < (ssize_t) color_matrix->height; v++)
for (u=0; u < (ssize_t) color_matrix->width; u++)
{
if ((v < 6) && (u < 6))
ColorMatrix[v][u]=color_matrix->values[i];
i++;
}
/*
Initialize color image.
*/
color_image=CloneImage(image,0,0,MagickTrue,exception);
if (color_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(color_image,DirectClass) == MagickFalse)
{
InheritException(exception,&color_image->exception);
color_image=DestroyImage(color_image);
return((Image *) NULL);
}
if (image->debug != MagickFalse)
{
char
format[MaxTextExtent],
*message;
(void) LogMagickEvent(TransformEvent,GetMagickModule(),
" ColorMatrix image with color matrix:");
message=AcquireString("");
for (v=0; v < 6; v++)
{
*message='\0';
(void) FormatLocaleString(format,MaxTextExtent,"%.20g: ",(double) v);
(void) ConcatenateString(&message,format);
for (u=0; u < 6; u++)
{
(void) FormatLocaleString(format,MaxTextExtent,"%+f ",
ColorMatrix[v][u]);
(void) ConcatenateString(&message,format);
}
(void) LogMagickEvent(TransformEvent,GetMagickModule(),"%s",message);
}
message=DestroyString(message);
}
/*
ColorMatrix image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
color_view=AcquireCacheView(color_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickRealType
pixel;
register const IndexPacket
*restrict indexes;
register const PixelPacket
*restrict p;
register ssize_t
x;
register IndexPacket
*restrict color_indexes;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=GetCacheViewAuthenticPixels(color_view,0,y,color_image->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
color_indexes=GetCacheViewAuthenticIndexQueue(color_view);
for (x=0; x < (ssize_t) image->columns; x++)
{
register ssize_t
v;
size_t
height;
height=color_matrix->height > 6 ? 6UL : color_matrix->height;
for (v=0; v < (ssize_t) height; v++)
{
pixel=ColorMatrix[v][0]*GetRedPixelComponent(p)+ColorMatrix[v][1]*
GetGreenPixelComponent(p)+ColorMatrix[v][2]*GetBluePixelComponent(p);
if (image->matte != MagickFalse)
pixel+=ColorMatrix[v][3]*(QuantumRange-GetOpacityPixelComponent(p));
if (image->colorspace == CMYKColorspace)
pixel+=ColorMatrix[v][4]*GetIndexPixelComponent(indexes+x);
pixel+=QuantumRange*ColorMatrix[v][5];
switch (v)
{
case 0: SetRedPixelComponent(q,ClampToQuantum(pixel)); break;
case 1: SetGreenPixelComponent(q,ClampToQuantum(pixel)); break;
case 2: SetBluePixelComponent(q,ClampToQuantum(pixel)); break;
case 3:
{
if (image->matte != MagickFalse)
SetAlphaPixelComponent(q,ClampToQuantum(pixel));
break;
}
case 4:
{
if (image->colorspace == CMYKColorspace)
SetIndexPixelComponent(color_indexes+x,ClampToQuantum(pixel));
break;
}
}
}
p++;
q++;
}
if (SyncCacheViewAuthenticPixels(color_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ColorMatrixImage)
#endif
proceed=SetImageProgress(image,ColorMatrixImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
color_view=DestroyCacheView(color_view);
image_view=DestroyCacheView(image_view);
if (status == MagickFalse)
color_image=DestroyImage(color_image);
return(color_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ D e s t r o y F x I n f o %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DestroyFxInfo() deallocates memory associated with an FxInfo structure.
%
% The format of the DestroyFxInfo method is:
%
% ImageInfo *DestroyFxInfo(ImageInfo *fx_info)
%
% A description of each parameter follows:
%
% o fx_info: the fx info.
%
*/
MagickExport FxInfo *DestroyFxInfo(FxInfo *fx_info)
{
register ssize_t
i;
fx_info->exception=DestroyExceptionInfo(fx_info->exception);
fx_info->expression=DestroyString(fx_info->expression);
fx_info->symbols=DestroySplayTree(fx_info->symbols);
fx_info->colors=DestroySplayTree(fx_info->colors);
for (i=(ssize_t) GetImageListLength(fx_info->images)-1; i >= 0; i--)
fx_info->view[i]=DestroyCacheView(fx_info->view[i]);
fx_info->view=(CacheView **) RelinquishMagickMemory(fx_info->view);
fx_info->random_info=DestroyRandomInfo(fx_info->random_info);
fx_info=(FxInfo *) RelinquishMagickMemory(fx_info);
return(fx_info);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ F x E v a l u a t e C h a n n e l E x p r e s s i o n %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% FxEvaluateChannelExpression() evaluates an expression and returns the
% results.
%
% The format of the FxEvaluateExpression method is:
%
% MagickRealType FxEvaluateChannelExpression(FxInfo *fx_info,
% const ChannelType channel,const ssize_t x,const ssize_t y,
% MagickRealType *alpha,Exceptioninfo *exception)
% MagickRealType FxEvaluateExpression(FxInfo *fx_info,
% MagickRealType *alpha,Exceptioninfo *exception)
%
% A description of each parameter follows:
%
% o fx_info: the fx info.
%
% o channel: the channel.
%
% o x,y: the pixel position.
%
% o alpha: the result.
%
% o exception: return any errors or warnings in this structure.
%
*/
static inline double MagickMax(const double x,const double y)
{
if (x > y)
return(x);
return(y);
}
static inline double MagickMin(const double x,const double y)
{
if (x < y)
return(x);
return(y);
}
static MagickRealType FxChannelStatistics(FxInfo *fx_info,const Image *image,
ChannelType channel,const char *symbol,ExceptionInfo *exception)
{
char
key[MaxTextExtent],
statistic[MaxTextExtent];
const char
*value;
register const char
*p;
for (p=symbol; (*p != '.') && (*p != '\0'); p++) ;
if (*p == '.')
switch (*++p) /* e.g. depth.r */
{
case 'r': channel=RedChannel; break;
case 'g': channel=GreenChannel; break;
case 'b': channel=BlueChannel; break;
case 'c': channel=CyanChannel; break;
case 'm': channel=MagentaChannel; break;
case 'y': channel=YellowChannel; break;
case 'k': channel=BlackChannel; break;
default: break;
}
(void) FormatLocaleString(key,MaxTextExtent,"%p.%.20g.%s",(void *) image,
(double) channel,symbol);
value=(const char *) GetValueFromSplayTree(fx_info->symbols,key);
if (value != (const char *) NULL)
return(QuantumScale*InterpretLocaleValue(value,(char **) NULL));
(void) DeleteNodeFromSplayTree(fx_info->symbols,key);
if (LocaleNCompare(symbol,"depth",5) == 0)
{
size_t
depth;
depth=GetImageChannelDepth(image,channel,exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%.20g",(double)
depth);
}
if (LocaleNCompare(symbol,"kurtosis",8) == 0)
{
double
kurtosis,
skewness;
(void) GetImageChannelKurtosis(image,channel,&kurtosis,&skewness,
exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",kurtosis);
}
if (LocaleNCompare(symbol,"maxima",6) == 0)
{
double
maxima,
minima;
(void) GetImageChannelRange(image,channel,&minima,&maxima,exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",maxima);
}
if (LocaleNCompare(symbol,"mean",4) == 0)
{
double
mean,
standard_deviation;
(void) GetImageChannelMean(image,channel,&mean,&standard_deviation,
exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",mean);
}
if (LocaleNCompare(symbol,"minima",6) == 0)
{
double
maxima,
minima;
(void) GetImageChannelRange(image,channel,&minima,&maxima,exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",minima);
}
if (LocaleNCompare(symbol,"skewness",8) == 0)
{
double
kurtosis,
skewness;
(void) GetImageChannelKurtosis(image,channel,&kurtosis,&skewness,
exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",skewness);
}
if (LocaleNCompare(symbol,"standard_deviation",18) == 0)
{
double
mean,
standard_deviation;
(void) GetImageChannelMean(image,channel,&mean,&standard_deviation,
exception);
(void) FormatLocaleString(statistic,MaxTextExtent,"%g",
standard_deviation);
}
(void) AddValueToSplayTree(fx_info->symbols,ConstantString(key),
ConstantString(statistic));
return(QuantumScale*InterpretLocaleValue(statistic,(char **) NULL));
}
static MagickRealType
FxEvaluateSubexpression(FxInfo *,const ChannelType,const ssize_t,
const ssize_t,const char *,MagickRealType *,ExceptionInfo *);
static inline MagickRealType FxMax(FxInfo *fx_info,const ChannelType channel,
const ssize_t x,const ssize_t y,const char *expression,
ExceptionInfo *exception)
{
MagickRealType
alpha,
beta;
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression,&beta,exception);
return((MagickRealType) MagickMax((double) alpha,(double) beta));
}
static inline MagickRealType FxMin(FxInfo *fx_info,ChannelType channel,
const ssize_t x,const ssize_t y,const char *expression,
ExceptionInfo *exception)
{
MagickRealType
alpha,
beta;
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression,&beta,exception);
return((MagickRealType) MagickMin((double) alpha,(double) beta));
}
static inline const char *FxSubexpression(const char *expression,
ExceptionInfo *exception)
{
const char
*subexpression;
register ssize_t
level;
level=0;
subexpression=expression;
while ((*subexpression != '\0') &&
((level != 1) || (strchr(")",(int) *subexpression) == (char *) NULL)))
{
if (strchr("(",(int) *subexpression) != (char *) NULL)
level++;
else
if (strchr(")",(int) *subexpression) != (char *) NULL)
level--;
subexpression++;
}
if (*subexpression == '\0')
(void) ThrowMagickException(exception,GetMagickModule(),OptionError,
"UnbalancedParenthesis","`%s'",expression);
return(subexpression);
}
static MagickRealType FxGetSymbol(FxInfo *fx_info,const ChannelType channel,
const ssize_t x,const ssize_t y,const char *expression,
ExceptionInfo *exception)
{
char
*q,
subexpression[MaxTextExtent],
symbol[MaxTextExtent];
const char
*p,
*value;
Image
*image;
MagickPixelPacket
pixel;
MagickRealType
alpha,
beta;
PointInfo
point;
register ssize_t
i;
size_t
length;
size_t
level;
p=expression;
i=GetImageIndexInList(fx_info->images);
level=0;
point.x=(double) x;
point.y=(double) y;
if (isalpha((int) *(p+1)) == 0)
{
if (strchr("suv",(int) *p) != (char *) NULL)
{
switch (*p)
{
case 's':
default:
{
i=GetImageIndexInList(fx_info->images);
break;
}
case 'u': i=0; break;
case 'v': i=1; break;
}
p++;
if (*p == '[')
{
level++;
q=subexpression;
for (p++; *p != '\0'; )
{
if (*p == '[')
level++;
else
if (*p == ']')
{
level--;
if (level == 0)
break;
}
*q++=(*p++);
}
*q='\0';
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,subexpression,
&beta,exception);
i=(ssize_t) (alpha+0.5);
p++;
}
if (*p == '.')
p++;
}
if ((isalpha((int) *(p+1)) == 0) && (*p == 'p'))
{
p++;
if (*p == '{')
{
level++;
q=subexpression;
for (p++; *p != '\0'; )
{
if (*p == '{')
level++;
else
if (*p == '}')
{
level--;
if (level == 0)
break;
}
*q++=(*p++);
}
*q='\0';
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,subexpression,
&beta,exception);
point.x=alpha;
point.y=beta;
p++;
}
else
if (*p == '[')
{
level++;
q=subexpression;
for (p++; *p != '\0'; )
{
if (*p == '[')
level++;
else
if (*p == ']')
{
level--;
if (level == 0)
break;
}
*q++=(*p++);
}
*q='\0';
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,subexpression,
&beta,exception);
point.x+=alpha;
point.y+=beta;
p++;
}
if (*p == '.')
p++;
}
}
length=GetImageListLength(fx_info->images);
while (i < 0)
i+=(ssize_t) length;
i%=length;
image=GetImageFromList(fx_info->images,i);
if (image == (Image *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),OptionError,
"NoSuchImage","`%s'",expression);
return(0.0);
}
GetMagickPixelPacket(image,&pixel);
(void) InterpolateMagickPixelPacket(image,fx_info->view[i],image->interpolate,
point.x,point.y,&pixel,exception);
if ((strlen(p) > 2) &&
(LocaleCompare(p,"intensity") != 0) &&
(LocaleCompare(p,"luminance") != 0) &&
(LocaleCompare(p,"hue") != 0) &&
(LocaleCompare(p,"saturation") != 0) &&
(LocaleCompare(p,"lightness") != 0))
{
char
name[MaxTextExtent];
(void) CopyMagickString(name,p,MaxTextExtent);
for (q=name+(strlen(name)-1); q > name; q--)
{
if (*q == ')')
break;
if (*q == '.')
{
*q='\0';
break;
}
}
if ((strlen(name) > 2) &&
(GetValueFromSplayTree(fx_info->symbols,name) == (const char *) NULL))
{
MagickPixelPacket
*color;
color=(MagickPixelPacket *) GetValueFromSplayTree(fx_info->colors,
name);
if (color != (MagickPixelPacket *) NULL)
{
pixel=(*color);
p+=strlen(name);
}
else
if (QueryMagickColor(name,&pixel,fx_info->exception) != MagickFalse)
{
(void) AddValueToSplayTree(fx_info->colors,ConstantString(name),
CloneMagickPixelPacket(&pixel));
p+=strlen(name);
}
}
}
(void) CopyMagickString(symbol,p,MaxTextExtent);
StripString(symbol);
if (*symbol == '\0')
{
switch (channel)
{
case RedChannel: return(QuantumScale*pixel.red);
case GreenChannel: return(QuantumScale*pixel.green);
case BlueChannel: return(QuantumScale*pixel.blue);
case OpacityChannel:
{
MagickRealType
alpha;
if (pixel.matte == MagickFalse)
return(1.0);
alpha=(MagickRealType) (QuantumScale*GetAlphaPixelComponent(&pixel));
return(alpha);
}
case IndexChannel:
{
if (image->colorspace != CMYKColorspace)
{
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"ColorSeparatedImageRequired","`%s'",
image->filename);
return(0.0);
}
return(QuantumScale*pixel.index);
}
case DefaultChannels:
{
return(QuantumScale*MagickPixelIntensityToQuantum(&pixel));
}
default:
break;
}
(void) ThrowMagickException(exception,GetMagickModule(),OptionError,
"UnableToParseExpression","`%s'",p);
return(0.0);
}
switch (*symbol)
{
case 'A':
case 'a':
{
if (LocaleCompare(symbol,"a") == 0)
return((MagickRealType) (QuantumScale*GetAlphaPixelComponent(&pixel)));
break;
}
case 'B':
case 'b':
{
if (LocaleCompare(symbol,"b") == 0)
return(QuantumScale*pixel.blue);
break;
}
case 'C':
case 'c':
{
if (LocaleNCompare(symbol,"channel",7) == 0)
{
GeometryInfo
channel_info;
MagickStatusType
flags;
flags=ParseGeometry(symbol+7,&channel_info);
if (image->colorspace == CMYKColorspace)
switch (channel)
{
case CyanChannel:
{
if ((flags & RhoValue) == 0)
return(0.0);
return(channel_info.rho);
}
case MagentaChannel:
{
if ((flags & SigmaValue) == 0)
return(0.0);
return(channel_info.sigma);
}
case YellowChannel:
{
if ((flags & XiValue) == 0)
return(0.0);
return(channel_info.xi);
}
case BlackChannel:
{
if ((flags & PsiValue) == 0)
return(0.0);
return(channel_info.psi);
}
case OpacityChannel:
{
if ((flags & ChiValue) == 0)
return(0.0);
return(channel_info.chi);
}
default:
return(0.0);
}
switch (channel)
{
case RedChannel:
{
if ((flags & RhoValue) == 0)
return(0.0);
return(channel_info.rho);
}
case GreenChannel:
{
if ((flags & SigmaValue) == 0)
return(0.0);
return(channel_info.sigma);
}
case BlueChannel:
{
if ((flags & XiValue) == 0)
return(0.0);
return(channel_info.xi);
}
case OpacityChannel:
{
if ((flags & PsiValue) == 0)
return(0.0);
return(channel_info.psi);
}
case IndexChannel:
{
if ((flags & ChiValue) == 0)
return(0.0);
return(channel_info.chi);
}
default:
return(0.0);
}
return(0.0);
}
if (LocaleCompare(symbol,"c") == 0)
return(QuantumScale*pixel.red);
break;
}
case 'D':
case 'd':
{
if (LocaleNCompare(symbol,"depth",5) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
break;
}
case 'G':
case 'g':
{
if (LocaleCompare(symbol,"g") == 0)
return(QuantumScale*pixel.green);
break;
}
case 'K':
case 'k':
{
if (LocaleNCompare(symbol,"kurtosis",8) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
if (LocaleCompare(symbol,"k") == 0)
{
if (image->colorspace != CMYKColorspace)
{
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"ColorSeparatedImageRequired","`%s'",
image->filename);
return(0.0);
}
return(QuantumScale*pixel.index);
}
break;
}
case 'H':
case 'h':
{
if (LocaleCompare(symbol,"h") == 0)
return((MagickRealType) image->rows);
if (LocaleCompare(symbol,"hue") == 0)
{
double
hue,
lightness,
saturation;
ConvertRGBToHSL(ClampToQuantum(pixel.red),ClampToQuantum(pixel.green),
ClampToQuantum(pixel.blue),&hue,&saturation,&lightness);
return(hue);
}
break;
}
case 'I':
case 'i':
{
if ((LocaleCompare(symbol,"image.depth") == 0) ||
(LocaleCompare(symbol,"image.minima") == 0) ||
(LocaleCompare(symbol,"image.maxima") == 0) ||
(LocaleCompare(symbol,"image.mean") == 0) ||
(LocaleCompare(symbol,"image.kurtosis") == 0) ||
(LocaleCompare(symbol,"image.skewness") == 0) ||
(LocaleCompare(symbol,"image.standard_deviation") == 0))
return(FxChannelStatistics(fx_info,image,channel,symbol+6,exception));
if (LocaleCompare(symbol,"image.resolution.x") == 0)
return(image->x_resolution);
if (LocaleCompare(symbol,"image.resolution.y") == 0)
return(image->y_resolution);
if (LocaleCompare(symbol,"intensity") == 0)
return(QuantumScale*MagickPixelIntensityToQuantum(&pixel));
if (LocaleCompare(symbol,"i") == 0)
return((MagickRealType) x);
break;
}
case 'J':
case 'j':
{
if (LocaleCompare(symbol,"j") == 0)
return((MagickRealType) y);
break;
}
case 'L':
case 'l':
{
if (LocaleCompare(symbol,"lightness") == 0)
{
double
hue,
lightness,
saturation;
ConvertRGBToHSL(ClampToQuantum(pixel.red),ClampToQuantum(pixel.green),
ClampToQuantum(pixel.blue),&hue,&saturation,&lightness);
return(lightness);
}
if (LocaleCompare(symbol,"luminance") == 0)
{
double
luminence;
luminence=0.2126*pixel.red+0.7152*pixel.green+0.0722*pixel.blue;
return(QuantumScale*luminence);
}
break;
}
case 'M':
case 'm':
{
if (LocaleNCompare(symbol,"maxima",6) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
if (LocaleNCompare(symbol,"mean",4) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
if (LocaleNCompare(symbol,"minima",6) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
if (LocaleCompare(symbol,"m") == 0)
return(QuantumScale*pixel.blue);
break;
}
case 'N':
case 'n':
{
if (LocaleCompare(symbol,"n") == 0)
return((MagickRealType) GetImageListLength(fx_info->images));
break;
}
case 'O':
case 'o':
{
if (LocaleCompare(symbol,"o") == 0)
return(QuantumScale*pixel.opacity);
break;
}
case 'P':
case 'p':
{
if (LocaleCompare(symbol,"page.height") == 0)
return((MagickRealType) image->page.height);
if (LocaleCompare(symbol,"page.width") == 0)
return((MagickRealType) image->page.width);
if (LocaleCompare(symbol,"page.x") == 0)
return((MagickRealType) image->page.x);
if (LocaleCompare(symbol,"page.y") == 0)
return((MagickRealType) image->page.y);
break;
}
case 'R':
case 'r':
{
if (LocaleCompare(symbol,"resolution.x") == 0)
return(image->x_resolution);
if (LocaleCompare(symbol,"resolution.y") == 0)
return(image->y_resolution);
if (LocaleCompare(symbol,"r") == 0)
return(QuantumScale*pixel.red);
break;
}
case 'S':
case 's':
{
if (LocaleCompare(symbol,"saturation") == 0)
{
double
hue,
lightness,
saturation;
ConvertRGBToHSL(ClampToQuantum(pixel.red),ClampToQuantum(pixel.green),
ClampToQuantum(pixel.blue),&hue,&saturation,&lightness);
return(saturation);
}
if (LocaleNCompare(symbol,"skewness",8) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
if (LocaleNCompare(symbol,"standard_deviation",18) == 0)
return(FxChannelStatistics(fx_info,image,channel,symbol,exception));
break;
}
case 'T':
case 't':
{
if (LocaleCompare(symbol,"t") == 0)
return((MagickRealType) GetImageIndexInList(fx_info->images));
break;
}
case 'W':
case 'w':
{
if (LocaleCompare(symbol,"w") == 0)
return((MagickRealType) image->columns);
break;
}
case 'Y':
case 'y':
{
if (LocaleCompare(symbol,"y") == 0)
return(QuantumScale*pixel.green);
break;
}
case 'Z':
case 'z':
{
if (LocaleCompare(symbol,"z") == 0)
{
MagickRealType
depth;
depth=(MagickRealType) GetImageChannelDepth(image,channel,
fx_info->exception);
return(depth);
}
break;
}
default:
break;
}
value=(const char *) GetValueFromSplayTree(fx_info->symbols,symbol);
if (value != (const char *) NULL)
return((MagickRealType) InterpretLocaleValue(value,(char **) NULL));
(void) ThrowMagickException(exception,GetMagickModule(),OptionError,
"UnableToParseExpression","`%s'",symbol);
return(0.0);
}
static const char *FxOperatorPrecedence(const char *expression,
ExceptionInfo *exception)
{
typedef enum
{
UndefinedPrecedence,
NullPrecedence,
BitwiseComplementPrecedence,
ExponentPrecedence,
ExponentialNotationPrecedence,
MultiplyPrecedence,
AdditionPrecedence,
ShiftPrecedence,
RelationalPrecedence,
EquivalencyPrecedence,
BitwiseAndPrecedence,
BitwiseOrPrecedence,
LogicalAndPrecedence,
LogicalOrPrecedence,
TernaryPrecedence,
AssignmentPrecedence,
CommaPrecedence,
SeparatorPrecedence
} FxPrecedence;
FxPrecedence
precedence,
target;
register const char
*subexpression;
register int
c;
size_t
level;
c=0;
level=0;
subexpression=(const char *) NULL;
target=NullPrecedence;
while (*expression != '\0')
{
precedence=UndefinedPrecedence;
if ((isspace((int) ((char) *expression)) != 0) || (c == (int) '@'))
{
expression++;
continue;
}
switch (*expression)
{
case 'A':
case 'a':
{
if (LocaleNCompare(expression,"atan2",5) == 0)
{
expression+=5;
break;
}
break;
}
case 'J':
case 'j':
{
if ((LocaleNCompare(expression,"j0",2) == 0) ||
(LocaleNCompare(expression,"j1",2) == 0))
{
expression+=2;
break;
}
break;
}
case '#':
{
while (isxdigit((int) ((unsigned char) *(expression+1))) != 0)
expression++;
break;
}
default:
break;
}
if ((c == (int) '{') || (c == (int) '['))
level++;
else
if ((c == (int) '}') || (c == (int) ']'))
level--;
if (level == 0)
switch ((unsigned char) *expression)
{
case '~':
case '!':
{
precedence=BitwiseComplementPrecedence;
break;
}
case '^':
case '@':
{
precedence=ExponentPrecedence;
break;
}
default:
{
if (((c != 0) && ((isdigit((int) ((char) c)) != 0) ||
(strchr(")",c) != (char *) NULL))) &&
(((islower((int) ((char) *expression)) != 0) ||
(strchr("(",(int) *expression) != (char *) NULL)) ||
((isdigit((int) ((char) c)) == 0) &&
(isdigit((int) ((char) *expression)) != 0))) &&
(strchr("xy",(int) *expression) == (char *) NULL))
precedence=MultiplyPrecedence;
break;
}
case '*':
case '/':
case '%':
{
precedence=MultiplyPrecedence;
break;
}
case '+':
case '-':
{
if ((strchr("(+-/*%:&^|<>~,",c) == (char *) NULL) ||
(isalpha(c) != 0))
precedence=AdditionPrecedence;
break;
}
case LeftShiftOperator:
case RightShiftOperator:
{
precedence=ShiftPrecedence;
break;
}
case '<':
case LessThanEqualOperator:
case GreaterThanEqualOperator:
case '>':
{
precedence=RelationalPrecedence;
break;
}
case EqualOperator:
case NotEqualOperator:
{
precedence=EquivalencyPrecedence;
break;
}
case '&':
{
precedence=BitwiseAndPrecedence;
break;
}
case '|':
{
precedence=BitwiseOrPrecedence;
break;
}
case LogicalAndOperator:
{
precedence=LogicalAndPrecedence;
break;
}
case LogicalOrOperator:
{
precedence=LogicalOrPrecedence;
break;
}
case ExponentialNotation:
{
precedence=ExponentialNotationPrecedence;
break;
}
case ':':
case '?':
{
precedence=TernaryPrecedence;
break;
}
case '=':
{
precedence=AssignmentPrecedence;
break;
}
case ',':
{
precedence=CommaPrecedence;
break;
}
case ';':
{
precedence=SeparatorPrecedence;
break;
}
}
if ((precedence == BitwiseComplementPrecedence) ||
(precedence == TernaryPrecedence) ||
(precedence == AssignmentPrecedence))
{
if (precedence > target)
{
/*
Right-to-left associativity.
*/
target=precedence;
subexpression=expression;
}
}
else
if (precedence >= target)
{
/*
Left-to-right associativity.
*/
target=precedence;
subexpression=expression;
}
if (strchr("(",(int) *expression) != (char *) NULL)
expression=FxSubexpression(expression,exception);
c=(int) (*expression++);
}
return(subexpression);
}
static MagickRealType FxEvaluateSubexpression(FxInfo *fx_info,
const ChannelType channel,const ssize_t x,const ssize_t y,
const char *expression,MagickRealType *beta,ExceptionInfo *exception)
{
char
*q,
subexpression[MaxTextExtent];
MagickRealType
alpha,
gamma;
register const char
*p;
*beta=0.0;
if (exception->severity != UndefinedException)
return(0.0);
while (isspace((int) *expression) != 0)
expression++;
if (*expression == '\0')
{
(void) ThrowMagickException(exception,GetMagickModule(),OptionError,
"MissingExpression","`%s'",expression);
return(0.0);
}
*subexpression='\0';
p=FxOperatorPrecedence(expression,exception);
if (p != (const char *) NULL)
{
(void) CopyMagickString(subexpression,expression,(size_t)
(p-expression+1));
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,subexpression,beta,
exception);
switch ((unsigned char) *p)
{
case '~':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(MagickRealType) (~(size_t) *beta);
return(*beta);
}
case '!':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(*beta == 0.0 ? 1.0 : 0.0);
}
case '^':
{
*beta=pow((double) alpha,(double) FxEvaluateSubexpression(fx_info,
channel,x,y,++p,beta,exception));
return(*beta);
}
case '*':
case ExponentialNotation:
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha*(*beta));
}
case '/':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
if (*beta == 0.0)
{
if (exception->severity == UndefinedException)
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"DivideByZero","`%s'",expression);
return(0.0);
}
return(alpha/(*beta));
}
case '%':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=fabs(floor(((double) *beta)+0.5));
if (*beta == 0.0)
{
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"DivideByZero","`%s'",expression);
return(0.0);
}
return(fmod((double) alpha,(double) *beta));
}
case '+':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha+(*beta));
}
case '-':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha-(*beta));
}
case LeftShiftOperator:
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(MagickRealType) ((size_t) (alpha+0.5) << (size_t)
(gamma+0.5));
return(*beta);
}
case RightShiftOperator:
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(MagickRealType) ((size_t) (alpha+0.5) >> (size_t)
(gamma+0.5));
return(*beta);
}
case '<':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha < *beta ? 1.0 : 0.0);
}
case LessThanEqualOperator:
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha <= *beta ? 1.0 : 0.0);
}
case '>':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha > *beta ? 1.0 : 0.0);
}
case GreaterThanEqualOperator:
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha >= *beta ? 1.0 : 0.0);
}
case EqualOperator:
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(fabs(alpha-(*beta)) <= MagickEpsilon ? 1.0 : 0.0);
}
case NotEqualOperator:
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(fabs(alpha-(*beta)) > MagickEpsilon ? 1.0 : 0.0);
}
case '&':
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(MagickRealType) ((size_t) (alpha+0.5) & (size_t)
(gamma+0.5));
return(*beta);
}
case '|':
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(MagickRealType) ((size_t) (alpha+0.5) | (size_t)
(gamma+0.5));
return(*beta);
}
case LogicalAndOperator:
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(alpha > 0.0) && (gamma > 0.0) ? 1.0 : 0.0;
return(*beta);
}
case LogicalOrOperator:
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
*beta=(alpha > 0.0) || (gamma > 0.0) ? 1.0 : 0.0;
return(*beta);
}
case '?':
{
MagickRealType
gamma;
(void) CopyMagickString(subexpression,++p,MaxTextExtent);
q=subexpression;
p=StringToken(":",&q);
if (q == (char *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"UnableToParseExpression","`%s'",subexpression);
return(0.0);
}
if (fabs((double) alpha) > MagickEpsilon)
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,p,beta,exception);
else
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,q,beta,exception);
return(gamma);
}
case '=':
{
char
numeric[MaxTextExtent];
q=subexpression;
while (isalpha((int) ((unsigned char) *q)) != 0)
q++;
if (*q != '\0')
{
(void) ThrowMagickException(exception,GetMagickModule(),
OptionError,"UnableToParseExpression","`%s'",subexpression);
return(0.0);
}
ClearMagickException(exception);
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
(void) FormatLocaleString(numeric,MaxTextExtent,"%g",(double)
*beta);
(void) DeleteNodeFromSplayTree(fx_info->symbols,subexpression);
(void) AddValueToSplayTree(fx_info->symbols,ConstantString(
subexpression),ConstantString(numeric));
return(*beta);
}
case ',':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(alpha);
}
case ';':
{
*beta=FxEvaluateSubexpression(fx_info,channel,x,y,++p,beta,exception);
return(*beta);
}
default:
{
gamma=alpha*FxEvaluateSubexpression(fx_info,channel,x,y,p,beta,
exception);
return(gamma);
}
}
}
if (strchr("(",(int) *expression) != (char *) NULL)
{
(void) CopyMagickString(subexpression,expression+1,MaxTextExtent);
subexpression[strlen(subexpression)-1]='\0';
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,subexpression,beta,
exception);
return(gamma);
}
switch (*expression)
{
case '+':
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,expression+1,beta,
exception);
return(1.0*gamma);
}
case '-':
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,expression+1,beta,
exception);
return(-1.0*gamma);
}
case '~':
{
gamma=FxEvaluateSubexpression(fx_info,channel,x,y,expression+1,beta,
exception);
return((MagickRealType) (~(size_t) (gamma+0.5)));
}
case 'A':
case 'a':
{
if (LocaleNCompare(expression,"abs",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) fabs((double) alpha));
}
if (LocaleNCompare(expression,"acos",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) acos((double) alpha));
}
#if defined(MAGICKCORE_HAVE_J1)
if (LocaleNCompare(expression,"airy",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
if (alpha == 0.0)
return(1.0);
gamma=2.0*j1((double) (MagickPI*alpha))/(MagickPI*alpha);
return(gamma*gamma);
}
#endif
if (LocaleNCompare(expression,"asin",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) asin((double) alpha));
}
if (LocaleNCompare(expression,"alt",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return(((ssize_t) alpha) & 0x01 ? -1.0 : 1.0);
}
if (LocaleNCompare(expression,"atan2",5) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
return((MagickRealType) atan2((double) alpha,(double) *beta));
}
if (LocaleNCompare(expression,"atan",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) atan((double) alpha));
}
if (LocaleCompare(expression,"a") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'B':
case 'b':
{
if (LocaleCompare(expression,"b") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'C':
case 'c':
{
if (LocaleNCompare(expression,"ceil",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) ceil((double) alpha));
}
if (LocaleNCompare(expression,"cosh",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) cosh((double) alpha));
}
if (LocaleNCompare(expression,"cos",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) cos((double) alpha));
}
if (LocaleCompare(expression,"c") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'D':
case 'd':
{
if (LocaleNCompare(expression,"debug",5) == 0)
{
const char
*type;
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
if (fx_info->images->colorspace == CMYKColorspace)
switch (channel)
{
case CyanChannel: type="cyan"; break;
case MagentaChannel: type="magenta"; break;
case YellowChannel: type="yellow"; break;
case OpacityChannel: type="opacity"; break;
case BlackChannel: type="black"; break;
default: type="unknown"; break;
}
else
switch (channel)
{
case RedChannel: type="red"; break;
case GreenChannel: type="green"; break;
case BlueChannel: type="blue"; break;
case OpacityChannel: type="opacity"; break;
default: type="unknown"; break;
}
(void) CopyMagickString(subexpression,expression+6,MaxTextExtent);
if (strlen(subexpression) > 1)
subexpression[strlen(subexpression)-1]='\0';
if (fx_info->file != (FILE *) NULL)
(void) FormatLocaleFile(fx_info->file,
"%s[%.20g,%.20g].%s: %s=%.*g\n",fx_info->images->filename,
(double) x,(double) y,type,subexpression,GetMagickPrecision(),
(double) alpha);
return(0.0);
}
break;
}
case 'E':
case 'e':
{
if (LocaleCompare(expression,"epsilon") == 0)
return((MagickRealType) MagickEpsilon);
if (LocaleNCompare(expression,"exp",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) exp((double) alpha));
}
if (LocaleCompare(expression,"e") == 0)
return((MagickRealType) 2.7182818284590452354);
break;
}
case 'F':
case 'f':
{
if (LocaleNCompare(expression,"floor",5) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
return((MagickRealType) floor((double) alpha));
}
break;
}
case 'G':
case 'g':
{
if (LocaleCompare(expression,"g") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'H':
case 'h':
{
if (LocaleCompare(expression,"h") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
if (LocaleCompare(expression,"hue") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
if (LocaleNCompare(expression,"hypot",5) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
return((MagickRealType) hypot((double) alpha,(double) *beta));
}
break;
}
case 'K':
case 'k':
{
if (LocaleCompare(expression,"k") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'I':
case 'i':
{
if (LocaleCompare(expression,"intensity") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
if (LocaleNCompare(expression,"int",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) floor(alpha));
}
if (LocaleCompare(expression,"i") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'J':
case 'j':
{
if (LocaleCompare(expression,"j") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
#if defined(MAGICKCORE_HAVE_J0)
if (LocaleNCompare(expression,"j0",2) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+2,beta,
exception);
return((MagickRealType) j0((double) alpha));
}
#endif
#if defined(MAGICKCORE_HAVE_J1)
if (LocaleNCompare(expression,"j1",2) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+2,beta,
exception);
return((MagickRealType) j1((double) alpha));
}
#endif
#if defined(MAGICKCORE_HAVE_J1)
if (LocaleNCompare(expression,"jinc",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
if (alpha == 0.0)
return(1.0);
gamma=(MagickRealType) (2.0*j1((double) (MagickPI*alpha))/
(MagickPI*alpha));
return(gamma);
}
#endif
break;
}
case 'L':
case 'l':
{
if (LocaleNCompare(expression,"ln",2) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+2,beta,
exception);
return((MagickRealType) log((double) alpha));
}
if (LocaleNCompare(expression,"logtwo",6) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+6,beta,
exception);
return((MagickRealType) log10((double) alpha))/log10(2.0);
}
if (LocaleNCompare(expression,"log",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) log10((double) alpha));
}
if (LocaleCompare(expression,"lightness") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'M':
case 'm':
{
if (LocaleCompare(expression,"MaxRGB") == 0)
return((MagickRealType) QuantumRange);
if (LocaleNCompare(expression,"maxima",6) == 0)
break;
if (LocaleNCompare(expression,"max",3) == 0)
return(FxMax(fx_info,channel,x,y,expression+3,exception));
if (LocaleNCompare(expression,"minima",6) == 0)
break;
if (LocaleNCompare(expression,"min",3) == 0)
return(FxMin(fx_info,channel,x,y,expression+3,exception));
if (LocaleNCompare(expression,"mod",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) fmod((double) alpha,(double) *beta));
}
if (LocaleCompare(expression,"m") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'N':
case 'n':
{
if (LocaleCompare(expression,"n") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'O':
case 'o':
{
if (LocaleCompare(expression,"Opaque") == 0)
return(1.0);
if (LocaleCompare(expression,"o") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'P':
case 'p':
{
if (LocaleCompare(expression,"pi") == 0)
return((MagickRealType) MagickPI);
if (LocaleNCompare(expression,"pow",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) pow((double) alpha,(double) *beta));
}
if (LocaleCompare(expression,"p") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'Q':
case 'q':
{
if (LocaleCompare(expression,"QuantumRange") == 0)
return((MagickRealType) QuantumRange);
if (LocaleCompare(expression,"QuantumScale") == 0)
return((MagickRealType) QuantumScale);
break;
}
case 'R':
case 'r':
{
if (LocaleNCompare(expression,"rand",4) == 0)
return((MagickRealType) GetPseudoRandomValue(fx_info->random_info));
if (LocaleNCompare(expression,"round",5) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
return((MagickRealType) floor((double) alpha+0.5));
}
if (LocaleCompare(expression,"r") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'S':
case 's':
{
if (LocaleCompare(expression,"saturation") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
if (LocaleNCompare(expression,"sign",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return(alpha < 0.0 ? -1.0 : 1.0);
}
if (LocaleNCompare(expression,"sinc",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
if (alpha == 0)
return(1.0);
gamma=(MagickRealType) (sin((double) (MagickPI*alpha))/
(MagickPI*alpha));
return(gamma);
}
if (LocaleNCompare(expression,"sinh",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) sinh((double) alpha));
}
if (LocaleNCompare(expression,"sin",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) sin((double) alpha));
}
if (LocaleNCompare(expression,"sqrt",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) sqrt((double) alpha));
}
if (LocaleCompare(expression,"s") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'T':
case 't':
{
if (LocaleNCompare(expression,"tanh",4) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+4,beta,
exception);
return((MagickRealType) tanh((double) alpha));
}
if (LocaleNCompare(expression,"tan",3) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+3,beta,
exception);
return((MagickRealType) tan((double) alpha));
}
if (LocaleCompare(expression,"Transparent") == 0)
return(0.0);
if (LocaleNCompare(expression,"trunc",5) == 0)
{
alpha=FxEvaluateSubexpression(fx_info,channel,x,y,expression+5,beta,
exception);
if (alpha >= 0.0)
return((MagickRealType) floor((double) alpha));
return((MagickRealType) ceil((double) alpha));
}
if (LocaleCompare(expression,"t") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'U':
case 'u':
{
if (LocaleCompare(expression,"u") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'V':
case 'v':
{
if (LocaleCompare(expression,"v") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'W':
case 'w':
{
if (LocaleCompare(expression,"w") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'Y':
case 'y':
{
if (LocaleCompare(expression,"y") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
case 'Z':
case 'z':
{
if (LocaleCompare(expression,"z") == 0)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
break;
}
default:
break;
}
q=(char *) expression;
alpha=InterpretLocaleValue(expression,&q);
if (q == expression)
return(FxGetSymbol(fx_info,channel,x,y,expression,exception));
return(alpha);
}
MagickExport MagickBooleanType FxEvaluateExpression(FxInfo *fx_info,
MagickRealType *alpha,ExceptionInfo *exception)
{
MagickBooleanType
status;
status=FxEvaluateChannelExpression(fx_info,GrayChannel,0,0,alpha,exception);
return(status);
}
MagickExport MagickBooleanType FxPreprocessExpression(FxInfo *fx_info,
MagickRealType *alpha,ExceptionInfo *exception)
{
FILE
*file;
MagickBooleanType
status;
file=fx_info->file;
fx_info->file=(FILE *) NULL;
status=FxEvaluateChannelExpression(fx_info,GrayChannel,0,0,alpha,exception);
fx_info->file=file;
return(status);
}
MagickExport MagickBooleanType FxEvaluateChannelExpression(FxInfo *fx_info,
const ChannelType channel,const ssize_t x,const ssize_t y,
MagickRealType *alpha,ExceptionInfo *exception)
{
MagickRealType
beta;
beta=0.0;
*alpha=FxEvaluateSubexpression(fx_info,channel,x,y,fx_info->expression,&beta,
exception);
return(exception->severity == OptionError ? MagickFalse : MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% F x I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% FxImage() applies a mathematical expression to the specified image.
%
% The format of the FxImage method is:
%
% Image *FxImage(const Image *image,const char *expression,
% ExceptionInfo *exception)
% Image *FxImageChannel(const Image *image,const ChannelType channel,
% const char *expression,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o channel: the channel.
%
% o expression: A mathematical expression.
%
% o exception: return any errors or warnings in this structure.
%
*/
static FxInfo **DestroyFxThreadSet(FxInfo **fx_info)
{
register ssize_t
i;
assert(fx_info != (FxInfo **) NULL);
for (i=0; i < (ssize_t) GetOpenMPMaximumThreads(); i++)
if (fx_info[i] != (FxInfo *) NULL)
fx_info[i]=DestroyFxInfo(fx_info[i]);
fx_info=(FxInfo **) RelinquishMagickMemory(fx_info);
return(fx_info);
}
static FxInfo **AcquireFxThreadSet(const Image *image,const char *expression,
ExceptionInfo *exception)
{
char
*fx_expression;
FxInfo
**fx_info;
MagickRealType
alpha;
register ssize_t
i;
size_t
number_threads;
number_threads=GetOpenMPMaximumThreads();
fx_info=(FxInfo **) AcquireQuantumMemory(number_threads,sizeof(*fx_info));
if (fx_info == (FxInfo **) NULL)
return((FxInfo **) NULL);
(void) ResetMagickMemory(fx_info,0,number_threads*sizeof(*fx_info));
if (*expression != '@')
fx_expression=ConstantString(expression);
else
fx_expression=FileToString(expression+1,~0,exception);
for (i=0; i < (ssize_t) number_threads; i++)
{
fx_info[i]=AcquireFxInfo(image,fx_expression);
if (fx_info[i] == (FxInfo *) NULL)
return(DestroyFxThreadSet(fx_info));
(void) FxPreprocessExpression(fx_info[i],&alpha,fx_info[i]->exception);
}
fx_expression=DestroyString(fx_expression);
return(fx_info);
}
MagickExport Image *FxImage(const Image *image,const char *expression,
ExceptionInfo *exception)
{
Image
*fx_image;
fx_image=FxImageChannel(image,GrayChannel,expression,exception);
return(fx_image);
}
MagickExport Image *FxImageChannel(const Image *image,const ChannelType channel,
const char *expression,ExceptionInfo *exception)
{
#define FxImageTag "Fx/Image"
CacheView
*fx_view;
FxInfo
**restrict fx_info;
Image
*fx_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickRealType
alpha;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
fx_image=CloneImage(image,0,0,MagickTrue,exception);
if (fx_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(fx_image,DirectClass) == MagickFalse)
{
InheritException(exception,&fx_image->exception);
fx_image=DestroyImage(fx_image);
return((Image *) NULL);
}
fx_info=AcquireFxThreadSet(image,expression,exception);
if (fx_info == (FxInfo **) NULL)
{
fx_image=DestroyImage(fx_image);
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
}
status=FxPreprocessExpression(fx_info[0],&alpha,exception);
if (status == MagickFalse)
{
fx_image=DestroyImage(fx_image);
fx_info=DestroyFxThreadSet(fx_info);
return((Image *) NULL);
}
/*
Fx image.
*/
status=MagickTrue;
progress=0;
fx_view=AcquireCacheView(fx_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) fx_image->rows; y++)
{
const int
id = GetOpenMPThreadId();
MagickRealType
alpha;
register IndexPacket
*restrict fx_indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(fx_view,0,y,fx_image->columns,1,exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
fx_indexes=GetCacheViewAuthenticIndexQueue(fx_view);
alpha=0.0;
for (x=0; x < (ssize_t) fx_image->columns; x++)
{
if ((channel & RedChannel) != 0)
{
(void) FxEvaluateChannelExpression(fx_info[id],RedChannel,x,y,
&alpha,exception);
SetRedPixelComponent(q,ClampToQuantum((MagickRealType) QuantumRange*
alpha));
}
if ((channel & GreenChannel) != 0)
{
(void) FxEvaluateChannelExpression(fx_info[id],GreenChannel,x,y,
&alpha,exception);
SetGreenPixelComponent(q,ClampToQuantum((MagickRealType) QuantumRange*
alpha));
}
if ((channel & BlueChannel) != 0)
{
(void) FxEvaluateChannelExpression(fx_info[id],BlueChannel,x,y,
&alpha,exception);
SetBluePixelComponent(q,ClampToQuantum((MagickRealType) QuantumRange*
alpha));
}
if ((channel & OpacityChannel) != 0)
{
(void) FxEvaluateChannelExpression(fx_info[id],OpacityChannel,x,y,
&alpha,exception);
if (image->matte == MagickFalse)
SetOpacityPixelComponent(q,ClampToQuantum((MagickRealType)
QuantumRange*alpha));
else
SetOpacityPixelComponent(q,ClampToQuantum((MagickRealType)
(QuantumRange-QuantumRange*alpha)));
}
if (((channel & IndexChannel) != 0) &&
(fx_image->colorspace == CMYKColorspace))
{
(void) FxEvaluateChannelExpression(fx_info[id],IndexChannel,x,y,
&alpha,exception);
SetIndexPixelComponent(fx_indexes+x,ClampToQuantum((MagickRealType)
QuantumRange*alpha));
}
q++;
}
if (SyncCacheViewAuthenticPixels(fx_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_FxImageChannel)
#endif
proceed=SetImageProgress(image,FxImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
fx_view=DestroyCacheView(fx_view);
fx_info=DestroyFxThreadSet(fx_info);
if (status == MagickFalse)
fx_image=DestroyImage(fx_image);
return(fx_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% I m p l o d e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ImplodeImage() creates a new image that is a copy of an existing
% one with the image pixels "implode" by the specified percentage. It
% allocates the memory necessary for the new Image structure and returns a
% pointer to the new image.
%
% The format of the ImplodeImage method is:
%
% Image *ImplodeImage(const Image *image,const double amount,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o implode_image: Method ImplodeImage returns a pointer to the image
% after it is implode. A null image is returned if there is a memory
% shortage.
%
% o image: the image.
%
% o amount: Define the extent of the implosion.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ImplodeImage(const Image *image,const double amount,
ExceptionInfo *exception)
{
#define ImplodeImageTag "Implode/Image"
CacheView
*image_view,
*implode_view;
Image
*implode_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
zero;
MagickRealType
radius;
PointInfo
center,
scale;
ssize_t
y;
/*
Initialize implode image attributes.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
implode_image=CloneImage(image,0,0,MagickTrue,exception);
if (implode_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(implode_image,DirectClass) == MagickFalse)
{
InheritException(exception,&implode_image->exception);
implode_image=DestroyImage(implode_image);
return((Image *) NULL);
}
if (implode_image->background_color.opacity != OpaqueOpacity)
implode_image->matte=MagickTrue;
/*
Compute scaling factor.
*/
scale.x=1.0;
scale.y=1.0;
center.x=0.5*image->columns;
center.y=0.5*image->rows;
radius=center.x;
if (image->columns > image->rows)
scale.y=(double) image->columns/(double) image->rows;
else
if (image->columns < image->rows)
{
scale.x=(double) image->rows/(double) image->columns;
radius=center.y;
}
/*
Implode image.
*/
status=MagickTrue;
progress=0;
GetMagickPixelPacket(implode_image,&zero);
image_view=AcquireCacheView(image);
implode_view=AcquireCacheView(implode_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickPixelPacket
pixel;
MagickRealType
distance;
PointInfo
delta;
register IndexPacket
*restrict implode_indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(implode_view,0,y,implode_image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
implode_indexes=GetCacheViewAuthenticIndexQueue(implode_view);
delta.y=scale.y*(double) (y-center.y);
pixel=zero;
for (x=0; x < (ssize_t) image->columns; x++)
{
/*
Determine if the pixel is within an ellipse.
*/
delta.x=scale.x*(double) (x-center.x);
distance=delta.x*delta.x+delta.y*delta.y;
if (distance < (radius*radius))
{
double
factor;
/*
Implode the pixel.
*/
factor=1.0;
if (distance > 0.0)
factor=pow(sin((double) (MagickPI*sqrt((double) distance)/
radius/2)),-amount);
(void) InterpolateMagickPixelPacket(image,image_view,
UndefinedInterpolatePixel,(double) (factor*delta.x/scale.x+
center.x),(double) (factor*delta.y/scale.y+center.y),&pixel,
exception);
SetPixelPacket(implode_image,&pixel,q,implode_indexes+x);
}
q++;
}
if (SyncCacheViewAuthenticPixels(implode_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ImplodeImage)
#endif
proceed=SetImageProgress(image,ImplodeImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
implode_view=DestroyCacheView(implode_view);
image_view=DestroyCacheView(image_view);
if (status == MagickFalse)
implode_image=DestroyImage(implode_image);
return(implode_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% M o r p h I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% The MorphImages() method requires a minimum of two images. The first
% image is transformed into the second by a number of intervening images
% as specified by frames.
%
% The format of the MorphImage method is:
%
% Image *MorphImages(const Image *image,const size_t number_frames,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o number_frames: Define the number of in-between image to generate.
% The more in-between frames, the smoother the morph.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *MorphImages(const Image *image,
const size_t number_frames,ExceptionInfo *exception)
{
#define MorphImageTag "Morph/Image"
Image
*morph_image,
*morph_images;
MagickBooleanType
status;
MagickOffsetType
scene;
MagickRealType
alpha,
beta;
register const Image
*next;
register ssize_t
i;
ssize_t
y;
/*
Clone first frame in sequence.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
morph_images=CloneImage(image,0,0,MagickTrue,exception);
if (morph_images == (Image *) NULL)
return((Image *) NULL);
if (GetNextImageInList(image) == (Image *) NULL)
{
/*
Morph single image.
*/
for (i=1; i < (ssize_t) number_frames; i++)
{
morph_image=CloneImage(image,0,0,MagickTrue,exception);
if (morph_image == (Image *) NULL)
{
morph_images=DestroyImageList(morph_images);
return((Image *) NULL);
}
AppendImageToList(&morph_images,morph_image);
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
proceed=SetImageProgress(image,MorphImageTag,(MagickOffsetType) i,
number_frames);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
return(GetFirstImageInList(morph_images));
}
/*
Morph image sequence.
*/
status=MagickTrue;
scene=0;
next=image;
for ( ; GetNextImageInList(next) != (Image *) NULL; next=GetNextImageInList(next))
{
for (i=0; i < (ssize_t) number_frames; i++)
{
CacheView
*image_view,
*morph_view;
beta=(MagickRealType) (i+1.0)/(MagickRealType) (number_frames+1.0);
alpha=1.0-beta;
morph_image=ResizeImage(next,(size_t) (alpha*next->columns+beta*
GetNextImageInList(next)->columns+0.5),(size_t) (alpha*
next->rows+beta*GetNextImageInList(next)->rows+0.5),
next->filter,next->blur,exception);
if (morph_image == (Image *) NULL)
{
morph_images=DestroyImageList(morph_images);
return((Image *) NULL);
}
if (SetImageStorageClass(morph_image,DirectClass) == MagickFalse)
{
InheritException(exception,&morph_image->exception);
morph_image=DestroyImage(morph_image);
return((Image *) NULL);
}
AppendImageToList(&morph_images,morph_image);
morph_images=GetLastImageInList(morph_images);
morph_image=ResizeImage(GetNextImageInList(next),morph_images->columns,
morph_images->rows,GetNextImageInList(next)->filter,
GetNextImageInList(next)->blur,exception);
if (morph_image == (Image *) NULL)
{
morph_images=DestroyImageList(morph_images);
return((Image *) NULL);
}
image_view=AcquireCacheView(morph_image);
morph_view=AcquireCacheView(morph_images);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(status)
#endif
for (y=0; y < (ssize_t) morph_images->rows; y++)
{
MagickBooleanType
sync;
register const PixelPacket
*restrict p;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,morph_image->columns,1,
exception);
q=GetCacheViewAuthenticPixels(morph_view,0,y,morph_images->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) morph_images->columns; x++)
{
SetRedPixelComponent(q,ClampToQuantum(alpha*
GetRedPixelComponent(q)+beta*GetRedPixelComponent(p)));
SetGreenPixelComponent(q,ClampToQuantum(alpha*
GetGreenPixelComponent(q)+beta*GetGreenPixelComponent(p)));
SetBluePixelComponent(q,ClampToQuantum(alpha*
GetBluePixelComponent(q)+beta*GetBluePixelComponent(p)));
SetOpacityPixelComponent(q,ClampToQuantum(alpha*
GetOpacityPixelComponent(q)+beta*GetOpacityPixelComponent(p)));
p++;
q++;
}
sync=SyncCacheViewAuthenticPixels(morph_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
morph_view=DestroyCacheView(morph_view);
image_view=DestroyCacheView(image_view);
morph_image=DestroyImage(morph_image);
}
if (i < (ssize_t) number_frames)
break;
/*
Clone last frame in sequence.
*/
morph_image=CloneImage(GetNextImageInList(next),0,0,MagickTrue,exception);
if (morph_image == (Image *) NULL)
{
morph_images=DestroyImageList(morph_images);
return((Image *) NULL);
}
AppendImageToList(&morph_images,morph_image);
morph_images=GetLastImageInList(morph_images);
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_MorphImages)
#endif
proceed=SetImageProgress(image,MorphImageTag,scene,
GetImageListLength(image));
if (proceed == MagickFalse)
status=MagickFalse;
}
scene++;
}
if (GetNextImageInList(next) != (Image *) NULL)
{
morph_images=DestroyImageList(morph_images);
return((Image *) NULL);
}
return(GetFirstImageInList(morph_images));
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P l a s m a I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PlasmaImage() initializes an image with plasma fractal values. The image
% must be initialized with a base color and the random number generator
% seeded before this method is called.
%
% The format of the PlasmaImage method is:
%
% MagickBooleanType PlasmaImage(Image *image,const SegmentInfo *segment,
% size_t attenuate,size_t depth)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o segment: Define the region to apply plasma fractals values.
%
% o attenuate: Define the plasma attenuation factor.
%
% o depth: Limit the plasma recursion depth.
%
*/
static inline Quantum PlasmaPixel(RandomInfo *random_info,
const MagickRealType pixel,const MagickRealType noise)
{
Quantum
plasma;
plasma=ClampToQuantum(pixel+noise*GetPseudoRandomValue(random_info)-
noise/2.0);
return(plasma);
}
MagickExport MagickBooleanType PlasmaImageProxy(Image *image,
CacheView *image_view,RandomInfo *random_info,const SegmentInfo *segment,
size_t attenuate,size_t depth)
{
ExceptionInfo
*exception;
MagickRealType
plasma;
PixelPacket
u,
v;
ssize_t
x,
x_mid,
y,
y_mid;
if (((segment->x2-segment->x1) == 0.0) && ((segment->y2-segment->y1) == 0.0))
return(MagickTrue);
if (depth != 0)
{
SegmentInfo
local_info;
/*
Divide the area into quadrants and recurse.
*/
depth--;
attenuate++;
x_mid=(ssize_t) ceil((segment->x1+segment->x2)/2-0.5);
y_mid=(ssize_t) ceil((segment->y1+segment->y2)/2-0.5);
local_info=(*segment);
local_info.x2=(double) x_mid;
local_info.y2=(double) y_mid;
(void) PlasmaImageProxy(image,image_view,random_info,&local_info,
attenuate,depth);
local_info=(*segment);
local_info.y1=(double) y_mid;
local_info.x2=(double) x_mid;
(void) PlasmaImageProxy(image,image_view,random_info,&local_info,
attenuate,depth);
local_info=(*segment);
local_info.x1=(double) x_mid;
local_info.y2=(double) y_mid;
(void) PlasmaImageProxy(image,image_view,random_info,&local_info,
attenuate,depth);
local_info=(*segment);
local_info.x1=(double) x_mid;
local_info.y1=(double) y_mid;
return(PlasmaImageProxy(image,image_view,random_info,&local_info,
attenuate,depth));
}
x_mid=(ssize_t) ceil((segment->x1+segment->x2)/2-0.5);
y_mid=(ssize_t) ceil((segment->y1+segment->y2)/2-0.5);
if ((segment->x1 == (double) x_mid) && (segment->x2 == (double) x_mid) &&
(segment->y1 == (double) y_mid) && (segment->y2 == (double) y_mid))
return(MagickFalse);
/*
Average pixels and apply plasma.
*/
exception=(&image->exception);
plasma=(MagickRealType) QuantumRange/(2.0*attenuate);
if ((segment->x1 != (double) x_mid) || (segment->x2 != (double) x_mid))
{
register PixelPacket
*restrict q;
/*
Left pixel.
*/
x=(ssize_t) ceil(segment->x1-0.5);
(void) GetOneCacheViewVirtualPixel(image_view,x,(ssize_t)
ceil(segment->y1-0.5),&u,exception);
(void) GetOneCacheViewVirtualPixel(image_view,x,(ssize_t)
ceil(segment->y2-0.5),&v,exception);
q=QueueCacheViewAuthenticPixels(image_view,x,y_mid,1,1,exception);
if (q == (PixelPacket *) NULL)
return(MagickTrue);
SetRedPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.red+v.red)/2.0,plasma));
SetGreenPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.green+v.green)/2.0,plasma));
SetBluePixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.blue+v.blue)/2.0,plasma));
(void) SyncCacheViewAuthenticPixels(image_view,exception);
if (segment->x1 != segment->x2)
{
/*
Right pixel.
*/
x=(ssize_t) ceil(segment->x2-0.5);
(void) GetOneCacheViewVirtualPixel(image_view,x,(ssize_t)
ceil(segment->y1-0.5),&u,exception);
(void) GetOneCacheViewVirtualPixel(image_view,x,(ssize_t)
ceil(segment->y2-0.5),&v,exception);
q=QueueCacheViewAuthenticPixels(image_view,x,y_mid,1,1,exception);
if (q == (PixelPacket *) NULL)
return(MagickTrue);
SetRedPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.red+v.red)/2.0,plasma));
SetGreenPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.green+v.green)/2.0,plasma));
SetBluePixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.blue+v.blue)/2.0,plasma));
(void) SyncCacheViewAuthenticPixels(image_view,exception);
}
}
if ((segment->y1 != (double) y_mid) || (segment->y2 != (double) y_mid))
{
if ((segment->x1 != (double) x_mid) || (segment->y2 != (double) y_mid))
{
register PixelPacket
*restrict q;
/*
Bottom pixel.
*/
y=(ssize_t) ceil(segment->y2-0.5);
(void) GetOneCacheViewVirtualPixel(image_view,(ssize_t)
ceil(segment->x1-0.5),y,&u,exception);
(void) GetOneCacheViewVirtualPixel(image_view,(ssize_t)
ceil(segment->x2-0.5),y,&v,exception);
q=QueueCacheViewAuthenticPixels(image_view,x_mid,y,1,1,exception);
if (q == (PixelPacket *) NULL)
return(MagickTrue);
SetRedPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.red+v.red)/2.0,plasma));
SetGreenPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.green+v.green)/2.0,plasma));
SetBluePixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.blue+v.blue)/2.0,plasma));
(void) SyncCacheViewAuthenticPixels(image_view,exception);
}
if (segment->y1 != segment->y2)
{
register PixelPacket
*restrict q;
/*
Top pixel.
*/
y=(ssize_t) ceil(segment->y1-0.5);
(void) GetOneCacheViewVirtualPixel(image_view,(ssize_t)
ceil(segment->x1-0.5),y,&u,exception);
(void) GetOneCacheViewVirtualPixel(image_view,(ssize_t)
ceil(segment->x2-0.5),y,&v,exception);
q=QueueCacheViewAuthenticPixels(image_view,x_mid,y,1,1,exception);
if (q == (PixelPacket *) NULL)
return(MagickTrue);
SetRedPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.red+v.red)/2.0,plasma));
SetGreenPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.green+v.green)/2.0,plasma));
SetBluePixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.blue+v.blue)/2.0,plasma));
(void) SyncCacheViewAuthenticPixels(image_view,exception);
}
}
if ((segment->x1 != segment->x2) || (segment->y1 != segment->y2))
{
register PixelPacket
*restrict q;
/*
Middle pixel.
*/
x=(ssize_t) ceil(segment->x1-0.5);
y=(ssize_t) ceil(segment->y1-0.5);
(void) GetOneVirtualPixel(image,x,y,&u,exception);
x=(ssize_t) ceil(segment->x2-0.5);
y=(ssize_t) ceil(segment->y2-0.5);
(void) GetOneCacheViewVirtualPixel(image_view,x,y,&v,exception);
q=QueueCacheViewAuthenticPixels(image_view,x_mid,y_mid,1,1,exception);
if (q == (PixelPacket *) NULL)
return(MagickTrue);
SetRedPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.red+v.red)/2.0,plasma));
SetGreenPixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.green+v.green)/2.0,plasma));
SetBluePixelComponent(q,PlasmaPixel(random_info,(MagickRealType)
(u.blue+v.blue)/2.0,plasma));
(void) SyncCacheViewAuthenticPixels(image_view,exception);
}
if (((segment->x2-segment->x1) < 3.0) && ((segment->y2-segment->y1) < 3.0))
return(MagickTrue);
return(MagickFalse);
}
MagickExport MagickBooleanType PlasmaImage(Image *image,
const SegmentInfo *segment,size_t attenuate,size_t depth)
{
CacheView
*image_view;
MagickBooleanType
status;
RandomInfo
*random_info;
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"...");
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"...");
if (SetImageStorageClass(image,DirectClass) == MagickFalse)
return(MagickFalse);
image_view=AcquireCacheView(image);
random_info=AcquireRandomInfo();
status=PlasmaImageProxy(image,image_view,random_info,segment,attenuate,depth);
random_info=DestroyRandomInfo(random_info);
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% P o l a r o i d I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% PolaroidImage() simulates a Polaroid picture.
%
% The format of the AnnotateImage method is:
%
% Image *PolaroidImage(const Image *image,const DrawInfo *draw_info,
% const double angle,ExceptionInfo exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o draw_info: the draw info.
%
% o angle: Apply the effect along this angle.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *PolaroidImage(const Image *image,const DrawInfo *draw_info,
const double angle,ExceptionInfo *exception)
{
const char
*value;
Image
*bend_image,
*caption_image,
*flop_image,
*picture_image,
*polaroid_image,
*rotate_image,
*trim_image;
size_t
height;
ssize_t
quantum;
/*
Simulate a Polaroid picture.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
quantum=(ssize_t) MagickMax(MagickMax((double) image->columns,(double)
image->rows)/25.0,10.0);
height=image->rows+2*quantum;
caption_image=(Image *) NULL;
value=GetImageProperty(image,"Caption");
if (value != (const char *) NULL)
{
char
*caption,
geometry[MaxTextExtent];
DrawInfo
*annotate_info;
MagickBooleanType
status;
ssize_t
count;
TypeMetric
metrics;
/*
Generate caption image.
*/
caption_image=CloneImage(image,image->columns,1,MagickTrue,exception);
if (caption_image == (Image *) NULL)
return((Image *) NULL);
annotate_info=CloneDrawInfo((const ImageInfo *) NULL,draw_info);
caption=InterpretImageProperties((ImageInfo *) NULL,(Image *) image,
value);
(void) CloneString(&annotate_info->text,caption);
count=FormatMagickCaption(caption_image,annotate_info,MagickTrue,&metrics,
&caption);
status=SetImageExtent(caption_image,image->columns,(size_t)
((count+1)*(metrics.ascent-metrics.descent)+0.5));
if (status == MagickFalse)
caption_image=DestroyImage(caption_image);
else
{
caption_image->background_color=image->border_color;
(void) SetImageBackgroundColor(caption_image);
(void) CloneString(&annotate_info->text,caption);
(void) FormatLocaleString(geometry,MaxTextExtent,"+0+%g",
metrics.ascent);
if (annotate_info->gravity == UndefinedGravity)
(void) CloneString(&annotate_info->geometry,AcquireString(
geometry));
(void) AnnotateImage(caption_image,annotate_info);
height+=caption_image->rows;
}
annotate_info=DestroyDrawInfo(annotate_info);
caption=DestroyString(caption);
}
picture_image=CloneImage(image,image->columns+2*quantum,height,MagickTrue,
exception);
if (picture_image == (Image *) NULL)
{
if (caption_image != (Image *) NULL)
caption_image=DestroyImage(caption_image);
return((Image *) NULL);
}
picture_image->background_color=image->border_color;
(void) SetImageBackgroundColor(picture_image);
(void) CompositeImage(picture_image,OverCompositeOp,image,quantum,quantum);
if (caption_image != (Image *) NULL)
{
(void) CompositeImage(picture_image,OverCompositeOp,caption_image,
quantum,(ssize_t) (image->rows+3*quantum/2));
caption_image=DestroyImage(caption_image);
}
(void) QueryColorDatabase("none",&picture_image->background_color,exception);
(void) SetImageAlphaChannel(picture_image,OpaqueAlphaChannel);
rotate_image=RotateImage(picture_image,90.0,exception);
picture_image=DestroyImage(picture_image);
if (rotate_image == (Image *) NULL)
return((Image *) NULL);
picture_image=rotate_image;
bend_image=WaveImage(picture_image,0.01*picture_image->rows,2.0*
picture_image->columns,exception);
picture_image=DestroyImage(picture_image);
if (bend_image == (Image *) NULL)
return((Image *) NULL);
InheritException(&bend_image->exception,exception);
picture_image=bend_image;
rotate_image=RotateImage(picture_image,-90.0,exception);
picture_image=DestroyImage(picture_image);
if (rotate_image == (Image *) NULL)
return((Image *) NULL);
picture_image=rotate_image;
picture_image->background_color=image->background_color;
polaroid_image=ShadowImage(picture_image,80.0,2.0,quantum/3,quantum/3,
exception);
if (polaroid_image == (Image *) NULL)
{
picture_image=DestroyImage(picture_image);
return(picture_image);
}
flop_image=FlopImage(polaroid_image,exception);
polaroid_image=DestroyImage(polaroid_image);
if (flop_image == (Image *) NULL)
{
picture_image=DestroyImage(picture_image);
return(picture_image);
}
polaroid_image=flop_image;
(void) CompositeImage(polaroid_image,OverCompositeOp,picture_image,
(ssize_t) (-0.01*picture_image->columns/2.0),0L);
picture_image=DestroyImage(picture_image);
(void) QueryColorDatabase("none",&polaroid_image->background_color,exception);
rotate_image=RotateImage(polaroid_image,angle,exception);
polaroid_image=DestroyImage(polaroid_image);
if (rotate_image == (Image *) NULL)
return((Image *) NULL);
polaroid_image=rotate_image;
trim_image=TrimImage(polaroid_image,exception);
polaroid_image=DestroyImage(polaroid_image);
if (trim_image == (Image *) NULL)
return((Image *) NULL);
polaroid_image=trim_image;
return(polaroid_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S e p i a T o n e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% MagickSepiaToneImage() applies a special effect to the image, similar to the
% effect achieved in a photo darkroom by sepia toning. Threshold ranges from
% 0 to QuantumRange and is a measure of the extent of the sepia toning. A
% threshold of 80% is a good starting point for a reasonable tone.
%
% The format of the SepiaToneImage method is:
%
% Image *SepiaToneImage(const Image *image,const double threshold,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o threshold: the tone threshold.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *SepiaToneImage(const Image *image,const double threshold,
ExceptionInfo *exception)
{
#define SepiaToneImageTag "SepiaTone/Image"
CacheView
*image_view,
*sepia_view;
Image
*sepia_image;
MagickBooleanType
status;
MagickOffsetType
progress;
ssize_t
y;
/*
Initialize sepia-toned image attributes.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
sepia_image=CloneImage(image,image->columns,image->rows,MagickTrue,exception);
if (sepia_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(sepia_image,DirectClass) == MagickFalse)
{
InheritException(exception,&sepia_image->exception);
sepia_image=DestroyImage(sepia_image);
return((Image *) NULL);
}
/*
Tone each row of the image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
sepia_view=AcquireCacheView(sepia_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*restrict p;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=QueueCacheViewAuthenticPixels(sepia_view,0,y,sepia_image->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
MagickRealType
intensity,
tone;
intensity=(MagickRealType) PixelIntensityToQuantum(p);
tone=intensity > threshold ? (MagickRealType) QuantumRange : intensity+
(MagickRealType) QuantumRange-threshold;
SetRedPixelComponent(q,ClampToQuantum(tone));
tone=intensity > (7.0*threshold/6.0) ? (MagickRealType) QuantumRange :
intensity+(MagickRealType) QuantumRange-7.0*threshold/6.0;
SetGreenPixelComponent(q,ClampToQuantum(tone));
tone=intensity < (threshold/6.0) ? 0 : intensity-threshold/6.0;
SetBluePixelComponent(q,ClampToQuantum(tone));
tone=threshold/7.0;
if ((MagickRealType) GetGreenPixelComponent(q) < tone)
SetGreenPixelComponent(q,ClampToQuantum(tone));
if ((MagickRealType) GetBluePixelComponent(q) < tone)
SetBluePixelComponent(q,ClampToQuantum(tone));
p++;
q++;
}
if (SyncCacheViewAuthenticPixels(sepia_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_SepiaToneImage)
#endif
proceed=SetImageProgress(image,SepiaToneImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
sepia_view=DestroyCacheView(sepia_view);
image_view=DestroyCacheView(image_view);
(void) NormalizeImage(sepia_image);
(void) ContrastImage(sepia_image,MagickTrue);
if (status == MagickFalse)
sepia_image=DestroyImage(sepia_image);
return(sepia_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S h a d o w I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ShadowImage() simulates a shadow from the specified image and returns it.
%
% The format of the ShadowImage method is:
%
% Image *ShadowImage(const Image *image,const double opacity,
% const double sigma,const ssize_t x_offset,const ssize_t y_offset,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o opacity: percentage transparency.
%
% o sigma: the standard deviation of the Gaussian, in pixels.
%
% o x_offset: the shadow x-offset.
%
% o y_offset: the shadow y-offset.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ShadowImage(const Image *image,const double opacity,
const double sigma,const ssize_t x_offset,const ssize_t y_offset,
ExceptionInfo *exception)
{
#define ShadowImageTag "Shadow/Image"
CacheView
*image_view;
Image
*border_image,
*clone_image,
*shadow_image;
MagickBooleanType
status;
MagickOffsetType
progress;
RectangleInfo
border_info;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
clone_image=CloneImage(image,0,0,MagickTrue,exception);
if (clone_image == (Image *) NULL)
return((Image *) NULL);
(void) SetImageVirtualPixelMethod(clone_image,EdgeVirtualPixelMethod);
clone_image->compose=OverCompositeOp;
border_info.width=(size_t) floor(2.0*sigma+0.5);
border_info.height=(size_t) floor(2.0*sigma+0.5);
border_info.x=0;
border_info.y=0;
(void) QueryColorDatabase("none",&clone_image->border_color,exception);
border_image=BorderImage(clone_image,&border_info,exception);
clone_image=DestroyImage(clone_image);
if (border_image == (Image *) NULL)
return((Image *) NULL);
if (border_image->matte == MagickFalse)
(void) SetImageAlphaChannel(border_image,OpaqueAlphaChannel);
/*
Shadow image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(border_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) border_image->rows; y++)
{
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,border_image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) border_image->columns; x++)
{
SetRedPixelComponent(q,border_image->background_color.red);
SetGreenPixelComponent(q,border_image->background_color.green);
SetBluePixelComponent(q,border_image->background_color.blue);
if (border_image->matte == MagickFalse)
SetOpacityPixelComponent(q,border_image->background_color.opacity);
else
SetOpacityPixelComponent(q,ClampToQuantum((MagickRealType)
(QuantumRange-GetAlphaPixelComponent(q)*opacity/100.0)));
q++;
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ShadowImage)
#endif
proceed=SetImageProgress(image,ShadowImageTag,progress++,
border_image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
shadow_image=BlurImageChannel(border_image,AlphaChannel,0.0,sigma,exception);
border_image=DestroyImage(border_image);
if (shadow_image == (Image *) NULL)
return((Image *) NULL);
if (shadow_image->page.width == 0)
shadow_image->page.width=shadow_image->columns;
if (shadow_image->page.height == 0)
shadow_image->page.height=shadow_image->rows;
shadow_image->page.width+=x_offset-(ssize_t) border_info.width;
shadow_image->page.height+=y_offset-(ssize_t) border_info.height;
shadow_image->page.x+=x_offset-(ssize_t) border_info.width;
shadow_image->page.y+=y_offset-(ssize_t) border_info.height;
return(shadow_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S k e t c h I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SketchImage() simulates a pencil sketch. We convolve the image with a
% Gaussian operator of the given radius and standard deviation (sigma). For
% reasonable results, radius should be larger than sigma. Use a radius of 0
% and SketchImage() selects a suitable radius for you. Angle gives the angle
% of the sketch.
%
% The format of the SketchImage method is:
%
% Image *SketchImage(const Image *image,const double radius,
% const double sigma,const double angle,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o radius: the radius of the Gaussian, in pixels, not counting
% the center pixel.
%
% o sigma: the standard deviation of the Gaussian, in pixels.
%
% o angle: Apply the effect along this angle.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *SketchImage(const Image *image,const double radius,
const double sigma,const double angle,ExceptionInfo *exception)
{
CacheView
*random_view;
Image
*blend_image,
*blur_image,
*dodge_image,
*random_image,
*sketch_image;
MagickBooleanType
status;
MagickPixelPacket
zero;
RandomInfo
**restrict random_info;
ssize_t
y;
/*
Sketch image.
*/
random_image=CloneImage(image,image->columns << 1,image->rows << 1,
MagickTrue,exception);
if (random_image == (Image *) NULL)
return((Image *) NULL);
status=MagickTrue;
GetMagickPixelPacket(random_image,&zero);
random_info=AcquireRandomInfoThreadSet();
random_view=AcquireCacheView(random_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(status)
#endif
for (y=0; y < (ssize_t) random_image->rows; y++)
{
const int
id = GetOpenMPThreadId();
MagickPixelPacket
pixel;
register IndexPacket
*restrict indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(random_view,0,y,random_image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(random_view);
pixel=zero;
for (x=0; x < (ssize_t) random_image->columns; x++)
{
pixel.red=(MagickRealType) (QuantumRange*
GetPseudoRandomValue(random_info[id]));
pixel.green=pixel.red;
pixel.blue=pixel.red;
if (image->colorspace == CMYKColorspace)
pixel.index=pixel.red;
SetPixelPacket(random_image,&pixel,q,indexes+x);
q++;
}
if (SyncCacheViewAuthenticPixels(random_view,exception) == MagickFalse)
status=MagickFalse;
}
random_view=DestroyCacheView(random_view);
random_info=DestroyRandomInfoThreadSet(random_info);
if (status == MagickFalse)
{
random_image=DestroyImage(random_image);
return(random_image);
}
blur_image=MotionBlurImage(random_image,radius,sigma,angle,exception);
random_image=DestroyImage(random_image);
if (blur_image == (Image *) NULL)
return((Image *) NULL);
dodge_image=EdgeImage(blur_image,radius,exception);
blur_image=DestroyImage(blur_image);
if (dodge_image == (Image *) NULL)
return((Image *) NULL);
(void) NormalizeImage(dodge_image);
(void) NegateImage(dodge_image,MagickFalse);
(void) TransformImage(&dodge_image,(char *) NULL,"50%");
sketch_image=CloneImage(image,0,0,MagickTrue,exception);
if (sketch_image == (Image *) NULL)
{
dodge_image=DestroyImage(dodge_image);
return((Image *) NULL);
}
(void) CompositeImage(sketch_image,ColorDodgeCompositeOp,dodge_image,0,0);
dodge_image=DestroyImage(dodge_image);
blend_image=CloneImage(image,0,0,MagickTrue,exception);
if (blend_image == (Image *) NULL)
{
sketch_image=DestroyImage(sketch_image);
return((Image *) NULL);
}
(void) SetImageArtifact(blend_image,"compose:args","20x80");
(void) CompositeImage(sketch_image,BlendCompositeOp,blend_image,0,0);
blend_image=DestroyImage(blend_image);
return(sketch_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S o l a r i z e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SolarizeImage() applies a special effect to the image, similar to the effect
% achieved in a photo darkroom by selectively exposing areas of photo
% sensitive paper to light. Threshold ranges from 0 to QuantumRange and is a
% measure of the extent of the solarization.
%
% The format of the SolarizeImage method is:
%
% MagickBooleanType SolarizeImage(Image *image,const double threshold)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o threshold: Define the extent of the solarization.
%
*/
MagickExport MagickBooleanType SolarizeImage(Image *image,
const double threshold)
{
#define SolarizeImageTag "Solarize/Image"
CacheView
*image_view;
ExceptionInfo
*exception;
MagickBooleanType
status;
MagickOffsetType
progress;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
if (image->storage_class == PseudoClass)
{
register ssize_t
i;
/*
Solarize colormap.
*/
for (i=0; i < (ssize_t) image->colors; i++)
{
if ((MagickRealType) image->colormap[i].red > threshold)
image->colormap[i].red=(Quantum) QuantumRange-image->colormap[i].red;
if ((MagickRealType) image->colormap[i].green > threshold)
image->colormap[i].green=(Quantum) QuantumRange-
image->colormap[i].green;
if ((MagickRealType) image->colormap[i].blue > threshold)
image->colormap[i].blue=(Quantum) QuantumRange-
image->colormap[i].blue;
}
}
/*
Solarize image.
*/
status=MagickTrue;
progress=0;
exception=(&image->exception);
image_view=AcquireCacheView(image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(image_view,0,y,image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
if ((MagickRealType) GetRedPixelComponent(q) > threshold)
SetRedPixelComponent(q,QuantumRange-GetRedPixelComponent(q));
if ((MagickRealType) GetGreenPixelComponent(q) > threshold)
SetGreenPixelComponent(q,QuantumRange-GetGreenPixelComponent(q));
if ((MagickRealType) GetBluePixelComponent(q) > threshold)
SetBluePixelComponent(q,QuantumRange-GetBluePixelComponent(q));
q++;
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_SolarizeImage)
#endif
proceed=SetImageProgress(image,SolarizeImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S t e g a n o I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SteganoImage() hides a digital watermark within the image. Recover
% the hidden watermark later to prove that the authenticity of an image.
% Offset defines the start position within the image to hide the watermark.
%
% The format of the SteganoImage method is:
%
% Image *SteganoImage(const Image *image,Image *watermark,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o watermark: the watermark image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *SteganoImage(const Image *image,const Image *watermark,
ExceptionInfo *exception)
{
#define GetBit(alpha,i) ((((size_t) (alpha) >> (size_t) (i)) & 0x01) != 0)
#define SetBit(alpha,i,set) (alpha)=(Quantum) ((set) != 0 ? (size_t) (alpha) \
| (one << (size_t) (i)) : (size_t) (alpha) & ~(one << (size_t) (i)))
#define SteganoImageTag "Stegano/Image"
CacheView
*stegano_view,
*watermark_view;
Image
*stegano_image;
int
c;
MagickBooleanType
status;
PixelPacket
pixel;
register PixelPacket
*q;
register ssize_t
x;
size_t
depth,
one;
ssize_t
i,
j,
k,
y;
/*
Initialize steganographic image attributes.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(watermark != (const Image *) NULL);
assert(watermark->signature == MagickSignature);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
one=1UL;
stegano_image=CloneImage(image,0,0,MagickTrue,exception);
if (stegano_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(stegano_image,DirectClass) == MagickFalse)
{
InheritException(exception,&stegano_image->exception);
stegano_image=DestroyImage(stegano_image);
return((Image *) NULL);
}
stegano_image->depth=MAGICKCORE_QUANTUM_DEPTH;
/*
Hide watermark in low-order bits of image.
*/
c=0;
i=0;
j=0;
depth=stegano_image->depth;
k=image->offset;
status=MagickTrue;
watermark_view=AcquireCacheView(watermark);
stegano_view=AcquireCacheView(stegano_image);
for (i=(ssize_t) depth-1; (i >= 0) && (j < (ssize_t) depth); i--)
{
for (y=0; (y < (ssize_t) watermark->rows) && (j < (ssize_t) depth); y++)
{
for (x=0; (x < (ssize_t) watermark->columns) && (j < (ssize_t) depth); x++)
{
(void) GetOneCacheViewVirtualPixel(watermark_view,x,y,&pixel,exception);
if ((k/(ssize_t) stegano_image->columns) >= (ssize_t) stegano_image->rows)
break;
q=GetCacheViewAuthenticPixels(stegano_view,k % (ssize_t)
stegano_image->columns,k/(ssize_t) stegano_image->columns,1,1,
exception);
if (q == (PixelPacket *) NULL)
break;
switch (c)
{
case 0:
{
SetBit(GetRedPixelComponent(q),j,GetBit(PixelIntensityToQuantum(
&pixel),i));
break;
}
case 1:
{
SetBit(GetGreenPixelComponent(q),j,GetBit(PixelIntensityToQuantum(
&pixel),i));
break;
}
case 2:
{
SetBit(GetBluePixelComponent(q),j,GetBit(PixelIntensityToQuantum(
&pixel),i));
break;
}
}
if (SyncCacheViewAuthenticPixels(stegano_view,exception) == MagickFalse)
break;
c++;
if (c == 3)
c=0;
k++;
if (k == (ssize_t) (stegano_image->columns*stegano_image->columns))
k=0;
if (k == image->offset)
j++;
}
}
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
proceed=SetImageProgress(image,SteganoImageTag,(MagickOffsetType)
(depth-i),depth);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
stegano_view=DestroyCacheView(stegano_view);
watermark_view=DestroyCacheView(watermark_view);
if (stegano_image->storage_class == PseudoClass)
(void) SyncImage(stegano_image);
if (status == MagickFalse)
{
stegano_image=DestroyImage(stegano_image);
return((Image *) NULL);
}
return(stegano_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S t e r e o A n a g l y p h I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% StereoAnaglyphImage() combines two images and produces a single image that
% is the composite of a left and right image of a stereo pair. Special
% red-green stereo glasses are required to view this effect.
%
% The format of the StereoAnaglyphImage method is:
%
% Image *StereoImage(const Image *left_image,const Image *right_image,
% ExceptionInfo *exception)
% Image *StereoAnaglyphImage(const Image *left_image,
% const Image *right_image,const ssize_t x_offset,const ssize_t y_offset,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o left_image: the left image.
%
% o right_image: the right image.
%
% o exception: return any errors or warnings in this structure.
%
% o x_offset: amount, in pixels, by which the left image is offset to the
% right of the right image.
%
% o y_offset: amount, in pixels, by which the left image is offset to the
% bottom of the right image.
%
%
*/
MagickExport Image *StereoImage(const Image *left_image,
const Image *right_image,ExceptionInfo *exception)
{
return(StereoAnaglyphImage(left_image,right_image,0,0,exception));
}
MagickExport Image *StereoAnaglyphImage(const Image *left_image,
const Image *right_image,const ssize_t x_offset,const ssize_t y_offset,
ExceptionInfo *exception)
{
#define StereoImageTag "Stereo/Image"
const Image
*image;
Image
*stereo_image;
MagickBooleanType
status;
ssize_t
y;
assert(left_image != (const Image *) NULL);
assert(left_image->signature == MagickSignature);
if (left_image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
left_image->filename);
assert(right_image != (const Image *) NULL);
assert(right_image->signature == MagickSignature);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
assert(right_image != (const Image *) NULL);
image=left_image;
if ((left_image->columns != right_image->columns) ||
(left_image->rows != right_image->rows))
ThrowImageException(ImageError,"LeftAndRightImageSizesDiffer");
/*
Initialize stereo image attributes.
*/
stereo_image=CloneImage(left_image,left_image->columns,left_image->rows,
MagickTrue,exception);
if (stereo_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(stereo_image,DirectClass) == MagickFalse)
{
InheritException(exception,&stereo_image->exception);
stereo_image=DestroyImage(stereo_image);
return((Image *) NULL);
}
/*
Copy left image to red channel and right image to blue channel.
*/
status=MagickTrue;
for (y=0; y < (ssize_t) stereo_image->rows; y++)
{
register const PixelPacket
*restrict p,
*restrict q;
register ssize_t
x;
register PixelPacket
*restrict r;
p=GetVirtualPixels(left_image,-x_offset,y-y_offset,image->columns,1,
exception);
q=GetVirtualPixels(right_image,0,y,right_image->columns,1,exception);
r=QueueAuthenticPixels(stereo_image,0,y,stereo_image->columns,1,exception);
if ((p == (PixelPacket *) NULL) || (q == (PixelPacket *) NULL) ||
(r == (PixelPacket *) NULL))
break;
for (x=0; x < (ssize_t) stereo_image->columns; x++)
{
SetRedPixelComponent(r,GetRedPixelComponent(p));
SetGreenPixelComponent(r,GetGreenPixelComponent(q));
SetBluePixelComponent(r,GetBluePixelComponent(q));
SetOpacityPixelComponent(r,(GetOpacityPixelComponent(p)+q->opacity)/2);
p++;
q++;
r++;
}
if (SyncAuthenticPixels(stereo_image,exception) == MagickFalse)
break;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
proceed=SetImageProgress(image,StereoImageTag,(MagickOffsetType) y,
stereo_image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
if (status == MagickFalse)
{
stereo_image=DestroyImage(stereo_image);
return((Image *) NULL);
}
return(stereo_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S w i r l I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% SwirlImage() swirls the pixels about the center of the image, where
% degrees indicates the sweep of the arc through which each pixel is moved.
% You get a more dramatic effect as the degrees move from 1 to 360.
%
% The format of the SwirlImage method is:
%
% Image *SwirlImage(const Image *image,double degrees,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o degrees: Define the tightness of the swirling effect.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *SwirlImage(const Image *image,double degrees,
ExceptionInfo *exception)
{
#define SwirlImageTag "Swirl/Image"
CacheView
*image_view,
*swirl_view;
Image
*swirl_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
zero;
MagickRealType
radius;
PointInfo
center,
scale;
ssize_t
y;
/*
Initialize swirl image attributes.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
swirl_image=CloneImage(image,0,0,MagickTrue,exception);
if (swirl_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(swirl_image,DirectClass) == MagickFalse)
{
InheritException(exception,&swirl_image->exception);
swirl_image=DestroyImage(swirl_image);
return((Image *) NULL);
}
if (swirl_image->background_color.opacity != OpaqueOpacity)
swirl_image->matte=MagickTrue;
/*
Compute scaling factor.
*/
center.x=(double) image->columns/2.0;
center.y=(double) image->rows/2.0;
radius=MagickMax(center.x,center.y);
scale.x=1.0;
scale.y=1.0;
if (image->columns > image->rows)
scale.y=(double) image->columns/(double) image->rows;
else
if (image->columns < image->rows)
scale.x=(double) image->rows/(double) image->columns;
degrees=(double) DegreesToRadians(degrees);
/*
Swirl image.
*/
status=MagickTrue;
progress=0;
GetMagickPixelPacket(swirl_image,&zero);
image_view=AcquireCacheView(image);
swirl_view=AcquireCacheView(swirl_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickPixelPacket
pixel;
MagickRealType
distance;
PointInfo
delta;
register IndexPacket
*restrict swirl_indexes;
register ssize_t
x;
register PixelPacket
*restrict q;
if (status == MagickFalse)
continue;
q=GetCacheViewAuthenticPixels(swirl_view,0,y,swirl_image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
swirl_indexes=GetCacheViewAuthenticIndexQueue(swirl_view);
delta.y=scale.y*(double) (y-center.y);
pixel=zero;
for (x=0; x < (ssize_t) image->columns; x++)
{
/*
Determine if the pixel is within an ellipse.
*/
delta.x=scale.x*(double) (x-center.x);
distance=delta.x*delta.x+delta.y*delta.y;
if (distance < (radius*radius))
{
MagickRealType
cosine,
factor,
sine;
/*
Swirl the pixel.
*/
factor=1.0-sqrt((double) distance)/radius;
sine=sin((double) (degrees*factor*factor));
cosine=cos((double) (degrees*factor*factor));
(void) InterpolateMagickPixelPacket(image,image_view,
UndefinedInterpolatePixel,(double) ((cosine*delta.x-sine*delta.y)/
scale.x+center.x),(double) ((sine*delta.x+cosine*delta.y)/scale.y+
center.y),&pixel,exception);
SetPixelPacket(swirl_image,&pixel,q,swirl_indexes+x);
}
q++;
}
if (SyncCacheViewAuthenticPixels(swirl_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_SwirlImage)
#endif
proceed=SetImageProgress(image,SwirlImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
swirl_view=DestroyCacheView(swirl_view);
image_view=DestroyCacheView(image_view);
if (status == MagickFalse)
swirl_image=DestroyImage(swirl_image);
return(swirl_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% T i n t I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% TintImage() applies a color vector to each pixel in the image. The length
% of the vector is 0 for black and white and at its maximum for the midtones.
% The vector weighting function is f(x)=(1-(4.0*((x-0.5)*(x-0.5))))
%
% The format of the TintImage method is:
%
% Image *TintImage(const Image *image,const char *opacity,
% const PixelPacket tint,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o opacity: A color value used for tinting.
%
% o tint: A color value used for tinting.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *TintImage(const Image *image,const char *opacity,
const PixelPacket tint,ExceptionInfo *exception)
{
#define TintImageTag "Tint/Image"
CacheView
*image_view,
*tint_view;
GeometryInfo
geometry_info;
Image
*tint_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
color_vector,
pixel;
MagickStatusType
flags;
ssize_t
y;
/*
Allocate tint image.
*/
assert(image != (const Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
tint_image=CloneImage(image,image->columns,image->rows,MagickTrue,exception);
if (tint_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(tint_image,DirectClass) == MagickFalse)
{
InheritException(exception,&tint_image->exception);
tint_image=DestroyImage(tint_image);
return((Image *) NULL);
}
if (opacity == (const char *) NULL)
return(tint_image);
/*
Determine RGB values of the color.
*/
flags=ParseGeometry(opacity,&geometry_info);
pixel.red=geometry_info.rho;
if ((flags & SigmaValue) != 0)
pixel.green=geometry_info.sigma;
else
pixel.green=pixel.red;
if ((flags & XiValue) != 0)
pixel.blue=geometry_info.xi;
else
pixel.blue=pixel.red;
if ((flags & PsiValue) != 0)
pixel.opacity=geometry_info.psi;
else
pixel.opacity=(MagickRealType) OpaqueOpacity;
color_vector.red=(MagickRealType) (pixel.red*tint.red/100.0-
PixelIntensity(&tint));
color_vector.green=(MagickRealType) (pixel.green*tint.green/100.0-
PixelIntensity(&tint));
color_vector.blue=(MagickRealType) (pixel.blue*tint.blue/100.0-
PixelIntensity(&tint));
/*
Tint image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
tint_view=AcquireCacheView(tint_image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*restrict p;
register PixelPacket
*restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
q=QueueCacheViewAuthenticPixels(tint_view,0,y,tint_image->columns,1,
exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) image->columns; x++)
{
MagickPixelPacket
pixel;
MagickRealType
weight;
weight=QuantumScale*GetRedPixelComponent(p)-0.5;
pixel.red=(MagickRealType) GetRedPixelComponent(p)+color_vector.red*(1.0-(4.0*
(weight*weight)));
SetRedPixelComponent(q,ClampToQuantum(pixel.red));
weight=QuantumScale*GetGreenPixelComponent(p)-0.5;
pixel.green=(MagickRealType) GetGreenPixelComponent(p)+color_vector.green*(1.0-(4.0*
(weight*weight)));
SetGreenPixelComponent(q,ClampToQuantum(pixel.green));
weight=QuantumScale*GetBluePixelComponent(p)-0.5;
pixel.blue=(MagickRealType) GetBluePixelComponent(p)+color_vector.blue*(1.0-(4.0*
(weight*weight)));
SetBluePixelComponent(q,ClampToQuantum(pixel.blue));
SetOpacityPixelComponent(q,GetOpacityPixelComponent(p));
p++;
q++;
}
if (SyncCacheViewAuthenticPixels(tint_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_TintImage)
#endif
proceed=SetImageProgress(image,TintImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
tint_view=DestroyCacheView(tint_view);
image_view=DestroyCacheView(image_view);
if (status == MagickFalse)
tint_image=DestroyImage(tint_image);
return(tint_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% V i g n e t t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% VignetteImage() softens the edges of the image in vignette style.
%
% The format of the VignetteImage method is:
%
% Image *VignetteImage(const Image *image,const double radius,
% const double sigma,const ssize_t x,const ssize_t y,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o radius: the radius of the pixel neighborhood.
%
% o sigma: the standard deviation of the Gaussian, in pixels.
%
% o x, y: Define the x and y ellipse offset.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *VignetteImage(const Image *image,const double radius,
const double sigma,const ssize_t x,const ssize_t y,ExceptionInfo *exception)
{
char
ellipse[MaxTextExtent];
DrawInfo
*draw_info;
Image
*canvas_image,
*blur_image,
*oval_image,
*vignette_image;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
canvas_image=CloneImage(image,0,0,MagickTrue,exception);
if (canvas_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(canvas_image,DirectClass) == MagickFalse)
{
InheritException(exception,&canvas_image->exception);
canvas_image=DestroyImage(canvas_image);
return((Image *) NULL);
}
canvas_image->matte=MagickTrue;
oval_image=CloneImage(canvas_image,canvas_image->columns,
canvas_image->rows,MagickTrue,exception);
if (oval_image == (Image *) NULL)
{
canvas_image=DestroyImage(canvas_image);
return((Image *) NULL);
}
(void) QueryColorDatabase("#000000",&oval_image->background_color,exception);
(void) SetImageBackgroundColor(oval_image);
draw_info=CloneDrawInfo((const ImageInfo *) NULL,(const DrawInfo *) NULL);
(void) QueryColorDatabase("#ffffff",&draw_info->fill,exception);
(void) QueryColorDatabase("#ffffff",&draw_info->stroke,exception);
(void) FormatLocaleString(ellipse,MaxTextExtent,
"ellipse %g,%g,%g,%g,0.0,360.0",image->columns/2.0,
image->rows/2.0,image->columns/2.0-x,image->rows/2.0-y);
draw_info->primitive=AcquireString(ellipse);
(void) DrawImage(oval_image,draw_info);
draw_info=DestroyDrawInfo(draw_info);
blur_image=BlurImage(oval_image,radius,sigma,exception);
oval_image=DestroyImage(oval_image);
if (blur_image == (Image *) NULL)
{
canvas_image=DestroyImage(canvas_image);
return((Image *) NULL);
}
blur_image->matte=MagickFalse;
(void) CompositeImage(canvas_image,CopyOpacityCompositeOp,blur_image,0,0);
blur_image=DestroyImage(blur_image);
vignette_image=MergeImageLayers(canvas_image,FlattenLayer,exception);
canvas_image=DestroyImage(canvas_image);
return(vignette_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% W a v e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% WaveImage() creates a "ripple" effect in the image by shifting the pixels
% vertically along a sine wave whose amplitude and wavelength is specified
% by the given parameters.
%
% The format of the WaveImage method is:
%
% Image *WaveImage(const Image *image,const double amplitude,
% const double wave_length,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o amplitude, wave_length: Define the amplitude and wave length of the
% sine wave.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *WaveImage(const Image *image,const double amplitude,
const double wave_length,ExceptionInfo *exception)
{
#define WaveImageTag "Wave/Image"
CacheView
*image_view,
*wave_view;
Image
*wave_image;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
zero;
MagickRealType
*sine_map;
register ssize_t
i;
ssize_t
y;
/*
Initialize wave image attributes.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
wave_image=CloneImage(image,image->columns,(size_t) (image->rows+2.0*
fabs(amplitude)),MagickTrue,exception);
if (wave_image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(wave_image,DirectClass) == MagickFalse)
{
InheritException(exception,&wave_image->exception);
wave_image=DestroyImage(wave_image);
return((Image *) NULL);
}
if (wave_image->background_color.opacity != OpaqueOpacity)
wave_image->matte=MagickTrue;
/*
Allocate sine map.
*/
sine_map=(MagickRealType *) AcquireQuantumMemory((size_t) wave_image->columns,
sizeof(*sine_map));
if (sine_map == (MagickRealType *) NULL)
{
wave_image=DestroyImage(wave_image);
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
}
for (i=0; i < (ssize_t) wave_image->columns; i++)
sine_map[i]=fabs(amplitude)+amplitude*sin((double) ((2.0*MagickPI*i)/
wave_length));
/*
Wave image.
*/
status=MagickTrue;
progress=0;
GetMagickPixelPacket(wave_image,&zero);
image_view=AcquireCacheView(image);
wave_view=AcquireCacheView(wave_image);
(void) SetCacheViewVirtualPixelMethod(image_view,
BackgroundVirtualPixelMethod);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (y=0; y < (ssize_t) wave_image->rows; y++)
{
MagickPixelPacket
pixel;
register IndexPacket
*restrict indexes;
register PixelPacket
*restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(wave_view,0,y,wave_image->columns,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(wave_view);
pixel=zero;
for (x=0; x < (ssize_t) wave_image->columns; x++)
{
(void) InterpolateMagickPixelPacket(image,image_view,
UndefinedInterpolatePixel,(double) x,(double) (y-sine_map[x]),&pixel,
exception);
SetPixelPacket(wave_image,&pixel,q,indexes+x);
q++;
}
if (SyncCacheViewAuthenticPixels(wave_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_WaveImage)
#endif
proceed=SetImageProgress(image,WaveImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
wave_view=DestroyCacheView(wave_view);
image_view=DestroyCacheView(image_view);
sine_map=(MagickRealType *) RelinquishMagickMemory(sine_map);
if (status == MagickFalse)
wave_image=DestroyImage(wave_image);
return(wave_image);
}
|
shear.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% SSSSS H H EEEEE AAA RRRR %
% SS H H E A A R R %
% SSS HHHHH EEE AAAAA RRRR %
% SS H H E A A R R %
% SSSSS H H EEEEE A A R R %
% %
% %
% MagickCore Methods to Shear or Rotate an Image by an Arbitrary Angle %
% %
% Software Design %
% John Cristy %
% July 1992 %
% %
% %
% Copyright 1999-2011 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% http://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% The RotateImage, XShearImage, and YShearImage methods are based on the
% paper "A Fast Algorithm for General Raster Rotatation" by Alan W. Paeth,
% Graphics Interface '86 (Vancouver). RotateImage is adapted from a similar
% method based on the Paeth paper written by Michael Halle of the Spatial
% Imaging Group, MIT Media Lab.
%
%
*/
/*
Include declarations.
*/
#include "magick/studio.h"
#include "magick/artifact.h"
#include "magick/attribute.h"
#include "magick/blob-private.h"
#include "magick/cache-private.h"
#include "magick/color-private.h"
#include "magick/colorspace-private.h"
#include "magick/composite.h"
#include "magick/composite-private.h"
#include "magick/decorate.h"
#include "magick/distort.h"
#include "magick/draw.h"
#include "magick/exception.h"
#include "magick/exception-private.h"
#include "magick/gem.h"
#include "magick/geometry.h"
#include "magick/image.h"
#include "magick/image-private.h"
#include "magick/memory_.h"
#include "magick/list.h"
#include "magick/monitor.h"
#include "magick/monitor-private.h"
#include "magick/pixel-private.h"
#include "magick/quantum.h"
#include "magick/resource_.h"
#include "magick/shear.h"
#include "magick/statistic.h"
#include "magick/string_.h"
#include "magick/string-private.h"
#include "magick/thread-private.h"
#include "magick/threshold.h"
#include "magick/transform.h"
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% A f f i n e T r a n s f o r m I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% AffineTransformImage() transforms an image as dictated by the affine matrix.
% It allocates the memory necessary for the new Image structure and returns
% a pointer to the new image.
%
% The format of the AffineTransformImage method is:
%
% Image *AffineTransformImage(const Image *image,
% AffineMatrix *affine_matrix,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o affine_matrix: the affine matrix.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *AffineTransformImage(const Image *image,
const AffineMatrix *affine_matrix,ExceptionInfo *exception)
{
double
distort[6];
Image
*deskew_image;
/*
Affine transform image.
*/
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(affine_matrix != (AffineMatrix *) NULL);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
distort[0]=affine_matrix->sx;
distort[1]=affine_matrix->rx;
distort[2]=affine_matrix->ry;
distort[3]=affine_matrix->sy;
distort[4]=affine_matrix->tx;
distort[5]=affine_matrix->ty;
deskew_image=DistortImage(image,AffineProjectionDistortion,6,distort,
MagickTrue,exception);
return(deskew_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ C r o p T o F i t I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% CropToFitImage() crops the sheared image as determined by the bounding box
% as defined by width and height and shearing angles.
%
% The format of the CropToFitImage method is:
%
% MagickBooleanType CropToFitImage(Image **image,
% const MagickRealType x_shear,const MagickRealType x_shear,
% const MagickRealType width,const MagickRealType height,
% const MagickBooleanType rotate,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o x_shear, y_shear, width, height: Defines a region of the image to crop.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType CropToFitImage(Image **image,
const MagickRealType x_shear,const MagickRealType y_shear,
const MagickRealType width,const MagickRealType height,
const MagickBooleanType rotate,ExceptionInfo *exception)
{
Image
*crop_image;
PointInfo
extent[4],
min,
max;
RectangleInfo
geometry,
page;
register ssize_t
i;
/*
Calculate the rotated image size.
*/
extent[0].x=(double) (-width/2.0);
extent[0].y=(double) (-height/2.0);
extent[1].x=(double) width/2.0;
extent[1].y=(double) (-height/2.0);
extent[2].x=(double) (-width/2.0);
extent[2].y=(double) height/2.0;
extent[3].x=(double) width/2.0;
extent[3].y=(double) height/2.0;
for (i=0; i < 4; i++)
{
extent[i].x+=x_shear*extent[i].y;
extent[i].y+=y_shear*extent[i].x;
if (rotate != MagickFalse)
extent[i].x+=x_shear*extent[i].y;
extent[i].x+=(double) (*image)->columns/2.0;
extent[i].y+=(double) (*image)->rows/2.0;
}
min=extent[0];
max=extent[0];
for (i=1; i < 4; i++)
{
if (min.x > extent[i].x)
min.x=extent[i].x;
if (min.y > extent[i].y)
min.y=extent[i].y;
if (max.x < extent[i].x)
max.x=extent[i].x;
if (max.y < extent[i].y)
max.y=extent[i].y;
}
geometry.x=(ssize_t) ceil(min.x-0.5);
geometry.y=(ssize_t) ceil(min.y-0.5);
geometry.width=(size_t) floor(max.x-min.x+0.5);
geometry.height=(size_t) floor(max.y-min.y+0.5);
page=(*image)->page;
(void) ParseAbsoluteGeometry("0x0+0+0",&(*image)->page);
crop_image=CropImage(*image,&geometry,exception);
if (crop_image == (Image *) NULL)
return(MagickFalse);
crop_image->page=page;
*image=DestroyImage(*image);
*image=crop_image;
return(MagickTrue);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% D e s k e w I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% DeskewImage() removes skew from the image. Skew is an artifact that
% occurs in scanned images because of the camera being misaligned,
% imperfections in the scanning or surface, or simply because the paper was
% not placed completely flat when scanned.
%
% The format of the DeskewImage method is:
%
% Image *DeskewImage(const Image *image,const double threshold,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o threshold: separate background from foreground.
%
% o exception: return any errors or warnings in this structure.
%
*/
typedef struct _RadonInfo
{
CacheType
type;
size_t
width,
height;
MagickSizeType
length;
MagickBooleanType
mapped;
char
path[MaxTextExtent];
int
file;
unsigned short
*cells;
} RadonInfo;
static RadonInfo *DestroyRadonInfo(RadonInfo *radon_info)
{
assert(radon_info != (RadonInfo *) NULL);
switch (radon_info->type)
{
case MemoryCache:
{
if (radon_info->mapped == MagickFalse)
radon_info->cells=(unsigned short *) RelinquishMagickMemory(
radon_info->cells);
else
radon_info->cells=(unsigned short *) UnmapBlob(radon_info->cells,
(size_t) radon_info->length);
RelinquishMagickResource(MemoryResource,radon_info->length);
break;
}
case MapCache:
{
radon_info->cells=(unsigned short *) UnmapBlob(radon_info->cells,(size_t)
radon_info->length);
RelinquishMagickResource(MapResource,radon_info->length);
}
case DiskCache:
{
if (radon_info->file != -1)
(void) close(radon_info->file);
(void) RelinquishUniqueFileResource(radon_info->path);
RelinquishMagickResource(DiskResource,radon_info->length);
break;
}
default:
break;
}
return((RadonInfo *) RelinquishMagickMemory(radon_info));
}
static MagickBooleanType ResetRadonCells(RadonInfo *radon_info)
{
register ssize_t
x;
ssize_t
count,
y;
unsigned short
value;
if (radon_info->type != DiskCache)
{
(void) ResetMagickMemory(radon_info->cells,0,(size_t) radon_info->length);
return(MagickTrue);
}
value=0;
(void) lseek(radon_info->file,0,SEEK_SET);
for (y=0; y < (ssize_t) radon_info->height; y++)
{
for (x=0; x < (ssize_t) radon_info->width; x++)
{
count=write(radon_info->file,&value,sizeof(*radon_info->cells));
if (count != (ssize_t) sizeof(*radon_info->cells))
break;
}
if (x < (ssize_t) radon_info->width)
break;
}
return(y < (ssize_t) radon_info->height ? MagickFalse : MagickTrue);
}
static RadonInfo *AcquireRadonInfo(const Image *image,const size_t width,
const size_t height,ExceptionInfo *exception)
{
MagickBooleanType
status;
RadonInfo
*radon_info;
radon_info=(RadonInfo *) AcquireMagickMemory(sizeof(*radon_info));
if (radon_info == (RadonInfo *) NULL)
return((RadonInfo *) NULL);
(void) ResetMagickMemory(radon_info,0,sizeof(*radon_info));
radon_info->width=width;
radon_info->height=height;
radon_info->length=(MagickSizeType) width*height*sizeof(*radon_info->cells);
radon_info->type=MemoryCache;
status=AcquireMagickResource(AreaResource,radon_info->length);
if ((status != MagickFalse) &&
(radon_info->length == (MagickSizeType) ((size_t) radon_info->length)))
{
status=AcquireMagickResource(MemoryResource,radon_info->length);
if (status != MagickFalse)
{
radon_info->mapped=MagickFalse;
radon_info->cells=(unsigned short *) AcquireMagickMemory((size_t)
radon_info->length);
if (radon_info->cells == (unsigned short *) NULL)
{
radon_info->mapped=MagickTrue;
radon_info->cells=(unsigned short *) MapBlob(-1,IOMode,0,(size_t)
radon_info->length);
}
if (radon_info->cells == (unsigned short *) NULL)
RelinquishMagickResource(MemoryResource,radon_info->length);
}
}
radon_info->file=(-1);
if (radon_info->cells == (unsigned short *) NULL)
{
status=AcquireMagickResource(DiskResource,radon_info->length);
if (status == MagickFalse)
{
(void) ThrowMagickException(exception,GetMagickModule(),CacheError,
"CacheResourcesExhausted","`%s'",image->filename);
return(DestroyRadonInfo(radon_info));
}
radon_info->type=DiskCache;
(void) AcquireMagickResource(MemoryResource,radon_info->length);
radon_info->file=AcquireUniqueFileResource(radon_info->path);
if (radon_info->file == -1)
return(DestroyRadonInfo(radon_info));
status=AcquireMagickResource(MapResource,radon_info->length);
if (status != MagickFalse)
{
status=ResetRadonCells(radon_info);
if (status != MagickFalse)
{
radon_info->cells=(unsigned short *) MapBlob(radon_info->file,
IOMode,0,(size_t) radon_info->length);
if (radon_info->cells != (unsigned short *) NULL)
radon_info->type=MapCache;
else
RelinquishMagickResource(MapResource,radon_info->length);
}
}
}
return(radon_info);
}
static inline size_t MagickMin(const size_t x,const size_t y)
{
if (x < y)
return(x);
return(y);
}
static inline ssize_t ReadRadonCell(const RadonInfo *radon_info,
const MagickOffsetType offset,const size_t length,unsigned char *buffer)
{
register ssize_t
i;
ssize_t
count;
#if !defined(MAGICKCORE_HAVE_PPREAD)
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ReadRadonCell)
#endif
{
i=(-1);
if (lseek(radon_info->file,offset,SEEK_SET) >= 0)
{
#endif
count=0;
for (i=0; i < (ssize_t) length; i+=count)
{
#if !defined(MAGICKCORE_HAVE_PPREAD)
count=read(radon_info->file,buffer+i,MagickMin(length-i,(size_t)
SSIZE_MAX));
#else
count=pread(radon_info->file,buffer+i,MagickMin(length-i,(size_t)
SSIZE_MAX),offset+i);
#endif
if (count > 0)
continue;
count=0;
if (errno != EINTR)
{
i=(-1);
break;
}
}
#if !defined(MAGICKCORE_HAVE_PPREAD)
}
}
#endif
return(i);
}
static inline ssize_t WriteRadonCell(const RadonInfo *radon_info,
const MagickOffsetType offset,const size_t length,const unsigned char *buffer)
{
register ssize_t
i;
ssize_t
count;
#if !defined(MAGICKCORE_HAVE_PWRITE)
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_WriteRadonCell)
#endif
{
if (lseek(radon_info->file,offset,SEEK_SET) >= 0)
{
#endif
count=0;
for (i=0; i < (ssize_t) length; i+=count)
{
#if !defined(MAGICKCORE_HAVE_PWRITE)
count=write(radon_info->file,buffer+i,MagickMin(length-i,(size_t)
SSIZE_MAX));
#else
count=pwrite(radon_info->file,buffer+i,MagickMin(length-i,(size_t)
SSIZE_MAX),offset+i);
#endif
if (count > 0)
continue;
count=0;
if (errno != EINTR)
{
i=(-1);
break;
}
}
#if !defined(MAGICKCORE_HAVE_PWRITE)
}
}
#endif
return(i);
}
static inline unsigned short GetRadonCell(const RadonInfo *radon_info,
const ssize_t x,const ssize_t y)
{
MagickOffsetType
i;
unsigned short
value;
i=(MagickOffsetType) radon_info->height*x+y;
if ((i < 0) ||
((MagickSizeType) (i*sizeof(*radon_info->cells)) >= radon_info->length))
return(0);
if (radon_info->type != DiskCache)
return(radon_info->cells[i]);
value=0;
(void) ReadRadonCell(radon_info,i*sizeof(*radon_info->cells),
sizeof(*radon_info->cells),(unsigned char *) &value);
return(value);
}
static inline MagickBooleanType SetRadonCell(const RadonInfo *radon_info,
const ssize_t x,const ssize_t y,const unsigned short value)
{
MagickOffsetType
i;
ssize_t
count;
i=(MagickOffsetType) radon_info->height*x+y;
if ((i < 0) ||
((MagickSizeType) (i*sizeof(*radon_info->cells)) >= radon_info->length))
return(MagickFalse);
if (radon_info->type != DiskCache)
{
radon_info->cells[i]=value;
return(MagickTrue);
}
count=WriteRadonCell(radon_info,i*sizeof(*radon_info->cells),
sizeof(*radon_info->cells),(const unsigned char *) &value);
if (count != (ssize_t) sizeof(*radon_info->cells))
return(MagickFalse);
return(MagickTrue);
}
static void RadonProjection(RadonInfo *source_cells,
RadonInfo *destination_cells,const ssize_t sign,size_t *projection)
{
RadonInfo
*swap;
register ssize_t
x;
register RadonInfo
*p,
*q;
size_t
step;
p=source_cells;
q=destination_cells;
for (step=1; step < p->width; step*=2)
{
for (x=0; x < (ssize_t) p->width; x+=2*(ssize_t) step)
{
register ssize_t
i;
ssize_t
y;
unsigned short
cell;
for (i=0; i < (ssize_t) step; i++)
{
for (y=0; y < (ssize_t) (p->height-i-1); y++)
{
cell=GetRadonCell(p,x+i,y);
(void) SetRadonCell(q,x+2*i,y,cell+GetRadonCell(p,x+i+(ssize_t)
step,y+i));
(void) SetRadonCell(q,x+2*i+1,y,cell+GetRadonCell(p,x+i+(ssize_t)
step,y+i+1));
}
for ( ; y < (ssize_t) (p->height-i); y++)
{
cell=GetRadonCell(p,x+i,y);
(void) SetRadonCell(q,x+2*i,y,cell+GetRadonCell(p,x+i+(ssize_t) step,
y+i));
(void) SetRadonCell(q,x+2*i+1,y,cell);
}
for ( ; y < (ssize_t) p->height; y++)
{
cell=GetRadonCell(p,x+i,y);
(void) SetRadonCell(q,x+2*i,y,cell);
(void) SetRadonCell(q,x+2*i+1,y,cell);
}
}
}
swap=p;
p=q;
q=swap;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4)
#endif
for (x=0; x < (ssize_t) p->width; x++)
{
register ssize_t
y;
size_t
sum;
sum=0;
for (y=0; y < (ssize_t) (p->height-1); y++)
{
ssize_t
delta;
delta=GetRadonCell(p,x,y)-(ssize_t) GetRadonCell(p,x,y+1);
sum+=delta*delta;
}
projection[p->width+sign*x-1]=sum;
}
}
static MagickBooleanType RadonTransform(const Image *image,
const double threshold,size_t *projection,ExceptionInfo *exception)
{
CacheView
*image_view;
MagickBooleanType
status;
RadonInfo
*destination_cells,
*source_cells;
register ssize_t
i;
size_t
count,
width;
ssize_t
y;
unsigned char
byte;
unsigned short
bits[256];
for (width=1; width < ((image->columns+7)/8); width<<=1) ;
source_cells=AcquireRadonInfo(image,width,image->rows,exception);
destination_cells=AcquireRadonInfo(image,width,image->rows,exception);
if ((source_cells == (RadonInfo *) NULL) ||
(destination_cells == (RadonInfo *) NULL))
{
if (destination_cells != (RadonInfo *) NULL)
destination_cells=DestroyRadonInfo(destination_cells);
if (source_cells != (RadonInfo *) NULL)
source_cells=DestroyRadonInfo(source_cells);
return(MagickFalse);
}
if (ResetRadonCells(source_cells) == MagickFalse)
{
destination_cells=DestroyRadonInfo(destination_cells);
source_cells=DestroyRadonInfo(source_cells);
return(MagickFalse);
}
for (i=0; i < 256; i++)
{
byte=(unsigned char) i;
for (count=0; byte != 0; byte>>=1)
count+=byte & 0x01;
bits[i]=(unsigned short) count;
}
status=MagickTrue;
image_view=AcquireCacheView(image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*restrict p;
register ssize_t
i,
x;
size_t
bit,
byte;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
bit=0;
byte=0;
i=(ssize_t) (image->columns+7)/8;
for (x=0; x < (ssize_t) image->columns; x++)
{
byte<<=1;
if (((MagickRealType) GetPixelRed(p) < threshold) ||
((MagickRealType) GetPixelGreen(p) < threshold) ||
((MagickRealType) GetPixelBlue(p) < threshold))
byte|=0x01;
bit++;
if (bit == 8)
{
(void) SetRadonCell(source_cells,--i,y,bits[byte]);
bit=0;
byte=0;
}
p++;
}
if (bit != 0)
{
byte<<=(8-bit);
(void) SetRadonCell(source_cells,--i,y,bits[byte]);
}
}
RadonProjection(source_cells,destination_cells,-1,projection);
(void) ResetRadonCells(source_cells);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(status)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*restrict p;
register ssize_t
i,
x;
size_t
bit,
byte;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
bit=0;
byte=0;
i=0;
for (x=0; x < (ssize_t) image->columns; x++)
{
byte<<=1;
if (((MagickRealType) GetPixelRed(p) < threshold) ||
((MagickRealType) GetPixelGreen(p) < threshold) ||
((MagickRealType) GetPixelBlue(p) < threshold))
byte|=0x01;
bit++;
if (bit == 8)
{
(void) SetRadonCell(source_cells,i++,y,bits[byte]);
bit=0;
byte=0;
}
p++;
}
if (bit != 0)
{
byte<<=(8-bit);
(void) SetRadonCell(source_cells,i++,y,bits[byte]);
}
}
RadonProjection(source_cells,destination_cells,1,projection);
image_view=DestroyCacheView(image_view);
destination_cells=DestroyRadonInfo(destination_cells);
source_cells=DestroyRadonInfo(source_cells);
return(MagickTrue);
}
static void GetImageBackgroundColor(Image *image,const ssize_t offset,
ExceptionInfo *exception)
{
CacheView
*image_view;
MagickPixelPacket
background;
MagickRealType
count;
ssize_t
y;
/*
Compute average background color.
*/
if (offset <= 0)
return;
GetMagickPixelPacket(image,&background);
count=0.0;
image_view=AcquireCacheView(image);
for (y=0; y < (ssize_t) image->rows; y++)
{
register const PixelPacket
*restrict p;
register ssize_t
x;
if ((y >= offset) && (y < ((ssize_t) image->rows-offset)))
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,exception);
if (p == (const PixelPacket *) NULL)
continue;
for (x=0; x < (ssize_t) image->columns; x++)
{
if ((x >= offset) && (x < ((ssize_t) image->columns-offset)))
continue;
background.red+=QuantumScale*GetPixelRed(p);
background.green+=QuantumScale*GetPixelGreen(p);
background.blue+=QuantumScale*GetPixelBlue(p);
background.opacity+=QuantumScale*GetPixelOpacity(p);
count++;
p++;
}
}
image_view=DestroyCacheView(image_view);
image->background_color.red=ClampToQuantum((MagickRealType) QuantumRange*
background.red/count);
image->background_color.green=ClampToQuantum((MagickRealType) QuantumRange*
background.green/count);
image->background_color.blue=ClampToQuantum((MagickRealType) QuantumRange*
background.blue/count);
image->background_color.opacity=ClampToQuantum((MagickRealType) QuantumRange*
background.opacity/count);
}
MagickExport Image *DeskewImage(const Image *image,const double threshold,
ExceptionInfo *exception)
{
AffineMatrix
affine_matrix;
const char
*artifact;
double
degrees;
Image
*clone_image,
*crop_image,
*deskew_image,
*median_image;
MagickBooleanType
status;
RectangleInfo
geometry;
register ssize_t
i;
size_t
max_projection,
*projection,
width;
ssize_t
skew;
/*
Compute deskew angle.
*/
for (width=1; width < ((image->columns+7)/8); width<<=1) ;
projection=(size_t *) AcquireQuantumMemory((size_t) (2*width-1),
sizeof(*projection));
if (projection == (size_t *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
status=RadonTransform(image,threshold,projection,exception);
if (status == MagickFalse)
{
projection=(size_t *) RelinquishMagickMemory(projection);
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
}
max_projection=0;
skew=0;
for (i=0; i < (ssize_t) (2*width-1); i++)
{
if (projection[i] > max_projection)
{
skew=i-(ssize_t) width+1;
max_projection=projection[i];
}
}
projection=(size_t *) RelinquishMagickMemory(projection);
/*
Deskew image.
*/
clone_image=CloneImage(image,0,0,MagickTrue,exception);
if (clone_image == (Image *) NULL)
return((Image *) NULL);
(void) SetImageVirtualPixelMethod(clone_image,BackgroundVirtualPixelMethod);
degrees=RadiansToDegrees(-atan((double) skew/width/8));
if (image->debug != MagickFalse)
(void) LogMagickEvent(TransformEvent,GetMagickModule(),
" Deskew angle: %g",degrees);
affine_matrix.sx=cos(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.rx=sin(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.ry=(-sin(DegreesToRadians(fmod((double) degrees,360.0))));
affine_matrix.sy=cos(DegreesToRadians(fmod((double) degrees,360.0)));
affine_matrix.tx=0.0;
affine_matrix.ty=0.0;
artifact=GetImageArtifact(image,"deskew:auto-crop");
if (artifact == (const char *) NULL)
{
deskew_image=AffineTransformImage(clone_image,&affine_matrix,exception);
clone_image=DestroyImage(clone_image);
return(deskew_image);
}
/*
Auto-crop image.
*/
GetImageBackgroundColor(clone_image,(ssize_t) StringToLong(artifact),
exception);
deskew_image=AffineTransformImage(clone_image,&affine_matrix,exception);
clone_image=DestroyImage(clone_image);
if (deskew_image == (Image *) NULL)
return((Image *) NULL);
median_image=StatisticImage(deskew_image,MedianStatistic,3,3,exception);
if (median_image == (Image *) NULL)
{
deskew_image=DestroyImage(deskew_image);
return((Image *) NULL);
}
geometry=GetImageBoundingBox(median_image,exception);
median_image=DestroyImage(median_image);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TransformEvent,GetMagickModule()," Deskew geometry: "
"%.20gx%.20g%+.20g%+.20g",(double) geometry.width,(double)
geometry.height,(double) geometry.x,(double) geometry.y);
crop_image=CropImage(deskew_image,&geometry,exception);
deskew_image=DestroyImage(deskew_image);
return(crop_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ I n t e g r a l R o t a t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% IntegralRotateImage() rotates the image an integral of 90 degrees. It
% allocates the memory necessary for the new Image structure and returns a
% pointer to the rotated image.
%
% The format of the IntegralRotateImage method is:
%
% Image *IntegralRotateImage(const Image *image,size_t rotations,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o rotations: Specifies the number of 90 degree rotations.
%
*/
static Image *IntegralRotateImage(const Image *image,size_t rotations,
ExceptionInfo *exception)
{
#define RotateImageTag "Rotate/Image"
CacheView
*image_view,
*rotate_view;
Image
*rotate_image;
MagickBooleanType
status;
MagickOffsetType
progress;
RectangleInfo
page;
ssize_t
y;
/*
Initialize rotated image attributes.
*/
assert(image != (Image *) NULL);
page=image->page;
rotations%=4;
if (rotations == 0)
return(CloneImage(image,0,0,MagickTrue,exception));
if ((rotations == 1) || (rotations == 3))
rotate_image=CloneImage(image,image->rows,image->columns,MagickTrue,
exception);
else
rotate_image=CloneImage(image,image->columns,image->rows,MagickTrue,
exception);
if (rotate_image == (Image *) NULL)
return((Image *) NULL);
/*
Integral rotate the image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
rotate_view=AcquireCacheView(rotate_image);
switch (rotations)
{
case 0:
{
/*
Rotate 0 degrees.
*/
break;
}
case 1:
{
size_t
tile_height,
tile_width;
ssize_t
tile_y;
/*
Rotate 90 degrees.
*/
GetPixelCacheTileSize(image,&tile_width,&tile_height);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress, status)
#endif
for (tile_y=0; tile_y < (ssize_t) image->rows; tile_y+=(ssize_t) tile_height)
{
register ssize_t
tile_x;
if (status == MagickFalse)
continue;
for (tile_x=0; tile_x < (ssize_t) image->columns; tile_x+=(ssize_t) tile_width)
{
MagickBooleanType
sync;
register const IndexPacket
*restrict indexes;
register const PixelPacket
*restrict p;
register IndexPacket
*restrict rotate_indexes;
register PixelPacket
*restrict q;
register ssize_t
y;
size_t
height,
width;
width=tile_width;
if ((tile_x+(ssize_t) tile_width) > (ssize_t) image->columns)
width=(size_t) (tile_width-(tile_x+tile_width-image->columns));
height=tile_height;
if ((tile_y+(ssize_t) tile_height) > (ssize_t) image->rows)
height=(size_t) (tile_height-(tile_y+tile_height-image->rows));
p=GetCacheViewVirtualPixels(image_view,tile_x,tile_y,width,height,
exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
break;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
for (y=0; y < (ssize_t) width; y++)
{
register const PixelPacket
*restrict tile_pixels;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(rotate_view,(ssize_t)
(rotate_image->columns-(tile_y+height)),y+tile_x,height,1,
exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
tile_pixels=p+(height-1)*width+y;
for (x=0; x < (ssize_t) height; x++)
{
*q++=(*tile_pixels);
tile_pixels-=width;
}
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
{
register const IndexPacket
*restrict tile_indexes;
tile_indexes=indexes+(height-1)*width+y;
for (x=0; x < (ssize_t) height; x++)
{
*rotate_indexes++=(*tile_indexes);
tile_indexes-=width;
}
}
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
}
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress+=tile_height,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
(void) SetImageProgress(image,RotateImageTag,(MagickOffsetType)
image->rows-1,image->rows);
Swap(page.width,page.height);
Swap(page.x,page.y);
if (page.width != 0)
page.x=(ssize_t) (page.width-rotate_image->columns-page.x);
break;
}
case 2:
{
/*
Rotate 180 degrees.
*/
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status) omp_throttle(1)
#endif
for (y=0; y < (ssize_t) image->rows; y++)
{
MagickBooleanType
sync;
register const IndexPacket
*restrict indexes;
register const PixelPacket
*restrict p;
register IndexPacket
*restrict rotate_indexes;
register PixelPacket
*restrict q;
register ssize_t
x;
if (status == MagickFalse)
continue;
p=GetCacheViewVirtualPixels(image_view,0,y,image->columns,1,
exception);
q=QueueCacheViewAuthenticPixels(rotate_view,0,(ssize_t) (image->rows-y-
1),image->columns,1,exception);
if ((p == (const PixelPacket *) NULL) || (q == (PixelPacket *) NULL))
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
q+=image->columns;
for (x=0; x < (ssize_t) image->columns; x++)
*--q=(*p++);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
for (x=0; x < (ssize_t) image->columns; x++)
SetPixelIndex(rotate_indexes+image->columns-x-1,
GetPixelIndex(indexes+x));
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress++,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
if (page.width != 0)
page.x=(ssize_t) (page.width-rotate_image->columns-page.x);
if (page.height != 0)
page.y=(ssize_t) (page.height-rotate_image->rows-page.y);
break;
}
case 3:
{
size_t
tile_height,
tile_width;
ssize_t
tile_y;
/*
Rotate 270 degrees.
*/
GetPixelCacheTileSize(image,&tile_width,&tile_height);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress,status)
#endif
for (tile_y=0; tile_y < (ssize_t) image->rows; tile_y+=(ssize_t) tile_height)
{
register ssize_t
tile_x;
if (status == MagickFalse)
continue;
for (tile_x=0; tile_x < (ssize_t) image->columns; tile_x+=(ssize_t) tile_width)
{
MagickBooleanType
sync;
register const IndexPacket
*restrict indexes;
register const PixelPacket
*restrict p;
register IndexPacket
*restrict rotate_indexes;
register PixelPacket
*restrict q;
register ssize_t
y;
size_t
height,
width;
width=tile_width;
if ((tile_x+(ssize_t) tile_width) > (ssize_t) image->columns)
width=(size_t) (tile_width-(tile_x+tile_width-image->columns));
height=tile_height;
if ((tile_y+(ssize_t) tile_height) > (ssize_t) image->rows)
height=(size_t) (tile_height-(tile_y+tile_height-image->rows));
p=GetCacheViewVirtualPixels(image_view,tile_x,tile_y,width,height,
exception);
if (p == (const PixelPacket *) NULL)
{
status=MagickFalse;
break;
}
indexes=GetCacheViewVirtualIndexQueue(image_view);
for (y=0; y < (ssize_t) width; y++)
{
register const PixelPacket
*restrict tile_pixels;
register ssize_t
x;
if (status == MagickFalse)
continue;
q=QueueCacheViewAuthenticPixels(rotate_view,tile_y,(ssize_t) (y+
rotate_image->rows-(tile_x+width)),height,1,exception);
if (q == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
tile_pixels=p+(width-1)-y;
for (x=0; x < (ssize_t) height; x++)
{
*q++=(*tile_pixels);
tile_pixels+=width;
}
rotate_indexes=GetCacheViewAuthenticIndexQueue(rotate_view);
if ((indexes != (IndexPacket *) NULL) &&
(rotate_indexes != (IndexPacket *) NULL))
{
register const IndexPacket
*restrict tile_indexes;
tile_indexes=indexes+(width-1)-y;
for (x=0; x < (ssize_t) height; x++)
{
*rotate_indexes++=(*tile_indexes);
tile_indexes+=width;
}
}
sync=SyncCacheViewAuthenticPixels(rotate_view,exception);
if (sync == MagickFalse)
status=MagickFalse;
}
}
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_IntegralRotateImage)
#endif
proceed=SetImageProgress(image,RotateImageTag,progress+=tile_height,
image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
(void) SetImageProgress(image,RotateImageTag,(MagickOffsetType)
image->rows-1,image->rows);
Swap(page.width,page.height);
Swap(page.x,page.y);
if (page.height != 0)
page.y=(ssize_t) (page.height-rotate_image->rows-page.y);
break;
}
}
rotate_view=DestroyCacheView(rotate_view);
image_view=DestroyCacheView(image_view);
rotate_image->type=image->type;
rotate_image->page=page;
if (status == MagickFalse)
rotate_image=DestroyImage(rotate_image);
return(rotate_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ X S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% XShearImage() shears the image in the X direction with a shear angle of
% 'degrees'. Positive angles shear counter-clockwise (right-hand rule), and
% negative angles shear clockwise. Angles are measured relative to a vertical
% Y-axis. X shears will widen an image creating 'empty' triangles on the left
% and right sides of the source image.
%
% The format of the XShearImage method is:
%
% MagickBooleanType XShearImage(Image *image,const MagickRealType degrees,
% const size_t width,const size_t height,
% const ssize_t x_offset,const ssize_t y_offset,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: A MagickRealType representing the shearing angle along the X
% axis.
%
% o width, height, x_offset, y_offset: Defines a region of the image
% to shear.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType XShearImage(Image *image,const MagickRealType degrees,
const size_t width,const size_t height,const ssize_t x_offset,
const ssize_t y_offset,ExceptionInfo *exception)
{
#define XShearImageTag "XShear/Image"
typedef enum
{
LEFT,
RIGHT
} ShearDirection;
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
background;
ssize_t
y;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
GetMagickPixelPacket(image,&background);
SetMagickPixelPacket(image,&image->background_color,(IndexPacket *) NULL,
&background);
if (image->colorspace == CMYKColorspace)
ConvertRGBToCMYK(&background);
/*
X shear image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress, status)
#endif
for (y=0; y < (ssize_t) height; y++)
{
MagickPixelPacket
pixel,
source,
destination;
MagickRealType
area,
displacement;
register IndexPacket
*restrict indexes,
*restrict shear_indexes;
register PixelPacket
*restrict p,
*restrict q;
register ssize_t
i;
ShearDirection
direction;
ssize_t
step;
if (status == MagickFalse)
continue;
p=GetCacheViewAuthenticPixels(image_view,0,y_offset+y,image->columns,1,
exception);
if (p == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(image_view);
p+=x_offset;
indexes+=x_offset;
displacement=degrees*(MagickRealType) (y-height/2.0);
if (displacement == 0.0)
continue;
if (displacement > 0.0)
direction=RIGHT;
else
{
displacement*=(-1.0);
direction=LEFT;
}
step=(ssize_t) floor((double) displacement);
area=(MagickRealType) (displacement-step);
step++;
pixel=background;
GetMagickPixelPacket(image,&source);
GetMagickPixelPacket(image,&destination);
switch (direction)
{
case LEFT:
{
/*
Transfer pixels left-to-right.
*/
if (step > x_offset)
break;
q=p-step;
shear_indexes=indexes-step;
for (i=0; i < (ssize_t) width; i++)
{
if ((x_offset+i) < step)
{
SetMagickPixelPacket(image,++p,++indexes,&pixel);
q++;
shear_indexes++;
continue;
}
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
SetMagickPixelPacket(image,p++,indexes++,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,q++,shear_indexes++);
break;
}
case RIGHT:
{
/*
Transfer pixels right-to-left.
*/
p+=width;
indexes+=width;
q=p+step;
shear_indexes=indexes+step;
for (i=0; i < (ssize_t) width; i++)
{
p--;
indexes--;
q--;
shear_indexes--;
if ((size_t) (x_offset+width+step-i) >= image->columns)
continue;
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q,shear_indexes);
SetMagickPixelPacket(image,p,indexes,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,--q,--shear_indexes);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,--q,--shear_indexes);
break;
}
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_XShearImage)
#endif
proceed=SetImageProgress(image,XShearImageTag,progress++,height);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
+ Y S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% YShearImage shears the image in the Y direction with a shear angle of
% 'degrees'. Positive angles shear counter-clockwise (right-hand rule), and
% negative angles shear clockwise. Angles are measured relative to a
% horizontal X-axis. Y shears will increase the height of an image creating
% 'empty' triangles on the top and bottom of the source image.
%
% The format of the YShearImage method is:
%
% MagickBooleanType YShearImage(Image *image,const MagickRealType degrees,
% const size_t width,const size_t height,
% const ssize_t x_offset,const ssize_t y_offset,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: A MagickRealType representing the shearing angle along the Y
% axis.
%
% o width, height, x_offset, y_offset: Defines a region of the image
% to shear.
%
% o exception: return any errors or warnings in this structure.
%
*/
static MagickBooleanType YShearImage(Image *image,const MagickRealType degrees,
const size_t width,const size_t height,const ssize_t x_offset,
const ssize_t y_offset,ExceptionInfo *exception)
{
#define YShearImageTag "YShear/Image"
typedef enum
{
UP,
DOWN
} ShearDirection;
CacheView
*image_view;
MagickBooleanType
status;
MagickOffsetType
progress;
MagickPixelPacket
background;
ssize_t
x;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
GetMagickPixelPacket(image,&background);
SetMagickPixelPacket(image,&image->background_color,(IndexPacket *) NULL,
&background);
if (image->colorspace == CMYKColorspace)
ConvertRGBToCMYK(&background);
/*
Y Shear image.
*/
status=MagickTrue;
progress=0;
image_view=AcquireCacheView(image);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(dynamic,4) shared(progress, status)
#endif
for (x=0; x < (ssize_t) width; x++)
{
ssize_t
step;
MagickPixelPacket
pixel,
source,
destination;
MagickRealType
area,
displacement;
register IndexPacket
*restrict indexes,
*restrict shear_indexes;
register ssize_t
i;
register PixelPacket
*restrict p,
*restrict q;
ShearDirection
direction;
if (status == MagickFalse)
continue;
p=GetCacheViewAuthenticPixels(image_view,x_offset+x,0,1,image->rows,
exception);
if (p == (PixelPacket *) NULL)
{
status=MagickFalse;
continue;
}
indexes=GetCacheViewAuthenticIndexQueue(image_view);
p+=y_offset;
indexes+=y_offset;
displacement=degrees*(MagickRealType) (x-width/2.0);
if (displacement == 0.0)
continue;
if (displacement > 0.0)
direction=DOWN;
else
{
displacement*=(-1.0);
direction=UP;
}
step=(ssize_t) floor((double) displacement);
area=(MagickRealType) (displacement-step);
step++;
pixel=background;
GetMagickPixelPacket(image,&source);
GetMagickPixelPacket(image,&destination);
switch (direction)
{
case UP:
{
/*
Transfer pixels top-to-bottom.
*/
if (step > y_offset)
break;
q=p-step;
shear_indexes=indexes-step;
for (i=0; i < (ssize_t) height; i++)
{
if ((y_offset+i) < step)
{
SetMagickPixelPacket(image,++p,++indexes,&pixel);
q++;
shear_indexes++;
continue;
}
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
SetMagickPixelPacket(image,p++,indexes++,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,q++,shear_indexes++);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,q++,shear_indexes++);
break;
}
case DOWN:
{
/*
Transfer pixels bottom-to-top.
*/
p+=height;
indexes+=height;
q=p+step;
shear_indexes=indexes+step;
for (i=0; i < (ssize_t) height; i++)
{
p--;
indexes--;
q--;
shear_indexes--;
if ((size_t) (y_offset+height+step-i) >= image->rows)
continue;
SetMagickPixelPacket(image,p,indexes,&source);
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&source,(MagickRealType) GetPixelOpacity(p),area,&destination);
SetPixelPacket(image,&destination,q,shear_indexes);
SetMagickPixelPacket(image,p,indexes,&pixel);
}
MagickPixelCompositeAreaBlend(&pixel,(MagickRealType) pixel.opacity,
&background,(MagickRealType) background.opacity,area,&destination);
SetPixelPacket(image,&destination,--q,--shear_indexes);
for (i=0; i < (step-1); i++)
SetPixelPacket(image,&background,--q,--shear_indexes);
break;
}
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
status=MagickFalse;
if (image->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_YShearImage)
#endif
proceed=SetImageProgress(image,YShearImageTag,progress++,image->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
image_view=DestroyCacheView(image_view);
return(status);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% R o t a t e I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% RotateImage() creates a new image that is a rotated copy of an existing
% one. Positive angles rotate counter-clockwise (right-hand rule), while
% negative angles rotate clockwise. Rotated images are usually larger than
% the originals and have 'empty' triangular corners. X axis. Empty
% triangles left over from shearing the image are filled with the background
% color defined by member 'background_color' of the image. RotateImage
% allocates the memory necessary for the new Image structure and returns a
% pointer to the new image.
%
% RotateImage() is based on the paper "A Fast Algorithm for General
% Raster Rotatation" by Alan W. Paeth. RotateImage is adapted from a similar
% method based on the Paeth paper written by Michael Halle of the Spatial
% Imaging Group, MIT Media Lab.
%
% The format of the RotateImage method is:
%
% Image *RotateImage(const Image *image,const double degrees,
% ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o degrees: Specifies the number of degrees to rotate the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *RotateImage(const Image *image,const double degrees,
ExceptionInfo *exception)
{
Image
*integral_image,
*rotate_image;
ssize_t
x_offset,
y_offset;
MagickBooleanType
status;
MagickRealType
angle;
PointInfo
shear;
RectangleInfo
border_info;
size_t
height,
rotations,
width,
y_width;
/*
Adjust rotation angle.
*/
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
angle=degrees;
while (angle < -45.0)
angle+=360.0;
for (rotations=0; angle > 45.0; rotations++)
angle-=90.0;
rotations%=4;
/*
Calculate shear equations.
*/
integral_image=IntegralRotateImage(image,rotations,exception);
if (integral_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
shear.x=(-tan((double) DegreesToRadians(angle)/2.0));
shear.y=sin((double) DegreesToRadians(angle));
if ((shear.x == 0.0) && (shear.y == 0.0))
return(integral_image);
if (SetImageStorageClass(integral_image,DirectClass) == MagickFalse)
{
InheritException(exception,&integral_image->exception);
integral_image=DestroyImage(integral_image);
return(integral_image);
}
if (integral_image->matte == MagickFalse)
(void) SetImageAlphaChannel(integral_image,OpaqueAlphaChannel);
/*
Compute image size.
*/
width=image->columns;
height=image->rows;
if ((rotations == 1) || (rotations == 3))
{
width=image->rows;
height=image->columns;
}
y_width=width+(ssize_t) floor(fabs(shear.x)*height+0.5);
x_offset=(ssize_t) ceil((double) width+((fabs(shear.y)*height)-width)/2.0-
0.5);
y_offset=(ssize_t) ceil((double) height+((fabs(shear.y)*y_width)-height)/2.0-
0.5);
/*
Surround image with a border.
*/
integral_image->border_color=integral_image->background_color;
integral_image->compose=CopyCompositeOp;
border_info.width=(size_t) x_offset;
border_info.height=(size_t) y_offset;
rotate_image=BorderImage(integral_image,&border_info,exception);
integral_image=DestroyImage(integral_image);
if (rotate_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
/*
Rotate the image.
*/
status=XShearImage(rotate_image,shear.x,width,height,x_offset,(ssize_t)
(rotate_image->rows-height)/2,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=YShearImage(rotate_image,shear.y,y_width,height,(ssize_t)
(rotate_image->columns-y_width)/2,y_offset,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=XShearImage(rotate_image,shear.x,y_width,rotate_image->rows,(ssize_t)
(rotate_image->columns-y_width)/2,0,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
status=CropToFitImage(&rotate_image,shear.x,shear.y,(MagickRealType) width,
(MagickRealType) height,MagickTrue,exception);
if (status == MagickFalse)
{
rotate_image=DestroyImage(rotate_image);
return((Image *) NULL);
}
rotate_image->compose=image->compose;
rotate_image->page.width=0;
rotate_image->page.height=0;
return(rotate_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% S h e a r I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ShearImage() creates a new image that is a shear_image copy of an existing
% one. Shearing slides one edge of an image along the X or Y axis, creating
% a parallelogram. An X direction shear slides an edge along the X axis,
% while a Y direction shear slides an edge along the Y axis. The amount of
% the shear is controlled by a shear angle. For X direction shears, x_shear
% is measured relative to the Y axis, and similarly, for Y direction shears
% y_shear is measured relative to the X axis. Empty triangles left over from
% shearing the image are filled with the background color defined by member
% 'background_color' of the image.. ShearImage() allocates the memory
% necessary for the new Image structure and returns a pointer to the new image.
%
% ShearImage() is based on the paper "A Fast Algorithm for General Raster
% Rotatation" by Alan W. Paeth.
%
% The format of the ShearImage method is:
%
% Image *ShearImage(const Image *image,const double x_shear,
% const double y_shear,ExceptionInfo *exception)
%
% A description of each parameter follows.
%
% o image: the image.
%
% o x_shear, y_shear: Specifies the number of degrees to shear the image.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ShearImage(const Image *image,const double x_shear,
const double y_shear,ExceptionInfo *exception)
{
Image
*integral_image,
*shear_image;
ssize_t
x_offset,
y_offset;
MagickBooleanType
status;
PointInfo
shear;
RectangleInfo
border_info;
size_t
y_width;
assert(image != (Image *) NULL);
assert(image->signature == MagickSignature);
if (image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",image->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
if ((x_shear != 0.0) && (fmod(x_shear,90.0) == 0.0))
ThrowImageException(ImageError,"AngleIsDiscontinuous");
if ((y_shear != 0.0) && (fmod(y_shear,90.0) == 0.0))
ThrowImageException(ImageError,"AngleIsDiscontinuous");
/*
Initialize shear angle.
*/
integral_image=CloneImage(image,0,0,MagickTrue,exception);
if (integral_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
shear.x=(-tan(DegreesToRadians(fmod(x_shear,360.0))));
shear.y=tan(DegreesToRadians(fmod(y_shear,360.0)));
if ((shear.x == 0.0) && (shear.y == 0.0))
return(integral_image);
if (SetImageStorageClass(integral_image,DirectClass) == MagickFalse)
{
InheritException(exception,&integral_image->exception);
integral_image=DestroyImage(integral_image);
return(integral_image);
}
if (integral_image->matte == MagickFalse)
(void) SetImageAlphaChannel(integral_image,OpaqueAlphaChannel);
/*
Compute image size.
*/
y_width=image->columns+(ssize_t) floor(fabs(shear.x)*image->rows+0.5);
x_offset=(ssize_t) ceil((double) image->columns+((fabs(shear.x)*image->rows)-
image->columns)/2.0-0.5);
y_offset=(ssize_t) ceil((double) image->rows+((fabs(shear.y)*y_width)-
image->rows)/2.0-0.5);
/*
Surround image with border.
*/
integral_image->border_color=integral_image->background_color;
integral_image->compose=CopyCompositeOp;
border_info.width=(size_t) x_offset;
border_info.height=(size_t) y_offset;
shear_image=BorderImage(integral_image,&border_info,exception);
integral_image=DestroyImage(integral_image);
if (shear_image == (Image *) NULL)
ThrowImageException(ResourceLimitError,"MemoryAllocationFailed");
/*
Shear the image.
*/
if (shear_image->matte == MagickFalse)
(void) SetImageAlphaChannel(shear_image,OpaqueAlphaChannel);
status=XShearImage(shear_image,shear.x,image->columns,image->rows,x_offset,
(ssize_t) (shear_image->rows-image->rows)/2,exception);
if (status == MagickFalse)
{
shear_image=DestroyImage(shear_image);
return((Image *) NULL);
}
status=YShearImage(shear_image,shear.y,y_width,image->rows,(ssize_t)
(shear_image->columns-y_width)/2,y_offset,exception);
if (status == MagickFalse)
{
shear_image=DestroyImage(shear_image);
return((Image *) NULL);
}
status=CropToFitImage(&shear_image,shear.x,shear.y,(MagickRealType)
image->columns,(MagickRealType) image->rows,MagickFalse,exception);
if (status == MagickFalse)
{
shear_image=DestroyImage(shear_image);
return((Image *) NULL);
}
shear_image->compose=image->compose;
shear_image->page.width=0;
shear_image->page.height=0;
return(shear_image);
}
|
RingSettlementCircuit.h | #ifndef _RINGSETTLEMENTCIRCUIT_H_
#define _RINGSETTLEMENTCIRCUIT_H_
#include "Circuit.h"
#include "../Utils/Constants.h"
#include "../Utils/Data.h"
#include "../Utils/Utils.h"
#include "../Gadgets/MatchingGadgets.h"
#include "../Gadgets/AccountGadgets.h"
#include "../Gadgets/TradingHistoryGadgets.h"
#include "../Gadgets/MathGadgets.h"
#include "ethsnarks.hpp"
#include "utils.hpp"
#include "gadgets/subadd.hpp"
using namespace ethsnarks;
namespace Loopring
{
// Transforms the DA data for ring settlements
class TransformRingSettlementDataGadget : public GadgetT
{
public:
const unsigned int ringSize = 21 * 8;
VariableArrayT data;
Bitstream transformedData;
unsigned int numRings;
std::vector<XorArrayGadget> xorGadgets;
TransformRingSettlementDataGadget(
ProtoboardT& pb,
const std::string& prefix
) :
GadgetT(pb, prefix)
{
numRings = 0;
}
VariableArrayT result()
{
return flatten(transformedData.data);
}
void generate_r1cs_witness()
{
for (unsigned int i = 0; i < xorGadgets.size(); i++)
{
xorGadgets[i].generate_r1cs_witness();
}
}
void generate_r1cs_constraints(unsigned int numRings, const VariableArrayT& data)
{
this->numRings = numRings;
this->data = data;
assert(numRings > 0);
assert(numRings * ringSize == data.size());
// XOR compress
Bitstream compressedData;
compressedData.add(subArray(data, 0, numRings * ringSize));
/*for (unsigned int i = 1; i < numRings; i++)
{
unsigned int previousRingStart = (i - 1) * ringSize;
unsigned int ringStart = i * ringSize;
xorGadgets.emplace_back(pb, subArray(data, previousRingStart, 5 * 8),
subArray(data, ringStart, 5 * 8),
std::string("xor_") + std::to_string(i));
xorGadgets.back().generate_r1cs_constraints();
compressedData.add(xorGadgets.back().result());
compressedData.add(subArray(data, ringStart + 5 * 8, ringSize - 5 * 8));
}*/
// Transform
struct Range
{
unsigned int offset;
unsigned int length;
};
std::vector<std::vector<Range>> ranges;
ranges.push_back({{0, 32}}); // orderA.tradeHistoryData + orderB.tradeHistoryData
ranges.push_back({{32, 48}}); // orderA.accountID + orderB.accountID
ranges.push_back({{80, 24}}); // orderA.tokenS + orderB.tokenS
ranges.push_back({{104, 48}}); // orderA.fillS + orderB.fillS
ranges.push_back({{152, 8}}); // orderA.data
ranges.push_back({{160, 8}}); // orderB.data
for (const std::vector<Range>& subRanges : ranges)
{
for (unsigned int i = 0; i < numRings; i++)
{
for (const Range& subRange : subRanges)
{
unsigned int ringStart = i * ringSize;
transformedData.add(subArray(flatten(compressedData.data), ringStart + subRange.offset, subRange.length));
}
}
}
}
};
class RingSettlementGadget : public GadgetT
{
public:
const Constants& constants;
// Orders
OrderGadget orderA;
OrderGadget orderB;
// Balances
DynamicVariableGadget balanceS_A;
DynamicVariableGadget balanceB_A;
DynamicVariableGadget balanceS_B;
DynamicVariableGadget balanceB_B;
DynamicVariableGadget balanceA_P;
DynamicVariableGadget balanceB_P;
DynamicVariableGadget balanceA_O;
DynamicVariableGadget balanceB_O;
// Initial trading history roots
const VariableT tradingHistoryRootA_O;
const VariableT tradingHistoryRootB_O;
// Order fills
FloatGadget fillS_A;
FloatGadget fillS_B;
// Match orders
OrderMatchingGadget orderMatching;
// Calculate fees
FeeCalculatorGadget feeCalculatorA;
FeeCalculatorGadget feeCalculatorB;
/* Token Transfers */
// Actual trade
TransferGadget fillBB_from_balanceSA_to_balanceBB;
TransferGadget fillSB_from_balanceSB_to_balanceBA;
// Fees
TransferGadget feeA_from_balanceBA_to_balanceAO;
TransferGadget feeB_from_balanceBB_to_balanceBO;
// Rebates
TransferGadget rebateA_from_balanceAO_to_balanceBA;
TransferGadget rebateB_from_balanceBO_to_balanceBB;
// Protocol fees
TransferGadget protocolFeeA_from_balanceAO_to_balanceAP;
TransferGadget protocolFeeB_from_balanceBO_to_balanceBP;
// Update UserA
UpdateTradeHistoryGadget updateTradeHistory_A;
UpdateBalanceGadget updateBalanceS_A;
UpdateBalanceGadget updateBalanceB_A;
UpdateAccountGadget updateAccount_A;
// Update UserB
UpdateTradeHistoryGadget updateTradeHistory_B;
UpdateBalanceGadget updateBalanceS_B;
UpdateBalanceGadget updateBalanceB_B;
UpdateAccountGadget updateAccount_B;
// Update Protocol pool
UpdateBalanceGadget updateBalanceA_P;
UpdateBalanceGadget updateBalanceB_P;
// Update Operator
UpdateBalanceGadget updateBalanceA_O;
UpdateBalanceGadget updateBalanceB_O;
RingSettlementGadget(
ProtoboardT& pb,
const jubjub::Params& params,
const Constants& _constants,
const VariableT& exchangeID,
const VariableT& accountsRoot,
const VariableT& timestamp,
const VariableT& protocolTakerFeeBips,
const VariableT& protocolMakerFeeBips,
const VariableT& protocolBalancesRoot,
const VariableT& operatorBalancesRoot,
const std::string& prefix
) :
GadgetT(pb, prefix),
constants(_constants),
// Orders
orderA(pb, params, constants, exchangeID, FMT(prefix, ".orderA")),
orderB(pb, params, constants, exchangeID, FMT(prefix, ".orderB")),
// Balances
balanceS_A(pb, orderA.balanceSBefore.balance, FMT(prefix, ".balanceS_A")),
balanceB_A(pb, orderA.balanceBBefore.balance, FMT(prefix, ".balanceB_A")),
balanceS_B(pb, orderB.balanceSBefore.balance, FMT(prefix, ".balanceS_B")),
balanceB_B(pb, orderB.balanceBBefore.balance, FMT(prefix, ".balanceB_B")),
balanceA_P(pb, FMT(prefix, ".balanceA_P")),
balanceB_P(pb, FMT(prefix, ".balanceB_P")),
balanceA_O(pb, FMT(prefix, ".balanceA_O")),
balanceB_O(pb, FMT(prefix, ".balanceB_O")),
// Initial trading history roots
tradingHistoryRootA_O(make_variable(pb, FMT(prefix, ".tradingHistoryRootA_O"))),
tradingHistoryRootB_O(make_variable(pb, FMT(prefix, ".tradingHistoryRootB_O"))),
// Order fills
fillS_A(pb, constants, Float24Encoding, FMT(prefix, ".fillS_A")),
fillS_B(pb, constants, Float24Encoding, FMT(prefix, ".fillS_B")),
// Match orders
orderMatching(pb, constants, timestamp, orderA, orderB, fillS_A.value(), fillS_B.value(), FMT(prefix, ".orderMatching")),
// Calculate fees
feeCalculatorA(pb, constants, fillS_B.value(), protocolTakerFeeBips, orderA.feeBips.packed, orderA.rebateBips.packed, FMT(prefix, ".feeCalculatorA")),
feeCalculatorB(pb, constants, fillS_A.value(), protocolMakerFeeBips, orderB.feeBips.packed, orderB.rebateBips.packed, FMT(prefix, ".feeCalculatorB")),
/* Token Transfers */
// Actual trade
fillBB_from_balanceSA_to_balanceBB(pb, balanceS_A, balanceB_B, fillS_A.value(), FMT(prefix, ".fillBB_from_balanceSA_to_balanceBB")),
fillSB_from_balanceSB_to_balanceBA(pb, balanceS_B, balanceB_A, fillS_B.value(), FMT(prefix, ".fillSB_from_balanceSB_to_balanceBA")),
// Fees
feeA_from_balanceBA_to_balanceAO(pb, balanceB_A, balanceA_O, feeCalculatorA.getFee(), FMT(prefix, ".feeA_from_balanceBA_to_balanceAO")),
feeB_from_balanceBB_to_balanceBO(pb, balanceB_B, balanceB_O, feeCalculatorB.getFee(), FMT(prefix, ".feeB_from_balanceBB_to_balanceBO")),
// Rebates
rebateA_from_balanceAO_to_balanceBA(pb, balanceA_O, balanceB_A, feeCalculatorA.getRebate(), FMT(prefix, ".rebateA_from_balanceAO_to_balanceBA")),
rebateB_from_balanceBO_to_balanceBB(pb, balanceB_O, balanceB_B, feeCalculatorB.getRebate(), FMT(prefix, ".rebateB_from_balanceBO_to_balanceBB")),
// Protocol fees
protocolFeeA_from_balanceAO_to_balanceAP(pb, balanceA_O, balanceA_P, feeCalculatorA.getProtocolFee(), FMT(prefix, ".protocolFeeA_from_balanceAO_to_balanceAP")),
protocolFeeB_from_balanceBO_to_balanceBP(pb, balanceB_O, balanceB_P, feeCalculatorB.getProtocolFee(), FMT(prefix, ".protocolFeeB_from_balanceBO_to_balanceBP")),
// Update UserA
updateTradeHistory_A(pb, orderA.balanceSBefore.tradingHistory, subArray(orderA.orderID.bits, 0, NUM_BITS_TRADING_HISTORY),
{orderA.tradeHistoryBefore.filled, orderA.tradeHistoryBefore.orderID},
{orderMatching.getFilledAfter_A(), orderA.orderID.packed},
FMT(prefix, ".updateTradeHistory_A")),
updateBalanceS_A(pb, orderA.accountBefore.balancesRoot, orderA.tokenS.bits,
{balanceS_A.front(), orderA.balanceSBefore.tradingHistory},
{balanceS_A.back(), updateTradeHistory_A.result()},
FMT(prefix, ".updateBalanceS_A")),
updateBalanceB_A(pb, updateBalanceS_A.result(), orderA.tokenB.bits,
{balanceB_A.front(), orderA.balanceBBefore.tradingHistory},
{balanceB_A.back(), orderA.balanceBBefore.tradingHistory},
FMT(prefix, ".updateBalanceB_A")),
updateAccount_A(pb, accountsRoot, orderA.accountID.bits,
{orderA.accountBefore.publicKey.x, orderA.accountBefore.publicKey.y, orderA.accountBefore.nonce, orderA.accountBefore.balancesRoot},
{orderA.accountBefore.publicKey.x, orderA.accountBefore.publicKey.y, orderA.accountBefore.nonce, updateBalanceB_A.result()},
FMT(prefix, ".updateAccount_A")),
// Update UserB
updateTradeHistory_B(pb, orderB.balanceSBefore.tradingHistory, subArray(orderB.orderID.bits, 0, NUM_BITS_TRADING_HISTORY),
{orderB.tradeHistoryBefore.filled, orderB.tradeHistoryBefore.orderID},
{orderMatching.getFilledAfter_B(), orderB.orderID.packed},
FMT(prefix, ".updateTradeHistory_B")),
updateBalanceS_B(pb, orderB.accountBefore.balancesRoot, orderB.tokenS.bits,
{balanceS_B.front(), orderB.balanceSBefore.tradingHistory},
{balanceS_B.back(), updateTradeHistory_B.result()},
FMT(prefix, ".updateBalanceS_B")),
updateBalanceB_B(pb, updateBalanceS_B.result(), orderB.tokenB.bits,
{balanceB_B.front(), orderB.balanceBBefore.tradingHistory},
{balanceB_B.back(), orderB.balanceBBefore.tradingHistory},
FMT(prefix, ".updateBalanceB_B")),
updateAccount_B(pb, updateAccount_A.result(), orderB.accountID.bits,
{orderB.accountBefore.publicKey.x, orderB.accountBefore.publicKey.y, orderB.accountBefore.nonce, orderB.accountBefore.balancesRoot},
{orderB.accountBefore.publicKey.x, orderB.accountBefore.publicKey.y, orderB.accountBefore.nonce, updateBalanceB_B.result()},
FMT(prefix, ".updateAccount_B")),
// Update Protocol pool
updateBalanceA_P(pb, protocolBalancesRoot, orderA.tokenB.bits,
{balanceA_P.front(), constants.emptyTradeHistory},
{balanceA_P.back(), constants.emptyTradeHistory},
FMT(prefix, ".updateBalanceA_P")),
updateBalanceB_P(pb, updateBalanceA_P.result(), orderB.tokenB.bits,
{balanceB_P.front(), constants.emptyTradeHistory},
{balanceB_P.back(), constants.emptyTradeHistory},
FMT(prefix, ".updateBalanceB_P")),
// Update Operator
updateBalanceA_O(pb, operatorBalancesRoot, orderA.tokenB.bits,
{balanceA_O.front(), tradingHistoryRootA_O},
{balanceA_O.back(), tradingHistoryRootA_O},
FMT(prefix, ".updateBalanceA_O")),
updateBalanceB_O(pb, updateBalanceA_O.result(), orderB.tokenB.bits,
{balanceB_O.front(), tradingHistoryRootB_O},
{balanceB_O.back(), tradingHistoryRootB_O},
FMT(prefix, ".updateBalanceB_O"))
{
}
void generate_r1cs_witness(const RingSettlement& ringSettlement)
{
// Orders
orderA.generate_r1cs_witness(ringSettlement.ring.orderA,
ringSettlement.accountUpdate_A.before,
ringSettlement.balanceUpdateS_A.before,
ringSettlement.balanceUpdateB_A.before,
ringSettlement.tradeHistoryUpdate_A.before);
orderB.generate_r1cs_witness(ringSettlement.ring.orderB,
ringSettlement.accountUpdate_B.before,
ringSettlement.balanceUpdateS_B.before,
ringSettlement.balanceUpdateB_B.before,
ringSettlement.tradeHistoryUpdate_B.before);
// Balances before
balanceA_P.generate_r1cs_witness(ringSettlement.balanceUpdateA_P.before.balance);
balanceB_P.generate_r1cs_witness(ringSettlement.balanceUpdateB_P.before.balance);
balanceA_O.generate_r1cs_witness(ringSettlement.balanceUpdateA_O.before.balance);
balanceB_O.generate_r1cs_witness(ringSettlement.balanceUpdateB_O.before.balance);
// Trading history roots before
pb.val(tradingHistoryRootA_O) = ringSettlement.balanceUpdateA_O.before.tradingHistoryRoot;
pb.val(tradingHistoryRootB_O) = ringSettlement.balanceUpdateB_O.before.tradingHistoryRoot;
// Order fills
fillS_A.generate_r1cs_witness(ringSettlement.ring.fillS_A);
fillS_B.generate_r1cs_witness(ringSettlement.ring.fillS_B);
// Match orders
orderMatching.generate_r1cs_witness();
// Calculate fees
feeCalculatorA.generate_r1cs_witness();
feeCalculatorB.generate_r1cs_witness();
/* Token Transfers */
// Actual trade
fillBB_from_balanceSA_to_balanceBB.generate_r1cs_witness();
fillSB_from_balanceSB_to_balanceBA.generate_r1cs_witness();
// Fees
feeA_from_balanceBA_to_balanceAO.generate_r1cs_witness();
feeB_from_balanceBB_to_balanceBO.generate_r1cs_witness();
// Rebates
rebateA_from_balanceAO_to_balanceBA.generate_r1cs_witness();
rebateB_from_balanceBO_to_balanceBB.generate_r1cs_witness();
// Protocol fees
protocolFeeA_from_balanceAO_to_balanceAP.generate_r1cs_witness();
protocolFeeB_from_balanceBO_to_balanceBP.generate_r1cs_witness();
// Update UserA
updateTradeHistory_A.generate_r1cs_witness(ringSettlement.tradeHistoryUpdate_A.proof);
updateBalanceS_A.generate_r1cs_witness(ringSettlement.balanceUpdateS_A.proof);
updateBalanceB_A.generate_r1cs_witness(ringSettlement.balanceUpdateB_A.proof);
updateAccount_A.generate_r1cs_witness(ringSettlement.accountUpdate_A.proof);
// Update UserB
updateTradeHistory_B.generate_r1cs_witness(ringSettlement.tradeHistoryUpdate_B.proof);
updateBalanceS_B.generate_r1cs_witness(ringSettlement.balanceUpdateS_B.proof);
updateBalanceB_B.generate_r1cs_witness(ringSettlement.balanceUpdateB_B.proof);
updateAccount_B.generate_r1cs_witness(ringSettlement.accountUpdate_B.proof);
// Update Protocol pool
updateBalanceA_P.generate_r1cs_witness(ringSettlement.balanceUpdateA_P.proof);
updateBalanceB_P.generate_r1cs_witness(ringSettlement.balanceUpdateB_P.proof);
// Update Operator
updateBalanceA_O.generate_r1cs_witness(ringSettlement.balanceUpdateA_O.proof);
updateBalanceB_O.generate_r1cs_witness(ringSettlement.balanceUpdateB_O.proof);
}
void generate_r1cs_constraints()
{
// Orders
orderA.generate_r1cs_constraints();
orderB.generate_r1cs_constraints();
// Order fills
fillS_A.generate_r1cs_constraints();
fillS_B.generate_r1cs_constraints();
// Match orders
orderMatching.generate_r1cs_constraints();
// Calculate fees
feeCalculatorA.generate_r1cs_constraints();
feeCalculatorB.generate_r1cs_constraints();
/* Token Transfers */
// Actual trade
fillBB_from_balanceSA_to_balanceBB.generate_r1cs_constraints();
fillSB_from_balanceSB_to_balanceBA.generate_r1cs_constraints();
// Fees
feeA_from_balanceBA_to_balanceAO.generate_r1cs_constraints();
feeB_from_balanceBB_to_balanceBO.generate_r1cs_constraints();
// Rebates
rebateA_from_balanceAO_to_balanceBA.generate_r1cs_constraints();
rebateB_from_balanceBO_to_balanceBB.generate_r1cs_constraints();
// Protocol fees
protocolFeeA_from_balanceAO_to_balanceAP.generate_r1cs_constraints();
protocolFeeB_from_balanceBO_to_balanceBP.generate_r1cs_constraints();
// Update UserA
updateTradeHistory_A.generate_r1cs_constraints();
updateBalanceS_A.generate_r1cs_constraints();
updateBalanceB_A.generate_r1cs_constraints();
updateAccount_A.generate_r1cs_constraints();
// Update UserB
updateTradeHistory_B.generate_r1cs_constraints();
updateBalanceS_B.generate_r1cs_constraints();
updateBalanceB_B.generate_r1cs_constraints();
updateAccount_B.generate_r1cs_constraints();
// Update Protocol fee pool
updateBalanceA_P.generate_r1cs_constraints();
updateBalanceB_P.generate_r1cs_constraints();
// Update Operator
updateBalanceA_O.generate_r1cs_constraints();
updateBalanceB_O.generate_r1cs_constraints();
}
const std::vector<VariableArrayT> getPublicData() const
{
return
{
VariableArrayT(1, constants.zero), VariableArrayT(1, orderA.tradeHistory.getOverwrite()), subArray(orderA.orderID.bits, 0, NUM_BITS_TRADING_HISTORY),
VariableArrayT(1, constants.zero), VariableArrayT(1, orderB.tradeHistory.getOverwrite()), subArray(orderB.orderID.bits, 0, NUM_BITS_TRADING_HISTORY),
orderA.accountID.bits,
orderB.accountID.bits,
VariableArrayT(2, constants.zero), orderA.tokenS.bits,
VariableArrayT(2, constants.zero), orderB.tokenS.bits,
fillS_A.bits(),
fillS_B.bits(),
orderA.buy.bits, VariableArrayT(1, orderA.hasRebate()), orderA.feeOrRebateBips.bits,
orderB.buy.bits, VariableArrayT(1, orderB.hasRebate()), orderB.feeOrRebateBips.bits,
};
}
const VariableT& getNewAccountsRoot() const
{
return updateAccount_B.result();
}
const VariableT& getNewProtocolBalancesRoot() const
{
return updateBalanceB_P.result();
}
const VariableT& getNewOperatorBalancesRoot() const
{
return updateBalanceB_O.result();
}
};
class RingSettlementCircuit : public Circuit
{
public:
PublicDataGadget publicData;
Constants constants;
jubjub::Params params;
// State
AccountGadget accountBefore_O;
AccountGadget accountBefore_P;
// Inputs
DualVariableGadget exchangeID;
DualVariableGadget merkleRootBefore;
DualVariableGadget merkleRootAfter;
DualVariableGadget timestamp;
DualVariableGadget protocolTakerFeeBips;
DualVariableGadget protocolMakerFeeBips;
DualVariableGadget operatorAccountID;
// Increment the nonce of the Operator
AddGadget nonce_after;
// Transform the ring data
TransformRingSettlementDataGadget transformData;
// Signature
Poseidon_gadget_T<3, 1, 6, 51, 2, 1> hash;
SignatureVerifier signatureVerifier;
// Ring settlements
bool onchainDataAvailability;
unsigned int numRings;
std::vector<RingSettlementGadget> ringSettlements;
Bitstream dataAvailabityData;
// Update Protocol pool
std::unique_ptr<UpdateAccountGadget> updateAccount_P;
// Update Operator
std::unique_ptr<UpdateAccountGadget> updateAccount_O;
RingSettlementCircuit(ProtoboardT& pb, const std::string& prefix) :
Circuit(pb, prefix),
publicData(pb, FMT(prefix, ".publicData")),
constants(pb, FMT(prefix, ".constants")),
// State
accountBefore_O(pb, FMT(prefix, ".accountBefore_O")),
accountBefore_P(pb, FMT(prefix, ".accountBefore_P")),
// Inputs
exchangeID(pb, NUM_BITS_EXCHANGE_ID, FMT(prefix, ".exchangeID")),
merkleRootBefore(pb, 256, FMT(prefix, ".merkleRootBefore")),
merkleRootAfter(pb, 256, FMT(prefix, ".merkleRootAfter")),
timestamp(pb, NUM_BITS_TIMESTAMP, FMT(prefix, ".timestamp")),
protocolTakerFeeBips(pb, NUM_BITS_PROTOCOL_FEE_BIPS, FMT(prefix, ".protocolTakerFeeBips")),
protocolMakerFeeBips(pb, NUM_BITS_PROTOCOL_FEE_BIPS, FMT(prefix, ".protocolMakerFeeBips")),
operatorAccountID(pb, NUM_BITS_ACCOUNT, FMT(prefix, ".operatorAccountID")),
// Increment the nonce of the Operator
nonce_after(pb, accountBefore_O.nonce, constants.one, NUM_BITS_NONCE, FMT(prefix, ".nonce_after")),
// Transform the ring data
transformData(pb, FMT(prefix, ".transformData")),
// Signature
hash(pb, var_array({
publicData.publicInput,
accountBefore_O.nonce
}), FMT(this->annotation_prefix, ".hash")),
signatureVerifier(pb, params, constants, accountBefore_O.publicKey, hash.result(), FMT(prefix, ".signatureVerifier"))
{
}
void generateConstraints(bool onchainDataAvailability, unsigned int blockSize) override
{
this->onchainDataAvailability = onchainDataAvailability;
this->numRings = blockSize;
constants.generate_r1cs_constraints();
// Inputs
exchangeID.generate_r1cs_constraints(true);
merkleRootBefore.generate_r1cs_constraints(true);
merkleRootAfter.generate_r1cs_constraints(true);
timestamp.generate_r1cs_constraints(true);
protocolTakerFeeBips.generate_r1cs_constraints(true);
protocolMakerFeeBips.generate_r1cs_constraints(true);
operatorAccountID.generate_r1cs_constraints(true);
// Increment the nonce of the Operator
nonce_after.generate_r1cs_constraints();
// Ring settlements
ringSettlements.reserve(numRings);
for (size_t j = 0; j < numRings; j++)
{
const VariableT ringAccountsRoot = (j == 0) ? merkleRootBefore.packed : ringSettlements.back().getNewAccountsRoot();
const VariableT& ringProtocolBalancesRoot = (j == 0) ? accountBefore_P.balancesRoot : ringSettlements.back().getNewProtocolBalancesRoot();
const VariableT& ringOperatorBalancesRoot = (j == 0) ? accountBefore_O.balancesRoot : ringSettlements.back().getNewOperatorBalancesRoot();
ringSettlements.emplace_back(
pb,
params,
constants,
exchangeID.packed,
ringAccountsRoot,
timestamp.packed,
protocolTakerFeeBips.packed,
protocolMakerFeeBips.packed,
ringProtocolBalancesRoot,
ringOperatorBalancesRoot,
std::string("trade_") + std::to_string(j)
);
ringSettlements.back().generate_r1cs_constraints();
if (onchainDataAvailability)
{
// Store data from ring settlement
dataAvailabityData.add(ringSettlements.back().getPublicData());
}
}
// Update Protocol pool
updateAccount_P.reset(new UpdateAccountGadget(pb, ringSettlements.back().getNewAccountsRoot(), constants.zeroAccount,
{accountBefore_P.publicKey.x, accountBefore_P.publicKey.y, accountBefore_P.nonce, accountBefore_P.balancesRoot},
{accountBefore_P.publicKey.x, accountBefore_P.publicKey.y, accountBefore_P.nonce, ringSettlements.back().getNewProtocolBalancesRoot()},
FMT(annotation_prefix, ".updateAccount_P")));
updateAccount_P->generate_r1cs_constraints();
// Update Operator
updateAccount_O.reset(new UpdateAccountGadget(pb, updateAccount_P->result(), operatorAccountID.bits,
{accountBefore_O.publicKey.x, accountBefore_O.publicKey.y, accountBefore_O.nonce, accountBefore_O.balancesRoot},
{accountBefore_O.publicKey.x, accountBefore_O.publicKey.y, nonce_after.result(), ringSettlements.back().getNewOperatorBalancesRoot()},
FMT(annotation_prefix, ".updateAccount_O")));
updateAccount_O->generate_r1cs_constraints();
// Public data
publicData.add(exchangeID.bits);
publicData.add(merkleRootBefore.bits);
publicData.add(merkleRootAfter.bits);
publicData.add(timestamp.bits);
publicData.add(protocolTakerFeeBips.bits);
publicData.add(protocolMakerFeeBips.bits);
if (onchainDataAvailability)
{
publicData.add(operatorAccountID.bits);
// Transform the ring data
// 压缩ringsettlement的数据，链下算一遍hash，然后publicdatahash传到链上之后会对两者进行校验，确保链下生成proof的ringsettlement数据和链上的数据一直
transformData.generate_r1cs_constraints(numRings, flattenReverse(dataAvailabityData.data));
publicData.add(reverse(transformData.result()));
}
publicData.generate_r1cs_constraints();
// Signature
hash.generate_r1cs_constraints();
signatureVerifier.generate_r1cs_constraints();
// Check the new merkle root
requireEqual(pb, updateAccount_O->result(), merkleRootAfter.packed, "newMerkleRoot");
}
bool generateWitness(const RingSettlementBlock& block)
{
if (block.ringSettlements.size() != numRings)
{
std::cout << "Invalid number of rings: " << block.ringSettlements.size() << std::endl;
return false;
}
constants.generate_r1cs_witness();
// State
accountBefore_O.generate_r1cs_witness(block.accountUpdate_O.before);
accountBefore_P.generate_r1cs_witness(block.accountUpdate_P.before);
// Inputs
exchangeID.generate_r1cs_witness(pb, block.exchangeID);
merkleRootBefore.generate_r1cs_witness(pb, block.merkleRootBefore);
merkleRootAfter.generate_r1cs_witness(pb, block.merkleRootAfter);
timestamp.generate_r1cs_witness(pb, block.timestamp);
protocolTakerFeeBips.generate_r1cs_witness(pb, block.protocolTakerFeeBips);
protocolMakerFeeBips.generate_r1cs_witness(pb, block.protocolMakerFeeBips);
operatorAccountID.generate_r1cs_witness(pb, block.operatorAccountID);
// Increment the nonce of the Operator
nonce_after.generate_r1cs_witness();
// Ring settlements
#ifdef MULTICORE
#pragma omp parallel for
#endif
for(unsigned int i = 0; i < block.ringSettlements.size(); i++)
{
ringSettlements[i].generate_r1cs_witness(block.ringSettlements[i]);
}
// Update Protocol pool
updateAccount_P->generate_r1cs_witness(block.accountUpdate_P.proof);
// Update Operator
updateAccount_O->generate_r1cs_witness(block.accountUpdate_O.proof);
// Transform the ring data
// Onchain 操作
if (onchainDataAvailability)
{
transformData.generate_r1cs_witness();
}
// Public data
publicData.generate_r1cs_witness();
// Signature
hash.generate_r1cs_witness();
signatureVerifier.generate_r1cs_witness(block.signature);
return true;
}
bool generateWitness(const json& input) override
{
return generateWitness(input.get<Loopring::RingSettlementBlock>());
}
BlockType getBlockType() override
{
return BlockType::RingSettlement;
}
unsigned int getBlockSize() override
{
return numRings;
}
void printInfo() override
{
std::cout << pb.num_constraints() << " constraints (" << (pb.num_constraints() / numRings) << "/ring)" << std::endl;
}
};
}
#endif
|
exercicio03.c | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "omp.h"
void ler_arquivo(char *nome_arquivo, char *texto_arquivo, int tamanho);
int main() {
char letra;
char *nome_arquivo;
char *texto_arquivo;
int tamanho = 10000;
int num_threads = 6;
float t1seq, t2seq, t1par, t2par;
nome_arquivo = (char*)calloc(10, sizeof(char));
texto_arquivo = (char*)calloc(tamanho, sizeof(char));
printf("letra: ");
scanf("%s", &letra);
printf("arquivo: ");
scanf("%s", nome_arquivo);
ler_arquivo(nome_arquivo, texto_arquivo, tamanho);
int tamanho_arquivo = strlen(texto_arquivo);
int i;
int encontrou = 0;
t1seq = omp_get_wtime();
for(i = 0; i < tamanho_arquivo; i++) {
if(texto_arquivo[i] == letra) {
encontrou = 1;
break;
}
}
t2seq = omp_get_wtime();
omp_set_num_threads(num_threads);
t1par = omp_get_wtime();
#pragma omp parallel for
for(i = 0; i < tamanho_arquivo; i++) {
if(texto_arquivo[i] == letra) {
encontrou = 1;
}
}
t2par = omp_get_wtime();
if(encontrou) {
printf("letra encontrada");
} else {
printf("letra não encontrada");
}
printf("\nTempo gasto sequencial: %lf", t2seq - t1seq);
printf("\nTempo gasto paralelo : %lf\n", t2par - t1par);
free(nome_arquivo);
free(texto_arquivo);
return 0;
}
void ler_arquivo(char *nome_arquivo, char *texto_arquivo, int tamanho) {
FILE* file;
file = fopen(nome_arquivo, "r");
if (file==NULL) {
printf("arquivo nao encontrado.");
}
char *linha;
linha = (char*)calloc(tamanho, sizeof(char));
int i;
do {
i = fscanf(file, "%s", linha);
strcat(texto_arquivo, linha);
strcpy(linha, "");
} while (i == 1);
free(linha);
fclose(file);
}
|
cf_openmp_tiny.c | #include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <omp.h>
#include <time.h>
#include <sys/time.h>
#define MICRO_IN_SEC 1000000.00
// the item number and user number should be start from 1, if it start from 0, our program in get_*_data should be modified
#define USER_COUNT 71567
//#define USER_COUNT 3500
#define ITEM_COUNT 65133
#define TEST_COUNT 2089384
#define RECORD_COUNT 7910670
#define ITEM_BLOCK 6000
//#define ITEM_BLOCK 384546
#define ITEM_ROUND (ITEM_COUNT/ITEM_BLOCK)
#define ITEM_LAST (ITEM_COUNT%ITEM_BLOCK)
#define USER_BLOCK 6000
#define USER_ROUND (USER_COUNT/USER_BLOCK)
#define USER_LAST (USER_COUNT%USER_BLOCK)
#define K_SORT 100
typedef struct record_item_struct_define
{
int item_id;
int user_id;
float rating;
}record_item_struct;
typedef struct k_similarity_struct_define
{
int k_index;
double k_similarity;
}k_similarity_struct;
double microtime(){
int tv_sec,tv_usec;
double time;
struct timeval tv;
struct timezone tz;
gettimeofday(&tv,&tz);
return tv.tv_sec+tv.tv_usec/MICRO_IN_SEC;
}
// Here, we assume that the item in {user,item,predict_rating} of the test dataset will cover all the items.
void get_pearson_similarity(float* rating_m, float* rating_n, double* average_matrix, k_similarity_struct * k_similarity_matrix, int start_index_m, int start_index_n, int flag){
printf(" in pearson_similarity start_index_m=%d, start_index_n=%d\n", start_index_m, start_index_n);
int nPadded = ( USER_COUNT%8 == 0 ? USER_COUNT : USER_COUNT + (8-USER_COUNT%8) );
double similarity;
int i,j,m,n,s,k;
int ua,ub,uc;
float sum_numerator=0;
float sum_denominator_square_m=0;
float sum_denominator_square_n=0;
float sum_denominator=0;
double* sum_numerator_matrix =(double*) _mm_malloc(sizeof(double)*USER_COUNT,64);
double* sum_denominator_matrix_m =(double*) _mm_malloc(sizeof(double)*USER_COUNT,64);
double* sum_denominator_matrix_n =(double*) _mm_malloc(sizeof(double)*USER_COUNT,64);
memset(sum_numerator_matrix,0,sizeof(double)*USER_COUNT);
memset(sum_denominator_matrix_m,0,sizeof(double)*USER_COUNT);
memset(sum_denominator_matrix_n,0,sizeof(double)*USER_COUNT);
// float * simi_temp = (float*)_mm_malloc(sizeof(float)*ITEM_BLOCK*USER_COUNT,64);
int numthreads;
int item_index;
int block_m,block_n;
int end_m=(ITEM_COUNT<(start_index_m+ITEM_BLOCK) ? ITEM_COUNT:(start_index_m+ITEM_BLOCK));
int end_n=(ITEM_COUNT<(start_index_n+ITEM_BLOCK) ? ITEM_COUNT:(start_index_n+ITEM_BLOCK));
printf("the number of threads is %d\n", omp_get_num_threads());
printf(" end_m = %d , end_n = %d\n",end_m,end_n);
double a = microtime();
//compute the pearson similarity
//#pragma omp parallel for collapse(2) private(i,j,k,m,n) reduction(+:sum_numerator,sum_denominator_square_m,sum_denominator_square_n)
//#pragma omp parallel
unsigned int mn;
#pragma omp parallel for
// for (mn = 0; mn < (((end_m-start_index_m)*(end_n-start_index_n))/16)*16; mn++)
for (mn = 0; mn < (end_m-start_index_m)*(end_n-start_index_n); mn++)
// for (m=start_index_m; m < end_m; m++)
{
// if (m%100==0) printf ("m = %d, percent= %f/%\n",m,(float)m/ITEM_COUNT*100);
// for(n=start_index_n; n< end_n; n++)
// {
m = start_index_m + mn / ( end_n - start_index_n );
n = start_index_n + mn % ( end_n - start_index_n );
block_m = m - start_index_m;
block_n = n - start_index_n;
// block_m = block_n =0;
sum_numerator=0;
sum_denominator_square_m=0;
sum_denominator_square_n=0;
sum_denominator=0;
//#pragma omp for schedule(static) nowait
// #pragma omp parallel for
// #pragma simd reduction(+:sum_numerator,sum_denominator_square_m,sum_denominator_square_n) novecremainder
#pragma simd reduction(+:sum_numerator,sum_denominator_square_m,sum_denominator_square_n)
// #pragma vector aligned
//#pragma noprefetch
// #pragma ivdep
// #pragma vector always
for (i=0;i < USER_COUNT; i++)
{
//compute numerator
sum_numerator += (rating_m[block_m*USER_COUNT+i])*(rating_n[block_n*USER_COUNT+i]);
// simi_temp[block_m*USER_COUNT+i]= rating_m[block_m*USER_COUNT+i];
//compute the squre in denominator
sum_denominator_square_m += powf((rating_m[block_m*USER_COUNT+i]),2.0);
// sum_denominator_square_m += rating_m[block_m*USER_COUNT+i]*rating_m[block_m*USER_COUNT+i];
sum_denominator_square_n += powf((rating_n[block_n*USER_COUNT+i]),2.0);
// sum_denominator_square_n += rating_n[block_n*USER_COUNT+i]*rating_n[block_n*USER_COUNT+i];
// if( m==100 && n==100)
// printf("m=%d,n=%d,i=%d, running on thread %d\n",m,n,i, omp_get_thread_num());
}
/*
float * rating_m_block = rating_m+block_m*USER_COUNT;
float * rating_n_block = rating_n+block_n*USER_COUNT;
// float sum_numerator, sum_denominator_square_m, sum_denominator_square_n;
// #pragma vector aligned (rating_m_block,rating_n_block)
float sum_numerator = __sec_reduce_add(rating_m_block[0:USER_COUNT] * rating_n_block[0:USER_COUNT]);
// float sum_denominator_square_m = __sec_reduce_add(rating_m_block[0:USER_COUNT] * rating_m_block[0:USER_COUNT]);
// #pragma vector aligned (rating_m_block)
float sum_denominator_square_m = __sec_reduce_add(rating_m_block[0:USER_COUNT]*rating_m_block[0:USER_COUNT]);
// #pragma vector aligned (rating_n_block)
float sum_denominator_square_n = __sec_reduce_add(rating_n_block[0:USER_COUNT]*rating_n_block[0:USER_COUNT]);
*/
//compute the denominator
sum_denominator = sqrt (sum_denominator_square_m*sum_denominator_square_n);
if(sum_denominator!=0)
similarity = sum_numerator/sum_denominator;
else
similarity = 0;
/*
for (j=0;j<K_SORT;j++)
{
item_index = k_similarity_matrix[m*K_SORT+j].k_index;
if(item_index==-1 || similarity > k_similarity_matrix[m*K_SORT+j].k_similarity)
{
for (s=K_SORT-1;s>j;s--)
{
k_similarity_matrix[m*K_SORT+s].k_index = k_similarity_matrix[m*K_SORT+s-1].k_index;
k_similarity_matrix[m*K_SORT+s].k_similarity = k_similarity_matrix[m*K_SORT+s-1].k_similarity;
}
k_similarity_matrix[m*K_SORT+j].k_index = n;
k_similarity_matrix[m*K_SORT+j].k_similarity = similarity;
break;
}
else if( similarity == k_similarity_matrix[m*K_SORT+j].k_similarity && item_index == n)
{
break;
}
}
if(flag==0) continue;
for (k=0;k<K_SORT;k++)
{
item_index = k_similarity_matrix[n*K_SORT+k].k_index;
if(item_index==-1 || similarity > k_similarity_matrix[n*K_SORT+k].k_similarity)
{
for (s=K_SORT-1;s>j;s--)
{
k_similarity_matrix[n*K_SORT+s].k_index = k_similarity_matrix[n*K_SORT+s-1].k_index;
k_similarity_matrix[n*K_SORT+s].k_similarity = k_similarity_matrix[n*K_SORT+s-1].k_similarity;
}
k_similarity_matrix[n*K_SORT+k].k_index = m;
k_similarity_matrix[n*K_SORT+k].k_similarity = similarity;
break;
}
else if( similarity == k_similarity_matrix[n*K_SORT+k].k_similarity && item_index == m)
{
break;
}
}
*/
// }
}
double b = microtime();
double duration = b-a;
printf(" time consumed: %fs\n", duration);
exit(0);
}
int get_predict_rating(double* predict_rating, float* rating, k_similarity_struct* index_matrix, int* test, double* average_index, int user_start_index,int test_start_index)
{
// Firstly, we should find the union set between rating&index_matrix for the users in test[];
printf(" in predict_rating ...........user_start_index=%d, test_start_index=%d\n", user_start_index, test_start_index);
int m,n,i,j;
int user_id,item_id,k_id;
double sum_rating = 0;
int sum_rating_index = 0;
int sum_no_rating_index=0;
double numerator = 0;
double denominator = 0;
int block_user_id;
// #pragma omp parallel for private(m,i) reduction(+:numerator,denominator)
for (m = test_start_index; m < TEST_COUNT; m++)
{
user_id = test[m*2+0];
item_id = test[m*2+1];
numerator =0;
denominator = 0;
if( user_id < user_start_index) printf(" error__________________+++++++++++++++\n");
if( user_id > ((user_start_index+USER_BLOCK) > USER_COUNT ? USER_COUNT:(user_start_index+USER_BLOCK))) break;
block_user_id = user_id - user_start_index;
for (i = 0; i < K_SORT; i++)
{
k_id = index_matrix[item_id*K_SORT+i].k_index;
if ( rating[block_user_id*ITEM_COUNT+k_id] !=0 )
{
numerator += index_matrix[item_id*K_SORT+i].k_similarity*(rating[block_user_id*ITEM_COUNT+k_id]-average_index[k_id]);
denominator += index_matrix[item_id*K_SORT+i].k_similarity;
}
}
if(denominator !=0)
predict_rating[m] = average_index[item_id] + numerator/ denominator;
else
predict_rating[m] = average_index[item_id];
}
// return predict_rating;
return m;
}
void print_matrix_double(double * matrix,int row,int column)
{
int i,j;
int sum_0=0;
for (i=0;i<row;i++)
{
for(j=0;j<column;j++)
if (matrix[i*column+j]==0) sum_0++;
// printf("%lf ",matrix[i*column+j]);
// printf("\n");
}
printf("sum_0 is %d in a whole %d\n",sum_0,row);
}
void get_item_data(record_item_struct* item_data, char* filename)
{
FILE *fp;
if ((fp=fopen(filename,"r")) == NULL)
{
printf("cannot open this file");
exit(0);
}
int user_id, item_id, timestamp;
float rating=0;
int i=0;
while (fscanf(fp,"%d %d %f %d", &item_id, &user_id, &rating, ×tamp) != EOF)
{
item_data[i].item_id = item_id;
item_data[i].user_id = user_id;
item_data[i].rating = rating;
i++;
}
fclose(fp);
}
int get_item_block_data(int round, float* data, int file_start_index, record_item_struct* item_data)
{
int i=0;
#pragma omp parallel for
for (i = 0; i<ITEM_BLOCK*USER_COUNT;i++)
{
data[i]=0;
}
// memset(data, 0, sizeof(float)*ITEM_BLOCK*USER_COUNT);
int user_id, item_id;
float rating=0;
for(i=file_start_index; ;i++)
{
item_id = item_data[i].item_id;
user_id = item_data[i].user_id;
rating = item_data[i].rating;
if ((item_id-1) >= (round+1)*ITEM_BLOCK) break;
data[(item_id-1-(round*ITEM_BLOCK))*USER_COUNT + user_id-1] = rating;
}
return i;
}
long get_user_block_data(int round, float* data, long file_start_index)
{
FILE *fp;
int i=0;
//int large_user_id=0;
//int large_item_id=0;
/*
float * data = (float*)malloc(sizeof(float)*USER_BLOCK*ITEM_COUNT);
if (data==NULL)
{
printf(" malloc of base_data failed\n");
exit(1);
}
*/
memset(data, 0, sizeof(float)*USER_BLOCK*ITEM_COUNT);
if ((fp=fopen("r1.train.raw","r")) == NULL)
{
printf("cannot open this file");
exit(0);
}
int user_id, item_id, timestamp;
float rating=0;
long file_offset = 0;
fseek(fp, file_start_index, 0);
while (fscanf(fp,"%d %d %f %d", &user_id, &item_id, &rating, ×tamp) != EOF)
{
if ((user_id-1) < round*USER_BLOCK) continue;
if ((user_id-1) >= (round+1)*USER_BLOCK) break;
data[(user_id-1-(round*USER_BLOCK))*ITEM_COUNT + item_id-1] = rating;
file_offset = ftell(fp);
// data[(user_id-1)*ITEM_COUNT + item_id-1] = rating;
// if (user_id > large_user_id) large_user_id = user_id;
// if (item_id > large_item_id) large_item_id = item_id;
// printf("getting base_data on line i=%d,user_id=%d,item_id=%d,rating=%f\n",i++,user_id,item_id,rating);
}
// printf("the largest user_id is %d\n the largest item_id is %d\n",large_user_id,large_item_id);
fclose(fp);
return file_offset;
// return data;
}
void get_test_data(int* data, float* rating)
{
FILE *fp;
int i=0;
memset(data, 0, sizeof(int));
if ((fp=fopen("r1.test","r")) == NULL)
{
printf("cannot open this file");
exit(0);
}
int user_id, item_id, timestamp;
float rating_temp;
while (fscanf(fp,"%d %d %f %d", &user_id, &item_id, &rating_temp, ×tamp) != EOF)
{
data[i*2+0] = user_id-1;
data[i*2+1] = item_id-1;
rating[i] = rating_temp;
i++;
//printf("getting test_data on line i=%d,user_id=%d,item_id=%d,rating_temp=%f\n",i,user_id,item_id,rating_temp);
}
fclose(fp);
}
double get_rmse(float* test_rating, double* predict_data)
{
int m,n,i,j;
double numerator = 0;
double denominator = TEST_COUNT;
#pragma omp parallel for private(i) reduction(+:numerator)
for(i=0;i<TEST_COUNT;i++)
{
numerator += pow ((test_rating[i] - predict_data[i]),2.0);
}
return (numerator/denominator);
}
void get_item_average_matrix(float* rating,double* average_matrix, int start_index)
{
int m,n,i,j;
int average_index =0;
int average_sum = 0;
int block_m = 0;
double average_item=0;
#pragma omp parallel for private(m,n) reduction(+:average_sum,average_index)
for ( m = start_index; m<(ITEM_COUNT < (start_index+ITEM_BLOCK) ? ITEM_COUNT:(start_index+ITEM_BLOCK)); m++ )
{
average_sum = 0;
average_index = 0;
block_m = m-start_index;
for(n=0;n<USER_COUNT;n++)
{
if(rating[block_m*USER_COUNT+n] !=0)
{
average_sum += rating[block_m*USER_COUNT+n];
average_index += 1;
}
}
if(average_index!=0)
{
average_matrix[m]=(double)average_sum/(double)average_index;
}
else
{
average_matrix[m]=0;
}
}
#pragma omp parallel for private(m,n)
// #pragma vector aligned
// #pragma ivdep
for ( m = start_index; m<(ITEM_COUNT < (start_index+ITEM_BLOCK) ? ITEM_COUNT:(start_index+ITEM_BLOCK)); m++ )
{
block_m = m-start_index;
average_item = average_matrix[m];
for(n=0;n<USER_COUNT;n++)
{
rating[block_m*USER_COUNT+n] -= (float)average_item;
}
}
}
int main(int argc, char ** argv){
//first, read the data in files into an array in order to process it more efficiently.
record_item_struct * item_data = (record_item_struct *) _mm_malloc(sizeof(record_item_struct)*RECORD_COUNT,64);
memset(item_data, 0, sizeof(record_item_struct)*RECORD_COUNT);
get_item_data(item_data, argv[1]);
float * item_block_data_i = (float*)_mm_malloc(sizeof(float)*ITEM_BLOCK*USER_COUNT,64);
float * item_block_data_j = (float*)_mm_malloc(sizeof(float)*ITEM_BLOCK*USER_COUNT,64);
if (item_block_data_i==NULL || item_block_data_j == NULL)
{
printf(" malloc of base_data failed\n");
exit(1);
}
double * item_average_matrix = (double*)_mm_malloc(sizeof(double)*ITEM_COUNT,64);
memset(item_average_matrix,0,sizeof(double)*ITEM_COUNT);
k_similarity_struct * item_index_matrix = (k_similarity_struct *) _mm_malloc (sizeof(k_similarity_struct)*K_SORT*ITEM_COUNT,64);
memset (item_index_matrix,-1,sizeof(k_similarity_struct));
int item_start_index_i=0;
int item_start_index_j=0;
int i,j;
for (i=0; i <= ITEM_ROUND; i++)
{
printf("round %d ================== with ITEM_BLOCK %d\n",i,ITEM_BLOCK);
//block_data
printf("get item_block_data begins\n");
item_start_index_i = get_item_block_data(i, item_block_data_i,item_start_index_i, item_data);
printf("get_item_block_data ends\n");
//average matrix
printf("get_item_average_matrix begins\n");
get_item_average_matrix(item_block_data_i, item_average_matrix,i*ITEM_BLOCK);
printf("get_item_average_matrix ends\n");
item_start_index_j = 0;
for( j=0; j<= i;j++)
{
if( i==j)
{
//the index of item after sorting the similarity matrix
printf("get k_similarity_begins\n");
get_pearson_similarity(item_block_data_i,item_block_data_i,item_average_matrix,item_index_matrix,i*ITEM_BLOCK,i*ITEM_BLOCK,0);
printf("get k_similarity_ends\n");
continue;
}
//block_data
printf("get item_block_data begins\n");
item_start_index_j = get_item_block_data(j, item_block_data_j, item_start_index_j, item_data);
printf("get_item_block_data ends\n");
//the index of item after sorting the similarity matrix
printf("get k_similarity_begins\n");
get_pearson_similarity(item_block_data_i,item_block_data_j,item_average_matrix,item_index_matrix,i*ITEM_BLOCK,j*ITEM_BLOCK,1);
printf("get k_similarity_ends\n");
}
}
_mm_free(item_block_data_i);
_mm_free(item_block_data_j);
int *test_data;
float *test_rating;
test_data = (int*)_mm_malloc (sizeof(int)*2*TEST_COUNT,64);
test_rating= (float*)_mm_malloc(sizeof(float)*TEST_COUNT,64);
printf("get_test_data begins\n");
get_test_data(test_data,test_rating);
printf("get_test_data ends\n");
long user_file_start_index = 0;
float * user_block_data = (float*)_mm_malloc(sizeof(float)*USER_BLOCK*ITEM_COUNT,64);
if (user_block_data==NULL)
{
printf(" malloc of base_data failed\n");
exit(1);
}
int test_start_index = 0;
double * item_predict_rating =(double*) _mm_malloc (sizeof(double)*TEST_COUNT,64);
for(i=0;i<=USER_ROUND;i++)
{
user_file_start_index = get_user_block_data(i,user_block_data, user_file_start_index);
printf("get_predict_rating begins\n");
test_start_index=get_predict_rating(item_predict_rating, user_block_data, item_index_matrix, test_data,item_average_matrix,i*USER_BLOCK, test_start_index);
printf("get_predict_rating ends\n");
if ( test_start_index == TEST_COUNT)
break;
}
_mm_free (user_block_data);
double rmse;
printf("get_rmse begins\n");
rmse = get_rmse(test_rating,item_predict_rating);
printf("ge_rmse ends\n");
printf("rmse= %f\n", rmse);
return 0;
}
|
GB_binop__bclr_uint8.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__bclr_uint8)
// A.*B function (eWiseMult): GB (_AemultB_08__bclr_uint8)
// A.*B function (eWiseMult): GB (_AemultB_02__bclr_uint8)
// A.*B function (eWiseMult): GB (_AemultB_04__bclr_uint8)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__bclr_uint8)
// A*D function (colscale): GB ((none))
// D*A function (rowscale): GB ((none))
// C+=B function (dense accum): GB (_Cdense_accumB__bclr_uint8)
// C+=b function (dense accum): GB (_Cdense_accumb__bclr_uint8)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__bclr_uint8)
// C=scalar+B GB (_bind1st__bclr_uint8)
// C=scalar+B' GB (_bind1st_tran__bclr_uint8)
// C=A+scalar GB (_bind2nd__bclr_uint8)
// C=A'+scalar GB (_bind2nd_tran__bclr_uint8)
// C type: uint8_t
// A type: uint8_t
// B,b type: uint8_t
// BinaryOp: cij = GB_BITCLR (aij, bij, uint8_t, 8)
#define GB_ATYPE \
uint8_t
#define GB_BTYPE \
uint8_t
#define GB_CTYPE \
uint8_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
uint8_t aij = GBX (Ax, pA, A_iso)
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
uint8_t bij = GBX (Bx, pB, B_iso)
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
uint8_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = GB_BITCLR (x, y, uint8_t, 8) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
1
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_BCLR || GxB_NO_UINT8 || GxB_NO_BCLR_UINT8)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_ewise3_noaccum__bclr_uint8)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__bclr_uint8)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__bclr_uint8)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type uint8_t
uint8_t bwork = (*((uint8_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint8_t *restrict Cx = (uint8_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint8_t *restrict Cx = (uint8_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__bclr_uint8)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
#include "GB_add_template.c"
GB_FREE_WORK ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__bclr_uint8)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__bclr_uint8)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__bclr_uint8)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__bclr_uint8)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__bclr_uint8)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint8_t *Cx = (uint8_t *) Cx_output ;
uint8_t x = (*((uint8_t *) x_input)) ;
uint8_t *Bx = (uint8_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
uint8_t bij = GBX (Bx, p, false) ;
Cx [p] = GB_BITCLR (x, bij, uint8_t, 8) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__bclr_uint8)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
uint8_t *Cx = (uint8_t *) Cx_output ;
uint8_t *Ax = (uint8_t *) Ax_input ;
uint8_t y = (*((uint8_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
uint8_t aij = GBX (Ax, p, false) ;
Cx [p] = GB_BITCLR (aij, y, uint8_t, 8) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint8_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (x, aij, uint8_t, 8) ; \
}
GrB_Info GB (_bind1st_tran__bclr_uint8)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
uint8_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint8_t x = (*((const uint8_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
uint8_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint8_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (aij, y, uint8_t, 8) ; \
}
GrB_Info GB (_bind2nd_tran__bclr_uint8)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint8_t y = (*((const uint8_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
omp_sections_nowait.c | // RUN: %libomp-compile-and-run
#include <stdio.h>
#include "omp_testsuite.h"
/*
* This test will hang if the nowait is not working properly
*
* It relies on a thread skipping to the second sections construct to
* release the threads in the first sections construct
*
* Also, since scheduling of sections is implementation defined, it is
* necessary to have all four sections in the second sections construct
* release the threads since we can't guarantee which section a single thread
* will execute.
*/
volatile int release;
volatile int count;
void wait_for_release_then_increment(int rank)
{
fprintf(stderr, "Thread nr %d enters first section"
" and waits.\n", rank);
while (release == 0)
THREAD_SCHED_POINT();
#pragma omp atomic
count++;
}
void release_and_increment(int rank)
{
fprintf(stderr, "Thread nr %d sets release to 1\n", rank);
release = 1;
#pragma omp flush(release)
#pragma omp atomic
count++;
}
int test_omp_sections_nowait()
{
release = 0;
count = 0;
#pragma omp parallel num_threads(4)
{
int rank;
rank = omp_get_thread_num ();
#pragma omp sections nowait
{
#pragma omp section
{
wait_for_release_then_increment(rank);
}
#pragma omp section
{
wait_for_release_then_increment(rank);
}
#pragma omp section
{
wait_for_release_then_increment(rank);
}
#pragma omp section
{
fprintf(stderr, "Thread nr %d enters first sections and goes "
"immediately to next sections construct to release.\n", rank);
#pragma omp atomic
count++;
}
}
/* Begin of second sections environment */
#pragma omp sections
{
#pragma omp section
{
release_and_increment(rank);
}
#pragma omp section
{
release_and_increment(rank);
}
#pragma omp section
{
release_and_increment(rank);
}
#pragma omp section
{
release_and_increment(rank);
}
}
}
// Check to make sure all eight sections were executed
return (count==8);
}
int main()
{
int i;
int num_failed=0;
for(i = 0; i < REPETITIONS; i++) {
if(!test_omp_sections_nowait()) {
num_failed++;
}
}
return num_failed;
}
|
GB_binop__hypot_fp32.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCUDA_DEV
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__hypot_fp32)
// A.*B function (eWiseMult): GB (_AemultB_08__hypot_fp32)
// A.*B function (eWiseMult): GB (_AemultB_02__hypot_fp32)
// A.*B function (eWiseMult): GB (_AemultB_04__hypot_fp32)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__hypot_fp32)
// A*D function (colscale): GB ((none))
// D*A function (rowscale): GB ((none))
// C+=B function (dense accum): GB (_Cdense_accumB__hypot_fp32)
// C+=b function (dense accum): GB (_Cdense_accumb__hypot_fp32)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__hypot_fp32)
// C=scalar+B GB (_bind1st__hypot_fp32)
// C=scalar+B' GB (_bind1st_tran__hypot_fp32)
// C=A+scalar GB (_bind2nd__hypot_fp32)
// C=A'+scalar GB (_bind2nd_tran__hypot_fp32)
// C type: float
// A type: float
// A pattern? 0
// B type: float
// B pattern? 0
// BinaryOp: cij = hypotf (aij, bij)
#define GB_ATYPE \
float
#define GB_BTYPE \
float
#define GB_CTYPE \
float
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
float aij = GBX (Ax, pA, A_iso)
// true if values of A are not used
#define GB_A_IS_PATTERN \
0 \
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
float bij = GBX (Bx, pB, B_iso)
// true if values of B are not used
#define GB_B_IS_PATTERN \
0 \
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
float t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = hypotf (x, y) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
0
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_HYPOT || GxB_NO_FP32 || GxB_NO_HYPOT_FP32)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
void GB (_Cdense_ewise3_noaccum__hypot_fp32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_noaccum_template.c"
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__hypot_fp32)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__hypot_fp32)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type float
float bwork = (*((float *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix D,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
float *restrict Cx = (float *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix D,
const GrB_Matrix B,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
float *restrict Cx = (float *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__hypot_fp32)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool is_eWiseUnion,
const GB_void *alpha_scalar_in,
const GB_void *beta_scalar_in,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
float alpha_scalar ;
float beta_scalar ;
if (is_eWiseUnion)
{
alpha_scalar = (*((float *) alpha_scalar_in)) ;
beta_scalar = (*((float *) beta_scalar_in )) ;
}
#include "GB_add_template.c"
GB_FREE_WORKSPACE ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__hypot_fp32)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__hypot_fp32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__hypot_fp32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__hypot_fp32)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__hypot_fp32)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
float *Cx = (float *) Cx_output ;
float x = (*((float *) x_input)) ;
float *Bx = (float *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
float bij = GBX (Bx, p, false) ;
Cx [p] = hypotf (x, bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__hypot_fp32)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
float *Cx = (float *) Cx_output ;
float *Ax = (float *) Ax_input ;
float y = (*((float *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
float aij = GBX (Ax, p, false) ;
Cx [p] = hypotf (aij, y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
float aij = GBX (Ax, pA, false) ; \
Cx [pC] = hypotf (x, aij) ; \
}
GrB_Info GB (_bind1st_tran__hypot_fp32)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
float
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
float x = (*((const float *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
float
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
float aij = GBX (Ax, pA, false) ; \
Cx [pC] = hypotf (aij, y) ; \
}
GrB_Info GB (_bind2nd_tran__hypot_fp32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
float y = (*((const float *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
data.h | /*!
* Copyright (c) 2015 by Contributors
* Modifications Copyright (c) 2020 by Secure XGBoost Contributors
* \file data.h
* \brief The input data structure of xgboost.
* \author Tianqi Chen
*/
#ifndef XGBOOST_DATA_H_
#define XGBOOST_DATA_H_
#include <dmlc/base.h>
#include <dmlc/data.h>
#include <rabit/rabit.h>
#include <cstring>
#include <memory>
#include <numeric>
#include <algorithm>
#include <string>
#include <vector>
#include "./base.h"
#include "common/span.h"
#include "common/group_data.h"
#include "common/host_device_vector.h"
namespace xgboost {
// forward declare learner.
class LearnerImpl;
/*! \brief data type accepted by xgboost interface */
enum DataType {
kFloat32 = 1,
kDouble = 2,
kUInt32 = 3,
kUInt64 = 4
};
/*!
* \brief Meta information about dataset, always sit in memory.
*/
class MetaInfo {
public:
/*! \brief number of rows in the data */
uint64_t num_row_{0};
/*! \brief number of columns in the data */
uint64_t num_col_{0};
/*! \brief number of nonzero entries in the data */
uint64_t num_nonzero_{0};
/*! \brief label of each instance */
HostDeviceVector<bst_float> labels_;
/*!
* \brief specified root index of each instance,
* can be used for multi task setting
*/
std::vector<bst_uint> root_index_;
/*!
* \brief the index of begin and end of a group
* needed when the learning task is ranking.
*/
std::vector<bst_uint> group_ptr_;
/*! \brief weights of each instance, optional */
HostDeviceVector<bst_float> weights_;
/*! \brief session-id of each instance, optional */
std::vector<uint64_t> qids_;
/*!
* \brief initialized margins,
* if specified, xgboost will start from this init margin
* can be used to specify initial prediction to boost from.
*/
HostDeviceVector<bst_float> base_margin_;
/*! \brief version flag, used to check version of this info */
static const int kVersion = 2;
/*! \brief version that introduced qid field */
static const int kVersionQidAdded = 2;
/*! \brief default constructor */
MetaInfo() = default;
/*!
* \brief Get weight of each instances.
* \param i Instance index.
* \return The weight.
*/
inline bst_float GetWeight(size_t i) const {
return weights_.Size() != 0 ? weights_.HostVector()[i] : 1.0f;
}
/*!
* \brief Get the root index of i-th instance.
* \param i Instance index.
* \return The pre-defined root index of i-th instance.
*/
inline unsigned GetRoot(size_t i) const {
return root_index_.size() != 0 ? root_index_[i] : 0U;
}
#ifndef __ENCLAVE__
/*! \brief get sorted indexes (argsort) of labels by absolute value (used by cox loss) */
inline const std::vector<size_t>& LabelAbsSort() const {
if (label_order_cache_.size() == labels_.Size()) {
return label_order_cache_;
}
label_order_cache_.resize(labels_.Size());
std::iota(label_order_cache_.begin(), label_order_cache_.end(), 0);
const auto& l = labels_.HostVector();
XGBOOST_PARALLEL_SORT(label_order_cache_.begin(), label_order_cache_.end(),
[&l](size_t i1, size_t i2) {return std::abs(l[i1]) < std::abs(l[i2]);});
return label_order_cache_;
}
#endif // __ENCLAVE__
/*! \brief clear all the information */
void Clear();
/*!
* \brief Load the Meta info from binary stream.
* \param fi The input stream
*/
void LoadBinary(dmlc::Stream* fi);
/*!
* \brief Save the Meta info to binary stream
* \param fo The output stream.
*/
void SaveBinary(dmlc::Stream* fo) const;
/*!
* \brief Set information in the meta info.
* \param key The key of the information.
* \param dptr The data pointer of the source array.
* \param dtype The type of the source data.
* \param num Number of elements in the source array.
*/
void SetInfo(const char* key, const void* dptr, DataType dtype, size_t num);
private:
/*! \brief argsort of labels */
mutable std::vector<size_t> label_order_cache_;
};
/*! \brief Element from a sparse vector */
struct Entry {
/*! \brief feature index */
bst_uint index;
/*! \brief feature value */
bst_float fvalue;
/*! \brief default constructor */
Entry() = default;
/*!
* \brief constructor with index and value
* \param index The feature or row index.
* \param fvalue The feature value.
*/
Entry(bst_uint index, bst_float fvalue) : index(index), fvalue(fvalue) {}
/*! \brief reversely compare feature values */
inline static bool CmpValue(const Entry& a, const Entry& b) {
return a.fvalue < b.fvalue;
}
inline bool operator==(const Entry& other) const {
return (this->index == other.index && this->fvalue == other.fvalue);
}
};
/*!
* \brief In-memory storage unit of sparse batch, stored in CSR format.
*/
class SparsePage {
public:
// Offset for each row.
HostDeviceVector<size_t> offset;
/*! \brief the data of the segments */
HostDeviceVector<Entry> data;
size_t base_rowid;
/*! \brief an instance of sparse vector in the batch */
using Inst = common::Span<Entry const>;
/*! \brief get i-th row from the batch */
inline Inst operator[](size_t i) const {
const auto& data_vec = data.HostVector();
const auto& offset_vec = offset.HostVector();
size_t size;
// in distributed mode, some partitions may not get any instance for a feature. Therefore
// we should set the size as zero
#ifndef __ENCLAVE__
// FIXME
if (rabit::IsDistributed() && i + 1 >= offset_vec.size()) {
size = 0;
} else {
size = offset_vec[i + 1] - offset_vec[i];
}
#else
size = offset_vec[i + 1] - offset_vec[i];
#endif // __ENCLAVE__
return {data_vec.data() + offset_vec[i],
static_cast<Inst::index_type>(size)};
}
/*! \brief constructor */
SparsePage() {
this->Clear();
}
/*! \return number of instance in the page */
inline size_t Size() const {
return offset.Size() - 1;
}
/*! \return estimation of memory cost of this page */
inline size_t MemCostBytes() const {
return offset.Size() * sizeof(size_t) + data.Size() * sizeof(Entry);
}
/*! \brief clear the page */
inline void Clear() {
base_rowid = 0;
auto& offset_vec = offset.HostVector();
offset_vec.clear();
offset_vec.push_back(0);
data.HostVector().clear();
}
SparsePage GetTranspose(int num_columns) const {
SparsePage transpose;
common::ParallelGroupBuilder<Entry> builder(&transpose.offset.HostVector(),
&transpose.data.HostVector());
const int nthread = omp_get_max_threads();
builder.InitBudget(num_columns, nthread);
long batch_size = static_cast<long>(this->Size()); // NOLINT(*)
#pragma omp parallel for schedule(static)
for (long i = 0; i < batch_size; ++i) { // NOLINT(*)
int tid = omp_get_thread_num();
auto inst = (*this)[i];
for (bst_uint j = 0; j < inst.size(); ++j) {
builder.AddBudget(inst[j].index, tid);
}
}
builder.InitStorage();
#pragma omp parallel for schedule(static)
for (long i = 0; i < batch_size; ++i) { // NOLINT(*)
int tid = omp_get_thread_num();
auto inst = (*this)[i];
for (bst_uint j = 0; j < inst.size(); ++j) {
builder.Push(
inst[j].index,
Entry(static_cast<bst_uint>(this->base_rowid + i), inst[j].fvalue),
tid);
}
}
return transpose;
}
void SortRows() {
auto ncol = static_cast<bst_omp_uint>(this->Size());
#pragma omp parallel for schedule(dynamic, 1)
for (bst_omp_uint i = 0; i < ncol; ++i) {
if (this->offset.HostVector()[i] < this->offset.HostVector()[i + 1]) {
std::sort(
this->data.HostVector().begin() + this->offset.HostVector()[i],
this->data.HostVector().begin() + this->offset.HostVector()[i + 1],
Entry::CmpValue);
}
}
}
/*!
* \brief Push row block into the page.
* \param batch the row batch.
*/
void Push(const dmlc::RowBlock<uint32_t>& batch);
/*!
* \brief Push a sparse page
* \param batch the row page
*/
void Push(const SparsePage &batch);
/*!
* \brief Push a SparsePage stored in CSC format
* \param batch The row batch to be pushed
*/
void PushCSC(const SparsePage& batch);
/*!
* \brief Push one instance into page
* \param inst an instance row
*/
inline void Push(const Inst &inst) {
auto& data_vec = data.HostVector();
auto& offset_vec = offset.HostVector();
offset_vec.push_back(offset_vec.back() + inst.size());
size_t begin = data_vec.size();
data_vec.resize(begin + inst.size());
if (inst.size() != 0) {
std::memcpy(dmlc::BeginPtr(data_vec) + begin, inst.data(),
sizeof(Entry) * inst.size());
}
}
size_t Size() { return offset.Size() - 1; }
};
class BatchIteratorImpl {
public:
virtual ~BatchIteratorImpl() {}
virtual BatchIteratorImpl* Clone() = 0;
virtual SparsePage& operator*() = 0;
virtual const SparsePage& operator*() const = 0;
virtual void operator++() = 0;
virtual bool AtEnd() const = 0;
};
class BatchIterator {
public:
using iterator_category = std::forward_iterator_tag;
explicit BatchIterator(BatchIteratorImpl* impl) { impl_.reset(impl); }
BatchIterator(const BatchIterator& other) {
if (other.impl_) {
impl_.reset(other.impl_->Clone());
} else {
impl_.reset();
}
}
void operator++() {
CHECK(impl_ != nullptr);
++(*impl_);
}
SparsePage& operator*() {
CHECK(impl_ != nullptr);
return *(*impl_);
}
const SparsePage& operator*() const {
CHECK(impl_ != nullptr);
return *(*impl_);
}
bool operator!=(const BatchIterator& rhs) const {
CHECK(impl_ != nullptr);
return !impl_->AtEnd();
}
bool AtEnd() const {
CHECK(impl_ != nullptr);
return impl_->AtEnd();
}
private:
std::unique_ptr<BatchIteratorImpl> impl_;
};
class BatchSet {
public:
explicit BatchSet(BatchIterator begin_iter) : begin_iter_(begin_iter) {}
BatchIterator begin() { return begin_iter_; }
BatchIterator end() { return BatchIterator(nullptr); }
private:
BatchIterator begin_iter_;
};
/*!
* \brief This is data structure that user can pass to DMatrix::Create
* to create a DMatrix for training, user can create this data structure
* for customized Data Loading on single machine.
*
* On distributed setting, usually an customized dmlc::Parser is needed instead.
*/
class DataSource : public dmlc::DataIter<SparsePage> {
public:
/*!
* \brief Meta information about the dataset
* The subclass need to be able to load this correctly from data.
*/
MetaInfo info;
};
/*!
* \brief A vector-like structure to represent set of rows.
* But saves the memory when all rows are in the set (common case in xgb)
*/
class RowSet {
public:
/*! \return i-th row index */
inline bst_uint operator[](size_t i) const;
/*! \return the size of the set. */
inline size_t Size() const;
/*! \brief push the index back to the set */
inline void PushBack(bst_uint i);
/*! \brief clear the set */
inline void Clear();
/*!
* \brief save rowset to file.
* \param fo The file to be saved.
*/
inline void Save(dmlc::Stream* fo) const;
/*!
* \brief Load rowset from file.
* \param fi The file to be loaded.
* \return if read is successful.
*/
inline bool Load(dmlc::Stream* fi);
/*! \brief constructor */
RowSet() = default;
private:
/*! \brief The internal data structure of size */
uint64_t size_{0};
/*! \brief The internal data structure of row set if not all*/
std::vector<bst_uint> rows_;
};
/*!
* \brief Internal data structured used by XGBoost during training.
* There are two ways to create a customized DMatrix that reads in user defined-format.
*
* - Provide a dmlc::Parser and pass into the DMatrix::Create
* - Alternatively, if data can be represented by an URL, define a new dmlc::Parser and register by DMLC_REGISTER_DATA_PARSER;
* - This works best for user defined data input source, such as data-base, filesystem.
* - Provide a DataSource, that can be passed to DMatrix::Create
* This can be used to re-use inmemory data structure into DMatrix.
*/
class DMatrix {
public:
/*! \brief default constructor */
DMatrix() = default;
/*! \brief meta information of the dataset */
virtual MetaInfo& Info() = 0;
/*! \brief meta information of the dataset */
virtual const MetaInfo& Info() const = 0;
/**
* \brief Gets row batches. Use range based for loop over BatchSet to access individual batches.
*/
virtual BatchSet GetRowBatches() = 0;
virtual BatchSet GetSortedColumnBatches() = 0;
virtual BatchSet GetColumnBatches() = 0;
// the following are column meta data, should be able to answer them fast.
/*! \return Whether the data columns single column block. */
virtual bool SingleColBlock() const = 0;
/*! \brief get column density */
virtual float GetColDensity(size_t cidx) = 0;
/*! \brief virtual destructor */
virtual ~DMatrix() = default;
/*!
* \brief Save DMatrix to local file.
* The saved file only works for non-sharded dataset(single machine training).
* This API is deprecated and dis-encouraged to use.
* \param fname The file name to be saved.
* \return The created DMatrix.
*/
virtual void SaveToLocalFile(const std::string& fname);
/*!
* \brief Load DMatrix from URI.
* \param uri The URI of input.
* \param silent Whether print information during loading.
* \param load_row_split Flag to read in part of rows, divided among the workers in distributed mode.
* \param file_format The format type of the file, used for dmlc::Parser::Create.
* By default "auto" will be able to load in both local binary file.
* \param page_size Page size for external memory.
* \return The created DMatrix.
*/
static DMatrix* Load(const std::string& uri,
bool silent,
bool load_row_split,
#ifdef __ENCLAVE__ // pass decryption key
bool is_encrypted,
char* key,
#endif
const std::string& file_format = "auto",
const size_t page_size = kPageSize);
static DMatrix* Load(std::vector<const std::string>& uris,
bool silent,
bool load_row_split,
bool is_encrypted,
char* keys[],
const std::string& file_format = "auto",
const size_t page_size = kPageSize);
/*!
* \brief create a new DMatrix, by wrapping a row_iterator, and meta info.
* \param source The source iterator of the data, the create function takes ownership of the source.
* \param cache_prefix The path to prefix of temporary cache file of the DMatrix when used in external memory mode.
* This can be nullptr for common cases, and in-memory mode will be used.
* \return a Created DMatrix.
*/
static DMatrix* Create(std::unique_ptr<DataSource>&& source,
const std::string& cache_prefix = "");
/*!
* \brief Create a DMatrix by loading data from parser.
* Parser can later be deleted after the DMatrix i created.
* \param parser The input data parser
* \param cache_prefix The path to prefix of temporary cache file of the DMatrix when used in external memory mode.
* This can be nullptr for common cases, and in-memory mode will be used.
* \param page_size Page size for external memory.
* \sa dmlc::Parser
* \note dmlc-core provides efficient distributed data parser for libsvm format.
* User can create and register customized parser to load their own format using DMLC_REGISTER_DATA_PARSER.
* See "dmlc-core/include/dmlc/data.h" for detail.
* \return A created DMatrix.
*/
static DMatrix* Create(dmlc::Parser<uint32_t>* parser,
const std::string& cache_prefix = "",
const size_t page_size = kPageSize);
static DMatrix* Create(std::vector<std::shared_ptr<dmlc::Parser<uint32_t>>> parsers,
const std::string& cache_prefix = "",
const size_t page_size = kPageSize);
/*! \brief page size 32 MB */
static const size_t kPageSize = 32UL << 20UL;
};
// implementation of inline functions
inline bst_uint RowSet::operator[](size_t i) const {
return rows_.size() == 0 ? static_cast<bst_uint>(i) : rows_[i];
}
inline size_t RowSet::Size() const {
return size_;
}
inline void RowSet::Clear() {
rows_.clear(); size_ = 0;
}
inline void RowSet::PushBack(bst_uint i) {
if (rows_.size() == 0) {
if (i == size_) {
++size_; return;
} else {
rows_.resize(size_);
for (size_t i = 0; i < size_; ++i) {
rows_[i] = static_cast<bst_uint>(i);
}
}
}
rows_.push_back(i);
++size_;
}
inline void RowSet::Save(dmlc::Stream* fo) const {
fo->Write(rows_);
fo->Write(&size_, sizeof(size_));
}
inline bool RowSet::Load(dmlc::Stream* fi) {
if (!fi->Read(&rows_)) return false;
if (rows_.size() != 0) return true;
return fi->Read(&size_, sizeof(size_)) == sizeof(size_);
}
} // namespace xgboost
namespace dmlc {
DMLC_DECLARE_TRAITS(is_pod, xgboost::Entry, true);
DMLC_DECLARE_TRAITS(has_saveload, xgboost::RowSet, true);
}
#endif // XGBOOST_DATA_H_
|
firstprivate-clause.c | #include <stdio.h>
#ifdef _OPENMP
#include <omp.h>
#else
#define omp_get_thread_num() 0
#endif
main() {
int i, n = 7;
int a[n], suma=0;
for (i=0; i<n; i++)
a[i] = i;
//Entraran todas con suma = 0, pero el valor a la salida es indefinido.
#pragma omp parallel for firstprivate(suma) //lastprivate(suma)
for (i=0; i<n; i++)
{
suma = suma + a[i];
printf(" thread %d suma a[%d] suma=%d \n",omp_get_thread_num(),i,suma);
}
printf("\nFuera de la construcción parallel suma=%d\n",suma);
}
|
convolution_winograd_transform.h | // Tencent is pleased to support the open source community by making ncnn available.
//
// Copyright (C) 2022 THL A29 Limited, a Tencent company. All rights reserved.
//
// Licensed under the BSD 3-Clause License (the "License"); you may not use this file except
// in compliance with the License. You may obtain a copy of the License at
//
// https://opensource.org/licenses/BSD-3-Clause
//
// Unless required by applicable law or agreed to in writing, software distributed
// under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR
// CONDITIONS OF ANY KIND, either express or implied. See the License for the
// specific language governing permissions and limitations under the License.
static void conv3x3s1_winograd63_transform_output_neon(const Mat& top_blob_tm, Mat& top_blob, const Mat& bias, const Option& opt)
{
const int outw = top_blob.w;
const int outh = top_blob.h;
const int outch = top_blob.c;
const int w_tiles = outw / 6;
const int h_tiles = outh / 6;
const int tiles = w_tiles * h_tiles;
const float* biasptr = bias;
// const float otm[6][8] = {
// {1.0f, 1.0f, 1.0f, 1.0f, 1.0f, 32.0f, 32.0f, 0.0f},
// {0.0f, 1.0f, -1.0f, 2.0f, -2.0f, 16.0f,-16.0f, 0.0f},
// {0.0f, 1.0f, 1.0f, 4.0f, 4.0f, 8.0f, 8.0f, 0.0f},
// {0.0f, 1.0f, -1.0f, 8.0f, -8.0f, 4.0f, -4.0f, 0.0f},
// {0.0f, 1.0f, 1.0f, 16.0f, 16.0f, 2.0f, 2.0f, 0.0f},
// {0.0f, 1.0f, -1.0f, 32.0f, -32.0f, 1.0f, -1.0f, 1.0f}
// };
// 0 = r0 + (r1 + r2) + (r3 + r4) + (r5 + r6) * 32
// 1 = (r1 - r2) + (r3 - r4) * 2 + (r5 - r6) * 16
// 2 = (r1 + r2) + (r3 + r4) * 4 + (r5 + r6) * 8
// 3 = (r1 - r2) + (r3 - r4) * 8 + (r5 - r6) * 4
// 4 = (r1 + r2) + (r3 + r4) * 16+ (r5 + r6) * 2
// 5 = r7 + (r1 - r2) + (r3 - r4) * 32+ (r5 - r6)
#pragma omp parallel for num_threads(opt.num_threads)
for (int p = 0; p < outch; p++)
{
const Mat out0_tm = top_blob_tm.channel(p);
Mat out0 = top_blob.channel(p);
const float bias0 = biasptr ? biasptr[p] : 0.f;
float tmp[6][8];
// tile
for (int i = 0; i < h_tiles; i++)
{
for (int j = 0; j < w_tiles; j++)
{
const float* output0_tm_0 = (const float*)out0_tm + (i * w_tiles + j);
const float* output0_tm_1 = output0_tm_0 + tiles * 1;
const float* output0_tm_2 = output0_tm_0 + tiles * 2;
const float* output0_tm_3 = output0_tm_0 + tiles * 3;
const float* output0_tm_4 = output0_tm_0 + tiles * 4;
const float* output0_tm_5 = output0_tm_0 + tiles * 5;
const float* output0_tm_6 = output0_tm_0 + tiles * 6;
const float* output0_tm_7 = output0_tm_0 + tiles * 7;
// TODO neon optimize
for (int m = 0; m < 8; m++)
{
float tmp024a = output0_tm_1[0] + output0_tm_2[0];
float tmp135a = output0_tm_1[0] - output0_tm_2[0];
float tmp024b = output0_tm_3[0] + output0_tm_4[0];
float tmp135b = output0_tm_3[0] - output0_tm_4[0];
float tmp024c = output0_tm_5[0] + output0_tm_6[0];
float tmp135c = output0_tm_5[0] - output0_tm_6[0];
tmp[0][m] = output0_tm_0[0] + tmp024a + tmp024b + tmp024c * 32;
tmp[2][m] = tmp024a + tmp024b * 4 + tmp024c * 8;
tmp[4][m] = tmp024a + tmp024b * 16 + tmp024c + tmp024c;
tmp[1][m] = tmp135a + tmp135b + tmp135b + tmp135c * 16;
tmp[3][m] = tmp135a + tmp135b * 8 + tmp135c * 4;
tmp[5][m] = output0_tm_7[0] + tmp135a + tmp135b * 32 + tmp135c;
output0_tm_0 += tiles * 8;
output0_tm_1 += tiles * 8;
output0_tm_2 += tiles * 8;
output0_tm_3 += tiles * 8;
output0_tm_4 += tiles * 8;
output0_tm_5 += tiles * 8;
output0_tm_6 += tiles * 8;
output0_tm_7 += tiles * 8;
}
float* output0 = out0.row(i * 6) + j * 6;
for (int m = 0; m < 6; m++)
{
const float* tmp0 = tmp[m];
float tmp024a = tmp0[1] + tmp0[2];
float tmp135a = tmp0[1] - tmp0[2];
float tmp024b = tmp0[3] + tmp0[4];
float tmp135b = tmp0[3] - tmp0[4];
float tmp024c = tmp0[5] + tmp0[6];
float tmp135c = tmp0[5] - tmp0[6];
output0[0] = bias0 + tmp0[0] + tmp024a + tmp024b + tmp024c * 32;
output0[2] = bias0 + tmp024a + tmp024b * 4 + tmp024c * 8;
output0[4] = bias0 + tmp024a + tmp024b * 16 + tmp024c + tmp024c;
output0[1] = bias0 + tmp135a + tmp135b + tmp135b + tmp135c * 16;
output0[3] = bias0 + tmp135a + tmp135b * 8 + tmp135c * 4;
output0[5] = bias0 + tmp0[7] + tmp135a + tmp135b * 32 + tmp135c;
output0 += outw;
}
}
}
}
}
|
residualbased_newton_raphson_contact_strategy.h | // KRATOS ___| | | |
// \___ \ __| __| | | __| __| | | __| _` | |
// | | | | | ( | | | | ( | |
// _____/ \__|_| \__,_|\___|\__|\__,_|_| \__,_|_| MECHANICS
//
// License: BSD License
// license: StructuralMechanicsApplication/license.txt
//
// Main authors: Vicente Mataix Ferrandiz
//
#if !defined(KRATOS_RESIDUALBASED_NEWTON_RAPHSON_CONTACT_STRATEGY)
#define KRATOS_RESIDUALBASED_NEWTON_RAPHSON_CONTACT_STRATEGY
/* System Includes */
/* External Includes */
/* Project includes */
#include "contact_structural_mechanics_application_variables.h"
#include "includes/kratos_parameters.h"
#include "includes/define.h"
#include "includes/model_part.h"
#include "includes/variables.h"
// Strategies
#include "solving_strategies/strategies/residualbased_newton_raphson_strategy.h"
// Utilities
#include "utilities/variable_utils.h"
#include "utilities/color_utilities.h"
#include "utilities/math_utils.h"
#include "custom_python/process_factory_utility.h"
#include "custom_utilities/contact_utilities.h"
namespace Kratos {
///@name Kratos Globals
///@{
///@}
///@name Type Definitions
///@{
///@}
///@name Enum's
///@{
///@}
///@name Functions
///@{
///@}
///@name Kratos Classes
///@{
/**
* @class ResidualBasedNewtonRaphsonContactStrategy
* @ingroup ContactStructuralMechanicsApplication
* @brief Contact Newton Raphson class
* @details This class is a specialization of the Newton Raphson strategy with some custom modifications for contact problems
* @author Vicente Mataix Ferrandiz
*/
template<class TSparseSpace,
class TDenseSpace, // = DenseSpace<double>,
class TLinearSolver //= LinearSolver<TSparseSpace,TDenseSpace>
>
class ResidualBasedNewtonRaphsonContactStrategy :
public ResidualBasedNewtonRaphsonStrategy< TSparseSpace, TDenseSpace, TLinearSolver >
{
public:
///@name Type Definitions
///@{
/** Counted pointer of ClassName */
KRATOS_CLASS_POINTER_DEFINITION( ResidualBasedNewtonRaphsonContactStrategy );
typedef SolvingStrategy<TSparseSpace, TDenseSpace, TLinearSolver> StrategyBaseType;
typedef ResidualBasedNewtonRaphsonStrategy<TSparseSpace, TDenseSpace, TLinearSolver> BaseType;
typedef ConvergenceCriteria<TSparseSpace, TDenseSpace> TConvergenceCriteriaType;
typedef typename BaseType::TBuilderAndSolverType TBuilderAndSolverType;
typedef typename BaseType::TDataType TDataType;
typedef TSparseSpace SparseSpaceType;
typedef typename BaseType::TSchemeType TSchemeType;
typedef typename BaseType::DofsArrayType DofsArrayType;
typedef typename BaseType::TSystemMatrixType TSystemMatrixType;
typedef typename BaseType::TSystemVectorType TSystemVectorType;
typedef typename BaseType::LocalSystemVectorType LocalSystemVectorType;
typedef typename BaseType::LocalSystemMatrixType LocalSystemMatrixType;
typedef typename BaseType::TSystemMatrixPointerType TSystemMatrixPointerType;
typedef typename BaseType::TSystemVectorPointerType TSystemVectorPointerType;
typedef ModelPart::NodesContainerType NodesArrayType;
typedef ModelPart::ElementsContainerType ElementsArrayType;
typedef ModelPart::ConditionsContainerType ConditionsArrayType;
typedef ProcessFactoryUtility::Pointer ProcessesListType;
typedef std::size_t IndexType;
/**
* @brief Default constructor
* @param rModelPart The model part of the problem
* @param p_scheme The integration scheme
* @param pNewLinearSolver The linear solver employed
* @param pNewConvergenceCriteria The convergence criteria employed
* @param MaxIterations The maximum number of iterations
* @param CalculateReactions The flag for the reaction calculation
* @param ReformDofSetAtEachStep The flag that allows to compute the modification of the DOF
* @param MoveMeshFlag The flag that allows to move the mesh
*/
ResidualBasedNewtonRaphsonContactStrategy(
ModelPart& rModelPart,
typename TSchemeType::Pointer p_scheme,
typename TLinearSolver::Pointer pNewLinearSolver,
typename TConvergenceCriteriaType::Pointer pNewConvergenceCriteria,
IndexType MaxIterations = 30,
bool CalculateReactions = false,
bool ReformDofSetAtEachStep = false,
bool MoveMeshFlag = false,
Parameters ThisParameters = Parameters(R"({})"),
ProcessesListType pMyProcesses = nullptr,
ProcessesListType pPostProcesses = nullptr
)
: ResidualBasedNewtonRaphsonStrategy<TSparseSpace, TDenseSpace, TLinearSolver>(rModelPart, p_scheme, pNewLinearSolver, pNewConvergenceCriteria, MaxIterations, CalculateReactions, ReformDofSetAtEachStep, MoveMeshFlag),
mThisParameters(ThisParameters),
mpMyProcesses(pMyProcesses),
mpPostProcesses(pPostProcesses)
{
KRATOS_TRY;
mConvergenceCriteriaEchoLevel = pNewConvergenceCriteria->GetEchoLevel();
Parameters default_parameters = GetDefaultParameters();
mThisParameters.ValidateAndAssignDefaults(default_parameters);
KRATOS_CATCH("");
}
/**
* @brief Default constructor
* @param rModelPart The model part of the problem
* @param p_scheme The integration scheme
* @param pNewLinearSolver The linear solver employed
* @param pNewConvergenceCriteria The convergence criteria employed
* @param MaxIterations The maximum number of iterations
* @param CalculateReactions The flag for the reaction calculation
* @param ReformDofSetAtEachStep The flag that allows to compute the modification of the DOF
* @param MoveMeshFlag The flag that allows to move the mesh
*/
ResidualBasedNewtonRaphsonContactStrategy(
ModelPart& rModelPart,
typename TSchemeType::Pointer p_scheme,
typename TLinearSolver::Pointer pNewLinearSolver,
typename TConvergenceCriteriaType::Pointer pNewConvergenceCriteria,
typename TBuilderAndSolverType::Pointer pNewBuilderAndSolver,
IndexType MaxIterations = 30,
bool CalculateReactions = false,
bool ReformDofSetAtEachStep = false,
bool MoveMeshFlag = false,
Parameters ThisParameters = Parameters(R"({})"),
ProcessesListType pMyProcesses = nullptr,
ProcessesListType pPostProcesses = nullptr
)
: ResidualBasedNewtonRaphsonStrategy<TSparseSpace, TDenseSpace, TLinearSolver>(rModelPart, p_scheme, pNewLinearSolver, pNewConvergenceCriteria, pNewBuilderAndSolver, MaxIterations, CalculateReactions, ReformDofSetAtEachStep, MoveMeshFlag ),
mThisParameters(ThisParameters),
mpMyProcesses(pMyProcesses),
mpPostProcesses(pPostProcesses)
{
KRATOS_TRY;
mConvergenceCriteriaEchoLevel = pNewConvergenceCriteria->GetEchoLevel();
Parameters default_parameters = GetDefaultParameters();
mThisParameters.ValidateAndAssignDefaults(default_parameters);
KRATOS_CATCH("");
}
/**
* Destructor.
*/
~ResidualBasedNewtonRaphsonContactStrategy() override
= default;
//******************** OPERATIONS ACCESSIBLE FROM THE INPUT: ************************//
//***********************************************************************************//
/**
* @brief Operation to predict the solution ... if it is not called a trivial predictor is used in which the
* values of the solution step of interest are assumed equal to the old values
*/
void Predict() override
{
KRATOS_TRY
// Auxiliar zero array
const array_1d<double, 3> zero_array = ZeroVector(3);
// Set to zero the weighted gap
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
NodesArrayType& nodes_array = r_model_part.GetSubModelPart("Contact").Nodes();
const bool frictional = r_model_part.Is(SLIP);
// We predict contact pressure in case of contact problem
if (nodes_array.begin()->SolutionStepsDataHas(WEIGHTED_GAP)) {
VariableUtils().SetScalarVar<Variable<double>>(WEIGHTED_GAP, 0.0, nodes_array);
if (frictional) {
VariableUtils().SetVectorVar(WEIGHTED_SLIP, zero_array, nodes_array);
}
// Compute the current gap
ContactUtilities::ComputeExplicitContributionConditions(r_model_part.GetSubModelPart("ComputingContact"));
// We predict a contact pressure
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
const std::size_t step = r_process_info[STEP];
if (step == 1) {
#pragma omp parallel for
for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i) {
auto it_node = nodes_array.begin() + i;
noalias(it_node->Coordinates()) += it_node->FastGetSolutionStepValue(DISPLACEMENT);
}
} else {
#pragma omp parallel for
for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i) {
auto it_node = nodes_array.begin() + i;
noalias(it_node->Coordinates()) += (it_node->FastGetSolutionStepValue(DISPLACEMENT) - it_node->FastGetSolutionStepValue(DISPLACEMENT, 1));
}
}
}
// BaseType::Predict(); // NOTE: May cause problems in dynamics!!!
//
// // Set to zero the weighted gap // NOTE: This can be done during the search if the predict is deactivated
// ModelPart& r_model_part = StrategyBaseType::GetModelPart();
// NodesArrayType& nodes_array = r_model_part.GetSubModelPart("Contact").Nodes();
//
// // We predict contact pressure in case of contact problem
// if (nodes_array.begin()->SolutionStepsDataHas(WEIGHTED_GAP)) {
// VariableUtils().SetScalarVar<Variable<double>>(WEIGHTED_GAP, 0.0, nodes_array);
//
// // Compute the current gap
// ContactUtilities::ComputeExplicitContributionConditions(r_model_part.GetSubModelPart("ComputingContact"));
//
// // We predict a contact pressure
// ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
// const double initial_penalty_parameter = r_process_info[INITIAL_PENALTY];
//
// // We iterate over the nodes
// bool is_components = nodes_array.begin()->SolutionStepsDataHas(LAGRANGE_MULTIPLIER_CONTACT_PRESSURE) ? false : true;
//
// #pragma omp parallel for
// for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i) {
// auto it_node = nodes_array.begin() + i;
//
// const double current_gap = it_node->FastGetSolutionStepValue(WEIGHTED_GAP);
//
// const double penalty = it_node->Has(INITIAL_PENALTY) ? it_node->GetValue(INITIAL_PENALTY) : initial_penalty_parameter;
//
// if (current_gap < 0.0) {
// it_node->Set(ACTIVE, true);
// if (is_components) {
// it_node->FastGetSolutionStepValue(LAGRANGE_MULTIPLIER_CONTACT_PRESSURE) = penalty * current_gap;
// } else {
// const array_1d<double, 3>& normal = it_node->FastGetSolutionStepValue(NORMAL);
// it_node->FastGetSolutionStepValue(VECTOR_LAGRANGE_MULTIPLIER) = penalty * current_gap * normal;
// }
// }
// }
// }
KRATOS_CATCH("")
}
/**
* @brief Initialization of member variables and prior operations
*/
void Initialize() override
{
KRATOS_TRY;
BaseType::Initialize();
mFinalizeWasPerformed = false;
// Initializing NL_ITERATION_NUMBER
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
r_process_info[NL_ITERATION_NUMBER] = 1;
KRATOS_CATCH("");
}
/**
* @brief The problem of interest is solved.
* @details This function calls sequentially: Initialize(), InitializeSolutionStep(), Predict(),
* SolveSolutionStep() and FinalizeSolutionStep().
* All those functions can otherwise be called separately.
*/
double Solve() override
{
this->Initialize();
this->InitializeSolutionStep();
this->Predict();
this->SolveSolutionStep();
this->FinalizeSolutionStep();
// TODO: Add something if necessary
return 0.0;
}
/**
* @brief Performs all the required operations that should be done (for each step)
* before solving the solution step.
* @details A member variable should be used as a flag to make sure this function is called only once per step.
*/
void InitializeSolutionStep() override
{
BaseType::mpConvergenceCriteria->SetEchoLevel(0);
BaseType::InitializeSolutionStep();
BaseType::mpConvergenceCriteria->SetEchoLevel(mConvergenceCriteriaEchoLevel);
mFinalizeWasPerformed = false;
}
/**
* @brief Performs all the required operations that should be done (for each step)
* after solving the solution step.
*/
void FinalizeSolutionStep() override
{
KRATOS_TRY;
if (mFinalizeWasPerformed == false) {
BaseType::FinalizeSolutionStep();
// To avoid compute twice the FinalizeSolutionStep
mFinalizeWasPerformed = true;
}
KRATOS_CATCH("");
}
/**
* @brief Solves the current step.
* @details This function returns true if a solution has been found, false otherwise.
*/
bool SolveSolutionStep() override
{
KRATOS_TRY;
// bool is_converged = BaseType::SolveSolutionStep(); // FIXME: Requires to separate the non linear iterations
// bool is_converged = BaseSolveSolutionStep(); // Direct solution
bool is_converged = false;
// Getting model part
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
if (r_model_part.IsNot(INTERACTION)) {
// We get the system
TSystemMatrixType& A = *BaseType::mpA;
TSystemVectorType& Dx = *BaseType::mpDx;
TSystemVectorType& b = *BaseType::mpb;
// We get the process info
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
int inner_iteration = 0;
while (!is_converged && inner_iteration < mThisParameters["inner_loop_iterations"].GetInt()) {
++inner_iteration;
if (mConvergenceCriteriaEchoLevel > 0 && StrategyBaseType::GetModelPart().GetCommunicator().MyPID() == 0 ) {
std::cout << std::endl << BOLDFONT("Simplified semi-smooth strategy. INNER ITERATION: ") << inner_iteration;;
}
// We solve one loop
r_process_info[NL_ITERATION_NUMBER] = 1;
r_process_info[INNER_LOOP_ITERATION] = inner_iteration;
is_converged = BaseSolveSolutionStep();
// We check the convergence
BaseType::mpConvergenceCriteria->SetEchoLevel(0);
is_converged = BaseType::mpConvergenceCriteria->PostCriteria(r_model_part, BaseType::GetBuilderAndSolver()->GetDofSet(), A, Dx, b);
BaseType::mpConvergenceCriteria->SetEchoLevel(mConvergenceCriteriaEchoLevel);
if (mConvergenceCriteriaEchoLevel > 0 && StrategyBaseType::GetModelPart().GetCommunicator().MyPID() == 0 ) {
if (is_converged) std::cout << BOLDFONT("Simplified semi-smooth strategy. INNER ITERATION: ") << BOLDFONT(FGRN("CONVERGED")) << std::endl;
else std::cout << BOLDFONT("Simplified semi-smooth strategy. INNER ITERATION: ") << BOLDFONT(FRED("NOT CONVERGED")) << std::endl;
}
}
} else {
// We compute the base loop
r_model_part.GetProcessInfo()[INNER_LOOP_ITERATION] = 1;
is_converged = BaseSolveSolutionStep();
}
if (mThisParameters["adaptative_strategy"].GetBool()) {
if (!is_converged) {
is_converged = AdaptativeStep();
}
}
return is_converged;
KRATOS_CATCH("");
}
///@}
///@name Access
///@{
///@}
///@name Inquiry
///@{
///@}
///@name Input and output
///@{
///@}
///@name Friends
///@{
protected:
///@name Protected static Member Variables
///@{
///@}
///@name Protected member Variables
///@{
Parameters mThisParameters; /// The configuration parameters
// ADAPTATIVE STRATEGY PARAMETERS
bool mFinalizeWasPerformed; /// If the FinalizeSolutionStep has been already permformed
ProcessesListType mpMyProcesses; /// The processes list
ProcessesListType mpPostProcesses; /// The post processes list
// OTHER PARAMETERS
int mConvergenceCriteriaEchoLevel; /// The echo level of the convergence criteria
///@}
///@name Protected Operators
///@{
/**
* @brief Solves the current step.
* @details This function returns true if a solution has been found, false otherwise.
*/
bool BaseSolveSolutionStep()
{
KRATOS_TRY;
// Pointers needed in the solution
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
typename TSchemeType::Pointer p_scheme = BaseType::GetScheme();
typename TBuilderAndSolverType::Pointer p_builder_and_solver = BaseType::GetBuilderAndSolver();
auto& r_dof_set = p_builder_and_solver->GetDofSet();
TSystemMatrixType& rA = *BaseType::mpA;
TSystemVectorType& rDx = *BaseType::mpDx;
TSystemVectorType& rb = *BaseType::mpb;
// Initializing the parameters of the Newton-Raphson cicle
IndexType iteration_number = 1;
r_process_info[NL_ITERATION_NUMBER] = iteration_number;
bool is_converged = false;
bool residual_is_updated = false;
p_scheme->InitializeNonLinIteration(r_model_part, rA, rDx, rb);
BaseType::mpConvergenceCriteria->InitializeNonLinearIteration(r_model_part, r_dof_set, rA, rDx, rb);
is_converged = BaseType::mpConvergenceCriteria->PreCriteria(r_model_part, r_dof_set, rA, rDx, rb);
// We do a geometry check before solve the system for first time
if (mThisParameters["adaptative_strategy"].GetBool()) {
if (CheckGeometryInverted()) {
KRATOS_WARNING("Element inverted") << "INVERTED ELEMENT BEFORE FIRST SOLVE" << std::endl;
r_process_info[STEP] -= 1; // We revert one step in the case that the geometry is already broken before start the computing
return false;
}
}
// Function to perform the building and the solving phase.
if (StrategyBaseType::mRebuildLevel > 1 || StrategyBaseType::mStiffnessMatrixIsBuilt == false) {
TSparseSpace::SetToZero(rA);
TSparseSpace::SetToZero(rDx);
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildAndSolve(p_scheme, r_model_part, rA, rDx, rb);
} else {
TSparseSpace::SetToZero(rDx); //Dx=0.00;
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildRHSAndSolve(p_scheme, r_model_part, rA, rDx, rb);
}
// Debugging info
BaseType::EchoInfo(iteration_number);
// Updating the results stored in the database
UpdateDatabase(rA, rDx, rb, StrategyBaseType::MoveMeshFlag());
// We now check the geometry
if (mThisParameters["adaptative_strategy"].GetBool()) {
if (CheckGeometryInverted()) {
KRATOS_WARNING("Element inverted") << "INVERTED ELEMENT DURING DATABASE UPDATE" << std::endl;
r_process_info[STEP] -= 1; // We revert one step in the case that the geometry is already broken before start the computing
return false;
}
}
p_scheme->FinalizeNonLinIteration(r_model_part, rA, rDx, rb);
BaseType::mpConvergenceCriteria->FinalizeNonLinearIteration(r_model_part, r_dof_set, rA, rDx, rb);
if (is_converged) {
// Initialisation of the convergence criteria
BaseType::mpConvergenceCriteria->InitializeSolutionStep(r_model_part, r_dof_set, rA, rDx, rb);
if (BaseType::mpConvergenceCriteria->GetActualizeRHSflag()) {
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildRHS(p_scheme, r_model_part, rb);
}
is_converged = BaseType::mpConvergenceCriteria->PostCriteria(r_model_part, r_dof_set, rA, rDx, rb);
}
// Iteration Cicle... performed only for NonLinearProblems
while (is_converged == false && iteration_number++<BaseType::mMaxIterationNumber) {
//setting the number of iteration
r_process_info[NL_ITERATION_NUMBER] = iteration_number;
p_scheme->InitializeNonLinIteration(r_model_part, rA, rDx, rb);
BaseType::mpConvergenceCriteria->InitializeNonLinearIteration(r_model_part, r_dof_set, rA, rDx, rb);
is_converged = BaseType::mpConvergenceCriteria->PreCriteria(r_model_part, r_dof_set, rA, rDx, rb);
//call the linear system solver to find the correction mDx for the
//it is not called if there is no system to solve
if (SparseSpaceType::Size(rDx) != 0) {
if (StrategyBaseType::mRebuildLevel > 1 || StrategyBaseType::mStiffnessMatrixIsBuilt == false ) {
if( BaseType::GetKeepSystemConstantDuringIterations() == false) {
//A = 0.00;
TSparseSpace::SetToZero(rA);
TSparseSpace::SetToZero(rDx);
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildAndSolve(p_scheme, r_model_part, rA, rDx, rb);
}
else {
TSparseSpace::SetToZero(rDx);
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildRHSAndSolve(p_scheme, r_model_part, rA, rDx, rb);
}
}
else {
TSparseSpace::SetToZero(rDx);
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildRHSAndSolve(p_scheme, r_model_part, rA, rDx, rb);
}
} else {
KRATOS_WARNING("No DoFs") << "ATTENTION: no free DOFs!! " << std::endl;
}
// Debugging info
BaseType::EchoInfo(iteration_number);
// Updating the results stored in the database
UpdateDatabase(rA, rDx, rb, StrategyBaseType::MoveMeshFlag());
// We now check the geometry
if (mThisParameters["adaptative_strategy"].GetBool()) {
if (CheckGeometryInverted()) {
KRATOS_WARNING("Element inverted") << "INVERTED ELEMENT DURING DATABASE UPDATE" << std::endl;
r_process_info[STEP] -= 1; // We revert one step in the case that the geometry is already broken before start the computing
return false;
}
}
p_scheme->FinalizeNonLinIteration(r_model_part, rA, rDx, rb);
BaseType::mpConvergenceCriteria->FinalizeNonLinearIteration(r_model_part, r_dof_set, rA, rDx, rb);
residual_is_updated = false;
if (is_converged) {
if (BaseType::mpConvergenceCriteria->GetActualizeRHSflag()) {
TSparseSpace::SetToZero(rb);
p_builder_and_solver->BuildRHS(p_scheme, r_model_part, rb);
residual_is_updated = true;
//std::cout << "mb is calculated" << std::endl;
}
is_converged = BaseType::mpConvergenceCriteria->PostCriteria(r_model_part, r_dof_set, rA, rDx, rb);
}
}
// Plots a warning if the maximum number of iterations is exceeded
if (iteration_number >= BaseType::mMaxIterationNumber && r_model_part.GetCommunicator().MyPID() == 0)
MaxIterationsExceeded();
// Recalculate residual if needed
// (note that some convergence criteria need it to be recalculated)
if (residual_is_updated == false) {
// NOTE:
// The following part will be commented because it is time consuming
// and there is no obvious reason to be here. If someone need this
// part please notify the community via mailing list before uncommenting it.
// Pooyan.
// TSparseSpace::SetToZero(mb);
// p_builder_and_solver->BuildRHS(p_scheme, r_model_part, mb);
}
// Calculate reactions if required
if (BaseType::mCalculateReactionsFlag)
p_builder_and_solver->CalculateReactions(p_scheme, r_model_part, rA, rDx, rb);
return is_converged;
KRATOS_CATCH("");
}
/**
* @brief This method performs the adaptative step
*/
bool AdaptativeStep()
{
KRATOS_TRY;
bool is_converged = false;
// Plots a warning if the maximum number of iterations is exceeded
if (mpMyProcesses == nullptr && StrategyBaseType::mEchoLevel > 0)
KRATOS_WARNING("No python processes") << "If you have not implemented any method to recalculate BC or loads in function of time, this strategy will be USELESS" << std::endl;
if (mpPostProcesses == nullptr && StrategyBaseType::mEchoLevel > 0)
KRATOS_WARNING("No python post processes") << "If you don't add the postprocesses and the time step if splitted you won't postprocess that steps" << std::endl;
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
const double original_delta_time = r_process_info[DELTA_TIME]; // We save the delta time to restore later
int split_number = 0;
// We iterate until we reach the convergence or we split more than desired
while (is_converged == false && split_number <= mThisParameters["max_number_splits"].GetInt()) {
// Expliting time step as a way to try improve the convergence
split_number += 1;
double aux_delta_time, current_time;
const double aux_time = SplitTimeStep(aux_delta_time, current_time);
current_time += aux_delta_time;
bool inside_the_split_is_converged = false;
IndexType inner_iteration = 0;
while (current_time <= aux_time) {
inner_iteration += 1;
r_process_info[STEP] += 1;
if (inner_iteration == 1) {
if (StrategyBaseType::MoveMeshFlag())
UnMoveMesh();
NodesArrayType& nodes_array = r_model_part.Nodes();
#pragma omp parallel for
for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i) {
auto it_node = nodes_array.begin() + i;
it_node->OverwriteSolutionStepData(1, 0);
// it_node->OverwriteSolutionStepData(2, 1);
}
r_process_info.SetCurrentTime(current_time); // Reduces the time step
FinalizeSolutionStep();
} else {
NodesArrayType& nodes_array = r_model_part.Nodes();
#pragma omp parallel for
for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i)
(nodes_array.begin() + i)->CloneSolutionStepData();
r_process_info.CloneSolutionStepInfo();
r_process_info.ClearHistory(r_model_part.GetBufferSize());
r_process_info.SetAsTimeStepInfo(current_time); // Sets the new time step
}
// We execute the processes before the non-linear iteration
if (mpMyProcesses != nullptr)
mpMyProcesses->ExecuteInitializeSolutionStep();
if (mpPostProcesses != nullptr)
mpPostProcesses->ExecuteInitializeSolutionStep();
// In order to initialize again everything
BaseType::mInitializeWasPerformed = false;
mFinalizeWasPerformed = false;
// We repeat the solve with the new DELTA_TIME
this->Initialize();
this->InitializeSolutionStep();
this->Predict();
inside_the_split_is_converged = BaseType::SolveSolutionStep();
this->FinalizeSolutionStep();
// We execute the processes after the non-linear iteration
if (mpMyProcesses != nullptr)
mpMyProcesses->ExecuteFinalizeSolutionStep();
if (mpPostProcesses != nullptr)
mpPostProcesses->ExecuteFinalizeSolutionStep();
if (mpMyProcesses != nullptr)
mpMyProcesses->ExecuteBeforeOutputStep();
if (mpPostProcesses != nullptr)
mpPostProcesses->PrintOutput();
if (mpMyProcesses != nullptr)
mpMyProcesses->ExecuteAfterOutputStep();
current_time += aux_delta_time;
}
if (inside_the_split_is_converged)
is_converged = true;
}
// Plots a warning if the maximum number of iterations and splits are exceeded
if (is_converged == false)
MaxIterationsAndSplitsExceeded();
// Restoring original DELTA_TIME
r_process_info[DELTA_TIME] = original_delta_time;
return is_converged;
KRATOS_CATCH("");
}
/**
* @brief Here the database is updated
* @param A The LHS matrix
* @param Dx The increment of solution after solving system
* @param b The RHS vector
* @param MoveMesh The flag that tells if the mesh should be moved
*/
void UpdateDatabase(
TSystemMatrixType& A,
TSystemVectorType& Dx,
TSystemVectorType& b,
const bool MoveMesh
) override
{
BaseType::UpdateDatabase(A,Dx,b,MoveMesh);
// TODO: Add something if necessary
}
/**
* @brief his method checks if there is no element inverted
*/
bool CheckGeometryInverted()
{
ModelPart& r_model_part = StrategyBaseType::GetModelPart();
ProcessInfo& r_process_info = r_model_part.GetProcessInfo();
bool inverted_element = false;
ElementsArrayType& elements_array = r_model_part.Elements();
// NOT OMP
for(int i = 0; i < static_cast<int>(elements_array.size()); ++i) {
auto it_elem = elements_array.begin() + i;
auto& geom = it_elem->GetGeometry();
if (geom.DeterminantOfJacobian(0) < 0.0) {
if (mConvergenceCriteriaEchoLevel > 0) {
KRATOS_WATCH(it_elem->Id())
KRATOS_WATCH(geom.DeterminantOfJacobian(0))
}
return true;
}
// We check now the deformation gradient
std::vector<Matrix> deformation_gradient_matrices;
it_elem->GetValueOnIntegrationPoints( DEFORMATION_GRADIENT, deformation_gradient_matrices, r_process_info);
for (IndexType i_gp = 0; i_gp < deformation_gradient_matrices.size(); ++i_gp) {
const double det_f = MathUtils<double>::DetMat(deformation_gradient_matrices[i_gp]);
if (det_f < 0.0) {
if (mConvergenceCriteriaEchoLevel > 0) {
KRATOS_WATCH(it_elem->Id())
KRATOS_WATCH(det_f)
}
return true;
}
}
}
return inverted_element;
}
/**
* @brief Here the time step is splitted
* @param AuxDeltaTime The new delta time to be considered
* @param CurrentTime The current time
* @return The destination time
*/
double SplitTimeStep(
double& AuxDeltaTime,
double& CurrentTime
)
{
KRATOS_TRY;
const double aux_time = StrategyBaseType::GetModelPart().GetProcessInfo()[TIME];
AuxDeltaTime = StrategyBaseType::GetModelPart().GetProcessInfo()[DELTA_TIME];
CurrentTime = aux_time - AuxDeltaTime;
StrategyBaseType::GetModelPart().GetProcessInfo()[TIME] = CurrentTime; // Restore time to the previous one
AuxDeltaTime /= mThisParameters["split_factor"].GetDouble();
StrategyBaseType::GetModelPart().GetProcessInfo()[DELTA_TIME] = AuxDeltaTime; // Change delta time
CoutSplittingTime(AuxDeltaTime, aux_time);
return aux_time;
KRATOS_CATCH("");
}
/**
* This method moves bak the mesh to the previous position
*/
void UnMoveMesh()
{
KRATOS_TRY;
if (StrategyBaseType::GetModelPart().NodesBegin()->SolutionStepsDataHas(DISPLACEMENT_X) == false)
KRATOS_ERROR << "It is impossible to move the mesh since the DISPLACEMENT var is not in the model_part. Either use SetMoveMeshFlag(False) or add DISPLACEMENT to the list of variables" << std::endl;
NodesArrayType& nodes_array = StrategyBaseType::GetModelPart().Nodes();
#pragma omp parallel for
for(int i = 0; i < static_cast<int>(nodes_array.size()); ++i) {
auto it_node = nodes_array.begin() + i;
noalias(it_node->Coordinates()) = it_node->GetInitialPosition().Coordinates();
noalias(it_node->Coordinates()) += it_node->FastGetSolutionStepValue(DISPLACEMENT, 1);
}
KRATOS_CATCH("");
}
/**
* @brief This method returns the defaulr parameters in order to avoid code duplication
* @return Returns the default parameters
*/
Parameters GetDefaultParameters()
{
Parameters default_parameters = Parameters(R"(
{
"adaptative_strategy" : false,
"split_factor" : 10.0,
"max_number_splits" : 3,
"inner_loop_iterations" : 5
})" );
return default_parameters;
}
/**
* @brief This method prints information after solving the problem
*/
void CoutSolvingProblem()
{
if (mConvergenceCriteriaEchoLevel != 0) {
std::cout << "STEP: " << StrategyBaseType::GetModelPart().GetProcessInfo()[STEP] << "\t NON LINEAR ITERATION: " << StrategyBaseType::GetModelPart().GetProcessInfo()[NL_ITERATION_NUMBER] << "\t TIME: " << StrategyBaseType::GetModelPart().GetProcessInfo()[TIME] << "\t DELTA TIME: " << StrategyBaseType::GetModelPart().GetProcessInfo()[DELTA_TIME] << std::endl;
}
}
/**
* @brief This method prints information after split the increment of time
* @param AuxDeltaTime The new time step to be considered
* @param AuxTime The destination time
*/
void CoutSplittingTime(
const double AuxDeltaTime,
const double AuxTime
)
{
if (mConvergenceCriteriaEchoLevel > 0 && StrategyBaseType::GetModelPart().GetCommunicator().MyPID() == 0 ) {
const double Time = StrategyBaseType::GetModelPart().GetProcessInfo()[TIME];
std::cout.precision(4);
std::cout << "|----------------------------------------------------|" << std::endl;
std::cout << "| " << BOLDFONT("SPLITTING TIME STEP") << " |" << std::endl;
std::cout << "| " << BOLDFONT("COMING BACK TO TIME: ") << std::scientific << Time << " |" << std::endl;
std::cout << "| " << BOLDFONT(" NEW TIME STEP: ") << std::scientific << AuxDeltaTime << " |" << std::endl;
std::cout << "| " << BOLDFONT(" UNTIL TIME: ") << std::scientific << AuxTime << " |" << std::endl;
std::cout << "|----------------------------------------------------|" << std::endl;
}
}
/**
* @brief This method prints information after reach the max number of interations
*/
void MaxIterationsExceeded() override
{
if (mConvergenceCriteriaEchoLevel > 0 && StrategyBaseType::GetModelPart().GetCommunicator().MyPID() == 0 ) {
std::cout << "|----------------------------------------------------|" << std::endl;
std::cout << "| " << BOLDFONT(FRED("ATTENTION: Max iterations exceeded")) << " |" << std::endl;
std::cout << "|----------------------------------------------------|" << std::endl;
}
}
/**
* @brief This method prints information after reach the max number of interations and splits
*/
void MaxIterationsAndSplitsExceeded()
{
if (mConvergenceCriteriaEchoLevel > 0 && StrategyBaseType::GetModelPart().GetCommunicator().MyPID() == 0 ) {
std::cout << "|----------------------------------------------------|" << std::endl;
std::cout << "| " << BOLDFONT(FRED("ATTENTION: Max iterations exceeded")) << " |" << std::endl;
std::cout << "| " << BOLDFONT(FRED(" Max number of splits exceeded ")) << " |" << std::endl;
std::cout << "|----------------------------------------------------|" << std::endl;
}
}
///@}
///@name Protected Operations
///@{
///@}
///@name Protected Access
///@{
///@}
///@name Protected Inquiry
///@{
///@}
///@name Protected LifeCycle
///@{
///@{
/**
* Copy constructor.
*/
ResidualBasedNewtonRaphsonContactStrategy(const ResidualBasedNewtonRaphsonContactStrategy& Other)
{
};
private:
///@name Static Member Variables
///@{
///@}
///@name Member Variables
///@{
///@}
///@name Private Operators
///@{
///@}
///@name Private Operations
///@{
///@}
///@name Private Access
///@{
///@}
///@}
///@name Serialization
///@{
///@name Private Inquiry
///@{
///@}
///@name Un accessible methods
///@{
///@}
}; /* Class ResidualBasedNewtonRaphsonContactStrategy */
///@}
///@name Type Definitions
///@{
///@}
///@name Input and output
///@{
///@}
} // namespace Kratos
#endif /* KRATOS_RESIDUALBASED_NEWTON_RAPHSON_CONTACT_STRATEGY */
|
nvptx_param_translate.c | // RUN: %clang_cc1 -no-opaque-pointers -verify -fopenmp -x c++ -triple powerpc64le-unknown-unknown -fopenmp-targets=nvptx64-nvidia-cuda -emit-llvm-bc %s -o %t-ppc-host.bc
// RUN: %clang_cc1 -no-opaque-pointers -verify -fopenmp -x c++ -triple nvptx64-unknown-unknown -fopenmp-targets=nvptx64-nvidia-cuda -emit-llvm %s -fopenmp-is-device -fopenmp-host-ir-file-path %t-ppc-host.bc -o - | FileCheck %s
// expected-no-diagnostics
// CHECK: [[MAP_FN:%.+]] = load void (i8*, ...)*, void (i8*, ...)** %
// CHECK: [[FN:%.+]] = bitcast void (i8*, ...)* [[MAP_FN]] to void (i8*,
// CHECK: call void [[FN]](i8* %
int main() {
double a, b;
#pragma omp target map(tofrom \
: a) map(to \
: b)
{
#pragma omp taskgroup
#pragma omp task shared(a)
a = b;
}
return 0;
}
|
GB_concat_sparse.c | //------------------------------------------------------------------------------
// GB_concat_sparse: concatenate an array of matrices into a sparse matrix
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
#define GB_FREE_WORKSPACE \
if (S != NULL) \
{ \
for (int64_t k = 0 ; k < m * n ; k++) \
{ \
GB_Matrix_free (&(S [k])) ; \
} \
} \
GB_FREE_WORK (&S, S_size) ; \
GB_FREE_WORK (&Work, Work_size) ; \
GB_WERK_POP (A_ek_slicing, int64_t) ;
#define GB_FREE_ALL \
{ \
GB_FREE_WORKSPACE ; \
GB_phbix_free (C) ; \
}
#include "GB_concat.h"
GrB_Info GB_concat_sparse // concatenate into a sparse matrix
(
GrB_Matrix C, // input/output matrix for results
const bool C_iso, // if true, construct C as iso
const GB_void *cscalar, // iso value of C, if C is io
const int64_t cnz, // # of entries in C
const GrB_Matrix *Tiles, // 2D row-major array of size m-by-n,
const GrB_Index m,
const GrB_Index n,
const int64_t *restrict Tile_rows, // size m+1
const int64_t *restrict Tile_cols, // size n+1
GB_Context Context
)
{
//--------------------------------------------------------------------------
// allocate C as a sparse matrix
//--------------------------------------------------------------------------
GrB_Info info ;
GrB_Matrix A = NULL ;
ASSERT_MATRIX_OK (C, "C input to concat sparse", GB0) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
int64_t *Work = NULL ;
size_t Work_size = 0 ;
GrB_Matrix *S = NULL ;
size_t S_size = 0 ;
GrB_Type ctype = C->type ;
int64_t cvlen = C->vlen ;
int64_t cvdim = C->vdim ;
bool csc = C->is_csc ;
size_t csize = ctype->size ;
GB_Type_code ccode = ctype->code ;
float hyper_switch = C->hyper_switch ;
float bitmap_switch = C->bitmap_switch ;
int sparsity_control = C->sparsity_control ;
bool static_header = C->static_header ;
GB_phbix_free (C) ;
// set C->iso = C_iso OK
GB_OK (GB_new_bix (&C, static_header, // prior static or dynamic header
ctype, cvlen, cvdim, GB_Ap_malloc, csc, GxB_SPARSE, false,
hyper_switch, cvdim, cnz, true, C_iso, Context)) ;
C->bitmap_switch = bitmap_switch ;
C->sparsity_control = sparsity_control ;
int64_t *restrict Cp = C->p ;
int64_t *restrict Ci = C->i ;
GB_GET_NTHREADS_MAX (nthreads_max, chunk, Context) ;
if (C_iso)
{
memcpy (C->x, cscalar, csize) ;
}
//--------------------------------------------------------------------------
// allocate workspace
//--------------------------------------------------------------------------
int64_t nouter = csc ? n : m ;
int64_t ninner = csc ? m : n ;
Work = GB_CALLOC_WORK (ninner * cvdim, int64_t, &Work_size) ;
S = GB_CALLOC_WORK (m * n, GrB_Matrix, &S_size) ;
if (S == NULL || Work == NULL)
{
// out of memory
GB_FREE_ALL ;
return (GrB_OUT_OF_MEMORY) ;
}
//--------------------------------------------------------------------------
// count entries in each vector of each tile
//--------------------------------------------------------------------------
for (int64_t outer = 0 ; outer < nouter ; outer++)
{
for (int64_t inner = 0 ; inner < ninner ; inner++)
{
//------------------------------------------------------------------
// get the tile A; transpose and typecast, if needed
//------------------------------------------------------------------
A = csc ? GB_TILE (Tiles, inner, outer)
: GB_TILE (Tiles, outer, inner) ;
GrB_Matrix T = NULL ;
ASSERT_MATRIX_OK (A, "A tile for concat sparse", GB0) ;
if (csc != A->is_csc)
{
// T = (ctype) A', not in-place, using a dynamic header
GB_OK (GB_new (&T, false, // auto sparsity, new header
A->type, A->vdim, A->vlen, GB_Ap_null, csc,
GxB_AUTO_SPARSITY, -1, 1, Context)) ;
// save T in array S
if (csc)
{
GB_TILE (S, inner, outer) = T ;
}
else
{
GB_TILE (S, outer, inner) = T ;
}
GB_OK (GB_transpose_cast (T, ctype, csc, A, false, Context)) ;
A = T ;
GB_MATRIX_WAIT (A) ;
ASSERT_MATRIX_OK (A, "T=A' for concat sparse", GB0) ;
}
ASSERT (C->is_csc == A->is_csc) ;
ASSERT (!GB_ANY_PENDING_WORK (A)) ;
//------------------------------------------------------------------
// ensure the tile is not bitmap
//------------------------------------------------------------------
if (GB_IS_BITMAP (A))
{
if (T == NULL)
{
// copy A into T
// set T->iso = A->iso OK: no burble needed
GB_OK (GB_dup_worker (&T, A->iso, A, true, NULL, Context)) ;
// save T in array S
if (csc)
{
GB_TILE (S, inner, outer) = T ;
}
else
{
GB_TILE (S, outer, inner) = T ;
}
ASSERT_MATRIX_OK (T, "T=dup(A) for concat sparse", GB0) ;
}
// convert T from bitmap to sparse
GB_OK (GB_convert_bitmap_to_sparse (T, Context)) ;
ASSERT_MATRIX_OK (T, "T bitmap to sparse, concat sparse", GB0) ;
A = T ;
}
ASSERT (!GB_IS_BITMAP (A)) ;
//------------------------------------------------------------------
// log the # of entries in each vector of the tile A
//------------------------------------------------------------------
const int64_t anvec = A->nvec ;
const int64_t avlen = A->vlen ;
int64_t cvstart = csc ? Tile_cols [outer] : Tile_rows [outer] ;
int64_t *restrict W = Work + inner * cvdim + cvstart ;
int nth = GB_nthreads (anvec, chunk, nthreads_max) ;
if (GB_IS_FULL (A))
{
// A is full
int64_t j ;
#pragma omp parallel for num_threads(nth) schedule(static)
for (j = 0 ; j < anvec ; j++)
{
// W [j] = # of entries in A(:,j), which is just avlen
W [j] = avlen ;
}
}
else
{
// A is sparse or hyper
int64_t k ;
int64_t *restrict Ah = A->h ;
int64_t *restrict Ap = A->p ;
#pragma omp parallel for num_threads(nth) schedule(static)
for (k = 0 ; k < anvec ; k++)
{
// W [j] = # of entries in A(:,j), the kth column of A
int64_t j = GBH (Ah, k) ;
W [j] = Ap [k+1] - Ap [k] ;
}
}
}
}
//--------------------------------------------------------------------------
// cumulative sum of entries in each tile
//--------------------------------------------------------------------------
int nth = GB_nthreads (ninner*cvdim, chunk, nthreads_max) ;
int64_t k ;
#pragma omp parallel for num_threads(nth) schedule(static)
for (k = 0 ; k < cvdim ; k++)
{
int64_t s = 0 ;
for (int64_t inner = 0 ; inner < ninner ; inner++)
{
int64_t p = inner * cvdim + k ;
int64_t c = Work [p] ;
Work [p] = s ;
s += c ;
}
// total number of entries in C(:,k)
Cp [k] = s ;
}
GB_cumsum (Cp, cvdim, &(C->nvec_nonempty), nthreads_max, Context) ;
#pragma omp parallel for num_threads(nth) schedule(static)
for (k = 0 ; k < cvdim ; k++)
{
int64_t pC = Cp [k] ;
for (int64_t inner = 0 ; inner < ninner ; inner++)
{
int64_t p = inner * cvdim + k ;
Work [p] += pC ;
}
}
//--------------------------------------------------------------------------
// concatenate all matrices into C
//--------------------------------------------------------------------------
for (int64_t outer = 0 ; outer < nouter ; outer++)
{
for (int64_t inner = 0 ; inner < ninner ; inner++)
{
//------------------------------------------------------------------
// get the tile A, either the temporary matrix T or the original A
//------------------------------------------------------------------
A = csc ? GB_TILE (S, inner, outer)
: GB_TILE (S, outer, inner) ;
if (A == NULL)
{
A = csc ? GB_TILE (Tiles, inner, outer)
: GB_TILE (Tiles, outer, inner) ;
}
ASSERT_MATRIX_OK (A, "A tile again, concat sparse", GB0) ;
ASSERT (!GB_IS_BITMAP (A)) ;
ASSERT (C->is_csc == A->is_csc) ;
ASSERT (!GB_ANY_PENDING_WORK (A)) ;
GB_Type_code acode = A->type->code ;
//------------------------------------------------------------------
// determine where to place the tile in C
//------------------------------------------------------------------
// The tile A appears in vectors cvstart:cvend-1 of C, and indices
// cistart:ciend-1.
int64_t cvstart, cvend, cistart, ciend ;
if (csc)
{
// C and A are held by column
// Tiles is row-major and accessed in column order
cvstart = Tile_cols [outer] ;
cvend = Tile_cols [outer+1] ;
cistart = Tile_rows [inner] ;
ciend = Tile_rows [inner+1] ;
}
else
{
// C and A are held by row
// Tiles is row-major and accessed in row order
cvstart = Tile_rows [outer] ;
cvend = Tile_rows [outer+1] ;
cistart = Tile_cols [inner] ;
ciend = Tile_cols [inner+1] ;
}
// get the workspace pointer array W for this tile
int64_t *restrict W = Work + inner * cvdim + cvstart ;
//------------------------------------------------------------------
// slice the tile
//------------------------------------------------------------------
int64_t avdim = cvend - cvstart ;
int64_t avlen = ciend - cistart ;
ASSERT (avdim == A->vdim) ;
ASSERT (avlen == A->vlen) ;
int A_nthreads, A_ntasks ;
const int64_t *restrict Ap = A->p ;
const int64_t *restrict Ah = A->h ;
const int64_t *restrict Ai = A->i ;
const bool A_iso = A->iso ;
GB_SLICE_MATRIX (A, 1, chunk) ;
//------------------------------------------------------------------
// copy the tile A into C
//------------------------------------------------------------------
bool done = false ;
if (C_iso)
{
//--------------------------------------------------------------
// C and A are iso
//--------------------------------------------------------------
#define GB_ISO_CONCAT
#define GB_COPY(pC,pA,A_iso) ;
#include "GB_concat_sparse_template.c"
}
else
{
#ifndef GBCOMPACT
if (ccode == acode)
{
// no typecasting needed
switch (csize)
{
#undef GB_COPY
#define GB_COPY(pC,pA,A_iso) \
Cx [pC] = GBX (Ax, pA, A_iso) ;
case GB_1BYTE : // uint8, int8, bool, or 1-byte user
#define GB_CTYPE uint8_t
#include "GB_concat_sparse_template.c"
break ;
case GB_2BYTE : // uint16, int16, or 2-byte user
#define GB_CTYPE uint16_t
#include "GB_concat_sparse_template.c"
break ;
case GB_4BYTE : // uint32, int32, float, or 4-byte user
#define GB_CTYPE uint32_t
#include "GB_concat_sparse_template.c"
break ;
case GB_8BYTE : // uint64, int64, double, float complex,
// or 8-byte user defined
#define GB_CTYPE uint64_t
#include "GB_concat_sparse_template.c"
break ;
case GB_16BYTE : // double complex or 16-byte user
#define GB_CTYPE GB_blob16
#include "GB_concat_sparse_template.c"
break ;
default:;
}
}
#endif
}
if (!done)
{
// with typecasting or user-defined types
GB_cast_function cast_A_to_C = GB_cast_factory (ccode, acode) ;
size_t asize = A->type->size ;
#define GB_CTYPE GB_void
#undef GB_COPY
#define GB_COPY(pC,pA,A_iso) \
cast_A_to_C (Cx + (pC)*csize, \
Ax + (A_iso ? 0:(pA)*asize), asize) ;
#include "GB_concat_sparse_template.c"
}
GB_WERK_POP (A_ek_slicing, int64_t) ;
}
}
//--------------------------------------------------------------------------
// free workspace and return result
//--------------------------------------------------------------------------
GB_FREE_WORKSPACE ;
C->magic = GB_MAGIC ;
ASSERT_MATRIX_OK (C, "C from concat sparse", GB0) ;
return (GrB_SUCCESS) ;
}
|
openmpmpi.c | #include "mpi.h"
#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
void srandom (unsigned seed);
double dboard (int darts);
#define DARTS 500000 /* number of throws at dartboard */
#define ROUNDS 100 /* number of times "darts" is iterated */
#define MASTER 0 /* task ID of master task */
int main (int argc, char *argv[])
{
double homepi, /* value of pi calculated by current task */
pi, /* average of pi after "darts" is thrown */
avepi, /* average pi value for all iterations */
pirecv, /* pi received from worker */
pisum; /* sum of workers pi values */
int taskid, /* task ID - also used as seed number */
numtasks,/* number of tasks */
source, /* source of incoming message */
mtype, /* message type */
rc, /* return code */
i, n;
MPI_Status status;
/* Obtain number of tasks and task ID */
MPI_Init(&argc,&argv);
MPI_Comm_size(MPI_COMM_WORLD,&numtasks);
MPI_Comm_rank(MPI_COMM_WORLD,&taskid);
printf ("MPI task %d has started...\n", taskid);
/* Set seed for random number generator equal to task ID */
srandom (taskid);
avepi = 0;
for (i = 0; i < ROUNDS; i++){
/* All tasks calculate pi using dartboard algorithm */
homepi = dboard(DARTS);
/* Workers send homepi to master */
/* - Message type will be set to the iteration count */
if (taskid != MASTER) {
mtype = i;
rc = MPI_Send(&homepi, 1, MPI_DOUBLE,
MASTER, mtype, MPI_COMM_WORLD);
if (rc != MPI_SUCCESS)
printf("%d: Send failure on round %d\n", taskid, mtype);
}
else
{
/* Master receives messages from all workers */
/*Message type will be set to the iteration count */
/*Message source will be set to the wildcard DONTCARE: */
/*a message can be received from any task, as long as the */
/*message types match */
/*The return code will be checked, and a message displayed */
/*if a problem occurred */
mtype = i;
pisum = 0;
for (n = 1; n < numtasks; n++) {
rc = MPI_Recv(&pirecv, 1, MPI_DOUBLE, MPI_ANY_SOURCE,
mtype, MPI_COMM_WORLD, &status);
if (rc != MPI_SUCCESS)
printf("%d: Receive failure on round %d\n", taskid, mtype);
/* keep running total of pi */
pisum = pisum + pirecv;
}
/* Master calculates the average value of pi
* for this iteration */
pi = (pisum + homepi)/numtasks;
/* Master calculates the average value of
* pi over all iterations */
avepi = ((avepi * i) + pi)/(i + 1);
printf("After %8d throws, average value of pi = %10.8f\n", (DARTS * (i + 1)),avepi);
}
}
if (taskid == MASTER)
printf ("\nReal value of PI: 3.1415926535897 \n");
MPI_Finalize();
return 0;
}
/*************************************************************************
* * subroutine dboard
* * DESCRIPTION:
* * Used in pi calculation example codes.
* * See mpi_pi_send.c and mpi_pi_reduce.c
* * Throw darts at board. Done by generating random numbers
* * between 0 and 1 and converting them to values for x and y
* * coordinates and then testing to see if they "land" in
* * the circle." If so, score is incremented. After throwing the
* * specified number of darts, pi is calculated. The computed value
* * of pi is returned as the value of this function, dboard.
* *
* * Explanation of constants and variables used in this function:
* * darts = number of throws at dartboard
* * score = number of darts that hit circle
* * n = index variable
* * r = random number scaled between 0 and 1
* * x_coord = x coordinate, between -1 and 1
* * x_sqr = square of x coordinate
* * y_coord = y coordinate, between -1 and 1
* * y_sqr = square of y coordinate
* * pi = computed value of pi
* *******************************************************************/
double dboard(int darts)
{
#define sqr(x) ((x)*(x))
long random(void);
double x_coord, y_coord, pi, r;
int score, n;
unsigned int cconst; /* must be 4-bytes in size */
/*************************************************************************
* * The cconst variable must be 4 bytes. We check this and bail if it is
* * not the right size
* ************************************************************************/
if (sizeof(cconst) != 4) {
printf("Wrong data size for cconst variable in dboard routine!\n");
printf("See comments in source file. Quitting.\n");
exit(1);
}
/* 2 bit shifted to MAX_RAND later used to scale
* random number between 0 and 1 */
cconst = 2 << (31 - 1);
score=0;
/* "throw darts at board" */
#pragma omp parallel for private(r,x_coord,y_coord) reduction(+:score)
for (n = 1; n <= darts; n++) {
/* generate random numbers for x and y coordinates */
r = (double)random()/cconst;
x_coord = (2.0 * r) - 1.0;
r = (double)random()/cconst;
y_coord = (2.0 * r) - 1.0;
/* if dart lands in circle, increment score */
if ((sqr(x_coord) + sqr(y_coord)) <= 1.0)
score++;
}
/* calculate pi */
pi = 4.0 * (double)score/(double)darts;
return(pi);
}
|
sageInterface.h | #ifndef ROSE_SAGE_INTERFACE
#define ROSE_SAGE_INTERFACE
#include "sage3basic.hhh"
#include <stdint.h>
#include <utility>
#include "rosePublicConfig.h" // for ROSE_BUILD_JAVA_LANGUAGE_SUPPORT
#include "OmpAttribute.h"
#if 0 // FMZ(07/07/2010): the argument "nextErrorCode" should be call-by-reference
SgFile* determineFileType ( std::vector<std::string> argv, int nextErrorCode, SgProject* project );
#else
SgFile* determineFileType ( std::vector<std::string> argv, int& nextErrorCode, SgProject* project );
#endif
#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
#include "rewrite.h"
#endif
// DQ (7/20/2008): Added support for unparsing abitrary strings in the unparser.
#include "astUnparseAttribute.h"
#include <set>
#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
#include "LivenessAnalysis.h"
#include "abstract_handle.h"
#include "ClassHierarchyGraph.h"
#endif
// DQ (8/19/2004): Moved from ROSE/src/midend/astRewriteMechanism/rewrite.h
//! A global function for getting the string associated with an enum (which is defined in global scope)
ROSE_DLL_API std::string getVariantName (VariantT v);
// DQ (12/9/2004): Qing, Rich and Dan have decided to start this namespace within ROSE
// This namespace is specific to interface functions that operate on the Sage III AST.
// The name was chosen so as not to conflict with other classes within ROSE.
// This will become the future home of many interface functions which operate on
// the AST and which are generally useful to users. As a namespace multiple files can be used
// to represent the compete interface and different developers may contribute interface
// functions easily.
// Constructor handling: (We have sageBuilder.h now for this purpose, Liao 2/1/2008)
// We could add simpler layers of support for construction of IR nodes by
// hiding many details in "makeSg***()" functions. Such functions would
// return pointers to the associated Sg*** objects and would be able to hide
// many IR specific details, including:
// memory handling
// optional parameter settings not often required
// use of Sg_File_Info objects (and setting them as transformations)
//
// namespace AST_Interface (this name is taken already by some of Qing's work :-)
//! An alias for Sg_File_Info::generateDefaultFileInfoForTransformationNode()
#define TRANS_FILE Sg_File_Info::generateDefaultFileInfoForTransformationNode()
/** Functions that are useful when operating on the AST.
*
* The Sage III IR design attempts to be minimalist. Thus additional functionality is intended to be presented using separate
* higher level interfaces which work with the IR. This namespace collects functions that operate on the IR and support
* numerous types of operations that are common to general analysis and transformation of the AST. */
namespace SageInterface
{
// Liao 6/22/2016: keep records of loop init-stmt normalization, later help undo it to support autoPar.
struct Transformation_Record
{
// a lookup table to check if a for loop has been normalized for its c99-style init-stmt
std::map <SgForStatement* , bool > forLoopInitNormalizationTable;
// Detailed record about the original declaration (1st in the pair) and the normalization generated new declaration (2nd in the pair)
std::map <SgForStatement* , std::pair<SgVariableDeclaration*, SgVariableDeclaration*> > forLoopInitNormalizationRecord;
} ;
ROSE_DLL_API extern Transformation_Record trans_records;
// DQ (4/3/2014): Added general AST support separate from the AST.
// Container and API for analysis information that is outside of the AST and as a result
// prevents frequent modification of the IR.
class DeclarationSets
{
// DQ (4/3/2014): This stores all associated declarations as a map of sets.
// the key to the map is the first nondefining declaration and the elements of the set are
// all of the associated declarations (including the defining declaration).
private:
//! Map of first-nondefining declaration to all other associated declarations.
std::map<SgDeclarationStatement*,std::set<SgDeclarationStatement*>* > declarationMap;
public:
void addDeclaration(SgDeclarationStatement* decl);
const std::set<SgDeclarationStatement*>* getDeclarations(SgDeclarationStatement* decl);
std::map<SgDeclarationStatement*,std::set<SgDeclarationStatement*>* > & getDeclarationMap();
bool isLocatedInDefiningScope(SgDeclarationStatement* decl);
~DeclarationSets();
};
// DQ (4/3/2014): This constructs a data structure that holds analysis information about
// the AST that is separate from the AST. This is intended to be a general mechanism
// to support analysis information without constantly modifying the IR.
DeclarationSets* buildDeclarationSets(SgNode*);
//! An internal counter for generating unique SgName
ROSE_DLL_API extern int gensym_counter;
#ifdef ROSE_BUILD_BINARY_ANALYSIS_SUPPORT
//! Find the main interpretation.
SgAsmInterpretation* getMainInterpretation(SgAsmGenericFile* file);
//! Get the unsigned value of a disassembled constant.
uint64_t getAsmConstant(SgAsmValueExpression* e);
//! Get the signed value of a disassembled constant.
int64_t getAsmSignedConstant(SgAsmValueExpression *e);
#endif
//! Function to add "C" style comment to statement.
void addMessageStatement( SgStatement* stmt, std::string message );
//! A persistent attribute to represent a unique name for an expression
class UniqueNameAttribute : public AstAttribute
{
private:
std::string name;
public:
UniqueNameAttribute(std::string n="") {name =n; };
void set_name (std::string n) {name = n;};
std::string get_name () {return name;};
};
//------------------------------------------------------------------------
//@{
/*! @name Symbol tables
\brief utility functions for symbol tables
*/
// DQ (8/5/2020): the "using namespace" directive will not hide existing visability of symbols in resolving visability.
// So we need to test if a symbol is visible exclusing matching alises due to using direectives before we can decide to
// persue name space qualification. This is best demonstrated by Cxx_tests/test2020_18.C, test2020_19.C, test2020_20.C,
// and test2020_21.C.
ROSE_DLL_API SgSymbol *lookupSymbolInParentScopesIgnoringAliasSymbols (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL, SgTemplateArgumentPtrList* templateArgumentList = NULL);
// DQ (8/21/2013): Modified to make newest function parameters be default arguments.
// DQ (8/16/2013): For now we want to remove the use of default parameters and add the support for template parameters and template arguments.
//! Find a symbol in current and ancestor scopes for a given variable name, starting from top of ScopeStack if currentscope is not given or NULL.
// SgSymbol *lookupSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope=NULL);
// SgSymbol *lookupSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope, SgTemplateParameterPtrList* templateParameterList, SgTemplateArgumentPtrList* templateArgumentList);
ROSE_DLL_API SgSymbol *lookupSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL, SgTemplateArgumentPtrList* templateArgumentList = NULL);
// Liao 1/22/2008, used for get symbols for generating variable reference nodes
// ! Find a variable symbol in current and ancestor scopes for a given name
ROSE_DLL_API SgVariableSymbol *lookupVariableSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope=NULL);
// DQ (11/24/2007): Functions moved from the Fortran support so that they could be called from within astPostProcessing.
//!look up the first matched function symbol in parent scopes given only a function name, starting from top of ScopeStack if currentscope is not given or NULL
ROSE_DLL_API SgFunctionSymbol *lookupFunctionSymbolInParentScopes (const SgName & functionName, SgScopeStatement *currentScope=NULL);
// Liao, 1/24/2008, find exact match for a function
//!look up function symbol in parent scopes given both name and function type, starting from top of ScopeStack if currentscope is not given or NULL
ROSE_DLL_API SgFunctionSymbol *lookupFunctionSymbolInParentScopes (const SgName & functionName,
const SgType* t,
SgScopeStatement *currentScope=NULL);
ROSE_DLL_API SgFunctionSymbol *lookupTemplateFunctionSymbolInParentScopes (const SgName & functionName, SgFunctionType * ftype, SgTemplateParameterPtrList * tplparams, SgScopeStatement *currentScope=NULL);
ROSE_DLL_API SgFunctionSymbol *lookupTemplateMemberFunctionSymbolInParentScopes (const SgName & functionName, SgFunctionType * ftype, SgTemplateParameterPtrList * tplparams, SgScopeStatement *currentScope=NULL);
ROSE_DLL_API SgTemplateVariableSymbol * lookupTemplateVariableSymbolInParentScopes (const SgName & name, SgTemplateParameterPtrList * tplparams, SgTemplateArgumentPtrList* tplargs, SgScopeStatement *currentScope=NULL);
// DQ (8/21/2013): Modified to make newest function parameters be default arguments.
// DQ (8/16/2013): For now we want to remove the use of default parameters and add the support for template parameters and template arguments.
// DQ (5/7/2011): Added support for SgClassSymbol (used in name qualification support).
// SgClassSymbol* lookupClassSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL);
ROSE_DLL_API SgClassSymbol* lookupClassSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateArgumentPtrList* templateArgumentList = NULL);
ROSE_DLL_API SgTypedefSymbol* lookupTypedefSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL);
ROSE_DLL_API SgNonrealSymbol* lookupNonrealSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL, SgTemplateArgumentPtrList* templateArgumentList = NULL);
#if 0
// DQ (8/13/2013): This function does not make since any more, now that we have made the symbol
// table handling more precise and we have to provide template parameters for any template lookup.
// We also have to know if we want to lookup template classes, template functions, or template
// member functions (since each have specific requirements).
SgTemplateSymbol* lookupTemplateSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL);
#endif
#if 0
// DQ (8/13/2013): I am not sure if we want this functions in place of lookupTemplateSymbolInParentScopes.
// Where these are called we might not know enough information about the template parameters or function
// types, for example.
SgTemplateClassSymbol* lookupTemplateClassSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL, SgTemplateArgumentPtrList* templateArgumentList = NULL);
SgTemplateFunctionSymbol* lookupTemplateFunctionSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL);
SgTemplateMemberFunctionSymbol* lookupTemplateMemberFunctionSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL, SgTemplateParameterPtrList* templateParameterList = NULL);
#endif
// DQ (8/21/2013): Modified to make some of the newest function parameters be default arguments.
// DQ (8/13/2013): I am not sure if we want this functions in place of lookupTemplateSymbolInParentScopes.
ROSE_DLL_API SgTemplateClassSymbol* lookupTemplateClassSymbolInParentScopes (const SgName & name, SgTemplateParameterPtrList* templateParameterList, SgTemplateArgumentPtrList* templateArgumentList, SgScopeStatement *cscope = NULL);
ROSE_DLL_API SgEnumSymbol* lookupEnumSymbolInParentScopes (const SgName & name, SgScopeStatement *currentScope = NULL);
ROSE_DLL_API SgNamespaceSymbol* lookupNamespaceSymbolInParentScopes(const SgName & name, SgScopeStatement *currentScope = NULL);
// DQ (7/17/2011): Added function from cxx branch that I need here for the Java support.
// SgClassSymbol* lookupClassSymbolInParentScopes (const SgName & name, SgScopeStatement *cscope);
/*! \brief set_name of symbol in symbol table.
This function extracts the symbol from the relavant symbol table,
changes the name (at the declaration) and reinserts it into the
symbol table.
\internal I think this is what this function does, I need to double check.
*/
// DQ (12/9/2004): Moved this function (by Alin Jula) from being a member of SgInitializedName
// to this location where it can be a part of the interface for the Sage III AST.
ROSE_DLL_API int set_name (SgInitializedName * initializedNameNode, SgName new_name);
/*! \brief Output function type symbols in global function type symbol table.
*/
void outputGlobalFunctionTypeSymbolTable ();
// DQ (6/27/2005):
/*! \brief Output the local symbol tables.
\implementation Each symbol table is output with the file infor where it is located in the source code.
*/
ROSE_DLL_API void outputLocalSymbolTables (SgNode * node);
class OutputLocalSymbolTables:public AstSimpleProcessing
{
public:
void visit (SgNode * node);
};
/*! \brief Regenerate the symbol table.
\implementation current symbol table must be NULL pointer before calling this
function (for safety, but is this a good idea?)
*/
// DQ (9/28/2005):
void rebuildSymbolTable (SgScopeStatement * scope);
/*! \brief Clear those variable symbols with unknown type (together with initialized names) which are also not referenced by any variable references or declarations under root. If root is NULL, all symbols with unknown type will be deleted.
*/
void clearUnusedVariableSymbols (SgNode* root = NULL);
// DQ (3/1/2009):
//! All the symbol table references in the copied AST need to be reset after rebuilding the copied scope's symbol table.
void fixupReferencesToSymbols( const SgScopeStatement* this_scope, SgScopeStatement* copy_scope, SgCopyHelp & help );
//@}
//------------------------------------------------------------------------
//@{
/*! @name Stringify
\brief Generate a useful string (name) to describe a SgNode
*/
/*! \brief Generate a useful name to describe the SgNode
\internal default names are used for SgNode objects that can not be associated with a name.
*/
// DQ (9/21/2005): General function for extracting the name of declarations (when they have names)
std::string get_name (const SgNode * node);
/*! \brief Generate a useful name to describe the declaration
\internal default names are used for declarations that can not be associated with a name.
*/
// DQ (6/13/2005): General function for extracting the name of declarations (when they have names)
std::string get_name (const SgStatement * stmt);
/*! \brief Generate a useful name to describe the expression
\internal default names are used for expressions that can not be associated with a name.
*/
std::string get_name (const SgExpression * expr);
/*! \brief Generate a useful name to describe the declaration
\internal default names are used for declarations that can not be associated with a name.
*/
// DQ (6/13/2005): General function for extracting the name of declarations (when they have names)
std::string get_name (const SgDeclarationStatement * declaration);
/*! \brief Generate a useful name to describe the scope
\internal default names are used for scope that cannot be associated with a name.
*/
// DQ (6/13/2005): General function for extracting the name of declarations (when they have names)
std::string get_name (const SgScopeStatement * scope);
/*! \brief Generate a useful name to describe the SgSymbol
\internal default names are used for SgSymbol objects that cannot be associated with a name.
*/
// DQ (2/11/2007): Added this function to make debugging support more complete (useful for symbol table debugging support).
std::string get_name (const SgSymbol * symbol);
/*! \brief Generate a useful name to describe the SgType
\internal default names are used for SgType objects that cannot be associated with a name.
*/
std::string get_name (const SgType * type);
/*! \brief Generate a useful name to describe the SgSupport IR node
*/
std::string get_name (const SgSupport * node);
/*! \brief Generate a useful name to describe the SgLocatedNodeSupport IR node
*/
std::string get_name (const SgLocatedNodeSupport * node);
/*! \brief Generate a useful name to describe the SgC_PreprocessorDirectiveStatement IR node
*/
std::string get_name ( const SgC_PreprocessorDirectiveStatement* directive );
/*! \brief Generate a useful name to describe the SgToken IR node
*/
std::string get_name ( const SgToken* token );
// DQ (3/20/2016): Added to refactor some of the DSL infrastructure support.
/*! \brief Generate a useful name to support construction of identifiers from declarations.
This function permits names to be generated that will be unique across translation units
(a specific requirement different from the context of the get_name() functions above).
\internal This supports only a restricted set of declarations presently.
*/
std::string generateUniqueNameForUseAsIdentifier ( SgDeclarationStatement* declaration );
std::string generateUniqueNameForUseAsIdentifier_support ( SgDeclarationStatement* declaration );
/*! \brief Global map of name collisions to support generateUniqueNameForUseAsIdentifier() function.
*/
extern std::map<std::string,int> local_name_collision_map;
extern std::map<std::string,SgNode*> local_name_to_node_map;
extern std::map<SgNode*,std::string> local_node_to_name_map;
/*! \brief Traversal to set the global map of names to node and node to names.collisions to support generateUniqueNameForUseAsIdentifier() function.
*/
void computeUniqueNameForUseAsIdentifier( SgNode* astNode );
/*! \brief Reset map variables used to support generateUniqueNameForUseAsIdentifier() function.
*/
void reset_name_collision_map();
//@}
//------------------------------------------------------------------------
//@{
/*! @name Class utilities
\brief
*/
/*! \brief Get the default destructor from the class declaration
*/
// DQ (6/21/2005): Get the default destructor from the class declaration
SgMemberFunctionDeclaration *getDefaultDestructor (SgClassDeclaration *
classDeclaration);
/*! \brief Get the default constructor from the class declaration
*/
// DQ (6/22/2005): Get the default constructor from the class declaration
ROSE_DLL_API SgMemberFunctionDeclaration *getDefaultConstructor (SgClassDeclaration *
classDeclaration);
/*! \brief Return true if template definition is in the class, false if outside of class.
*/
// DQ (8/27/2005):
bool templateDefinitionIsInClass (SgTemplateInstantiationMemberFunctionDecl
* memberFunctionDeclaration);
/*! \brief Generate a non-defining (forward) declaration from a defining function declaration.
\internal should put into sageBuilder ?
*/
// DQ (9/17/2005):
SgTemplateInstantiationMemberFunctionDecl*
buildForwardFunctionDeclaration
(SgTemplateInstantiationMemberFunctionDecl * memberFunctionInstantiation);
//! Check if a SgNode is a declaration for a structure
bool isStructDeclaration(SgNode * node);
//! Check if a SgNode is a declaration for a union
bool isUnionDeclaration(SgNode * node);
#if 0
// DQ (8/28/2005): This is already a member function of the SgFunctionDeclaration
// (so that it can handle template functions and member functions)
/*! \brief Return true if member function of a template member function,
of false if a non-template member function in a templated class.
*/
// DQ (8/27/2005):
bool isTemplateMemberFunction (SgTemplateInstantiationMemberFunctionDecl *
memberFunctionDeclaration);
#endif
//@}
//------------------------------------------------------------------------
//@{
/*! @name Misc.
\brief Not sure the classifications right now
*/
//! Recursively print current and parent nodes. used within gdb to probe the context of a node.
void recursivePrintCurrentAndParent (SgNode* n) ;
//! Save AST into a pdf file. Start from a node to find its enclosing file node. The entire file's AST will be saved into a pdf.
void saveToPDF(SgNode* node, std::string filename);
void saveToPDF(SgNode* node); // enable calling from gdb
//! Pretty print AST horizontally, output to std output
void printAST (SgNode* node);
//! Pretty print AST horizontally, output to a specified text file.
void printAST2TextFile (SgNode* node, const char* filename);
void printAST2TextFile (SgNode* node, std::string filename);
// DQ (2/12/2012): Added some diagnostic support.
//! Diagnostic function for tracing back through the parent list to understand at runtime where in the AST a failure happened.
void whereAmI(SgNode* node);
//! Extract a SgPragmaDeclaration's leading keyword . For example "#pragma omp parallel" has a keyword of "omp".
std::string extractPragmaKeyword(const SgPragmaDeclaration *);
//! Check if a node is SgOmp*Statement
ROSE_DLL_API bool isOmpStatement(SgNode* );
/*! \brief Return true if function is overloaded.
*/
// DQ (8/27/2005):
bool isOverloaded (SgFunctionDeclaration * functionDeclaration);
// DQ (2/14/2012): Added support function used for variable declarations in conditionals.
//! Support function used for variable declarations in conditionals
void initializeIfStmt(SgIfStmt *ifstmt, SgStatement* conditional, SgStatement * true_body, SgStatement * false_body);
//! Support function used for variable declarations in conditionals
void initializeSwitchStatement(SgSwitchStatement* switchStatement,SgStatement *item_selector,SgStatement *body);
//! Support function used for variable declarations in conditionals
void initializeWhileStatement(SgWhileStmt* whileStatement, SgStatement * condition, SgStatement *body, SgStatement *else_body);
//! Generate unique names for expressions and attach the names as persistent attributes ("UniqueNameAttribute")
void annotateExpressionsWithUniqueNames (SgProject* project);
//! Check if a SgNode is a main() function declaration
ROSE_DLL_API bool isMain (const SgNode* node);
// DQ (6/22/2005):
/*! \brief Generate unique name from C and C++ constructs. The name may contain space.
This is support for the AST merge, but is generally useful as a more general mechanism than
name mangling which is more closely ties to the generation of names to support link-time function name
resolution. This is more general than common name mangling in that it resolves more relevant differences
between C and C++ declarations. (e.g. the type within the declaration: "struct { int:8; } foo;").
\implementation current work does not support expressions.
*/
std::string generateUniqueName ( const SgNode * node, bool ignoreDifferenceBetweenDefiningAndNondefiningDeclarations);
/** Generate a name like __temp#__ that is unique in the current scope and any parent and children scopes. # is a unique integer counter.
* @param baseName the word to be included in the variable names. */
std::string generateUniqueVariableName(SgScopeStatement* scope, std::string baseName = "temp");
// DQ (8/10/2010): Added const to first parameter.
// DQ (3/10/2007):
//! Generate a unique string from the source file position information
std::string declarationPositionString (const SgDeclarationStatement * declaration);
// DQ (1/20/2007):
//! Added mechanism to generate project name from list of file names
ROSE_DLL_API std::string generateProjectName (const SgProject * project, bool supressSuffix = false );
//! Given a SgExpression that represents a named function (or bound member
//! function), return the mentioned function
SgFunctionDeclaration* getDeclarationOfNamedFunction(SgExpression* func);
//! Get the mask expression from the header of a SgForAllStatement
SgExpression* forallMaskExpression(SgForAllStatement* stmt);
//! Find all SgPntrArrRefExp under astNode, then add SgVarRefExp (if any) of SgPntrArrRefExp's dim_info into NodeList_t
void addVarRefExpFromArrayDimInfo(SgNode * astNode, Rose_STL_Container<SgNode *>& NodeList_t);
// DQ (10/6/2006): Added support for faster mangled name generation (caching avoids recomputation).
/*! \brief Support for faster mangled name generation (caching avoids recomputation).
*/
#ifndef SWIG
// DQ (3/10/2013): This appears to be a problem for the SWIG interface (undefined reference at link-time).
void clearMangledNameCache (SgGlobal * globalScope);
void resetMangledNameCache (SgGlobal * globalScope);
#endif
std::string getMangledNameFromCache (SgNode * astNode);
std::string addMangledNameToCache (SgNode * astNode, const std::string & mangledName);
SgDeclarationStatement * getNonInstantiatonDeclarationForClass (SgTemplateInstantiationMemberFunctionDecl * memberFunctionInstantiation);
//! a better version for SgVariableDeclaration::set_baseTypeDefininingDeclaration(), handling all side effects automatically
//! Used to have a struct declaration embedded into a variable declaration
void setBaseTypeDefiningDeclaration(SgVariableDeclaration* var_decl, SgDeclarationStatement *base_decl);
// DQ (10/14/2006): This function tests the AST to see if for a non-defining declaration, the
// bool declarationPreceedsDefinition ( SgClassDeclaration* classNonDefiningDeclaration, SgClassDeclaration* classDefiningDeclaration );
//! Check if a defining declaration comes before of after the non-defining declaration.
bool declarationPreceedsDefinition (SgDeclarationStatement *nonDefiningDeclaration, SgDeclarationStatement *definingDeclaration);
// DQ (10/19/2006): Function calls have interesting context dependent rules to determine if
// they are output with a global qualifier or not. Were this is true we have to avoid global
// qualifiers, since the function's scope has not been defined. This is an example of where
// qualification of function names in function calls are context dependent; an interesting
// example of where the C++ language is not friendly to source-to-source processing :-).
bool functionCallExpressionPreceedsDeclarationWhichAssociatesScope (SgFunctionCallExp * functionCall);
/*! \brief Compute the intersection set for two ASTs.
This is part of a test done by the copy function to compute those IR nodes in the copy that still reference the original AST.
*/
ROSE_DLL_API std::vector < SgNode * >astIntersection (SgNode * original, SgNode * copy, SgCopyHelp * help = NULL);
//! Deep copy an arbitrary subtree
ROSE_DLL_API SgNode* deepCopyNode (const SgNode* subtree);
//! A template function for deep copying a subtree. It is also used to create deepcopy functions with specialized parameter and return types. e.g SgExpression* copyExpression(SgExpression* e);
template <typename NodeType>
NodeType* deepCopy (const NodeType* subtree) {
return dynamic_cast<NodeType*>(deepCopyNode(subtree));
}
//! Deep copy an expression
ROSE_DLL_API SgExpression* copyExpression(SgExpression* e);
//!Deep copy a statement
ROSE_DLL_API SgStatement* copyStatement(SgStatement* s);
// from VarSym.cc in src/midend/astOutlining/src/ASTtools
//! Get the variable symbol for the first initialized name of a declaration stmt.
ROSE_DLL_API SgVariableSymbol* getFirstVarSym (SgVariableDeclaration* decl);
//! Get the first initialized name of a declaration statement
ROSE_DLL_API SgInitializedName* getFirstInitializedName (SgVariableDeclaration* decl);
//! A special purpose statement removal function, originally from inlinerSupport.h, Need Jeremiah's attention to refine it. Please don't use it for now.
ROSE_DLL_API void myRemoveStatement(SgStatement* stmt);
ROSE_DLL_API bool isConstantTrue(SgExpression* e);
ROSE_DLL_API bool isConstantFalse(SgExpression* e);
ROSE_DLL_API bool isCallToParticularFunction(SgFunctionDeclaration* decl, SgExpression* e);
ROSE_DLL_API bool isCallToParticularFunction(const std::string& qualifiedName, size_t arity, SgExpression* e);
//! Check if a declaration has a "static' modifier
bool ROSE_DLL_API isStatic(SgDeclarationStatement* stmt);
//! Set a declaration as static
ROSE_DLL_API void setStatic(SgDeclarationStatement* stmt);
//! Check if a declaration has an "extern" modifier
ROSE_DLL_API bool isExtern(SgDeclarationStatement* stmt);
//! Set a declaration as extern
ROSE_DLL_API void setExtern(SgDeclarationStatement* stmt);
//! True if an SgInitializedName is "mutable' (has storage modifier set)
bool ROSE_DLL_API isMutable(SgInitializedName* name);
//! True if a parameter name is a Jovial output parameter
bool ROSE_DLL_API isJovialOutParam(SgInitializedName* name);
//! Get a vector of Jovial input parameters from the function parameter list (may work for Fortran in the future)
std::vector<SgInitializedName*> getInParameters(const SgInitializedNamePtrList ¶ms);
//! Get a vector of Jovial output parameters from the function parameter list (may work for Fortran in the future)
std::vector<SgInitializedName*> getOutParameters(const SgInitializedNamePtrList ¶ms);
//! Interface for creating a statement whose computation writes its answer into
//! a given variable.
class StatementGenerator {
public:
virtual ~StatementGenerator() {};
virtual SgStatement* generate(SgExpression* where_to_write_answer) = 0;
};
//! Check if a SgNode _s is an assignment statement (any of =,+=,-=,&=,/=, ^=, etc)
//!
//! Return the left hand, right hand expressions and if the left hand variable is also being read
bool isAssignmentStatement(SgNode* _s, SgExpression** lhs=NULL, SgExpression** rhs=NULL, bool* readlhs=NULL);
//! Variable references can be introduced by SgVarRef, SgPntrArrRefExp, SgInitializedName, SgMemberFunctionRef etc. For Dot and Arrow Expressions, their lhs is used to obtain SgInitializedName (coarse grain) by default. Otherwise, fine-grain rhs is used.
ROSE_DLL_API SgInitializedName* convertRefToInitializedName(SgNode* current, bool coarseGrain=true);
//! Build an abstract handle from an AST node, reuse previously built handle when possible
ROSE_DLL_API AbstractHandle::abstract_handle* buildAbstractHandle(SgNode*);
//! Obtain a matching SgNode from an abstract handle string
ROSE_DLL_API SgNode* getSgNodeFromAbstractHandleString(const std::string& input_string);
//! Dump information about a SgNode for debugging
ROSE_DLL_API void dumpInfo(SgNode* node, std::string desc="");
//! Reorder a list of declaration statements based on their appearance order in source files
ROSE_DLL_API std::vector<SgDeclarationStatement*>
sortSgNodeListBasedOnAppearanceOrderInSource(const std::vector<SgDeclarationStatement*>& nodevec);
// DQ (4/13/2013): We need these to support the unparing of operators defined by operator syntax or member function names.
//! Is an overloaded operator a prefix operator (e.g. address operator X * operator&(), dereference operator X & operator*(), unary plus operator X & operator+(), etc.
// bool isPrefixOperator( const SgMemberFunctionRefExp* memberFunctionRefExp );
bool isPrefixOperator( SgExpression* exp );
//! Check for proper names of possible prefix operators (used in isPrefixOperator()).
bool isPrefixOperatorName( const SgName & functionName );
//! Is an overloaded operator a postfix operator. (e.g. ).
bool isPostfixOperator( SgExpression* exp );
//! Is an overloaded operator an index operator (also referred to as call or subscript operators). (e.g. X & operator()() or X & operator[]()).
bool isIndexOperator( SgExpression* exp );
// DQ (1/10/2014): Adding more general support for token based unparsing.
//! Used to support token unparsing (when the output the trailing token sequence).
SgStatement* lastStatementOfScopeWithTokenInfo (SgScopeStatement* scope, std::map<SgNode*,TokenStreamSequenceToNodeMapping*> & tokenStreamSequenceMap);
// DQ (8/12/2020): Check the access permissions of all defining and nodefining declarations.
void checkAccessPermissions ( SgNode* );
// DQ (8/14/2020): Check the symbol tables for specific scopes (debugging support).
void checkSymbolTables ( SgNode* );
//@}
//------------------------------------------------------------------------
//@{
/*! @name AST properties
\brief version, language properties of current AST.
*/
// std::string version(); // utility_functions.h, version number
/*! Brief These traverse the memory pool of SgFile IR nodes and determine what languages are in use!
*/
ROSE_DLL_API bool is_Ada_language ();
ROSE_DLL_API bool is_C_language ();
ROSE_DLL_API bool is_Cobol_language ();
ROSE_DLL_API bool is_OpenMP_language ();
ROSE_DLL_API bool is_UPC_language ();
//! Check if dynamic threads compilation is used for UPC programs
ROSE_DLL_API bool is_UPC_dynamic_threads();
ROSE_DLL_API bool is_C99_language ();
ROSE_DLL_API bool is_Cxx_language ();
ROSE_DLL_API bool is_Java_language ();
ROSE_DLL_API bool is_Jovial_language ();
ROSE_DLL_API bool is_Fortran_language ();
ROSE_DLL_API bool is_CAF_language ();
ROSE_DLL_API bool is_PHP_language();
ROSE_DLL_API bool is_Python_language();
ROSE_DLL_API bool is_Cuda_language();
ROSE_DLL_API bool is_OpenCL_language();
ROSE_DLL_API bool is_X10_language();
ROSE_DLL_API bool is_binary_executable();
ROSE_DLL_API bool is_mixed_C_and_Cxx_language ();
ROSE_DLL_API bool is_mixed_Fortran_and_C_language ();
ROSE_DLL_API bool is_mixed_Fortran_and_Cxx_language ();
ROSE_DLL_API bool is_mixed_Fortran_and_C_and_Cxx_language ();
ROSE_DLL_API bool is_language_case_insensitive ();
ROSE_DLL_API bool language_may_contain_nondeclarations_in_scope ();
//@}
//------------------------------------------------------------------------
//@{
/*! @name Scope
\brief
*/
// DQ (10/5/2006): Added support for faster (non-quadratic) computation of unique
// labels for scopes in a function (as required for name mangling).
/*! \brief Assigns unique numbers to each SgScopeStatement of a function.
This is used to provide unique names for variables and types defined is
different nested scopes of a function (used in mangled name generation).
*/
void resetScopeNumbers (SgFunctionDefinition * functionDeclaration);
// DQ (10/5/2006): Added support for faster (non-quadratic) computation of unique
// labels for scopes in a function (as required for name mangling).
/*! \brief Clears the cache of scope,integer pairs for the input function.
This is used to clear the cache of computed unique labels for scopes in a function.
This function should be called after any transformation on a function that might effect
the allocation of scopes and cause the existing unique numbers to be incorrect.
This is part of support to provide unique names for variables and types defined is
different nested scopes of a function (used in mangled name generation).
*/
void clearScopeNumbers (SgFunctionDefinition * functionDefinition);
//!Find the enclosing namespace of a declaration
SgNamespaceDefinitionStatement * enclosingNamespaceScope (SgDeclarationStatement * declaration);
// SgNamespaceDefinitionStatement * getEnclosingNamespaceScope (SgNode * node);
bool isPrototypeInScope (SgScopeStatement * scope,
SgFunctionDeclaration * functionDeclaration,
SgDeclarationStatement * startingAtDeclaration);
//!check if node1 is a strict ancestor of node 2. (a node is not considered its own ancestor)
bool ROSE_DLL_API isAncestor(SgNode* node1, SgNode* node2);
//@}
//------------------------------------------------------------------------
//@{
/*! @name Preprocessing Information
\brief #if-#else-#end, comments, #include, etc
*/
//! Dumps a located node's preprocessing information.
void dumpPreprocInfo (SgLocatedNode* locatedNode);
//! Insert #include "filename" or #include <filename> (system header) onto the global scope of a source file, add to be the last #include .. by default among existing headers, Or as the first header. Recommended for use.
PreprocessingInfo * insertHeader(SgSourceFile * source_file, const std::string & header_file_name, bool isSystemHeader, bool asLastHeader);
//! Insert a new header right before stmt, if there are existing headers attached to stmt, insert it as the last or first header as specified by asLastHeader
void insertHeader (SgStatement* stmt, PreprocessingInfo* newheader, bool asLastHeader);
//! Insert #include "filename" or #include <filename> (system header) onto the global scope of a source file
PreprocessingInfo * insertHeader(SgSourceFile * source_file, const std::string & header_file_name, bool isSystemHeader = false, PreprocessingInfo::RelativePositionType position = PreprocessingInfo::before);
//! Insert #include "filename" or #include <filename> (system header) into the global scope containing the current scope, right after other #include XXX.
ROSE_DLL_API PreprocessingInfo* insertHeader(const std::string& filename, PreprocessingInfo::RelativePositionType position=PreprocessingInfo::after, bool isSystemHeader=false, SgScopeStatement* scope=NULL);
//! Identical to movePreprocessingInfo(), except for the stale name and confusing order of parameters. It will be deprecated soon.
ROSE_DLL_API void moveUpPreprocessingInfo (SgStatement* stmt_dst, SgStatement* stmt_src, PreprocessingInfo::RelativePositionType src_position=PreprocessingInfo::undef, PreprocessingInfo::RelativePositionType dst_position=PreprocessingInfo::undef, bool usePrepend= false);
//! Move preprocessing information of stmt_src to stmt_dst, Only move preprocessing information from the specified source-relative position to a specified target position, otherwise move all preprocessing information with position information intact. The preprocessing information is appended to the existing preprocessing information list of the target node by default. Prepending is used if usePreprend is set to true. Optionally, the relative position can be adjust after the moving using dst_position.
ROSE_DLL_API void movePreprocessingInfo (SgStatement* stmt_src, SgStatement* stmt_dst, PreprocessingInfo::RelativePositionType src_position=PreprocessingInfo::undef,
PreprocessingInfo::RelativePositionType dst_position=PreprocessingInfo::undef, bool usePrepend= false);
//!Cut preprocessing information from a source node and save it into a buffer. Used in combination of pastePreprocessingInfo(). The cut-paste operation is similar to moveUpPreprocessingInfo() but it is more flexible in that the destination node can be unknown during the cut operation.
ROSE_DLL_API void cutPreprocessingInfo (SgLocatedNode* src_node, PreprocessingInfo::RelativePositionType pos, AttachedPreprocessingInfoType& save_buf);
//!Paste preprocessing information from a buffer to a destination node. Used in combination of cutPreprocessingInfo()
ROSE_DLL_API void pastePreprocessingInfo (SgLocatedNode* dst_node, PreprocessingInfo::RelativePositionType pos, AttachedPreprocessingInfoType& saved_buf);
//! Attach an arbitrary string to a located node. A workaround to insert irregular statements or vendor-specific attributes.
ROSE_DLL_API PreprocessingInfo* attachArbitraryText(SgLocatedNode* target,
const std::string & text,
PreprocessingInfo::RelativePositionType position=PreprocessingInfo::before);
//!Check if a pragma declaration node has macro calls attached, if yes, replace macro calls within the pragma string with expanded strings. This only works if -rose:wave is turned on.
ROSE_DLL_API void replaceMacroCallsWithExpandedStrings(SgPragmaDeclaration* target);
//@}
//! Build and attach comment onto the global scope of a source file
PreprocessingInfo* attachComment(
SgSourceFile * source_file,
const std::string & content,
PreprocessingInfo::DirectiveType directive_type = PreprocessingInfo::C_StyleComment,
PreprocessingInfo::RelativePositionType position = PreprocessingInfo::before
);
//! Build and attach comment, comment style is inferred from the language type of the target node if not provided
ROSE_DLL_API PreprocessingInfo* attachComment(SgLocatedNode* target, const std::string & content,
PreprocessingInfo::RelativePositionType position=PreprocessingInfo::before,
PreprocessingInfo::DirectiveType dtype= PreprocessingInfo::CpreprocessorUnknownDeclaration);
// DQ (7/20/2008): I am not clear were I should put this function, candidates include: SgLocatedNode or SgInterface
//! Add a string to be unparsed to support code generation for back-end specific tools or compilers.
ROSE_DLL_API void addTextForUnparser ( SgNode* astNode, std::string s, AstUnparseAttribute::RelativePositionType inputlocation );
/**
* Add preproccessor guard around a given node.
* It surrounds the node with "#if guard" and "#endif"
*/
void guardNode(SgLocatedNode * target, std::string guard);
//@}
//------------------------------------------------------------------------
//@{
/*! @name Source File Position
\brief set Sg_File_Info for a SgNode
*/
// ************************************************************************
// Newer versions of now depricated functions
// ************************************************************************
// DQ (5/1/2012): This function queries the SageBuilder::SourcePositionClassification mode (stored in the SageBuilder
// interface) and used the specified mode to initialize the source position data (Sg_File_Info objects). This
// function is the only function that should be called directly (though in a namespace we can't define permissions).
//! Set the source code positon for the current (input) node.
ROSE_DLL_API void setSourcePosition(SgNode* node);
// A better name might be "setSourcePositionForSubTree"
//! Set the source code positon for the subtree (including the root).
ROSE_DLL_API void setSourcePositionAtRootAndAllChildren(SgNode *root);
//! DQ (5/1/2012): New function with improved name.
void setSourcePositionAsTransformation(SgNode *node);
// DQ (5/1/2012): Newly renamed function (previous name preserved for backward compatability).
void setSourcePositionPointersToNull(SgNode *node);
// ************************************************************************
// ************************************************************************
// Older deprecated functions
// ************************************************************************
// Liao, 1/8/2007, set file info. for a whole subtree as transformation generated
//! Set current node's source position as transformation generated
ROSE_DLL_API void setOneSourcePositionForTransformation(SgNode *node);
//! Set current node's source position as NULL
ROSE_DLL_API void setOneSourcePositionNull(SgNode *node);
//! Recursively set source position info(Sg_File_Info) as transformation generated
ROSE_DLL_API void setSourcePositionForTransformation (SgNode * root);
//! Set source position info(Sg_File_Info) as transformation generated for all SgNodes in memory pool
// ROSE_DLL_API void setSourcePositionForTransformation_memoryPool();
//! Check if a node is from a system header file
ROSE_DLL_API bool insideSystemHeader (SgLocatedNode* node);
//! Set the source position of SgLocatedNode to Sg_File_Info::generateDefaultFileInfo(). These nodes WILL be unparsed. Not for transformation usage.
// ROSE_DLL_API void setSourcePosition (SgLocatedNode * locatedNode);
// ************************************************************************
//@}
//------------------------------------------------------------------------
//@{
/*! @name Data types
\brief
*/
// from src/midend/astInlining/typeTraits.h
// src/midend/astUtil/astInterface/AstInterface.h
//! Get the right bool type according to C or C++ language input
SgType* getBoolType(SgNode* n);
//! Check if a type is an integral type, only allowing signed/unsigned short, int, long, long long.
////!
////! There is another similar function named SgType::isIntegerType(), which allows additional types char, wchar, and bool to be treated as integer types
ROSE_DLL_API bool isStrictIntegerType(SgType* t);
//!Get the data type of the first initialized name of a declaration statement
ROSE_DLL_API SgType* getFirstVarType(SgVariableDeclaration* decl);
//! Is a type default constructible? This may not quite work properly.
ROSE_DLL_API bool isDefaultConstructible(SgType* type);
//! Is a type copy constructible? This may not quite work properly.
ROSE_DLL_API bool isCopyConstructible(SgType* type);
//! Is a type assignable? This may not quite work properly.
ROSE_DLL_API bool isAssignable(SgType* type);
#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
//! Check if a class type is a pure virtual class. True means that there is at least
//! one pure virtual function that has not been overridden.
//! In the case of an incomplete class type (forward declaration), this function returns false.
ROSE_DLL_API bool isPureVirtualClass(SgType* type, const ClassHierarchyWrapper& classHierarchy);
#endif
//! Does a type have a trivial (built-in) destructor?
ROSE_DLL_API bool hasTrivialDestructor(SgType* t);
//! Is this type a non-constant reference type? (Handles typedefs correctly)
ROSE_DLL_API bool isNonconstReference(SgType* t);
//! Is this type a const or non-const reference type? (Handles typedefs correctly)
ROSE_DLL_API bool isReferenceType(SgType* t);
//! Is this type a pointer type? (Handles typedefs correctly)
ROSE_DLL_API bool isPointerType(SgType* t);
//! Is this a pointer to a non-const type? Note that this function will return true for const pointers pointing to
//! non-const types. For example, (int* const y) points to a modifiable int, so this function returns true. Meanwhile,
//! it returns false for (int const * x) and (int const * const x) because these types point to a const int.
//! Also, only the outer layer of nested pointers is unwrapped. So the function returns true for (const int ** y), but returns
//! false for const (int * const * x)
ROSE_DLL_API bool isPointerToNonConstType(SgType* type);
//! Is this a const type?
/* const char* p = "aa"; is not treated as having a const type. It is a pointer to const char.
* Similarly, neither for const int b[10]; or const int & c =10;
* The standard says, "A compound type is not cv-qualified by the cv-qualifiers (if any) of
the types from which it is compounded. Any cv-qualifiers applied to an array type affect the array element type, not the array type".
*/
ROSE_DLL_API bool isConstType(SgType* t);
//! Remove const (if present) from a type. stripType() cannot do this because it removes all modifiers.
SgType* removeConst(SgType* t);
//! Is this a volatile type?
ROSE_DLL_API bool isVolatileType(SgType* t);
//! Is this a restrict type?
ROSE_DLL_API bool isRestrictType(SgType* t);
//! Is this a scalar type?
/*! We define the following SgType as scalar types: char, short, int, long , void, Wchar, Float, double, long long, string, bool, complex, imaginary
*/
ROSE_DLL_API bool isScalarType(SgType* t);
//! Check if a type is an integral type, only allowing signed/unsigned short, int, long, long long.
//!
//! There is another similar function named SgType::isIntegerType(), which allows additional types char, wchar, and bool.
ROSE_DLL_API bool isStrictIntegerType(SgType* t);
//! Check if a type is a struct type (a special SgClassType in ROSE)
ROSE_DLL_API bool isStructType(SgType* t);
//! Generate a mangled string for a given type based on Itanium C++ ABI
ROSE_DLL_API std::string mangleType(SgType* type);
//! Generate mangled scalar type names according to Itanium C++ ABI, the input type should pass isScalarType() in ROSE
ROSE_DLL_API std::string mangleScalarType(SgType* type);
//! Generated mangled modifier types, include const, volatile,according to Itanium C++ ABI, with extension to handle UPC shared types.
ROSE_DLL_API std::string mangleModifierType(SgModifierType* type);
//! Calculate the number of elements of an array type: dim1* dim2*... , assume element count is 1 for int a[]; Strip off THREADS if it is a UPC array.
ROSE_DLL_API size_t getArrayElementCount(SgArrayType* t);
//! Get the number of dimensions of an array type
ROSE_DLL_API int getDimensionCount(SgType* t);
//! Get the element type of an array. It recursively find the base type for multi-dimension array types
ROSE_DLL_API SgType* getArrayElementType(SgType* t);
//! Get the element type of an array, pointer or string, or NULL if not applicable. This function only check one level base type. No recursion.
ROSE_DLL_API SgType* getElementType(SgType* t);
/// \brief returns the array dimensions in an array as defined for arrtype
/// \param arrtype the type of a C/C++ array
/// \return an array that contains an expression indicating each dimension's size.
/// OWNERSHIP of the expressions is TRANSFERED TO the CALLER (which
/// becomes responsible for freeing the expressions).
/// Note, the first entry of the array is a SgNullExpression, iff the
/// first array dimension was not specified.
/// \code
/// int x[] = { 1, 2, 3 };
/// \endcode
/// note, the expression does not have to be a constant
/// \code
/// int x[i*5];
/// \endcode
/// \post return-value.empty() == false
/// \post return-value[*] != NULL (no nullptr in the returned vector)
std::vector<SgExpression*>
get_C_array_dimensions(const SgArrayType& arrtype);
/// \brief returns the array dimensions in an array as defined for arrtype
/// \param arrtype the type of a C/C++ array
/// \param varref a reference to an array variable (the variable of type arrtype)
/// \return an array that contains an expression indicating each dimension's size.
/// OWNERSHIP of the expressions is TRANSFERED TO the CALLER (which
/// becomes responsible for freeing the expressions).
/// If the first array dimension was not specified an expression
/// that indicates that size is generated.
/// \code
/// int x[][3] = { 1, 2, 3, 4, 5, 6 };
/// \endcode
/// the entry for the first dimension will be:
/// \code
/// // 3 ... size of 2nd dimension
/// sizeof(x) / (sizeof(int) * 3)
/// \endcode
/// \pre arrtype is the array-type of varref
/// \post return-value.empty() == false
/// \post return-value[*] != NULL (no nullptr in the returned vector)
/// \post !isSgNullExpression(return-value[*])
std::vector<SgExpression*>
get_C_array_dimensions(const SgArrayType& arrtype, const SgVarRefExp& varref);
/// \overload
/// \note see get_C_array_dimensions for SgVarRefExp for details.
/// \todo make initname const
std::vector<SgExpression*>
get_C_array_dimensions(const SgArrayType& arrtype, SgInitializedName& initname);
//! Check if an expression is an array access (SgPntrArrRefExp). If so, return its name expression and subscripts if requested. Users can use convertRefToInitializedName() to get the possible name. It does not check if the expression is a top level SgPntrArrRefExp.
ROSE_DLL_API bool isArrayReference(SgExpression* ref, SgExpression** arrayNameExp=NULL, std::vector<SgExpression*>** subscripts=NULL);
//! Collect variable references in array types. The default NodeQuery::querySubTree() will miss variables referenced in array type's index list. e.g. double *buffer = new double[numItems] ;
ROSE_DLL_API int collectVariableReferencesInArrayTypes (SgLocatedNode* root, Rose_STL_Container<SgNode*> & currentVarRefList);
//! Has a UPC shared type of any kinds (shared-to-shared, private-to-shared, shared-to-private, shared scalar/array)? An optional parameter, mod_type_out, stores the first SgModifierType with UPC access information.
/*!
* Note: we classify private-to-shared as 'has shared' type for convenience here. It is indeed a private type in strict sense.
AST graph for some examples:
- shared scalar: SgModifierType -->base type
- shared array: SgArrayType --> SgModiferType --> base type
- shared to shared: SgModifierType --> SgPointerType --> SgModifierType ->SgTypeInt
- shared to private: SgModifierType --> SgPointerType --> base type
- private to shared: SgPointerType --> SgModifierType --> base type
*/
ROSE_DLL_API bool hasUpcSharedType(SgType* t, SgModifierType ** mod_type_out = NULL );
//! Check if a type is a UPC shared type, including shared array, shared pointers etc. Exclude private pointers to shared types. Optionally return the modifier type with the UPC shared property.
/*!
* ROSE uses SgArrayType of SgModifierType to represent shared arrays, not SgModifierType points to SgArrayType. Also typedef may cause a chain of nodes before reach the actual SgModifierType with UPC shared property.
*/
ROSE_DLL_API bool isUpcSharedType(SgType* t, SgModifierType ** mod_type_out = NULL);
//! Check if a modifier type is a UPC shared type.
ROSE_DLL_API bool isUpcSharedModifierType (SgModifierType* mod_type);
//! Check if an array type is a UPC shared type. ROSE AST represents a UPC shared array as regular array of elements of UPC shared Modifier Type. Not directly a UPC shared Modifier Type of an array.
ROSE_DLL_API bool isUpcSharedArrayType (SgArrayType* array_type);
//! Check if a shared UPC type is strict memory consistency or not. Return false if it is relaxed. (So isUpcRelaxedSharedModifierType() is not necessary.)
ROSE_DLL_API bool isUpcStrictSharedModifierType(SgModifierType* mode_type);
//! Get the block size of a UPC shared modifier type
ROSE_DLL_API size_t getUpcSharedBlockSize(SgModifierType* mod_type);
//! Get the block size of a UPC shared type, including Modifier types and array of modifier types (shared arrays)
ROSE_DLL_API size_t getUpcSharedBlockSize(SgType* t);
//! Is UPC phase-less shared type? Phase-less means block size of the first SgModifierType with UPC information is 1 or 0/unspecified. Also return false if the type is not a UPC shared type.
ROSE_DLL_API bool isUpcPhaseLessSharedType (SgType* t);
//! Is a UPC private-to-shared pointer? SgPointerType comes first compared to SgModifierType with UPC information. Input type must be any of UPC shared types first.
ROSE_DLL_API bool isUpcPrivateToSharedType(SgType* t);
//! Is a UPC array with dimension of X*THREADS
ROSE_DLL_API bool isUpcArrayWithThreads(SgArrayType* t);
//! Lookup a named type based on its name, bottomup searching from a specified scope. Note name collison might be allowed for c (not C++) between typedef and enum/struct. Only the first matched named type will be returned in this case. typedef is returned as it is, not the base type it actually refers to.
ROSE_DLL_API SgType* lookupNamedTypeInParentScopes(const std::string& type_name, SgScopeStatement* scope=NULL);
// DQ (7/22/2014): Added support for comparing expression types in actual arguments with those expected from the formal function parameter types.
//! Get the type of the associated argument expression from the function type.
ROSE_DLL_API SgType* getAssociatedTypeFromFunctionTypeList(SgExpression* actual_argument_expression);
//! Verify that 2 SgTemplateArgument are equivalent (same type, same expression, or same template declaration)
ROSE_DLL_API bool templateArgumentEquivalence(SgTemplateArgument * arg1, SgTemplateArgument * arg2);
//! Verify that 2 SgTemplateArgumentPtrList are equivalent.
ROSE_DLL_API bool templateArgumentListEquivalence(const SgTemplateArgumentPtrList & list1, const SgTemplateArgumentPtrList & list2);
//! Test for equivalence of types independent of access permissions (private or protected modes for members of classes).
ROSE_DLL_API bool isEquivalentType (const SgType* lhs, const SgType* rhs);
//! Find the function type matching a function signature plus a given return type
ROSE_DLL_API SgFunctionType* findFunctionType (SgType* return_type, SgFunctionParameterTypeList* typeList);
//! Test if two types are equivalent SgFunctionType nodes. This is necessary for template function types
//! They may differ in one SgTemplateType pointer but identical otherwise.
ROSE_DLL_API bool isEquivalentFunctionType (const SgFunctionType* lhs, const SgFunctionType* rhs);
//@}
//------------------------------------------------------------------------
//@{
/*! @name Loop handling
\brief
*/
// by Jeremiah
//! Add a step statement to the end of a loop body
//! Add a new label to the end of the loop, with the step statement after
//! it; then change all continue statements in the old loop body into
//! jumps to the label
//!
//! For example:
//! while (a < 5) {if (a < -3) continue;} (adding "a++" to end) becomes
//! while (a < 5) {if (a < -3) goto label; label: a++;}
ROSE_DLL_API void addStepToLoopBody(SgScopeStatement* loopStmt, SgStatement* step);
ROSE_DLL_API void moveForStatementIncrementIntoBody(SgForStatement* f);
ROSE_DLL_API void convertForToWhile(SgForStatement* f);
ROSE_DLL_API void convertAllForsToWhiles(SgNode* top);
//! Change continue statements in a given block of code to gotos to a label
ROSE_DLL_API void changeContinuesToGotos(SgStatement* stmt, SgLabelStatement* label);
//!Return the loop index variable for a for loop
ROSE_DLL_API SgInitializedName* getLoopIndexVariable(SgNode* loop);
//!Check if a SgInitializedName is used as a loop index within a AST subtree
//! This function will use a bottom-up traverse starting from the subtree_root to find all enclosing loops and check if ivar is used as an index for either of them.
ROSE_DLL_API bool isLoopIndexVariable(SgInitializedName* ivar, SgNode* subtree_root);
//! Check if a for loop uses C99 style initialization statement with multiple expressions like for (int i=0, j=0; ..) or for (i=0,j=0;...)
/*!
for (int i=0, j=0; ..) is stored as two variable declarations under SgForInitStatement's init_stmt member
for (i=0,j=0;...) is stored as a single expression statement, with comma expression (i=0,j=0).
*/
ROSE_DLL_API bool hasMultipleInitStatmentsOrExpressions (SgForStatement* for_loop);
//! Routines to get and set the body of a loop
ROSE_DLL_API SgStatement* getLoopBody(SgScopeStatement* loop);
ROSE_DLL_API void setLoopBody(SgScopeStatement* loop, SgStatement* body);
//! Routines to get the condition of a loop. It recognize While-loop, For-loop, and Do-While-loop
ROSE_DLL_API SgStatement* getLoopCondition(SgScopeStatement* loop);
//! Set the condition statement of a loop, including While-loop, For-loop, and Do-While-loop.
ROSE_DLL_API void setLoopCondition(SgScopeStatement* loop, SgStatement* cond);
//! Check if a for-loop has a canonical form, return loop index, bounds, step, and body if requested
//!
//! A canonical form is defined as : one initialization statement, a test expression, and an increment expression , loop index variable should be of an integer type. IsInclusiveUpperBound is true when <= or >= is used for loop condition
ROSE_DLL_API bool isCanonicalForLoop(SgNode* loop, SgInitializedName** ivar=NULL, SgExpression** lb=NULL, SgExpression** ub=NULL, SgExpression** step=NULL, SgStatement** body=NULL, bool *hasIncrementalIterationSpace = NULL, bool* isInclusiveUpperBound = NULL);
//! Check if a Fortran Do loop has a complete canonical form: Do I=1, 10, 1
ROSE_DLL_API bool isCanonicalDoLoop(SgFortranDo* loop,SgInitializedName** ivar/*=NULL*/, SgExpression** lb/*=NULL*/, SgExpression** ub/*=NULL*/, SgExpression** step/*=NULL*/, SgStatement** body/*=NULL*/, bool *hasIncrementalIterationSpace/*= NULL*/, bool* isInclusiveUpperBound/*=NULL*/);
//! Set the lower bound of a loop header for (i=lb; ...)
ROSE_DLL_API void setLoopLowerBound(SgNode* loop, SgExpression* lb);
//! Set the upper bound of a loop header,regardless the condition expression type. for (i=lb; i op up, ...)
ROSE_DLL_API void setLoopUpperBound(SgNode* loop, SgExpression* ub);
//! Set the stride(step) of a loop 's incremental expression, regardless the expression types (i+=s; i= i+s, etc)
ROSE_DLL_API void setLoopStride(SgNode* loop, SgExpression* stride);
//! Normalize loop init stmt by promoting the single variable declaration statement outside of the for loop header's init statement, e.g. for (int i=0;) becomes int i_x; for (i_x=0;..) and rewrite the loop with the new index variable, if necessary
ROSE_DLL_API bool normalizeForLoopInitDeclaration(SgForStatement* loop);
//! Undo the normalization of for loop's C99 init declaration. Previous record of normalization is used to ease the reverse transformation.
ROSE_DLL_API bool unnormalizeForLoopInitDeclaration(SgForStatement* loop);
//! Normalize a for loop, return true if successful. Generated constants will be fold by default.
//!
//! Translations are :
//! For the init statement: for (int i=0;... ) becomes int i; for (i=0;..)
//! For test expression:
//! i<x is normalized to i<= (x-1) and
//! i>x is normalized to i>= (x+1)
//! For increment expression:
//! i++ is normalized to i+=1 and
//! i-- is normalized to i+=-1
//! i-=s is normalized to i+= -s
ROSE_DLL_API bool forLoopNormalization(SgForStatement* loop, bool foldConstant = true);
//! Normalize a for loop's test expression
//! i<x is normalized to i<= (x-1) and
//! i>x is normalized to i>= (x+1)
ROSE_DLL_API bool normalizeForLoopTest(SgForStatement* loop);
ROSE_DLL_API bool normalizeForLoopIncrement(SgForStatement* loop);
//!Normalize a Fortran Do loop. Make the default increment expression (1) explicit
ROSE_DLL_API bool doLoopNormalization(SgFortranDo* loop);
//! Unroll a target loop with a specified unrolling factor. It handles steps larger than 1 and adds a fringe loop if the iteration count is not evenly divisible by the unrolling factor.
ROSE_DLL_API bool loopUnrolling(SgForStatement* loop, size_t unrolling_factor);
//! Interchange/permutate a n-level perfectly-nested loop rooted at 'loop' using a lexicographical order number within (0,depth!).
ROSE_DLL_API bool loopInterchange(SgForStatement* loop, size_t depth, size_t lexicoOrder);
//! Tile the n-level (starting from 1) loop of a perfectly nested loop nest using tiling size s
ROSE_DLL_API bool loopTiling(SgForStatement* loopNest, size_t targetLevel, size_t tileSize);
//Winnie Loop Collapsing
SgExprListExp * loopCollapsing(SgForStatement* target_loop, size_t collapsing_factor);
bool getForLoopInformations(
SgForStatement * for_loop,
SgVariableSymbol * & iterator,
SgExpression * & lower_bound,
SgExpression * & upper_bound,
SgExpression * & stride
);
//@}
//------------------------------------------------------------------------
//@{
/*! @name Topdown search
\brief Top-down traversal from current node to find a node of a specified type
*/
//! Query a subtree to get all nodes of a given type, with an appropriate downcast.
template <typename NodeType>
std::vector<NodeType*> querySubTree(SgNode* top, VariantT variant = (VariantT)NodeType::static_variant)
{
#if 0
printf ("Top of SageInterface::querySubTree() \n");
#endif
Rose_STL_Container<SgNode*> nodes = NodeQuery::querySubTree(top,variant);
std::vector<NodeType*> result(nodes.size(), NULL);
int count = 0;
#if 0
printf ("In SageInterface::querySubTree(): before initialization loop \n");
#endif
for (Rose_STL_Container<SgNode*>::const_iterator i = nodes.begin(); i != nodes.end(); ++i, ++count)
{
#if 0
printf ("In SageInterface::querySubTree(): in loop: count = %d \n",count);
#endif
NodeType* node = dynamic_cast<NodeType*>(*i);
ROSE_ASSERT (node);
result[count] = node;
}
#if 0
printf ("Leaving SageInterface::querySubTree(): after initialization loop \n");
#endif
return result;
}
/*! \brief Returns STL vector of SgFile IR node pointers.
Demonstrates use of restricted traversal over just SgFile IR nodes.
*/
std::vector < SgFile * >generateFileList ();
/** Get the current SgProject IR Node.
*
* The library should never have more than one project and it asserts such. If no project has been created yet then this
* function returns the null pointer. */
ROSE_DLL_API SgProject * getProject();
//! \return the project associated with a node
SgProject * getProject(const SgNode * node);
//! Query memory pools to grab SgNode of a specified type
template <typename NodeType>
static std::vector<NodeType*> getSgNodeListFromMemoryPool()
{
// This function uses a memory pool traversal specific to the SgFile IR nodes
class MyTraversal : public ROSE_VisitTraversal
{
public:
std::vector<NodeType*> resultlist;
void visit ( SgNode* node)
{
NodeType* result = dynamic_cast<NodeType* > (node);
ROSE_ASSERT(result!= NULL);
if (result!= NULL)
{
resultlist.push_back(result);
}
};
virtual ~MyTraversal() {}
};
MyTraversal my_traversal;
NodeType::traverseMemoryPoolNodes(my_traversal);
return my_traversal.resultlist;
}
/*! \brief top-down traversal from current node to find the main() function declaration
*/
ROSE_DLL_API SgFunctionDeclaration* findMain(SgNode* currentNode);
//! Find the last declaration statement within a scope (if any). This is often useful to decide where to insert another variable declaration statement. Pragma declarations are not treated as a declaration by default in this context.
SgStatement* findLastDeclarationStatement(SgScopeStatement * scope, bool includePragma = false);
//midend/programTransformation/partialRedundancyElimination/pre.h
//! Find referenced symbols within an expression
std::vector<SgVariableSymbol*> getSymbolsUsedInExpression(SgExpression* expr);
//! Find break statements inside a particular statement, stopping at nested loops or switches
/*! loops or switch statements defines their own contexts for break
statements. The function will stop immediately if run on a loop or switch
statement. If fortranLabel is non-empty, breaks (EXITs) to that label within
nested loops are included in the returned list.
*/
std::vector<SgBreakStmt*> findBreakStmts(SgStatement* code, const std::string& fortranLabel = "");
//! Find all continue statements inside a particular statement, stopping at nested loops
/*! Nested loops define their own contexts for continue statements. The
function will stop immediately if run on a loop
statement. If fortranLabel is non-empty, continues (CYCLEs) to that label
within nested loops are included in the returned list.
*/
std::vector<SgContinueStmt*> findContinueStmts(SgStatement* code, const std::string& fortranLabel = "");
std::vector<SgGotoStatement*> findGotoStmts(SgStatement* scope, SgLabelStatement* l);
std::vector<SgStatement*> getSwitchCases(SgSwitchStatement* sw);
//! Collect all variable references in a subtree
void collectVarRefs(SgLocatedNode* root, std::vector<SgVarRefExp* >& result);
//! Topdown traverse a subtree from root to find the first declaration given its name, scope (optional, can be NULL), and defining or nondefining flag.
template <typename T>
T* findDeclarationStatement(SgNode* root, std::string name, SgScopeStatement* scope, bool isDefining)
{
bool found = false;
#if 0
printf ("In findDeclarationStatement(): root = %p \n",root);
printf ("In findDeclarationStatement(): name = %s \n",name.c_str());
printf ("In findDeclarationStatement(): scope = %p \n",scope);
printf ("In findDeclarationStatement(): isDefining = %s \n",isDefining ? "true" : "false");
#endif
// Do we really want a NULL pointer to be acceptable input to this function?
// Maybe we should have an assertion that it is non-null?
if (!root) return NULL;
T* decl = dynamic_cast<T*>(root);
#if 0
printf ("In findDeclarationStatement(): decl = %p \n",decl);
#endif
if (decl != NULL)
{
if (scope)
{
if ((decl->get_scope() == scope) && (decl->search_for_symbol_from_symbol_table()->get_name() == name))
{
found = true;
}
}
else // Liao 2/9/2010. We should allow NULL scope
{
#if 0
// DQ (12/6/2016): Include this into the debugging code to aboid compiler warning about unused variable.
SgSymbol* symbol = decl->search_for_symbol_from_symbol_table();
printf ("In findDeclarationStatement(): decl->search_for_symbol_from_symbol_table() = %p \n",symbol);
printf ("In findDeclarationStatement(): decl->search_for_symbol_from_symbol_table()->get_name() = %s \n",symbol->get_name().str());
#endif
if (decl->search_for_symbol_from_symbol_table()->get_name() == name)
{
found = true;
}
}
}
if (found)
{
if (isDefining)
{
#if 0
printf ("In findDeclarationStatement(): decl->get_firstNondefiningDeclaration() = %p \n",decl->get_firstNondefiningDeclaration());
printf ("In findDeclarationStatement(): decl->get_definingDeclaration() = %p \n",decl->get_definingDeclaration());
#endif
ROSE_ASSERT (decl->get_definingDeclaration() != NULL);
#if 0
printf ("In findDeclarationStatement(): returing decl->get_definingDeclaration() = %p \n",decl->get_definingDeclaration());
#endif
return dynamic_cast<T*> (decl->get_definingDeclaration());
}
else
{
#if 0
printf ("In findDeclarationStatement(): returing decl = %p \n",decl);
#endif
return decl;
}
}
std::vector<SgNode*> children = root->get_traversalSuccessorContainer();
#if 0
printf ("In findDeclarationStatement(): children.size() = %zu \n",children.size());
#endif
// DQ (4/10/2016): Note that if we are searching for a function member that has it's defining
// declaration defined outside of the class then it will not be found in the child list.
for (std::vector<SgNode*>::const_iterator i = children.begin(); i != children.end(); ++i)
{
T* target = findDeclarationStatement<T> (*i,name,scope,isDefining);
if (target)
{
return target;
}
}
return NULL;
}
//! Topdown traverse a subtree from root to find the first function declaration matching the given name, scope (optional, can be NULL), and defining or nondefining flag. This is an instantiation of findDeclarationStatement<T>.
SgFunctionDeclaration* findFunctionDeclaration(SgNode* root, std::string name, SgScopeStatement* scope, bool isDefining);
#if 0 //TODO
// 1. preorder traversal from current SgNode till find next SgNode of type V_SgXXX
// until reach the end node
SgNode* getNextSgNode( const SgNode* astSourceNode, VariantT=V_SgNode, SgNode* astEndNode=NULL);
// 2. return all nodes of type VariantT following the source node
std::vector<SgNode*> getAllNextSgNode( const SgNode* astSourceNode, VariantT=V_SgNode, SgNode* astEndNode=NULL);
#endif
//@}
//------------------------------------------------------------------------
//@{
/*! @name Bottom up search
\brief Backwards traverse through the AST to find a node, findEnclosingXXX()
*/
// remember to put const to all arguments.
/** Find a node by type using upward traversal.
*
* Traverse backward through a specified node's ancestors, starting with the node's parent and progressing to more distant
* ancestors, to find the first node matching the specified or derived type. If @p includingSelf is true then the
* starting node, @p astNode, is returned if its type matches, otherwise the search starts at the parent of @p astNode.
*
* For the purposes of this function, the parent (P) of an SgDeclarationStatement node (N) is considered to be the first
* non-defining declaration of N if N has both a defining declaration and a first non-defining declaration and the defining
* declaration is different than the first non-defining declaration.
*
* If no ancestor of the requisite type of subtypes is found then this function returns a null pointer.
*
* If @p astNode is the null pointer, then the return value is a null pointer. That is, if there is no node, then there cannot
* be an enclosing node of the specified type. */
template <typename NodeType>
NodeType* getEnclosingNode(const SgNode* astNode, const bool includingSelf = false)
{
#define DEBUG_GET_ENCLOSING_NODE 0
#if 1
// DQ (12/31/2019): This version does not detect a cycle that Robb's version detects in processing Cxx11_tests/test2016_23.C.
// This will have to be investigated seperately from the issue I am working on currently.
// DQ (10/20/2012): This is the older version of this implementation. Until I am sure that
// the newer version (below) is what we want to use I will resolve this conflict by keeping
// the previous version in place.
if (NULL == astNode)
{
return NULL;
}
if ( (includingSelf ) && (dynamic_cast<const NodeType*>(astNode)) )
{
return const_cast<NodeType*>(dynamic_cast<const NodeType*> (astNode));
}
// DQ (3/5/2012): Check for reference to self...
ROSE_ASSERT(astNode->get_parent() != astNode);
SgNode* parent = astNode->get_parent();
// DQ (3/5/2012): Check for loops that will cause infinite loops.
SgNode* previouslySeenParent = parent;
bool foundCycle = false;
int counter = 0;
#if DEBUG_GET_ENCLOSING_NODE
printf ("In getEnclosingNode(): previouslySeenParent = %p = %s \n",previouslySeenParent,previouslySeenParent->class_name().c_str());
#endif
while ( (foundCycle == false) && (parent != NULL) && (!dynamic_cast<const NodeType*>(parent)) )
{
ROSE_ASSERT(parent->get_parent() != parent);
#if DEBUG_GET_ENCLOSING_NODE
printf (" --- parent = %p = %s \n",parent,parent->class_name().c_str());
printf (" --- --- parent->get_parent() = %p = %s \n",parent->get_parent(),parent->get_parent()->class_name().c_str());
#endif
#if 1
// DQ (1/8/2020): ROSE-82 (on RZ) This limit needs to be larger and increasing it to 500 was enough
// for a specific code with a long chain of if-then-else nesting, So to make this sufficent for more
// general code we have increased the lomit to 100,000. Note that 50 was not enough for real code,
// but was enough for our regression tests.
// DQ (12/30/2019): This is added to support detection of infinite loops over parent pointers.
// if (counter >= 500)
if (counter >= 100000)
{
printf ("Exiting: In getEnclosingNode(): loop limit exceeded: counter = %d \n",counter);
ROSE_ASSERT(false);
}
#endif
parent = parent->get_parent();
// DQ (3/5/2012): Check for loops that will cause infinite loops.
// ROSE_ASSERT(parent != previouslySeenParent);
if (parent == previouslySeenParent)
{
foundCycle = true;
}
counter++;
}
#if DEBUG_GET_ENCLOSING_NODE
printf ("previouslySeenParent = %p = %s \n",previouslySeenParent,previouslySeenParent->class_name().c_str());
#endif
parent = previouslySeenParent;
SgDeclarationStatement* declarationStatement = isSgDeclarationStatement(parent);
if (declarationStatement != NULL)
{
#if 0
printf ("Found a SgDeclarationStatement \n");
#endif
SgDeclarationStatement* definingDeclaration = declarationStatement->get_definingDeclaration();
SgDeclarationStatement* firstNondefiningDeclaration = declarationStatement->get_firstNondefiningDeclaration();
#if 0
printf (" --- declarationStatement = %p \n",declarationStatement);
printf (" --- definingDeclaration = %p \n",definingDeclaration);
if (definingDeclaration != NULL && definingDeclaration->get_parent() != NULL)
printf (" --- definingDeclaration ->get_parent() = %p = %s \n",definingDeclaration->get_parent(),definingDeclaration->get_parent()->class_name().c_str());
printf (" --- firstNondefiningDeclaration = %p \n",firstNondefiningDeclaration);
if (firstNondefiningDeclaration != NULL && firstNondefiningDeclaration->get_parent() != NULL)
printf (" --- firstNondefiningDeclaration ->get_parent() = %p = %s \n",firstNondefiningDeclaration->get_parent(),firstNondefiningDeclaration->get_parent()->class_name().c_str());
#endif
if (definingDeclaration != NULL && declarationStatement != firstNondefiningDeclaration)
{
#if 0
printf ("Found a nondefining declaration so use the non-defining declaration instead \n");
#endif
// DQ (10/19/2012): Use the defining declaration instead.
// parent = firstNondefiningDeclaration;
parent = definingDeclaration;
}
}
#if 0
printf ("reset: previouslySeenParent = %p = %s \n",previouslySeenParent,previouslySeenParent->class_name().c_str());
#endif
// DQ (10/19/2012): This branch is just to document the cycle that was previously detected, it is for
// debugging only. Thus it ony make sense for it to be executed when "(foundCycle == true)". However,
// this will have to be revisited later since it appears clear that it is a problem for the binary analysis
// work when it is visited for this case. Since the cycle is detected, but there is no assertion on the
// cycle, we don't exit when a cycle is identified (which is the point of the code below).
// Note also that I have fixed the code (above and below) to only chase pointers through defining
// declarations (where they exist), this is important since non-defining declarations can be almost
// anywhere (and thus chasing them can make it appear that there are cycles where there are none
// (I think); test2012_234.C demonstrates an example of this.
// DQ (10/9/2012): Robb has suggested this change to fix the binary analysis work.
// if (foundCycle == true)
if (foundCycle == false)
{
while ( (parent != NULL) && (!dynamic_cast<const NodeType*>(parent)) )
{
ROSE_ASSERT(parent->get_parent() != parent);
#if 0
printf ("In getEnclosingNode() (2nd try): parent = %p = %s \n",parent,parent->class_name().c_str());
if (parent->get_file_info() != NULL)
parent->get_file_info()->display("In getEnclosingNode() (2nd try): debug");
#endif
SgDeclarationStatement* declarationStatement = isSgDeclarationStatement(parent);
if (declarationStatement != NULL)
{
#if DEBUG_GET_ENCLOSING_NODE
printf ("Found a SgDeclarationStatement \n");
#endif
SgDeclarationStatement* definingDeclaration = declarationStatement->get_definingDeclaration();
SgDeclarationStatement* firstNondefiningDeclaration = declarationStatement->get_firstNondefiningDeclaration();
#if 0
printf (" --- declarationStatement = %p = %s \n",declarationStatement,(declarationStatement != NULL) ? declarationStatement->class_name().c_str() : "null");
printf (" --- definingDeclaration = %p \n",definingDeclaration);
if (definingDeclaration != NULL && definingDeclaration->get_parent() != NULL)
printf (" --- definingDeclaration ->get_parent() = %p = %s \n",definingDeclaration->get_parent(),definingDeclaration->get_parent()->class_name().c_str());
printf (" --- firstNondefiningDeclaration = %p \n",firstNondefiningDeclaration);
if (firstNondefiningDeclaration != NULL && firstNondefiningDeclaration->get_parent() != NULL)
printf (" --- firstNondefiningDeclaration ->get_parent() = %p = %s \n",firstNondefiningDeclaration->get_parent(),firstNondefiningDeclaration->get_parent()->class_name().c_str());
#endif
if (definingDeclaration != NULL && declarationStatement != firstNondefiningDeclaration)
{
#if 0
printf ("Found a nondefining declaration so use the firstNondefining declaration instead \n");
#endif
// DQ (10/19/2012): Use the defining declaration instead.
// parent = firstNondefiningDeclaration;
parent = definingDeclaration;
}
}
parent = parent->get_parent();
#if 1
// DQ (3/5/2012): Check for loops that will cause infinite loops.
ROSE_ASSERT(parent != previouslySeenParent);
#else
printf ("WARNING::WARNING::WARNING commented out assertion for parent != previouslySeenParent \n");
if (parent == previouslySeenParent)
break;
#endif
}
}
return const_cast<NodeType*>(dynamic_cast<const NodeType*> (parent));
#else
// DQ (10/20/2012): Using Robb's newer version with my modification to use the definingDeclaration rather than firstNondefiningDeclaration (below).
// Find the parent of specified type, but watch out for cycles in the ancestry (which would cause an infinite loop).
// Cast away const because isSg* functions aren't defined for const node pointers; and our return is not const.
SgNode *node = const_cast<SgNode*>(!astNode || includingSelf ? astNode : astNode->get_parent());
std::set<const SgNode*> seen; // nodes we've seen, in order to detect cycles
while (node) {
if (NodeType *found = dynamic_cast<NodeType*>(node))
return found;
// FIXME: Cycle detection could be moved elsewhere so we don't need to do it on every call. [RPM 2012-10-09]
// DQ (12/30/2019): Provide more detail in error message.
if (seen.insert(node).second == false)
{
printf ("Error: node is already in set and defines a cycle: node = %p = %s \n",node,node->class_name().c_str());
std::set<const SgNode*>::const_iterator i = seen.begin();
while (i != seen.end())
{
const SgNode* element = *i;
printf (" --- seen element: element = %p = %s \n",element,element->class_name().c_str());
i++;
}
printf ("Exiting after error! \n");
ROSE_ASSERT(false);
}
// ROSE_ASSERT(seen.insert(node).second);
// Traverse to parent (declaration statements are a special case)
if (SgDeclarationStatement *declarationStatement = isSgDeclarationStatement(node)) {
SgDeclarationStatement *definingDeclaration = declarationStatement->get_definingDeclaration();
SgDeclarationStatement *firstNondefiningDeclaration = declarationStatement->get_firstNondefiningDeclaration();
if (definingDeclaration && firstNondefiningDeclaration && declarationStatement != firstNondefiningDeclaration) {
// DQ (10/19/2012): Use the defining declaration instead.
// node = firstNondefiningDeclaration;
node = definingDeclaration;
}
} else {
node = node->get_parent();
}
}
return NULL;
#endif
}
//! Find enclosing source file node
ROSE_DLL_API SgSourceFile* getEnclosingSourceFile(SgNode* n, const bool includingSelf=false);
//! Get the closest scope from astNode. Return astNode if it is already a scope.
ROSE_DLL_API SgScopeStatement* getScope(const SgNode* astNode);
//! Get the enclosing scope from a node n
ROSE_DLL_API SgScopeStatement* getEnclosingScope(SgNode* n, const bool includingSelf=false);
//! Traverse back through a node's parents to find the enclosing global scope
ROSE_DLL_API SgGlobal* getGlobalScope( const SgNode* astNode);
//! Find the function definition
ROSE_DLL_API SgFunctionDefinition* getEnclosingProcedure(SgNode* n, const bool includingSelf=false);
ROSE_DLL_API SgFunctionDefinition* getEnclosingFunctionDefinition(SgNode* astNode, const bool includingSelf=false);
//! Find the closest enclosing statement, including the given node
ROSE_DLL_API SgStatement* getEnclosingStatement(SgNode* n);
//! Find the closest switch outside a given statement (normally used for case and default statements)
ROSE_DLL_API SgSwitchStatement* findEnclosingSwitch(SgStatement* s);
//! Find enclosing OpenMP clause body statement from s. If s is already one, return it directly.
ROSE_DLL_API SgOmpClauseBodyStatement* findEnclosingOmpClauseBodyStatement(SgStatement* s);
//! Find the closest loop outside the given statement; if fortranLabel is not empty, the Fortran label of the loop must be equal to it
ROSE_DLL_API SgScopeStatement* findEnclosingLoop(SgStatement* s, const std::string& fortranLabel = "", bool stopOnSwitches = false);
//! Find the enclosing function declaration, including its derived instances like isSgProcedureHeaderStatement, isSgProgramHeaderStatement, and isSgMemberFunctionDeclaration.
ROSE_DLL_API SgFunctionDeclaration * getEnclosingFunctionDeclaration (SgNode * astNode, const bool includingSelf=false);
//roseSupport/utility_functions.h
//! get the SgFile node from current node
ROSE_DLL_API SgFile* getEnclosingFileNode (SgNode* astNode );
//! Get the initializer containing an expression if it is within an initializer.
ROSE_DLL_API SgInitializer* getInitializerOfExpression(SgExpression* n);
//! Get the closest class definition enclosing the specified AST node,
ROSE_DLL_API SgClassDefinition* getEnclosingClassDefinition(SgNode* astnode, const bool includingSelf=false);
//! Get the closest class declaration enclosing the specified AST node,
ROSE_DLL_API SgClassDeclaration* getEnclosingClassDeclaration( SgNode* astNode );
// DQ (2/7/2019): Adding support for name qualification of variable references associated with SgPointerMemberType function parameters.
//! Get the enclosing SgExprListExp (used as part of function argument index evaluation in subexpressions).
ROSE_DLL_API SgExprListExp* getEnclosingExprListExp(SgNode* astNode, const bool includingSelf = false);
// DQ (2/7/2019): Need a function to return when an expression is in an expression subtree.
// This is part of index evaluation ofr expressions in function argument lists, but likely usefule elsewhere as well.
ROSE_DLL_API bool isInSubTree(SgExpression* subtree, SgExpression* exp);
// DQ (2/7/2019): Need a function to return the SgFunctionDeclaration from a SgFunctionCallExp.
ROSE_DLL_API SgFunctionDeclaration* getFunctionDeclaration ( SgFunctionCallExp* functionCallExp );
// DQ (2/17/2019): Generalizing this support for SgVarRefExp and SgMemberFunctionRefExp nodes.
// DQ (2/8/2019): Adding support for detecting when to use added name qualification for pointer-to-member expressions.
ROSE_DLL_API bool isDataMemberReference(SgVarRefExp* varRefExp);
// ROSE_DLL_API bool isAddressTaken(SgVarRefExp* varRefExp);
ROSE_DLL_API bool isAddressTaken(SgExpression* refExp);
// DQ (2/17/2019): Adding support for detecting when to use added name qualification for membr function references.
ROSE_DLL_API bool isMemberFunctionMemberReference(SgMemberFunctionRefExp* memberFunctionRefExp);
// DQ (2/15/2019): Adding support for detecting which class a member reference is being made from.
// ROSE_DLL_API SgClassType* getClassTypeForDataMemberReference(SgVarRefExp* varRefExp);
// ROSE_DLL_API std::list<SgClassType*> getClassTypeChainForDataMemberReference(SgVarRefExp* varRefExp);
ROSE_DLL_API std::list<SgClassType*> getClassTypeChainForMemberReference(SgExpression* refExp);
ROSE_DLL_API std::set<SgNode*> getFrontendSpecificNodes();
// DQ (2/17/2019): Display the shared nodes in the AST for debugging.
ROSE_DLL_API void outputSharedNodes( SgNode* node );
// TODO
#if 0
SgNode * getEnclosingSgNode(SgNode* source,VariantT, SgNode* endNode=NULL);
std::vector<SgNode *> getAllEnclosingSgNode(SgNode* source,VariantT, SgNode* endNode=NULL);
SgVariableDeclaration* findVariableDeclaratin( const string& varname)
SgClassDeclaration* getEnclosingClassDeclaration( const SgNode* astNode);
// e.g. for some expression, find its parent statement
SgStatement* getEnclosingStatement(const SgNode* astNode);
SgSwitchStatement* getEnclosingSwitch(SgStatement* s);
SgModuleStatement* getEnclosingModuleStatement( const SgNode* astNode);
// used to build a variable reference for compiler generated code in current scope
SgSymbol * findReachingDefinition (SgScopeStatement* startScope, SgName &name);
#endif
//@}
//------------------------------------------------------------------------
//@{
/*! @name AST Walk and Traversal
\brief
*/
// Liao, 1/9/2008
/*!
\brief return the first global scope under current project
*/
ROSE_DLL_API SgGlobal * getFirstGlobalScope(SgProject *project);
/*!
\brief get the last statement within a scope, return NULL if it does not exit
*/
ROSE_DLL_API SgStatement* getLastStatement(SgScopeStatement *scope);
//! Get the first statement within a scope, return NULL if it does not exist. Skip compiler-generated statement by default. Count transformation-generated ones, but excluding those which are not to be outputted in unparsers.
ROSE_DLL_API SgStatement* getFirstStatement(SgScopeStatement *scope,bool includingCompilerGenerated=false);
//!Find the first defining function declaration statement in a scope
ROSE_DLL_API SgFunctionDeclaration* findFirstDefiningFunctionDecl(SgScopeStatement* scope);
//! Get next statement within the same scope of current statement
ROSE_DLL_API SgStatement* getNextStatement(SgStatement * currentStmt);
//! Get previous statement of the current statement. It may return a previous statement of a parent scope by default (climbOutScope is true), otherwise only a previous statement of the same scope is returned.
ROSE_DLL_API SgStatement* getPreviousStatement(SgStatement * currentStmt, bool climbOutScope = true);
#if 0 //TODO
// preorder traversal from current SgNode till find next SgNode of type V_SgXXX
SgNode* getNextSgNode( const SgNode* currentNode, VariantT=V_SgNode);
#endif
// DQ (11/15/2018): Adding support for traversals over the include file tree.
//! return path prefix for subtree of include files.
void listHeaderFiles ( SgIncludeFile* includeFile );
//@}
//------------------------------------------------------------------------
//@{
/*! @name AST Comparison
\brief Compare AST nodes, subtree, etc
*/
//! Check if a SgIntVal node has a given value
ROSE_DLL_API bool isEqualToIntConst(SgExpression* e, int value);
//! Check if two function declarations refer to the same one. Two function declarations are the same when they are a) identical, b) same name in C c) same qualified named and mangled name in C++. A nondefining (prototype) declaration and a defining declaration of a same function are treated as the same.
/*!
* There is a similar function bool compareFunctionDeclarations(SgFunctionDeclaration *f1, SgFunctionDeclaration *f2) from Classhierarchy.C
*/
ROSE_DLL_API bool isSameFunction(SgFunctionDeclaration* func1, SgFunctionDeclaration* func2);
//! Check if a statement is the last statement within its closed scope
ROSE_DLL_API bool isLastStatement(SgStatement* stmt);
//@}
//------------------------------------------------------------------------
//@{
/*! @name AST insert, removal, and replacement
\brief Add, remove,and replace AST
scope->append_statement(), exprListExp->append_expression() etc. are not enough to handle side effect of parent pointers, symbol tables, preprocessing info, defining/nondefining pointers etc.
*/
// DQ (2/24/2009): Simple function to delete an AST subtree (used in outlining).
//! Function to delete AST subtree's nodes only, users must take care of any dangling pointers, symbols or types that result.
ROSE_DLL_API void deleteAST(SgNode* node);
//! Special purpose function for deleting AST expression tress containing valid original expression trees in constant folded expressions (for internal use only).
ROSE_DLL_API void deleteExpressionTreeWithOriginalExpressionSubtrees(SgNode* root);
// DQ (2/25/2009): Added new function to support outliner.
//! Move statements in first block to the second block (preserves order and rebuilds the symbol table).
ROSE_DLL_API void moveStatementsBetweenBlocks ( SgBasicBlock* sourceBlock, SgBasicBlock* targetBlock );
//! Move statements in Ada's package into C++ namespace's definition
ROSE_DLL_API void moveStatementsBetweenBlocks ( SgAdaPackageSpec * sourceBlock, SgNamespaceDefinitionStatement* targetBlock );
//! Move a variable declaration to a new scope, handle symbol, special scopes like For loop, etc.
ROSE_DLL_API void moveVariableDeclaration(SgVariableDeclaration* decl, SgScopeStatement* target_scope);
//! Append a statement to the end of the current scope, handle side effect of appending statements, e.g. preprocessing info, defining/nondefining pointers etc.
ROSE_DLL_API void appendStatement(SgStatement *stmt, SgScopeStatement* scope=NULL);
//! Append a statement to the end of SgForInitStatement
ROSE_DLL_API void appendStatement(SgStatement *stmt, SgForInitStatement* for_init_stmt);
//! Append a list of statements to the end of the current scope, handle side effect of appending statements, e.g. preprocessing info, defining/nondefining pointers etc.
ROSE_DLL_API void appendStatementList(const std::vector<SgStatement*>& stmt, SgScopeStatement* scope=NULL);
// DQ (2/6/2009): Added function to support outlining into separate file.
//! Append a copy ('decl') of a function ('original_statement') into a 'scope', include any referenced declarations required if the scope is within a compiler generated file. All referenced declarations, including those from headers, are inserted if excludeHeaderFiles is set to true (the new file will not have any headers).
ROSE_DLL_API void appendStatementWithDependentDeclaration( SgDeclarationStatement* decl, SgGlobal* scope, SgStatement* original_statement, bool excludeHeaderFiles );
//! Prepend a statement to the beginning of the current scope, handling side
//! effects as appropriate
ROSE_DLL_API void prependStatement(SgStatement *stmt, SgScopeStatement* scope=NULL);
//! Prepend a statement to the beginning of SgForInitStatement
ROSE_DLL_API void prependStatement(SgStatement *stmt, SgForInitStatement* for_init_stmt);
//! prepend a list of statements to the beginning of the current scope,
//! handling side effects as appropriate
ROSE_DLL_API void prependStatementList(const std::vector<SgStatement*>& stmt, SgScopeStatement* scope=NULL);
//! Check if a scope statement has a simple children statement list
//! so insert additional statements under the scope is straightforward and unambiguous .
//! for example, SgBasicBlock has a simple statement list while IfStmt does not.
ROSE_DLL_API bool hasSimpleChildrenList (SgScopeStatement* scope);
//! Insert a statement before or after the target statement within the target's scope. Move around preprocessing info automatically
ROSE_DLL_API void insertStatement(SgStatement *targetStmt, SgStatement* newStmt, bool insertBefore= true, bool autoMovePreprocessingInfo = true);
//! Insert a list of statements before or after the target statement within the
//target's scope
ROSE_DLL_API void insertStatementList(SgStatement *targetStmt, const std::vector<SgStatement*>& newStmts, bool insertBefore= true);
//! Insert a statement before a target statement
ROSE_DLL_API void insertStatementBefore(SgStatement *targetStmt, SgStatement* newStmt, bool autoMovePreprocessingInfo = true);
//! Insert a list of statements before a target statement
ROSE_DLL_API void insertStatementListBefore(SgStatement *targetStmt, const std::vector<SgStatement*>& newStmts);
//! Insert a statement after a target statement, Move around preprocessing info automatically by default
ROSE_DLL_API void insertStatementAfter(SgStatement *targetStmt, SgStatement* newStmt, bool autoMovePreprocessingInfo = true);
//! Insert a list of statements after a target statement
ROSE_DLL_API void insertStatementListAfter(SgStatement *targetStmt, const std::vector<SgStatement*>& newStmt);
//! Insert a statement after the last declaration within a scope. The statement will be prepended to the scope if there is no declaration statement found
ROSE_DLL_API void insertStatementAfterLastDeclaration(SgStatement* stmt, SgScopeStatement* scope);
//! Insert a list of statements after the last declaration within a scope. The statement will be prepended to the scope if there is no declaration statement found
ROSE_DLL_API void insertStatementAfterLastDeclaration(std::vector<SgStatement*> stmt_list, SgScopeStatement* scope);
//! Insert a statement before the first non-declaration statement in a scope. If the scope has no non-declaration statements
// then the statement is inserted at the end of the scope.
ROSE_DLL_API void insertStatementBeforeFirstNonDeclaration(SgStatement *newStmt, SgScopeStatement *scope,
bool movePreprocessingInfo=true);
//! Insert statements before the first non-declaration statement in a scope. If the scope has no non-declaration statements
//then the new statements are inserted at the end of the scope.
ROSE_DLL_API void insertStatementListBeforeFirstNonDeclaration(const std::vector<SgStatement*> &newStmts, SgScopeStatement *scope);
// DQ (11/21/2018): We need to sometimes insert something after the last statement of the collection from rose_edg_required_macros_and_functions.h.
ROSE_DLL_API SgStatement* lastFrontEndSpecificStatement( SgGlobal* globalScope );
//! Remove a statement from its attach point of the AST. Automatically keep its associated preprocessing information at the original place after the removal. The statement is still in memory and it is up to the users to decide if the removed one will be inserted somewhere else or released from memory (deleteAST()).
ROSE_DLL_API void removeStatement(SgStatement* stmt, bool autoRelocatePreprocessingInfo = true);
//! Deep delete a sub AST tree. It uses postorder traversal to delete each child node. Users must take care of any dangling pointers, symbols or types that result. This is identical to deleteAST()
ROSE_DLL_API void deepDelete(SgNode* root);
//! Replace a statement with another. Move preprocessing information from oldStmt to newStmt if requested.
ROSE_DLL_API void replaceStatement(SgStatement* oldStmt, SgStatement* newStmt, bool movePreprocessinInfo = false);
//! Replace an anchor node with a specified pattern subtree with optional SgVariantExpression. All SgVariantExpression in the pattern will be replaced with copies of the anchor node.
ROSE_DLL_API SgNode* replaceWithPattern (SgNode * anchor, SgNode* new_pattern);
//! Replace all variable references to an old symbol in a scope to being references to a new symbol.
// Essentially replace variable a with b.
ROSE_DLL_API void replaceVariableReferences(SgVariableSymbol* old_sym, SgVariableSymbol* new_sym, SgScopeStatement * scope );
// DQ (11/12/2018): Adding test to avoid issues that we can't test for in the unparsing of header files using the token based unparsing.
//! If header file unparsing and token-based unparsing are used, then some statements in header files
//! used with the same name and different include syntax can't be transformed. This is currently because
//! there is no way to generally test the resulting transformed code generated by ROSE.
ROSE_DLL_API bool statementCanBeTransformed(SgStatement* stmt);
/** Given an expression, generates a temporary variable whose initializer optionally evaluates
* that expression. Then, the var reference expression returned can be used instead of the original
* expression. The temporary variable created can be reassigned to the expression by the returned SgAssignOp;
* this can be used when the expression the variable represents needs to be evaluated. NOTE: This handles
* reference types correctly by using pointer types for the temporary.
* @param expression Expression which will be replaced by a variable
* @param scope scope in which the temporary variable will be generated
* @param reEvaluate an assignment op to reevaluate the expression. Leave NULL if not needed
* @return declaration of the temporary variable, and a a variable reference expression to use instead of
* the original expression. */
std::pair<SgVariableDeclaration*, SgExpression* > createTempVariableForExpression(SgExpression* expression,
SgScopeStatement* scope, bool initializeInDeclaration, SgAssignOp** reEvaluate = NULL);
/* This function creates a temporary variable for a given expression in the given scope
This is different from SageInterface::createTempVariableForExpression in that it does not
try to be smart to create pointers to reference types and so on. The tempt is initialized to expression.
The caller is responsible for setting the parent of SgVariableDeclaration since buildVariableDeclaration
may not set_parent() when the scope stack is empty. See programTransformation/extractFunctionArgumentsNormalization/ExtractFunctionArguments.C for sample usage.
@param expression Expression which will be replaced by a variable
@param scope scope in which the temporary variable will be generated
*/
std::pair<SgVariableDeclaration*, SgExpression*> createTempVariableAndReferenceForExpression
(SgExpression* expression, SgScopeStatement* scope);
//! Append an argument to SgFunctionParameterList, transparently set parent,scope, and symbols for arguments when possible
/*! We recommend to build SgFunctionParameterList before building a function declaration
However, it is still allowed to append new arguments for existing function declarations.
\todo function type , function symbol also need attention.
*/
ROSE_DLL_API SgVariableSymbol* appendArg(SgFunctionParameterList *, SgInitializedName*);
//!Prepend an argument to SgFunctionParameterList
ROSE_DLL_API SgVariableSymbol* prependArg(SgFunctionParameterList *, SgInitializedName*);
//! Append an expression to a SgExprListExp, set the parent pointer also
ROSE_DLL_API void appendExpression(SgExprListExp *, SgExpression*);
//! Append an expression list to a SgExprListExp, set the parent pointers also
ROSE_DLL_API void appendExpressionList(SgExprListExp *, const std::vector<SgExpression*>&);
//! Set parameter list for a function declaration, considering existing parameter list etc.
template <class actualFunction>
void setParameterList(actualFunction *func,SgFunctionParameterList *paralist) {
// TODO consider the difference between C++ and Fortran
// fixup the scope of arguments,no symbols for nondefining function declaration's arguments
// DQ (11/25/2011): templated function so that we can handle both
// SgFunctionDeclaration and SgTemplateFunctionDeclaration (and their associated member
// function derived classes).
ROSE_ASSERT(func != NULL);
ROSE_ASSERT(paralist != NULL);
#if 0
// At this point we don't have cerr and endl defined, so comment this code out.
// Warn to users if a paralist is being shared
if (paralist->get_parent() !=NULL)
{
cerr << "Waring! Setting a used SgFunctionParameterList to function: "
<< (func->get_name()).getString()<<endl
<< " Sharing parameter lists can corrupt symbol tables!"<<endl
<< " Please use deepCopy() to get an exclusive parameter list for each function declaration!"<<endl;
// ROSE_ASSERT(false);
}
#endif
// Liao,2/5/2008 constructor of SgFunctionDeclaration will automatically generate SgFunctionParameterList, so be cautious when set new paralist!!
if (func->get_parameterList() != NULL)
{
if (func->get_parameterList() != paralist)
{
delete func->get_parameterList();
}
}
func->set_parameterList(paralist);
paralist->set_parent(func);
// DQ (5/15/2012): Need to set the declptr in each SgInitializedName IR node.
// This is needed to support the AST Copy mechanism (at least). The files: test2005_150.C,
// test2012_81.C and testcode2012_82.C demonstrate this problem.
SgInitializedNamePtrList & args = paralist->get_args();
for (SgInitializedNamePtrList::iterator i = args.begin(); i != args.end(); i++)
{
(*i)->set_declptr(func);
}
}
//! Set a pragma of a pragma declaration. handle memory release for preexisting pragma, and set parent pointer.
ROSE_DLL_API void setPragma(SgPragmaDeclaration* decl, SgPragma *pragma);
//! Replace an expression with another, used for variable reference substitution and others. the old expression can be deleted (default case) or kept.
ROSE_DLL_API void replaceExpression(SgExpression* oldExp, SgExpression* newExp, bool keepOldExp=false);
//! Replace a given expression with a list of statements produced by a generator
ROSE_DLL_API void replaceExpressionWithStatement(SgExpression* from,
SageInterface::StatementGenerator* to);
//! Similar to replaceExpressionWithStatement, but with more restrictions.
//! Assumptions: from is not within the test of a loop or ifStmt, not currently traversing from or the statement it is in
ROSE_DLL_API void replaceSubexpressionWithStatement(SgExpression* from,
SageInterface::StatementGenerator* to);
//! Set operands for expressions with single operand, such as unary expressions. handle file info, lvalue, pointer downcasting, parent pointer etc.
ROSE_DLL_API void setOperand(SgExpression* target, SgExpression* operand);
//!set left hand operand for binary expressions, transparently downcasting target expressions when necessary
ROSE_DLL_API void setLhsOperand(SgExpression* target, SgExpression* lhs);
//!set left hand operand for binary expression
ROSE_DLL_API void setRhsOperand(SgExpression* target, SgExpression* rhs);
//! Set original expression trees to NULL for SgValueExp or SgCastExp expressions, so you can change the value and have it unparsed correctly.
ROSE_DLL_API void removeAllOriginalExpressionTrees(SgNode* top);
// DQ (1/25/2010): Added support for directories
//! Move file to be generated in a subdirectory (will be generated by the unparser).
ROSE_DLL_API void moveToSubdirectory ( std::string directoryName, SgFile* file );
//! Supporting function to comment relocation in insertStatement() and removeStatement().
ROSE_DLL_API SgStatement* findSurroundingStatementFromSameFile(SgStatement* targetStmt, bool & surroundingStatementPreceedsTargetStatement);
//! Relocate comments and CPP directives from one statement to another.
ROSE_DLL_API void moveCommentsToNewStatement(SgStatement* sourceStatement, const std::vector<int> & indexList, SgStatement* targetStatement, bool surroundingStatementPreceedsTargetStatement);
// DQ (7/19/2015): This is required to support general unparsing of template instantations for the GNU g++
// compiler which does not permit name qualification to be used to support the expression of the namespace
// where a template instantiatoon would be places. Such name qualification would also sometimes require
// global qualification which is also not allowed by the GNU g++ compiler. These issues appear to be
// specific to the GNU compiler versions, at least versions 4.4 through 4.8.
//! Relocate the declaration to be explicitly represented in its associated namespace (required for some backend compilers to process template instantiations).
ROSE_DLL_API void moveDeclarationToAssociatedNamespace ( SgDeclarationStatement* declarationStatement );
ROSE_DLL_API bool isTemplateInstantiationNode(SgNode* node);
ROSE_DLL_API void wrapAllTemplateInstantiationsInAssociatedNamespaces(SgProject* root);
// DQ (12/1/2015): Adding support for fixup internal data struuctures that have references to statements (e.g. macro expansions).
ROSE_DLL_API void resetInternalMapsForTargetStatement(SgStatement* sourceStatement);
// DQ (6/7/2019): Add support for transforming function definitions to function prototypes in a subtree.
// We might have to make this specific to a file (only traversing the functions in that file).
/*!\brief XXX
* This function operates on the new file used to support outlined function definitions.
* We use a copy of the file where the code will be outlined FROM, so that if there are references to
* declarations in the outlined code we can support the outpiled code with those references. This
* approach has the added advantage of also supporting the same include file tree as the original
* file where the outlined code is being taken from.
*/
ROSE_DLL_API void convertFunctionDefinitionsToFunctionPrototypes(SgNode* node);
// DQ (11/10/2019): Lower level support for convertFunctionDefinitionsToFunctionPrototypes().
ROSE_DLL_API void replaceDefiningFunctionDeclarationWithFunctionPrototype ( SgFunctionDeclaration* functionDeclaration );
ROSE_DLL_API std::vector<SgFunctionDeclaration*> generateFunctionDefinitionsList(SgNode* node);
//@}
//------------------------------------------------------------------------
//@{
/*! @name AST repair, fix, and postprocessing.
\brief Mostly used internally when some AST pieces are built without knowing their target
scope/parent, especially during bottom-up construction of AST. The associated symbols,
parent and scope pointers cannot be set on construction then.
A set of utility functions are provided to
patch up scope, parent, symbol for them when the target scope/parent become know.
*/
//! Connect variable reference to the right variable symbols when feasible, return the number of references being fixed.
/*! In AST translation, it is possible to build a variable reference before the variable
is being declared. buildVarRefExp() will use fake initialized name and symbol as placeholders
to get the work done. Users should call fixVariableReference() when AST is complete and all
variable declarations are in place.
*/
ROSE_DLL_API int fixVariableReferences(SgNode* root, bool cleanUnusedSymbol=true);
//!Patch up symbol, scope, and parent information when a SgVariableDeclaration's scope is known.
/*!
It is possible to build a variable declaration without knowing its scope information during bottom-up construction of AST, though top-down construction is recommended in general.
In this case, we have to patch up symbol table, scope and parent information when the scope is known. This function is usually used internally within appendStatment(), insertStatement().
*/
ROSE_DLL_API void fixVariableDeclaration(SgVariableDeclaration* varDecl, SgScopeStatement* scope);
//! Fix symbols, parent and scope pointers. Used internally within appendStatment(), insertStatement() etc when a struct declaration was built without knowing its target scope.
ROSE_DLL_API void fixStructDeclaration(SgClassDeclaration* structDecl, SgScopeStatement* scope);
//! Fix symbols, parent and scope pointers. Used internally within appendStatment(), insertStatement() etc when a class declaration was built without knowing its target scope.
ROSE_DLL_API void fixClassDeclaration(SgClassDeclaration* classDecl, SgScopeStatement* scope);
//! Fix symbols, parent and scope pointers. Used internally within appendStatment(), insertStatement() etc when a namespace declaration was built without knowing its target scope.
ROSE_DLL_API void fixNamespaceDeclaration(SgNamespaceDeclarationStatement* structDecl, SgScopeStatement* scope);
//! Fix symbol table for SgLabelStatement. Used Internally when the label is built without knowing its target scope. Both parameters cannot be NULL.
ROSE_DLL_API void fixLabelStatement(SgLabelStatement* label_stmt, SgScopeStatement* scope);
//! Set a numerical label for a Fortran statement. The statement should have a enclosing function definition already. SgLabelSymbol and SgLabelRefExp are created transparently as needed.
ROSE_DLL_API void setFortranNumericLabel(SgStatement* stmt, int label_value,
SgLabelSymbol::label_type_enum label_type=SgLabelSymbol::e_start_label_type,
SgScopeStatement* label_scope=NULL);
//! Suggest next usable (non-conflicting) numeric label value for a Fortran function definition scope
ROSE_DLL_API int suggestNextNumericLabel(SgFunctionDefinition* func_def);
//! Fix the symbol table and set scope (only if scope in declaration is not already set).
ROSE_DLL_API void fixFunctionDeclaration(SgFunctionDeclaration* stmt, SgScopeStatement* scope);
//! Fix the symbol table and set scope (only if scope in declaration is not already set).
ROSE_DLL_API void fixTemplateDeclaration(SgTemplateDeclaration* stmt, SgScopeStatement* scope);
//! A wrapper containing fixes (fixVariableDeclaration(),fixStructDeclaration(), fixLabelStatement(), etc) for all kinds statements. Should be used before attaching the statement into AST.
ROSE_DLL_API void fixStatement(SgStatement* stmt, SgScopeStatement* scope);
// DQ (6/11/2015): This reports the statements that are marked as transformed (used to debug the token-based unparsing).
//! This collects the statements that are marked as transformed (useful in debugging).
ROSE_DLL_API std::set<SgStatement*> collectTransformedStatements( SgNode* node );
//! This collects the statements that are marked as modified (a flag automatically set by all set_* generated functions) (useful in debugging).
ROSE_DLL_API std::set<SgStatement*> collectModifiedStatements( SgNode* node );
//! This collects the SgLocatedNodes that are marked as modified (a flag automatically set by all set_* generated functions) (useful in debugging).
ROSE_DLL_API std::set<SgLocatedNode*> collectModifiedLocatedNodes( SgNode* node );
// DQ (6/5/2019): Use the previously constructed set (above) to reset the IR nodes to be marked as isModified.
//! Use the set of IR nodes and set the isModified flag in each IR node to true.
ROSE_DLL_API void resetModifiedLocatedNodes(const std::set<SgLocatedNode*> & modifiedNodeSet);
// DQ (10/23/2018): Report nodes that are marked as modified.
ROSE_DLL_API void reportModifiedStatements(const std::string & label, SgNode* node);
// DQ (3/22/2019): Translate CPP directives from attached preprocessor information to CPP Directive Declaration IR nodes.
ROSE_DLL_API void translateToUseCppDeclarations( SgNode* n );
ROSE_DLL_API void translateScopeToUseCppDeclarations( SgScopeStatement* scope );
ROSE_DLL_API std::vector<SgC_PreprocessorDirectiveStatement*> translateStatementToUseCppDeclarations( SgStatement* statement, SgScopeStatement* scope);
ROSE_DLL_API void printOutComments ( SgLocatedNode* locatedNode );
ROSE_DLL_API bool skipTranslateToUseCppDeclaration( PreprocessingInfo* currentPreprocessingInfo );
// DQ (12/2/2019): Debugging support.
ROSE_DLL_API void outputFileIds( SgNode* node );
//@}
//! Update defining and nondefining links due to a newly introduced function declaration. Should be used after inserting the function into a scope.
/*! This function not only set the defining and nondefining links of the newly introduced
* function declaration inside a scope, but also update other same function declarations' links
* accordingly if there are any.
* Assumption: The function has already inserted/appended/prepended into the scope before calling this function.
*/
ROSE_DLL_API void updateDefiningNondefiningLinks(SgFunctionDeclaration* func, SgScopeStatement* scope);
//------------------------------------------------------------------------
//@{
/*! @name Advanced AST transformations, analyses, and optimizations
\brief Some complex but commonly used AST transformations.
*/
//! Collect all read and write references within stmt, which can be a function, a scope statement, or a single statement. Note that a reference can be both read and written, like i++
ROSE_DLL_API bool
collectReadWriteRefs(SgStatement* stmt, std::vector<SgNode*>& readRefs, std::vector<SgNode*>& writeRefs, bool useCachedDefUse=false);
//!Collect unique variables which are read or written within a statement. Note that a variable can be both read and written. The statement can be either of a function, a scope, or a single line statement. For accesses to members of aggregate data, we return the coarse grain aggregate mem obj by default.
ROSE_DLL_API bool collectReadWriteVariables(SgStatement* stmt, std::set<SgInitializedName*>& readVars, std::set<SgInitializedName*>& writeVars, bool coarseGrain=true);
//!Collect read only variables within a statement. The statement can be either of a function, a scope, or a single line statement. For accesses to members of aggregate data, we return the coarse grain aggregate mem obj by default.
ROSE_DLL_API void collectReadOnlyVariables(SgStatement* stmt, std::set<SgInitializedName*>& readOnlyVars, bool coarseGrain=true);
//!Collect read only variable symbols within a statement. The statement can be either of a function, a scope, or a single line statement. For accesses to members of aggregate data, we return the coarse grain aggregate mem obj by default.
ROSE_DLL_API void collectReadOnlySymbols(SgStatement* stmt, std::set<SgVariableSymbol*>& readOnlySymbols, bool coarseGrain=true);
//! Check if a variable reference is used by its address: including &a expression and foo(a) when type2 foo(Type& parameter) in C++
ROSE_DLL_API bool isUseByAddressVariableRef(SgVarRefExp* ref);
//! Collect variable references involving use by address: including &a expression and foo(a) when type2 foo(Type& parameter) in C++
ROSE_DLL_API void collectUseByAddressVariableRefs (const SgStatement* s, std::set<SgVarRefExp* >& varSetB);
#ifndef ROSE_USE_INTERNAL_FRONTEND_DEVELOPMENT
//!Call liveness analysis on an entire project
ROSE_DLL_API LivenessAnalysis * call_liveness_analysis(SgProject* project, bool debug=false);
//!get liveIn and liveOut variables for a for loop from liveness analysis result liv.
ROSE_DLL_API void getLiveVariables(LivenessAnalysis * liv, SgForStatement* loop, std::set<SgInitializedName*>& liveIns, std::set<SgInitializedName*> & liveOuts);
#endif
//!Recognize and collect reduction variables and operations within a C/C++ loop, following OpenMP 3.0 specification for allowed reduction variable types and operation types.
ROSE_DLL_API void ReductionRecognition(SgForStatement* loop, std::set< std::pair <SgInitializedName*, OmpSupport::omp_construct_enum> > & results);
//! Constant folding an AST subtree rooted at 'r' (replacing its children with their constant values, if applicable). Please be advised that constant folding on floating point computation may decrease the accuracy of floating point computations!
/*! It is a wrapper function for ConstantFolding::constantFoldingOptimization(). Note that only r's children are replaced with their corresponding constant values, not the input SgNode r itself. You have to call this upon an expression's parent node if you want to fold the expression. */
ROSE_DLL_API void constantFolding(SgNode* r);
//!Instrument(Add a statement, often a function call) into a function right before the return points, handle multiple return statements (with duplicated statement s) and return expressions with side effects. Return the number of statements inserted.
/*! Useful when adding a runtime library call to terminate the runtime system right before the end of a program, especially for OpenMP and UPC runtime systems. Return with complex expressions with side effects are rewritten using an additional assignment statement.
*/
ROSE_DLL_API int instrumentEndOfFunction(SgFunctionDeclaration * func, SgStatement* s);
//! Remove jumps whose label is immediately after the jump. Used to clean up inlined code fragments.
ROSE_DLL_API void removeJumpsToNextStatement(SgNode*);
//! Remove labels which are not targets of any goto statements
ROSE_DLL_API void removeUnusedLabels(SgNode* top);
//! Remove consecutive labels
ROSE_DLL_API void removeConsecutiveLabels(SgNode* top);
//! Merge a variable assignment statement into a matching variable declaration statement. Callers should make sure the merge is semantically correct (by not introducing compilation errors). This function simply does the merge transformation, without eligibility check.
/*!
* e.g. int i; i=10; becomes int i=10; the original i=10 will be deleted after the merge
* if success, return true, otherwise return false (e.g. variable declaration does not match or already has an initializer)
* The original assignment stmt will be removed by default
* This function is a bit ambiguous about the merge direction, to be phased out.
*/
ROSE_DLL_API bool mergeDeclarationAndAssignment (SgVariableDeclaration* decl, SgExprStatement* assign_stmt, bool removeAssignStmt = true);
//! Merge an assignment into its upstream declaration statement. Callers should make sure the merge is semantically correct.
ROSE_DLL_API bool mergeAssignmentWithDeclaration (SgExprStatement* assign_stmt, SgVariableDeclaration* decl, bool removeAssignStmt = true);
//! Merge a declaration statement into a matching followed variable assignment. Callers should make sure the merge is semantically correct (by not introducing compilation errors). This function simply does the merge transformation, without eligibility check.
/*!
* e.g. int i; i=10; becomes int i=10; the original int i; will be deleted after the merge
*/
ROSE_DLL_API bool mergeDeclarationWithAssignment (SgVariableDeclaration* decl, SgExprStatement* assign_stmt);
//! Split a variable declaration with an rhs assignment into two statements: a declaration and an assignment.
/*! Return the generated assignment statement, if any
* e.g. int i =10; becomes int i; i=10;
* This can be seen as a normalization of declarations
*/
ROSE_DLL_API SgExprStatement* splitVariableDeclaration (SgVariableDeclaration* decl);
//! Split declarations within a scope into declarations and assignment statements, by default only top level declarations are considered. Return the number of declarations split.
ROSE_DLL_API int splitVariableDeclaration (SgScopeStatement* scope, bool topLevelOnly = true);
//! Replace an expression with a temporary variable and an assignment statement
/*!
Add a new temporary variable to contain the value of 'from'.
Change reference to 'from' to use this new variable.
Assumptions: (1)'from' is not within the test of a loop or 'if';
(2)not currently traversing 'from' or the statement it is in.
Return value: the new temp variable declaration's assign initializer containing the from expression.
*/
ROSE_DLL_API SgAssignInitializer* splitExpression(SgExpression* from, std::string newName = "");
//! Split long expressions into blocks of statements
ROSE_DLL_API void splitExpressionIntoBasicBlock(SgExpression* expr);
//! Remove labeled goto statements
ROSE_DLL_API void removeLabeledGotos(SgNode* top);
//! If the given statement contains any break statements in its body, add a new label below the statement and change the breaks into gotos to that new label.
ROSE_DLL_API void changeBreakStatementsToGotos(SgStatement* loopOrSwitch);
//! Check if the body of a 'for' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfFor(SgForStatement* fs);
//! Check if the body of a 'upc_forall' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfUpcForAll(SgUpcForAllStatement* fs);
//! Check if the body of a 'while' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfWhile(SgWhileStmt* ws);
//! Check if the body of a 'do .. while' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfDoWhile(SgDoWhileStmt* ws);
//! Check if the body of a 'switch' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfSwitch(SgSwitchStatement* ws);
//! Check if the body of a 'case option' statement is a SgBasicBlock, create one if not.
SgBasicBlock* ensureBasicBlockAsBodyOfCaseOption(SgCaseOptionStmt* cs);
//! Check if the body of a 'default option' statement is a SgBasicBlock, create one if not.
SgBasicBlock* ensureBasicBlockAsBodyOfDefaultOption(SgDefaultOptionStmt * cs);
//! Check if the true body of a 'if' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsTrueBodyOfIf(SgIfStmt* ifs);
//! Check if the false body of a 'if' statement is a SgBasicBlock, create one if not when the flag is true.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsFalseBodyOfIf(SgIfStmt* ifs, bool createEmptyBody = true);
//! Check if the body of a 'catch' statement is a SgBasicBlock, create one if not.
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfCatch(SgCatchOptionStmt* cos);
//! Check if the body of a SgOmpBodyStatement is a SgBasicBlock, create one if not
ROSE_DLL_API SgBasicBlock* ensureBasicBlockAsBodyOfOmpBodyStmt(SgOmpBodyStatement* ompbodyStmt);
// DQ (1/18/2015): This is added to support better quality token-based unparsing.
//! Remove unused basic block IR nodes added as part of normalization.
ROSE_DLL_API void cleanupNontransformedBasicBlockNode();
// DQ (1/18/2015): This is added to support better quality token-based unparsing.
//! Record where normalization have been done so that we can preform denormalizations as required for the token-based unparsing to generate minimal diffs.
ROSE_DLL_API void recordNormalizations(SgStatement* s);
//! Check if a statement is a (true or false) body of a container-like parent, such as For, Upc_forall, Do-while,
//! switch, If, Catch, OmpBodyStmt, etc
bool isBodyStatement (SgStatement* s);
//! Fix up ifs, loops, while, switch, Catch, OmpBodyStatement, etc. to have blocks as body components. It also adds an empty else body to if statements that don't have them.
void changeAllBodiesToBlocks(SgNode* top, bool createEmptyBody = true);
// The same as changeAllBodiesToBlocks(SgNode* top). Phased out.
//void changeAllLoopBodiesToBlocks(SgNode* top);
//! Make a single statement body to be a basic block. Its parent is if, while, catch, or upc_forall etc.
SgBasicBlock * makeSingleStatementBodyToBlock(SgStatement* singleStmt);
#if 0
/** If s is the body of a loop, catch, or if statement and is already a basic block,
* s is returned unmodified. Otherwise generate a SgBasicBlock between s and its parent
* (a loop, catch, or if statement, etc). */
SgLocatedNode* ensureBasicBlockAsParent(SgStatement* s);
#endif
//! Get the constant value from a constant integer expression; abort on
//! everything else. Note that signed long longs are converted to unsigned.
unsigned long long getIntegerConstantValue(SgValueExp* expr);
//! Get a statement's dependent declarations which declares the types used in the statement. The returned vector of declaration statements are sorted according to their appearance order in the original AST. Any reference to a class or template class from a namespace will treated as a reference to the enclosing namespace.
std::vector<SgDeclarationStatement*> getDependentDeclarations (SgStatement* stmt );
//! Insert an expression (new_exp )before another expression (anchor_exp) has possible side effects, without changing the original semantics. This is achieved by using a comma operator: (new_exp, anchor_exp). The comma operator is returned.
SgCommaOpExp *insertBeforeUsingCommaOp (SgExpression* new_exp, SgExpression* anchor_exp);
//! Insert an expression (new_exp ) after another expression (anchor_exp) has possible side effects, without changing the original semantics. This is done by using two comma operators: type T1; ... ((T1 = anchor_exp, new_exp),T1) )... , where T1 is a temp variable saving the possible side effect of anchor_exp. The top level comma op exp is returned. The reference to T1 in T1 = anchor_exp is saved in temp_ref.
SgCommaOpExp *insertAfterUsingCommaOp (SgExpression* new_exp, SgExpression* anchor_exp, SgStatement** temp_decl = NULL, SgVarRefExp** temp_ref = NULL);
/// \brief moves the body of a function f to a new function f`;
/// f's body is replaced with code that forwards the call to f`.
/// \return a pair indicating the statement containing the call of f`
/// and an initialized name refering to the temporary variable
/// holding the result of f`. In case f returns void
/// the initialized name is NULL.
/// \param definingDeclaration the defining function declaration of f
/// \param newName the name of function f`
/// \details f's new body becomes { f`(...); } and { int res = f`(...); return res; }
/// for functions returning void and a value, respectively.
/// two function declarations are inserted in f's enclosing scope
/// \code
/// result_type f`(...); <--- (1)
/// result_type f (...) { forward call to f` }
/// result_type f`(...) { original code } <--- (2)
/// \endcode
/// Calls to f are not updated, thus in the transformed code all
/// calls will continue calling f (this is also true for
/// recursive function calls from within the body of f`).
/// After the function has created the wrapper,
/// definingDeclaration becomes the wrapper function
/// The definition of f` is the next entry in the
/// statement list; the forward declaration of f` is the previous
/// entry in the statement list.
/// \pre definingDeclaration must be a defining declaration of a
/// free standing function.
/// typeid(SgFunctionDeclaration) == typeid(definingDeclaration)
/// i.e., this function is NOT implemented for class member functions,
/// template functions, procedures, etc.
std::pair<SgStatement*, SgInitializedName*>
wrapFunction(SgFunctionDeclaration& definingDeclaration, SgName newName);
/// \overload
/// \tparam NameGen functor that generates a new name based on the old name.
/// interface: SgName nameGen(const SgName&)
/// \param nameGen name generator
/// \brief see wrapFunction for details
template <class NameGen>
std::pair<SgStatement*, SgInitializedName*>
wrapFunction(SgFunctionDeclaration& definingDeclaration, NameGen nameGen)
{
return wrapFunction(definingDeclaration, nameGen(definingDeclaration.get_name()));
}
/// \brief convenience function that returns the first initialized name in a
/// list of variable declarations.
SgInitializedName& getFirstVariable(SgVariableDeclaration& vardecl);
//@}
// DQ (6/7/2012): Unclear where this function should go...
bool hasTemplateSyntax( const SgName & name );
#if 0
//------------------------AST dump, stringify-----------------------------
//------------------------------------------------------------------------
std::string buildOperatorString ( SgNode* astNode ); //transformationSupport.h
// do we need these?
std::string dump_node(const SgNode* astNode);
std::string dump_tree(const SgNode* astNode);
// or a friendly version of unparseToString(), as a memeber function
std::string SgNode::toString(bool asSubTree=true); // dump node or subtree
//----------------------------AST comparison------------------------------
//------------------------------------------------------------------------
// How to get generic functions for comparison?
bool isNodeEqual(SgNode* node1, SgNode* node2); //?
bool isTreeEqual(SgNode* tree1, SgNode* tree2);
//! Are two expressions equal (using a deep comparison)?
bool expressionTreeEqual(SgExpression*, SgExpression*);
//! Are corresponding expressions in two lists equal (using a deep comparison)?
bool expressionTreeEqualStar(const SgExpressionPtrList&,
const SgExpressionPtrList&);
//----------------------AST verfication/repair----------------------------
//------------------------------------------------------------------------
// sanity check of AST subtree, any suggestions?
// TODO
verifySgNode(SgNode* node, bool subTree=true);
//src/midend/astDiagnostics/AstConsistencyTests.h
// AstTests::runAllTests(SgProject * )
//src/midend/astUtil/astInterface/AstInterface.h.C
//FixSgProject(SgProject &project)
//FixSgTree(SgNode* r)
//src/frontend/SageIII/astPostProcessing
//AstPostProcessing(SgNode * node)
//--------------------------AST modification------------------------------
//------------------------------------------------------------------------
// any operations changing AST tree, including
// insert, copy, delete(remove), replace
// insert before or after some point, argument list is consistent with LowLevelRewrite
void insertAst(SgNode* targetPosition, SgNode* newNode, bool insertBefore=true);
// previous examples
//void myStatementInsert(SgStatement* target,...)
// void AstInterfaceBase::InsertStmt(AstNodePtr const & orig, AstNodePtr const &n, bool insertbefore, bool extractfromBasicBlock)
// copy
// copy children of one basic block to another basic block
//void appendStatementCopy (const SgBasicBlock* a, SgBasicBlock* b);
void copyStatements (const SgBasicBlock* src, SgBasicBlock* dst);
// delete (remove) a node or a whole subtree
void removeSgNode(SgNode* targetNode); // need this?
void removeSgNodeTree(SgNode* subtree); // need this?
void removeStatement( SgStatement* targetStmt);
//Move = delete + insert
void moveAst (SgNode* src, SgNode* target); // need this?
// similar to
void moveStatements (SgBasicBlock* src, SgBasicBlock* target);
// replace= delete old + insert new (via building or copying)
// DQ (1/25/2010): This does not appear to exist as a definition anywhere in ROSE.
// void replaceAst(SgNode* oldNode, SgNode* newNode);
//void replaceChild(SgNode* parent, SgNode* from, SgNode* to);
//bool AstInterface::ReplaceAst( const AstNodePtr& orig, const AstNodePtr& n)
//--------------------------AST transformations---------------------------
//------------------------------------------------------------------------
// Advanced AST modifications through basic AST modifications
// Might not be included in AST utitlity list, but listed here for the record.
// extract statements/content from a scope
void flattenBlocks(SgNode* n);
//src/midend/astInlining/inlinerSupport.h
void renameVariables(SgNode* n);
void renameLabels(SgNode* n, SgFunctionDefinition* enclosingFunctionDefinition);
void simpleCopyAndConstantPropagation(SgNode* top);
void changeAllMembersToPublic(SgNode* n);
void removeVariableDeclaration(SgInitializedName* initname);
//! Convert something like "int a = foo();" into "int a; a = foo();"
SgAssignOp* convertInitializerIntoAssignment(SgAssignInitializer* init);
//! Rewrites a while or for loop so that the official test is changed to
//! "true" and what had previously been the test is now an if-break
//! combination (with an inverted condition) at the beginning of the loop
//! body
void pushTestIntoBody(LoopStatement* loopStmt);
//programTransformation/finiteDifferencing/finiteDifferencing.h
//! Move variables declared in a for statement to just outside that statement.
void moveForDeclaredVariables(SgNode* root);
//------------------------ Is/Has functions ------------------------------
//------------------------------------------------------------------------
// misc. boolean functions
// some of them could moved to SgXXX class as a member function
bool isOverloaded (SgFunctionDeclaration * functionDeclaration);
bool isSwitchCond (const SgStatement* s);
bool isIfCond (const SgStatement* s);
bool isWhileCond (const SgStatement* s);
bool isStdNamespace (const SgScopeStatement* scope);
bool isTemplateInst (const SgDeclarationStatement* decl);
bool isCtor (const SgFunctionDeclaration* func);
bool isDtor (const SgFunctionDeclaration* func);
// src/midend/astInlining/typeTraits.h
bool hasTrivialDestructor(SgType* t);
ROSE_DLL_API bool isNonconstReference(SgType* t);
ROSE_DLL_API bool isReferenceType(SgType* t);
// generic ones, or move to the SgXXX class as a member function
bool isConst(SgNode* node); // const type, variable, function, etc.
// .... and more
bool isConstType (const SgType* type);
bool isConstFunction (const SgFunctionDeclaration* decl);
bool isMemberVariable(const SgInitializedName & var);
//bool isMemberVariable(const SgNode& in);
bool isPrototypeInScope (SgScopeStatement * scope,
SgFunctionDeclaration * functionDeclaration,
SgDeclarationStatement * startingAtDeclaration);
bool MayRedefined(SgExpression* expr, SgNode* root);
// bool isPotentiallyModified(SgExpression* expr, SgNode* root); // inlinderSupport.h
bool hasAddressTaken(SgExpression* expr, SgNode* root);
//src/midend/astInlining/inlinerSupport.C
// can also classified as topdown search
bool containsVariableReference(SgNode* root, SgInitializedName* var);
bool isDeclarationOf(SgVariableDeclaration* decl, SgInitializedName* var);
bool isPotentiallyModifiedDuringLifeOf(SgBasicBlock* sc,
SgInitializedName* toCheck,
SgInitializedName* lifetime)
//src/midend/programTransformation/partialRedundancyElimination/pre.h
bool anyOfListPotentiallyModifiedIn(const std::vector<SgVariableSymbol*>& syms, SgNode* n);
//------------------------ loop handling ---------------------------------
//------------------------------------------------------------------------
//get and set loop control expressions
// 0: init expr, 1: condition expr, 2: stride expr
SgExpression* getForLoopTripleValues(int valuetype,SgForStatement* forstmt );
int setForLoopTripleValues(int valuetype,SgForStatement* forstmt, SgExpression* exp);
bool isLoopIndexVarRef(SgForStatement* forstmt, SgVarRefExp *varref);
SgInitializedName * getLoopIndexVar(SgForStatement* forstmt);
//------------------------expressions-------------------------------------
//------------------------------------------------------------------------
//src/midend/programTransformation/partialRedundancyElimination/pre.h
int countComputationsOfExpressionIn(SgExpression* expr, SgNode* root);
//src/midend/astInlining/replaceExpressionWithStatement.h
void replaceAssignmentStmtWithStatement(SgExprStatement* from, StatementGenerator* to);
void replaceSubexpressionWithStatement(SgExpression* from,
StatementGenerator* to);
SgExpression* getRootOfExpression(SgExpression* n);
//--------------------------preprocessing info. -------------------------
//------------------------------------------------------------------------
//! Removes all preprocessing information at a given position.
void cutPreprocInfo (SgBasicBlock* b,
PreprocessingInfo::RelativePositionType pos,
AttachedPreprocessingInfoType& save_buf);
//! Pastes preprocessing information at the front of a statement.
void pastePreprocInfoFront (AttachedPreprocessingInfoType& save_buf,
SgStatement* s);
//! Pastes preprocessing information at the back of a statement.
void pastePreprocInfoBack (AttachedPreprocessingInfoType& save_buf,
SgStatement* s);
/*!
* \brief Moves 'before' preprocessing information.
* Moves all preprocessing information attached 'before' the source
* statement to the front of the destination statement.
*/
// a generic one for all
/// void movePreprocessingInfo(src, dest, RelativePositionType);
void moveBeforePreprocInfo (SgStatement* src, SgStatement* dest);
void moveInsidePreprocInfo (SgBasicBlock* src, SgBasicBlock* dest);
void moveAfterPreprocInfo (SgStatement* src, SgStatement* dest);
//--------------------------------operator--------------------------------
//------------------------------------------------------------------------
from transformationSupport.h, not sure if they should be included here
/* return enum code for SAGE operators */
operatorCodeType classifyOverloadedOperator(); // transformationSupport.h
/*! \brief generates a source code string from operator name.
This function returns a string representing the elementwise operator (for primative types)
that would be match that associated with the overloaded operator for a user-defined
abstractions (e.g. identifyOperator("operator+()") returns "+").
*/
std::string stringifyOperator (std::string name);
//--------------------------------macro ----------------------------------
//------------------------------------------------------------------------
std::string buildMacro ( std::string s ); //transformationSupport.h
//--------------------------------access functions---------------------------
//----------------------------------get/set sth.-----------------------------
// several categories:
* get/set a direct child/grandchild node or fields
* get/set a property flag value
* get a descendent child node using preorder searching
* get an ancestor node using bottomup/reverse searching
// SgName or string?
std::string getFunctionName (SgFunctionCallExp* functionCallExp);
std::string getFunctionTypeName ( SgFunctionCallExp* functionCallExpression );
// do we need them anymore? or existing member functions are enought?
// a generic one:
std::string get_name (const SgNode* node);
std::string get_name (const SgDeclarationStatement * declaration);
// get/set some property: should moved to SgXXX as an inherent memeber function?
// access modifier
void setExtern (SgFunctionDeclartion*)
void clearExtern()
// similarly for other declarations and other properties
void setExtern (SgVariableDeclaration*)
void setPublic()
void setPrivate()
#endif
// DQ (1/23/2013): Added support for generated a set of source sequence entries.
std::set<unsigned int> collectSourceSequenceNumbers( SgNode* astNode );
//--------------------------------Type Traits (C++)---------------------------
bool HasNoThrowAssign(const SgType * const inputType);
bool HasNoThrowCopy(const SgType * const inputType);
bool HasNoThrowConstructor(const SgType * const inputType);
bool HasTrivialAssign(const SgType * const inputType);
bool HasTrivialCopy(const SgType * const inputType);
bool HasTrivialConstructor(const SgType * const inputType);
bool HasTrivialDestructor(const SgType * const inputType);
bool HasVirtualDestructor(const SgType * const inputType);
bool IsBaseOf(const SgType * const inputBaseType, const SgType * const inputDerivedType);
bool IsAbstract(const SgType * const inputType);
bool IsClass(const SgType * const inputType);
bool IsEmpty(const SgType * const inputType);
bool IsEnum(const SgType * const inputType);
bool IsPod(const SgType * const inputType);
bool IsPolymorphic(const SgType * const inputType);
bool IsStandardLayout(const SgType * const inputType);
bool IsLiteralType(const SgType * const inputType);
bool IsTrivial(const SgType * const inputType);
bool IsUnion(const SgType * const inputType);
SgType * UnderlyingType(SgType *type);
// DQ (3/2/2014): Added a new interface function (used in the snippet insertion support).
// void supportForInitializedNameLists ( SgScopeStatement* scope, SgInitializedNamePtrList & variableList );
// DQ (3/4/2014): Added support for testing two trees for equivalents using the AST iterators.
bool isStructurallyEquivalentAST( SgNode* tree1, SgNode* tree2 );
// JP (10/14/24): Moved code to evaluate a const integer expression (like in array size definitions) to SageInterface
/*! The datastructure is used as the return type for SageInterface::evaluateConstIntegerExpression(). One needs to always check whether hasValue_ is true before accessing value_ */
struct const_int_expr_t {
size_t value_;
bool hasValue_;
};
/*! \brief The function tries to evaluate const integer expressions (such as are used in array dimension sizes). It follows variable symbols, and requires constness. */
struct const_int_expr_t evaluateConstIntegerExpression(SgExpression *expr);
// JP (9/17/14): Added function to test whether two SgType* are equivalent or not
bool checkTypesAreEqual(SgType *typeA, SgType *typeB);
//--------------------------------Java interface functions ---------------------
#ifdef ROSE_BUILD_JAVA_LANGUAGE_SUPPORT
ROSE_DLL_API std::string getTempDirectory(SgProject *project);
ROSE_DLL_API void destroyTempDirectory(std::string);
ROSE_DLL_API SgFile *processFile(SgProject *, std::string, bool unparse = false);
ROSE_DLL_API std::string preprocessPackage(SgProject *, std::string);
ROSE_DLL_API std::string preprocessImport(SgProject *, std::string);
ROSE_DLL_API SgFile* preprocessCompilationUnit(SgProject *, std::string, std::string, bool unparse = true);
ROSE_DLL_API SgClassDefinition *findJavaPackage(SgScopeStatement *, std::string);
ROSE_DLL_API SgClassDefinition *findOrInsertJavaPackage(SgProject *, std::string, bool create_directory = false);
ROSE_DLL_API SgClassDeclaration *findOrImportJavaClass(SgProject *, SgClassDefinition *package_definition, std::string);
ROSE_DLL_API SgClassDeclaration *findOrImportJavaClass(SgProject *, std::string, std::string);
ROSE_DLL_API SgClassDeclaration *findOrImportJavaClass(SgProject *, SgClassType *);
ROSE_DLL_API SgMemberFunctionDeclaration *findJavaMain(SgClassDefinition *);
ROSE_DLL_API SgMemberFunctionDeclaration *findJavaMain(SgClassType *);
#endif // ROSE_BUILD_JAVA_LANGUAGE_SUPPORT
// DQ (8/31/2016): Making this a template function so that we can have it work with user defined filters.
//! This function detects template instantiations that are relevant when filters are used.
/*!
EDG normalizes some in-class template functions and member functions to be redefined outside of a class. this causes the associated template instantiations
to be declared outside of the class, and to be marked as compiler generated (since the compiler generated form outside of the class declaration).
ROSE captures the function definitions, but in the new location (defined outside of the class declaration). This can confuse some simple tests
for template instantiations that are a part of definitions in a file, thus we have this function to detect this specific normalization.
*/
template < class T >
bool isTemplateInstantiationFromTemplateDeclarationSatisfyingFilter (SgFunctionDeclaration* function, T* filter )
{
// DQ (9/1/2016): This function is called in the Call graph generation to avoid filtering out EDG normalized
// function template instnatiations (which come from normalized template functions and member functions).
// Note that because of the EDG normailzation the membr function is moved outside of the class, and
// thus marked as compiler generated. However the template instantiations are always marked as compiler
// generated (if not specializations) and so we want to include a template instantiation that is marked
// as compiler generated, but is from a template declaration that satisfyied a specific user defined filter.
// The complexity of this detection is isolated here, but knowing that it must be called is more complex.
// This function is call in the CG.C file of tests/nonsmoke/functional/roseTests/programAnalysisTests/testCallGraphAnalysis.
bool retval = false;
#define DEBUG_TEMPLATE_NORMALIZATION_DETECTION 0
#if DEBUG_TEMPLATE_NORMALIZATION_DETECTION
printf ("In isNormalizedTemplateInstantiation(): function = %p = %s = %s \n",function,function->class_name().c_str(),function->get_name().str());
#endif
// Test for this to be a template instantation (in which case it was marked as
// compiler generated but we may want to allow it to be used in the call graph,
// if it's template was a part was defined in the current directory).
SgTemplateInstantiationFunctionDecl* templateInstantiationFunction = isSgTemplateInstantiationFunctionDecl(function);
SgTemplateInstantiationMemberFunctionDecl* templateInstantiationMemberFunction = isSgTemplateInstantiationMemberFunctionDecl(function);
if (templateInstantiationFunction != NULL)
{
// When the defining function has been normalized by EDG, only the non-defining declaration will have a source position.
templateInstantiationFunction = isSgTemplateInstantiationFunctionDecl(templateInstantiationFunction->get_firstNondefiningDeclaration());
SgTemplateFunctionDeclaration* templateFunctionDeclaration = templateInstantiationFunction->get_templateDeclaration();
if (templateFunctionDeclaration != NULL)
{
retval = filter->operator()(templateFunctionDeclaration);
}
else
{
// Assume false.
}
#if DEBUG_TEMPLATE_NORMALIZATION_DETECTION
printf (" --- case of templateInstantiationFunction: retval = %s \n",retval ? "true" : "false");
#endif
}
else
{
if (templateInstantiationMemberFunction != NULL)
{
// When the defining function has been normalized by EDG, only the non-defining declaration will have a source position.
templateInstantiationMemberFunction = isSgTemplateInstantiationMemberFunctionDecl(templateInstantiationMemberFunction->get_firstNondefiningDeclaration());
SgTemplateMemberFunctionDeclaration* templateMemberFunctionDeclaration = templateInstantiationMemberFunction->get_templateDeclaration();
if (templateMemberFunctionDeclaration != NULL)
{
retval = filter->operator()(templateMemberFunctionDeclaration);
}
else
{
// Assume false.
}
#if DEBUG_TEMPLATE_NORMALIZATION_DETECTION
printf (" --- case of templateInstantiationMemberFunction: retval = %s \n",retval ? "true" : "false");
#endif
}
}
return retval;
}
void detectCycleInType(SgType * type, const std::string & from);
// DQ (7/14/2020): Debugging support.
void checkForInitializers( SgNode* node );
}// end of namespace
#endif
|
GB_binop__second_int8.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__second_int8)
// A.*B function (eWiseMult): GB (_AemultB_08__second_int8)
// A.*B function (eWiseMult): GB (_AemultB_02__second_int8)
// A.*B function (eWiseMult): GB (_AemultB_04__second_int8)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__second_int8)
// A*D function (colscale): GB (_AxD__second_int8)
// D*A function (rowscale): GB (_DxB__second_int8)
// C+=B function (dense accum): GB (_Cdense_accumB__second_int8)
// C+=b function (dense accum): GB (_Cdense_accumb__second_int8)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__second_int8)
// C=scalar+B GB ((none))
// C=scalar+B' GB ((none))
// C=A+scalar GB ((none))
// C=A'+scalar GB ((none))
// C type: int8_t
// A type: int8_t
// B,b type: int8_t
// BinaryOp: cij = bij
#define GB_ATYPE \
int8_t
#define GB_BTYPE \
int8_t
#define GB_CTYPE \
int8_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
;
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
int8_t bij = GBX (Bx, pB, B_iso)
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
int8_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = y ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
0
// op is second
#define GB_OP_IS_SECOND \
1
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_SECOND || GxB_NO_INT8 || GxB_NO_SECOND_INT8)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_ewise3_noaccum__second_int8)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__second_int8)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__second_int8)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type int8_t
int8_t bwork = (*((int8_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_AxD__second_int8)
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int8_t *restrict Cx = (int8_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_DxB__second_int8)
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int8_t *restrict Cx = (int8_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__second_int8)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
#include "GB_add_template.c"
GB_FREE_WORK ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__second_int8)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__second_int8)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__second_int8)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__second_int8)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int8_t *Cx = (int8_t *) Cx_output ;
int8_t x = (*((int8_t *) x_input)) ;
int8_t *Bx = (int8_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
int8_t bij = GBX (Bx, p, false) ;
Cx [p] = bij ;
}
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
int8_t *Cx = (int8_t *) Cx_output ;
int8_t *Ax = (int8_t *) Ax_input ;
int8_t y = (*((int8_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
; ;
Cx [p] = y ;
}
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
#if 0
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
int8_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = aij ; \
}
GrB_Info GB ((none))
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
int8_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int8_t x = (*((const int8_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
int8_t
}
#endif
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
#if 0
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
; ; \
Cx [pC] = y ; \
}
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int8_t y = (*((const int8_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
#endif
|
rose_taskyield.c | #include <omp.h>
#include "libxomp.h"
void something_useful();
void something_critical();
void foo(omp_lock_t *lock,int n)
{
int i;
for (i = 0; i < n; i++) {
something_useful();
while(!omp_test_lock(lock)){
#pragma omp taskyield
}
something_critical();
omp_unset_lock(lock);
}
}
|
domain_helpers.c | //
// Created by sachetto on 19/10/17.
//
#include "domain_helpers.h"
#include "../libraries_common/common_data_structures.h"
#include "../utils/file_utils.h"
#include "../utils/utils.h"
#include "../string/sds.h"
#include "../config_helpers/config_helpers.h"
#include <float.h>
#include <math.h>
#include <time.h>
#include <unistd.h>
int calculate_cuboid_side_lengths(real_cpu start_dx, real_cpu start_dy, real_cpu start_dz, real_cpu side_length_x,
real_cpu side_length_y, real_cpu side_length_z, real_cpu *real_side_length_x,
real_cpu *real_side_length_y, real_cpu *real_side_length_z) {
*real_side_length_x = start_dx * 2.0;
*real_side_length_y = start_dy * 2.0;
*real_side_length_z = start_dz * 2.0;
real_cpu nx = side_length_x / start_dx;
real_cpu ny = side_length_y / start_dy;
real_cpu nz = side_length_z / start_dz;
real_cpu proportion_dxdy = fmax(start_dx, start_dy)/fmin(start_dx, start_dy);
real_cpu proportion_dxdz = fmax(start_dx, start_dz)/fmin(start_dx, start_dz);
real_cpu proportion_dydz = fmax(start_dz, start_dy)/fmin(start_dz, start_dy);
bool error = false;
if(start_dx > start_dy) {
if (side_length_x < side_length_y) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dx > start_dy, you need side_length_x > side_length_y");
error = true;
}
}
if(start_dx > start_dz) {
if (side_length_x < side_length_z) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dx > start_dz, you need side_length_x > side_length_z");
error = true;
}
}
if(start_dy > start_dx) {
if (side_length_y < side_length_x) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dy > start_dx, you need side_length_y > side_length_x");
error = true; }
}
if(start_dy > start_dz) {
if (side_length_y < side_length_z) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dy > start_dz, you need side_length_y > side_length_z");
error = true;
}
}
if(start_dz > start_dx) {
if (side_length_z < side_length_x) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dz > start_dx, you need side_length_z > side_length_x");
error = true;
}
}
if(start_dz > start_dy) {
if (side_length_z < side_length_y) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. If start_dz > start_dy, you need side_length_z > side_length_y");
error = true;
}
}
if(ceil(proportion_dxdy) != proportion_dxdy || ceil(proportion_dxdz) != proportion_dxdz || ceil(proportion_dydz) != proportion_dydz) {
REPORT_ERROR_ON_FUNCTION("Incorrect configuration. start_dx, start_dy and start_dz need to be multiples");
error = true;
}
if(ceil(nx) != nx) {
sds error_str = sdscatprintf(sdsempty(), "start_dx: %lf is not multiple of side_length_x: %lf", start_dx, side_length_x);
REPORT_ERROR_ON_FUNCTION(error_str);
sdsfree(error_str);
error = true;
}
if(ceil(ny) != ny) {
sds error_str = sdscatprintf(sdsempty(), "start_dy: %lf is not multiple of side_length_y: %lf", start_dy, side_length_y);
REPORT_ERROR_ON_FUNCTION(error_str);
sdsfree(error_str);
error = true;
}
if(ceil(nz) != nz) {
sds error_str =
sdscatprintf(sdsempty(), "start_dz: %lf is not multiple of side_length_z: %lf", start_dz, side_length_z);
REPORT_ERROR_ON_FUNCTION(error_str);
sdsfree(error_str);
error = true;
}
if(error) {
return 0;
}
while(*real_side_length_x < side_length_x) {
*real_side_length_x *= 2.0;
}
while(*real_side_length_y < side_length_y) {
*real_side_length_y *= 2.0;
}
while(*real_side_length_z < side_length_z) {
*real_side_length_z *= 2.0;
}
int proportion_h;
if(start_dx > start_dy) {
proportion_h = (int)(start_dx / start_dy);
if(*real_side_length_y >= *real_side_length_x || (*real_side_length_x / proportion_h) < *real_side_length_y) {
*real_side_length_x = *real_side_length_y * proportion_h;
}
else {
*real_side_length_y = *real_side_length_x / proportion_h;
*real_side_length_z = *real_side_length_z / proportion_h;
}
} else if(start_dx < start_dy) {
proportion_h = (int)(start_dy / start_dx);
if(*real_side_length_x >= *real_side_length_y) {
*real_side_length_y = *real_side_length_x * proportion_h;
*real_side_length_z = *real_side_length_z * proportion_h;
}
else {
*real_side_length_x = *real_side_length_y / proportion_h;
}
}
if(start_dy > start_dz) {
proportion_h = (int)(start_dy / start_dz);
if(*real_side_length_z >= *real_side_length_y || *real_side_length_y / proportion_h < *real_side_length_z) {
*real_side_length_y = *real_side_length_z * proportion_h;
*real_side_length_x = *real_side_length_x * proportion_h;
}
else {
*real_side_length_z = *real_side_length_y / proportion_h;
}
} else if(start_dy < start_dz) {
proportion_h = (int)(start_dz / start_dy);
if(*real_side_length_y > *real_side_length_z || *real_side_length_z / proportion_h < *real_side_length_y) {
*real_side_length_z = *real_side_length_y * proportion_h;
}
else {
*real_side_length_y = *real_side_length_z / proportion_h;
*real_side_length_x = *real_side_length_x / proportion_h;
}
}
if(start_dx == start_dy) {
real_cpu aux = fmax(*real_side_length_x, *real_side_length_y);
*real_side_length_x = aux;
*real_side_length_y = aux;
}
if(start_dx == start_dz) {
real_cpu aux = fmax(*real_side_length_x, *real_side_length_z);
*real_side_length_x = aux;
*real_side_length_z = aux;
}
if(start_dy == start_dz) {
real_cpu aux = fmax(*real_side_length_y, *real_side_length_z);
*real_side_length_y = aux;
*real_side_length_z = aux;
}
return 1;
}
void refine_fibrotic_cells(struct grid *the_grid) {
assert(the_grid);
struct cell_node *grid_cell, *auxiliar_grid_cell;
struct fibrotic_mesh_info *mesh_info;
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
mesh_info = FIBROTIC_INFO(grid_cell);
if(grid_cell->active && mesh_info->fibrotic) {
auxiliar_grid_cell = grid_cell;
grid_cell = grid_cell->next;
refine_cell(auxiliar_grid_cell, NULL, NULL);
the_grid->number_of_cells += 7;
} else {
grid_cell = grid_cell->next;
}
}
}
void refine_border_zone_cells(struct grid *the_grid) {
assert(the_grid);
struct cell_node *grid_cell, *auxiliar_grid_cell;
struct fibrotic_mesh_info *mesh_info;
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
mesh_info = FIBROTIC_INFO(grid_cell);
if(grid_cell->active && mesh_info->border_zone) {
auxiliar_grid_cell = grid_cell;
grid_cell = grid_cell->next;
refine_cell(auxiliar_grid_cell, NULL, NULL);
the_grid->number_of_cells += 7;
} else {
grid_cell = grid_cell->next;
}
}
}
/**
* Sets the current domain as a domain described in the N-version benchmark
* (http://rsta.royalsocietypublishing.org/content/369/1954/4331)
*
*/
void set_benchmark_domain(struct grid *the_grid) {
struct cell_node *grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
grid_cell->active =
(grid_cell->center.y < 20000) && (grid_cell->center.x < 7000) && (grid_cell->center.z < 3000);
grid_cell = grid_cell->next;
}
the_grid->mesh_side_length.x = 7000;
the_grid->mesh_side_length.y = 20000;
the_grid->mesh_side_length.z = 3000;
}
void set_cuboid_domain(struct grid *the_grid, real_cpu size_x, real_cpu size_y, real_cpu size_z) {
struct cell_node *grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
grid_cell->active =
(grid_cell->center.y < size_y) && (grid_cell->center.x < size_x) && (grid_cell->center.z < size_z);
grid_cell = grid_cell->next;
}
the_grid->mesh_side_length.x = size_x;
the_grid->mesh_side_length.y = size_y;
the_grid->mesh_side_length.z = size_z;
}
void set_custom_mesh(struct grid *the_grid, const char *file_name, size_t size, char *read_format) {
struct cell_node *grid_cell = the_grid->first_cell;
FILE *file = fopen(file_name, "r");
if(!file) {
print_to_stderr_and_file_and_exit("Error opening mesh described in %s!!\n", file_name);
}
double **mesh_points = (double **)malloc(sizeof(double *) * size);
for(int i = 0; i < size; i++) {
mesh_points[i] = (real_cpu *)malloc(sizeof(real_cpu) * 4);
if(mesh_points[i] == NULL) {
print_to_stderr_and_file_and_exit("Failed to allocate memory\n");
}
}
real_cpu dummy; // we don't use this value here
real_cpu maxy = 0.0;
real_cpu maxz = 0.0;
real_cpu miny = DBL_MAX;
real_cpu minz = DBL_MAX;
int *fibrosis = (int *)malloc(sizeof(int) * size);
char *tag = (char *)malloc(size);
for(int k = 0; k < size; k++) {
tag[k] = 'n';
}
fibrosis[0] = -1;
int i = 0;
while(i < size) {
fscanf(file, read_format, &mesh_points[i][0], &mesh_points[i][1], &mesh_points[i][2], &dummy, &fibrosis[i], &tag[i]);
// we save the old index to reference fibrosis[i] and tags[i]. T
// this is needed because the array mesh_points is sorted after reading the mesh file.
mesh_points[i][3] = i;
if(mesh_points[i][1] > maxy)
maxy = mesh_points[i][1];
if(mesh_points[i][2] > maxz)
maxz = mesh_points[i][2];
if(mesh_points[i][1] < miny)
miny = mesh_points[i][1];
if(mesh_points[i][2] < minz)
minz = mesh_points[i][2];
i++;
}
sort_vector(mesh_points, size); // we need to sort because inside_mesh perform a binary search
real_cpu maxx = mesh_points[size - 1][0];
real_cpu minx = mesh_points[0][0];
int index;
//print_to_stdout_and_file("[grid] minx = %g || maxx = %g || miny = %g || maxy = %g || minz = %g || maxz = %g ||\n",minx,maxx,miny,maxy,minz,maxz);
real_cpu x, y, z;
while(grid_cell != 0) {
x = grid_cell->center.x;
y = grid_cell->center.y;
z = grid_cell->center.z;
//print_to_stdout_and_file("[grid] x = %g || y = %g || z = %g || ",x,y,z);
if(x > maxx || y > maxy || z > maxz || x < minx || y < miny || z < minz) {
//print_to_stdout_and_file("Out\n");
grid_cell->active = false;
} else {
//print_to_stdout_and_file("Inside\n");
index = inside_mesh(mesh_points, x, y, z, 0, size - 1);
if(index != -1) {
grid_cell->active = true;
if(fibrosis[0] != -1) {
int old_index = (int)mesh_points[index][3];
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = (fibrosis[old_index] == 1);
BORDER_ZONE(grid_cell) = (fibrosis[old_index] == 2);
SCAR_TYPE(grid_cell) = tag[old_index];
}
} else {
grid_cell->active = false;
}
}
grid_cell = grid_cell->next;
}
fclose(file);
// deallocate memory
for(int l = 0; l < size; l++) {
free(mesh_points[l]);
}
free(mesh_points);
free(tag);
free(fibrosis);
//TODO: we need to sum the cell discretization here...
the_grid->mesh_side_length.x = maxx;
the_grid->mesh_side_length.y = maxy;
the_grid->mesh_side_length.z = maxz;
}
void set_custom_mesh_with_bounds(struct grid *the_grid, const char *file_name, size_t size, real_cpu minx, real_cpu maxx,
real_cpu miny, real_cpu maxy, real_cpu minz, real_cpu maxz, bool read_fibrosis) {
struct cell_node *grid_cell = the_grid->first_cell;
FILE *file = fopen(file_name, "r");
if(!file) {
print_to_stderr_and_file_and_exit("Error opening mesh described in %s!!\n", file_name);
}
real_cpu **mesh_points = (real_cpu **)malloc(sizeof(real_cpu *) * size);
for(int i = 0; i < size; i++) {
mesh_points[i] = (real_cpu *)calloc(4, sizeof(real_cpu));
if(mesh_points[i] == NULL) {
print_to_stderr_and_file_and_exit("Failed to allocate memory\n");
}
}
real_cpu dummy; // we don't use this value here
int *fibrosis = (int *)malloc(sizeof(int) * size);
char *tag = (char *)malloc(size);
for(int k = 0; k < size; k++) {
tag[k] = 'n';
}
int i = 0;
while(i < size) {
fscanf(file, "%lf,%lf,%lf,%lf,%d,%c\n", &mesh_points[i][0], &mesh_points[i][1], &mesh_points[i][2], &dummy,
&fibrosis[i], &tag[i]);
// we save the old index to reference fibrosis[i] and tags[i]. T
// this is needed because the array mesh_points is sorted after reading the mesh file.
mesh_points[i][3] = i;
i++;
}
sort_vector(mesh_points, size); // we need to sort because inside_mesh perform a binary search
int index;
real_cpu x, y, z;
while(grid_cell != 0) {
x = grid_cell->center.x;
y = grid_cell->center.y;
z = grid_cell->center.z;
if(x > maxx || y > maxy || z > maxz || x < minx || y < miny || z < minz) {
grid_cell->active = false;
} else {
index = inside_mesh(mesh_points, x, y, z, 0, size - 1);
if(index != -1) {
grid_cell->active = true;
if(read_fibrosis) {
int old_index = (int)mesh_points[index][3];
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = (fibrosis[old_index] == 1);
BORDER_ZONE(grid_cell) = (fibrosis[old_index] == 2);
SCAR_TYPE(grid_cell) = tag[old_index];
}
} else {
grid_cell->active = false;
}
}
grid_cell = grid_cell->next;
}
fclose(file);
// deallocate memory
for(int l = 0; l < size; l++) {
free(mesh_points[l]);
}
the_grid->mesh_side_length.x = maxx;
the_grid->mesh_side_length.y = maxy;
the_grid->mesh_side_length.z = maxz;
free(mesh_points);
free(tag);
free(fibrosis);
}
void set_cell_not_changeable(struct cell_node *c, real_cpu initialDiscretization) {
real_cpu P1x, P1y, P1z;
real_cpu P2x, P2y, P2z;
real_cpu P3x, P3y, P3z;
real_cpu P4x, P4y, P4z;
real_cpu P5x, P5y, P5z;
real_cpu P6x, P6y, P6z;
real_cpu P7x, P7y, P7z;
real_cpu P8x, P8y, P8z;
real_cpu Cx, Cy, Cz;
if(initialDiscretization == 100.0) {
P1x = 6950;
P1y = 50;
P1z = 50;
P2x = 6950;
P2y = 19950;
P2z = 50;
P3x = 6950;
P3y = 50;
P3z = 2950;
P4x = 6950;
P4y = 19950;
P4z = 2950;
P5x = 50;
P5y = 50;
P5z = 50;
P6x = 50;
P6y = 19950;
P6z = 50;
P7x = 50;
P7y = 50;
P7z = 2950;
P8x = 50;
P8y = 19950;
P8z = 2950;
Cx = 3450;
Cy = 9950;
Cz = 1450;
}
else if(initialDiscretization == 200.0) {
P1x = 6900;
P1y = 100;
P1z = 100;
P2x = 6900;
P2y = 19900;
P2z = 100;
P3x = 6900;
P3y = 100;
P3z = 2900;
P4x = 6900;
P4y = 19900;
P4z = 2900;
P5x = 100;
P5y = 100;
P5z = 100;
P6x = 100;
P6y = 19900;
P6z = 100;
P7x = 100;
P7y = 100;
P7z = 2900;
P8x = 100;
P8y = 19900;
P8z = 2900;
Cx = 3500;
Cy = 9900;
Cz = 1500;
}
else if(initialDiscretization == 125.0) {
P1x = 6937.5;
P1y = 62.5;
P1z = 62.5;
P2x = 6937.5;
P2y = 19937.5;
P2z = 62.5;
P3x = 6937.5;
P3y = 62.5;
P3z = 2937.5;
P4x = 6937.5;
P4y = 19937.5;
P4z = 2937.5;
P5x = 62.5;
P5y = 62.5;
P5z = 62.5;
P6x = 62.5;
P6y = 19937.5;
P6z = 62.5;
P7x = 3937.5;
P7y = 19937.5;
P7z = 62.5;
P8x = 62.5;
P8y = 19937.5;
P8z = 2937.5;
Cx = 3437.5;
Cy = 9937.5;
Cz = 1562.5;
}
else if(initialDiscretization == 250.0) {
P1x = 6875;
P1y = 125;
P1z = 125;
P2x = 6875;
P2y = 19875;
P2z = 125;
P3x = 6875;
P3y = 125;
P3z = 2875;
P4x = 6875;
P4y = 19875;
P4z = 2875;
P5x = 125;
P5y = 125;
P5z = 125;
P6x = 125;
P6y = 19875;
P6z = 125;
P7x = 125;
P7y = 125;
P7z = 2875;
P8x = 125;
P8y = 19875;
P8z = 2875;
Cx = 3375;
Cy = 9875;
Cz = 1125;
}
else {
P1x = -1;
P1y = -1;
P1z = -1;
P2x = -1;
P2y = -1;
P2z = -1;
P3x = -1;
P3y = -1;
P3z = -1;
P4x = -1;
P4y = -1;
P4z = -1;
P5x = -1;
P5y = -1;
P5z = -1;
P6x = -1;
P6y = -1;
P6z = -1;
P7x = -1;
P7y = -1;
P7z = -1;
P8x = -1;
P8y = -1;
P8z = -1;
Cx = -1;
Cy = -1;
Cz = -1;
}
bool cannotChange = ((c->center.x == P1x) && (c->center.y == P1y) && (c->center.z == P1z));
cannotChange |= ((c->center.x == P2x) && (c->center.y == P2y) && (c->center.z == P2z));
cannotChange |= ((c->center.x == P3x) && (c->center.y == P3y) && (c->center.z == P3z));
cannotChange |= ((c->center.x == P4x) && (c->center.y == P4y) && (c->center.z == P4z));
cannotChange |= ((c->center.x == P5x) && (c->center.y == P5y) && (c->center.z == P5z));
cannotChange |= ((c->center.x == P6x) && (c->center.y == P6y) && (c->center.z == P6z));
cannotChange |= ((c->center.x == P7x) && (c->center.y == P7y) && (c->center.z == P7z));
cannotChange |= ((c->center.x == P8x) && (c->center.y == P8y) && (c->center.z == P8z));
cannotChange |= ((c->center.x == Cx) && (c->center.y == Cy) && (c->center.z == Cz));
c->can_change = !cannotChange;
}
void set_plain_fibrosis(struct grid *the_grid, real_cpu phi, unsigned fib_seed) {
print_to_stdout_and_file("Making %.2lf %% of cells inactive\n", phi * 100.0);
struct cell_node *grid_cell;
if(fib_seed == 0)
fib_seed = (unsigned)time(NULL) + getpid();
srand(fib_seed);
print_to_stdout_and_file("Using %u as seed\n", fib_seed);
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
if(grid_cell->active) {
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi) {
grid_cell->active = false;
}
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = true;
}
grid_cell = grid_cell->next;
}
}
void set_plain_source_sink_fibrosis (struct grid *the_grid, real_cpu channel_width, real_cpu channel_length)
{
print_to_stdout_and_file("Making upper and down left corner inactive !\n");
bool inside;
real_cpu side_length_x = the_grid->mesh_side_length.x;
real_cpu side_length_y = the_grid->mesh_side_length.y;
real_cpu side_length_z = the_grid->mesh_side_length.z;
real_cpu region_height = (side_length_y - channel_width) / 2.0;
struct cell_node *grid_cell;
grid_cell = the_grid->first_cell;
while(grid_cell != 0)
{
if(grid_cell->active)
{
real_cpu x = grid_cell->center.x;
real_cpu y = grid_cell->center.y;
real_cpu z = grid_cell->center.z;
// Check region 1
inside = (x >= 0.0) && (x <= channel_length) &&\
(y >= 0.0) && (y <= region_height);
// Check region 2
inside |= (x >= 0.0) && (x <= channel_length) &&\
(y >= region_height + channel_width) && (y <= side_length_y);
if(inside)
{
grid_cell->active = false;
}
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = true;
}
grid_cell = grid_cell->next;
}
}
void set_plain_sphere_fibrosis(struct grid *the_grid, real_cpu phi, real_cpu plain_center, real_cpu sphere_radius,
real_cpu bz_size, real_cpu bz_radius, unsigned fib_seed) {
print_to_stdout_and_file("Making %.2lf %% of cells inactive\n", phi * 100.0f);
if(fib_seed == 0)
fib_seed = (unsigned)time(NULL) + getpid();
srand(fib_seed);
print_to_stdout_and_file("Using %u as seed\n", fib_seed);
real_cpu bz_radius_2 = pow(bz_radius, 2.0);
real_cpu sphere_radius_2 = pow(sphere_radius, 2.0);
struct cell_node *grid_cell;
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
real_cpu distance = pow(grid_cell->center.x - plain_center, 2.0) + pow(grid_cell->center.y - plain_center, 2.0);
if(grid_cell->active) {
INITIALIZE_FIBROTIC_INFO(grid_cell);
if(distance <= bz_radius_2) {
if(distance <= sphere_radius_2) {
FIBROTIC(grid_cell) = true;
} else {
BORDER_ZONE(grid_cell) = true;
}
}
}
grid_cell = grid_cell->next;
}
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
if(grid_cell->active) {
if(FIBROTIC(grid_cell)) {
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi)
grid_cell->active = false;
grid_cell->can_change = false;
} else if(BORDER_ZONE(grid_cell)) {
real_cpu distance_from_center =
sqrt((grid_cell->center.x - plain_center) * (grid_cell->center.x - plain_center) +
(grid_cell->center.y - plain_center) * (grid_cell->center.y - plain_center));
distance_from_center = (distance_from_center - sphere_radius) / bz_size;
real_cpu phi_local = phi - phi * distance_from_center;
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi_local)
grid_cell->active = false;
grid_cell->can_change = false;
}
}
grid_cell = grid_cell->next;
}
}
void set_plain_sphere_fibrosis_with_fibrotic_hole (struct grid *the_grid, real_cpu phi, real_cpu plain_center, real_cpu sphere_radius,
real_cpu bz_size, real_cpu bz_radius, real_cpu fib_hole_radius,unsigned fib_seed) {
print_to_stdout_and_file("Making %.2lf %% of cells inactive\n", phi * 100.0f);
if(fib_seed == 0)
fib_seed = (unsigned)time(NULL) + getpid();
srand(fib_seed);
print_to_stdout_and_file("Using %u as seed\n", fib_seed);
real_cpu bz_radius_2 = pow(bz_radius, 2.0);
real_cpu sphere_radius_2 = pow(sphere_radius, 2.0);
real_cpu fib_radius_2 = pow(fib_hole_radius, 2.0);
struct cell_node *grid_cell;
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
real_cpu distance = pow(grid_cell->center.x - plain_center, 2.0) + pow(grid_cell->center.y - plain_center, 2.0);
if(grid_cell->active) {
INITIALIZE_FIBROTIC_INFO(grid_cell);
if(distance <= bz_radius_2) {
if(distance <= sphere_radius_2) {
FIBROTIC(grid_cell) = true;
}
if (distance <= fib_radius_2){
grid_cell-> active = false;
grid_cell->can_change = false;
}
else {
BORDER_ZONE(grid_cell) = true;
}
}
}
grid_cell = grid_cell->next;
}
grid_cell = the_grid->first_cell;
while(grid_cell != 0) {
if(grid_cell->active) {
if(FIBROTIC(grid_cell)) {
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi)
grid_cell->active = false;
grid_cell->can_change = false;
} else if(BORDER_ZONE(grid_cell)) {
real_cpu distance_from_center =
sqrt((grid_cell->center.x - plain_center) * (grid_cell->center.x - plain_center) +
(grid_cell->center.y - plain_center) * (grid_cell->center.y - plain_center));
distance_from_center = (distance_from_center - sphere_radius) / bz_size;
real_cpu phi_local = phi - phi * distance_from_center;
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi_local)
grid_cell->active = false;
grid_cell->can_change = false;
}
}
grid_cell = grid_cell->next;
}
}
void set_human_mesh_fibrosis(struct grid *grid, real_cpu phi, unsigned seed, real_cpu big_scar_center_x,
real_cpu big_scar_center_y, real_cpu big_scar_center_z, real_cpu small_scar_center_x,
real_cpu small_scar_center_y, real_cpu small_scar_center_z) {
if(seed == 0)
seed = (unsigned)time(NULL) + getpid();
srand(seed);
print_to_stdout_and_file("Using %u as seed\n", seed);
real_cpu bz_size_big = 0;
real_cpu bz_size_small = 0;
real_cpu dist_big = 0;
real_cpu dist_small = 0;
print_to_stdout_and_file("Calculating fibrosis using phi: %lf\n", phi);
struct cell_node *grid_cell = grid->first_cell;
while(grid_cell != NULL) {
if(grid_cell->active) {
if(FIBROTIC(grid_cell)) {
grid_cell->can_change = false;
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi)
grid_cell->active = false;
} else if(BORDER_ZONE(grid_cell)) {
real_cpu centerX = grid_cell->center.x;
real_cpu centerY = grid_cell->center.y;
real_cpu centerZ = grid_cell->center.z;
if(SCAR_TYPE(grid_cell) == 'b') {
dist_big = sqrt((centerX - big_scar_center_x) * (centerX - big_scar_center_x) +
(centerY - big_scar_center_y) * (centerY - big_scar_center_y) +
(centerZ - big_scar_center_z) * (centerZ - big_scar_center_z));
if(dist_big > bz_size_big) {
bz_size_big = dist_big;
}
} else if(SCAR_TYPE(grid_cell) == 's') {
dist_small = sqrt((centerX - small_scar_center_x) * (centerX - small_scar_center_x) +
(centerY - small_scar_center_y) * (centerY - small_scar_center_y) +
(centerZ - small_scar_center_z) * (centerZ - small_scar_center_z));
if(dist_small > bz_size_small) {
bz_size_small = dist_small;
}
}
}
}
grid_cell = grid_cell->next;
}
grid_cell = grid->first_cell;
while(grid_cell != NULL) {
if(grid_cell->active) {
if(BORDER_ZONE(grid_cell)) {
real_cpu centerX = grid_cell->center.x;
real_cpu centerY = grid_cell->center.y;
real_cpu centerZ = grid_cell->center.z;
if(SCAR_TYPE(grid_cell) == 'b') {
dist_big = sqrt((centerX - big_scar_center_x) * (centerX - big_scar_center_x) +
(centerY - big_scar_center_y) * (centerY - big_scar_center_y) +
(centerZ - big_scar_center_z) * (centerZ - big_scar_center_z));
dist_big = dist_big / bz_size_big;
real_cpu phi_local = phi - phi * dist_big;
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi_local) {
grid_cell->active = false;
}
grid_cell->can_change = false;
} else if(SCAR_TYPE(grid_cell) == 's') {
dist_small = sqrt((centerX - small_scar_center_x) * (centerX - small_scar_center_x) +
(centerY - small_scar_center_y) * (centerY - small_scar_center_y) +
(centerZ - small_scar_center_z) * (centerZ - small_scar_center_z));
dist_small = dist_small / bz_size_small;
real_cpu phi_local = phi - phi * dist_small;
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi_local) {
grid_cell->active = false;
}
grid_cell->can_change = false;
}
}
}
grid_cell = grid_cell->next;
}
}
void set_human_mesh_fibrosis_from_file(struct grid *grid, char type, const char *filename, int size) {
FILE *file = fopen(filename, "r");
if(!file) {
printf("Error opening file %s!!\n", filename);
exit(0);
}
real_cpu **scar_mesh = (real_cpu **)malloc(sizeof(real_cpu *) * size);
for(int i = 0; i < size; i++) {
scar_mesh[i] = (real_cpu *)malloc(sizeof(real_cpu) * 3);
if(scar_mesh[i] == NULL) {
printf("Failed to allocate memory\n");
exit(0);
}
}
real_cpu dummy1, dummy2; // unused values
int i = 0;
while(!feof(file)) {
fscanf(file, "%lf,%lf,%lf,%lf,%lf\n", &scar_mesh[i][0], &scar_mesh[i][1], &scar_mesh[i][2], &dummy1, &dummy2);
i++;
}
fclose(file);
sort_vector(scar_mesh, size);
struct cell_node *grid_cell = grid->first_cell;
while(grid_cell != 0) {
real_cpu center_x = grid_cell->center.x;
real_cpu center_y = grid_cell->center.y;
real_cpu center_z = grid_cell->center.z;
if((grid_cell->discretization.x == 100.0) && (SCAR_TYPE(grid_cell) == type)) {
int index = inside_mesh(scar_mesh, center_x, center_y, center_z, 0, size - 1);
grid_cell->active = (index != -1);
}
grid_cell = grid_cell->next;
}
for(int k = 0; k < size; k++) {
free(scar_mesh[k]);
}
free(scar_mesh);
}
void set_fibrosis_from_file(struct grid *grid, const char *filename, int size) {
FILE *file = fopen(filename, "r");
if(!file) {
printf("Error opening file %s!!\n", filename);
exit(0);
}
real_cpu **scar_mesh = (real_cpu **)malloc(sizeof(real_cpu *) * size);
for(int i = 0; i < size; i++) {
scar_mesh[i] = (real_cpu *)malloc(sizeof(real_cpu) * 7);
if(scar_mesh[i] == NULL) {
printf("Failed to allocate memory\n");
exit(0);
}
}
for(int i = 0; i < size; i++) {
fscanf(file, "%lf,%lf,%lf,%lf,%lf,%lf,%lf\n", &scar_mesh[i][0], &scar_mesh[i][1], &scar_mesh[i][2], &scar_mesh[i][3], &scar_mesh[i][4], &scar_mesh[i][5], &scar_mesh[i][6]);
}
fclose(file);
#pragma omp parallel for
for(int j = 0; j < size; j++) {
struct cell_node *grid_cell = grid->first_cell;
real_cpu b_center_x = scar_mesh[j][0];
real_cpu b_center_y = scar_mesh[j][1];
real_cpu b_h_dx = scar_mesh[j][3];
real_cpu b_h_dy = scar_mesh[j][4];
bool active = (bool) (scar_mesh[j][6]);
int c = 0;
while (grid_cell != 0) {
if(grid_cell->active) {
real_cpu center_x = grid_cell->center.x;
real_cpu center_y = grid_cell->center.y;
real_cpu half_dy = grid_cell->discretization.y/2.0;
if(FIBROTIC_INFO(grid_cell) == NULL) {
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = 1;
}
struct point_3d p;
p.x = b_center_x + b_h_dx;
p.y = b_center_y - b_h_dy;
if (center_x == b_center_x && center_y + half_dy <= p.x && center_y - half_dy >= p.y) {
grid_cell->active = active;
c++;
}
}
if(c == 4) break;
grid_cell = grid_cell->next;
}
}
for(int k = 0; k < size; k++) {
free(scar_mesh[k]);
}
free(scar_mesh);
}
void set_plain_fibrosis_inside_region (struct grid *the_grid, real_cpu phi, unsigned fib_seed,\
const double min_x, const double max_x,\
const double min_y, const double max_y,\
const double min_z, const double max_z)
{
print_to_stdout_and_file("Making %.2lf %% of cells inside the region inactive\n", phi * 100.0);
struct cell_node *grid_cell;
if(fib_seed == 0)
fib_seed = (unsigned)time(NULL) + getpid();
srand(fib_seed);
print_to_stdout_and_file("Using %u as seed\n", fib_seed);
grid_cell = the_grid->first_cell;
while(grid_cell != 0)
{
real center_x = grid_cell->center.x;
real center_y = grid_cell->center.y;
real center_z = grid_cell->center.z;
if (center_x >= min_x && center_x <= max_x &&\
center_y >= min_y && center_y <= max_y &&\
center_z >= min_z && center_z <= max_z)
{
if(grid_cell->active)
{
real_cpu p = (real_cpu)(rand()) / (RAND_MAX);
if(p < phi)
{
grid_cell->active = false;
}
INITIALIZE_FIBROTIC_INFO(grid_cell);
FIBROTIC(grid_cell) = true;
}
}
grid_cell = grid_cell->next;
}
}
|
_phono3py.c | /* Copyright (C) 2015 Atsushi Togo */
/* All rights reserved. */
/* This file is part of phonopy. */
/* Redistribution and use in source and binary forms, with or without */
/* modification, are permitted provided that the following conditions */
/* are met: */
/* * Redistributions of source code must retain the above copyright */
/* notice, this list of conditions and the following disclaimer. */
/* * Redistributions in binary form must reproduce the above copyright */
/* notice, this list of conditions and the following disclaimer in */
/* the documentation and/or other materials provided with the */
/* distribution. */
/* * Neither the name of the phonopy project nor the names of its */
/* contributors may be used to endorse or promote products derived */
/* from this software without specific prior written permission. */
/* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS */
/* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT */
/* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS */
/* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE */
/* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, */
/* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, */
/* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; */
/* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER */
/* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT */
/* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN */
/* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE */
/* POSSIBILITY OF SUCH DAMAGE. */
#include <Python.h>
#include <assert.h>
#include <stdio.h>
#include <stddef.h>
#include <stdlib.h>
#include <math.h>
#include <numpy/arrayobject.h>
#include <lapack_wrapper.h>
#include <phonon.h>
#include <phonoc_array.h>
#include <phonoc_const.h>
#include <phonon3_h/fc3.h>
#include <phonon3_h/frequency_shift.h>
#include <phonon3_h/interaction.h>
#include <phonon3_h/imag_self_energy_with_g.h>
#include <phonon3_h/pp_collision.h>
#include <phonon3_h/collision_matrix.h>
#include <other_h/isotope.h>
#include <triplet_h/triplet.h>
#include <tetrahedron_method.h>
/* #define LIBFLAME */
#ifdef LIBFLAME
#include <flame_wrapper.h>
#endif
static PyObject * py_get_phonons_at_gridpoints(PyObject *self, PyObject *args);
static PyObject * py_get_interaction(PyObject *self, PyObject *args);
static PyObject * py_get_pp_collision(PyObject *self, PyObject *args);
static PyObject *
py_get_pp_collision_with_sigma(PyObject *self, PyObject *args);
static PyObject *
py_get_imag_self_energy_with_g(PyObject *self, PyObject *args);
static PyObject *
py_get_detailed_imag_self_energy_with_g(PyObject *self, PyObject *args);
static PyObject * py_get_frequency_shift_at_bands(PyObject *self,
PyObject *args);
static PyObject * py_get_collision_matrix(PyObject *self, PyObject *args);
static PyObject * py_get_reducible_collision_matrix(PyObject *self,
PyObject *args);
static PyObject * py_symmetrize_collision_matrix(PyObject *self,
PyObject *args);
static PyObject * py_expand_collision_matrix(PyObject *self, PyObject *args);
static PyObject * py_distribute_fc3(PyObject *self, PyObject *args);
static PyObject * py_rotate_delta_fc2s(PyObject *self, PyObject *args);
static PyObject * py_get_isotope_strength(PyObject *self, PyObject *args);
static PyObject * py_get_thm_isotope_strength(PyObject *self, PyObject *args);
static PyObject *
py_set_permutation_symmetry_fc3(PyObject *self, PyObject *args);
static PyObject *
py_set_permutation_symmetry_compact_fc3(PyObject *self, PyObject *args);
static PyObject * py_set_permutation_symmetry_fc3(PyObject *self,
PyObject *args);
static PyObject * py_transpose_compact_fc3(PyObject *self, PyObject *args);
static PyObject * py_get_neighboring_gird_points(PyObject *self, PyObject *args);
static PyObject * py_set_integration_weights(PyObject *self, PyObject *args);
static PyObject *
py_tpl_get_triplets_reciprocal_mesh_at_q(PyObject *self, PyObject *args);
static PyObject * py_tpl_get_BZ_triplets_at_q(PyObject *self, PyObject *args);
static PyObject *
py_set_triplets_integration_weights(PyObject *self, PyObject *args);
static PyObject *
py_set_triplets_integration_weights_with_sigma(PyObject *self, PyObject *args);
static PyObject *
py_diagonalize_collision_matrix(PyObject *self, PyObject *args);
static PyObject * py_pinv_from_eigensolution(PyObject *self, PyObject *args);
static PyObject * py_get_default_colmat_solver(PyObject *self, PyObject *args);
#ifdef LIBFLAME
static PyObject * py_inverse_collision_matrix_libflame(PyObject *self, PyObject *args);
#endif
static void pinv_from_eigensolution(double *data,
const double *eigvals,
const size_t size,
const double cutoff,
const int pinv_method);
static void show_colmat_info(const PyArrayObject *collision_matrix_py,
const size_t i_sigma,
const size_t i_temp,
const size_t adrs_shift);
struct module_state {
PyObject *error;
};
#if PY_MAJOR_VERSION >= 3
#define GETSTATE(m) ((struct module_state*)PyModule_GetState(m))
#else
#define GETSTATE(m) (&_state)
static struct module_state _state;
#endif
static PyObject *
error_out(PyObject *m) {
struct module_state *st = GETSTATE(m);
PyErr_SetString(st->error, "something bad happened");
return NULL;
}
static PyMethodDef _phono3py_methods[] = {
{"error_out", (PyCFunction)error_out, METH_NOARGS, NULL},
{"phonons_at_gridpoints",
py_get_phonons_at_gridpoints,
METH_VARARGS,
"Set phonons at grid points"},
{"interaction",
(PyCFunction)py_get_interaction,
METH_VARARGS,
"Interaction of triplets"},
{"pp_collision",
(PyCFunction)py_get_pp_collision,
METH_VARARGS,
"Collision and ph-ph calculation"},
{"pp_collision_with_sigma",
(PyCFunction)py_get_pp_collision_with_sigma,
METH_VARARGS,
"Collision and ph-ph calculation for smearing method"},
{"imag_self_energy_with_g",
(PyCFunction)py_get_imag_self_energy_with_g,
METH_VARARGS,
"Imaginary part of self energy at frequency points with g"},
{"detailed_imag_self_energy_with_g",
(PyCFunction)py_get_detailed_imag_self_energy_with_g,
METH_VARARGS,
"Detailed contribution to imaginary part of self energy at frequency points with g"},
{"frequency_shift_at_bands",
(PyCFunction)py_get_frequency_shift_at_bands,
METH_VARARGS,
"Phonon frequency shift from third order force constants"},
{"collision_matrix",
(PyCFunction)py_get_collision_matrix,
METH_VARARGS,
"Collision matrix with g"},
{"reducible_collision_matrix",
(PyCFunction)py_get_reducible_collision_matrix,
METH_VARARGS,
"Collision matrix with g for reducible grid points"},
{"symmetrize_collision_matrix",
(PyCFunction)py_symmetrize_collision_matrix,
METH_VARARGS,
"Symmetrize collision matrix"},
{"expand_collision_matrix",
(PyCFunction)py_expand_collision_matrix,
METH_VARARGS,
"Expand collision matrix"},
{"distribute_fc3",
(PyCFunction)py_distribute_fc3,
METH_VARARGS,
"Distribute least fc3 to full fc3"},
{"rotate_delta_fc2s",
(PyCFunction)py_rotate_delta_fc2s,
METH_VARARGS,
"Rotate delta fc2s"},
{"isotope_strength",
(PyCFunction)py_get_isotope_strength,
METH_VARARGS,
"Isotope scattering strength"},
{"thm_isotope_strength",
(PyCFunction)py_get_thm_isotope_strength,
METH_VARARGS,
"Isotope scattering strength for tetrahedron_method"},
{"permutation_symmetry_fc3",
(PyCFunction)py_set_permutation_symmetry_fc3,
METH_VARARGS,
"Set permutation symmetry for fc3"},
{"permutation_symmetry_compact_fc3",
(PyCFunction)py_set_permutation_symmetry_compact_fc3,
METH_VARARGS,
"Set permutation symmetry for compact-fc3"},
{"transpose_compact_fc3",
(PyCFunction)py_transpose_compact_fc3,
METH_VARARGS,
"Transpose compact fc3"},
{"neighboring_grid_points",
(PyCFunction)py_get_neighboring_gird_points,
METH_VARARGS,
"Neighboring grid points by relative grid addresses"},
{"integration_weights",
(PyCFunction)py_set_integration_weights,
METH_VARARGS,
"Integration weights of tetrahedron method"},
{"triplets_reciprocal_mesh_at_q",
(PyCFunction)py_tpl_get_triplets_reciprocal_mesh_at_q,
METH_VARARGS,
"Triplets on reciprocal mesh points at a specific q-point"},
{"BZ_triplets_at_q",
(PyCFunction)py_tpl_get_BZ_triplets_at_q,
METH_VARARGS,
"Triplets in reciprocal primitive lattice are transformed to those in BZ."},
{"triplets_integration_weights",
(PyCFunction)py_set_triplets_integration_weights,
METH_VARARGS,
"Integration weights of tetrahedron method for triplets"},
{"triplets_integration_weights_with_sigma",
(PyCFunction)py_set_triplets_integration_weights_with_sigma,
METH_VARARGS,
"Integration weights of smearing method for triplets"},
{"diagonalize_collision_matrix",
(PyCFunction)py_diagonalize_collision_matrix,
METH_VARARGS,
"Diagonalize and optionally pseudo-inverse using Lapack dsyev(d)"},
{"pinv_from_eigensolution",
(PyCFunction)py_pinv_from_eigensolution,
METH_VARARGS,
"Pseudo-inverse from eigensolution"},
{"default_colmat_solver",
(PyCFunction)py_get_default_colmat_solver,
METH_VARARGS,
"Return default collison matrix solver by integer value"},
#ifdef LIBFLAME
{"inverse_collision_matrix_libflame",
(PyCFunction)py_inverse_collision_matrix_libflame,
METH_VARARGS,
"Pseudo-inverse using libflame hevd"},
#endif
{NULL, NULL, 0, NULL}
};
#if PY_MAJOR_VERSION >= 3
static int _phono3py_traverse(PyObject *m, visitproc visit, void *arg) {
Py_VISIT(GETSTATE(m)->error);
return 0;
}
static int _phono3py_clear(PyObject *m) {
Py_CLEAR(GETSTATE(m)->error);
return 0;
}
static struct PyModuleDef moduledef = {
PyModuleDef_HEAD_INIT,
"_phono3py",
NULL,
sizeof(struct module_state),
_phono3py_methods,
NULL,
_phono3py_traverse,
_phono3py_clear,
NULL
};
#define INITERROR return NULL
PyObject *
PyInit__phono3py(void)
#else
#define INITERROR return
void
init_phono3py(void)
#endif
{
#if PY_MAJOR_VERSION >= 3
PyObject *module = PyModule_Create(&moduledef);
#else
PyObject *module = Py_InitModule("_phono3py", _phono3py_methods);
#endif
struct module_state *st;
if (module == NULL)
INITERROR;
st = GETSTATE(module);
st->error = PyErr_NewException("_phono3py.Error", NULL, NULL);
if (st->error == NULL) {
Py_DECREF(module);
INITERROR;
}
#if PY_MAJOR_VERSION >= 3
return module;
#endif
}
static PyObject * py_get_phonons_at_gridpoints(PyObject *self, PyObject *args)
{
PyArrayObject* py_frequencies;
PyArrayObject* py_eigenvectors;
PyArrayObject* py_phonon_done;
PyArrayObject* py_grid_points;
PyArrayObject* py_grid_address;
PyArrayObject* py_mesh;
PyArrayObject* py_shortest_vectors_fc2;
PyArrayObject* py_multiplicity_fc2;
PyArrayObject* py_positions_fc2;
PyArrayObject* py_fc2;
PyArrayObject* py_masses_fc2;
PyArrayObject* py_p2s_map_fc2;
PyArrayObject* py_s2p_map_fc2;
PyArrayObject* py_reciprocal_lattice;
PyArrayObject* py_born_effective_charge;
PyArrayObject* py_q_direction;
PyArrayObject* py_dielectric_constant;
PyArrayObject* py_dd_q0;
PyArrayObject* py_G_list;
double nac_factor;
double unit_conversion_factor;
double lambda;
char* uplo;
double (*born)[3][3];
double (*dielectric)[3];
double *q_dir;
double* freqs;
lapack_complex_double* eigvecs;
char* phonon_done;
size_t* grid_points;
int (*grid_address)[3];
int* mesh;
double* fc2;
double(*svecs_fc2)[27][3];
int* multi_fc2;
double (*positions_fc2)[3];
double* masses_fc2;
int* p2s_fc2;
int* s2p_fc2;
double (*rec_lat)[3];
double * dd_q0;
double (*G_list)[3];
npy_intp num_patom, num_satom, num_phonons, num_grid_points, num_G_points;
if (!PyArg_ParseTuple(args, "OOOOOOOOOOOOOdOOOOdOOds",
&py_frequencies,
&py_eigenvectors,
&py_phonon_done,
&py_grid_points,
&py_grid_address,
&py_mesh,
&py_fc2,
&py_shortest_vectors_fc2,
&py_multiplicity_fc2,
&py_positions_fc2,
&py_masses_fc2,
&py_p2s_map_fc2,
&py_s2p_map_fc2,
&unit_conversion_factor,
&py_born_effective_charge,
&py_dielectric_constant,
&py_reciprocal_lattice,
&py_q_direction,
&nac_factor,
&py_dd_q0,
&py_G_list,
&lambda,
&uplo)) {
return NULL;
}
freqs = (double*)PyArray_DATA(py_frequencies);
eigvecs = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
phonon_done = (char*)PyArray_DATA(py_phonon_done);
grid_points = (size_t*)PyArray_DATA(py_grid_points);
grid_address = (int(*)[3])PyArray_DATA(py_grid_address);
mesh = (int*)PyArray_DATA(py_mesh);
fc2 = (double*)PyArray_DATA(py_fc2);
svecs_fc2 = (double(*)[27][3])PyArray_DATA(py_shortest_vectors_fc2);
multi_fc2 = (int*)PyArray_DATA(py_multiplicity_fc2);
masses_fc2 = (double*)PyArray_DATA(py_masses_fc2);
p2s_fc2 = (int*)PyArray_DATA(py_p2s_map_fc2);
s2p_fc2 = (int*)PyArray_DATA(py_s2p_map_fc2);
rec_lat = (double(*)[3])PyArray_DATA(py_reciprocal_lattice);
num_patom = PyArray_DIMS(py_multiplicity_fc2)[1];
num_satom = PyArray_DIMS(py_multiplicity_fc2)[0];
num_phonons = PyArray_DIMS(py_frequencies)[0];
num_grid_points = PyArray_DIMS(py_grid_points)[0];
if ((PyObject*)py_born_effective_charge == Py_None) {
born = NULL;
} else {
born = (double(*)[3][3])PyArray_DATA(py_born_effective_charge);
}
if ((PyObject*)py_dielectric_constant == Py_None) {
dielectric = NULL;
} else {
dielectric = (double(*)[3])PyArray_DATA(py_dielectric_constant);
}
if ((PyObject*)py_q_direction == Py_None) {
q_dir = NULL;
} else {
q_dir = (double*)PyArray_DATA(py_q_direction);
if (fabs(q_dir[0]) < 1e-10 &&
fabs(q_dir[1]) < 1e-10 &&
fabs(q_dir[2]) < 1e-10) {
q_dir = NULL;
}
}
if ((PyObject*)py_dd_q0 == Py_None) {
dd_q0 = NULL;
} else {
dd_q0 = (double*)PyArray_DATA(py_dd_q0);
}
if ((PyObject*)py_G_list == Py_None) {
G_list = NULL;
num_G_points = 0;
} else {
G_list = (double(*)[3])PyArray_DATA(py_G_list);
num_G_points = PyArray_DIMS(py_G_list)[0];
}
if ((PyObject*)py_positions_fc2 == Py_None) {
positions_fc2 = NULL;
} else {
positions_fc2 = (double(*)[3])PyArray_DATA(py_positions_fc2);
}
if (!dd_q0) {
phn_get_phonons_at_gridpoints(freqs,
eigvecs,
phonon_done,
num_phonons,
grid_points,
num_grid_points,
grid_address,
mesh,
fc2,
svecs_fc2,
multi_fc2,
num_patom,
num_satom,
masses_fc2,
p2s_fc2,
s2p_fc2,
unit_conversion_factor,
born,
dielectric,
rec_lat,
q_dir,
nac_factor,
uplo[0]);
} else {
phn_get_gonze_phonons_at_gridpoints(freqs,
eigvecs,
phonon_done,
num_phonons,
grid_points,
num_grid_points,
grid_address,
mesh,
fc2,
svecs_fc2,
multi_fc2,
positions_fc2,
num_patom,
num_satom,
masses_fc2,
p2s_fc2,
s2p_fc2,
unit_conversion_factor,
born,
dielectric,
rec_lat,
q_dir,
nac_factor,
dd_q0,
G_list,
num_G_points,
lambda,
uplo[0]);
}
Py_RETURN_NONE;
}
static PyObject * py_get_interaction(PyObject *self, PyObject *args)
{
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_g_zero;
PyArrayObject *py_frequencies;
PyArrayObject *py_eigenvectors;
PyArrayObject *py_triplets;
PyArrayObject *py_grid_address;
PyArrayObject *py_mesh;
PyArrayObject *py_shortest_vectors;
PyArrayObject *py_multiplicities;
PyArrayObject *py_fc3;
PyArrayObject *py_masses;
PyArrayObject *py_p2s_map;
PyArrayObject *py_s2p_map;
PyArrayObject *py_band_indices;
double cutoff_frequency;
int symmetrize_fc3_q;
Darray *fc3_normal_squared;
Darray *freqs;
lapack_complex_double *eigvecs;
size_t (*triplets)[3];
npy_intp num_triplets;
char* g_zero;
int *grid_address;
int *mesh;
double *fc3;
double *svecs;
int *multi;
double *masses;
int *p2s;
int *s2p;
int *band_indices;
int svecs_dims[3];
int i;
int is_compact_fc3;
if (!PyArg_ParseTuple(args, "OOOOOOOOOOOOOOid",
&py_fc3_normal_squared,
&py_g_zero,
&py_frequencies,
&py_eigenvectors,
&py_triplets,
&py_grid_address,
&py_mesh,
&py_fc3,
&py_shortest_vectors,
&py_multiplicities,
&py_masses,
&py_p2s_map,
&py_s2p_map,
&py_band_indices,
&symmetrize_fc3_q,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
freqs = convert_to_darray(py_frequencies);
/* npy_cdouble and lapack_complex_double may not be compatible. */
/* So eigenvectors should not be used in Python side */
eigvecs = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
num_triplets = PyArray_DIMS(py_triplets)[0];
g_zero = (char*)PyArray_DATA(py_g_zero);
grid_address = (int*)PyArray_DATA(py_grid_address);
mesh = (int*)PyArray_DATA(py_mesh);
fc3 = (double*)PyArray_DATA(py_fc3);
if (PyArray_DIMS(py_fc3)[0] == PyArray_DIMS(py_fc3)[1]) {
is_compact_fc3 = 0;
} else {
is_compact_fc3 = 1;
}
svecs = (double*)PyArray_DATA(py_shortest_vectors);
for (i = 0; i < 3; i++) {
svecs_dims[i] = PyArray_DIMS(py_shortest_vectors)[i];
}
multi = (int*)PyArray_DATA(py_multiplicities);
masses = (double*)PyArray_DATA(py_masses);
p2s = (int*)PyArray_DATA(py_p2s_map);
s2p = (int*)PyArray_DATA(py_s2p_map);
band_indices = (int*)PyArray_DATA(py_band_indices);
itr_get_interaction(fc3_normal_squared,
g_zero,
freqs,
eigvecs,
triplets,
num_triplets,
grid_address,
mesh,
fc3,
is_compact_fc3,
svecs,
svecs_dims,
multi,
masses,
p2s,
s2p,
band_indices,
symmetrize_fc3_q,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
free(freqs);
freqs = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_pp_collision(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma;
PyArrayObject *py_relative_grid_address;
PyArrayObject *py_frequencies;
PyArrayObject *py_eigenvectors;
PyArrayObject *py_triplets;
PyArrayObject *py_triplet_weights;
PyArrayObject *py_grid_address;
PyArrayObject *py_bz_map;
PyArrayObject *py_mesh;
PyArrayObject *py_fc3;
PyArrayObject *py_shortest_vectors;
PyArrayObject *py_multiplicities;
PyArrayObject *py_masses;
PyArrayObject *py_p2s_map;
PyArrayObject *py_s2p_map;
PyArrayObject *py_band_indices;
PyArrayObject *py_temperatures;
double cutoff_frequency;
int is_NU;
int symmetrize_fc3_q;
double *gamma;
int (*relative_grid_address)[4][3];
double *frequencies;
lapack_complex_double *eigenvectors;
size_t (*triplets)[3];
npy_intp num_triplets;
int *triplet_weights;
int *grid_address;
size_t *bz_map;
int *mesh;
double *fc3;
double *svecs;
int *multi;
double *masses;
int *p2s;
int *s2p;
Iarray *band_indices;
Darray *temperatures;
int svecs_dims[3];
int i;
int is_compact_fc3;
if (!PyArg_ParseTuple(args, "OOOOOOOOOOOOOOOOOiid",
&py_gamma,
&py_relative_grid_address,
&py_frequencies,
&py_eigenvectors,
&py_triplets,
&py_triplet_weights,
&py_grid_address,
&py_bz_map,
&py_mesh,
&py_fc3,
&py_shortest_vectors,
&py_multiplicities,
&py_masses,
&py_p2s_map,
&py_s2p_map,
&py_band_indices,
&py_temperatures,
&is_NU,
&symmetrize_fc3_q,
&cutoff_frequency)) {
return NULL;
}
gamma = (double*)PyArray_DATA(py_gamma);
relative_grid_address = (int(*)[4][3])PyArray_DATA(py_relative_grid_address);
frequencies = (double*)PyArray_DATA(py_frequencies);
eigenvectors = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
num_triplets = PyArray_DIMS(py_triplets)[0];
triplet_weights = (int*)PyArray_DATA(py_triplet_weights);
grid_address = (int*)PyArray_DATA(py_grid_address);
bz_map = (size_t*)PyArray_DATA(py_bz_map);
mesh = (int*)PyArray_DATA(py_mesh);
fc3 = (double*)PyArray_DATA(py_fc3);
if (PyArray_DIMS(py_fc3)[0] == PyArray_DIMS(py_fc3)[1]) {
is_compact_fc3 = 0;
} else {
is_compact_fc3 = 1;
}
svecs = (double*)PyArray_DATA(py_shortest_vectors);
for (i = 0; i < 3; i++) {
svecs_dims[i] = PyArray_DIMS(py_shortest_vectors)[i];
}
multi = (int*)PyArray_DATA(py_multiplicities);
masses = (double*)PyArray_DATA(py_masses);
p2s = (int*)PyArray_DATA(py_p2s_map);
s2p = (int*)PyArray_DATA(py_s2p_map);
band_indices = convert_to_iarray(py_band_indices);
temperatures = convert_to_darray(py_temperatures);
ppc_get_pp_collision(gamma,
relative_grid_address,
frequencies,
eigenvectors,
triplets,
num_triplets,
triplet_weights,
grid_address,
bz_map,
mesh,
fc3,
is_compact_fc3,
svecs,
svecs_dims,
multi,
masses,
p2s,
s2p,
band_indices,
temperatures,
is_NU,
symmetrize_fc3_q,
cutoff_frequency);
free(band_indices);
band_indices = NULL;
free(temperatures);
temperatures = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_pp_collision_with_sigma(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma;
PyArrayObject *py_frequencies;
PyArrayObject *py_eigenvectors;
PyArrayObject *py_triplets;
PyArrayObject *py_triplet_weights;
PyArrayObject *py_grid_address;
PyArrayObject *py_mesh;
PyArrayObject *py_fc3;
PyArrayObject *py_shortest_vectors;
PyArrayObject *py_multiplicities;
PyArrayObject *py_masses;
PyArrayObject *py_p2s_map;
PyArrayObject *py_s2p_map;
PyArrayObject *py_band_indices;
PyArrayObject *py_temperatures;
int is_NU;
int symmetrize_fc3_q;
double sigma;
double sigma_cutoff;
double cutoff_frequency;
double *gamma;
double *frequencies;
lapack_complex_double *eigenvectors;
size_t (*triplets)[3];
npy_intp num_triplets;
int *triplet_weights;
int *grid_address;
int *mesh;
double *fc3;
double *svecs;
int *multi;
double *masses;
int *p2s;
int *s2p;
Iarray *band_indices;
Darray *temperatures;
int svecs_dims[3];
int i;
int is_compact_fc3;
if (!PyArg_ParseTuple(args, "OddOOOOOOOOOOOOOOiid",
&py_gamma,
&sigma,
&sigma_cutoff,
&py_frequencies,
&py_eigenvectors,
&py_triplets,
&py_triplet_weights,
&py_grid_address,
&py_mesh,
&py_fc3,
&py_shortest_vectors,
&py_multiplicities,
&py_masses,
&py_p2s_map,
&py_s2p_map,
&py_band_indices,
&py_temperatures,
&is_NU,
&symmetrize_fc3_q,
&cutoff_frequency)) {
return NULL;
}
gamma = (double*)PyArray_DATA(py_gamma);
frequencies = (double*)PyArray_DATA(py_frequencies);
eigenvectors = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
num_triplets = PyArray_DIMS(py_triplets)[0];
triplet_weights = (int*)PyArray_DATA(py_triplet_weights);
grid_address = (int*)PyArray_DATA(py_grid_address);
mesh = (int*)PyArray_DATA(py_mesh);
fc3 = (double*)PyArray_DATA(py_fc3);
if (PyArray_DIMS(py_fc3)[0] == PyArray_DIMS(py_fc3)[1]) {
is_compact_fc3 = 0;
} else {
is_compact_fc3 = 1;
}
svecs = (double*)PyArray_DATA(py_shortest_vectors);
for (i = 0; i < 3; i++) {
svecs_dims[i] = PyArray_DIMS(py_shortest_vectors)[i];
}
multi = (int*)PyArray_DATA(py_multiplicities);
masses = (double*)PyArray_DATA(py_masses);
p2s = (int*)PyArray_DATA(py_p2s_map);
s2p = (int*)PyArray_DATA(py_s2p_map);
band_indices = convert_to_iarray(py_band_indices);
temperatures = convert_to_darray(py_temperatures);
ppc_get_pp_collision_with_sigma(gamma,
sigma,
sigma_cutoff,
frequencies,
eigenvectors,
triplets,
num_triplets,
triplet_weights,
grid_address,
mesh,
fc3,
is_compact_fc3,
svecs,
svecs_dims,
multi,
masses,
p2s,
s2p,
band_indices,
temperatures,
is_NU,
symmetrize_fc3_q,
cutoff_frequency);
free(band_indices);
band_indices = NULL;
free(temperatures);
temperatures = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_imag_self_energy_with_g(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma;
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_frequencies;
PyArrayObject *py_triplets;
PyArrayObject *py_triplet_weights;
PyArrayObject *py_g;
PyArrayObject *py_g_zero;
double cutoff_frequency, temperature;
Darray *fc3_normal_squared;
double *gamma;
double *g;
char* g_zero;
double *frequencies;
size_t (*triplets)[3];
int *triplet_weights;
if (!PyArg_ParseTuple(args, "OOOOOdOOd",
&py_gamma,
&py_fc3_normal_squared,
&py_triplets,
&py_triplet_weights,
&py_frequencies,
&temperature,
&py_g,
&py_g_zero,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
gamma = (double*)PyArray_DATA(py_gamma);
g = (double*)PyArray_DATA(py_g);
g_zero = (char*)PyArray_DATA(py_g_zero);
frequencies = (double*)PyArray_DATA(py_frequencies);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
triplet_weights = (int*)PyArray_DATA(py_triplet_weights);
ise_get_imag_self_energy_at_bands_with_g(gamma,
fc3_normal_squared,
frequencies,
triplets,
triplet_weights,
g,
g_zero,
temperature,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
Py_RETURN_NONE;
}
static PyObject *
py_get_detailed_imag_self_energy_with_g(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma_detail;
PyArrayObject *py_gamma_N;
PyArrayObject *py_gamma_U;
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_frequencies;
PyArrayObject *py_triplets;
PyArrayObject *py_triplet_weights;
PyArrayObject *py_grid_address;
PyArrayObject *py_g;
PyArrayObject *py_g_zero;
double cutoff_frequency, temperature;
Darray *fc3_normal_squared;
double *gamma_detail;
double *gamma_N;
double *gamma_U;
double *g;
char* g_zero;
double *frequencies;
size_t (*triplets)[3];
int *triplet_weights;
int *grid_address;
if (!PyArg_ParseTuple(args, "OOOOOOOOdOOd",
&py_gamma_detail,
&py_gamma_N,
&py_gamma_U,
&py_fc3_normal_squared,
&py_triplets,
&py_triplet_weights,
&py_grid_address,
&py_frequencies,
&temperature,
&py_g,
&py_g_zero,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
gamma_detail = (double*)PyArray_DATA(py_gamma_detail);
gamma_N = (double*)PyArray_DATA(py_gamma_N);
gamma_U = (double*)PyArray_DATA(py_gamma_U);
g = (double*)PyArray_DATA(py_g);
g_zero = (char*)PyArray_DATA(py_g_zero);
frequencies = (double*)PyArray_DATA(py_frequencies);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
triplet_weights = (int*)PyArray_DATA(py_triplet_weights);
grid_address = (int*)PyArray_DATA(py_grid_address);
ise_get_detailed_imag_self_energy_at_bands_with_g(gamma_detail,
gamma_N,
gamma_U,
fc3_normal_squared,
frequencies,
triplets,
triplet_weights,
grid_address,
g,
g_zero,
temperature,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_frequency_shift_at_bands(PyObject *self,
PyObject *args)
{
PyArrayObject *py_shift;
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_frequencies;
PyArrayObject *py_triplets;
PyArrayObject *py_triplet_weights;
PyArrayObject *py_band_indices;
double epsilon, unit_conversion_factor, cutoff_frequency, temperature;
Darray *fc3_normal_squared;
double *shift;
double *frequencies;
int *band_indices;
int *grid_point_triplets;
int *triplet_weights;
if (!PyArg_ParseTuple(args, "OOOOOOdddd",
&py_shift,
&py_fc3_normal_squared,
&py_triplets,
&py_triplet_weights,
&py_frequencies,
&py_band_indices,
&temperature,
&epsilon,
&unit_conversion_factor,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
shift = (double*)PyArray_DATA(py_shift);
frequencies = (double*)PyArray_DATA(py_frequencies);
band_indices = (int*)PyArray_DATA(py_band_indices);
grid_point_triplets = (int*)PyArray_DATA(py_triplets);
triplet_weights = (int*)PyArray_DATA(py_triplet_weights);
get_frequency_shift_at_bands(shift,
fc3_normal_squared,
band_indices,
frequencies,
grid_point_triplets,
triplet_weights,
epsilon,
temperature,
unit_conversion_factor,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_collision_matrix(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_frequencies;
PyArrayObject *py_triplets;
PyArrayObject *py_triplets_map;
PyArrayObject *py_map_q;
PyArrayObject *py_g;
PyArrayObject *py_rotated_grid_points;
PyArrayObject *py_rotations_cartesian;
double temperature, unit_conversion_factor, cutoff_frequency;
Darray *fc3_normal_squared;
double *collision_matrix;
double *g;
double *frequencies;
size_t (*triplets)[3];
size_t *triplets_map;
size_t *map_q;
size_t *rotated_grid_points;
npy_intp num_gp, num_ir_gp, num_rot;
double *rotations_cartesian;
if (!PyArg_ParseTuple(args, "OOOOOOOOOddd",
&py_collision_matrix,
&py_fc3_normal_squared,
&py_frequencies,
&py_g,
&py_triplets,
&py_triplets_map,
&py_map_q,
&py_rotated_grid_points,
&py_rotations_cartesian,
&temperature,
&unit_conversion_factor,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
g = (double*)PyArray_DATA(py_g);
frequencies = (double*)PyArray_DATA(py_frequencies);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
triplets_map = (size_t*)PyArray_DATA(py_triplets_map);
num_gp = PyArray_DIMS(py_triplets_map)[0];
map_q = (size_t*)PyArray_DATA(py_map_q);
rotated_grid_points = (size_t*)PyArray_DATA(py_rotated_grid_points);
num_ir_gp = PyArray_DIMS(py_rotated_grid_points)[0];
num_rot = PyArray_DIMS(py_rotated_grid_points)[1];
rotations_cartesian = (double*)PyArray_DATA(py_rotations_cartesian);
assert(num_rot == PyArray_DIMS(py_rotations_cartesian)[0]);
assert(num_gp == PyArray_DIMS(py_frequencies)[0]);
col_get_collision_matrix(collision_matrix,
fc3_normal_squared,
frequencies,
triplets,
triplets_map,
map_q,
rotated_grid_points,
rotations_cartesian,
g,
num_ir_gp,
num_gp,
num_rot,
temperature,
unit_conversion_factor,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_reducible_collision_matrix(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_fc3_normal_squared;
PyArrayObject *py_frequencies;
PyArrayObject *py_triplets;
PyArrayObject *py_triplets_map;
PyArrayObject *py_map_q;
PyArrayObject *py_g;
double temperature, unit_conversion_factor, cutoff_frequency;
Darray *fc3_normal_squared;
double *collision_matrix;
double *g;
double *frequencies;
size_t (*triplets)[3];
size_t *triplets_map;
npy_intp num_gp;
size_t *map_q;
if (!PyArg_ParseTuple(args, "OOOOOOOddd",
&py_collision_matrix,
&py_fc3_normal_squared,
&py_frequencies,
&py_g,
&py_triplets,
&py_triplets_map,
&py_map_q,
&temperature,
&unit_conversion_factor,
&cutoff_frequency)) {
return NULL;
}
fc3_normal_squared = convert_to_darray(py_fc3_normal_squared);
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
g = (double*)PyArray_DATA(py_g);
frequencies = (double*)PyArray_DATA(py_frequencies);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
triplets_map = (size_t*)PyArray_DATA(py_triplets_map);
num_gp = PyArray_DIMS(py_triplets_map)[0];
map_q = (size_t*)PyArray_DATA(py_map_q);
col_get_reducible_collision_matrix(collision_matrix,
fc3_normal_squared,
frequencies,
triplets,
triplets_map,
map_q,
g,
num_gp,
temperature,
unit_conversion_factor,
cutoff_frequency);
free(fc3_normal_squared);
fc3_normal_squared = NULL;
Py_RETURN_NONE;
}
static PyObject * py_symmetrize_collision_matrix(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
double *collision_matrix;
size_t i, j, k, l;
npy_intp num_band, num_grid_points, num_temp, num_sigma;
size_t adrs_shift, num_column;
double val;
if (!PyArg_ParseTuple(args, "O",
&py_collision_matrix)) {
return NULL;
}
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
num_sigma = PyArray_DIMS(py_collision_matrix)[0];
num_temp = PyArray_DIMS(py_collision_matrix)[1];
num_grid_points = PyArray_DIMS(py_collision_matrix)[2];
num_band = PyArray_DIMS(py_collision_matrix)[3];
if (PyArray_NDIM(py_collision_matrix) == 8) {
num_column = num_grid_points * num_band * 3;
} else {
num_column = num_grid_points * num_band;
}
for (i = 0; i < num_sigma; i++) {
for (j = 0; j < num_temp; j++) {
adrs_shift = (i * num_column * num_column * num_temp +
j * num_column * num_column);
/* show_colmat_info(py_collision_matrix, i, j, adrs_shift); */
#pragma omp parallel for schedule(guided) private(l, val)
for (k = 0; k < num_column; k++) {
for (l = k + 1; l < num_column; l++) {
val = (collision_matrix[adrs_shift + k * num_column + l] +
collision_matrix[adrs_shift + l * num_column + k]) / 2;
collision_matrix[adrs_shift + k * num_column + l] = val;
collision_matrix[adrs_shift + l * num_column + k] = val;
}
}
}
}
Py_RETURN_NONE;
}
static PyObject * py_expand_collision_matrix(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_ir_grid_points;
PyArrayObject *py_rot_grid_points;
double *collision_matrix;
size_t *rot_grid_points;
size_t *ir_grid_points;
size_t i, j, k, l, m, n, p;
size_t adrs_shift, adrs_shift_plus, num_column, ir_gp, num_bgb, gp_r;
npy_intp num_band, num_grid_points, num_temp, num_sigma, num_rot, num_ir_gp;
size_t *multi;
double *colmat_copy;
if (!PyArg_ParseTuple(args, "OOO",
&py_collision_matrix,
&py_ir_grid_points,
&py_rot_grid_points)) {
return NULL;
}
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
rot_grid_points = (size_t*)PyArray_DATA(py_rot_grid_points);
ir_grid_points = (size_t*)PyArray_DATA(py_ir_grid_points);
num_sigma = PyArray_DIMS(py_collision_matrix)[0];
num_temp = PyArray_DIMS(py_collision_matrix)[1];
num_grid_points = PyArray_DIMS(py_collision_matrix)[2];
num_band = PyArray_DIMS(py_collision_matrix)[3];
num_rot = PyArray_DIMS(py_rot_grid_points)[0];
num_ir_gp = PyArray_DIMS(py_ir_grid_points)[0];
num_column = num_grid_points * num_band;
num_bgb = num_band * num_grid_points * num_band;
assert(num_grid_points == PyArray_DIMS(py_rot_grid_points)[1]);
multi = (size_t*)malloc(sizeof(size_t) * num_ir_gp);
colmat_copy = NULL;
#pragma omp parallel for schedule(guided) private(j, ir_gp)
for (i = 0; i < num_ir_gp; i++) {
ir_gp = ir_grid_points[i];
multi[i] = 0;
for (j = 0; j < num_rot; j++) {
if (rot_grid_points[j * num_grid_points + ir_gp] == ir_gp) {
multi[i]++;
}
}
}
for (i = 0; i < num_sigma; i++) {
for (j = 0; j < num_temp; j++) {
adrs_shift = (i * num_column * num_column * num_temp +
j * num_column * num_column);
#pragma omp parallel for private(ir_gp, adrs_shift_plus, colmat_copy, l, gp_r, m, n, p)
for (k = 0; k < num_ir_gp; k++) {
ir_gp = ir_grid_points[k];
adrs_shift_plus = adrs_shift + ir_gp * num_bgb;
colmat_copy = (double*)malloc(sizeof(double) * num_bgb);
for (l = 0; l < num_bgb; l++) {
colmat_copy[l] = collision_matrix[adrs_shift_plus + l] / multi[k];
collision_matrix[adrs_shift_plus + l] = 0;
}
for (l = 0; l < num_rot; l++) {
gp_r = rot_grid_points[l * num_grid_points + ir_gp];
for (m = 0; m < num_band; m++) {
for (n = 0; n < num_grid_points; n++) {
for (p = 0; p < num_band; p++) {
collision_matrix[
adrs_shift + gp_r * num_bgb + m * num_grid_points * num_band
+ rot_grid_points[l * num_grid_points + n] * num_band + p] +=
colmat_copy[m * num_grid_points * num_band + n * num_band + p];
}
}
}
}
free(colmat_copy);
colmat_copy = NULL;
}
}
}
free(multi);
multi = NULL;
Py_RETURN_NONE;
}
static PyObject * py_get_isotope_strength(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma;
PyArrayObject *py_frequencies;
PyArrayObject *py_eigenvectors;
PyArrayObject *py_band_indices;
PyArrayObject *py_mass_variances;
long grid_point;
long num_grid_points;
double cutoff_frequency;
double sigma;
double *gamma;
double *frequencies;
lapack_complex_double *eigenvectors;
int *band_indices;
double *mass_variances;
npy_intp num_band, num_band0;
if (!PyArg_ParseTuple(args, "OlOOOOldd",
&py_gamma,
&grid_point,
&py_mass_variances,
&py_frequencies,
&py_eigenvectors,
&py_band_indices,
&num_grid_points,
&sigma,
&cutoff_frequency)) {
return NULL;
}
gamma = (double*)PyArray_DATA(py_gamma);
frequencies = (double*)PyArray_DATA(py_frequencies);
eigenvectors = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
band_indices = (int*)PyArray_DATA(py_band_indices);
mass_variances = (double*)PyArray_DATA(py_mass_variances);
num_band = PyArray_DIMS(py_frequencies)[1];
num_band0 = PyArray_DIMS(py_band_indices)[0];
/* int i, j, k; */
/* double f, f0; */
/* int *weights, *ir_grid_points; */
/* double *integration_weights; */
/* ir_grid_points = (int*)malloc(sizeof(int) * num_grid_points); */
/* weights = (int*)malloc(sizeof(int) * num_grid_points); */
/* integration_weights = (double*)malloc(sizeof(double) * */
/* num_grid_points * num_band0 * num_band); */
/* for (i = 0; i < num_grid_points; i++) { */
/* ir_grid_points[i] = i; */
/* weights[i] = 1; */
/* for (j = 0; j < num_band0; j++) { */
/* f0 = frequencies[grid_point * num_band + band_indices[j]]; */
/* for (k = 0; k < num_band; k++) { */
/* f = frequencies[i * num_band + k]; */
/* integration_weights[i * num_band0 * num_band + */
/* j * num_band + k] = gaussian(f - f0, sigma); */
/* } */
/* } */
/* } */
/* get_thm_isotope_scattering_strength(gamma, */
/* grid_point, */
/* ir_grid_points, */
/* weights, */
/* mass_variances, */
/* frequencies, */
/* eigenvectors, */
/* num_grid_points, */
/* band_indices, */
/* num_band, */
/* num_band0, */
/* integration_weights, */
/* cutoff_frequency); */
/* free(ir_grid_points); */
/* free(weights); */
/* free(integration_weights); */
iso_get_isotope_scattering_strength(gamma,
grid_point,
mass_variances,
frequencies,
eigenvectors,
num_grid_points,
band_indices,
num_band,
num_band0,
sigma,
cutoff_frequency);
Py_RETURN_NONE;
}
static PyObject * py_get_thm_isotope_strength(PyObject *self, PyObject *args)
{
PyArrayObject *py_gamma;
PyArrayObject *py_frequencies;
PyArrayObject *py_eigenvectors;
PyArrayObject *py_band_indices;
PyArrayObject *py_mass_variances;
PyArrayObject *py_ir_grid_points;
PyArrayObject *py_weights;
PyArrayObject *py_integration_weights;
long grid_point;
double cutoff_frequency;
double *gamma;
double *frequencies;
size_t *ir_grid_points;
int *weights;
lapack_complex_double *eigenvectors;
int *band_indices;
double *mass_variances;
npy_intp num_band, num_band0, num_ir_grid_points;
double *integration_weights;
if (!PyArg_ParseTuple(args, "OlOOOOOOOd",
&py_gamma,
&grid_point,
&py_ir_grid_points,
&py_weights,
&py_mass_variances,
&py_frequencies,
&py_eigenvectors,
&py_band_indices,
&py_integration_weights,
&cutoff_frequency)) {
return NULL;
}
gamma = (double*)PyArray_DATA(py_gamma);
frequencies = (double*)PyArray_DATA(py_frequencies);
ir_grid_points = (size_t*)PyArray_DATA(py_ir_grid_points);
weights = (int*)PyArray_DATA(py_weights);
eigenvectors = (lapack_complex_double*)PyArray_DATA(py_eigenvectors);
band_indices = (int*)PyArray_DATA(py_band_indices);
mass_variances = (double*)PyArray_DATA(py_mass_variances);
num_band = PyArray_DIMS(py_frequencies)[1];
num_band0 = PyArray_DIMS(py_band_indices)[0];
integration_weights = (double*)PyArray_DATA(py_integration_weights);
num_ir_grid_points = PyArray_DIMS(py_ir_grid_points)[0];
iso_get_thm_isotope_scattering_strength(gamma,
grid_point,
ir_grid_points,
weights,
mass_variances,
frequencies,
eigenvectors,
num_ir_grid_points,
band_indices,
num_band,
num_band0,
integration_weights,
cutoff_frequency);
Py_RETURN_NONE;
}
static PyObject * py_distribute_fc3(PyObject *self, PyObject *args)
{
PyArrayObject *force_constants_third;
int target;
int source;
PyArrayObject *rotation_cart_inv;
PyArrayObject *atom_mapping_py;
double *fc3;
double *rot_cart_inv;
int *atom_mapping;
npy_intp num_atom;
if (!PyArg_ParseTuple(args, "OiiOO",
&force_constants_third,
&target,
&source,
&atom_mapping_py,
&rotation_cart_inv)) {
return NULL;
}
fc3 = (double*)PyArray_DATA(force_constants_third);
rot_cart_inv = (double*)PyArray_DATA(rotation_cart_inv);
atom_mapping = (int*)PyArray_DATA(atom_mapping_py);
num_atom = PyArray_DIMS(atom_mapping_py)[0];
fc3_distribute_fc3(fc3,
target,
source,
atom_mapping,
num_atom,
rot_cart_inv);
Py_RETURN_NONE;
}
static PyObject * py_rotate_delta_fc2s(PyObject *self, PyObject *args)
{
PyArrayObject *py_fc3;
PyArrayObject *py_delta_fc2s;
PyArrayObject *py_inv_U;
PyArrayObject *py_site_sym_cart;
PyArrayObject *py_rot_map_syms;
double (*fc3)[3][3][3];
double (*delta_fc2s)[3][3];
double *inv_U;
double (*site_sym_cart)[3][3];
int *rot_map_syms;
npy_intp num_atom, num_disp, num_site_sym;
if (!PyArg_ParseTuple(args, "OOOOO",
&py_fc3,
&py_delta_fc2s,
&py_inv_U,
&py_site_sym_cart,
&py_rot_map_syms)) {
return NULL;
}
/* (num_atom, num_atom, 3, 3, 3) */
fc3 = (double(*)[3][3][3])PyArray_DATA(py_fc3);
/* (n_u1, num_atom, num_atom, 3, 3) */
delta_fc2s = (double(*)[3][3])PyArray_DATA(py_delta_fc2s);
/* (3, n_u1 * n_sym) */
inv_U = (double*)PyArray_DATA(py_inv_U);
/* (n_sym, 3, 3) */
site_sym_cart = (double(*)[3][3])PyArray_DATA(py_site_sym_cart);
/* (n_sym, natom) */
rot_map_syms = (int*)PyArray_DATA(py_rot_map_syms);
num_atom = PyArray_DIMS(py_fc3)[0];
num_disp = PyArray_DIMS(py_delta_fc2s)[0];
num_site_sym = PyArray_DIMS(py_site_sym_cart)[0];
fc3_rotate_delta_fc2(fc3,
delta_fc2s,
inv_U,
site_sym_cart,
rot_map_syms,
num_atom,
num_site_sym,
num_disp);
Py_RETURN_NONE;
}
static PyObject *
py_set_permutation_symmetry_fc3(PyObject *self, PyObject *args)
{
PyArrayObject *py_fc3;
double *fc3;
npy_intp num_atom;
if (!PyArg_ParseTuple(args, "O", &py_fc3)) {
return NULL;
}
fc3 = (double*)PyArray_DATA(py_fc3);
num_atom = PyArray_DIMS(py_fc3)[0];
fc3_set_permutation_symmetry_fc3(fc3, num_atom);
Py_RETURN_NONE;
}
static PyObject *
py_set_permutation_symmetry_compact_fc3(PyObject *self, PyObject *args)
{
PyArrayObject* py_fc3;
PyArrayObject* py_permutations;
PyArrayObject* py_s2pp_map;
PyArrayObject* py_p2s_map;
PyArrayObject* py_nsym_list;
double *fc3;
int *s2pp;
int *p2s;
int *nsym_list;
int *perms;
npy_intp n_patom, n_satom;
if (!PyArg_ParseTuple(args, "OOOOO",
&py_fc3,
&py_permutations,
&py_s2pp_map,
&py_p2s_map,
&py_nsym_list)) {
return NULL;
}
fc3 = (double*)PyArray_DATA(py_fc3);
perms = (int*)PyArray_DATA(py_permutations);
s2pp = (int*)PyArray_DATA(py_s2pp_map);
p2s = (int*)PyArray_DATA(py_p2s_map);
nsym_list = (int*)PyArray_DATA(py_nsym_list);
n_patom = PyArray_DIMS(py_fc3)[0];
n_satom = PyArray_DIMS(py_fc3)[1];
fc3_set_permutation_symmetry_compact_fc3(fc3,
p2s,
s2pp,
nsym_list,
perms,
n_satom,
n_patom);
Py_RETURN_NONE;
}
static PyObject * py_transpose_compact_fc3(PyObject *self, PyObject *args)
{
PyArrayObject* py_fc3;
PyArrayObject* py_permutations;
PyArrayObject* py_s2pp_map;
PyArrayObject* py_p2s_map;
PyArrayObject* py_nsym_list;
int t_type;
double *fc3;
int *s2pp;
int *p2s;
int *nsym_list;
int *perms;
npy_intp n_patom, n_satom;
if (!PyArg_ParseTuple(args, "OOOOOi",
&py_fc3,
&py_permutations,
&py_s2pp_map,
&py_p2s_map,
&py_nsym_list,
&t_type)) {
return NULL;
}
fc3 = (double*)PyArray_DATA(py_fc3);
perms = (int*)PyArray_DATA(py_permutations);
s2pp = (int*)PyArray_DATA(py_s2pp_map);
p2s = (int*)PyArray_DATA(py_p2s_map);
nsym_list = (int*)PyArray_DATA(py_nsym_list);
n_patom = PyArray_DIMS(py_fc3)[0];
n_satom = PyArray_DIMS(py_fc3)[1];
fc3_transpose_compact_fc3(fc3,
p2s,
s2pp,
nsym_list,
perms,
n_satom,
n_patom,
t_type);
Py_RETURN_NONE;
}
static PyObject * py_get_neighboring_gird_points(PyObject *self, PyObject *args)
{
PyArrayObject *py_relative_grid_points;
PyArrayObject *py_grid_points;
PyArrayObject *py_relative_grid_address;
PyArrayObject *py_mesh;
PyArrayObject *py_bz_grid_address;
PyArrayObject *py_bz_map;
size_t *relative_grid_points;
size_t *grid_points;
npy_intp num_grid_points, num_relative_grid_address;
int (*relative_grid_address)[3];
int *mesh;
int (*bz_grid_address)[3];
size_t *bz_map;
size_t i;
if (!PyArg_ParseTuple(args, "OOOOOO",
&py_relative_grid_points,
&py_grid_points,
&py_relative_grid_address,
&py_mesh,
&py_bz_grid_address,
&py_bz_map)) {
return NULL;
}
relative_grid_points = (size_t*)PyArray_DATA(py_relative_grid_points);
grid_points = (size_t*)PyArray_DATA(py_grid_points);
num_grid_points = PyArray_DIMS(py_grid_points)[0];
relative_grid_address = (int(*)[3])PyArray_DATA(py_relative_grid_address);
num_relative_grid_address = PyArray_DIMS(py_relative_grid_address)[0];
mesh = (int*)PyArray_DATA(py_mesh);
bz_grid_address = (int(*)[3])PyArray_DATA(py_bz_grid_address);
bz_map = (size_t*)PyArray_DATA(py_bz_map);
#pragma omp parallel for
for (i = 0; i < num_grid_points; i++) {
thm_get_dense_neighboring_grid_points
(relative_grid_points + i * num_relative_grid_address,
grid_points[i],
relative_grid_address,
num_relative_grid_address,
mesh,
bz_grid_address,
bz_map);
}
Py_RETURN_NONE;
}
static PyObject * py_set_integration_weights(PyObject *self, PyObject *args)
{
PyArrayObject *py_iw;
PyArrayObject *py_frequency_points;
PyArrayObject *py_relative_grid_address;
PyArrayObject *py_mesh;
PyArrayObject *py_grid_points;
PyArrayObject *py_frequencies;
PyArrayObject *py_bz_grid_address;
PyArrayObject *py_bz_map;
double *iw;
double *frequency_points;
npy_intp num_band0, num_band, num_gp;
size_t i, j, k, bi;
int (*relative_grid_address)[4][3];
int *mesh;
size_t *grid_points;
int (*bz_grid_address)[3];
size_t *bz_map;
double *frequencies;
size_t vertices[24][4];
double freq_vertices[24][4];
if (!PyArg_ParseTuple(args, "OOOOOOOO",
&py_iw,
&py_frequency_points,
&py_relative_grid_address,
&py_mesh,
&py_grid_points,
&py_frequencies,
&py_bz_grid_address,
&py_bz_map)) {
return NULL;
}
iw = (double*)PyArray_DATA(py_iw);
frequency_points = (double*)PyArray_DATA(py_frequency_points);
num_band0 = PyArray_DIMS(py_frequency_points)[0];
relative_grid_address = (int(*)[4][3])PyArray_DATA(py_relative_grid_address);
mesh = (int*)PyArray_DATA(py_mesh);
grid_points = (size_t*)PyArray_DATA(py_grid_points);
num_gp = PyArray_DIMS(py_grid_points)[0];
bz_grid_address = (int(*)[3])PyArray_DATA(py_bz_grid_address);
bz_map = (size_t*)PyArray_DATA(py_bz_map);
frequencies = (double*)PyArray_DATA(py_frequencies);
num_band = PyArray_DIMS(py_frequencies)[1];
#pragma omp parallel for private(j, k, bi, vertices, freq_vertices)
for (i = 0; i < num_gp; i++) {
for (j = 0; j < 24; j++) {
thm_get_dense_neighboring_grid_points(vertices[j],
grid_points[i],
relative_grid_address[j],
4,
mesh,
bz_grid_address,
bz_map);
}
for (bi = 0; bi < num_band; bi++) {
for (j = 0; j < 24; j++) {
for (k = 0; k < 4; k++) {
freq_vertices[j][k] = frequencies[vertices[j][k] * num_band + bi];
}
}
for (j = 0; j < num_band0; j++) {
iw[i * num_band0 * num_band + j * num_band + bi] =
thm_get_integration_weight(frequency_points[j], freq_vertices, 'I');
}
}
}
Py_RETURN_NONE;
}
static PyObject *
py_tpl_get_triplets_reciprocal_mesh_at_q(PyObject *self, PyObject *args)
{
PyArrayObject *py_map_triplets;
PyArrayObject *py_grid_address;
PyArrayObject *py_map_q;
PyArrayObject *py_mesh;
PyArrayObject *py_rotations;
long fixed_grid_number;
int is_time_reversal;
int swappable;
int (*grid_address)[3];
size_t *map_triplets;
size_t *map_q;
int *mesh;
int (*rot)[3][3];
npy_intp num_rot;
size_t num_ir;
if (!PyArg_ParseTuple(args, "OOOlOiOi",
&py_map_triplets,
&py_map_q,
&py_grid_address,
&fixed_grid_number,
&py_mesh,
&is_time_reversal,
&py_rotations,
&swappable)) {
return NULL;
}
grid_address = (int(*)[3])PyArray_DATA(py_grid_address);
map_triplets = (size_t*)PyArray_DATA(py_map_triplets);
map_q = (size_t*)PyArray_DATA(py_map_q);
mesh = (int*)PyArray_DATA(py_mesh);
rot = (int(*)[3][3])PyArray_DATA(py_rotations);
num_rot = PyArray_DIMS(py_rotations)[0];
num_ir = tpl_get_triplets_reciprocal_mesh_at_q(map_triplets,
map_q,
grid_address,
fixed_grid_number,
mesh,
is_time_reversal,
num_rot,
rot,
swappable);
return PyLong_FromSize_t(num_ir);
}
static PyObject * py_tpl_get_BZ_triplets_at_q(PyObject *self, PyObject *args)
{
PyArrayObject *py_triplets;
PyArrayObject *py_bz_grid_address;
PyArrayObject *py_bz_map;
PyArrayObject *py_map_triplets;
PyArrayObject *py_mesh;
long grid_point;
size_t (*triplets)[3];
int (*bz_grid_address)[3];
size_t *bz_map;
size_t *map_triplets;
npy_intp num_map_triplets;
int *mesh;
size_t num_ir;
if (!PyArg_ParseTuple(args, "OlOOOO",
&py_triplets,
&grid_point,
&py_bz_grid_address,
&py_bz_map,
&py_map_triplets,
&py_mesh)) {
return NULL;
}
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
bz_grid_address = (int(*)[3])PyArray_DATA(py_bz_grid_address);
bz_map = (size_t*)PyArray_DATA(py_bz_map);
map_triplets = (size_t*)PyArray_DATA(py_map_triplets);
num_map_triplets = PyArray_DIMS(py_map_triplets)[0];
mesh = (int*)PyArray_DATA(py_mesh);
num_ir = tpl_get_BZ_triplets_at_q(triplets,
grid_point,
bz_grid_address,
bz_map,
map_triplets,
num_map_triplets,
mesh);
return PyLong_FromSize_t(num_ir);
}
static PyObject *
py_set_triplets_integration_weights(PyObject *self, PyObject *args)
{
PyArrayObject *py_iw;
PyArrayObject *py_iw_zero;
PyArrayObject *py_frequency_points;
PyArrayObject *py_relative_grid_address;
PyArrayObject *py_mesh;
PyArrayObject *py_triplets;
PyArrayObject *py_frequencies1;
PyArrayObject *py_frequencies2;
PyArrayObject *py_bz_grid_address;
PyArrayObject *py_bz_map;
int tp_type;
double *iw;
char *iw_zero;
double *frequency_points;
int (*relative_grid_address)[4][3];
int *mesh;
size_t (*triplets)[3];
int (*bz_grid_address)[3];
size_t *bz_map;
double *frequencies1, *frequencies2;
npy_intp num_band0, num_band1, num_band2, num_triplets;
if (!PyArg_ParseTuple(args, "OOOOOOOOOOi",
&py_iw,
&py_iw_zero,
&py_frequency_points,
&py_relative_grid_address,
&py_mesh,
&py_triplets,
&py_frequencies1,
&py_frequencies2,
&py_bz_grid_address,
&py_bz_map,
&tp_type)) {
return NULL;
}
iw = (double*)PyArray_DATA(py_iw);
iw_zero = (char*)PyArray_DATA(py_iw_zero);
frequency_points = (double*)PyArray_DATA(py_frequency_points);
num_band0 = PyArray_DIMS(py_frequency_points)[0];
relative_grid_address = (int(*)[4][3])PyArray_DATA(py_relative_grid_address);
mesh = (int*)PyArray_DATA(py_mesh);
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
num_triplets = PyArray_DIMS(py_triplets)[0];
bz_grid_address = (int(*)[3])PyArray_DATA(py_bz_grid_address);
bz_map = (size_t*)PyArray_DATA(py_bz_map);
frequencies1 = (double*)PyArray_DATA(py_frequencies1);
frequencies2 = (double*)PyArray_DATA(py_frequencies2);
num_band1 = PyArray_DIMS(py_frequencies1)[1];
num_band2 = PyArray_DIMS(py_frequencies2)[1];
tpl_get_integration_weight(iw,
iw_zero,
frequency_points,
num_band0,
relative_grid_address,
mesh,
triplets,
num_triplets,
bz_grid_address,
bz_map,
frequencies1,
num_band1,
frequencies2,
num_band2,
tp_type,
1,
0);
Py_RETURN_NONE;
}
static PyObject *
py_set_triplets_integration_weights_with_sigma(PyObject *self, PyObject *args)
{
PyArrayObject *py_iw;
PyArrayObject *py_iw_zero;
PyArrayObject *py_frequency_points;
PyArrayObject *py_triplets;
PyArrayObject *py_frequencies;
double sigma, sigma_cutoff;
double *iw;
char *iw_zero;
double *frequency_points;
size_t (*triplets)[3];
double *frequencies;
npy_intp num_band0, num_band, num_iw, num_triplets;
if (!PyArg_ParseTuple(args, "OOOOOdd",
&py_iw,
&py_iw_zero,
&py_frequency_points,
&py_triplets,
&py_frequencies,
&sigma,
&sigma_cutoff)) {
return NULL;
}
iw = (double*)PyArray_DATA(py_iw);
iw_zero = (char*)PyArray_DATA(py_iw_zero);
frequency_points = (double*)PyArray_DATA(py_frequency_points);
num_band0 = PyArray_DIMS(py_frequency_points)[0];
triplets = (size_t(*)[3])PyArray_DATA(py_triplets);
num_triplets = PyArray_DIMS(py_triplets)[0];
frequencies = (double*)PyArray_DATA(py_frequencies);
num_band = PyArray_DIMS(py_frequencies)[1];
num_iw = PyArray_DIMS(py_iw)[0];
tpl_get_integration_weight_with_sigma(iw,
iw_zero,
sigma,
sigma_cutoff,
frequency_points,
num_band0,
triplets,
num_triplets,
frequencies,
num_band,
num_iw);
Py_RETURN_NONE;
}
#ifdef LIBFLAME
static PyObject * py_inverse_collision_matrix_libflame(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_eigenvalues;
int i_sigma, i_temp;
double cutoff;
double *collision_matrix;
double *eigvals;
npy_intp num_temp, num_ir_grid_points, num_band;
size_t num_column, adrs_shift;
if (!PyArg_ParseTuple(args, "OOiid",
&py_collision_matrix,
&py_eigenvalues,
&i_sigma,
&i_temp,
&cutoff)) {
return NULL;
}
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
eigvals = (double*)PyArray_DATA(py_eigenvalues);
num_temp = PyArray_DIMS(py_collision_matrix)[1];
num_ir_grid_points = PyArray_DIMS(py_collision_matrix)[2];
num_band = PyArray_DIMS(py_collision_matrix)[3];
num_column = num_ir_grid_points * num_band * 3;
adrs_shift = (i_sigma * num_column * num_column * num_temp +
i_temp * num_column * num_column);
phonopy_pinv_libflame(collision_matrix + adrs_shift,
eigvals, num_column, cutoff);
Py_RETURN_NONE;
}
#endif
static PyObject *
py_diagonalize_collision_matrix(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_eigenvalues;
double cutoff;
int i_sigma, i_temp, is_pinv, solver;
double *collision_matrix;
double *eigvals;
npy_intp num_temp, num_grid_point, num_band;
size_t num_column, adrs_shift;
int info;
if (!PyArg_ParseTuple(args, "OOiidii",
&py_collision_matrix,
&py_eigenvalues,
&i_sigma,
&i_temp,
&cutoff,
&solver,
&is_pinv)) {
return NULL;
}
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
eigvals = (double*)PyArray_DATA(py_eigenvalues);
if (PyArray_NDIM(py_collision_matrix) == 2) {
num_temp = 1;
num_column = PyArray_DIM(py_collision_matrix, 1);
} else {
num_temp = PyArray_DIM(py_collision_matrix, 1);
num_grid_point = PyArray_DIM(py_collision_matrix, 2);
num_band = PyArray_DIM(py_collision_matrix, 3);
if (PyArray_NDIM(py_collision_matrix) == 8) {
num_column = num_grid_point * num_band * 3;
} else {
num_column = num_grid_point * num_band;
}
}
adrs_shift = (i_sigma * num_column * num_column * num_temp +
i_temp * num_column * num_column);
/* show_colmat_info(py_collision_matrix, i_sigma, i_temp, adrs_shift); */
info = phonopy_dsyev(collision_matrix + adrs_shift,
eigvals, num_column, solver);
if (is_pinv) {
pinv_from_eigensolution(collision_matrix + adrs_shift,
eigvals, num_column, cutoff, 0);
}
return PyLong_FromLong((long) info);
}
static PyObject * py_pinv_from_eigensolution(PyObject *self, PyObject *args)
{
PyArrayObject *py_collision_matrix;
PyArrayObject *py_eigenvalues;
double cutoff;
int i_sigma, i_temp, pinv_method;
double *collision_matrix;
double *eigvals;
npy_intp num_temp, num_grid_point, num_band;
size_t num_column, adrs_shift;
if (!PyArg_ParseTuple(args, "OOiidi",
&py_collision_matrix,
&py_eigenvalues,
&i_sigma,
&i_temp,
&cutoff,
&pinv_method)) {
return NULL;
}
collision_matrix = (double*)PyArray_DATA(py_collision_matrix);
eigvals = (double*)PyArray_DATA(py_eigenvalues);
num_temp = PyArray_DIMS(py_collision_matrix)[1];
num_grid_point = PyArray_DIMS(py_collision_matrix)[2];
num_band = PyArray_DIMS(py_collision_matrix)[3];
if (PyArray_NDIM(py_collision_matrix) == 8) {
num_column = num_grid_point * num_band * 3;
} else {
num_column = num_grid_point * num_band;
}
adrs_shift = (i_sigma * num_column * num_column * num_temp +
i_temp * num_column * num_column);
/* show_colmat_info(py_collision_matrix, i_sigma, i_temp, adrs_shift); */
pinv_from_eigensolution(collision_matrix + adrs_shift,
eigvals, num_column, cutoff, pinv_method);
Py_RETURN_NONE;
}
static PyObject * py_get_default_colmat_solver(PyObject *self, PyObject *args)
{
if (!PyArg_ParseTuple(args, "")) {
return NULL;
}
#ifdef MKL_LAPACKE
return PyLong_FromLong((long) 1);
#else
return PyLong_FromLong((long) 4);
#endif
}
static void pinv_from_eigensolution(double *data,
const double *eigvals,
const size_t size,
const double cutoff,
const int pinv_method)
{
size_t i, ib, j, k, max_l, i_s, j_s;
double *tmp_data;
double e, sum;
size_t *l;
l = NULL;
tmp_data = NULL;
tmp_data = (double*)malloc(sizeof(double) * size * size);
#pragma omp parallel for
for (i = 0; i < size * size; i++) {
tmp_data[i] = data[i];
}
l = (size_t*)malloc(sizeof(size_t) * size);
max_l = 0;
for (i = 0; i < size; i++) {
if (pinv_method == 0) {
e = fabs(eigvals[i]);
} else {
e = eigvals[i];
}
if (e > cutoff) {
l[max_l] = i;
max_l++;
}
}
#pragma omp parallel for private(ib, j, k, i_s, j_s, sum)
for (i = 0; i < size / 2; i++) {
/* from front */
i_s = i * size;
for (j = i; j < size; j++) {
j_s = j * size;
sum = 0;
for (k = 0; k < max_l; k++) {
sum += tmp_data[i_s + l[k]] * tmp_data[j_s + l[k]] / eigvals[l[k]];
}
data[i_s + j] = sum;
data[j_s + i] = sum;
}
/* from back */
ib = size - i - 1;
i_s = ib * size;
for (j = ib; j < size; j++) {
j_s = j * size;
sum = 0;
for (k = 0; k < max_l; k++) {
sum += tmp_data[i_s + l[k]] * tmp_data[j_s + l[k]] / eigvals[l[k]];
}
data[i_s + j] = sum;
data[j_s + ib] = sum;
}
}
/* when size is odd */
if ((size % 2) == 1) {
i = (size - 1) / 2;
i_s = i * size;
for (j = i; j < size; j++) {
j_s = j * size;
sum = 0;
for (k = 0; k < max_l; k++) {
sum += tmp_data[i_s + l[k]] * tmp_data[j_s + l[k]] / eigvals[l[k]];
}
data[i_s + j] = sum;
data[j_s + i] = sum;
}
}
free(l);
l = NULL;
free(tmp_data);
tmp_data = NULL;
}
static void show_colmat_info(const PyArrayObject *py_collision_matrix,
const size_t i_sigma,
const size_t i_temp,
const size_t adrs_shift)
{
int i;
printf(" Array_shape:(");
for (i = 0; i < PyArray_NDIM(py_collision_matrix); i++) {
printf("%d", (int)PyArray_DIM(py_collision_matrix, i));
if (i < PyArray_NDIM(py_collision_matrix) - 1) {
printf(",");
} else {
printf("), ");
}
}
printf("Data shift:%lu [%lu, %lu]\n", adrs_shift, i_sigma, i_temp);
}
|
schedule-claused.c | #include <stdio.h>
#include <stdlib.h>
#ifdef _OPENMP
#include <omp.h>
#else
#define omp_get_thread_num() 0
#endif
int main(int argc, char **argv) {
int i, n = 16,chunk, a[n],suma=0;
if(argc < 2) {
fprintf(stderr,"\nFalta chunk \n");
exit(-1);
}
chunk = atoi(argv[1]);
for (i=0; i<n; i++) a[i] = i;
#pragma omp parallel for firstprivate(suma) \
lastprivate(suma) schedule(dynamic,chunk)
for (i=0; i<n; i++)
{
suma = suma + a[i];
printf(" thread %d suma a[%d] suma=%d \n",
omp_get_thread_num(),i,suma);
}
printf("Fuera de 'parallel for' suma=%d\n",suma);
}
|
GB_binop__minus_fp64.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB_AaddB__minus_fp64
// A.*B function (eWiseMult): GB_AemultB__minus_fp64
// A*D function (colscale): GB_AxD__minus_fp64
// D*A function (rowscale): GB_DxB__minus_fp64
// C+=B function (dense accum): GB_Cdense_accumB__minus_fp64
// C+=b function (dense accum): GB_Cdense_accumb__minus_fp64
// C+=A+B function (dense ewise3): GB_Cdense_ewise3_accum__minus_fp64
// C=A+B function (dense ewise3): GB_Cdense_ewise3_noaccum__minus_fp64
// C=scalar+B GB_bind1st__minus_fp64
// C=scalar+B' GB_bind1st_tran__minus_fp64
// C=A+scalar GB_bind2nd__minus_fp64
// C=A'+scalar GB_bind2nd_tran__minus_fp64
// C type: double
// A type: double
// B,b type: double
// BinaryOp: cij = (aij - bij)
#define GB_ATYPE \
double
#define GB_BTYPE \
double
#define GB_CTYPE \
double
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
double aij = Ax [pA]
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB) \
double bij = Bx [pB]
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
double t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA) \
cij = Ax [pA]
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB) \
cij = Bx [pB]
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z, x, y, i, j) \
z = (x - y) ;
// op is second
#define GB_OP_IS_SECOND \
0
// op is plus_fp32 or plus_fp64
#define GB_OP_IS_PLUS_REAL \
0
// op is minus_fp32 or minus_fp64
#define GB_OP_IS_MINUS_REAL \
1
// GB_cblas_*axpy gateway routine, if it exists for this operator and type:
#define GB_CBLAS_AXPY \
GB_cblas_daxpy
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_MINUS || GxB_NO_FP64 || GxB_NO_MINUS_FP64)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB_Cdense_ewise3_accum__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_ewise3_noaccum__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_accumB__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *GB_RESTRICT kfirst_slice,
const int64_t *GB_RESTRICT klast_slice,
const int64_t *GB_RESTRICT pstart_slice,
const int ntasks,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_accumb__minus_fp64
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type double
double bwork = (*((double *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB_AxD__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *GB_RESTRICT kfirst_slice,
const int64_t *GB_RESTRICT klast_slice,
const int64_t *GB_RESTRICT pstart_slice,
const int ntasks,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
double *GB_RESTRICT Cx = (double *) C->x ;
#include "GB_AxB_colscale_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB_DxB__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
double *GB_RESTRICT Cx = (double *) C->x ;
#include "GB_AxB_rowscale_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseAdd: C = A+B or C<M> = A+B
//------------------------------------------------------------------------------
#undef GB_FREE_ALL
#define GB_FREE_ALL \
{ \
GB_ek_slice_free (&pstart_Mslice, &kfirst_Mslice, &klast_Mslice) ; \
GB_ek_slice_free (&pstart_Aslice, &kfirst_Aslice, &klast_Aslice) ; \
GB_ek_slice_free (&pstart_Bslice, &kfirst_Bslice, &klast_Bslice) ; \
}
GrB_Info GB_AaddB__minus_fp64
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *GB_RESTRICT C_to_M,
const int64_t *GB_RESTRICT C_to_A,
const int64_t *GB_RESTRICT C_to_B,
const GB_task_struct *GB_RESTRICT TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *pstart_Mslice = NULL, *kfirst_Mslice = NULL, *klast_Mslice = NULL ;
int64_t *pstart_Aslice = NULL, *kfirst_Aslice = NULL, *klast_Aslice = NULL ;
int64_t *pstart_Bslice = NULL, *kfirst_Bslice = NULL, *klast_Bslice = NULL ;
#include "GB_add_template.c"
GB_FREE_ALL ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C = A.*B or C<M> = A.*B
//------------------------------------------------------------------------------
GrB_Info GB_AemultB__minus_fp64
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *GB_RESTRICT C_to_M,
const int64_t *GB_RESTRICT C_to_A,
const int64_t *GB_RESTRICT C_to_B,
const GB_task_struct *GB_RESTRICT TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *pstart_Mslice = NULL, *kfirst_Mslice = NULL, *klast_Mslice = NULL ;
int64_t *pstart_Aslice = NULL, *kfirst_Aslice = NULL, *klast_Aslice = NULL ;
int64_t *pstart_Bslice = NULL, *kfirst_Bslice = NULL, *klast_Bslice = NULL ;
#include "GB_emult_template.c"
GB_FREE_ALL ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB_bind1st__minus_fp64
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *GB_RESTRICT Bb,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
double *Cx = (double *) Cx_output ;
double x = (*((double *) x_input)) ;
double *Bx = (double *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Bb, p)) continue ;
double bij = Bx [p] ;
Cx [p] = (x - bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB_bind2nd__minus_fp64
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *GB_RESTRICT Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
double *Cx = (double *) Cx_output ;
double *Ax = (double *) Ax_input ;
double y = (*((double *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
double aij = Ax [p] ;
Cx [p] = (aij - y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
double aij = Ax [pA] ; \
Cx [pC] = (x - aij) ; \
}
GrB_Info GB_bind1st_tran__minus_fp64
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *GB_RESTRICT *Workspaces,
const int64_t *GB_RESTRICT A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
double
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
double x = (*((const double *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
double
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
double aij = Ax [pA] ; \
Cx [pC] = (aij - y) ; \
}
GrB_Info GB_bind2nd_tran__minus_fp64
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *GB_RESTRICT *Workspaces,
const int64_t *GB_RESTRICT A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
double y = (*((const double *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
interpolate_ll.c | /*
This source file is part of the Geophysical Fluids Modeling Framework (GAME), which is released under the MIT license.
Github repository: https://github.com/OpenNWP/GAME
*/
/*
In this file, interpolation indices and weights to the lat-lon grid are computed.
*/
#include <stdlib.h>
#include <stdio.h>
#include <geos95.h>
#include "../../src/game_types.h"
#include "../../src/game_constants.h"
int interpolate_ll(double latitude_scalar[], double longitude_scalar[], int interpol_indices[], double interpol_weights[])
{
/*
This function interpolates to the lat-lon grid.
*/
// latitude resolution of the grid
double delta_latitude = M_PI/NO_OF_LAT_IO_POINTS;
// longitude resolution of the grid
double delta_longitude = 2*M_PI/NO_OF_LON_IO_POINTS;
// the vector containing distances to the horizontal points of the native model grid
double distance_vector[NO_OF_SCALARS_H];
int min_indices_vector[5];
double weights_vector[5];
int lat_index, lon_index;
double lat_value, lon_value, weights_sum;
#pragma omp parallel for private(lat_index, lon_index, lat_value, lon_value, distance_vector, min_indices_vector, weights_vector, weights_sum)
for (int i = 0; i < NO_OF_LATLON_IO_POINTS; ++i)
{
lat_index = i/NO_OF_LON_IO_POINTS;
lon_index = i - lat_index*NO_OF_LON_IO_POINTS;
lat_value = M_PI/2 - 0.5*delta_latitude - lat_index*delta_latitude;
if (lat_value < -M_PI/2 || lat_value > M_PI/2)
{
printf("An error occured during the interpolation to the lat lon grid, position 0.\n");
exit(1);
}
lon_value = lon_index*delta_longitude;
if (lon_value < 0 || lon_value > 2*M_PI)
{
printf("An error occured during the interpolation to the lat lon grid, position 1.\n");
exit(1);
}
// finding the three closest points of the native model grid
for (int j = 0; j < NO_OF_SCALARS_H; ++j)
{
distance_vector[j] = calculate_distance_h(lat_value, lon_value, latitude_scalar[j], longitude_scalar[j], 1);
}
for (int j = 0; j < 5; ++j)
{
min_indices_vector[j] = -1;
}
weights_sum = 0;
for (int j = 0; j < 5; ++j)
{
min_indices_vector[j] = find_min_index_exclude(distance_vector, NO_OF_SCALARS_H, min_indices_vector, 5);
weights_vector[j] = 1/(pow(distance_vector[min_indices_vector[j]], 2 + EPSILON_SECURITY) + EPSILON_SECURITY);
weights_sum += weights_vector[j];
}
// writing the result to the arrays
for (int j = 0; j < 5; ++j)
{
interpol_indices[5*i + j] = min_indices_vector[j];
interpol_weights[5*i + j] = weights_vector[j]/weights_sum;
}
}
return 0;
}
|
pathtracer.h | #ifndef CPPPT_PATHTRACER
#define CPPPT_PATHTRACER
#include <renderer/renderer.h>
#include <math/math.h>
#include <camera/camera.h>
#include <image/rgb_image.h>
#include <primitive/ray.h>
#include <shape/intersection.h>
#include <scene.h>
#include <math/sampler.h>
#include <omp.h>
#include <iostream>
namespace cpppt{
class Pathtracer : public Renderer{
int samples;
Vec3 render_sky(const Ray& r) const {
return Vec3(0.0);
}
static float russian_roulette(const Vec3& col){
//LOL this is not LAB ahahahah
return (col.x*0.2 + col.y*0.5 +col.z*0.3)*0.5 + 0.4;
}
Vec3 integrate(const Scene& scene, const Vec2& coords, Sampler& sampler) const {
Ray ray = scene.camera->get_ray(coords);
Intersection intersection;
Vec3 col(0.0);
Vec3 mul(1.0);
for(int i = 0; i<32; i++){
bool intersected = scene.primitive->intersect(ray,&intersection);
if(!intersected){
col = col + mul*render_sky(ray);
break;
} else {
col = col + mul* intersection.material->emit(ray.d*(-1.0),intersection);
Vec3 sample_direction;
float p = intersection.material->sample(sampler, ray.d*(-1.0), intersection, &sample_direction);
if(p<=0.0){
break;
}
Vec3 eval = intersection.material->eval(ray.d*(-1.0), sample_direction, intersection);
if(i>2){
float rr = russian_roulette(eval);
if(sampler.sample() > rr) {
break;
}
p = p*rr;
}
mul = mul*eval/p;
ray = Ray(intersection.hitpoint, sample_direction);
}
}
return col;
}
public:
Pathtracer(int samples): samples(samples) {}
void render(Scene& sc, std::string filename) const {
RgbImage* image= &(sc.camera->get_image());
Vec2i res = image->res;
#pragma omp parallel for
for(int i = 0; i<res.x; i++){
RandomSampler s(i);
if(i%50==0)
std::cout<<"rendering line "<<i<<std::endl;
for(int j = 0; j<res.y; j++){
Vec3 acc(0.0);
for(int k = 0; k<samples; k++){
for(int l = 0; l<samples; l++){
float r1 = s.sample();
float r2 = s.sample();
Vector2<float> coords( ((float(i)+float(k+r1)/samples)/float(res.x))*2.0-1.0, -(((float(j)+float(l+r2)/samples)/float(res.y))*2.0-1.0));
acc = acc +integrate(sc, coords, s);
}
}
acc = acc/(float(samples*samples));
acc = Vec3(linear2srgb(acc.x),linear2srgb(acc.y),linear2srgb(acc.z));
image->put_pixel(i,j,acc);
}
}
image->save(filename);
}
};
}
#endif |
THTensorConv.c | #ifndef TH_GENERIC_FILE
#define TH_GENERIC_FILE "generic/THTensorConv.c"
#else
/*
2D Input, 2D kernel : convolve given image with the given kernel.
*/
void THTensor_(validXCorr2Dptr)(real *r_,
real alpha,
real *t_, long ir, long ic,
real *k_, long kr, long kc,
long sr, long sc)
{
long or = (ir - kr) / sr + 1;
long oc = (ic - kc) / sc + 1;
long xx, yy, kx, ky;
if ((sc != 1) || (oc < 4)) {
/* regular convolution */
for(yy = 0; yy < or; yy++) {
for(xx = 0; xx < oc; xx++) {
/* Dot product in two dimensions... (between input image and the mask) */
real *pi_ = t_ + yy*sr*ic + xx*sc;
real *pw_ = k_;
real sum = 0;
for(ky = 0; ky < kr; ky++) {
for(kx = 0; kx < kc; kx++) {
sum += pi_[kx]*pw_[kx];
}
pi_ += ic; /* next input line */
pw_ += kc; /* next mask line */
}
/* Update output */
*r_++ += alpha*sum;
}
}
} else {
/* SSE-based convolution */
for(yy = 0; yy < or; yy++) {
real *pi_ = t_ + yy*sr*ic;
real *pw_ = k_;
for (ky = 0; ky < kr; ky++) {
real *pis_ = pi_;
for (kx = 0; kx < kc; kx++) {
THVector_(add)(r_, pis_, alpha*pw_[kx], oc);
pis_++;
}
pi_ += ic; /* next input line */
pw_ += kc; /* next mask line */
}
r_ += oc;
}
}
}
/*
2D Input, 2D kernel : convolve given image with the given kernel.
*/
void THTensor_(validConv2Dptr)(real *r_,
real alpha,
real *t_, long ir, long ic,
real *k_, long kr, long kc,
long sr, long sc)
{
long or = (ir - kr) / sr + 1;
long oc = (ic - kc) / sc + 1;
long xx, yy, kx, ky;
if ((sc != 1) || (oc < 4)) {
/* regular convolution */
for(yy = 0; yy < or; yy++) {
for(xx = 0; xx < oc; xx++) {
/* Dot product in two dimensions... (between input image and the mask) */
real *pi_ = t_ + yy*sr*ic + xx*sc;
real *pw_ = k_ + kr*kc - 1;
real sum = 0;
for(ky = 0; ky < kr; ky++) {
for(kx = 0; kx < kc; kx++) {
sum += pi_[kx]*pw_[-kx];
}
pi_ += ic; /* next input line */
pw_ -= kc; /* next mask line */
}
/* Update output */
*r_++ += alpha*sum;
}
}
} else {
/* SSE-based convolution */
for(yy = 0; yy < or; yy++) {
real *pw_ = k_ + kr*kc - 1;
real *pi_ = t_ + yy*sr*ic;
for (ky = 0; ky < kr; ky++) {
real *pis_ = pi_;
for (kx = 0; kx < kc; kx++) {
THVector_(add)(r_, pis_, alpha*pw_[-kx], oc);
pis_++;
}
pi_ += ic; /* next input line */
pw_ -= kc; /* next mask line */
}
r_ += oc;
}
}
}
/*
2D Input, 2D kernel : convolve given image with the given kernel, full convolution.
*/
void THTensor_(fullConv2Dptr)(real *r_,
real alpha,
real *t_, long ir, long ic,
real *k_, long kr, long kc,
long sr, long sc)
{
long oc = (ic - 1) * sc + kc;
long xx, yy, kx, ky;
if ((sc != 1) || (ic < 4)) {
/* regular convolution */
for(yy = 0; yy < ir; yy++) {
for(xx = 0; xx < ic; xx++) {
/* Outer product in two dimensions... (between input image and the mask) */
real *po_ = r_ + yy*sr*oc + xx*sc;
real *pw_ = k_;
for(ky = 0; ky < kr; ky++)
{
real z = *t_ * alpha;
for(kx = 0; kx < kc; kx++) {
po_[kx] += z * pw_[kx];
}
po_ += oc; /* next input line */
pw_ += kc; /* next mask line */
}
t_++;
}
}
} else {
/* SSE-based convolution */
for(yy = 0; yy < ir; yy++) {
real *po_ = r_ + yy*sr*oc;
real *pw_ = k_;
for (ky = 0; ky < kr; ky++) {
real *pos_ = po_;
for (kx = 0; kx < kc; kx++) {
THVector_(add)(pos_, t_, alpha*pw_[kx], ic);
pos_++;
}
po_ += oc; /* next input line */
pw_ += kc; /* next mask line */
}
t_ += ic;
}
}
}
/*
2D Input, 2D kernel : convolve given image with the given kernel, full convolution.
*/
void THTensor_(fullXCorr2Dptr)(real *r_,
real alpha,
real *t_, long ir, long ic,
real *k_, long kr, long kc,
long sr, long sc)
{
long oc = (ic - 1) * sc + kc;
long xx, yy, kx, ky;
if ((sc != 1) || (ic < 4)) {
/* regular convolution */
for(yy = 0; yy < ir; yy++) {
for(xx = 0; xx < ic; xx++) {
/* Outer product in two dimensions... (between input image and the mask) */
real *po_ = r_ + yy*sr*oc + xx*sc;
real *pw_ = k_ + kr*kc -1;
long kx, ky;
for(ky = 0; ky < kr; ky++)
{
real z = *t_ * alpha;
for(kx = 0; kx < kc; kx++) {
po_[kx] += z * pw_[-kx];
}
po_ += oc; /* next input line */
pw_ -= kc; /* next mask line */
}
t_++;
}
}
} else {
/* SSE-based convolution */
for(yy = 0; yy < ir; yy++) {
real *po_ = r_ + yy*sr*oc;
real *pw_ = k_ + kr*kc -1;
for (ky = 0; ky < kr; ky++) {
real *pos_ = po_;
for (kx = 0; kx < kc; kx++) {
THVector_(add)(pos_, t_, pw_[-kx]*alpha, ic);
pos_++;
}
po_ += oc; /* next input line */
pw_ -= kc; /* next mask line */
}
t_ += ic;
}
}
}
/*
2D Input, 2D kernel : convolve given image with the given kernel, valid convolution.
for sr,sc=1 this is equivalent to validXCorr2Dptr, but otherwise it is useful for
calculating derivatives wrt a kernel that is applied with stride sr,sc != 1
*/
void THTensor_(validXCorr2DRevptr)(real *r_,
real alpha,
real *t_, long ir, long ic,
real *k_, long kr, long kc,
long sr, long sc)
{
long or = ir - (kr - 1) * sr;
long oc = ic - (kc - 1) * sc;
long xx, yy, kx, ky;
if ((sc != 1) || (kc < 4)) {
/* regular convolution */
for(yy = 0; yy < kr; yy++) {
for(xx = 0; xx < kc; xx++) {
real *po_ = r_;
real *pi_ = t_ + yy*sr*ic + xx*sc;
real z = *k_++ * alpha;
for(ky = 0; ky < or; ky++) {
for(kx = 0; kx < oc; kx++)
po_[kx] += z * pi_[kx];
pi_ += ic;
po_ += oc;
}
}
}
} else {
/* SSE-based convolution */
for(yy = 0; yy < kr; yy++) {
for(xx = 0; xx < kc; xx++) {
real *po_ = r_;
real *pi_ = t_ + yy*sr*ic + xx*sc;
real z = *k_++ * alpha;
for(ky = 0; ky < or; ky++) {
THVector_(add)(po_, pi_, z, oc);
pi_ += ic;
po_ += oc;
}
}
}
}
}
/*
3D Input, 3D kernel : convolve given volume with the given kernel.
*/
void THTensor_(validXCorr3Dptr)(real *r_,
real alpha,
real *t_, long it, long ir, long ic,
real *k_, long kt, long kr, long kc,
long st, long sr, long sc)
{
long ot = (it - kt) / st + 1;
long or = (ir - kr) / sr + 1;
long oc = (ic - kc) / sc + 1;
long zz, xx, yy;
for (zz = 0; zz < ot; zz++)
{
for(yy = 0; yy < or; yy++)
{
for(xx = 0; xx < oc; xx++)
{
/* Dot product in two dimensions... (between input image and the mask) */
real *pi_ = t_ + zz*st*ir*ic + yy*sr*ic + xx*sc;
real *pw_ = k_;
real sum = 0;
long kz, kx, ky;
for(kz = 0; kz < kt; kz++)
{
for(ky = 0; ky < kr; ky++)
{
for(kx = 0; kx < kc; kx++) {
sum += pi_[kx]*pw_[kx];
}
pi_ += ic; /* next input line */
pw_ += kc; /* next mask line */
}
pi_ += (ir-kr)*ic; /* next input slice */
}
/* Update output */
*r_++ += sum*alpha;
}
}
}
}
/*
3D Input, 3D kernel : convolve given volume with the given kernel.
*/
void THTensor_(validConv3Dptr)(real *r_,
real alpha,
real *t_, long it, long ir, long ic,
real *k_, long kt, long kr, long kc,
long st, long sr, long sc)
{
long ot = (it - kt) / st + 1;
long or = (ir - kr) / sr + 1;
long oc = (ic - kc) / sc + 1;
long zz, xx, yy;
for(zz = 0; zz < ot; zz++)
{
for(yy = 0; yy < or; yy++)
{
for(xx = 0; xx < oc; xx++)
{
/* Dot product in two dimensions... (between input image and the mask) */
real *pi_ = t_ + zz*st*ir*ic + yy*sr*ic + xx*sc;
real *pw_ = k_ + kt*kr*kc - 1;
real sum = 0;
long kz, kx, ky;
for(kz = 0; kz < kt; kz++)
{
for(ky = 0; ky < kr; ky++)
{
for(kx = 0; kx < kc; kx++) {
sum += pi_[kx]*pw_[-kx];
}
pi_ += ic; /* next input line */
pw_ -= kc; /* next mask line */
}
pi_ += (ir-kr)*ic; /* next input slice */
}
/* Update output */
*r_++ += alpha*sum;
}
}
}
}
/*
3D Input, 3D kernel : convolve given volume with the given kernel, full convolution.
*/
void THTensor_(fullConv3Dptr)(real *r_,
real alpha,
real *t_, long it, long ir, long ic,
real *k_, long kt, long kr, long kc,
long st, long sr, long sc)
{
long or = (ir - 1) * sr + kr;
long oc = (ic - 1) * sc + kc;
long zz, xx, yy;
for(zz = 0; zz < it; zz++)
{
for(yy = 0; yy < ir; yy++)
{
for(xx = 0; xx < ic; xx++)
{
/* Outer product in two dimensions... (between input image and the mask) */
real *po_ = r_ + zz*st*or*oc + yy*sr*oc + xx*sc;
real *pw_ = k_;
long kz, kx, ky;
/* printf("Output Plane : %ld,%ld,%ld, input val=%g\n",zz,yy,xx,*t_); */
for(kz = 0; kz < kt; kz++)
{
for(ky = 0; ky < kr; ky++)
{
real z = *t_ * alpha;
for(kx = 0; kx < kc; kx++) {
/* printf("o=%g,k=%g," , po_[kx],pw_[kx]); */
po_[kx] += z * pw_[kx];
/* printf("o=%g " , po_[kx]); */
}
/* printf("\n"); */
po_ += oc; /* next input line */
pw_ += kc; /* next mask line */
}
po_ += (or-kr)*oc; /* next output slice */
/* printf("\n"); */
}
t_++;
}
}
}
}
/*
3D Input, 3D kernel : convolve given volume with the given kernel, full convolution.
*/
void THTensor_(fullXCorr3Dptr)(real *r_,
real alpha,
real *t_, long it, long ir, long ic,
real *k_, long kt, long kr, long kc,
long st, long sr, long sc)
{
long or = (ir - 1) * sr + kr;
long oc = (ic - 1) * sc + kc;
long zz, xx, yy;
for(zz = 0; zz < it; zz++)
{
for(yy = 0; yy < ir; yy++)
{
for(xx = 0; xx < ic; xx++)
{
/* Outer product in two dimensions... (between input image and the mask) */
real *po_ = r_ + zz*st*or*oc + yy*sr*oc + xx*sc;
real *pw_ = k_ + kt*kr*kc -1;
long kz, kx, ky;
for(kz = 0; kz < kt; kz++)
{
for(ky = 0; ky < kr; ky++)
{
real z = *t_ * alpha;
for(kx = 0; kx < kc; kx++) {
po_[kx] += z * pw_[-kx];
}
po_ += oc; /* next input line */
pw_ -= kc; /* next mask line */
}
po_ += (or-kr)*oc; /* next output slice */
}
t_++;
}
}
}
}
/*
3D Input, 3D kernel : convolve given image with the given kernel, valid convolution.
for sr,sc=1 this is equivalent to validXCorr3Dptr, but otherwise it is useful for
calculating derivatives wrt a kernel that is applied with stride sr,sc != 1
*/
void THTensor_(validXCorr3DRevptr)(real *r_,
real alpha,
real *t_, long it, long ir, long ic,
real *k_, long kt, long kr, long kc,
long st, long sr, long sc)
{
long ot = it - (kt - 1) * st;
long or = ir - (kr - 1) * sr;
long oc = ic - (kc - 1) * sc;
long zz, xx, yy;
for(zz = 0; zz < kt; zz++)
{
for(yy = 0; yy < kr; yy++)
{
for(xx = 0; xx < kc; xx++)
{
real *po_ = r_;
real *pi_ = t_ + zz*st*ir*ic + yy*sr*ic + xx*sc;
real z = *k_++ * alpha;
long kz, kx, ky;
for(kz = 0; kz < ot; kz++)
{
for(ky = 0; ky < or; ky++)
{
for(kx = 0; kx < oc; kx++)
po_[kx] += z * pi_[kx];
pi_ += ic;
po_ += oc;
}
pi_ += (ir-or)*ic; /* next input slice */
}
}
}
}
}
void THTensor_(conv2d)(real* output_data,
real alpha,
real* ptr_input, long nInputRows, long nInputCols,
real* ptr_weight, long nKernelRows, long nKernelCols,
long srow, long scol,
const char *vf, const char *xc)
{
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can be 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can be 'X' or 'C'");
if (*vf == 'F')
if (*xc == 'X')
THTensor_(fullXCorr2Dptr)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(fullConv2Dptr)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
if (*xc == 'X')
THTensor_(validXCorr2Dptr)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(validConv2Dptr)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
}
void THTensor_(conv3d)(real* output_data,
real alpha,
real* ptr_input, long nInputDepth, long nInputRows, long nInputCols,
real* ptr_weight, long nKernelDepth, long nKernelRows, long nKernelCols,
long sdepth, long srow, long scol,
const char *vf, const char *xc)
{
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can be 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can be 'X' or 'C'");
if (*vf == 'F')
if (*xc == 'X')
THTensor_(fullXCorr3Dptr)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol);
else
THTensor_(fullConv3Dptr)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol);
else
if (*xc == 'X')
THTensor_(validXCorr3Dptr)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol);
else
THTensor_(validConv3Dptr)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol);
}
long THTensor_(convsize)(long x, long k, long s, const char* vf)
{
THArgCheck(*vf == 'V' || *vf == 'F', 1, "type of convolution can be 'V' or 'F'");
if (*vf == 'V')
return (x-k)/s + 1;
else
return (x-1)*s + k;
}
/*
3D input, 3D kernel, 4D output
like rank1 update
A <- xx' + beta*A
for sr,sc=1 this is equivalent to conv2Dger, but otherwise it is useful for
calculating derivatives wrt a kernel that is applied with stride sr,sc != 1
*/
void THTensor_(conv2DRevger)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelPlane, nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 3 , 4, "kernel: 3D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
kstride0 = kernel->stride[0];
nKernelPlane = kernel->size[0];
nKernelRows = kernel->size[1];
nKernelCols = kernel->size[2];
nOutputPlane = nInputPlane * kernel->size[0];
THArgCheck(nInputRows >= nKernelRows && nInputCols >= nKernelCols , 2, "covn2DRevger : Input image is smaller than kernel");
nOutputRows = nInputRows - (nKernelRows - 1) * srow;
nOutputCols = nInputCols - (nKernelCols - 1) * scol;
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_,nKernelPlane, nInputPlane, nOutputRows, nOutputCols);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
/*THTensor_(zero)(r_);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] = 0.0;
}
}
else if (beta != 1)
{
/*THTensor_(mul)(r_, beta);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] *= beta;
}
}
#pragma omp parallel for private(k)
for(k = 0; k < nKernelPlane; k++)
{
long i;
/* get kernel */
real *ptr_weight = weight_data+k*kstride0;
for(i = 0; i < nInputPlane; i++)
{
/* get output */
real *ptr_output = output_data + k*nInputPlane*nOutputCols*nOutputRows + i*nOutputCols*nOutputRows;
/* get input */
real *ptr_input = input_data+i*istride0;
/* do image, kernel convolution */
THTensor_(validXCorr2DRevptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
/* Next output plane */
/* output_data += nOutputCols*nOutputRows; */
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 3D kernel, 4D output
like rank1 update
A <- xx' + beta*A
for sr,sc=1 this is equivalent to conv2Dger, but otherwise it is useful for
calculating derivatives wrt a kernel that is applied with stride sr,sc != 1
*/
void THTensor_(conv2DRevgerm)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol)
{
long nbatch, nInputPlane, nInputRows, nInputCols;
long nKernelPlane, nKernelRows, nKernelCols;
long nOutputRows, nOutputCols;
long istride0, kstride0, istride1, kstride1;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
istride0 = input->stride[0];
istride1 = input->stride[1];
nbatch = input->size[0];
nInputPlane = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
kstride1 = kernel->stride[1];
nKernelPlane = kernel->size[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
THArgCheck(nInputRows >= nKernelRows && nInputCols >= nKernelCols , 2, "conv2DRevger : Input image is smaller than kernel");
THArgCheck(kernel->size[0] == input->size[0] , 2, "conv2DRevger : Input batch and kernel batch is not same size");
nOutputRows = nInputRows - (nKernelRows - 1) * srow;
nOutputCols = nInputCols - (nKernelCols - 1) * scol;
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_,nKernelPlane, nInputPlane, nOutputRows, nOutputCols);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
/*THTensor_(zero)(r_);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] = 0.0;
}
}
else if (beta != 1)
{
/*THTensor_(mul)(r_, beta);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] *= beta;
}
}
#pragma omp parallel for private(k)
for(k = 0; k < nKernelPlane; k++)
{
long i;
for(i = 0; i < nInputPlane; i++)
{
long p;
for(p = 0; p < nbatch; p++)
{
/* get kernel */
real *ptr_weight = weight_data + p*kstride0 + k*kstride1;
/* get output */
real *ptr_output = output_data + k*nInputPlane*nOutputCols*nOutputRows + i*nOutputCols*nOutputRows;
/* get input */
real *ptr_input = input_data + p*istride0 + i*istride1;
/* do image, kernel convolution */
THTensor_(validXCorr2DRevptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
/* Next output plane */
/* output_data += nOutputCols*nOutputRows; */
}
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 3D kernel, 4D output
like rank1 update
A <- xx' + beta*A
*/
void THTensor_(conv2Dger)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelPlane, nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 3 , 4, "kernel: 3D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
kstride0 = kernel->stride[0];
nKernelPlane = kernel->size[0];
nKernelRows = kernel->size[1];
nKernelCols = kernel->size[2];
nOutputPlane = nInputPlane * kernel->size[0];
THArgCheck((nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv2Dger : Input image is smaller than kernel");
if (*vf == 'F') {
nOutputRows = (nInputRows - 1) * srow + nKernelRows;
nOutputCols = (nInputCols - 1) * scol + nKernelCols;
} else { /* valid */
nOutputRows = (nInputRows - nKernelRows) / srow + 1;
nOutputCols = (nInputCols - nKernelCols) / scol + 1;
}
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_, nKernelPlane, nInputPlane, nOutputRows, nOutputCols);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
/*THTensor_(zero)(r_);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] = 0.0;
}
}
else if (beta != 1)
{
/*THTensor_(mul)(r_, beta);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]*r_->size[1]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] *= beta;
}
}
#pragma omp parallel for private(k)
for(k = 0; k < nKernelPlane; k++)
{
long i;
/* get kernel */
real *ptr_weight = weight_data+k*kstride0;
for(i = 0; i < nInputPlane; i++)
{
/* get output */
real *ptr_output = output_data + k*nInputPlane*nOutputCols*nOutputRows + i*nOutputCols*nOutputRows;
/* get input */
real *ptr_input = input_data+i*istride0;
/* do image, kernel convolution */
if (*vf == 'F')
if (*xc == 'X')
THTensor_(fullXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(fullConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
if (*xc == 'X')
THTensor_(validXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(validConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
/* Next output plane */
/* output_data += nOutputCols*nOutputRows; */
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 4D kernel, 3D output
matrix vector product like
y <- Ax + beta*y
*/
void THTensor_(conv2Dmv)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long istride0, kstride0, kstride1;
THTensor *input;
THTensor* kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
if (!(k_->stride[3] == 1) || !(k_->stride[2] == k_->size[3])) {
kernel = THTensor_(newContiguous)(k_);
} else {
THTensor_(retain)(k_);
kernel = k_;
}
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
kstride0 = kernel->stride[0];
kstride1 = kernel->stride[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
nOutputPlane = kernel->size[0];
THArgCheck(kernel->size[1] == nInputPlane, 2, "invalid number of input planes");
THArgCheck( (nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv2Dmv : Input image is smaller than kernel");
if (*vf == 'F') {
nOutputRows = (nInputRows - 1) * srow + nKernelRows;
nOutputCols = (nInputCols - 1) * scol + nKernelCols;
} else { /* valid */
nOutputRows = (nInputRows - nKernelRows) / srow + 1;
nOutputCols = (nInputCols - nKernelCols) / scol + 1;
}
nelem = THTensor_(nElement)(r_);
THTensor_(resize3d)(r_, nOutputPlane, nOutputRows, nOutputCols);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
/*THTensor_(zero)(r_);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] = 0.0;
}
}
else if (beta != 1)
{
/*THTensor_(mul)(r_, beta);*/
#pragma omp parallel for private(k)
for (k = 0; k < r_->size[0]; k++)
{
real* ptr_output = output_data + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] *= beta;
}
}
#pragma omp parallel for private(k)
for(k = 0; k < nOutputPlane; k++)
{
long i;
/* get output */
real *ptr_output = output_data + k*nOutputCols*nOutputRows;
for(i = 0; i < nInputPlane; i++)
{
/* get kernel */
real *ptr_weight = weight_data + k*kstride0 + i*kstride1;
/* get input */
real *ptr_input = input_data + i*istride0;
/* do image, kernel convolution */
if (*vf == 'F')
if (*xc == 'X')
THTensor_(fullXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(fullConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
if (*xc == 'X')
THTensor_(validXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(validConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
}
/* Next output plane */
/* output_data += nOutputCols*nOutputRows;*/
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 4D kernel, 3D output
matrix vector product like
y <- Ax + beta*y
*/
void THTensor_(conv2Dmm)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long kstride0, kstride1;
THTensor *input;
THTensor* kernel;
long nbatch;
long nelem;
real *input_data;
real *weight_data;
real *output_data;
long p;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
if (!(k_->stride[3] == 1) || !(k_->stride[2] == k_->size[3])) {
kernel = THTensor_(newContiguous)(k_);
} else {
THTensor_(retain)(k_);
kernel = k_;
}
nbatch = input->size[0];
nInputPlane = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
kstride1 = kernel->stride[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
nOutputPlane = kernel->size[0];
THArgCheck(kernel->size[1] == nInputPlane, 2, "invalid number of input planes");
THArgCheck( (nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv2Dmv : Input image is smaller than kernel");
if (*vf == 'F') {
nOutputRows = (nInputRows - 1) * srow + nKernelRows;
nOutputCols = (nInputCols - 1) * scol + nKernelCols;
} else { /* valid */
nOutputRows = (nInputRows - nKernelRows) / srow + 1;
nOutputCols = (nInputCols - nKernelCols) / scol + 1;
}
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_, nbatch, nOutputPlane, nOutputRows, nOutputCols);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
/*THTensor_(zero)(r_);*/
#pragma omp parallel for private(p)
for (p=0; p < r_->size[0]; p++)
{
long k;
for (k = 0; k < r_->size[1]; k++)
{
real* ptr_output = output_data + p*nOutputPlane*nOutputRows*nOutputCols + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] = 0.0;
}
}
}
else if (beta != 1)
{
/*THTensor_(mul)(r_, beta);*/
#pragma omp parallel for private(p)
for(p=0; p < r_->size[0]; p++)
{
long k;
for (k = 0; k < r_->size[1]; k++)
{
real* ptr_output = output_data + p*nOutputPlane*nOutputRows*nOutputCols + k*nOutputCols*nOutputRows;
long l;
for (l = 0; l < nOutputRows*nOutputCols; l++)
ptr_output[l] *= beta;
}
}
}
#pragma omp parallel for private(p)
for(p=0; p < nbatch; p++)
{
long k;
for(k = 0; k < nOutputPlane; k++)
{
long i;
/* get output */
real *ptr_output = output_data + p*nOutputPlane*nOutputCols*nOutputRows + k*nOutputCols*nOutputRows;
for(i = 0; i < nInputPlane; i++)
{
/* get kernel */
real *ptr_weight = weight_data + k*kstride0 + i*kstride1;
/* get input */
real *ptr_input = input_data + p*nInputPlane*nInputRows*nInputCols + i*nInputRows*nInputCols;
/* do image, kernel convolution */
if (*vf == 'F')
if (*xc == 'X')
THTensor_(fullXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(fullConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
if (*xc == 'X')
THTensor_(validXCorr2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
else
THTensor_(validConv2Dptr)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol);
}
/* Next output plane */
/* output_data += nOutputCols*nOutputRows;*/
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
2D input, 2D kernel, 2D output
scalar multiplication like
y <- x*y + beta*y
*/
void THTensor_(conv2Dmul)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol, const char *vf, const char *xc)
{
THTensor *input;
THTensor* kernel;
long nInputRows;
long nInputCols;
long nKernelRows;
long nKernelCols;
long nOutputRows, nOutputCols;
real *ptr_input;
real *ptr_weight;
real *output_data;
long nelem;
THArgCheck(t_->nDimension == 2 , 3, "input: 2D Tensor expected");
THArgCheck(k_->nDimension == 2 , 4, "kernel: 2D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputRows = input->size[0];
nInputCols = input->size[1];
nKernelRows = kernel->size[0];
nKernelCols = kernel->size[1];
THArgCheck((nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv2Dmul : Input image is smaller than kernel");
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize2d)(r_, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
THTensor_(zero)(r_);
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
ptr_input = THTensor_(data)(input);
ptr_weight = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
/* do image, kernel convolution */
THTensor_(conv2d)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol, vf, xc);
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 3D kernel, 3D output
component wise multiplication like
y <- y.*x + beta*y
*/
void THTensor_(conv2Dcmul)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 3 , 4, "kernel: 3D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
istride0 = input->stride[0];
nInputPlane = input->size[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
kstride0 = kernel->stride[0];
nOutputPlane = kernel->size[0];
nKernelRows = kernel->size[1];
nKernelCols = kernel->size[2];
THArgCheck(nOutputPlane == nInputPlane, 2, "invalid number of input/kernel planes");
THArgCheck( (nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv2Dcmul : Input image is smaller than kernel");
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize3d)(r_, nOutputPlane, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
for(k = 0; k < nOutputPlane; k++)
{
/* get kernel */
real *ptr_weight = weight_data + k*kstride0;
/* get input */
real *ptr_input = input_data + k*istride0;
/* do image, kernel convolution */
THTensor_(conv2d)(output_data,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol, vf, xc);
/* Next output plane */
output_data += nOutputCols*nOutputRows;
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 3D kernel, 3D output
component wise multiplication like with a permutation map
y <- y.*x + beta*y
*/
void THTensor_(conv2Dmap)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, THTensor *map, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputRows, nInputCols;
long nKernelRows, nKernelCols;
long nOutputPlane, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor* kernel;
real *input_data;
real *weight_data;
real *output_data;
long nmaps;
long nelem;
long k;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 3 , 4, "kernel: 3D Tensor expected");
THArgCheck(map->nDimension == 2 , 4, "map: 2D Tensor expected");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
istride0 = input->stride[0];
nInputPlane = input->size[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
kstride0 = kernel->stride[0];
nOutputPlane = kernel->size[0];
nKernelRows = kernel->size[1];
nKernelCols = kernel->size[2];
THArgCheck(nOutputPlane == nInputPlane, 2, "invalid number of input/kernel planes");
THArgCheck( (nInputRows >= nKernelRows && nInputCols >= nKernelCols)
|| *vf == 'F', 2, "conv2Dmap : Input image is smaller than kernel");
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize3d)(r_, nOutputPlane, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
nmaps = map->size[0];
for(k = 0; k < nmaps; k++)
{
/* get indices */
long from = (long)THTensor_(get2d)(map,k,0)-1;
long to = (long)THTensor_(get2d)(map,k,1)-1;
/* get kernel */
real *ptr_weight = weight_data + k*kstride0;
/* get input */
real *ptr_input = input_data + from*istride0;
/* get output */
real *ptr_output = output_data + to*nOutputRows*nOutputCols;
/* do image, kernel convolution */
THTensor_(conv2d)(ptr_output,
alpha,
ptr_input, nInputRows, nInputCols,
ptr_weight, nKernelRows, nKernelCols,
srow, scol, vf, xc);
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
4D input, 4D kernel, 5D output
like rank1 update
A <- xx' + beta*A
for sr,sc=1 this is equivalent to xcorr2Dger, but otherwise it is useful for
calculating derivatives wrt a kernel that is applied with stride sr,sc != 1
*/
void THTensor_(conv3DRevger)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_,
long sdepth, long srow, long scol)
{
long nInputPlane, nInputDepth, nInputRows, nInputCols;
long nKernelPlane, nKernelDepth, nKernelRows, nKernelCols;
long nOutputPlane, nOutputDepth, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k, i;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(sdepth >= 1, 5, "Stride should be a positive integer");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputDepth = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
nKernelPlane = kernel->size[0];
nKernelDepth= kernel->size[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
nOutputPlane = nInputPlane * kernel->size[0];
THArgCheck(nInputDepth >= nKernelDepth && nInputRows >= nKernelRows && nInputCols >= nKernelCols , 2, "conv3DRevger : Input image is smaller than kernel");
nOutputDepth = nInputDepth - (nKernelDepth - 1) * sdepth;
nOutputRows = nInputRows - (nKernelRows - 1) * srow;
nOutputCols = nInputCols - (nKernelCols - 1) * scol;
nelem = THTensor_(nElement)(r_);
THTensor_(resize5d)(r_,nKernelPlane, nInputPlane, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
for(k = 0; k < nKernelPlane; k++)
{
/* get kernel */
real *ptr_weight = weight_data+k*kstride0;
for(i = 0; i < nInputPlane; i++)
{
/* get input */
real *ptr_input = input_data+i*istride0;
/* do image, kernel convolution */
THTensor_(validXCorr3DRevptr)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol);
/* Next output plane */
output_data += nOutputDepth*nOutputCols*nOutputRows;
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
4D input, 4D kernel, 5D output
like rank1 update
A <- xx' + beta*A
*/
void THTensor_(conv3Dger)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_,
long sdepth, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputDepth, nInputRows, nInputCols;
long nKernelPlane, nKernelDepth, nKernelRows, nKernelCols;
long nOutputPlane, nOutputDepth, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k, i;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(sdepth >= 1, 5, "Stride should be a positive integer");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 8, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 8, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputDepth = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
nKernelPlane = kernel->size[0];
nKernelDepth = kernel->size[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
nOutputPlane = nInputPlane * kernel->size[0];
THArgCheck((nInputDepth >= nKernelDepth
&& nInputRows >= nKernelRows
&& nInputCols >= nKernelCols)
|| *vf == 'F', 2, "conv3Dger : Input image is smaller than kernel");
nOutputDepth = THTensor_(convsize)(nInputDepth, nKernelDepth, sdepth, vf);
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize5d)(r_,nKernelPlane, nInputPlane, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
for(k = 0; k < nKernelPlane; k++)
{
/* get kernel */
real *ptr_weight = weight_data+k*kstride0;
for(i = 0; i < nInputPlane; i++)
{
/* get input */
real *ptr_input = input_data+i*istride0;
/* do image, kernel convolution */
THTensor_(conv3d)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol, vf, xc);
/* Next output plane */
output_data += nOutputDepth*nOutputCols*nOutputRows;
}
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
4D input, 5D kernel, 4D output
matrix vector product like
y <- Ax + beta*y
*/
void THTensor_(conv3Dmv)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_,
long sdepth, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputDepth, nInputRows, nInputCols;
long nKernelDepth, nKernelRows, nKernelCols;
long nOutputPlane, nOutputDepth, nOutputRows, nOutputCols;
long istride0, kstride0, kstride1;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k, i;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 5 , 4, "kernel: 5D Tensor expected");
THArgCheck(sdepth >= 1, 5, "Stride should be a positive integer");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 8, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 8, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
if (!(k_->stride[4] == 1) || !(k_->stride[3] == k_->size[4])) {
kernel = THTensor_(newContiguous)(k_);
} else {
THTensor_(retain)(k_);
kernel = k_;
}
nInputPlane = input->size[0];
istride0 = input->stride[0];
nInputDepth = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
kstride1 = kernel->stride[1];
nKernelDepth = kernel->size[2];
nKernelRows = kernel->size[3];
nKernelCols = kernel->size[4];
nOutputPlane = kernel->size[0];
THArgCheck(kernel->size[1] == nInputPlane, 2, "invalid number of input planes");
THArgCheck( (nInputDepth >= nKernelDepth && nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv3Dmv : Input image is smaller than kernel");
nOutputDepth = THTensor_(convsize)(nInputDepth, nKernelDepth, sdepth, vf);
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_, nOutputPlane, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
for(k = 0; k < nOutputPlane; k++)
{
for(i = 0; i < nInputPlane; i++)
{
/* get kernel */
real *ptr_weight = weight_data + k*kstride0 + i*kstride1;
/* get input */
real *ptr_input = input_data + i*istride0;
/* do image, kernel convolution */
THTensor_(conv3d)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol, vf, xc);
}
/* Next output plane */
output_data += nOutputDepth*nOutputCols*nOutputRows;
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
3D input, 3D kernel, 3D output
scalar multiplication like
y <- x*y + beta*y
*/
void THTensor_(conv3Dmul)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_,
long sdepth, long srow, long scol, const char *vf, const char *xc)
{
THTensor *input;
THTensor* kernel;
long nInputDepth;
long nInputRows;
long nInputCols;
long nKernelDepth;
long nKernelRows;
long nKernelCols;
long nOutputDepth, nOutputRows, nOutputCols;
real *ptr_input;
real *ptr_weight;
real *output_data;
long nelem;
THArgCheck(t_->nDimension == 3 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 3 , 4, "kernel: 3D Tensor expected");
THArgCheck(sdepth >= 1, 5, "Stride should be a positive integer");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 8, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 8, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
nInputDepth = input->size[0];
nInputRows = input->size[1];
nInputCols = input->size[2];
nKernelDepth = kernel->size[0];
nKernelRows = kernel->size[1];
nKernelCols = kernel->size[2];
THArgCheck((nInputDepth >= nKernelDepth && nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv3Dmul : Input image is smaller than kernel");
nOutputDepth = THTensor_(convsize)(nInputDepth, nKernelDepth, sdepth, vf);
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize3d)(r_, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
THTensor_(zero)(r_);
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
ptr_input = THTensor_(data)(input);
ptr_weight = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
/* do image, kernel convolution */
THTensor_(conv3d)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol, vf, xc);
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
4D input, 4D kernel, 4D output
component wise multiplication like
y <- y.*x + beta*y
*/
void THTensor_(conv3Dcmul)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_,
long sdepth, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputDepth, nInputRows, nInputCols;
long nKernelDepth, nKernelRows, nKernelCols;
long nOutputPlane, nOutputDepth, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
real *input_data;
real *weight_data;
real *output_data;
long nelem;
long k;
THArgCheck(t_->nDimension == 4 , 3, "input: 3D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 3D Tensor expected");
THArgCheck(srow >= 1, 5, "Stride should be a positive integer");
THArgCheck(scol >= 1, 6, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 7, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 7, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
istride0 = input->stride[0];
nInputPlane = input->size[0];
nInputDepth = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
nOutputPlane = kernel->size[0];
nKernelDepth = kernel->size[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
THArgCheck(nOutputPlane == nInputPlane, 2, "invalid number of input/kernel planes");
THArgCheck( (nInputDepth >= nKernelDepth && nInputRows >= nKernelRows && nInputCols >= nKernelCols) || *vf == 'F', 2, "conv3Dcmul : Input image is smaller than kernel");
nOutputDepth = THTensor_(convsize)(nInputDepth, nKernelDepth, sdepth, vf);
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_, nOutputPlane, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
for(k = 0; k < nOutputPlane; k++)
{
/* get kernel */
real *ptr_weight = weight_data + k*kstride0;
/* get input */
real *ptr_input = input_data + k*istride0;
/* do image, kernel convolution */
THTensor_(conv3d)(output_data,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol, vf, xc);
/* Next output plane */
output_data += nOutputDepth*nOutputCols*nOutputRows;
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
/*
4D input, 4D kernel, 4D output
component wise multiplication like with a permutation map
y <- y.*x + beta*y
*/
void THTensor_(conv3Dmap)(THTensor *r_, real beta, real alpha, THTensor *t_, THTensor *k_, THTensor *map,
long sdepth, long srow, long scol, const char *vf, const char *xc)
{
long nInputPlane, nInputDepth, nInputRows, nInputCols;
long nKernelDepth, nKernelRows, nKernelCols;
long nOutputPlane, nOutputDepth, nOutputRows, nOutputCols;
long istride0, kstride0;
THTensor *input;
THTensor *kernel;
long nelem;
real *input_data;
real *weight_data;
real *output_data;
long nmaps;
long k;
THArgCheck(t_->nDimension == 4 , 3, "input: 4D Tensor expected");
THArgCheck(k_->nDimension == 4 , 4, "kernel: 4D Tensor expected");
THArgCheck(map->nDimension == 2 , 4, "map: 2D Tensor expected");
THArgCheck(srow >= 1, 6, "Stride should be a positive integer");
THArgCheck(scol >= 1, 7, "Stride should be a positive integer");
THArgCheck(*vf == 'V' || *vf == 'F', 8, "type of convolution can 'V' or 'F'");
THArgCheck(*xc == 'C' || *xc == 'X', 8, "type of convolution can 'X' or 'C'");
input = THTensor_(newContiguous)(t_);
kernel = THTensor_(newContiguous)(k_);
istride0 = input->stride[0];
nInputPlane = input->size[0];
nInputDepth = input->size[1];
nInputRows = input->size[2];
nInputCols = input->size[3];
kstride0 = kernel->stride[0];
nOutputPlane = kernel->size[0];
nKernelDepth = kernel->size[1];
nKernelRows = kernel->size[2];
nKernelCols = kernel->size[3];
THArgCheck(nOutputPlane == nInputPlane, 2, "invalid number of input/kernel planes");
THArgCheck((nInputDepth >= nKernelDepth
&& nInputRows >= nKernelRows
&& nInputCols >= nKernelCols) || *vf == 'F',
2, "conv3Dmap : Input image is smaller than kernel");
nOutputDepth = THTensor_(convsize)(nInputDepth, nKernelDepth, sdepth, vf);
nOutputRows = THTensor_(convsize)(nInputRows, nKernelRows, srow, vf);
nOutputCols = THTensor_(convsize)(nInputCols, nKernelCols, scol, vf);
nelem = THTensor_(nElement)(r_);
THTensor_(resize4d)(r_, nOutputPlane, nOutputDepth, nOutputRows, nOutputCols);
if (nelem == 0 || beta == 0 || nelem != THTensor_(nElement)(r_))
{
THTensor_(zero)(r_);
}
else if (beta != 1)
THTensor_(mul)(r_, r_, beta);
input_data = THTensor_(data)(input);
weight_data = THTensor_(data)(kernel);
output_data = THTensor_(data)(r_);
nmaps = map->size[0];
for(k = 0; k < nmaps; k++)
{
/* get indices */
long from = (long)THTensor_(get2d)(map,k,0)-1;
long to = (long)THTensor_(get2d)(map,k,1)-1;
/* get kernel */
real *ptr_weight = weight_data + k*kstride0;
/* get input */
real *ptr_input = input_data + from*istride0;
/* get output */
real *ptr_output = output_data + to*nOutputDepth*nOutputRows*nOutputCols;
/* do image, kernel convolution */
THTensor_(conv3d)(ptr_output,
alpha,
ptr_input, nInputDepth, nInputRows, nInputCols,
ptr_weight, nKernelDepth, nKernelRows, nKernelCols,
sdepth, srow, scol, vf, xc);
}
THTensor_(free)(input);
THTensor_(free)(kernel);
}
#endif
|
GB_binop__isle_uint32.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB_AaddB__isle_uint32
// A.*B function (eWiseMult): GB_AemultB__isle_uint32
// A*D function (colscale): GB_AxD__isle_uint32
// D*A function (rowscale): GB_DxB__isle_uint32
// C+=B function (dense accum): GB_Cdense_accumB__isle_uint32
// C+=b function (dense accum): GB_Cdense_accumb__isle_uint32
// C+=A+B function (dense ewise3): (none)
// C=A+B function (dense ewise3): GB_Cdense_ewise3_noaccum__isle_uint32
// C=scalar+B GB_bind1st__isle_uint32
// C=scalar+B' GB_bind1st_tran__isle_uint32
// C=A+scalar GB_bind2nd__isle_uint32
// C=A'+scalar GB_bind2nd_tran__isle_uint32
// C type: uint32_t
// A type: uint32_t
// B,b type: uint32_t
// BinaryOp: cij = (aij <= bij)
#define GB_ATYPE \
uint32_t
#define GB_BTYPE \
uint32_t
#define GB_CTYPE \
uint32_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
uint32_t aij = Ax [pA]
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB) \
uint32_t bij = Bx [pB]
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
uint32_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA) \
cij = Ax [pA]
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB) \
cij = Bx [pB]
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z, x, y, i, j) \
z = (x <= y) ;
// op is second
#define GB_OP_IS_SECOND \
0
// op is plus_fp32 or plus_fp64
#define GB_OP_IS_PLUS_REAL \
0
// op is minus_fp32 or minus_fp64
#define GB_OP_IS_MINUS_REAL \
0
// GB_cblas_*axpy gateway routine, if it exists for this operator and type:
#define GB_CBLAS_AXPY \
(none)
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_ISLE || GxB_NO_UINT32 || GxB_NO_ISLE_UINT32)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void (none)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_ewise3_noaccum__isle_uint32
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_accumB__isle_uint32
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *GB_RESTRICT kfirst_slice,
const int64_t *GB_RESTRICT klast_slice,
const int64_t *GB_RESTRICT pstart_slice,
const int ntasks,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB_Cdense_accumb__isle_uint32
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type uint32_t
uint32_t bwork = (*((uint32_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB_AxD__isle_uint32
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *GB_RESTRICT kfirst_slice,
const int64_t *GB_RESTRICT klast_slice,
const int64_t *GB_RESTRICT pstart_slice,
const int ntasks,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *GB_RESTRICT Cx = (uint32_t *) C->x ;
#include "GB_AxB_colscale_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB_DxB__isle_uint32
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *GB_RESTRICT Cx = (uint32_t *) C->x ;
#include "GB_AxB_rowscale_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseAdd: C = A+B or C<M> = A+B
//------------------------------------------------------------------------------
#undef GB_FREE_ALL
#define GB_FREE_ALL \
{ \
GB_ek_slice_free (&pstart_Mslice, &kfirst_Mslice, &klast_Mslice) ; \
GB_ek_slice_free (&pstart_Aslice, &kfirst_Aslice, &klast_Aslice) ; \
GB_ek_slice_free (&pstart_Bslice, &kfirst_Bslice, &klast_Bslice) ; \
}
GrB_Info GB_AaddB__isle_uint32
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *GB_RESTRICT C_to_M,
const int64_t *GB_RESTRICT C_to_A,
const int64_t *GB_RESTRICT C_to_B,
const GB_task_struct *GB_RESTRICT TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *pstart_Mslice = NULL, *kfirst_Mslice = NULL, *klast_Mslice = NULL ;
int64_t *pstart_Aslice = NULL, *kfirst_Aslice = NULL, *klast_Aslice = NULL ;
int64_t *pstart_Bslice = NULL, *kfirst_Bslice = NULL, *klast_Bslice = NULL ;
#include "GB_add_template.c"
GB_FREE_ALL ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C = A.*B or C<M> = A.*B
//------------------------------------------------------------------------------
GrB_Info GB_AemultB__isle_uint32
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *GB_RESTRICT C_to_M,
const int64_t *GB_RESTRICT C_to_A,
const int64_t *GB_RESTRICT C_to_B,
const GB_task_struct *GB_RESTRICT TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *pstart_Mslice = NULL, *kfirst_Mslice = NULL, *klast_Mslice = NULL ;
int64_t *pstart_Aslice = NULL, *kfirst_Aslice = NULL, *klast_Aslice = NULL ;
int64_t *pstart_Bslice = NULL, *kfirst_Bslice = NULL, *klast_Bslice = NULL ;
#include "GB_emult_template.c"
GB_FREE_ALL ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB_bind1st__isle_uint32
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *GB_RESTRICT Bb,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *Cx = (uint32_t *) Cx_output ;
uint32_t x = (*((uint32_t *) x_input)) ;
uint32_t *Bx = (uint32_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Bb, p)) continue ;
uint32_t bij = Bx [p] ;
Cx [p] = (x <= bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB_bind2nd__isle_uint32
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *GB_RESTRICT Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
uint32_t *Cx = (uint32_t *) Cx_output ;
uint32_t *Ax = (uint32_t *) Ax_input ;
uint32_t y = (*((uint32_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
uint32_t aij = Ax [p] ;
Cx [p] = (aij <= y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = Ax [pA] ; \
Cx [pC] = (x <= aij) ; \
}
GrB_Info GB_bind1st_tran__isle_uint32
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *GB_RESTRICT *Workspaces,
const int64_t *GB_RESTRICT A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t x = (*((const uint32_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = Ax [pA] ; \
Cx [pC] = (aij <= y) ; \
}
GrB_Info GB_bind2nd_tran__isle_uint32
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *GB_RESTRICT *Workspaces,
const int64_t *GB_RESTRICT A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t y = (*((const uint32_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
GB_binop__bclr_uint64.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__bclr_uint64)
// A.*B function (eWiseMult): GB (_AemultB_08__bclr_uint64)
// A.*B function (eWiseMult): GB (_AemultB_02__bclr_uint64)
// A.*B function (eWiseMult): GB (_AemultB_04__bclr_uint64)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__bclr_uint64)
// A*D function (colscale): GB ((none))
// D*A function (rowscale): GB ((none))
// C+=B function (dense accum): GB (_Cdense_accumB__bclr_uint64)
// C+=b function (dense accum): GB (_Cdense_accumb__bclr_uint64)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__bclr_uint64)
// C=scalar+B GB (_bind1st__bclr_uint64)
// C=scalar+B' GB (_bind1st_tran__bclr_uint64)
// C=A+scalar GB (_bind2nd__bclr_uint64)
// C=A'+scalar GB (_bind2nd_tran__bclr_uint64)
// C type: uint64_t
// A type: uint64_t
// B,b type: uint64_t
// BinaryOp: cij = GB_BITCLR (aij, bij, uint64_t, 64)
#define GB_ATYPE \
uint64_t
#define GB_BTYPE \
uint64_t
#define GB_CTYPE \
uint64_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
uint64_t aij = GBX (Ax, pA, A_iso)
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
uint64_t bij = GBX (Bx, pB, B_iso)
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
uint64_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = GB_BITCLR (x, y, uint64_t, 64) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
1
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_BCLR || GxB_NO_UINT64 || GxB_NO_BCLR_UINT64)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_ewise3_noaccum__bclr_uint64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__bclr_uint64)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__bclr_uint64)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type uint64_t
uint64_t bwork = (*((uint64_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint64_t *restrict Cx = (uint64_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint64_t *restrict Cx = (uint64_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__bclr_uint64)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
#include "GB_add_template.c"
GB_FREE_WORK ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__bclr_uint64)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__bclr_uint64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__bclr_uint64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__bclr_uint64)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__bclr_uint64)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint64_t *Cx = (uint64_t *) Cx_output ;
uint64_t x = (*((uint64_t *) x_input)) ;
uint64_t *Bx = (uint64_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
uint64_t bij = GBX (Bx, p, false) ;
Cx [p] = GB_BITCLR (x, bij, uint64_t, 64) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__bclr_uint64)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
uint64_t *Cx = (uint64_t *) Cx_output ;
uint64_t *Ax = (uint64_t *) Ax_input ;
uint64_t y = (*((uint64_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
uint64_t aij = GBX (Ax, p, false) ;
Cx [p] = GB_BITCLR (aij, y, uint64_t, 64) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (x, aij, uint64_t, 64) ; \
}
GrB_Info GB (_bind1st_tran__bclr_uint64)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
uint64_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint64_t x = (*((const uint64_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
uint64_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (aij, y, uint64_t, 64) ; \
}
GrB_Info GB (_bind2nd_tran__bclr_uint64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint64_t y = (*((const uint64_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
cheby.gold.h | #include "common/common.hpp"
void cheby_step (double *out_def, double* Ac_def, double* Ap_def, double* RHS_def, double* Dinv_def, double h2inv, double c1, double c2, int N) {
double (*Ap)[N][N] = (double (*)[N][N])Ap_def;
double (*Ac)[N][N] = (double (*)[N][N])Ac_def;
double (*out)[N][N] = (double (*)[N][N])out_def;
double (*RHS)[N][N] = (double (*)[N][N])RHS_def;
double (*Dinv)[N][N] = (double (*)[N][N])Dinv_def;
#pragma omp parallel for
for (int k = 1; k < N-1; k++) {
for (int j = 1; j < N-1; j++) {
#pragma GCC ivdep
for (int i = 1; i < N-1; i++) {
double MA = Ac[k][j][i] - h2inv * (0.03 * (Ac[k-1][j-1][i-1] + Ac[k-1][j-1][i+1] + Ac[k-1][j+1][i-1] + Ac[k-1][j+1][i+1] + Ac[k+1][j-1][i-1] + Ac[k+1][j-1][i+1] + Ac[k+1][j+1][i-1] + Ac[k+1][j+1][i+1]) + 0.1 * (Ac[k-1][j-1][i] + Ac[k-1][j][i-1] + Ac[k-1][j][i+1] + Ac[k-1][j+1][i] + Ac[k][j-1][i-1] + Ac[k][j-1][i+1] + Ac[k][j+1][i-1] + Ac[k][j+1][i+1] + Ac[k+1][j-1][i] + Ac[k+1][j][i-1] + Ac[k+1][j][i+1] + Ac[k+1][j+1][i]) + 0.46 * (Ac[k-1][j][i] + Ac[k][j-1][i] + Ac[k][j][i-1] + Ac[k][j][i+1] + Ac[k][j+1][i] + Ac[k+1][j][i]) - 4.26 * Ac[k][j][i]);
out[k][j][i] = Ac[k][j][i] + c1 * (Ac[k][j][i] - Ap[k][j][i]) + c2 * Dinv[k][j][i] * (RHS[k][j][i] - MA);
}
}
}
}
extern "C" void cheby_gold (double* out, double *Ac, double* Ap, double* RHS, double* Dinv, double h2inv, double c1, double c2, int N) {
double* temp1 = getZero3DArray<double>(N, N, N);
double* temp2 = getZero3DArray<double>(N, N, N);
double* temp3 = getZero3DArray<double>(N, N, N);
cheby_step(temp1, Ac, Ap, RHS, Dinv, h2inv, c1, c2, N);
cheby_step(out, temp1, Ac, RHS, Dinv, h2inv, c1, c2, N);
delete[] temp1;
delete[] temp2;
delete[] temp3;
}
|
par_relax_more.c |
/******************************************************************************
*
* a few more relaxation schemes: Chebychev, FCF-Jacobi, CG -
* these do not go through the CF interface (hypre_BoomerAMGRelaxIF)
*
*****************************************************************************/
#include "_hypre_parcsr_ls.h"
#include "float.h"
HYPRE_Int hypre_LINPACKcgtql1(HYPRE_Int*,double *,double *,HYPRE_Int *);
/******************************************************************************
*
*use max norm to estimate largest eigenvalue
*
*****************************************************************************/
HYPRE_Int hypre_ParCSRMaxEigEstimate(hypre_ParCSRMatrix *A, /* matrix to relax with */
HYPRE_Int scale, /* scale by diagonal?*/
double *max_eig)
{
double e_max;
double row_sum, max_norm;
double *col_val;
double temp;
double diag_value;
HYPRE_Int pos_diag, neg_diag;
HYPRE_Int start_row, end_row;
HYPRE_Int row_length;
HYPRE_Int *col_ind;
HYPRE_Int j;
HYPRE_Int i;
/* estimate with the inf-norm of A - should be ok for SPD matrices */
start_row = hypre_ParCSRMatrixFirstRowIndex(A);
end_row = hypre_ParCSRMatrixLastRowIndex(A);
max_norm = 0.0;
pos_diag = neg_diag = 0;
for ( i = start_row; i <= end_row; i++ )
{
HYPRE_ParCSRMatrixGetRow((HYPRE_ParCSRMatrix) A, i, &row_length, &col_ind, &col_val);
row_sum = 0.0;
for (j = 0; j < row_length; j++)
{
if (j==0) diag_value = fabs(col_val[j]);
row_sum += fabs(col_val[j]);
if ( col_ind[j] == i && col_val[j] > 0.0 ) pos_diag++;
if ( col_ind[j] == i && col_val[j] < 0.0 ) neg_diag++;
}
if (scale)
{
if (diag_value != 0.0)
row_sum = row_sum/diag_value;
}
if ( row_sum > max_norm ) max_norm = row_sum;
HYPRE_ParCSRMatrixRestoreRow((HYPRE_ParCSRMatrix) A, i, &row_length, &col_ind, &col_val);
}
/* get max across procs */
hypre_MPI_Allreduce(&max_norm, &temp, 1, hypre_MPI_DOUBLE, hypre_MPI_MAX, hypre_ParCSRMatrixComm(A));
max_norm = temp;
/* from Charles */
if ( pos_diag == 0 && neg_diag > 0 ) max_norm = - max_norm;
/* eig estimates */
e_max = max_norm;
/* return */
*max_eig = e_max;
return hypre_error_flag;
}
/******************************************************************************
use CG to get the eigenvalue estimate
scale means get eig est of (D^{-1/2} A D^{-1/2}
******************************************************************************/
HYPRE_Int hypre_ParCSRMaxEigEstimateCG(hypre_ParCSRMatrix *A, /* matrix to relax with */
HYPRE_Int scale, /* scale by diagonal?*/
HYPRE_Int max_iter,
double *max_eig,
double *min_eig)
{
HYPRE_Int i, j, err;
hypre_ParVector *p;
hypre_ParVector *s;
hypre_ParVector *r;
hypre_ParVector *ds;
hypre_ParVector *u;
double *tridiag;
double *trioffd;
double lambda_max , max_row_sum;
double beta, gamma = 0.0, alpha, sdotp, gamma_old, alphainv;
double diag;
double lambda_min;
double *s_data, *p_data, *ds_data, *u_data;
HYPRE_Int local_size = hypre_CSRMatrixNumRows(hypre_ParCSRMatrixDiag(A));
hypre_CSRMatrix *A_diag = hypre_ParCSRMatrixDiag(A);
double *A_diag_data = hypre_CSRMatrixData(A_diag);
HYPRE_Int *A_diag_i = hypre_CSRMatrixI(A_diag);
/* check the size of A - don't iterate more than the size */
HYPRE_Int size = hypre_ParCSRMatrixGlobalNumRows(A);
if (size < max_iter)
max_iter = size;
/* create some temp vectors: p, s, r , ds, u*/
r = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(r);
hypre_ParVectorSetPartitioningOwner(r,0);
p = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(p);
hypre_ParVectorSetPartitioningOwner(p,0);
s = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(s);
hypre_ParVectorSetPartitioningOwner(s,0);
ds = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(ds);
hypre_ParVectorSetPartitioningOwner(ds,0);
u = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(u);
hypre_ParVectorSetPartitioningOwner(u,0);
/* point to local data */
s_data = hypre_VectorData(hypre_ParVectorLocalVector(s));
p_data = hypre_VectorData(hypre_ParVectorLocalVector(p));
ds_data = hypre_VectorData(hypre_ParVectorLocalVector(ds));
u_data = hypre_VectorData(hypre_ParVectorLocalVector(u));
/* make room for tri-diag matrix */
tridiag = hypre_CTAlloc(double, max_iter+1);
trioffd = hypre_CTAlloc(double, max_iter+1);
for (i=0; i < max_iter + 1; i++)
{
tridiag[i] = 0;
trioffd[i] = 0;
}
/* set residual to random */
hypre_ParVectorSetRandomValues(r,1);
if (scale)
{
for (i = 0; i < local_size; i++)
{
diag = A_diag_data[A_diag_i[i]];
ds_data[i] = 1/sqrt(diag);
}
}
else
{
/* set ds to 1 */
hypre_ParVectorSetConstantValues(ds,1.0);
}
/* gamma = <r,Cr> */
gamma = hypre_ParVectorInnerProd(r,p);
/* for the initial filling of the tridiag matrix */
beta = 1.0;
max_row_sum = 0.0;
i = 0;
while (i < max_iter)
{
/* s = C*r */
/* TO DO: C = diag scale */
hypre_ParVectorCopy(r, s);
/*gamma = <r,Cr> */
gamma_old = gamma;
gamma = hypre_ParVectorInnerProd(r,s);
if (i==0)
{
beta = 1.0;
/* p_0 = C*r */
hypre_ParVectorCopy(s, p);
}
else
{
/* beta = gamma / gamma_old */
beta = gamma / gamma_old;
/* p = s + beta p */
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for (j=0; j < local_size; j++)
{
p_data[j] = s_data[j] + beta*p_data[j];
}
}
if (scale)
{
/* s = D^{-1/2}A*D^{-1/2}*p */
for (j = 0; j < local_size; j++)
{
u_data[j] = ds_data[j] * p_data[j];
}
hypre_ParCSRMatrixMatvec(1.0, A, u, 0.0, s);
for (j = 0; j < local_size; j++)
{
s_data[j] = ds_data[j] * s_data[j];
}
}
else
{
/* s = A*p */
hypre_ParCSRMatrixMatvec(1.0, A, p, 0.0, s);
}
/* <s,p> */
sdotp = hypre_ParVectorInnerProd(s,p);
/* alpha = gamma / <s,p> */
alpha = gamma/sdotp;
/* get tridiagonal matrix */
alphainv = 1.0/alpha;
tridiag[i+1] = alphainv;
tridiag[i] *= beta;
tridiag[i] += alphainv;
trioffd[i+1] = alphainv;
trioffd[i] *= sqrt(beta);
/* x = x + alpha*p */
/* don't need */
/* r = r - alpha*s */
hypre_ParVectorAxpy( -alpha, s, r);
i++;
}
/* eispack routine - eigenvalues return in tridiag and ordered*/
hypre_LINPACKcgtql1(&i,tridiag,trioffd,&err);
lambda_max = tridiag[i-1];
lambda_min = tridiag[0];
/* hypre_printf("linpack max eig est = %g\n", lambda_max);*/
/* hypre_printf("linpack min eig est = %g\n", lambda_min);*/
hypre_ParVectorDestroy(r);
hypre_ParVectorDestroy(s);
hypre_ParVectorDestroy(p);
hypre_ParVectorDestroy(ds);
hypre_ParVectorDestroy(u);
/* return */
*max_eig = lambda_max;
*min_eig = lambda_min;
return hypre_error_flag;
}
/******************************************************************************
Chebyshev relaxation
Can specify order 1-4 (this is the order of the resid polynomial)- here we
explicitly code the coefficients (instead of
iteratively determining)
variant 0: standard chebyshev
this is rlx 11 if scale = 0, and 16 if scale == 1
variant 1: modified cheby: T(t)* f(t) where f(t) = (1-b/t)
this is rlx 15 if scale = 0, and 17 if scale == 1
ratio indicates the percentage of the whole spectrum to use (so .5
means half, and .1 means 10percent)
*******************************************************************************/
HYPRE_Int hypre_ParCSRRelax_Cheby(hypre_ParCSRMatrix *A, /* matrix to relax with */
hypre_ParVector *f, /* right-hand side */
double max_eig,
double min_eig,
double fraction,
HYPRE_Int order, /* polynomial order */
HYPRE_Int scale, /* scale by diagonal?*/
HYPRE_Int variant,
hypre_ParVector *u, /* initial/updated approximation */
hypre_ParVector *v /* temporary vector */,
hypre_ParVector *r /*another temp vector */ )
{
hypre_CSRMatrix *A_diag = hypre_ParCSRMatrixDiag(A);
double *A_diag_data = hypre_CSRMatrixData(A_diag);
HYPRE_Int *A_diag_i = hypre_CSRMatrixI(A_diag);
double *u_data = hypre_VectorData(hypre_ParVectorLocalVector(u));
double *f_data = hypre_VectorData(hypre_ParVectorLocalVector(f));
double *v_data = hypre_VectorData(hypre_ParVectorLocalVector(v));
double *r_data = hypre_VectorData(hypre_ParVectorLocalVector(r));
double theta, delta;
double den;
double upper_bound, lower_bound;
HYPRE_Int i, j;
HYPRE_Int num_rows = hypre_CSRMatrixNumRows(A_diag);
double coefs[5];
double mult;
double *orig_u;
double tmp_d;
HYPRE_Int cheby_order;
double *ds_data, *tmp_data;
double diag;
hypre_ParVector *ds;
hypre_ParVector *tmp_vec;
/* u = u + p(A)r */
if (order > 4)
order = 4;
if (order < 1)
order = 1;
/* we are using the order of p(A) */
cheby_order = order -1;
/* make sure we are large enough - Adams et al. 2003 */
upper_bound = max_eig * 1.1;
/* lower_bound = max_eig/fraction; */
lower_bound = (upper_bound - min_eig)* fraction + min_eig;
/* theta and delta */
theta = (upper_bound + lower_bound)/2;
delta = (upper_bound - lower_bound)/2;
if (variant == 1 )
{
switch ( cheby_order ) /* these are the corresponding cheby polynomials: u = u_o + s(A)r_0 - so order is
one less that resid poly: r(t) = 1 - t*s(t) */
{
case 0:
coefs[0] = 1.0/theta;
break;
case 1: /* (del - t + 2*th)/(th^2 + del*th) */
den = (theta*theta + delta*theta);
coefs[0] = (delta + 2*theta)/den;
coefs[1] = -1.0/den;
break;
case 2: /* (4*del*th - del^2 - t*(2*del + 6*th) + 2*t^2 + 6*th^2)/(2*del*th^2 - del^2*th - del^3 + 2*th^3)*/
den = 2*delta*theta*theta - delta*delta*theta - pow(delta,3) + 2*pow(theta,3);
coefs[0] = (4*delta*theta - pow(delta,2) + 6*pow(theta,2))/den;
coefs[1] = -(2*delta + 6*theta)/den;
coefs[2] = 2/den;
break;
case 3: /* -(6*del^2*th - 12*del*th^2 - t^2*(4*del + 16*th) + t*(12*del*th - 3*del^2 + 24*th^2) + 3*del^3 + 4*t^3 - 16*th^3)/(4*del*th^3 - 3*del^2*th^2 - 3*del^3*th + 4*th^4)*/
den = - (4*delta*pow(theta,3) - 3*pow(delta,2)*pow(theta,2) - 3*pow(delta,3)*theta + 4*pow(theta,4) );
coefs[0] = (6*pow(delta,2)*theta - 12*delta*pow(theta,2) + 3*pow(delta,3) - 16*pow(theta,3) )/den;
coefs[1] = (12*delta*theta - 3*pow(delta,2) + 24*pow(theta,2))/den;
coefs[2] = -( 4*delta + 16*theta)/den;
coefs[3] = 4/den;
break;
}
}
else /* standard chebyshev */
{
switch ( cheby_order ) /* these are the corresponding cheby polynomials: u = u_o + s(A)r_0 - so order is
one less thatn resid poly: r(t) = 1 - t*s(t) */
{
case 0:
coefs[0] = 1.0/theta;
break;
case 1: /* ( 2*t - 4*th)/(del^2 - 2*th^2) */
den = delta*delta - 2*theta*theta;
coefs[0] = -4*theta/den;
coefs[1] = 2/den;
break;
case 2: /* (3*del^2 - 4*t^2 + 12*t*th - 12*th^2)/(3*del^2*th - 4*th^3)*/
den = 3*(delta*delta)*theta - 4*(theta*theta*theta);
coefs[0] = (3*delta*delta - 12 *theta*theta)/den;
coefs[1] = 12*theta/den;
coefs[2] = -4/den;
break;
case 3: /*(t*(8*del^2 - 48*th^2) - 16*del^2*th + 32*t^2*th - 8*t^3 + 32*th^3)/(del^4 - 8*del^2*th^2 + 8*th^4)*/
den = pow(delta,4) - 8*delta*delta*theta*theta + 8*pow(theta,4);
coefs[0] = (32*pow(theta,3)- 16*delta*delta*theta)/den;
coefs[1] = (8*delta*delta - 48*theta*theta)/den;
coefs[2] = 32*theta/den;
coefs[3] = -8/den;
break;
}
}
orig_u = hypre_CTAlloc(double, num_rows);
if (!scale)
{
/* get residual: r = f - A*u */
hypre_ParVectorCopy(f, r);
hypre_ParCSRMatrixMatvec(-1.0, A, u, 1.0, r);
for ( i = 0; i < num_rows; i++ )
{
orig_u[i] = u_data[i];
u_data[i] = r_data[i] * coefs[cheby_order];
}
for (i = cheby_order - 1; i >= 0; i-- )
{
hypre_ParCSRMatrixMatvec(1.0, A, u, 0.0, v);
mult = coefs[i];
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
u_data[j] = mult * r_data[j] + v_data[j];
}
}
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE
#endif
for ( i = 0; i < num_rows; i++ )
{
u_data[i] = orig_u[i] + u_data[i];
}
}
else /* scaling! */
{
/*grab 1/sqrt(diagonal) */
ds = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(ds);
hypre_ParVectorSetPartitioningOwner(ds,0);
ds_data = hypre_VectorData(hypre_ParVectorLocalVector(ds));
tmp_vec = hypre_ParVectorCreate(hypre_ParCSRMatrixComm(A),
hypre_ParCSRMatrixGlobalNumRows(A),
hypre_ParCSRMatrixRowStarts(A));
hypre_ParVectorInitialize(tmp_vec);
hypre_ParVectorSetPartitioningOwner(tmp_vec,0);
tmp_data = hypre_VectorData(hypre_ParVectorLocalVector(tmp_vec));
/* get ds_data and get scaled residual: r = D^(-1/2)f -
* D^(-1/2)A*u */
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j,diag) HYPRE_SMP_SCHEDULE
#endif
for (j = 0; j < num_rows; j++)
{
diag = A_diag_data[A_diag_i[j]];
ds_data[j] = 1/sqrt(diag);
r_data[j] = ds_data[j] * f_data[j];
}
hypre_ParCSRMatrixMatvec(-1.0, A, u, 0.0, tmp_vec);
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
r_data[j] += ds_data[j] * tmp_data[j];
}
/* save original u, then start
the iteration by multiplying r by the cheby coef.*/
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
orig_u[j] = u_data[j]; /* orig, unscaled u */
u_data[j] = r_data[j] * coefs[cheby_order];
}
/* now do the other coefficients */
for (i = cheby_order - 1; i >= 0; i-- )
{
/* v = D^(-1/2)AD^(-1/2)u */
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
tmp_data[j] = ds_data[j] * u_data[j];
}
hypre_ParCSRMatrixMatvec(1.0, A, tmp_vec, 0.0, v);
/* u_new = coef*r + v*/
mult = coefs[i];
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j,tmp_d) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
tmp_d = ds_data[j]* v_data[j];
u_data[j] = mult * r_data[j] + tmp_d;
}
} /* end of cheby_order loop */
/* now we have to scale u_data before adding it to u_orig*/
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(j) HYPRE_SMP_SCHEDULE
#endif
for ( j = 0; j < num_rows; j++ )
{
u_data[j] = orig_u[j] + ds_data[j]*u_data[j];
}
hypre_ParVectorDestroy(ds);
hypre_ParVectorDestroy(tmp_vec);
}/* end of scaling code */
hypre_TFree(orig_u);
return hypre_error_flag;
}
/*--------------------------------------------------------------------------
* hypre_BoomerAMGRelax_FCFJacobi
*--------------------------------------------------------------------------*/
HYPRE_Int hypre_BoomerAMGRelax_FCFJacobi( hypre_ParCSRMatrix *A,
hypre_ParVector *f,
HYPRE_Int *cf_marker,
double relax_weight,
hypre_ParVector *u,
hypre_ParVector *Vtemp)
{
HYPRE_Int i;
HYPRE_Int relax_points[3];
HYPRE_Int relax_type = 0;
hypre_ParVector *Ztemp = NULL;
relax_points[0] = -1; /*F */
relax_points[1] = 1; /*C */
relax_points[2] = -1; /*F */
/* if we are on the coarsest level ,the cf_marker will be null
and we just do one sweep regular jacobi */
if (cf_marker == NULL)
{
hypre_BoomerAMGRelax(A,
f,
cf_marker,
relax_type,
0,
relax_weight,
0.0,
NULL,
u,
Vtemp, Ztemp);
}
else
{
for (i=0; i < 3; i++)
hypre_BoomerAMGRelax(A,
f,
cf_marker,
relax_type,
relax_points[i],
relax_weight,
0.0,
NULL,
u,
Vtemp, Ztemp);
}
return hypre_error_flag;
}
/*--------------------------------------------------------------------------
* CG Smoother -
*
*--------------------------------------------------------------------------*/
HYPRE_Int hypre_ParCSRRelax_CG( HYPRE_Solver solver,
hypre_ParCSRMatrix *A,
hypre_ParVector *f,
hypre_ParVector *u,
HYPRE_Int num_its)
{
HYPRE_PCGSetMaxIter(solver, num_its); /* max iterations */
HYPRE_ParCSRPCGSolve(solver, (HYPRE_ParCSRMatrix)A, (HYPRE_ParVector)f, (HYPRE_ParVector)u);
#if 0
{
HYPRE_Int myid;
HYPRE_Int num_iterations;
double final_res_norm;
hypre_MPI_Comm_rank(hypre_MPI_COMM_WORLD, &myid);
HYPRE_PCGGetNumIterations(solver, &num_iterations);
HYPRE_PCGGetFinalRelativeResidualNorm(solver, &final_res_norm);
if (myid ==0)
{
hypre_printf(" -----CG PCG Iterations = %d\n", num_iterations);
hypre_printf(" -----CG PCG Final Relative Residual Norm = %e\n", final_res_norm);
}
}
#endif
return hypre_error_flag;
}
/* tql1.f --
this is the eispack translation - from Barry Smith in Petsc
Note that this routine always uses real numbers (not complex) even
if the underlying matrix is Hermitian. This is because the Lanczos
process applied to Hermitian matrices always produces a real,
symmetric tridiagonal matrix.
*/
double hypre_LINPACKcgpthy(double*,double*);
HYPRE_Int hypre_LINPACKcgtql1(HYPRE_Int *n,double *d,double *e,HYPRE_Int *ierr)
{
/* System generated locals */
HYPRE_Int i__1,i__2;
double d__1,d__2,c_b10 = 1.0;
/* Local variables */
double c,f,g,h;
HYPRE_Int i,j,l,m;
double p,r,s,c2,c3 = 0.0;
HYPRE_Int l1,l2;
double s2 = 0.0;
HYPRE_Int ii;
double dl1,el1;
HYPRE_Int mml;
double tst1,tst2;
/* THIS SUBROUTINE IS A TRANSLATION OF THE ALGOL PROCEDURE TQL1, */
/* NUM. MATH. 11, 293-306(1968) BY BOWDLER, MARTIN, REINSCH, AND */
/* WILKINSON. */
/* HANDBOOK FOR AUTO. COMP., VOL.II-LINEAR ALGEBRA, 227-240(1971). */
/* THIS SUBROUTINE FINDS THE EIGENVALUES OF A SYMMETRIC */
/* TRIDIAGONAL MATRIX BY THE QL METHOD. */
/* ON INPUT */
/* N IS THE ORDER OF THE MATRIX. */
/* D CONTAINS THE DIAGONAL ELEMENTS OF THE INPUT MATRIX. */
/* E CONTAINS THE SUBDIAGONAL ELEMENTS OF THE INPUT MATRIX */
/* IN ITS LAST N-1 POSITIONS. E(1) IS ARBITRARY. */
/* ON OUTPUT */
/* D CONTAINS THE EIGENVALUES IN ASCENDING ORDER. IF AN */
/* ERROR EXIT IS MADE, THE EIGENVALUES ARE CORRECT AND */
/* ORDERED FOR INDICES 1,2,...IERR-1, BUT MAY NOT BE */
/* THE SMALLEST EIGENVALUES. */
/* E HAS BEEN DESTROYED. */
/* IERR IS SET TO */
/* ZERO FOR NORMAL RETURN, */
/* J IF THE J-TH EIGENVALUE HAS NOT BEEN */
/* DETERMINED AFTER 30 ITERATIONS. */
/* CALLS CGPTHY FOR DSQRT(A*A + B*B) . */
/* QUESTIONS AND COMMENTS SHOULD BE DIRECTED TO BURTON S. GARBOW, */
/* MATHEMATICS AND COMPUTER SCIENCE DIV, ARGONNE NATIONAL LABORATORY
*/
/* THIS VERSION DATED AUGUST 1983. */
/* ------------------------------------------------------------------
*/
double ds;
--e;
--d;
*ierr = 0;
if (*n == 1) {
goto L1001;
}
i__1 = *n;
for (i = 2; i <= i__1; ++i) {
e[i - 1] = e[i];
}
f = 0.;
tst1 = 0.;
e[*n] = 0.;
i__1 = *n;
for (l = 1; l <= i__1; ++l) {
j = 0;
h = (d__1 = d[l],fabs(d__1)) + (d__2 = e[l],fabs(d__2));
if (tst1 < h) {
tst1 = h;
}
/* .......... LOOK FOR SMALL SUB-DIAGONAL ELEMENT .......... */
i__2 = *n;
for (m = l; m <= i__2; ++m) {
tst2 = tst1 + (d__1 = e[m],fabs(d__1));
if (tst2 == tst1) {
goto L120;
}
/* .......... E(N) IS ALWAYS ZERO,SO THERE IS NO EXIT */
/* THROUGH THE BOTTOM OF THE LOOP .......... */
}
L120:
if (m == l) {
goto L210;
}
L130:
if (j == 30) {
goto L1000;
}
++j;
/* .......... FORM SHIFT .......... */
l1 = l + 1;
l2 = l1 + 1;
g = d[l];
p = (d[l1] - g) / (e[l] * 2.);
r = hypre_LINPACKcgpthy(&p,&c_b10);
ds = 1.0; if (p < 0.0) ds = -1.0;
d[l] = e[l] / (p + ds*r);
d[l1] = e[l] * (p + ds*r);
dl1 = d[l1];
h = g - d[l];
if (l2 > *n) {
goto L145;
}
i__2 = *n;
for (i = l2; i <= i__2; ++i) {
d[i] -= h;
}
L145:
f += h;
/* .......... QL TRANSFORMATION .......... */
p = d[m];
c = 1.;
c2 = c;
el1 = e[l1];
s = 0.;
mml = m - l;
/* .......... FOR I=M-1 STEP -1 UNTIL L DO -- .......... */
i__2 = mml;
for (ii = 1; ii <= i__2; ++ii) {
c3 = c2;
c2 = c;
s2 = s;
i = m - ii;
g = c * e[i];
h = c * p;
r = hypre_LINPACKcgpthy(&p,&e[i]);
e[i + 1] = s * r;
s = e[i] / r;
c = p / r;
p = c * d[i] - s * g;
d[i + 1] = h + s * (c * g + s * d[i]);
}
p = -s * s2 * c3 * el1 * e[l] / dl1;
e[l] = s * p;
d[l] = c * p;
tst2 = tst1 + (d__1 = e[l],fabs(d__1));
if (tst2 > tst1) {
goto L130;
}
L210:
p = d[l] + f;
/* .......... ORDER EIGENVALUES .......... */
if (l == 1) {
goto L250;
}
/* .......... FOR I=L STEP -1 UNTIL 2 DO -- .......... */
i__2 = l;
for (ii = 2; ii <= i__2; ++ii) {
i = l + 2 - ii;
if (p >= d[i - 1]) {
goto L270;
}
d[i] = d[i - 1];
}
L250:
i = 1;
L270:
d[i] = p;
}
goto L1001;
/* .......... SET ERROR -- NO CONVERGENCE TO AN */
/* EIGENVALUE AFTER 30 ITERATIONS .......... */
L1000:
*ierr = l;
L1001:
return 0;
} /* cgtql1_ */
double hypre_LINPACKcgpthy(double *a,double *b)
{
/* System generated locals */
double ret_val,d__1,d__2,d__3;
/* Local variables */
double p,r,s,t,u;
/* FINDS DSQRT(A**2+B**2) WITHOUT OVERFLOW OR DESTRUCTIVE UNDERFLOW */
/* Computing MAX */
d__1 = fabs(*a),d__2 = fabs(*b);
p = hypre_max(d__1,d__2);
if (!p) {
goto L20;
}
/* Computing MIN */
d__2 = fabs(*a),d__3 = fabs(*b);
/* Computing 2nd power */
d__1 = hypre_min(d__2,d__3) / p;
r = d__1 * d__1;
L10:
t = r + 4.;
if (t == 4.) {
goto L20;
}
s = r / t;
u = s * 2. + 1.;
p = u * p;
/* Computing 2nd power */
d__1 = s / u;
r = d__1 * d__1 * r;
goto L10;
L20:
ret_val = p;
return ret_val;
} /* cgpthy_ */
/*--------------------------------------------------------------------------
* hypre_ParCSRRelax_L1_Jacobi (same as the one in AMS, but this allows CF)
u += w D^{-1}(f - A u), where D_ii = ||A(i,:)||_1
*--------------------------------------------------------------------------*/
HYPRE_Int hypre_ParCSRRelax_L1_Jacobi( hypre_ParCSRMatrix *A,
hypre_ParVector *f,
HYPRE_Int *cf_marker,
HYPRE_Int relax_points,
double relax_weight,
double *l1_norms,
hypre_ParVector *u,
hypre_ParVector *Vtemp )
{
MPI_Comm comm = hypre_ParCSRMatrixComm(A);
hypre_CSRMatrix *A_diag = hypre_ParCSRMatrixDiag(A);
double *A_diag_data = hypre_CSRMatrixData(A_diag);
HYPRE_Int *A_diag_i = hypre_CSRMatrixI(A_diag);
HYPRE_Int *A_diag_j = hypre_CSRMatrixJ(A_diag);
hypre_CSRMatrix *A_offd = hypre_ParCSRMatrixOffd(A);
HYPRE_Int *A_offd_i = hypre_CSRMatrixI(A_offd);
double *A_offd_data = hypre_CSRMatrixData(A_offd);
HYPRE_Int *A_offd_j = hypre_CSRMatrixJ(A_offd);
hypre_ParCSRCommPkg *comm_pkg = hypre_ParCSRMatrixCommPkg(A);
hypre_ParCSRCommHandle *comm_handle;
HYPRE_Int n = hypre_CSRMatrixNumRows(A_diag);
HYPRE_Int num_cols_offd = hypre_CSRMatrixNumCols(A_offd);
hypre_Vector *u_local = hypre_ParVectorLocalVector(u);
double *u_data = hypre_VectorData(u_local);
hypre_Vector *f_local = hypre_ParVectorLocalVector(f);
double *f_data = hypre_VectorData(f_local);
hypre_Vector *Vtemp_local = hypre_ParVectorLocalVector(Vtemp);
double *Vtemp_data = hypre_VectorData(Vtemp_local);
double *Vext_data = NULL;
double *v_buf_data;
HYPRE_Int i, j;
HYPRE_Int ii, jj;
HYPRE_Int num_sends;
HYPRE_Int index, start;
HYPRE_Int num_procs, my_id ;
double zero = 0.0;
double res;
hypre_MPI_Comm_size(comm,&num_procs);
hypre_MPI_Comm_rank(comm,&my_id);
if (num_procs > 1)
{
num_sends = hypre_ParCSRCommPkgNumSends(comm_pkg);
v_buf_data = hypre_CTAlloc(double,
hypre_ParCSRCommPkgSendMapStart(comm_pkg, num_sends));
Vext_data = hypre_CTAlloc(double,num_cols_offd);
if (num_cols_offd)
{
A_offd_j = hypre_CSRMatrixJ(A_offd);
A_offd_data = hypre_CSRMatrixData(A_offd);
}
index = 0;
for (i = 0; i < num_sends; i++)
{
start = hypre_ParCSRCommPkgSendMapStart(comm_pkg, i);
for (j=start; j < hypre_ParCSRCommPkgSendMapStart(comm_pkg, i+1); j++)
v_buf_data[index++]
= u_data[hypre_ParCSRCommPkgSendMapElmt(comm_pkg,j)];
}
comm_handle = hypre_ParCSRCommHandleCreate( 1, comm_pkg, v_buf_data,
Vext_data);
}
/*-----------------------------------------------------------------
* Copy current approximation into temporary vector.
*-----------------------------------------------------------------*/
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(i) HYPRE_SMP_SCHEDULE
#endif
for (i = 0; i < n; i++)
{
Vtemp_data[i] = u_data[i];
}
if (num_procs > 1)
{
hypre_ParCSRCommHandleDestroy(comm_handle);
comm_handle = NULL;
}
/*-----------------------------------------------------------------
* Relax all points.
*-----------------------------------------------------------------*/
if (relax_points == 0)
{
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(i,ii,jj,res) HYPRE_SMP_SCHEDULE
#endif
for (i = 0; i < n; i++)
{
/*-----------------------------------------------------------
* If diagonal is nonzero, relax point i; otherwise, skip it.
*-----------------------------------------------------------*/
if (A_diag_data[A_diag_i[i]] != zero)
{
res = f_data[i];
for (jj = A_diag_i[i]; jj < A_diag_i[i+1]; jj++)
{
ii = A_diag_j[jj];
res -= A_diag_data[jj] * Vtemp_data[ii];
}
for (jj = A_offd_i[i]; jj < A_offd_i[i+1]; jj++)
{
ii = A_offd_j[jj];
res -= A_offd_data[jj] * Vext_data[ii];
}
u_data[i] += (relax_weight*res)/l1_norms[i];
}
}
}
/*-----------------------------------------------------------------
* Relax only C or F points as determined by relax_points.
*-----------------------------------------------------------------*/
else
{
#ifdef HYPRE_USING_OPENMP
#pragma omp parallel for private(i,ii,jj,res) HYPRE_SMP_SCHEDULE
#endif
for (i = 0; i < n; i++)
{
/*-----------------------------------------------------------
* If i is of the right type ( C or F ) and diagonal is
* nonzero, relax point i; otherwise, skip it.
*-----------------------------------------------------------*/
if (cf_marker[i] == relax_points
&& A_diag_data[A_diag_i[i]] != zero)
{
res = f_data[i];
for (jj = A_diag_i[i]; jj < A_diag_i[i+1]; jj++)
{
ii = A_diag_j[jj];
res -= A_diag_data[jj] * Vtemp_data[ii];
}
for (jj = A_offd_i[i]; jj < A_offd_i[i+1]; jj++)
{
ii = A_offd_j[jj];
res -= A_offd_data[jj] * Vext_data[ii];
}
u_data[i] += (relax_weight * res)/l1_norms[i];
}
}
}
if (num_procs > 1)
{
hypre_TFree(Vext_data);
hypre_TFree(v_buf_data);
}
return 0;
}
|
yolov2_forward_network.c | #include "additionally.h" // some definitions from: im2col.h, blas.h, list.h, utils.h, activations.h, tree.h, layer.h, network.h
// softmax_layer.h, reorg_layer.h, route_layer.h, region_layer.h, maxpool_layer.h, convolutional_layer.h
#define GEMMCONV
/*
// from: box.h
typedef struct {
float x, y, w, h;
} box;
*/
// binary transpose
size_t binary_transpose_align_input(int k, int n, float *b, char **t_bit_input, size_t ldb_align, int bit_align)
{
size_t new_ldb = k + (ldb_align - k%ldb_align); // (k / 8 + 1) * 8;
size_t t_intput_size = new_ldb * n;
size_t t_bit_input_size = t_intput_size / 8;// +1;
*t_bit_input = calloc(t_bit_input_size, sizeof(char));
//printf("\n t_bit_input_size = %d, k = %d, n = %d, new_ldb = %d \n", t_bit_input_size, k, n, new_ldb);
int src_size = k * bit_align;
transpose_bin(b, *t_bit_input, k, n, bit_align, new_ldb, 8);
return t_intput_size;
}
// 4 layers in 1: convolution, batch-normalization, BIAS and activation
void forward_convolutional_layer_cpu(layer l, network_state state)
{
int out_h = (l.h + 2 * l.pad - l.size) / l.stride + 1; // output_height=input_height for stride=1 and pad=1
int out_w = (l.w + 2 * l.pad - l.size) / l.stride + 1; // output_width=input_width for stride=1 and pad=1
int i, f, j;
// fill zero (ALPHA)
for (i = 0; i < l.outputs; ++i) l.output[i] = 0;
if (l.xnor) {
if (!l.align_bit_weights)
{
binarize_weights(l.weights, l.n, l.c*l.size*l.size, l.binary_weights);
//printf("\n binarize_weights l.align_bit_weights = %p \n", l.align_bit_weights);
}
binarize_cpu(state.input, l.c*l.h*l.w*l.batch, l.binary_input);
l.weights = l.binary_weights;
state.input = l.binary_input;
}
// l.n - number of filters on this layer
// l.c - channels of input-array
// l.h - height of input-array
// l.w - width of input-array
// l.size - width and height of filters (the same size for all filters)
// 1. Convolution !!!
#ifndef GEMMCONV
int fil;
// filter index
#pragma omp parallel for // "omp parallel for" - automatic parallelization of loop by using OpenMP
for (fil = 0; fil < l.n; ++fil) {
int chan, y, x, f_y, f_x;
// channel index
for (chan = 0; chan < l.c; ++chan)
// input - y
for (y = 0; y < l.h; ++y)
// input - x
for (x = 0; x < l.w; ++x)
{
int const output_index = fil*l.w*l.h + y*l.w + x;
int const weights_pre_index = fil*l.c*l.size*l.size + chan*l.size*l.size;
int const input_pre_index = chan*l.w*l.h;
float sum = 0;
// filter - y
for (f_y = 0; f_y < l.size; ++f_y)
{
int input_y = y + f_y - l.pad;
// filter - x
for (f_x = 0; f_x < l.size; ++f_x)
{
int input_x = x + f_x - l.pad;
if (input_y < 0 || input_x < 0 || input_y >= l.h || input_x >= l.w) continue;
int input_index = input_pre_index + input_y*l.w + input_x;
int weights_index = weights_pre_index + f_y*l.size + f_x;
sum += state.input[input_index] * l.weights[weights_index];
}
}
// l.output[filters][width][height] +=
// state.input[channels][width][height] *
// l.weights[filters][channels][filter_width][filter_height];
l.output[output_index] += sum;
}
}
#else
int m = l.n;
int k = l.size*l.size*l.c;
int n = out_h*out_w;
float *a = l.weights;
float *b = state.workspace;
float *c = l.output;
// convolution as GEMM (as part of BLAS)
for (i = 0; i < l.batch; ++i) {
//im2col_cpu(state.input, l.c, l.h, l.w, l.size, l.stride, l.pad, b); // im2col.c
//im2col_cpu_custom(state.input, l.c, l.h, l.w, l.size, l.stride, l.pad, b); // AVX2
// XNOR-net - bit-1: weights, input, calculation
if (l.xnor && (l.stride == 1 && l.pad == 1)) {
memset(b, 0, l.bit_align*l.size*l.size*l.c * sizeof(float));
//im2col_cpu_custom_align(state.input, l.c, l.h, l.w, l.size, l.stride, l.pad, b, l.bit_align);
im2col_cpu_custom_bin(state.input, l.c, l.h, l.w, l.size, l.stride, l.pad, b, l.bit_align);
int ldb_align = l.lda_align;
size_t new_ldb = k + (ldb_align - k%ldb_align);
char *t_bit_input = NULL;
size_t t_intput_size = binary_transpose_align_input(k, n, b, &t_bit_input, ldb_align, l.bit_align);
// 5x times faster than gemm()-float32
gemm_nn_custom_bin_mean_transposed(m, n, k, 1, l.align_bit_weights, new_ldb, t_bit_input, new_ldb, c, n, l.mean_arr);
//gemm_nn_custom_bin_mean_transposed(m, n, k, 1, bit_weights, k, t_bit_input, new_ldb, c, n, mean_arr);
//free(t_input);
free(t_bit_input);
}
else {
im2col_cpu_custom(state.input, l.c, l.h, l.w, l.size, l.stride, l.pad, b); // AVX2
int t;
#pragma omp parallel for
for (t = 0; t < m; ++t) {
gemm_nn(1, n, k, 1, a + t*k, k, b, n, c + t*n, n);
}
}
c += n*m;
state.input += l.c*l.h*l.w;
}
#endif
int const out_size = out_h*out_w;
// 2. Batch normalization
if (l.batch_normalize) {
for (f = 0; f < l.out_c; ++f) {
for (i = 0; i < out_size; ++i) {
int index = f*out_size + i;
l.output[index] = (l.output[index] - l.rolling_mean[f]) / (sqrtf(l.rolling_variance[f]) + .000001f);
}
}
// scale_bias
for (i = 0; i < l.out_c; ++i) {
for (j = 0; j < out_size; ++j) {
l.output[i*out_size + j] *= l.scales[i];
}
}
}
// 3. Add BIAS
//if (l.batch_normalize)
for (i = 0; i < l.n; ++i) {
for (j = 0; j < out_size; ++j) {
l.output[i*out_size + j] += l.biases[i];
}
}
// 4. Activation function (LEAKY or LINEAR)
//if (l.activation == LEAKY) {
// for (i = 0; i < l.n*out_size; ++i) {
// l.output[i] = leaky_activate(l.output[i]);
// }
//}
activate_array_cpu_custom(l.output, l.n*out_size, l.activation);
}
// MAX pooling layer
void forward_maxpool_layer_cpu(const layer l, network_state state)
{
if (!state.train) {
forward_maxpool_layer_avx(state.input, l.output, l.indexes, l.size, l.w, l.h, l.out_w, l.out_h, l.c, l.pad, l.stride, l.batch);
return;
}
int b, i, j, k, m, n;
int w_offset = -l.pad;
int h_offset = -l.pad;
int h = l.out_h;
int w = l.out_w;
int c = l.c;
// batch index
for (b = 0; b < l.batch; ++b) {
// channel index
for (k = 0; k < c; ++k) {
// y - input
for (i = 0; i < h; ++i) {
// x - input
for (j = 0; j < w; ++j) {
int out_index = j + w*(i + h*(k + c*b));
float max = -FLT_MAX;
int max_i = -1;
// pooling x-index
for (n = 0; n < l.size; ++n) {
// pooling y-index
for (m = 0; m < l.size; ++m) {
int cur_h = h_offset + i*l.stride + n;
int cur_w = w_offset + j*l.stride + m;
int index = cur_w + l.w*(cur_h + l.h*(k + b*l.c));
int valid = (cur_h >= 0 && cur_h < l.h &&
cur_w >= 0 && cur_w < l.w);
float val = (valid != 0) ? state.input[index] : -FLT_MAX;
max_i = (val > max) ? index : max_i; // get max index
max = (val > max) ? val : max; // get max value
}
}
l.output[out_index] = max; // store max value
l.indexes[out_index] = max_i; // store max index
}
}
}
}
}
// Route layer - just copy 1 or more layers into the current layer
void forward_route_layer_cpu(const layer l, network_state state)
{
int i, j;
int offset = 0;
// number of merged layers
for (i = 0; i < l.n; ++i) {
int index = l.input_layers[i]; // source layer index
float *input = state.net.layers[index].output; // source layer output ptr
int input_size = l.input_sizes[i]; // source layer size
// batch index
for (j = 0; j < l.batch; ++j) {
memcpy(l.output + offset + j*l.outputs, input + j*input_size, input_size * sizeof(float));
}
offset += input_size;
}
}
// Reorg layer - just change dimension sizes of the previous layer (some dimension sizes are increased by decreasing other)
void forward_reorg_layer_cpu(const layer l, network_state state)
{
float *out = l.output;
float *x = state.input;
int out_w = l.out_w;
int out_h = l.out_h;
int out_c = l.out_c;
int batch = l.batch;
int stride = l.stride;
int b, i, j, k;
int in_c = out_c / (stride*stride);
//printf("\n out_c = %d, out_w = %d, out_h = %d, stride = %d, forward = %d \n", out_c, out_w, out_h, stride, forward);
//printf(" in_c = %d, in_w = %d, in_h = %d \n", in_c, out_w*stride, out_h*stride);
// batch
for (b = 0; b < batch; ++b) {
// channel
for (k = 0; k < out_c; ++k) {
// y
for (j = 0; j < out_h; ++j) {
// x
for (i = 0; i < out_w; ++i) {
int in_index = i + out_w*(j + out_h*(k + out_c*b));
int c2 = k % in_c;
int offset = k / in_c;
int w2 = i*stride + offset % stride;
int h2 = j*stride + offset / stride;
int out_index = w2 + out_w*stride*(h2 + out_h*stride*(c2 + in_c*b));
out[in_index] = x[out_index];
}
}
}
}
}
// ---- upsample layer ----
// upsample_layer.c
void upsample_cpu(float *in, int w, int h, int c, int batch, int stride, int forward, float scale, float *out)
{
int i, j, k, b;
for (b = 0; b < batch; ++b) {
for (k = 0; k < c; ++k) {
for (j = 0; j < h*stride; ++j) {
for (i = 0; i < w*stride; ++i) {
int in_index = b*w*h*c + k*w*h + (j / stride)*w + i / stride;
int out_index = b*w*h*c*stride*stride + k*w*h*stride*stride + j*w*stride + i;
if (forward) out[out_index] = scale*in[in_index];
else in[in_index] += scale*out[out_index];
}
}
}
}
}
// upsample_layer.c
void forward_upsample_layer_cpu(const layer l, network_state net)
{
fill_cpu(l.outputs*l.batch, 0, l.output, 1);
if (l.reverse) {
upsample_cpu(l.output, l.out_w, l.out_h, l.c, l.batch, l.stride, 0, l.scale, net.input);
}
else {
upsample_cpu(net.input, l.w, l.h, l.c, l.batch, l.stride, 1, l.scale, l.output);
}
}
// blas.c (shortcut_layer)
void shortcut_cpu(int batch, int w1, int h1, int c1, float *add, int w2, int h2, int c2, float *out)
{
int stride = w1 / w2;
int sample = w2 / w1;
assert(stride == h1 / h2);
assert(sample == h2 / h1);
if (stride < 1) stride = 1;
if (sample < 1) sample = 1;
int minw = (w1 < w2) ? w1 : w2;
int minh = (h1 < h2) ? h1 : h2;
int minc = (c1 < c2) ? c1 : c2;
int i, j, k, b;
for (b = 0; b < batch; ++b) {
for (k = 0; k < minc; ++k) {
for (j = 0; j < minh; ++j) {
for (i = 0; i < minw; ++i) {
int out_index = i*sample + w2*(j*sample + h2*(k + c2*b));
int add_index = i*stride + w1*(j*stride + h1*(k + c1*b));
out[out_index] += add[add_index];
}
}
}
}
}
// blas.c
void copy_cpu(int N, float *X, int INCX, float *Y, int INCY)
{
int i;
for (i = 0; i < N; ++i) Y[i*INCY] = X[i*INCX];
}
// shortcut_layer.c
void forward_shortcut_layer_cpu(const layer l, network_state state)
{
copy_cpu(l.outputs*l.batch, state.input, 1, l.output, 1);
shortcut_cpu(l.batch, l.w, l.h, l.c, state.net.layers[l.index].output, l.out_w, l.out_h, l.out_c, l.output);
activate_array(l.output, l.outputs*l.batch, l.activation);
}
// ---- yolo layer ----
void forward_yolo_layer_cpu(const layer l, network_state state)
{
int i, j, b, t, n;
memcpy(l.output, state.input, l.outputs*l.batch * sizeof(float));
#ifndef GPU
for (b = 0; b < l.batch; ++b) {
for (n = 0; n < l.n; ++n) {
int index = entry_index(l, b, n*l.w*l.h, 0);
activate_array(l.output + index, 2 * l.w*l.h, LOGISTIC);
index = entry_index(l, b, n*l.w*l.h, 4);
activate_array(l.output + index, (1 + l.classes)*l.w*l.h, LOGISTIC);
}
}
#endif
//memset(l.delta, 0, l.outputs * l.batch * sizeof(float));
}
// ---- region layer ----
static void softmax_cpu(float *input, int n, float temp, float *output)
{
int i;
float sum = 0;
float largest = -FLT_MAX;
for (i = 0; i < n; ++i) {
if (input[i] > largest) largest = input[i];
}
for (i = 0; i < n; ++i) {
float e = expf(input[i] / temp - largest / temp);
sum += e;
output[i] = e;
}
for (i = 0; i < n; ++i) {
output[i] /= sum;
}
}
static void softmax_tree(float *input, int batch, int inputs, float temp, tree *hierarchy, float *output)
{
int b;
for (b = 0; b < batch; ++b) {
int i;
int count = 0;
for (i = 0; i < hierarchy->groups; ++i) {
int group_size = hierarchy->group_size[i];
softmax_cpu(input + b*inputs + count, group_size, temp, output + b*inputs + count);
count += group_size;
}
}
}
// ---
// Region layer - just change places of array items, then do logistic_activate and softmax
void forward_region_layer_cpu(const layer l, network_state state)
{
int i, b;
int size = l.coords + l.classes + 1; // 4 Coords(x,y,w,h) + Classes + 1 Probability-t0
memcpy(l.output, state.input, l.outputs*l.batch * sizeof(float));
//flatten(l.output, l.w*l.h, size*l.n, l.batch, 1);
// convert many channels to the one channel (depth=1)
// (each grid cell will have a number of float-variables equal = to the initial number of channels)
{
float *x = l.output;
int layer_size = l.w*l.h; // W x H - size of layer
int layers = size*l.n; // number of channels (where l.n = number of anchors)
int batch = l.batch;
float *swap = calloc(layer_size*layers*batch, sizeof(float));
int i, c, b;
// batch index
for (b = 0; b < batch; ++b) {
// channel index
for (c = 0; c < layers; ++c) {
// layer grid index
for (i = 0; i < layer_size; ++i) {
int i1 = b*layers*layer_size + c*layer_size + i;
int i2 = b*layers*layer_size + i*layers + c;
swap[i2] = x[i1];
}
}
}
memcpy(x, swap, layer_size*layers*batch * sizeof(float));
free(swap);
}
// logistic activation only for: t0 (where is t0 = Probability * IoU(box, object))
for (b = 0; b < l.batch; ++b) {
// for each item (x, y, anchor-index)
for (i = 0; i < l.h*l.w*l.n; ++i) {
int index = size*i + b*l.outputs;
float x = l.output[index + 4];
l.output[index + 4] = 1.0F / (1.0F + expf(-x)); // logistic_activate_cpu(l.output[index + 4]);
}
}
if (l.softmax_tree) { // Yolo 9000
for (b = 0; b < l.batch; ++b) {
for (i = 0; i < l.h*l.w*l.n; ++i) {
int index = size*i + b*l.outputs;
softmax_tree(l.output + index + 5, 1, 0, 1, l.softmax_tree, l.output + index + 5);
}
}
}
else if (l.softmax) { // Yolo v2
// softmax activation only for Classes probability
for (b = 0; b < l.batch; ++b) {
// for each item (x, y, anchor-index)
for (i = 0; i < l.h*l.w*l.n; ++i) {
int index = size*i + b*l.outputs;
softmax_cpu(l.output + index + 5, l.classes, 1, l.output + index + 5);
}
}
}
}
void yolov2_forward_network_cpu(network net, network_state state)
{
state.workspace = net.workspace;
int i;
for (i = 0; i < net.n; ++i) {
state.index = i;
layer l = net.layers[i];
if (l.type == CONVOLUTIONAL) {
forward_convolutional_layer_cpu(l, state);
//printf("\n CONVOLUTIONAL \t\t l.size = %d \n", l.size);
}
else if (l.type == MAXPOOL) {
forward_maxpool_layer_cpu(l, state);
//printf("\n MAXPOOL \t\t l.size = %d \n", l.size);
}
else if (l.type == ROUTE) {
forward_route_layer_cpu(l, state);
//printf("\n ROUTE \t\t\t l.n = %d \n", l.n);
}
else if (l.type == REORG) {
forward_reorg_layer_cpu(l, state);
//printf("\n REORG \n");
}
else if (l.type == UPSAMPLE) {
forward_upsample_layer_cpu(l, state);
//printf("\n UPSAMPLE \n");
}
else if (l.type == SHORTCUT) {
forward_shortcut_layer_cpu(l, state);
//printf("\n SHORTCUT \n");
}
else if (l.type == YOLO) {
forward_yolo_layer_cpu(l, state);
//printf("\n YOLO \n");
}
else if (l.type == REGION) {
forward_region_layer_cpu(l, state);
//printf("\n REGION \n");
}
else {
printf("\n layer: %d \n", l.type);
}
state.input = l.output;
}
}
// detect on CPU
float *network_predict_cpu(network net, float *input)
{
network_state state;
state.net = net;
state.index = 0;
state.input = input;
state.truth = 0;
state.train = 0;
state.delta = 0;
yolov2_forward_network_cpu(net, state); // network on CPU
//float *out = get_network_output(net);
int i;
for (i = net.n - 1; i > 0; --i) if (net.layers[i].type != COST) break;
return net.layers[i].output;
}
// --------------------
// x - last conv-layer output
// biases - anchors from cfg-file
// n - number of anchors from cfg-file
box get_region_box_cpu(float *x, float *biases, int n, int index, int i, int j, int w, int h)
{
box b;
b.x = (i + logistic_activate(x[index + 0])) / w; // (col + 1./(1. + exp(-x))) / width_last_layer
b.y = (j + logistic_activate(x[index + 1])) / h; // (row + 1./(1. + exp(-x))) / height_last_layer
b.w = expf(x[index + 2]) * biases[2 * n] / w; // exp(x) * anchor_w / width_last_layer
b.h = expf(x[index + 3]) * biases[2 * n + 1] / h; // exp(x) * anchor_h / height_last_layer
return b;
}
// get prediction boxes
void get_region_boxes_cpu(layer l, int w, int h, float thresh, float **probs, box *boxes, int only_objectness, int *map)
{
int i, j, n;
float *predictions = l.output;
// grid index
for (i = 0; i < l.w*l.h; ++i) {
int row = i / l.w;
int col = i % l.w;
// anchor index
for (n = 0; n < l.n; ++n) {
int index = i*l.n + n; // index for each grid-cell & anchor
int p_index = index * (l.classes + 5) + 4;
float scale = predictions[p_index]; // scale = t0 = Probability * IoU(box, object)
if (l.classfix == -1 && scale < .5) scale = 0; // if(t0 < 0.5) t0 = 0;
int box_index = index * (l.classes + 5);
boxes[index] = get_region_box_cpu(predictions, l.biases, n, box_index, col, row, l.w, l.h);
boxes[index].x *= w;
boxes[index].y *= h;
boxes[index].w *= w;
boxes[index].h *= h;
int class_index = index * (l.classes + 5) + 5;
// Yolo 9000 or Yolo v2
if (l.softmax_tree) {
// Yolo 9000
hierarchy_predictions(predictions + class_index, l.classes, l.softmax_tree, 0);
int found = 0;
if (map) {
for (j = 0; j < 200; ++j) {
float prob = scale*predictions[class_index + map[j]];
probs[index][j] = (prob > thresh) ? prob : 0;
}
}
else {
for (j = l.classes - 1; j >= 0; --j) {
if (!found && predictions[class_index + j] > .5) {
found = 1;
}
else {
predictions[class_index + j] = 0;
}
float prob = predictions[class_index + j];
probs[index][j] = (scale > thresh) ? prob : 0;
}
}
}
else
{
// Yolo v2
for (j = 0; j < l.classes; ++j) {
float prob = scale*predictions[class_index + j]; // prob = IoU(box, object) = t0 * class-probability
probs[index][j] = (prob > thresh) ? prob : 0; // if (IoU < threshold) IoU = 0;
}
}
if (only_objectness) {
probs[index][0] = scale;
}
}
}
}
// ------ Calibration --------
// detect on CPU
float *network_calibrate_cpu(network net, float *input)
{
network_state state;
state.net = net;
state.index = 0;
state.input = input;
state.truth = 0;
state.train = 0;
state.delta = 0;
//yolov2_forward_network_cpu(net, state); // network on CPU
// input calibration - for quantinization
static int max_num = 100;
static int counter = 0;
static float *input_mult_array = NULL;
if (net.do_input_calibration > 0) { // calibration for quantinization
max_num = net.do_input_calibration;
if (input_mult_array == NULL) {
input_mult_array = (float *)calloc(net.n * max_num, sizeof(float));
}
++counter;
// save calibration coefficients
if (counter > max_num) {
printf("\n\n Saving coefficients to the input_calibration.txt file... \n\n");
FILE* fw = fopen("input_calibration.txt", "wb");
char buff[1024];
//printf("\n float input_mult[] = { ");
char *str1 = "input_calibration = ";
printf("%s", str1);
fwrite(str1, sizeof(char), strlen(str1), fw);
int i;
for (i = 0; i < net.n; ++i)
if (net.layers[i].type == CONVOLUTIONAL) {
printf("%g, ", input_mult_array[0 + i*max_num]);
sprintf(buff, "%g, ", input_mult_array[0 + i*max_num]);
fwrite(buff, sizeof(char), strlen(buff), fw);
}
char *str2 = "16";
printf("%s \n ---------------------------", str2);
fwrite(str2, sizeof(char), strlen(str2), fw);
fclose(fw);
getchar();
exit(0);
}
}
state.workspace = net.workspace;
int i;
for (i = 0; i < net.n; ++i) {
state.index = i;
layer l = net.layers[i];
if (l.type == CONVOLUTIONAL) {
if (net.do_input_calibration) { // calibration for quantinization
//float multiplier = entropy_calibration(state.input, l.inputs, 1.0 / 8192, 2048);
float multiplier = entropy_calibration(state.input, l.inputs, 1.0 / 16, 4096);
//float multiplier = entropy_calibration(state.input, l.inputs, 1.0 / 4, 2*4096);
printf(" multiplier = %f, l.inputs = %d \n\n", multiplier, l.inputs);
input_mult_array[counter + i*max_num] = multiplier;
if (counter >= max_num) {
int j;
float res_mult = 0;
for (j = 0; j < max_num; ++j)
res_mult += input_mult_array[j + i*max_num];
res_mult = res_mult / max_num;
input_mult_array[0 + i*max_num] = res_mult;
printf(" res_mult = %f, max_num = %d \n", res_mult, max_num);
}
}
forward_convolutional_layer_cpu(l, state);
//printf("\n CONVOLUTIONAL \t\t l.size = %d \n", l.size);
}
else if (l.type == MAXPOOL) {
forward_maxpool_layer_cpu(l, state);
//printf("\n MAXPOOL \t\t l.size = %d \n", l.size);
}
else if (l.type == ROUTE) {
forward_route_layer_cpu(l, state);
//printf("\n ROUTE \t\t\t l.n = %d \n", l.n);
}
else if (l.type == REORG) {
forward_reorg_layer_cpu(l, state);
//printf("\n REORG \n");
}
else if (l.type == REGION) {
forward_region_layer_cpu(l, state);
//printf("\n REGION \n");
}
else {
printf("\n layer: %d \n", l.type);
}
state.input = l.output;
}
//int i;
for (i = net.n - 1; i > 0; --i) if (net.layers[i].type != COST) break;
return net.layers[i].output;
}
|
9270.c | /* POLYBENCH/GPU-OPENMP
*
* This file is a part of the Polybench/GPU-OpenMP suite
*
* Contact:
* William Killian <killian@udel.edu>
*
* Copyright 2013, The University of Delaware
*/
#include <stdio.h>
#include <unistd.h>
#include <string.h>
#include <math.h>
/* Include polybench common header. */
#include <polybench.h>
/* Include benchmark-specific header. */
/* Default data type is double, default size is 4000. */
#include "3mm.h"
/* Array initialization. */
static
void init_array(int ni, int nj, int nk, int nl, int nm,
DATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),
DATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj),
DATA_TYPE POLYBENCH_2D(C,NJ,NM,nj,nm),
DATA_TYPE POLYBENCH_2D(D,NM,NL,nm,nl))
{
int i, j;
for (i = 0; i < ni; i++)
for (j = 0; j < nk; j++)
A[i][j] = ((DATA_TYPE) i*j) / ni;
for (i = 0; i < nk; i++)
for (j = 0; j < nj; j++)
B[i][j] = ((DATA_TYPE) i*(j+1)) / nj;
for (i = 0; i < nj; i++)
for (j = 0; j < nm; j++)
C[i][j] = ((DATA_TYPE) i*(j+3)) / nl;
for (i = 0; i < nm; i++)
for (j = 0; j < nl; j++)
D[i][j] = ((DATA_TYPE) i*(j+2)) / nk;
}
/* DCE code. Must scan the entire live-out data.
Can be used also to check the correctness of the output. */
static
void print_array(int ni, int nl,
DATA_TYPE POLYBENCH_2D(G,NI,NL,ni,nl))
{
int i, j;
for (i = 0; i < ni; i++)
for (j = 0; j < nl; j++) {
fprintf (stderr, DATA_PRINTF_MODIFIER, G[i][j]);
if ((i * ni + j) % 20 == 0) fprintf (stderr, "\n");
}
fprintf (stderr, "\n");
}
/* Main computational kernel. The whole function will be timed,
including the call and return. */
static
void kernel_3mm(int ni, int nj, int nk, int nl, int nm,
DATA_TYPE POLYBENCH_2D(E,NI,NJ,ni,nj),
DATA_TYPE POLYBENCH_2D(A,NI,NK,ni,nk),
DATA_TYPE POLYBENCH_2D(B,NK,NJ,nk,nj),
DATA_TYPE POLYBENCH_2D(F,NJ,NL,nj,nl),
DATA_TYPE POLYBENCH_2D(C,NJ,NM,nj,nm),
DATA_TYPE POLYBENCH_2D(D,NM,NL,nm,nl),
DATA_TYPE POLYBENCH_2D(G,NI,NL,ni,nl))
{
int i, j, k;
#pragma scop
#pragma omp parallel private (i, j, k) num_threads(#P11)
{
/* E := A*B */
#pragma omp target teams distribute thread_limit(128) schedule(dynamic, 28)
for (i = 0; i < _PB_NI; i++)
{
#pragma omp parallel for schedule(dynamic, 28)
for (j = 0; j < _PB_NJ; j++)
{
E[i][j] = 0;
for (k = 0; k < _PB_NK; ++k)
E[i][j] += A[i][k] * B[k][j];
}
}
/* F := C*D */
#pragma omp target teams distribute thread_limit(128) schedule(dynamic, 28)
for (i = 0; i < _PB_NJ; i++)
{
#pragma omp parallel for schedule(dynamic, 28)
for (j = 0; j < _PB_NL; j++)
{
F[i][j] = 0;
for (k = 0; k < _PB_NM; ++k)
F[i][j] += C[i][k] * D[k][j];
}
}
/* G := E*F */
#pragma omp target teams distribute thread_limit(128) schedule(dynamic, 28)
for (i = 0; i < _PB_NI; i++)
{
#pragma omp parallel for schedule(dynamic, 28)
for (j = 0; j < _PB_NL; j++)
{
G[i][j] = 0;
for (k = 0; k < _PB_NJ; ++k)
G[i][j] += E[i][k] * F[k][j];
}
}
}
#pragma endscop
}
int main(int argc, char** argv)
{
/* Retrieve problem size. */
int ni = NI;
int nj = NJ;
int nk = NK;
int nl = NL;
int nm = NM;
/* Variable declaration/allocation. */
POLYBENCH_2D_ARRAY_DECL(E, DATA_TYPE, NI, NJ, ni, nj);
POLYBENCH_2D_ARRAY_DECL(A, DATA_TYPE, NI, NK, ni, nk);
POLYBENCH_2D_ARRAY_DECL(B, DATA_TYPE, NK, NJ, nk, nj);
POLYBENCH_2D_ARRAY_DECL(F, DATA_TYPE, NJ, NL, nj, nl);
POLYBENCH_2D_ARRAY_DECL(C, DATA_TYPE, NJ, NM, nj, nm);
POLYBENCH_2D_ARRAY_DECL(D, DATA_TYPE, NM, NL, nm, nl);
POLYBENCH_2D_ARRAY_DECL(G, DATA_TYPE, NI, NL, ni, nl);
/* Initialize array(s). */
init_array (ni, nj, nk, nl, nm,
POLYBENCH_ARRAY(A),
POLYBENCH_ARRAY(B),
POLYBENCH_ARRAY(C),
POLYBENCH_ARRAY(D));
/* Start timer. */
polybench_start_instruments;
/* Run kernel. */
kernel_3mm (ni, nj, nk, nl, nm,
POLYBENCH_ARRAY(E),
POLYBENCH_ARRAY(A),
POLYBENCH_ARRAY(B),
POLYBENCH_ARRAY(F),
POLYBENCH_ARRAY(C),
POLYBENCH_ARRAY(D),
POLYBENCH_ARRAY(G));
/* Stop and print timer. */
polybench_stop_instruments;
polybench_print_instruments;
/* Prevent dead-code elimination. All live-out data must be printed
by the function call in argument. */
polybench_prevent_dce(print_array(ni, nl, POLYBENCH_ARRAY(G)));
/* Be clean. */
POLYBENCH_FREE_ARRAY(E);
POLYBENCH_FREE_ARRAY(A);
POLYBENCH_FREE_ARRAY(B);
POLYBENCH_FREE_ARRAY(F);
POLYBENCH_FREE_ARRAY(C);
POLYBENCH_FREE_ARRAY(D);
POLYBENCH_FREE_ARRAY(G);
return 0;
}
|
GB_unop__log1p_fc32_fc32.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://suitesparse.com See GraphBLAS/Doc/License.txt for license.
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_unop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB_unop_apply__log1p_fc32_fc32
// op(A') function: GB_unop_tran__log1p_fc32_fc32
// C type: GxB_FC32_t
// A type: GxB_FC32_t
// cast: GxB_FC32_t cij = aij
// unaryop: cij = GB_clog1pf (aij)
#define GB_ATYPE \
GxB_FC32_t
#define GB_CTYPE \
GxB_FC32_t
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
GxB_FC32_t aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = GB_clog1pf (x) ;
// casting
#define GB_CAST(z, aij) \
GxB_FC32_t z = aij ;
// cij = op (aij)
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
GxB_FC32_t aij = Ax [pA] ; \
/* Cx [pC] = op (cast (aij)) */ \
GxB_FC32_t z = aij ; \
Cx [pC] = GB_clog1pf (z) ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_LOG1P || GxB_NO_FC32)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_unop_apply__log1p_fc32_fc32
(
GxB_FC32_t *Cx, // Cx and Ax may be aliased
const GxB_FC32_t *Ax,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
GxB_FC32_t aij = Ax [p] ;
GxB_FC32_t z = aij ;
Cx [p] = GB_clog1pf (z) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_unop_tran__log1p_fc32_fc32
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *GB_RESTRICT *Rowcounts,
GBI_single_iterator Iter,
const int64_t *GB_RESTRICT A_slice,
int naslice
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#define GB_PHASE_2_OF_2
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
csr_assign.c | #include <stdio.h>
#include <stdlib.h>
#include "csr_assign.h"
#include "csr_math.h"
#include "../../vector/common/common_vector_math.h"
#include "../../vector/sparse/sparse_vector_math.h"
struct assign_result assign(struct csr_matrix* samples
, struct csr_matrix* clusters
, uint32_t* stop) {
struct assign_result res;
uint64_t sample_id;
VALUE_TYPE *vector_lengths_clusters; /* ||c|| for every c in clusters */
/* calculate ||c|| for every c in clusters */
calculate_matrix_vector_lengths(clusters, &vector_lengths_clusters);
res.assignments = (uint64_t*) calloc(samples->sample_count, sizeof(uint64_t));
res.distances = (VALUE_TYPE*) calloc(samples->sample_count, sizeof(VALUE_TYPE));
res.counts = (uint64_t*) calloc(clusters->sample_count, sizeof(uint64_t));
res.len_counts = clusters->sample_count;
res.len_assignments = samples->sample_count;
#pragma omp parallel for
for (sample_id = 0; sample_id < samples->sample_count; sample_id++) {
res.distances[sample_id] = VALUE_TYPE_MAX;
if (omp_get_thread_num() == 0) {
check_signals(stop);
}
if (!(*stop)) {
/* assign every sample to its closest cluster center */
/* assign samples to cluster centers with given vector lengths */
assign_vector(samples->keys + samples->pointers[sample_id]
, samples->values + samples->pointers[sample_id]
, samples->pointers[sample_id + 1] - samples->pointers[sample_id]
, clusters
, vector_lengths_clusters
, res.assignments + sample_id
, res.distances + sample_id);
/* increment the count of the closest cluster */
#pragma omp critical
{
res.counts[res.assignments[sample_id]] += 1;
}
}
}
free_null(vector_lengths_clusters);
return res;
}
void assign_vector(KEY_TYPE *input_keys
, VALUE_TYPE *input_values
, uint64_t input_non_zero_count_vector
, struct csr_matrix* clusters
, VALUE_TYPE *vector_lengths_clusters
, uint64_t* closest_cluster
, VALUE_TYPE* closest_cluster_distance) {
uint64_t cluster_id;
VALUE_TYPE input_vector_length;
input_vector_length = calculate_squared_vector_length(input_values
, input_non_zero_count_vector);
*closest_cluster_distance = DBL_MAX;
for (cluster_id = 0; cluster_id < clusters->sample_count; cluster_id++) {
VALUE_TYPE dist;
dist = euclid_vector(input_keys, input_values, input_non_zero_count_vector
, clusters->keys + clusters->pointers[cluster_id]
, clusters->values + clusters->pointers[cluster_id]
, clusters->pointers[cluster_id + 1] - clusters->pointers[cluster_id]
, input_vector_length
, vector_lengths_clusters[cluster_id]);
if (dist < *closest_cluster_distance) {
*closest_cluster = cluster_id;
*closest_cluster_distance = dist;
}
}
}
void free_assign_result(struct assign_result* res) {
free_null(res->assignments);
free_null(res->distances);
free_null(res->counts);
}
uint32_t store_assign_result(struct assign_result *res, char* output_path) {
uint64_t i;
FILE* file;
file = fopen(output_path, "w");
if (!file) {
return 1;
}
for (i = 0; i < res->len_assignments; i++) {
fprintf(file, "%" PRINTF_INT64_MODIFIER "u,%.18f", res->assignments[i], res->distances[i]);
fprintf(file, "\n");
}
fclose(file);
return 0;
}
|
pzfft1d.c | /* -*- mode: C; tab-width: 2; indent-tabs-mode: nil; fill-column: 79; coding: iso-latin-1-unix -*- */
/*
C
C FFTE: A FAST FOURIER TRANSFORM PACKAGE
C
C (C) COPYRIGHT SOFTWARE, 2000-2004, ALL RIGHTS RESERVED
C BY
C DAISUKE TAKAHASHI
C GRADUATE SCHOOL OF SYSTEMS AND INFORMATION ENGINEERING
C UNIVERSITY OF TSUKUBA
C 1-1-1 TENNODAI, TSUKUBA, IBARAKI 305-8573, JAPAN
C E-MAIL: daisuke@cs.tsukuba.ac.jp
C
C
C PARALLEL 1-D COMPLEX FFT ROUTINE
C
C FORTRAN77 + MPI SOURCE PROGRAM
C
C CALL PZFFT1D(A,B,W,N,ICOMM,ME,NPU,IOPT)
C
C W((N/NPU)*3/2) IS SINE/COSINE TABLE (COMPLEX*16)
C N IS THE LENGTH OF THE TRANSFORMS (INTEGER*8)
C -----------------------------------
C N = (2**IP) * (3**IQ) * (5**IR)
C -----------------------------------
C ICOMM IS THE COMMUNICATOR (INTEGER*4)
C ME IS THE RANK (INTEGER*4)
C NPU IS THE NUMBER OF PROCESSORS (INTEGER*4)
C IOPT = 0 FOR INITIALIZING THE COEFFICIENTS (INTEGER*4)
C IOPT = -1 FOR FORWARD TRANSFORM WHERE
C A(N/NPU) IS COMPLEX INPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE A(BLOCK)
C B(N/NPU) IS COMPLEX OUTPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE B(BLOCK)
C IOPT = +1 FOR INVERSE TRANSFORM WHERE
C A(N/NPU) IS COMPLEX INPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE A(BLOCK)
C B(N/NPU) IS COMPLEX OUTPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE B(BLOCK)
C IOPT = -2 FOR FORWARD TRANSFORM WHERE
C A(N/NPU) IS COMPLEX INPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE A(BLOCK)
C B(N/NPU) IS COMPLEX OUTPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE B(CYCLIC)
C IOPT = +2 FOR INVERSE TRANSFORM WHERE
C A(N/NPU) IS COMPLEX INPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE A(CYCLIC)
C B(N/NPU) IS COMPLEX OUTPUT VECTOR (COMPLEX*16)
C!HPF$ DISTRIBUTE B(BLOCK)
C
C WRITTEN BY DAISUKE TAKAHASHI
C
*/
#include "hpccfft.h"
#include "wrapmpifftw.h"
static void
ztrans(fftw_complex *a, fftw_complex *b, int n1, int n2) {
int ii, jj, i, j;
int tmin1, tmin2;
int lda, ldb;
lda = n1;
ldb = n2;
#ifdef _OPENMP
#pragma omp parallel for private(i,j,jj,tmin1,tmin2)
#endif
for (ii = 0; ii < n1; ii += FFTE_NBLK)
for (jj = 0; jj < n2; jj += FFTE_NBLK) {
V3MIN( tmin1, ii + FFTE_NBLK, n1 );
for (i = ii; i < tmin1; ++i) {
V3MIN( tmin2, jj + FFTE_NBLK, n2 );
for (j = jj; j < tmin2; ++j) {
c_assgn( ARR2D( b, j, i, ldb ), ARR2D( a, i, j, lda ) );
}
}
}
} /* ztrans */
static void
pztrans(fftw_complex *a, fftw_complex *b, s64Int_t nn, hpcc_fftw_mpi_plan p, int npu) {
int i, nn2;
nn2 = nn / npu;
if (1 == npu)
for (i = 0; i < nn2; ++i) {
c_assgn( b[i], a[i] );
}
else
MPI_Alltoall( a, nn2, p->cmplx, b, nn2, p->cmplx, p->comm );
} /* pztrans */
static void
pzfft1d0(fftw_complex *a, fftw_complex *a2, fftw_complex *apxyz, fftw_complex *axyzp, fftw_complex *b,
fftw_complex *bxyzp, fftw_complex *bzyx, fftw_complex *cy, fftw_complex *cz, fftw_complex *d,
fftw_complex *wx, fftw_complex *wy, fftw_complex *wz, fftw_complex *ww, fftw_complex *www,
int nx, int ny, int nz, hpcc_fftw_mpi_plan p, int npu, const int *lnx, const int *lny, const int *lnz) {
int i, j, k, l, ii, jj, kk;
int tmin1, tmin2, tmin3;
int nnx, nnz;
s64Int_t nn;
int ldcz, lda2_1, lda2_2, ldaxyzp1, ldaxyzp2, ldaxyzp3, ldbxyzp1, ldbxyzp2, ldbxyzp3, ldww, ldcy;
int ldwww1, ldwww2, ldwww3, ldapxyz1, ldapxyz2, ldapxyz3, ldbzyx1, ldbzyx2, lda1, lda2;
fftw_complex ztmp1, ztmp2, ztmp3;
ldcz = nz + FFTE_NP;
lda2_1 = nx / npu;
lda2_2 = ny;
ldaxyzp1 = nx / npu;
ldaxyzp2 = ny;
ldaxyzp3 = nz / npu;
ldbxyzp1 = nx / npu;
ldbxyzp2 = ny;
ldbxyzp3 = nz / npu;
ldww = ny;
ldcy = ny + FFTE_NP;
ldwww1 = npu;
ldwww2 = nx / npu;
ldwww3 = ny;
ldapxyz1 = npu;
ldapxyz2 = nx / npu;
ldapxyz3 = ny;
ldbzyx1 = nz / npu;
ldbzyx2 = ny;
lda1 = nx;
lda2 = ny;
nnx = nx / npu;
nnz = nz / npu;
nn = (s64Int_t)nx * ny * nz / npu;
#ifdef _OPENMP
#pragma omp for private(i,k,l,ii,kk,tmin1,tmin2)
#endif
for (j = 0; j < ny; ++j) {
for (ii = 0; ii < nnx; ii += FFTE_NBLK) {
for (kk = 0; kk < nz; kk += FFTE_NBLK) {
V3MIN( tmin1, ii + FFTE_NBLK, nnx );
for (i = ii; i < tmin1; ++i) {
V3MIN( tmin2, kk + FFTE_NBLK, nz );
for (k = kk; k < tmin2; ++k) {
c_assgn( ARR2D( cz, k, i-ii, ldcz ), ARR3D( a2, i, j, k, lda2_1, lda2_2 ) );
}
}
}
V3MIN( tmin2, ii + FFTE_NBLK, nnx );
for (i = ii; i < tmin2; ++i)
HPCC_fft235( PTR2D( cz, 0, i-ii, ldcz ), d, wz, nz, lnz );
for (l = 0; l < npu; ++l) {
for (k = 0; k < nnz; ++k) {
/* reusing tmin2 from above */
for (i = ii; i < tmin2; ++i) {
c_assgn( ARR4D( axyzp, i, j, k, l, ldaxyzp1, ldaxyzp2, ldaxyzp3 ),
ARR2D( cz, l + k*npu, i-ii, ldcz ) );
}
}
}
}
}
#ifdef _OPENMP
#pragma omp single
{
#endif
p->timings[3] = MPI_Wtime();
pztrans( a, b, nn, p, npu );
p->timings[4] = MPI_Wtime();
#ifdef _OPENMP
}
#endif
#ifdef _OPENMP
#pragma omp for private(i,j,l,ii,jj,kk,tmin1,tmin2)
#endif
for (k = 0; k < nnz; ++k) {
for (l = 0; l < npu; ++l) {
for (ii = 0; ii < nnx; ii += FFTE_NBLK) {
for (jj = 0; jj < ny; jj += FFTE_NBLK) {
V3MIN( tmin1, ii + FFTE_NBLK, nnx );
for (i = ii; i < tmin1; ++i) {
V3MIN( tmin2, jj + FFTE_NBLK, ny );
for (j = jj; j < tmin2; ++j) {
c_assgn( ztmp1, ARR4D( bxyzp, i, j, k, l, ldbxyzp1, ldbxyzp2, ldbxyzp3 ) );
c_assgn( ztmp2, ARR2D( ww, j, k, ldww ) );
c_mul3v(ztmp3, ztmp1, ztmp2);
c_assgn( ARR2D( cy, j, i-ii, ldcy ), ztmp3 );
}
}
}
V3MIN( tmin1, ii + FFTE_NBLK, nnx );
for (i = ii; i < tmin1; ++i)
HPCC_fft235( PTR2D( cy, 0, i-ii, ldcy ), d, wy, ny, lny );
for (j = 0; j < ny; ++j) {
V3MIN( tmin1, ii + FFTE_NBLK, nnx );
for (i = ii; i < tmin1; ++i) {
c_assgn( ztmp1, ARR2D( cy, j, i-ii, ldcy ) );
c_assgn( ztmp2, ARR4D( www, l, i, j, k, ldwww1, ldwww2, ldwww3 ) );
c_mul3v(ztmp3, ztmp1, ztmp2);
c_assgn( ARR4D( apxyz, l, i, j, k, ldapxyz1, ldapxyz2, ldapxyz3 ), ztmp3 );
}
}
}
}
for (j = 0; j < ny; ++j)
HPCC_fft235( PTR3D( a, 0, j, k, lda1, lda2 ), d, wx, nx, lnx );
}
#ifdef _OPENMP
#pragma omp for private(i,j,k,jj,kk,tmin1,tmin2,tmin3)
#endif
for (ii = 0; ii < nx; ii += FFTE_NBLK) {
for (jj = 0; jj < ny; jj += FFTE_NBLK) {
for (kk = 0; kk < nnz; kk += FFTE_NBLK) {
V3MIN( tmin1, ii + FFTE_NBLK, nx );
for (i = ii; i < tmin1; ++i) {
V3MIN( tmin2, jj + FFTE_NBLK, ny );
for (j = jj; j < tmin2; ++j) {
V3MIN( tmin3, kk + FFTE_NBLK, nnz );
for (k = kk; k < tmin3; ++k) {
c_assgn( ARR3D( bzyx, k, j, i, ldbzyx1, ldbzyx2 ), ARR3D( a, i, j, k, lda1, lda2 ) );
}
}
}
}
}
}
} /* pzfft1d0 */
static void
psettbl2(fftw_complex *w, int ny, int nz, int me, int npu) {
int j, k;
int ldw;
double pi2, px;
int tmin1;
ldw = ny;
pi2 = 8.0 * atan(1.0);
px = -pi2 / ((double)ny * nz);
tmin1 = nz / npu;
#ifdef _OPENMP
#pragma omp parallel for private(j)
#endif
for (k = 0; k < tmin1; ++k)
for (j = 0; j < ny; ++j) {
c_re( ARR2D( w, j, k, ldw ) ) = cos(px * j * (me + (double)k * npu));
c_im( ARR2D( w, j, k, ldw ) ) = sin(px * j * (me + (double)k * npu));
}
} /* psettbl2 */
static void
psettbl3(fftw_complex *w, int nx, int ny, int nz, int me, int npu) {
int i, j, k;
int ldw1, ldw2;
int tmin1;
double pi2, px;
ldw1 = nx;
ldw2 = ny;
pi2 = 8.0 * atan(1.0);
px = -pi2 / ((double)nx * ny * nz);
tmin1 = nz / npu;
#ifdef _OPENMP
#pragma omp parallel for private(i,j)
#endif
for (k = 0; k < tmin1; ++k)
for (j = 0; j < ny; ++j)
for (i = 0; i < nx; ++i) {
c_re( ARR3D( w, i, j, k, ldw1, ldw2 ) ) = cos( px * i * (me + (double)k * npu + (double)j * nz));
c_im( ARR3D( w, i, j, k, ldw1, ldw2 ) ) = sin( px * i * (me + (double)k * npu + (double)j * nz));
}
} /* psettbl3 */
int
HPCC_pzfft1d(s64Int_t n, fftw_complex *a, fftw_complex *b, fftw_complex *w, int me, int npu, int iopt,
hpcc_fftw_mpi_plan p) {
int ip[3], lnx[3], lny[3], lnz[3], lnpu[3];
s64Int_t nn;
int i, inn, nn2, nd, nx, ny, nz;
fftw_complex *wx, *wy, *wz, *c;
double dn;
p->timings[0] = MPI_Wtime();
wx = p->wx;
wy = p->wy;
wz = p->wz;
c = p->c;
nn = n / npu; inn = (int)nn;
nn2 = nn / npu;
HPCC_factor235( npu, lnpu );
HPCC_factor235_8( n, ip );
for (i = 0; i < 3; ++i) {
EMAX( lnz[i], lnpu[i], (ip[i]+1)/3 );
EMAX( lnx[i], lnpu[i], (ip[i]-lnz[i]+1)/2 );
lny[i] = ip[i] - lnx[i] - lnz[i];
}
nx = HPCC_ipow( 2, lnx[0] ) * HPCC_ipow( 3, lnx[1] ) * HPCC_ipow( 5, lnx[2] );
ny = HPCC_ipow( 2, lny[0] ) * HPCC_ipow( 3, lny[1] ) * HPCC_ipow( 5, lny[2] );
nz = HPCC_ipow( 2, lnz[0] ) * HPCC_ipow( 3, lnz[1] ) * HPCC_ipow( 5, lnz[2] );
if (0 == iopt) {
HPCC_settbl( wx, nx );
HPCC_settbl( wy, ny );
HPCC_settbl( wz, nz );
psettbl2( w, ny, nz, me, npu );
psettbl3( w + ny * (nz / npu), nx, ny, nz, me, npu );
return 0;
}
if (1 == iopt || 2 == iopt) {
for (i = 0; i < inn; ++i) {
c_im( a[i] ) = -c_im( a[i] );
}
}
p->timings[1] = MPI_Wtime();
if (-1 == iopt || 1 == iopt || -2 == iopt) {
ztrans( a, b, npu, nn2 );
pztrans( b, a, nn, p, npu );
}
p->timings[2] = MPI_Wtime();
nd = ((ny > nz ? ny : nz) + FFTE_NP) * FFTE_NBLK + FFTE_NP;
#ifdef _OPENMP
#pragma omp parallel private(c,i)
{
i = omp_get_thread_num();
c = p->c + i*p->c_size;
#endif
pzfft1d0( a, a, a, a, b, b, b, c, c, c + nd, wx, wy, wz, w, w + ny*(nz/npu), nx, ny, nz, p, npu, lnx, lny, lnz );
#ifdef _OPENMP
}
#endif
p->timings[5] = MPI_Wtime();
if (-1 == iopt || 1 == iopt || 2 == iopt) {
pztrans( b, a, nn, p, npu );
ztrans( a, b, nn2, npu );
}
p->timings[6] = MPI_Wtime();
if (1 == iopt || 2 == iopt) {
dn = 1.0 / n;
for (i = 0; i < inn; ++i) {
c_re( b[i] ) *= dn;
c_im( b[i] ) *= -dn;
}
}
p->timings[7] = MPI_Wtime();
return 0;
} /* HPCC_pzfft1d */
|
GB_binop__le_uint32.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__le_uint32)
// A.*B function (eWiseMult): GB (_AemultB_08__le_uint32)
// A.*B function (eWiseMult): GB (_AemultB_02__le_uint32)
// A.*B function (eWiseMult): GB (_AemultB_04__le_uint32)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__le_uint32)
// A*D function (colscale): GB (_AxD__le_uint32)
// D*A function (rowscale): GB (_DxB__le_uint32)
// C+=B function (dense accum): GB (_Cdense_accumB__le_uint32)
// C+=b function (dense accum): GB (_Cdense_accumb__le_uint32)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__le_uint32)
// C=scalar+B GB (_bind1st__le_uint32)
// C=scalar+B' GB (_bind1st_tran__le_uint32)
// C=A+scalar GB (_bind2nd__le_uint32)
// C=A'+scalar GB (_bind2nd_tran__le_uint32)
// C type: bool
// A type: uint32_t
// A pattern? 0
// B type: uint32_t
// B pattern? 0
// BinaryOp: cij = (aij <= bij)
#define GB_ATYPE \
uint32_t
#define GB_BTYPE \
uint32_t
#define GB_CTYPE \
bool
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
0
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
0
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
uint32_t aij = GBX (Ax, pA, A_iso)
// true if values of A are not used
#define GB_A_IS_PATTERN \
0 \
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
uint32_t bij = GBX (Bx, pB, B_iso)
// true if values of B are not used
#define GB_B_IS_PATTERN \
0 \
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
bool t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = (x <= y) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
0
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_LE || GxB_NO_UINT32 || GxB_NO_LE_UINT32)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
void GB (_Cdense_ewise3_noaccum__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_noaccum_template.c"
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if 0
{
#include "GB_dense_subassign_23_template.c"
}
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__le_uint32)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if 0
{
// get the scalar b for C += b, of type uint32_t
uint32_t bwork = (*((uint32_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_AxD__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix D,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
bool *restrict Cx = (bool *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_DxB__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix D,
const GrB_Matrix B,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
bool *restrict Cx = (bool *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__le_uint32)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool is_eWiseUnion,
const GB_void *alpha_scalar_in,
const GB_void *beta_scalar_in,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
uint32_t alpha_scalar ;
uint32_t beta_scalar ;
if (is_eWiseUnion)
{
alpha_scalar = (*((uint32_t *) alpha_scalar_in)) ;
beta_scalar = (*((uint32_t *) beta_scalar_in )) ;
}
#include "GB_add_template.c"
GB_FREE_WORKSPACE ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__le_uint32)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__le_uint32)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__le_uint32)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
bool *Cx = (bool *) Cx_output ;
uint32_t x = (*((uint32_t *) x_input)) ;
uint32_t *Bx = (uint32_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
uint32_t bij = GBX (Bx, p, false) ;
Cx [p] = (x <= bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__le_uint32)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
bool *Cx = (bool *) Cx_output ;
uint32_t *Ax = (uint32_t *) Ax_input ;
uint32_t y = (*((uint32_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
uint32_t aij = GBX (Ax, p, false) ;
Cx [p] = (aij <= y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = (x <= aij) ; \
}
GrB_Info GB (_bind1st_tran__le_uint32)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t x = (*((const uint32_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = (aij <= y) ; \
}
GrB_Info GB (_bind2nd_tran__le_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t y = (*((const uint32_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
mm_acc.c | #include "timer.h"
double matrixMultiplication(int matrix_size, int nthreads){
srand(time(NULL));
double *A;//[matrix_size][matrix_size];
double *B;//[matrix_size][matrix_size];
double *C;//[matrix_size][matrix_size];
//clock_t start_t, end_t;
//double total_t;
int tid, nthread, i, j, k;
// allocate the memory
A = (double **)malloc(sizeof(double *)*matrix_size*matrix_size);
B = (double **)malloc(sizeof(double *)*matrix_size*matrix_size);
C = (double **)malloc(sizeof(double *)*matrix_size*matrix_size);
//initialization
for (i = 0; i < matrix_size; ++i){
for (j = 0; j < matrix_size; ++j){
A[i*matrix_size + j] = (rand()%100)/100.0;
B[i*matrix_size + j] = (rand()%100)/100.0;
C[i*matrix_size + j] = 0.0;
}
}
StartTimer();
omp_set_dynamic(0);
omp_set_num_threads(nthreads);
#pragma omp parallel shared(A, B, C, nthread) private(tid, i, j, k)
//#pragma acc kernel compyin(A, B) copy(C)
#pragma acc parallel loop copyin(A[0:matrix_size*matrix_size], B[0:matrix_size*matrix_size]) copyout(C[0:matrix_size*matrix_size])
for (i = 0; i < matrix_size; ++i)
{
#pragma omp for schedule(static)
#pragma acc loop
for (j = 0; j < matrix_size; ++j)
{
double sum = 0;
for (k = 0; k < matrix_size; ++k)
{
sum += A[i*matrix_size + k]*B[k*matrix_size+j];
}
C[i*matrix_size + j] = sum;
}
}
double runtime = GetTimer();
printf(" total: %f s\n", runtime / 1000);
free(A);
free(B);
free(C);
return runtime;
}
int main(int argc, char *argv[]){
int matrix_size = 100;
if (argc > 1)
{
matrix_size = atoi(argv[1]);
printf("Set matrix size to %d\n", matrix_size);
}else{
printf("Input argument is wrong, pls follow the arguments like: matrix_size block_size, \n");
}
int nthreads = 1;
if (argc > 2)
{
nthreads = atoi(argv[2]);
if (nthreads < 0)
{
printf("Set the number of threads is wrong\n");
return -1;
}
printf("Set the number of threads is %d\n", nthreads);
}
float real_time, proc_time, mflops;
long long flpins;
int retval;
printf("\n------------------------------------------------\n");
printf("Start Matrix Multiplication\n");
double total_t = matrixMultiplication(matrix_size, nthreads);
printf("Total time for Matrix Mulitiplication with matrix_size: %d, -threads: %d, -no blocking taken by CPU: %f\n", matrix_size, nthreads, total_t);
return 0;
}
|
fourier.c | /*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% FFFFF OOO U U RRRR IIIII EEEEE RRRR %
% F O O U U R R I E R R %
% FFF O O U U RRRR I EEE RRRR %
% F O O U U R R I E R R %
% F OOO UUU R R IIIII EEEEE R R %
% %
% %
% MagickCore Discrete Fourier Transform Methods %
% %
% Software Design %
% Sean Burke %
% Fred Weinhaus %
% Cristy %
% July 2009 %
% %
% %
% Copyright 1999-2014 ImageMagick Studio LLC, a non-profit organization %
% dedicated to making software imaging solutions freely available. %
% %
% You may not use this file except in compliance with the License. You may %
% obtain a copy of the License at %
% %
% http://www.imagemagick.org/script/license.php %
% %
% Unless required by applicable law or agreed to in writing, software %
% distributed under the License is distributed on an "AS IS" BASIS, %
% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. %
% See the License for the specific language governing permissions and %
% limitations under the License. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
%
%
*/
/*
Include declarations.
*/
#include "MagickCore/studio.h"
#include "MagickCore/artifact.h"
#include "MagickCore/attribute.h"
#include "MagickCore/blob.h"
#include "MagickCore/cache.h"
#include "MagickCore/image.h"
#include "MagickCore/image-private.h"
#include "MagickCore/list.h"
#include "MagickCore/fourier.h"
#include "MagickCore/log.h"
#include "MagickCore/memory_.h"
#include "MagickCore/monitor.h"
#include "MagickCore/monitor-private.h"
#include "MagickCore/pixel-accessor.h"
#include "MagickCore/pixel-private.h"
#include "MagickCore/property.h"
#include "MagickCore/quantum-private.h"
#include "MagickCore/resource_.h"
#include "MagickCore/string-private.h"
#include "MagickCore/thread-private.h"
#if defined(MAGICKCORE_FFTW_DELEGATE)
#if defined(MAGICKCORE_HAVE_COMPLEX_H)
#include <complex.h>
#endif
#include <fftw3.h>
#if !defined(MAGICKCORE_HAVE_CABS)
#define cabs(z) (sqrt(z[0]*z[0]+z[1]*z[1]))
#endif
#if !defined(MAGICKCORE_HAVE_CARG)
#define carg(z) (atan2(cimag(z),creal(z)))
#endif
#if !defined(MAGICKCORE_HAVE_CIMAG)
#define cimag(z) (z[1])
#endif
#if !defined(MAGICKCORE_HAVE_CREAL)
#define creal(z) (z[0])
#endif
#endif
/*
Typedef declarations.
*/
typedef struct _FourierInfo
{
PixelChannel
channel;
MagickBooleanType
modulus;
size_t
width,
height;
ssize_t
center;
} FourierInfo;
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% C o m p l e x I m a g e s %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ComplexImages() performs complex mathematics on an image sequence.
%
% The format of the ComplexImages method is:
%
% MagickBooleanType ComplexImages(Image *images,
% const ComplexOperator op,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o op: A complex op.
%
% o exception: return any errors or warnings in this structure.
%
*/
MagickExport Image *ComplexImages(const Image *images,const ComplexOperator op,
ExceptionInfo *exception)
{
#define ComplexImageTag "Complex/Image"
CacheView
*Ai_view,
*Ar_view,
*Bi_view,
*Br_view,
*Ci_view,
*Cr_view;
const char
*artifact;
const Image
*Ai_image,
*Ar_image,
*Bi_image,
*Br_image;
double
snr;
Image
*Ci_image,
*complex_images,
*Cr_image,
*image;
MagickBooleanType
status;
MagickOffsetType
progress;
ssize_t
y;
assert(images != (Image *) NULL);
assert(images->signature == MagickSignature);
if (images->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",images->filename);
assert(exception != (ExceptionInfo *) NULL);
assert(exception->signature == MagickSignature);
if (images->next == (Image *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),ImageError,
"ImageSequenceRequired","`%s'",images->filename);
return((Image *) NULL);
}
image=CloneImage(images,images->columns,images->rows,MagickTrue,exception);
if (image == (Image *) NULL)
return((Image *) NULL);
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
{
image=DestroyImageList(image);
return(image);
}
complex_images=NewImageList();
AppendImageToList(&complex_images,image);
image=CloneImage(images,images->columns,images->rows,MagickTrue,exception);
if (image == (Image *) NULL)
{
complex_images=DestroyImageList(complex_images);
return(complex_images);
}
if (SetImageStorageClass(image,DirectClass,exception) == MagickFalse)
{
complex_images=DestroyImageList(complex_images);
return(complex_images);
}
AppendImageToList(&complex_images,image);
/*
Apply complex mathematics to image pixels.
*/
artifact=GetImageArtifact(image,"complex:snr");
snr=0.0;
if (artifact != (const char *) NULL)
snr=StringToDouble(artifact,(char **) NULL);
Ar_image=images;
Ai_image=images->next;
Br_image=images;
Bi_image=images->next;
if ((images->next->next != (Image *) NULL) &&
(images->next->next->next != (Image *) NULL))
{
Br_image=images->next->next;
Bi_image=images->next->next->next;
}
Cr_image=complex_images;
Ci_image=complex_images->next;
Ar_view=AcquireVirtualCacheView(Ar_image,exception);
Ai_view=AcquireVirtualCacheView(Ai_image,exception);
Br_view=AcquireVirtualCacheView(Br_image,exception);
Bi_view=AcquireVirtualCacheView(Bi_image,exception);
Cr_view=AcquireAuthenticCacheView(Cr_image,exception);
Ci_view=AcquireAuthenticCacheView(Ci_image,exception);
status=MagickTrue;
progress=0;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel for schedule(static,4) shared(progress,status) \
magick_threads(images,complex_images,images->rows,1L)
#endif
for (y=0; y < (ssize_t) images->rows; y++)
{
register const Quantum
*restrict Ai,
*restrict Ar,
*restrict Bi,
*restrict Br;
register Quantum
*restrict Ci,
*restrict Cr;
register ssize_t
x;
if (status == MagickFalse)
continue;
Ar=GetCacheViewVirtualPixels(Ar_view,0,y,images->columns,1,exception);
Ai=GetCacheViewVirtualPixels(Ai_view,0,y,images->columns,1,exception);
Br=GetCacheViewVirtualPixels(Br_view,0,y,images->columns,1,exception);
Bi=GetCacheViewVirtualPixels(Bi_view,0,y,images->columns,1,exception);
Cr=QueueCacheViewAuthenticPixels(Cr_view,0,y,images->columns,1,exception);
Ci=QueueCacheViewAuthenticPixels(Ci_view,0,y,images->columns,1,exception);
if ((Ar == (const Quantum *) NULL) || (Ai == (const Quantum *) NULL) ||
(Br == (const Quantum *) NULL) || (Bi == (const Quantum *) NULL) ||
(Cr == (Quantum *) NULL) || (Ci == (Quantum *) NULL))
{
status=MagickFalse;
continue;
}
for (x=0; x < (ssize_t) images->columns; x++)
{
register ssize_t
i;
for (i=0; i < (ssize_t) GetPixelChannels(images); i++)
{
switch (op)
{
case AddComplexOperator:
{
Cr[i]=Ar[i]+Br[i];
Ci[i]=Ai[i]+Bi[i];
break;
}
case ConjugateComplexOperator:
default:
{
Cr[i]=Ar[i];
Ci[i]=(-Bi[i]);
break;
}
case DivideComplexOperator:
{
double
gamma;
gamma=PerceptibleReciprocal(Br[i]*Br[i]+Bi[i]*Bi[i]+snr);
Cr[i]=gamma*(Ar[i]*Br[i]+Ai[i]*Bi[i]);
Ci[i]=gamma*(Ai[i]*Br[i]-Ar[i]*Bi[i]);
break;
}
case MagnitudePhaseComplexOperator:
{
Cr[i]=sqrt(Ar[i]*Ar[i]+Ai[i]*Ai[i]);
Ci[i]=atan2(Ai[i],Ar[i])/(2.0*MagickPI)+0.5;
break;
}
case MultiplyComplexOperator:
{
Cr[i]=QuantumScale*(Ar[i]*Br[i]-Ai[i]*Bi[i]);
Ci[i]=QuantumScale*(Ai[i]*Br[i]+Ar[i]*Bi[i]);
break;
}
case RealImaginaryComplexOperator:
{
Cr[i]=Ar[i]*cos(2.0*MagickPI*(Ai[i]-0.5));
Ci[i]=Ar[i]*sin(2.0*MagickPI*(Ai[i]-0.5));
break;
}
case SubtractComplexOperator:
{
Cr[i]=Ar[i]-Br[i];
Ci[i]=Ai[i]-Bi[i];
break;
}
}
Ar+=GetPixelChannels(Ar_image);
Ai+=GetPixelChannels(Ai_image);
Br+=GetPixelChannels(Br_image);
Bi+=GetPixelChannels(Bi_image);
Cr+=GetPixelChannels(Cr_image);
Ci+=GetPixelChannels(Ci_image);
}
}
if (SyncCacheViewAuthenticPixels(Ci_view,exception) == MagickFalse)
status=MagickFalse;
if (SyncCacheViewAuthenticPixels(Cr_view,exception) == MagickFalse)
status=MagickFalse;
if (images->progress_monitor != (MagickProgressMonitor) NULL)
{
MagickBooleanType
proceed;
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ComplexImages)
#endif
proceed=SetImageProgress(images,ComplexImageTag,progress++,
images->rows);
if (proceed == MagickFalse)
status=MagickFalse;
}
}
Cr_view=DestroyCacheView(Cr_view);
Ci_view=DestroyCacheView(Ci_view);
Br_view=DestroyCacheView(Br_view);
Bi_view=DestroyCacheView(Bi_view);
Ar_view=DestroyCacheView(Ar_view);
Ai_view=DestroyCacheView(Ai_view);
if (status == MagickFalse)
complex_images=DestroyImageList(complex_images);
return(complex_images);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% F o r w a r d F o u r i e r T r a n s f o r m I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% ForwardFourierTransformImage() implements the discrete Fourier transform
% (DFT) of the image either as a magnitude / phase or real / imaginary image
% pair.
%
% The format of the ForwadFourierTransformImage method is:
%
% Image *ForwardFourierTransformImage(const Image *image,
% const MagickBooleanType modulus,ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o image: the image.
%
% o modulus: if true, return as transform as a magnitude / phase pair
% otherwise a real / imaginary image pair.
%
% o exception: return any errors or warnings in this structure.
%
*/
#if defined(MAGICKCORE_FFTW_DELEGATE)
static MagickBooleanType RollFourier(const size_t width,const size_t height,
const ssize_t x_offset,const ssize_t y_offset,double *roll_pixels)
{
double
*source_pixels;
MemoryInfo
*source_info;
register ssize_t
i,
x;
ssize_t
u,
v,
y;
/*
Move zero frequency (DC, average color) from (0,0) to (width/2,height/2).
*/
source_info=AcquireVirtualMemory(height,width*sizeof(*source_pixels));
if (source_info == (MemoryInfo *) NULL)
return(MagickFalse);
source_pixels=(double *) GetVirtualMemoryBlob(source_info);
i=0L;
for (y=0L; y < (ssize_t) height; y++)
{
if (y_offset < 0L)
v=((y+y_offset) < 0L) ? y+y_offset+(ssize_t) height : y+y_offset;
else
v=((y+y_offset) > ((ssize_t) height-1L)) ? y+y_offset-(ssize_t) height :
y+y_offset;
for (x=0L; x < (ssize_t) width; x++)
{
if (x_offset < 0L)
u=((x+x_offset) < 0L) ? x+x_offset+(ssize_t) width : x+x_offset;
else
u=((x+x_offset) > ((ssize_t) width-1L)) ? x+x_offset-(ssize_t) width :
x+x_offset;
source_pixels[v*width+u]=roll_pixels[i++];
}
}
(void) CopyMagickMemory(roll_pixels,source_pixels,height*width*
sizeof(*source_pixels));
source_info=RelinquishVirtualMemory(source_info);
return(MagickTrue);
}
static MagickBooleanType ForwardQuadrantSwap(const size_t width,
const size_t height,double *source_pixels,double *forward_pixels)
{
MagickBooleanType
status;
register ssize_t
x;
ssize_t
center,
y;
/*
Swap quadrants.
*/
center=(ssize_t) floor((double) width/2L)+1L;
status=RollFourier((size_t) center,height,0L,(ssize_t) height/2L,
source_pixels);
if (status == MagickFalse)
return(MagickFalse);
for (y=0L; y < (ssize_t) height; y++)
for (x=0L; x < (ssize_t) (width/2L-1L); x++)
forward_pixels[y*width+x+width/2L]=source_pixels[y*center+x];
for (y=1; y < (ssize_t) height; y++)
for (x=0L; x < (ssize_t) (width/2L-1L); x++)
forward_pixels[(height-y)*width+width/2L-x-1L]=
source_pixels[y*center+x+1L];
for (x=0L; x < (ssize_t) (width/2L); x++)
forward_pixels[-x+width/2L-1L]=forward_pixels[x+width/2L+1L];
return(MagickTrue);
}
static void CorrectPhaseLHS(const size_t width,const size_t height,
double *fourier_pixels)
{
register ssize_t
x;
ssize_t
y;
for (y=0L; y < (ssize_t) height; y++)
for (x=0L; x < (ssize_t) (width/2L); x++)
fourier_pixels[y*width+x]*=(-1.0);
}
static MagickBooleanType ForwardFourier(const FourierInfo *fourier_info,
Image *image,double *magnitude,double *phase,ExceptionInfo *exception)
{
CacheView
*magnitude_view,
*phase_view;
double
*magnitude_pixels,
*phase_pixels;
Image
*magnitude_image,
*phase_image;
MagickBooleanType
status;
MemoryInfo
*magnitude_info,
*phase_info;
register Quantum
*q;
register ssize_t
x;
ssize_t
i,
y;
magnitude_image=GetFirstImageInList(image);
phase_image=GetNextImageInList(image);
if (phase_image == (Image *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),ImageError,
"TwoOrMoreImagesRequired","`%s'",image->filename);
return(MagickFalse);
}
/*
Create "Fourier Transform" image from constituent arrays.
*/
magnitude_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->width*sizeof(*magnitude_pixels));
phase_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->width*sizeof(*phase_pixels));
if ((magnitude_info == (MemoryInfo *) NULL) ||
(phase_info == (MemoryInfo *) NULL))
{
if (phase_info != (MemoryInfo *) NULL)
phase_info=RelinquishVirtualMemory(phase_info);
if (magnitude_info != (MemoryInfo *) NULL)
magnitude_info=RelinquishVirtualMemory(magnitude_info);
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",image->filename);
return(MagickFalse);
}
magnitude_pixels=(double *) GetVirtualMemoryBlob(magnitude_info);
(void) ResetMagickMemory(magnitude_pixels,0,fourier_info->height*
fourier_info->width*sizeof(*magnitude_pixels));
phase_pixels=(double *) GetVirtualMemoryBlob(phase_info);
(void) ResetMagickMemory(phase_pixels,0,fourier_info->height*
fourier_info->width*sizeof(*phase_pixels));
status=ForwardQuadrantSwap(fourier_info->width,fourier_info->height,
magnitude,magnitude_pixels);
if (status != MagickFalse)
status=ForwardQuadrantSwap(fourier_info->width,fourier_info->height,phase,
phase_pixels);
CorrectPhaseLHS(fourier_info->width,fourier_info->height,phase_pixels);
if (fourier_info->modulus != MagickFalse)
{
i=0L;
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
phase_pixels[i]/=(2.0*MagickPI);
phase_pixels[i]+=0.5;
i++;
}
}
magnitude_view=AcquireAuthenticCacheView(magnitude_image,exception);
i=0L;
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
q=GetCacheViewAuthenticPixels(magnitude_view,0L,y,fourier_info->height,1UL,
exception);
if (q == (Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
SetPixelRed(magnitude_image,ClampToQuantum(QuantumRange*
magnitude_pixels[i]),q);
break;
}
case GreenPixelChannel:
{
SetPixelGreen(magnitude_image,ClampToQuantum(QuantumRange*
magnitude_pixels[i]),q);
break;
}
case BluePixelChannel:
{
SetPixelBlue(magnitude_image,ClampToQuantum(QuantumRange*
magnitude_pixels[i]),q);
break;
}
case BlackPixelChannel:
{
SetPixelBlack(magnitude_image,ClampToQuantum(QuantumRange*
magnitude_pixels[i]),q);
break;
}
case AlphaPixelChannel:
{
SetPixelAlpha(magnitude_image,ClampToQuantum(QuantumRange*
magnitude_pixels[i]),q);
break;
}
}
i++;
q+=GetPixelChannels(magnitude_image);
}
status=SyncCacheViewAuthenticPixels(magnitude_view,exception);
if (status == MagickFalse)
break;
}
magnitude_view=DestroyCacheView(magnitude_view);
i=0L;
phase_view=AcquireAuthenticCacheView(phase_image,exception);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
q=GetCacheViewAuthenticPixels(phase_view,0L,y,fourier_info->height,1UL,
exception);
if (q == (Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
SetPixelRed(phase_image,ClampToQuantum(QuantumRange*
phase_pixels[i]),q);
break;
}
case GreenPixelChannel:
{
SetPixelGreen(phase_image,ClampToQuantum(QuantumRange*
phase_pixels[i]),q);
break;
}
case BluePixelChannel:
{
SetPixelBlue(phase_image,ClampToQuantum(QuantumRange*
phase_pixels[i]),q);
break;
}
case BlackPixelChannel:
{
SetPixelBlack(phase_image,ClampToQuantum(QuantumRange*
phase_pixels[i]),q);
break;
}
case AlphaPixelChannel:
{
SetPixelAlpha(phase_image,ClampToQuantum(QuantumRange*
phase_pixels[i]),q);
break;
}
}
i++;
q+=GetPixelChannels(phase_image);
}
status=SyncCacheViewAuthenticPixels(phase_view,exception);
if (status == MagickFalse)
break;
}
phase_view=DestroyCacheView(phase_view);
phase_info=RelinquishVirtualMemory(phase_info);
magnitude_info=RelinquishVirtualMemory(magnitude_info);
return(status);
}
static MagickBooleanType ForwardFourierTransform(FourierInfo *fourier_info,
const Image *image,double *magnitude_pixels,double *phase_pixels,
ExceptionInfo *exception)
{
CacheView
*image_view;
const char
*value;
double
*source_pixels;
fftw_complex
*forward_pixels;
fftw_plan
fftw_r2c_plan;
MemoryInfo
*forward_info,
*source_info;
register const Quantum
*p;
register ssize_t
i,
x;
ssize_t
y;
/*
Generate the forward Fourier transform.
*/
source_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->width*sizeof(*source_pixels));
if (source_info == (MemoryInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",image->filename);
return(MagickFalse);
}
source_pixels=(double *) GetVirtualMemoryBlob(source_info);
ResetMagickMemory(source_pixels,0,fourier_info->height*fourier_info->width*
sizeof(*source_pixels));
i=0L;
image_view=AcquireVirtualCacheView(image,exception);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
p=GetCacheViewVirtualPixels(image_view,0L,y,fourier_info->width,1UL,
exception);
if (p == (const Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
source_pixels[i]=QuantumScale*GetPixelRed(image,p);
break;
}
case GreenPixelChannel:
{
source_pixels[i]=QuantumScale*GetPixelGreen(image,p);
break;
}
case BluePixelChannel:
{
source_pixels[i]=QuantumScale*GetPixelBlue(image,p);
break;
}
case BlackPixelChannel:
{
source_pixels[i]=QuantumScale*GetPixelBlack(image,p);
break;
}
case AlphaPixelChannel:
{
source_pixels[i]=QuantumScale*GetPixelAlpha(image,p);
break;
}
}
i++;
p+=GetPixelChannels(image);
}
}
image_view=DestroyCacheView(image_view);
forward_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->center*sizeof(*forward_pixels));
if (forward_info == (MemoryInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",image->filename);
source_info=(MemoryInfo *) RelinquishVirtualMemory(source_info);
return(MagickFalse);
}
forward_pixels=(fftw_complex *) GetVirtualMemoryBlob(forward_info);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_ForwardFourierTransform)
#endif
fftw_r2c_plan=fftw_plan_dft_r2c_2d(fourier_info->width,fourier_info->height,
source_pixels,forward_pixels,FFTW_ESTIMATE);
fftw_execute(fftw_r2c_plan);
fftw_destroy_plan(fftw_r2c_plan);
source_info=(MemoryInfo *) RelinquishVirtualMemory(source_info);
value=GetImageArtifact(image,"fourier:normalize");
if ((value == (const char *) NULL) || (LocaleCompare(value,"forward") == 0))
{
double
gamma;
/*
Normalize Fourier transform.
*/
i=0L;
gamma=PerceptibleReciprocal((double) fourier_info->width*
fourier_info->height);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
#if defined(MAGICKCORE_HAVE_COMPLEX_H)
forward_pixels[i]*=gamma;
#else
forward_pixels[i][0]*=gamma;
forward_pixels[i][1]*=gamma;
#endif
i++;
}
}
/*
Generate magnitude and phase (or real and imaginary).
*/
i=0L;
if (fourier_info->modulus != MagickFalse)
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
magnitude_pixels[i]=cabs(forward_pixels[i]);
phase_pixels[i]=carg(forward_pixels[i]);
i++;
}
else
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
magnitude_pixels[i]=creal(forward_pixels[i]);
phase_pixels[i]=cimag(forward_pixels[i]);
i++;
}
forward_info=(MemoryInfo *) RelinquishVirtualMemory(forward_info);
return(MagickTrue);
}
static MagickBooleanType ForwardFourierTransformChannel(const Image *image,
const PixelChannel channel,const MagickBooleanType modulus,
Image *fourier_image,ExceptionInfo *exception)
{
double
*magnitude_pixels,
*phase_pixels;
FourierInfo
fourier_info;
MagickBooleanType
status;
MemoryInfo
*magnitude_info,
*phase_info;
size_t
extent;
fourier_info.width=image->columns;
fourier_info.height=image->rows;
if ((image->columns != image->rows) || ((image->columns % 2) != 0) ||
((image->rows % 2) != 0))
{
extent=image->columns < image->rows ? image->rows : image->columns;
fourier_info.width=(extent & 0x01) == 1 ? extent+1UL : extent;
}
fourier_info.height=fourier_info.width;
fourier_info.center=(ssize_t) floor((double) fourier_info.width/2L)+1L;
fourier_info.channel=channel;
fourier_info.modulus=modulus;
magnitude_info=AcquireVirtualMemory((size_t) fourier_info.height,
fourier_info.center*sizeof(*magnitude_pixels));
phase_info=AcquireVirtualMemory((size_t) fourier_info.height,
fourier_info.center*sizeof(*phase_pixels));
if ((magnitude_info == (MemoryInfo *) NULL) ||
(phase_info == (MemoryInfo *) NULL))
{
if (phase_info != (MemoryInfo *) NULL)
phase_info=RelinquishVirtualMemory(phase_info);
if (magnitude_info == (MemoryInfo *) NULL)
magnitude_info=RelinquishVirtualMemory(magnitude_info);
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",image->filename);
return(MagickFalse);
}
magnitude_pixels=(double *) GetVirtualMemoryBlob(magnitude_info);
phase_pixels=(double *) GetVirtualMemoryBlob(phase_info);
status=ForwardFourierTransform(&fourier_info,image,magnitude_pixels,
phase_pixels,exception);
if (status != MagickFalse)
status=ForwardFourier(&fourier_info,fourier_image,magnitude_pixels,
phase_pixels,exception);
phase_info=RelinquishVirtualMemory(phase_info);
magnitude_info=RelinquishVirtualMemory(magnitude_info);
return(status);
}
#endif
MagickExport Image *ForwardFourierTransformImage(const Image *image,
const MagickBooleanType modulus,ExceptionInfo *exception)
{
Image
*fourier_image;
fourier_image=NewImageList();
#if !defined(MAGICKCORE_FFTW_DELEGATE)
(void) modulus;
(void) ThrowMagickException(exception,GetMagickModule(),
MissingDelegateWarning,"DelegateLibrarySupportNotBuiltIn","'%s' (FFTW)",
image->filename);
#else
{
Image
*magnitude_image;
size_t
extent,
height,
width;
width=image->columns;
height=image->rows;
if ((image->columns != image->rows) || ((image->columns % 2) != 0) ||
((image->rows % 2) != 0))
{
extent=image->columns < image->rows ? image->rows : image->columns;
width=(extent & 0x01) == 1 ? extent+1UL : extent;
}
height=width;
magnitude_image=CloneImage(image,width,height,MagickTrue,exception);
if (magnitude_image != (Image *) NULL)
{
Image
*phase_image;
magnitude_image->storage_class=DirectClass;
magnitude_image->depth=32UL;
phase_image=CloneImage(image,width,height,MagickTrue,exception);
if (phase_image == (Image *) NULL)
magnitude_image=DestroyImage(magnitude_image);
else
{
MagickBooleanType
is_gray,
status;
phase_image->storage_class=DirectClass;
phase_image->depth=32UL;
AppendImageToList(&fourier_image,magnitude_image);
AppendImageToList(&fourier_image,phase_image);
status=MagickTrue;
is_gray=IsImageGray(image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel sections
#endif
{
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
if (is_gray != MagickFalse)
thread_status=ForwardFourierTransformChannel(image,
GrayPixelChannel,modulus,fourier_image,exception);
else
thread_status=ForwardFourierTransformChannel(image,
RedPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (is_gray == MagickFalse)
thread_status=ForwardFourierTransformChannel(image,
GreenPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (is_gray == MagickFalse)
thread_status=ForwardFourierTransformChannel(image,
BluePixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (image->colorspace == CMYKColorspace)
thread_status=ForwardFourierTransformChannel(image,
BlackPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (image->alpha_trait == BlendPixelTrait)
thread_status=ForwardFourierTransformChannel(image,
AlphaPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
}
if (status == MagickFalse)
fourier_image=DestroyImageList(fourier_image);
fftw_cleanup();
}
}
}
#endif
return(fourier_image);
}
/*
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %
% %
% %
% I n v e r s e F o u r i e r T r a n s f o r m I m a g e %
% %
% %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%
% InverseFourierTransformImage() implements the inverse discrete Fourier
% transform (DFT) of the image either as a magnitude / phase or real /
% imaginary image pair.
%
% The format of the InverseFourierTransformImage method is:
%
% Image *InverseFourierTransformImage(const Image *magnitude_image,
% const Image *phase_image,const MagickBooleanType modulus,
% ExceptionInfo *exception)
%
% A description of each parameter follows:
%
% o magnitude_image: the magnitude or real image.
%
% o phase_image: the phase or imaginary image.
%
% o modulus: if true, return transform as a magnitude / phase pair
% otherwise a real / imaginary image pair.
%
% o exception: return any errors or warnings in this structure.
%
*/
#if defined(MAGICKCORE_FFTW_DELEGATE)
static MagickBooleanType InverseQuadrantSwap(const size_t width,
const size_t height,const double *source,double *destination)
{
register ssize_t
x;
ssize_t
center,
y;
/*
Swap quadrants.
*/
center=(ssize_t) floor((double) width/2L)+1L;
for (y=1L; y < (ssize_t) height; y++)
for (x=0L; x < (ssize_t) (width/2L+1L); x++)
destination[(height-y)*center-x+width/2L]=source[y*width+x];
for (y=0L; y < (ssize_t) height; y++)
destination[y*center]=source[y*width+width/2L];
for (x=0L; x < center; x++)
destination[x]=source[center-x-1L];
return(RollFourier(center,height,0L,(ssize_t) height/-2L,destination));
}
static MagickBooleanType InverseFourier(FourierInfo *fourier_info,
const Image *magnitude_image,const Image *phase_image,
fftw_complex *fourier_pixels,ExceptionInfo *exception)
{
CacheView
*magnitude_view,
*phase_view;
double
*inverse_pixels,
*magnitude_pixels,
*phase_pixels;
MagickBooleanType
status;
MemoryInfo
*inverse_info,
*magnitude_info,
*phase_info;
register const Quantum
*p;
register ssize_t
i,
x;
ssize_t
y;
/*
Inverse fourier - read image and break down into a double array.
*/
magnitude_info=AcquireVirtualMemory((size_t)fourier_info->height,
fourier_info->width*sizeof(*magnitude_pixels));
phase_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->width*sizeof(*phase_pixels));
inverse_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->center*sizeof(*inverse_pixels));
if ((magnitude_info == (MemoryInfo *) NULL) ||
(phase_info == (MemoryInfo *) NULL) ||
(inverse_info == (MemoryInfo *) NULL))
{
if (magnitude_info != (MemoryInfo *) NULL)
magnitude_info=RelinquishVirtualMemory(magnitude_info);
if (phase_info != (MemoryInfo *) NULL)
phase_info=RelinquishVirtualMemory(phase_info);
if (inverse_info != (MemoryInfo *) NULL)
inverse_info=RelinquishVirtualMemory(inverse_info);
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",
magnitude_image->filename);
return(MagickFalse);
}
magnitude_pixels=(double *) GetVirtualMemoryBlob(magnitude_info);
phase_pixels=(double *) GetVirtualMemoryBlob(phase_info);
inverse_pixels=(double *) GetVirtualMemoryBlob(inverse_info);
i=0L;
magnitude_view=AcquireVirtualCacheView(magnitude_image,exception);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
p=GetCacheViewVirtualPixels(magnitude_view,0L,y,fourier_info->width,1UL,
exception);
if (p == (const Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
magnitude_pixels[i]=QuantumScale*GetPixelRed(magnitude_image,p);
break;
}
case GreenPixelChannel:
{
magnitude_pixels[i]=QuantumScale*GetPixelGreen(magnitude_image,p);
break;
}
case BluePixelChannel:
{
magnitude_pixels[i]=QuantumScale*GetPixelBlue(magnitude_image,p);
break;
}
case BlackPixelChannel:
{
magnitude_pixels[i]=QuantumScale*GetPixelBlack(magnitude_image,p);
break;
}
case AlphaPixelChannel:
{
magnitude_pixels[i]=QuantumScale*GetPixelAlpha(magnitude_image,p);
break;
}
}
i++;
p+=GetPixelChannels(magnitude_image);
}
}
magnitude_view=DestroyCacheView(magnitude_view);
status=InverseQuadrantSwap(fourier_info->width,fourier_info->height,
magnitude_pixels,inverse_pixels);
(void) CopyMagickMemory(magnitude_pixels,inverse_pixels,fourier_info->height*
fourier_info->center*sizeof(*magnitude_pixels));
i=0L;
phase_view=AcquireVirtualCacheView(phase_image,exception);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
p=GetCacheViewVirtualPixels(phase_view,0,y,fourier_info->width,1,
exception);
if (p == (const Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
phase_pixels[i]=QuantumScale*GetPixelRed(phase_image,p);
break;
}
case GreenPixelChannel:
{
phase_pixels[i]=QuantumScale*GetPixelGreen(phase_image,p);
break;
}
case BluePixelChannel:
{
phase_pixels[i]=QuantumScale*GetPixelBlue(phase_image,p);
break;
}
case BlackPixelChannel:
{
phase_pixels[i]=QuantumScale*GetPixelBlack(phase_image,p);
break;
}
case AlphaPixelChannel:
{
phase_pixels[i]=QuantumScale*GetPixelAlpha(phase_image,p);
break;
}
}
i++;
p+=GetPixelChannels(phase_image);
}
}
if (fourier_info->modulus != MagickFalse)
{
i=0L;
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
phase_pixels[i]-=0.5;
phase_pixels[i]*=(2.0*MagickPI);
i++;
}
}
phase_view=DestroyCacheView(phase_view);
CorrectPhaseLHS(fourier_info->width,fourier_info->height,phase_pixels);
if (status != MagickFalse)
status=InverseQuadrantSwap(fourier_info->width,fourier_info->height,
phase_pixels,inverse_pixels);
(void) CopyMagickMemory(phase_pixels,inverse_pixels,fourier_info->height*
fourier_info->center*sizeof(*phase_pixels));
inverse_info=RelinquishVirtualMemory(inverse_info);
/*
Merge two sets.
*/
i=0L;
if (fourier_info->modulus != MagickFalse)
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
#if defined(MAGICKCORE_HAVE_COMPLEX_H)
fourier_pixels[i]=magnitude_pixels[i]*cos(phase_pixels[i])+I*
magnitude_pixels[i]*sin(phase_pixels[i]);
#else
fourier_pixels[i][0]=magnitude_pixels[i]*cos(phase_pixels[i]);
fourier_pixels[i][1]=magnitude_pixels[i]*sin(phase_pixels[i]);
#endif
i++;
}
else
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
#if defined(MAGICKCORE_HAVE_COMPLEX_H)
fourier_pixels[i]=magnitude_pixels[i]+I*phase_pixels[i];
#else
fourier_pixels[i][0]=magnitude_pixels[i];
fourier_pixels[i][1]=phase_pixels[i];
#endif
i++;
}
magnitude_info=RelinquishVirtualMemory(magnitude_info);
phase_info=RelinquishVirtualMemory(phase_info);
return(status);
}
static MagickBooleanType InverseFourierTransform(FourierInfo *fourier_info,
fftw_complex *fourier_pixels,Image *image,ExceptionInfo *exception)
{
CacheView
*image_view;
const char
*value;
double
*source_pixels;
fftw_plan
fftw_c2r_plan;
MemoryInfo
*source_info;
register Quantum
*q;
register ssize_t
i,
x;
ssize_t
y;
source_info=AcquireVirtualMemory((size_t) fourier_info->height,
fourier_info->width*sizeof(*source_pixels));
if (source_info == (MemoryInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",image->filename);
return(MagickFalse);
}
source_pixels=(double *) GetVirtualMemoryBlob(source_info);
value=GetImageArtifact(image,"fourier:normalize");
if (LocaleCompare(value,"inverse") == 0)
{
double
gamma;
/*
Normalize inverse transform.
*/
i=0L;
gamma=PerceptibleReciprocal((double) fourier_info->width*
fourier_info->height);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
for (x=0L; x < (ssize_t) fourier_info->center; x++)
{
#if defined(MAGICKCORE_HAVE_COMPLEX_H)
fourier_pixels[i]*=gamma;
#else
fourier_pixels[i][0]*=gamma;
fourier_pixels[i][1]*=gamma;
#endif
i++;
}
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp critical (MagickCore_InverseFourierTransform)
#endif
{
fftw_c2r_plan=fftw_plan_dft_c2r_2d(fourier_info->width,fourier_info->height,
fourier_pixels,source_pixels,FFTW_ESTIMATE);
fftw_execute(fftw_c2r_plan);
fftw_destroy_plan(fftw_c2r_plan);
}
i=0L;
image_view=AcquireAuthenticCacheView(image,exception);
for (y=0L; y < (ssize_t) fourier_info->height; y++)
{
if (y >= (ssize_t) image->rows)
break;
q=GetCacheViewAuthenticPixels(image_view,0L,y,fourier_info->width >
image->columns ? image->columns : fourier_info->width,1UL,exception);
if (q == (Quantum *) NULL)
break;
for (x=0L; x < (ssize_t) fourier_info->width; x++)
{
if (x < (ssize_t) image->columns)
switch (fourier_info->channel)
{
case RedPixelChannel:
default:
{
SetPixelRed(image,ClampToQuantum(QuantumRange*source_pixels[i]),q);
break;
}
case GreenPixelChannel:
{
SetPixelGreen(image,ClampToQuantum(QuantumRange*source_pixels[i]),
q);
break;
}
case BluePixelChannel:
{
SetPixelBlue(image,ClampToQuantum(QuantumRange*source_pixels[i]),
q);
break;
}
case BlackPixelChannel:
{
SetPixelBlack(image,ClampToQuantum(QuantumRange*source_pixels[i]),
q);
break;
}
case AlphaPixelChannel:
{
SetPixelAlpha(image,ClampToQuantum(QuantumRange*source_pixels[i]),
q);
break;
}
}
i++;
q+=GetPixelChannels(image);
}
if (SyncCacheViewAuthenticPixels(image_view,exception) == MagickFalse)
break;
}
image_view=DestroyCacheView(image_view);
source_info=RelinquishVirtualMemory(source_info);
return(MagickTrue);
}
static MagickBooleanType InverseFourierTransformChannel(
const Image *magnitude_image,const Image *phase_image,
const PixelChannel channel,const MagickBooleanType modulus,
Image *fourier_image,ExceptionInfo *exception)
{
fftw_complex
*inverse_pixels;
FourierInfo
fourier_info;
MagickBooleanType
status;
MemoryInfo
*inverse_info;
size_t
extent;
fourier_info.width=magnitude_image->columns;
fourier_info.height=magnitude_image->rows;
if ((magnitude_image->columns != magnitude_image->rows) ||
((magnitude_image->columns % 2) != 0) ||
((magnitude_image->rows % 2) != 0))
{
extent=magnitude_image->columns < magnitude_image->rows ?
magnitude_image->rows : magnitude_image->columns;
fourier_info.width=(extent & 0x01) == 1 ? extent+1UL : extent;
}
fourier_info.height=fourier_info.width;
fourier_info.center=(ssize_t) floor((double) fourier_info.width/2L)+1L;
fourier_info.channel=channel;
fourier_info.modulus=modulus;
inverse_info=AcquireVirtualMemory((size_t) fourier_info.height,
fourier_info.center*sizeof(*inverse_pixels));
if (inverse_info == (MemoryInfo *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),
ResourceLimitError,"MemoryAllocationFailed","`%s'",
magnitude_image->filename);
return(MagickFalse);
}
inverse_pixels=(fftw_complex *) GetVirtualMemoryBlob(inverse_info);
status=InverseFourier(&fourier_info,magnitude_image,phase_image,
inverse_pixels,exception);
if (status != MagickFalse)
status=InverseFourierTransform(&fourier_info,inverse_pixels,fourier_image,
exception);
inverse_info=RelinquishVirtualMemory(inverse_info);
return(status);
}
#endif
MagickExport Image *InverseFourierTransformImage(const Image *magnitude_image,
const Image *phase_image,const MagickBooleanType modulus,
ExceptionInfo *exception)
{
Image
*fourier_image;
assert(magnitude_image != (Image *) NULL);
assert(magnitude_image->signature == MagickSignature);
if (magnitude_image->debug != MagickFalse)
(void) LogMagickEvent(TraceEvent,GetMagickModule(),"%s",
magnitude_image->filename);
if (phase_image == (Image *) NULL)
{
(void) ThrowMagickException(exception,GetMagickModule(),ImageError,
"TwoOrMoreImagesRequired","`%s'",magnitude_image->filename);
return((Image *) NULL);
}
#if !defined(MAGICKCORE_FFTW_DELEGATE)
fourier_image=(Image *) NULL;
(void) modulus;
(void) ThrowMagickException(exception,GetMagickModule(),
MissingDelegateWarning,"DelegateLibrarySupportNotBuiltIn","'%s' (FFTW)",
magnitude_image->filename);
#else
{
fourier_image=CloneImage(magnitude_image,magnitude_image->columns,
magnitude_image->rows,MagickTrue,exception);
if (fourier_image != (Image *) NULL)
{
MagickBooleanType
is_gray,
status;
status=MagickTrue;
is_gray=IsImageGray(magnitude_image,exception);
if (is_gray != MagickFalse)
is_gray=IsImageGray(phase_image,exception);
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp parallel sections
#endif
{
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
if (is_gray != MagickFalse)
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,GrayPixelChannel,modulus,fourier_image,exception);
else
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,RedPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (is_gray == MagickFalse)
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,GreenPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (is_gray == MagickFalse)
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,BluePixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (magnitude_image->colorspace == CMYKColorspace)
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,BlackPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
#if defined(MAGICKCORE_OPENMP_SUPPORT)
#pragma omp section
#endif
{
MagickBooleanType
thread_status;
thread_status=MagickTrue;
if (magnitude_image->alpha_trait == BlendPixelTrait)
thread_status=InverseFourierTransformChannel(magnitude_image,
phase_image,AlphaPixelChannel,modulus,fourier_image,exception);
if (thread_status == MagickFalse)
status=thread_status;
}
}
if (status == MagickFalse)
fourier_image=DestroyImage(fourier_image);
}
fftw_cleanup();
}
#endif
return(fourier_image);
}
|
groupnorm_tpp.h | /******************************************************************************
* Copyright (c) Intel Corporation - All rights reserved. *
* This file is part of the LIBXSMM library. *
* *
* For information on the license, see the LICENSE file. *
* Further information: https://github.com/hfp/libxsmm/ *
* SPDX-License-Identifier: BSD-3-Clause *
******************************************************************************/
/* Kirill Voronin (Intel Corp.)
******************************************************************************/
#include <libxsmm.h>
#include <libxsmm_sync.h>
#include <libxsmm_intrinsics_x86.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include <math.h>
#if defined(_OPENMP)
# include <omp.h>
#endif
#define BITS_PER_CHAR (8)
typedef enum my_gn_fuse {
MY_GN_FUSE_NONE = 0,
MY_GN_FUSE_RELU = 1,
MY_GN_FUSE_ELTWISE = 2,
MY_GN_FUSE_ELTWISE_RELU = 3,
MY_GN_FUSE_RELU_WITH_MASK = 4,
MY_GN_FUSE_ELTWISE_RELU_WITH_MASK = 5
} my_gn_fuse;
typedef struct my_gn_fwd_config {
libxsmm_blasint N;
libxsmm_blasint C;
libxsmm_blasint G;
libxsmm_blasint H;
libxsmm_blasint W;
libxsmm_blasint bc;
libxsmm_blasint CP;
libxsmm_blasint num_HW_blocks;
libxsmm_blasint threads;
size_t scratch_size;
libxsmm_barrier* barrier;
libxsmm_matrix_eqn_function func10;
libxsmm_meltwfunction_unary reduce_HW_kernel;
libxsmm_meltwfunction_unary reduce_rows_kernel;
libxsmm_meltwfunction_unary reduce_groups_kernel;
libxsmm_meltwfunction_unary all_zero_G_kernel;
libxsmm_meltwfunction_unary all_zero_kernel;
libxsmm_meltwfunction_binary add_kernel;
libxsmm_meltwfunction_unary relu_kernel;
libxsmm_meltwfunction_binary ewise_add_kernel;
my_gn_fuse fuse_type;
} my_gn_fwd_config;
typedef struct my_gn_bwd_config {
libxsmm_blasint N;
libxsmm_blasint C;
libxsmm_blasint G;
libxsmm_blasint H;
libxsmm_blasint W;
libxsmm_blasint bc;
libxsmm_blasint CP;
libxsmm_blasint num_HW_blocks;
libxsmm_blasint threads;
size_t scratch_size;
libxsmm_barrier* barrier;
libxsmm_matrix_eqn_function dgamma_func;
libxsmm_matrix_eqn_function dbeta_func;
libxsmm_matrix_eqn_function db_func;
libxsmm_matrix_eqn_function ds_func;
libxsmm_matrix_eqn_function din_func;
libxsmm_meltwfunction_unary all_zero_kernel;
libxsmm_meltwfunction_binary add_kernel;
libxsmm_meltwfunction_unary inv_relu_kernel;
libxsmm_meltwfunction_unary ewise_copy_kernel;
my_gn_fuse fuse_type;
} my_gn_bwd_config;
my_gn_fwd_config setup_my_gn_fwd(libxsmm_blasint N, libxsmm_blasint C, libxsmm_blasint H, libxsmm_blasint W, libxsmm_blasint G, libxsmm_blasint bc,
libxsmm_blasint threads, my_gn_fuse fuse_type ) {
my_gn_fwd_config res;
libxsmm_blasint ldo = bc;
libxsmm_blasint ld = bc;
libxsmm_blasint tmp_ld, tmp_ld2;
libxsmm_blasint my_eqn10;
libxsmm_meltw_unary_shape unary_shape;
libxsmm_meltw_binary_shape binary_shape;
libxsmm_bitfield unary_flags;
libxsmm_bitfield binary_flags;
libxsmm_bitfield ternary_flags;
libxsmm_datatype dtype = LIBXSMM_DATATYPE_F32;
libxsmm_meqn_arg_shape eqn_out_arg_shape;
libxsmm_meqn_arg_shape arg_shape[128];
libxsmm_matrix_arg_attributes arg_singular_attr;
libxsmm_matrix_eqn_arg_metadata arg_metadata[128];
libxsmm_matrix_eqn_op_metadata op_metadata[128];
arg_singular_attr.type = LIBXSMM_MATRIX_ARG_TYPE_SINGULAR;
memset( &res, 0, sizeof(res));
/* setting up some handle values */
res.N = N;
res.C = C;
res.G = G;
res.H = H;
res.W = W;
res.bc = bc;
res.CP = res.C / res.bc;
res.num_HW_blocks = (res.H > res.W ? res.H : res.W );
res.threads = threads;
res.fuse_type = fuse_type;
/* setting up the barrier */
res.barrier = libxsmm_barrier_create(threads, 1);
/* TPP creation */
ldo = res.G;
unary_shape = libxsmm_create_meltw_unary_shape(res.G, 1, res.G, ldo, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_NONE;
res.all_zero_G_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_XOR, unary_shape, unary_flags);
if ( res.all_zero_G_kernel == NULL) {
fprintf( stderr, "JIT for initialization by unary all zero group copy kernel failed for fwd. Bailing...!\n");
exit(-1);
}
ldo = res.bc;
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, 1, res.bc, ldo, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_NONE;
res.all_zero_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_XOR, unary_shape, unary_flags);
if ( res.all_zero_G_kernel == NULL) {
fprintf( stderr, "JIT for initialization by unary all zero copy kernel failed for fwd. Bailing...!\n");
exit(-1);
}
if (res.fuse_type == 1 || res.fuse_type == 3 || res.fuse_type == 4 || res.fuse_type == 5) {
if ((res.fuse_type == 4 || res.fuse_type == 5) && res.bc % 16 != 0) {
fprintf( stderr, "Fused ReLU with a mask does not work for sizes which are not a multiple of 16 (2BYTE limitation). Bailing...!\n");
exit(-1);
}
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, res.H*res.W / res.num_HW_blocks, ldo, ldo, dtype, dtype, dtype);
unary_flags = ( (res.fuse_type == 4 || res.fuse_type == 5) ? LIBXSMM_MELTW_FLAG_UNARY_BITMASK_2BYTEMULT : LIBXSMM_MELTW_FLAG_UNARY_NONE);
res.relu_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_RELU, unary_shape, unary_flags);
if ( res.relu_kernel == NULL ) {
fprintf( stderr, "JIT for TPP fwd_relu_kernel failed. Bailing...!\n");
exit(-1);
}
}
if (res.fuse_type == 2 || res.fuse_type == 3 || res.fuse_type == 5) {
binary_shape = libxsmm_create_meltw_binary_shape(res.bc, res.H*res.W / res.num_HW_blocks, ldo, ldo, ldo, dtype, dtype, dtype);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
res.ewise_add_kernel = libxsmm_dispatch_meltw_binary_v2(LIBXSMM_MELTW_TYPE_BINARY_ADD, binary_shape, binary_flags);
if ( res.ewise_add_kernel == NULL) {
fprintf( stderr, "JIT for TPP fwd ewise_add_kernel failed. Bailing...!\n");
exit(-1);
}
}
/* TPPs for reducing X and X2 in HW*/
ld = res.bc;
tmp_ld = res.bc;
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, res.H*res.W / res.num_HW_blocks, ld, tmp_ld, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_COLS;
res.reduce_HW_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_X2_OP_ADD, unary_shape, unary_flags);
if ( res.reduce_HW_kernel == NULL) {
fprintf( stderr, "JIT for initialization of reduce_HW_kernel failed for fwd. Bailing...!\n");
exit(-1);
}
binary_shape = libxsmm_create_meltw_binary_shape(res.bc, 1, ld, ld, ld, dtype, dtype, dtype);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
res.add_kernel = libxsmm_dispatch_meltw_binary_v2(LIBXSMM_MELTW_TYPE_BINARY_ADD, binary_shape, binary_flags);
if ( res.add_kernel == NULL) {
fprintf( stderr, "JIT for initialization of add_kernel failed for fwd. Bailing...!\n");
exit(-1);
}
/* TPP for reducing groups */
libxsmm_blasint group_size = res.C/res.G;
ld = group_size; /* group_size = (CP*bc)/G */
tmp_ld = 1;
unary_shape = libxsmm_create_meltw_unary_shape(group_size, 1, ld, tmp_ld, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_ROWS;
res.reduce_groups_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, unary_shape, unary_flags);
if ( res.reduce_groups_kernel == NULL) {
fprintf( stderr, "JIT for initialization of reduce_groups_kernel failed for fwd. Bailing...!\n");
exit(-1);
}
ld = res.bc;
tmp_ld = 1;
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, 1, ld, tmp_ld, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_ROWS;
res.reduce_rows_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, unary_shape, unary_flags);
if ( res.reduce_rows_kernel == NULL) {
fprintf( stderr, "JIT for initialization of reduce_rows_kernel failed for fwd. Bailing...!\n");
exit(-1);
}
/* TPP for forward */
ld = res.bc;
tmp_ld = 1;
tmp_ld2 = 1;
my_eqn10 = libxsmm_matrix_eqn_create(); /* y = (s*x + b)*gamma + beta */
ternary_flags = LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_1 | LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_2 | LIBXSMM_MELTW_FLAG_TERNARY_REUSE_IN_2_AS_OUT;
op_metadata[0].eqn_idx = my_eqn10;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_ternary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_TERNARY_MULADD, dtype, ternary_flags);
ternary_flags = LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_1 | LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_2 | LIBXSMM_MELTW_FLAG_TERNARY_REUSE_IN_2_AS_OUT;
op_metadata[1].eqn_idx = my_eqn10;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_ternary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_TERNARY_MULADD, dtype, ternary_flags);
arg_metadata[0].eqn_idx = my_eqn10;
arg_metadata[0].in_arg_pos = 0;
arg_shape[0].m = res.bc; /* x = [HW, bc] */
arg_shape[0].n = res.H*res.W /res.num_HW_blocks;
arg_shape[0].ld = ld;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn10;
arg_metadata[1].in_arg_pos = 1;
arg_shape[1].m = res.bc; /* s = [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
arg_metadata[2].eqn_idx = my_eqn10;
arg_metadata[2].in_arg_pos = 2;
arg_shape[2].m = res.bc; /* b = [bc] */
arg_shape[2].n = 1;
arg_shape[2].ld = tmp_ld;
arg_shape[2].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[2], arg_shape[2], arg_singular_attr);
arg_metadata[3].eqn_idx = my_eqn10;
arg_metadata[3].in_arg_pos = 3;
arg_shape[3].m = res.bc; /* gamma = [bc] */
arg_shape[3].n = 1;
arg_shape[3].ld = tmp_ld2;
arg_shape[3].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[3], arg_shape[3], arg_singular_attr);
arg_metadata[4].eqn_idx = my_eqn10;
arg_metadata[4].in_arg_pos = 4;
arg_shape[4].m = res.bc; /* beta = [bc] */
arg_shape[4].n = 1;
arg_shape[4].ld = tmp_ld2;
arg_shape[4].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[4], arg_shape[4], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* y = [HW, bc] */
eqn_out_arg_shape.n = res.H*res.W / res.num_HW_blocks;
eqn_out_arg_shape.ld = ld;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn10 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn10 ); */
res.func10 = libxsmm_dispatch_matrix_eqn_v2( my_eqn10, eqn_out_arg_shape );
if ( res.func10 == NULL) {
fprintf( stderr, "JIT for TPP fwd func10 (eqn10) failed. Bailing...!\n");
exit(-1);
}
/* init scratch (currently is not needed for the groupnorm fwd) */
res.scratch_size = 0;
return res;
}
my_gn_bwd_config setup_my_gn_bwd(libxsmm_blasint N, libxsmm_blasint C, libxsmm_blasint H, libxsmm_blasint W, libxsmm_blasint G, libxsmm_blasint bc,
libxsmm_blasint threads, my_gn_fuse fuse_type ) {
my_gn_bwd_config res;
size_t dbeta_N_offset;
libxsmm_blasint ldo = bc;
libxsmm_blasint ld = bc;
libxsmm_blasint tmp_ld2;
libxsmm_blasint my_eqn11, my_eqn12, my_eqn13, my_eqn14, my_eqn15;
libxsmm_meltw_unary_shape unary_shape;
libxsmm_meltw_binary_shape binary_shape;
libxsmm_bitfield unary_flags;
libxsmm_bitfield binary_flags;
libxsmm_bitfield ternary_flags;
libxsmm_datatype dtype = LIBXSMM_DATATYPE_F32;
libxsmm_meqn_arg_shape eqn_out_arg_shape;
libxsmm_meqn_arg_shape arg_shape[128];
libxsmm_matrix_arg_attributes arg_singular_attr;
libxsmm_matrix_eqn_arg_metadata arg_metadata[128];
libxsmm_matrix_eqn_op_metadata op_metadata[128];
arg_singular_attr.type = LIBXSMM_MATRIX_ARG_TYPE_SINGULAR;
memset( &res, 0, sizeof(res));
/* setting up some handle values */
res.N = N;
res.C = C;
res.G = G;
res.H = H;
res.W = W;
res.bc = bc;
res.CP = res.C / res.bc;
res.num_HW_blocks = (res.H > res.W ? res.H : res.W );
res.threads = threads;
res.fuse_type = fuse_type;
/* when masking is on, bc must be divisible by 8 for compressing mask into char array (otherwise strides are wrong for relumask */
if ( (res.fuse_type == 4 || res.fuse_type == 5) && (res.bc % BITS_PER_CHAR != 0)) {
fprintf( stderr, "bc = %d is not divisible by BITS_PER_CHAR = %d. Bailing...!\n", res.bc, BITS_PER_CHAR);
exit(-1);
}
/* setting up the barrier */
res.barrier = libxsmm_barrier_create(threads, 1);
ldo = res.bc;
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, 1, res.bc, ldo, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_NONE;
res.all_zero_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_XOR, unary_shape, unary_flags);
if ( res.all_zero_kernel == NULL) {
fprintf( stderr, "JIT for initialization by unary all zero copy kernel failed for fwd. Bailing...!\n");
exit(-1);
}
ld = res.bc;
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
binary_shape = libxsmm_create_meltw_binary_shape(res.bc, 1, ld, ld, ld, dtype, dtype, dtype);
res.add_kernel = libxsmm_dispatch_meltw_binary_v2(LIBXSMM_MELTW_TYPE_BINARY_ADD, binary_shape, binary_flags);
if ( res.add_kernel == NULL) {
fprintf( stderr, "JIT for initialization of add_kernel failed for fwd. Bailing...!\n");
exit(-1);
}
if (res.fuse_type == 1 || res.fuse_type == 3 || res.fuse_type == 4 || res.fuse_type == 5) {
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, res.H*res.W / res.num_HW_blocks, ldo, ldo, dtype, dtype, dtype);
unary_flags = ( (res.fuse_type == 4 || res.fuse_type == 5) ? LIBXSMM_MELTW_FLAG_UNARY_BITMASK_2BYTEMULT : LIBXSMM_MELTW_FLAG_UNARY_NONE);
res.inv_relu_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_RELU_INV, unary_shape, unary_flags);
if ( res.inv_relu_kernel == NULL ) {
fprintf( stderr, "JIT for TPP bwd inv_relu_kernel failed. Bailing...!\n");
exit(-1);
}
}
if (res.fuse_type == 2 || res.fuse_type == 3 || res.fuse_type == 5) {
unary_shape = libxsmm_create_meltw_unary_shape(res.bc, res.H*res.W / res.num_HW_blocks, ldo, ldo, dtype, dtype, dtype);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_NONE;
res.ewise_copy_kernel = libxsmm_dispatch_meltw_unary_v2(LIBXSMM_MELTW_TYPE_UNARY_IDENTITY, unary_shape, unary_flags);
if ( res.ewise_copy_kernel == NULL) {
fprintf( stderr, "JIT for TPP bwd ewise_copy_kernel failed. Bailing...!\n");
exit(-1);
}
}
/* Group norm equations */
/* Create MatEq for bwd layernorm */
ld = res.bc;
tmp_ld2 = 1;
/* dgamma function */
my_eqn11 = libxsmm_matrix_eqn_create(); /* dgamma = ((inp *a + b) * dout) + dgamma */
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[0].eqn_idx = my_eqn11;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_BINARY_ADD, dtype, binary_flags);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_COLS;
op_metadata[1].eqn_idx = my_eqn11;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_unary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, dtype, unary_flags);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[2].eqn_idx = my_eqn11;
op_metadata[2].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[2], LIBXSMM_MELTW_TYPE_BINARY_MUL, dtype, binary_flags);
ternary_flags = LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_1 | LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_2 | LIBXSMM_MELTW_FLAG_TERNARY_REUSE_IN_2_AS_OUT;
op_metadata[3].eqn_idx = my_eqn11;
op_metadata[3].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_ternary_op_v2(op_metadata[3], LIBXSMM_MELTW_TYPE_TERNARY_MULADD, dtype, ternary_flags);
arg_metadata[0].eqn_idx = my_eqn11;
arg_metadata[0].in_arg_pos = 0;
arg_shape[0].m = res.bc; /* inp [HW, bc] */
arg_shape[0].n = res.H*res.W /res.num_HW_blocks;
arg_shape[0].ld = ld;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn11;
arg_metadata[1].in_arg_pos = 1;
arg_shape[1].m = res.bc; /* a [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld2;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
arg_metadata[2].eqn_idx = my_eqn11;
arg_metadata[2].in_arg_pos = 2;
arg_shape[2].m = res.bc; /* b [bc] */
arg_shape[2].n = 1;
arg_shape[2].ld = tmp_ld2;
arg_shape[2].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[2], arg_shape[2], arg_singular_attr);
arg_metadata[3].eqn_idx = my_eqn11;
arg_metadata[3].in_arg_pos = 3;
arg_shape[3].m = res.bc; /* dout [HW, bc] */
arg_shape[3].n = res.H*res.W/res.num_HW_blocks;
arg_shape[3].ld = ld;
arg_shape[3].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[3], arg_shape[3], arg_singular_attr);
arg_metadata[4].eqn_idx = my_eqn11;
arg_metadata[4].in_arg_pos = 4;
arg_shape[4].m = res.bc; /* dgamma [bc] */
arg_shape[4].n = 1;
arg_shape[4].ld = tmp_ld2;
arg_shape[4].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[4], arg_shape[4], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* dgamma [bc] */
eqn_out_arg_shape.n = 1;
eqn_out_arg_shape.ld = tmp_ld2;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn11 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn11 ); */
res.dgamma_func = libxsmm_dispatch_matrix_eqn_v2( my_eqn11, eqn_out_arg_shape );
if ( res.dgamma_func == NULL) {
fprintf( stderr, "JIT for TPP fwd dgamma_func (eqn11) failed. Bailing...!\n");
exit(-1);
}
/* dbeta function */
my_eqn12 = libxsmm_matrix_eqn_create(); /* dbeta [bc] = dout [HW, bc] + dbeta [bc] */
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[0].eqn_idx = my_eqn12;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_BINARY_ADD, dtype, binary_flags);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_COLS;
op_metadata[1].eqn_idx = my_eqn12;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_unary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, dtype, unary_flags);
arg_metadata[0].eqn_idx = my_eqn12;
arg_metadata[0].in_arg_pos = 3;
arg_shape[0].m = res.bc; /* dout [HW, bc] */
arg_shape[0].n = res.H*res.W/res.num_HW_blocks;
arg_shape[0].ld = ld;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn12;
arg_metadata[1].in_arg_pos = 5;
arg_shape[1].m = res.bc; /* dbeta [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld2;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* dbeta [bc] */
eqn_out_arg_shape.n = 1;
eqn_out_arg_shape.ld = tmp_ld2;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn12 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn12 ); */
res.dbeta_func = libxsmm_dispatch_matrix_eqn_v2( my_eqn12, eqn_out_arg_shape );
if ( res.dbeta_func == NULL) {
fprintf( stderr, "JIT for TPP fwd dbeta_func (eqn12) failed. Bailing...!\n");
exit(-1);
}
/* db new equation */
my_eqn13 = libxsmm_matrix_eqn_create(); /* db [bc] = (dout * gamma) [HW, bc] + db [bc]*/
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[0].eqn_idx = my_eqn13;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_BINARY_ADD, dtype, binary_flags);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_COLS;
op_metadata[1].eqn_idx = my_eqn13;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_unary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, dtype, unary_flags);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_BCAST_COL_IN_1;
op_metadata[2].eqn_idx = my_eqn13;
op_metadata[2].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[2], LIBXSMM_MELTW_TYPE_BINARY_MUL, dtype, binary_flags);
arg_metadata[0].eqn_idx = my_eqn13;
arg_metadata[0].in_arg_pos = 3;
arg_shape[0].m = res.bc; /* dout [HW, bc] */
arg_shape[0].n = res.H*res.W/res.num_HW_blocks;
arg_shape[0].ld = ld;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn13;
arg_metadata[1].in_arg_pos = 6;
arg_shape[1].m = res.bc; /* gamma [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld2;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
arg_metadata[2].eqn_idx = my_eqn13;
arg_metadata[2].in_arg_pos = 9;
arg_shape[2].m = res.bc; /* db [bc] */
arg_shape[2].n = 1;
arg_shape[2].ld = tmp_ld2;
arg_shape[2].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[2], arg_shape[2], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* db [bc] */
eqn_out_arg_shape.n = 1;
eqn_out_arg_shape.ld = tmp_ld2;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn13 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn13 ); */
res.db_func = libxsmm_dispatch_matrix_eqn_v2( my_eqn13, eqn_out_arg_shape );
if ( res.db_func == NULL) {
fprintf( stderr, "JIT for TPP fwd db_func (eqn13) failed. Bailing...!\n");
exit(-1);
}
/* ds new equation */
my_eqn14 = libxsmm_matrix_eqn_create(); /* ds [bc] = ((dout * gamma) * inp) [HW, bc] + ds [bc] */
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[0].eqn_idx = my_eqn14;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_BINARY_ADD, dtype, binary_flags);
unary_flags = LIBXSMM_MELTW_FLAG_UNARY_REDUCE_COLS;
op_metadata[1].eqn_idx = my_eqn14;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_unary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_UNARY_REDUCE_X_OP_ADD, dtype, unary_flags);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[2].eqn_idx = my_eqn14;
op_metadata[2].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[2], LIBXSMM_MELTW_TYPE_BINARY_MUL, dtype, binary_flags);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_BCAST_COL_IN_1;
op_metadata[3].eqn_idx = my_eqn14;
op_metadata[3].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[3], LIBXSMM_MELTW_TYPE_BINARY_MUL, dtype, binary_flags);
arg_metadata[0].eqn_idx = my_eqn14;
arg_metadata[0].in_arg_pos = 3;
arg_shape[0].m = res.bc; /* dout [HW, bc] */
arg_shape[0].n = res.H*res.W/res.num_HW_blocks;
arg_shape[0].ld = ld;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn14;
arg_metadata[1].in_arg_pos = 6;
arg_shape[1].m = res.bc; /* gamma [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld2;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
arg_metadata[2].eqn_idx = my_eqn14;
arg_metadata[2].in_arg_pos = 0;
arg_shape[2].m = res.bc; /* inp [HW, bc] */
arg_shape[2].n = res.H*res.W /res.num_HW_blocks;
arg_shape[2].ld = ld;
arg_shape[2].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[2], arg_shape[2], arg_singular_attr);
arg_metadata[3].eqn_idx = my_eqn14;
arg_metadata[3].in_arg_pos = 8;
arg_shape[3].m = res.bc; /* ds [bc] */
arg_shape[3].n = 1;
arg_shape[3].ld = tmp_ld2;
arg_shape[3].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[3], arg_shape[3], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* ds [bc] */
eqn_out_arg_shape.n = 1;
eqn_out_arg_shape.ld = tmp_ld2;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn14 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn14 ); */
res.ds_func = libxsmm_dispatch_matrix_eqn_v2( my_eqn14, eqn_out_arg_shape );
if ( res.ds_func == NULL) {
fprintf( stderr, "JIT for TPP fwd ds_func (eqn14) failed. Bailing...!\n");
exit(-1);
}
/* din equation */
my_eqn15 = libxsmm_matrix_eqn_create(); /* din = ((gamma * a) * dout) + (inp * b + c) */
ternary_flags = LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_0 | LIBXSMM_MELTW_FLAG_TERNARY_REUSE_IN_2_AS_OUT;
op_metadata[0].eqn_idx = my_eqn15;
op_metadata[0].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_ternary_op_v2(op_metadata[0], LIBXSMM_MELTW_TYPE_TERNARY_MULADD, dtype, ternary_flags);
binary_flags = LIBXSMM_MELTW_FLAG_BINARY_NONE;
op_metadata[2].eqn_idx = my_eqn15;
op_metadata[2].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_binary_op_v2(op_metadata[2], LIBXSMM_MELTW_TYPE_BINARY_MUL, dtype, binary_flags);
arg_metadata[0].eqn_idx = my_eqn15;
arg_metadata[0].in_arg_pos = 6;
arg_shape[0].m = res.bc; /* gamma [bc] */
arg_shape[0].n = 1;
arg_shape[0].ld = tmp_ld2;
arg_shape[0].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[0], arg_shape[0], arg_singular_attr);
arg_metadata[1].eqn_idx = my_eqn15;
arg_metadata[1].in_arg_pos = 1;
arg_shape[1].m = res.bc; /* a [bc] */
arg_shape[1].n = 1;
arg_shape[1].ld = tmp_ld2;
arg_shape[1].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[1], arg_shape[1], arg_singular_attr);
arg_metadata[2].eqn_idx = my_eqn15;
arg_metadata[2].in_arg_pos = 3;
arg_shape[2].m = res.bc; /* dout [HW, bc] */
arg_shape[2].n = res.H*res.W/res.num_HW_blocks;
arg_shape[2].ld = ld;
arg_shape[2].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[2], arg_shape[2], arg_singular_attr);
ternary_flags = LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_1 | LIBXSMM_MELTW_FLAG_TERNARY_BCAST_COL_IN_2 | LIBXSMM_MELTW_FLAG_TERNARY_REUSE_IN_2_AS_OUT;
op_metadata[1].eqn_idx = my_eqn15;
op_metadata[1].op_arg_pos = -1;
libxsmm_matrix_eqn_push_back_ternary_op_v2(op_metadata[1], LIBXSMM_MELTW_TYPE_TERNARY_MULADD, dtype, ternary_flags);
arg_metadata[3].eqn_idx = my_eqn15;
arg_metadata[3].in_arg_pos = 0;
arg_shape[3].m = res.bc; /* inp [HW, bc] */
arg_shape[3].n = res.H*res.W /res.num_HW_blocks;
arg_shape[3].ld = ld;
arg_shape[3].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[3], arg_shape[3], arg_singular_attr);
arg_metadata[4].eqn_idx = my_eqn15;
arg_metadata[4].in_arg_pos = 2;
arg_shape[4].m = res.bc; /* b [bc] */
arg_shape[4].n = 1;
arg_shape[4].ld = tmp_ld2;
arg_shape[4].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[4], arg_shape[4], arg_singular_attr);
arg_metadata[5].eqn_idx = my_eqn15;
arg_metadata[5].in_arg_pos = 7;
arg_shape[5].m = res.bc; /* c [bc] */
arg_shape[5].n = 1;
arg_shape[5].ld = tmp_ld2;
arg_shape[5].type = dtype;
libxsmm_matrix_eqn_push_back_arg_v2(arg_metadata[5], arg_shape[5], arg_singular_attr);
eqn_out_arg_shape.m = res.bc; /* din [HW, bc] */
eqn_out_arg_shape.n = res.H*res.W/res.num_HW_blocks;
eqn_out_arg_shape.ld = ld;
eqn_out_arg_shape.type = dtype;
/* libxsmm_matrix_eqn_tree_print( my_eqn16 ); */
/* libxsmm_matrix_eqn_rpn_print ( my_eqn16 ); */
res.din_func = libxsmm_dispatch_matrix_eqn_v2( my_eqn15, eqn_out_arg_shape );
if ( res.din_func == NULL) {
fprintf( stderr, "JIT for TPP fwd din_func (eqn15) failed. Bailing...!\n");
exit(-1);
}
/* init scratch */
dbeta_N_offset = LIBXSMM_UP2(res.CP * res.N * res.bc, 64);
res.scratch_size = sizeof(float) * ( dbeta_N_offset /* dbeta_N*/ + LIBXSMM_UP2(res.CP * res.N * res.bc, 64) /*dgamma_N */ );
return res;
}
void destroy_my_gn_fwd(my_gn_fwd_config* cfg) {
libxsmm_barrier_destroy(cfg->barrier);
/* when/if libxsmm_matrix_eqn_destroy gets added, destructors for equations should go here */
}
void destroy_my_gn_bwd(my_gn_bwd_config* cfg) {
libxsmm_barrier_destroy(cfg->barrier);
}
void my_gn_fwd_exec( my_gn_fwd_config cfg, const float *pinp, const float *pinp_add, const float *pgamma, const float *pbeta, float *mean, float *var, float *pout, unsigned char *prelumask,
float eps, int start_tid, int my_tid, void *scratch ) {
const libxsmm_blasint N = cfg.N;
const libxsmm_blasint CP = cfg.CP;
const libxsmm_blasint G = cfg.G;
const libxsmm_blasint HW = cfg.H * cfg.W;
const libxsmm_blasint CB = cfg.bc;
const libxsmm_blasint num_HW_blocks = cfg.num_HW_blocks;
/* computing first logical thread */
const libxsmm_blasint ltid = my_tid - start_tid;
/* number of tasks that could be run in parallel for 1d blocking */
/* Question: each thread should take a number of full (of length CP chunks) or can we really do a partial split here */
const libxsmm_blasint work_dN = CP * N;
/* compute chunk size */
const libxsmm_blasint chunksize_dN = (work_dN % cfg.threads == 0) ?
(work_dN / cfg.threads) : ((work_dN / cfg.threads) + 1);
/* compute thr_begin and thr_end */
const libxsmm_blasint thr_begin_dN = (ltid * chunksize_dN < work_dN) ? (ltid * chunksize_dN) : work_dN;
const libxsmm_blasint thr_end_dN = ((ltid + 1) * chunksize_dN < work_dN) ? ((ltid + 1) * chunksize_dN) : work_dN;
/* number of tasks that could be run in parallel for 1d blocking over N*/
const libxsmm_blasint work_N = N;
/* compute chunk size */
const libxsmm_blasint chunksize_N = (work_N % cfg.threads == 0) ?
(work_N / cfg.threads) : ((work_N / cfg.threads) + 1);
/* compute thr_begin and thr_end */
const libxsmm_blasint thr_begin_N = (ltid * chunksize_N < work_N) ? (ltid * chunksize_N) : work_N;
const libxsmm_blasint thr_end_N = ((ltid + 1) * chunksize_N < work_N) ? ((ltid + 1) * chunksize_N) : work_N;
/* lazy barrier init */
libxsmm_barrier_init(cfg.barrier, ltid);
LIBXSMM_VLA_DECL(4, const float, inp, pinp, CP, HW, CB); /* [N, CP, HW, CB] */
LIBXSMM_VLA_DECL(4, float, out, pout, CP, HW, CB);
LIBXSMM_VLA_DECL(2, const float, gamma, pgamma, CB); /* [CP,CB] */
LIBXSMM_VLA_DECL(2, const float, beta, pbeta, CB); /* [CP,CB] */
LIBXSMM_VLA_DECL(4, const float, inp_add, pinp_add, CP, HW, CB); /* [N, CP, HW, bc] */
float alpha = 0.0f;
LIBXSMM_VLA_DECL(4, unsigned char, relumask, prelumask, CP, HW, CB/BITS_PER_CHAR); /* [N, CP, HW, CB/BITS_PER_CHAR] */
int np, group_size;
group_size = (CP*CB)/G;
libxsmm_meltw_unary_param all_zero_param;
libxsmm_meltw_binary_param add_param;
libxsmm_meltw_unary_param reduce_HW_param;
libxsmm_meltw_unary_param m_reduce_groups_param;
libxsmm_meltw_unary_param v_reduce_groups_param;
libxsmm_meltw_unary_param all_relu_param;
libxsmm_matrix_arg arg_array[5];
libxsmm_matrix_eqn_param eqn_param;
memset( &all_zero_param, 0, sizeof(all_zero_param));
memset( &add_param, 0, sizeof(add_param));
memset( &reduce_HW_param, 0, sizeof(reduce_HW_param));
memset( &m_reduce_groups_param, 0, sizeof(m_reduce_groups_param));
memset( &v_reduce_groups_param, 0, sizeof(v_reduce_groups_param));
memset( &all_relu_param, 0, sizeof(all_relu_param));
memset( &eqn_param, 0, sizeof(eqn_param));
eqn_param.inputs = arg_array;
if (group_size <= CB){
int cp;
int cpxnt;
for ( cpxnt = thr_begin_dN; cpxnt < thr_end_dN; ++cpxnt ) {
np = cpxnt/CP;
cp = cpxnt%CP;
LIBXSMM_ALIGNED(float tmp[2*CB], 64);
LIBXSMM_ALIGNED(float sum_X[G], 64);
LIBXSMM_ALIGNED(float sum_X2[G], 64);
LIBXSMM_ALIGNED(float s[CB], 64);
LIBXSMM_ALIGNED(float b[CB], 64);
int i, j, hwb, g;
all_zero_param.out.primary = tmp;
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &tmp[CB];
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = sum_X;
cfg.all_zero_G_kernel(&all_zero_param);
all_zero_param.out.primary = sum_X2;
cfg.all_zero_G_kernel(&all_zero_param);
LIBXSMM_ALIGNED(float new_tmp[2*CB], 64);
reduce_HW_param.out.primary = new_tmp; /* [2*CB] */
for(hwb=0; hwb < num_HW_blocks; hwb++){
reduce_HW_param.in.primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW_block, CB] -----> [2 * CB] */
cfg.reduce_HW_kernel(&reduce_HW_param);
add_param.in0.primary = tmp;
add_param.in1.primary = new_tmp;
add_param.out.primary = tmp;
cfg.add_kernel(&add_param);
add_param.in0.primary = &tmp[CB];
add_param.in1.primary = &new_tmp[CB];
add_param.out.primary = &tmp[CB];
cfg.add_kernel(&add_param);
/* for (cb = 0; cb < 2*CB; cb++) { */
/* tmp[cb] += new_tmp[cb]; */
/* } */
}
for(i=0; i < CB; i += group_size){
g = (cp*CB + i)/group_size; /* determine current group */
m_reduce_groups_param.in.primary = &tmp[i];
m_reduce_groups_param.out.primary = &sum_X[g];
v_reduce_groups_param.in.primary = &tmp[CB + i];
v_reduce_groups_param.out.primary = &sum_X2[g];
cfg.reduce_groups_kernel(&m_reduce_groups_param);
cfg.reduce_groups_kernel(&v_reduce_groups_param);
mean[np*G + g] = sum_X[g] / ((float)group_size * HW);
var[np*G + g] = (sum_X2[g] / ((float)group_size * HW)) - (mean[np*G + g]*mean[np*G + g]); /* var = E[X^2] - (E[X])^2 */
for(j = 0; j < group_size; j++){
s[i + j] = 1.0f / ((float)sqrt(var[np*G + g] + eps)); /* 1/sqrt(var(X) + eps) */
b[i + j] = -1 * mean[np*G + g] * s[i + j]; /* -E[X]/sqrt(var(X) + eps) */
}
}
arg_array[1].primary = s; /* [CB] */
arg_array[2].primary = b; /* [CB] */
arg_array[3].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB); /* [CB] */
arg_array[4].primary = (void*)&LIBXSMM_VLA_ACCESS(2, beta, cp, 0, CB); /* [CB] */
for(hwb=0; hwb < num_HW_blocks; hwb++){
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW, CB] */
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW, CB] */
cfg.func10(&eqn_param); /* Normalization equation -> y = ((s*x + b)*gamma + beta) */
/* Eltwise add */
if (cfg.fuse_type == MY_GN_FUSE_ELTWISE || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
add_param.in0.primary = (void*)&LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
add_param.in1.primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp_add, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
add_param.out.primary = (void*)&LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.ewise_add_kernel(&add_param);
}
/* ReLU */
if (cfg.fuse_type == MY_GN_FUSE_RELU || cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
all_relu_param.op.primary = (void*)(&alpha);
all_relu_param.in.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.out.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.out.secondary = ((cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) ?
(void*)&LIBXSMM_VLA_ACCESS(4, relumask, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, (CB/BITS_PER_CHAR)) : NULL );
cfg.relu_kernel(&all_relu_param);
} /* ReLU */
}
}
} else{ /* Case when group_size > CB */
for ( np = thr_begin_N; np < thr_end_N; ++np ) {
LIBXSMM_ALIGNED(float tmp[2*CB], 64);
LIBXSMM_ALIGNED(float sum_X[G], 64);
LIBXSMM_ALIGNED(float sum_X2[G], 64);
LIBXSMM_ALIGNED(float s[CP*CB], 64);
LIBXSMM_ALIGNED(float b[CP*CB], 64);
int i, j, cp, hwb, g;
float m, v;
libxsmm_meltw_unary_param m_reduce_rows_param;
libxsmm_meltw_unary_param v_reduce_rows_param;
memset( &m_reduce_rows_param, 0, sizeof(m_reduce_rows_param));
memset( &v_reduce_rows_param, 0, sizeof(v_reduce_rows_param));
all_zero_param.out.primary = sum_X;
cfg.all_zero_G_kernel(&all_zero_param);
all_zero_param.out.primary = sum_X2;
cfg.all_zero_G_kernel(&all_zero_param);
LIBXSMM_ALIGNED(float new_tmp[2*CB], 64);
for (cp = 0; cp < CP; cp++){ /* [cp, HW, CB] */
all_zero_param.out.primary = tmp;
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &tmp[CB];
cfg.all_zero_kernel(&all_zero_param);
/* for (cb = 0; cb < 2*CB; cb++) { */
/* tmp[cb] = 0.0f; */
/* } */
reduce_HW_param.out.primary = new_tmp; /* [2*CB] */
for(hwb=0; hwb < num_HW_blocks; hwb++){
reduce_HW_param.in.primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW, CB] -----> [2 * CB] */
cfg.reduce_HW_kernel(&reduce_HW_param);
add_param.in0.primary = tmp;
add_param.in1.primary = new_tmp;
add_param.out.primary = tmp;
cfg.add_kernel(&add_param);
add_param.in0.primary = &tmp[CB];
add_param.in1.primary = &new_tmp[CB];
add_param.out.primary = &tmp[CB];
cfg.add_kernel(&add_param);
/* #pragma omp simd */
/* for (cb = 0; cb < 2*CB; cb++) { */
/* tmp[cb] += new_tmp[cb]; */
/* } */
}
if (group_size >= CB){ /* Group size >= block size (Ex.- CP = 4, CB = 16, G = 2, group_size = 32) */
g = (cp*CB)/group_size; /* determine current group */
m_reduce_rows_param.in.primary = tmp;
m_reduce_rows_param.out.primary = &m;
v_reduce_rows_param.in.primary = &tmp[CB];
v_reduce_rows_param.out.primary = &v;
cfg.reduce_rows_kernel(&m_reduce_rows_param);
cfg.reduce_rows_kernel(&v_reduce_rows_param);
sum_X[g] += m;
sum_X2[g] += v;
}
else{ /* Group size < block size (Ex.- CP = 4, CB = 16, G = 32, group_size = 2) */
for(i=0; i < CB; i += group_size){
m_reduce_groups_param.in.primary = &tmp[i];
m_reduce_groups_param.out.primary = &sum_X[cp*(CB/group_size) + (i/group_size)];
v_reduce_groups_param.in.primary = &tmp[CB + i];
v_reduce_groups_param.out.primary = &sum_X2[cp*(CB/group_size) + (i/group_size)];
cfg.reduce_groups_kernel(&m_reduce_groups_param);
cfg.reduce_groups_kernel(&v_reduce_groups_param);
}
}
}
/* mean and variance calculation */
for(g = 0; g < G; g++){
mean[np*G + g] = sum_X[g] / ((float)group_size * HW);
var[np*G + g] = (sum_X2[g] / ((float)group_size * HW)) - (mean[np*G + g]*mean[np*G + g]); /* var = E[X^2] - (E[X])^2 */
for(j = 0; j < group_size; j++){
s[g*group_size + j] = 1.0f / ((float)sqrt(var[np*G + g] + eps)); /* 1/sqrt(var(X) + eps) */
b[g*group_size + j] = -1 * mean[np*G + g] * s[g*group_size + j]; /* -E[X]/sqrt(var(X) + eps) */
}
}
for (cp = 0; cp < CP; cp++){
arg_array[1].primary = &s[cp*CB]; /* [CB] */
arg_array[2].primary = &b[cp*CB]; /* [CB] */
arg_array[3].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB); /* [CB] */
arg_array[4].primary = (void*)&LIBXSMM_VLA_ACCESS(2, beta, cp, 0, CB); /* [CB] */
for(hwb=0; hwb < num_HW_blocks; hwb++){
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW, CB] */
eqn_param.inputs = arg_array;
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
cfg.func10(&eqn_param); /* Normalization equation -> y = ((s*x + b)*gamma + beta) */
/* Eltwise add */
if (cfg.fuse_type == MY_GN_FUSE_ELTWISE || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
add_param.in0.primary = (void*)&LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
add_param.in1.primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp_add, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
add_param.out.primary = (void*)&LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.ewise_add_kernel(&add_param);
}
/* ReLU */
if (cfg.fuse_type == MY_GN_FUSE_RELU || cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
all_relu_param.op.primary = (void*)(&alpha);
all_relu_param.in.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.out.primary = &LIBXSMM_VLA_ACCESS(4, out, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.out.secondary = ((cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) ?
(void*)&LIBXSMM_VLA_ACCESS(4, relumask, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, (CB/BITS_PER_CHAR)) : NULL );
cfg.relu_kernel(&all_relu_param);
} /* ReLU */
}
}
}
}
libxsmm_barrier_wait(cfg.barrier, ltid);
}
void my_gn_bwd_exec( my_gn_bwd_config cfg, float *pdout, const float *pinp, const float *mean, const float *var, const float *pgamma, const unsigned char *prelumask,
float *pdin, float *pdin_add, float *pdgamma, float *pdbeta, float eps,
int start_tid, int my_tid, void *scratch) {
const libxsmm_blasint N = cfg.N;
const libxsmm_blasint CP = cfg.CP;
const libxsmm_blasint G = cfg.G;
const libxsmm_blasint HW = cfg.H * cfg.W;
const libxsmm_blasint CB = cfg.bc;
const libxsmm_blasint num_HW_blocks = cfg.num_HW_blocks;
/* computing first logical thread */
const libxsmm_blasint ltid = my_tid - start_tid;
/* number of tasks that could be run in parallel for 1d blocking */
/* Question: each thread should take a number of full (of length CP chunks) or can we really do a partial split here? */
const libxsmm_blasint work_dN = N * CP;
/* compute chunk size */
const libxsmm_blasint chunksize_dN = (work_dN % cfg.threads == 0) ?
(work_dN / cfg.threads) : ((work_dN / cfg.threads) + 1);
/* compute thr_begin and thr_end */
const libxsmm_blasint thr_begin_dN = (ltid * chunksize_dN < work_dN) ? (ltid * chunksize_dN) : work_dN;
const libxsmm_blasint thr_end_dN = ((ltid + 1) * chunksize_dN < work_dN) ? ((ltid + 1) * chunksize_dN) : work_dN;
/* number of tasks that could be run in parallel for 1d blocking over CP */
const libxsmm_blasint work_C = CP;
/* compute chunk size */
const libxsmm_blasint chunksize_C = (work_C % cfg.threads == 0) ?
(work_C / cfg.threads) : ((work_C / cfg.threads) + 1);
/* compute thr_begin and thr_end */
const libxsmm_blasint thr_begin_C = (ltid * chunksize_C < work_C) ? (ltid * chunksize_C) : work_C;
const libxsmm_blasint thr_end_C = ((ltid + 1) * chunksize_C < work_C) ? ((ltid + 1) * chunksize_C) : work_C;
/* number of tasks that could be run in parallel for 1d blocking over N */
const libxsmm_blasint work_N = N;
/* compute chunk size */
const libxsmm_blasint chunksize_N = (work_N % cfg.threads == 0) ?
(work_N / cfg.threads) : ((work_N / cfg.threads) + 1);
/* compute thr_begin and thr_end */
const libxsmm_blasint thr_begin_N = (ltid * chunksize_N < work_N) ? (ltid * chunksize_N) : work_N;
const libxsmm_blasint thr_end_N = ((ltid + 1) * chunksize_N < work_N) ? ((ltid + 1) * chunksize_N) : work_N;
libxsmm_meltw_unary_param all_zero_param;
libxsmm_meltw_unary_param all_relu_param;
libxsmm_meltw_unary_param ewise_copy_param;
libxsmm_matrix_arg arg_array[10];
libxsmm_matrix_eqn_param eqn_param;
memset( &all_zero_param, 0, sizeof(all_zero_param));
memset( &all_relu_param, 0, sizeof(all_relu_param));
memset( &ewise_copy_param, 0, sizeof(ewise_copy_param));
memset( &eqn_param, 0, sizeof(eqn_param));
eqn_param.inputs = arg_array;
/* lazy barrier init */
libxsmm_barrier_init(cfg.barrier, ltid);
int group_size = (CP*CB)/G;
const float scale = 1.0f / ((float)group_size * HW);
LIBXSMM_VLA_DECL(4, float, din, pdin, CP, HW, CB);
LIBXSMM_VLA_DECL(4, const float, inp, pinp, CP, HW, CB);
LIBXSMM_VLA_DECL(4, float, dout, pdout, CP, HW, CB);
LIBXSMM_VLA_DECL(2, const float, gamma, pgamma, CB);
LIBXSMM_VLA_DECL(2, float, dgamma, pdgamma, CB);
LIBXSMM_VLA_DECL(2, float, dbeta, pdbeta, CB);
LIBXSMM_VLA_DECL(4, float, din_add, pdin_add, CP, HW, CB); /* [N, CP, HW, bc] */
float alpha = 0.0f;
LIBXSMM_VLA_DECL(4, const unsigned char, relumask, prelumask, CP, HW, CB/BITS_PER_CHAR); /* [N, CP, HW, CB/BITS_PER_CHAR] */
const libxsmm_blasint dbeta_N_offset = (LIBXSMM_UP2((uintptr_t)(((float*)scratch) + N * CP * CB), 64) - ((uintptr_t)(scratch))) / sizeof(float);
LIBXSMM_VLA_DECL(3, float, dgamma_N, ((float*)scratch), CP, CB); /* [N, CP, CB] */
LIBXSMM_ASSUME_ALIGNED(dgamma_N_, 64);
LIBXSMM_VLA_DECL(3, float, dbeta_N, ((float*)scratch) + dbeta_N_offset, CP, CB); /* [N, CP, CB] */
LIBXSMM_ASSUME_ALIGNED(dbeta_N_, 64);
if (group_size <= CB){
LIBXSMM_ALIGNED(float a[CB], 64);
LIBXSMM_ALIGNED(float b[CB], 64);
LIBXSMM_ALIGNED(float c[CB], 64);
LIBXSMM_ALIGNED(float ds[CB], 64);
LIBXSMM_ALIGNED(float db[CB], 64);
int np, cp;
int cpxnt;
for ( cpxnt = thr_begin_dN; cpxnt < thr_end_dN; ++cpxnt ) {
np = cpxnt/CP;
cp = cpxnt%CP;
int j, g, hwb, lg;
/* for(j = 0; j < CB; j++){
dgamma_N[np*CP*CB + cp*CB + j] = 0.0f;
dbeta_N[np*CP*CB + cp*CB + j] = 0.0f;
} */
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = ds;
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = db;
cfg.all_zero_kernel(&all_zero_param);
/* compute a and b for each channel from group means and variance */
for(g = (cp*CB)/group_size; g < ((cp+1)*CB)/group_size; g++){
lg = g - (cp*CB)/group_size;
for(j = 0; j < group_size; j++){
a[lg*group_size + j] = 1.0f / ((float)sqrt(var[np*G + g] + eps));
b[lg*group_size + j] = -a[lg*group_size + j]*mean[np*G + g];
}
}
arg_array[1].primary = a;
arg_array[2].primary = b;
arg_array[4].primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
arg_array[5].primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
arg_array[6].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB);
arg_array[8].primary = ds;
arg_array[9].primary = db;
for(hwb=0; hwb < num_HW_blocks; hwb++){
if (cfg.fuse_type == MY_GN_FUSE_RELU || cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
all_relu_param.op.primary = (void*)(&alpha);
all_relu_param.in.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.in.secondary = ((cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) ?
(void*)&LIBXSMM_VLA_ACCESS(4, relumask, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB/8)
: NULL /*&LIBXSMM_VLA_ACCESS(4, dout, n, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB) */ ); /* dout_fwd ? nonsense? */
all_relu_param.out.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
cfg.inv_relu_kernel(&all_relu_param);
} /* ReLU/mask */
if (cfg.fuse_type == MY_GN_FUSE_ELTWISE || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
ewise_copy_param.in.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
ewise_copy_param.out.primary = &LIBXSMM_VLA_ACCESS(4, din_add, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.ewise_copy_kernel(&ewise_copy_param);
} /* Eltwise */
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
arg_array[3].primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
eqn_param.output.primary = ds;
cfg.ds_func(&eqn_param);
eqn_param.output.primary = db;
cfg.db_func(&eqn_param);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
cfg.dgamma_func(&eqn_param);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
cfg.dbeta_func(&eqn_param);
}
/* b = (db * mean[nb] - ds) * a * a * a * scale; */
/* c = -b * mean[nb] - db * a * scale; */
for(g = (cp*CB)/group_size; g < ((cp+1)*CB)/group_size; g++){ /* compute b and c for each channel from group means and variance */
lg = g - (cp*CB)/group_size;
float gds = 0.0f;
float gdb = 0.0f;
for(j = 0; j < group_size; j++){
gds += ds[lg*group_size + j]; /* Group ds and db calculation */
gdb += db[lg*group_size + j];
}
for(j = 0; j < group_size; j++){
b[lg*group_size + j] = (gdb * mean[np*G + g] - gds) * a[lg*group_size + j] * a[lg*group_size + j] * a[lg*group_size + j] * scale;
c[lg*group_size + j] = -b[lg*group_size + j] * mean[np*G + g] - gdb * a[lg*group_size + j] * scale;
}
}
arg_array[1].primary = a;
arg_array[2].primary = b;
arg_array[6].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB);
arg_array[7].primary = c;
for(hwb=0; hwb < num_HW_blocks; hwb++){
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
arg_array[3].primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(4, din, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.din_func(&eqn_param);
}
}
libxsmm_barrier_wait(cfg.barrier, ltid); /* not needed? */
for ( cp = thr_begin_C; cp < thr_end_C; ++cp ) {
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(2, dgamma, cp, 0, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(2, dbeta, cp, 0, CB);
cfg.all_zero_kernel(&all_zero_param);
for (np=0; np < N; np++ ) {
int cb;
for(cb = 0; cb < CB; cb++){
LIBXSMM_VLA_ACCESS(2, dgamma, cp, cb, CB) += LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, cb, CP, CB);
LIBXSMM_VLA_ACCESS(2, dbeta, cp, cb, CB) += LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, cb, CP, CB);
}
}
}
} else {
LIBXSMM_ALIGNED(float a[CP*CB], 64);
LIBXSMM_ALIGNED(float b[CP*CB], 64);
LIBXSMM_ALIGNED(float c[CP*CB], 64);
LIBXSMM_ALIGNED(float ds[CP*CB], 64);
LIBXSMM_ALIGNED(float db[CP*CB], 64);
int np;
for ( np = thr_begin_N; np < thr_end_N; ++np ) {
int j, g, cp, hwb;
/* for(j = 0; j < CP*CB; j++){ */
/* dgamma_N[np*CP*CB + j] = 0.0f; */
/* dbeta_N[np*CP*CB + j] = 0.0f; */
/* } */
for (cp = 0; cp < CP; cp++) {
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &ds[cp*CB];
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &db[cp*CB];
cfg.all_zero_kernel(&all_zero_param);
}
for(g = 0; g < G; g++){ /* compute a and b for each channel from group means and variance */
for(j = 0; j < group_size; j++){
a[g*group_size + j] = 1.0f / ((float)sqrt(var[np*G + g] + eps));
b[g*group_size + j] = -a[g*group_size + j]*mean[np*G + g];
}
}
for (cp = 0; cp < CP; cp++) {
arg_array[1].primary = &a[cp*CB];
arg_array[2].primary = &b[cp*CB];
arg_array[4].primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
arg_array[5].primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
arg_array[6].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB);
arg_array[8].primary = &ds[cp*CB];
arg_array[9].primary = &db[cp*CB];
for(hwb=0; hwb < num_HW_blocks; hwb++){
if (cfg.fuse_type == MY_GN_FUSE_RELU || cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
all_relu_param.op.primary = (void*)(&alpha);
all_relu_param.in.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
all_relu_param.in.secondary = ((cfg.fuse_type == MY_GN_FUSE_RELU_WITH_MASK || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) ?
(void*)&LIBXSMM_VLA_ACCESS(4, relumask, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB/8)
: NULL /*&LIBXSMM_VLA_ACCESS(4, dout, n, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB) */ ); /* dout_fwd ? nonsense? */
all_relu_param.out.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB); /* [HW,CB] */
cfg.inv_relu_kernel(&all_relu_param);
} /* ReLU/mask */
if (cfg.fuse_type == MY_GN_FUSE_ELTWISE || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU || cfg.fuse_type == MY_GN_FUSE_ELTWISE_RELU_WITH_MASK) {
ewise_copy_param.in.primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
ewise_copy_param.out.primary = &LIBXSMM_VLA_ACCESS(4, din_add, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.ewise_copy_kernel(&ewise_copy_param);
} /* Eltwise */
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
arg_array[3].primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
eqn_param.output.primary = &ds[cp*CB];
cfg.ds_func(&eqn_param);
eqn_param.output.primary = &db[cp*CB];
cfg.db_func(&eqn_param);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, 0, CP, CB);
cfg.dgamma_func(&eqn_param);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, 0, CP, CB);
cfg.dbeta_func(&eqn_param);
}
}
/* b = (db * mean[nb] - ds) * a * a * a * scale; */
/* c = -b * mean[nb] - db * a * scale; */
for(g = 0; g < G; g++){ /* compute b and c for each channel from group means and variance */
float gds = 0.0f;
float gdb = 0.0f;
for(j = 0; j < group_size; j++){
gds += ds[g*group_size + j]; /* Group ds and db calculation */
gdb += db[g*group_size + j];
}
for(j = 0; j < group_size; j++){
b[g*group_size + j] = (gdb * mean[np*G + g] - gds) * a[g*group_size + j] * a[g*group_size + j] * a[g*group_size + j] * scale;
c[g*group_size + j] = -b[g*group_size + j] * mean[np*G + g] - gdb * a[g*group_size + j] * scale;
}
}
for (cp = 0; cp < CP; cp++) {
arg_array[1].primary = &a[cp*CB];
arg_array[2].primary = &b[cp*CB];
arg_array[6].primary = (void*)&LIBXSMM_VLA_ACCESS(2, gamma, cp, 0, CB);
arg_array[7].primary = &c[cp*CB];
for(hwb=0; hwb < num_HW_blocks; hwb++){
arg_array[0].primary = (void*)&LIBXSMM_VLA_ACCESS(4, inp, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
arg_array[3].primary = &LIBXSMM_VLA_ACCESS(4, dout, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
eqn_param.output.primary = &LIBXSMM_VLA_ACCESS(4, din, np, cp, hwb*(HW/num_HW_blocks), 0, CP, HW, CB);
cfg.din_func(&eqn_param);
}
}
}
libxsmm_barrier_wait(cfg.barrier, ltid);
int cp;
for ( cp = thr_begin_C; cp < thr_end_C; ++cp ) {
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(2, dgamma, cp, 0, CB);
cfg.all_zero_kernel(&all_zero_param);
all_zero_param.out.primary = &LIBXSMM_VLA_ACCESS(2, dbeta, cp, 0, CB);
cfg.all_zero_kernel(&all_zero_param);
for (np=0; np < N; np++ ) {
int cb;
for(cb = 0; cb < CB; cb++){
LIBXSMM_VLA_ACCESS(2, dgamma, cp, cb, CB) += LIBXSMM_VLA_ACCESS(3, dgamma_N, np, cp, cb, CP, CB);
LIBXSMM_VLA_ACCESS(2, dbeta, cp, cb, CB) += LIBXSMM_VLA_ACCESS(3, dbeta_N, np, cp, cb, CP, CB);
}
}
}
}
libxsmm_barrier_wait(cfg.barrier, ltid);
}
|
XT_ICD_update.c | /* ===========================================================================
* Copyright (c) 2013 K. Aditya Mohan (Purdue University)
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice, this
* list of conditions and the following disclaimer in the documentation and/or
* other materials provided with the distribution.
*
* Neither the name of K. Aditya Mohan, Purdue
* University, nor the names of its contributors may be used
* to endorse or promote products derived from this software without specific
* prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
* USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*
*
* ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ */
#include "XT_Constants.h"
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include "allocate.h"
#include "randlib.h"
#include <time.h>
#include "XT_AMatrix.h"
#include "XT_Profile.h"
#include "XT_Structures.h"
#include "XT_IOMisc.h"
#include "XT_NHICD.h"
#include "omp.h"
#include "XT_MPI.h"
#include <mpi.h>
#include "XT_VoxUpdate.h"
#include "XT_ForwardProject.h"
#include "XT_MPIIO.h"
#include "XT_Debug.h"
#include "XT_OffsetError.h"
#include "XT_Prior.h"
#include "XT_Search.h"
#include "XT_PhaseRet.h"
#include "XT_CmplxArith.h"
#include "XT_CmplxProjEst.h"
#include "XT_PhaseRet.h"
#include "XT_FresnelTran.h"
#include "XT_Paganin.h"
#include "XT_ObjectInit.h"
int32_t initErrorSinogam(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr);
int updateVoxelsTimeSlices(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr, int32_t Iter, uint8_t*** Mask);
/*computes the location of (i,j,k) th element in a 1D array*/
int32_t array_loc_1D (int32_t i, int32_t j, int32_t k, int32_t N_j, int32_t N_k)
{
return (i*N_j*N_k + j*N_k + k);
}
/*converts the value 'val' to hounsfield units and returns it*/
Real_t convert2Hounsfield (Real_t val)
{
Real_t slope, c;
slope=(HOUNSFIELD_WATER_MAP-HOUNSFIELD_AIR_MAP)/(WATER_MASS_ATT_COEFF*WATER_DENSITY-AIR_MASS_ATT_COEFF*AIR_DENSITY)/HFIELD_UNIT_CONV_CONST;
c=-slope*(AIR_MASS_ATT_COEFF*AIR_DENSITY*HFIELD_UNIT_CONV_CONST);
return (slope*val + c);
}
/*computes the value of cost function. 'ErrorSino' is the error sinogram*/
Real_t computeCost(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr)
{
Real_t cost=0, temp=0, forward=0, prior=0;
Real_t Diff_delta, Diff_beta, Diff;
int32_t i,j,k,p,N_z;
bool j_minus, k_minus, i_plus, j_plus, k_plus, p_plus;
#pragma omp parallel for private(j, k, temp) reduction(+:cost)
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
temp = SinogramPtr->MagErrorSino[i][j][k]*TomoInputsPtr->ADMM_mu;
cost += temp*temp;
temp = SinogramPtr->PhaseErrorSino[i][j][k]*TomoInputsPtr->ADMM_mu;
cost += temp*temp;
}
cost /= 2.0;
/*When computing the cost of the prior term it is important to make sure that you don't include the cost of any pair of neighbors more than once. In this code, a certain sense of causality is used to compute the cost. We also assume that the weghting kernel given by 'Filter' is symmetric. Let i, j and k correspond to the three dimensions. If we go forward to i+1, then all neighbors at j-1, j, j+1, k+1, k, k-1 are to be considered. However, if for the same i, if we go forward to j+1, then all k-1, k, and k+1 should be considered. For same i and j, only the neighbor at k+1 is considred.*/
temp = 0;
N_z = ScannedObjectPtr->N_z + 2;
if (TomoInputsPtr->node_rank == TomoInputsPtr->node_num-1)
N_z = ScannedObjectPtr->N_z + 1;
#pragma omp parallel for private(Diff_delta, Diff_beta, Diff, p, j, k, j_minus, k_minus, p_plus, i_plus, j_plus, k_plus) reduction(+:temp)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (p = 1; p < ScannedObjectPtr->N_z + 1; p++)
for (j = 0; j < ScannedObjectPtr->N_y; j++)
{
for (k = 0; k < ScannedObjectPtr->N_x; k++)
{
j_minus = (j - 1 >= 0)? true : false;
k_minus = (k - 1 >= 0)? true : false;
p_plus = (p + 1 < N_z)? true : false;
i_plus = (i + 1 < ScannedObjectPtr->N_time)? true : false;
j_plus = (j + 1 < ScannedObjectPtr->N_y)? true : false;
k_plus = (k + 1 < ScannedObjectPtr->N_x)? true : false;
if(k_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j][k + 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j][k + 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][1][2] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][1][2] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
if(j_plus == true) {
if(k_minus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k - 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k - 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][0] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][0] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][1] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][1] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
if(k_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k + 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k + 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][2] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][2] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
}
if (p_plus == true)
{
if(j_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p+1][j][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p+1][j][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
if(j_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p+1][j + 1][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p+1][j + 1][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(j_minus == true)
{
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(j_plus == true)
{
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j + 1][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j + 1][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j + 1][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j + 1][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(i_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i+1][p][j][k]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i+1][p][j][k]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Time_Filter[0] * Phase_QGGMRF_Temporal_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Time_Filter[0] * Mag_QGGMRF_Temporal_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
}
}
/*Use MPI reduction operation to add the forward and prior costs from all nodes*/
MPI_Reduce(&cost, &forward, 1, MPI_REAL_DATATYPE, MPI_SUM, 0, MPI_COMM_WORLD);
MPI_Reduce(&temp, &prior, 1, MPI_REAL_DATATYPE, MPI_SUM, 0, MPI_COMM_WORLD);
if (TomoInputsPtr->node_rank == 0)
{
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Scaled error sino cost = %f\n",forward);
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Decrease in scaled error sino cost = %f\n",TomoInputsPtr->ErrorSino_Cost-forward);
TomoInputsPtr->ErrorSino_Cost = forward;
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Forward cost = %f\n",forward);
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Prior cost = %f\n",prior);
TomoInputsPtr->Forward_Cost = forward;
TomoInputsPtr->Prior_Cost = prior;
cost = forward + prior;
}
/*Broadcase the value of cost to all nodes*/
MPI_Bcast(&cost, 1, MPI_REAL_DATATYPE, 0, MPI_COMM_WORLD);
return cost;
}
/*computes the value of cost function. 'ErrorSino' is the error sinogram*/
Real_t compute_original_cost(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr)
{
Real_t cost=0,temp=0, forward=0, prior=0, Diff_delta, Diff_beta, Diff, magtemp, costemp, sintemp;
Real_t ***real, ***imag;
int32_t i,j,k,p,N_z,dimTiff[4];
bool j_minus, k_minus, i_plus, j_plus, k_plus, p_plus;
real = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
imag = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
#pragma omp parallel for private(j, k, magtemp, costemp, sintemp)
for (i = 0; i < SinogramPtr->N_p; i++)
{
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
magtemp = exp(SinogramPtr->MagErrorSino[i][j][k] - SinogramPtr->MagTomoAux[i][j][k][1] + SinogramPtr->MagTomoDual[i][j][k]);
costemp = magtemp*cos(SinogramPtr->PhaseErrorSino[i][j][k] - SinogramPtr->PhaseTomoAux[i][j][k][1] + SinogramPtr->PhaseTomoDual[i][j][k]);
sintemp = magtemp*sin(SinogramPtr->PhaseErrorSino[i][j][k] - SinogramPtr->PhaseTomoAux[i][j][k][1] + SinogramPtr->PhaseTomoDual[i][j][k]);
cmplx_mult (&(real[i][j][k]), &(imag[i][j][k]), costemp, sintemp, SinogramPtr->D_real[i][j][k], SinogramPtr->D_imag[i][j][k]);
SinogramPtr->fftforw_arr[i][j*SinogramPtr->N_t + k][0] = real[i][j][k];
SinogramPtr->fftforw_arr[i][j*SinogramPtr->N_t + k][1] = imag[i][j][k];
}
}
if (TomoInputsPtr->Write2Tiff == 1)
{
dimTiff[0] = 1; dimTiff[1] = SinogramPtr->N_p; dimTiff[2] = SinogramPtr->N_r; dimTiff[3] = SinogramPtr->N_t;
WriteMultiDimArray2Tiff ("cost_real_prefft", dimTiff, 0, 3, 1, 2, &(real[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
WriteMultiDimArray2Tiff ("cost_imag_prefft", dimTiff, 0, 3, 1, 2, &(imag[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
}
#pragma omp parallel for private(j, k, magtemp, costemp, sintemp) reduction(+:cost)
for (i = 0; i < SinogramPtr->N_p; i++)
{
compute_FresnelTran (SinogramPtr->N_r, SinogramPtr->N_t, SinogramPtr->delta_r, SinogramPtr->delta_t, SinogramPtr->fftforw_arr[i], &(SinogramPtr->fftforw_plan[i]), SinogramPtr->fftback_arr[i], &(SinogramPtr->fftback_plan[i]), SinogramPtr->Light_Wavelength, SinogramPtr->Obj2Det_Distance, SinogramPtr->Freq_Window);
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
real[i][j][k] = SinogramPtr->Measurements_real[i][j][k] - sqrt(pow(SinogramPtr->fftback_arr[i][j*SinogramPtr->N_t + k][0], 2) + pow(SinogramPtr->fftback_arr[i][j*SinogramPtr->N_t + k][1], 2));
imag[i][j][k] = 0;
/* cmplx_mult (&(costemp), &(sintemp), SinogramPtr->fftforw_arr[i][j*SinogramPtr->N_t + k][0], SinogramPtr->fftforw_arr[i][j*SinogramPtr->N_t + k][1], SinogramPtr->Omega_real[i][j][k], SinogramPtr->Omega_imag[i][j][k]);
real[i][j][k] = SinogramPtr->Measurements_real[i][j][k] - costemp;
imag[i][j][k] = SinogramPtr->Measurements_imag[i][j][k] - sintemp;*/
cost += (real[i][j][k]*real[i][j][k] + imag[i][j][k]*imag[i][j][k])*TomoInputsPtr->Weight[i][j][k];
}
}
cost /= 2.0;
if (TomoInputsPtr->Write2Tiff == 1)
{
dimTiff[0] = 1; dimTiff[1] = SinogramPtr->N_p; dimTiff[2] = SinogramPtr->N_r; dimTiff[3] = SinogramPtr->N_t;
WriteMultiDimArray2Tiff ("cost_real_postfft", dimTiff, 0, 3, 1, 2, &(real[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
WriteMultiDimArray2Tiff ("cost_imag_postfft", dimTiff, 0, 3, 1, 2, &(imag[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
}
/*When computing the cost of the prior term it is important to make sure that you don't include the cost of any pair of neighbors more than once. In this code, a certain sense of causality is used to compute the cost. We also assume that the weghting kernel given by 'Filter' is symmetric. Let i, j and k correspond to the three dimensions. If we go forward to i+1, then all neighbors at j-1, j, j+1, k+1, k, k-1 are to be considered. However, if for the same i, if we go forward to j+1, then all k-1, k, and k+1 should be considered. For same i and j, only the neighbor at k+1 is considred.*/
temp = 0;
N_z = ScannedObjectPtr->N_z + 2;
if (TomoInputsPtr->node_rank == TomoInputsPtr->node_num-1)
N_z = ScannedObjectPtr->N_z + 1;
#pragma omp parallel for private(Diff_delta, Diff_beta, Diff, p, j, k, j_minus, k_minus, p_plus, i_plus, j_plus, k_plus) reduction(+:temp)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (p = 1; p < ScannedObjectPtr->N_z + 1; p++)
for (j = 0; j < ScannedObjectPtr->N_y; j++)
{
for (k = 0; k < ScannedObjectPtr->N_x; k++)
{
j_minus = (j - 1 >= 0)? true : false;
k_minus = (k - 1 >= 0)? true : false;
p_plus = (p + 1 < N_z)? true : false;
i_plus = (i + 1 < ScannedObjectPtr->N_time)? true : false;
j_plus = (j + 1 < ScannedObjectPtr->N_y)? true : false;
k_plus = (k + 1 < ScannedObjectPtr->N_x)? true : false;
if(k_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j][k + 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j][k + 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][1][2] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][1][2] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
if(j_plus == true) {
if(k_minus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k - 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k - 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][0] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][0] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][1] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][1] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
if(k_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p][j + 1][k + 1]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p][j + 1][k + 1]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][2] * Phase_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[1][2][2] * Mag_QGGMRF_Spatial_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
}
if (p_plus == true)
{
if(j_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p+1][j][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p+1][j][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
if(j_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p+1][j + 1][k];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p+1][j + 1][k];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][1] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][1] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(j_minus == true)
{
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j - 1][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j - 1][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][0][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(j_plus == true)
{
if(k_minus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j + 1][k - 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j + 1][k - 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][0] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][0] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j + 1][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j + 1][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][2][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(k_plus == true)
{
Diff_delta = ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i][p + 1][j][k + 1];
Diff_beta = ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i][p + 1][j][k + 1];
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][2] * Phase_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Spatial_Filter[2][1][2] * Mag_QGGMRF_Spatial_Value(Diff, ScannedObjectPtr, TomoInputsPtr);
}
}
if(i_plus == true) {
Diff_delta = (ScannedObjectPtr->PhaseObject[i][p][j][k] - ScannedObjectPtr->PhaseObject[i+1][p][j][k]);
Diff_beta = (ScannedObjectPtr->MagObject[i][p][j][k] - ScannedObjectPtr->MagObject[i+1][p][j][k]);
Diff = ScannedObjectPtr->DecorrTran[0][0]*Diff_delta + ScannedObjectPtr->DecorrTran[0][1]*Diff_beta;
temp += TomoInputsPtr->Time_Filter[0] * Phase_QGGMRF_Temporal_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
Diff = ScannedObjectPtr->DecorrTran[1][0]*Diff_delta + ScannedObjectPtr->DecorrTran[1][1]*Diff_beta;
temp += TomoInputsPtr->Time_Filter[0] * Mag_QGGMRF_Temporal_Value(Diff,ScannedObjectPtr,TomoInputsPtr);
}
}
}
/*Use MPI reduction operation to add the forward and prior costs from all nodes*/
MPI_Reduce(&cost, &forward, 1, MPI_REAL_DATATYPE, MPI_SUM, 0, MPI_COMM_WORLD);
MPI_Reduce(&temp, &prior, 1, MPI_REAL_DATATYPE, MPI_SUM, 0, MPI_COMM_WORLD);
if (TomoInputsPtr->node_rank == 0)
{
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Original Forward cost = %f\n",forward);
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Original Prior cost = %f\n",prior);
cost = forward + prior;
}
multifree(real, 3);
multifree(imag, 3);
/*Broadcase the value of cost to all nodes*/
MPI_Bcast(&cost, 1, MPI_REAL_DATATYPE, 0, MPI_COMM_WORLD);
return cost;
}
/*randomly select the voxels lines which need to be updated along the x-y plane for each z-block and time slice*/
void randomly_select_x_y (ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr, uint8_t*** Mask)
{
int32_t i, j, num,n, Index, col, row, *Counter, ArraySize, block;
ArraySize = ScannedObjectPtr->N_y*ScannedObjectPtr->N_x;
Counter = (int32_t*)get_spc(ArraySize, sizeof(int32_t));
for (i=0; i<ScannedObjectPtr->N_time; i++)
for (block=0; block<TomoInputsPtr->num_z_blocks; block++)
{
ArraySize = ScannedObjectPtr->N_y*ScannedObjectPtr->N_x;
for (Index = 0; Index < ArraySize; Index++)
Counter[Index] = Index;
TomoInputsPtr->UpdateSelectNum[i][block] = 0;
for (j=0; j<ScannedObjectPtr->N_x*ScannedObjectPtr->N_y; j++){
Index = floor(random2() * ArraySize);
Index = (Index == ArraySize)?ArraySize-1:Index;
col = Counter[Index] % ScannedObjectPtr->N_x;
row = Counter[Index] / ScannedObjectPtr->N_x;
for (n = block*(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks); n < (block+1)*(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks); n++)
if (Mask[i][row][col] == 1)
{
num = TomoInputsPtr->UpdateSelectNum[i][block];
TomoInputsPtr->x_rand_select[i][block][num] = col;
TomoInputsPtr->y_rand_select[i][block][num] = row;
(TomoInputsPtr->UpdateSelectNum[i][block])++;
break;
}
Counter[Index] = Counter[ArraySize - 1];
ArraySize--;
}
}
free(Counter);
}
int do_PagPhaseRet_MBIRRecon (Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr, uint8_t*** Mask)
{
Real_arr_t ***z_real, ***z_imag, ***ProjLength; float ***Init; char object_file[100];
Real_t cost, cost_last_iter, cost_0_iter, percentage_change_in_cost;
int32_t i, j, k, dimTiff[4], Iter, flag;
int64_t size;
AMatrixCol* AMatrixPtr = (AMatrixCol*)get_spc(ScannedObjectPtr->N_time, sizeof(AMatrixCol));
uint8_t AvgNumXElements = (uint8_t)ceil(3*ScannedObjectPtr->delta_xy/SinogramPtr->delta_r);
Init = (float***)multialloc(sizeof(float), 3, ScannedObjectPtr->N_z, ScannedObjectPtr->N_y, ScannedObjectPtr->N_x);
ProjLength = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
z_real = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
z_imag = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
for (i = 0; i < ScannedObjectPtr->N_time; i++)
{
AMatrixPtr[i].values = (Real_t*)get_spc(AvgNumXElements, sizeof(Real_t));
AMatrixPtr[i].index = (int32_t*)get_spc(AvgNumXElements, sizeof(int32_t));
}
for (i = 0; i < SinogramPtr->N_p; i++)
{
printf("projection index i = %d\n", i);
/* paganins_2mat_phase_retrieval (SinogramPtr->Measurements_real[i], SinogramPtr->D_real[i], SinogramPtr->D_imag[i], ProjLength[i], z_real[i], z_imag[i], SinogramPtr->N_r, SinogramPtr->N_t, SinogramPtr->delta_r, SinogramPtr->delta_t, SinogramPtr->fftforw_arr[i], &(SinogramPtr->fftforw_plan[i]), SinogramPtr->fftback_arr[i], &(SinogramPtr->fftback_plan[i]), SinogramPtr->Light_Wavenumber, SinogramPtr->Light_Wavelength, SinogramPtr->Obj2Det_Distance, SinogramPtr->Delta_Over_Beta);*/
paganins_1mat_phase_retrieval (SinogramPtr->Measurements_real[i], SinogramPtr->D_real[i], SinogramPtr->D_imag[i], z_real[i], z_imag[i], SinogramPtr->N_r, SinogramPtr->N_t, SinogramPtr->delta_r, SinogramPtr->delta_t, SinogramPtr->fftforw_arr[i], &(SinogramPtr->fftforw_plan[i]), SinogramPtr->fftback_arr[i], &(SinogramPtr->fftback_plan[i]), SinogramPtr->Light_Wavenumber, SinogramPtr->Light_Wavelength, SinogramPtr->Obj2Det_Distance, SinogramPtr->Delta_Over_Beta);
}
if (TomoInputsPtr->Write2Tiff == 1)
{
dimTiff[0] = 1; dimTiff[1] = SinogramPtr->N_p; dimTiff[2] = SinogramPtr->N_r; dimTiff[3] = SinogramPtr->N_t;
sprintf(object_file, "%s_n%d", PAG_MAGRET_FILENAME, TomoInputsPtr->node_rank);
WriteMultiDimArray2Tiff (object_file, dimTiff, 0, 1, 2, 3, &(z_real[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(object_file, "%s_n%d", PAG_PHASERET_FILENAME, TomoInputsPtr->node_rank);
WriteMultiDimArray2Tiff (object_file, dimTiff, 0, 1, 2, 3, &(z_imag[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
}
size = SinogramPtr->N_p*SinogramPtr->N_r*SinogramPtr->N_t;
write_SharedBinFile_At (PAG_MAGRET_FILENAME, &(z_real[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
write_SharedBinFile_At (PAG_PHASERET_FILENAME, &(z_imag[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
/* Real_t real_min = z_real[0][0][0], imag_min = z_imag[0][0][0];
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
if (real_min > z_real[i][j][k])
real_min = z_real[i][j][k];
if (imag_min > z_imag[i][j][k])
imag_min = z_imag[i][j][k];
}
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
z_real[i][j][k] -= real_min;
z_imag[i][j][k] -= imag_min;
}
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Minimum real part = %f imag part = %f of phase retreived images\n", real_min, imag_min);
*/
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
SinogramPtr->MagTomoAux[i][j][k][1] = z_real[i][j][k];
SinogramPtr->PhaseTomoAux[i][j][k][1] = z_imag[i][j][k];
}
#ifdef ENABLE_TOMO_RECONS
initObject(SinogramPtr, ScannedObjectPtr, TomoInputsPtr);
initErrorSinogam(SinogramPtr, ScannedObjectPtr, TomoInputsPtr);
#ifndef NO_COST_CALCULATE
cost = computeCost(SinogramPtr,ScannedObjectPtr,TomoInputsPtr);
cost_0_iter = cost;
cost_last_iter = cost;
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "------------- Iteration 0, Cost = %f------------\n",cost);
#endif
for (Iter = 1; Iter <= TomoInputsPtr->NumIter; Iter++)
{
flag = updateVoxelsTimeSlices (SinogramPtr, ScannedObjectPtr, TomoInputsPtr, Iter, Mask);
#ifndef NO_COST_CALCULATE
cost = computeCost(SinogramPtr,ScannedObjectPtr,TomoInputsPtr);
percentage_change_in_cost = ((cost - cost_last_iter)/(cost - cost_0_iter))*100.0;
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Percentage change in cost is %f.\n", percentage_change_in_cost);
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "------------- Iteration = %d, Cost = %f ------------\n",Iter,cost);
if (cost > cost_last_iter)
check_warn(TomoInputsPtr->node_rank == 0, TomoInputsPtr->debug_file_ptr, "Cost value increased.\n");
cost_last_iter = cost;
/*if (percentage_change_in_cost < TomoInputsPtr->cost_thresh && flag != 0 && Iter > 1){*/
if (flag != 0 && Iter > 1){
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Convergence criteria is met.\n");
break;
}
#else
if (flag != 0 && Iter > 1){
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Convergence criteria is met.\n");
break;
}
#endif
flag = fflush(TomoInputsPtr->debug_file_ptr);
if (flag != 0)
check_warn(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Cannot flush buffer.\n");
}
if (TomoInputsPtr->Write2Tiff == 1)
{
for (i = 0; i < ScannedObjectPtr->N_time; i++)
{
dimTiff[0] = 1; dimTiff[1] = ScannedObjectPtr->N_z; dimTiff[2] = ScannedObjectPtr->N_y; dimTiff[3] = ScannedObjectPtr->N_x;
sprintf (object_file, "%s_n%d", PAG_MAGOBJECT_FILENAME, TomoInputsPtr->node_rank);
sprintf (object_file, "%s_time_%d", object_file, i);
WriteMultiDimArray2Tiff (object_file, dimTiff, 0, 1, 2, 3, &(ScannedObjectPtr->MagObject[i][1][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf (object_file, "%s_n%d", PAG_PHASEOBJECT_FILENAME, TomoInputsPtr->node_rank);
sprintf (object_file, "%s_time_%d", object_file, i);
WriteMultiDimArray2Tiff (object_file, dimTiff, 0, 1, 2, 3, &(ScannedObjectPtr->PhaseObject[i][1][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
}
}
size = ScannedObjectPtr->N_z*ScannedObjectPtr->N_y*ScannedObjectPtr->N_x;
write_SharedBinFile_At (PAG_MAGOBJECT_FILENAME, &(ScannedObjectPtr->MagObject[0][1][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
write_SharedBinFile_At (PAG_PHASEOBJECT_FILENAME, &(ScannedObjectPtr->PhaseObject[0][1][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
sprintf(object_file, "%s_time_%d", MAGOBJECT_FILENAME,0);
write_SharedBinFile_At (object_file, &(ScannedObjectPtr->MagObject[0][1][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
sprintf(object_file, "%s_time_%d", PHASEOBJECT_FILENAME,0);
write_SharedBinFile_At (object_file, &(ScannedObjectPtr->PhaseObject[0][1][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr);
#endif
/* for (i = 0; i < ScannedObjectPtr->N_time; i++)
{
free(AMatrixPtr[i].values);
free(AMatrixPtr[i].index);
}
free (AMatrixPtr);*/
multifree(ProjLength, 3);
multifree(Init, 3);
multifree(z_real, 3);
multifree(z_imag, 3);
return(0);
}
/*'initErrorSinogram' is used to initialize the error sinogram before start of ICD. It computes e = y - Ax - d. Ax is computed by forward projecting the object x.*/
int32_t initErrorSinogam (Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr/*, AMatrixCol* VoxelLineResponse*/)
{
Real_arr_t*** MagErrorSino = SinogramPtr->MagErrorSino;
Real_arr_t*** PhaseErrorSino = SinogramPtr->PhaseErrorSino;
Real_t pixel, magavg = 0, phaseavg = 0;
int32_t i, j, k, p, sino_idx, slice, flag = 0;
AMatrixCol* AMatrixPtr = (AMatrixCol*)get_spc(ScannedObjectPtr->N_time, sizeof(AMatrixCol));
uint8_t AvgNumXElements = (uint8_t)ceil(3*ScannedObjectPtr->delta_xy/SinogramPtr->delta_r);
/* char error_file[100];*/
for (i = 0; i < ScannedObjectPtr->N_time; i++)
{
AMatrixPtr[i].values = (Real_t*)get_spc(AvgNumXElements, sizeof(Real_t));
AMatrixPtr[i].index = (int32_t*)get_spc(AvgNumXElements, sizeof(int32_t));
}
memset(&(MagErrorSino[0][0][0]), 0, SinogramPtr->N_p*SinogramPtr->N_t*SinogramPtr->N_r*sizeof(Real_arr_t));
memset(&(PhaseErrorSino[0][0][0]), 0, SinogramPtr->N_p*SinogramPtr->N_t*SinogramPtr->N_r*sizeof(Real_arr_t));
#ifdef ENABLE_TOMO_RECONS
#pragma omp parallel for private(j, k, p, sino_idx, slice, pixel)
for (i=0; i<ScannedObjectPtr->N_time; i++)
{
for (j=0; j<ScannedObjectPtr->N_y; j++)
{
for (k=0; k<ScannedObjectPtr->N_x; k++){
for (p=0; p<ScannedObjectPtr->ProjNum[i]; p++){
sino_idx = ScannedObjectPtr->ProjIdxPtr[i][p];
calcAMatrixColumnforAngle(SinogramPtr, ScannedObjectPtr, SinogramPtr->DetectorResponse, &(AMatrixPtr[i]), j, k, sino_idx, SinogramPtr->Light_Wavenumber);
for (slice=0; slice<ScannedObjectPtr->N_z; slice++){
/* printf("count = %d, idx = %d, val = %f\n", VoxelLineResponse[slice].count, VoxelLineResponse[slice].index[0], VoxelLineResponse[slice].values[0]);*/
pixel = (ScannedObjectPtr->PhaseObject[i][slice+1][j][k]); /*slice+1 to account for extra z slices required for MPI*/
forward_project_voxel (SinogramPtr, pixel, PhaseErrorSino, &(AMatrixPtr[i])/*, &(VoxelLineResponse[slice])*/, sino_idx, slice);
pixel = (ScannedObjectPtr->MagObject[i][slice+1][j][k]); /*slice+1 to account for extra z slices required for MPI*/
forward_project_voxel (SinogramPtr, pixel, MagErrorSino, &(AMatrixPtr[i])/*, &(VoxelLineResponse[slice])*/, sino_idx, slice);
}
}
}
}
}
#endif
#pragma omp parallel for private(j, k) reduction(+:magavg,phaseavg)
for(i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
#ifndef ENABLE_TOMO_RECONS
MagErrorSino[i][j][k] = SinogramPtr->MagProj[i][j][k];
PhaseErrorSino[i][j][k] = SinogramPtr->PhaseProj[i][j][k];
#endif
magavg += MagErrorSino[i][j][k];
phaseavg += PhaseErrorSino[i][j][k];
}
magavg = magavg/(SinogramPtr->N_r*SinogramPtr->N_t*SinogramPtr->N_p);
phaseavg = phaseavg/(SinogramPtr->N_r*SinogramPtr->N_t*SinogramPtr->N_p);
check_debug(TomoInputsPtr->node_rank == 0, TomoInputsPtr->debug_file_ptr, "Average of magnitude and phase components of froward projection in node %d are %f and %f\n", TomoInputsPtr->node_rank, magavg, phaseavg);
#pragma omp parallel for private(j, k)
for(i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
SinogramPtr->MagProj[i][j][k] = SinogramPtr->MagTomoAux[i][j][k][1];
SinogramPtr->PhaseProj[i][j][k] = SinogramPtr->PhaseTomoAux[i][j][k][1];
if (TomoInputsPtr->recon_type == 2)
{
SinogramPtr->MagTomoAux[i][j][k][1] = MagErrorSino[i][j][k];
SinogramPtr->MagTomoAux[i][j][k][2] = FORWPROJ_ADD_FRACTION*magavg;
SinogramPtr->MagTomoAux[i][j][k][3] = 2*FORWPROJ_ADD_FRACTION*magavg;
if (j - 1 >= 0)
SinogramPtr->MagTomoAux[i][j][k][2] += MagErrorSino[i][j-1][k];
else
SinogramPtr->MagTomoAux[i][j][k][2] += MagErrorSino[i][j][k];
if (j + 1 < SinogramPtr->N_r)
SinogramPtr->MagTomoAux[i][j][k][3] += MagErrorSino[i][j+1][k];
else
SinogramPtr->MagTomoAux[i][j][k][3] += 2*MagErrorSino[i][j][k];
SinogramPtr->MagTomoAux[i][j][k][0] = (SinogramPtr->MagTomoAux[i][j][k][1] + SinogramPtr->MagTomoAux[i][j][k][2])/2.0;
SinogramPtr->PhaseTomoAux[i][j][k][1] = PhaseErrorSino[i][j][k];
SinogramPtr->PhaseTomoAux[i][j][k][2] = FORWPROJ_ADD_FRACTION*phaseavg;
SinogramPtr->PhaseTomoAux[i][j][k][3] = 2*FORWPROJ_ADD_FRACTION*phaseavg;
if (j - 1 >= 0)
SinogramPtr->PhaseTomoAux[i][j][k][2] += PhaseErrorSino[i][j-1][k];
else
SinogramPtr->PhaseTomoAux[i][j][k][2] += PhaseErrorSino[i][j][k];
if (j + 1 < SinogramPtr->N_r)
SinogramPtr->PhaseTomoAux[i][j][k][3] += PhaseErrorSino[i][j+1][k];
else
SinogramPtr->PhaseTomoAux[i][j][k][3] += 2*PhaseErrorSino[i][j][k];
SinogramPtr->PhaseTomoAux[i][j][k][0] = (SinogramPtr->PhaseTomoAux[i][j][k][1] + SinogramPtr->PhaseTomoAux[i][j][k][2])/2.0;
}
MagErrorSino[i][j][k] = SinogramPtr->MagTomoAux[i][j][k][1] - SinogramPtr->MagTomoDual[i][j][k] - MagErrorSino[i][j][k];
PhaseErrorSino[i][j][k] = SinogramPtr->PhaseTomoAux[i][j][k][1] - SinogramPtr->PhaseTomoDual[i][j][k] - PhaseErrorSino[i][j][k];
SinogramPtr->MagPRetAux[i][j][k] = exp(-SinogramPtr->MagTomoAux[i][j][k][1])*cos(-SinogramPtr->PhaseTomoAux[i][j][k][1]);
SinogramPtr->PhasePRetAux[i][j][k] = exp(-SinogramPtr->MagTomoAux[i][j][k][1])*sin(-SinogramPtr->PhaseTomoAux[i][j][k][1]);
SinogramPtr->MagPRetDual[i][j][k] = 0;
SinogramPtr->PhasePRetDual[i][j][k] = 0;
}
for (i = 0; i < SinogramPtr->N_p; i++)
compute_phase_projection (SinogramPtr->Measurements_real[i], SinogramPtr->Measurements_imag[i], SinogramPtr->Omega_real[i], SinogramPtr->Omega_imag[i], SinogramPtr->D_real[i], SinogramPtr->D_imag[i], SinogramPtr->MagPRetAux[i], SinogramPtr->PhasePRetAux[i], SinogramPtr->N_r, SinogramPtr->N_t, SinogramPtr->delta_r, SinogramPtr->delta_t, SinogramPtr->fftforw_arr[i], &(SinogramPtr->fftforw_plan[i]), SinogramPtr->fftback_arr[i], &(SinogramPtr->fftback_plan[i]), SinogramPtr->Light_Wavelength, SinogramPtr->Obj2Det_Distance, SinogramPtr->Freq_Window);
for (i = 0; i < ScannedObjectPtr->N_time; i++)
{
free(AMatrixPtr[i].values);
free(AMatrixPtr[i].index);
}
free (AMatrixPtr);
return (flag);
}
/*Implements mutithreaded shared memory parallelization using OpenMP and splits work among
threads. Each thread gets a certain time slice and z block to update.
Multithreading is done within the z-blocks assigned to each node.
ErrorSino - Error sinogram
Iter - Present iteration number
MagUpdateMap - Magnitude update map containing the magnitude of update of each voxel
Mask - If a certain element is true then the corresponding voxel is updated*/
int updateVoxelsTimeSlices(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr, int32_t Iter, uint8_t*** Mask)
{
Real_t AverageUpdate = 0, tempUpdate, avg_update_percentage, total_vox_mag = 0.0, vox_mag = 0.0;
int32_t xy_start, xy_end, i, j, K, block, idx, **z_start, **z_stop;
Real_t tempTotPix = 0, total_pix = 0;
long int **zero_count, total_zero_count = 0;
int32_t** thread_num = (int32_t**)multialloc(sizeof(int32_t), 2, ScannedObjectPtr->N_time, TomoInputsPtr->num_z_blocks);
MPI_Request *mag_send_reqs, *mag_recv_reqs, *phase_send_reqs, *phase_recv_reqs;
mag_send_reqs = (MPI_Request*)get_spc(ScannedObjectPtr->N_time, sizeof(MPI_Request));
mag_recv_reqs = (MPI_Request*)get_spc(ScannedObjectPtr->N_time, sizeof(MPI_Request));
phase_send_reqs = (MPI_Request*)get_spc(ScannedObjectPtr->N_time, sizeof(MPI_Request));
phase_recv_reqs = (MPI_Request*)get_spc(ScannedObjectPtr->N_time, sizeof(MPI_Request));
z_start = (int32_t**)multialloc(sizeof(int32_t), 2, ScannedObjectPtr->N_time, TomoInputsPtr->num_z_blocks);
z_stop = (int32_t**)multialloc(sizeof(int32_t), 2, ScannedObjectPtr->N_time, TomoInputsPtr->num_z_blocks);
randomly_select_x_y (ScannedObjectPtr, TomoInputsPtr, Mask);
zero_count = (long int**)multialloc(sizeof(long int), 2, ScannedObjectPtr->N_time, TomoInputsPtr->num_z_blocks);
memset(&(zero_count[0][0]), 0, ScannedObjectPtr->N_time*TomoInputsPtr->num_z_blocks*sizeof(long int));
/* K = ScannedObjectPtr->N_time*ScannedObjectPtr->N_z*ScannedObjectPtr->N_y*ScannedObjectPtr->N_x;
K = (K - total_zero_count)/(ScannedObjectPtr->gamma*K);*/
K = ScannedObjectPtr->NHICD_Iterations;
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Number of NHICD iterations is %d.\n", K);
for (j = 0; j < K; j++)
{
total_vox_mag = 0.0;
#pragma omp parallel for collapse(2) private(i, block, idx, xy_start, xy_end) reduction(+:total_vox_mag)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (block = 0; block < TomoInputsPtr->num_z_blocks; block = block + 2)
{
idx = (i % 2 == 0) ? block: block + 1;
z_start[i][idx] = idx*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks);
z_stop[i][idx] = (idx + 1)*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks) - 1;
z_stop[i][idx] = (idx >= TomoInputsPtr->num_z_blocks - 1) ? ScannedObjectPtr->N_z - 1: z_stop[i][idx];
xy_start = j*floor(TomoInputsPtr->UpdateSelectNum[i][idx]/K);
xy_end = (j + 1)*floor(TomoInputsPtr->UpdateSelectNum[i][idx]/K) - 1;
xy_end = (j == K - 1) ? TomoInputsPtr->UpdateSelectNum[i][idx] - 1: xy_end;
/* printf ("Loop 1 Start - j = %d, i = %d, idx = %d, z_start = %d, z_stop = %d, xy_start = %d, xy_end = %d\n", j, i, idx, z_start[i][idx], z_stop[i][idx], xy_start, xy_end);*/
total_vox_mag += updateVoxels (i, i, z_start[i][idx], z_stop[i][idx], xy_start, xy_end, TomoInputsPtr->x_rand_select[i][idx], TomoInputsPtr->y_rand_select[i][idx], SinogramPtr, ScannedObjectPtr, TomoInputsPtr, SinogramPtr->MagErrorSino, SinogramPtr->PhaseErrorSino, SinogramPtr->DetectorResponse, /*VoxelLineResponse,*/ Iter, &(zero_count[i][idx]), ScannedObjectPtr->UpdateMap[i][idx], Mask[i]);
thread_num[i][idx] = omp_get_thread_num();
}
/*check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Send MPI info\n");*/
MPI_Send_Recv_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 0);
/* check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "update_Sinogram_Offset: Will compute projection offset error\n");*/
MPI_Wait_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 0);
#pragma omp parallel for collapse(2) private(i, block, idx, xy_start, xy_end) reduction(+:total_vox_mag)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (block = 0; block < TomoInputsPtr->num_z_blocks; block = block + 2)
{
idx = (i % 2 == 0) ? block + 1: block;
z_start[i][idx] = idx*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks);
z_stop[i][idx] = (idx + 1)*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks) - 1;
z_stop[i][idx] = (idx >= TomoInputsPtr->num_z_blocks - 1) ? ScannedObjectPtr->N_z - 1: z_stop[i][idx];
xy_start = j*floor(TomoInputsPtr->UpdateSelectNum[i][idx]/K);
xy_end = (j + 1)*floor(TomoInputsPtr->UpdateSelectNum[i][idx]/K) - 1;
xy_end = (j == K - 1) ? TomoInputsPtr->UpdateSelectNum[i][idx] - 1: xy_end;
total_vox_mag += updateVoxels (i, i, z_start[i][idx], z_stop[i][idx], xy_start, xy_end, TomoInputsPtr->x_rand_select[i][idx], TomoInputsPtr->y_rand_select[i][idx], SinogramPtr, ScannedObjectPtr, TomoInputsPtr, SinogramPtr->MagErrorSino, SinogramPtr->PhaseErrorSino, SinogramPtr->DetectorResponse, /*VoxelLineResponse,*/ Iter, &(zero_count[i][idx]), ScannedObjectPtr->UpdateMap[i][idx], Mask[i]);
thread_num[i][idx] = omp_get_thread_num();
/* printf ("Loop 2 - i = %d, idx = %d, z_start = %d, z_stop = %d, xy_start = %d, xy_end = %d\n", i, idx, z_start[i][idx], z_stop[i][idx], xy_start, xy_end);*/
}
MPI_Send_Recv_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 1);
MPI_Wait_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 1);
VSC_based_Voxel_Line_Select(ScannedObjectPtr, TomoInputsPtr, ScannedObjectPtr->UpdateMap);
/* check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Number of NHICD voxel lines to be updated in iteration %d is %d\n", j, num_voxel_lines);*/
if (Iter > 1 && TomoInputsPtr->no_NHICD == 0)
{
#pragma omp parallel for collapse(2) private(i, block, idx)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (block = 0; block < TomoInputsPtr->num_z_blocks; block = block + 2)
{
idx = (i % 2 == 0) ? block: block + 1;
z_start[i][idx] = idx*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks);
z_stop[i][idx] = (idx + 1)*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks) - 1;
z_stop[i][idx] = (idx >= TomoInputsPtr->num_z_blocks - 1) ? ScannedObjectPtr->N_z - 1: z_stop[i][idx];
updateVoxels (i, i, z_start[i][idx], z_stop[i][idx], 0, TomoInputsPtr->NHICDSelectNum[i][idx]-1, TomoInputsPtr->x_NHICD_select[i][idx], TomoInputsPtr->y_NHICD_select[i][idx], SinogramPtr, ScannedObjectPtr, TomoInputsPtr, SinogramPtr->MagErrorSino, SinogramPtr->PhaseErrorSino, SinogramPtr->DetectorResponse, /*VoxelLineResponse,*/ Iter, &(zero_count[i][idx]), ScannedObjectPtr->UpdateMap[i][idx], Mask[i]);
thread_num[i][idx] = omp_get_thread_num();
/* printf ("Loop 1 NHICD - i = %d, idx = %d, z_start = %d, z_stop = %d\n", i, idx, z_start[i][idx], z_stop[i][idx]);*/
}
MPI_Send_Recv_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 0);
MPI_Wait_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 0);
#pragma omp parallel for collapse(2) private(i, block, idx)
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (block = 0; block < TomoInputsPtr->num_z_blocks; block = block + 2)
{
idx = (i % 2 == 0) ? block + 1: block;
z_start[i][idx] = idx*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks);
z_stop[i][idx] = (idx + 1)*floor(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks) - 1;
z_stop[i][idx] = (idx >= TomoInputsPtr->num_z_blocks - 1) ? ScannedObjectPtr->N_z - 1: z_stop[i][idx];
updateVoxels (i, i, z_start[i][idx], z_stop[i][idx], 0, TomoInputsPtr->NHICDSelectNum[i][idx]-1, TomoInputsPtr->x_NHICD_select[i][idx], TomoInputsPtr->y_NHICD_select[i][idx], SinogramPtr, ScannedObjectPtr, TomoInputsPtr, SinogramPtr->MagErrorSino, SinogramPtr->PhaseErrorSino, SinogramPtr->DetectorResponse, /*VoxelLineResponse,*/ Iter, &(zero_count[i][idx]), ScannedObjectPtr->UpdateMap[i][idx], Mask[i]);
thread_num[i][idx] = omp_get_thread_num();
/* printf ("Loop 2 NHICD - i = %d, idx = %d, z_start = %d, z_stop = %d\n", i, idx, z_start[i][idx], z_stop[i][idx]);*/
}
MPI_Send_Recv_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 1);
MPI_Wait_Z_Slices (ScannedObjectPtr, TomoInputsPtr, mag_send_reqs, phase_send_reqs, mag_recv_reqs, phase_recv_reqs, 1);
}
}
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Time Slice, Z Start, Z End - Thread : ");
total_pix = 0;
for (i=0; i<ScannedObjectPtr->N_time; i++){
for (block=0; block<TomoInputsPtr->num_z_blocks; block++){
total_pix += TomoInputsPtr->UpdateSelectNum[i][block]*(ScannedObjectPtr->N_z/TomoInputsPtr->num_z_blocks);
for (j=0; j<TomoInputsPtr->UpdateSelectNum[i][block]; j++){
AverageUpdate += ScannedObjectPtr->UpdateMap[i][block][TomoInputsPtr->y_rand_select[i][block][j]][TomoInputsPtr->x_rand_select[i][block][j]];
}
total_zero_count += zero_count[i][block];
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "%d,%d,%d-%d; ", i, z_start[i][block], z_stop[i][block], thread_num[i][block]);
}
}
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "\n");
MPI_Allreduce(&AverageUpdate, &tempUpdate, 1, MPI_REAL_DATATYPE, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(&total_pix, &tempTotPix, 1, MPI_REAL_DATATYPE, MPI_SUM, MPI_COMM_WORLD);
MPI_Allreduce(&total_vox_mag, &vox_mag, 1, MPI_REAL_DATATYPE, MPI_SUM, MPI_COMM_WORLD);
AverageUpdate = tempUpdate/(tempTotPix);
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Average voxel update over all voxels is %e, total voxels is %e.\n", AverageUpdate, tempTotPix);
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Zero count is %ld.\n", total_zero_count);
multifree(zero_count,2);
multifree(thread_num,2);
multifree(z_start,2);
multifree(z_stop,2);
free(mag_send_reqs);
free(mag_recv_reqs);
free(phase_send_reqs);
free(phase_recv_reqs);
/* multifree(offset_numerator,2);
multifree(offset_denominator,2);*/
avg_update_percentage = 100*tempUpdate/vox_mag;
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Percentage average magnitude of voxel updates is %f.\n", avg_update_percentage);
if (avg_update_percentage < TomoInputsPtr->StopThreshold)
{
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Percentage average magnitude of voxel updates is less than convergence threshold.\n");
return (1);
}
return(0);
}
/*ICD_BackProject calls the ICD optimization function repeatedly till the stopping criteria is met.*/
int ICD_BackProject(Sinogram* SinogramPtr, ScannedObject* ScannedObjectPtr, TomoInputs* TomoInputsPtr)
{
#ifndef NO_COST_CALCULATE
Real_t cost, cost_0_iter, cost_last_iter, percentage_change_in_cost = 0;
char costfile[100] = COST_FILENAME, origcostfile[100] = ORIG_COST_FILENAME, primal_filename[100], dual_filename[100];
#endif
Real_t x, y, ar, ai, orig_cost, orig_cost_last, primal_res_real = 0, dual_res_real = 0, primal_res_imag = 0, dual_res_imag = 0, sum_real, sum_imag, real_temp, imag_temp;
int32_t j, flag = 0, Iter, i, k, HeadIter = 0;
int dimTiff[4];
time_t start;
char detect_file[100] = DETECTOR_RESPONSE_FILENAME;
char MagUpdateMapFile[100] = UPDATE_MAP_FILENAME, aux_filename[100];
uint8_t ***Mask;
Real_arr_t*** omega_abs = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
Write2Bin (MAG_RECON_PRIMAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &primal_res_real, stdout);
Write2Bin (MAG_RECON_DUAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &dual_res_real, stdout);
Write2Bin (PHASE_RECON_PRIMAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &primal_res_imag, stdout);
Write2Bin (PHASE_RECON_DUAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &dual_res_imag, stdout);
for (i = 0; i < SinogramPtr->N_p; i++)
{
sprintf(primal_filename, "%s_proj_%d", PHASERET_PRIMAL_RESIDUAL_FILENAME, i);
sprintf(dual_filename, "%s_proj_%d", PHASERET_DUAL_RESIDUAL_FILENAME, i);
Write2Bin (primal_filename, 1, 1, 1, 1, sizeof(Real_t), &primal_res_real, stdout);
Write2Bin (dual_filename, 1, 1, 1, 1, sizeof(Real_t), &dual_res_real, stdout);
}
/*AMatrixCol *VoxelLineResponse;*/
#ifdef POSITIVITY_CONSTRAINT
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Enforcing positivity constraint\n");
#endif
ScannedObjectPtr->UpdateMap = (Real_arr_t****)multialloc(sizeof(Real_arr_t), 4, ScannedObjectPtr->N_time, TomoInputsPtr->num_z_blocks, ScannedObjectPtr->N_y, ScannedObjectPtr->N_x);
SinogramPtr->DetectorResponse = (Real_arr_t **)multialloc(sizeof(Real_arr_t), 2, SinogramPtr->N_p, DETECTOR_RESPONSE_BINS + 1);
SinogramPtr->MagErrorSino = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
SinogramPtr->PhaseErrorSino = (Real_arr_t***)multialloc(sizeof(Real_arr_t), 3, SinogramPtr->N_p, SinogramPtr->N_r, SinogramPtr->N_t);
Mask = (uint8_t***)multialloc(sizeof(uint8_t), 3, ScannedObjectPtr->N_time, ScannedObjectPtr->N_y, ScannedObjectPtr->N_x);
memset(&(ScannedObjectPtr->UpdateMap[0][0][0][0]), 0, ScannedObjectPtr->N_time*TomoInputsPtr->num_z_blocks*ScannedObjectPtr->N_y*ScannedObjectPtr->N_x*sizeof(Real_arr_t));
/* omp_set_num_threads(TomoInputsPtr->num_threads);*/
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Number of CPU cores is %d\n", (int)omp_get_num_procs());
/* check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "ICD_BackProject: Number of threads is %d\n", TomoInputsPtr->num_threads) ;*/
for (i = 0; i < ScannedObjectPtr->N_time; i++)
for (j = 0; j < ScannedObjectPtr->N_y; j++)
for (k = 0; k < ScannedObjectPtr->N_x; k++){
x = ScannedObjectPtr->x0 + ((Real_t)k + 0.5)*ScannedObjectPtr->delta_xy;
y = ScannedObjectPtr->y0 + ((Real_t)j + 0.5)*ScannedObjectPtr->delta_xy;
if (x*x + y*y < TomoInputsPtr->radius_obj*TomoInputsPtr->radius_obj)
Mask[i][j][k] = 1;
else
Mask[i][j][k] = 0;
}
DetectorResponseProfile (SinogramPtr, ScannedObjectPtr, TomoInputsPtr);
dimTiff[0] = 1; dimTiff[1] = 1; dimTiff[2] = SinogramPtr->N_p; dimTiff[3] = DETECTOR_RESPONSE_BINS+1;
sprintf(detect_file, "%s_n%d", detect_file, TomoInputsPtr->node_rank);
if (TomoInputsPtr->Write2Tiff == 1)
if (WriteMultiDimArray2Tiff (detect_file, dimTiff, 0, 1, 2, 3, &(SinogramPtr->DetectorResponse[0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr)) goto error;
start = time(NULL);
if (TomoInputsPtr->recon_type == 1)
{
/* gen_data_GroundTruth (SinogramPtr, ScannedObjectPtr, TomoInputsPtr);*/
do_PagPhaseRet_MBIRRecon (SinogramPtr, ScannedObjectPtr, TomoInputsPtr, Mask);
}
else if (TomoInputsPtr->recon_type == 2)
{
if (initObject(SinogramPtr, ScannedObjectPtr, TomoInputsPtr)) goto error;
if (initErrorSinogam(SinogramPtr, ScannedObjectPtr, TomoInputsPtr)) goto error;
/* if (init_minmax_object (ScannedObjectPtr, TomoInputsPtr)) goto error;*/
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Time taken to initialize object and compute error sinogram = %fmins\n", difftime(time(NULL),start)/60.0);
start=time(NULL);
#ifdef ENABLE_TOMO_RECONS
orig_cost_last = compute_original_cost(SinogramPtr, ScannedObjectPtr, TomoInputsPtr);
check_info(TomoInputsPtr->node_rank == 0, TomoInputsPtr->debug_file_ptr, "HeadIter = 0: The original cost value is %f. \n", orig_cost_last);
if (TomoInputsPtr->node_rank == 0)
Write2Bin (origcostfile, 1, 1, 1, 1, sizeof(Real_t), &orig_cost_last, TomoInputsPtr->debug_file_ptr);
#endif
for (HeadIter = 1; HeadIter <= TomoInputsPtr->Head_MaxIter; HeadIter++)
{
#ifdef ENABLE_TOMO_RECONS
#ifndef NO_COST_CALCULATE
cost = computeCost(SinogramPtr,ScannedObjectPtr,TomoInputsPtr);
cost_0_iter = cost;
cost_last_iter = cost;
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "------------- Iteration 0, Cost = %f------------\n",cost);
if (TomoInputsPtr->node_rank == 0)
Write2Bin (costfile, 1, 1, 1, 1, sizeof(Real_t), &cost, TomoInputsPtr->debug_file_ptr);
#endif /*Cost calculation endif*/
for (Iter = 1; Iter <= TomoInputsPtr->NumIter; Iter++)
{
flag = updateVoxelsTimeSlices (SinogramPtr, ScannedObjectPtr, TomoInputsPtr, Iter, Mask);
if (TomoInputsPtr->WritePerIter == 1)
if (write_ObjectProjOff2TiffBinPerIter (SinogramPtr, ScannedObjectPtr, TomoInputsPtr)) goto error;
#ifndef NO_COST_CALCULATE
cost = computeCost(SinogramPtr,ScannedObjectPtr,TomoInputsPtr);
percentage_change_in_cost = ((cost - cost_last_iter)/(cost - cost_0_iter))*100.0;
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Percentage change in cost is %f.\n", percentage_change_in_cost);
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "------------- Iteration = %d, Cost = %f, Time since start of ICD = %fmins ------------\n",Iter,cost,difftime(time(NULL),start)/60.0);
if (TomoInputsPtr->node_rank == 0)
Append2Bin (costfile, 1, 1, 1, 1, sizeof(Real_t), &cost, TomoInputsPtr->debug_file_ptr);
if (cost > cost_last_iter)
check_warn(TomoInputsPtr->node_rank == 0, TomoInputsPtr->debug_file_ptr, "Cost value increased.\n");
cost_last_iter = cost;
/*if (percentage_change_in_cost < TomoInputsPtr->cost_thresh && flag != 0 && Iter > 1){*/
if (flag != 0 && Iter > 1){
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Convergence criteria is met.\n");
break;
}
#else
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "-------------ICD_BackProject: ICD Iter = %d, time since start of ICD = %fmins------------.\n",Iter,difftime(time(NULL),start)/60.0);
if (flag != 0 && Iter > 1){
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Convergence criteria is met.\n");
break;
}
#endif
flag = fflush(TomoInputsPtr->debug_file_ptr);
if (flag != 0)
check_warn(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Cannot flush buffer.\n");
}
#endif
/* if (initErrorSinogam(SinogramPtr, ScannedObjectPtr, TomoInputsPtr)) goto error;*/
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Doing phase retrieval ....\n");
#pragma omp parallel for private(j,k)
for (i = 0; i < SinogramPtr->N_p; i++)
{
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
SinogramPtr->MagErrorSino[i][j][k] = -(SinogramPtr->MagErrorSino[i][j][k] - SinogramPtr->MagTomoAux[i][j][k][1]);
SinogramPtr->PhaseErrorSino[i][j][k] = -(SinogramPtr->PhaseErrorSino[i][j][k] - SinogramPtr->PhaseTomoAux[i][j][k][1]);
}
estimate_complex_projection (SinogramPtr->Measurements_real[i], SinogramPtr->Measurements_imag[i], SinogramPtr->Omega_real[i], SinogramPtr->Omega_imag[i], SinogramPtr->D_real[i], SinogramPtr->D_imag[i], SinogramPtr->MagTomoAux[i], SinogramPtr->PhaseTomoAux[i], TomoInputsPtr->Weight[i], SinogramPtr->MagErrorSino[i], SinogramPtr->PhaseErrorSino[i], SinogramPtr->MagPRetAux[i], SinogramPtr->PhasePRetAux[i], SinogramPtr->MagPRetDual[i], SinogramPtr->PhasePRetDual[i], SinogramPtr->N_r, SinogramPtr->N_t, SinogramPtr->delta_r, SinogramPtr->delta_t, TomoInputsPtr->NMS_rho, TomoInputsPtr->NMS_chi, TomoInputsPtr->NMS_gamma, TomoInputsPtr->NMS_sigma, TomoInputsPtr->NMS_threshold, TomoInputsPtr->NMS_MaxIter, TomoInputsPtr->SteepDes_threshold, TomoInputsPtr->SteepDes_MaxIter, TomoInputsPtr->PRet_threshold, TomoInputsPtr->PRet_MaxIter, TomoInputsPtr->ADMM_mu, TomoInputsPtr->ADMM_nu, SinogramPtr->fftforw_arr[i], &(SinogramPtr->fftforw_plan[i]), SinogramPtr->fftback_arr[i], &(SinogramPtr->fftback_plan[i]), SinogramPtr->Light_Wavelength, SinogramPtr->Obj2Det_Distance, SinogramPtr->Freq_Window, i, ScannedObjectPtr, TomoInputsPtr);
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
SinogramPtr->MagErrorSino[i][j][k] = SinogramPtr->MagTomoAux[i][j][k][1] - SinogramPtr->MagErrorSino[i][j][k];
SinogramPtr->PhaseErrorSino[i][j][k] = SinogramPtr->PhaseTomoAux[i][j][k][1] - SinogramPtr->PhaseErrorSino[i][j][k];
}
}
#ifdef ENABLE_TOMO_RECONS
primal_res_real = 0; dual_res_real = 0; primal_res_imag = 0; dual_res_imag = 0; sum_real = 0, sum_imag = 0;
#pragma omp parallel for collapse(3) private(i,j,k,ar,ai,real_temp,imag_temp) reduction(+:primal_res_real,dual_res_real,primal_res_imag,dual_res_imag,sum_real,sum_imag)
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
{
ar = SinogramPtr->MagTomoDual[i][j][k]; ai = SinogramPtr->PhaseTomoDual[i][j][k];
SinogramPtr->MagTomoDual[i][j][k] = -SinogramPtr->MagErrorSino[i][j][k];
SinogramPtr->PhaseTomoDual[i][j][k] = -SinogramPtr->PhaseErrorSino[i][j][k];
SinogramPtr->MagErrorSino[i][j][k] += ar - SinogramPtr->MagTomoDual[i][j][k];
SinogramPtr->PhaseErrorSino[i][j][k] += ai - SinogramPtr->PhaseTomoDual[i][j][k];
real_temp = SinogramPtr->MagTomoDual[i][j][k] + SinogramPtr->MagErrorSino[i][j][k];
imag_temp = SinogramPtr->PhaseTomoDual[i][j][k] + SinogramPtr->PhaseErrorSino[i][j][k];
primal_res_real += real_temp*real_temp;
primal_res_imag += imag_temp*imag_temp;
real_temp = SinogramPtr->MagTomoAux[i][j][k][1] - SinogramPtr->MagProj[i][j][k];
imag_temp = SinogramPtr->PhaseTomoAux[i][j][k][1] - SinogramPtr->PhaseProj[i][j][k];
dual_res_real += real_temp*real_temp;
dual_res_imag += imag_temp*imag_temp;
sum_real += SinogramPtr->MagTomoDual[i][j][k]*SinogramPtr->MagTomoDual[i][j][k];
sum_imag += SinogramPtr->PhaseTomoDual[i][j][k]*SinogramPtr->PhaseTomoDual[i][j][k];
SinogramPtr->MagProj[i][j][k] = SinogramPtr->MagTomoAux[i][j][k][1];
SinogramPtr->PhaseProj[i][j][k] = SinogramPtr->PhaseTomoAux[i][j][k][1];
}
dual_res_real = sqrt(dual_res_real/sum_real);
dual_res_imag = sqrt(dual_res_imag/sum_imag);
primal_res_real = sqrt(primal_res_real/(SinogramPtr->N_p*SinogramPtr->N_r*SinogramPtr->N_t));
primal_res_imag = sqrt(primal_res_imag/(SinogramPtr->N_p*SinogramPtr->N_r*SinogramPtr->N_t));
Append2Bin (MAG_RECON_PRIMAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &primal_res_real, stdout);
Append2Bin (MAG_RECON_DUAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &dual_res_real, stdout);
Append2Bin (PHASE_RECON_PRIMAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &primal_res_imag, stdout);
Append2Bin (PHASE_RECON_DUAL_RESIDUAL_FILENAME, 1, 1, 1, 1, sizeof(Real_t), &dual_res_imag, stdout);
orig_cost = compute_original_cost(SinogramPtr, ScannedObjectPtr, TomoInputsPtr);
check_info(TomoInputsPtr->node_rank == 0, TomoInputsPtr->debug_file_ptr, "HeadIter = %d: The original cost value is %f. The decrease in original cost is %f.\n", HeadIter, orig_cost, orig_cost_last - orig_cost);
if (TomoInputsPtr->node_rank == 0)
Append2Bin (origcostfile, 1, 1, 1, 1, sizeof(Real_t), &orig_cost, TomoInputsPtr->debug_file_ptr);
if (orig_cost > orig_cost_last)
check_warn(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Cost of original cost function increased!\n");
orig_cost_last = orig_cost;
check_info(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Head Iter = %d, mag primal residual = %e, mag dual residual = %e, phase primal residual = %e, phase dual residual = %e\n", HeadIter, primal_res_real, dual_res_real, primal_res_imag, dual_res_imag);
#endif
dimTiff[0] = 1; dimTiff[1] = SinogramPtr->N_p; dimTiff[2] = SinogramPtr->N_r; dimTiff[3] = SinogramPtr->N_t;
if (TomoInputsPtr->Write2Tiff == 1)
{
sprintf(aux_filename, "%s_n%d", MAGTOMOAUX_FILENAME, TomoInputsPtr->node_rank);
flag = WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->MagTomoAux[0][0][0][0]), 0, 1, 4, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", PHASETOMOAUX_FILENAME, TomoInputsPtr->node_rank);
flag |= WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->PhaseTomoAux[0][0][0][0]), 0, 1, 4, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", MAGTOMODUAL_FILENAME, TomoInputsPtr->node_rank);
flag = WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->MagTomoDual[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", PHASETOMODUAL_FILENAME, TomoInputsPtr->node_rank);
flag |= WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->PhaseTomoDual[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", MAGPRETAUX_FILENAME, TomoInputsPtr->node_rank);
flag = WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->MagPRetAux[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", PHASEPRETAUX_FILENAME, TomoInputsPtr->node_rank);
flag |= WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->PhasePRetAux[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", MAGPRETDUAL_FILENAME, TomoInputsPtr->node_rank);
flag = WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->MagPRetDual[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
sprintf(aux_filename, "%s_n%d", PHASEPRETDUAL_FILENAME, TomoInputsPtr->node_rank);
flag |= WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(SinogramPtr->PhasePRetDual[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
for (i = 0; i < SinogramPtr->N_p; i++)
for (j = 0; j < SinogramPtr->N_r; j++)
for (k = 0; k < SinogramPtr->N_t; k++)
omega_abs[i][j][k] = sqrt(SinogramPtr->Omega_real[i][j][k]*SinogramPtr->Omega_real[i][j][k] + SinogramPtr->Omega_imag[i][j][k]*SinogramPtr->Omega_imag[i][j][k]);
sprintf(aux_filename, "%s_n%d", OMEGAABS_FILENAME, TomoInputsPtr->node_rank);
flag |= WriteMultiDimArray2Tiff (aux_filename, dimTiff, 0, 1, 2, 3, &(omega_abs[0][0][0]), 0, 0, 1, TomoInputsPtr->debug_file_ptr);
}
/* if (avg_head_update < TomoInputsPtr->Head_threshold && HeadIter > 1)
break;*/
}
}
int32_t size = ScannedObjectPtr->N_time*TomoInputsPtr->num_z_blocks*ScannedObjectPtr->N_y*ScannedObjectPtr->N_x;
if (write_SharedBinFile_At (MagUpdateMapFile, &(ScannedObjectPtr->UpdateMap[0][0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
size = SinogramPtr->N_p*SinogramPtr->N_r*SinogramPtr->N_t*4;
if (write_SharedBinFile_At (MAGTOMOAUX_FILENAME, &(SinogramPtr->MagTomoAux[0][0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (PHASETOMOAUX_FILENAME, &(SinogramPtr->PhaseTomoAux[0][0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
size = SinogramPtr->N_p*SinogramPtr->N_r*SinogramPtr->N_t;
if (write_SharedBinFile_At (MAGPRETAUX_FILENAME, &(SinogramPtr->MagPRetAux[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (PHASEPRETAUX_FILENAME, &(SinogramPtr->PhasePRetAux[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (OMEGAREAL_FILENAME, &(SinogramPtr->Omega_real[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (OMEGAIMAG_FILENAME, &(SinogramPtr->Omega_imag[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (MAGTOMODUAL_FILENAME, &(SinogramPtr->MagTomoDual[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (PHASETOMODUAL_FILENAME, &(SinogramPtr->PhaseTomoDual[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (MAGPRETDUAL_FILENAME, &(SinogramPtr->MagPRetDual[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
if (write_SharedBinFile_At (PHASEPRETDUAL_FILENAME, &(SinogramPtr->PhasePRetDual[0][0][0]), TomoInputsPtr->node_rank*size, size, TomoInputsPtr->debug_file_ptr)) goto error;
multifree(SinogramPtr->MagErrorSino,3);
multifree(SinogramPtr->PhaseErrorSino,3);
multifree(SinogramPtr->DetectorResponse,2);
multifree(Mask,3);
multifree(ScannedObjectPtr->UpdateMap, 4);
multifree(omega_abs, 2);
check_debug(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Finished running ICD_BackProject.\n");
flag = fflush(TomoInputsPtr->debug_file_ptr);
if (flag != 0)
check_warn(TomoInputsPtr->node_rank==0, TomoInputsPtr->debug_file_ptr, "Cannot flush buffer.\n");
return(0);
error:
multifree(SinogramPtr->MagErrorSino,3);
multifree(SinogramPtr->PhaseErrorSino,3);
multifree(SinogramPtr->DetectorResponse,2);
multifree(Mask,3);
multifree(ScannedObjectPtr->UpdateMap, 4);
return(-1);
}
|
ocp_nlp_sqp.c | /*
* Copyright 2019 Gianluca Frison, Dimitris Kouzoupis, Robin Verschueren,
* Andrea Zanelli, Niels van Duijkeren, Jonathan Frey, Tommaso Sartor,
* Branimir Novoselnik, Rien Quirynen, Rezart Qelibari, Dang Doan,
* Jonas Koenemann, Yutao Chen, Tobias Schöls, Jonas Schlagenhauf, Moritz Diehl
*
* This file is part of acados.
*
* The 2-Clause BSD License
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.;
*/
#include "acados/ocp_nlp/ocp_nlp_sqp.h"
// external
#include <assert.h>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#if defined(ACADOS_WITH_OPENMP)
#include <omp.h>
#endif
// blasfeo
#include "blasfeo/include/blasfeo_d_aux.h"
#include "blasfeo/include/blasfeo_d_aux_ext_dep.h"
#include "blasfeo/include/blasfeo_d_blas.h"
// acados
#include "acados/ocp_nlp/ocp_nlp_common.h"
#include "acados/ocp_nlp/ocp_nlp_dynamics_cont.h"
#include "acados/ocp_nlp/ocp_nlp_reg_common.h"
#include "acados/ocp_qp/ocp_qp_common.h"
#include "acados/utils/mem.h"
#include "acados/utils/print.h"
#include "acados/utils/timing.h"
#include "acados/utils/types.h"
#include "acados_c/ocp_qp_interface.h"
/************************************************
* options
************************************************/
acados_size_t ocp_nlp_sqp_opts_calculate_size(void *config_, void *dims_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
acados_size_t size = 0;
size += sizeof(ocp_nlp_sqp_opts);
size += ocp_nlp_opts_calculate_size(config, dims);
return size;
}
void *ocp_nlp_sqp_opts_assign(void *config_, void *dims_, void *raw_memory)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
char *c_ptr = (char *) raw_memory;
ocp_nlp_sqp_opts *opts = (ocp_nlp_sqp_opts *) c_ptr;
c_ptr += sizeof(ocp_nlp_sqp_opts);
opts->nlp_opts = ocp_nlp_opts_assign(config, dims, c_ptr);
c_ptr += ocp_nlp_opts_calculate_size(config, dims);
assert((char *) raw_memory + ocp_nlp_sqp_opts_calculate_size(config, dims) >= c_ptr);
return opts;
}
void ocp_nlp_sqp_opts_initialize_default(void *config_, void *dims_, void *opts_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
ocp_qp_xcond_solver_config *qp_solver = config->qp_solver;
// int ii;
// this first !!!
ocp_nlp_opts_initialize_default(config, dims, nlp_opts);
// SQP opts
opts->max_iter = 20;
opts->tol_stat = 1e-8;
opts->tol_eq = 1e-8;
opts->tol_ineq = 1e-8;
opts->tol_comp = 1e-8;
opts->ext_qp_res = 0;
opts->qp_warm_start = 0;
opts->warm_start_first_qp = false;
opts->rti_phase = 0;
opts->print_level = 0;
opts->initialize_t_slacks = 0;
// overwrite default submodules opts
// qp tolerance
qp_solver->opts_set(qp_solver, opts->nlp_opts->qp_solver_opts, "tol_stat", &opts->tol_stat);
qp_solver->opts_set(qp_solver, opts->nlp_opts->qp_solver_opts, "tol_eq", &opts->tol_eq);
qp_solver->opts_set(qp_solver, opts->nlp_opts->qp_solver_opts, "tol_ineq", &opts->tol_ineq);
qp_solver->opts_set(qp_solver, opts->nlp_opts->qp_solver_opts, "tol_comp", &opts->tol_comp);
return;
}
void ocp_nlp_sqp_opts_update(void *config_, void *dims_, void *opts_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
ocp_nlp_opts_update(config, dims, nlp_opts);
return;
}
void ocp_nlp_sqp_opts_set(void *config_, void *opts_, const char *field, void* value)
{
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = (ocp_nlp_sqp_opts *) opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
int ii;
char module[MAX_STR_LEN];
char *ptr_module = NULL;
int module_length = 0;
// extract module name
char *char_ = strchr(field, '_');
if (char_!=NULL)
{
module_length = char_-field;
for (ii=0; ii<module_length; ii++)
module[ii] = field[ii];
module[module_length] = '\0'; // add end of string
ptr_module = module;
}
// pass options to QP module
if ( ptr_module!=NULL && (!strcmp(ptr_module, "qp")) )
{
ocp_nlp_opts_set(config, nlp_opts, field, value);
if (!strcmp(field, "qp_warm_start"))
{
int* i_ptr = (int *) value;
opts->qp_warm_start = *i_ptr;
}
}
else // nlp opts
{
if (!strcmp(field, "max_iter"))
{
int* max_iter = (int *) value;
opts->max_iter = *max_iter;
}
else if (!strcmp(field, "tol_stat"))
{
double* tol_stat = (double *) value;
opts->tol_stat = *tol_stat;
// TODO: set accuracy of the qp_solver to the minimum of current QP accuracy and the one specified.
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts, "tol_stat", value);
}
else if (!strcmp(field, "tol_eq"))
{
double* tol_eq = (double *) value;
opts->tol_eq = *tol_eq;
// TODO: set accuracy of the qp_solver to the minimum of current QP accuracy and the one specified.
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts, "tol_eq", value);
}
else if (!strcmp(field, "tol_ineq"))
{
double* tol_ineq = (double *) value;
opts->tol_ineq = *tol_ineq;
// TODO: set accuracy of the qp_solver to the minimum of current QP accuracy and the one specified.
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts, "tol_ineq", value);
}
else if (!strcmp(field, "tol_comp"))
{
double* tol_comp = (double *) value;
opts->tol_comp = *tol_comp;
// TODO: set accuracy of the qp_solver to the minimum of current QP accuracy and the one specified.
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts, "tol_comp", value);
}
else if (!strcmp(field, "ext_qp_res"))
{
int* ext_qp_res = (int *) value;
opts->ext_qp_res = *ext_qp_res;
}
else if (!strcmp(field, "warm_start_first_qp"))
{
bool* warm_start_first_qp = (bool *) value;
opts->warm_start_first_qp = *warm_start_first_qp;
}
else if (!strcmp(field, "rti_phase"))
{
int* rti_phase = (int *) value;
if (*rti_phase < 0 || *rti_phase > 0) {
printf("\nerror: ocp_nlp_sqp_opts_set: invalid value for rti_phase field.");
printf("possible values are: 0\n");
exit(1);
} else opts->rti_phase = *rti_phase;
}
else if (!strcmp(field, "print_level"))
{
int* print_level = (int *) value;
if (*print_level < 0)
{
printf("\nerror: ocp_nlp_sqp_opts_set: invalid value for print_level field, need int >=0, got %d.", *print_level);
exit(1);
}
opts->print_level = *print_level;
}
else if (!strcmp(field, "initialize_t_slacks"))
{
int* initialize_t_slacks = (int *) value;
if (*initialize_t_slacks != 0 && *initialize_t_slacks != 1)
{
printf("\nerror: ocp_nlp_sqp_opts_set: invalid value for initialize_t_slacks field, need int 0 or 1, got %d.", *initialize_t_slacks);
exit(1);
}
opts->initialize_t_slacks = *initialize_t_slacks;
}
else
{
ocp_nlp_opts_set(config, nlp_opts, field, value);
}
}
return;
}
void ocp_nlp_sqp_opts_set_at_stage(void *config_, void *opts_, size_t stage, const char *field, void* value)
{
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = (ocp_nlp_sqp_opts *) opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
ocp_nlp_opts_set_at_stage(config, nlp_opts, stage, field, value);
return;
}
/************************************************
* memory
************************************************/
acados_size_t ocp_nlp_sqp_memory_calculate_size(void *config_, void *dims_, void *opts_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
// int N = dims->N;
// int *nx = dims->nx;
// int *nu = dims->nu;
// int *nz = dims->nz;
acados_size_t size = 0;
size += sizeof(ocp_nlp_sqp_memory);
// nlp mem
size += ocp_nlp_memory_calculate_size(config, dims, nlp_opts);
// stat
int stat_m = opts->max_iter+1;
int stat_n = 6;
if (opts->ext_qp_res)
stat_n += 4;
size += stat_n*stat_m*sizeof(double);
size += 3*8; // align
make_int_multiple_of(8, &size);
return size;
}
void *ocp_nlp_sqp_memory_assign(void *config_, void *dims_, void *opts_, void *raw_memory)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
// ocp_qp_xcond_solver_config *qp_solver = config->qp_solver;
// ocp_nlp_dynamics_config **dynamics = config->dynamics;
// ocp_nlp_cost_config **cost = config->cost;
// ocp_nlp_constraints_config **constraints = config->constraints;
char *c_ptr = (char *) raw_memory;
// int N = dims->N;
// int *nx = dims->nx;
// int *nu = dims->nu;
// int *nz = dims->nz;
// initial align
align_char_to(8, &c_ptr);
ocp_nlp_sqp_memory *mem = (ocp_nlp_sqp_memory *) c_ptr;
c_ptr += sizeof(ocp_nlp_sqp_memory);
align_char_to(8, &c_ptr);
// nlp mem
mem->nlp_mem = ocp_nlp_memory_assign(config, dims, nlp_opts, c_ptr);
c_ptr += ocp_nlp_memory_calculate_size(config, dims, nlp_opts);
// stat
mem->stat = (double *) c_ptr;
mem->stat_m = opts->max_iter+1;
mem->stat_n = 6;
if (opts->ext_qp_res)
mem->stat_n += 4;
c_ptr += mem->stat_m*mem->stat_n*sizeof(double);
mem->status = ACADOS_READY;
align_char_to(8, &c_ptr);
assert((char *) raw_memory + ocp_nlp_sqp_memory_calculate_size(config, dims, opts) >= c_ptr);
return mem;
}
/************************************************
* workspace
************************************************/
acados_size_t ocp_nlp_sqp_workspace_calculate_size(void *config_, void *dims_, void *opts_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
acados_size_t size = 0;
// sqp
size += sizeof(ocp_nlp_sqp_workspace);
// nlp
size += ocp_nlp_workspace_calculate_size(config, dims, nlp_opts);
// tmp qp in
size += ocp_qp_in_calculate_size(dims->qp_solver->orig_dims);
// tmp qp out
size += ocp_qp_out_calculate_size(dims->qp_solver->orig_dims);
if (opts->ext_qp_res)
{
// qp res
size += ocp_qp_res_calculate_size(dims->qp_solver->orig_dims);
// qp res ws
size += ocp_qp_res_workspace_calculate_size(dims->qp_solver->orig_dims);
}
return size;
}
static void ocp_nlp_sqp_cast_workspace(ocp_nlp_config *config, ocp_nlp_dims *dims,
ocp_nlp_sqp_opts *opts, ocp_nlp_sqp_memory *mem, ocp_nlp_sqp_workspace *work)
{
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
ocp_nlp_memory *nlp_mem = mem->nlp_mem;
// sqp
char *c_ptr = (char *) work;
c_ptr += sizeof(ocp_nlp_sqp_workspace);
// nlp
work->nlp_work = ocp_nlp_workspace_assign(config, dims, nlp_opts, nlp_mem, c_ptr);
c_ptr += ocp_nlp_workspace_calculate_size(config, dims, nlp_opts);
// tmp qp in
work->tmp_qp_in = ocp_qp_in_assign(dims->qp_solver->orig_dims, c_ptr);
c_ptr += ocp_qp_in_calculate_size(dims->qp_solver->orig_dims);
// tmp qp out
work->tmp_qp_out = ocp_qp_out_assign(dims->qp_solver->orig_dims, c_ptr);
c_ptr += ocp_qp_out_calculate_size(dims->qp_solver->orig_dims);
if (opts->ext_qp_res)
{
// qp res
work->qp_res = ocp_qp_res_assign(dims->qp_solver->orig_dims, c_ptr);
c_ptr += ocp_qp_res_calculate_size(dims->qp_solver->orig_dims);
// qp res ws
work->qp_res_ws = ocp_qp_res_workspace_assign(dims->qp_solver->orig_dims, c_ptr);
c_ptr += ocp_qp_res_workspace_calculate_size(dims->qp_solver->orig_dims);
}
assert((char *) work + ocp_nlp_sqp_workspace_calculate_size(config, dims, opts) >= c_ptr);
return;
}
/************************************************
* functions
************************************************/
int ocp_nlp_sqp(void *config_, void *dims_, void *nlp_in_, void *nlp_out_,
void *opts_, void *mem_, void *work_)
{
acados_timer timer0, timer1;
acados_tic(&timer0);
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_opts *nlp_opts = opts->nlp_opts;
ocp_nlp_sqp_memory *mem = mem_;
ocp_nlp_in *nlp_in = nlp_in_;
ocp_nlp_out *nlp_out = nlp_out_;
ocp_nlp_memory *nlp_mem = mem->nlp_mem;
ocp_qp_xcond_solver_config *qp_solver = config->qp_solver;
ocp_nlp_sqp_workspace *work = work_;
ocp_nlp_sqp_cast_workspace(config, dims, opts, mem, work);
ocp_nlp_workspace *nlp_work = work->nlp_work;
// zero timers
double total_time = 0.0;
double tmp_time;
mem->time_qp_sol = 0.0;
mem->time_qp_solver_call = 0.0;
mem->time_qp_xcond = 0.0;
mem->time_lin = 0.0;
mem->time_reg = 0.0;
mem->time_tot = 0.0;
mem->time_glob = 0.0;
int N = dims->N;
int ii;
int qp_iter = 0;
int qp_status = 0;
#if defined(ACADOS_WITH_OPENMP)
// backup number of threads
int num_threads_bkp = omp_get_num_threads();
// set number of threads
omp_set_num_threads(opts->nlp_opts->num_threads);
#pragma omp parallel
{ // beginning of parallel region
#endif
// alias to dynamics_memory
#if defined(ACADOS_WITH_OPENMP)
#pragma omp for
#endif
for (ii = 0; ii < N; ii++)
{
config->dynamics[ii]->memory_set_ux_ptr(nlp_out->ux+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_tmp_ux_ptr(nlp_work->tmp_nlp_out->ux+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_ux1_ptr(nlp_out->ux+ii+1, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_tmp_ux1_ptr(nlp_work->tmp_nlp_out->ux+ii+1, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_pi_ptr(nlp_out->pi+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_tmp_pi_ptr(nlp_work->tmp_nlp_out->pi+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_BAbt_ptr(nlp_mem->qp_in->BAbt+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_RSQrq_ptr(nlp_mem->qp_in->RSQrq+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_dzduxt_ptr(nlp_mem->dzduxt+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_sim_guess_ptr(nlp_mem->sim_guess+ii, nlp_mem->set_sim_guess+ii, nlp_mem->dynamics[ii]);
config->dynamics[ii]->memory_set_z_alg_ptr(nlp_mem->z_alg+ii, nlp_mem->dynamics[ii]);
}
// alias to cost_memory
#if defined(ACADOS_WITH_OPENMP)
#pragma omp for
#endif
for (ii = 0; ii <= N; ii++)
{
config->cost[ii]->memory_set_ux_ptr(nlp_out->ux+ii, nlp_mem->cost[ii]);
config->cost[ii]->memory_set_tmp_ux_ptr(nlp_work->tmp_nlp_out->ux+ii, nlp_mem->cost[ii]);
config->cost[ii]->memory_set_z_alg_ptr(nlp_mem->z_alg+ii, nlp_mem->cost[ii]);
config->cost[ii]->memory_set_dzdux_tran_ptr(nlp_mem->dzduxt+ii, nlp_mem->cost[ii]);
config->cost[ii]->memory_set_RSQrq_ptr(nlp_mem->qp_in->RSQrq+ii, nlp_mem->cost[ii]);
config->cost[ii]->memory_set_Z_ptr(nlp_mem->qp_in->Z+ii, nlp_mem->cost[ii]);
}
// alias to constraints_memory
#if defined(ACADOS_WITH_OPENMP)
#pragma omp for
#endif
for (ii = 0; ii <= N; ii++)
{
config->constraints[ii]->memory_set_ux_ptr(nlp_out->ux+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_tmp_ux_ptr(nlp_work->tmp_nlp_out->ux+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_lam_ptr(nlp_out->lam+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_tmp_lam_ptr(nlp_work->tmp_nlp_out->lam+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_z_alg_ptr(nlp_mem->z_alg+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_dzdux_tran_ptr(nlp_mem->dzduxt+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_DCt_ptr(nlp_mem->qp_in->DCt+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_RSQrq_ptr(nlp_mem->qp_in->RSQrq+ii, nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_idxb_ptr(nlp_mem->qp_in->idxb[ii], nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_idxs_rev_ptr(nlp_mem->qp_in->idxs_rev[ii], nlp_mem->constraints[ii]);
config->constraints[ii]->memory_set_idxe_ptr(nlp_mem->qp_in->idxe[ii], nlp_mem->constraints[ii]);
}
// alias to regularize memory
config->regularize->memory_set_RSQrq_ptr(dims->regularize, nlp_mem->qp_in->RSQrq, nlp_mem->regularize_mem);
config->regularize->memory_set_rq_ptr(dims->regularize, nlp_mem->qp_in->rqz, nlp_mem->regularize_mem);
config->regularize->memory_set_BAbt_ptr(dims->regularize, nlp_mem->qp_in->BAbt, nlp_mem->regularize_mem);
config->regularize->memory_set_b_ptr(dims->regularize, nlp_mem->qp_in->b, nlp_mem->regularize_mem);
config->regularize->memory_set_idxb_ptr(dims->regularize, nlp_mem->qp_in->idxb, nlp_mem->regularize_mem);
config->regularize->memory_set_DCt_ptr(dims->regularize, nlp_mem->qp_in->DCt, nlp_mem->regularize_mem);
config->regularize->memory_set_ux_ptr(dims->regularize, nlp_mem->qp_out->ux, nlp_mem->regularize_mem);
config->regularize->memory_set_pi_ptr(dims->regularize, nlp_mem->qp_out->pi, nlp_mem->regularize_mem);
config->regularize->memory_set_lam_ptr(dims->regularize, nlp_mem->qp_out->lam, nlp_mem->regularize_mem);
// copy sampling times into dynamics model
#if defined(ACADOS_WITH_OPENMP)
#pragma omp for
#endif
// NOTE(oj): this will lead in an error for irk_gnsf, T must be set in precompute;
// -> remove here and make sure precompute is called everywhere.
for (ii = 0; ii < N; ii++)
{
config->dynamics[ii]->model_set(config->dynamics[ii], dims->dynamics[ii],
nlp_in->dynamics[ii], "T", nlp_in->Ts+ii);
}
#if defined(ACADOS_WITH_OPENMP)
} // end of parallel region
#endif
//
if (opts->initialize_t_slacks > 0)
ocp_nlp_initialize_t_slacks(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work);
// initialize QP
ocp_nlp_initialize_qp(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work);
// main sqp loop
int sqp_iter = 0;
nlp_mem->sqp_iter = &sqp_iter;
for (; sqp_iter < opts->max_iter; sqp_iter++)
{
// linearizate NLP and update QP matrices
acados_tic(&timer1);
ocp_nlp_approximate_qp_matrices(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work);
mem->time_lin += acados_toc(&timer1);
// update QP rhs for SQP (step prim var, abs dual var)
ocp_nlp_approximate_qp_vectors_sqp(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work);
// compute nlp residuals
ocp_nlp_res_compute(dims, nlp_in, nlp_out, nlp_mem->nlp_res, nlp_mem);
nlp_out->inf_norm_res = nlp_mem->nlp_res->inf_norm_res_stat;
nlp_out->inf_norm_res = (nlp_mem->nlp_res->inf_norm_res_eq > nlp_out->inf_norm_res) ?
nlp_mem->nlp_res->inf_norm_res_eq :
nlp_out->inf_norm_res;
nlp_out->inf_norm_res = (nlp_mem->nlp_res->inf_norm_res_ineq > nlp_out->inf_norm_res) ?
nlp_mem->nlp_res->inf_norm_res_ineq :
nlp_out->inf_norm_res;
nlp_out->inf_norm_res = (nlp_mem->nlp_res->inf_norm_res_comp > nlp_out->inf_norm_res) ?
nlp_mem->nlp_res->inf_norm_res_comp :
nlp_out->inf_norm_res;
if (opts->print_level > sqp_iter + 1)
print_ocp_qp_in(nlp_mem->qp_in);
// save statistics
if (sqp_iter < mem->stat_m)
{
mem->stat[mem->stat_n*sqp_iter+0] = nlp_mem->nlp_res->inf_norm_res_stat;
mem->stat[mem->stat_n*sqp_iter+1] = nlp_mem->nlp_res->inf_norm_res_eq;
mem->stat[mem->stat_n*sqp_iter+2] = nlp_mem->nlp_res->inf_norm_res_ineq;
mem->stat[mem->stat_n*sqp_iter+3] = nlp_mem->nlp_res->inf_norm_res_comp;
}
// exit conditions on residuals
if ((nlp_mem->nlp_res->inf_norm_res_stat < opts->tol_stat) &
(nlp_mem->nlp_res->inf_norm_res_eq < opts->tol_eq) &
(nlp_mem->nlp_res->inf_norm_res_ineq < opts->tol_ineq) &
(nlp_mem->nlp_res->inf_norm_res_comp < opts->tol_comp))
{
// save sqp iterations number
mem->sqp_iter = sqp_iter;
nlp_out->sqp_iter = sqp_iter;
// stop timer
total_time += acados_toc(&timer0);
// save time
nlp_out->total_time = total_time;
mem->time_tot = total_time;
#if defined(ACADOS_WITH_OPENMP)
// restore number of threads
omp_set_num_threads(num_threads_bkp);
#endif
mem->status = ACADOS_SUCCESS;
if (opts->print_level > 0)
{
printf("%i\t%e\t%e\t%e\t%e.\n", sqp_iter, nlp_mem->nlp_res->inf_norm_res_stat,
nlp_mem->nlp_res->inf_norm_res_eq, nlp_mem->nlp_res->inf_norm_res_ineq,
nlp_mem->nlp_res->inf_norm_res_comp );
printf("\n\n");
}
return mem->status;
}
// regularize Hessian
acados_tic(&timer1);
config->regularize->regularize_hessian(config->regularize, dims->regularize,
opts->nlp_opts->regularize, nlp_mem->regularize_mem);
mem->time_reg += acados_toc(&timer1);
// (typically) no warm start at first iteration
if (sqp_iter == 0 && !opts->warm_start_first_qp)
{
int tmp_int = 0;
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts,
"warm_start", &tmp_int);
}
// solve qp
acados_tic(&timer1);
qp_status = qp_solver->evaluate(qp_solver, dims->qp_solver, nlp_mem->qp_in, nlp_mem->qp_out,
opts->nlp_opts->qp_solver_opts, nlp_mem->qp_solver_mem, nlp_work->qp_work);
mem->time_qp_sol += acados_toc(&timer1);
qp_solver->memory_get(qp_solver, nlp_mem->qp_solver_mem, "time_qp_solver_call", &tmp_time);
mem->time_qp_solver_call += tmp_time;
qp_solver->memory_get(qp_solver, nlp_mem->qp_solver_mem, "time_qp_xcond", &tmp_time);
mem->time_qp_xcond += tmp_time;
// compute correct dual solution in case of Hessian regularization
acados_tic(&timer1);
config->regularize->correct_dual_sol(config->regularize, dims->regularize,
opts->nlp_opts->regularize, nlp_mem->regularize_mem);
mem->time_reg += acados_toc(&timer1);
// restore default warm start
if (sqp_iter==0)
{
config->qp_solver->opts_set(config->qp_solver, opts->nlp_opts->qp_solver_opts,
"warm_start", &opts->qp_warm_start);
}
// TODO move into QP solver memory ???
qp_info *qp_info_;
ocp_qp_out_get(nlp_mem->qp_out, "qp_info", &qp_info_);
nlp_out->qp_iter = qp_info_->num_iter;
// printf("\nqp_iter = %d, sqp_iter = %d, max_sqp_iter = %d\n", nlp_out->qp_iter, sqp_iter, opts->max_iter);
qp_iter = qp_info_->num_iter;
// save statistics of last qp solver call
if (sqp_iter+1 < mem->stat_m)
{
mem->stat[mem->stat_n*(sqp_iter+1)+4] = qp_status;
mem->stat[mem->stat_n*(sqp_iter+1)+5] = qp_iter;
}
// compute external QP residuals (for debugging)
if (opts->ext_qp_res)
{
ocp_qp_res_compute(nlp_mem->qp_in, nlp_mem->qp_out, work->qp_res, work->qp_res_ws);
if (sqp_iter+1 < mem->stat_m)
ocp_qp_res_compute_nrm_inf(work->qp_res, mem->stat+(mem->stat_n*(sqp_iter+1)+6));
}
if ((qp_status!=ACADOS_SUCCESS) & (qp_status!=ACADOS_MAXITER))
{
// print_ocp_qp_in(nlp_mem->qp_in);
if (opts->print_level > 0)
{
printf("%i\t%e\t%e\t%e\t%e.\n", sqp_iter, nlp_mem->nlp_res->inf_norm_res_stat,
nlp_mem->nlp_res->inf_norm_res_eq, nlp_mem->nlp_res->inf_norm_res_ineq,
nlp_mem->nlp_res->inf_norm_res_comp );
printf("\n\n");
}
// increment sqp_iter to return full statistics and improve output below.
sqp_iter++;
// save sqp iterations number
mem->sqp_iter = sqp_iter;
nlp_out->sqp_iter = sqp_iter;
// stop timer
total_time += acados_toc(&timer0);
// save time
mem->time_tot = total_time;
nlp_out->total_time = total_time;
#ifndef ACADOS_SILENT
printf("\nQP solver returned error status %d in SQP iteration %d, QP iteration %d.\n",
qp_status, sqp_iter, qp_iter);
#endif
#if defined(ACADOS_WITH_OPENMP)
// restore number of threads
omp_set_num_threads(num_threads_bkp);
#endif
if (opts->print_level > 1)
{
printf("\n Failed to solve the following QP:\n");
if (opts->print_level > sqp_iter + 1)
print_ocp_qp_in(nlp_mem->qp_in);
}
mem->status = ACADOS_QP_FAILURE;
return mem->status;
}
// globalization
acados_tic(&timer1);
double alpha = ocp_nlp_line_search(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work);
mem->time_glob += acados_toc(&timer1);
// update variables
ocp_nlp_update_variables_sqp(config, dims, nlp_in, nlp_out, nlp_opts, nlp_mem, nlp_work, alpha);
// ocp_nlp_dims_print(nlp_out->dims);
// ocp_nlp_out_print(nlp_out);
// exit(1);
// ??? @rien
// for (int_t i = 0; i < N; i++)
// {
// ocp_nlp_dynamics_opts *dynamics_opts = opts->dynamics[i];
// sim_opts *opts = dynamics_opts->sim_solver;
// if (opts->scheme == NULL)
// continue;
// opts->sens_adj = (opts->scheme->type != exact);
// if (nlp_in->freezeSens) {
// // freeze inexact sensitivities after first SQP iteration !!
// opts->scheme->freeze = true;
// }
// }
if (opts->print_level > 0)
{
if (sqp_iter%10 == 0)
{
printf("# it\tstat\t\teq\t\tineq\t\tcomp\n");
}
printf("%i\t%e\t%e\t%e\t%e.\n", sqp_iter, nlp_mem->nlp_res->inf_norm_res_stat,
nlp_mem->nlp_res->inf_norm_res_eq, nlp_mem->nlp_res->inf_norm_res_ineq, nlp_mem->nlp_res->inf_norm_res_comp );
}
}
// stop timer
total_time += acados_toc(&timer0);
if (opts->print_level > 0)
printf("\n\n");
// ocp_nlp_out_print(nlp_out);
// save sqp iterations number
mem->sqp_iter = sqp_iter;
nlp_out->sqp_iter = sqp_iter;
// save time
mem->time_tot = total_time;
nlp_out->total_time = total_time;
// maximum number of iterations reached
#if defined(ACADOS_WITH_OPENMP)
// restore number of threads
omp_set_num_threads(num_threads_bkp);
#endif
mem->status = ACADOS_MAXITER;
#ifndef ACADOS_SILENT
printf("\n ocp_nlp_sqp: maximum iterations reached\n");
#endif
return mem->status;
}
int ocp_nlp_sqp_precompute(void *config_, void *dims_, void *nlp_in_, void *nlp_out_,
void *opts_, void *mem_, void *work_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_sqp_memory *mem = mem_;
ocp_nlp_in *nlp_in = nlp_in_;
// ocp_nlp_out *nlp_out = nlp_out_;
ocp_nlp_memory *nlp_mem = mem->nlp_mem;
ocp_nlp_sqp_workspace *work = work_;
ocp_nlp_sqp_cast_workspace(config, dims, opts, mem, work);
ocp_nlp_workspace *nlp_work = work->nlp_work;
int N = dims->N;
int status = ACADOS_SUCCESS;
int ii;
// TODO(all) add flag to enable/disable checks
for (ii = 0; ii <= N; ii++)
{
int module_val;
config->constraints[ii]->dims_get(config->constraints[ii], dims->constraints[ii], "ns", &module_val);
if (dims->ns[ii] != module_val)
{
printf("ocp_nlp_sqp_precompute: inconsistent dimension ns for stage %d with constraint module, got %d, module: %d.",
ii, dims->ns[ii], module_val);
exit(1);
}
}
// precompute
for (ii = 0; ii < N; ii++)
{
// set T
config->dynamics[ii]->model_set(config->dynamics[ii], dims->dynamics[ii],
nlp_in->dynamics[ii], "T", nlp_in->Ts+ii);
// dynamics precompute
status = config->dynamics[ii]->precompute(config->dynamics[ii], dims->dynamics[ii],
nlp_in->dynamics[ii], opts->nlp_opts->dynamics[ii],
nlp_mem->dynamics[ii], nlp_work->dynamics[ii]);
if (status != ACADOS_SUCCESS)
return status;
}
return status;
}
void ocp_nlp_sqp_eval_param_sens(void *config_, void *dims_, void *opts_, void *mem_, void *work_,
char *field, int stage, int index, void *sens_nlp_out_)
{
ocp_nlp_dims *dims = dims_;
ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
ocp_nlp_sqp_memory *mem = mem_;
ocp_nlp_memory *nlp_mem = mem->nlp_mem;
ocp_nlp_out *sens_nlp_out = sens_nlp_out_;
ocp_nlp_sqp_workspace *work = work_;
ocp_nlp_sqp_cast_workspace(config, dims, opts, mem, work);
ocp_nlp_workspace *nlp_work = work->nlp_work;
d_ocp_qp_copy_all(nlp_mem->qp_in, work->tmp_qp_in);
d_ocp_qp_set_rhs_zero(work->tmp_qp_in);
double one = 1.0;
if ((!strcmp("ex", field)) & (stage==0))
{
d_ocp_qp_set_el("lbx", stage, index, &one, work->tmp_qp_in);
d_ocp_qp_set_el("ubx", stage, index, &one, work->tmp_qp_in);
// d_ocp_qp_print(work->tmp_qp_in->dim, work->tmp_qp_in);
config->qp_solver->eval_sens(config->qp_solver, dims->qp_solver, work->tmp_qp_in, work->tmp_qp_out,
opts->nlp_opts->qp_solver_opts, nlp_mem->qp_solver_mem, nlp_work->qp_work);
// d_ocp_qp_sol_print(work->tmp_qp_out->dim, work->tmp_qp_out);
// exit(1);
/* copy tmp_qp_out into sens_nlp_out */
int i;
int N = dims->N;
int *nv = dims->nv;
int *nx = dims->nx;
// int *nu = dims->nu;
int *ni = dims->ni;
// int *nz = dims->nz;
for (i = 0; i <= N; i++)
{
blasfeo_dveccp(nv[i], work->tmp_qp_out->ux + i, 0, sens_nlp_out->ux + i, 0);
if (i < N)
blasfeo_dveccp(nx[i + 1], work->tmp_qp_out->pi + i, 0, sens_nlp_out->pi + i, 0);
blasfeo_dveccp(2 * ni[i], work->tmp_qp_out->lam + i, 0, sens_nlp_out->lam + i, 0);
blasfeo_dveccp(2 * ni[i], work->tmp_qp_out->t + i, 0, sens_nlp_out->t + i, 0);
}
}
else
{
printf("\nerror: field %s at stage %d not available in ocp_nlp_sqp_eval_param_sens\n", field, stage);
exit(1);
}
return;
}
// TODO rename memory_get ???
void ocp_nlp_sqp_get(void *config_, void *dims_, void *mem_, const char *field, void *return_value_)
{
ocp_nlp_config *config = config_;
ocp_nlp_dims *dims = dims_;
ocp_nlp_sqp_memory *mem = mem_;
if (!strcmp("sqp_iter", field))
{
int *value = return_value_;
*value = mem->sqp_iter;
}
else if (!strcmp("status", field))
{
int *value = return_value_;
*value = mem->status;
}
else if (!strcmp("time_tot", field) || !strcmp("tot_time", field))
{
double *value = return_value_;
*value = mem->time_tot;
}
else if (!strcmp("time_qp_sol", field) || !strcmp("time_qp", field))
{
double *value = return_value_;
*value = mem->time_qp_sol;
}
else if (!strcmp("time_qp_solver", field) || !strcmp("time_qp_solver_call", field))
{
double *value = return_value_;
*value = mem->time_qp_solver_call;
}
else if (!strcmp("time_qp_xcond", field))
{
double *value = return_value_;
*value = mem->time_qp_xcond;
}
else if (!strcmp("time_lin", field))
{
double *value = return_value_;
*value = mem->time_lin;
}
else if (!strcmp("time_reg", field))
{
double *value = return_value_;
*value = mem->time_reg;
}
else if (!strcmp("time_glob", field))
{
double *value = return_value_;
*value = mem->time_glob;
}
else if (!strcmp("time_sim", field) || !strcmp("time_sim_ad", field) || !strcmp("time_sim_la", field))
{
double tmp = 0.0;
double *ptr = return_value_;
int N = dims->N;
int ii;
for (ii=0; ii<N; ii++)
{
config->dynamics[ii]->memory_get(config->dynamics[ii], dims->dynamics[ii], mem->nlp_mem->dynamics[ii], field, &tmp);
*ptr += tmp;
}
}
else if (!strcmp("stat", field))
{
double **value = return_value_;
*value = mem->stat;
}
else if (!strcmp("statistics", field))
{
int n_row = mem->stat_m<mem->sqp_iter+1 ? mem->stat_m : mem->sqp_iter+1;
double *value = return_value_;
for (int ii=0; ii<n_row; ii++)
{
value[ii+0] = ii;
for (int jj=0; jj<mem->stat_n; jj++)
value[ii+(jj+1)*n_row] = mem->stat[jj+ii*mem->stat_n];
}
}
else if (!strcmp("stat_m", field))
{
int *value = return_value_;
*value = mem->stat_m;
}
else if (!strcmp("stat_n", field))
{
int *value = return_value_;
*value = mem->stat_n;
}
else if (!strcmp("nlp_mem", field))
{
void **value = return_value_;
*value = mem->nlp_mem;
}
else if (!strcmp("qp_xcond_dims", field))
{
void **value = return_value_;
*value = dims->qp_solver->xcond_dims;
}
else if (!strcmp("nlp_res", field))
{
ocp_nlp_res **value = return_value_;
*value = mem->nlp_mem->nlp_res;
}
else if (!strcmp("qp_xcond_in", field))
{
void **value = return_value_;
*value = mem->nlp_mem->qp_solver_mem->xcond_qp_in;
}
else if (!strcmp("qp_xcond_out", field))
{
void **value = return_value_;
*value = mem->nlp_mem->qp_solver_mem->xcond_qp_out;
}
else if (!strcmp("qp_in", field))
{
void **value = return_value_;
*value = mem->nlp_mem->qp_in;
}
else if (!strcmp("qp_out", field))
{
void **value = return_value_;
*value = mem->nlp_mem->qp_out;
}
else if (!strcmp("qp_iter", field))
{
config->qp_solver->memory_get(config->qp_solver,
mem->nlp_mem->qp_solver_mem, "iter", return_value_);
}
else if (!strcmp("res_stat", field))
{
double *value = return_value_;
*value = mem->nlp_mem->nlp_res->inf_norm_res_stat;
}
else if (!strcmp("res_eq", field))
{
double *value = return_value_;
*value = mem->nlp_mem->nlp_res->inf_norm_res_eq;
}
else if (!strcmp("res_ineq", field))
{
double *value = return_value_;
*value = mem->nlp_mem->nlp_res->inf_norm_res_ineq;
}
else if (!strcmp("res_comp", field))
{
double *value = return_value_;
*value = mem->nlp_mem->nlp_res->inf_norm_res_comp;
}
else if (!strcmp("cost_value", field))
{
double *value = return_value_;
*value = mem->nlp_mem->cost_value;
}
else
{
printf("\nerror: field %s not available in ocp_nlp_sqp_get\n", field);
exit(1);
}
}
void ocp_nlp_sqp_opts_get(void *config_, void *dims_, void *opts_,
const char *field, void *return_value_)
{
// ocp_nlp_config *config = config_;
ocp_nlp_sqp_opts *opts = opts_;
if (!strcmp("nlp_opts", field))
{
void **value = return_value_;
*value = opts->nlp_opts;
}
else
{
printf("\nerror: field %s not available in ocp_nlp_sqp_opts_get\n", field);
exit(1);
}
}
void ocp_nlp_sqp_work_get(void *config_, void *dims_, void *work_,
const char *field, void *return_value_)
{
// ocp_nlp_config *config = config_;
ocp_nlp_sqp_workspace *work = work_;
if (!strcmp("nlp_work", field))
{
void **value = return_value_;
*value = work->nlp_work;
}
else
{
printf("\nerror: field %s not available in ocp_nlp_sqp_work_get\n", field);
exit(1);
}
}
void ocp_nlp_sqp_config_initialize_default(void *config_)
{
ocp_nlp_config *config = (ocp_nlp_config *) config_;
config->opts_calculate_size = &ocp_nlp_sqp_opts_calculate_size;
config->opts_assign = &ocp_nlp_sqp_opts_assign;
config->opts_initialize_default = &ocp_nlp_sqp_opts_initialize_default;
config->opts_update = &ocp_nlp_sqp_opts_update;
config->opts_set = &ocp_nlp_sqp_opts_set;
config->opts_set_at_stage = &ocp_nlp_sqp_opts_set_at_stage;
config->memory_calculate_size = &ocp_nlp_sqp_memory_calculate_size;
config->memory_assign = &ocp_nlp_sqp_memory_assign;
config->workspace_calculate_size = &ocp_nlp_sqp_workspace_calculate_size;
config->evaluate = &ocp_nlp_sqp;
config->eval_param_sens = &ocp_nlp_sqp_eval_param_sens;
config->config_initialize_default = &ocp_nlp_sqp_config_initialize_default;
config->precompute = &ocp_nlp_sqp_precompute;
config->get = &ocp_nlp_sqp_get;
config->opts_get = &ocp_nlp_sqp_opts_get;
config->work_get = &ocp_nlp_sqp_work_get;
return;
}
|
GB_binop__bclr_uint32.c | //------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__bclr_uint32)
// A.*B function (eWiseMult): GB (_AemultB_01__bclr_uint32)
// A.*B function (eWiseMult): GB (_AemultB_02__bclr_uint32)
// A.*B function (eWiseMult): GB (_AemultB_03__bclr_uint32)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__bclr_uint32)
// A*D function (colscale): GB ((none))
// D*A function (rowscale): GB ((none))
// C+=B function (dense accum): GB (_Cdense_accumB__bclr_uint32)
// C+=b function (dense accum): GB (_Cdense_accumb__bclr_uint32)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__bclr_uint32)
// C=scalar+B GB (_bind1st__bclr_uint32)
// C=scalar+B' GB (_bind1st_tran__bclr_uint32)
// C=A+scalar GB (_bind2nd__bclr_uint32)
// C=A'+scalar GB (_bind2nd_tran__bclr_uint32)
// C type: uint32_t
// A type: uint32_t
// B,b type: uint32_t
// BinaryOp: cij = GB_BITCLR (aij, bij, uint32_t, 32)
#define GB_ATYPE \
uint32_t
#define GB_BTYPE \
uint32_t
#define GB_CTYPE \
uint32_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
uint32_t aij = GBX (Ax, pA, A_iso)
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
uint32_t bij = GBX (Bx, pB, B_iso)
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
uint32_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = GB_BITCLR (x, y, uint32_t, 32) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
1
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_BCLR || GxB_NO_UINT32 || GxB_NO_BCLR_UINT32)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_ewise3_noaccum__bclr_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_dense_ewise3_noaccum_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__bclr_uint32)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__bclr_uint32)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type uint32_t
uint32_t bwork = (*((uint32_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A, bool A_is_pattern,
const GrB_Matrix D, bool D_is_pattern,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *restrict Cx = (uint32_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
#if 0
GrB_Info GB ((none))
(
GrB_Matrix C,
const GrB_Matrix D, bool D_is_pattern,
const GrB_Matrix B, bool B_is_pattern,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *restrict Cx = (uint32_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
//------------------------------------------------------------------------------
// eWiseAdd: C = A+B or C<M> = A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__bclr_uint32)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
#include "GB_add_template.c"
GB_FREE_WORK ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C = A.*B or C<M> = A.*B
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_01__bclr_uint32)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_01_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__bclr_uint32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_03__bclr_uint32)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_03_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__bclr_uint32)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__bclr_uint32)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t *Cx = (uint32_t *) Cx_output ;
uint32_t x = (*((uint32_t *) x_input)) ;
uint32_t *Bx = (uint32_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
uint32_t bij = GBX (Bx, p, false) ;
Cx [p] = GB_BITCLR (x, bij, uint32_t, 32) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__bclr_uint32)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
uint32_t *Cx = (uint32_t *) Cx_output ;
uint32_t *Ax = (uint32_t *) Ax_input ;
uint32_t y = (*((uint32_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
uint32_t aij = GBX (Ax, p, false) ;
Cx [p] = GB_BITCLR (aij, y, uint32_t, 32) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (x, aij, uint32_t, 32) ; \
}
GrB_Info GB (_bind1st_tran__bclr_uint32)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t x = (*((const uint32_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
uint32_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
uint32_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = GB_BITCLR (aij, y, uint32_t, 32) ; \
}
GrB_Info GB (_bind2nd_tran__bclr_uint32)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
uint32_t y = (*((const uint32_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
main.c | /* vim: set et sw=4 ts=4: */
/*
main.c
Entry point to (micro-benchmarks for the C programming language
*/
#include <gmp.h>
#include <omp.h>
#include <stdio.h>
#include <time.h>
#include "benchmark_config.h"
#include "fib.h"
#include "image.h"
#include "mandelbrot.h"
#include "perfect_number.h"
#include "primes.h"
/* image size for Mandelbrot set */
#define IMG_WIDTH 1920
#define IMG_HEIGHT 1600
int main(int argc, char **argv) {
clock_t tic, toc;
int fib_i;
mpz_t fib_z;
PerfectNumbers pn;
PrimeNumbers pr;
// da_init (pn);
int pn_len;
int pr_len;
struct image *img = 0;
printf("Benchmark (%s)\n", Benchmark_VERSION);
printf("===============\n");
#pragma omp parallel
if (omp_get_thread_num() == 0)
printf("OpenMP: Using %d threads.\n", omp_get_num_threads());
printf("\n");
printf("Fibonacci numbers\n");
printf("-----------------\n");
tic = clock();
fib_i = fib_naive(35);
toc = clock();
printf("fib_naive(35) = %d (Elapsed %.3fs)\n", fib_i,
((double)(toc - tic)) / CLOCKS_PER_SEC);
tic = clock();
fib(fib_z, 35);
toc = clock();
printf("fib(35) = ");
mpz_out_str(stdout, 10, fib_z);
printf(" (Elapsed %.3fs)\n", ((double)(toc - tic)) / CLOCKS_PER_SEC);
mpz_clear(fib_z);
tic = clock();
fib(fib_z, 1000);
toc = clock();
printf("fib(1000) = ");
mpz_out_str(stdout, 10, fib_z);
printf(" (Elapsed %.3fs)\n", ((double)(toc - tic)) / CLOCKS_PER_SEC);
mpz_clear(fib_z);
printf("\n");
printf("Perfect numbers\n");
printf("---------------\n");
tic = clock();
pn_len = perfect_numbers(&pn, 10000);
toc = clock();
printf("pn(10000) = ");
print_perfect_numbers(&pn);
printf(" (len = %d)", pn_len);
printf(" (Elapsed %.3fs)\n", ((double)(toc - tic)) / CLOCKS_PER_SEC);
da_free(pn);
printf("\n");
printf("Prime numbers\n");
printf("-------------\n");
tic = clock();
pr_len = prime_numbers(&pr, 10000);
toc = clock();
printf("pr(10000) = {..}");
// print_perfect_numbers (&pr);
printf(" (len = %d)", pr_len);
printf(" (Elapsed %.3fs)\n", ((double)(toc - tic)) / CLOCKS_PER_SEC);
da_free(pr);
printf("\n");
printf("Mandelbrot set\n");
printf("--------------\n");
tic = clock();
img = create(IMG_WIDTH, IMG_HEIGHT, -0.5, 0.0, 4.0 / IMG_WIDTH);
toc = clock();
printf("mandelbrot(%d, %d) (Elapsed %.3fs)\n", IMG_WIDTH, IMG_HEIGHT,
((double)(toc - tic)) / CLOCKS_PER_SEC);
if (!img) {
perror("Mandelbrot create(): Error!");
} else {
tic = clock();
if (img_writePPM(img, "mandelbrot.ppm"))
perror("img_writePPM() error");
toc = clock();
printf("Image written (Elapsed %.3fs)\n",
((double)(toc - tic)) / CLOCKS_PER_SEC);
}
printf("\n");
return EXIT_SUCCESS;
}
|
2-1.c | #include <stdio.h>
double f(double a) {
return (4.0 / (1.0 + a * a));
}
double pi = 3.141592653589793238462643;
int main() {
double mypi = 0;
int n = 1000000000; // number of points to compute
float h = 1.0 / n;
#pragma omp parallel num_threads(2)
#pragma omp for reduction(+ : mypi)
for (int i = 0; i < n; i++) {
mypi = mypi + f(i * h);
}
mypi = mypi * h;
printf(" pi = %.10f \n", (pi - mypi));
}
|
csr5_spmv_avx2.h | #ifndef CSR5_SPMV_AVX2_H
#define CSR5_SPMV_AVX2_H
#include "common_avx2.h"
#include "utils_avx2.h"
template<typename iT, typename vT>
inline void partition_fast_track(const vT *d_value_partition,
const vT *d_x,
const iT *d_column_index_partition,
vT *d_calibrator,
vT *d_y,
const iT row_start,
const iT par_id,
const int tid,
const iT start_row_start,
const vT alpha,
const int sigma,
const int stride_vT,
const bool direct)
{
__m256d sum256d = _mm256_setzero_pd();
__m256d value256d, x256d;
vT x256d0, x256d1, x256d2, x256d3;
#pragma unroll(ANONYMOUSLIB_CSR5_SIGMA)
for (int i = 0; i < ANONYMOUSLIB_CSR5_SIGMA; i++)
{
value256d = _mm256_load_pd(&d_value_partition[i * ANONYMOUSLIB_CSR5_OMEGA]);
x256d0 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA]];
x256d1 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 1]];
x256d2 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 2]];
x256d3 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 3]];
x256d = _mm256_set_pd(x256d3, x256d2, x256d1, x256d0);
sum256d = _mm256_fmadd_pd(value256d, x256d, sum256d);
}
vT sum = hsum_avx(sum256d);
if (row_start == start_row_start && !direct)
d_calibrator[tid * stride_vT] += sum;
else{
if(direct)
d_y[row_start] = sum;
else
d_y[row_start] += sum;
}
}
template<typename iT, typename uiT, typename vT>
void spmv_csr5_compute_kernel(const iT *d_column_index,
const vT *d_value,
const iT *d_row_pointer,
const vT *d_x,
const uiT *d_partition_pointer,
const uiT *d_partition_descriptor,
const iT *d_partition_descriptor_offset_pointer,
const iT *d_partition_descriptor_offset,
vT *d_calibrator,
vT *d_y,
const iT p,
const int num_packet,
const int bit_y_offset,
const int bit_scansum_offset,
const vT alpha,
const int c_sigma)
{
const int num_thread = omp_get_max_threads();
const int chunk = ceil((double)(p-1) / (double)num_thread);
const int stride_vT = ANONYMOUSLIB_X86_CACHELINE / sizeof(vT);
const int num_thread_active = ceil((p-1.0)/chunk);
#pragma omp parallel
{
int tid = omp_get_thread_num();
iT start_row_start = tid < num_thread_active ? d_partition_pointer[tid * chunk] & 0x7FFFFFFF : 0;
vT s_sum[8]; // allocate a cache line
vT s_first_sum[8]; // allocate a cache line
uint64_t s_cond[8]; // allocate a cache line
int s_y_idx[16]; // allocate a cache line
int inc0, inc1, inc2, inc3;
vT x256d0, x256d1, x256d2, x256d3;
__m128i *d_column_index_partition128i;
__m128i *d_partition_descriptor128i;
__m256d sum256d = _mm256_setzero_pd();
__m256d tmp_sum256d = _mm256_setzero_pd();
__m256d first_sum256d = _mm256_setzero_pd();
__m256d last_sum256d = _mm256_setzero_pd();
__m128i scansum_offset128i, y_offset128i, y_idx128i;
__m256i start256i;
__m256i stop256i = _mm256_setzero_si256();
__m256d value256d, x256d;
__m256i local_bit256i;
__m256i direct256i;
__m128i descriptor128i;
__m256i tmp256i;
#pragma omp for schedule(static, chunk)
for (int par_id = 0; par_id < p - 1; par_id++)
{
const iT *d_column_index_partition = &d_column_index[par_id * ANONYMOUSLIB_CSR5_OMEGA * c_sigma];
const vT *d_value_partition = &d_value[par_id * ANONYMOUSLIB_CSR5_OMEGA * c_sigma];
uiT row_start = d_partition_pointer[par_id];
const iT row_stop = d_partition_pointer[par_id + 1] & 0x7FFFFFFF;
if (row_start == row_stop) // fast track through reduction
{
// check whether the the partition contains the first element of row "row_start"
// => we are the first writing data to d_y[row_start]
bool fast_direct = (d_partition_descriptor[par_id * ANONYMOUSLIB_CSR5_OMEGA * num_packet] >>
(31 - (bit_y_offset + bit_scansum_offset)) & 0x1);
partition_fast_track<iT, vT>
(d_value_partition, d_x, d_column_index_partition,
d_calibrator, d_y, row_start, par_id, tid, start_row_start, alpha, c_sigma, stride_vT, fast_direct);
}
else // normal track for all the other partitions
{
const bool empty_rows = (row_start >> 31) & 0x1;
row_start &= 0x7FFFFFFF;
vT *d_y_local = &d_y[row_start+1];
const int offset_pointer = empty_rows ? d_partition_descriptor_offset_pointer[par_id] : 0;
d_column_index_partition128i = (__m128i *)d_column_index_partition;
d_partition_descriptor128i = (__m128i *)&d_partition_descriptor[par_id * ANONYMOUSLIB_CSR5_OMEGA * num_packet];
first_sum256d = _mm256_setzero_pd();
stop256i = _mm256_setzero_si256();
descriptor128i = _mm_load_si128(d_partition_descriptor128i);
y_offset128i = _mm_srli_epi32(descriptor128i, 32 - bit_y_offset);
scansum_offset128i = _mm_slli_epi32(descriptor128i, bit_y_offset);
scansum_offset128i = _mm_srli_epi32(scansum_offset128i, 32 - bit_scansum_offset);
descriptor128i = _mm_slli_epi32(descriptor128i, bit_y_offset + bit_scansum_offset);
// remember if the first element of this partition is the first element of a new row
local_bit256i = _mm256_cvtepu32_epi64(_mm_srli_epi32(descriptor128i, 31));
bool first_direct = false;
_mm256_store_si256((__m256i *)s_cond, local_bit256i);
if(s_cond[0])
first_direct = true;
// remember if the first element of the first partition of the current thread is the first element of a new row
bool first_all_direct = false;
if(par_id == tid * chunk)
first_all_direct = first_direct;
descriptor128i = _mm_or_si128(descriptor128i, _mm_set_epi32(0, 0, 0, 0x80000000));
local_bit256i = _mm256_cvtepu32_epi64(_mm_srli_epi32(descriptor128i, 31));
start256i = _mm256_sub_epi64(_mm256_set1_epi64x(0x1), local_bit256i);
direct256i = _mm256_and_si256(local_bit256i, _mm256_set_epi64x(0x1, 0x1, 0x1, 0));
value256d = _mm256_load_pd(d_value_partition);
x256d0 = d_x[d_column_index_partition[0]];
x256d1 = d_x[d_column_index_partition[1]];
x256d2 = d_x[d_column_index_partition[2]];
x256d3 = d_x[d_column_index_partition[3]];
x256d = _mm256_set_pd(x256d3, x256d2, x256d1, x256d0);
sum256d = _mm256_mul_pd(value256d, x256d);
// step 1. thread-level seg sum
#if ANONYMOUSLIB_CSR5_SIGMA > 23
int ly = 0;
#endif
for (int i = 1; i < ANONYMOUSLIB_CSR5_SIGMA; i++)
{
x256d0 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA]];
x256d1 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 1]];
x256d2 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 2]];
x256d3 = d_x[d_column_index_partition[i * ANONYMOUSLIB_CSR5_OMEGA + 3]];
x256d = _mm256_set_pd(x256d3, x256d2, x256d1, x256d0);
#if ANONYMOUSLIB_CSR5_SIGMA > 23
int norm_i = i - (32 - bit_y_offset - bit_scansum_offset);
if (!(ly || norm_i) || (ly && !(norm_i % 32)))
{
ly++;
descriptor128i = _mm_load_si128(&d_partition_descriptor128i[ly]);
}
norm_i = !ly ? i : norm_i;
norm_i = 31 - norm_i % 32;
local_bit256i = _mm256_and_si256(_mm256_cvtepu32_epi64(_mm_srli_epi32(descriptor128i, norm_i)), _mm256_set1_epi64x(0x1));
#else
local_bit256i = _mm256_and_si256(_mm256_cvtepu32_epi64(_mm_srli_epi32(descriptor128i, 31-i)), _mm256_set1_epi64x(0x1));
#endif
int store_to_offchip = _mm256_testz_si256(local_bit256i, _mm256_set1_epi64x(0xFFFFFFFFFFFFFFFF));
if (!store_to_offchip)
{
y_idx128i = empty_rows ? _mm_i32gather_epi32 (&d_partition_descriptor_offset[offset_pointer], y_offset128i, 4) : y_offset128i;
// mask scatter store
_mm_store_si128((__m128i *)s_y_idx, y_idx128i);
_mm256_store_pd(s_sum, sum256d);
_mm256_store_si256((__m256i *)s_cond, _mm256_and_si256(direct256i, local_bit256i));
inc0 = 0, inc1 = 0, inc2 = 0, inc3 = 0;
if (s_cond[0]) {d_y_local[s_y_idx[0]] = s_sum[0]; inc0 = 1;}
if (s_cond[1]) {d_y_local[s_y_idx[1]] = s_sum[1]; inc1 = 1;}
if (s_cond[2]) {d_y_local[s_y_idx[2]] = s_sum[2]; inc2 = 1;}
if (s_cond[3]) {d_y_local[s_y_idx[3]] = s_sum[3]; inc3 = 1;}
y_offset128i = _mm_add_epi32(y_offset128i, _mm_set_epi32(inc3, inc2, inc1, inc0));
tmp256i = _mm256_andnot_si256(
_mm256_cmpeq_epi64(direct256i, _mm256_set1_epi64x(0x1)),
_mm256_cmpeq_epi64(local_bit256i, _mm256_set1_epi64x(0x1)));
first_sum256d = _mm256_add_pd(
_mm256_and_pd(_mm256_castsi256_pd(_mm256_cmpeq_epi64(tmp256i, _mm256_set1_epi64x(0))), first_sum256d),
_mm256_and_pd(_mm256_castsi256_pd(_mm256_cmpeq_epi64(tmp256i, _mm256_set1_epi64x(0xFFFFFFFFFFFFFFFF))), sum256d));
sum256d = _mm256_and_pd(_mm256_castsi256_pd(_mm256_cmpeq_epi64(local_bit256i, _mm256_set1_epi64x(0))), sum256d);
direct256i = _mm256_or_si256(direct256i, local_bit256i);
stop256i = _mm256_add_epi64(stop256i, local_bit256i);
}
value256d = _mm256_load_pd(&d_value_partition[i * ANONYMOUSLIB_CSR5_OMEGA]);
sum256d = _mm256_fmadd_pd(value256d, x256d, sum256d);
}
tmp256i = _mm256_cmpeq_epi64(direct256i, _mm256_set1_epi64x(0x1));
first_sum256d = _mm256_and_pd(_mm256_castsi256_pd(tmp256i), first_sum256d);
tmp256i = _mm256_cmpeq_epi64(tmp256i, _mm256_set1_epi64x(0));
first_sum256d = _mm256_add_pd(first_sum256d, _mm256_and_pd(_mm256_castsi256_pd(tmp256i), sum256d));
last_sum256d = sum256d;
tmp256i = _mm256_cmpeq_epi64(start256i, _mm256_set1_epi64x(0x1));
sum256d = _mm256_and_pd(_mm256_castsi256_pd(tmp256i), first_sum256d);
sum256d = _mm256_permute4x64_pd(sum256d, 0x39);
sum256d = _mm256_and_pd(_mm256_castsi256_pd(_mm256_setr_epi64x(0xFFFFFFFFFFFFFFFF, 0xFFFFFFFFFFFFFFFF, 0xFFFFFFFFFFFFFFFF, 0x0000000000000000)), sum256d);
tmp_sum256d = sum256d;
sum256d = hscan_avx(sum256d);
scansum_offset128i = _mm_add_epi32(scansum_offset128i, _mm_set_epi32(3, 2, 1, 0));
tmp256i = _mm256_castsi128_si256(scansum_offset128i);
tmp256i = _mm256_permutevar8x32_epi32(tmp256i, _mm256_set_epi32(3, 3, 2, 2, 1, 1, 0, 0));
tmp256i = _mm256_add_epi32(tmp256i, tmp256i);
tmp256i = _mm256_add_epi32(tmp256i, _mm256_set_epi32(1, 0, 1, 0, 1, 0, 1, 0));
sum256d = _mm256_sub_pd(_mm256_castsi256_pd(_mm256_permutevar8x32_epi32(_mm256_castpd_si256(sum256d), tmp256i)), sum256d);
sum256d = _mm256_add_pd(sum256d, tmp_sum256d);
tmp256i = _mm256_cmpgt_epi64(start256i, stop256i);
tmp256i = _mm256_cmpeq_epi64(tmp256i, _mm256_set1_epi64x(0));
last_sum256d = _mm256_add_pd(last_sum256d, _mm256_and_pd(_mm256_castsi256_pd(tmp256i), sum256d));
y_idx128i = empty_rows ? _mm_i32gather_epi32 (&d_partition_descriptor_offset[offset_pointer], y_offset128i, 4) : y_offset128i;
_mm256_store_si256((__m256i *)s_cond, direct256i);
_mm_store_si128((__m128i *)s_y_idx, y_idx128i);
_mm256_store_pd(s_sum, last_sum256d);
if (s_cond[0]) {d_y_local[s_y_idx[0]] = s_sum[0]; _mm256_store_pd(s_first_sum, first_sum256d);}
if (s_cond[1]) d_y_local[s_y_idx[1]] = s_sum[1];
if (s_cond[2]) d_y_local[s_y_idx[2]] = s_sum[2];
if (s_cond[3]) d_y_local[s_y_idx[3]] = s_sum[3];
// only use calibrator if this partition does not contain the first element of the row "row_start"
if (row_start == start_row_start && !first_all_direct)
d_calibrator[tid * stride_vT] += s_cond[0] ? s_first_sum[0] : s_sum[0];
else{
if(first_direct)
d_y[row_start] = s_cond[0] ? s_first_sum[0] : s_sum[0];
else
d_y[row_start] += s_cond[0] ? s_first_sum[0] : s_sum[0];
}
}
}
}
}
template<typename iT, typename uiT, typename vT>
void spmv_csr5_calibrate_kernel(const uiT *d_partition_pointer,
vT *d_calibrator,
vT *d_y,
const iT p)
{
int num_thread = omp_get_max_threads();
int chunk = ceil((double)(p-1) / (double)num_thread);
int stride_vT = ANONYMOUSLIB_X86_CACHELINE / sizeof(vT);
// calculate the number of maximal active threads (for a static loop scheduling with size chunk)
int num_thread_active = ceil((p-1.0)/chunk);
int num_cali = num_thread_active < num_thread ? num_thread_active : num_thread;
for (int i = 0; i < num_cali; i++)
{
d_y[(d_partition_pointer[i * chunk] << 1) >> 1] += d_calibrator[i * stride_vT];
}
}
template<typename iT, typename uiT, typename vT>
void spmv_csr5_tail_partition_kernel(const iT *d_row_pointer,
const iT *d_column_index,
const vT *d_value,
const vT *d_x,
vT *d_y,
const iT tail_partition_start,
const iT p,
const iT m,
const int sigma,
const vT alpha)
{
const iT index_first_element_tail = (p - 1) * ANONYMOUSLIB_CSR5_OMEGA * sigma;
#pragma omp parallel for
for (iT row_id = tail_partition_start; row_id < m; row_id++)
{
const iT idx_start = row_id == tail_partition_start ? (p - 1) * ANONYMOUSLIB_CSR5_OMEGA * sigma : d_row_pointer[row_id];
const iT idx_stop = d_row_pointer[row_id + 1];
vT sum = 0;
for (iT idx = idx_start; idx < idx_stop; idx++)
sum += d_value[idx] * d_x[d_column_index[idx]];// * alpha;
if(row_id == tail_partition_start && d_row_pointer[row_id] != index_first_element_tail){
d_y[row_id] = d_y[row_id] + sum;
}else{
d_y[row_id] = sum;
}
}
}
template<typename ANONYMOUSLIB_IT, typename ANONYMOUSLIB_UIT, typename ANONYMOUSLIB_VT>
int csr5_spmv(const int sigma,
const ANONYMOUSLIB_IT p,
const ANONYMOUSLIB_IT m,
const int bit_y_offset,
const int bit_scansum_offset,
const int num_packet,
const ANONYMOUSLIB_IT *row_pointer,
const ANONYMOUSLIB_IT *column_index,
const ANONYMOUSLIB_VT *value,
const ANONYMOUSLIB_UIT *partition_pointer,
const ANONYMOUSLIB_UIT *partition_descriptor,
const ANONYMOUSLIB_IT *partition_descriptor_offset_pointer,
const ANONYMOUSLIB_IT *partition_descriptor_offset,
ANONYMOUSLIB_VT *calibrator,
const ANONYMOUSLIB_IT tail_partition_start,
const ANONYMOUSLIB_VT alpha,
const ANONYMOUSLIB_VT *x,
ANONYMOUSLIB_VT *y)
{
int err = ANONYMOUSLIB_SUCCESS;
const int num_thread = omp_get_max_threads();
memset(calibrator,0,ANONYMOUSLIB_X86_CACHELINE*num_thread);
spmv_csr5_compute_kernel
<ANONYMOUSLIB_IT, ANONYMOUSLIB_UIT, ANONYMOUSLIB_VT>
(column_index, value, row_pointer, x,
partition_pointer, partition_descriptor,
partition_descriptor_offset_pointer, partition_descriptor_offset,
calibrator, y, p,
num_packet, bit_y_offset, bit_scansum_offset, alpha, sigma);
spmv_csr5_calibrate_kernel
<ANONYMOUSLIB_IT, ANONYMOUSLIB_UIT, ANONYMOUSLIB_VT>
(partition_pointer, calibrator, y, p);
spmv_csr5_tail_partition_kernel
<ANONYMOUSLIB_IT, ANONYMOUSLIB_UIT, ANONYMOUSLIB_VT>
(row_pointer, column_index, value, x, y,
tail_partition_start, p, m, sigma, alpha);
return err;
}
#endif // CSR5_SPMV_AVX2_H
|
3d7pt_var.lbpar.c | #include <omp.h>
#include <math.h>
#define ceild(n,d) ceil(((double)(n))/((double)(d)))
#define floord(n,d) floor(((double)(n))/((double)(d)))
#define max(x,y) ((x) > (y)? (x) : (y))
#define min(x,y) ((x) < (y)? (x) : (y))
/*
* Order-1, 3D 7 point stencil with variable coefficients
* Adapted from PLUTO and Pochoir test bench
*
* Tareq Malas
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#ifdef LIKWID_PERFMON
#include <likwid.h>
#endif
#include "print_utils.h"
#define TESTS 2
#define MAX(a,b) ((a) > (b) ? a : b)
#define MIN(a,b) ((a) < (b) ? a : b)
/* Subtract the `struct timeval' values X and Y,
* storing the result in RESULT.
*
* Return 1 if the difference is negative, otherwise 0.
*/
int timeval_subtract(struct timeval *result, struct timeval *x, struct timeval *y)
{
/* Perform the carry for the later subtraction by updating y. */
if (x->tv_usec < y->tv_usec)
{
int nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1;
y->tv_usec -= 1000000 * nsec;
y->tv_sec += nsec;
}
if (x->tv_usec - y->tv_usec > 1000000)
{
int nsec = (x->tv_usec - y->tv_usec) / 1000000;
y->tv_usec += 1000000 * nsec;
y->tv_sec -= nsec;
}
/* Compute the time remaining to wait.
* tv_usec is certainly positive.
*/
result->tv_sec = x->tv_sec - y->tv_sec;
result->tv_usec = x->tv_usec - y->tv_usec;
/* Return 1 if result is negative. */
return x->tv_sec < y->tv_sec;
}
int main(int argc, char *argv[])
{
int t, i, j, k, m, test;
int Nx, Ny, Nz, Nt;
if (argc > 3) {
Nx = atoi(argv[1])+2;
Ny = atoi(argv[2])+2;
Nz = atoi(argv[3])+2;
}
if (argc > 4)
Nt = atoi(argv[4]);
// allocate the arrays
double ****A = (double ****) malloc(sizeof(double***)*2);
for(m=0; m<2;m++){
A[m] = (double ***) malloc(sizeof(double**)*Nz);
for(i=0; i<Nz; i++){
A[m][i] = (double**) malloc(sizeof(double*)*Ny);
for(j=0;j<Ny;j++){
A[m][i][j] = (double*) malloc(sizeof(double)*Nx);
}
}
}
double ****coef = (double ****) malloc(sizeof(double***)*7);
for(m=0; m<7;m++){
coef[m] = (double ***) malloc(sizeof(double**)*Nz);
for(i=0; i<Nz; i++){
coef[m][i] = (double**) malloc(sizeof(double*)*Ny);
for(j=0;j<Ny;j++){
coef[m][i][j] = (double*) malloc(sizeof(double)*Nx);
}
}
}
// tile size information, including extra element to decide the list length
int *tile_size = (int*) malloc(sizeof(int));
tile_size[0] = -1;
// The list is modified here before source-to-source transformations
tile_size = (int*) realloc((void *)tile_size, sizeof(int)*5);
tile_size[0] = 4;
tile_size[1] = 4;
tile_size[2] = 8;
tile_size[3] = 256;
tile_size[4] = -1;
// for timekeeping
int ts_return = -1;
struct timeval start, end, result;
double tdiff = 0.0, min_tdiff=1.e100;
const int BASE = 1024;
// initialize variables
//
srand(42);
for (i = 1; i < Nz; i++) {
for (j = 1; j < Ny; j++) {
for (k = 1; k < Nx; k++) {
A[0][i][j][k] = 1.0 * (rand() % BASE);
}
}
}
for (m=0; m<7; m++) {
for (i=1; i<Nz; i++) {
for (j=1; j<Ny; j++) {
for (k=1; k<Nx; k++) {
coef[m][i][j][k] = 1.0 * (rand() % BASE);
}
}
}
}
#ifdef LIKWID_PERFMON
LIKWID_MARKER_INIT;
#pragma omp parallel
{
LIKWID_MARKER_THREADINIT;
#pragma omp barrier
LIKWID_MARKER_START("calc");
}
#endif
int num_threads = 1;
#if defined(_OPENMP)
num_threads = omp_get_max_threads();
#endif
for(test=0; test<TESTS; test++){
gettimeofday(&start, 0);
// serial execution - Addition: 6 && Multiplication: 2
/* Copyright (C) 1991-2014 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
/* This header is separate from features.h so that the compiler can
include it implicitly at the start of every compilation. It must
not itself include <features.h> or any other header that includes
<features.h> because the implicit include comes before any feature
test macros that may be defined in a source file before it first
explicitly includes a system header. GCC knows the name of this
header in order to preinclude it. */
/* glibc's intent is to support the IEC 559 math functionality, real
and complex. If the GCC (4.9 and later) predefined macros
specifying compiler intent are available, use them to determine
whether the overall intent is to support these features; otherwise,
presume an older compiler has intent to support these features and
define these macros by default. */
/* wchar_t uses ISO/IEC 10646 (2nd ed., published 2011-03-15) /
Unicode 6.0. */
/* We do not support C11 <threads.h>. */
int t1, t2, t3, t4, t5, t6, t7, t8;
int lb, ub, lbp, ubp, lb2, ub2;
register int lbv, ubv;
/* Start of CLooG code */
if ((Nt >= 2) && (Nx >= 3) && (Ny >= 3) && (Nz >= 3)) {
for (t1=-1;t1<=floord(Nt-2,2);t1++) {
lbp=max(ceild(t1,2),ceild(4*t1-Nt+3,4));
ubp=min(floord(Nt+Nz-4,4),floord(2*t1+Nz-1,4));
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7,t8)
for (t2=lbp;t2<=ubp;t2++) {
for (t3=max(max(0,ceild(t1-3,4)),ceild(4*t2-Nz-4,8));t3<=min(min(min(floord(4*t2+Ny,8),floord(Nt+Ny-4,8)),floord(2*t1+Ny+1,8)),floord(4*t1-4*t2+Nz+Ny-1,8));t3++) {
for (t4=max(max(max(0,ceild(t1-127,128)),ceild(4*t2-Nz-252,256)),ceild(8*t3-Ny-252,256));t4<=min(min(min(min(floord(4*t2+Nx,256),floord(Nt+Nx-4,256)),floord(2*t1+Nx+1,256)),floord(8*t3+Nx+4,256)),floord(4*t1-4*t2+Nz+Nx-1,256));t4++) {
for (t5=max(max(max(max(max(0,2*t1),4*t1-4*t2+1),4*t2-Nz+2),8*t3-Ny+2),256*t4-Nx+2);t5<=min(min(min(min(min(Nt-2,2*t1+3),4*t2+2),8*t3+6),256*t4+254),4*t1-4*t2+Nz+1);t5++) {
for (t6=max(max(4*t2,t5+1),-4*t1+4*t2+2*t5-3);t6<=min(min(4*t2+3,-4*t1+4*t2+2*t5),t5+Nz-2);t6++) {
for (t7=max(8*t3,t5+1);t7<=min(8*t3+7,t5+Ny-2);t7++) {
lbv=max(256*t4,t5+1);
ubv=min(256*t4+255,t5+Nx-2);
#pragma ivdep
#pragma vector always
for (t8=lbv;t8<=ubv;t8++) {
A[( t5 + 1) % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] = (((((((coef[0][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)]) + (coef[1][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6) - 1][ (-t5+t7)][ (-t5+t8)])) + (coef[2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6)][ (-t5+t7) - 1][ (-t5+t8)])) + (coef[3][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8) - 1])) + (coef[4][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6) + 1][ (-t5+t7)][ (-t5+t8)])) + (coef[5][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6)][ (-t5+t7) + 1][ (-t5+t8)])) + (coef[6][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] * A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8) + 1]));;
}
}
}
}
}
}
}
}
}
/* End of CLooG code */
gettimeofday(&end, 0);
ts_return = timeval_subtract(&result, &end, &start);
tdiff = (double) (result.tv_sec + result.tv_usec * 1.0e-6);
min_tdiff = min(min_tdiff, tdiff);
printf("Rank 0 TEST# %d time: %f\n", test, tdiff);
}
PRINT_RESULTS(1, "variable no-symmetry")
#ifdef LIKWID_PERFMON
#pragma omp parallel
{
LIKWID_MARKER_STOP("calc");
}
LIKWID_MARKER_CLOSE;
#endif
// Free allocated arrays
for(i=0; i<Nz; i++){
for(j=0;j<Ny;j++){
free(A[0][i][j]);
free(A[1][i][j]);
}
free(A[0][i]);
free(A[1][i]);
}
free(A[0]);
free(A[1]);
for(m=0; m<7;m++){
for(i=0; i<Nz; i++){
for(j=0;j<Ny;j++){
free(coef[m][i][j]);
}
free(coef[m][i]);
}
free(coef[m]);
}
return 0;
}
|
GB_binop__isle_int64.c |
//------------------------------------------------------------------------------
// GB_binop: hard-coded functions for each built-in binary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCUDA_DEV
#include "GB_emult.h"
#include "GB_control.h"
#include "GB_ek_slice.h"
#include "GB_dense.h"
#include "GB_atomics.h"
#include "GB_bitmap_assign_methods.h"
#include "GB_binop__include.h"
// C=binop(A,B) is defined by the following types and operators:
// A+B function (eWiseAdd): GB (_AaddB__isle_int64)
// A.*B function (eWiseMult): GB (_AemultB_08__isle_int64)
// A.*B function (eWiseMult): GB (_AemultB_02__isle_int64)
// A.*B function (eWiseMult): GB (_AemultB_04__isle_int64)
// A.*B function (eWiseMult): GB (_AemultB_bitmap__isle_int64)
// A*D function (colscale): GB (_AxD__isle_int64)
// D*A function (rowscale): GB (_DxB__isle_int64)
// C+=B function (dense accum): GB (_Cdense_accumB__isle_int64)
// C+=b function (dense accum): GB (_Cdense_accumb__isle_int64)
// C+=A+B function (dense ewise3): GB ((none))
// C=A+B function (dense ewise3): GB (_Cdense_ewise3_noaccum__isle_int64)
// C=scalar+B GB (_bind1st__isle_int64)
// C=scalar+B' GB (_bind1st_tran__isle_int64)
// C=A+scalar GB (_bind2nd__isle_int64)
// C=A'+scalar GB (_bind2nd_tran__isle_int64)
// C type: int64_t
// A type: int64_t
// A pattern? 0
// B type: int64_t
// B pattern? 0
// BinaryOp: cij = (aij <= bij)
#define GB_ATYPE \
int64_t
#define GB_BTYPE \
int64_t
#define GB_CTYPE \
int64_t
// true if the types of A and B are identical
#define GB_ATYPE_IS_BTYPE \
1
// true if the types of C and A are identical
#define GB_CTYPE_IS_ATYPE \
1
// true if the types of C and B are identical
#define GB_CTYPE_IS_BTYPE \
1
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA,A_iso) \
int64_t aij = GBX (Ax, pA, A_iso)
// true if values of A are not used
#define GB_A_IS_PATTERN \
0 \
// bij = Bx [pB]
#define GB_GETB(bij,Bx,pB,B_iso) \
int64_t bij = GBX (Bx, pB, B_iso)
// true if values of B are not used
#define GB_B_IS_PATTERN \
0 \
// declare scalar of the same type as C
#define GB_CTYPE_SCALAR(t) \
int64_t t
// cij = Ax [pA]
#define GB_COPY_A_TO_C(cij,Ax,pA,A_iso) \
cij = GBX (Ax, pA, A_iso)
// cij = Bx [pB]
#define GB_COPY_B_TO_C(cij,Bx,pB,B_iso) \
cij = GBX (Bx, pB, B_iso)
#define GB_CX(p) Cx [p]
// binary operator
#define GB_BINOP(z,x,y,i,j) \
z = (x <= y) ;
// true if the binop must be flipped
#define GB_BINOP_FLIP \
0
// op is second
#define GB_OP_IS_SECOND \
0
// do the numerical phases of GB_add and GB_emult
#define GB_PHASE_2_OF_2
// hard-coded loops can be vectorized
#define GB_PRAGMA_SIMD_VECTORIZE GB_PRAGMA_SIMD
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_ISLE || GxB_NO_INT64 || GxB_NO_ISLE_INT64)
//------------------------------------------------------------------------------
// C += A+B, all 3 matrices dense
//------------------------------------------------------------------------------
#if 0
// The op must be MIN, MAX, PLUS, MINUS, RMINUS, TIMES, DIV, or RDIV.
void GB ((none))
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_accum_template.c"
}
#endif
//------------------------------------------------------------------------------
// C = A+B, all 3 matrices dense
//------------------------------------------------------------------------------
void GB (_Cdense_ewise3_noaccum__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix B,
const int nthreads
)
{
#include "GB_dense_ewise3_noaccum_template.c"
}
//------------------------------------------------------------------------------
// C += B, accumulate a sparse matrix into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumB__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix B,
const int64_t *B_ek_slicing, const int B_ntasks, const int B_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
#include "GB_dense_subassign_23_template.c"
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C += b, accumulate a scalar into a dense matrix
//------------------------------------------------------------------------------
GrB_Info GB (_Cdense_accumb__isle_int64)
(
GrB_Matrix C,
const GB_void *p_bwork,
const int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
{
// get the scalar b for C += b, of type int64_t
int64_t bwork = (*((int64_t *) p_bwork)) ;
#include "GB_dense_subassign_22_template.c"
return (GrB_SUCCESS) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = A*D, column scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_AxD__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GrB_Matrix D,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *restrict Cx = (int64_t *) C->x ;
#include "GB_AxB_colscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = D*B, row scale with diagonal D matrix
//------------------------------------------------------------------------------
GrB_Info GB (_DxB__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix D,
const GrB_Matrix B,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *restrict Cx = (int64_t *) C->x ;
#include "GB_AxB_rowscale_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseAdd: C=A+B, C<M>=A+B, C<!M>=A+B
//------------------------------------------------------------------------------
GrB_Info GB (_AaddB__isle_int64)
(
GrB_Matrix C,
const int C_sparsity,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool is_eWiseUnion,
const GB_void *alpha_scalar_in,
const GB_void *beta_scalar_in,
const bool Ch_is_Mh,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
GB_WERK_DECLARE (M_ek_slicing, int64_t) ;
GB_WERK_DECLARE (A_ek_slicing, int64_t) ;
GB_WERK_DECLARE (B_ek_slicing, int64_t) ;
int64_t alpha_scalar ;
int64_t beta_scalar ;
if (is_eWiseUnion)
{
alpha_scalar = (*((int64_t *) alpha_scalar_in)) ;
beta_scalar = (*((int64_t *) beta_scalar_in )) ;
}
#include "GB_add_template.c"
GB_FREE_WORKSPACE ;
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, or C<M!>=A.*B where C is sparse/hyper
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_08__isle_int64)
(
GrB_Matrix C,
const int C_sparsity,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict C_to_M,
const int64_t *restrict C_to_A,
const int64_t *restrict C_to_B,
const GB_task_struct *restrict TaskList,
const int C_ntasks,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_08_meta.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<#> = A.*B when A is sparse/hyper and B is bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_02__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const bool flipxy,
const int64_t *restrict Cp_kfirst,
const int64_t *A_ek_slicing, const int A_ntasks, const int A_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#if GB_BINOP_FLIP
// The operator is not commutative, and does not have a flipped
// variant. For example z=atan2(y,x).
if (flipxy)
{
// use fmult(y,x)
#undef GB_FLIPPED
#define GB_FLIPPED 1
#include "GB_emult_02_template.c"
}
else
{
// use fmult(x,y)
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
}
#else
// No need to handle the flip: the operator is either commutative, or
// has been handled by changing z=div(y,x) to z=rdiv(x,y) for example.
#undef GB_FLIPPED
#define GB_FLIPPED 0
#include "GB_emult_02_template.c"
#endif
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C<M> = A.*B, M sparse/hyper, A and B bitmap/full
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_04__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix M,
const bool Mask_struct,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *restrict Cp_kfirst,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_emult_04_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// eWiseMult: C=A.*B, C<M>=A.*B, C<!M>=A.*B where C is bitmap
//------------------------------------------------------------------------------
GrB_Info GB (_AemultB_bitmap__isle_int64)
(
GrB_Matrix C,
const int ewise_method,
const GrB_Matrix M,
const bool Mask_struct,
const bool Mask_comp,
const GrB_Matrix A,
const GrB_Matrix B,
const int64_t *M_ek_slicing, const int M_ntasks, const int M_nthreads,
const int C_nthreads,
GB_Context Context
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_bitmap_emult_template.c"
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (x,Bx): apply a binary operator to a matrix with scalar bind1st
//------------------------------------------------------------------------------
GrB_Info GB (_bind1st__isle_int64)
(
GB_void *Cx_output, // Cx and Bx may be aliased
const GB_void *x_input,
const GB_void *Bx_input,
const int8_t *restrict Bb,
int64_t bnz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t *Cx = (int64_t *) Cx_output ;
int64_t x = (*((int64_t *) x_input)) ;
int64_t *Bx = (int64_t *) Bx_input ;
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < bnz ; p++)
{
if (!GBB (Bb, p)) continue ;
int64_t bij = GBX (Bx, p, false) ;
Cx [p] = (x <= bij) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// Cx = op (Ax,y): apply a binary operator to a matrix with scalar bind2nd
//------------------------------------------------------------------------------
GrB_Info GB (_bind2nd__isle_int64)
(
GB_void *Cx_output, // Cx and Ax may be aliased
const GB_void *Ax_input,
const GB_void *y_input,
const int8_t *restrict Ab,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
int64_t *Cx = (int64_t *) Cx_output ;
int64_t *Ax = (int64_t *) Ax_input ;
int64_t y = (*((int64_t *) y_input)) ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!GBB (Ab, p)) continue ;
int64_t aij = GBX (Ax, p, false) ;
Cx [p] = (aij <= y) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (x, A'): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (x, aij), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
int64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = (x <= aij) ; \
}
GrB_Info GB (_bind1st_tran__isle_int64)
(
GrB_Matrix C,
const GB_void *x_input,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
// GB_unop_transpose.c uses GB_ATYPE, but A is
// the 2nd input to binary operator z=f(x,y).
#undef GB_ATYPE
#define GB_ATYPE \
int64_t
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t x = (*((const int64_t *) x_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
#undef GB_ATYPE
#define GB_ATYPE \
int64_t
}
//------------------------------------------------------------------------------
// C = op (A', y): transpose and apply a binary operator
//------------------------------------------------------------------------------
// cij = op (aij, y), no typecasting (in spite of the macro name)
#undef GB_CAST_OP
#define GB_CAST_OP(pC,pA) \
{ \
int64_t aij = GBX (Ax, pA, false) ; \
Cx [pC] = (aij <= y) ; \
}
GrB_Info GB (_bind2nd_tran__isle_int64)
(
GrB_Matrix C,
const GrB_Matrix A,
const GB_void *y_input,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t y = (*((const int64_t *) y_input)) ;
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
SpatialConvolutionMM.c | #include <string.h>
#include "../thnets.h"
static void nn_unfolded_copy(THFloatTensor *finput, THFloatTensor *input,
int kW, int kH, int dW, int dH, int padW, int padH,
int nInputPlane, int inputWidth, int inputHeight,
int outputWidth, int outputHeight)
{
long k;
float *input_data = THFloatTensor_data(input);
float *finput_data = THFloatTensor_data(finput);
#pragma omp parallel for private(k)
for(k = 0; k < nInputPlane*kH*kW; k++) {
long nip = k / (kH*kW);
long rest = k % (kH*kW);
long kh = rest / kW;
long kw = rest % kW;
long x,y;
long long ix,iy;
float *dst = finput_data + nip*(kH*kW*outputHeight*outputWidth) + kh*(kW*outputHeight*outputWidth) + kw*(outputHeight*outputWidth);
float *src = input_data + nip*(inputHeight*inputWidth);
if (padW > 0 || padH > 0) {
long lpad,rpad;
for(y = 0; y < outputHeight; y++) {
iy = (long long)(y*dH - padH + kh);
if (iy < 0 || iy >= inputHeight) {
memset(dst+y*outputWidth, 0, sizeof(float)*outputWidth);
} else {
if (dW==1){
ix = (long long)(0 - padW + kw);
lpad = fmaxf(0,padW-kw);
rpad = fmaxf(0,padW-(kW-kw-1));
if (outputWidth-rpad-lpad <= 0) {
memset(dst+(y*outputWidth), 0, sizeof(float)*outputWidth);
} else {
if (lpad > 0) memset(dst+y*outputWidth, 0, sizeof(float)*lpad);
memcpy(dst+(y*outputWidth+lpad), src+(iy*inputWidth+ix+lpad), sizeof(float)*(outputWidth-rpad-lpad));
if (rpad > 0) memset(dst+y*outputWidth + outputWidth - rpad, 0, sizeof(float)*rpad);
}
}
else{
for (x=0; x<outputWidth; x++){
ix = (long long)(x*dW - padW + kw);
if (ix < 0 || ix >= inputWidth)
memset(dst+(y*outputWidth+x), 0, sizeof(float)*1);
else
memcpy(dst+(y*outputWidth+x), src+(iy*inputWidth+ix), sizeof(float)*(1));
}
}
}
}
} else {
for(y = 0; y < outputHeight; y++) {
iy = (long long)(y*dH + kh);
ix = (long long)(0 + kw);
if (dW == 1)
memcpy(dst+(y*outputWidth), src+(iy*inputWidth+ix), sizeof(float)*outputWidth);
else{
for (x=0; x<outputWidth; x++)
memcpy(dst+(y*outputWidth+x), src+(iy*inputWidth+ix+x*dW), sizeof(float)*(1));
}
}
}
}
}
static void nn_SpatialConvolutionMM_updateOutput_frame(THFloatTensor *input, THFloatTensor *output,
THFloatTensor *weight, THFloatTensor *bias,
THFloatTensor *finput,
int kW, int kH, int dW, int dH, int padW, int padH,
long nInputPlane, long inputWidth, long inputHeight,
long nOutputPlane, long outputWidth, long outputHeight)
{
nn_unfolded_copy(finput, input, kW, kH, dW, dH, padW, padH,
nInputPlane, inputWidth, inputHeight, outputWidth, outputHeight);
THFloatTensor *output2d = THFloatTensor_newWithStorage2d(output->storage, output->storageOffset,
nOutputPlane, -1,
outputHeight*outputWidth, -1);
long i;
for (i = 0; i < nOutputPlane; i++)
{
float *data = output->storage->data + output->storageOffset + output->stride[0]*i;
float what = bias->storage->data[i];
long len = outputHeight*outputWidth;
THFloatVector_fill(data, what, len);
}
THFloatTensor_addmm(output2d, 1, output2d, 1, weight, finput);
THFloatTensor_free(output2d);
}
THFloatTensor *nn_SpatialConvolutionMM_updateOutput(struct module *module, THFloatTensor *input)
{
int kW = module->SpatialConvolution.kW;
int kH = module->SpatialConvolution.kH;
int dW = module->SpatialConvolution.dW;
int dH = module->SpatialConvolution.dH;
int padW = module->SpatialConvolution.padW;
int padH = module->SpatialConvolution.padH;
THFloatTensor *finput = module->SpatialConvolution.finput;
THFloatTensor *weight = module->SpatialConvolution.weight;
THFloatTensor *bias = module->SpatialConvolution.bias;
THFloatTensor *output = module->output;
int batch = 1;
if (input->nDimension == 3) {
batch = 0;
THFloatTensor_resize4d(input, 1, input->size[0], input->size[1], input->size[2]);
}
long batchSize = input->size[0];
long nInputPlane = module->SpatialConvolution.nInputPlane;
long nOutputPlane = module->SpatialConvolution.nOutputPlane;
long inputWidth = input->size[3];
long inputHeight = input->size[2];
long outputWidth = (inputWidth + 2*padW - kW) / dW + 1;
long outputHeight = (inputHeight + 2*padH - kH) / dH + 1;
if (outputWidth < 1 || outputHeight < 1)
THError("Given input size: (%dx%dx%d). Calculated output size: (%dx%dx%d). Output size is too small",
nInputPlane,inputHeight,inputWidth,nOutputPlane,outputHeight,outputWidth);
THFloatTensor_resize3d(finput, batchSize, kW*kH*nInputPlane, outputHeight*outputWidth);
THFloatTensor_resize4d(output, batchSize, nOutputPlane, outputHeight, outputWidth);
long t;
#pragma omp parallel for if(batchSize >= 4) private(t)
for (t = 0; t < batchSize; t++) {
THFloatTensor *input_t = THFloatTensor_newSelect(input, 0, t);
THFloatTensor *output_t = THFloatTensor_newSelect(output, 0, t);
THFloatTensor *finput_t = THFloatTensor_newSelect(finput, 0, t);
nn_SpatialConvolutionMM_updateOutput_frame(input_t, output_t, weight, bias, finput_t,
kW, kH, dW, dH, padW, padH,
nInputPlane, inputWidth, inputHeight,
nOutputPlane, outputWidth, outputHeight);
THFloatTensor_free(input_t);
THFloatTensor_free(output_t);
THFloatTensor_free(finput_t);
}
if (batch == 0) {
THFloatTensor_resize3d(output, nOutputPlane, outputHeight, outputWidth);
THFloatTensor_resize3d(input, nInputPlane, inputHeight, inputWidth);
}
return output;
}
|
trsm_c_sky_u_lo_row_conj.c | #include "alphasparse/kernel.h"
#include "alphasparse/util.h"
alphasparse_status_t ONAME(const ALPHA_Number alpha, const ALPHA_SPMAT_SKY *A, const ALPHA_Number *x, const ALPHA_INT columns, const ALPHA_INT ldx, ALPHA_Number *y, const ALPHA_INT ldy)
{
ALPHA_INT num_thread = alpha_get_thread_num();
#ifdef _OPENMP
#pragma omp parallel for num_threads(num_thread)
#endif
for(ALPHA_INT out_y_col = 0; out_y_col < columns; out_y_col++)
{
for (ALPHA_INT c = A->cols - 1; c >= 0; c--)
{
ALPHA_Complex temp = {.real = 0.f, .imag = 0.f};
for (ALPHA_INT ic = A->cols - 1; ic > c; ic--)
{
ALPHA_INT start = A->pointers[ic];
ALPHA_INT end = A->pointers[ic + 1];
ALPHA_INT eles_num = ic - c;
if(end - eles_num - 1 >= start)
{
ALPHA_Complex cv = A->values[end - eles_num - 1];
alpha_conj(cv, cv);
alpha_madde(temp, cv, y[ic * ldy + out_y_col]);
}
}
ALPHA_Complex t;
alpha_mul(t, alpha, x[c * ldx + out_y_col]);
alpha_sub(y[c * ldy + out_y_col], t, temp);
}
}
return ALPHA_SPARSE_STATUS_SUCCESS;
}
|
GB_unaryop__minv_bool_uint64.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2020, All Rights Reserved.
// http://suitesparse.com See GraphBLAS/Doc/License.txt for license.
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_iterator.h"
#include "GB_unaryop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB_unop__minv_bool_uint64
// op(A') function: GB_tran__minv_bool_uint64
// C type: bool
// A type: uint64_t
// cast: ;
// unaryop: cij = true
#define GB_ATYPE \
uint64_t
#define GB_CTYPE \
bool
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
;
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = true ;
// casting
#define GB_CASTING(z, aij) \
; ;
// cij = op (cast (aij))
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
GB_GETA (aij, Ax, pA) ; \
/* Cx [pC] = op (cast (aij)) */ \
GB_CASTING (z, aij) ; \
GB_OP (GB_CX (pC), z) ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_MINV || GxB_NO_BOOL || GxB_NO_UINT64)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_unop__minv_bool_uint64
(
bool *Cx, // Cx and Ax may be aliased
uint64_t *Ax,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
GB_CAST_OP (p, p) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_tran__minv_bool_uint64
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *GB_RESTRICT *Rowcounts,
GBI_single_iterator Iter,
const int64_t *GB_RESTRICT A_slice,
int naslice
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#define GB_PHASE_2_OF_2
#include "GB_unaryop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
StmtOpenMP.h | //===- StmtOpenMP.h - Classes for OpenMP directives ------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
/// \file
/// This file defines OpenMP AST classes for executable directives and
/// clauses.
///
//===----------------------------------------------------------------------===//
#ifndef LLVM_CLANG_AST_STMTOPENMP_H
#define LLVM_CLANG_AST_STMTOPENMP_H
#include "clang/AST/ASTContext.h"
#include "clang/AST/Expr.h"
#include "clang/AST/OpenMPClause.h"
#include "clang/AST/Stmt.h"
#include "clang/AST/StmtCXX.h"
#include "clang/Basic/OpenMPKinds.h"
#include "clang/Basic/SourceLocation.h"
namespace clang {
//===----------------------------------------------------------------------===//
// AST classes for directives.
//===----------------------------------------------------------------------===//
/// This is a basic class for representing single OpenMP executable
/// directive.
///
class OMPExecutableDirective : public Stmt {
friend class ASTStmtReader;
friend class ASTStmtWriter;
/// Kind of the directive.
OpenMPDirectiveKind Kind = llvm::omp::OMPD_unknown;
/// Starting location of the directive (directive keyword).
SourceLocation StartLoc;
/// Ending location of the directive.
SourceLocation EndLoc;
/// Get the clauses storage.
MutableArrayRef<OMPClause *> getClauses() {
if (!Data)
return llvm::None;
return Data->getClauses();
}
protected:
/// Data, associated with the directive.
OMPChildren *Data = nullptr;
/// Build instance of directive of class \a K.
///
/// \param SC Statement class.
/// \param K Kind of OpenMP directive.
/// \param StartLoc Starting location of the directive (directive keyword).
/// \param EndLoc Ending location of the directive.
///
OMPExecutableDirective(StmtClass SC, OpenMPDirectiveKind K,
SourceLocation StartLoc, SourceLocation EndLoc)
: Stmt(SC), Kind(K), StartLoc(std::move(StartLoc)),
EndLoc(std::move(EndLoc)) {}
template <typename T, typename... Params>
static T *createDirective(const ASTContext &C, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, unsigned NumChildren,
Params &&... P) {
void *Mem =
C.Allocate(sizeof(T) + OMPChildren::size(Clauses.size(), AssociatedStmt,
NumChildren),
alignof(T));
auto *Data = OMPChildren::Create(reinterpret_cast<T *>(Mem) + 1, Clauses,
AssociatedStmt, NumChildren);
auto *Inst = new (Mem) T(std::forward<Params>(P)...);
Inst->Data = Data;
return Inst;
}
template <typename T, typename... Params>
static T *createEmptyDirective(const ASTContext &C, unsigned NumClauses,
bool HasAssociatedStmt, unsigned NumChildren,
Params &&... P) {
void *Mem =
C.Allocate(sizeof(T) + OMPChildren::size(NumClauses, HasAssociatedStmt,
NumChildren),
alignof(T));
auto *Data =
OMPChildren::CreateEmpty(reinterpret_cast<T *>(Mem) + 1, NumClauses,
HasAssociatedStmt, NumChildren);
auto *Inst = new (Mem) T(std::forward<Params>(P)...);
Inst->Data = Data;
return Inst;
}
template <typename T>
static T *createEmptyDirective(const ASTContext &C, unsigned NumClauses,
bool HasAssociatedStmt = false,
unsigned NumChildren = 0) {
void *Mem =
C.Allocate(sizeof(T) + OMPChildren::size(NumClauses, HasAssociatedStmt,
NumChildren),
alignof(T));
auto *Data =
OMPChildren::CreateEmpty(reinterpret_cast<T *>(Mem) + 1, NumClauses,
HasAssociatedStmt, NumChildren);
auto *Inst = new (Mem) T;
Inst->Data = Data;
return Inst;
}
public:
/// Iterates over expressions/statements used in the construct.
class used_clauses_child_iterator
: public llvm::iterator_adaptor_base<
used_clauses_child_iterator, ArrayRef<OMPClause *>::iterator,
std::forward_iterator_tag, Stmt *, ptrdiff_t, Stmt *, Stmt *> {
ArrayRef<OMPClause *>::iterator End;
OMPClause::child_iterator ChildI, ChildEnd;
void MoveToNext() {
if (ChildI != ChildEnd)
return;
while (this->I != End) {
++this->I;
if (this->I != End) {
ChildI = (*this->I)->used_children().begin();
ChildEnd = (*this->I)->used_children().end();
if (ChildI != ChildEnd)
return;
}
}
}
public:
explicit used_clauses_child_iterator(ArrayRef<OMPClause *> Clauses)
: used_clauses_child_iterator::iterator_adaptor_base(Clauses.begin()),
End(Clauses.end()) {
if (this->I != End) {
ChildI = (*this->I)->used_children().begin();
ChildEnd = (*this->I)->used_children().end();
MoveToNext();
}
}
Stmt *operator*() const { return *ChildI; }
Stmt *operator->() const { return **this; }
used_clauses_child_iterator &operator++() {
++ChildI;
if (ChildI != ChildEnd)
return *this;
if (this->I != End) {
++this->I;
if (this->I != End) {
ChildI = (*this->I)->used_children().begin();
ChildEnd = (*this->I)->used_children().end();
}
}
MoveToNext();
return *this;
}
};
static llvm::iterator_range<used_clauses_child_iterator>
used_clauses_children(ArrayRef<OMPClause *> Clauses) {
return {used_clauses_child_iterator(Clauses),
used_clauses_child_iterator(llvm::makeArrayRef(Clauses.end(), 0))};
}
/// Iterates over a filtered subrange of clauses applied to a
/// directive.
///
/// This iterator visits only clauses of type SpecificClause.
template <typename SpecificClause>
class specific_clause_iterator
: public llvm::iterator_adaptor_base<
specific_clause_iterator<SpecificClause>,
ArrayRef<OMPClause *>::const_iterator, std::forward_iterator_tag,
const SpecificClause *, ptrdiff_t, const SpecificClause *,
const SpecificClause *> {
ArrayRef<OMPClause *>::const_iterator End;
void SkipToNextClause() {
while (this->I != End && !isa<SpecificClause>(*this->I))
++this->I;
}
public:
explicit specific_clause_iterator(ArrayRef<OMPClause *> Clauses)
: specific_clause_iterator::iterator_adaptor_base(Clauses.begin()),
End(Clauses.end()) {
SkipToNextClause();
}
const SpecificClause *operator*() const {
return cast<SpecificClause>(*this->I);
}
const SpecificClause *operator->() const { return **this; }
specific_clause_iterator &operator++() {
++this->I;
SkipToNextClause();
return *this;
}
};
template <typename SpecificClause>
static llvm::iterator_range<specific_clause_iterator<SpecificClause>>
getClausesOfKind(ArrayRef<OMPClause *> Clauses) {
return {specific_clause_iterator<SpecificClause>(Clauses),
specific_clause_iterator<SpecificClause>(
llvm::makeArrayRef(Clauses.end(), 0))};
}
template <typename SpecificClause>
llvm::iterator_range<specific_clause_iterator<SpecificClause>>
getClausesOfKind() const {
return getClausesOfKind<SpecificClause>(clauses());
}
/// Gets a single clause of the specified kind associated with the
/// current directive iff there is only one clause of this kind (and assertion
/// is fired if there is more than one clause is associated with the
/// directive). Returns nullptr if no clause of this kind is associated with
/// the directive.
template <typename SpecificClause>
const SpecificClause *getSingleClause() const {
auto Clauses = getClausesOfKind<SpecificClause>();
if (Clauses.begin() != Clauses.end()) {
assert(std::next(Clauses.begin()) == Clauses.end() &&
"There are at least 2 clauses of the specified kind");
return *Clauses.begin();
}
return nullptr;
}
/// Returns true if the current directive has one or more clauses of a
/// specific kind.
template <typename SpecificClause>
bool hasClausesOfKind() const {
auto Clauses = getClausesOfKind<SpecificClause>();
return Clauses.begin() != Clauses.end();
}
/// Returns starting location of directive kind.
SourceLocation getBeginLoc() const { return StartLoc; }
/// Returns ending location of directive.
SourceLocation getEndLoc() const { return EndLoc; }
/// Set starting location of directive kind.
///
/// \param Loc New starting location of directive.
///
void setLocStart(SourceLocation Loc) { StartLoc = Loc; }
/// Set ending location of directive.
///
/// \param Loc New ending location of directive.
///
void setLocEnd(SourceLocation Loc) { EndLoc = Loc; }
/// Get number of clauses.
unsigned getNumClauses() const {
if (!Data)
return 0;
return Data->getNumClauses();
}
/// Returns specified clause.
///
/// \param I Number of clause.
///
OMPClause *getClause(unsigned I) const { return clauses()[I]; }
/// Returns true if directive has associated statement.
bool hasAssociatedStmt() const { return Data && Data->hasAssociatedStmt(); }
/// Returns statement associated with the directive.
const Stmt *getAssociatedStmt() const {
return const_cast<OMPExecutableDirective *>(this)->getAssociatedStmt();
}
Stmt *getAssociatedStmt() {
assert(hasAssociatedStmt() &&
"Expected directive with the associated statement.");
return Data->getAssociatedStmt();
}
/// Returns the captured statement associated with the
/// component region within the (combined) directive.
///
/// \param RegionKind Component region kind.
const CapturedStmt *getCapturedStmt(OpenMPDirectiveKind RegionKind) const {
assert(hasAssociatedStmt() &&
"Expected directive with the associated statement.");
SmallVector<OpenMPDirectiveKind, 4> CaptureRegions;
getOpenMPCaptureRegions(CaptureRegions, getDirectiveKind());
return Data->getCapturedStmt(RegionKind, CaptureRegions);
}
/// Get innermost captured statement for the construct.
CapturedStmt *getInnermostCapturedStmt() {
assert(hasAssociatedStmt() &&
"Expected directive with the associated statement.");
SmallVector<OpenMPDirectiveKind, 4> CaptureRegions;
getOpenMPCaptureRegions(CaptureRegions, getDirectiveKind());
return Data->getInnermostCapturedStmt(CaptureRegions);
}
const CapturedStmt *getInnermostCapturedStmt() const {
return const_cast<OMPExecutableDirective *>(this)
->getInnermostCapturedStmt();
}
OpenMPDirectiveKind getDirectiveKind() const { return Kind; }
static bool classof(const Stmt *S) {
return S->getStmtClass() >= firstOMPExecutableDirectiveConstant &&
S->getStmtClass() <= lastOMPExecutableDirectiveConstant;
}
child_range children() {
if (!Data)
return child_range(child_iterator(), child_iterator());
return Data->getAssociatedStmtAsRange();
}
const_child_range children() const {
return const_cast<OMPExecutableDirective *>(this)->children();
}
ArrayRef<OMPClause *> clauses() const {
if (!Data)
return llvm::None;
return Data->getClauses();
}
/// Returns whether or not this is a Standalone directive.
///
/// Stand-alone directives are executable directives
/// that have no associated user code.
bool isStandaloneDirective() const;
/// Returns the AST node representing OpenMP structured-block of this
/// OpenMP executable directive,
/// Prerequisite: Executable Directive must not be Standalone directive.
const Stmt *getStructuredBlock() const {
return const_cast<OMPExecutableDirective *>(this)->getStructuredBlock();
}
Stmt *getStructuredBlock();
const Stmt *getRawStmt() const {
return const_cast<OMPExecutableDirective *>(this)->getRawStmt();
}
Stmt *getRawStmt() {
assert(hasAssociatedStmt() &&
"Expected directive with the associated statement.");
return Data->getRawStmt();
}
};
/// This represents '#pragma omp parallel' directive.
///
/// \code
/// #pragma omp parallel private(a,b) reduction(+: c,d)
/// \endcode
/// In this example directive '#pragma omp parallel' has clauses 'private'
/// with the variables 'a' and 'b' and 'reduction' with operator '+' and
/// variables 'c' and 'd'.
///
class OMPParallelDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive (directive keyword).
/// \param EndLoc Ending Location of the directive.
///
OMPParallelDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPParallelDirectiveClass,
llvm::omp::OMPD_parallel, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPParallelDirective()
: OMPExecutableDirective(OMPParallelDirectiveClass,
llvm::omp::OMPD_parallel, SourceLocation(),
SourceLocation()) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) { Data->getChildren()[0] = E; }
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement associated with the directive.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPParallelDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a N clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPParallelDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPParallelDirective *>(this)->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelDirectiveClass;
}
};
/// The base class for all loop-based directives, including loop transformation
/// directives.
class OMPLoopBasedDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
protected:
/// Number of collapsed loops as specified by 'collapse' clause.
unsigned NumAssociatedLoops = 0;
/// Build instance of loop directive of class \a Kind.
///
/// \param SC Statement class.
/// \param Kind Kind of OpenMP directive.
/// \param StartLoc Starting location of the directive (directive keyword).
/// \param EndLoc Ending location of the directive.
/// \param NumAssociatedLoops Number of loops associated with the construct.
///
OMPLoopBasedDirective(StmtClass SC, OpenMPDirectiveKind Kind,
SourceLocation StartLoc, SourceLocation EndLoc,
unsigned NumAssociatedLoops)
: OMPExecutableDirective(SC, Kind, StartLoc, EndLoc),
NumAssociatedLoops(NumAssociatedLoops) {}
public:
/// The expressions built to support OpenMP loops in combined/composite
/// pragmas (e.g. pragma omp distribute parallel for)
struct DistCombinedHelperExprs {
/// DistributeLowerBound - used when composing 'omp distribute' with
/// 'omp for' in a same construct.
Expr *LB;
/// DistributeUpperBound - used when composing 'omp distribute' with
/// 'omp for' in a same construct.
Expr *UB;
/// DistributeEnsureUpperBound - used when composing 'omp distribute'
/// with 'omp for' in a same construct, EUB depends on DistUB
Expr *EUB;
/// Distribute loop iteration variable init used when composing 'omp
/// distribute'
/// with 'omp for' in a same construct
Expr *Init;
/// Distribute Loop condition used when composing 'omp distribute'
/// with 'omp for' in a same construct
Expr *Cond;
/// Update of LowerBound for statically scheduled omp loops for
/// outer loop in combined constructs (e.g. 'distribute parallel for')
Expr *NLB;
/// Update of UpperBound for statically scheduled omp loops for
/// outer loop in combined constructs (e.g. 'distribute parallel for')
Expr *NUB;
/// Distribute Loop condition used when composing 'omp distribute'
/// with 'omp for' in a same construct when schedule is chunked.
Expr *DistCond;
/// 'omp parallel for' loop condition used when composed with
/// 'omp distribute' in the same construct and when schedule is
/// chunked and the chunk size is 1.
Expr *ParForInDistCond;
};
/// The expressions built for the OpenMP loop CodeGen for the
/// whole collapsed loop nest.
struct HelperExprs {
/// Loop iteration variable.
Expr *IterationVarRef;
/// Loop last iteration number.
Expr *LastIteration;
/// Loop number of iterations.
Expr *NumIterations;
/// Calculation of last iteration.
Expr *CalcLastIteration;
/// Loop pre-condition.
Expr *PreCond;
/// Loop condition.
Expr *Cond;
/// Loop iteration variable init.
Expr *Init;
/// Loop increment.
Expr *Inc;
/// IsLastIteration - local flag variable passed to runtime.
Expr *IL;
/// LowerBound - local variable passed to runtime.
Expr *LB;
/// UpperBound - local variable passed to runtime.
Expr *UB;
/// Stride - local variable passed to runtime.
Expr *ST;
/// EnsureUpperBound -- expression UB = min(UB, NumIterations).
Expr *EUB;
/// Update of LowerBound for statically scheduled 'omp for' loops.
Expr *NLB;
/// Update of UpperBound for statically scheduled 'omp for' loops.
Expr *NUB;
/// PreviousLowerBound - local variable passed to runtime in the
/// enclosing schedule or null if that does not apply.
Expr *PrevLB;
/// PreviousUpperBound - local variable passed to runtime in the
/// enclosing schedule or null if that does not apply.
Expr *PrevUB;
/// DistInc - increment expression for distribute loop when found
/// combined with a further loop level (e.g. in 'distribute parallel for')
/// expression IV = IV + ST
Expr *DistInc;
/// PrevEUB - expression similar to EUB but to be used when loop
/// scheduling uses PrevLB and PrevUB (e.g. in 'distribute parallel for'
/// when ensuring that the UB is either the calculated UB by the runtime or
/// the end of the assigned distribute chunk)
/// expression UB = min (UB, PrevUB)
Expr *PrevEUB;
/// Counters Loop counters.
SmallVector<Expr *, 4> Counters;
/// PrivateCounters Loop counters.
SmallVector<Expr *, 4> PrivateCounters;
/// Expressions for loop counters inits for CodeGen.
SmallVector<Expr *, 4> Inits;
/// Expressions for loop counters update for CodeGen.
SmallVector<Expr *, 4> Updates;
/// Final loop counter values for GodeGen.
SmallVector<Expr *, 4> Finals;
/// List of counters required for the generation of the non-rectangular
/// loops.
SmallVector<Expr *, 4> DependentCounters;
/// List of initializers required for the generation of the non-rectangular
/// loops.
SmallVector<Expr *, 4> DependentInits;
/// List of final conditions required for the generation of the
/// non-rectangular loops.
SmallVector<Expr *, 4> FinalsConditions;
/// Init statement for all captured expressions.
Stmt *PreInits;
/// Expressions used when combining OpenMP loop pragmas
DistCombinedHelperExprs DistCombinedFields;
/// Check if all the expressions are built (does not check the
/// worksharing ones).
bool builtAll() {
return IterationVarRef != nullptr && LastIteration != nullptr &&
NumIterations != nullptr && PreCond != nullptr &&
Cond != nullptr && Init != nullptr && Inc != nullptr;
}
/// Initialize all the fields to null.
/// \param Size Number of elements in the
/// counters/finals/updates/dependent_counters/dependent_inits/finals_conditions
/// arrays.
void clear(unsigned Size) {
IterationVarRef = nullptr;
LastIteration = nullptr;
CalcLastIteration = nullptr;
PreCond = nullptr;
Cond = nullptr;
Init = nullptr;
Inc = nullptr;
IL = nullptr;
LB = nullptr;
UB = nullptr;
ST = nullptr;
EUB = nullptr;
NLB = nullptr;
NUB = nullptr;
NumIterations = nullptr;
PrevLB = nullptr;
PrevUB = nullptr;
DistInc = nullptr;
PrevEUB = nullptr;
Counters.resize(Size);
PrivateCounters.resize(Size);
Inits.resize(Size);
Updates.resize(Size);
Finals.resize(Size);
DependentCounters.resize(Size);
DependentInits.resize(Size);
FinalsConditions.resize(Size);
for (unsigned I = 0; I < Size; ++I) {
Counters[I] = nullptr;
PrivateCounters[I] = nullptr;
Inits[I] = nullptr;
Updates[I] = nullptr;
Finals[I] = nullptr;
DependentCounters[I] = nullptr;
DependentInits[I] = nullptr;
FinalsConditions[I] = nullptr;
}
PreInits = nullptr;
DistCombinedFields.LB = nullptr;
DistCombinedFields.UB = nullptr;
DistCombinedFields.EUB = nullptr;
DistCombinedFields.Init = nullptr;
DistCombinedFields.Cond = nullptr;
DistCombinedFields.NLB = nullptr;
DistCombinedFields.NUB = nullptr;
DistCombinedFields.DistCond = nullptr;
DistCombinedFields.ParForInDistCond = nullptr;
}
};
/// Get number of collapsed loops.
unsigned getLoopsNumber() const { return NumAssociatedLoops; }
/// Try to find the next loop sub-statement in the specified statement \p
/// CurStmt.
/// \param TryImperfectlyNestedLoops true, if we need to try to look for the
/// imperfectly nested loop.
static Stmt *tryToFindNextInnerLoop(Stmt *CurStmt,
bool TryImperfectlyNestedLoops);
static const Stmt *tryToFindNextInnerLoop(const Stmt *CurStmt,
bool TryImperfectlyNestedLoops) {
return tryToFindNextInnerLoop(const_cast<Stmt *>(CurStmt),
TryImperfectlyNestedLoops);
}
/// Calls the specified callback function for all the loops in \p CurStmt,
/// from the outermost to the innermost.
static bool
doForAllLoops(Stmt *CurStmt, bool TryImperfectlyNestedLoops,
unsigned NumLoops,
llvm::function_ref<bool(unsigned, Stmt *)> Callback);
static bool
doForAllLoops(const Stmt *CurStmt, bool TryImperfectlyNestedLoops,
unsigned NumLoops,
llvm::function_ref<bool(unsigned, const Stmt *)> Callback) {
auto &&NewCallback = [Callback](unsigned Cnt, Stmt *CurStmt) {
return Callback(Cnt, CurStmt);
};
return doForAllLoops(const_cast<Stmt *>(CurStmt), TryImperfectlyNestedLoops,
NumLoops, NewCallback);
}
/// Calls the specified callback function for all the loop bodies in \p
/// CurStmt, from the outermost loop to the innermost.
static void doForAllLoopsBodies(
Stmt *CurStmt, bool TryImperfectlyNestedLoops, unsigned NumLoops,
llvm::function_ref<void(unsigned, Stmt *, Stmt *)> Callback);
static void doForAllLoopsBodies(
const Stmt *CurStmt, bool TryImperfectlyNestedLoops, unsigned NumLoops,
llvm::function_ref<void(unsigned, const Stmt *, const Stmt *)> Callback) {
auto &&NewCallback = [Callback](unsigned Cnt, Stmt *Loop, Stmt *Body) {
Callback(Cnt, Loop, Body);
};
doForAllLoopsBodies(const_cast<Stmt *>(CurStmt), TryImperfectlyNestedLoops,
NumLoops, NewCallback);
}
static bool classof(const Stmt *T) {
if (auto *D = dyn_cast<OMPExecutableDirective>(T))
return isOpenMPLoopDirective(D->getDirectiveKind());
return false;
}
};
/// This is a common base class for loop directives ('omp simd', 'omp
/// for', 'omp for simd' etc.). It is responsible for the loop code generation.
///
class OMPLoopDirective : public OMPLoopBasedDirective {
friend class ASTStmtReader;
/// Offsets to the stored exprs.
/// This enumeration contains offsets to all the pointers to children
/// expressions stored in OMPLoopDirective.
/// The first 9 children are necessary for all the loop directives,
/// the next 8 are specific to the worksharing ones, and the next 11 are
/// used for combined constructs containing two pragmas associated to loops.
/// After the fixed children, three arrays of length NumAssociatedLoops are
/// allocated: loop counters, their updates and final values.
/// PrevLowerBound and PrevUpperBound are used to communicate blocking
/// information in composite constructs which require loop blocking
/// DistInc is used to generate the increment expression for the distribute
/// loop when combined with a further nested loop
/// PrevEnsureUpperBound is used as the EnsureUpperBound expression for the
/// for loop when combined with a previous distribute loop in the same pragma
/// (e.g. 'distribute parallel for')
///
enum {
IterationVariableOffset = 0,
LastIterationOffset = 1,
CalcLastIterationOffset = 2,
PreConditionOffset = 3,
CondOffset = 4,
InitOffset = 5,
IncOffset = 6,
PreInitsOffset = 7,
// The '...End' enumerators do not correspond to child expressions - they
// specify the offset to the end (and start of the following counters/
// updates/finals/dependent_counters/dependent_inits/finals_conditions
// arrays).
DefaultEnd = 8,
// The following 8 exprs are used by worksharing and distribute loops only.
IsLastIterVariableOffset = 8,
LowerBoundVariableOffset = 9,
UpperBoundVariableOffset = 10,
StrideVariableOffset = 11,
EnsureUpperBoundOffset = 12,
NextLowerBoundOffset = 13,
NextUpperBoundOffset = 14,
NumIterationsOffset = 15,
// Offset to the end for worksharing loop directives.
WorksharingEnd = 16,
PrevLowerBoundVariableOffset = 16,
PrevUpperBoundVariableOffset = 17,
DistIncOffset = 18,
PrevEnsureUpperBoundOffset = 19,
CombinedLowerBoundVariableOffset = 20,
CombinedUpperBoundVariableOffset = 21,
CombinedEnsureUpperBoundOffset = 22,
CombinedInitOffset = 23,
CombinedConditionOffset = 24,
CombinedNextLowerBoundOffset = 25,
CombinedNextUpperBoundOffset = 26,
CombinedDistConditionOffset = 27,
CombinedParForInDistConditionOffset = 28,
// Offset to the end (and start of the following
// counters/updates/finals/dependent_counters/dependent_inits/finals_conditions
// arrays) for combined distribute loop directives.
CombinedDistributeEnd = 29,
};
/// Get the counters storage.
MutableArrayRef<Expr *> getCounters() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind())]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the private counters storage.
MutableArrayRef<Expr *> getPrivateCounters() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the updates storage.
MutableArrayRef<Expr *> getInits() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
2 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the updates storage.
MutableArrayRef<Expr *> getUpdates() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
3 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the final counter updates storage.
MutableArrayRef<Expr *> getFinals() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
4 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the dependent counters storage.
MutableArrayRef<Expr *> getDependentCounters() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
5 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the dependent inits storage.
MutableArrayRef<Expr *> getDependentInits() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
6 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
/// Get the finals conditions storage.
MutableArrayRef<Expr *> getFinalsConditions() {
auto **Storage = reinterpret_cast<Expr **>(
&Data->getChildren()[getArraysOffset(getDirectiveKind()) +
7 * getLoopsNumber()]);
return llvm::makeMutableArrayRef(Storage, getLoopsNumber());
}
protected:
/// Build instance of loop directive of class \a Kind.
///
/// \param SC Statement class.
/// \param Kind Kind of OpenMP directive.
/// \param StartLoc Starting location of the directive (directive keyword).
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed loops from 'collapse' clause.
///
OMPLoopDirective(StmtClass SC, OpenMPDirectiveKind Kind,
SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopBasedDirective(SC, Kind, StartLoc, EndLoc, CollapsedNum) {}
/// Offset to the start of children expression arrays.
static unsigned getArraysOffset(OpenMPDirectiveKind Kind) {
if (isOpenMPLoopBoundSharingDirective(Kind))
return CombinedDistributeEnd;
if (isOpenMPWorksharingDirective(Kind) || isOpenMPTaskLoopDirective(Kind) ||
isOpenMPDistributeDirective(Kind))
return WorksharingEnd;
return DefaultEnd;
}
/// Children number.
static unsigned numLoopChildren(unsigned CollapsedNum,
OpenMPDirectiveKind Kind) {
return getArraysOffset(Kind) +
8 * CollapsedNum; // Counters, PrivateCounters, Inits,
// Updates, Finals, DependentCounters,
// DependentInits, FinalsConditions.
}
void setIterationVariable(Expr *IV) {
Data->getChildren()[IterationVariableOffset] = IV;
}
void setLastIteration(Expr *LI) {
Data->getChildren()[LastIterationOffset] = LI;
}
void setCalcLastIteration(Expr *CLI) {
Data->getChildren()[CalcLastIterationOffset] = CLI;
}
void setPreCond(Expr *PC) { Data->getChildren()[PreConditionOffset] = PC; }
void setCond(Expr *Cond) { Data->getChildren()[CondOffset] = Cond; }
void setInit(Expr *Init) { Data->getChildren()[InitOffset] = Init; }
void setInc(Expr *Inc) { Data->getChildren()[IncOffset] = Inc; }
void setPreInits(Stmt *PreInits) {
Data->getChildren()[PreInitsOffset] = PreInits;
}
void setIsLastIterVariable(Expr *IL) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[IsLastIterVariableOffset] = IL;
}
void setLowerBoundVariable(Expr *LB) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[LowerBoundVariableOffset] = LB;
}
void setUpperBoundVariable(Expr *UB) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[UpperBoundVariableOffset] = UB;
}
void setStrideVariable(Expr *ST) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[StrideVariableOffset] = ST;
}
void setEnsureUpperBound(Expr *EUB) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[EnsureUpperBoundOffset] = EUB;
}
void setNextLowerBound(Expr *NLB) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[NextLowerBoundOffset] = NLB;
}
void setNextUpperBound(Expr *NUB) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[NextUpperBoundOffset] = NUB;
}
void setNumIterations(Expr *NI) {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
Data->getChildren()[NumIterationsOffset] = NI;
}
void setPrevLowerBoundVariable(Expr *PrevLB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[PrevLowerBoundVariableOffset] = PrevLB;
}
void setPrevUpperBoundVariable(Expr *PrevUB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[PrevUpperBoundVariableOffset] = PrevUB;
}
void setDistInc(Expr *DistInc) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[DistIncOffset] = DistInc;
}
void setPrevEnsureUpperBound(Expr *PrevEUB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[PrevEnsureUpperBoundOffset] = PrevEUB;
}
void setCombinedLowerBoundVariable(Expr *CombLB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedLowerBoundVariableOffset] = CombLB;
}
void setCombinedUpperBoundVariable(Expr *CombUB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedUpperBoundVariableOffset] = CombUB;
}
void setCombinedEnsureUpperBound(Expr *CombEUB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedEnsureUpperBoundOffset] = CombEUB;
}
void setCombinedInit(Expr *CombInit) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedInitOffset] = CombInit;
}
void setCombinedCond(Expr *CombCond) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedConditionOffset] = CombCond;
}
void setCombinedNextLowerBound(Expr *CombNLB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedNextLowerBoundOffset] = CombNLB;
}
void setCombinedNextUpperBound(Expr *CombNUB) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
Data->getChildren()[CombinedNextUpperBoundOffset] = CombNUB;
}
void setCombinedDistCond(Expr *CombDistCond) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound distribute sharing directive");
Data->getChildren()[CombinedDistConditionOffset] = CombDistCond;
}
void setCombinedParForInDistCond(Expr *CombParForInDistCond) {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound distribute sharing directive");
Data->getChildren()[CombinedParForInDistConditionOffset] =
CombParForInDistCond;
}
void setCounters(ArrayRef<Expr *> A);
void setPrivateCounters(ArrayRef<Expr *> A);
void setInits(ArrayRef<Expr *> A);
void setUpdates(ArrayRef<Expr *> A);
void setFinals(ArrayRef<Expr *> A);
void setDependentCounters(ArrayRef<Expr *> A);
void setDependentInits(ArrayRef<Expr *> A);
void setFinalsConditions(ArrayRef<Expr *> A);
public:
Expr *getIterationVariable() const {
return cast<Expr>(Data->getChildren()[IterationVariableOffset]);
}
Expr *getLastIteration() const {
return cast<Expr>(Data->getChildren()[LastIterationOffset]);
}
Expr *getCalcLastIteration() const {
return cast<Expr>(Data->getChildren()[CalcLastIterationOffset]);
}
Expr *getPreCond() const {
return cast<Expr>(Data->getChildren()[PreConditionOffset]);
}
Expr *getCond() const { return cast<Expr>(Data->getChildren()[CondOffset]); }
Expr *getInit() const { return cast<Expr>(Data->getChildren()[InitOffset]); }
Expr *getInc() const { return cast<Expr>(Data->getChildren()[IncOffset]); }
const Stmt *getPreInits() const {
return Data->getChildren()[PreInitsOffset];
}
Stmt *getPreInits() { return Data->getChildren()[PreInitsOffset]; }
Expr *getIsLastIterVariable() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[IsLastIterVariableOffset]);
}
Expr *getLowerBoundVariable() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[LowerBoundVariableOffset]);
}
Expr *getUpperBoundVariable() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[UpperBoundVariableOffset]);
}
Expr *getStrideVariable() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[StrideVariableOffset]);
}
Expr *getEnsureUpperBound() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[EnsureUpperBoundOffset]);
}
Expr *getNextLowerBound() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[NextLowerBoundOffset]);
}
Expr *getNextUpperBound() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[NextUpperBoundOffset]);
}
Expr *getNumIterations() const {
assert((isOpenMPWorksharingDirective(getDirectiveKind()) ||
isOpenMPTaskLoopDirective(getDirectiveKind()) ||
isOpenMPDistributeDirective(getDirectiveKind())) &&
"expected worksharing loop directive");
return cast<Expr>(Data->getChildren()[NumIterationsOffset]);
}
Expr *getPrevLowerBoundVariable() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[PrevLowerBoundVariableOffset]);
}
Expr *getPrevUpperBoundVariable() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[PrevUpperBoundVariableOffset]);
}
Expr *getDistInc() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[DistIncOffset]);
}
Expr *getPrevEnsureUpperBound() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[PrevEnsureUpperBoundOffset]);
}
Expr *getCombinedLowerBoundVariable() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedLowerBoundVariableOffset]);
}
Expr *getCombinedUpperBoundVariable() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedUpperBoundVariableOffset]);
}
Expr *getCombinedEnsureUpperBound() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedEnsureUpperBoundOffset]);
}
Expr *getCombinedInit() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedInitOffset]);
}
Expr *getCombinedCond() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedConditionOffset]);
}
Expr *getCombinedNextLowerBound() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedNextLowerBoundOffset]);
}
Expr *getCombinedNextUpperBound() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound sharing directive");
return cast<Expr>(Data->getChildren()[CombinedNextUpperBoundOffset]);
}
Expr *getCombinedDistCond() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound distribute sharing directive");
return cast<Expr>(Data->getChildren()[CombinedDistConditionOffset]);
}
Expr *getCombinedParForInDistCond() const {
assert(isOpenMPLoopBoundSharingDirective(getDirectiveKind()) &&
"expected loop bound distribute sharing directive");
return cast<Expr>(Data->getChildren()[CombinedParForInDistConditionOffset]);
}
Stmt *getBody();
const Stmt *getBody() const {
return const_cast<OMPLoopDirective *>(this)->getBody();
}
ArrayRef<Expr *> counters() { return getCounters(); }
ArrayRef<Expr *> counters() const {
return const_cast<OMPLoopDirective *>(this)->getCounters();
}
ArrayRef<Expr *> private_counters() { return getPrivateCounters(); }
ArrayRef<Expr *> private_counters() const {
return const_cast<OMPLoopDirective *>(this)->getPrivateCounters();
}
ArrayRef<Expr *> inits() { return getInits(); }
ArrayRef<Expr *> inits() const {
return const_cast<OMPLoopDirective *>(this)->getInits();
}
ArrayRef<Expr *> updates() { return getUpdates(); }
ArrayRef<Expr *> updates() const {
return const_cast<OMPLoopDirective *>(this)->getUpdates();
}
ArrayRef<Expr *> finals() { return getFinals(); }
ArrayRef<Expr *> finals() const {
return const_cast<OMPLoopDirective *>(this)->getFinals();
}
ArrayRef<Expr *> dependent_counters() { return getDependentCounters(); }
ArrayRef<Expr *> dependent_counters() const {
return const_cast<OMPLoopDirective *>(this)->getDependentCounters();
}
ArrayRef<Expr *> dependent_inits() { return getDependentInits(); }
ArrayRef<Expr *> dependent_inits() const {
return const_cast<OMPLoopDirective *>(this)->getDependentInits();
}
ArrayRef<Expr *> finals_conditions() { return getFinalsConditions(); }
ArrayRef<Expr *> finals_conditions() const {
return const_cast<OMPLoopDirective *>(this)->getFinalsConditions();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPSimdDirectiveClass ||
T->getStmtClass() == OMPForDirectiveClass ||
T->getStmtClass() == OMPForSimdDirectiveClass ||
T->getStmtClass() == OMPParallelForDirectiveClass ||
T->getStmtClass() == OMPParallelForSimdDirectiveClass ||
T->getStmtClass() == OMPTaskLoopDirectiveClass ||
T->getStmtClass() == OMPTaskLoopSimdDirectiveClass ||
T->getStmtClass() == OMPMasterTaskLoopDirectiveClass ||
T->getStmtClass() == OMPMasterTaskLoopSimdDirectiveClass ||
T->getStmtClass() == OMPParallelMasterTaskLoopDirectiveClass ||
T->getStmtClass() == OMPParallelMasterTaskLoopSimdDirectiveClass ||
T->getStmtClass() == OMPDistributeDirectiveClass ||
T->getStmtClass() == OMPTargetParallelForDirectiveClass ||
T->getStmtClass() == OMPDistributeParallelForDirectiveClass ||
T->getStmtClass() == OMPDistributeParallelForSimdDirectiveClass ||
T->getStmtClass() == OMPDistributeSimdDirectiveClass ||
T->getStmtClass() == OMPTargetParallelForSimdDirectiveClass ||
T->getStmtClass() == OMPTargetSimdDirectiveClass ||
T->getStmtClass() == OMPTeamsDistributeDirectiveClass ||
T->getStmtClass() == OMPTeamsDistributeSimdDirectiveClass ||
T->getStmtClass() ==
OMPTeamsDistributeParallelForSimdDirectiveClass ||
T->getStmtClass() == OMPTeamsDistributeParallelForDirectiveClass ||
T->getStmtClass() ==
OMPTargetTeamsDistributeParallelForDirectiveClass ||
T->getStmtClass() ==
OMPTargetTeamsDistributeParallelForSimdDirectiveClass ||
T->getStmtClass() == OMPTargetTeamsDistributeDirectiveClass ||
T->getStmtClass() == OMPTargetTeamsDistributeSimdDirectiveClass;
}
};
/// This represents '#pragma omp simd' directive.
///
/// \code
/// #pragma omp simd private(a,b) linear(i,j:s) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp simd' has clauses 'private'
/// with the variables 'a' and 'b', 'linear' with variables 'i', 'j' and
/// linear step 's', 'reduction' with operator '+' and variables 'c' and 'd'.
///
class OMPSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPSimdDirectiveClass, llvm::omp::OMPD_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPSimdDirectiveClass, llvm::omp::OMPD_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPSimdDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc, unsigned CollapsedNum,
ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt,
const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPSimdDirective *CreateEmpty(const ASTContext &C, unsigned NumClauses,
unsigned CollapsedNum, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPSimdDirectiveClass;
}
};
/// This represents '#pragma omp for' directive.
///
/// \code
/// #pragma omp for private(a,b) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp for' has clauses 'private' with the
/// variables 'a' and 'b' and 'reduction' with operator '+' and variables 'c'
/// and 'd'.
///
class OMPForDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current directive has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPForDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPForDirectiveClass, llvm::omp::OMPD_for, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPForDirectiveClass, llvm::omp::OMPD_for,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(getLoopsNumber(),
llvm::omp::OMPD_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if current directive has inner cancel directive.
///
static OMPForDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc, unsigned CollapsedNum,
ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs,
Expr *TaskRedRef, bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPForDirective *CreateEmpty(const ASTContext &C, unsigned NumClauses,
unsigned CollapsedNum, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPForDirective *>(this)->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPForDirectiveClass;
}
};
/// This represents '#pragma omp for simd' directive.
///
/// \code
/// #pragma omp for simd private(a,b) linear(i,j:s) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp for simd' has clauses 'private'
/// with the variables 'a' and 'b', 'linear' with variables 'i', 'j' and
/// linear step 's', 'reduction' with operator '+' and variables 'c' and 'd'.
///
class OMPForSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPForSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPForSimdDirectiveClass, llvm::omp::OMPD_for_simd,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPForSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPForSimdDirectiveClass, llvm::omp::OMPD_for_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPForSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPForSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPForSimdDirectiveClass;
}
};
/// This represents '#pragma omp sections' directive.
///
/// \code
/// #pragma omp sections private(a,b) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp sections' has clauses 'private' with
/// the variables 'a' and 'b' and 'reduction' with operator '+' and variables
/// 'c' and 'd'.
///
class OMPSectionsDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current directive has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPSectionsDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPSectionsDirectiveClass,
llvm::omp::OMPD_sections, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPSectionsDirective()
: OMPExecutableDirective(OMPSectionsDirectiveClass,
llvm::omp::OMPD_sections, SourceLocation(),
SourceLocation()) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) { Data->getChildren()[0] = E; }
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if current directive has inner directive.
///
static OMPSectionsDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPSectionsDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPSectionsDirective *>(this)->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPSectionsDirectiveClass;
}
};
/// This represents '#pragma omp section' directive.
///
/// \code
/// #pragma omp section
/// \endcode
///
class OMPSectionDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current directive has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPSectionDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPSectionDirectiveClass,
llvm::omp::OMPD_section, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPSectionDirective()
: OMPExecutableDirective(OMPSectionDirectiveClass,
llvm::omp::OMPD_section, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param HasCancel true if current directive has inner directive.
///
static OMPSectionDirective *Create(const ASTContext &C,
SourceLocation StartLoc,
SourceLocation EndLoc,
Stmt *AssociatedStmt, bool HasCancel);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPSectionDirective *CreateEmpty(const ASTContext &C, EmptyShell);
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPSectionDirectiveClass;
}
};
/// This represents '#pragma omp single' directive.
///
/// \code
/// #pragma omp single private(a,b) copyprivate(c,d)
/// \endcode
/// In this example directive '#pragma omp single' has clauses 'private' with
/// the variables 'a' and 'b' and 'copyprivate' with variables 'c' and 'd'.
///
class OMPSingleDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPSingleDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPSingleDirectiveClass, llvm::omp::OMPD_single,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPSingleDirective()
: OMPExecutableDirective(OMPSingleDirectiveClass, llvm::omp::OMPD_single,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPSingleDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPSingleDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPSingleDirectiveClass;
}
};
/// This represents '#pragma omp master' directive.
///
/// \code
/// #pragma omp master
/// \endcode
///
class OMPMasterDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPMasterDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPMasterDirectiveClass, llvm::omp::OMPD_master,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPMasterDirective()
: OMPExecutableDirective(OMPMasterDirectiveClass, llvm::omp::OMPD_master,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPMasterDirective *Create(const ASTContext &C,
SourceLocation StartLoc,
SourceLocation EndLoc,
Stmt *AssociatedStmt);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPMasterDirective *CreateEmpty(const ASTContext &C, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPMasterDirectiveClass;
}
};
/// This represents '#pragma omp critical' directive.
///
/// \code
/// #pragma omp critical
/// \endcode
///
class OMPCriticalDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Name of the directive.
DeclarationNameInfo DirName;
/// Build directive with the given start and end location.
///
/// \param Name Name of the directive.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPCriticalDirective(const DeclarationNameInfo &Name, SourceLocation StartLoc,
SourceLocation EndLoc)
: OMPExecutableDirective(OMPCriticalDirectiveClass,
llvm::omp::OMPD_critical, StartLoc, EndLoc),
DirName(Name) {}
/// Build an empty directive.
///
explicit OMPCriticalDirective()
: OMPExecutableDirective(OMPCriticalDirectiveClass,
llvm::omp::OMPD_critical, SourceLocation(),
SourceLocation()) {}
/// Set name of the directive.
///
/// \param Name Name of the directive.
///
void setDirectiveName(const DeclarationNameInfo &Name) { DirName = Name; }
public:
/// Creates directive.
///
/// \param C AST context.
/// \param Name Name of the directive.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPCriticalDirective *
Create(const ASTContext &C, const DeclarationNameInfo &Name,
SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPCriticalDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Return name of the directive.
///
DeclarationNameInfo getDirectiveName() const { return DirName; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPCriticalDirectiveClass;
}
};
/// This represents '#pragma omp parallel for' directive.
///
/// \code
/// #pragma omp parallel for private(a,b) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp parallel for' has clauses 'private'
/// with the variables 'a' and 'b' and 'reduction' with operator '+' and
/// variables 'c' and 'd'.
///
class OMPParallelForDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current region has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPParallelForDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelForDirectiveClass,
llvm::omp::OMPD_parallel_for, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPParallelForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelForDirectiveClass,
llvm::omp::OMPD_parallel_for, SourceLocation(),
SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(getLoopsNumber(),
llvm::omp::OMPD_parallel_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if current directive has inner cancel directive.
///
static OMPParallelForDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPParallelForDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_parallel_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPParallelForDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelForDirectiveClass;
}
};
/// This represents '#pragma omp parallel for simd' directive.
///
/// \code
/// #pragma omp parallel for simd private(a,b) linear(i,j:s) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp parallel for simd' has clauses
/// 'private' with the variables 'a' and 'b', 'linear' with variables 'i', 'j'
/// and linear step 's', 'reduction' with operator '+' and variables 'c' and
/// 'd'.
///
class OMPParallelForSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPParallelForSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelForSimdDirectiveClass,
llvm::omp::OMPD_parallel_for_simd, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPParallelForSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelForSimdDirectiveClass,
llvm::omp::OMPD_parallel_for_simd, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPParallelForSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPParallelForSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelForSimdDirectiveClass;
}
};
/// This represents '#pragma omp parallel master' directive.
///
/// \code
/// #pragma omp parallel master private(a,b)
/// \endcode
/// In this example directive '#pragma omp parallel master' has clauses
/// 'private' with the variables 'a' and 'b'
///
class OMPParallelMasterDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
OMPParallelMasterDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPParallelMasterDirectiveClass,
llvm::omp::OMPD_parallel_master, StartLoc,
EndLoc) {}
explicit OMPParallelMasterDirective()
: OMPExecutableDirective(OMPParallelMasterDirectiveClass,
llvm::omp::OMPD_parallel_master,
SourceLocation(), SourceLocation()) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) { Data->getChildren()[0] = E; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
///
static OMPParallelMasterDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *TaskRedRef);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPParallelMasterDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPParallelMasterDirective *>(this)
->getTaskReductionRefExpr();
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelMasterDirectiveClass;
}
};
/// This represents '#pragma omp parallel sections' directive.
///
/// \code
/// #pragma omp parallel sections private(a,b) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp parallel sections' has clauses
/// 'private' with the variables 'a' and 'b' and 'reduction' with operator '+'
/// and variables 'c' and 'd'.
///
class OMPParallelSectionsDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current directive has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPParallelSectionsDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPParallelSectionsDirectiveClass,
llvm::omp::OMPD_parallel_sections, StartLoc,
EndLoc) {}
/// Build an empty directive.
///
explicit OMPParallelSectionsDirective()
: OMPExecutableDirective(OMPParallelSectionsDirectiveClass,
llvm::omp::OMPD_parallel_sections,
SourceLocation(), SourceLocation()) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) { Data->getChildren()[0] = E; }
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if current directive has inner cancel directive.
///
static OMPParallelSectionsDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPParallelSectionsDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPParallelSectionsDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelSectionsDirectiveClass;
}
};
/// This represents '#pragma omp task' directive.
///
/// \code
/// #pragma omp task private(a,b) final(d)
/// \endcode
/// In this example directive '#pragma omp task' has clauses 'private' with the
/// variables 'a' and 'b' and 'final' with condition 'd'.
///
class OMPTaskDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if this directive has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTaskDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTaskDirectiveClass, llvm::omp::OMPD_task,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTaskDirective()
: OMPExecutableDirective(OMPTaskDirectiveClass, llvm::omp::OMPD_task,
SourceLocation(), SourceLocation()) {}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param HasCancel true, if current directive has inner cancel directive.
///
static OMPTaskDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTaskDirective *CreateEmpty(const ASTContext &C, unsigned NumClauses,
EmptyShell);
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskDirectiveClass;
}
};
/// This represents '#pragma omp taskyield' directive.
///
/// \code
/// #pragma omp taskyield
/// \endcode
///
class OMPTaskyieldDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTaskyieldDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTaskyieldDirectiveClass,
llvm::omp::OMPD_taskyield, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTaskyieldDirective()
: OMPExecutableDirective(OMPTaskyieldDirectiveClass,
llvm::omp::OMPD_taskyield, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
static OMPTaskyieldDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPTaskyieldDirective *CreateEmpty(const ASTContext &C, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskyieldDirectiveClass;
}
};
/// This represents '#pragma omp barrier' directive.
///
/// \code
/// #pragma omp barrier
/// \endcode
///
class OMPBarrierDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPBarrierDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPBarrierDirectiveClass,
llvm::omp::OMPD_barrier, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPBarrierDirective()
: OMPExecutableDirective(OMPBarrierDirectiveClass,
llvm::omp::OMPD_barrier, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
static OMPBarrierDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPBarrierDirective *CreateEmpty(const ASTContext &C, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPBarrierDirectiveClass;
}
};
/// This represents '#pragma omp taskwait' directive.
///
/// \code
/// #pragma omp taskwait
/// \endcode
///
class OMPTaskwaitDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTaskwaitDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTaskwaitDirectiveClass,
llvm::omp::OMPD_taskwait, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTaskwaitDirective()
: OMPExecutableDirective(OMPTaskwaitDirectiveClass,
llvm::omp::OMPD_taskwait, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
static OMPTaskwaitDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPTaskwaitDirective *CreateEmpty(const ASTContext &C, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskwaitDirectiveClass;
}
};
/// This represents '#pragma omp taskgroup' directive.
///
/// \code
/// #pragma omp taskgroup
/// \endcode
///
class OMPTaskgroupDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTaskgroupDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTaskgroupDirectiveClass,
llvm::omp::OMPD_taskgroup, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTaskgroupDirective()
: OMPExecutableDirective(OMPTaskgroupDirectiveClass,
llvm::omp::OMPD_taskgroup, SourceLocation(),
SourceLocation()) {}
/// Sets the task_reduction return variable.
void setReductionRef(Expr *RR) { Data->getChildren()[0] = RR; }
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param ReductionRef Reference to the task_reduction return variable.
///
static OMPTaskgroupDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt,
Expr *ReductionRef);
/// Creates an empty directive.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTaskgroupDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Returns reference to the task_reduction return variable.
const Expr *getReductionRef() const {
return const_cast<OMPTaskgroupDirective *>(this)->getReductionRef();
}
Expr *getReductionRef() { return cast_or_null<Expr>(Data->getChildren()[0]); }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskgroupDirectiveClass;
}
};
/// This represents '#pragma omp flush' directive.
///
/// \code
/// #pragma omp flush(a,b)
/// \endcode
/// In this example directive '#pragma omp flush' has 2 arguments- variables 'a'
/// and 'b'.
/// 'omp flush' directive does not have clauses but have an optional list of
/// variables to flush. This list of variables is stored within some fake clause
/// FlushClause.
class OMPFlushDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPFlushDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPFlushDirectiveClass, llvm::omp::OMPD_flush,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPFlushDirective()
: OMPExecutableDirective(OMPFlushDirectiveClass, llvm::omp::OMPD_flush,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses (only single OMPFlushClause clause is
/// allowed).
///
static OMPFlushDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPFlushDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPFlushDirectiveClass;
}
};
/// This represents '#pragma omp depobj' directive.
///
/// \code
/// #pragma omp depobj(a) depend(in:x,y)
/// \endcode
/// In this example directive '#pragma omp depobj' initializes a depobj object
/// 'a' with dependence type 'in' and a list with 'x' and 'y' locators.
class OMPDepobjDirective final : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPDepobjDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPDepobjDirectiveClass, llvm::omp::OMPD_depobj,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPDepobjDirective()
: OMPExecutableDirective(OMPDepobjDirectiveClass, llvm::omp::OMPD_depobj,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
///
static OMPDepobjDirective *Create(const ASTContext &C,
SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPDepobjDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPDepobjDirectiveClass;
}
};
/// This represents '#pragma omp ordered' directive.
///
/// \code
/// #pragma omp ordered
/// \endcode
///
class OMPOrderedDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPOrderedDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPOrderedDirectiveClass,
llvm::omp::OMPD_ordered, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPOrderedDirective()
: OMPExecutableDirective(OMPOrderedDirectiveClass,
llvm::omp::OMPD_ordered, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPOrderedDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
/// \param IsStandalone true, if the the standalone directive is created.
///
static OMPOrderedDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
bool IsStandalone, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPOrderedDirectiveClass;
}
};
/// This represents '#pragma omp atomic' directive.
///
/// \code
/// #pragma omp atomic capture
/// \endcode
/// In this example directive '#pragma omp atomic' has clause 'capture'.
///
class OMPAtomicDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Used for 'atomic update' or 'atomic capture' constructs. They may
/// have atomic expressions of forms
/// \code
/// x = x binop expr;
/// x = expr binop x;
/// \endcode
/// This field is true for the first form of the expression and false for the
/// second. Required for correct codegen of non-associative operations (like
/// << or >>).
bool IsXLHSInRHSPart = false;
/// Used for 'atomic update' or 'atomic capture' constructs. They may
/// have atomic expressions of forms
/// \code
/// v = x; <update x>;
/// <update x>; v = x;
/// \endcode
/// This field is true for the first(postfix) form of the expression and false
/// otherwise.
bool IsPostfixUpdate = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPAtomicDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPAtomicDirectiveClass, llvm::omp::OMPD_atomic,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPAtomicDirective()
: OMPExecutableDirective(OMPAtomicDirectiveClass, llvm::omp::OMPD_atomic,
SourceLocation(), SourceLocation()) {}
/// Set 'x' part of the associated expression/statement.
void setX(Expr *X) { Data->getChildren()[0] = X; }
/// Set helper expression of the form
/// 'OpaqueValueExpr(x) binop OpaqueValueExpr(expr)' or
/// 'OpaqueValueExpr(expr) binop OpaqueValueExpr(x)'.
void setUpdateExpr(Expr *UE) { Data->getChildren()[1] = UE; }
/// Set 'v' part of the associated expression/statement.
void setV(Expr *V) { Data->getChildren()[2] = V; }
/// Set 'expr' part of the associated expression/statement.
void setExpr(Expr *E) { Data->getChildren()[3] = E; }
public:
/// Creates directive with a list of \a Clauses and 'x', 'v' and 'expr'
/// parts of the atomic construct (see Section 2.12.6, atomic Construct, for
/// detailed description of 'x', 'v' and 'expr').
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param X 'x' part of the associated expression/statement.
/// \param V 'v' part of the associated expression/statement.
/// \param E 'expr' part of the associated expression/statement.
/// \param UE Helper expression of the form
/// 'OpaqueValueExpr(x) binop OpaqueValueExpr(expr)' or
/// 'OpaqueValueExpr(expr) binop OpaqueValueExpr(x)'.
/// \param IsXLHSInRHSPart true if \a UE has the first form and false if the
/// second.
/// \param IsPostfixUpdate true if original value of 'x' must be stored in
/// 'v', not an updated one.
static OMPAtomicDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *X, Expr *V,
Expr *E, Expr *UE, bool IsXLHSInRHSPart, bool IsPostfixUpdate);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPAtomicDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Get 'x' part of the associated expression/statement.
Expr *getX() { return cast_or_null<Expr>(Data->getChildren()[0]); }
const Expr *getX() const {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
/// Get helper expression of the form
/// 'OpaqueValueExpr(x) binop OpaqueValueExpr(expr)' or
/// 'OpaqueValueExpr(expr) binop OpaqueValueExpr(x)'.
Expr *getUpdateExpr() { return cast_or_null<Expr>(Data->getChildren()[1]); }
const Expr *getUpdateExpr() const {
return cast_or_null<Expr>(Data->getChildren()[1]);
}
/// Return true if helper update expression has form
/// 'OpaqueValueExpr(x) binop OpaqueValueExpr(expr)' and false if it has form
/// 'OpaqueValueExpr(expr) binop OpaqueValueExpr(x)'.
bool isXLHSInRHSPart() const { return IsXLHSInRHSPart; }
/// Return true if 'v' expression must be updated to original value of
/// 'x', false if 'v' must be updated to the new value of 'x'.
bool isPostfixUpdate() const { return IsPostfixUpdate; }
/// Get 'v' part of the associated expression/statement.
Expr *getV() { return cast_or_null<Expr>(Data->getChildren()[2]); }
const Expr *getV() const {
return cast_or_null<Expr>(Data->getChildren()[2]);
}
/// Get 'expr' part of the associated expression/statement.
Expr *getExpr() { return cast_or_null<Expr>(Data->getChildren()[3]); }
const Expr *getExpr() const {
return cast_or_null<Expr>(Data->getChildren()[3]);
}
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPAtomicDirectiveClass;
}
};
/// This represents '#pragma omp target' directive.
///
/// \code
/// #pragma omp target if(a)
/// \endcode
/// In this example directive '#pragma omp target' has clause 'if' with
/// condition 'a'.
///
class OMPTargetDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTargetDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetDirectiveClass, llvm::omp::OMPD_target,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetDirective()
: OMPExecutableDirective(OMPTargetDirectiveClass, llvm::omp::OMPD_target,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTargetDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetDirectiveClass;
}
};
/// This represents '#pragma omp target data' directive.
///
/// \code
/// #pragma omp target data device(0) if(a) map(b[:])
/// \endcode
/// In this example directive '#pragma omp target data' has clauses 'device'
/// with the value '0', 'if' with condition 'a' and 'map' with array
/// section 'b[:]'.
///
class OMPTargetDataDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
OMPTargetDataDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetDataDirectiveClass,
llvm::omp::OMPD_target_data, StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetDataDirective()
: OMPExecutableDirective(OMPTargetDataDirectiveClass,
llvm::omp::OMPD_target_data, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetDataDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a N clauses.
///
/// \param C AST context.
/// \param N The number of clauses.
///
static OMPTargetDataDirective *CreateEmpty(const ASTContext &C, unsigned N,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetDataDirectiveClass;
}
};
/// This represents '#pragma omp target enter data' directive.
///
/// \code
/// #pragma omp target enter data device(0) if(a) map(b[:])
/// \endcode
/// In this example directive '#pragma omp target enter data' has clauses
/// 'device' with the value '0', 'if' with condition 'a' and 'map' with array
/// section 'b[:]'.
///
class OMPTargetEnterDataDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
OMPTargetEnterDataDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetEnterDataDirectiveClass,
llvm::omp::OMPD_target_enter_data, StartLoc,
EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetEnterDataDirective()
: OMPExecutableDirective(OMPTargetEnterDataDirectiveClass,
llvm::omp::OMPD_target_enter_data,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetEnterDataDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a N clauses.
///
/// \param C AST context.
/// \param N The number of clauses.
///
static OMPTargetEnterDataDirective *CreateEmpty(const ASTContext &C,
unsigned N, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetEnterDataDirectiveClass;
}
};
/// This represents '#pragma omp target exit data' directive.
///
/// \code
/// #pragma omp target exit data device(0) if(a) map(b[:])
/// \endcode
/// In this example directive '#pragma omp target exit data' has clauses
/// 'device' with the value '0', 'if' with condition 'a' and 'map' with array
/// section 'b[:]'.
///
class OMPTargetExitDataDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
OMPTargetExitDataDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetExitDataDirectiveClass,
llvm::omp::OMPD_target_exit_data, StartLoc,
EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetExitDataDirective()
: OMPExecutableDirective(OMPTargetExitDataDirectiveClass,
llvm::omp::OMPD_target_exit_data,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetExitDataDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a N clauses.
///
/// \param C AST context.
/// \param N The number of clauses.
///
static OMPTargetExitDataDirective *CreateEmpty(const ASTContext &C,
unsigned N, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetExitDataDirectiveClass;
}
};
/// This represents '#pragma omp target parallel' directive.
///
/// \code
/// #pragma omp target parallel if(a)
/// \endcode
/// In this example directive '#pragma omp target parallel' has clause 'if' with
/// condition 'a'.
///
class OMPTargetParallelDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTargetParallelDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetParallelDirectiveClass,
llvm::omp::OMPD_target_parallel, StartLoc,
EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetParallelDirective()
: OMPExecutableDirective(OMPTargetParallelDirectiveClass,
llvm::omp::OMPD_target_parallel,
SourceLocation(), SourceLocation()) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) { Data->getChildren()[0] = E; }
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPTargetParallelDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTargetParallelDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[0]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPTargetParallelDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetParallelDirectiveClass;
}
};
/// This represents '#pragma omp target parallel for' directive.
///
/// \code
/// #pragma omp target parallel for private(a,b) reduction(+:c,d)
/// \endcode
/// In this example directive '#pragma omp target parallel for' has clauses
/// 'private' with the variables 'a' and 'b' and 'reduction' with operator '+'
/// and variables 'c' and 'd'.
///
class OMPTargetParallelForDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if current region has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetParallelForDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetParallelForDirectiveClass,
llvm::omp::OMPD_target_parallel_for, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetParallelForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetParallelForDirectiveClass,
llvm::omp::OMPD_target_parallel_for, SourceLocation(),
SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_target_parallel_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if current directive has inner cancel directive.
///
static OMPTargetParallelForDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetParallelForDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_target_parallel_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPTargetParallelForDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetParallelForDirectiveClass;
}
};
/// This represents '#pragma omp teams' directive.
///
/// \code
/// #pragma omp teams if(a)
/// \endcode
/// In this example directive '#pragma omp teams' has clause 'if' with
/// condition 'a'.
///
class OMPTeamsDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTeamsDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTeamsDirectiveClass, llvm::omp::OMPD_teams,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPTeamsDirective()
: OMPExecutableDirective(OMPTeamsDirectiveClass, llvm::omp::OMPD_teams,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTeamsDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTeamsDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTeamsDirectiveClass;
}
};
/// This represents '#pragma omp cancellation point' directive.
///
/// \code
/// #pragma omp cancellation point for
/// \endcode
///
/// In this example a cancellation point is created for innermost 'for' region.
class OMPCancellationPointDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
OpenMPDirectiveKind CancelRegion = llvm::omp::OMPD_unknown;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// statements and child expressions.
///
OMPCancellationPointDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPCancellationPointDirectiveClass,
llvm::omp::OMPD_cancellation_point, StartLoc,
EndLoc) {}
/// Build an empty directive.
explicit OMPCancellationPointDirective()
: OMPExecutableDirective(OMPCancellationPointDirectiveClass,
llvm::omp::OMPD_cancellation_point,
SourceLocation(), SourceLocation()) {}
/// Set cancel region for current cancellation point.
/// \param CR Cancellation region.
void setCancelRegion(OpenMPDirectiveKind CR) { CancelRegion = CR; }
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
static OMPCancellationPointDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
OpenMPDirectiveKind CancelRegion);
/// Creates an empty directive.
///
/// \param C AST context.
///
static OMPCancellationPointDirective *CreateEmpty(const ASTContext &C,
EmptyShell);
/// Get cancellation region for the current cancellation point.
OpenMPDirectiveKind getCancelRegion() const { return CancelRegion; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPCancellationPointDirectiveClass;
}
};
/// This represents '#pragma omp cancel' directive.
///
/// \code
/// #pragma omp cancel for
/// \endcode
///
/// In this example a cancel is created for innermost 'for' region.
class OMPCancelDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
OpenMPDirectiveKind CancelRegion = llvm::omp::OMPD_unknown;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPCancelDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPCancelDirectiveClass, llvm::omp::OMPD_cancel,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPCancelDirective()
: OMPExecutableDirective(OMPCancelDirectiveClass, llvm::omp::OMPD_cancel,
SourceLocation(), SourceLocation()) {}
/// Set cancel region for current cancellation point.
/// \param CR Cancellation region.
void setCancelRegion(OpenMPDirectiveKind CR) { CancelRegion = CR; }
public:
/// Creates directive.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
///
static OMPCancelDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, OpenMPDirectiveKind CancelRegion);
/// Creates an empty directive.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPCancelDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
/// Get cancellation region for the current cancellation point.
OpenMPDirectiveKind getCancelRegion() const { return CancelRegion; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPCancelDirectiveClass;
}
};
/// This represents '#pragma omp taskloop' directive.
///
/// \code
/// #pragma omp taskloop private(a,b) grainsize(val) num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp taskloop' has clauses 'private'
/// with the variables 'a' and 'b', 'grainsize' with expression 'val' and
/// 'num_tasks' with expression 'num'.
///
class OMPTaskLoopDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTaskLoopDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTaskLoopDirectiveClass, llvm::omp::OMPD_taskloop,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTaskLoopDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTaskLoopDirectiveClass, llvm::omp::OMPD_taskloop,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPTaskLoopDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTaskLoopDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum, EmptyShell);
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskLoopDirectiveClass;
}
};
/// This represents '#pragma omp taskloop simd' directive.
///
/// \code
/// #pragma omp taskloop simd private(a,b) grainsize(val) num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp taskloop simd' has clauses 'private'
/// with the variables 'a' and 'b', 'grainsize' with expression 'val' and
/// 'num_tasks' with expression 'num'.
///
class OMPTaskLoopSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTaskLoopSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_taskloop_simd, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTaskLoopSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_taskloop_simd, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTaskLoopSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTaskLoopSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTaskLoopSimdDirectiveClass;
}
};
/// This represents '#pragma omp master taskloop' directive.
///
/// \code
/// #pragma omp master taskloop private(a,b) grainsize(val) num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp master taskloop' has clauses
/// 'private' with the variables 'a' and 'b', 'grainsize' with expression 'val'
/// and 'num_tasks' with expression 'num'.
///
class OMPMasterTaskLoopDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPMasterTaskLoopDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPMasterTaskLoopDirectiveClass,
llvm::omp::OMPD_master_taskloop, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPMasterTaskLoopDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPMasterTaskLoopDirectiveClass,
llvm::omp::OMPD_master_taskloop, SourceLocation(),
SourceLocation(), CollapsedNum) {}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPMasterTaskLoopDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPMasterTaskLoopDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPMasterTaskLoopDirectiveClass;
}
};
/// This represents '#pragma omp master taskloop simd' directive.
///
/// \code
/// #pragma omp master taskloop simd private(a,b) grainsize(val) num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp master taskloop simd' has clauses
/// 'private' with the variables 'a' and 'b', 'grainsize' with expression 'val'
/// and 'num_tasks' with expression 'num'.
///
class OMPMasterTaskLoopSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPMasterTaskLoopSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPMasterTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_master_taskloop_simd, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPMasterTaskLoopSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPMasterTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_master_taskloop_simd, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \p Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPMasterTaskLoopSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \p NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPMasterTaskLoopSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPMasterTaskLoopSimdDirectiveClass;
}
};
/// This represents '#pragma omp parallel master taskloop' directive.
///
/// \code
/// #pragma omp parallel master taskloop private(a,b) grainsize(val)
/// num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp parallel master taskloop' has clauses
/// 'private' with the variables 'a' and 'b', 'grainsize' with expression 'val'
/// and 'num_tasks' with expression 'num'.
///
class OMPParallelMasterTaskLoopDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPParallelMasterTaskLoopDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelMasterTaskLoopDirectiveClass,
llvm::omp::OMPD_parallel_master_taskloop, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPParallelMasterTaskLoopDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelMasterTaskLoopDirectiveClass,
llvm::omp::OMPD_parallel_master_taskloop,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPParallelMasterTaskLoopDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPParallelMasterTaskLoopDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelMasterTaskLoopDirectiveClass;
}
};
/// This represents '#pragma omp parallel master taskloop simd' directive.
///
/// \code
/// #pragma omp parallel master taskloop simd private(a,b) grainsize(val)
/// num_tasks(num)
/// \endcode
/// In this example directive '#pragma omp parallel master taskloop simd' has
/// clauses 'private' with the variables 'a' and 'b', 'grainsize' with
/// expression 'val' and 'num_tasks' with expression 'num'.
///
class OMPParallelMasterTaskLoopSimdDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPParallelMasterTaskLoopSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelMasterTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_parallel_master_taskloop_simd,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPParallelMasterTaskLoopSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPParallelMasterTaskLoopSimdDirectiveClass,
llvm::omp::OMPD_parallel_master_taskloop_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \p Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPParallelMasterTaskLoopSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPParallelMasterTaskLoopSimdDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPParallelMasterTaskLoopSimdDirectiveClass;
}
};
/// This represents '#pragma omp distribute' directive.
///
/// \code
/// #pragma omp distribute private(a,b)
/// \endcode
/// In this example directive '#pragma omp distribute' has clauses 'private'
/// with the variables 'a' and 'b'
///
class OMPDistributeDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPDistributeDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeDirectiveClass,
llvm::omp::OMPD_distribute, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPDistributeDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeDirectiveClass,
llvm::omp::OMPD_distribute, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPDistributeDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPDistributeDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPDistributeDirectiveClass;
}
};
/// This represents '#pragma omp target update' directive.
///
/// \code
/// #pragma omp target update to(a) from(b) device(1)
/// \endcode
/// In this example directive '#pragma omp target update' has clause 'to' with
/// argument 'a', clause 'from' with argument 'b' and clause 'device' with
/// argument '1'.
///
class OMPTargetUpdateDirective : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
///
OMPTargetUpdateDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetUpdateDirectiveClass,
llvm::omp::OMPD_target_update, StartLoc,
EndLoc) {}
/// Build an empty directive.
///
explicit OMPTargetUpdateDirective()
: OMPExecutableDirective(OMPTargetUpdateDirectiveClass,
llvm::omp::OMPD_target_update, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetUpdateDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses, Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses The number of clauses.
///
static OMPTargetUpdateDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetUpdateDirectiveClass;
}
};
/// This represents '#pragma omp distribute parallel for' composite
/// directive.
///
/// \code
/// #pragma omp distribute parallel for private(a,b)
/// \endcode
/// In this example directive '#pragma omp distribute parallel for' has clause
/// 'private' with the variables 'a' and 'b'
///
class OMPDistributeParallelForDirective : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPDistributeParallelForDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeParallelForDirectiveClass,
llvm::omp::OMPD_distribute_parallel_for, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPDistributeParallelForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeParallelForDirectiveClass,
llvm::omp::OMPD_distribute_parallel_for,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_distribute_parallel_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPDistributeParallelForDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPDistributeParallelForDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_distribute_parallel_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPDistributeParallelForDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPDistributeParallelForDirectiveClass;
}
};
/// This represents '#pragma omp distribute parallel for simd' composite
/// directive.
///
/// \code
/// #pragma omp distribute parallel for simd private(x)
/// \endcode
/// In this example directive '#pragma omp distribute parallel for simd' has
/// clause 'private' with the variables 'x'
///
class OMPDistributeParallelForSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPDistributeParallelForSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_distribute_parallel_for_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPDistributeParallelForSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_distribute_parallel_for_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPDistributeParallelForSimdDirective *Create(
const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPDistributeParallelForSimdDirective *CreateEmpty(
const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPDistributeParallelForSimdDirectiveClass;
}
};
/// This represents '#pragma omp distribute simd' composite directive.
///
/// \code
/// #pragma omp distribute simd private(x)
/// \endcode
/// In this example directive '#pragma omp distribute simd' has clause
/// 'private' with the variables 'x'
///
class OMPDistributeSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPDistributeSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeSimdDirectiveClass,
llvm::omp::OMPD_distribute_simd, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPDistributeSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPDistributeSimdDirectiveClass,
llvm::omp::OMPD_distribute_simd, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPDistributeSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPDistributeSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPDistributeSimdDirectiveClass;
}
};
/// This represents '#pragma omp target parallel for simd' directive.
///
/// \code
/// #pragma omp target parallel for simd private(a) map(b) safelen(c)
/// \endcode
/// In this example directive '#pragma omp target parallel for simd' has clauses
/// 'private' with the variable 'a', 'map' with the variable 'b' and 'safelen'
/// with the variable 'c'.
///
class OMPTargetParallelForSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetParallelForSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetParallelForSimdDirectiveClass,
llvm::omp::OMPD_target_parallel_for_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetParallelForSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetParallelForSimdDirectiveClass,
llvm::omp::OMPD_target_parallel_for_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTargetParallelForSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetParallelForSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetParallelForSimdDirectiveClass;
}
};
/// This represents '#pragma omp target simd' directive.
///
/// \code
/// #pragma omp target simd private(a) map(b) safelen(c)
/// \endcode
/// In this example directive '#pragma omp target simd' has clauses 'private'
/// with the variable 'a', 'map' with the variable 'b' and 'safelen' with
/// the variable 'c'.
///
class OMPTargetSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetSimdDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetSimdDirectiveClass,
llvm::omp::OMPD_target_simd, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetSimdDirectiveClass,
llvm::omp::OMPD_target_simd, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTargetSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetSimdDirectiveClass;
}
};
/// This represents '#pragma omp teams distribute' directive.
///
/// \code
/// #pragma omp teams distribute private(a,b)
/// \endcode
/// In this example directive '#pragma omp teams distribute' has clauses
/// 'private' with the variables 'a' and 'b'
///
class OMPTeamsDistributeDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTeamsDistributeDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeDirectiveClass,
llvm::omp::OMPD_teams_distribute, StartLoc, EndLoc,
CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTeamsDistributeDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeDirectiveClass,
llvm::omp::OMPD_teams_distribute, SourceLocation(),
SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTeamsDistributeDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTeamsDistributeDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTeamsDistributeDirectiveClass;
}
};
/// This represents '#pragma omp teams distribute simd'
/// combined directive.
///
/// \code
/// #pragma omp teams distribute simd private(a,b)
/// \endcode
/// In this example directive '#pragma omp teams distribute simd'
/// has clause 'private' with the variables 'a' and 'b'
///
class OMPTeamsDistributeSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTeamsDistributeSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc, unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeSimdDirectiveClass,
llvm::omp::OMPD_teams_distribute_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTeamsDistributeSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeSimdDirectiveClass,
llvm::omp::OMPD_teams_distribute_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTeamsDistributeSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place
/// for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTeamsDistributeSimdDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses,
unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTeamsDistributeSimdDirectiveClass;
}
};
/// This represents '#pragma omp teams distribute parallel for simd' composite
/// directive.
///
/// \code
/// #pragma omp teams distribute parallel for simd private(x)
/// \endcode
/// In this example directive '#pragma omp teams distribute parallel for simd'
/// has clause 'private' with the variables 'x'
///
class OMPTeamsDistributeParallelForSimdDirective final
: public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTeamsDistributeParallelForSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_teams_distribute_parallel_for_simd,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTeamsDistributeParallelForSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_teams_distribute_parallel_for_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTeamsDistributeParallelForSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTeamsDistributeParallelForSimdDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTeamsDistributeParallelForSimdDirectiveClass;
}
};
/// This represents '#pragma omp teams distribute parallel for' composite
/// directive.
///
/// \code
/// #pragma omp teams distribute parallel for private(x)
/// \endcode
/// In this example directive '#pragma omp teams distribute parallel for'
/// has clause 'private' with the variables 'x'
///
class OMPTeamsDistributeParallelForDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTeamsDistributeParallelForDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeParallelForDirectiveClass,
llvm::omp::OMPD_teams_distribute_parallel_for,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTeamsDistributeParallelForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTeamsDistributeParallelForDirectiveClass,
llvm::omp::OMPD_teams_distribute_parallel_for,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_teams_distribute_parallel_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPTeamsDistributeParallelForDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTeamsDistributeParallelForDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(), llvm::omp::OMPD_teams_distribute_parallel_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPTeamsDistributeParallelForDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTeamsDistributeParallelForDirectiveClass;
}
};
/// This represents '#pragma omp target teams' directive.
///
/// \code
/// #pragma omp target teams if(a>0)
/// \endcode
/// In this example directive '#pragma omp target teams' has clause 'if' with
/// condition 'a>0'.
///
class OMPTargetTeamsDirective final : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPTargetTeamsDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPTargetTeamsDirectiveClass,
llvm::omp::OMPD_target_teams, StartLoc, EndLoc) {
}
/// Build an empty directive.
///
explicit OMPTargetTeamsDirective()
: OMPExecutableDirective(OMPTargetTeamsDirectiveClass,
llvm::omp::OMPD_target_teams, SourceLocation(),
SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
///
static OMPTargetTeamsDirective *Create(const ASTContext &C,
SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPTargetTeamsDirective *CreateEmpty(const ASTContext &C,
unsigned NumClauses, EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetTeamsDirectiveClass;
}
};
/// This represents '#pragma omp target teams distribute' combined directive.
///
/// \code
/// #pragma omp target teams distribute private(x)
/// \endcode
/// In this example directive '#pragma omp target teams distribute' has clause
/// 'private' with the variables 'x'
///
class OMPTargetTeamsDistributeDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetTeamsDistributeDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeDirectiveClass,
llvm::omp::OMPD_target_teams_distribute, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetTeamsDistributeDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeDirectiveClass,
llvm::omp::OMPD_target_teams_distribute,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTargetTeamsDistributeDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetTeamsDistributeDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetTeamsDistributeDirectiveClass;
}
};
/// This represents '#pragma omp target teams distribute parallel for' combined
/// directive.
///
/// \code
/// #pragma omp target teams distribute parallel for private(x)
/// \endcode
/// In this example directive '#pragma omp target teams distribute parallel
/// for' has clause 'private' with the variables 'x'
///
class OMPTargetTeamsDistributeParallelForDirective final
: public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// true if the construct has inner cancel directive.
bool HasCancel = false;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetTeamsDistributeParallelForDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeParallelForDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_parallel_for,
StartLoc, EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetTeamsDistributeParallelForDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeParallelForDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_parallel_for,
SourceLocation(), SourceLocation(), CollapsedNum) {}
/// Sets special task reduction descriptor.
void setTaskReductionRefExpr(Expr *E) {
Data->getChildren()[numLoopChildren(
getLoopsNumber(),
llvm::omp::OMPD_target_teams_distribute_parallel_for)] = E;
}
/// Set cancel state.
void setHasCancel(bool Has) { HasCancel = Has; }
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
/// \param TaskRedRef Task reduction special reference expression to handle
/// taskgroup descriptor.
/// \param HasCancel true if this directive has inner cancel directive.
///
static OMPTargetTeamsDistributeParallelForDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs, Expr *TaskRedRef,
bool HasCancel);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetTeamsDistributeParallelForDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
/// Returns special task reduction reference expression.
Expr *getTaskReductionRefExpr() {
return cast_or_null<Expr>(Data->getChildren()[numLoopChildren(
getLoopsNumber(),
llvm::omp::OMPD_target_teams_distribute_parallel_for)]);
}
const Expr *getTaskReductionRefExpr() const {
return const_cast<OMPTargetTeamsDistributeParallelForDirective *>(this)
->getTaskReductionRefExpr();
}
/// Return true if current directive has inner cancel directive.
bool hasCancel() const { return HasCancel; }
static bool classof(const Stmt *T) {
return T->getStmtClass() ==
OMPTargetTeamsDistributeParallelForDirectiveClass;
}
};
/// This represents '#pragma omp target teams distribute parallel for simd'
/// combined directive.
///
/// \code
/// #pragma omp target teams distribute parallel for simd private(x)
/// \endcode
/// In this example directive '#pragma omp target teams distribute parallel
/// for simd' has clause 'private' with the variables 'x'
///
class OMPTargetTeamsDistributeParallelForSimdDirective final
: public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetTeamsDistributeParallelForSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(
OMPTargetTeamsDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_parallel_for_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetTeamsDistributeParallelForSimdDirective(
unsigned CollapsedNum)
: OMPLoopDirective(
OMPTargetTeamsDistributeParallelForSimdDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_parallel_for_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTargetTeamsDistributeParallelForSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetTeamsDistributeParallelForSimdDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() ==
OMPTargetTeamsDistributeParallelForSimdDirectiveClass;
}
};
/// This represents '#pragma omp target teams distribute simd' combined
/// directive.
///
/// \code
/// #pragma omp target teams distribute simd private(x)
/// \endcode
/// In this example directive '#pragma omp target teams distribute simd'
/// has clause 'private' with the variables 'x'
///
class OMPTargetTeamsDistributeSimdDirective final : public OMPLoopDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
/// \param CollapsedNum Number of collapsed nested loops.
///
OMPTargetTeamsDistributeSimdDirective(SourceLocation StartLoc,
SourceLocation EndLoc,
unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeSimdDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_simd, StartLoc,
EndLoc, CollapsedNum) {}
/// Build an empty directive.
///
/// \param CollapsedNum Number of collapsed nested loops.
///
explicit OMPTargetTeamsDistributeSimdDirective(unsigned CollapsedNum)
: OMPLoopDirective(OMPTargetTeamsDistributeSimdDirectiveClass,
llvm::omp::OMPD_target_teams_distribute_simd,
SourceLocation(), SourceLocation(), CollapsedNum) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param CollapsedNum Number of collapsed loops.
/// \param Clauses List of clauses.
/// \param AssociatedStmt Statement, associated with the directive.
/// \param Exprs Helper expressions for CodeGen.
///
static OMPTargetTeamsDistributeSimdDirective *
Create(const ASTContext &C, SourceLocation StartLoc, SourceLocation EndLoc,
unsigned CollapsedNum, ArrayRef<OMPClause *> Clauses,
Stmt *AssociatedStmt, const HelperExprs &Exprs);
/// Creates an empty directive with the place for \a NumClauses clauses.
///
/// \param C AST context.
/// \param CollapsedNum Number of collapsed nested loops.
/// \param NumClauses Number of clauses.
///
static OMPTargetTeamsDistributeSimdDirective *
CreateEmpty(const ASTContext &C, unsigned NumClauses, unsigned CollapsedNum,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTargetTeamsDistributeSimdDirectiveClass;
}
};
/// This represents the '#pragma omp tile' loop transformation directive.
class OMPTileDirective final : public OMPLoopBasedDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Default list of offsets.
enum {
PreInitsOffset = 0,
TransformedStmtOffset,
};
explicit OMPTileDirective(SourceLocation StartLoc, SourceLocation EndLoc,
unsigned NumLoops)
: OMPLoopBasedDirective(OMPTileDirectiveClass, llvm::omp::OMPD_tile,
StartLoc, EndLoc, NumLoops) {}
void setPreInits(Stmt *PreInits) {
Data->getChildren()[PreInitsOffset] = PreInits;
}
void setTransformedStmt(Stmt *S) {
Data->getChildren()[TransformedStmtOffset] = S;
}
public:
/// Create a new AST node representation for '#pragma omp tile'.
///
/// \param C Context of the AST.
/// \param StartLoc Location of the introducer (e.g. the 'omp' token).
/// \param EndLoc Location of the directive's end (e.g. the tok::eod).
/// \param Clauses The directive's clauses.
/// \param NumLoops Number of associated loops (number of items in the
/// 'sizes' clause).
/// \param AssociatedStmt The outermost associated loop.
/// \param TransformedStmt The loop nest after tiling, or nullptr in
/// dependent contexts.
/// \param PreInits Helper preinits statements for the loop nest.
static OMPTileDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses,
unsigned NumLoops, Stmt *AssociatedStmt,
Stmt *TransformedStmt, Stmt *PreInits);
/// Build an empty '#pragma omp tile' AST node for deserialization.
///
/// \param C Context of the AST.
/// \param NumClauses Number of clauses to allocate.
/// \param NumLoops Number of associated loops to allocate.
static OMPTileDirective *CreateEmpty(const ASTContext &C, unsigned NumClauses,
unsigned NumLoops);
unsigned getNumAssociatedLoops() const { return getLoopsNumber(); }
/// Gets/sets the associated loops after tiling.
///
/// This is in de-sugared format stored as a CompoundStmt.
///
/// \code
/// for (...)
/// ...
/// \endcode
///
/// Note that if the generated loops a become associated loops of another
/// directive, they may need to be hoisted before them.
Stmt *getTransformedStmt() const {
return Data->getChildren()[TransformedStmtOffset];
}
/// Return preinits statement.
Stmt *getPreInits() const { return Data->getChildren()[PreInitsOffset]; }
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPTileDirectiveClass;
}
};
/// This represents '#pragma omp scan' directive.
///
/// \code
/// #pragma omp scan inclusive(a)
/// \endcode
/// In this example directive '#pragma omp scan' has clause 'inclusive' with
/// list item 'a'.
class OMPScanDirective final : public OMPExecutableDirective {
friend class ASTStmtReader;
friend class OMPExecutableDirective;
/// Build directive with the given start and end location.
///
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending location of the directive.
///
OMPScanDirective(SourceLocation StartLoc, SourceLocation EndLoc)
: OMPExecutableDirective(OMPScanDirectiveClass, llvm::omp::OMPD_scan,
StartLoc, EndLoc) {}
/// Build an empty directive.
///
explicit OMPScanDirective()
: OMPExecutableDirective(OMPScanDirectiveClass, llvm::omp::OMPD_scan,
SourceLocation(), SourceLocation()) {}
public:
/// Creates directive with a list of \a Clauses.
///
/// \param C AST context.
/// \param StartLoc Starting location of the directive kind.
/// \param EndLoc Ending Location of the directive.
/// \param Clauses List of clauses (only single OMPFlushClause clause is
/// allowed).
///
static OMPScanDirective *Create(const ASTContext &C, SourceLocation StartLoc,
SourceLocation EndLoc,
ArrayRef<OMPClause *> Clauses);
/// Creates an empty directive with the place for \a NumClauses
/// clauses.
///
/// \param C AST context.
/// \param NumClauses Number of clauses.
///
static OMPScanDirective *CreateEmpty(const ASTContext &C, unsigned NumClauses,
EmptyShell);
static bool classof(const Stmt *T) {
return T->getStmtClass() == OMPScanDirectiveClass;
}
};
} // end namespace clang
#endif
|
UsefulFunctions.c | // -------------------------------------------------------------------------------------
// Taken from COSMOLOGY.H
// -------------------------------------------------------------------------------------
#define Ho (double) (cosmo_params_ufunc->hlittle*3.2407e-18) // s^-1 at z=0
#define RHOcrit (double) ( (3.0*Ho*Ho / (8.0*PI*G)) * (CMperMPC*CMperMPC*CMperMPC)/Msun) // Msun Mpc^-3 ---- at z=0
#define RHOcrit_cgs (double) (3.0*Ho*Ho / (8.0*PI*G)) // g pcm^-3 ---- at z=0
#define No (double) (RHOcrit_cgs*cosmo_params_ufunc->OMb*(1-global_params.Y_He)/m_p) // current hydrogen number density estimate (#/cm^3) ~1.92e-7
#define He_No (double) (RHOcrit_cgs*cosmo_params_ufunc->OMb*global_params.Y_He/(4.0*m_p)) // current helium number density estimate
#define N_b0 (double) (No+He_No) // present-day baryon num density, H + He
#define f_H (double) (No/(No+He_No)) // hydrogen number fraction
#define f_He (double) (He_No/(No+He_No)) // helium number fraction
struct CosmoParams *cosmo_params_ufunc;
struct UserParams *user_params_ufunc;
void Broadcast_struct_global_UF(struct UserParams *user_params, struct CosmoParams *cosmo_params){
cosmo_params_ufunc = cosmo_params;
user_params_ufunc = user_params;
}
float ComputeFullyIoinizedTemperature(float z_re, float z, float delta){
// z_re: the redshift of reionization
// z: the current redshift
// delta:the density contrast
float result, delta_re;
// just be fully ionized
if (fabs(z - z_re) < 1e-4)
result = 1;
else{
// linearly extrapolate to get density at reionization
delta_re = delta * (1. + z ) / (1. + z_re);
if (delta_re<=-1) delta_re=-1. + global_params.MIN_DENSITY_LOW_LIMIT;
// evolving ionized box eq. 6 of McQuinn 2015, ignored the dependency of density at ionization
if (delta<=-1) delta=-1. + global_params.MIN_DENSITY_LOW_LIMIT;
result = pow((1. + delta) / (1. + delta_re), 1.1333);
result *= pow((1. + z) / (1. + z_re), 3.4);
result *= expf(pow((1. + z)/7.1, 2.5) - pow((1. + z_re)/7.1, 2.5));
}
result *= pow(global_params.T_RE, 1.7);
// 1e4 before helium reionization; double it after
result += pow(1e4 * ((1. + z)/4.), 1.7) * ( 1 + delta);
result = pow(result, 0.5882);
//LOG_DEBUG("z_re=%.4f, z=%.4f, delta=%e, Tk=%.f", z_re, z, delta, result);
return result;
}
float ComputePartiallyIoinizedTemperature(float T_HI, float res_xH){
if (res_xH<=0.) return global_params.T_RE;
if (res_xH>=1) return T_HI;
return T_HI * res_xH + global_params.T_RE * (1. - res_xH);
}
void filter_box(fftwf_complex *box, int RES, int filter_type, float R){
int n_x, n_z, n_y, dimension,midpoint;
float k_x, k_y, k_z, k_mag, kR;
switch(RES) {
case 0:
dimension = user_params_ufunc->DIM;
midpoint = MIDDLE;
break;
case 1:
dimension = user_params_ufunc->HII_DIM;
midpoint = HII_MIDDLE;
break;
}
// loop through k-box
#pragma omp parallel shared(box) private(n_x,n_y,n_z,k_x,k_y,k_z,k_mag,kR) num_threads(user_params_ufunc->N_THREADS)
{
#pragma omp for
for (n_x=0; n_x<dimension; n_x++){
// for (n_x=dimension; n_x--;){
if (n_x>midpoint) {k_x =(n_x-dimension) * DELTA_K;}
else {k_x = n_x * DELTA_K;}
for (n_y=0; n_y<dimension; n_y++){
// for (n_y=dimension; n_y--;){
if (n_y>midpoint) {k_y =(n_y-dimension) * DELTA_K;}
else {k_y = n_y * DELTA_K;}
// for (n_z=(midpoint+1); n_z--;){
for (n_z=0; n_z<=midpoint; n_z++){
k_z = n_z * DELTA_K;
if (filter_type == 0){ // real space top-hat
k_mag = sqrt(k_x*k_x + k_y*k_y + k_z*k_z);
kR = k_mag*R; // real space top-hat
if (kR > 1e-4){
if(RES==1) { box[HII_C_INDEX(n_x, n_y, n_z)] *= 3.0*pow(kR, -3) * (sin(kR) - cos(kR)*kR); }
if(RES==0) { box[C_INDEX(n_x, n_y, n_z)] *= 3.0*pow(kR, -3) * (sin(kR) - cos(kR)*kR); }
}
}
else if (filter_type == 1){ // k-space top hat
// This is actually (kR^2) but since we zero the value and find kR > 1 this is more computationally efficient
// as we don't need to evaluate the slower sqrt function
// kR = 0.17103765852*( k_x*k_x + k_y*k_y + k_z*k_z )*R*R;
k_mag = sqrt(k_x*k_x + k_y*k_y + k_z*k_z);
kR = k_mag*R; // real space top-hat
kR *= 0.413566994; // equates integrated volume to the real space top-hat (9pi/2)^(-1/3)
if (kR > 1){
if(RES==1) { box[HII_C_INDEX(n_x, n_y, n_z)] = 0; }
if(RES==0) { box[C_INDEX(n_x, n_y, n_z)] = 0; }
}
}
else if (filter_type == 2){ // gaussian
// This is actually (kR^2) but since we zero the value and find kR > 1 this is more computationally efficient
// as we don't need to evaluate the slower sqrt function
kR = 0.643*0.643*( k_x*k_x + k_y*k_y + k_z*k_z )*R*R;
// kR *= 0.643; // equates integrated volume to the real space top-hat
if(RES==1) { box[HII_C_INDEX(n_x, n_y, n_z)] *= pow(E, -kR/2.0); }
if(RES==0) { box[C_INDEX(n_x, n_y, n_z)] *= pow(E, -kR/2.0); }
}
else{
if ( (n_x==0) && (n_y==0) && (n_z==0) )
LOG_WARNING("Filter type %i is undefined. Box is unfiltered.", filter_type);
}
}
}
} // end looping through k box
}
return;
}
double MtoR(double M);
double RtoM(double R);
double TtoM(double z, double T, double mu);
double dicke(double z);
double dtdz(float z);
double ddickedt(double z);
double omega_mz(float z);
double Deltac_nonlinear(float z);
double drdz(float z); /* comoving distance, (1+z)*C*dtdz(in cm) per unit z */
double alpha_A(double T);
/* returns the case B hydrogen recombination coefficient (Spitzer 1978) in cm^3 s^-1*/
double alpha_B(double T);
double HeI_ion_crosssec(double nu);
double HeII_ion_crosssec(double nu);
double HI_ion_crosssec(double nu);
/* R in Mpc, M in Msun */
double MtoR(double M){
// set R according to M<->R conversion defined by the filter type in ../Parameter_files/COSMOLOGY.H
if (global_params.FILTER == 0) //top hat M = (4/3) PI <rho> R^3
return pow(3*M/(4*PI*cosmo_params_ufunc->OMm*RHOcrit), 1.0/3.0);
else if (global_params.FILTER == 1) //gaussian: M = (2PI)^1.5 <rho> R^3
return pow( M/(pow(2*PI, 1.5) * cosmo_params_ufunc->OMm * RHOcrit), 1.0/3.0 );
else // filter not defined
LOG_ERROR("No such filter = %i. Results are bogus.", global_params.FILTER);
Throw ValueError;
}
/* R in Mpc, M in Msun */
double RtoM(double R){
// set M according to M<->R conversion defined by the filter type in ../Parameter_files/COSMOLOGY.H
if (global_params.FILTER == 0) //top hat M = (4/3) PI <rho> R^3
return (4.0/3.0)*PI*pow(R,3)*(cosmo_params_ufunc->OMm*RHOcrit);
else if (global_params.FILTER == 1) //gaussian: M = (2PI)^1.5 <rho> R^3
return pow(2*PI, 1.5) * cosmo_params_ufunc->OMm*RHOcrit * pow(R, 3);
else // filter not defined
LOG_ERROR("No such filter = %i. Results are bogus.", global_params.FILTER);
Throw ValueError;
}
/*
T in K, M in Msun, mu is mean molecular weight
from Barkana & Loeb 2001
SUPRESS = 0 for no radiation field supression;
SUPRESS = 1 for supression (step function at z=z_ss, at v=v_zz)
*/
double TtoM(double z, double T, double mu){
return 7030.97 / (cosmo_params_ufunc->hlittle) * sqrt( omega_mz(z) / (cosmo_params_ufunc->OMm*Deltac_nonlinear(z))) *
pow( T/(mu * (1+z)), 1.5 );
/* if (!SUPRESS || (z >= z_re) ) // pre-reionization or don't worry about supression
return 7030.97 / hlittle * sqrt( omega_mz(z) / (OMm*Deltac_nonlinear(z)) ) *
pow( T/(mu * (1+z)), 1.5 );
if (z >= z_ss) // self-shielding dominates, use T = 1e4 K
return 7030.97 / hlittle * sqrt( omega_mz(z) / (OMm*Deltac_nonlinear(z)) ) *
pow( 1.0e4 /(mu * (1+z)), 1.5 );
// optically thin
return 7030.97 / hlittle * sqrt( omega_mz(z) / (OMm*Deltac_nonlinear(z)) ) *
pow( VcirtoT(v_ss, mu) /(mu * (1+z)), 1.5 );
*/
}
/* Physical (non-linear) overdensity at virialization (relative to critical density)
i.e. answer is rho / rho_crit
In Einstein de sitter model = 178
(fitting formula from Bryan & Norman 1998) */
double Deltac_nonlinear(float z){
double d;
d = omega_mz(z) - 1.0;
return 18*PI*PI + 82*d - 39*d*d;
}
/* Omega matter at redshift z */
double omega_mz(float z){
return cosmo_params_ufunc->OMm*pow(1+z,3) / (cosmo_params_ufunc->OMm*pow(1+z,3) + cosmo_params_ufunc->OMl + global_params.OMr*pow(1+z,4) + global_params.OMk*pow(1+z, 2));
}
/*
FUNCTION dicke(z)
Computes the dicke growth function at redshift z, i.e. the z dependance part of sigma
References: Peebles, "Large-Scale...", pg.53 (eq. 11.16). Includes omega<=1
Nonzero Lambda case from Liddle et al, astro-ph/9512102, eqs. 6-8.
and quintessence case from Wang et al, astro-ph/9804015
Normalized to dicke(z=0)=1
*/
double dicke(double z){
double omegaM_z, dick_z, dick_0, x, x_0;
double tiny = 1e-4;
if (fabs(cosmo_params_ufunc->OMm-1.0) < tiny){ //OMm = 1 (Einstein de-Sitter)
return 1.0/(1.0+z);
}
else if ( (cosmo_params_ufunc->OMl > (-tiny)) && (fabs(cosmo_params_ufunc->OMl+cosmo_params_ufunc->OMm+global_params.OMr-1.0) < 0.01) && (fabs(global_params.wl+1.0) < tiny) ){
//this is a flat, cosmological CONSTANT universe, with only lambda, matter and radiation
//it is taken from liddle et al.
omegaM_z = cosmo_params_ufunc->OMm*pow(1+z,3) / ( cosmo_params_ufunc->OMl + cosmo_params_ufunc->OMm*pow(1+z,3) + global_params.OMr*pow(1+z,4) );
dick_z = 2.5*omegaM_z / ( 1.0/70.0 + omegaM_z*(209-omegaM_z)/140.0 + pow(omegaM_z, 4.0/7.0) );
dick_0 = 2.5*cosmo_params_ufunc->OMm / ( 1.0/70.0 + cosmo_params_ufunc->OMm*(209-cosmo_params_ufunc->OMm)/140.0 + pow(cosmo_params_ufunc->OMm, 4.0/7.0) );
return dick_z / (dick_0 * (1.0+z));
}
else if ( (global_params.OMtot < (1+tiny)) && (fabs(cosmo_params_ufunc->OMl) < tiny) ){ //open, zero lambda case (peebles, pg. 53)
x_0 = 1.0/(cosmo_params_ufunc->OMm+0.0) - 1.0;
dick_0 = 1 + 3.0/x_0 + 3*log(sqrt(1+x_0)-sqrt(x_0))*sqrt(1+x_0)/pow(x_0,1.5);
x = fabs(1.0/(cosmo_params_ufunc->OMm+0.0) - 1.0) / (1+z);
dick_z = 1 + 3.0/x + 3*log(sqrt(1+x)-sqrt(x))*sqrt(1+x)/pow(x,1.5);
return dick_z/dick_0;
}
else if ( (cosmo_params_ufunc->OMl > (-tiny)) && (fabs(global_params.OMtot-1.0) < tiny) && (fabs(global_params.wl+1) > tiny) ){
LOG_WARNING("IN WANG.");
Throw ValueError;
}
LOG_ERROR("No growth function!");
Throw ValueError;
}
/* function DTDZ returns the value of dt/dz at the redshift parameter z. */
double dtdz(float z){
double x, dxdz, const1, denom, numer;
x = sqrt( cosmo_params_ufunc->OMl/cosmo_params_ufunc->OMm ) * pow(1+z, -3.0/2.0);
dxdz = sqrt( cosmo_params_ufunc->OMl/cosmo_params_ufunc->OMm ) * pow(1+z, -5.0/2.0) * (-3.0/2.0);
const1 = 2 * sqrt( 1 + cosmo_params_ufunc->OMm/cosmo_params_ufunc->OMl ) / (3.0 * Ho) ;
numer = dxdz * (1 + x*pow( pow(x,2) + 1, -0.5));
denom = x + sqrt(pow(x,2) + 1);
return (const1 * numer / denom);
}
/* Time derivative of the growth function at z */
double ddickedt(double z){
float dz = 1e-10;
double omegaM_z, ddickdz, dick_0, x, x_0, domegaMdz;
double tiny = 1e-4;
return (dicke(z+dz)-dicke(z))/dz/dtdz(z); // lazy non-analytic form getting
if (fabs(cosmo_params_ufunc->OMm-1.0) < tiny){ //OMm = 1 (Einstein de-Sitter)
return -pow(1+z,-2)/dtdz(z);
}
else if ( (cosmo_params_ufunc->OMl > (-tiny)) && (fabs(cosmo_params_ufunc->OMl+cosmo_params_ufunc->OMm+global_params.OMr-1.0) < 0.01) && (fabs(global_params.wl+1.0) < tiny) ){
//this is a flat, cosmological CONSTANT universe, with only lambda, matter and radiation
//it is taken from liddle et al.
omegaM_z = cosmo_params_ufunc->OMm*pow(1+z,3) / ( cosmo_params_ufunc->OMl + cosmo_params_ufunc->OMm*pow(1+z,3) + global_params.OMr*pow(1+z,4) );
domegaMdz = omegaM_z*3/(1+z) - cosmo_params_ufunc->OMm*pow(1+z,3)*pow(cosmo_params_ufunc->OMl + cosmo_params_ufunc->OMm*pow(1+z,3) + global_params.OMr*pow(1+z,4), -2) * (3*cosmo_params_ufunc->OMm*(1+z)*(1+z) + 4*global_params.OMr*pow(1+z,3));
dick_0 = cosmo_params_ufunc->OMm / ( 1.0/70.0 + cosmo_params_ufunc->OMm*(209-cosmo_params_ufunc->OMm)/140.0 + pow(cosmo_params_ufunc->OMm, 4.0/7.0) );
ddickdz = (domegaMdz/(1+z)) * (1.0/70.0*pow(omegaM_z,-2) + 1.0/140.0 + 3.0/7.0*pow(omegaM_z, -10.0/3.0)) * pow(1.0/70.0/omegaM_z + (209.0-omegaM_z)/140.0 + pow(omegaM_z, -3.0/7.0) , -2);
ddickdz -= pow(1+z,-2)/(1.0/70.0/omegaM_z + (209.0-omegaM_z)/140.0 + pow(omegaM_z, -3.0/7.0));
return ddickdz / dick_0 / dtdz(z);
}
LOG_ERROR("No growth function!");
Throw ValueError;
}
/* returns the hubble "constant" (in 1/sec) at z */
double hubble(float z){
return Ho*sqrt(cosmo_params_ufunc->OMm*pow(1+z,3) + global_params.OMr*pow(1+z,4) + cosmo_params_ufunc->OMl);
}
/* returns hubble time (in sec), t_h = 1/H */
double t_hubble(float z){
return 1.0/hubble(z);
}
/* comoving distance (in cm) per unit redshift */
double drdz(float z){
return (1.0+z)*C*dtdz(z);
}
/* returns the case A hydrogen recombination coefficient (Abel et al. 1997) in cm^3 s^-1*/
double alpha_A(double T){
double logT, ans;
logT = log(T/(double)1.1604505e4);
ans = pow(E, -28.6130338 - 0.72411256*logT - 2.02604473e-2*pow(logT, 2)
- 2.38086188e-3*pow(logT, 3) - 3.21260521e-4*pow(logT, 4)
- 1.42150291e-5*pow(logT, 5) + 4.98910892e-6*pow(logT, 6)
+ 5.75561414e-7*pow(logT, 7) - 1.85676704e-8*pow(logT, 8)
- 3.07113524e-9 * pow(logT, 9));
return ans;
}
/* returns the case B hydrogen recombination coefficient (Spitzer 1978) in cm^3 s^-1*/
double alpha_B(double T){
return alphaB_10k * pow (T/1.0e4, -0.75);
}
/*
Function NEUTRAL_FRACTION returns the hydrogen neutral fraction, chi, given:
hydrogen density (pcm^-3)
gas temperature (10^4 K)
ionization rate (1e-12 s^-1)
*/
double neutral_fraction(double density, double T4, double gamma, int usecaseB){
double chi, b, alpha, corr_He = 1.0/(4.0/global_params.Y_He - 3);
if (usecaseB)
alpha = alpha_B(T4*1e4);
else
alpha = alpha_A(T4*1e4);
gamma *= 1e-12;
// approximation chi << 1
chi = (1+corr_He)*density * alpha / gamma;
if (chi < TINY){ return 0;}
if (chi < 1e-5)
return chi;
// this code, while mathematically accurate, is numerically buggy for very small x_HI, so i will use valid approximation x_HI <<1 above when x_HI < 1e-5, and this otherwise... the two converge seemlessly
//get solutions of quadratic of chi (neutral fraction)
b = -2 - gamma / (density*(1+corr_He)*alpha);
chi = ( -b - sqrt(b*b - 4) ) / 2.0; //correct root
return chi;
}
/* function HeI_ion_crosssec returns the HI ionization cross section at parameter frequency
(taken from Verner et al (1996) */
double HeI_ion_crosssec(double nu){
double x,y,Fy;
if (nu < HeI_NUIONIZATION)
return 0;
x = nu/NU_over_EV/13.61 - 0.4434;
y = sqrt(x*x + pow(2.136, 2));
return 9.492e-16*((x-1)*(x-1) + 2.039*2.039) *
pow(y, (0.5 * 3.188 - 5.5))
* pow(1.0 + sqrt(y/1.469), -3.188);
}
/* function HeII_ion_crosssec returns the HeII ionization cross section at parameter frequency
(taken from Osterbrock, pg. 14) */
double HeII_ion_crosssec(double nu){
double epsilon, Z = 2;
if (nu < HeII_NUIONIZATION)
return 0;
if (nu == HeII_NUIONIZATION)
nu+=TINY;
epsilon = sqrt( nu/HeII_NUIONIZATION - 1);
return (6.3e-18)/Z/Z * pow(HeII_NUIONIZATION/nu, 4)
* pow(E, 4-(4*atan(epsilon)/epsilon)) / (1-pow(E, -2*PI/epsilon));
}
/* function HI_ion_crosssec returns the HI ionization cross section at parameter frequency
(taken from Osterbrock, pg. 14) */
double HI_ion_crosssec(double nu){
double epsilon, Z = 1;
if (nu < NUIONIZATION)
return 0;
if (nu == NUIONIZATION)
nu+=TINY;
epsilon = sqrt( nu/NUIONIZATION - 1);
return (6.3e-18)/Z/Z * pow(NUIONIZATION/nu, 4)
* pow(E, 4-(4*atan(epsilon)/epsilon)) / (1-pow(E, -2*PI/epsilon));
}
/* Return the thomspon scattering optical depth from zstart to zend through fully ionized IGM.
The hydrogen reionization history is given by the zarry and xHarry parameters, in increasing
redshift order of length len.*/
typedef struct{
float *z, *xH;
int len;
} tau_e_params;
double dtau_e_dz(double z, void *params){
float xH, xi;
int i=1;
tau_e_params p = *(tau_e_params *)params;
if ((p.len == 0) || !(p.z)) {
return (1+z)*(1+z)*drdz(z);
}
else{
// find where we are in the redshift array
if (p.z[0]>z) // ionization fraction is 1 prior to start of array
return (1+z)*(1+z)*drdz(z);
while ( (i < p.len) && (p.z[i] < z) ) {i++;}
if (i == p.len)
return 0;
// linearly interpolate in redshift
xH = p.xH[i-1] + (p.xH[i] - p.xH[i-1])/(p.z[i] - p.z[i-1]) * (z - p.z[i-1]);
xi = 1.0-xH;
if (xi<0){
LOG_WARNING("in taue: funny business xi=%e, changing to 0.", xi);
xi=0;
}
if (xi>1){
LOG_WARNING("in taue: funny business xi=%e, changing to 1", xi);
xi=1;
}
return xi*(1+z)*(1+z)*drdz(z);
}
}
double tau_e(float zstart, float zend, float *zarry, float *xHarry, int len){
double prehelium, posthelium, error;
gsl_function F;
double rel_tol = 1e-3; //<- relative tolerance
gsl_integration_workspace * w
= gsl_integration_workspace_alloc (1000);
tau_e_params p;
if (zstart >= zend){
LOG_ERROR("in tau_e: First parameter must be smaller than the second.\n");
Throw ValueError;
}
F.function = &dtau_e_dz;
p.z = zarry;
p.xH = xHarry;
p.len = len;
F.params = &p;
if ((len > 0) && zarry)
zend = zarry[len-1] - FRACT_FLOAT_ERR;
int status;
gsl_set_error_handler_off();
if (zend > global_params.Zreion_HeII){// && (zstart < Zreion_HeII)){
if (zstart < global_params.Zreion_HeII){
status = gsl_integration_qag (&F, global_params.Zreion_HeII, zstart, 0, rel_tol,
1000, GSL_INTEG_GAUSS61, w, &prehelium, &error);
if(status!=0) {
LOG_ERROR("gsl integration error occured!");
LOG_ERROR("(function argument): lower_limit=%e upper_limit=%e rel_tol=%e result=%e error=%e",global_params.Zreion_HeII,zstart,rel_tol,prehelium,error);
LOG_ERROR("data: zstart=%e zend=%e",zstart,zend);
GSL_ERROR(status);
}
status = gsl_integration_qag (&F, zend, global_params.Zreion_HeII, 0, rel_tol,
1000, GSL_INTEG_GAUSS61, w, &posthelium, &error);
if(status!=0) {
LOG_ERROR("gsl integration error occured!");
LOG_ERROR("(function argument): lower_limit=%e upper_limit=%e rel_tol=%e result=%e error=%e",zend,global_params.Zreion_HeII,rel_tol,posthelium,error);
LOG_ERROR("data: zstart=%e zend=%e",zstart,zend);
GSL_ERROR(status);
}
}
else{
prehelium = 0;
status = gsl_integration_qag (&F, zend, zstart, 0, rel_tol,
1000, GSL_INTEG_GAUSS61, w, &posthelium, &error);
if(status!=0) {
LOG_ERROR("gsl integration error occured!");
LOG_ERROR("(function argument): lower_limit=%e upper_limit=%e rel_tol=%e result=%e error=%e",zend,zstart,rel_tol,posthelium,error);
GSL_ERROR(status);
}
}
}
else{
posthelium = 0;
status = gsl_integration_qag (&F, zend, zstart, 0, rel_tol,
1000, GSL_INTEG_GAUSS61, w, &prehelium, &error);
if(status!=0) {
LOG_ERROR("gsl integration error occured!");
LOG_ERROR("(function argument): lower_limit=%e upper_limit=%e rel_tol=%e result=%e error=%e",zend,zstart,rel_tol,prehelium,error);
GSL_ERROR(status);
}
}
gsl_integration_workspace_free (w);
return SIGMAT * ( (N_b0+He_No)*prehelium + N_b0*posthelium );
}
float ComputeTau(struct UserParams *user_params, struct CosmoParams *cosmo_params, int NPoints, float *redshifts, float *global_xHI) {
int i;
float tau;
Broadcast_struct_global_UF(user_params,cosmo_params);
tau = tau_e(0, redshifts[NPoints-1], redshifts, global_xHI, NPoints);
return tau;
}
void writeUserParams(struct UserParams *p){
LOG_INFO("UserParams: [HII_DIM=%d, DIM=%d, BOX_LEN=%f, HMF=%d, POWER_SPECTRUM=%d, USE_RELATIVE_VELOCITIES=%d, N_THREADS=%d, PERTURB_ON_HIGH_RES=%d, NO_RNG=%d, USE_FFTW_WISDOM=%d, USE_INTERPOLATION_TABLES=%d, FAST_FCOLL_TABLES=%d]",
p->HII_DIM, p->DIM, p->BOX_LEN, p->HMF, p->POWER_SPECTRUM, p->USE_RELATIVE_VELOCITIES, p->N_THREADS, p->PERTURB_ON_HIGH_RES, p->NO_RNG, p->USE_FFTW_WISDOM, p->USE_INTERPOLATION_TABLES, p->FAST_FCOLL_TABLES);
}
void writeCosmoParams(struct CosmoParams *p){
LOG_INFO("CosmoParams: [SIGMA_8=%f, hlittle=%f, OMm=%f, OMl=%f, OMb=%f, POWER_INDEX=%f]",
p->SIGMA_8, p->hlittle, p->OMm, p->OMl, p->OMb, p->POWER_INDEX);
}
void writeAstroParams(struct FlagOptions *fo, struct AstroParams *p){
if(fo->USE_MASS_DEPENDENT_ZETA) {
LOG_INFO("AstroParams: [HII_EFF_FACTOR=%f, ALPHA_STAR=%f, ALPHA_STAR_MINI=%f, F_ESC10=%f (F_ESC7_MINI=%f), ALPHA_ESC=%f, M_TURN=%f, R_BUBBLE_MAX=%f, L_X=%e (L_X_MINI=%e), NU_X_THRESH=%f, X_RAY_SPEC_INDEX=%f, F_STAR10=%f (F_STAR7_MINI=%f), t_STAR=%f, N_RSD_STEPS=%f]",
p->HII_EFF_FACTOR, p->ALPHA_STAR, p->ALPHA_STAR_MINI, p->F_ESC10,p->F_ESC7_MINI, p->ALPHA_ESC, p->M_TURN,
p->R_BUBBLE_MAX, p->L_X, p->L_X_MINI, p->NU_X_THRESH, p->X_RAY_SPEC_INDEX, p->F_STAR10, p->F_STAR7_MINI, p->t_STAR, p->N_RSD_STEPS);
}
else {
LOG_INFO("AstroParams: [HII_EFF_FACTOR=%f, ION_Tvir_MIN=%f, X_RAY_Tvir_MIN=%f, R_BUBBLE_MAX=%f, L_X=%e, NU_X_THRESH=%f, X_RAY_SPEC_INDEX=%f, F_STAR10=%f, t_STAR=%f, N_RSD_STEPS=%f]",
p->HII_EFF_FACTOR, p->ION_Tvir_MIN, p->X_RAY_Tvir_MIN,
p->R_BUBBLE_MAX, p->L_X, p->NU_X_THRESH, p->X_RAY_SPEC_INDEX, p->F_STAR10, p->t_STAR, p->N_RSD_STEPS);
}
}
void writeFlagOptions(struct FlagOptions *p){
LOG_INFO("FlagOptions: [USE_HALO_FIELD=%d, USE_MINI_HALOS=%d, USE_MASS_DEPENDENT_ZETA=%d, SUBCELL_RSD=%d, INHOMO_RECO=%d, USE_TS_FLUCT=%d, M_MIN_in_Mass=%d, PHOTON_CONS=%d]",
p->USE_HALO_FIELD, p->USE_MINI_HALOS, p->USE_MASS_DEPENDENT_ZETA, p->SUBCELL_RSD, p->INHOMO_RECO, p->USE_TS_FLUCT, p->M_MIN_in_Mass, p->PHOTON_CONS);
}
char *print_output_header(int print_pid, const char *name){
char * pid = malloc(12*sizeof(char));
if(print_pid){
sprintf(pid, "<%d>\t", getpid());
}else{
sprintf(pid, "");
}
printf("%s%s:\n", pid, name);
return (pid);
}
void print_corners_real(float *x, int size){
int s = size-1;
int i,j,k;
for(i=0;i<size;i=i+s){
for(j=0;j<size;j=j+s){
for(k=0;k<size;k=k+s){
printf("%f, ", x[k + size*(j + size*i)]);
}
}
}
printf("\n");
}
void debugSummarizeBox(float *box, int size, char *indent){
if(LOG_LEVEL >= SUPER_DEBUG_LEVEL){
float corners[8];
int i,j,k, counter;
int s = size-1;
counter = 0;
for(i=0;i<size;i=i+s){
for(j=0;j<size;j=j+s){
for(k=0;k<size;k=k+s){
corners[counter] = box[k + size*(j + size*i)];
counter++;
}
}
}
LOG_SUPER_DEBUG("%sCorners: %f %f %f %f %f %f %f %f",
indent,
corners[0], corners[1], corners[2], corners[3],
corners[4], corners[5], corners[6], corners[7]
);
float sum, mean, mn, mx;
sum=0;
mn=box[0];
mx=box[0];
for (i=0; i<size*size*size; i++){
sum+=box[i];
mn=fminf(mn, box[i]);
mx = fmaxf(mx, box[i]);
}
mean=sum/(size*size*size);
LOG_SUPER_DEBUG("%sSum/Mean/Min/Max: %f, %f, %f, %f", indent, sum, mean, mn, mx);
}
}
void debugSummarizeBoxDouble(double *box, int size, char *indent){
if(LOG_LEVEL >= SUPER_DEBUG_LEVEL){
double corners[8];
int i,j,k, counter;
int s = size-1;
counter = 0;
for(i=0;i<size;i=i+s){
for(j=0;j<size;j=j+s){
for(k=0;k<size;k=k+s){
corners[counter] = box[k + size*(j + size*i)];
counter++;
}
}
}
LOG_SUPER_DEBUG("%sCorners: %lf %lf %lf %lf %lf %lf %lf %lf",
indent,
corners[0], corners[1], corners[2], corners[3],
corners[4], corners[5], corners[6], corners[7]
);
double sum, mean, mn, mx;
sum=0;
mn=box[0];
mx=box[0];
for (i=0; i<size*size*size; i++){
sum+=box[i];
mn=fmin(mn, box[i]);
mx = fmax(mx, box[i]);
}
mean=sum/(size*size*size);
LOG_SUPER_DEBUG("%sSum/Mean/Min/Max: %lf, %lf, %lf, %lf", indent, sum, mean, mn, mx);
}
}
void debugSummarizeIC(struct InitialConditions *x, int HII_DIM, int DIM){
LOG_SUPER_DEBUG("Summary of InitialConditions:");
LOG_SUPER_DEBUG(" lowres_density: ");
debugSummarizeBox(x->lowres_density, HII_DIM, " ");
LOG_SUPER_DEBUG(" hires_density: ");
debugSummarizeBox(x->hires_density, DIM, " ");
LOG_SUPER_DEBUG(" lowres_vx: ");
debugSummarizeBox(x->lowres_vx, HII_DIM, " ");
LOG_SUPER_DEBUG(" lowres_vy: ");
debugSummarizeBox(x->lowres_vy, HII_DIM, " ");
LOG_SUPER_DEBUG(" lowres_vz: ");
debugSummarizeBox(x->lowres_vz, HII_DIM, " ");
}
void debugSummarizePerturbField(struct PerturbedField *x, int HII_DIM){
LOG_SUPER_DEBUG("Summary of PerturbedField:");
LOG_SUPER_DEBUG(" density: ");
debugSummarizeBox(x->density, HII_DIM, " ");
LOG_SUPER_DEBUG(" velocity: ");
debugSummarizeBox(x->velocity, HII_DIM, " ");
}
void inspectInitialConditions(struct InitialConditions *x, int print_pid, int print_corners, int print_first,
int HII_DIM){
int i;
char *pid = print_output_header(print_pid, "InitialConditions");
if(print_first){
printf("%s\tFirstRow: ",pid);
printf("%s\t\tlowres_density: ");
for(i=0;i<10;i++){
printf("%f, ", x->lowres_density[i]);
}
printf("\n");
printf("%s\t\tlowres_vx : ");
for(i=0;i<10;i++){
printf("%f, ", x->lowres_vx[i]);
}
printf("\n");
printf("%s\t\tlowres_vx_2LPT: ");
for(i=0;i<10;i++){
printf("%f, ", x->lowres_vx_2LPT[i]);
}
printf("\n");
}
if(print_corners){
printf("%s\tCorners: ",pid);
printf("%s\t\tlowres_density: ",pid);
print_corners_real(x->lowres_density, HII_DIM);
printf("%s\t\tlowres_vx : ", pid);
print_corners_real(x->lowres_vx, HII_DIM);
printf("%s\t\tlowres_vx_2LPT: ", pid);
print_corners_real(x->lowres_vx_2LPT, HII_DIM);
}
}
void inspectPerturbedField(struct PerturbedField *x, int print_pid, int print_corners, int print_first,
int HII_DIM){
int i;
char *pid = print_output_header(print_pid, "PerturbedField");
if(print_first){
printf("%s\tFirstRow: \n",pid);
printf("%s\t\tdensity: ", pid);
for(i=0;i<10;i++){
printf("%f, ", x->density[i]);
}
printf("\n");
printf("%s\t\tvelocity: ", pid);
for(i=0;i<10;i++){
printf("%f, ", x->velocity[i]);
}
printf("\n");
}
if(print_corners){
printf("%s\tCorners: \n",pid);
printf("%s\t\tdensity: ",pid);
print_corners_real(x->density, HII_DIM);
printf("%s\t\tvelocity: ", pid);
print_corners_real(x->velocity, HII_DIM);
}
}
void inspectTsBox(struct TsBox *x, int print_pid, int print_corners, int print_first, int HII_DIM){
int i;
char *pid = print_output_header(print_pid, "TsBox");
if(print_first){
printf("%s\tFirstRow: ",pid);
printf("%s\t\tTs_box : ");
for(i=0;i<10;i++){
printf("%f, ", x->Ts_box[i]);
}
printf("\n");
printf("%s\t\tx_e_box: ");
for(i=0;i<10;i++){
printf("%f, ", x->x_e_box[i]);
}
printf("\n");
printf("%s\t\tTk_box : ");
for(i=0;i<10;i++){
printf("%f, ", x->Tk_box[i]);
}
printf("\n");
}
if(print_corners){
printf("%s\tCorners: ",pid);
printf("%s\t\tTs_box : ",pid);
print_corners_real(x->Ts_box, HII_DIM);
printf("%s\t\tx_e_box: ", pid);
print_corners_real(x->x_e_box, HII_DIM);
printf("%s\t\tTk_box : ", pid);
print_corners_real(x->Tk_box, HII_DIM);
}
}
void inspectIonizedBox(struct IonizedBox *x, int print_pid, int print_corners, int print_first, int HII_DIM){
int i;
char *pid = print_output_header(print_pid, "IonizedBox");
if(print_first){
printf("%s\tFirstRow: ",pid);
printf("%s\t\txH_box : ");
for(i=0;i<10;i++){
printf("%f, ", x->xH_box[i]);
}
printf("\n");
printf("%s\t\tGamma12_box: ");
for(i=0;i<10;i++){
printf("%f, ", x->Gamma12_box[i]);
}
printf("\n");
printf("%s\t\tz_re_box : ");
for(i=0;i<10;i++){
printf("%f, ", x->z_re_box[i]);
}
printf("\n");
printf("%s\t\tdNrec_box : ");
for(i=0;i<10;i++){
printf("%f, ", x->dNrec_box[i]);
}
printf("\n");
}
if(print_corners){
printf("%s\tCorners: ",pid);
printf("%s\t\txH_box : ",pid);
print_corners_real(x->xH_box, HII_DIM);
printf("%s\t\tGamma12_box: ", pid);
print_corners_real(x->Gamma12_box, HII_DIM);
printf("%s\t\tz_re_box : ", pid);
print_corners_real(x->z_re_box, HII_DIM);
printf("%s\t\tdNrec_box : ", pid);
print_corners_real(x->dNrec_box, HII_DIM);
}
}
void inspectBrightnessTemp(struct BrightnessTemp *x, int print_pid, int print_corners, int print_first, int HII_DIM){
int i;
char *pid = print_output_header(print_pid, "BrightnessTemp");
if(print_first){
printf("%s\tFirstRow: ",pid);
printf("%s\t\tbrightness_temp: ");
for(i=0;i<10;i++){
printf("%f, ", x->brightness_temp[i]);
}
printf("\n");
}
if(print_corners){
printf("%s\tCorners: ",pid);
printf("%s\t\tbrightness_temp: ",pid);
print_corners_real(x->brightness_temp, HII_DIM);
}
}
double atomic_cooling_threshold(float z){
return TtoM(z, 1e4, 0.59);
}
double molecular_cooling_threshold(float z){
return TtoM(z, 600, 1.22);
}
double lyman_werner_threshold(float z, float J_21_LW, float vcb, struct AstroParams *astro_params){
// correction follows Schauer+20, fit jointly to LW feedback and relative velocities. They find weaker effect of LW feedback than before (Stacy+11, Greif+11, etc.) due to HII self shielding.
double mcrit_noLW = 3.314e7 * pow( 1.+z, -1.5);// this follows Visbal+15, which is taken as the optimal fit from Fialkov+12 which was calibrated with the simulations of Stacy+11 and Greif+11;
double f_LW = 1.0 + astro_params->A_LW * pow(J_21_LW, astro_params->BETA_LW);
double f_vcb = pow(1.0 + astro_params->A_VCB * vcb/SIGMAVCB, astro_params->BETA_VCB);
// double mcrit_LW = mcrit_noLW * (1.0 + 10. * sqrt(J_21_LW)); //Eq. (12) in Schauer+20
// return pow(10.0, log10(mcrit_LW) + 0.416 * vcb/SIGMAVCB ); //vcb and sigmacb in km/s, from Eq. (9)
return (mcrit_noLW * f_LW * f_vcb);
}
double reionization_feedback(float z, float Gamma_halo_HII, float z_IN){
if (z_IN<=1e-19)
return 1e-40;
return REION_SM13_M0 * pow(HALO_BIAS * Gamma_halo_HII, REION_SM13_A) * pow((1.+z)/10, REION_SM13_B) *
pow(1 - pow((1.+z)/(1.+z_IN), REION_SM13_C), REION_SM13_D);
}
/*
The following functions are simply for testing the exception framework
*/
void FunctionThatThrows(){
Throw(PhotonConsError);
}
int SomethingThatCatches(bool sub_func){
// A simple function that catches a thrown error.
int status;
Try{
if(sub_func) FunctionThatThrows();
else Throw(PhotonConsError);
}
Catch(status){
return status;
}
return 0;
}
int FunctionThatCatches(bool sub_func, bool pass, double *result){
int status;
if(!pass){
Try{
if(sub_func) FunctionThatThrows();
else Throw(PhotonConsError);
}
Catch(status){
LOG_DEBUG("Caught the problem with status %d.", status);
return status;
}
}
*result = 5.0;
return 0;
}
|
rose_himenoBMTxps.c | /********************************************************************
This benchmark test program is measuring a cpu performance
of floating point operation by a Poisson equation solver.
If you have any question, please ask me via email.
written by Ryutaro HIMENO, November 26, 2001.
Version 3.0
----------------------------------------------
Ryutaro Himeno, Dr. of Eng.
Head of Computer Information Division,
RIKEN (The Institute of Pysical and Chemical Research)
Email : himeno@postman.riken.go.jp
---------------------------------------------------------------
You can adjust the size of this benchmark code to fit your target
computer. In that case, please chose following sets of
(mimax,mjmax,mkmax):
small : 33,33,65
small : 65,65,129
midium: 129,129,257
large : 257,257,513
ext.large: 513,513,1025
This program is to measure a computer performance in MFLOPS
by using a kernel which appears in a linear solver of pressure
Poisson eq. which appears in an incompressible Navier-Stokes solver.
A point-Jacobi method is employed in this solver as this method can
be easyly vectrized and be parallelized.
------------------
Finite-difference method, curvilinear coodinate system
Vectorizable and parallelizable on each grid point
No. of grid points : imax x jmax x kmax including boundaries
------------------
A,B,C:coefficient matrix, wrk1: source term of Poisson equation
wrk2 : working area, OMEGA : relaxation parameter
BND:control variable for boundaries and objects ( = 0 or 1)
P: pressure
********************************************************************/
#include <stdio.h>
#ifdef SSMALL
#define MIMAX 33
#define MJMAX 33
#define MKMAX 65
#endif
#ifdef SMALL
#define MIMAX 65
#define MJMAX 65
#define MKMAX 129
#endif
#ifdef MIDDLE
#define MIMAX 129
#define MJMAX 129
#define MKMAX 257
#endif
#ifdef LARGE
#define MIMAX 257
#define MJMAX 257
#define MKMAX 513
#endif
#ifdef ELARGE
#define MIMAX 513
#define MJMAX 513
#define MKMAX 1025
#endif
double second();
float jacobi();
void initmt();
double fflop(int ,int ,int );
double mflops(int ,double ,double );
static float p[65UL][65UL][129UL];
static float a[4UL][65UL][65UL][129UL];
static float b[3UL][65UL][65UL][129UL];
static float c[3UL][65UL][65UL][129UL];
static float bnd[65UL][65UL][129UL];
static float wrk1[65UL][65UL][129UL];
static float wrk2[65UL][65UL][129UL];
static int imax;
static int jmax;
static int kmax;
static float omega;
int main()
{
int i;
int j;
int k;
int nn;
float gosa;
double cpu;
double cpu0;
double cpu1;
double flop;
double target;
target = 60.0;
omega = 0.8;
imax = 65 - 1;
jmax = 65 - 1;
kmax = 129 - 1;
/*
* Initializing matrixes
*/
initmt();
printf("mimax = %d mjmax = %d mkmax = %d\n",65,65,129);
printf("imax = %d jmax = %d kmax =%d\n",imax,jmax,kmax);
nn = 3;
printf(" Start rehearsal measurement process.\n");
printf(" Measure the performance in %d times.\n\n",nn);
cpu0 = second();
gosa = jacobi(nn);
cpu1 = second();
cpu = (cpu1 - cpu0);
flop = fflop(imax,jmax,kmax);
printf(" MFLOPS: %f time(s): %f %e\n\n",mflops(nn,cpu,flop),cpu,gosa);
nn = ((int )(target / (cpu / 3.0)));
printf(" Now, start the actual measurement process.\n");
printf(" The loop will be excuted in %d times\n",nn);
printf(" This will take about one minute.\n");
printf(" Wait for a while\n\n");
/*
* Start measuring
*/
cpu0 = second();
gosa = jacobi(nn);
cpu1 = second();
cpu = (cpu1 - cpu0);
printf(" Loop executed for %d times\n",nn);
printf(" Gosa : %e \n",gosa);
printf(" MFLOPS measured : %f\tcpu : %f\n",mflops(nn,cpu,flop),cpu);
printf(" Score based on Pentium III 600MHz : %f\n",(mflops(nn,cpu,flop) / 82),84);
return 0;
}
void initmt()
{
int i;
int j;
int k;
#pragma omp parallel for
for (i = 0; i < 65; i++)
for (j = 0; j < 65; j++)
for (k = 0; k < 129; k++) {
a[0][i][j][k] = 0.0;
a[1][i][j][k] = 0.0;
a[2][i][j][k] = 0.0;
a[3][i][j][k] = 0.0;
b[0][i][j][k] = 0.0;
b[1][i][j][k] = 0.0;
b[2][i][j][k] = 0.0;
c[0][i][j][k] = 0.0;
c[1][i][j][k] = 0.0;
c[2][i][j][k] = 0.0;
p[i][j][k] = 0.0;
wrk1[i][j][k] = 0.0;
bnd[i][j][k] = 0.0;
}
#pragma omp parallel for
for (i = 0; i < imax; i++)
for (j = 0; j < jmax; j++)
for (k = 0; k < kmax; k++) {
a[0][i][j][k] = 1.0;
a[1][i][j][k] = 1.0;
a[2][i][j][k] = 1.0;
a[3][i][j][k] = (1.0 / 6.0);
b[0][i][j][k] = 0.0;
b[1][i][j][k] = 0.0;
b[2][i][j][k] = 0.0;
c[0][i][j][k] = 1.0;
c[1][i][j][k] = 1.0;
c[2][i][j][k] = 1.0;
p[i][j][k] = (((float )(i * i)) / ((float )((imax - 1) * (imax - 1))));
wrk1[i][j][k] = 0.0;
bnd[i][j][k] = 1.0;
}
}
float jacobi(int nn)
{
int i;
int j;
int k;
int n;
float gosa;
float s0;
float ss;
for (n = 0; n < nn; ++n) {
gosa = 0.0;
#pragma omp parallel for reduction (+:gosa)
for (i = 1; i < (imax - 1); i++)
for (j = 1; j < (jmax - 1); j++)
for (k = 1; k < (kmax - 1); k++) {
s0 = ((((((((((a[0][i][j][k] * p[i + 1][j][k]) + (a[1][i][j][k] * p[i][j + 1][k])) + (a[2][i][j][k] * p[i][j][k + 1])) + (b[0][i][j][k] * (((p[i + 1][j + 1][k] - p[i + 1][j - 1][k]) - p[i - 1][j + 1][k]) + p[i - 1][j - 1][k]))) + (b[1][i][j][k] * (((p[i][j + 1][k + 1] - p[i][j - 1][k + 1]) - p[i][j + 1][k - 1]) + p[i][j - 1][k - 1]))) + (b[2][i][j][k] * (((p[i + 1][j][k + 1] - p[i - 1][j][k + 1]) - p[i + 1][j][k - 1]) + p[i - 1][j][k - 1]))) + (c[0][i][j][k] * p[i - 1][j][k])) + (c[1][i][j][k] * p[i][j - 1][k])) + (c[2][i][j][k] * p[i][j][k - 1])) + wrk1[i][j][k]);
ss = (((s0 * a[3][i][j][k]) - p[i][j][k]) * bnd[i][j][k]);
gosa += (ss * ss);
/* gosa= (gosa > ss*ss) ? a : b; */
wrk2[i][j][k] = (p[i][j][k] + (omega * ss));
}
#pragma omp parallel for
for (i = 1; i < (imax - 1); ++i)
for (j = 1; j < (jmax - 1); ++j)
for (k = 1; k < (kmax - 1); ++k)
p[i][j][k] = wrk2[i][j][k];
/* end n loop */
}
return gosa;
}
double fflop(int mx,int my,int mz)
{
return ((((double )(mz - 2)) * ((double )(my - 2))) * ((double )(mx - 2))) * 34.0;
}
double mflops(int nn,double cpu,double flop)
{
return ((flop / cpu) * 1.e-6) * ((double )nn);
}
double second()
{
#include <sys/time.h>
struct timeval tm;
double t;
static int base_sec = 0;
static int base_usec = 0;
gettimeofday(&tm,0);
if ((base_sec == 0) && (base_usec == 0)) {
base_sec = tm.tv_sec;
base_usec = tm.tv_usec;
t = 0.0;
}
else {
t = (((double )(tm.tv_sec - base_sec)) + (((double )(tm.tv_usec - base_usec)) / 1.0e6));
}
return t;
}
|
GraphCutBase.h | /*
* MIT License
*
* Copyright (c) 2018-2019 Benjamin Köhler
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#pragma once
#ifndef BKTOOLS_GRAPHCUTBASE_H
#define BKTOOLS_GRAPHCUTBASE_H
#include <algorithm>
#include <array>
#include <cmath>
#include <cstdint>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <utility>
#include <tuple>
#include <type_traits>
#include <vector>
#include <bkTools/graphcut/GraphCutBase_MemberAccess.h>
#include <bkTools/graphcut/gc_definitions.h>
#ifdef BK_EMIT_PROGRESS
#include <bkTools/progress/Progress.h>
#include <bkTools/progress/GlobalProgressManager.h>
#include <bkTools/localization/GlobalLocalizationManager.h>
#endif
namespace bk::gc_details
{
template<int TDims, typename TDerived> class GraphCutBase : protected GraphCutBase_MemberAccess<TDims, GraphCutBase<TDims, TDerived>>
{
//====================================================================================================
//===== ASSERTIONS
//====================================================================================================
static_assert(TDims >= 2, "invalid num dimensions");
//====================================================================================================
//===== DEFINITIONS
//====================================================================================================
using self_type = GraphCutBase<TDims, TDerived>;
using derived_type = TDerived;
using base_type = GraphCutBase_MemberAccess<TDims, GraphCutBase<TDims, TDerived>>;
protected:
using gc = gcdef<TDims>;
using ptNd_type = std::array<double, TDims>;
using pt2Nd_type = std::array<double, 2 * TDims>;
template<typename T> using vector_grid_type = wrap_vector_t<T, TDims>;
public:
using flag_type = typename gc::flag_type;
using id_type = typename gc::id_type;
friend base_type;
/// @{ -------------------------------------------------- GET NUM DIMENSIONS
[[nodiscard]] static constexpr int NumDimensions() noexcept
{ return TDims; }
/// @}
//====================================================================================================
//===== MEMBERS
//====================================================================================================
protected:
id_type _size;
vector_grid_type<ptNd_type> _edge_capacity;
vector_grid_type<pt2Nd_type> _residual;
vector_grid_type<int> _distance_to_terminal;
vector_grid_type<int> _timestamp;
vector_grid_type<flag_type> _flags;
std::vector<id_type> _connected_to_source;
std::vector<id_type> _connected_to_sink;
bool _up2date;
vector_grid_type<bool> _band;
//====================================================================================================
//===== CONSTRUCTORS & DESTRUCTOR
//====================================================================================================
public:
/// @{ -------------------------------------------------- CTOR
GraphCutBase()
: _up2date(false)
{ _size.fill(0); }
GraphCutBase(const self_type&) = default;
GraphCutBase(self_type&&) noexcept = default;
/// @}
/// @{ -------------------------------------------------- DTOR
~GraphCutBase() = default;
/// @}
//====================================================================================================
//===== GETTER
//====================================================================================================
/// @{ -------------------------------------------------- HELPERS: TO DERIVED
private:
[[nodiscard]] constexpr derived_type* deriv() noexcept
{ return static_cast<derived_type*>(this); }
[[nodiscard]] constexpr const derived_type* deriv() const noexcept
{ return static_cast<const derived_type*>(this); }
protected:
/// @}
/// @{ -------------------------------------------------- GET EDGE CAPACITY
[[nodiscard]] ptNd_type& edge_capacity(const id_type& n)
{ return this->get_from_vector_grid(_edge_capacity, n); }
[[nodiscard]] const ptNd_type& edge_capacity(const id_type& n) const
{ return this->get_from_vector_grid(_edge_capacity, n); }
/// @}
/// @{ -------------------------------------------------- CONNECTED TO SOURCE
[[nodiscard]] id_type& connected_to_source(const id_type& n)
{ return this->get_from_vector_grid(_connected_to_source, n); }
[[nodiscard]] const id_type& connected_to_source(const id_type& n) const
{ return this->get_from_vector_grid(_connected_to_source, n); }
/// @}
/// @{ -------------------------------------------------- CONNECTED TO SINK
[[nodiscard]] id_type& connected_to_sink(const id_type& n)
{ return this->get_from_vector_grid(_connected_to_sink, n); }
[[nodiscard]] const id_type& connected_to_sink(const id_type& n) const
{ return this->get_from_vector_grid(_connected_to_sink, n); }
/// @}
protected:
/// @{ -------------------------------------------------- SETS
[[nodiscard]] bool is_in_source_set(const id_type& n) const
{ return this->flag(n) & gc::FLAG_SOURCE_SET(); }
[[nodiscard]] bool is_in_sink_set(const id_type& n) const
{ return this->flag(n) & gc::FLAG_SINK_SET(); }
[[nodiscard]] bool is_in_free_set(const id_type& n) const
{ return this->flag(n) & gc::FLAG_FREE_SET(); }
[[nodiscard]] bool are_in_same_set(const id_type& p, const id_type& q) const
{
const flag_type flag_p = this->flag(p);
const flag_type flag_q = this->flag(q);
return (flag_p & gc::FLAG_SOURCE_SET() && flag_q & gc::FLAG_SOURCE_SET()) || (flag_p & gc::FLAG_SINK_SET() && flag_q & gc::FLAG_SINK_SET());
}
/// @}
public:
/// @{ -------------------------------------------------- GET NUM CONNECTED SINK/SOURCE NODES
[[nodiscard]] unsigned int num_nodes_connected_to_source() const
{ return _connected_to_source.size(); }
[[nodiscard]] unsigned int num_nodes_connected_to_sink() const
{ return _connected_to_sink.size(); }
/// @}
/// @{ -------------------------------------------------- GET SINK/SOURCE NODE LIST
[[nodiscard]] const std::vector<id_type>& nodes_connected_to_source() const
{ return _connected_to_source; }
[[nodiscard]] const std::vector<id_type>& nodes_connected_to_sink() const
{ return _connected_to_sink; }
/// @}
protected:
//====================================================================================================
//===== SETTER
//====================================================================================================
/// @{ -------------------------------------------------- OPERATOR =
[[maybe_unused]] self_type& operator=(const self_type&) = default;
[[maybe_unused]] self_type& operator=(self_type&&) noexcept = default;
/// @}
/// @{ -------------------------------------------------- SET PARENT
void set_source_as_parent(const id_type& child)
{
flag_type& f = this->flag(child);
f &= ~gc::PARENT_IS_SINK();
f |= gc::PARENT_IS_SOURCE();
set_source_set(child);
}
void set_sink_as_parent(const id_type& child)
{
flag_type& f = this->flag(child);
f &= ~gc::PARENT_IS_SOURCE();
f |= gc::PARENT_IS_SINK();
set_sink_set(child);
}
/// @}
/// @{ -------------------------------------------------- SET SET
void set_source_set(const id_type& node)
{
flag_type& f = this->flag(node);
f &= ~gc::FLAG_SINK_SET();
f &= ~gc::FLAG_FREE_SET();
f |= gc::FLAG_SOURCE_SET();
}
void set_sink_set(const id_type& node)
{
flag_type& f = this->flag(node);
f &= ~gc::FLAG_SOURCE_SET();
f &= ~gc::FLAG_FREE_SET();
f |= gc::FLAG_SINK_SET();
}
/// @}
/// @{ -------------------------------------------------- EDGE CAPACITY
void set_edge_capacity(const id_type& node, unsigned char dir, double cap)
{
this->residual(node)[dir] = cap;
if (cap <= 0)
{ this->flag(node) |= (gc::FLAG_EDGE_PREDECESSOR_IS_FULL(0) << dir); }
else
{ this->flag(node) &= ~(gc::FLAG_EDGE_PREDECESSOR_IS_FULL(0) << dir); }
}
void set_edge_capacity(const id_type& p, const id_type& q, double cap)
{ set_edge_capacity(p, gc::DIFF_TO_EDGE_ID(gc::PAIRWISE_DIFFERENCE(q, p)), cap); }
void set_edge_capacity_mutual(const id_type& p, unsigned char dir, double cap)
{
set_edge_capacity(p, dir, cap);
for (int dimId = 0; dimId < TDims; ++dimId)
{
if (p[dimId] > 0 && dir == gc::ID_EDGE_PREDECESSOR(dimId))
{
set_edge_capacity(gc::NEIGHBOR_PREDECESSOR(p, dimId), gc::ID_EDGE_SUCCESSOR(dimId), cap);
break;
}
else if (p[dimId] < _size[dimId] - 1 && dir == gc::ID_EDGE_SUCCESSOR(dimId))
{
set_edge_capacity(gc::NEIGHBOR_SUCCESSOR(p, dimId), gc::ID_EDGE_PREDECESSOR(dimId), cap);
break;
}
}
}
void set_edge_capacity_mutual(const id_type& p, const id_type& q, double cap)
{ set_edge_capacity_mutual(p, gc::DIFF_TO_EDGE_ID(gc::PAIRWISE_DIFFERENCE(q, p)), cap); }
/// @}
//====================================================================================================
//===== FUNCTIONS
//====================================================================================================
/// @{ -------------------------------------------------- HELPER: RESET
private:
template<int I>
void _reset(id_type& p)
{
for (int x = 0; x < _size[I]; ++x)
{
p[I] = x;
if constexpr (I != TDims - 1)
{ _reset<I + 1>(p); }
else
{
for (int dimId = 0; dimId < TDims; ++dimId)
{
if (p[dimId] < _size[dimId] - 1)
{
const double w = edge_capacity(p)[dimId];
set_edge_capacity_mutual(p, gc::ID_EDGE_SUCCESSOR(dimId), w);
}
}
this->timestamp(p) = 0;
this->flag(p) = gc::FLAG_FREE_SET();
this->distance_to_terminal(p) = gc::invalid_distance;
this->band(p) = true;
}
} // for x
}
public:
/// @}
/// @{ -------------------------------------------------- RESET
void reset()
{
#pragma omp parallel for
for (int x = 0; x < _size[0]; ++x)
{
id_type p;
p.fill(0);
p[0] = x;
_reset<1>(p);
}
_up2date = false;
deriv()->reset_impl();
}
/// @}
/// @{ -------------------------------------------------- HELPER: INIT
private:
void _init(const std::array<unsigned int, TDims>& img_size)
{
for (int dimId = 0; dimId < TDims; ++dimId)
{ _size[dimId] = static_cast<int>(img_size[dimId]); }
pt2Nd_type default_residual;
default_residual.fill(0.0);
ptNd_type default_edge_capacity;
default_edge_capacity.fill(0.0);
resize_wrapped_vector<TDims>(_edge_capacity, _size, default_edge_capacity);
resize_wrapped_vector<TDims>(_residual, _size, default_residual);
resize_wrapped_vector<TDims>(_distance_to_terminal, _size, gc::invalid_distance);
resize_wrapped_vector<TDims>(_timestamp, _size, 0);
resize_wrapped_vector<TDims>(_flags, _size, gc::FLAG_FREE_SET());
resize_wrapped_vector<TDims>(_band, _size, true);
_up2date = false;
}
/// @}
/// @{ -------------------------------------------------- HELPER: INIT FROM INTENSITY IMAGE
private:
template<int I, typename TGrayImage, typename TFnPixelAt, typename TFnScale>
void _init_from_intensity_image(const TGrayImage& img, const std::array<double, TDims>& img_scale, TFnPixelAt function_pixel_at, id_type& id, TFnScale fn_scale, double weight_function_tolerance)
{
for (int x = 0; x < _size[I]; ++x)
{
id[I] = x;
if constexpr (I != TDims - 1)
{ _init_from_intensity_image<I + 1>(img, img_scale, function_pixel_at, id, fn_scale, weight_function_tolerance); }
else
{
const double x0 = fn_scale(function_pixel_at(img, id));
ptNd_type& edgecap = this->edge_capacity(id);
for (int dimId = 0; dimId < TDims; ++dimId)
{
if (id[dimId] < _size[dimId] - 1)
{
const double x1 = function_pixel_at(img, gc::NEIGHBOR_SUCCESSOR(id, dimId));
const double diff = (fn_scale(x1) - x0) / img_scale[dimId];
const double w = gc::weight_function(diff, weight_function_tolerance);
edgecap[dimId] = w;
}
} // for dimId
}
} // for x
}
public:
/// @}
/// @{ -------------------------------------------------- INIT FROM INTENSITY IMAGE
template<typename TGrayImage, typename TFnPixelAt>
void init_from_intensity_image(const TGrayImage& img, const std::array<unsigned int, TDims>& img_size, const std::array<double, TDims>& img_scale, const std::array<double, 2>& minmaxPixelValue, TFnPixelAt function_pixel_at, double weight_function_tolerance = 0.5)
{
#ifdef BK_EMIT_PROGRESS
bk::Progress& prog = bk_progress.emplace_task(_size[0] + 1, ___("Initializing graph cut from intensity image"));
#endif
_init(img_size);
#ifdef BK_EMIT_PROGRESS
prog.increment(1);
#endif
auto fn_scale = [&](double x) -> double
{ return 255.0 * (x - static_cast<double>(minmaxPixelValue[0])) / (static_cast<double>(minmaxPixelValue[1]) - static_cast<double>(minmaxPixelValue[0])); };
#pragma omp parallel for
for (int x = 0; x < _size[0]; ++x)
{
id_type id;
id[0] = x;
_init_from_intensity_image<1>(img, img_scale, function_pixel_at, id, fn_scale, weight_function_tolerance);
#ifdef BK_EMIT_PROGRESS
#pragma omp critical(gc_init_from_intensity_image)
{ prog.increment(1); }
#endif
}
#ifdef BK_EMIT_PROGRESS
prog.set_finished();
#endif
}
/// @}
/// @{ -------------------------------------------------- HELPER: INIT FROM WEIGHT IMAGE
private:
template<int I, typename TWeightImage, typename TFnPixelAt>
void _init_from_weight_image(const TWeightImage& img, TFnPixelAt function_weight_at, id_type& id)
{
for (int x = 0; x < _size[I]; ++x)
{
id[I] = x;
if constexpr (I != TDims - 1)
{ _init_from_weight_image<I + 1>(img, function_weight_at, id); }
else
{
ptNd_type& edgecap = this->edge_capacity(id);
for (int dimId = 0; dimId < TDims; ++dimId)
{
if (id[dimId] < _size[dimId] - 1)
{ edgecap[dimId] = function_weight_at(img, id, dimId); }
} // for dimId
}
} // for x
}
public:
/// @}
/// @{ -------------------------------------------------- INIT FROM WEIGHT IMAGE
template<typename TWeightImage, typename TFnPixelAt>
void init_from_weight_image(const TWeightImage& img, const std::array<unsigned int, TDims>& img_size, TFnPixelAt function_weight_at)
{
#ifdef BK_EMIT_PROGRESS
bk::Progress& prog = bk_progress.emplace_task(_size[0] + 1, ___("Initializing graph cut from weight image"));
#endif
_init(img_size);
#ifdef BK_EMIT_PROGRESS
prog.increment(1);
#endif
#pragma omp parallel for
for (int x = 0; x < _size[0]; ++x)
{
id_type id;
id[0] = x;
_init_from_weight_image<1>(img, function_weight_at, id);
#ifdef BK_EMIT_PROGRESS
#pragma omp critical(gc_init_from_weight_image)
{ prog.increment(1); }
#endif
}
#ifdef BK_EMIT_PROGRESS
prog.set_finished();
#endif
}
/// @}
/// @{ -------------------------------------------------- HELPERS: AUTOMATIC OUTSIDE IDS WITHIN NARROW BAND
private:
template<int I>
void _create_narrow_band(const id_type& source_node, const id_type& band_radius, id_type& p)
{
if constexpr (I != TDims - 1)
{
for (int i = std::max(0, source_node[I] - band_radius[I]); i < std::min(_size[I], source_node[I] + band_radius[I]); ++i)
{
p[I] = i;
_create_narrow_band<I + 1>(source_node, band_radius, p);
}
}
else
{
for (int i = std::max(0, source_node[I] - band_radius[I]); i < std::min(_size[I], source_node[I] + band_radius[I]); ++i)
{
p[I] = i;
#pragma omp critical (gc_narrow_band)
{ this->band(p) = false; }
}
}
}
template<int I>
void _sink_from_narrow_band(id_type& p)
{
if constexpr (I != TDims - 1)
{
for (int i = 0; i < _size[I]; ++i)
{
p[I] = i;
_sink_from_narrow_band<I + 1>(p);
}
}
else
{
for (int i = 0; i < _size[I]; ++i)
{
p[I] = i;
const bool make_sink = this->band(p);
if (make_sink)
{
#pragma omp critical (gc_narrow_band)
{ add_sink_node(p); }
}
}
}
}
public:
/// @}
/// @{ -------------------------------------------------- HELPER: RESET NARROW BAND
private:
template<int I>
void _reset_narrow_band(id_type& p)
{
for (int x = 0; x < _size[I]; ++x)
{
p[I] = x;
if constexpr (I != TDims - 1)
{ _reset_narrow_band<I + 1>(p); }
else
{ this->band(p) = true; }
} // for x
}
void _reset_narrow_band()
{
#pragma omp parallel for
for (int x = 0; x < _size[0]; ++x)
{
id_type p;
p.fill(0);
p[0] = x;
_reset_narrow_band<1>(p);
}
}
public:
/// @}
/// @{ -------------------------------------------------- AUTOMATIC OUTSIDE IDS WITHIN NARROW BAND
void narrow_band_sink_ids(double band_width_percent, unsigned int min_width_pixel)
{
id_type band_radius;
for (int i = 0; i < TDims; ++i)
{ band_radius[i] = std::max(static_cast<int>(min_width_pixel), static_cast<int>(std::round(static_cast<double>(_size[i]) * band_width_percent))); }
#ifdef BK_EMIT_PROGRESS
bk::Progress& prog = bk_progress.emplace_task(_connected_to_source.size() + 1 + _size[0], ___("Creating graph cut narrow band"));
#endif
_reset_narrow_band();
#ifdef BK_EMIT_PROGRESS
prog.increment(1);
#endif
#pragma omp parallel for
for (unsigned int i = 0; i < _connected_to_source.size(); ++i)
{
id_type p;
_create_narrow_band<0>(_connected_to_source[i], band_radius, p);
#ifdef BK_EMIT_PROGRESS
#pragma omp critical
{ prog.increment(1); }
#endif
}
#pragma omp parallel for
for (int i = 0; i < _size[0]; ++i)
{
id_type p;
p[0] = i;
_sink_from_narrow_band<1>(p);
#ifdef BK_EMIT_PROGRESS
#pragma omp critical
{ prog.increment(1); }
#endif
}
#ifdef BK_EMIT_PROGRESS
prog.set_finished();
#endif
}
/// @}
/// @{ -------------------------------------------------- ADD SOURCE/SINK NODE
template<typename... TIds, std::enable_if_t<(sizeof...(TIds) > 1)>* = nullptr>
void add_source_node(TIds... ids)
{
static_assert(sizeof...(TIds) == TDims, "invalid number of arguments");
static_assert(std::conjunction_v<std::is_arithmetic<TIds>...>, "arithmetic type arguments required");
_connected_to_source.emplace_back(id_type{static_cast<int>(ids)...});
_up2date = false;
}
void add_source_node(const id_type& p)
{
_connected_to_source.emplace_back(p);
_up2date = false;
}
template<typename... TIds, std::enable_if_t<(sizeof...(TIds) > 1)>* = nullptr>
void add_sink_node(TIds... ids)
{
static_assert(sizeof...(TIds) == TDims, "invalid number of arguments");
static_assert(std::conjunction_v<std::is_arithmetic<TIds>...>, "arithmetic type arguments required");
_connected_to_sink.emplace_back(id_type{static_cast<int>(ids)...});
_up2date = false;
}
void add_sink_node(const id_type& p)
{
_connected_to_sink.emplace_back(p);
_up2date = false;
}
/// @}
/// @{ -------------------------------------------------- CLEAR SOURCE/SINK NODES
void clear_source_nodes()
{
_connected_to_source.clear();
_up2date = false;
}
void clear_sink_nodes()
{
_connected_to_sink.clear();
_up2date = false;
}
/// @}
/// @{ -------------------------------------------------- IS IN SEGMENTATION
template<typename... TIds, std::enable_if_t<(sizeof...(TIds) > 1)>* = nullptr>
[[nodiscard]] bool is_in_segmentation(TIds... ids)
{
static_assert(sizeof...(TIds) == TDims, "invalid number of arguments");
static_assert(std::conjunction_v<std::is_arithmetic<TIds>...>, "arithmetic type arguments required");
return is_in_segmentation(id_type{static_cast<int>(ids)...});
}
[[nodiscard]] bool is_in_segmentation(const id_type& p) const
{ return this->flag(p) & gc::FLAG_SOURCE_SET(); }
/// @}
}; // class GraphCutBase
} // namespace bk
#endif //BKTOOLS_GRAPHCUTBASE_H
|
convert_espa_to_gtif.c | /*****************************************************************************
FILE: convert_espa_to_gtif.c
PURPOSE: Contains functions for creating the GeoTIFF products for each of
the bands in the XML file.
PROJECT: Land Satellites Data System Science Research and Development (LSRD)
at the USGS EROS
LICENSE TYPE: NASA Open Source Agreement Version 1.3
NOTES:
1. The XML metadata format written via this library follows the ESPA internal
metadata format found in ESPA Raw Binary Format v1.0.doc. The schema for
the ESPA internal metadata format is available at
http://espa.cr.usgs.gov/schema/espa_internal_metadata_v1_0.xsd.
*****************************************************************************/
#include <unistd.h>
#include "convert_espa_to_gtif.h"
/******************************************************************************
MODULE: convert_espa_to_gtif
PURPOSE: Converts the internal ESPA raw binary file to GeoTIFF file format.
RETURN VALUE:
Type = int
Value Description
----- -----------
ERROR Error converting to GeoTIFF
SUCCESS Successfully converted to GeoTIFF
NOTES:
1. The GDAL tools will be used for converting the raw binary (ENVI format)
files to GeoTIFF.
2. An associated .tfw (ESRI world file) will be generated for each GeoTIFF
file.
******************************************************************************/
int convert_espa_to_gtif
(
char *espa_xml_file, /* I: input ESPA XML metadata filename */
char *gtif_file, /* I: base output GeoTIFF filename */
bool del_src /* I: should the source files be removed after
conversion? */
)
{
char FUNC_NAME[] = "convert_espa_to_gtif"; /* function name */
char errmsg[STR_SIZE]; /* error message */
char gdal_cmd[STR_SIZE]; /* command string for GDAL call */
char gtif_band[STR_SIZE]; /* name of the GeoTIFF file for this band */
char hdr_file[STR_SIZE]; /* name of the header file for this band */
char xml_file[STR_SIZE]; /* new XML file for the GeoTIFF product */
char tmpfile[STR_SIZE]; /* filename of file.tif.aux.xml */
char *cptr = NULL; /* pointer to empty space in the band name */
int i; /* looping variable for each band */
int count; /* number of chars copied in snprintf */
int status = SUCCESS; /* status for multi-threaded area */
Espa_internal_meta_t xml_metadata; /* XML metadata structure to be
populated by reading the XML metadata file */
/* Validate the input metadata file */
if (validate_xml_file (espa_xml_file) != SUCCESS)
{ /* Error messages already written */
return (ERROR);
}
/* Initialize the metadata structure */
init_metadata_struct (&xml_metadata);
/* Parse the metadata file into our internal metadata structure; also
allocates space as needed for various pointers in the global and band
metadata */
if (parse_metadata (espa_xml_file, &xml_metadata) != SUCCESS)
{ /* Error messages already written */
return (ERROR);
}
/* Loop through the bands in the XML file and convert them to GeoTIFF.
The filenames will have the GeoTIFF base name followed by _ and the
band name of each band in the XML file. Blank spaced in the band name
will be replaced with underscores. */
#ifdef _OPENMP
#pragma omp parallel for private (i, count, gtif_band, cptr, gdal_cmd, errmsg, tmpfile, hdr_file)
#endif
for (i = 0; i < xml_metadata.nbands; i++)
{
/* Determine the output GeoTIFF band name */
count = snprintf (gtif_band, sizeof (gtif_band), "%s_%s.tif",
gtif_file, xml_metadata.band[i].name);
if (count < 0 || count >= sizeof (gtif_band))
{
sprintf (errmsg, "Overflow of gtif_file string");
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
/* Loop through this filename and replace any occurances of blank
spaces with underscores */
while ((cptr = strchr (gtif_band, ' ')) != NULL)
*cptr = '_';
/* Convert the files */
printf ("Converting %s to %s\n", xml_metadata.band[i].file_name,
gtif_band);
/* Check if the fill value is defined */
if ((int) xml_metadata.band[i].fill_value == (int) ESPA_INT_META_FILL)
{
/* Fill value is not defined so don't write the nodata tag */
count = snprintf (gdal_cmd, sizeof (gdal_cmd),
"gdal_translate -of Gtiff -co \"TFW=YES\" -q %s %s",
xml_metadata.band[i].file_name, gtif_band);
}
else
{
/* Fill value is defined so use the nodata tag */
count = snprintf (gdal_cmd, sizeof (gdal_cmd),
"gdal_translate -of Gtiff -a_nodata %ld -co \"TFW=YES\" -q %s %s",
xml_metadata.band[i].fill_value, xml_metadata.band[i].file_name,
gtif_band);
}
if (count < 0 || count >= sizeof (gdal_cmd))
{
sprintf (errmsg, "Overflow of gdal_cmd string");
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
if (system (gdal_cmd) == -1)
{
sprintf (errmsg, "Running gdal_translate: %s", gdal_cmd);
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
/* Remove the {gtif_name}.tif.aux.xml file since it's not needed and
clutters the results. Don't worry about testing the unlink
results. If it doesn't unlink it's not fatal. */
count = snprintf (tmpfile, sizeof (tmpfile), "%s.aux.xml", gtif_band);
if (count < 0 || count >= sizeof (tmpfile))
{
sprintf (errmsg, "Overflow of tmpfile string");
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
unlink (tmpfile);
/* Remove the source file if specified */
if (del_src && status != ERROR)
{
/* .img file */
printf (" Removing %s\n", xml_metadata.band[i].file_name);
if (unlink (xml_metadata.band[i].file_name) != 0)
{
sprintf (errmsg, "Deleting source file: %s",
xml_metadata.band[i].file_name);
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
/* .hdr file */
count = snprintf (hdr_file, sizeof (hdr_file), "%s",
xml_metadata.band[i].file_name);
if (count < 0 || count >= sizeof (hdr_file))
{
sprintf (errmsg, "Overflow of hdr_file string");
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
cptr = strrchr (hdr_file, '.');
strcpy (cptr, ".hdr");
printf (" Removing %s\n", hdr_file);
if (unlink (hdr_file) != 0)
{
sprintf (errmsg, "Deleting source file: %s", hdr_file);
error_handler (true, FUNC_NAME, errmsg);
status = ERROR;
}
}
/* Update the XML file to use the new GeoTIFF band name */
strcpy (xml_metadata.band[i].file_name, gtif_band);
}
if (status == ERROR)
return (ERROR);
/* Remove the source XML if specified */
if (del_src)
{
printf (" Removing %s\n", espa_xml_file);
if (unlink (espa_xml_file) != 0)
{
sprintf (errmsg, "Deleting source file: %s", espa_xml_file);
error_handler (true, FUNC_NAME, errmsg);
return (ERROR);
}
}
/* Create the XML file for the GeoTIFF product */
count = snprintf (xml_file, sizeof (xml_file), "%s_gtif.xml", gtif_file);
if (count < 0 || count >= sizeof (xml_file))
{
sprintf (errmsg, "Overflow of xml_file string");
error_handler (true, FUNC_NAME, errmsg);
return (ERROR);
}
/* Write the new XML file containing the GeoTIFF band names */
if (write_metadata (&xml_metadata, xml_file) != SUCCESS)
{
sprintf (errmsg, "Error writing updated XML for the GeoTIFF product: "
"%s", xml_file);
error_handler (true, FUNC_NAME, errmsg);
return (ERROR);
}
/* Free the metadata structure */
free_metadata (&xml_metadata);
/* Successful conversion */
return (SUCCESS);
}
|
pzgstrf.c |
/*! @file
* \brief Performs LU factorization in parallel
*
* <pre>
* -- Distributed SuperLU routine (version 4.0) --
* Lawrence Berkeley National Lab, Univ. of California Berkeley.
* October 1, 2014
*
* Modified:
* September 1, 1999
* Feburary 7, 2001 use MPI_Isend/MPI_Irecv
* October 15, 2008 latency-reducing panel factorization
* July 12, 2011 static scheduling and arbitrary look-ahead
* March 13, 2013 change NTAGS to MPI_TAG_UB value
*
* Sketch of the algorithm
*
* =======================
*
* The following relations hold:
* * A_kk = L_kk * U_kk
* * L_ik = Aik * U_kk^(-1)
* * U_kj = L_kk^(-1) * A_kj
*
* ----------------------------------
* | | |
* ----|-----------------------------
* | | \ U_kk| |
* | | \ | U_kj |
* | |L_kk \ | || |
* ----|-------|---------||----------
* | | | \/ |
* | | | |
* | | | |
* | | | |
* | | L_ik ==> A_ij |
* | | | |
* | | | |
* | | | |
* ----------------------------------
*
* Handle the first block of columns separately.
* * Factor diagonal and subdiagonal blocks and test for exact
* singularity. ( pzgstrf2(0), one column at a time )
* * Compute block row of U
* * Update trailing matrix
*
* Loop over the remaining blocks of columns.
* mycol = MYCOL( iam, grid );
* myrow = MYROW( iam, grid );
* N = nsupers;
* For (k = 1; k < N; ++k) {
* krow = PROW( k, grid );
* kcol = PCOL( k, grid );
* Pkk = PNUM( krow, kcol, grid );
*
* * Factor diagonal and subdiagonal blocks and test for exact
* singularity.
* if ( mycol == kcol ) {
* pzgstrf2(k), one column at a time
* }
*
* * Parallel triangular solve
* if ( iam == Pkk ) multicast L_k,k to this process row;
* if ( myrow == krow && mycol != kcol ) {
* Recv L_k,k from process Pkk;
* for (j = k+1; j < N; ++j)
* if ( PCOL( j, grid ) == mycol && A_k,j != 0 )
* U_k,j = L_k,k \ A_k,j;
* }
*
* * Parallel rank-k update
* if ( myrow == krow ) multicast U_k,k+1:N to this process column;
* if ( mycol == kcol ) multicast L_k+1:N,k to this process row;
* if ( myrow != krow ) {
* Pkj = PNUM( krow, mycol, grid );
* Recv U_k,k+1:N from process Pkj;
* }
* if ( mycol != kcol ) {
* Pik = PNUM( myrow, kcol, grid );
* Recv L_k+1:N,k from process Pik;
* }
* for (j = k+1; k < N; ++k) {
* for (i = k+1; i < N; ++i)
* if ( myrow == PROW( i, grid ) && mycol == PCOL( j, grid )
* && L_i,k != 0 && U_k,j != 0 )
* A_i,j = A_i,j - L_i,k * U_k,j;
* }
* }
*
* </pre>
*/
#include <math.h>
/*#include "mkl.h"*/
#include "superlu_zdefs.h"
#ifdef GPU_ACC
#include "cublas_utils.h"
/*#include "cublas_zgemm.h"*/
// #define NUM_CUDA_STREAMS 16
// #define NUM_CUDA_STREAMS 16
#endif
/* Various defininations */
/*
Name : SUPERNODE_PROFILE
Purpose : For SuperNode Level profiling of various measurements such as gigaflop/sec
obtained,bandwidth achived:
Overhead : Low
*/
// #define SUPERNODE_PROFILE
/*
Name : BAELINE
Purpose : baseline to compare performance against
Overhead : NA : this wont be used for running experiments
*/
// #define BASELINE
/*
Name : PHI_FRAMEWORK
Purpose : To simulate and test algorithm used for offloading Phi
Overhead : NA : this wont be used for running experiments
*/
#define PHI_FRAMEWORK
#define PZGSTRF2 pzgstrf2_trsm
#define PZGSTRS2 pzgstrs2_omp
extern void PZGSTRF2 (superlu_options_t *, int_t, int_t, double,
Glu_persist_t *, gridinfo_t *, LocalLU_t *,
MPI_Request *, int, SuperLUStat_t *, int *);
#ifdef _CRAY
extern void PZGSTRS2 (int_t, int_t, Glu_persist_t *, gridinfo_t *,
LocalLU_t *, SuperLUStat_t *, _fcd, _fcd, _fcd);
#else
extern void PZGSTRS2 (int_t, int_t, Glu_persist_t *, gridinfo_t *,
LocalLU_t *, SuperLUStat_t *);
#endif
#define ISORT /* Note: qsort() has bug on Mac */
#ifdef ISORT
extern void isort (int_t N, int_t * ARRAY1, int_t * ARRAY2);
extern void isort1 (int_t N, int_t * ARRAY);
#else
int
superlu_sort_perm (const void *arg1, const void *arg2)
{
const int_t *val1 = (const int_t *) arg1;
const int_t *val2 = (const int_t *) arg2;
return (*val2 < *val1);
}
#endif
/************************************************************************/
#include "zscatter.c"
/************************************************************************/
/*! \brief
*
* <pre>
* Purpose
* =======
*
* PZGSTRF performs the LU factorization in parallel.
*
* Arguments
* =========
*
* options (input) superlu_options_t*
* The structure defines the input parameters to control
* how the LU decomposition will be performed.
* The following field should be defined:
* o ReplaceTinyPivot (yes_no_t)
* Specifies whether to replace the tiny diagonals by
* sqrt(epsilon)*norm(A) during LU factorization.
*
* m (input) int
* Number of rows in the matrix.
*
* n (input) int
* Number of columns in the matrix.
*
* anorm (input) double
* The norm of the original matrix A, or the scaled A if
* equilibration was done.
*
* LUstruct (input/output) LUstruct_t*
* The data structures to store the distributed L and U factors.
* The following fields should be defined:
*
* o Glu_persist (input) Glu_persist_t*
* Global data structure (xsup, supno) replicated on all processes,
* describing the supernode partition in the factored matrices
* L and U:
* xsup[s] is the leading column of the s-th supernode,
* supno[i] is the supernode number to which column i belongs.
*
* o Llu (input/output) LocalLU_t*
* The distributed data structures to store L and U factors.
* See superlu_ddefs.h for the definition of 'LocalLU_t'.
*
* grid (input) gridinfo_t*
* The 2D process mesh. It contains the MPI communicator, the number
* of process rows (NPROW), the number of process columns (NPCOL),
* and my process rank. It is an input argument to all the
* parallel routines.
* Grid can be initialized by subroutine SUPERLU_GRIDINIT.
* See superlu_ddefs.h for the definition of 'gridinfo_t'.
*
* stat (output) SuperLUStat_t*
* Record the statistics on runtime and floating-point operation count.
* See util.h for the definition of 'SuperLUStat_t'.
*
* info (output) int*
* = 0: successful exit
* < 0: if info = -i, the i-th argument had an illegal value
* > 0: if info = i, U(i,i) is exactly zero. The factorization has
* been completed, but the factor U is exactly singular,
* and division by zero will occur if it is used to solve a
* system of equations.
* </pre>
*/
int_t
pzgstrf(superlu_options_t * options, int m, int n, double anorm,
LUstruct_t * LUstruct, gridinfo_t * grid, SuperLUStat_t * stat, int *info)
{
#ifdef _CRAY
_fcd ftcs = _cptofcd ("N", strlen ("N"));
_fcd ftcs1 = _cptofcd ("L", strlen ("L"));
_fcd ftcs2 = _cptofcd ("N", strlen ("N"));
_fcd ftcs3 = _cptofcd ("U", strlen ("U"));
#endif
doublecomplex zero = {0.0, 0.0};
doublecomplex alpha = {1.0, 0.0}, beta = {0.0, 0.0};
int_t *xsup;
int_t *lsub, *lsub1, *usub, *Usub_buf;
int_t **Lsub_buf_2, **Usub_buf_2;
doublecomplex **Lval_buf_2, **Uval_buf_2; /* pointers to starts of bufs */
doublecomplex *lusup, *lusup1, *uval, *Uval_buf; /* pointer to current buf */
int_t fnz, i, ib, ijb, ilst, it, iukp, jb, jj, klst, knsupc,
lb, lib, ldv, ljb, lptr, lptr0, lptrj, luptr, luptr0, luptrj,
nlb, nub, nsupc, rel, rukp, il, iu;
int_t Pc, Pr;
int iam, kcol, krow, yourcol, mycol, myrow, pi, pj;
int j, k, lk, nsupers; /* k - current panel to work on */
int k0; /* counter of the next supernode to be factored */
int kk, kk0, kk1, kk2, jj0; /* panels in the look-ahead window */
int iukp0, rukp0, flag0, flag1;
int nsupr, nbrow, segsize;
int msg0, msg2;
int_t **Ufstnz_br_ptr, **Lrowind_bc_ptr;
doublecomplex **Unzval_br_ptr, **Lnzval_bc_ptr;
int_t *index;
doublecomplex *nzval;
int_t *iuip, *ruip; /* Pointers to U index/nzval; size ceil(NSUPERS/Pr). */
doublecomplex *ucol;
int *indirect, *indirect2;
doublecomplex *tempv, *tempv2d;
int iinfo;
int *ToRecv, *ToSendD, **ToSendR;
Glu_persist_t *Glu_persist = LUstruct->Glu_persist;
LocalLU_t *Llu = LUstruct->Llu;
superlu_scope_t *scp;
float s_eps;
double thresh;
doublecomplex *tempU2d, *tempu;
int full, ldt, ldu, lead_zero, ncols, ncb, nrb, p, pr, pc, nblocks;
int_t *etree_supno_l, *etree_supno, *blocks, *blockr, *Ublock, *Urows,
*Lblock, *Lrows, *perm_u, *sf_block, *sf_block_l, *nnodes_l,
*nnodes_u, *edag_supno_l, *recvbuf, **edag_supno;
float edag_supno_l_bytes;
#ifdef ISORT
int_t *iperm_u;
#endif
int *msgcnt; /* Count the size of the message xfer'd in each buffer:
* 0 : transferred in Lsub_buf[]
* 1 : transferred in Lval_buf[]
* 2 : transferred in Usub_buf[]
* 3 : transferred in Uval_buf[]
*/
int **msgcnts, **msgcntsU;
int *factored, *factoredU, nnodes, *sendcnts, *sdispls, *recvcnts,
*rdispls, *srows, *rrows;
etree_node *head, *tail, *ptr;
int *num_child;
int num_look_aheads, look_id, *look_ahead;
int_t *perm_c_supno, *iperm_c_supno;
MPI_Request *recv_req, **recv_reqs, **send_reqs, **send_reqs_u,
**recv_reqs_u;
MPI_Request *send_req, *U_diag_blk_send_req = NULL;
MPI_Status status;
void *attr_val;
int flag;
int iword = sizeof (int_t);
int dword = sizeof (doublecomplex);
double scatter_timer = 0;
double gemm_timer = 0;
/* For measuring load imbalence in omp threads*/
double omp_load_imblc = 0.0;
double *omp_loop_time;
double CPUOffloadTimer = 0;
double CPUOffloadFlop = 0;
double CPUOffloadMop = 0;
double schur_flop_timer = 0.0;
double pdgstrf2_timer = 0.0;
double pdgstrs2_timer = 0.0;
double lookaheadupdatetimer = 0.0;
#if !defined( GPU_ACC )
/* Counter for couting memory operations */
double scatter_mem_op_counter = 0.0;
double scatter_mem_op_timer = 0.0;
double scatterL_mem_op_counter = 0.0;
double scatterL_mem_op_timer = 0.0;
double scatterU_mem_op_counter = 0.0;
double scatterU_mem_op_timer = 0.0;
double LookAheadRowSepTimer = 0.0;
double LookAheadRowSepMOP = 0.0;
double GatherTimer = 0.0;
double GatherMOP = 0.0;
double LookAheadGEMMTimer = 0.0;
double LookAheadGEMMFlOp = 0.0;
double LookAheadScatterTimer = 0.0;
double LookAheadScatterMOP = 0.0;
double schur_flop_counter = 0.0;
#endif
#if ( DEBUGlevel>=2 )
int_t num_copy = 0, num_update = 0;
#endif
#if ( PRNTlevel==3 )
int zero_msg = 0, total_msg = 0;
#endif
#if ( PROFlevel>=1 )
double t1, t2;
float msg_vol = 0, msg_cnt = 0;
#endif
/* Test the input parameters. */
*info = 0;
if (m < 0)
*info = -2;
else if (n < 0)
*info = -3;
if (*info) {
pxerbla ("pdgstrf", grid, -*info);
return (-1);
}
/* Quick return if possible. */
if (m == 0 || n == 0) return 0;
/*
* Initialization.
*/
iam = grid->iam;
Pc = grid->npcol;
Pr = grid->nprow;
myrow = MYROW (iam, grid);
mycol = MYCOL (iam, grid);
nsupers = Glu_persist->supno[n - 1] + 1;
xsup = Glu_persist->xsup;
s_eps = slamch_ ("Epsilon");
thresh = s_eps * anorm;
MPI_Attr_get (MPI_COMM_WORLD, MPI_TAG_UB, &attr_val, &flag);
if (!flag) {
fprintf (stderr, "Could not get TAG_UB\n");
return (-1);
}
int tag_ub = *(int *) attr_val;
#if ( PRNTlevel>=1 )
if (!iam)
printf ("MPI tag upper bound = %d\n", tag_ub);
#endif
#if ( DEBUGlevel>=1 )
if (s_eps == 0.0)
printf (" ***** warning s_eps = %e *****\n", s_eps);
CHECK_MALLOC (iam, "Enter pdgstrf()");
#endif
stat->ops[FACT] = 0.0;
stat->current_buffer = 0.0;
stat->peak_buffer = 0.0;
stat->gpu_buffer = 0.0;
/* make sure the range of look-ahead window [0, MAX_LOOKAHEADS-1] */
num_look_aheads = SUPERLU_MAX(0, SUPERLU_MIN(options->num_lookaheads, MAX_LOOKAHEADS - 1));
if (Pr * Pc > 1) {
if (!(U_diag_blk_send_req =
(MPI_Request *) SUPERLU_MALLOC (Pr * sizeof (MPI_Request))))
ABORT ("Malloc fails for U_diag_blk_send_req[].");
/* flag no outstanding Isend */
U_diag_blk_send_req[myrow] = MPI_REQUEST_NULL; /* used 0 before */
/* allocating buffers for look-ahead */
i = Llu->bufmax[0];
if (i != 0) {
if ( !(Llu->Lsub_buf_2[0] = intMalloc_dist ((num_look_aheads + 1) * ((size_t) i))) )
ABORT ("Malloc fails for Lsub_buf.");
for (jj = 0; jj < num_look_aheads; jj++)
Llu->Lsub_buf_2[jj + 1] = Llu->Lsub_buf_2[jj] + i;
}
i = Llu->bufmax[1];
if (i != 0) {
if (!(Llu->Lval_buf_2[0] = doublecomplexMalloc_dist ((num_look_aheads + 1) * ((size_t) i))))
ABORT ("Malloc fails for Lval_buf[].");
for (jj = 0; jj < num_look_aheads; jj++)
Llu->Lval_buf_2[jj + 1] = Llu->Lval_buf_2[jj] + i;
}
i = Llu->bufmax[2];
if (i != 0) {
if (!(Llu->Usub_buf_2[0] = intMalloc_dist ((num_look_aheads + 1) * i)))
ABORT ("Malloc fails for Usub_buf_2[].");
for (jj = 0; jj < num_look_aheads; jj++)
Llu->Usub_buf_2[jj + 1] = Llu->Usub_buf_2[jj] + i;
}
i = Llu->bufmax[3];
if (i != 0) {
if (!(Llu->Uval_buf_2[0] = doublecomplexMalloc_dist ((num_look_aheads + 1) * i)))
ABORT ("Malloc fails for Uval_buf_2[].");
for (jj = 0; jj < num_look_aheads; jj++)
Llu->Uval_buf_2[jj + 1] = Llu->Uval_buf_2[jj] + i;
}
}
log_memory( (Llu->bufmax[0] + Llu->bufmax[2]) * (num_look_aheads + 1)
* iword +
(Llu->bufmax[1] + Llu->bufmax[3]) * (num_look_aheads + 1)
* dword, stat );
/* creating pointers to the look-ahead buffers */
if (! (Lsub_buf_2 = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (int_t *))))
ABORT ("Malloc fails for Lsub_buf_2[].");
if (! (Lval_buf_2 = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (doublecomplex *))))
ABORT ("Malloc fails for Lval_buf_2[].");
if (! (Usub_buf_2 = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (int_t *))))
ABORT ("Malloc fails for Uval_buf_2[].");
if (! (Uval_buf_2 = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (doublecomplex *))))
ABORT ("Malloc fails for buf_2[].");
for (i = 0; i <= num_look_aheads; i++) {
Lval_buf_2[i] = Llu->Lval_buf_2[i];
Lsub_buf_2[i] = Llu->Lsub_buf_2[i];
Uval_buf_2[i] = Llu->Uval_buf_2[i];
Usub_buf_2[i] = Llu->Usub_buf_2[i];
}
if (!(msgcnts = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (int *))))
ABORT ("Malloc fails for msgcnts[].");
if (!(msgcntsU = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (int *))))
ABORT ("Malloc fails for msgcntsU[].");
for (i = 0; i <= num_look_aheads; i++) {
if (!(msgcnts[i] = SUPERLU_MALLOC (4 * sizeof (int))))
ABORT ("Malloc fails for msgcnts[].");
if (!(msgcntsU[i] = SUPERLU_MALLOC (4 * sizeof (int))))
ABORT ("Malloc fails for msgcntsU[].");
}
if (! (recv_reqs_u = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (MPI_Request *))))
ABORT ("Malloc fails for recv_reqs_u[].");
if (! (send_reqs_u = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (MPI_Request *))))
ABORT ("Malloc fails for send_reqs_u[].");
if (! (send_reqs = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (MPI_Request *))))
ABORT ("Malloc fails for send_reqs_u[].");
if (! (recv_reqs = SUPERLU_MALLOC ((1 + num_look_aheads) * sizeof (MPI_Request *))))
ABORT ("Malloc fails for recv_reqs[].");
for (i = 0; i <= num_look_aheads; i++) {
if (!(recv_reqs_u[i] = (MPI_Request *) SUPERLU_MALLOC (2 * sizeof (MPI_Request))))
ABORT ("Malloc fails for recv_req_u[i].");
if (!(send_reqs_u[i] = (MPI_Request *) SUPERLU_MALLOC (2 * Pr * sizeof (MPI_Request))))
ABORT ("Malloc fails for send_req_u[i].");
if (!(send_reqs[i] = (MPI_Request *) SUPERLU_MALLOC (2 * Pc * sizeof (MPI_Request))))
ABORT ("Malloc fails for send_reqs[i].");
if (!(recv_reqs[i] = (MPI_Request *) SUPERLU_MALLOC (4 * sizeof (MPI_Request))))
ABORT ("Malloc fails for recv_req[].");
send_reqs[i][0] = send_reqs[i][1] = MPI_REQUEST_NULL;
recv_reqs[i][0] = recv_reqs[i][1] = MPI_REQUEST_NULL;
}
if (!(factored = SUPERLU_MALLOC (nsupers * sizeof (int_t))))
ABORT ("Malloc fails for factored[].");
if (!(factoredU = SUPERLU_MALLOC (nsupers * sizeof (int_t))))
ABORT ("Malloc fails for factoredU[].");
for (i = 0; i < nsupers; i++) factored[i] = factoredU[i] = -1;
log_memory(2 * nsupers * iword, stat);
int num_threads = 1;
#ifdef _OPENMP
#pragma omp parallel default(shared)
{
if (omp_get_thread_num () == 0) {
num_threads = omp_get_num_threads ();
}
}
#endif
#if 0
omp_loop_time = (double *) _mm_malloc (sizeof (double) * num_threads,64);
#else
omp_loop_time = (double *) doubleMalloc_dist(num_threads);
#endif
#if ( PRNTlevel>=1 )
if(!iam) printf(".. Starting with %d OpenMP threads \n", num_threads );
double tt1 = SuperLU_timer_ ();
#endif
nblocks = 0;
ncb = nsupers / Pc;
nrb = nsupers / Pr;
int nstreams = get_num_cuda_streams ();
/* int nstreams = NUM_CUDA_STREAMS; */
/* in order to have dynamic scheduling */
int *full_u_cols;
int *blk_ldu;
#if 0
full_u_cols = (int_t *) _mm_malloc (sizeof (int_t) * ncb,64);
blk_ldu = (int_t *) _mm_malloc (sizeof (int_t) * ncb,64);
#else
full_u_cols = SUPERLU_MALLOC(ncb * sizeof(int));
blk_ldu = SUPERLU_MALLOC(ncb * sizeof(int));
#endif
log_memory(2 * ncb * iword, stat);
/* array holding last column blk for each partition,
used in SchCompUdt--CUDA.c */
#if 0
int *stream_end_col = (int_t *) _mm_malloc (sizeof (int_t) * nstreams,64);
#else
int *stream_end_col = SUPERLU_MALLOC( nstreams * sizeof(int) );
#endif
/* insert a check condition here */
#if 0 /* Sherry: not used? */
/* This bunch is used for static scheduling */
pair *full_col_count = (pair *) _mm_malloc (sizeof (pair) * ncb,64);
int_t *count_cols, *sum_cols, *partition;
count_cols = (int_t *) _mm_malloc (sizeof (int_t) * num_threads,64);
sum_cols = (int_t *) _mm_malloc (sizeof (int_t) * num_threads,64);
partition = (int_t *) _mm_malloc (sizeof (int_t) * num_threads * ncb,64);
int_t ldp = ncb;
#endif
/* ##################################################################
* Compute a good static schedule based on the factorization task graph.
* ################################################################## */
perm_c_supno = SUPERLU_MALLOC (2 * nsupers * sizeof (int_t));
iperm_c_supno = perm_c_supno + nsupers;
static_schedule(options, m, n, LUstruct, grid, stat,
perm_c_supno, iperm_c_supno, info);
#if ( DEBUGlevel >= 2 )
PrintInt10("schedule:perm_c_supno", nsupers, perm_c_supno);
printf("[%d] .. Turn off static schedule for debugging ..\n", iam);
/* Turn off static schedule */
for (i = 0; i < nsupers; ++i) perm_c_supno[i] = iperm_c_supno[i] = i;
#endif
/* ################################################################## */
/* constructing look-ahead table to indicate the last dependency */
int *look_ahead_l;
stat->num_look_aheads = num_look_aheads;
look_ahead_l = SUPERLU_MALLOC (nsupers * sizeof (int));
look_ahead = SUPERLU_MALLOC (nsupers * sizeof (int));
for (lb = 0; lb < nsupers; lb++) look_ahead_l[lb] = -1;
log_memory(3 * nsupers * iword, stat);
/* go through U-factor */
for (lb = 0; lb < nrb; ++lb) {
ib = lb * Pr + myrow;
index = Llu->Ufstnz_br_ptr[lb];
if (index) { /* Not an empty row */
k = BR_HEADER;
for (j = 0; j < index[0]; ++j) {
jb = index[k];
if (jb != ib)
look_ahead_l[jb] =
SUPERLU_MAX (iperm_c_supno[ib], look_ahead_l[jb]);
k += UB_DESCRIPTOR + SuperSize (index[k]);
}
}
}
if (myrow < nsupers % grid->nprow) {
ib = nrb * Pr + myrow;
index = Llu->Ufstnz_br_ptr[nrb];
if (index) { /* Not an empty row */
k = BR_HEADER;
for (j = 0; j < index[0]; ++j) {
jb = index[k];
if (jb != ib)
look_ahead_l[jb] =
SUPERLU_MAX (iperm_c_supno[ib], look_ahead_l[jb]);
k += UB_DESCRIPTOR + SuperSize (index[k]);
}
}
}
if (options->SymPattern == NO) {
/* go through L-factor */
for (lb = 0; lb < ncb; lb++) {
ib = lb * Pc + mycol;
index = Llu->Lrowind_bc_ptr[lb];
if (index) {
k = BC_HEADER;
for (j = 0; j < index[0]; j++) {
jb = index[k];
if (jb != ib)
look_ahead_l[jb] =
SUPERLU_MAX (iperm_c_supno[ib], look_ahead_l[jb]);
k += LB_DESCRIPTOR + index[k + 1];
}
}
}
if (mycol < nsupers % grid->npcol) {
ib = ncb * Pc + mycol;
index = Llu->Lrowind_bc_ptr[ncb];
if (index) {
k = BC_HEADER;
for (j = 0; j < index[0]; j++) {
jb = index[k];
if (jb != ib)
look_ahead_l[jb] =
SUPERLU_MAX (iperm_c_supno[ib], look_ahead_l[jb]);
k += LB_DESCRIPTOR + index[k + 1];
}
}
}
}
MPI_Allreduce (look_ahead_l, look_ahead, nsupers, MPI_INT, MPI_MAX, grid->comm);
SUPERLU_FREE (look_ahead_l);
#ifdef ISORT
iperm_u = SUPERLU_MALLOC (nsupers * sizeof (int_t));
perm_u = SUPERLU_MALLOC (nsupers * sizeof (int_t));
#else
perm_u = SUPERLU_MALLOC (2 * nsupers * sizeof (int_t));
#endif
log_memory(nsupers * iword, stat);
#if ( PRNTlevel>=1 )
if (grid->iam == 0)
printf (" * init: %e seconds\n", SuperLU_timer_ () - tt1);
#endif
k = sp_ienv_dist (3); /* max supernode size */
#if 0
if ( !(Llu->ujrow = doubleMalloc_dist(k*(k+1)/2)) )
ABORT("Malloc fails for ujrow[].");
#else
/* Instead of half storage, we'll do full storage */
if (!(Llu->ujrow = doublecomplexMalloc_dist (k * k)))
ABORT ("Malloc fails for ujrow[].");
log_memory(k * k * iword, stat);
#endif
#if ( PRNTlevel>=1 )
if (!iam) {
printf (".. thresh = s_eps %e * anorm %e = %e\n", s_eps, anorm,
thresh);
printf
(".. Buffer size: Lsub %ld\tLval %ld\tUsub %ld\tUval %ld\tLDA %ld\n",
(long int) Llu->bufmax[0], (long int) Llu->bufmax[1],
(long int) Llu->bufmax[2], (long int) Llu->bufmax[3],
(long int) Llu->bufmax[4]);
}
#endif
Lrowind_bc_ptr = Llu->Lrowind_bc_ptr;
Lnzval_bc_ptr = Llu->Lnzval_bc_ptr;
Ufstnz_br_ptr = Llu->Ufstnz_br_ptr;
Unzval_br_ptr = Llu->Unzval_br_ptr;
ToRecv = Llu->ToRecv;
ToSendD = Llu->ToSendD;
ToSendR = Llu->ToSendR;
ldt = sp_ienv_dist (3); /* Size of maximum supernode */
k = CEILING (nsupers, Pr); /* Number of local block rows */
/* Following circuit is for finding maximum block size */
int local_max_row_size = 0;
int max_row_size;
for (int i = 0; i < nsupers; ++i) {
int tpc = PCOL (i, grid);
if (mycol == tpc) {
lk = LBj (i, grid);
lsub = Lrowind_bc_ptr[lk];
if (lsub != NULL) {
local_max_row_size = SUPERLU_MAX (local_max_row_size, lsub[1]);
}
}
}
/* Max row size is global reduction of within A row */
MPI_Allreduce (&local_max_row_size, &max_row_size, 1, MPI_INT, MPI_MAX, (grid->rscp.comm));
/* Buffer size is max of of look ahead window */
/* int_t buffer_size =
SUPERLU_MAX (max_row_size * num_threads * ldt,
get_max_buffer_size ()); */
int cublas_nb = get_cublas_nb();
#ifdef GPU_ACC
int buffer_size = SUPERLU_MAX(max_row_size*nstreams*cublas_nb,get_max_buffer_size());
#else
int Threads_per_process = get_thread_per_process();
int buffer_size = SUPERLU_MAX(max_row_size*Threads_per_process*ldt,get_max_buffer_size());
#endif
/* symmetric assumption */
/* Note that in following expression 8 can be anything
as long as its not too big */
int bigu_size = 8 * sp_ienv_dist (3) * (max_row_size);
#if ( PRNTlevel>=1 )
if(!iam) printf("[%d] .. BIG U size %d \n", iam, bigu_size);
#endif
#ifdef GPU_ACC
// printf("hello 1\n");
doublecomplex* bigU;
if ( checkCuda(cudaHostAlloc((void**)&bigU, bigu_size * sizeof(doublecomplex), cudaHostAllocDefault)) )
ABORT("Malloc fails for zgemm buffer U ");
int bigv_size = buffer_size;
#if ( PRNTlevel>=1 )
if (!iam) printf("[%d] .. BIG V size %d\n", iam, bigv_size);
#endif
doublecomplex* bigV;
if ( checkCuda(cudaHostAlloc((void**)&bigV, bigv_size * sizeof(doublecomplex) ,cudaHostAllocDefault)) )
ABORT("Malloc fails for zgemm buffer V");
DisplayHeader();
#if ( PRNTlevel>=1 )
printf(" Starting with %d Cuda Streams \n",nstreams );
#endif
cublasHandle_t *handle;
handle = (cublasHandle_t *) SUPERLU_MALLOC(sizeof(cublasHandle_t)*nstreams);
for(int i = 0; i < nstreams; i++) handle[i] = create_handle();
// creating streams
cudaStream_t *streams;
streams = (cudaStream_t *) SUPERLU_MALLOC(sizeof(cudaStream_t)*nstreams);
for (int i = 0; i < nstreams; ++i)
checkCuda( cudaStreamCreate(&streams[i]) );
// allocating data in device
doublecomplex *dA, *dB, *dC;
cudaError_t cudaStat;
#if 0
// cudaStat = cudaMalloc( (void**)&dA, m*k*sizeof(double));
// HOw much should be the size of dA?
// for time being just making it
// cudaStat = cudaMalloc( (void**)&dA, ((max_row_size*sp_ienv_dist(3)))* sizeof(double));
#endif
cudaStat = cudaMalloc( (void**)&dA, max_row_size*sp_ienv_dist(3)* sizeof(doublecomplex));
if (cudaStat!= cudaSuccess) {
fprintf(stderr, "!!!! Error in allocating A in the device %ld \n",m*k*sizeof(doublecomplex) );
return 1;
}
// size of B should be max_supernode_size*buffer
cudaStat = cudaMalloc((void**)&dB, bigu_size * sizeof(doublecomplex));
if (cudaStat!= cudaSuccess) {
fprintf(stderr, "!!!! Error in allocating B in the device %ld \n",n*k*sizeof(doublecomplex));
return 1;
}
cudaStat = cudaMalloc((void**)&dC, buffer_size* sizeof(doublecomplex) );
if (cudaStat!= cudaSuccess) {
fprintf(stderr, "!!!! Error in allocating C in the device \n" );
return 1;
}
stat->gpu_buffer += ( max_row_size * sp_ienv_dist(3)
+ bigu_size + buffer_size ) * dword;
#else /* not CUDA */
doublecomplex* bigU;
if ( !(bigU = doublecomplexMalloc_dist(bigu_size)) )
ABORT ("Malloc fails for zgemm u buff U");
//Maximum size of of bigU= sqrt(buffsize) ?
int bigv_size = 8 * ldt * ldt * num_threads;
#if ( PRNTlevel>=1 )
if (!iam) printf("[%d] .. BIG V size %d\n", iam, bigv_size);
#endif
doublecomplex *bigV;
if ( !(bigV = doublecomplexMalloc_dist(bigv_size)) )
ABORT ("Malloc failed for zgemm buffer V");
#endif
log_memory((bigv_size + bigu_size) * dword, stat);
// mlock(bigU,(bigu_size) * sizeof (double));
#if ( PRNTlevel>=1 )
if(!iam) {
printf (" Max row size is %d \n", max_row_size);
printf (" Using buffer_size of %d \n", buffer_size);
printf (" Threads per process %d \n", num_threads);
}
#endif
if (!(tempv2d = doublecomplexCalloc_dist (2 * ((size_t) ldt) * ldt)))
ABORT ("Calloc fails for tempv2d[].");
tempU2d = tempv2d + ldt * ldt;
if (!(indirect = SUPERLU_MALLOC (ldt * num_threads * sizeof(int))))
ABORT ("Malloc fails for indirect[].");
if (!(indirect2 = SUPERLU_MALLOC (ldt * num_threads * sizeof(int))))
ABORT ("Malloc fails for indirect[].");
if (!(iuip = intMalloc_dist (k))) ABORT ("Malloc fails for iuip[].");
if (!(ruip = intMalloc_dist (k))) ABORT ("Malloc fails for ruip[].");
log_memory(2 * ldt *ldt * dword + 2 * ldt * num_threads * iword
+ 2 * k * iword, stat);
int_t *lookAheadFullRow,*lookAheadStRow,*lookAhead_lptr,*lookAhead_ib,
*RemainFullRow,*RemainStRow,*Remain_lptr,*Remain_ib;
lookAheadFullRow = intMalloc_dist( (num_look_aheads+1) );
lookAheadStRow = intMalloc_dist( (num_look_aheads+1) );
lookAhead_lptr = intMalloc_dist( (num_look_aheads+1) );
lookAhead_ib = intMalloc_dist( (num_look_aheads+1) );
int_t mrb= (nsupers+Pr-1) / Pr;
int_t mcb= (nsupers+Pc-1) / Pc;
RemainFullRow = intMalloc_dist(mrb);
RemainStRow = intMalloc_dist(mrb);
#if 0
Remain_lptr = (int *) _mm_malloc(sizeof(int)*mrb,1);
#else
Remain_lptr = intMalloc_dist(mrb);
#endif
// mlock(Remain_lptr, sizeof(int)*mrb );
Remain_ib = intMalloc_dist(mrb);
Remain_info_t *Remain_info;
#if 0
Remain_info = (Remain_info_t *) _mm_malloc(mrb*sizeof(Remain_info_t),64);
#else
Remain_info = (Remain_info_t *) SUPERLU_MALLOC(mrb*sizeof(Remain_info_t));
#endif
log_memory(4 * mrb * iword + mrb * sizeof(Remain_info_t), stat);
doublecomplex *lookAhead_L_buff, *Remain_L_buff;
Ublock_info_t *Ublock_info;
ldt = sp_ienv_dist (3); /* max supernode size */
lookAhead_L_buff = doublecomplexMalloc_dist(ldt*ldt* (num_look_aheads+1) );
log_memory(ldt * ldt * (num_look_aheads+1) * dword, stat);
#if 0
Remain_L_buff = (doublecomplex *) _mm_malloc( sizeof(doublecomplex)*(Llu->bufmax[1]),64);
Ublock_info = (Ublock_info_t *) _mm_malloc(mcb*sizeof(Ublock_info_t),64);
int * Ublock_info_iukp = (int *) _mm_malloc(mcb*sizeof(int),64);
int * Ublock_info_rukp = (int *) _mm_malloc(mcb*sizeof(int),64);
int * Ublock_info_jb = (int *) _mm_malloc(mcb*sizeof(int),64);
#else
Remain_L_buff = doublecomplexMalloc_dist(Llu->bufmax[1]);
Ublock_info = (Ublock_info_t *) SUPERLU_MALLOC(mcb*sizeof(Ublock_info_t));
int *Ublock_info_iukp = (int *) SUPERLU_MALLOC(mcb*sizeof(int));
int *Ublock_info_rukp = (int *) SUPERLU_MALLOC(mcb*sizeof(int));
int *Ublock_info_jb = (int *) SUPERLU_MALLOC(mcb*sizeof(int));
#endif
log_memory(Llu->bufmax[1] * dword, stat);
double NetSchurUpTimer = 0;
double pdgstrfTimer= SuperLU_timer_();
/* ##################################################################
** Handle first block column separately to start the pipeline. **
################################################################## */
look_id = 0;
msgcnt = msgcnts[0];
send_req = send_reqs[0];
recv_req = recv_reqs[0];
k0 = 0;
k = perm_c_supno[0];
kcol = PCOL (k, grid);
krow = PROW (k, grid);
if (mycol == kcol) {
double ttt1 = SuperLU_timer_();
/* panel factorization */
PZGSTRF2 (options, k0, k, thresh, Glu_persist, grid, Llu,
U_diag_blk_send_req, tag_ub, stat, info);
pdgstrf2_timer += SuperLU_timer_()-ttt1;
scp = &grid->rscp; /* The scope of process row. */
/* Multicasts numeric values of L(:,0) to process rows. */
lk = LBj (k, grid); /* Local block number. */
lsub = Lrowind_bc_ptr[lk];
lusup = Lnzval_bc_ptr[lk];
if (lsub) {
msgcnt[0] = lsub[1] + BC_HEADER + lsub[0] * LB_DESCRIPTOR;
msgcnt[1] = lsub[1] * SuperSize (k);
} else {
msgcnt[0] = msgcnt[1] = 0;
}
for (pj = 0; pj < Pc; ++pj) {
if (ToSendR[lk][pj] != EMPTY) {
#if ( PROFlevel>=1 )
TIC (t1);
#endif
MPI_Isend (lsub, msgcnt[0], mpi_int_t, pj, SLU_MPI_TAG (0, 0) /* 0 */ ,
scp->comm, &send_req[pj]);
MPI_Isend (lusup, msgcnt[1], SuperLU_MPI_DOUBLE_COMPLEX, pj, SLU_MPI_TAG (1, 0) /* 1 */ ,
scp->comm, &send_req[pj + Pc]);
#if ( DEBUGlevel>=2 )
printf ("[%d] first block cloumn Send L(:,%4d): lsub %4d, lusup %4d to Pc %2d\n",
iam, 0, msgcnt[0], msgcnt[1], pj);
#endif
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
msg_cnt += 2;
msg_vol += msgcnt[0] * iword + msgcnt[1] * dword;
#endif
} /* end if */
} /* end for pj ... */
} else { /* Post immediate receives. */
if (ToRecv[k] >= 1) { /* Recv block column L(:,0). */
scp = &grid->rscp; /* The scope of process row. */
MPI_Irecv (Lsub_buf_2[0], Llu->bufmax[0], mpi_int_t, kcol,
SLU_MPI_TAG (0, 0) /* 0 */ ,
scp->comm, &recv_req[0]);
MPI_Irecv (Lval_buf_2[0], Llu->bufmax[1], SuperLU_MPI_DOUBLE_COMPLEX, kcol,
SLU_MPI_TAG (1, 0) /* 1 */ ,
scp->comm, &recv_req[1]);
}
} /* end if mycol == 0 */
factored[k] = 0; /* flag column k as factored. */
/* post receive of first U-row */
if (myrow != krow) {
if (ToRecv[k] == 2) { /* Recv block row U(k,:). */
scp = &grid->cscp; /* The scope of process column. */
Usub_buf = Llu->Usub_buf_2[0];
Uval_buf = Llu->Uval_buf_2[0];
MPI_Irecv (Usub_buf, Llu->bufmax[2], mpi_int_t, krow,
SLU_MPI_TAG (2, 0) /* 2%tag_ub */ ,
scp->comm, &recv_reqs_u[0][0]);
MPI_Irecv (Uval_buf, Llu->bufmax[3], SuperLU_MPI_DOUBLE_COMPLEX, krow,
SLU_MPI_TAG (3, 0) /* 3%tag_ub */ ,
scp->comm, &recv_reqs_u[0][1]);
}
}
/* ##################################################################
**** MAIN LOOP ****
################################################################## */
for (k0 = 0; k0 < nsupers; ++k0) {
k = perm_c_supno[k0];
/* ============================================ *
* ======== look-ahead the new columns ======== *
* ============================================ */
/* tt1 = SuperLU_timer_(); */
if (k0 == 0) { /* look-ahead all the columns in the window */
kk1 = k0 + 1;
kk2 = SUPERLU_MIN (k0 + num_look_aheads, nsupers - 1);
} else { /* look-ahead one new column after the current window */
kk1 = k0 + num_look_aheads;
kk2 = SUPERLU_MIN (kk1, nsupers - 1);
}
for (kk0 = kk1; kk0 <= kk2; kk0++) {
/* loop through look-ahead window */
kk = perm_c_supno[kk0]; /* use the ordering from static schedule */
look_id = kk0 % (1 + num_look_aheads); /* which column in window */
if (look_ahead[kk] < k0) { /* does not depend on current column */
kcol = PCOL (kk, grid);
if (mycol == kcol) {
/* Panel factorization -- Factor diagonal and subdiagonal
L blocks and test for exact singularity. */
factored[kk] = 0; /* flag column kk as factored */
double ttt1 = SuperLU_timer_();
PZGSTRF2 (options, kk0, kk, thresh, Glu_persist,
grid, Llu, U_diag_blk_send_req, tag_ub, stat, info);
pdgstrf2_timer += SuperLU_timer_() - ttt1;
/* Multicasts numeric values of L(:,kk) to process rows. */
/* ttt1 = SuperLU_timer_(); */
msgcnt = msgcnts[look_id]; /* point to the proper count array */
send_req = send_reqs[look_id];
lk = LBj (kk, grid); /* Local block number. */
lsub1 = Lrowind_bc_ptr[lk];
if (lsub1) {
msgcnt[0] = lsub1[1] + BC_HEADER + lsub1[0] * LB_DESCRIPTOR;
msgcnt[1] = lsub1[1] * SuperSize (kk);
} else {
msgcnt[0] = 0;
msgcnt[1] = 0;
}
scp = &grid->rscp; /* The scope of process row. */
for (pj = 0; pj < Pc; ++pj) {
if (ToSendR[lk][pj] != EMPTY) {
lusup1 = Lnzval_bc_ptr[lk];
MPI_Isend (lsub1, msgcnt[0], mpi_int_t, pj,
SLU_MPI_TAG (0, kk0), /* (4*kk0)%tag_ub */
scp->comm, &send_req[pj]);
MPI_Isend (lusup1, msgcnt[1], SuperLU_MPI_DOUBLE_COMPLEX, pj,
SLU_MPI_TAG (1, kk0), /* (4*kk0+1)%tag_ub */
scp->comm, &send_req[pj + Pc]);
#if ( DEBUGlevel>=2 )
printf ("[%d] -1- Send L(:,%4d): #lsub1 %4d, #lusup1 %4d right to Pj %2d\n",
iam, kk, msgcnt[0], msgcnt[1], pj);
#endif
}
}
/* stat->time9 += SuperLU_timer_() - ttt1; */
} else { /* Post Recv of block column L(:,kk). */
/* double ttt1 = SuperLU_timer_(); */
if (ToRecv[kk] >= 1) {
scp = &grid->rscp; /* The scope of process row. */
recv_req = recv_reqs[look_id];
MPI_Irecv (Lsub_buf_2[look_id], Llu->bufmax[0],
mpi_int_t, kcol, SLU_MPI_TAG (0, kk0), /* (4*kk0)%tag_ub */
scp->comm, &recv_req[0]);
MPI_Irecv (Lval_buf_2[look_id], Llu->bufmax[1],
SuperLU_MPI_DOUBLE_COMPLEX, kcol,
SLU_MPI_TAG (1, kk0), /* (4*kk0+1)%tag_ub */
scp->comm, &recv_req[1]);
}
/* stat->time10 += SuperLU_timer_() - ttt1; */
} /* end if mycol == Pc(kk) */
} /* end if look-ahead */
/* post irecv for U-row look-ahead */
krow = PROW (kk, grid);
if (myrow != krow) {
if (ToRecv[kk] == 2) { /* post iRecv block row U(k,:). */
scp = &grid->cscp; /* The scope of process column. */
Usub_buf = Llu->Usub_buf_2[look_id];
Uval_buf = Llu->Uval_buf_2[look_id];
MPI_Irecv (Usub_buf, Llu->bufmax[2], mpi_int_t, krow,
SLU_MPI_TAG (2, kk0) /* (4*kk0+2)%tag_ub */ ,
scp->comm, &recv_reqs_u[look_id][0]);
MPI_Irecv (Uval_buf, Llu->bufmax[3], SuperLU_MPI_DOUBLE_COMPLEX, krow,
SLU_MPI_TAG (3, kk0) /* (4*kk0+3)%tag_ub */ ,
scp->comm, &recv_reqs_u[look_id][1]);
}
}
} /* end for each column in look-ahead window */
/* stat->time4 += SuperLU_timer_()-tt1; */
/* ================================= *
* == looking-ahead the U columns == *
* ================================= */
kk1 = k0;
kk2 = SUPERLU_MIN (k0 + num_look_aheads, nsupers - 1);
for (kk0 = kk1; kk0 < kk2; kk0++) {
kk = perm_c_supno[kk0];
if (factoredU[kk0] != 1 && look_ahead[kk] < k0) {
kcol = PCOL (kk, grid);
krow = PROW (kk, grid);
lk = LBj (kk, grid); /* Local block number. */
look_id = kk0 % (1 + num_look_aheads);
msgcnt = msgcntsU[look_id];
recv_req = recv_reqs[look_id];
/* ================================================= *
* checking if diagonal block has been received *
* for panel factorization of U in look-ahead window *
* ================================================= */
if (mycol == kcol) {
flag0 = flag1 = 1;
msgcnt[0] = msgcnt[1] = -1;
} else {
flag0 = flag1 = 0;
if (ToRecv[kk] >= 1) {
if (recv_req[0] != MPI_REQUEST_NULL) {
MPI_Test (&recv_req[0], &flag0, &status);
if (flag0) {
MPI_Get_count (&status, mpi_int_t, &msgcnt[0]);
recv_req[0] = MPI_REQUEST_NULL;
}
} else flag0 = 1;
if (recv_req[1] != MPI_REQUEST_NULL) {
MPI_Test (&recv_req[1], &flag1, &status);
if (flag1) {
MPI_Get_count (&status, mpi_int_t, &msgcnt[1]);
recv_req[1] = MPI_REQUEST_NULL;
}
} else flag1 = 1;
} else msgcnt[0] = 0;
}
if (flag0 && flag1) {
/* tt1 = SuperLU_timer_(); */
scp = &grid->cscp; /* The scope of process column. */
if (myrow == krow) {
factoredU[kk0] = 1;
/* Parallel triangular solve across process row *krow* --
U(k,j) = L(k,k) \ A(k,j). */
/* double ttt2 = SuperLU_timer_(); */
double ttt2 = SuperLU_timer_();
#ifdef _OPENMP
#pragma omp parallel
#endif
{
PZGSTRS2 (kk0, kk, Glu_persist, grid, Llu,
stat);
}
pdgstrs2_timer += SuperLU_timer_()-ttt2;
/* stat->time8 += SuperLU_timer_()-ttt2; */
/* Multicasts U(k,:) to process columns. */
lk = LBi (kk, grid);
usub = Ufstnz_br_ptr[lk];
uval = Unzval_br_ptr[lk];
if (usub) {
msgcnt[2] = usub[2];
msgcnt[3] = usub[1];
} else {
msgcnt[2] = msgcnt[3] = 0;
}
if (ToSendD[lk] == YES) {
for (pi = 0; pi < Pr; ++pi) {
if (pi != myrow) {
#if ( PROFlevel>=1 )
TIC (t1);
#endif
MPI_Isend (usub, msgcnt[2], mpi_int_t, pi,
SLU_MPI_TAG (2, kk0), /* (4*kk0+2)%tag_ub */
scp->comm, &send_reqs_u[look_id][pi]);
MPI_Isend (uval, msgcnt[3], SuperLU_MPI_DOUBLE_COMPLEX,
pi, SLU_MPI_TAG (3, kk0), /* (4*kk0+3)%tag_ub */
scp->comm, &send_reqs_u[look_id][pi + Pr]);
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
msg_cnt += 2;
msg_vol += msgcnt[2] * iword + msgcnt[3] * dword;
#endif
#if ( DEBUGlevel>=2 )
printf ("[%d] Send U(%4d,:) to Pr %2d\n",
iam, k, pi);
#endif
} /* if pi ... */
} /* for pi ... */
} /* if ToSendD ... */
/* stat->time2 += SuperLU_timer_()-tt1; */
} /* end if myrow == krow */
} /* end if flag0 ... */
} /* end if factoredU[] ... */
} /* end for kk0 ... */
/* ============================================== *
* == start processing the current row of U == *
* ============================================== */
knsupc = SuperSize (k);
krow = PROW (k, grid);
kcol = PCOL (k, grid);
/* tt1 = SuperLU_timer_(); */
look_id = k0 % (1 + num_look_aheads);
recv_req = recv_reqs[look_id];
send_req = send_reqs[look_id];
msgcnt = msgcnts[look_id];
Usub_buf = Llu->Usub_buf_2[look_id];
Uval_buf = Llu->Uval_buf_2[look_id];
if (mycol == kcol) {
lk = LBj (k, grid); /* Local block number. */
for (pj = 0; pj < Pc; ++pj) {
/* Wait for Isend to complete before using lsub/lusup. */
if (ToSendR[lk][pj] != EMPTY) {
MPI_Wait (&send_req[pj], &status);
MPI_Wait (&send_req[pj + Pc], &status);
}
}
lsub = Lrowind_bc_ptr[lk];
lusup = Lnzval_bc_ptr[lk];
} else {
if (ToRecv[k] >= 1) { /* Recv block column L(:,k). */
scp = &grid->rscp; /* The scope of process row. */
/* ============================================ *
* waiting for L(:,kk) for outer-product uptate *
* if iam in U(kk,:) then *
* the diagonal block did not reach in time *
* for panel factorization of U(k,:) *
* ============================================ */
#if ( PROFlevel>=1 )
TIC (t1);
#endif
if (recv_req[0] != MPI_REQUEST_NULL) {
MPI_Wait (&recv_req[0], &status);
MPI_Get_count (&status, mpi_int_t, &msgcnt[0]);
recv_req[0] = MPI_REQUEST_NULL;
} else {
msgcnt[0] = msgcntsU[look_id][0];
#if (DEBUGlevel>=2)
printf("\t[%d] k=%d, look_id=%d, recv_req[0] == MPI_REQUEST_NULL, msgcnt[0] = %d\n",
iam, k, look_id, msgcnt[0]);
#endif
}
if (recv_req[1] != MPI_REQUEST_NULL) {
MPI_Wait (&recv_req[1], &status);
MPI_Get_count (&status, SuperLU_MPI_DOUBLE_COMPLEX, &msgcnt[1]);
recv_req[1] = MPI_REQUEST_NULL;
} else {
msgcnt[1] = msgcntsU[look_id][1];
#if (DEBUGlevel>=2)
printf("\t[%d] k=%d, look_id=%d, recv_req[1] == MPI_REQUEST_NULL, msgcnt[1] = %d\n",
iam, k, look_id, msgcnt[1]);
#endif
}
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
#endif
#if ( DEBUGlevel>=2 )
printf("[%d] Recv L(:,%4d): #lsub %4d, #lusup %4d from Pc %2d\n",
iam, k, msgcnt[0], msgcnt[1], kcol);
fflush (stdout);
#endif
#if ( PRNTlevel==3 )
++total_msg;
if (!msgcnt[0]) ++zero_msg;
#endif
} else {
msgcnt[0] = 0;
}
lsub = Lsub_buf_2[look_id];
lusup = Lval_buf_2[look_id];
} /* if mycol = Pc(k) */
/* stat->time1 += SuperLU_timer_()-tt1; */
scp = &grid->cscp; /* The scope of process column. */
/* tt1 = SuperLU_timer_(); */
if (myrow == krow) {
lk = LBi (k, grid);
usub = Ufstnz_br_ptr[lk];
uval = Unzval_br_ptr[lk];
if (factoredU[k0] == -1) {
/* Parallel triangular solve across process row *krow* --
U(k,j) = L(k,k) \ A(k,j). */
double ttt2 = SuperLU_timer_();
#ifdef _OPENMP
#pragma omp parallel
#endif
{
PZGSTRS2 (k0, k, Glu_persist, grid, Llu, stat);
}
pdgstrs2_timer += SuperLU_timer_() - ttt2;
/* Multicasts U(k,:) along process columns. */
if (usub) {
msgcnt[2] = usub[2];
msgcnt[3] = usub[1];
} else {
msgcnt[2] = msgcnt[3] = 0;
}
if (ToSendD[lk] == YES) {
for (pi = 0; pi < Pr; ++pi) {
if (pi != myrow) {
#if ( PROFlevel>=1 )
TIC (t1);
#endif
MPI_Send (usub, msgcnt[2], mpi_int_t, pi,
SLU_MPI_TAG (2, k0), /* (4*k0+2)%tag_ub */
scp->comm);
MPI_Send (uval, msgcnt[3], SuperLU_MPI_DOUBLE_COMPLEX, pi,
SLU_MPI_TAG (3, k0), /* (4*k0+3)%tag_ub */
scp->comm);
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
msg_cnt += 2;
msg_vol += msgcnt[2] * iword + msgcnt[3] * dword;
#endif
#if ( DEBUGlevel>=2 )
printf ("[%d] Send U(%4d,:) down to Pr %2d\n", iam, k, pi);
#endif
} /* if pi ... */
} /* for pi ... */
} /* if ToSendD ... */
} else {
/* =========================================== *
* waiting for U(k,:) for outer-product update *
* =========================================== */
if (ToSendD[lk] == YES) {
for (pi = 0; pi < Pr; ++pi) {
if (pi != myrow) {
MPI_Wait (&send_reqs_u[look_id][pi], &status);
MPI_Wait (&send_reqs_u[look_id][pi + Pr], &status);
}
}
}
msgcnt[2] = msgcntsU[look_id][2];
msgcnt[3] = msgcntsU[look_id][3];
}
/* stat->time2 += SuperLU_timer_()-tt1; */
} else { /* myrow != krow */
/* ========================================= *
* wait for U(k,:) for outer-product updates *
* ========================================= */
if (ToRecv[k] == 2) { /* Recv block row U(k,:). */
#if ( PROFlevel>=1 )
TIC (t1);
#endif
MPI_Wait (&recv_reqs_u[look_id][0], &status);
MPI_Get_count (&status, mpi_int_t, &msgcnt[2]);
MPI_Wait (&recv_reqs_u[look_id][1], &status);
MPI_Get_count (&status, SuperLU_MPI_DOUBLE_COMPLEX, &msgcnt[3]);
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
#endif
usub = Usub_buf;
uval = Uval_buf;
#if ( DEBUGlevel>=2 )
printf ("[%d] Recv U(%4d,:) from Pr %2d\n", iam, k, krow);
#endif
#if ( PRNTlevel==3 )
++total_msg;
if (!msgcnt[2]) ++zero_msg;
#endif
} else {
msgcnt[2] = 0;
}
/* stat->time6 += SuperLU_timer_()-tt1; */
} /* if myrow == Pr(k) */
/*
* Parallel rank-k update; pair up blocks L(i,k) and U(k,j).
* for (j = k+1; k < N; ++k) {
* for (i = k+1; i < N; ++i)
* if ( myrow == PROW( i, grid ) && mycol == PCOL( j, grid )
* && L(i,k) != 0 && U(k,j) != 0 )
* A(i,j) = A(i,j) - L(i,k) * U(k,j);
*/
msg0 = msgcnt[0];
msg2 = msgcnt[2];
/* tt1 = SuperLU_timer_(); */
if (msg0 && msg2) { /* L(:,k) and U(k,:) are not empty. */
nsupr = lsub[1]; /* LDA of lusup. */
if (myrow == krow) { /* Skip diagonal block L(k,k). */
lptr0 = BC_HEADER + LB_DESCRIPTOR + lsub[BC_HEADER + 1];
luptr0 = knsupc;
nlb = lsub[0] - 1;
} else {
lptr0 = BC_HEADER;
luptr0 = 0;
nlb = lsub[0];
}
iukp = BR_HEADER; /* Skip header; Pointer to index[] of U(k,:) */
rukp = 0; /* Pointer to nzval[] of U(k,:) */
nub = usub[0]; /* Number of blocks in the block row U(k,:) */
klst = FstBlockC (k + 1);
/* -------------------------------------------------------------
Update the look-ahead block columns A(:,k+1:k+num_look_ahead)
------------------------------------------------------------- */
iukp0 = iukp;
rukp0 = rukp;
/* reorder the remaining columns in bottome-up */
/* TAU_STATIC_TIMER_START("LOOK_AHEAD_UPDATE"); */
for (jj = 0; jj < nub; jj++) {
#ifdef ISORT
iperm_u[jj] = iperm_c_supno[usub[iukp]]; /* Global block number of block U(k,j). */
perm_u[jj] = jj;
#else
perm_u[2 * jj] = iperm_c_supno[usub[iukp]]; /* Global block number of block U(k,j). */
perm_u[2 * jj + 1] = jj;
#endif
jb = usub[iukp]; /* Global block number of block U(k,j). */
nsupc = SuperSize (jb);
iukp += UB_DESCRIPTOR; /* Start fstnz of block U(k,j). */
iukp += nsupc;
}
iukp = iukp0;
#ifdef ISORT
isort (nub, iperm_u, perm_u);
#else
qsort (perm_u, (size_t) nub, 2 * sizeof (int_t),
&superlu_sort_perm);
#endif
j = jj0 = 0;
/************************************************************************/
double ttx =SuperLU_timer_();
#include "zlook_ahead_update.c"
lookaheadupdatetimer += SuperLU_timer_() - ttx;
/************************************************************************/
/*ifdef OMP_LOOK_AHEAD */
/* TAU_STATIC_TIMER_STOP("LOOK_AHEAD_UPDATE"); */
} /* if L(:,k) and U(k,:) not empty */
/* stat->time3 += SuperLU_timer_()-tt1; */
/* ================== */
/* == post receive == */
/* ================== */
kk1 = SUPERLU_MIN (k0 + num_look_aheads, nsupers - 1);
for (kk0 = k0 + 1; kk0 <= kk1; kk0++) {
kk = perm_c_supno[kk0];
kcol = PCOL (kk, grid);
if (look_ahead[kk] == k0) {
if (mycol != kcol) {
if (ToRecv[kk] >= 1) {
scp = &grid->rscp; /* The scope of process row. */
look_id = kk0 % (1 + num_look_aheads);
recv_req = recv_reqs[look_id];
MPI_Irecv (Lsub_buf_2[look_id], Llu->bufmax[0],
mpi_int_t, kcol, SLU_MPI_TAG (0, kk0), /* (4*kk0)%tag_ub */
scp->comm, &recv_req[0]);
MPI_Irecv (Lval_buf_2[look_id], Llu->bufmax[1],
SuperLU_MPI_DOUBLE_COMPLEX, kcol,
SLU_MPI_TAG (1, kk0), /* (4*kk0+1)%tag_ub */
scp->comm, &recv_req[1]);
}
} else {
lk = LBj (kk, grid); /* Local block number. */
lsub1 = Lrowind_bc_ptr[lk];
lusup1 = Lnzval_bc_ptr[lk];
if (factored[kk] == -1) {
/* Factor diagonal and subdiagonal blocks and
test for exact singularity. */
factored[kk] = 0; /* flag column kk as factored */
double ttt1 = SuperLU_timer_();
PZGSTRF2 (options, kk0, kk, thresh,
Glu_persist, grid, Llu, U_diag_blk_send_req,
tag_ub, stat, info);
pdgstrf2_timer += SuperLU_timer_() - ttt1;
/* Process column *kcol+1* multicasts numeric
values of L(:,k+1) to process rows. */
look_id = kk0 % (1 + num_look_aheads);
send_req = send_reqs[look_id];
msgcnt = msgcnts[look_id];
if (lsub1) {
msgcnt[0] = lsub1[1] + BC_HEADER + lsub1[0] * LB_DESCRIPTOR;
msgcnt[1] = lsub1[1] * SuperSize (kk);
} else {
msgcnt[0] = 0;
msgcnt[1] = 0;
}
scp = &grid->rscp; /* The scope of process row. */
for (pj = 0; pj < Pc; ++pj) {
if (ToSendR[lk][pj] != EMPTY) {
MPI_Isend (lsub1, msgcnt[0], mpi_int_t, pj,
SLU_MPI_TAG (0, kk0), /* (4*kk0)%tag_ub */
scp->comm, &send_req[pj]);
MPI_Isend (lusup1, msgcnt[1], SuperLU_MPI_DOUBLE_COMPLEX, pj,
SLU_MPI_TAG (1, kk0), /* (4*kk0+1)%tag_ub */
scp->comm, &send_req[pj + Pc]);
}
}
} /* for pj ... */
}
}
}
double tsch = SuperLU_timer_();
/************************************************************************/
#ifdef GPU_ACC
#include "zSchCompUdt-cuda.c"
#else
/*#include "SchCompUdt--Phi-2Ddynamic-alt.c"*/
#include "zSchCompUdt-2Ddynamic.c"
#endif
/*uncomment following to compare against SuperLU 3.3 baseline*/
/* #include "SchCompUdt--baseline.c" */
/************************************************************************/
NetSchurUpTimer += SuperLU_timer_()-tsch;
} /* for k0 = 0, ... */
/* ##################################################################
** END MAIN LOOP: for k0 = ...
################################################################## */
pdgstrfTimer= SuperLU_timer_()-pdgstrfTimer;
/* updating total flops */
#if ( PRNTlevel>=1 )
if (!iam) {
printf("Time in scattering %lf \n",scatter_timer );
printf("Time in dgemm %lf \n", gemm_timer );
printf("Total time spent in schur update is \t\t: %5.2lf seconds,\n",NetSchurUpTimer );
printf("Total Time in Factorization \t\t: %5.2lf seconds, \n", pdgstrfTimer);
printf("Time (other GEMM and Scatter) \t\t: %5.2lf seconds, \n", pdgstrfTimer-schur_flop_timer);
printf("Total time spent in schur update when offload \t\t: %5.2lf seconds,\n",CPUOffloadTimer );
}
#endif
#if ( DEBUGlevel>=2 )
for (i = 0; i < Pr * Pc; ++i) {
if (iam == i) {
zPrintLblocks(iam, nsupers, grid, Glu_persist, Llu);
zPrintUblocks(iam, nsupers, grid, Glu_persist, Llu);
printf ("(%d)\n", iam);
PrintInt10 ("Recv", nsupers, Llu->ToRecv);
}
MPI_Barrier (grid->comm);
}
#endif
// printf("Debug : MPI buffers 1\n");
/********************************************************
* Free memory *
********************************************************/
if (Pr * Pc > 1) {
SUPERLU_FREE (Lsub_buf_2[0]); /* also free Lsub_buf_2[1] */
SUPERLU_FREE (Lval_buf_2[0]); /* also free Lval_buf_2[1] */
if (Llu->bufmax[2] != 0)
SUPERLU_FREE (Usub_buf_2[0]);
if (Llu->bufmax[3] != 0)
SUPERLU_FREE (Uval_buf_2[0]);
if (U_diag_blk_send_req[myrow] != MPI_REQUEST_NULL) {
/* wait for last Isend requests to complete, deallocate objects */
for (krow = 0; krow < Pr; ++krow) {
if (krow != myrow)
MPI_Wait (U_diag_blk_send_req + krow, &status);
}
}
SUPERLU_FREE (U_diag_blk_send_req);
}
log_memory( -((Llu->bufmax[0] + Llu->bufmax[2]) * (num_look_aheads + 1) * iword +
(Llu->bufmax[1] + Llu->bufmax[3]) * (num_look_aheads + 1) * dword),
stat );
SUPERLU_FREE (Lsub_buf_2);
SUPERLU_FREE (Lval_buf_2);
SUPERLU_FREE (Usub_buf_2);
SUPERLU_FREE (Uval_buf_2);
SUPERLU_FREE (perm_c_supno);
SUPERLU_FREE (perm_u);
#ifdef ISORT
SUPERLU_FREE (iperm_u);
#endif
SUPERLU_FREE (look_ahead);
SUPERLU_FREE (factoredU);
SUPERLU_FREE (factored);
log_memory(-(6 * nsupers * iword), stat);
for (i = 0; i <= num_look_aheads; i++) {
SUPERLU_FREE (msgcnts[i]);
SUPERLU_FREE (msgcntsU[i]);
}
SUPERLU_FREE (msgcnts);
SUPERLU_FREE (msgcntsU);
for (i = 0; i <= num_look_aheads; i++) {
SUPERLU_FREE (send_reqs_u[i]);
SUPERLU_FREE (recv_reqs_u[i]);
SUPERLU_FREE (send_reqs[i]);
SUPERLU_FREE (recv_reqs[i]);
}
SUPERLU_FREE (recv_reqs_u);
SUPERLU_FREE (send_reqs_u);
SUPERLU_FREE (recv_reqs);
SUPERLU_FREE (send_reqs);
// printf("Debug : MPI buffers 3\n");
#ifdef GPU_ACC
checkCuda (cudaFreeHost (bigV));
checkCuda (cudaFreeHost (bigU));
cudaFree( (void*)dA ); /* Sherry added */
cudaFree( (void*)dB );
cudaFree( (void*)dC );
SUPERLU_FREE( handle );
SUPERLU_FREE( streams );
#else
SUPERLU_FREE (bigV);
SUPERLU_FREE (bigU);
#endif
log_memory(-(bigv_size + bigu_size) * dword, stat);
// printf("Debug : MPI buffers 5\n");
SUPERLU_FREE (Llu->ujrow);
SUPERLU_FREE (tempv2d);
SUPERLU_FREE (indirect);
SUPERLU_FREE (indirect2); /* Sherry added */
SUPERLU_FREE (iuip);
SUPERLU_FREE (ruip);
ldt = sp_ienv_dist(3);
log_memory( -(3 * ldt *ldt * dword + 2 * ldt * num_threads * iword
+ 2 * k * iword), stat );
/* Sherry added */
SUPERLU_FREE(omp_loop_time);
SUPERLU_FREE(full_u_cols);
SUPERLU_FREE(blk_ldu);
log_memory(-2 * ncb * dword, stat);
SUPERLU_FREE(stream_end_col);
SUPERLU_FREE(lookAheadFullRow);
SUPERLU_FREE(lookAheadStRow);
SUPERLU_FREE(lookAhead_lptr);
SUPERLU_FREE(lookAhead_ib);
SUPERLU_FREE(RemainFullRow);
SUPERLU_FREE(RemainStRow);
SUPERLU_FREE(Remain_lptr);
SUPERLU_FREE(Remain_ib);
SUPERLU_FREE(Remain_info);
SUPERLU_FREE(lookAhead_L_buff);
SUPERLU_FREE(Remain_L_buff);
log_memory( -(4 * mrb * iword + mrb * sizeof(Remain_info_t) +
ldt * ldt * (num_look_aheads + 1) * dword +
Llu->bufmax[1] * dword), stat );
SUPERLU_FREE(Ublock_info);
SUPERLU_FREE(Ublock_info_iukp);
SUPERLU_FREE(Ublock_info_rukp);
SUPERLU_FREE(Ublock_info_jb);
/* Prepare error message. */
if (*info == 0)
*info = n + 1;
#if ( PROFlevel>=1 )
TIC (t1);
#endif
MPI_Allreduce (info, &iinfo, 1, MPI_INT, MPI_MIN, grid->comm);
#if ( PROFlevel>=1 )
TOC (t2, t1);
stat->utime[COMM] += t2;
{
float msg_vol_max, msg_vol_sum, msg_cnt_max, msg_cnt_sum;
MPI_Reduce (&msg_cnt, &msg_cnt_sum,
1, MPI_FLOAT, MPI_SUM, 0, grid->comm);
MPI_Reduce (&msg_cnt, &msg_cnt_max,
1, MPI_FLOAT, MPI_MAX, 0, grid->comm);
MPI_Reduce (&msg_vol, &msg_vol_sum,
1, MPI_FLOAT, MPI_SUM, 0, grid->comm);
MPI_Reduce (&msg_vol, &msg_vol_max,
1, MPI_FLOAT, MPI_MAX, 0, grid->comm);
if (!iam) {
printf ("\tPZGSTRF comm stat:"
"\tAvg\tMax\t\tAvg\tMax\n"
"\t\t\tCount:\t%.0f\t%.0f\tVol(MB)\t%.2f\t%.2f\n",
msg_cnt_sum / Pr / Pc, msg_cnt_max,
msg_vol_sum / Pr / Pc * 1e-6, msg_vol_max * 1e-6);
}
}
#endif
if (iinfo == n + 1)
*info = 0;
else
*info = iinfo;
// printf("test out\n");
#if ( PRNTlevel==3 )
MPI_Allreduce (&zero_msg, &iinfo, 1, MPI_INT, MPI_SUM, grid->comm);
if (!iam)
printf (".. # msg of zero size\t%d\n", iinfo);
MPI_Allreduce (&total_msg, &iinfo, 1, MPI_INT, MPI_SUM, grid->comm);
if (!iam)
printf (".. # total msg\t%d\n", iinfo);
#endif
#if ( DEBUGlevel>=2 )
for (i = 0; i < Pr * Pc; ++i) {
if (iam == i) {
dPrintLblocks (iam, nsupers, grid, Glu_persist, Llu);
dPrintUblocks (iam, nsupers, grid, Glu_persist, Llu);
printf ("(%d)\n", iam);
PrintInt10 ("Recv", nsupers, Llu->ToRecv);
}
MPI_Barrier (grid->comm);
}
#endif
#if ( DEBUGlevel>=3 )
printf ("(%d) num_copy=%d, num_update=%d\n", iam, num_copy, num_update);
#endif
#if ( DEBUGlevel>=1 )
CHECK_MALLOC (iam, "Exit pzgstrf()");
#endif
return 0;
} /* PZGSTRF */
|
rrals.c |
#include "completion.h"
#include "../util.h"
#include "../reorder.h" /* `shuffle_idx` needed for random sampling */
#include "../io.h"
#include "../ccp/ccp.h"
#include "../sort.h"
#include <math.h>
#include <omp.h>
#include <time.h>
#include <sys/time.h>
/* TODO: Conditionally include this OR define lapack prototypes below?
* What does this offer beyond prototypes? Can we detect at compile time
* if we are using MKL vs ATLAS, etc.?
*/
//#include <mkl.h>
/* Use hardcoded 3-mode kernels when possible. Results in small speedups. */
#ifndef USE_3MODE_OPT
#define USE_3MODE_OPT 0
#endif
/******************************************************************************
* LAPACK PROTOTYPES
*****************************************************************************/
/*
* TODO: Can this be done in a better way?
*/
#if SPLATT_VAL_TYPEWIDTH == 32
void spotrf_(char *, int *, float *, int *, int *);
void spotrs_(char *, int *, int *, float *, int *, float *, int *, int *);
void ssyrk_(char *, char *, int *, int *, char *, char *, int *, char *, char *, int *);
#define LAPACK_DPOTRF spotrf_
#define LAPACK_DPOTRS spotrs_
#define LAPACK_DSYRK ssyrk_
#else
void dpotrf_(char *, int *, double *, int *, int *);
void dpotrs_(char *, int *, int *, double *, int *, double *, int *, int *);
void dsyrk_(char *, char *, int *, int *, double *, double *, int *, double *, double *, int *);
#define LAPACK_DPOTRF dpotrf_
#define LAPACK_DPOTRS dpotrs_
#define LAPACK_DSYRK dsyrk_
#endif
/******************************************************************************
* Slice-COO (S-COO) data structure
* - used in HyperTensor [Kaya & Ucar 2016] and GenTen [Phipps & Kolda 2018]
* - I made up the name and will ping Oguz/Eric/Tammy for their preference.
* - This should be moved to its own file in src/ so we can use it in other
* kernels later.
*****************************************************************************/
typedef struct
{
sptensor_t * coo; /* the actual tensor data */
/* We just pull these out of coo to save some typing */
idx_t nnz;
idx_t nmodes;
idx_t dims[MAX_NMODES];
/* Equivalent to row_ptr of CSR. Points into slice_nnz */
idx_t * slice_ptr[MAX_NMODES];
/* Each is a list of length nnz and indexes into coo->inds and coo->vals */
idx_t * slice_nnz[MAX_NMODES];
} scoo_t;
scoo_t * scoo_alloc(
sptensor_t const * const coo)
{
scoo_t * scoo = splatt_malloc(sizeof(*scoo));
/* Deep copy the COO tensor.
* TODO: support shallow copies? */
scoo->coo = tt_copy(coo);
scoo->nnz = coo->nnz;
scoo->nmodes = coo->nmodes;
for(idx_t m=0; m < coo->nmodes; ++m) {
scoo->dims[m] = coo->dims[m];
/* first count the nnz per slice and do an exclusive prefix sum */
idx_t * slice_counts = tt_get_hist(scoo->coo, m);
prefix_sum_exc(slice_counts, scoo->dims[m]);
/* now go over all non-zeros and store their locations in slice_nnz */
scoo->slice_nnz[m] = splatt_malloc(scoo->nnz * sizeof(**scoo->slice_nnz));
for(idx_t n=0; n < scoo->nnz; ++n) {
idx_t const slice = coo->ind[m][n];
idx_t const ptr = slice_counts[slice]++;
scoo->slice_nnz[m][ptr] = n;
}
/* now right-shift slice_counts into slice_ptrs to turn it back into an
* exclusive prefix (row_ptr) */
scoo->slice_ptr[m] = splatt_malloc(
(scoo->dims[m]+1) * sizeof(**scoo->slice_ptr));
scoo->slice_ptr[m][0] = 0;
for(idx_t i=1; i < scoo->dims[m] + 1; ++i) {
scoo->slice_ptr[m][i] = slice_counts[i-1];
}
splatt_free(slice_counts);
} /* foreach mode */
/* TODO: move these to unit tests */
for(idx_t m=0; m < scoo->nmodes; ++m) {
idx_t nnz = 0;
for(idx_t i=0; i < scoo->dims[m]; ++i) {
idx_t index;
for(index = scoo->slice_ptr[m][i];
index < scoo->slice_ptr[m][i+1];
++index) {
++nnz;
idx_t const ptr = scoo->slice_nnz[m][index];
idx_t const mode_j = scoo->coo->ind[m][ptr];
assert(scoo->coo->ind[m][ptr] == i);
}
}
assert(nnz == scoo->nnz);
}
return scoo;
}
void scoo_free(
scoo_t * scoo)
{
if(scoo == NULL) {
return;
}
for(idx_t m=0; m < scoo->nmodes; ++m) {
splatt_free(scoo->slice_ptr[m]);
splatt_free(scoo->slice_nnz[m]);
}
tt_free(scoo->coo);
splatt_free(scoo);
}
/******************************************************************************
* PRIVATE FUNCTIONS
*****************************************************************************/
static inline void p_add_hada_clear(
val_t * const restrict accum,
val_t * const restrict toclear,
val_t const * const restrict b,
idx_t const nfactors)
{
for(idx_t f=0; f < nfactors; ++f) {
accum[f] += toclear[f] * b[f];
toclear[f] = 0;
}
}
/**
* @brief Compute the Cholesky decomposition of the normal equations and solve
* for out_row. We only compute the upper-triangular portion of 'neqs',
* so work with the lower-triangular portion when column-major
* (for Fortran).
*
* @param neqs The NxN normal equations.
* @param[out] out_row The RHS of the equation. Updated in place.
* @param N The rank of the problem.
*/
static inline void p_invert_row(
val_t * const restrict neqs,
val_t * const restrict out_row,
idx_t const N)
{
char uplo = 'L';
int order = (int) N;
int lda = (int) N;
int info;
LAPACK_DPOTRF(&uplo, &order, neqs, &lda, &info);
if(info) {
fprintf(stderr, "SPLATT: DPOTRF returned %d\n", info);
}
int nrhs = 1;
int ldb = (int) N;
LAPACK_DPOTRS(&uplo, &order, &nrhs, neqs, &lda, out_row, &ldb, &info);
if(info) {
fprintf(stderr, "SPLATT: DPOTRS returned %d\n", info);
}
}
/**
* @brief Compute DSYRK: out += A^T * A, a rank-k update. Only compute
* the upper-triangular portion.
*
* @param A The input row(s) to update with.
* @param N The length of 'A'.
* @param nvecs The number of rows in 'A'.
* @param nflush Then number of times this has been performed (this slice).
* @param[out] out The NxN matrix to update.
*/
static inline void p_vec_oprod(
val_t * const restrict A,
idx_t const N,
idx_t const nvecs,
idx_t const nflush,
val_t * const restrict out)
{
char uplo = 'L';
char trans = 'N';
int order = (int) N;
int k = (int) nvecs;
int lda = (int) N;
int ldc = (int) N;
val_t alpha = 1;
val_t beta = (nflush == 0) ? 0. : 1.;
LAPACK_DSYRK(&uplo, &trans, &order, &k, &alpha, A, &lda, &beta, out, &ldc);
}
/*
* RRALS - these are the permutation vectors for each thread.
* XXX: throw these into a workspace structure or something else not global...
*/
// static idx_t const MAX_THREADS = 1024;
static int findCeil(val_t S[], val_t r, int l, int h){
int mid;
while (l < h)
{
mid = l + ((h - l) >> 1);
(r > S[mid]) ? (l = mid + 1) : (h = mid);
}
return (S[l] >= r) ? l : 0;
}
#ifndef RRALS_MAX_THREADS
#define RRALS_MAX_THREADS 1024
#endif
static idx_t const PERM_INIT = 128;
// static idx_t perm_i_lengths[MAX_THREADS];
static idx_t perm_i_lengths[RRALS_MAX_THREADS];
// static idx_t * perm_i_global[MAX_THREADS];
static idx_t * perm_i_global[RRALS_MAX_THREADS];
/*
* Each thread is given a random seed to use for sampling. We pad them to
* ensure each falls on a different cache line (to avoid false sharing).
*/
static idx_t const SEED_PADDING = 16;
static unsigned int * sample_seeds = NULL;
static void p_process_slice(
scoo_t const * const scoo,
idx_t const slice_id,
idx_t const mode,
val_t * * mvals,
idx_t const nfactors,
val_t * const restrict out_row,
val_t * const accum,
val_t * const restrict neqs,
val_t * const restrict neqs_buf,
val_t * const neqs_buf_tree,
idx_t * const nflush,
val_t ** const lev_score,
int alpha,
float beta,
int **act,
int **frac,
int **same,
double *sampling_time,
double *mttkrp_time)
{
struct timeval start_t, stop_t, start_tt, stop_tt;
idx_t const nmodes = scoo->nmodes;
val_t const * const restrict vals = scoo->coo->vals;
idx_t const * const restrict slice_ptr = scoo->slice_ptr[mode];
idx_t const * const restrict slice_nnz = scoo->slice_nnz[mode];
idx_t const * const * const inds = scoo->coo->ind;
idx_t const slice_start = slice_ptr[slice_id];
idx_t slice_end = slice_ptr[slice_id+1];
idx_t const slice_size = slice_end - slice_start;
// int *indicator = (int *)malloc((slice_end-slice_start) * sizeof(int));
// for(int i=0; i < (slice_end-slice_start); i++)
// indicator[i] = 0;
gettimeofday(&start_tt, NULL);
// Mode which must be chosen to compute MTTKRP
idx_t *Modes = (idx_t *)malloc((nmodes-1)*sizeof(idx_t));
int k=0;
for(int m=0; m<nmodes; m++){
if(mode == m)
continue;
Modes[k++] = m;
}
// Initializing the vector containing leverage score corresponding to the nnz present in the slice
// val_t sum=0.0;
val_t *S_pdf = (val_t *)malloc((slice_end - slice_start) * sizeof(val_t));
// Computing the vector by multiplying the leverage score for the other two modes
val_t score;
for(int i=slice_start; i < slice_end; i++){
idx_t nnz_index = slice_nnz[i];
score = lev_score[Modes[0]][scoo->coo->ind[Modes[0]][nnz_index]] * lev_score[Modes[1]][scoo->coo->ind[Modes[1]][nnz_index]];
S_pdf[i-slice_start] = score;
// sum += score;
}
// // Normalize the leverage score
// for(int i=0; i<(slice_end-slice_start); i++)
// S_pdf[i] /= sum;
// // Convert pdf to cdf for easier sampling
// val_t *S_cdf = (val_t *)malloc((slice_end - slice_start) * sizeof(val_t));
// S_cdf[0] = S_pdf[0];
// for(int i=1; i<(slice_end-slice_start); i++)
// S_cdf[i] = S_cdf[i-1] + S_pdf[i];
for(idx_t f=0; f < nfactors; ++f) {
accum[f] = 0.;
}
/* buffer of rows to form normal equations */
idx_t bufsize = 0;
val_t * hada = neqs_buf; /* each row is a hadamard product */
/* sampling buffers */
int const tid = splatt_omp_get_thread_num();
idx_t * perm_i = NULL;
gettimeofday(&start_t, NULL);
idx_t sample_threshold;
val_t sample_rate;
if(mode == 0){
sample_threshold = alpha * nfactors;
sample_rate = beta;
}
else if(mode == 2){
sample_threshold = alpha * nfactors;
sample_rate = beta;
}
else{
sample_threshold = alpha * nfactors;
sample_rate = beta;
}
int sample = 0;
if(mode == 1 || mode == 2){
if(slice_size > sample_threshold) {
sample = 1;
/* realloc sample buffer if needed */
if(slice_size > perm_i_lengths[tid]) {
perm_i_lengths[tid] = slice_size;
splatt_free(perm_i_global[tid]);
perm_i_global[tid] = splatt_malloc(slice_size * sizeof(*perm_i_global));
}
/* fill buffer with indices and shuffle to get sampled nnz */
/* RRALS-TODO: can we intead just sample nnz_ptr[]? Or do an initial shuffle
* at the beginning of RRALS (or every few its) and instead just choose
* a rand starting index? Then proceed and process non-zeros
* [rand_start, (rand_start+sample_size) % end).
*
* Current implementation is still O(nnz) instead of O(sampled nnz). */
perm_i = perm_i_global[tid];
for(idx_t n=slice_start; n < slice_end; ++n) {
perm_i[n-slice_start] = n;
}
idx_t const my_sample_size = sample_threshold + ((slice_size-sample_threshold) / sample_rate);
idx_t const sample_size = SS_MIN(slice_size, my_sample_size);
// quick_shuffle(perm_i, sample_size, &(sample_seeds[tid * SEED_PADDING]));
quick_shuffle(perm_i, S_pdf, slice_size, sample_size, &(sample_seeds[tid * SEED_PADDING]));
slice_end = slice_start + sample_size;
}
gettimeofday(&stop_t, NULL);
*sampling_time += (stop_t.tv_sec + stop_t.tv_usec/1000000.0)- (start_t.tv_sec + start_t.tv_usec/1000000.0);
}
/* store diagnostics */
act[mode][slice_id] = slice_size;
frac[mode][slice_id] = slice_end - slice_start;
/* foreach nnz in slice */
for(idx_t x = slice_start; x < slice_end; ++x) {
/* initialize buffers */
for(idx_t f=0; f < nfactors; ++f) {
hada[f] = 1.;
}
/* which non-zero to process */
idx_t nnz_ptr = slice_nnz[x];
gettimeofday(&start_t, NULL);
if(sample) {
// double max_lim = S_cdf[slice_end-slice_start-1] - S_cdf[0];
// val_t r = fmod((double)rand(), max_lim) + S_cdf[0];
// int indexc = findCeil(S_cdf, r, 0, (slice_end-slice_start-1));
// idx_t indexc = x - slice_start;
// indicator[indexc] += 1;
// nnz_ptr = slice_nnz[indexc];
nnz_ptr = slice_nnz[perm_i[x - slice_start]];
}
gettimeofday(&stop_t, NULL);
*sampling_time += (stop_t.tv_sec + stop_t.tv_usec/1000000.0)- (start_t.tv_sec + start_t.tv_usec/1000000.0);
// ///////////////////////////////////////////////////////////////////////////
// // Check how many same samples has been selected more than once
// int same_nnz_sampled = 0;
// for(int i=0; i<(slice_end-slice_start); i++){
// if(indicator[i] > 0)
// same_nnz_sampled += indicator[i]-1;
// }
// same[mode][slice_id] = same_nnz_sampled;
// //////////////////////////////////////////////////////////////////////////
/* compute hadamard product */
for(idx_t m=0; m < nmodes; ++m) {
if(m == mode) {
continue;
}
idx_t const row_id = inds[m][nnz_ptr];
val_t const * const restrict row = &(mvals[m][row_id * nfactors]);
for(idx_t f=0; f < nfactors; ++f) {
hada[f] *= row[f];
}
}
/* accumulate MTTKRP */
for(idx_t f=0; f < nfactors; ++f) {
accum[f] += vals[nnz_ptr] * hada[f];
}
hada += nfactors;
/* if buffer is full, flush and accumulate into neqs */
if(++bufsize == ALS_BUFSIZE) {
/* add to normal equations and reset hada */
p_vec_oprod(neqs_buf, nfactors, bufsize, (*nflush)++, neqs);
bufsize = 0;
hada = neqs_buf;
}
/* store mttkrp result in RHS of linear system */
for(idx_t f=0; f < nfactors; ++f) {
out_row[f] += accum[f];
accum[f] = 0.;
}
}
gettimeofday(&stop_tt, NULL);
*mttkrp_time += (stop_tt.tv_sec + stop_tt.tv_usec/1000000.0)- (start_tt.tv_sec + start_tt.tv_usec/1000000.0);
free(S_pdf);
// free(S_cdf);
free(Modes);
/* flush and accumulate into neqs */
p_vec_oprod(neqs_buf, nfactors, bufsize, (*nflush)++, neqs);
}
/**
* @brief Compute the i-ith row of the MTTKRP, form the normal equations, and
* store the new row.
*
* @param scoo The tensor of training data.
* @param slice_id The row to update.
* @param reg Regularization parameter for the i-th row.
* @param model The model to update
* @param ws Workspace.
* @param tid OpenMP thread id.
*/
static void p_update_slice(
scoo_t const * const scoo,
idx_t const mode,
idx_t const slice_id,
val_t const reg,
tc_model * const model,
tc_ws * const ws,
int const tid,
val_t ** const lev_score,
int alpha,
float beta,
int **act,
int **frac,
int **same,
double *solving_time,
double *sampling_time,
double *mttkrp_time)
{
struct timeval start, stop;
idx_t const nmodes = scoo->nmodes;
idx_t const nfactors = model->rank;
/* fid is the row we are actually updating */
#ifdef SPLATT_USE_MPI
assert(slice_id < model->globmats[mode]->I);
val_t * const restrict out_row = model->globmats[mode]->vals +
(slice_id * nfactors);
#else
val_t * const restrict out_row = model->factors[mode] +
(slice_id * nfactors);
#endif
val_t * const restrict accum = ws->thds[tid].scratch[1];
val_t * const restrict neqs = ws->thds[tid].scratch[2];
idx_t bufsize = 0; /* how many hada vecs are in mat_accum */
idx_t nflush = 0; /* how many times we have flushed to add to the neqs */
val_t * const restrict mat_accum = ws->thds[tid].scratch[3];
val_t * hada = mat_accum;
val_t * const restrict hada_accum = ws->thds[tid].scratch[4];
/* clear out buffers */
for(idx_t m=0; m < nmodes; ++m) {
for(idx_t f=0; f < nfactors; ++f) {
accum[f + (m*nfactors)] = 0.;
}
for(idx_t f=0; f < nfactors; ++f) {
hada_accum[f + (m*nfactors)] = 0.;
}
}
for(idx_t f=0; f < nfactors; ++f) {
out_row[f] = 0;
}
/* grab factors */
val_t * mats[MAX_NMODES];
for(idx_t m=0; m < nmodes; ++m) {
mats[m] = model->factors[m];
}
/* do MTTKRP + dsyrk */
p_process_slice(scoo, slice_id, mode, mats, nfactors, out_row, accum, neqs,
mat_accum, hada_accum, &nflush, lev_score, alpha, beta, act, frac, same, sampling_time, mttkrp_time);
gettimeofday(&start, NULL);
/* add regularization to the diagonal */
for(idx_t f=0; f < nfactors; ++f) {
neqs[f + (f * nfactors)] += reg;
}
/* solve! */
p_invert_row(neqs, out_row, nfactors);
gettimeofday(&stop, NULL);
*solving_time += (stop.tv_sec + stop.tv_usec/1000000.0) - (start.tv_sec + start.tv_usec/1000000.0);
}
/**
* @brief Update factor[m] which follows a dense mode. This function should be
* called from inside an OpenMP parallel region!
*
* @param csf The CSF tensor array. csf[m] is a tiled tensor.
* @param m The mode we are updating.
* @param model The current model.
* @param ws Workspace info.
* @param thd_densefactors Thread structures for the dense mode.
* @param tid Thread ID.
*/
static void p_densemode_als_update(
splatt_csf const * const csf,
idx_t const m,
tc_model * const model,
tc_ws * const ws,
thd_info * const thd_densefactors,
int const tid)
{
idx_t const rank = model->rank;
/* master thread writes/aggregates directly to the model */
#pragma omp master
#ifdef SPLATT_USE_MPI
SPLATT_VPTR_SWAP(thd_densefactors[0].scratch[0], model->globmats[m]->vals);
idx_t const dense_slices = model->globmats[m]->I;
#else
SPLATT_VPTR_SWAP(thd_densefactors[0].scratch[0], model->factors[m]);
idx_t const dense_slices = model->dims[m];
#endif
/* TODO: this could be better by instead only initializing neqs with beta=0
* and keeping track of which have been updated. */
memset(thd_densefactors[tid].scratch[0], 0,
dense_slices * rank * sizeof(val_t));
memset(thd_densefactors[tid].scratch[1], 0,
dense_slices * rank * rank * sizeof(val_t));
#pragma omp barrier
/* XXX S-COO needs something here */
#if 0
/* update each tile in parallel */
#pragma omp for schedule(dynamic, 1)
for(idx_t tile=0; tile < csf[m].ntiles; ++tile) {
p_process_tile(csf+m, tile, model, ws, thd_densefactors, tid);
}
#endif
/* aggregate partial products */
thd_reduce(thd_densefactors, 0,
dense_slices * rank, REDUCE_SUM);
/* TODO: this could be better by using a custom reduction which only
* operates on the upper triangular portion. OpenMP 4 declare reduction
* would be good here? */
thd_reduce(thd_densefactors, 1,
dense_slices * rank * rank, REDUCE_SUM);
/* save result to model */
#pragma omp master
#ifdef SPLATT_USE_MPI
SPLATT_VPTR_SWAP(thd_densefactors[0].scratch[0], model->globmats[m]->vals);
#else
SPLATT_VPTR_SWAP(thd_densefactors[0].scratch[0], model->factors[m]);
#endif
#pragma omp barrier
/* do all of the Cholesky factorizations */
#ifdef SPLATT_USE_MPI
val_t * const restrict out = model->globmats[m]->vals;
#else
val_t * const restrict out = model->factors[m];
#endif
val_t const reg = ws->regularization[m];
#pragma omp for schedule(static, 1)
for(idx_t i=0; i < dense_slices; ++i) {
val_t * const restrict neqs_i =
(val_t *) thd_densefactors[0].scratch[1] + (i * rank * rank);
/* add regularization */
for(idx_t f=0; f < rank; ++f) {
neqs_i[f + (f * rank)] += reg;
}
/* Cholesky + solve */
p_invert_row(neqs_i, out + (i * rank), rank);
}
}
static val_t *getGram(val_t *A, idx_t nrows, idx_t rank){
val_t *gram = (val_t *)malloc((rank*rank) * sizeof(val_t));
val_t sum;
for(int i=0; i<rank; i++){
for(int j=0; j<rank; j++){
sum = 0;
for(int k=0; k<nrows; k++){
sum += A[i + k*rank]*A[j + k*rank];
}
gram[j + i*rank] = sum;
}
}
return gram;
// val_t *gram = (val_t *)malloc((rank*rank) * sizeof(val_t));
// for(int i=0; i<rank; i++)
// for(int j=0; j<nrows; j++)
// for(int k=0; k<rank; k++)
// gram[i*rank + k] += A[j*rank + i] * A[j*rank + k];
// return gram;
// val_t *gram = (val_t *)malloc((rank*rank) * sizeof(val_t));
// val_t sum;
// for(int i=0; i<rank; i++){
// for(int j=0; j<rank; j++){
// sum = 0;
// for(int k=0; k<nrows; k++){
// sum += A[i*nrows + k]*A[j*nrows + k];
// }
// gram[j + i*rank] = sum;
// }
// }
// return gram;
}
static val_t *GramInv(val_t *A, idx_t N){
// int *IPIV = (int *)malloc((N+1) * sizeof(int));
// int LWORK = N*N;
// double *WORK = (double *)malloc(LWORK * sizeof(double));
// int INFO;
char uplo = 'L';
int order = (int)N;
int lda = (int)N;
int info;
LAPACK_DPOTRF(&uplo, &order, A, &lda, &info);
// if(info){
// printf("info dpotrf = %d\n", info);
// }
dpotri_(&uplo, &order, A, &lda, &info);
// if(info){
// printf("info dpotri = %d\n", info);
// }
// dgetrf_(&N,&N,A,&N,IPIV,&INFO);
// if(INFO != 0)
// printf("INFO after dgetrf = %d\n",INFO);
// dgetri_(&N,A,&N,IPIV,WORK,&LWORK,&INFO);
// if(INFO != 0)
// printf("INFO after dgetri = %d\n",INFO);
// free(IPIV);
// free(WORK);
return A;
}
// static void getLvrgScore(val_t *A, val_t *gram, val_t **lev_score, idx_t rank, idx_t nrows, int factor){
// // double * I = (double *)malloc((nrows*rank) * sizeof(double));
// // // double * J = (double *)malloc((nrows*nrows) * sizeof(double));
// // val_t sum = 0.0;
// // for(int i=0; i<nrows; i++){
// // for(int j=0; j<rank; j++){
// // for(int k=0; k<rank; k++)
// // sum += A[i*rank + k] * gram[k*rank + j];
// // I[i*rank + j] = (double)sum;
// // sum = 0.0;
// // }
// // }
// // sum = 0.0;
// // for(int i=0; i<nrows; i++){
// // // for(int j=0; j<nrows; j++){
// // for(int k=0; k<rank; k++)
// // sum += I[i*rank + k] * A[i*rank + k];
// // lev_score[factor][i] = sum;
// // // J[i*nrows + j] = (double)sum;
// // sum = 0.0;
// // // }
// // }
// // // for(int i=0; i<nrows; i++)
// // // lev_score[factor][i] = J[i*nrows + i];
// // free(I);
// // // free(J);
// for (int i=0; i<nrows; ++i){
// for (int j1=0; j1<rank; j1++){
// for (int j2=0; j2<rank; j2++){
// lev_score[factor][i] += A[i*rank + j1] * gram[j1*rank + j2] * A[i*rank + j2];
// }
// }
// }
// }
static void getLvrgScore(val_t * A, val_t **lev_score, idx_t rank, idx_t nrows, int factor){
char jobu = 'S';
char jobvt = 'N';
int m = (int)nrows;
int n = (int)rank;
int lda = m;
int ldu = m;
int ldvt = n;
double *S = (double *)malloc(n * sizeof(double));
double *U = (double *)malloc((ldu*m) * sizeof(double));
double *VT;
int lwork = -1;
double wkopt;
double *work;
int info;
double *a = (double *)malloc((nrows*rank) * sizeof(double));
for(int i=0; i<nrows; i++)
for(int j=0; j<rank; j++)
a[j*nrows + i] = A[i*rank + j];
// Query and allocate appropriate workspace
dgesvd_(&jobu, &jobvt, &m, &n, a, &lda, S, U, &ldu, VT, &ldvt, &wkopt, &lwork, &info);
if(info)
printf("info return %d\n",info);
lwork = (int)wkopt;
work = (double *)malloc(lwork*sizeof(double));
/* Compute SVD */
dgesvd_(&jobu, &jobvt, &m, &n, a, &lda, S, U, &ldu, VT, &ldvt, work, &lwork, &info);
if(info)
printf("info return %d\n",info);
for(int i=0; i<m; i++){
val_t sum = 0.0;
for(int j=0; j<n; j++)
sum += U[i + j*ldu] * U[i + j*ldu];
sum = sqrt((double)sum);
lev_score[factor][i] = sum;
}
}
void qcksort_s(idx_t * a, idx_t start, idx_t end){
idx_t i, j, pivot, temp;
if((int)start < (int)end){
pivot = start;
i = start;
j = end;
while(i<j){
while(a[i] <= a[pivot] && i < end)
i++;
while(a[j] > a[pivot])
j--;
if(i<j){
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
temp = a[pivot];
a[pivot] = a[j];
a[j] = temp;
qcksort_s(a, start, j-1);
qcksort_s(a, j+1, end);
}
}
idx_t * reservoir_sample_s(
val_t * const weight,
idx_t M,
idx_t const N)
{
double * key = (double *)malloc(N * sizeof(double));
idx_t * a = (idx_t *)malloc(N * sizeof(idx_t));
val_t min_key = 32767;
idx_t pos = 0;
for(int i=0; i<N; i++){
double j = (double)rand() / RAND_MAX;
a[i] = i;
key[i] = pow(j, (1.0/(weight[i]+0.01)));
if(key[i] < min_key){
min_key = key[i];
pos = i;
}
}
val_t new_key;
for(int i=N; i<M; i++){
double j = (double)rand() / RAND_MAX;
new_key = pow(j, (1.0/(double)weight[i]));
if(new_key > min_key){
a[pos] = i;
key[pos] = new_key;
min_key = new_key;
for(int k=0; k<N; k++){
if(key[k] < min_key){
min_key = key[k];
pos = k;
}
}
}
}
free(key);
if(N != 0)
qcksort_s(a, 0, N-1);
return a;
}
#ifdef SPLATT_USE_MPI
static void p_update_factor_all2all(
tc_model * const model,
tc_ws * const ws,
idx_t const mode)
{
rank_info * const rinfo = ws->rinfo;
idx_t const m = mode;
idx_t const nfactors = model->rank;
idx_t const nglobrows = model->globmats[m]->I;
val_t const * const restrict gmatv = model->globmats[m]->vals;
/* ensure local info is up to date */
assert(rinfo->ownstart[m] + rinfo->nowned[m] <= model->dims[m]);
val_t * const restrict matv = model->factors[m];
par_memcpy(matv + (rinfo->ownstart[m] * nfactors), gmatv,
rinfo->nowned[m] * nfactors * sizeof(*matv));
if(rinfo->layer_size[mode] == 1) {
return;
}
/* first prepare all values that I own and need to send */
idx_t const mat_start = rinfo->mat_start[m];
idx_t const * const restrict nbr2globs_inds = rinfo->nbr2globs_inds[m];
idx_t const * const restrict local2nbr_inds = rinfo->local2nbr_inds[m];
idx_t const nsends = rinfo->nnbr2globs[m];
idx_t const nrecvs = rinfo->nlocal2nbr[m];
val_t * const restrict nbr2globs_buf = ws->nbr2globs_buf;
val_t * const restrict nbr2local_buf = ws->local2nbr_buf;
/* fill send buffer */
#pragma omp for
for(idx_t s=0; s < nsends; ++s) {
assert(nbr2globs_inds[s] >= mat_start);
idx_t const row = nbr2globs_inds[s] - mat_start;
val_t * const restrict buf_row = nbr2globs_buf + (s * nfactors);
val_t const * const restrict gmat_row = gmatv + (row * nfactors);
for(idx_t f=0; f < nfactors; ++f) {
buf_row[f] = gmat_row[f];
}
}
/* exchange entries */
#pragma omp master
{
/* grab ptr/disp from rinfo. nbr2local and local2nbr will have the same
* structure so we just reuse those */
int const * const restrict nbr2globs_ptr = rinfo->nbr2globs_ptr[m];
int const * const restrict nbr2local_ptr = rinfo->local2nbr_ptr[m];
int const * const restrict nbr2globs_disp = rinfo->nbr2globs_disp[m];
int const * const restrict nbr2local_disp = rinfo->local2nbr_disp[m];
timer_start(&timers[TIMER_MPI_COMM]);
MPI_Alltoallv(nbr2globs_buf, nbr2globs_ptr, nbr2globs_disp, SPLATT_MPI_VAL,
nbr2local_buf, nbr2local_ptr, nbr2local_disp, SPLATT_MPI_VAL,
rinfo->layer_comm[m]);
timer_stop(&timers[TIMER_MPI_COMM]);
}
#pragma omp barrier
/* now write incoming values to my local matrix */
#pragma omp for
for(idx_t r=0; r < nrecvs; ++r) {
idx_t const row = local2nbr_inds[r];
assert(row < rinfo->ownstart[m] || row >= rinfo->ownend[m]);
val_t * const restrict mat_row = matv + (row * nfactors);
val_t const * const restrict buf_row = nbr2local_buf + (r * nfactors);
for(idx_t f=0; f < nfactors; ++f) {
mat_row[f] = buf_row[f];
}
}
}
static void p_init_mpi(
sptensor_t const * const train,
tc_model * const model,
tc_ws * const ws)
{
idx_t maxlocal2nbr = 0;
idx_t maxnbr2globs = 0;
for(idx_t m=0; m < train->nmodes; ++m) {
maxlocal2nbr = SS_MAX(maxlocal2nbr, ws->rinfo->nlocal2nbr[m]);
maxnbr2globs = SS_MAX(maxnbr2globs, ws->rinfo->nnbr2globs[m]);
}
ws->local2nbr_buf = splatt_malloc(model->rank*maxlocal2nbr * sizeof(val_t));
ws->nbr2globs_buf = splatt_malloc(model->rank*maxnbr2globs * sizeof(val_t));
/* get initial factors */
for(idx_t m=0; m < train->nmodes; ++m) {
p_update_factor_all2all(model, ws, m);
}
timer_reset(&timers[TIMER_MPI_COMM]);
}
#endif
/******************************************************************************
* PUBLIC FUNCTIONS
*****************************************************************************/
void splatt_tc_rrals(
sptensor_t * train,
sptensor_t * const validate,
tc_model * const model,
tc_ws * const ws,
int alpha,
float beta)
{
idx_t const nmodes = train->nmodes;
idx_t const nfactors = model->rank;
#ifdef SPLATT_USE_MPI
rank_info * rinfo = ws->rinfo;
int const rank = rinfo->rank;
#else
int const rank = 0;
#endif
// if(rank == 0) {
// printf("BUFSIZE=%d\n", ALS_BUFSIZE);
// printf("USE_3MODE_OPT=%d\n", USE_3MODE_OPT);
// }
/* XXX: temporarily disabling dense mode replication */
ws->num_dense = 0;
for(idx_t m=0; m < nmodes; ++m ){
ws->isdense[m] = 0;
}
/* store dense modes redundantly among threads */
thd_info * thd_densefactors = NULL;
if(ws->num_dense > 0) {
thd_densefactors = thd_init(ws->nthreads, 3,
ws->maxdense_dim * nfactors * sizeof(val_t), /* accum */
ws->maxdense_dim * nfactors * nfactors * sizeof(val_t), /* neqs */
ws->maxdense_dim * sizeof(int)); /* nflush */
// if(rank == 0) {
// printf("REPLICATING MODES:");
// for(idx_t m=0; m < nmodes; ++m) {
// if(ws->isdense[m]) {
// printf(" %"SPLATT_PF_IDX, m+1);
// }
// }
// printf("\n\n");
// }
}
/* load-balanced partition each mode for threads */
idx_t * parts[MAX_NMODES];
/* Allocate a slice-indexed COO tensor. */
scoo_t * scoo = scoo_alloc(train);
#ifdef SPLATT_USE_MPI
sptensor_t * both = NULL;
if(validate != NULL) {
both = tt_union(train, validate);
}
for(idx_t m=0; m < nmodes; ++m) {
/* setup communication structures */
mpi_find_owned(train, m, rinfo);
if(validate != NULL) {
mpi_compute_ineed(rinfo, both, m, nfactors, 1);
} else {
mpi_compute_ineed(rinfo, train, m, nfactors, 1);
}
}
if(validate != NULL) {
tt_free(both);
}
#endif
for(idx_t m=0; m < nmodes; ++m) {
#ifdef SPLATT_USE_MPI
/* tt has more nonzeros than any of the modes actually need, so we need
* to filter them first. */
sptensor_t * tt_filtered = mpi_filter_tt_1d(train, m,
rinfo->mat_start[m], rinfo->mat_end[m]);
assert(tt_filtered->dims[m] == rinfo->mat_end[m] - rinfo->mat_start[m]);
assert(train->indmap[m] == NULL);
assert(tt_filtered->indmap[m] == NULL);
#endif
#if 0
if(ws->isdense[m]) {
/* standard CSF allocation for sparse modes */
opts[SPLATT_OPTION_TILE] = SPLATT_DENSETILE;
opts[SPLATT_OPTION_TILEDEPTH] = 1; /* don't tile dense mode */
#ifdef SPLATT_USE_MPI
csf_alloc_mode(tt_filtered, CSF_SORTED_MINUSONE, m, csf+m, opts);
#else
csf_alloc_mode(train, CSF_SORTED_MINUSONE, m, csf+m, opts);
#endif
parts[m] = NULL;
} else {
/* standard CSF allocation for sparse modes */
opts[SPLATT_OPTION_TILE] = SPLATT_NOTILE;
#ifdef SPLATT_USE_MPI
csf_alloc_mode(tt_filtered, CSF_SORTED_MINUSONE, m, csf+m, opts);
#else
csf_alloc_mode(train, CSF_SORTED_MINUSONE, m, csf+m, opts);
#endif
parts[m] = csf_partition_1d(csf+m, 0, ws->nthreads);
}
#endif
#ifdef SPLATT_USE_MPI
tt_free(tt_filtered);
#ifdef SPLATT_DEBUG
/* sanity check on nnz */
idx_t totnnz;
MPI_Allreduce(&(csf[m].nnz), &totnnz, 1, SPLATT_MPI_IDX, MPI_SUM,
rinfo->comm_3d);
assert(totnnz == rinfo->global_nnz);
#endif
#endif
} /* foreach mode */
#ifdef SPLATT_USE_MPI
p_init_mpi(train, model, ws);
/* TERRIBLE HACK for loss computation */
sptensor_t * train_back = train;
sptensor_t * tt_filter = mpi_filter_tt_1d(train, 0, rinfo->mat_start[0],
rinfo->mat_end[0]);
#pragma omp parallel for
for(idx_t n=0; n < tt_filter->nnz; ++n) {
tt_filter->ind[0][n] += rinfo->mat_start[0];
}
train = tt_filter;
#endif
// if(rank == 0) {
// printf("\n");
// }
sample_seeds = splatt_malloc(
splatt_omp_get_max_threads() * SEED_PADDING * sizeof(*sample_seeds));
#pragma omp parallel
{
int const tid = splatt_omp_get_thread_num();
perm_i_lengths[tid] = PERM_INIT;
perm_i_global[tid] = splatt_malloc(PERM_INIT * sizeof(*perm_i_global));
sample_seeds[tid * SEED_PADDING] = tid;
}
val_t loss = tc_loss_sq(train, model, ws);
val_t frobsq = tc_frob_sq(model, ws);
tc_converge(train, validate, model, loss, frobsq, 0, ws);
FILE *f_act = fopen("Actual.csv", "w");
FILE *f_frac = fopen("Fraction.csv", "w");
FILE *f_time = fopen("Time.csv", "w");
FILE *f_lev = fopen("Leverage.csv", "w");
// FILE *f_same = fopen("Same.csv", "w");
int **act = (int **)malloc(nmodes*sizeof(int *));
for(int i=0; i<nmodes; i++){
act[i] = (int *)malloc((scoo->dims[i])*sizeof(int));
}
int **frac = (int **)malloc(nmodes*sizeof(int *));
for(int i=0; i<nmodes; i++){
frac[i] = (int *)malloc((scoo->dims[i])*sizeof(int));
}
int **same = (int **)malloc(nmodes*sizeof(int *));
for(int i=0; i<nmodes; i++){
same[i] = (int *)malloc((scoo->dims[i])*sizeof(int));
}
double **time_slice = (double **)malloc(nmodes*sizeof(double *));
for(int i=0; i<nmodes; i++){
time_slice[i] = (double *)malloc((scoo->dims[i])*sizeof(double));
}
double avg_sampling_time[3] = {0.0, 0.0, 0.0};
double avg_solving_time[3] = {0.0, 0.0, 0.0};
double avg_mttkrp_time[3] = {0.0, 0.0, 0.0};
double avg_tot_time[3] = {0.0, 0.0, 0.0};
int count = 0;
double avg_gram_time = 0.0;
sp_timer_t gram_timer;
sp_timer_t mode_timer;
timer_reset(&mode_timer);
timer_start(&ws->tc_time);
val_t **lev_score = (val_t **)malloc(nmodes * sizeof(val_t *));
for(int i=0; i<nmodes; i++)
lev_score[i] = (val_t *)malloc((model->dims[i])*sizeof(val_t));
for(idx_t e=1; e < ws->max_its+1; ++e) {
count++;
for(int i=0; i<nmodes; i++){
for(int j=0; j<scoo->dims[i]; j++){
act[i][j] = 0;
frac[i][j] = 0;
}
}
timer_fstart(&gram_timer);
for(int i=0; i<nmodes; i++){
// val_t *gram = getGram(model->factors[i], model->dims[i], model->rank);
// gram = GramInv(gram, model->rank);
getLvrgScore(model->factors[i], lev_score, model->rank, model->dims[i], i);
}
timer_stop(&gram_timer);
avg_gram_time += gram_timer.seconds;
idx_t mode_a_size = 0.3 * model->dims[0];
idx_t * imp_a = (idx_t *)malloc(mode_a_size * sizeof(idx_t));
imp_a = reservoir_sample_s(lev_score[0], model->dims[0], mode_a_size);
idx_t counter = 0;
#pragma omp parallel
{
int const tid = splatt_omp_get_thread_num();
for(idx_t m=0; m < nmodes; ++m) {
double solving_time = 0.0;
double sampling_time = 0.0;
double mttkrp_time = 0.0;
#pragma omp master
timer_fstart(&mode_timer);
if(ws->isdense[m]) {
/* XXX */
//p_densemode_als_update(csf, m, model, ws, thd_densefactors, tid);
/* dense modes are easy */
} else {
/* update each row in parallel */
/* RRALS-TODO: we can maybe statically load balance this loop using
* CCP (chains-on-chains partitioning) by using ccp.c:partition_1d()
*/
#pragma omp for schedule(dynamic, 8) nowait
for(idx_t i=0; i < scoo->dims[m]; ++i) {
struct timeval start_t, stop_t;
gettimeofday(&start_t, NULL);
if(m == 0){
if(i == imp_a[counter])
p_update_slice(scoo, m, i, ws->regularization[m], model, ws, tid, lev_score, alpha, beta, act, frac, same, &solving_time, &sampling_time, &mttkrp_time);
else if(i > imp_a[counter]){
for(idx_t xx = counter; xx < mode_a_size; xx++){
if(imp_a[xx] >= i){
counter = xx;
break;
}
}
if(i == imp_a[counter])
p_update_slice(scoo, m, i, ws->regularization[m], model, ws, tid, lev_score, alpha, beta, act, frac, same, &solving_time, &sampling_time, &mttkrp_time);
}
}
else
p_update_slice(scoo, m, i, ws->regularization[m], model, ws, tid, lev_score, alpha, beta, act, frac, same, &solving_time, &sampling_time, &mttkrp_time);
gettimeofday(&stop_t, NULL);
time_slice[m][i] = (stop_t.tv_sec + stop_t.tv_usec/1000000.0) - (start_t.tv_sec + start_t.tv_usec/1000000.0);
}
}
#pragma omp barrier
#ifdef SPLATT_USE_MPI
p_update_factor_all2all(model, ws, m);
#endif
#pragma omp barrier
#pragma omp master
{
timer_stop(&mode_timer);
if(rank == 0) {
long long int tot_act = 0;
long long int tot_frac = 0;
double tot_time = 0.0;
// long long int tot_same = 0;
for(int i=0; i<scoo->dims[m]; i++){
tot_act += act[m][i];
tot_frac += frac[m][i];
tot_time += time_slice[m][i];
// tot_same += same[m][i];
fprintf(f_frac, "%d,", frac[m][i]);
fprintf(f_act, "%d,", act[m][i]);
fprintf(f_time, "%lf,", time_slice[m][i]);
fprintf(f_lev, "%lf,", lev_score[m][i]);
// fprintf(f_same, "%d\n", same[m][i]);
}
fprintf(f_frac, "\n");
fprintf(f_act, "\n");
fprintf(f_time, "\n");
fprintf(f_lev, "\n");
// fprintf(f_same, "\n");
// printf(" Sampled:%lld Same sampled: %lld percent:%0.3f\n", tot_frac, tot_same, ((float)tot_same)/tot_frac);
avg_tot_time[m] += (double)mode_timer.seconds;
avg_sampling_time[m] += sampling_time;
avg_mttkrp_time[m] += (mttkrp_time - sampling_time);
avg_solving_time[m] += solving_time;
// printf(" mode: %"SPLATT_PF_IDX" act: %lld sampled: %lld percent: %0.3f\n", m+1, tot_act, tot_frac, ((float)tot_frac)/tot_act);
// printf(" time: %lf\n", tot_time);
// printf(" mode: %"SPLATT_PF_IDX" time: %0.3fs\n", m+1,
// mode_timer.seconds);
}
}
#pragma omp barrier
} /* foreach mode */
} /* end omp parallel */
/* compute new obj value, print stats, and exit if converged */
val_t loss = tc_loss_sq(train, model, ws);
val_t frobsq = tc_frob_sq(model, ws);
if(tc_converge(train, validate, model, loss, frobsq, e, ws)) {
break;
}
} /* foreach iteration */
printf("\n");
for(int i=0; i<nmodes; i++){
printf("MODE: %d\n-----------\n", i);
printf(" Total Time: %lf\n", (avg_tot_time[i]/count));
printf(" Sampling Time: %lf\n", (avg_sampling_time[i]/count));
printf(" MTTKRP Time: %lf\n", (avg_mttkrp_time[i]/count));
printf(" Solving Time: %lf\n",(avg_solving_time[i]/count));
printf("\n");
}
printf("GRAM Timer : %lf\n", (avg_gram_time/count));
#pragma omp parallel
{
int const tid = splatt_omp_get_thread_num();
splatt_free(perm_i_global[tid]);
}
splatt_free(sample_seeds);
#ifdef SPLATT_USE_MPI
/* UNDO TERRIBLE HACK */
tt_free(train);
train = train_back;
#endif
scoo_free(scoo);
/* cleanup */
/* XXX disabled dense temporarily */
if(false && ws->maxdense_dim > 0) {
thd_free(thd_densefactors, ws->nthreads);
}
}
|
GB_unaryop__abs_int64_uint64.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http://suitesparse.com See GraphBLAS/Doc/License.txt for license.
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_iterator.h"
#include "GB_unaryop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB_unop__abs_int64_uint64
// op(A') function: GB_tran__abs_int64_uint64
// C type: int64_t
// A type: uint64_t
// cast: int64_t cij = (int64_t) aij
// unaryop: cij = GB_IABS (aij)
#define GB_ATYPE \
uint64_t
#define GB_CTYPE \
int64_t
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
uint64_t aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = GB_IABS (x) ;
// casting
#define GB_CASTING(z, x) \
int64_t z = (int64_t) x ;
// cij = op (cast (aij))
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
GB_GETA (aij, Ax, pA) ; \
/* Cx [pC] = op (cast (aij)) */ \
GB_CASTING (x, aij) ; \
GB_OP (GB_CX (pC), x) ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_ABS || GxB_NO_INT64 || GxB_NO_UINT64)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_unop__abs_int64_uint64
(
int64_t *restrict Cx,
const uint64_t *restrict Ax,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (int64_t p = 0 ; p < anz ; p++)
{
GB_CAST_OP (p, p) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_tran__abs_int64_uint64
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *restrict *Rowcounts,
GBI_single_iterator Iter,
const int64_t *restrict A_slice,
int naslice
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#define GB_PHASE_2_OF_2
#include "GB_unaryop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
reduction-2.c | #include <omp.h>
#include <stdlib.h>
int
main (void)
{
int i = 0, j = 0, k = ~0, l;
double d = 1.0;
#pragma omp parallel num_threads(4)
{
#pragma omp single
{
i = 16;
k ^= (1 << 16);
d += 32.0;
}
#pragma omp for reduction(+:i) reduction(*:d) reduction(&:k)
for (l = 0; l < 4; l++)
{
if (omp_get_num_threads () == 4 && (i != 0 || d != 1.0 || k != ~0))
#pragma omp atomic
j |= 1;
if (l == omp_get_thread_num ())
{
i = omp_get_thread_num ();
d = i + 1;
k = ~(1 << (2 * i));
}
}
if (omp_get_num_threads () == 4)
{
if (i != (16 + 0 + 1 + 2 + 3))
#pragma omp atomic
j |= 2;
if (d != (33.0 * 1.0 * 2.0 * 3.0 * 4.0))
#pragma omp atomic
j |= 4;
if (k != (~0 ^ 0x55 ^ (1 << 16)))
#pragma omp atomic
j |= 8;
}
}
if (j)
abort ();
return 0;
}
|
ch_common.c |
#define MAIN
#include "ch_common.h"
#include "cholesky.h"
#include "../timing.h"
#if (defined(DEBUG) || defined(USE_TIMING))
_Atomic int cnt_pdotrf = 0;
_Atomic int cnt_trsm = 0;
_Atomic int cnt_gemm = 0;
_Atomic int cnt_syrk = 0;
#endif
#if defined(USE_TIMING)
void helper_start_timing(int tt) {
if (tt == TIME_POTRF) {
cnt_pdotrf++;
} else if (tt == TIME_TRSM) {
cnt_trsm++;
} else if (tt == TIME_GEMM) {
cnt_gemm++;
} else if (tt == TIME_SYRK) {
cnt_syrk++;
}
}
void helper_end_timing(int tt, double elapsed) {
__timing[THREAD_NUM].ts[tt] += elapsed;
}
#endif
static void get_block_rank(int *block_rank, int nt);
#ifdef CHAMELEON_TARGET
#pragma omp declare target
#endif
void omp_potrf(double * SPEC_RESTRICT const A, int ts, int ld)
{
#ifdef TRACE
static int event_potrf = -1;
if(event_potrf == -1) {
char* event_name = "potrf";
int ierr;
ierr = VT_funcdef(event_name, VT_NOCLASS, &event_potrf);
}
VT_begin(event_potrf);
#endif
#if (defined(DEBUG) || defined(USE_TIMING))
START_TIMING(TIME_POTRF);
#endif
static int INFO;
static const char L = 'L';
dpotrf_(&L, &ts, A, &ld, &INFO);
#if (defined(DEBUG) || defined(USE_TIMING))
END_TIMING(TIME_POTRF);
#endif
#ifdef TRACE
VT_end(event_potrf);
#endif
}
#ifdef CHAMELEON_TARGET
#pragma omp end declare target
#pragma omp declare target
#endif
void omp_trsm(double * SPEC_RESTRICT A, double * SPEC_RESTRICT B, int ts, int ld)
{
#ifdef TRACE
static int event_trsm = -1;
if(event_trsm == -1) {
char* event_name = "trsm";
int ierr;
ierr = VT_funcdef(event_name, VT_NOCLASS, &event_trsm);
}
VT_begin(event_trsm);
#endif
#if (defined(DEBUG) || defined(USE_TIMING))
START_TIMING(TIME_TRSM);
#endif
static char LO = 'L', TR = 'T', NU = 'N', RI = 'R';
static double DONE = 1.0;
dtrsm_(&RI, &LO, &TR, &NU, &ts, &ts, &DONE, A, &ld, B, &ld );
#if (defined(DEBUG) || defined(USE_TIMING))
END_TIMING(TIME_TRSM);
#endif
#ifdef TRACE
VT_end(event_trsm);
#endif
}
#ifdef CHAMELEON_TARGET
#pragma omp end declare target
#pragma omp declare target
#endif
void omp_gemm(double * SPEC_RESTRICT A, double * SPEC_RESTRICT B, double * SPEC_RESTRICT C, int ts, int ld)
{
#ifdef TRACE
static int event_gemm = -1;
if(event_gemm == -1) {
char* event_name = "gemm";
int ierr;
ierr = VT_funcdef(event_name, VT_NOCLASS, &event_gemm);
}
VT_begin(event_gemm);
#endif
#if (defined(DEBUG) || defined(USE_TIMING))
START_TIMING(TIME_GEMM);
#endif
static const char TR = 'T', NT = 'N';
static double DONE = 1.0, DMONE = -1.0;
dgemm_(&NT, &TR, &ts, &ts, &ts, &DMONE, A, &ld, B, &ld, &DONE, C, &ld);
#if (defined(DEBUG) || defined(USE_TIMING))
END_TIMING(TIME_GEMM);
#endif
#ifdef TRACE
VT_end(event_gemm);
#endif
}
#ifdef CHAMELEON_TARGET
#pragma omp end declare target
#pragma omp declare target
#endif
void omp_syrk(double * SPEC_RESTRICT A, double * SPEC_RESTRICT B, int ts, int ld)
{
#ifdef TRACE
static int event_syrk = -1;
if(event_syrk == -1) {
char* event_name = "syrk";
int ierr;
ierr = VT_funcdef(event_name, VT_NOCLASS, &event_syrk);
}
VT_begin(event_syrk);
#endif
#if (defined(DEBUG) || defined(USE_TIMING))
START_TIMING(TIME_SYRK);
#endif
static char LO = 'L', NT = 'N';
static double DONE = 1.0, DMONE = -1.0;
dsyrk_(&LO, &NT, &ts, &ts, &DMONE, A, &ld, &DONE, B, &ld );
#if (defined(DEBUG) || defined(USE_TIMING))
END_TIMING(TIME_SYRK);
#endif
#ifdef TRACE
VT_end(event_syrk);
#endif
}
#ifdef CHAMELEON_TARGET
#pragma omp end declare target
#endif
void cholesky_single(const int ts, const int nt, double* A[nt][nt])
{
// speed up "serial" verification with only a single rank
#if !defined(OMPSS_VER)
#pragma omp parallel
{
#pragma omp single
{
#endif
for (int k = 0; k < nt; k++) {
#pragma omp task depend(out: A[k][k])
{
omp_potrf(A[k][k], ts, ts);
#ifdef DEBUG
if (mype == 0) printf("potrf:out:A[%d][%d]\n", k, k);
#endif
}
for (int i = k + 1; i < nt; i++) {
#pragma omp task depend(in: A[k][k]) depend(out: A[k][i])
{
omp_trsm(A[k][k], A[k][i], ts, ts);
#ifdef DEBUG
if (mype == 0) printf("trsm :in:A[%d][%d]:out:A[%d][%d]\n", k, k, k, i);
#endif
}
}
for (int i = k + 1; i < nt; i++) {
for (int j = k + 1; j < i; j++) {
#pragma omp task depend(in: A[k][i], A[k][j]) depend(out: A[j][i])
{
omp_gemm(A[k][i], A[k][j], A[j][i], ts, ts);
#ifdef DEBUG
if (mype == 0) printf("gemm :in:A[%d][%d]:A[%d][%d]:out:A[%d][%d]\n", k, i, k, j, j, i);
#endif
}
}
#pragma omp task depend(in: A[k][i]) depend(out: A[i][i])
{
omp_syrk(A[k][i], A[i][i], ts, ts);
#ifdef DEBUG
if (mype == 0) printf("syrk :in:A[%d][%d]:out:A[%d][%d]\n", k, i, i, i);
#endif
}
}
}
#pragma omp taskwait
#if !defined(OMPSS_VER)
}
}
#endif
}
inline void wait(MPI_Request *comm_req)
{
#ifdef TRACE
static int event_wait = -1;
if(event_wait == -1) {
char* event_name = "wait";
int ierr;
ierr = VT_funcdef(event_name, VT_NOCLASS, &event_wait);
}
VT_begin(event_wait);
#endif
int comm_comp = 0;
#ifdef DISABLE_TASKYIELD
MPI_Wait(comm_req, MPI_STATUS_IGNORE);
#else
MPI_Test(comm_req, &comm_comp, MPI_STATUS_IGNORE);
while (!comm_comp) {
#if defined(CHAMELEON) || defined(CHAMELEON_TARGET)
chameleon_taskyield();
#else
#pragma omp taskyield
#endif
MPI_Test(comm_req, &comm_comp, MPI_STATUS_IGNORE);
}
#endif
#ifdef TRACE
VT_end(event_wait);
#endif
}
inline void reset_send_flags(char *send_flags)
{
for (int i = 0; i < np; i++) send_flags[i] = 0;
}
inline int get_send_flags(char *send_flags, int *block_rank, int itr1_str, int itr1_end, int itr2_str, int itr2_end, int n)
{
int send_cnt = 0;
for (int i = itr1_str; i <= itr1_end; i++) {
for (int j = itr2_str; j <= itr2_end; j++) {
if (!send_flags[block_rank[i*n+j]]) {
send_flags[block_rank[i*n+j]] = 1;
send_cnt++;
}
}
}
return send_cnt;
}
inline void get_recv_flag(char *recv_flag, int *block_rank, int itr1_str, int itr1_end, int itr2_str, int itr2_end, int n)
{
if (*recv_flag == 1) return;
for (int i = itr1_str; i <= itr1_end; i++) {
for (int j = itr2_str; j <= itr2_end; j++) {
if (block_rank[i*n+j] == mype) {
*recv_flag = 1;
return;
}
}
}
}
int main(int argc, char *argv[])
{
/* MPI Initialize */
int provided;
MPI_Init_thread(&argc, &argv, MPI_THREAD_MULTIPLE, &provided);
if (provided != MPI_THREAD_MULTIPLE) {
fprintf(stderr, "This Compiler does not support MPI_THREAD_MULTIPLE\n");
exit(0);
}
MPI_Comm_rank(MPI_COMM_WORLD, &mype);
MPI_Comm_size(MPI_COMM_WORLD, &np);
/* cholesky init */
const char *result[3] = {"n/a","successful","UNSUCCESSFUL"};
const double eps = BLAS_dfpinfo(blas_eps);
if (argc < 4) {
printf("cholesky matrix_size block_size check\n");
exit(-1);
}
const int n = atoi(argv[1]); // matrix size
const int ts = atoi(argv[2]); // tile size
int check = atoi(argv[3]); // check result?
const int nt = n / ts;
if (mype == 0) printf("R#%d, n = %d, nt = %d, ts = %d\n", mype, n, nt, ts);
/* Set block rank */
int *block_rank = malloc(nt * nt * sizeof(int));
get_block_rank(block_rank, nt);
#if (defined(DEBUG) || defined(USE_TIMING))
if (mype == 0) {
for (int i = 0; i < nt; i++) {
for (int j = 0; j < nt; j++) {
printf("%d ", block_rank[i * nt + j]);
}
printf("\n");
}
}
MPI_Barrier(MPI_COMM_WORLD);
// calculate how many tiles are assigned to the speicifc ranks and how many diagonals
int nr_tiles = 0;
int nr_tiles_diag = 0;
for (int i = 0; i < nt; i++) {
for (int j = i; j < nt; j++) {
if(block_rank[i * nt + j] == mype)
{
nr_tiles++;
if(i == j)
nr_tiles_diag++;
}
}
}
printf("[%d] has %d tiles in total and %d tiles on the diagonal\n", mype, nr_tiles, nr_tiles_diag);
#endif
double * SPEC_RESTRICT A[nt][nt], * SPEC_RESTRICT B, * SPEC_RESTRICT C[nt], * SPEC_RESTRICT Ans[nt][nt];
#if !defined(OMPSS_VER)
#pragma omp parallel
{
#pragma omp single
#endif
{
for (int i = 0; i < nt; i++) {
for (int j = 0; j < nt; j++) {
#pragma omp task depend(out: A[i][j]) shared(Ans, A)
{
if (check) {
MPI_Alloc_mem(ts * ts * sizeof(double), MPI_INFO_NULL, &Ans[i][j]);
initialize_tile(ts, Ans[i][j]);
}
if (block_rank[i*nt+j] == mype) {
MPI_Alloc_mem(ts * ts * sizeof(double), MPI_INFO_NULL, &A[i][j]);
if (!check) {
initialize_tile(ts, A[i][j]);
} else {
for (int k = 0; k < ts * ts; k++) {
A[i][j][k] = Ans[i][j][k];
}
}
}
}
}
#pragma omp task depend(inout: A[i][i]) shared(Ans, A)
{
// add to diagonal
if (check) {
Ans[i][i][ts/2*ts+ts/2] = (double)nt;
}
if (block_rank[i*nt+i] == mype) {
A[i][i][ts/2*ts+ts/2] = (double)nt;
}
}
}
} // omp single
#if !defined(OMPSS_VER)
} // omp parallel
#endif
B = (double*) malloc(ts * ts * sizeof(double));
for (int i = 0; i < nt; i++) {
C[i] = (double*) malloc(ts * ts * sizeof(double));
}
#if !defined(OMPSS_VER)
#pragma omp parallel
#pragma omp single
#endif
num_threads = omp_get_num_threads();
INIT_TIMING(num_threads);
RESET_TIMINGS(num_threads);
const float t3 = get_time();
if (check) cholesky_single(ts, nt, (double* (*)[nt]) Ans);
const float t4 = get_time() - t3;
MPI_Barrier(MPI_COMM_WORLD);
RESET_TIMINGS(num_threads);
if (mype == 0) printf("Starting parallel computation\n");
const float t1 = get_time();
cholesky_mpi(ts, nt, (double* SPEC_RESTRICT (*)[nt])A, B, C, block_rank);
const float t2 = get_time() - t1;
if (mype == 0) printf("Finished parallel computation\n");
MPI_Barrier(MPI_COMM_WORLD);
/* Verification */
if (check) {
for (int i = 0; i < nt; i++) {
for (int j = 0; j < nt; j++) {
if (block_rank[i * nt + j] == mype) {
for (int k = 0; k < ts*ts; k++) {
// if (Ans[i][j][k] != A[i][j][k]) check = 2;
if (Ans[i][j][k] != A[i][j][k]) {
check = 2;
printf("Rank R#%2d: A[%4d][%4d][%4d] --> Expected: %11.5f Value: %11.5f Diff: %11.5f\n", mype, i,j,k, Ans[i][j][k], A[i][j][k], abs(Ans[i][j][k]-A[i][j][k]));
break;
}
}
}
if(check == 2) break;
}
if(check == 2) break;
}
}
float time_mpi = t2;
float gflops_mpi = (((1.0 / 3.0) * n * n * n) / ((time_mpi) * 1.0e+9));
float time_ser = t4;
float gflops_ser = (((1.0 / 3.0) * n * n * n) / ((time_ser) * 1.0e+9));
if(mype == 0 || check == 2)
printf("test:%s-%d-%d-%d:mype:%2d:np:%2d:threads:%2d:result:%s:gflops:%f:time:%f:gflops_ser:%f:time_ser:%f\n", argv[0], n, ts, num_threads, mype, np, num_threads, result[check], gflops_mpi, t2, gflops_ser, t4);
#if (defined(DEBUG) || defined(USE_TIMING))
printf("[%d] count#pdotrf:%d:count#trsm:%d:count#gemm:%d:count#syrk:%d\n", mype, cnt_pdotrf, cnt_trsm, cnt_gemm, cnt_syrk);
#endif
for (int i = 0; i < nt; i++) {
for (int j = 0; j < nt; j++) {
if (block_rank[i*nt+j] == mype) {
free(A[i][j]);
}
if (check)
free(Ans[i][j]);
}
free(C[i]);
}
free(B);
free(block_rank);
MPI_Finalize();
return 0;
}
static void get_block_rank(int *block_rank, int nt)
{
int row, col;
row = col = np;
if (np != 1) {
while (1) {
row = row / 2;
if (row * col == np) break;
col = col / 2;
if (row * col == np) break;
}
}
if (mype == 0) printf("row = %d, col = %d\n", row, col);
int i, j, tmp_rank = 0, offset = 0;
for (i = 0; i < nt; i++) {
for (j = 0; j < nt; j++) {
block_rank[i*nt + j] = tmp_rank + offset;
tmp_rank++;
if (tmp_rank >= col) tmp_rank = 0;
}
tmp_rank = 0;
offset = (offset + col >= np) ? 0 : offset + col;
}
}
|
Fig_6.8_mandelbrotWrongPart1.c | // combine Fig_6.8_mandelbrotWrongPart1.c and Fig_6.9_mandelbrotWrongPart2.c into one file, and name it as mandel_wrong.c
// sample compile command: gcc -fopenmp -o mandel_wrong mandel_wrong.c
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <omp.h>
# define NPOINTS 1000
# define MAXITER 1000
void testpoint(void);
struct d_complex {
double r;
double i;
};
struct d_complex c;
int numoutside = 0;
int main() {
int i, j;
double area, error, eps = 1.0e-5;
// Loop over grid of points in the complex plane which contains
// the Mandelbrot set, test each point to see whether it is
// inside or outside the set
#pragma omp parallel for private(c,eps)
for (i = 0; i < NPOINTS; i++) {
for (j = 0; j < NPOINTS; j++) {
c.r = -2.0 + 2.5 * (double)(i) / (double)(NPOINTS) + eps;
c.i = 1.125 * (double)(j) / (double)(NPOINTS) + eps;
testpoint();
}
}
// Calculate area of set and error estimate and output the results
area = 2.0 * 2.5 * 1.125 * (double)(NPOINTS * NPOINTS - numoutside)
/ (double)(NPOINTS * NPOINTS);
error = area / (double)NPOINTS;
printf("Area of Mandlebrot set = %12.8f +/- %12.8f\n",area,error);
printf("Correct answer should be around 1.506\n");
}
|
GB_unaryop__abs_uint16_int32.c | //------------------------------------------------------------------------------
// GB_unaryop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2019, All Rights Reserved.
// http://suitesparse.com See GraphBLAS/Doc/License.txt for license.
//------------------------------------------------------------------------------
// If this file is in the Generated/ folder, do not edit it (auto-generated).
#include "GB.h"
#ifndef GBCOMPACT
#include "GB_control.h"
#include "GB_iterator.h"
#include "GB_unaryop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB_unop__abs_uint16_int32
// op(A') function: GB_tran__abs_uint16_int32
// C type: uint16_t
// A type: int32_t
// cast: uint16_t cij = (uint16_t) aij
// unaryop: cij = aij
#define GB_ATYPE \
int32_t
#define GB_CTYPE \
uint16_t
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
int32_t aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = x ;
// casting
#define GB_CASTING(z, x) \
uint16_t z = (uint16_t) x ;
// cij = op (cast (aij))
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
GB_GETA (aij, Ax, pA) ; \
/* Cx [pC] = op (cast (aij)) */ \
GB_CASTING (x, aij) ; \
GB_OP (GB_CX (pC), x) ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_ABS || GxB_NO_UINT16 || GxB_NO_INT32)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_unop__abs_uint16_int32
(
uint16_t *restrict Cx,
const int32_t *restrict Ax,
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (int64_t p = 0 ; p < anz ; p++)
{
GB_CAST_OP (p, p) ;
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB_tran__abs_uint16_int32
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t **Rowcounts,
GBI_single_iterator Iter,
const int64_t *restrict A_slice,
int naslice
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#define GB_PHASE_2_OF_2
#include "GB_unaryop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
chunk_reduction.h | /* Copyright 2013 IST Austria
Contributed by: Ulrich Bauer, Michael Kerber, Jan Reininghaus
This file is part of PHAT.
PHAT is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
PHAT is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with PHAT. If not, see <http://www.gnu.org/licenses/>. */
#pragma once
#include <phat/helpers/misc.h>
#include <phat/boundary_matrix.h>
namespace phat {
template <bool use_sqrt = false> class chunk_reduction_impl {
public:
enum column_type { GLOBAL
, LOCAL_POSITIVE
, LOCAL_NEGATIVE };
public:
template< typename Representation >
void operator() ( boundary_matrix< Representation >& boundary_matrix ) {
const index nr_columns = boundary_matrix.get_num_cols();
if( omp_get_max_threads( ) > nr_columns )
omp_set_num_threads( 1 );
const dimension max_dim = boundary_matrix.get_max_dim();
std::vector< index > lowest_one_lookup( nr_columns, -1 );
std::vector < column_type > column_type( nr_columns, GLOBAL );
std::vector< char > is_active( nr_columns, false );
const index chunk_size = use_sqrt ? (index)sqrt( (double)nr_columns ) : nr_columns / omp_get_max_threads();
std::vector< index > chunk_boundaries;
for( index cur_boundary = 0; cur_boundary < nr_columns; cur_boundary += chunk_size )
chunk_boundaries.push_back( cur_boundary );
chunk_boundaries.push_back( nr_columns );
for( dimension cur_dim = max_dim; cur_dim >= 1; cur_dim-- ) {
// Phase 1: Reduce chunks locally -- 1st pass
#pragma omp parallel for schedule( guided, 1 )
for( index chunk_id = 0; chunk_id < (index)chunk_boundaries.size() - 1; chunk_id++ )
_local_chunk_reduction( boundary_matrix, lowest_one_lookup, column_type, cur_dim,
chunk_boundaries[ chunk_id ], chunk_boundaries[ chunk_id + 1 ], chunk_boundaries[ chunk_id ] );
boundary_matrix.sync();
// Phase 1: Reduce chunks locally -- 2nd pass
#pragma omp parallel for schedule( guided, 1 )
for( index chunk_id = 1; chunk_id < (index)chunk_boundaries.size( ) - 1; chunk_id++ )
_local_chunk_reduction( boundary_matrix, lowest_one_lookup, column_type, cur_dim,
chunk_boundaries[ chunk_id ], chunk_boundaries[ chunk_id + 1 ], chunk_boundaries[ chunk_id - 1 ] );
boundary_matrix.sync( );
}
// get global columns
std::vector< index > global_columns;
for( index cur_col_idx = 0; cur_col_idx < nr_columns; cur_col_idx++ )
if( column_type[ cur_col_idx ] == GLOBAL )
global_columns.push_back( cur_col_idx );
// get active columns
#pragma omp parallel for
for( index idx = 0; idx < (index)global_columns.size(); idx++ )
is_active[ global_columns[ idx ] ] = true;
_get_active_columns( boundary_matrix, lowest_one_lookup, column_type, global_columns, is_active );
// Phase 2+3: Simplify columns and reduce them
for( dimension cur_dim = max_dim; cur_dim >= 1; cur_dim-- ) {
// Phase 2: Simplify columns
std::vector< index > temp_col;
#pragma omp parallel for schedule( guided, 1 ), private( temp_col )
for( index idx = 0; idx < (index)global_columns.size(); idx++ )
if( boundary_matrix.get_dim( global_columns[ idx ] ) == cur_dim )
_global_column_simplification( global_columns[ idx ], boundary_matrix, lowest_one_lookup, column_type, is_active, temp_col );
boundary_matrix.sync();
// Phase 3: Reduce columns
for( index idx = 0; idx < (index)global_columns.size(); idx++ ) {
index cur_col = global_columns[ idx ];
if( boundary_matrix.get_dim( cur_col ) == cur_dim && column_type[ cur_col ] == GLOBAL ) {
index lowest_one = boundary_matrix.get_max_index( cur_col );
while( lowest_one != -1 && lowest_one_lookup[ lowest_one ] != -1 ) {
boundary_matrix.add_to( lowest_one_lookup[ lowest_one ], cur_col );
lowest_one = boundary_matrix.get_max_index( cur_col );
}
if( lowest_one != -1 ) {
lowest_one_lookup[ lowest_one ] = cur_col;
boundary_matrix.clear( lowest_one );
}
boundary_matrix.finalize( cur_col );
}
}
}
boundary_matrix.sync();
}
protected:
template< typename Representation >
void _local_chunk_reduction( boundary_matrix< Representation >& boundary_matrix
, std::vector<index>& lowest_one_lookup
, std::vector< column_type >& column_type
, const dimension cur_dim
, const index chunk_begin
, const index chunk_end
, const index row_begin ) {
for( index cur_col = chunk_begin; cur_col < chunk_end; cur_col++ ) {
if( column_type[ cur_col ] == GLOBAL && boundary_matrix.get_dim( cur_col ) == cur_dim ) {
index lowest_one = boundary_matrix.get_max_index( cur_col );
while( lowest_one != -1 && lowest_one >= row_begin && lowest_one_lookup[ lowest_one ] != -1 ) {
boundary_matrix.add_to( lowest_one_lookup[ lowest_one ], cur_col );
lowest_one = boundary_matrix.get_max_index( cur_col );
}
if( lowest_one >= row_begin ) {
lowest_one_lookup[ lowest_one ] = cur_col;
column_type[ cur_col ] = LOCAL_NEGATIVE;
column_type[ lowest_one ] = LOCAL_POSITIVE;
boundary_matrix.clear( lowest_one );
boundary_matrix.finalize( cur_col );
}
}
}
}
template< typename Representation >
void _get_active_columns( const boundary_matrix< Representation >& boundary_matrix
, const std::vector< index >& lowest_one_lookup
, const std::vector< column_type >& column_type
, const std::vector< index >& global_columns
, std::vector< char >& is_active ) {
const index nr_columns = boundary_matrix.get_num_cols();
std::vector< char > finished( nr_columns, false );
std::vector< std::pair < index, index > > stack;
std::vector< index > cur_col_values;
#pragma omp parallel for schedule( guided, 1 ), private( stack, cur_col_values )
for( index idx = 0; idx < (index)global_columns.size(); idx++ ) {
bool pop_next = false;
index start_col = global_columns[ idx ];
stack.push_back( std::pair< index, index >( start_col, -1 ) );
while( !stack.empty() ) {
index cur_col = stack.back().first;
index prev_col = stack.back().second;
if( pop_next ) {
stack.pop_back();
pop_next = false;
if( prev_col != -1 ) {
if( is_active[ cur_col ] ) {
is_active[ prev_col ] = true;
}
if( prev_col == stack.back().first ) {
finished[ prev_col ] = true;
pop_next = true;
}
}
} else {
pop_next = true;
boundary_matrix.get_col( cur_col, cur_col_values );
for( index idx = 0; idx < (index) cur_col_values.size(); idx++ ) {
index cur_row = cur_col_values[ idx ];
if( ( column_type[ cur_row ] == GLOBAL ) ) {
is_active[ cur_col ] = true;
} else if( column_type[ cur_row ] == LOCAL_POSITIVE ) {
index next_col = lowest_one_lookup[ cur_row ];
if( next_col != cur_col && !finished[ cur_col ] ) {
stack.push_back( std::make_pair( next_col, cur_col ) );
pop_next = false;
}
}
}
}
}
}
}
template< typename Representation >
void _global_column_simplification( const index col_idx
, boundary_matrix< Representation >& boundary_matrix
, const std::vector< index >& lowest_one_lookup
, const std::vector< column_type >& column_type
, const std::vector< char >& is_active
, std::vector< index >& temp_col )
{
temp_col.clear();
while( !boundary_matrix.is_empty( col_idx ) ) {
index cur_row = boundary_matrix.get_max_index( col_idx );
switch( column_type[ cur_row ] ) {
case GLOBAL:
temp_col.push_back( cur_row );
boundary_matrix.remove_max( col_idx );
break;
case LOCAL_NEGATIVE:
boundary_matrix.remove_max( col_idx );
break;
case LOCAL_POSITIVE:
if( is_active[ lowest_one_lookup[ cur_row ] ] )
boundary_matrix.add_to( lowest_one_lookup[ cur_row ], col_idx );
else
boundary_matrix.remove_max( col_idx );
break;
}
}
std::reverse( temp_col.begin(), temp_col.end() );
boundary_matrix.set_col( col_idx, temp_col );
}
};
class chunk_reduction : public chunk_reduction_impl<false> {};
class chunk_reduction_sqrt : public chunk_reduction_impl<true> {};
}
|
veccopy-ompt-target.c | #include <stdio.h>
#include <omp.h>
#include "callbacks.h"
int main()
{
int N = 100000;
int a[N];
int b[N];
int i;
for (i=0; i<N; i++)
a[i]=0;
for (i=0; i<N; i++)
b[i]=i;
#pragma omp target parallel for
{
for (int j = 0; j< N; j++)
a[j]=b[j];
}
#pragma omp target teams distribute parallel for
{
for (int j = 0; j< N; j++)
a[j]=b[j];
}
int rc = 0;
for (i=0; i<N; i++)
if (a[i] != b[i] ) {
rc++;
printf ("Wrong value: a[%d]=%d\n", i, a[i]);
}
if (!rc)
printf("Success\n");
return rc;
}
/// CHECK: Callback Init:
/// CHECK: Callback Load:
/// CHECK: Callback Target: target_id=[[TARGET_ID:[0-9]+]] kind=1 endpoint=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=2
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=2
/// CHECK: Callback Submit: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] req_num_teams=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=3
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=3
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=4
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=4
/// CHECK: Callback Target: target_id=[[TARGET_ID:[0-9]+]] kind=1 endpoint=2
/// CHECK: Callback Target: target_id=[[TARGET_ID:[0-9]+]] kind=1 endpoint=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=2
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=1
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=2
/// CHECK: Callback Submit: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] req_num_teams=0
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=3
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=3
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=4
/// CHECK: Callback DataOp: target_id=[[TARGET_ID:[0-9]+]] host_op_id=[[HOST_OP_ID:[0-9]+]] optype=4
/// CHECK: Callback Target: target_id=[[TARGET_ID:[0-9]+]] kind=1 endpoint=2
/// CHECK: Callback Fini:
|
representative_list_omp.h | #include "representative_list.h"
#include <hydra/combinatorics/combinations.h>
#include <hydra/combinatorics/combinations_index.h>
#include <hydra/indexing/lintable.h>
#include <hydra/symmetries/permutation_group_action.h>
#include <hydra/symmetries/permutation_group_lookup.h>
#include <hydra/symmetries/symmetry_operations.h>
#include <omp.h>
namespace hydra::symmetries {
template <typename bit_t, class GroupAction, class LinTable>
std::tuple<std::vector<bit_t>, std::vector<idx_t>, std::vector<int>,
std::vector<std::pair<span_size_t, span_size_t>>>
representatives_indices_symmetries_limits(int n_par,
GroupAction const &group_action,
LinTable const &lintable) {
using combinatorics::binomial;
using combinatorics::CombinationsIndexThread;
// Compute all representatives
std::vector<std::vector<bit_t>> reps_thread;
std::vector<std::vector<int>> syms_thread;
#pragma omp parallel
{
int myid = omp_get_thread_num();
int rank = omp_get_num_threads();
#pragma omp single
{ reps_thread.resize(rank); }
for (auto [state, idx] : CombinationsIndexThread<bit_t>(n_sites, n_par)) {
bit_t rep = representative(state, group_action);
if (rep == state) {
idces[idx] = reps_thread[myid].size(); // just local index
reps_thread[myid].push_back(rep);
}
}
#pragma omp barrier
idx_t offset = 0;
for (int id = 0; id < myid; ++id) {
offset += reps_thread[id].size();
}
for (auto [state, idx] : CombinationsIndexThread<bit_t>(n_sites, n_par)) {
if (idces[idx] != invalid_index) {
idces[idx] += offset;
}
}
} // pragma omp parallel
std::vector<bit_t> reps = utils::combine_vectors(reps_thread);
// Compute indices of up-representatives and stabilizer symmetries
#pragma omp parallel
{
int myid = omp_get_thread_num();
int rank = omp_get_num_threads();
#pragma omp single
{ syms_thread.resize(rank); }
for (auto [state, idx] : CombinationsIndexThread<bit_t>(n_sites, n_par)) {
bit_t rep = representative(state, group_action);
assert(bitops::popcnt(rep) == n_par);
assert(rep < (bit_t)1 << n_sites);
assert(rep <= state);
idces[idx] = idces[lintable.index(rep)];
assert(idces[idx] != invalid_index);
// Determine the symmetries that yield the up-representative
span_size_t begin = syms_thread[myid].size();
for (int sym = 0; sym < group_action.n_symmetries(); ++sym) {
if (group_action.apply(sym, state) == rep)
syms_thread[myid].push_back(sym);
}
span_size_t end = syms_thread[myid].size();
sym_limits[idx] = {begin, end - begin};
}
#pragma omp barrier
span_size_t offset = 0;
for (int id = 0; id < myid; ++id) {
offset += syms_thread[id].size();
}
for (auto [state, idx] : CombinationsIndexThread<bit_t>(n_sites, n_par)) {
auto [begin, length] = sym_limits[idx];
sym_limits[idx] = {begin + offset, length};
}
} // pragma omp parallel
// Combine syms
std::vector<int> syms = utils::combine_vectors(syms_thread);
return {reps, idces, syms, sym_limits};
}
} // namespace hydra::symmetries
|
matrix_csr.h | #ifndef XGBOOST_UTILS_MATRIX_CSR_H_
#define XGBOOST_UTILS_MATRIX_CSR_H_
/*!
* \file matrix_csr.h
* \brief this file defines some easy to use STL based class for in memory sparse CSR matrix
* \author Tianqi Chen
*/
#include <vector>
#include <utility>
#include <algorithm>
#include "./io.h"
#include "./utils.h"
#include "./omp.h"
namespace xgboost {
namespace utils {
/*!
* \brief a class used to help construct CSR format matrix,
* can be used to convert row major CSR to column major CSR
* \tparam IndexType type of index used to store the index position, usually unsigned or size_t
* \tparam whether enabling the usage of aclist, this option must be enabled manually
*/
template<typename IndexType, bool UseAcList = false, typename SizeType = size_t>
struct SparseCSRMBuilder {
private:
/*! \brief dummy variable used in the indicator matrix construction */
std::vector<size_t> dummy_aclist;
/*! \brief pointer to each of the row */
std::vector<SizeType> &rptr;
/*! \brief index of nonzero entries in each row */
std::vector<IndexType> &findex;
/*! \brief a list of active rows, used when many rows are empty */
std::vector<size_t> &aclist;
public:
SparseCSRMBuilder(std::vector<SizeType> &p_rptr,
std::vector<IndexType> &p_findex)
:rptr(p_rptr), findex(p_findex), aclist(dummy_aclist) {
Assert(!UseAcList, "enabling bug");
}
/*! \brief use with caution! rptr must be cleaned before use */
SparseCSRMBuilder(std::vector<SizeType> &p_rptr,
std::vector<IndexType> &p_findex,
std::vector<size_t> &p_aclist)
:rptr(p_rptr), findex(p_findex), aclist(p_aclist) {
Assert(UseAcList, "must manually enable the option use aclist");
}
public:
/*!
* \brief step 1: initialize the number of rows in the data, not necessary exact
* \nrows number of rows in the matrix, can be smaller than expected
*/
inline void InitBudget(size_t nrows = 0) {
if (!UseAcList) {
rptr.clear();
rptr.resize(nrows + 1, 0);
} else {
Assert(nrows + 1 == rptr.size(), "rptr must be initialized already");
this->Cleanup();
}
}
/*!
* \brief step 2: add budget to each rows, this function is called when aclist is used
* \param row_id the id of the row
* \param nelem number of element budget add to this row
*/
inline void AddBudget(size_t row_id, SizeType nelem = 1) {
if (rptr.size() < row_id + 2) {
rptr.resize(row_id + 2, 0);
}
if (UseAcList) {
if (rptr[row_id + 1] == 0) aclist.push_back(row_id);
}
rptr[row_id + 1] += nelem;
}
/*! \brief step 3: initialize the necessary storage */
inline void InitStorage(void) {
// initialize rptr to be beginning of each segment
size_t start = 0;
if (!UseAcList) {
for (size_t i = 1; i < rptr.size(); i++) {
size_t rlen = rptr[i];
rptr[i] = start;
start += rlen;
}
} else {
// case with active list
std::sort(aclist.begin(), aclist.end());
for (size_t i = 0; i < aclist.size(); i++) {
size_t ridx = aclist[i];
size_t rlen = rptr[ridx + 1];
rptr[ridx + 1] = start;
// set previous rptr to right position if previous feature is not active
if (i == 0 || ridx != aclist[i - 1] + 1) rptr[ridx] = start;
start += rlen;
}
}
findex.resize(start);
}
/*!
* \brief step 4:
* used in indicator matrix construction, add new
* element to each row, the number of calls shall be exactly same as add_budget
*/
inline void PushElem(size_t row_id, IndexType col_id) {
SizeType &rp = rptr[row_id + 1];
findex[rp++] = col_id;
}
/*!
* \brief step 5: only needed when aclist is used
* clean up the rptr for next usage
*/
inline void Cleanup(void) {
Assert(UseAcList, "this function can only be called use AcList");
for (size_t i = 0; i < aclist.size(); i++) {
const size_t ridx = aclist[i];
rptr[ridx] = 0; rptr[ridx + 1] = 0;
}
aclist.clear();
}
};
/*!
* \brief a class used to help construct CSR format matrix file
* \tparam IndexType type of index used to store the index position
* \tparam SizeType type of size used in row pointer
*/
template<typename IndexType, typename SizeType = size_t>
struct SparseCSRFileBuilder {
public:
explicit SparseCSRFileBuilder(utils::ISeekStream *fo, size_t buffer_size)
: fo(fo), buffer_size(buffer_size) {
}
/*!
* \brief step 1: initialize the number of rows in the data, not necessary exact
* \nrows number of rows in the matrix, can be smaller than expected
*/
inline void InitBudget(size_t nrows = 0) {
rptr.clear();
rptr.resize(nrows + 1, 0);
}
/*!
* \brief step 2: add budget to each rows
* \param row_id the id of the row
* \param nelem number of element budget add to this row
*/
inline void AddBudget(size_t row_id, SizeType nelem = 1) {
if (rptr.size() < row_id + 2) {
rptr.resize(row_id + 2, 0);
}
rptr[row_id + 1] += nelem;
}
/*! \brief step 3: initialize the necessary storage */
inline void InitStorage(void) {
SizeType nelem = 0;
for (size_t i = 1; i < rptr.size(); i++) {
nelem += rptr[i];
rptr[i] = nelem;
}
begin_data = static_cast<SizeType>(fo->Tell()) + sizeof(SizeType);
SizeType begin_meta = begin_data + nelem * sizeof(IndexType);
fo->Write(&begin_meta, sizeof(begin_meta));
fo->Seek(begin_meta);
fo->Write(rptr);
// setup buffer space
buffer_rptr.resize(rptr.size());
buffer_temp.reserve(buffer_size);
buffer_data.resize(buffer_size);
saved_offset = rptr;
saved_offset.resize(rptr.size() - 1);
this->ClearBuffer();
}
/*! \brief step 4: push element into buffer */
inline void PushElem(SizeType row_id, IndexType col_id) {
if (buffer_temp.size() == buffer_size) {
this->WriteBuffer();
this->ClearBuffer();
}
buffer_rptr[row_id + 1] += 1;
buffer_temp.push_back(std::make_pair(row_id, col_id));
}
/*! \brief finalize the construction */
inline void Finalize(void) {
this->WriteBuffer();
for (size_t i = 0; i < saved_offset.size(); ++i) {
utils::Assert(saved_offset[i] == rptr[i+1], "some block not write out");
}
}
/*! \brief content must be in wb+ */
template<typename Comparator>
inline void SortRows(Comparator comp, size_t step) {
for (size_t i = 0; i < rptr.size() - 1; i += step) {
bst_omp_uint begin = static_cast<bst_omp_uint>(i);
bst_omp_uint end = static_cast<bst_omp_uint>(std::min(rptr.size() - 1, i + step));
if (rptr[end] != rptr[begin]) {
fo->Seek(begin_data + rptr[begin] * sizeof(IndexType));
buffer_data.resize(rptr[end] - rptr[begin]);
fo->Read(BeginPtr(buffer_data), (rptr[end] - rptr[begin]) * sizeof(IndexType));
// do parallel sorting
#pragma omp parallel for schedule(static)
for (bst_omp_uint j = begin; j < end; ++j) {
std::sort(&buffer_data[0] + rptr[j] - rptr[begin],
&buffer_data[0] + rptr[j+1] - rptr[begin],
comp);
}
fo->Seek(begin_data + rptr[begin] * sizeof(IndexType));
fo->Write(BeginPtr(buffer_data), (rptr[end] - rptr[begin]) * sizeof(IndexType));
}
}
printf("CSV::begin_dat=%lu\n", begin_data);
}
protected:
inline void WriteBuffer(void) {
SizeType start = 0;
for (size_t i = 1; i < buffer_rptr.size(); ++i) {
size_t rlen = buffer_rptr[i];
buffer_rptr[i] = start;
start += rlen;
}
for (size_t i = 0; i < buffer_temp.size(); ++i) {
SizeType &rp = buffer_rptr[buffer_temp[i].first + 1];
buffer_data[rp++] = buffer_temp[i].second;
}
// write out
for (size_t i = 0; i < buffer_rptr.size() - 1; ++i) {
size_t nelem = buffer_rptr[i+1] - buffer_rptr[i];
if (nelem != 0) {
utils::Assert(saved_offset[i] + nelem <= rptr[i+1], "data exceed bound");
fo->Seek(saved_offset[i] * sizeof(IndexType) + begin_data);
fo->Write(&buffer_data[0] + buffer_rptr[i], nelem * sizeof(IndexType));
saved_offset[i] += nelem;
}
}
}
inline void ClearBuffer(void) {
buffer_temp.clear();
std::fill(buffer_rptr.begin(), buffer_rptr.end(), 0);
}
private:
/*! \brief output file pointer the data */
utils::ISeekStream *fo;
/*! \brief pointer to each of the row */
std::vector<SizeType> rptr;
/*! \brief saved top space of each item */
std::vector<SizeType> saved_offset;
/*! \brief beginning position of data */
size_t begin_data;
// ----- the following are buffer space
/*! \brief maximum size of content buffer*/
size_t buffer_size;
/*! \brief store the data content */
std::vector< std::pair<SizeType, IndexType> > buffer_temp;
/*! \brief saved top space of each item */
std::vector<SizeType> buffer_rptr;
/*! \brief saved top space of each item */
std::vector<IndexType> buffer_data;
};
} // namespace utils
} // namespace xgboost
#endif
|
3d7pt.lbpar.c | #include <omp.h>
#include <math.h>
#define ceild(n,d) ceil(((double)(n))/((double)(d)))
#define floord(n,d) floor(((double)(n))/((double)(d)))
#define max(x,y) ((x) > (y)? (x) : (y))
#define min(x,y) ((x) < (y)? (x) : (y))
/*
* Order-1, 3D 7 point stencil
* Adapted from PLUTO and Pochoir test bench
*
* Tareq Malas
*/
#include <stdio.h>
#include <stdlib.h>
#include <sys/time.h>
#ifdef LIKWID_PERFMON
#include <likwid.h>
#endif
#include "print_utils.h"
#define TESTS 2
#define MAX(a,b) ((a) > (b) ? a : b)
#define MIN(a,b) ((a) < (b) ? a : b)
/* Subtract the `struct timeval' values X and Y,
* storing the result in RESULT.
*
* Return 1 if the difference is negative, otherwise 0.
*/
int timeval_subtract(struct timeval *result, struct timeval *x, struct timeval *y)
{
/* Perform the carry for the later subtraction by updating y. */
if (x->tv_usec < y->tv_usec)
{
int nsec = (y->tv_usec - x->tv_usec) / 1000000 + 1;
y->tv_usec -= 1000000 * nsec;
y->tv_sec += nsec;
}
if (x->tv_usec - y->tv_usec > 1000000)
{
int nsec = (x->tv_usec - y->tv_usec) / 1000000;
y->tv_usec += 1000000 * nsec;
y->tv_sec -= nsec;
}
/* Compute the time remaining to wait.
* tv_usec is certainly positive.
*/
result->tv_sec = x->tv_sec - y->tv_sec;
result->tv_usec = x->tv_usec - y->tv_usec;
/* Return 1 if result is negative. */
return x->tv_sec < y->tv_sec;
}
int main(int argc, char *argv[])
{
int t, i, j, k, test;
int Nx, Ny, Nz, Nt;
if (argc > 3) {
Nx = atoi(argv[1])+2;
Ny = atoi(argv[2])+2;
Nz = atoi(argv[3])+2;
}
if (argc > 4)
Nt = atoi(argv[4]);
double ****A = (double ****) malloc(sizeof(double***)*2);
A[0] = (double ***) malloc(sizeof(double**)*Nz);
A[1] = (double ***) malloc(sizeof(double**)*Nz);
for(i=0; i<Nz; i++){
A[0][i] = (double**) malloc(sizeof(double*)*Ny);
A[1][i] = (double**) malloc(sizeof(double*)*Ny);
for(j=0;j<Ny;j++){
A[0][i][j] = (double*) malloc(sizeof(double)*Nx);
A[1][i][j] = (double*) malloc(sizeof(double)*Nx);
}
}
// tile size information, including extra element to decide the list length
int *tile_size = (int*) malloc(sizeof(int));
tile_size[0] = -1;
// The list is modified here before source-to-source transformations
tile_size = (int*) realloc((void *)tile_size, sizeof(int)*5);
tile_size[0] = 4;
tile_size[1] = 4;
tile_size[2] = 16;
tile_size[3] = 2048;
tile_size[4] = -1;
// for timekeeping
int ts_return = -1;
struct timeval start, end, result;
double tdiff = 0.0, min_tdiff=1.e100;
const int BASE = 1024;
const double alpha = 0.0876;
const double beta = 0.0765;
// initialize variables
//
srand(42);
for (i = 1; i < Nz; i++) {
for (j = 1; j < Ny; j++) {
for (k = 1; k < Nx; k++) {
A[0][i][j][k] = 1.0 * (rand() % BASE);
}
}
}
#ifdef LIKWID_PERFMON
LIKWID_MARKER_INIT;
#pragma omp parallel
{
LIKWID_MARKER_THREADINIT;
#pragma omp barrier
LIKWID_MARKER_START("calc");
}
#endif
int num_threads = 1;
#if defined(_OPENMP)
num_threads = omp_get_max_threads();
#endif
for(test=0; test<TESTS; test++){
gettimeofday(&start, 0);
// serial execution - Addition: 6 && Multiplication: 2
/* Copyright (C) 1991-2014 Free Software Foundation, Inc.
This file is part of the GNU C Library.
The GNU C Library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
The GNU C Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with the GNU C Library; if not, see
<http://www.gnu.org/licenses/>. */
/* This header is separate from features.h so that the compiler can
include it implicitly at the start of every compilation. It must
not itself include <features.h> or any other header that includes
<features.h> because the implicit include comes before any feature
test macros that may be defined in a source file before it first
explicitly includes a system header. GCC knows the name of this
header in order to preinclude it. */
/* glibc's intent is to support the IEC 559 math functionality, real
and complex. If the GCC (4.9 and later) predefined macros
specifying compiler intent are available, use them to determine
whether the overall intent is to support these features; otherwise,
presume an older compiler has intent to support these features and
define these macros by default. */
/* wchar_t uses ISO/IEC 10646 (2nd ed., published 2011-03-15) /
Unicode 6.0. */
/* We do not support C11 <threads.h>. */
int t1, t2, t3, t4, t5, t6, t7, t8;
int lb, ub, lbp, ubp, lb2, ub2;
register int lbv, ubv;
/* Start of CLooG code */
if ((Nt >= 2) && (Nx >= 3) && (Ny >= 3) && (Nz >= 3)) {
for (t1=-1;t1<=floord(Nt-2,2);t1++) {
lbp=max(ceild(t1,2),ceild(4*t1-Nt+3,4));
ubp=min(floord(Nt+Nz-4,4),floord(2*t1+Nz-1,4));
#pragma omp parallel for private(lbv,ubv,t3,t4,t5,t6,t7,t8)
for (t2=lbp;t2<=ubp;t2++) {
for (t3=max(max(0,ceild(t1-7,8)),ceild(4*t2-Nz-12,16));t3<=min(min(min(floord(4*t2+Ny,16),floord(Nt+Ny-4,16)),floord(2*t1+Ny+1,16)),floord(4*t1-4*t2+Nz+Ny-1,16));t3++) {
for (t4=max(max(max(0,ceild(t1-1023,1024)),ceild(4*t2-Nz-2044,2048)),ceild(16*t3-Ny-2044,2048));t4<=min(min(min(min(floord(4*t2+Nx,2048),floord(Nt+Nx-4,2048)),floord(2*t1+Nx+1,2048)),floord(16*t3+Nx+12,2048)),floord(4*t1-4*t2+Nz+Nx-1,2048));t4++) {
for (t5=max(max(max(max(max(0,2*t1),4*t1-4*t2+1),4*t2-Nz+2),16*t3-Ny+2),2048*t4-Nx+2);t5<=min(min(min(min(min(Nt-2,2*t1+3),4*t2+2),16*t3+14),2048*t4+2046),4*t1-4*t2+Nz+1);t5++) {
for (t6=max(max(4*t2,t5+1),-4*t1+4*t2+2*t5-3);t6<=min(min(4*t2+3,-4*t1+4*t2+2*t5),t5+Nz-2);t6++) {
for (t7=max(16*t3,t5+1);t7<=min(16*t3+15,t5+Ny-2);t7++) {
lbv=max(2048*t4,t5+1);
ubv=min(2048*t4+2047,t5+Nx-2);
#pragma ivdep
#pragma vector always
for (t8=lbv;t8<=ubv;t8++) {
A[( t5 + 1) % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)] = ((alpha * A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8)]) + (beta * (((((A[ t5 % 2][ (-t5+t6) - 1][ (-t5+t7)][ (-t5+t8)] + A[ t5 % 2][ (-t5+t6)][ (-t5+t7) - 1][ (-t5+t8)]) + A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8) - 1]) + A[ t5 % 2][ (-t5+t6) + 1][ (-t5+t7)][ (-t5+t8)]) + A[ t5 % 2][ (-t5+t6)][ (-t5+t7) + 1][ (-t5+t8)]) + A[ t5 % 2][ (-t5+t6)][ (-t5+t7)][ (-t5+t8) + 1])));;
}
}
}
}
}
}
}
}
}
/* End of CLooG code */
gettimeofday(&end, 0);
ts_return = timeval_subtract(&result, &end, &start);
tdiff = (double) (result.tv_sec + result.tv_usec * 1.0e-6);
min_tdiff = min(min_tdiff, tdiff);
printf("Rank 0 TEST# %d time: %f\n", test, tdiff);
}
PRINT_RESULTS(1, "constant")
#ifdef LIKWID_PERFMON
#pragma omp parallel
{
LIKWID_MARKER_STOP("calc");
}
LIKWID_MARKER_CLOSE;
#endif
// Free allocated arrays (Causing performance degradation
/* for(i=0; i<Nz; i++){
for(j=0;j<Ny;j++){
free(A[0][i][j]);
free(A[1][i][j]);
}
free(A[0][i]);
free(A[1][i]);
}
free(A[0]);
free(A[1]);
*/
return 0;
}
|
declare_simd_aarch64_warning_sve.c | // REQUIRES: aarch64-registered-target
// RUN: %clang_cc1 -triple aarch64-linux-gnu -target-feature +sve -fopenmp %s -S -o %t -verify
// RUN: %clang_cc1 -triple aarch64-linux-gnu -target-feature +sve -fopenmp-simd %s -S -o %t -verify
#pragma omp declare simd simdlen(66)
double foo(float x);
//expected-warning@-2{{The clause simdlen must fit the 64-bit lanes in the architectural constraints for SVE (min is 128-bit, max is 2048-bit, by steps of 128-bit)}}
void foo_loop(double *x, float *y, int N) {
for (int i = 0; i < N; ++i) {
x[i] = foo(y[i]);
}
}
|
builder.h | // Copyright (c) 2015, The Regents of the University of California (Regents)
// See LICENSE.txt for license details
#ifndef BUILDER_H_
#define BUILDER_H_
#include <algorithm>
#include <parallel/algorithm>
#include <cinttypes>
#include <fstream>
#include <functional>
#include <type_traits>
#include <utility>
#include <omp.h>
#include <cassert>
#include <vector>
#include "command_line.h"
#include "generator.h"
#include "graph.h"
#include "platform_atomics.h"
#include "pvector.h"
#include "reader.h"
#include "timer.h"
#include "util.h"
#include "sliding_queue.h"
/*
GAP Benchmark Suite
Class: BuilderBase
Author: Scott Beamer
Given arguements from the command line (cli), returns a built graph
- MakeGraph() will parse cli and obtain edgelist and call
MakeGraphFromEL(edgelist) to perform actual graph construction
- edgelist can be from file (reader) or synthetically generated (generator)
- Common case: BuilderBase typedef'd (w/ params) to be Builder (benchmark.h)
*/
template <typename NodeID_, typename DestID_ = NodeID_,
typename WeightT_ = NodeID_, bool invert = true>
class BuilderBase {
typedef EdgePair<NodeID_, DestID_> Edge;
typedef pvector<Edge> EdgeList;
const CLBase &cli_;
bool symmetrize_;
bool needs_weights_;
int64_t num_nodes_ = -1;
public:
explicit BuilderBase(const CLBase &cli) : cli_(cli) {
symmetrize_ = cli_.symmetrize();
needs_weights_ = !std::is_same<NodeID_, DestID_>::value;
}
DestID_ GetSource(EdgePair<NodeID_, NodeID_> e) {
return e.u;
}
DestID_ GetSource(EdgePair<NodeID_, NodeWeight<NodeID_, WeightT_>> e) {
return NodeWeight<NodeID_, WeightT_>(e.u, e.v.w);
}
NodeID_ FindMaxNodeID(const EdgeList &el) {
NodeID_ max_seen = 0;
#pragma omp parallel for reduction(max : max_seen)
for (auto it = el.begin(); it < el.end(); it++) {
Edge e = *it;
max_seen = std::max(max_seen, e.u);
max_seen = std::max(max_seen, (NodeID_) e.v);
}
return max_seen;
}
pvector<NodeID_> CountDegrees(const EdgeList &el, bool transpose) {
pvector<NodeID_> degrees(num_nodes_, 0);
#pragma omp parallel for
for (auto it = el.begin(); it < el.end(); it++) {
Edge e = *it;
if (symmetrize_ || (!symmetrize_ && !transpose))
fetch_and_add(degrees[e.u], 1);
if (symmetrize_ || (!symmetrize_ && transpose))
fetch_and_add(degrees[(NodeID_) e.v], 1);
}
return degrees;
}
static
pvector<SGOffset> PrefixSum(const pvector<NodeID_> °rees) {
pvector<SGOffset> sums(degrees.size() + 1);
SGOffset total = 0;
for (size_t n=0; n < degrees.size(); n++) {
sums[n] = total;
total += degrees[n];
}
sums[degrees.size()] = total;
return sums;
}
static
pvector<SGOffset> ParallelPrefixSum(const pvector<NodeID_> °rees) {
const size_t block_size = 1<<20;
const size_t num_blocks = (degrees.size() + block_size - 1) / block_size;
pvector<SGOffset> local_sums(num_blocks);
#pragma omp parallel for
for (size_t block=0; block < num_blocks; block++) {
SGOffset lsum = 0;
size_t block_end = std::min((block + 1) * block_size, degrees.size());
for (size_t i=block * block_size; i < block_end; i++)
lsum += degrees[i];
local_sums[block] = lsum;
}
pvector<SGOffset> bulk_prefix(num_blocks+1);
SGOffset total = 0;
for (size_t block=0; block < num_blocks; block++) {
bulk_prefix[block] = total;
total += local_sums[block];
}
bulk_prefix[num_blocks] = total;
pvector<SGOffset> prefix(degrees.size() + 1);
#pragma omp parallel for
for (size_t block=0; block < num_blocks; block++) {
SGOffset local_total = bulk_prefix[block];
size_t block_end = std::min((block + 1) * block_size, degrees.size());
for (size_t i=block * block_size; i < block_end; i++) {
prefix[i] = local_total;
local_total += degrees[i];
}
}
prefix[degrees.size()] = bulk_prefix[num_blocks];
return prefix;
}
// Removes self-loops and redundant edges
// Side effect: neighbor IDs will be sorted
void SquishCSR(const CSRGraph<NodeID_, DestID_, invert> &g, bool transpose,
DestID_*** sq_index, DestID_** sq_neighs) {
pvector<NodeID_> diffs(g.num_nodes());
DestID_ *n_start, *n_end;
#pragma omp parallel for private(n_start, n_end)
for (NodeID_ n=0; n < g.num_nodes(); n++) {
if (transpose) {
n_start = g.in_neigh(n).begin();
n_end = g.in_neigh(n).end();
} else {
n_start = g.out_neigh(n).begin();
n_end = g.out_neigh(n).end();
}
std::sort(n_start, n_end);
DestID_ *new_end = std::unique(n_start, n_end);
new_end = std::remove(n_start, new_end, n);
diffs[n] = new_end - n_start;
}
pvector<SGOffset> sq_offsets = ParallelPrefixSum(diffs);
*sq_neighs = new DestID_[sq_offsets[g.num_nodes()]];
*sq_index = CSRGraph<NodeID_, DestID_>::GenIndex(sq_offsets, *sq_neighs);
#pragma omp parallel for private(n_start)
for (NodeID_ n=0; n < g.num_nodes(); n++) {
if (transpose)
n_start = g.in_neigh(n).begin();
else
n_start = g.out_neigh(n).begin();
std::copy(n_start, n_start+diffs[n], (*sq_index)[n]);
}
}
CSRGraph<NodeID_, DestID_, invert> SquishGraph(
const CSRGraph<NodeID_, DestID_, invert> &g) {
DestID_ **out_index, *out_neighs, **in_index, *in_neighs;
SquishCSR(g, false, &out_index, &out_neighs);
if (g.directed()) {
if (invert)
SquishCSR(g, true, &in_index, &in_neighs);
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), out_index,
out_neighs, in_index,
in_neighs);
} else {
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), out_index,
out_neighs);
}
}
/*
Graph Bulding Steps (for CSR):
- Read edgelist once to determine vertex degrees (CountDegrees)
- Determine vertex offsets by a prefix sum (ParallelPrefixSum)
- Allocate storage and set points according to offsets (GenIndex)
- Copy edges into storage
*/
void MakeCSR(const EdgeList &el, bool transpose, DestID_*** index,
DestID_** neighs) {
pvector<NodeID_> degrees = CountDegrees(el, transpose);
pvector<SGOffset> offsets = ParallelPrefixSum(degrees);
*neighs = new DestID_[offsets[num_nodes_]];
*index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, *neighs);
#pragma omp parallel for
for (auto it = el.begin(); it < el.end(); it++) {
Edge e = *it;
if (symmetrize_ || (!symmetrize_ && !transpose))
(*neighs)[fetch_and_add(offsets[e.u], 1)] = e.v;
if (symmetrize_ || (!symmetrize_ && transpose))
(*neighs)[fetch_and_add(offsets[static_cast<NodeID_>(e.v)], 1)] =
GetSource(e);
}
}
CSRGraph<NodeID_, DestID_, invert> MakeGraphFromEL(EdgeList &el) {
DestID_ **index = nullptr, **inv_index = nullptr;
DestID_ *neighs = nullptr, *inv_neighs = nullptr;
Timer t;
t.Start();
if (num_nodes_ == -1)
num_nodes_ = FindMaxNodeID(el)+1;
//#if 0 //TEMP
if (needs_weights_)
Generator<NodeID_, DestID_, WeightT_>::InsertWeights(el);
//#endif
MakeCSR(el, false, &index, &neighs);
if (!symmetrize_ && invert)
MakeCSR(el, true, &inv_index, &inv_neighs);
t.Stop();
PrintTime("Build Time", t.Seconds());
if (symmetrize_)
return CSRGraph<NodeID_, DestID_, invert>(num_nodes_, index, neighs);
else
return CSRGraph<NodeID_, DestID_, invert>(num_nodes_, index, neighs,
inv_index, inv_neighs);
}
#if 0 //will complete the code later
CSRGraph<NodeID_, DestID_, invert> relabelForSpatialLocality(
const CSRGraph<NodeID_, DestID_, invert> &g) {
if (g.directed()) {
// Will add support soon
}
else {
Timer t;
t.start();
/* STEP I: make a map between new and old vertex labels */
long long counter = 0; //keep track of local counts
std::map<NodeID_, int64_t> reMap[128]; //Conservatively assuming we will never use more than 128 threads
/* relabel vertices in parallel (using local counter) */
#pragma omp parallel for firstprivate(count)
for (NodeID_ v = 0; v < g.num_nodes(); v++) {
if (reMap[omp_get_thread_num()].find(v) == reMap.end()) {
// vertex hasn't been labelled
reMap.insert(std::pair<NodeID_, int64_t>(v, counter));
counter++;
}
for (NodeID_ u : g.in_neigh(v)) {
if (reMap[omp_get_thread_num()].find(u) == reMap.end()) {
// vertex hasn't been labelled
reMap.insert(std::pair<NodeID_, int64_t>(u, counter));
counter++;
}
}
}
/* Update counts based on maximum count for each thread */
int64_t offset = 0;
for (int i = 0; i < 128; i++) {
if (reMap[i].size() != 0) {
// adding offset to all counts of current map
std::map<NodeID_, int64_t>::iterator it, it_end;
#pragma omp parallel for
for (it = reMap[i].begin(), it_end = reMap[i].end(); it != it_end; it++) {
it->second += offset;
}
// finding maximum value of current set
int64_t maxVal = 0;
#pragma omp parallel for reduction(max: maxVal)
for (it = reMap[i].begin(), it_end = reMap[i].end(); it != it_end; it++) {
if (it->second > maxVal) {
maxVal = it->second;
}
}
offset = maxVal;
}
}
/* Merge local containers */
std::map <NodeID_, int64_t> merged_reMap;
for (int i = 0; i < 128; i++) {
if (reMap[i].size() != 0) {
merged_reMap.insert(reMap[i].begin(), reMap[i].end());
}
}
/* STEP II: rewrite CSR based on this reMap */
DestID_* neighs = new DestID_[2 * g.num_edges()];
DestID_** index = CSRGraph<NodeID_, DestID_>::relabelIndex(offsets, neighs, reMap);
}
}
#endif
CSRGraph<NodeID_, DestID_, invert> MakeGraph() {
CSRGraph<NodeID_, DestID_, invert> g;
{ // extra scope to trigger earlier deletion of el (save memory)
EdgeList el;
if (cli_.filename() != "") {
Reader<NodeID_, DestID_, WeightT_, invert> r(cli_.filename());
if ((r.GetSuffix() == ".sg") || (r.GetSuffix() == ".wsg")) {
return r.ReadSerializedGraph();
} else {
el = r.ReadFile(needs_weights_);
}
} else if (cli_.scale() != -1) {
Generator<NodeID_, DestID_> gen(cli_.scale(), cli_.degree());
el = gen.GenerateEL(cli_.uniform());
}
g = MakeGraphFromEL(el);
}
#if 0
if (cli_.relabel() == 1) {
g_new = relabelForSpatialLocality(g);
}
#endif
return SquishGraph(g);
}
// Relabels (and rebuilds) graph by order of decreasing degree
static
CSRGraph<NodeID_, DestID_, invert> RelabelByDegree(
const CSRGraph<NodeID_, DestID_, invert> &g) {
if (g.directed()) {
std::cout << "Cannot relabel directed graph" << std::endl;
std::exit(-11);
}
Timer t;
t.Start();
typedef std::pair<int64_t, NodeID_> degree_node_p;
pvector<degree_node_p> degree_id_pairs(g.num_nodes());
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++)
degree_id_pairs[n] = std::make_pair(g.out_degree(n), n);
std::sort(degree_id_pairs.begin(), degree_id_pairs.end(),
std::greater<degree_node_p>());
pvector<NodeID_> degrees(g.num_nodes());
pvector<NodeID_> new_ids(g.num_nodes());
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[n] = degree_id_pairs[n].first;
new_ids[degree_id_pairs[n].second] = n;
}
pvector<SGOffset> offsets = ParallelPrefixSum(degrees);
DestID_* neighs = new DestID_[offsets[g.num_nodes()]];
DestID_** index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, neighs);
#pragma omp parallel for schedule (dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
for (NodeID_ v : g.out_neigh(u))
neighs[offsets[new_ids[u]]++] = new_ids[v];
std::sort(index[new_ids[u]], index[new_ids[u]+1]);
}
t.Stop();
PrintTime("Relabel", t.Seconds());
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), index, neighs);
}
// cheap version of MIT's "frequency based clustering" approach. Instead of sorting by
// degree order, this version only ensures that all the hub vertices are clustered at one
// end of the array
static
CSRGraph<NodeID_, DestID_, invert> degreeCluster(
const CSRGraph<NodeID_, DestID_, invert> &g, bool outDegree, pvector<NodeID_>& new_ids, bool createOnlyDegList, bool createBothCSRs, int cutoffFactor) {
Timer t;
t.Start();
int numThreads = omp_get_max_threads();
if (g.directed() == true) {
/* Step I: identify number and position of hubs in each threads partition*/
const int PADDING = 64 / sizeof(NodeID_);
NodeID_* localOffsets = new NodeID_[numThreads * PADDING]();
NodeID_ partitionSz = g.num_nodes() / numThreads;
NodeID_ avgDegree = g.num_edges_directed() / g.num_nodes();
NodeID_ degreeCutoff = avgDegree * cutoffFactor;
#pragma omp parallel
{
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (outDegree) {
if (g.out_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
else {
if (g.in_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
}
}
NodeID_ sum(0);
for (int tid = 0; tid < numThreads; ++tid) {
NodeID_ origCount = localOffsets[tid * PADDING];
localOffsets[tid * PADDING] = sum;
sum += origCount;
}
/* Step II: assign remap for the hub vertices first */
#pragma omp parallel
{
NodeID_ localCtr(0);
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (new_ids[n] != -1) {
new_ids[n] = localOffsets[tid * PADDING] + localCtr;
++localCtr;
}
}
}
delete[] localOffsets;
/* Step III: assigning remap for (easy) non hub vertices */
NodeID_ numHubs = sum;
SlidingQueue<NodeID_> queue(numHubs);
#pragma omp parallel
{
QueueBuffer<NodeID_> lqueue(queue, numHubs / numThreads);
#pragma omp for
for (NodeID_ n = numHubs; n < g.num_nodes(); ++n) {
if (new_ids[n] == -1) {
new_ids[n] = n;
}
else {
NodeID_ remappedTo = new_ids[n];
if (new_ids[remappedTo] == -1) {
new_ids[remappedTo] = n; //Swap ids
}
else {
lqueue.push_back(n);
}
}
}
lqueue.flush();
}
queue.slide_window();
/* Step IV: assigning remaps for remaining non hubs */
NodeID_ unassignedCtr = 0;
auto q_iter = queue.begin();
#pragma omp parallel for
for (NodeID_ n = 0; n < numHubs; ++n) {
if (new_ids[n] == -1) {
NodeID_ u = *(q_iter + __sync_fetch_and_add(&unassignedCtr, 1));
new_ids[n] = u;
}
}
/* Step V: generate degree to build a new graph */
pvector<NodeID_> degrees(g.num_nodes());
pvector<NodeID_> inv_degrees(g.num_nodes());
if (outDegree == true) {
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.out_degree(n);
inv_degrees[new_ids[n]] = g.in_degree(n);
}
}
else {
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.in_degree(n);
inv_degrees[new_ids[n]] = g.out_degree(n);
}
}
/* Graph building phase */
pvector<SGOffset> offsets = ParallelPrefixSum(inv_degrees);
DestID_* neighs = new DestID_[offsets[g.num_nodes()]];
DestID_** index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, neighs);
#pragma omp parallel for schedule (dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
if (outDegree == true) {
for (NodeID_ v : g.in_neigh(u))
neighs[offsets[new_ids[u]]++] = new_ids[v];
}
else {
for (NodeID_ v : g.out_neigh(u))
neighs[offsets[new_ids[u]]++] = new_ids[v];
}
}
DestID_* inv_neighs(nullptr);
DestID_** inv_index(nullptr);
if (createOnlyDegList == true || createBothCSRs == true) {
// making the inverse list (in-degrees in this case)
pvector<SGOffset> inv_offsets = ParallelPrefixSum(degrees);
inv_neighs = new DestID_[inv_offsets[g.num_nodes()]];
inv_index = CSRGraph<NodeID_, DestID_>::GenIndex(inv_offsets, inv_neighs);
if (createBothCSRs == true) {
#pragma omp parallel for schedule(dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
if (outDegree == true) {
for (NodeID_ v : g.out_neigh(u))
inv_neighs[inv_offsets[new_ids[u]]++] = new_ids[v];
}
else {
for (NodeID_ v : g.in_neigh(u))
inv_neighs[inv_offsets[new_ids[u]]++] = new_ids[v];
}
}
}
}
t.Stop();
PrintTime("HubCluster time", t.Seconds());
if (outDegree == true) {
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), inv_index, inv_neighs, index, neighs);
}
else {
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), index, neighs, inv_index, inv_neighs);
}
}
else {
/* Undirected graphs - no need to make separate lists for in and out degree */
/* Step I: identify number and position of hubs in each threads partition*/
const int PADDING = 64 / sizeof(NodeID_);
NodeID_* localOffsets = new NodeID_[numThreads * PADDING]();
NodeID_ partitionSz = g.num_nodes() / numThreads;
NodeID_ avgDegree = g.num_edges_directed() / g.num_nodes();
NodeID_ degreeCutoff = avgDegree * cutoffFactor;
#pragma omp parallel
{
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (g.out_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
}
NodeID_ sum(0);
for (int tid = 0; tid < numThreads; ++tid) {
NodeID_ origCount = localOffsets[tid * PADDING];
localOffsets[tid * PADDING] = sum;
sum += origCount;
}
//std::cout << "[STAT] number of hubs = " << sum << std::endl;
/* Step II: assign remap for the hub vertices first */
#pragma omp parallel
{
NodeID_ localCtr(0);
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (new_ids[n] != -1) {
new_ids[n] = localOffsets[tid * PADDING] + localCtr;
++localCtr;
}
}
}
delete[] localOffsets; //retire localOffsets
/* Step III: assigning remap for (easy) non hub vertices */
NodeID_ numHubs = sum;
SlidingQueue<NodeID_> queue(numHubs);
#pragma omp parallel
{
QueueBuffer<NodeID_> lqueue(queue, numHubs / numThreads);
#pragma omp for
for (NodeID_ n = numHubs; n < g.num_nodes(); ++n) {
if (new_ids[n] == -1) {
new_ids[n] = n;
}
else {
NodeID_ remappedTo = new_ids[n];
if (new_ids[remappedTo] == -1) {
new_ids[remappedTo] = n; //Swap ids
}
else {
lqueue.push_back(n);
}
}
}
lqueue.flush();
}
queue.slide_window();
/* Step IV: assigning remaps for remaining non hubs */
NodeID_ unassignedCtr = 0;
auto q_iter = queue.begin();
#pragma omp parallel for
for (NodeID_ n = 0; n < numHubs; ++n) {
if (new_ids[n] == -1) {
NodeID_ u = *(q_iter + __sync_fetch_and_add(&unassignedCtr, 1));
new_ids[n] = u;
}
}
/* Step V: generate degree to build a new graph */
pvector<NodeID_> degrees(g.num_nodes());
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.out_degree(n);
}
/* Graph building phase */
pvector<SGOffset> offsets = ParallelPrefixSum(degrees);
DestID_* neighs = new DestID_[offsets[g.num_nodes()]];
DestID_** index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, neighs);
#pragma omp parallel for schedule (dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
for (NodeID_ v : g.out_neigh(u))
neighs[offsets[new_ids[u]]++] = new_ids[v];
}
t.Stop();
PrintTime("HubCluster time", t.Seconds());
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), index, neighs);
}
}
// Similar to the previous function but handles directed graphs,
// weighted graphs, and also does relabeling by user specified method
static
CSRGraph<NodeID_, DestID_, invert> degreeCluster_weighted(
const CSRGraph<NodeID_, DestID_, invert> &g, bool outDegree, pvector<NodeID_> &new_ids, bool createOnlyDegList, bool createBothCSRs, int cutoffFactor) {
Timer t;
t.Start();
int numThreads = omp_get_max_threads();
if (g.directed() == true) {
/* Step I: identify number and position of hubs in each threads partition*/
const int PADDING = 64 / sizeof(NodeID_);
NodeID_* localOffsets = new NodeID_[numThreads * PADDING]();
NodeID_ partitionSz = g.num_nodes() / numThreads;
NodeID_ avgDegree = g.num_edges_directed() / g.num_nodes();
NodeID_ degreeCutoff = avgDegree * cutoffFactor;
#pragma omp parallel
{
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (outDegree) {
if (g.out_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
else {
if (g.in_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
}
}
NodeID_ sum(0);
for (int tid = 0; tid < numThreads; ++tid) {
NodeID_ origCount = localOffsets[tid * PADDING];
localOffsets[tid * PADDING] = sum;
sum += origCount;
}
//std::cout << "[STAT] number of hubs = " << sum << std::endl;
/* Step II: assign remap for the hub vertices first */
#pragma omp parallel
{
NodeID_ localCtr(0);
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (new_ids[n] != -1) {
new_ids[n] = localOffsets[tid * PADDING] + localCtr;
++localCtr;
}
}
}
delete[] localOffsets;
/* Step III: assigning remap for (easy) non hub vertices */
NodeID_ numHubs = sum;
SlidingQueue<NodeID_> queue(numHubs);
#pragma omp parallel
{
QueueBuffer<NodeID_> lqueue(queue, numHubs / numThreads);
#pragma omp for
for (NodeID_ n = numHubs; n < g.num_nodes(); ++n) {
if (new_ids[n] == -1) {
new_ids[n] = n;
}
else {
NodeID_ remappedTo = new_ids[n];
if (new_ids[remappedTo] == -1) {
new_ids[remappedTo] = n; //Swap ids
}
else {
lqueue.push_back(n);
}
}
}
lqueue.flush();
}
queue.slide_window();
/* Step IV: assigning remaps for remaining non hubs */
NodeID_ unassignedCtr = 0;
auto q_iter = queue.begin();
#pragma omp parallel for
for (NodeID_ n = 0; n < numHubs; ++n) {
if (new_ids[n] == -1) {
NodeID_ u = *(q_iter + __sync_fetch_and_add(&unassignedCtr, 1));
new_ids[n] = u;
}
}
/* Step V: generate degree to build a new graph */
pvector<NodeID_> degrees(g.num_nodes());
pvector<NodeID_> inv_degrees(g.num_nodes());
if (outDegree == true) {
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.out_degree(n);
inv_degrees[new_ids[n]] = g.in_degree(n);
}
}
else {
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.in_degree(n);
inv_degrees[new_ids[n]] = g.out_degree(n);
}
}
/* Graph building phase */
pvector<SGOffset> offsets = ParallelPrefixSum(inv_degrees);
DestID_* neighs = new DestID_[offsets[g.num_nodes()]];
DestID_** index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, neighs);
#pragma omp parallel for schedule(dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
if (outDegree) {
for (auto v : g.in_neigh(u)) {
auto oldWeight = v.w;
auto newID = new_ids[(NodeID_) v.v];
DestID_ newV (newID, oldWeight);
neighs[offsets[new_ids[u]]++] = newV;
}
}
else {
for (auto v : g.out_neigh(u)) {
auto oldWeight = v.w;
auto newID = new_ids[(NodeID_) v.v];
DestID_ newV (newID, oldWeight);
neighs[offsets[new_ids[u]]++] = newV;
}
}
}
DestID_* inv_neighs(nullptr);
DestID_** inv_index(nullptr);
if (createBothCSRs == true || createOnlyDegList == true) {
// making the inverse list (in-degrees in this case)
pvector<SGOffset> inv_offsets = ParallelPrefixSum(degrees);
inv_neighs = new DestID_[inv_offsets[g.num_nodes()]];
inv_index = CSRGraph<NodeID_, DestID_>::GenIndex(inv_offsets, inv_neighs);
if (createBothCSRs == true) {
#pragma omp parallel for schedule(dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
if (outDegree == true) {
for (auto v : g.out_neigh(u)) {
auto oldWeight = v.w;
auto newID = new_ids[(NodeID_) v.v];
DestID_ newV (newID, oldWeight);
inv_neighs[inv_offsets[new_ids[u]]++] = newV;
}
}
else {
for (auto v : g.in_neigh(u)) {
auto oldWeight = v.w;
auto newID = new_ids[(NodeID_) v.v];
DestID_ newV (newID, oldWeight);
inv_neighs[inv_offsets[new_ids[u]]++] = newV;
}
}
}
}
}
t.Stop();
PrintTime("HubCluster time", t.Seconds());
if (outDegree == true) {
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), inv_index, inv_neighs, index, neighs);
}
else {
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), index, neighs, inv_index, inv_neighs);
}
}
else {
/* Undirected graphs - no need to make separate lists for in and out degree */
/* Step I: identify number and position of hubs in each threads partition*/
const int PADDING = 64 / sizeof(NodeID_);
NodeID_* localOffsets = new NodeID_[numThreads * PADDING]();
NodeID_ partitionSz = g.num_nodes() / numThreads;
NodeID_ avgDegree = g.num_edges_directed() / g.num_nodes();
NodeID_ degreeCutoff = avgDegree * cutoffFactor;
#pragma omp parallel
{
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (g.out_degree(n) > degreeCutoff) {
++localOffsets[tid * PADDING];
new_ids[n] = 1;
}
}
}
NodeID_ sum(0);
for (int tid = 0; tid < numThreads; ++tid) {
NodeID_ origCount = localOffsets[tid * PADDING];
localOffsets[tid * PADDING] = sum;
sum += origCount;
}
//std::cout << "[STAT] number of hubs = " << sum << std::endl;
/* Step II: assign remap for the hub vertices first */
#pragma omp parallel
{
NodeID_ localCtr(0);
int tid = omp_get_thread_num();
NodeID_ startID = partitionSz * tid;
NodeID_ stopID = partitionSz * (tid + 1);
if (tid == numThreads - 1) {
stopID = g.num_nodes();
}
for (NodeID_ n = startID; n < stopID; ++n) {
if (new_ids[n] != -1) {
new_ids[n] = localOffsets[tid * PADDING] + localCtr;
++localCtr;
}
}
}
delete[] localOffsets; //retire localOffsets
/* Step III: assigning remap for (easy) non hub vertices */
NodeID_ numHubs = sum;
SlidingQueue<NodeID_> queue(numHubs);
#pragma omp parallel
{
QueueBuffer<NodeID_> lqueue(queue, numHubs / numThreads);
#pragma omp for
for (NodeID_ n = numHubs; n < g.num_nodes(); ++n) {
if (new_ids[n] == -1) {
new_ids[n] = n;
}
else {
NodeID_ remappedTo = new_ids[n];
if (new_ids[remappedTo] == -1) {
new_ids[remappedTo] = n; //Swap ids
}
else {
lqueue.push_back(n);
}
}
}
lqueue.flush();
}
queue.slide_window();
/* Step IV: assigning remaps for remaining non hubs */
NodeID_ unassignedCtr = 0;
auto q_iter = queue.begin();
#pragma omp parallel for
for (NodeID_ n = 0; n < numHubs; ++n) {
if (new_ids[n] == -1) {
NodeID_ u = *(q_iter + __sync_fetch_and_add(&unassignedCtr, 1));
new_ids[n] = u;
}
}
/* Step V: generate degree to build a new graph */
pvector<NodeID_> degrees(g.num_nodes());
#pragma omp parallel for
for (NodeID_ n=0; n < g.num_nodes(); n++) {
degrees[new_ids[n]] = g.out_degree(n);
}
/* Graph building phase */
pvector<SGOffset> offsets = ParallelPrefixSum(degrees);
DestID_* neighs = new DestID_[offsets[g.num_nodes()]];
DestID_** index = CSRGraph<NodeID_, DestID_>::GenIndex(offsets, neighs);
#pragma omp parallel for schedule (dynamic, 1024)
for (NodeID_ u=0; u < g.num_nodes(); u++) {
for (auto v : g.out_neigh(u)) {
auto oldWeight = v.w;
auto newID = new_ids[(NodeID_) v.v];
DestID_ newV (newID, oldWeight);
neighs[offsets[new_ids[u]]++] = newV;
}
}
t.Stop();
PrintTime("HubCluster time", t.Seconds());
return CSRGraph<NodeID_, DestID_, invert>(g.num_nodes(), index, neighs);
}
}
};
#endif // BUILDER_H_
|
GB_unop__log_fp64_fp64.c | //------------------------------------------------------------------------------
// GB_unop: hard-coded functions for each built-in unary operator
//------------------------------------------------------------------------------
// SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
// SPDX-License-Identifier: Apache-2.0
//------------------------------------------------------------------------------
// If this file is in the Generated2/ folder, do not edit it
// (it is auto-generated from Generator/*).
#include "GB.h"
#ifndef GBCUDA_DEV
#include "GB_control.h"
#include "GB_atomics.h"
#include "GB_unop__include.h"
// C=unop(A) is defined by the following types and operators:
// op(A) function: GB (_unop_apply__log_fp64_fp64)
// op(A') function: GB (_unop_tran__log_fp64_fp64)
// C type: double
// A type: double
// cast: double cij = aij
// unaryop: cij = log (aij)
#define GB_ATYPE \
double
#define GB_CTYPE \
double
// aij = Ax [pA]
#define GB_GETA(aij,Ax,pA) \
double aij = Ax [pA]
#define GB_CX(p) Cx [p]
// unary operator
#define GB_OP(z, x) \
z = log (x) ;
// casting
#define GB_CAST(z, aij) \
double z = aij ;
// cij = op (aij)
#define GB_CAST_OP(pC,pA) \
{ \
/* aij = Ax [pA] */ \
double aij = Ax [pA] ; \
/* Cx [pC] = op (cast (aij)) */ \
double z = aij ; \
Cx [pC] = log (z) ; \
}
// disable this operator and use the generic case if these conditions hold
#define GB_DISABLE \
(GxB_NO_LOG || GxB_NO_FP64)
//------------------------------------------------------------------------------
// Cx = op (cast (Ax)): apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_apply__log_fp64_fp64)
(
double *Cx, // Cx and Ax may be aliased
const double *Ax,
const int8_t *restrict Ab, // A->b if A is bitmap
int64_t anz,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
int64_t p ;
if (Ab == NULL)
{
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
double aij = Ax [p] ;
double z = aij ;
Cx [p] = log (z) ;
}
}
else
{
// bitmap case, no transpose; A->b already memcpy'd into C->b
#pragma omp parallel for num_threads(nthreads) schedule(static)
for (p = 0 ; p < anz ; p++)
{
if (!Ab [p]) continue ;
double aij = Ax [p] ;
double z = aij ;
Cx [p] = log (z) ;
}
}
return (GrB_SUCCESS) ;
#endif
}
//------------------------------------------------------------------------------
// C = op (cast (A')): transpose, typecast, and apply a unary operator
//------------------------------------------------------------------------------
GrB_Info GB (_unop_tran__log_fp64_fp64)
(
GrB_Matrix C,
const GrB_Matrix A,
int64_t *restrict *Workspaces,
const int64_t *restrict A_slice,
int nworkspaces,
int nthreads
)
{
#if GB_DISABLE
return (GrB_NO_VALUE) ;
#else
#include "GB_unop_transpose.c"
return (GrB_SUCCESS) ;
#endif
}
#endif
|
elemwise_binary_scalar_op.h | /*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
/*!
* \file elemwise_binary_scalar_op.h
* \brief Function definition of elementwise binary scalar operators
*/
#ifndef MXNET_OPERATOR_TENSOR_ELEMWISE_BINARY_SCALAR_OP_H_
#define MXNET_OPERATOR_TENSOR_ELEMWISE_BINARY_SCALAR_OP_H_
#include <mxnet/operator_util.h>
#include <vector>
#include <utility>
#include "../mshadow_op.h"
#include "../elemwise_op_common.h"
#include "elemwise_unary_op.h"
namespace mxnet {
namespace op {
class BinaryScalarOp : public UnaryOp {
/*! \brief Tensor operation against a scalar with a dense result */
template<typename OP, typename DType, typename IType>
static void ComputeExDenseResultRSP(mshadow::Stream<cpu> *stream,
const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const NDArray &input,
const OpReqType req,
const NDArray &output) {
const double alpha = nnvm::get<double>(attrs.parsed);
CHECK_EQ(output.shape(), input.shape());
const int64_t row_count = output.shape()[0];
const int64_t items_per_row = output.shape().Size() / row_count;
const DType result_for_zero = OP::Map(DType(0), DType(alpha));
mshadow::Tensor<cpu, 1, DType> input_data = input.data().FlatTo1D<cpu, DType>(stream);
mshadow::Tensor<cpu, 1, DType> output_data = output.data().FlatTo1D<cpu, DType>(stream);
const int64_t sparse_row_count = input.aux_shape(rowsparse::kIdx).Size();
if (sparse_row_count != row_count) {
mshadow::Tensor<cpu, 1, IType> row_indexes = input.aux_data(
rowsparse::kIdx).FlatTo1D<cpu, IType>(stream);
int64_t input_iter = 0;
int64_t output_row = 0;
IType next_input_row = 0;
while (output_row < row_count) {
next_input_row = input_iter < sparse_row_count ? int64_t(row_indexes[input_iter])
: row_count;
// Split up into blocks of contiguous data and do those together
// Do contiguous dense blocks
const int64_t dense_block_count = next_input_row - output_row;
if (dense_block_count > 0) {
MXNET_ASSIGN_REQ_SWITCH(req, Req, {
mxnet_op::Kernel<OpBase::SetToScalar<Req>, cpu>::Launch(
stream,
items_per_row * dense_block_count,
output_data.dptr_ + items_per_row * output_row,
result_for_zero);
});
output_row += dense_block_count;
continue;
}
// Do contiguous sparse blocks
int64_t next_non_contiguous_sparse = input_iter;
while (next_non_contiguous_sparse < sparse_row_count - 1) {
if (row_indexes[next_non_contiguous_sparse + 1]
!= row_indexes[next_non_contiguous_sparse] + 1) {
break;
}
++next_non_contiguous_sparse;
}
const int64_t sparse_block_count = next_non_contiguous_sparse - input_iter + 1;
if (sparse_block_count > 0) {
MXNET_ASSIGN_REQ_SWITCH(req, Req, {
mxnet_op::Kernel<mxnet_op::op_with_req<OP, Req>, cpu>::Launch(
stream,
items_per_row * sparse_block_count,
&output_data.dptr_[items_per_row * output_row],
&input_data.dptr_[items_per_row * input_iter],
DType(alpha));
});
output_row += sparse_block_count;
input_iter += sparse_block_count;
continue;
}
}
} else {
// All rows exist (eventually we don't have to do complex
// things to call GPU kernels because we don't need to access row indices)
MXNET_ASSIGN_REQ_SWITCH(req, Req, {
mxnet_op::Kernel<mxnet_op::op_with_req<OP, Req>, cpu>::Launch(
stream,
items_per_row * row_count,
output_data.dptr_,
input_data.dptr_,
DType(alpha));
});
}
}
/*! \brief Tensor operation against a scalar with a dense result */
template<typename OP, typename DType, typename IType, typename CType>
static void ComputeExDenseResultCSR(mshadow::Stream<cpu> *stream,
const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const NDArray &input,
const OpReqType req,
const NDArray &output) {
CHECK_EQ(output.shape(), input.shape());
const double alpha = nnvm::get<double>(attrs.parsed);
const DType dense_fill_val = OP::Map(DType(0), DType(alpha));
const TBlob column_indexes = input.aux_data(csr::kIdx);
const size_t item_count = column_indexes.Size();
// Pre-fill dense with 0-input/output value
FillDense<cpu, DType>(stream, output.shape().Size(), dense_fill_val,
req, output.data().dptr<DType>());
mshadow::Tensor<cpu, 2, DType> out = AsRowise2D<DType>(stream, output.data());
if (item_count) {
const DType *in = input.data().dptr<DType>();
const IType *column_indexes_ptr = column_indexes.dptr<IType>();
const auto row_count = static_cast<size_t>(input.shape()[0]);
const TBlob row_starts = input.aux_data(csr::kIndPtr);
const CType *row_starts_ptr = row_starts.dptr<CType>();
#pragma omp parallel for
for (int i = 0; i < static_cast<int>(row_count); ++i) {
const bool last_row = i == static_cast<int>(row_count) - 1;
// Split up into blocks of contiguous data and do those together
const size_t row_item_start_iter = row_starts_ptr[i];
const size_t input_items_this_row = !last_row
? static_cast<size_t>(row_starts_ptr[i + 1])
- row_item_start_iter
: item_count - row_item_start_iter;
if (input_items_this_row) {
const IType *this_row_column_indexes = column_indexes_ptr + row_item_start_iter;
const DType *row_data_start = in + row_item_start_iter;
DType *output_this_row = out[i].dptr_;
// More overhead to use OMP for small loops, so don't
if (input_items_this_row > 1000) {
#pragma omp parallel for
for (CType j = 0; j < static_cast<CType>(input_items_this_row); ++j) {
const IType col = this_row_column_indexes[j];
const DType val = row_data_start[j];
output_this_row[col] = OP::Map(val, DType(alpha));
}
} else {
for (CType j = 0; j < static_cast<CType>(input_items_this_row); ++j) {
const IType col = this_row_column_indexes[j];
const DType val = row_data_start[j];
output_this_row[col] = OP::Map(val, DType(alpha));
}
}
}
}
}
}
template<typename xpu, typename OP, typename DType, typename IType>
static void ComputeExDenseResult(const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const NDArray &input,
const OpReqType req,
const NDArray output) {
mshadow::Stream<xpu> *stream = ctx.get_stream<xpu>();
CHECK_EQ(output.storage_type(), kDefaultStorage);
switch (input.storage_type()) {
case kRowSparseStorage: {
ComputeExDenseResultRSP<OP, DType, IType>(stream, attrs, ctx, input, req, output);
break;
}
case kCSRStorage: {
MSHADOW_IDX_TYPE_SWITCH(input.aux_data(csr::kIndPtr).type_flag_, CType, {
ComputeExDenseResultCSR<OP, DType, IType, CType>(stream, attrs, ctx, input, req, output);
});
break;
}
default:
CHECK(false) << "Unsupported sparse storage type";
break;
}
}
public:
template<typename xpu, typename OP>
static void Compute(const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const std::vector<TBlob> &inputs,
const std::vector<OpReqType> &req,
const std::vector<TBlob> &outputs) {
DCHECK_EQ(inputs.size(), 1);
DCHECK_EQ(outputs.size(), 1);
using namespace mshadow;
using namespace mshadow::expr;
Stream<xpu> *s = ctx.get_stream<xpu>();
const double alpha = nnvm::get<double>(attrs.parsed);
MSHADOW_TYPE_SWITCH(outputs[0].type_flag_, DType, {
MXNET_ASSIGN_REQ_SWITCH(req[0], Req, {
mxnet_op::Kernel<mxnet_op::op_with_req<OP, Req>, xpu>::Launch(s,
inputs[0].Size(),
outputs[0].dptr<DType>(),
inputs[0].dptr<DType>(),
DType(alpha));
});
});
}
template<typename xpu, typename OP>
static void ComputeEx(const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const std::vector<NDArray> &inputs,
const std::vector<OpReqType> &req,
const std::vector<NDArray> &outputs) {
DCHECK_EQ(inputs.size(), 1);
DCHECK_EQ(outputs.size(), 1);
CHECK_NE(inputs[0].storage_type(), kDefaultStorage);
if (outputs[0].storage_type() != kDefaultStorage) {
CHECK_EQ(outputs[0].storage_type(), inputs[0].storage_type());
if (req[0] != kNullOp) {
UnaryOp::MapToFCompute<xpu>(attrs, ctx, inputs, req, outputs, Compute<xpu, OP>);
}
} else {
if (typeid(xpu) == typeid(gpu)) {
mxnet::op::FCompExFallback<xpu>(attrs, ctx, inputs, req, outputs,
Compute<xpu, OP>,
"ComputeEx");
} else {
MSHADOW_TYPE_SWITCH(outputs[0].data().type_flag_, DType, {
MSHADOW_IDX_TYPE_SWITCH(inputs[0].aux_type(rowsparse::kIdx), IType, {
ComputeExDenseResult<xpu, OP, DType, IType>(attrs, ctx, inputs[0], req[0], outputs[0]);
});
});
}
}
}
template<typename xpu, typename OP>
static void Backward(const nnvm::NodeAttrs &attrs,
const OpContext &ctx,
const std::vector<TBlob> &inputs,
const std::vector<OpReqType> &req,
const std::vector<TBlob> &outputs) {
using namespace mshadow;
using namespace mshadow::expr;
Stream<xpu> *s = ctx.get_stream<xpu>();
const double alpha = nnvm::get<double>(attrs.parsed);
MSHADOW_TYPE_SWITCH(outputs[0].type_flag_, DType, {
Tensor<xpu, 1, DType> igrad = outputs[0].FlatTo1D<xpu, DType>(s);
Tensor<xpu, 1, DType> ograd = inputs[0].FlatTo1D<xpu, DType>(s);
Tensor<xpu, 1, DType> lhs = inputs[1].FlatTo1D<xpu, DType>(s);
ASSIGN_DISPATCH(igrad, req[0], ograd * F<OP>(lhs, scalar<DType>(DType(alpha))));
});
}
};
#define MXNET_OPERATOR_REGISTER_BINARY_SCALAR(name) \
NNVM_REGISTER_OP(name) \
.set_num_inputs(1) \
.set_num_outputs(1) \
.set_attr_parser([](NodeAttrs* attrs) { \
attrs->parsed = std::stod(attrs->dict["scalar"]); \
}) \
.set_attr<nnvm::FInferShape>("FInferShape", ElemwiseShape<1, 1>) \
.set_attr<nnvm::FInferType>("FInferType", ElemwiseType<1, 1>) \
.set_attr<FInferStorageType>("FInferStorageType", ElemwiseStorageType<1, 1>) \
.set_attr<nnvm::FInplaceOption>("FInplaceOption", \
[](const NodeAttrs& attrs){ \
return std::vector<std::pair<int, int> >{{0, 0}}; \
}) \
.add_argument("data", "NDArray-or-Symbol", "source input") \
.add_argument("scalar", "float", "scalar input")
} // namespace op
} // namespace mxnet
#endif // MXNET_OPERATOR_TENSOR_ELEMWISE_BINARY_SCALAR_OP_H_
|
main.c | #include "libabl.h"
#include "time.h"
#include "stdio.h"
#include "CL/cl.h"
#include "omp.h"
#define PROFILING_ITERATION 20
#define PROFILING_INTERVAL 100
typedef struct {
float2 pos;
double desiredSpeed;
float2 velocity;
bool isFinished;
int leader;
int id;
float2 target;
int envId;
}Point;
static const type_info Point_info[] = {
{ TYPE_FLOAT2, offsetof(Point, pos), "pos", true },
{ TYPE_FLOAT, offsetof(Point, desiredSpeed), "desiredSpeed", false },
{ TYPE_FLOAT2, offsetof(Point, velocity), "velocity", false },
{ TYPE_BOOL, offsetof(Point, isFinished), "isFinished", false },
{ TYPE_INT, offsetof(Point, leader), "leader", false },
{ TYPE_INT, offsetof(Point, id), "id", false },
{ TYPE_FLOAT2, offsetof(Point, target), "target", false },
{ TYPE_END, sizeof(Point), NULL }
};
typedef struct {
int mem_start;
int mem_end;
} env;
struct agent_struct {
dyn_array agents_Point;
dyn_array agents_Point_dbuf;
};
struct agent_struct agents;
static const agent_info agents_info[] = {
{ Point_info, offsetof(struct agent_struct, agents_Point), "Point" },
{ NULL, 0, NULL }
};
double PI = 3.14159;
int num_timesteps = 1000;
int num_agents = 65536;
double T = 0.54;
double rho = 0.05;
double r = 2.0;
double lambda = 2.0;
double gamma = 0.35;
double n_prime = 3.0;
double n = 2.0;
double A = 4.5;
int aa = 3;
double bb = 0.1;
double stepTime = 0.25;
double W = 1144.87;
float2 random_1(float2 min, float2 max) {
return float2_create(random_float(min.x, max.x), random_float(min.y, max.y));
}
float3 random_2(float3 min, float3 max) {
return float3_create(random_float(min.x, max.x), random_float(min.y, max.y), random_float(min.z, max.z));
}
double random_3(double max) {
return random_float(0, max);
}
float2 random_4(float2 max) {
return random_1(float2_fill(0), max);
}
float3 random_5(float3 max) {
return random_2(float3_fill(0), max);
}
int randomInt_1(int max) {
return random_int(0, max);
}
double clam(double pos, double min, double max) {
return ((pos < min) ? min : ((pos > max) ? max : pos));
}
float2 clam_1(float2 pos, float2 min, float2 max) {
return float2_create(((pos.x < min.x) ? min.x : ((pos.x > max.x) ? max.x : pos.x)), ((pos.y < min.y) ? min.y : ((pos.y > max.y) ? max.y : pos.y)));
}
float3 clam_2(float3 pos, float3 min, float3 max) {
return float3_create(((pos.x < min.x) ? min.x : ((pos.x > max.x) ? max.x : pos.x)), ((pos.y < min.y) ? min.y : ((pos.y > max.y) ? max.y : pos.y)), ((pos.z < min.z) ? min.z : ((pos.z > max.z) ? max.z : pos.z)));
}
double clam_3(double pos, double max) {
return clam(pos, 0, max);
}
float2 clam_4(float2 pos, float2 max) {
return clam_1(pos, float2_fill(0), max);
}
float3 clam_5(float3 pos, float3 max) {
return clam_2(pos, float3_fill(0), max);
}
double wraparound(double pos, double max) {
return ((pos < 0) ? (max + pos) : ((pos >= max) ? (pos - max) : pos));
}
float2 wraparound_1(float2 pos, float2 max) {
return float2_create(((pos.x < 0) ? (max.x + pos.x) : ((pos.x >= max.x) ? (pos.x - max.x) : pos.x)), ((pos.y < 0) ? (max.y + pos.y) : ((pos.y >= max.y) ? (pos.y - max.y) : pos.y)));
}
float3 wraparound_2(float3 pos, float3 max) {
return float3_create(((pos.x < 0) ? (max.x + pos.x) : ((pos.x >= max.x) ? (pos.x - max.x) : pos.x)), ((pos.y < 0) ? (max.y + pos.y) : ((pos.y >= max.y) ? (pos.y - max.y) : pos.y)), ((pos.z < 0) ? (max.z + pos.z) : ((pos.z >= max.z) ? (pos.z - max.z) : pos.z)));
}
bool is_inside(float2 pos, float2 max) {
return ((((pos.x >= 0) && (pos.y >= 0)) && (pos.x <= max.x)) && (pos.y <= max.y));
}
bool isSortNeeded(int p1, int p2) {
if ((p1 > p2)) return true;
return false;
}
bool isSortNeeded_1(float2 p1, float2 p2) {
if ((p1.x > p2.x)) return true;
if ((p1.x == p2.x)) {
if ((p1.y > p2.y)) {
return true;
}
}
return false;
}
int dijkstra(int n, int startnode, int endnode) {
int cost[10000];
int distance[100];
int pred[100];
int visited[100];
int count = 0;
int mindistance = 0;
int nextnode = 0;
for (int i = 0, _var0 = (int) n; i < _var0; ++i) {
for (int j = 0, _var1 = (int) n; j < _var1; ++j) {
if ((((i - j) == 1) || ((j - i) == 1))) cost[((i * (int) n) + j)] = 1; else cost[((i * (int) n) + j)] = 32767;
}
}
for (int i = 0, _var2 = (int) n; i < _var2; ++i) {
distance[i] = cost[(((int) startnode * (int) n) + i)];
pred[i] = startnode;
visited[i] = 0;
}
distance[(int) startnode] = 0;
visited[(int) startnode] = 1;
count = 1;
while ((count < ((int) n - 1))) {
mindistance = 32767;
for (int i = 0, _var3 = (int) n; i < _var3; ++i) {
if (((distance[i] < mindistance) && (!(bool) visited[i]))) {
mindistance = distance[i];
nextnode = i;
}
}
visited[nextnode] = 1;
for (int i = 0, _var4 = (int) n; i < _var4; ++i) {
if ((!(bool) visited[i])) {
if (((mindistance + cost[((nextnode * (int) n) + i)]) < distance[i])) {
distance[i] = (mindistance + cost[((nextnode * (int) n) + i)]);
pred[i] = nextnode;
}
}
}
count = (count + 1);
}
int j = (int) endnode;
while ((pred[j] != (int) startnode)) {
j = pred[j];
}
return j;
}
Point* coexecution_merge_Point(Point* A0, Point* A1) {
if ((A1->id == A1->leader)) A1->target = A0->target;
return A1;
}
int main() {
double wtime = omp_get_wtime();
for (int i = 0, _var5 = num_agents; i < _var5; ++i) {
*DYN_ARRAY_PLACE(&agents.agents_Point, Point) = (Point) {
.pos = random_4(float2_fill(W)),
.desiredSpeed = random_float(0.1, 0.5),
.velocity = float2_create(0, 0),
.id = i,
.leader = (128 * (i / 128)),
.isFinished = false,
.target = float2_create(1, 1),
};
}
cl_int ret;
cl_device_id device_id = NULL;
cl_uint num_of_platforms;
cl_uint num_of_devices=0;
clGetPlatformIDs(0, NULL, &num_of_platforms);
cl_platform_id platform_ids[num_of_platforms];
ret = clGetPlatformIDs( num_of_platforms, platform_ids, NULL );
cl_command_queue command_queues[2];
if (!agents.agents_Point_dbuf.values) {
agents.agents_Point_dbuf = DYN_ARRAY_COPY_FIXED(Point, &agents.agents_Point);
}
size_t _var6_Point = sizeof(Point)*agents.agents_Point.len;
size_t _var6_Point_dbuf = sizeof(Point)*agents.agents_Point.len;
cl_kernel kernel_Point_0s[2];
cl_kernel kernel_Point_1s[2];
cl_kernel st_kernel_Points[2];
cl_kernel mem_kernel_Points[2];
cl_kernel upenv_kernel_Points[2];
cl_mem _var6MemObj_Points[2];
cl_mem _var6MemObjDbuf_Points[2];
cl_mem _var6MemObjLen_Points[2];
cl_mem _var6MemObjEnv_Points[2];
int activeDevice[2]={0,1};
cl_mem _var6MemObjRng_Points[2];
cl_mem _var6MemObjRedo_0s[2];
cl_mem _var6MemObjInteractionCurrent_0s[2];
cl_mem _var6MemObjInteractionLast_0s[2];
cl_mem _var6MemObjRedo_1s[2];
cl_mem _var6MemObjInteractionCurrent_1s[2];
cl_mem _var6MemObjInteractionLast_1s[2];
cl_mem _var6MemObjIsProfilingIter_0s[2];
cl_mem _var6MemObjIsProfilingIter_1s[2];
cl_kernel interaction_rate_kernel_0s[2];
cl_kernel interaction_rate_kernel_1s[2];
char fileName[] = "kernel.cl";
char *source_str;
size_t source_size;
FILE *fp;
fp = fopen(fileName, "r");
source_str = (char*)malloc(0x100000);
source_size = fread(source_str, 1, 0x100000, fp);
fclose(fp);
for (int deviceIter = 0 ; deviceIter < 2 ; deviceIter++){
int devId = activeDevice[deviceIter];
ret = clGetDeviceIDs( platform_ids[devId], CL_DEVICE_TYPE_ALL, 1, &device_id, &ret );
cl_context_properties contextProperties[] =
{
CL_CONTEXT_PLATFORM,
(cl_context_properties) platform_ids[devId],
0
};
cl_context context = clCreateContextFromType(contextProperties, CL_DEVICE_TYPE_ALL, NULL, NULL, &ret);
cl_command_queue command_queue = clCreateCommandQueueWithProperties(context, device_id, 0, &ret);
command_queues[deviceIter] = command_queue;
cl_program program = clCreateProgramWithSource(context, 1, (const char **)&source_str, NULL, &ret);
ret = clBuildProgram(program, 1, &device_id, NULL, NULL, NULL);
char* kernel_name_prefix = "compute_kernel_";
char number[2];
char kernel_name[50];
cl_mem _var6MemObj_Point = clCreateBuffer(context, CL_MEM_READ_WRITE, _var6_Point, NULL , &ret);
_var6MemObj_Points[deviceIter] = _var6MemObj_Point;
cl_mem _var6MemObjDbuf_Point = clCreateBuffer(context, CL_MEM_READ_WRITE, _var6_Point_dbuf, NULL , &ret);
_var6MemObjDbuf_Points[deviceIter] = _var6MemObjDbuf_Point;
cl_mem _var6MemObjLen_Point = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(int), NULL , &ret);
_var6MemObjLen_Points[deviceIter] = _var6MemObjLen_Point;
cl_mem _var6MemObjEnv_Point = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(env)*13225, NULL , &ret);
_var6MemObjEnv_Points[deviceIter] = _var6MemObjEnv_Point;
cl_uint2 *rngState_Point;
rngState_Point = (cl_uint2 *)calloc(agents.agents_Point.len, sizeof(cl_uint2));
for ( int _var7 = 0 ; _var7 < agents.agents_Point.len ; _var7++ ) {
cl_uint2 _var8 = { (uint32_t)(_var7 * 2), (uint32_t)(_var7 * 2 + 1) };
rngState_Point[_var7] = _var8;
}
cl_mem _var6MemObjRng_Point = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(cl_uint2)*agents.agents_Point.len, NULL , &ret);
_var6MemObjRng_Points[deviceIter] = _var6MemObjRng_Point;
sprintf(number,"%d", deviceIter);
sprintf(kernel_name,"%s%s_%s_%s", kernel_name_prefix, number, "Point","0");
cl_kernel kernel_Point_0 = clCreateKernel(program, kernel_name, &ret);
kernel_Point_0s[deviceIter] = kernel_Point_0;
sprintf(number,"%d", deviceIter);
sprintf(kernel_name,"%s%s_%s_%s", kernel_name_prefix, number, "Point","1");
cl_kernel kernel_Point_1 = clCreateKernel(program, kernel_name, &ret);
kernel_Point_1s[deviceIter] = kernel_Point_1;
cl_kernel st_kernel_Point = clCreateKernel(program, "sorting_Point", &ret);
st_kernel_Points[deviceIter] = st_kernel_Point;
cl_kernel mem_kernel_Point = clCreateKernel(program, "mem_update_Point", &ret);
mem_kernel_Points[deviceIter] = mem_kernel_Point;
cl_kernel upenv_kernel_Point = clCreateKernel(program, "update_envId_Point", &ret);
upenv_kernel_Points[deviceIter] = upenv_kernel_Point;
cl_kernel interaction_rate_kernel_0 = clCreateKernel(program, "check_interaction_rate_0", &ret);
interaction_rate_kernel_0s[deviceIter] = interaction_rate_kernel_0;
cl_kernel interaction_rate_kernel_1 = clCreateKernel(program, "check_interaction_rate_1", &ret);
interaction_rate_kernel_1s[deviceIter] = interaction_rate_kernel_1;
cl_mem _var6MemObjRedo_0 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(bool), NULL , &ret);
_var6MemObjRedo_0s[deviceIter] = _var6MemObjRedo_0;
cl_mem _var6MemObjRedo_1 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(bool), NULL , &ret);
_var6MemObjRedo_1s[deviceIter] = _var6MemObjRedo_1;
cl_mem _var6MemObjIsProfilingIter_0 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(bool), NULL , &ret);
_var6MemObjIsProfilingIter_0s[deviceIter] = _var6MemObjIsProfilingIter_0;
cl_mem _var6MemObjIsProfilingIter_1 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(bool), NULL , &ret);
_var6MemObjIsProfilingIter_1s[deviceIter] = _var6MemObjIsProfilingIter_1;
cl_mem _var6MemObjInteractionCurrent_0 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(int), NULL , &ret);
_var6MemObjInteractionCurrent_0s[deviceIter] = _var6MemObjInteractionCurrent_0;
cl_mem _var6MemObjInteractionCurrent_1 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(int), NULL , &ret);
_var6MemObjInteractionCurrent_1s[deviceIter] = _var6MemObjInteractionCurrent_1;
cl_mem _var6MemObjInteractionLast_0 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(int), NULL , &ret);
_var6MemObjInteractionLast_0s[deviceIter] = _var6MemObjInteractionLast_0;
cl_mem _var6MemObjInteractionLast_1 = clCreateBuffer(context, CL_MEM_READ_WRITE, sizeof(int), NULL , &ret);
_var6MemObjInteractionLast_1s[deviceIter] = _var6MemObjInteractionLast_1;
ret = clSetKernelArg(kernel_Point_0, 0, sizeof(cl_mem), &_var6MemObj_Point);
ret |= clSetKernelArg(kernel_Point_0, 1, sizeof(cl_mem), &_var6MemObjDbuf_Point);
ret |= clSetKernelArg(kernel_Point_0, 2, sizeof(cl_mem), &_var6MemObjLen_Point);
ret |= clSetKernelArg(kernel_Point_0, 3, sizeof(cl_mem), &_var6MemObjEnv_Point);
ret |= clSetKernelArg(kernel_Point_0, 4, sizeof(cl_mem), &_var6MemObjRng_Point);
ret |= clSetKernelArg(kernel_Point_0, 5, sizeof(cl_mem), &_var6MemObjInteractionCurrent_0);
ret |= clSetKernelArg(kernel_Point_0, 6, sizeof(cl_mem), &_var6MemObjIsProfilingIter_0);
ret = clSetKernelArg(kernel_Point_1, 0, sizeof(cl_mem), &_var6MemObj_Point);
ret |= clSetKernelArg(kernel_Point_1, 1, sizeof(cl_mem), &_var6MemObjDbuf_Point);
ret |= clSetKernelArg(kernel_Point_1, 2, sizeof(cl_mem), &_var6MemObjLen_Point);
ret |= clSetKernelArg(kernel_Point_1, 3, sizeof(cl_mem), &_var6MemObjEnv_Point);
ret |= clSetKernelArg(kernel_Point_1, 4, sizeof(cl_mem), &_var6MemObjRng_Point);
ret |= clSetKernelArg(kernel_Point_1, 5, sizeof(cl_mem), &_var6MemObjInteractionCurrent_1);
ret |= clSetKernelArg(kernel_Point_1, 6, sizeof(cl_mem), &_var6MemObjIsProfilingIter_1);
ret = clSetKernelArg(upenv_kernel_Point, 0, sizeof(cl_mem), &_var6MemObj_Point);
ret |= clSetKernelArg(upenv_kernel_Point, 1, sizeof(cl_mem), &_var6MemObjLen_Point);
ret = clSetKernelArg(st_kernel_Point, 0, sizeof(cl_mem), &_var6MemObj_Point);
ret |= clSetKernelArg(st_kernel_Point, 1, sizeof(cl_mem), &_var6MemObjDbuf_Point);
ret |= clSetKernelArg(st_kernel_Point, 2, sizeof(cl_mem), &_var6MemObjLen_Point);
ret = clSetKernelArg(mem_kernel_Point, 0, sizeof(cl_mem), &_var6MemObj_Point);
ret |= clSetKernelArg(mem_kernel_Point, 1, sizeof(cl_mem), &_var6MemObjDbuf_Point);
ret |= clSetKernelArg(mem_kernel_Point, 2, sizeof(cl_mem), &_var6MemObjLen_Point);
ret |= clSetKernelArg(mem_kernel_Point, 3, sizeof(cl_mem), &_var6MemObjEnv_Point);
ret = clSetKernelArg(interaction_rate_kernel_0, 0, sizeof(cl_mem), &_var6MemObjInteractionCurrent_0);
ret |= clSetKernelArg(interaction_rate_kernel_0, 1, sizeof(cl_mem), &_var6MemObjInteractionLast_0);
ret |= clSetKernelArg(interaction_rate_kernel_0, 2, sizeof(cl_mem), &_var6MemObjRedo_0);
ret = clSetKernelArg(interaction_rate_kernel_1, 0, sizeof(cl_mem), &_var6MemObjInteractionCurrent_1);
ret |= clSetKernelArg(interaction_rate_kernel_1, 1, sizeof(cl_mem), &_var6MemObjInteractionLast_1);
ret |= clSetKernelArg(interaction_rate_kernel_1, 2, sizeof(cl_mem), &_var6MemObjRedo_1);
int tmp0 = 0;
ret = clEnqueueWriteBuffer(command_queue, _var6MemObj_Point, CL_TRUE, 0, _var6_Point, agents.agents_Point.values, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjDbuf_Point, CL_TRUE, 0, _var6_Point_dbuf, agents.agents_Point_dbuf.values, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjLen_Point, CL_TRUE, 0, sizeof(int), &agents.agents_Point.len, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjRng_Point, CL_TRUE, 0, sizeof(cl_uint2)*agents.agents_Point.len, rngState_Point, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjInteractionCurrent_0, CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjInteractionLast_0, CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjRedo_0, CL_TRUE, 0, sizeof(bool), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjInteractionCurrent_1, CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjInteractionLast_1, CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjRedo_1, CL_TRUE, 0, sizeof(bool), &tmp0, 0, NULL, NULL);
// bool tmp1 = 1;
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjIsProfilingIter_0, CL_TRUE, 0, sizeof(bool), &tmp0, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queue, _var6MemObjIsProfilingIter_1, CL_TRUE, 0, sizeof(bool), &tmp0, 0, NULL, NULL);
}
size_t localWorkSize = 128;
Point* _var9buff_Point0 = calloc(sizeof(Point), agents.agents_Point.len);
Point* _var9buff_Point1 = calloc(sizeof(Point), agents.agents_Point.len);
Point* _var9buffMerge_Point = calloc(sizeof(Point), agents.agents_Point.len);
env *_var9Env_Point = calloc(sizeof(env),13225);
size_t globalWorkSize_Point = roundWorkSizeUp(128, agents.agents_Point.len);
ret = clEnqueueNDRangeKernel(command_queues[0], upenv_kernel_Points[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
for (int length = 1; length < globalWorkSize_Point; length <<= 1)
for (int inc = length; inc > 0; inc >>= 1) {
int dir = length << 1;
clSetKernelArg(st_kernel_Points[0], 3, sizeof(int), &inc);
clSetKernelArg(st_kernel_Points[0], 4, sizeof(int), &dir);
clEnqueueNDRangeKernel(command_queues[0], st_kernel_Points[0], 1, NULL, &globalWorkSize_Point, NULL, 0, NULL, NULL);
clFinish(command_queues[0]);
}
ret |= clEnqueueNDRangeKernel(command_queues[0], mem_kernel_Points[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
clFinish(command_queues[0]);
clEnqueueReadBuffer(command_queues[0], _var6MemObj_Points[0], CL_TRUE, 0, _var6_Point, _var9buff_Point0, 0, NULL, NULL);
clEnqueueReadBuffer(command_queues[0], _var6MemObjEnv_Points[0], CL_TRUE, 0, sizeof(env)*13225, _var9Env_Point, 0, NULL, NULL);
clEnqueueWriteBuffer(command_queues[1], _var6MemObj_Points[1], CL_TRUE, 0, _var6_Point, _var9buff_Point0, 0, NULL, NULL);
clEnqueueWriteBuffer(command_queues[1], _var6MemObjEnv_Points[1], CL_TRUE, 0, sizeof(env)*13225, _var9Env_Point, 0, NULL, NULL);
int tmp0 = 0;
bool tmp1 = true;
size_t stlocalWorkSize = 1;
size_t stglobalWorkSize = 1;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_0s[0], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_0s[1], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjInteractionCurrent_0s[0], CL_FALSE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjInteractionCurrent_0s[1], CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
double stime = omp_get_wtime();
for (int _var10 = 0; _var10 < PROFILING_ITERATION; _var10++) {
ret = clEnqueueNDRangeKernel(command_queues[0], kernel_Point_0s[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
ret = clEnqueueNDRangeKernel(command_queues[1], kernel_Point_0s[1], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
}
clEnqueueNDRangeKernel(command_queues[0], interaction_rate_kernel_0s[0], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clEnqueueNDRangeKernel(command_queues[1], interaction_rate_kernel_0s[1], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clFinish(command_queues[0]);
double gtime = omp_get_wtime() - stime;
printf("GPU finishes %f seconds\n",gtime);
clFinish(command_queues[1]);
double ctime = omp_get_wtime() - stime;
printf("CPU finishes %f seconds\n",ctime);
int device_0 = -1;
int undevice_0 = -1;
if (gtime <= ( ctime - 0.001) ) {
printf("run step function 0 on GPU\n");
device_0 = 0;
undevice_0 = 1;
} else {
printf("run step function 0 on CPU\n");
device_0 = 1;
undevice_0 = 0;
}
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_1s[0], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_1s[1], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjInteractionCurrent_1s[0], CL_FALSE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjInteractionCurrent_1s[1], CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
stime = omp_get_wtime();
for (int _var10 = 0; _var10 < PROFILING_ITERATION; _var10++) {
ret = clEnqueueNDRangeKernel(command_queues[0], kernel_Point_1s[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
ret = clEnqueueNDRangeKernel(command_queues[1], kernel_Point_1s[1], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
}
clEnqueueNDRangeKernel(command_queues[0], interaction_rate_kernel_1s[0], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clEnqueueNDRangeKernel(command_queues[1], interaction_rate_kernel_1s[1], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clFinish(command_queues[0]);
gtime = omp_get_wtime() - stime;
printf("GPU finishes %f seconds\n",gtime);
clFinish(command_queues[1]);
ctime = omp_get_wtime() - stime;
printf("CPU finishes %f seconds\n",ctime);
int device_1 = -1;
int undevice_1 = -1;
if (gtime <= ( ctime - 0.001) ) {
printf("run step function 1 on GPU\n");
device_1 = 0;
undevice_1 = 1;
} else {
printf("run step function 1 on CPU\n");
device_1 = 1;
undevice_1 = 0;
}
tmp1 = false;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_0s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_1s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_0s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_1s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
bool redoProfiling0 = false;
bool redoProfiling1 = false;
int profilingStart0 = -1;
int profilingEnd0 = -1;
int profilingStart1 = -1;
int profilingEnd1 = -1;
bool interactionProfilePhase = false;
int interactionProfilePhaseEnd = -1;
double stime0 ;
double stime1 ;
for (int _var10 = 0; _var10 < num_timesteps; _var10++) {
if (_var10 % PROFILING_INTERVAL == 0) {
tmp0 = 0;
tmp1 = true;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_0s[0], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_0s[1], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_1s[0], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_1s[1], CL_FALSE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjInteractionCurrent_0s[0], CL_FALSE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjInteractionCurrent_0s[1], CL_FALSE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[0], _var6MemObjInteractionCurrent_1s[0], CL_FALSE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
ret |= clEnqueueWriteBuffer(command_queues[1], _var6MemObjInteractionCurrent_1s[1], CL_TRUE, 0, sizeof(int), &tmp0, 0, NULL, NULL);
interactionProfilePhaseEnd = _var10+PROFILING_ITERATION;
interactionProfilePhase = true;
}
if (interactionProfilePhase && _var10 == interactionProfilePhaseEnd){
clEnqueueNDRangeKernel(command_queues[device_0], interaction_rate_kernel_0s[device_0], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clEnqueueNDRangeKernel(command_queues[device_1], interaction_rate_kernel_1s[device_1], 1, NULL,
&stglobalWorkSize, &stlocalWorkSize, 0,
NULL, NULL);
clFinish(command_queues[device_0]);
clFinish(command_queues[device_1]);
ret = clEnqueueReadBuffer(command_queues[device_0], _var6MemObjRedo_0s[device_0], CL_TRUE, 0, sizeof(bool),
&redoProfiling0, 0, NULL, NULL);
ret = clEnqueueReadBuffer(command_queues[device_1], _var6MemObjRedo_1s[device_1], CL_TRUE, 0, sizeof(bool),
&redoProfiling1, 0, NULL, NULL);
if (redoProfiling0) {
profilingStart0 = _var10;
profilingEnd0 = _var10+PROFILING_ITERATION;
printf("Request to redo profiling for stepfunc 0 at iter %d for %d %d\n",_var10,profilingStart0,profilingEnd0);
stime0 = omp_get_wtime();
} else {
tmp1 = false;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_0s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_0s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
}
if (redoProfiling1) {
profilingStart1 = _var10;
profilingEnd1 = _var10+PROFILING_ITERATION;
printf("Request to redo profiling for stepfunc 1 at iter %d for %d %d\n",_var10,profilingStart1,profilingEnd1);
stime1 = omp_get_wtime();
} else {
tmp1 = false;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_1s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_1s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
}
interactionProfilePhaseEnd = -1;
interactionProfilePhase = false;
//else
// printf("No redo profiling for stepfunc 1 continue on %d\n",device_1);
}
// printf("%d %d %d\n", redoProfiling0,_var8,profilingEnd0);
if (redoProfiling0 && _var10 < profilingEnd0) {
// printf("Func 0 profiling %d\n",_var8);
ret = clEnqueueNDRangeKernel(command_queues[0], kernel_Point_0s[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
ret = clEnqueueNDRangeKernel(command_queues[1], kernel_Point_0s[1], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
if (!redoProfiling1) {
continue;
}
}
// printf("%d %d %d\n", redoProfiling1,_var8,profilingEnd1);
if (redoProfiling1 && _var10 < profilingEnd1) {
// printf("Func 1 profiling %d\n",_var8);
ret = clEnqueueNDRangeKernel(command_queues[0], kernel_Point_1s[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
ret |= clEnqueueNDRangeKernel(command_queues[1], kernel_Point_1s[1], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
continue;
}
if (_var10 == profilingEnd0) {
clFinish(command_queues[0]);
double gtime = omp_get_wtime() - stime0;
printf("GPU finishes %f seconds\n",gtime);
clFinish(command_queues[1]);
double ctime = omp_get_wtime() - stime0;
printf("CPU finishes %f seconds\n",ctime);
if (gtime <= ( ctime - 0.001) ) {
printf("run step function 0 on GPU\n");
device_0 = 0;
undevice_0 = 1;
} else {
printf("run step function 0 on CPU\n");
device_0 = 1;
undevice_0 = 0;
}
profilingEnd0==-1;
tmp1 = false;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_0s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_0s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
}
if (_var10 == profilingEnd1) {
clFinish(command_queues[0]);
double gtime = omp_get_wtime() - stime1;
printf("GPU finishes %f seconds\n",gtime);
clFinish(command_queues[1]);
double ctime = omp_get_wtime() - stime1;
printf("CPU finishes %f seconds\n",ctime);
if (gtime <= ( ctime - 0.001) ) {
printf("run step function 1 on GPU\n");
device_1 = 0;
undevice_1 = 1;
} else {
printf("run step function 1 on CPU\n");
device_1 = 1;
undevice_1 = 0;
}
profilingEnd1==-1;
tmp1 = false;
ret = clEnqueueWriteBuffer(command_queues[0], _var6MemObjIsProfilingIter_1s[0], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
ret = clEnqueueWriteBuffer(command_queues[1], _var6MemObjIsProfilingIter_1s[1], CL_TRUE, 0, sizeof(bool), &tmp1, 0, NULL, NULL);
}
ret = clEnqueueNDRangeKernel(command_queues[device_0], kernel_Point_0s[device_0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
ret |= clEnqueueNDRangeKernel(command_queues[device_1], kernel_Point_1s[device_1], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
printf("iter %d\n", _var10);
clFinish(command_queues[device_1]);
clFinish(command_queues[device_0]);
clEnqueueReadBuffer(command_queues[device_1], _var6MemObj_Points[device_1], CL_TRUE, 0, _var6_Point, _var9buff_Point1, 0, NULL, NULL);
clEnqueueReadBuffer(command_queues[device_0], _var6MemObj_Points[device_0], CL_TRUE, 0, _var6_Point, _var9buff_Point0, 0, NULL, NULL);
#pragma omp for schedule(static, 128)
for (int _var11 = 0; _var11 < agents.agents_Point.len; _var11++) {
Point *_agent = coexecution_merge_Point(&_var9buff_Point0[_var11], &_var9buff_Point1[_var11]);
_var9buffMerge_Point[_var11] = *_agent;
}
clEnqueueWriteBuffer(command_queues[0], _var6MemObj_Points[0], CL_TRUE, 0, _var6_Point, _var9buffMerge_Point, 0, NULL, NULL);
ret = clEnqueueNDRangeKernel(command_queues[0], upenv_kernel_Points[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
for (int length = 1; length < globalWorkSize_Point; length <<= 1)
for (int inc = length; inc > 0; inc >>= 1) {
int dir = length << 1;
clSetKernelArg(st_kernel_Points[0], 3, sizeof(int), &inc);
clSetKernelArg(st_kernel_Points[0], 4, sizeof(int), &dir);
clEnqueueNDRangeKernel(command_queues[0], st_kernel_Points[0], 1, NULL, &globalWorkSize_Point, NULL, 0, NULL, NULL);
clFinish(command_queues[0]);
}
ret |= clEnqueueNDRangeKernel(command_queues[0], mem_kernel_Points[0], 1, NULL, &globalWorkSize_Point, &localWorkSize, 0, NULL, NULL);
clFinish(command_queues[0]);
clEnqueueReadBuffer(command_queues[0], _var6MemObj_Points[0], CL_TRUE, 0, _var6_Point, _var9buff_Point0, 0, NULL, NULL);
clEnqueueReadBuffer(command_queues[0], _var6MemObjEnv_Points[0], CL_TRUE, 0, sizeof(env)*13225, _var9Env_Point, 0, NULL, NULL);
clEnqueueWriteBuffer(command_queues[1], _var6MemObj_Points[1], CL_TRUE, 0, _var6_Point, _var9buff_Point0, 0, NULL, NULL);
clEnqueueWriteBuffer(command_queues[1], _var6MemObjEnv_Points[1], CL_TRUE, 0, sizeof(env)*13225, _var9Env_Point, 0, NULL, NULL);
}
ret = clEnqueueReadBuffer(command_queues[0], _var6MemObj_Points[0], CL_TRUE, 0, _var6_Point, agents.agents_Point.values, 0, NULL, NULL);
wtime = omp_get_wtime() - wtime;
printf("Time elapsed is %f seconds\n", wtime);
return 0;
}
|
Par-20-ParallelForCallFuncParallelFor.c |
int foo(int *A, int l) {
#pragma omp parallel for
for (int j=0; j < l; ++j) {
A[j] = 3 * A[j];
}
return l;
}
int main(int argc, char **argv) {
int a[4] = {1,2,3,4};
int b[4] = {0, 0, 0, 0};
#pragma omp parallel
{
#pragma omp for
for (int i = 0; i < 4; ++i) {
b[i] = foo(a, 4);
}
}
return 0;
}
|
ssyrk.c | #include "blas.h"
#include "error.h"
#include <stdio.h>
#include "handle.h"
#include "config.h"
#include "ssyrk.fatbin.c"
static inline size_t min(size_t a, size_t b) { return (a < b) ? a : b; }
static inline size_t max(size_t a, size_t b) { return (a > b) ? a : b; }
static inline CUresult cuMemcpyHtoD2DAsync(CUdeviceptr A, size_t lda, size_t ai, size_t aj,
const void * B, size_t ldb, size_t bi, size_t bj,
size_t m, size_t n, size_t elemSize, CUstream stream) {
CUDA_MEMCPY2D copy = {
bi * elemSize, bj, CU_MEMORYTYPE_HOST, B, 0, 0, ldb * elemSize,
ai * elemSize, aj, CU_MEMORYTYPE_DEVICE, NULL, A, 0, lda * elemSize,
m * elemSize, n };
return cuMemcpy2DAsync(©, stream);
}
static inline CUresult cuMemcpyDtoH2DAsync(void * A, size_t lda, size_t ai, size_t aj,
CUdeviceptr B, size_t ldb, size_t bi, size_t bj,
size_t m, size_t n, size_t elemSize, CUstream stream) {
CUDA_MEMCPY2D copy = {
bi * elemSize, bj, CU_MEMORYTYPE_DEVICE, NULL, B, 0, ldb * elemSize,
ai * elemSize, aj, CU_MEMORYTYPE_HOST, A, 0, 0, lda * elemSize,
m * elemSize, n };
return cuMemcpy2DAsync(©, stream);
}
static const float zero = 0.0f;
static const float one = 1.0f;
void ssyrk(CBlasUplo uplo, CBlasTranspose trans,
size_t n, size_t k,
float alpha, const float * restrict A, size_t lda,
float beta, float * restrict C, size_t ldc) {
const size_t nRowA = (trans == CBlasNoTrans) ? n : k;
int info = 0;
if (lda < nRowA)
info = 7;
else if (ldc < n)
info = 10;
if (info != 0) {
XERBLA(info);
return;
}
if (n == 0 || ((alpha == zero || k == 0) && beta == one))
return;
if (alpha == zero) {
if (uplo == CBlasUpper) {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] = zero;
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] *= beta;
}
}
}
else {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] = zero;
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] *= beta;
}
}
}
return;
}
if (trans == CBlasNoTrans) {
if (uplo == CBlasUpper) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
if (beta == zero) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] = zero;
}
else if (beta != one) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] *= beta;
}
for (size_t l = 0; l < k; l++) {
if (A[l * lda + j] != zero) {
register float temp = alpha * A[l * lda + j];
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] += temp * A[l * lda + i];
}
}
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
if (beta == zero) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] = zero;
}
else if (beta != one) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] *= beta;
}
for (size_t l = 0; l < k; l++) {
if (A[l * lda + j] != zero) {
register float temp = alpha * A[l * lda + j];
for (size_t i = j; i < n; i++)
C[j * ldc + i] += temp * A[l * lda + i];
}
}
}
}
}
else {
if (uplo == CBlasUpper) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i <= j; i++) {
register float temp = zero;
for (size_t l = 0; l < k; l++)
temp += A[i * lda + l] * A[j * lda + l];
if (beta == zero)
C[j * ldc + i] = alpha * temp;
else
C[j * ldc + i] = alpha * temp + beta * C[j * ldc + i];
}
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = j; i < n; i++) {
register float temp = zero;
for (size_t l = 0; l < k; l++)
temp += A[i * lda + l] * A[j * lda + l];
if (beta == zero)
C[j * ldc + i] = alpha * temp;
else
C[j * ldc + i] = alpha * temp + beta * C[j * ldc + i];
}
}
}
}
}
CUresult cuSsyrk(CUBLAShandle handle, CBlasUplo uplo, CBlasTranspose trans,
size_t n, size_t k,
float alpha, CUdeviceptr A, size_t lda,
float beta, CUdeviceptr C, size_t ldc, CUstream stream) {
const size_t nRowA = (trans == CBlasNoTrans) ? n : k;
int info = 0;
if (lda < nRowA)
info = 7;
else if (ldc < n)
info = 10;
if (info != 0) {
XERBLA(info);
return CUDA_ERROR_INVALID_VALUE;
}
if (n == 0 || ((alpha == zero || k == 0) && beta == one))
return CUDA_SUCCESS;
CU_ERROR_CHECK(cuCtxPushCurrent(handle->context));
if (handle->ssyrk == NULL)
CU_ERROR_CHECK(cuModuleLoadData(&handle->ssyrk, imageBytes));
const unsigned int mb = (trans == CBlasNoTrans) ? 64 : 32;
const unsigned int nb = (trans == CBlasNoTrans) ? 16 : 32;
const unsigned int kb = (trans == CBlasNoTrans) ? 16 : 8;
const unsigned int bx = (trans == CBlasNoTrans) ? 16 : 8;
const unsigned int by = (trans == CBlasNoTrans) ? 4 : 8;
char name[82];
snprintf(name, 82,
"_Z5ssyrkIL9CBlasUplo%dEL14CBlasTranspose%dELj%uELj%uELj%uELj%uELj%uEEvPKfPfffiiii",
uplo, trans, mb, nb, kb, bx, by);
CUfunction function;
CU_ERROR_CHECK(cuModuleGetFunction(&function, handle->ssyrk, name));
void * params[] = { &A, &C, &alpha, &beta, &lda, &ldc, &n, &k };
// unsigned int blocks = (unsigned int)(n + nb - 1) / nb;
// blocks = (blocks * (blocks + 1)) / 2;
CU_ERROR_CHECK(cuLaunchKernel(function, (unsigned int)(n + mb - 1) / mb, (unsigned int)(n + nb - 1) / nb, 1,
bx, by, 1, 0, stream, params, NULL));
CU_ERROR_CHECK(cuCtxPopCurrent(&handle->context));
return CUDA_SUCCESS;
}
CUresult cuMultiGPUSsyrk(CUmultiGPUBLAShandle handle,
CBlasUplo uplo, CBlasTranspose trans,
size_t n, size_t k,
float alpha, const float * restrict A, size_t lda,
float beta, float * restrict C, size_t ldc) {
const size_t nRowA = (trans == CBlasNoTrans) ? n : k;
int info = 0;
if (lda < nRowA)
info = 7;
else if (ldc < n)
info = 10;
if (info != 0) {
XERBLA(info);
return CUDA_ERROR_INVALID_VALUE;
}
if (n == 0 || ((alpha == zero || k == 0) && beta == one))
return CUDA_SUCCESS;
if (alpha == zero) {
if (uplo == CBlasUpper) {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] = zero;
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = 0; i <= j; i++)
C[j * ldc + i] *= beta;
}
}
}
else {
if (beta == zero) {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] = zero;
}
}
else {
#pragma omp parallel for
for (size_t j = 0; j < n; j++) {
for (size_t i = j; i < n; i++)
C[j * ldc + i] *= beta;
}
}
}
return CUDA_SUCCESS;
}
const size_t nb = (trans == CBlasNoTrans) ? SGEMM_N_MB : SGEMM_T_NB;
if (n < nb) {
ssyrk(uplo, trans, n, k, alpha, A, lda, beta, C, ldc);
return CUDA_SUCCESS;
}
if (trans == CBlasNoTrans) {
if (uplo == CBlasUpper) {
for (size_t j = nb; j < n; j += nb)
CU_ERROR_CHECK(cuMultiGPUSgemm(handle, CBlasNoTrans, CBlasTrans, j, min(n - j, nb), k, alpha, A, lda, &A[j], lda, beta, &C[j * ldc], ldc));
}
else {
const size_t m = n - nb;
for (size_t j = 0; j < m; j += nb) {
const size_t jb = min(n - j, nb);
CU_ERROR_CHECK(cuMultiGPUSgemm(handle, CBlasNoTrans, CBlasTrans, n - j - jb, jb, k, alpha, &A[j + jb], lda, &A[j], lda, beta, &C[j * ldc + j + jb], ldc));
}
}
for (size_t j = 0; j < n; j += nb)
ssyrk(uplo, trans, min(n - j, nb), k, alpha, &A[j], lda, beta, &C[j * ldc + j], ldc);
}
else {
if (uplo == CBlasUpper) {
for (size_t j = nb; j < n; j += nb)
CU_ERROR_CHECK(cuMultiGPUSgemm(handle, CBlasTrans, CBlasNoTrans, j, min(n - j, nb), k, alpha, A, lda, &A[j * lda], lda, beta, &C[j * ldc], ldc));
}
else {
const size_t m = n - nb;
for (size_t j = 0; j < m; j += nb) {
const size_t jb = min(n - j, nb);
CU_ERROR_CHECK(cuMultiGPUSgemm(handle, CBlasTrans, CBlasNoTrans, n - j - jb, jb, k, alpha, &A[(j + jb) * lda], lda, &A[j * lda], lda, beta, &C[j * ldc + j + jb], ldc));
}
}
for (size_t j = 0; j < n; j += nb)
ssyrk(uplo, trans, min(n - j, nb), k, alpha, &A[j * lda], lda, beta, &C[j * ldc + j], ldc);
}
return CUDA_SUCCESS;
}
|
chlpca.h | /*
#
# File : chlpca.cpp
# ( C++ source file )
#
# Description : Example of use for the CImg plugin 'plugins/chlpca.h'.
# This file is a part of the CImg Library project.
# ( http://cimg.eu )
#
# Copyright : Jerome Boulanger
# ( http://www.irisa.fr/vista/Equipe/People/Jerome.Boulanger.html )
#
#
# License : CeCILL v2.0
# ( http://www.cecill.info/licences/Licence_CeCILL_V2-en.html )
#
# This software is governed by the CeCILL license under French law and
# abiding by the rules of distribution of free software. You can use,
# modify and/ or redistribute the software under the terms of the CeCILL
# license as circulated by CEA, CNRS and INRIA at the following URL
# "http://www.cecill.info".
#
# As a counterpart to the access to the source code and rights to copy,
# modify and redistribute granted by the license, users are provided only
# with a limited warranty and the software's author, the holder of the
# economic rights, and the successive licensors have only limited
# liability.
#
# In this respect, the user's attention is drawn to the risks associated
# with loading, using, modifying and/or developing or reproducing the
# software by the user in light of its specific status of free software,
# that may mean that it is complicated to manipulate, and that also
# therefore means that it is reserved for developers and experienced
# professionals having in-depth computer knowledge. Users are therefore
# encouraged to load and test the software's suitability as regards their
# requirements in conditions enabling the security of their systems and/or
# data to be ensured and, more generally, to use and operate it in the
# same conditions as regards security.
#
# The fact that you are presently reading this means that you have had
# knowledge of the CeCILL license and that you accept its terms.
#
*/
#ifndef cimg_plugin_chlpca
#define cimg_plugin_chlpca
// Define some useful macros.
//! Some loops
#define cimg_for_step1(bound,i,step) for (int i = 0; i<(int)(bound); i+=step)
#define cimg_for_stepX(img,x,step) cimg_for_step1((img)._width,x,step)
#define cimg_for_stepY(img,y,step) cimg_for_step1((img)._height,y,step)
#define cimg_for_stepZ(img,z,step) cimg_for_step1((img)._depth,z,step)
#define cimg_for_stepXY(img,x,y,step) cimg_for_stepY(img,y,step) cimg_for_stepX(img,x,step)
#define cimg_for_stepXYZ(img,x,y,step) cimg_for_stepZ(img,z,step) cimg_for_stepY(img,y,step) cimg_for_stepX(img,x,step)
//! Loop for point J(xj,yj) in the neighborhood of a point I(xi,yi) of size (2*rx+1,2*ry+1)
/**
Point J is kept inside the boundaries of the image img.
example of summing the pixels values in a neighborhood 11x11
cimg_forXY(img,xi,yi) cimg_for_windowXY(img,xi,yi,xj,yj,5,5) dest(yi,yi) += src(xj,yj);
**/
#define cimg_forXY_window(img,xi,yi,xj,yj,rx,ry) \
for (int yi0 = std::max(0,yi-ry), yi1=std::min(yi + ry,(int)img.height() - 1), yj=yi0;yj<=yi1;++yj) \
for (int xi0 = std::max(0,xi-rx), xi1=std::min(xi + rx,(int)img.width() - 1), xj=xi0;xj<=xi1;++xj)
#define cimg_forXYZ_window(img,xi,yi,zi,xj,yj,zj,rx,ry,rz) \
for (int zi0 = std::max(0,zi-rz), zi1=std::min(zi + rz,(int)img.depth() - 1) , zj=zi0;zj<=zi1;++zj) \
for (int yi0 = std::max(0,yi-ry), yi1=std::min(yi + ry,(int)img.height() - 1), yj=yi0;yj<=yi1;++yj) \
for (int xi0 = std::max(0,xi-rx), xi1=std::min(xi + rx,(int)img.width() - 1) , xj=xi0;xj<=xi1;++xj)
//! Crop a patch in the image around position x,y,z and return a column vector
/**
\param x x-coordinate of the center of the patch
\param y y-coordinate of the center of the patch
\param z z-coordinate of the center of the patch
\param px the patch half width
\param px the patch half height
\param px the patch half depth
\return img.get_crop(x0,y0,z0,x1,y1,z1).unroll('y');
**/
CImg<T> get_patch(int x, int y, int z,
int px, int py, int pz) const {
if (depth() == 1){
const int x0 = x - px, y0 = y - py, x1 = x + px, y1 = y + py;
return get_crop(x0, y0, x1, y1).unroll('y');
} else {
const int
x0 = x - px, y0 = y - py, z0 = z - pz,
x1 = x + px, y1 = y + py, z1 = z + pz;
return get_crop(x0, y0, z0, x1, y1, z1).unroll('y');
}
}
//! Extract a local patch dictionnary around point xi,yi,zi
CImg<T> get_patch_dictionnary(const int xi, const int yi, const int zi,
const int px, const int py, const int pz,
const int wx, const int wy, const int wz,
int & idc) const {
const int
n = (2*wx + 1) * (2*wy + 1) * (2 * (depth()==1?0:wz) + 1),
d = (2*px + 1) * (2*py + 1) * (2 * (depth()==1?0:px) + 1) * spectrum();
CImg<> S(n, d);
int idx = 0;
if (depth() == 1) {
cimg_forXY_window((*this), xi, yi, xj, yj, wx, wy){
CImg<T> patch = get_patch(xj, yj, 0, px, py, 1);
cimg_forY(S,y) S(idx,y) = patch(y);
if (xj==xi && yj==yi) idc = idx;
idx++;
}
} else {
cimg_forXYZ_window((*this), xi,yi,zi,xj,yj,zj,wx,wy,wz){
CImg<T> patch = get_patch(xj, yj, zj, px, py, pz);
cimg_forY(S,y) S(idx,y) = patch(y);
if (xj==xi && yj==yi && zj==zi) idc = idx;
idx++;
}
}
S.columns(0, idx - 1);
return S;
}
//! Add a patch to the image
/**
\param x x-coordinate of the center of the patch
\param y y-coordinate of the center of the patch
\param z z-coordinate of the center of the patch
\param img the patch as a 1D column vector
\param px the patch half width
\param px the patch half height
\param px the patch half depth
**/
CImg<T> & add_patch(const int xi, const int yi, const int zi,
const CImg<T> & patch,
const int px, const int py, const int pz) {
const int
x0 = xi - px, y0 = yi - py, z0 = (depth() == 1 ? 0 : zi - pz),
sx = 2 * px + 1, sy = 2 * py + 1, sz = (depth() == 1 ? 1 : 2 * pz +1);
draw_image(x0, y0, z0, 0, patch.get_resize(sx, sy, sz, spectrum(), -1), -1);
return (*this);
}
//! Add a constant patch to the image
/**
\param x x-coordinate of the center of the patch
\param y y-coordinate of the center of the patch
\param z z-coordinate of the center of the patch
\param value in the patch
\param px the patch half width
\param px the patch half height
\param px the patch half depth
**/
CImg<T> & add_patch(const int xi, const int yi, const int zi, const T value,
const int px, const int py, const int pz) {
const int
x0 = xi - px, y0 = yi - py, z0 = (depth() == 1 ? 0 : zi - pz),
x1 = xi + px, y1 = yi + py, z1 = (depth() == 1 ? 0 : zi + pz);
draw_rectangle(x0, y0, z0, 0, x1, y1, z1, spectrum()-1, value, -1);
return (*this);
}
//! CHLPCA denoising from the PhD thesis of Hu Haijuan
/**
\param px the patch half width
\param py the patch half height
\param pz the patch half depth
\param wx the training region half width
\param wy the training region half height
\param wz the training region half depth
\param nstep the subsampling of the image domain
\param nsim the number of patches used for training as a factor of the patch size
\param lambda_min the threshold on the eigen values of the PCA for dimension reduction
\param threshold the threshold on the value of the coefficients
\param pca_use_svd if true use the svd approach to perform the pca otherwise use the covariance method
\note please cite the PhD thesis of Hu Haijuan http://www.univ-ubs.fr/soutenance-de-these-hu-haijuan-337653.kjsp?RH=1318498222799
**/
CImg<T> get_chlpca(const int px, const int py, const int pz,
const int wx, const int wy, const int wz,
const int nstep, const float nsim,
const float lambda_min, const float threshold,
const float noise_std, const bool pca_use_svd) const {
const int
nd = (2*px + 1) * (2*py + 1) * (depth()==1?1:2*pz + 1) * spectrum(),
K = (int)(nsim * nd);
#ifdef DEBUG
fprintf(stderr,"chlpca: p:%dx%dx%d,w:%dx%dx%d,nd:%d,K:%d\n",
2*px + 1,2*py + 1,2*pz + 1,2*wx + 1,2*wy + 1,2*wz + 1,nd,K);
#endif
float sigma;
if (noise_std<0) sigma = (float)std::sqrt(variance_noise());
else sigma = noise_std;
CImg<T> dest(*this), count(*this);
dest.fill(0);
count.fill(0);
cimg_for_stepZ(*this,zi,(depth()==1||pz==0)?1:nstep){
#ifdef cimg_use_openmp
#pragma omp parallel for
#endif
cimg_for_stepXY((*this),xi,yi,nstep){
// extract the training region X
int idc = 0;
CImg<T> S = get_patch_dictionnary(xi,yi,zi,px,py,pz,wx,wy,wz,idc);
// select the K most similar patches within the training set
CImg<T> Sk(S);
CImg<unsigned int> index(S.width());
if (K < Sk.width() - 1){
CImg<T> mse(S.width());
CImg<unsigned int> perms;
cimg_forX(S,x) { mse(x) = (T)S.get_column(idc).MSE(S.get_column(x)); }
mse.sort(perms,true);
cimg_foroff(perms,i) {
cimg_forY(S,j) Sk(i,j) = S(perms(i),j);
index(perms(i)) = i;
}
Sk.columns(0, K);
perms.threshold(K);
} else {
cimg_foroff(index,i) index(i)=i;
}
// centering the patches
CImg<T> M(1, Sk.height(), 1, 1, 0);
cimg_forXY(Sk,x,y) { M(y) += Sk(x,y); }
M /= (T)Sk.width();
cimg_forXY(Sk,x,y) { Sk(x,y) -= M(y); }
// compute the principal component of the training set S
CImg<T> P, lambda;
if (pca_use_svd) {
CImg<T> V;
Sk.get_transpose().SVD(V,lambda,P,true,100);
} else {
(Sk * Sk.get_transpose()).symmetric_eigen(lambda, P);
lambda.sqrt();
}
// dimension reduction
int s = 0;
const T tx = (T)(std::sqrt((double)Sk.width()-1.0) * lambda_min * sigma);
while((lambda(s) > tx) && (s < ((int)lambda.size() - 1))) { s++; }
P.columns(0,s);
// project all the patches on the basis (compute scalar product)
Sk = P.get_transpose() * Sk;
// threshold the coefficients
if (threshold > 0) { Sk.threshold(threshold, 1); }
// project back to pixel space
Sk = P * Sk;
// recenter the patches
cimg_forXY(Sk,x,y) { Sk(x,y) += M(y); }
int j = 0;
cimg_forXYZ_window((*this),xi,yi,zi,xj,yj,zj,wx,wy,wz){
const int id = index(j);
if (id < Sk.width()) {
dest.add_patch(xj, yj, zj, Sk.get_column(id), px, py, pz);
count.add_patch(xj, yj, zj, (T)1, px, py, pz);
}
j++;
}
}
}
cimg_foroff(dest, i) {
if(count(i) != 0) { dest(i) /= count(i); }
else { dest(i) = (*this)(i); }
}
return dest;
}
//! CHLPCA denoising from the PhD thesis of Hu Haijuan
/**
\param px the patch half width
\param px the patch half height
\param px the patch half depth
\param wx the training region half width
\param wy the training region half height
\param wz the training region half depth
\param nstep the subsampling of the image domain
\param nsim the number of patches used for training as a factor of the patch size
\param lambda_min the threshold on the eigen values of the PCA for dimension reduction
\param threshold the threshold on the value of the coefficients
\param pca_use_svd if true use the svd approach to perform the pca otherwise use the covariance method
\note please cite the PhD thesis of Hu Haijuan http://www.univ-ubs.fr/soutenance-de-these-hu-haijuan-337653.kjsp?RH=1318498222799
**/
CImg<T> & chlpca(const int px, const int py, const int pz,
const int wx, const int wy, const int wz,
const int nstep, const float nsim,
const float lambda_min, const float threshold,
const float noise_std, const bool pca_use_svd) {
(*this) = get_chlpca(px, py, pz, wx, wy, wz, nstep, nsim, lambda_min,
threshold, noise_std, pca_use_svd);
return (*this);
}
//! CHLPCA denoising from the PhD thesis of Hu Haijuan
/**
\param p the patch half size
\param w the training region half size
\param nstep the subsampling of the image domain
\param nsim the number of patches used for training as a factor of the patch size
\param lambda_min the threshold on the eigen values of the PCA for dimension reduction
\param threshold the threshold on the value of the coefficients
\param pca_use_svd if true use the svd approach to perform the pca otherwise use the covariance method
\note please cite the PhD thesis of Hu Haijuan http://www.univ-ubs.fr/soutenance-de-these-hu-haijuan-337653.kjsp?RH=1318498222799
**/
CImg<T> get_chlpca(const int p=3, const int w=10,
const int nstep=5, const float nsim=10,
const float lambda_min=2, const float threshold = -1,
const float noise_std=-1, const bool pca_use_svd=true) const {
if (depth()==1) return get_chlpca(p, p, 0, w, w, 0, nstep, nsim, lambda_min,
threshold, noise_std, pca_use_svd);
else return get_chlpca(p, p, p, w, w, w, nstep, nsim, lambda_min,
threshold, noise_std, pca_use_svd);
}
CImg<T> chlpca(const int p=3, const int w=10,
const int nstep=5, const float nsim=10,
const float lambda_min=2, const float threshold = -1,
const float noise_std=-1, const bool pca_use_svd=true) {
(*this) = get_chlpca(p, w, nstep, nsim, lambda_min,
threshold, noise_std, pca_use_svd);
return (*this);
}
#endif /* cimg_plugin_chlpca */
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.