| /external/compiler-rt/lib/asan/tests/ |
| asan_str_test.cc | 90 // Argument points to not allocated memory.
110 // Argument points to not allocated memory.
130 // "to" or "from" points to not allocated memory.
157 // One of {to, from} points to not allocated memory
197 // StrChr argument points to not allocated memory.
213 // StrChr argument points to not allocated memory.
293 // One of arguments points to not allocated memory.
331 // One of arguments points to not allocated memory.
368 // One of arguments points to not allocated memory.
403 // One of arguments points to not allocated memory
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64PromoteConstant.cpp | 134 /// \param InsertPts existing insertion points
146 /// \param InsertPts existing insertion points
154 /// Compute the minimal insertion points to dominates all the interesting
156 /// Insertion points are group per function and each insertion point
168 /// Compute the minimal insertion points to dominate all the interesting
170 /// at these points.
348 // Traverse all the existing insertion points and check if one is dominating
394 // If none exists, we cannot merge these two points.
420 DEBUG(dbgs() << "** Compute insertion points **\n");
466 // Traverse all insertion points in all the function
[all...] |
| /external/opencv/cv/src/ |
| cvapprox.cpp | 117 Restores all the digital curve points from the chain code.
118 Removes the points (from the resultant polygon)
159 Determines support region for all the remained points */
283 Removes non-dominant points with 1-length support region */
319 Cleans remained couples of points */
329 goto copy_vect; /* all points survived */
339 if( i1 == 0 && i2 == len - 1 ) /* only two points */
387 /* gather points */
570 /* 1. Find approximately two farthest points of the contour */
775 /* 1. Find approximately two farthest points of the contour *
[all...] |
| cvshapedescr.cpp | 263 /* reorder output points */
560 CvPoint pt; /* pointer to points */
561 CvPoint pt_s, pt_e; /* first and last points */
562 CvSeqReader reader; /* points reader of contour */
777 icvFitEllipse_F( CvSeq* points, CvBox2D* box )
792 int n = points->total;
794 int is_float = CV_SEQ_ELTYPE(points) == CV_32FC2;
799 /* create matrix D of input points */
802 cvStartReadSeq( points, &reader );
804 /* shift all points to zero *
[all...] |
| cvfundam.cpp | 138 CV_ERROR( CV_StsOutOfRange, "the number of model points should be positive" );
404 // to a line connecting some previously selected points
844 // form a linear system Ax=0: for each selected pair of points m1 & m2,
1029 cvComputeCorrespondEpilines( const CvMat* points, int pointImageID,
1044 if( !CV_IS_MAT(points) )
1045 CV_ERROR( !points ? CV_StsNullPtr : CV_StsBadArg, "points parameter is not a valid matrix" );
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| approx.cpp | 92 Restores all the digital curve points from the chain code.
93 Removes the points (from the resultant polygon)
134 Determines support region for all the remained points */
258 Removes non-dominant points with 1-length support region */
294 Cleans remained couples of points */
304 goto copy_vect; /* all points survived */
314 if( i1 == 0 && i2 == len - 1 ) /* only two points */
362 // gather points
535 // 1. Find approximately two farthest points of the contour
632 // remove extra points on the [almost] stright lines
[all...] |
| /external/tremolo/Tremolo/ |
| mdct.c | 197 STIN void mdct_butterfly_generic(DATA_TYPE *x,int points,int step){
199 DATA_TYPE *x1 = x + points - 4;
200 DATA_TYPE *x2 = x + (points>>1) - 4;
213 x1 = x + (points>>1) + (points>>2) - 4;
214 x2 = x + (points>>2) - 4;
228 STIN void mdct_butterflies(DATA_TYPE *x,int points,int shift){
236 mdct_butterfly_generic(x+(points>>i)*j,points>>i,4<<(i+shift));
240 for(j=0;j<points;j+=32
[all...] |
| /prebuilts/go/darwin-x86/src/strings/ |
| strings.go | 83 // If sep is an empty string, Count returns 1 + the number of Unicode code points in s.
136 // ContainsAny reports whether any Unicode code points in chars are within s.
348 // FieldsFunc splits the string s at each run of Unicode code points c satisfying f(c)
349 // and returns an array of slices of s. If all code points in s satisfy f(c) or the
547 // Unicode code points c satisfying f(c) removed.
557 // Unicode code points c satisfying f(c) removed.
570 // and trailing Unicode code points c satisfying f(c) removed.
625 // trailing Unicode code points contained in cutset removed.
634 // Unicode code points contained in cutset removed.
643 // Unicode code points contained in cutset removed
[all...] |
| /prebuilts/go/linux-x86/src/strings/ |
| strings.go | 83 // If sep is an empty string, Count returns 1 + the number of Unicode code points in s.
136 // ContainsAny reports whether any Unicode code points in chars are within s.
348 // FieldsFunc splits the string s at each run of Unicode code points c satisfying f(c)
349 // and returns an array of slices of s. If all code points in s satisfy f(c) or the
547 // Unicode code points c satisfying f(c) removed.
557 // Unicode code points c satisfying f(c) removed.
570 // and trailing Unicode code points c satisfying f(c) removed.
625 // trailing Unicode code points contained in cutset removed.
634 // Unicode code points contained in cutset removed.
643 // Unicode code points contained in cutset removed
[all...] |
| /external/opencv3/modules/flann/include/opencv2/flann/ |
| kmeans_index.h | 77 * and other information for indexing a set of points for nearest-neighbour matching.
102 * vecs = the dataset of points
144 * vecs = the dataset of points
195 * vecs = the dataset of points
584 * The cluster size (number of points in the cluster)
592 * Node points (only for terminal nodes)
664 * indices = the indices of the points belonging to the node
709 * indices = indices of the points belonging to the current node
756 // assign points to clusters
801 // reassign points to cluster
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/ |
| stdio.h | 169 This function is a possible cancellation points and therefore not
392 or due to the implementation they are cancellation points and
511 These functions are possible cancellation points and therefore not
530 These functions are possible cancellation points and therefore not
550 These functions are possible cancellation points and therefore not
582 These functions are possible cancellation points and therefore not
636 or due to the implementation they are cancellation points and
660 This function is a possible cancellation points and therefore not
666 This function is a possible cancellation points and therefore not
673 This function is a possible cancellation points and therefore no
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_multiset.h | 290 * Returns a read-only (constant) iterator that points to the first
299 * Returns a read-only (constant) iterator that points one past the last
308 * Returns a read-only (constant) reverse iterator that points to the
317 * Returns a read-only (constant) reverse iterator that points to the
327 * Returns a read-only (constant) iterator that points to the first
336 * Returns a read-only (constant) iterator that points one past the last
345 * Returns a read-only (constant) reverse iterator that points to the
354 * Returns a read-only (constant) reverse iterator that points to the
399 * @return An iterator that points to the inserted element.
418 * @return An iterator that points to the inserted element
[all...] |
| stl_set.h | 293 * Returns a read-only (constant) iterator that points to the first
302 * Returns a read-only (constant) iterator that points one past the last
311 * Returns a read-only (constant) iterator that points to the last
320 * Returns a read-only (constant) reverse iterator that points to the
330 * Returns a read-only (constant) iterator that points to the first
339 * Returns a read-only (constant) iterator that points one past the last
348 * Returns a read-only (constant) iterator that points to the last
357 * Returns a read-only (constant) reverse iterator that points to the
401 * @return A pair, of which the first element is an iterator that points
422 * @return An iterator that points to the element with key equivalent t
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_multiset.h | 290 * Returns a read-only (constant) iterator that points to the first
299 * Returns a read-only (constant) iterator that points one past the last
308 * Returns a read-only (constant) reverse iterator that points to the
317 * Returns a read-only (constant) reverse iterator that points to the
327 * Returns a read-only (constant) iterator that points to the first
336 * Returns a read-only (constant) iterator that points one past the last
345 * Returns a read-only (constant) reverse iterator that points to the
354 * Returns a read-only (constant) reverse iterator that points to the
399 * @return An iterator that points to the inserted element.
418 * @return An iterator that points to the inserted element
[all...] |
| stl_set.h | 293 * Returns a read-only (constant) iterator that points to the first
302 * Returns a read-only (constant) iterator that points one past the last
311 * Returns a read-only (constant) iterator that points to the last
320 * Returns a read-only (constant) reverse iterator that points to the
330 * Returns a read-only (constant) iterator that points to the first
339 * Returns a read-only (constant) iterator that points one past the last
348 * Returns a read-only (constant) iterator that points to the last
357 * Returns a read-only (constant) reverse iterator that points to the
401 * @return A pair, of which the first element is an iterator that points
422 * @return An iterator that points to the element with key equivalent t
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_multiset.h | 290 * Returns a read-only (constant) iterator that points to the first
299 * Returns a read-only (constant) iterator that points one past the last
308 * Returns a read-only (constant) reverse iterator that points to the
317 * Returns a read-only (constant) reverse iterator that points to the
327 * Returns a read-only (constant) iterator that points to the first
336 * Returns a read-only (constant) iterator that points one past the last
345 * Returns a read-only (constant) reverse iterator that points to the
354 * Returns a read-only (constant) reverse iterator that points to the
399 * @return An iterator that points to the inserted element.
418 * @return An iterator that points to the inserted element
[all...] |
| stl_set.h | 293 * Returns a read-only (constant) iterator that points to the first
302 * Returns a read-only (constant) iterator that points one past the last
311 * Returns a read-only (constant) iterator that points to the last
320 * Returns a read-only (constant) reverse iterator that points to the
330 * Returns a read-only (constant) iterator that points to the first
339 * Returns a read-only (constant) iterator that points one past the last
348 * Returns a read-only (constant) iterator that points to the last
357 * Returns a read-only (constant) reverse iterator that points to the
401 * @return A pair, of which the first element is an iterator that points
422 * @return An iterator that points to the element with key equivalent t
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_multiset.h | 325 * Returns a read-only (constant) iterator that points to the first
334 * Returns a read-only (constant) iterator that points one past the last
343 * Returns a read-only (constant) reverse iterator that points to the
352 * Returns a read-only (constant) reverse iterator that points to the
362 * Returns a read-only (constant) iterator that points to the first
371 * Returns a read-only (constant) iterator that points one past the last
380 * Returns a read-only (constant) reverse iterator that points to the
389 * Returns a read-only (constant) reverse iterator that points to the
437 * @return An iterator that points to the inserted element.
456 * @return An iterator that points to the inserted element
[all...] |
| stl_set.h | 329 * Returns a read-only (constant) iterator that points to the first
338 * Returns a read-only (constant) iterator that points one past the last
347 * Returns a read-only (constant) iterator that points to the last
356 * Returns a read-only (constant) reverse iterator that points to the
366 * Returns a read-only (constant) iterator that points to the first
375 * Returns a read-only (constant) iterator that points one past the last
384 * Returns a read-only (constant) iterator that points to the last
393 * Returns a read-only (constant) reverse iterator that points to the
440 * @return A pair, of which the first element is an iterator that points
461 * @return An iterator that points to the element with key equivalent t
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| utf_old.h | 68 * The old UTF8_..._SAFE macros also used some normal Unicode code points
103 * <p>utf.h also defines a number of C macros for handling single Unicode code points and
115 * Safe macros return special error code points for illegal/irregular sequences:
158 * string offsets, indexes, and lengths, not Unicode code points.
249 * Code points that are not characters include:
250 * - single surrogate code points (U+d800..U+dfff, 2048 code points)
251 * - the last two code points on each plane (U+__fffe and U+__ffff, 34 code points)
252 * - U+fdd0..U+fdef (new with Unicode 3.1, 32 code points)
[all...] |
| /external/opencv3/modules/java/src/ |
| imgproc+Imgproc.java | [all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| UTF16.java | 104 * The minimum value for Supplementary code points
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| UTF16.java | 109 * The minimum value for Supplementary code points
[all...] |
| /external/freetype/src/autofit/ |
| afcjk.c | 281 /* extremum points (depending on the string properties) */
328 FT_Pos best_pos; /* same as points.y or points.x, resp. */
330 FT_Vector* points; local
360 points = outline.points;
378 /* In some fonts, they correspond to mark attachment points */
388 if ( best_point < 0 || points[pp].x > best_pos )
391 best_pos = points[pp].x;
397 if ( best_point < 0 || points[pp].x < best_pos
[all...] |
| /external/opencv3/modules/imgproc/include/opencv2/imgproc/ |
| imgproc_c.h | 379 Returns the number of retrieved points.
496 The reader is used to iteratively get coordinates of all the chain points.
540 CVAPI(CvRect) cvBoundingRect( CvArr* points, int update CV_DEFAULT(0) );
549 /** @brief Finds minimum area rotated rectangle bounding a set of points
552 CVAPI(CvBox2D) cvMinAreaRect2( const CvArr* points,
555 /** @brief Finds minimum enclosing circle for a set of points
558 CVAPI(int) cvMinEnclosingCircle( const CvArr* points,
587 /** @brief Fits ellipse into a set of 2d points
590 CVAPI(CvBox2D) cvFitEllipse2( const CvArr* points ); variable
598 /** @brief Initializes sequence header for a matrix (column or row vector) of points
[all...] |
