| /external/chromium/chrome/browser/history/ |
| snippet_unittest.cc | 109 size_t ofs = 0; local
110 while ((ofs = document_folded.find(*qw, ofs)) != std::string::npos) {
111 match_positions.push_back(std::make_pair(ofs, ofs + qw->size()));
112 ofs += qw->size();
|
| /external/opencv/cv/src/ |
| cvfeatureselect.cpp | 190 int j = count, ofs = (int)((uchar*)(ptr_data[i]) - eig->data.ptr); local
191 y = ofs / eig->step;
192 x = (ofs - y * eig->step)/sizeof(float);
|
| cvfilter.cpp | 205 int i, j, k, ofs; local
250 ofs = (anchor.x-x_range.start_index)*pix_sz;
282 border_tab[i + j] = idx + ofs + j;
[all...] |
| cvhough.cpp | 994 int ofs = *(int*)cvGetSeqElem( centers, i ); local
995 y = ofs/(acols+2) - 1;
996 x = ofs - (y+1)*(acols+2) - 1;
[all...] |
| cvimgwarp.cpp | 290 const int* ofs, const int* xofs ) \
309 sum += _src[ofs[k]] + _src[ofs[k+1]] + \
310 _src[ofs[k+2]] + _src[ofs[k+3]]; \
313 sum += _src[ofs[k]]; \
719 int* ofs = (int*)cvStackAlloc( (area + dsize.width*cn)*sizeof(int) ); local
1085 int k, type, depth, cn, *ofs = 0; local
[all...] |
| /external/qemu/ |
| qemu-timer.h | 296 uint32_t cur, ofs; local
300 ofs = cc >> 32;
301 return cur - ofs;
|
| /external/quake/quake/src/QW/client/ |
| r_sky.c | 100 int ofs, baseofs; local
125 ofs = baseofs + ((x+xshift) & SKYMASK);
130 *(unsigned *)&bottommask[ofs]) |
131 *(unsigned *)&bottomsky[ofs];
139 ofs = baseofs + ((x+xshift) & SKYMASK);
142 *(byte *)&bottommask[ofs]) |
143 *(byte *)&bottomsky[ofs];
164 int ofs, baseofs; local
184 ofs = baseofs + ((x+xshift) & SKYMASK);
189 *(unsigned *)&bottommask[ofs]) |
223 int ofs, baseofs; local
[all...] |
| common.c | 1419 char *ofs; local
1421 for (ofs = path+1 ; *ofs ; ofs++)
1423 if (*ofs == '/')
1425 *ofs = 0;
1427 *ofs = '/';
[all...] |
| /external/quake/quake/src/WinQuake/ |
| r_sky.cpp | 100 int ofs, baseofs;
local
125 ofs = baseofs + ((x+xshift) & SKYMASK);
130 *(unsigned *)&bottommask[ofs]) |
131 *(unsigned *)&bottomsky[ofs];
139 ofs = baseofs + ((x+xshift) & SKYMASK);
142 *(byte *)&bottommask[ofs]) |
143 *(byte *)&bottomsky[ofs];
164 int ofs, baseofs;
local
184 ofs = baseofs + ((x+xshift) & SKYMASK);
189 *(unsigned *)&bottommask[ofs]) |
223 int ofs, baseofs; local
[all...] |
| pr_comp.h | 32 #define OFS_PARM0 4 // leave 3 ofs for each parm to hold vectors
132 unsigned short ofs;
member in struct:__anon10659
|
| common.cpp | 1343 char *ofs; local
1345 for (ofs = (char*) path+1 ; *ofs ; ofs++)
1347 if (*ofs == '/')
1349 *ofs = 0;
1351 *ofs = '/';
[all...] |
| /external/iproute2/misc/ |
| lnstat.c | 165 int ofs = 0; local
179 snprintf(th.hdr[0]+ofs, width+2, fmt,
185 snprintf(th.hdr[h]+ofs, width+2, fmt, "");
188 snprintf(th.hdr[h]+ofs, width+2, fmt, cname);
192 ofs += width+1;
196 for (i = 0; i < ofs; i++) {
|
| /external/webkit/Source/WebCore/platform/graphics/ |
| ContextShadow.cpp | 147 int ofs = 1 + side2; local
152 unsigned char* next = pixels + ofs * stride + channels[step];
163 for (i = 0; i < limit; ptr += stride, next += stride, ++i, ++ofs) {
165 sum += ((ofs < dim) ? *next : alpha2) - alpha1;
168 for (; ofs < dim; ptr += stride, prev += stride, next += stride, ++i, ++ofs) {
|
| ShadowBlur.cpp | 264 int ofs = 1 + side2; local
270 unsigned char* next = pixels + ofs * stride + channels[step];
283 for (i = 0; i < limit; ptr += stride, next += stride, ++i, ++ofs) {
285 sum += ((ofs < dim) ? *next : alpha2) - alpha1;
289 for (; ofs < dim; ptr += stride, prev += stride, next += stride, ++i, ++ofs) {
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| ComparableTimSort.java | 474 int ofs = 1;
476 // Gallop right until a[base+hint+lastOfs] < key <= a[base+hint+ofs]
478 while (ofs < maxOfs && key.compareTo(a[base + hint + ofs]) > 0) {
479 lastOfs = ofs;
480 ofs = (ofs << 1) + 1;
481 if (ofs <= 0) // int overflow
482 ofs = maxOfs;
484 if (ofs > maxOfs
523 if (DEBUG) assert lastOfs == ofs; \/\/ so a[base + ofs - 1] < key <= a[base + ofs] field in class:ComparableTimSort
[all...] |