| skipped 52 lines |
53 | 53 | | } |
54 | 54 | | } |
55 | 55 | | |
56 | | - | __kernel void log_lstat(__global uchar *log, __local uchar *output, __global uchar *storage){ |
57 | | - | uchar *input = log[g_id]; |
58 | | - | output[l_id] = input; |
59 | | - | barrier(CLK_LOCAL_MEM_FENCE); // just to be safe |
60 | | - | |
61 | | - | int i; |
62 | | - | uchar **store; |
63 | | - | |
64 | | - | if(l_id == 0){ |
65 | | - | for(i = 0; i < l_size; i++){ |
66 | | - | store += output[i]; |
67 | | - | } |
68 | | - | storage[gr_id] += store; |
69 | | - | } |
70 | | - | } |
71 | | - | |
72 | | - | __kernel void log_lstat64(__global uchar *log, __local uchar *output, __global uchar *storage){ |
73 | | - | uchar *input = log[g_id]; |
74 | | - | output[l_id] = input; |
75 | | - | barrier(CLK_LOCAL_MEM_FENCE); // just to be safe |
76 | | - | |
77 | | - | int i; |
78 | | - | uchar **store; |
79 | | - | |
80 | | - | if(l_id == 0){ |
81 | | - | for(i = 0; i < l_size; i++){ |
82 | | - | store += output[i]; |
83 | | - | } |
84 | | - | storage[gr_id] += store; |
85 | | - | } |
86 | | - | } |
87 | | - | |
88 | 56 | | __kernel void log_creat(__global uchar *log, __local uchar *output, __global uchar *storage){ |
89 | 57 | | uchar *input = log[g_id]; |
90 | 58 | | output[l_id] = input; |
| skipped 9 lines |
100 | 68 | | storage[gr_id] += store; |
101 | 69 | | } |
102 | 70 | | } |
103 | | - | |
104 | | - | __kernel void log_execve(__global uchar *log, __local uchar *output, __global uchar *storage){ |
105 | | - | uchar *input = log[g_id]; |
106 | | - | output[l_id] = input; |
107 | | - | barrier(CLK_LOCAL_MEM_FENCE); // just to be safe |
108 | | - | |
109 | | - | int i; |
110 | | - | uchar **store; |
111 | | - | |
112 | | - | if(l_id == 0){ |
113 | | - | for(i = 0; i < l_size; i++){ |
114 | | - | store += output[i]; |
115 | | - | } |
116 | | - | storage[gr_id] += store; |
117 | | - | } |
118 | | - | } |
119 | | - | |
120 | | - | __kernel void log_open(__global uchar *log, __local uchar *output, __global uchar *storage){ |
121 | | - | uchar *input = log[g_id]; |
122 | | - | output[l_id] = input; |
123 | | - | barrier(CLK_LOCAL_MEM_FENCE); // just to be safe |
124 | | - | |
125 | | - | int i; |
126 | | - | uchar **store; |
127 | | - | |
128 | | - | if(l_id == 0){ |
129 | | - | for(i = 0; i < l_size; i++){ |
130 | | - | store += output[i]; |
131 | | - | } |
132 | | - | storage[gr_id] += store; |
133 | | - | } |
134 | | - | } |
135 | | - | |