⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 vect-61.c

📁 linux下编程用 编译软件
💻 C
字号:
/* { dg-require-effective-target vect_int } *//* { dg-require-effective-target vect_float } */#include <stdarg.h>#include "tree-vect.h"#define N 256void bar (float *pa, float *pb, float *pc){  int i;  /* check results:  */  for (i = 0; i < N/2; i++)    {      if (pa[i] != (pb[i+1] * pc[i+1]))	abort ();    }  return;}/* Unaligned pointer read accesses with known alignment,   and an unaligned write access with unknown alignment.   The loop bound is iunknown.   Can't prove that the pointers don't alias.   vect-57.c is similar to this one with one difference:        the loop bound is known.   vect-60.c is similar to this one with two differences:        aliasing is not a problem, and the write access is unaligned.  */intmain1 (int n , float *pa){  int i;  float b[N] __attribute__ ((__aligned__(16))) = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,48,51,54,57};  float c[N] __attribute__ ((__aligned__(16))) = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19};  float *pb = b;  float *pc = c;  for (i = 0; i < n/2; i++)    {      pa[i] = pb[i+1] * pc[i+1];    }  bar (pa,pb,pc);  return 0;}int main (void){  int i;  int n=N;  float a[N] __attribute__ ((__aligned__(16)));  check_vect ();  main1 (n,a);  return 0;}/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail *-*-* } } } *//* { dg-final { cleanup-tree-dump "vect" } } */

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -