aboutsummaryrefslogtreecommitdiffstats
path: root/tools/perf/scripts/python/syscall-counts.py
diff options
context:
space:
mode:
authorJean-François Moine <moinejf@free.fr>2011-05-17 02:56:09 -0400
committerMauro Carvalho Chehab <mchehab@redhat.com>2011-05-21 08:32:39 -0400
commitf7242d30034da3f2937fbe9eb3d17355bbff58d1 (patch)
tree0409e787332e0a07d77494e427212077061c673d /tools/perf/scripts/python/syscall-counts.py
parentcc90b15eb27696a5fa237897deb2fc83a1e003f1 (diff)
[media] gspca - kinect: Remove __devinitdata
__devinit* must not be used in USB drivers. Signed-off-by: Jean-François Moine <moinejf@free.fr> Signed-off-by: Mauro Carvalho Chehab <mchehab@redhat.com>
Diffstat (limited to 'tools/perf/scripts/python/syscall-counts.py')
0 files changed, 0 insertions, 0 deletions
git/cgit.cgi/litmus-rt-pandaboard.git/commit/lib/ts_bm.c?id=3f330317ab4973178423aba750d6d0ca5ce0024a'>3f330317ab4
3b76d08190e
8082e4ed0a6
3f330317ab4
8082e4ed0a6

3ffaa8c7c0f
3b76d08190e
3ffaa8c7c0f
3b76d08190e



8082e4ed0a6


8082e4ed0a6


3f330317ab4





8082e4ed0a6



3b76d08190e
8082e4ed0a6


3b76d08190e
8082e4ed0a6






3b76d08190e
8082e4ed0a6


3b76d08190e





8082e4ed0a6







































1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207




































                                                                             



                         
                        























                                                                           
                                       
                                                     










                                                                              


                                                                       
















                                                                                

















                                                           
                                                           
 
                    

                                   
                                              
                                              
                                                                   



                                                              


                                                                    


                                               





                                                                   



                                                                       
                                                           


                               
              






                                                                 
                            


                                                             





                                                                     







































                                                              
/*
 * lib/ts_bm.c		Boyer-Moore text search implementation
 *
 *		This program 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
 *		2 of the License, or (at your option) any later version.
 *
 * Authors:	Pablo Neira Ayuso <pablo@eurodev.net>
 *
 * ==========================================================================
 * 
 *   Implements Boyer-Moore string matching algorithm:
 *
 *   [1] A Fast String Searching Algorithm, R.S. Boyer and Moore.
 *       Communications of the Association for Computing Machinery, 
 *       20(10), 1977, pp. 762-772.
 *       http://www.cs.utexas.edu/users/moore/publications/fstrpos.pdf
 *
 *   [2] Handbook of Exact String Matching Algorithms, Thierry Lecroq, 2004
 *       http://www-igm.univ-mlv.fr/~lecroq/string/string.pdf
 *
 *   Note: Since Boyer-Moore (BM) performs searches for matchings from right 
 *   to left, it's still possible that a matching could be spread over 
 *   multiple blocks, in that case this algorithm won't find any coincidence.
 *   
 *   If you're willing to ensure that such thing won't ever happen, use the
 *   Knuth-Pratt-Morris (KMP) implementation instead. In conclusion, choose 
 *   the proper string search algorithm depending on your setting. 
 *
 *   Say you're using the textsearch infrastructure for filtering, NIDS or 
 *   any similar security focused purpose, then go KMP. Otherwise, if you 
 *   really care about performance, say you're classifying packets to apply
 *   Quality of Service (QoS) policies, and you don't mind about possible
 *   matchings spread over multiple fragments, then go BM.
 */

#include <linux/kernel.h>
#include <linux/module.h>