view example/flip/twice.cl @ 1621:f907bbac14f2 draft

Implement Boyer-Moore String Search Algorithm.(But incomplete divided file point)
author Masa <e085726@ie.u-ryukyu.ac.jp>
date Tue, 21 May 2013 17:03:53 +0900
parents 61164c687b29
children 273de551f726
line wrap: on
line source

__kernel void
twice(__constant int *data_count,
      __global int *input_data)
      //      __global int *output_data)
{
    long count = (long)data_count[0];
    for (int i = 0; i<count; i++) {
        // output_data[i] = 2*input_data[i];
        input_data[i] *= 2;
    }

}