1 /*M///////////////////////////////////////////////////////////////////////////////////////
\r
3 // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
\r
5 // By downloading, copying, installing or using the software you agree to this license.
\r
6 // If you do not agree to this license, do not download, install,
\r
7 // copy or use the software.
\r
10 // License Agreement
\r
11 // For Open Source Computer Vision Library
\r
13 // Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
\r
14 // Copyright (C) 2009, Willow Garage Inc., all rights reserved.
\r
15 // Third party copyrights are property of their respective owners.
\r
17 // Redistribution and use in source and binary forms, with or without modification,
\r
18 // are permitted provided that the following conditions are met:
\r
20 // * Redistribution's of source code must retain the above copyright notice,
\r
21 // this list of conditions and the following disclaimer.
\r
23 // * Redistribution's in binary form must reproduce the above copyright notice,
\r
24 // this list of conditions and the following disclaimer in the documentation
\r
25 // and/or other materials provided with the distribution.
\r
27 // * The name of the copyright holders may not be used to endorse or promote products
\r
28 // derived from this software without specific prior written permission.
\r
30 // This software is provided by the copyright holders and contributors "as is" and
\r
31 // any express or implied warranties, including, but not limited to, the implied
\r
32 // warranties of merchantability and fitness for a particular purpose are disclaimed.
\r
33 // In no event shall the Intel Corporation or contributors be liable for any direct,
\r
34 // indirect, incidental, special, exemplary, or consequential damages
\r
35 // (including, but not limited to, procurement of substitute goods or services;
\r
36 // loss of use, data, or profits; or business interruption) however caused
\r
37 // and on any theory of liability, whether in contract, strict liability,
\r
38 // or tort (including negligence or otherwise) arising in any way out of
\r
39 // the use of this software, even if advised of the possibility of such damage.
\r
43 #ifndef _CXCORE_TYPES_H_
\r
44 #define _CXCORE_TYPES_H_
\r
46 #if !defined _CRT_SECURE_NO_DEPRECATE && _MSC_VER > 1300
\r
47 #define _CRT_SECURE_NO_DEPRECATE /* to avoid multiple Visual Studio 2005 warnings */
\r
50 #ifndef SKIP_INCLUDES
\r
57 #define CV_ICC __ICL
\r
59 #define CV_ICC __ICC
\r
61 #define CV_ICC __ECL
\r
63 #define CV_ICC __ECC
\r
66 #if defined WIN32 && (!defined WIN64 || defined EM64T) && \
\r
67 (_MSC_VER >= 1400 || defined CV_ICC) \
\r
68 || (defined __SSE2__ && defined __GNUC__ && __GNUC__ >= 4)
\r
69 #include <emmintrin.h>
\r
75 #if ((defined __SSE__ || defined __MMX__) && defined __GNUC__ && __GNUC__ >= 3)
\r
76 #include <mmintrin.h>
\r
79 #if defined __BORLANDC__
\r
80 #include <fastmath.h>
\r
81 #elif defined WIN64 && !defined EM64T && defined CV_ICC
\r
82 #include <mathimf.h>
\r
89 #if defined WIN32 || defined WIN64
\r
92 #include <ipl/ipl.h>
\r
95 #elif defined __IPL_H__
\r
98 #endif // SKIP_INCLUDES
\r
100 #if defined WIN32 || defined WIN64
\r
101 #define CV_CDECL __cdecl
\r
102 #define CV_STDCALL __stdcall
\r
108 #ifndef CV_EXTERN_C
\r
110 #define CV_EXTERN_C extern "C"
\r
111 #define CV_DEFAULT(val) = val
\r
113 #define CV_EXTERN_C
\r
114 #define CV_DEFAULT(val)
\r
118 #ifndef CV_EXTERN_C_FUNCPTR
\r
120 #define CV_EXTERN_C_FUNCPTR(x) extern "C" { typedef x; }
\r
122 #define CV_EXTERN_C_FUNCPTR(x) typedef x
\r
127 #if defined __cplusplus
\r
128 #define CV_INLINE inline
\r
129 #elif (defined WIN32 || defined WIN64 || defined WINCE) && !defined __GNUC__
\r
130 #define CV_INLINE __inline
\r
132 #define CV_INLINE static
\r
134 #endif /* CV_INLINE */
\r
136 #if (defined WIN32 || defined WIN64 || defined WINCE) && defined CVAPI_EXPORTS
\r
137 #define CV_EXPORTS __declspec(dllexport)
\r
143 #define CVAPI(rettype) CV_EXTERN_C CV_EXPORTS rettype CV_CDECL
\r
146 #if defined _MSC_VER || defined __BORLANDC__
\r
147 typedef __int64 int64;
\r
148 typedef unsigned __int64 uint64;
\r
150 typedef long long int64;
\r
151 typedef unsigned long long uint64;
\r
155 typedef unsigned char uchar;
\r
156 typedef unsigned short ushort;
\r
159 typedef signed char schar;
\r
161 /* CvArr* is used to pass arbitrary
\r
162 * array-like data structures
\r
163 * into functions where the particular
\r
164 * array type is recognized at runtime:
\r
166 typedef void CvArr;
\r
168 typedef union Cv32suf
\r
176 typedef union Cv64suf
\r
184 /****************************************************************************************\
\r
185 * Common macros and inline functions *
\r
186 \****************************************************************************************/
\r
188 #define CV_PI 3.1415926535897932384626433832795
\r
189 #define CV_LOG2 0.69314718055994530941723212145818
\r
191 #define CV_SWAP(a,b,t) ((t) = (a), (a) = (b), (b) = (t))
\r
194 #define MIN(a,b) ((a) > (b) ? (b) : (a))
\r
198 #define MAX(a,b) ((a) < (b) ? (b) : (a))
\r
201 /* min & max without jumps */
\r
202 #define CV_IMIN(a, b) ((a) ^ (((a)^(b)) & (((a) < (b)) - 1)))
\r
204 #define CV_IMAX(a, b) ((a) ^ (((a)^(b)) & (((a) > (b)) - 1)))
\r
206 /* absolute value without jumps */
\r
207 #ifndef __cplusplus
\r
208 #define CV_IABS(a) (((a) ^ ((a) < 0 ? -1 : 0)) - ((a) < 0 ? -1 : 0))
\r
210 #define CV_IABS(a) abs(a)
\r
212 #define CV_CMP(a,b) (((a) > (b)) - ((a) < (b)))
\r
213 #define CV_SIGN(a) CV_CMP((a),0)
\r
215 CV_INLINE int cvRound( double value )
\r
218 __m128d t = _mm_load_sd( &value );
\r
219 return _mm_cvtsd_si32(t);
\r
220 #elif defined WIN32 && !defined WIN64 && defined _MSC_VER
\r
228 #elif (defined HAVE_LRINT) || (defined WIN64 && !defined EM64T && defined CV_ICC)
\r
229 return (int)lrint(value);
\r
232 the algorithm was taken from Agner Fog's optimization guide
\r
233 at http://www.agner.org/assem
\r
236 temp.f = value + 6755399441055744.0;
\r
237 return (int)temp.u;
\r
242 CV_INLINE int cvFloor( double value )
\r
245 __m128d t = _mm_load_sd( &value );
\r
246 int i = _mm_cvtsd_si32(t);
\r
247 return i - _mm_movemask_pd(_mm_cmplt_sd(t,_mm_cvtsi32_sd(t,i)));
\r
249 int temp = cvRound(value);
\r
251 diff.f = (float)(value - temp);
\r
252 return temp - (diff.i < 0);
\r
257 CV_INLINE int cvCeil( double value )
\r
260 __m128d t = _mm_load_sd( &value );
\r
261 int i = _mm_cvtsd_si32(t);
\r
262 return i + _mm_movemask_pd(_mm_cmplt_sd(_mm_cvtsi32_sd(t,i),t));
\r
264 int temp = cvRound(value);
\r
266 diff.f = (float)(temp - value);
\r
267 return temp + (diff.i < 0);
\r
271 #define cvInvSqrt(value) ((float)(1./sqrt(value)))
\r
272 #define cvSqrt(value) ((float)sqrt(value))
\r
274 CV_INLINE int cvIsNaN( double value )
\r
276 #if 1/*defined _MSC_VER || defined __BORLANDC__
\r
277 return _isnan(value);
\r
278 #elif defined __GNUC__
\r
279 return isnan(value);
\r
283 return ((unsigned)(ieee754.u >> 32) & 0x7fffffff) +
\r
284 ((unsigned)ieee754.u != 0) > 0x7ff00000;
\r
289 CV_INLINE int cvIsInf( double value )
\r
291 #if 1/*defined _MSC_VER || defined __BORLANDC__
\r
292 return !_finite(value);
\r
293 #elif defined __GNUC__
\r
294 return isinf(value);
\r
298 return ((unsigned)(ieee754.u >> 32) & 0x7fffffff) == 0x7ff00000 &&
\r
299 (unsigned)ieee754.u == 0;
\r
304 /*************** Random number generation *******************/
\r
306 typedef uint64 CvRNG;
\r
308 CV_INLINE CvRNG cvRNG( int64 seed CV_DEFAULT(-1))
\r
310 CvRNG rng = seed ? (uint64)seed : (uint64)(int64)-1;
\r
314 /* Return random 32-bit unsigned integer: */
\r
315 CV_INLINE unsigned cvRandInt( CvRNG* rng )
\r
317 uint64 temp = *rng;
\r
318 temp = (uint64)(unsigned)temp*4164903690U + (temp >> 32);
\r
320 return (unsigned)temp;
\r
323 /* Returns random floating-point number between 0 and 1: */
\r
324 CV_INLINE double cvRandReal( CvRNG* rng )
\r
326 return cvRandInt(rng)*2.3283064365386962890625e-10 /* 2^-32 */;
\r
329 /****************************************************************************************\
\r
330 * Image type (IplImage) *
\r
331 \****************************************************************************************/
\r
336 * The following definitions (until #endif)
\r
337 * is an extract from IPL headers.
\r
338 * Copyright (c) 1995 Intel Corporation.
\r
340 #define IPL_DEPTH_SIGN 0x80000000
\r
342 #define IPL_DEPTH_1U 1
\r
343 #define IPL_DEPTH_8U 8
\r
344 #define IPL_DEPTH_16U 16
\r
345 #define IPL_DEPTH_32F 32
\r
347 #define IPL_DEPTH_8S (IPL_DEPTH_SIGN| 8)
\r
348 #define IPL_DEPTH_16S (IPL_DEPTH_SIGN|16)
\r
349 #define IPL_DEPTH_32S (IPL_DEPTH_SIGN|32)
\r
351 #define IPL_DATA_ORDER_PIXEL 0
\r
352 #define IPL_DATA_ORDER_PLANE 1
\r
354 #define IPL_ORIGIN_TL 0
\r
355 #define IPL_ORIGIN_BL 1
\r
357 #define IPL_ALIGN_4BYTES 4
\r
358 #define IPL_ALIGN_8BYTES 8
\r
359 #define IPL_ALIGN_16BYTES 16
\r
360 #define IPL_ALIGN_32BYTES 32
\r
362 #define IPL_ALIGN_DWORD IPL_ALIGN_4BYTES
\r
363 #define IPL_ALIGN_QWORD IPL_ALIGN_8BYTES
\r
365 #define IPL_BORDER_CONSTANT 0
\r
366 #define IPL_BORDER_REPLICATE 1
\r
367 #define IPL_BORDER_REFLECT 2
\r
368 #define IPL_BORDER_WRAP 3
\r
370 typedef struct _IplImage
\r
372 int nSize; /* sizeof(IplImage) */
\r
373 int ID; /* version (=0)*/
\r
374 int nChannels; /* Most of OpenCV functions support 1,2,3 or 4 channels */
\r
375 int alphaChannel; /* Ignored by OpenCV */
\r
376 int depth; /* Pixel depth in bits: IPL_DEPTH_8U, IPL_DEPTH_8S, IPL_DEPTH_16S,
\r
377 IPL_DEPTH_32S, IPL_DEPTH_32F and IPL_DEPTH_64F are supported. */
\r
378 char colorModel[4]; /* Ignored by OpenCV */
\r
379 char channelSeq[4]; /* ditto */
\r
380 int dataOrder; /* 0 - interleaved color channels, 1 - separate color channels.
\r
381 cvCreateImage can only create interleaved images */
\r
382 int origin; /* 0 - top-left origin,
\r
383 1 - bottom-left origin (Windows bitmaps style). */
\r
384 int align; /* Alignment of image rows (4 or 8).
\r
385 OpenCV ignores it and uses widthStep instead. */
\r
386 int width; /* Image width in pixels. */
\r
387 int height; /* Image height in pixels. */
\r
388 struct _IplROI *roi; /* Image ROI. If NULL, the whole image is selected. */
\r
389 struct _IplImage *maskROI; /* Must be NULL. */
\r
390 void *imageId; /* " " */
\r
391 struct _IplTileInfo *tileInfo; /* " " */
\r
392 int imageSize; /* Image data size in bytes
\r
393 (==image->height*image->widthStep
\r
394 in case of interleaved data)*/
\r
395 char *imageData; /* Pointer to aligned image data. */
\r
396 int widthStep; /* Size of aligned image row in bytes. */
\r
397 int BorderMode[4]; /* Ignored by OpenCV. */
\r
398 int BorderConst[4]; /* Ditto. */
\r
399 char *imageDataOrigin; /* Pointer to very origin of image data
\r
400 (not necessarily aligned) -
\r
401 needed for correct deallocation */
\r
405 typedef struct _IplTileInfo IplTileInfo;
\r
407 typedef struct _IplROI
\r
409 int coi; /* 0 - no COI (all channels are selected), 1 - 0th channel is selected ...*/
\r
417 typedef struct _IplConvKernel
\r
428 typedef struct _IplConvKernelFP
\r
438 #define IPL_IMAGE_HEADER 1
\r
439 #define IPL_IMAGE_DATA 2
\r
440 #define IPL_IMAGE_ROI 4
\r
444 /* extra border mode */
\r
445 #define IPL_BORDER_REFLECT_101 4
\r
447 #define IPL_IMAGE_MAGIC_VAL ((int)sizeof(IplImage))
\r
448 #define CV_TYPE_NAME_IMAGE "opencv-image"
\r
450 #define CV_IS_IMAGE_HDR(img) \
\r
451 ((img) != NULL && ((const IplImage*)(img))->nSize == sizeof(IplImage))
\r
453 #define CV_IS_IMAGE(img) \
\r
454 (CV_IS_IMAGE_HDR(img) && ((IplImage*)img)->imageData != NULL)
\r
456 /* for storing double-precision
\r
457 floating point data in IplImage's */
\r
458 #define IPL_DEPTH_64F 64
\r
460 /* get reference to pixel at (col,row),
\r
461 for multi-channel images (col) should be multiplied by number of channels */
\r
462 #define CV_IMAGE_ELEM( image, elemtype, row, col ) \
\r
463 (((elemtype*)((image)->imageData + (image)->widthStep*(row)))[(col)])
\r
465 /****************************************************************************************\
\r
466 * Matrix type (CvMat) *
\r
467 \****************************************************************************************/
\r
469 #define CV_CN_MAX 64
\r
470 #define CV_CN_SHIFT 3
\r
471 #define CV_DEPTH_MAX (1 << CV_CN_SHIFT)
\r
480 #define CV_USRTYPE1 7
\r
482 #define CV_MAKETYPE(depth,cn) ((depth) + (((cn)-1) << CV_CN_SHIFT))
\r
483 #define CV_MAKE_TYPE CV_MAKETYPE
\r
485 #define CV_8UC1 CV_MAKETYPE(CV_8U,1)
\r
486 #define CV_8UC2 CV_MAKETYPE(CV_8U,2)
\r
487 #define CV_8UC3 CV_MAKETYPE(CV_8U,3)
\r
488 #define CV_8UC4 CV_MAKETYPE(CV_8U,4)
\r
489 #define CV_8UC(n) CV_MAKETYPE(CV_8U,(n))
\r
491 #define CV_8SC1 CV_MAKETYPE(CV_8S,1)
\r
492 #define CV_8SC2 CV_MAKETYPE(CV_8S,2)
\r
493 #define CV_8SC3 CV_MAKETYPE(CV_8S,3)
\r
494 #define CV_8SC4 CV_MAKETYPE(CV_8S,4)
\r
495 #define CV_8SC(n) CV_MAKETYPE(CV_8S,(n))
\r
497 #define CV_16UC1 CV_MAKETYPE(CV_16U,1)
\r
498 #define CV_16UC2 CV_MAKETYPE(CV_16U,2)
\r
499 #define CV_16UC3 CV_MAKETYPE(CV_16U,3)
\r
500 #define CV_16UC4 CV_MAKETYPE(CV_16U,4)
\r
501 #define CV_16UC(n) CV_MAKETYPE(CV_16U,(n))
\r
503 #define CV_16SC1 CV_MAKETYPE(CV_16S,1)
\r
504 #define CV_16SC2 CV_MAKETYPE(CV_16S,2)
\r
505 #define CV_16SC3 CV_MAKETYPE(CV_16S,3)
\r
506 #define CV_16SC4 CV_MAKETYPE(CV_16S,4)
\r
507 #define CV_16SC(n) CV_MAKETYPE(CV_16S,(n))
\r
509 #define CV_32SC1 CV_MAKETYPE(CV_32S,1)
\r
510 #define CV_32SC2 CV_MAKETYPE(CV_32S,2)
\r
511 #define CV_32SC3 CV_MAKETYPE(CV_32S,3)
\r
512 #define CV_32SC4 CV_MAKETYPE(CV_32S,4)
\r
513 #define CV_32SC(n) CV_MAKETYPE(CV_32S,(n))
\r
515 #define CV_32FC1 CV_MAKETYPE(CV_32F,1)
\r
516 #define CV_32FC2 CV_MAKETYPE(CV_32F,2)
\r
517 #define CV_32FC3 CV_MAKETYPE(CV_32F,3)
\r
518 #define CV_32FC4 CV_MAKETYPE(CV_32F,4)
\r
519 #define CV_32FC(n) CV_MAKETYPE(CV_32F,(n))
\r
521 #define CV_64FC1 CV_MAKETYPE(CV_64F,1)
\r
522 #define CV_64FC2 CV_MAKETYPE(CV_64F,2)
\r
523 #define CV_64FC3 CV_MAKETYPE(CV_64F,3)
\r
524 #define CV_64FC4 CV_MAKETYPE(CV_64F,4)
\r
525 #define CV_64FC(n) CV_MAKETYPE(CV_64F,(n))
\r
527 #define CV_AUTO_STEP 0x7fffffff
\r
528 #define CV_WHOLE_ARR cvSlice( 0, 0x3fffffff )
\r
530 #define CV_MAT_CN_MASK ((CV_CN_MAX - 1) << CV_CN_SHIFT)
\r
531 #define CV_MAT_CN(flags) ((((flags) & CV_MAT_CN_MASK) >> CV_CN_SHIFT) + 1)
\r
532 #define CV_MAT_DEPTH_MASK (CV_DEPTH_MAX - 1)
\r
533 #define CV_MAT_DEPTH(flags) ((flags) & CV_MAT_DEPTH_MASK)
\r
534 #define CV_MAT_TYPE_MASK (CV_DEPTH_MAX*CV_CN_MAX - 1)
\r
535 #define CV_MAT_TYPE(flags) ((flags) & CV_MAT_TYPE_MASK)
\r
536 #define CV_MAT_CONT_FLAG_SHIFT 14
\r
537 #define CV_MAT_CONT_FLAG (1 << CV_MAT_CONT_FLAG_SHIFT)
\r
538 #define CV_IS_MAT_CONT(flags) ((flags) & CV_MAT_CONT_FLAG)
\r
539 #define CV_IS_CONT_MAT CV_IS_MAT_CONT
\r
540 #define CV_MAT_TEMP_FLAG_SHIFT 15
\r
541 #define CV_MAT_TEMP_FLAG (1 << CV_MAT_TEMP_FLAG_SHIFT)
\r
542 #define CV_IS_TEMP_MAT(flags) ((flags) & CV_MAT_TEMP_FLAG)
\r
544 #define CV_MAGIC_MASK 0xFFFF0000
\r
545 #define CV_MAT_MAGIC_VAL 0x42420000
\r
546 #define CV_TYPE_NAME_MAT "opencv-matrix"
\r
548 typedef struct CvMat
\r
553 /* for internal use only */
\r
587 #define CV_IS_MAT_HDR(mat) \
\r
588 ((mat) != NULL && \
\r
589 (((const CvMat*)(mat))->type & CV_MAGIC_MASK) == CV_MAT_MAGIC_VAL && \
\r
590 ((const CvMat*)(mat))->cols > 0 && ((const CvMat*)(mat))->rows > 0)
\r
592 #define CV_IS_MAT(mat) \
\r
593 (CV_IS_MAT_HDR(mat) && ((const CvMat*)(mat))->data.ptr != NULL)
\r
595 #define CV_IS_MASK_ARR(mat) \
\r
596 (((mat)->type & (CV_MAT_TYPE_MASK & ~CV_8SC1)) == 0)
\r
598 #define CV_ARE_TYPES_EQ(mat1, mat2) \
\r
599 ((((mat1)->type ^ (mat2)->type) & CV_MAT_TYPE_MASK) == 0)
\r
601 #define CV_ARE_CNS_EQ(mat1, mat2) \
\r
602 ((((mat1)->type ^ (mat2)->type) & CV_MAT_CN_MASK) == 0)
\r
604 #define CV_ARE_DEPTHS_EQ(mat1, mat2) \
\r
605 ((((mat1)->type ^ (mat2)->type) & CV_MAT_DEPTH_MASK) == 0)
\r
607 #define CV_ARE_SIZES_EQ(mat1, mat2) \
\r
608 ((mat1)->rows == (mat2)->rows && (mat1)->cols == (mat2)->cols)
\r
610 #define CV_IS_MAT_CONST(mat) \
\r
611 (((mat)->rows|(mat)->cols) == 1)
\r
613 /* Size of each channel item,
\r
614 0x124489 = 1000 0100 0100 0010 0010 0001 0001 ~ array of sizeof(arr_type_elem) */
\r
615 #define CV_ELEM_SIZE1(type) \
\r
616 ((((sizeof(size_t)<<28)|0x8442211) >> CV_MAT_DEPTH(type)*4) & 15)
\r
618 /* 0x3a50 = 11 10 10 01 01 00 00 ~ array of log2(sizeof(arr_type_elem)) */
\r
619 #define CV_ELEM_SIZE(type) \
\r
620 (CV_MAT_CN(type) << ((((sizeof(size_t)/4+1)*16384|0x3a50) >> CV_MAT_DEPTH(type)*2) & 3))
\r
622 /* Inline constructor. No data is allocated internally!!!
\r
623 * (Use together with cvCreateData, or use cvCreateMat instead to
\r
624 * get a matrix with allocated data):
\r
626 CV_INLINE CvMat cvMat( int rows, int cols, int type, void* data CV_DEFAULT(NULL))
\r
630 assert( (unsigned)CV_MAT_DEPTH(type) <= CV_64F );
\r
631 type = CV_MAT_TYPE(type);
\r
632 m.type = CV_MAT_MAGIC_VAL | CV_MAT_CONT_FLAG | type;
\r
635 m.step = rows > 1 ? m.cols*CV_ELEM_SIZE(type) : 0;
\r
636 m.data.ptr = (uchar*)data;
\r
638 m.hdr_refcount = 0;
\r
644 #define CV_MAT_ELEM_PTR_FAST( mat, row, col, pix_size ) \
\r
645 (assert( (unsigned)(row) < (unsigned)(mat).rows && \
\r
646 (unsigned)(col) < (unsigned)(mat).cols ), \
\r
647 (mat).data.ptr + (size_t)(mat).step*(row) + (pix_size)*(col))
\r
649 #define CV_MAT_ELEM_PTR( mat, row, col ) \
\r
650 CV_MAT_ELEM_PTR_FAST( mat, row, col, CV_ELEM_SIZE((mat).type) )
\r
652 #define CV_MAT_ELEM( mat, elemtype, row, col ) \
\r
653 (*(elemtype*)CV_MAT_ELEM_PTR_FAST( mat, row, col, sizeof(elemtype)))
\r
656 CV_INLINE double cvmGet( const CvMat* mat, int row, int col )
\r
660 type = CV_MAT_TYPE(mat->type);
\r
661 assert( (unsigned)row < (unsigned)mat->rows &&
\r
662 (unsigned)col < (unsigned)mat->cols );
\r
664 if( type == CV_32FC1 )
\r
665 return ((float*)(mat->data.ptr + (size_t)mat->step*row))[col];
\r
668 assert( type == CV_64FC1 );
\r
669 return ((double*)(mat->data.ptr + (size_t)mat->step*row))[col];
\r
674 CV_INLINE void cvmSet( CvMat* mat, int row, int col, double value )
\r
677 type = CV_MAT_TYPE(mat->type);
\r
678 assert( (unsigned)row < (unsigned)mat->rows &&
\r
679 (unsigned)col < (unsigned)mat->cols );
\r
681 if( type == CV_32FC1 )
\r
682 ((float*)(mat->data.ptr + (size_t)mat->step*row))[col] = (float)value;
\r
685 assert( type == CV_64FC1 );
\r
686 ((double*)(mat->data.ptr + (size_t)mat->step*row))[col] = (double)value;
\r
691 CV_INLINE int cvCvToIplDepth( int type )
\r
693 int depth = CV_MAT_DEPTH(type);
\r
694 return CV_ELEM_SIZE1(depth)*8 | (depth == CV_8S || depth == CV_16S ||
\r
695 depth == CV_32S ? IPL_DEPTH_SIGN : 0);
\r
699 /****************************************************************************************\
\r
700 * Multi-dimensional dense array (CvMatND) *
\r
701 \****************************************************************************************/
\r
703 #define CV_MATND_MAGIC_VAL 0x42430000
\r
704 #define CV_TYPE_NAME_MATND "opencv-nd-matrix"
\r
706 #define CV_MAX_DIM 32
\r
707 #define CV_MAX_DIM_HEAP (1 << 16)
\r
709 typedef struct CvMatND
\r
735 #define CV_IS_MATND_HDR(mat) \
\r
736 ((mat) != NULL && (((const CvMatND*)(mat))->type & CV_MAGIC_MASK) == CV_MATND_MAGIC_VAL)
\r
738 #define CV_IS_MATND(mat) \
\r
739 (CV_IS_MATND_HDR(mat) && ((const CvMatND*)(mat))->data.ptr != NULL)
\r
742 /****************************************************************************************\
\r
743 * Multi-dimensional sparse array (CvSparseMat) *
\r
744 \****************************************************************************************/
\r
746 #define CV_SPARSE_MAT_MAGIC_VAL 0x42440000
\r
747 #define CV_TYPE_NAME_SPARSE_MAT "opencv-sparse-matrix"
\r
751 typedef struct CvSparseMat
\r
758 struct CvSet* heap;
\r
763 int size[CV_MAX_DIM];
\r
767 #define CV_IS_SPARSE_MAT_HDR(mat) \
\r
768 ((mat) != NULL && \
\r
769 (((const CvSparseMat*)(mat))->type & CV_MAGIC_MASK) == CV_SPARSE_MAT_MAGIC_VAL)
\r
771 #define CV_IS_SPARSE_MAT(mat) \
\r
772 CV_IS_SPARSE_MAT_HDR(mat)
\r
774 /**************** iteration through a sparse array *****************/
\r
776 typedef struct CvSparseNode
\r
779 struct CvSparseNode* next;
\r
783 typedef struct CvSparseMatIterator
\r
786 CvSparseNode* node;
\r
789 CvSparseMatIterator;
\r
791 #define CV_NODE_VAL(mat,node) ((void*)((uchar*)(node) + (mat)->valoffset))
\r
792 #define CV_NODE_IDX(mat,node) ((int*)((uchar*)(node) + (mat)->idxoffset))
\r
794 /****************************************************************************************\
\r
796 \****************************************************************************************/
\r
798 typedef int CvHistType;
\r
800 #define CV_HIST_MAGIC_VAL 0x42450000
\r
801 #define CV_HIST_UNIFORM_FLAG (1 << 10)
\r
803 /* indicates whether bin ranges are set already or not */
\r
804 #define CV_HIST_RANGES_FLAG (1 << 11)
\r
806 #define CV_HIST_ARRAY 0
\r
807 #define CV_HIST_SPARSE 1
\r
808 #define CV_HIST_TREE CV_HIST_SPARSE
\r
810 /* should be used as a parameter only,
\r
811 it turns to CV_HIST_UNIFORM_FLAG of hist->type */
\r
812 #define CV_HIST_UNIFORM 1
\r
814 typedef struct CvHistogram
\r
818 float thresh[CV_MAX_DIM][2]; /* For uniform histograms. */
\r
819 float** thresh2; /* For non-uniform histograms. */
\r
820 CvMatND mat; /* Embedded matrix header for array histograms. */
\r
824 #define CV_IS_HIST( hist ) \
\r
825 ((hist) != NULL && \
\r
826 (((CvHistogram*)(hist))->type & CV_MAGIC_MASK) == CV_HIST_MAGIC_VAL && \
\r
827 (hist)->bins != NULL)
\r
829 #define CV_IS_UNIFORM_HIST( hist ) \
\r
830 (((hist)->type & CV_HIST_UNIFORM_FLAG) != 0)
\r
832 #define CV_IS_SPARSE_HIST( hist ) \
\r
833 CV_IS_SPARSE_MAT((hist)->bins)
\r
835 #define CV_HIST_HAS_RANGES( hist ) \
\r
836 (((hist)->type & CV_HIST_RANGES_FLAG) != 0)
\r
838 /****************************************************************************************\
\r
839 * Other supplementary data type definitions *
\r
840 \****************************************************************************************/
\r
842 /*************************************** CvRect *****************************************/
\r
844 typedef struct CvRect
\r
853 CV_INLINE CvRect cvRect( int x, int y, int width, int height )
\r
866 CV_INLINE IplROI cvRectToROI( CvRect rect, int coi )
\r
869 roi.xOffset = rect.x;
\r
870 roi.yOffset = rect.y;
\r
871 roi.width = rect.width;
\r
872 roi.height = rect.height;
\r
879 CV_INLINE CvRect cvROIToRect( IplROI roi )
\r
881 return cvRect( roi.xOffset, roi.yOffset, roi.width, roi.height );
\r
884 /*********************************** CvTermCriteria *************************************/
\r
886 #define CV_TERMCRIT_ITER 1
\r
887 #define CV_TERMCRIT_NUMBER CV_TERMCRIT_ITER
\r
888 #define CV_TERMCRIT_EPS 2
\r
890 typedef struct CvTermCriteria
\r
892 int type; /* may be combination of
\r
900 CV_INLINE CvTermCriteria cvTermCriteria( int type, int max_iter, double epsilon )
\r
905 t.max_iter = max_iter;
\r
906 t.epsilon = (float)epsilon;
\r
912 /******************************* CvPoint and variants ***********************************/
\r
914 typedef struct CvPoint
\r
922 CV_INLINE CvPoint cvPoint( int x, int y )
\r
933 typedef struct CvPoint2D32f
\r
941 CV_INLINE CvPoint2D32f cvPoint2D32f( double x, double y )
\r
952 CV_INLINE CvPoint2D32f cvPointTo32f( CvPoint point )
\r
954 return cvPoint2D32f( (float)point.x, (float)point.y );
\r
958 CV_INLINE CvPoint cvPointFrom32f( CvPoint2D32f point )
\r
961 ipt.x = cvRound(point.x);
\r
962 ipt.y = cvRound(point.y);
\r
968 typedef struct CvPoint3D32f
\r
977 CV_INLINE CvPoint3D32f cvPoint3D32f( double x, double y, double z )
\r
989 typedef struct CvPoint2D64f
\r
997 CV_INLINE CvPoint2D64f cvPoint2D64f( double x, double y )
\r
1008 typedef struct CvPoint3D64f
\r
1017 CV_INLINE CvPoint3D64f cvPoint3D64f( double x, double y, double z )
\r
1029 /******************************** CvSize's & CvBox **************************************/
\r
1038 CV_INLINE CvSize cvSize( int width, int height )
\r
1043 s.height = height;
\r
1048 typedef struct CvSize2D32f
\r
1056 CV_INLINE CvSize2D32f cvSize2D32f( double width, double height )
\r
1060 s.width = (float)width;
\r
1061 s.height = (float)height;
\r
1066 typedef struct CvBox2D
\r
1068 CvPoint2D32f center; /* Center of the box. */
\r
1069 CvSize2D32f size; /* Box width and length. */
\r
1070 float angle; /* Angle between the horizontal axis */
\r
1071 /* and the first side (i.e. length) in degrees */
\r
1076 /* Line iterator state: */
\r
1077 typedef struct CvLineIterator
\r
1079 /* Pointer to the current point: */
\r
1082 /* Bresenham algorithm state: */
\r
1093 /************************************* CvSlice ******************************************/
\r
1095 typedef struct CvSlice
\r
1097 int start_index, end_index;
\r
1101 CV_INLINE CvSlice cvSlice( int start, int end )
\r
1104 slice.start_index = start;
\r
1105 slice.end_index = end;
\r
1110 #define CV_WHOLE_SEQ_END_INDEX 0x3fffffff
\r
1111 #define CV_WHOLE_SEQ cvSlice(0, CV_WHOLE_SEQ_END_INDEX)
\r
1114 /************************************* CvScalar *****************************************/
\r
1116 typedef struct CvScalar
\r
1122 CV_INLINE CvScalar cvScalar( double val0, double val1 CV_DEFAULT(0),
\r
1123 double val2 CV_DEFAULT(0), double val3 CV_DEFAULT(0))
\r
1126 scalar.val[0] = val0; scalar.val[1] = val1;
\r
1127 scalar.val[2] = val2; scalar.val[3] = val3;
\r
1132 CV_INLINE CvScalar cvRealScalar( double val0 )
\r
1135 scalar.val[0] = val0;
\r
1136 scalar.val[1] = scalar.val[2] = scalar.val[3] = 0;
\r
1140 CV_INLINE CvScalar cvScalarAll( double val0123 )
\r
1143 scalar.val[0] = val0123;
\r
1144 scalar.val[1] = val0123;
\r
1145 scalar.val[2] = val0123;
\r
1146 scalar.val[3] = val0123;
\r
1150 /****************************************************************************************\
\r
1151 * Dynamic Data structures *
\r
1152 \****************************************************************************************/
\r
1154 /******************************** Memory storage ****************************************/
\r
1156 typedef struct CvMemBlock
\r
1158 struct CvMemBlock* prev;
\r
1159 struct CvMemBlock* next;
\r
1163 #define CV_STORAGE_MAGIC_VAL 0x42890000
\r
1165 typedef struct CvMemStorage
\r
1168 CvMemBlock* bottom; /* First allocated block. */
\r
1169 CvMemBlock* top; /* Current memory block - top of the stack. */
\r
1170 struct CvMemStorage* parent; /* We get new blocks from parent as needed. */
\r
1171 int block_size; /* Block size. */
\r
1172 int free_space; /* Remaining free space in current block. */
\r
1176 #define CV_IS_STORAGE(storage) \
\r
1177 ((storage) != NULL && \
\r
1178 (((CvMemStorage*)(storage))->signature & CV_MAGIC_MASK) == CV_STORAGE_MAGIC_VAL)
\r
1181 typedef struct CvMemStoragePos
\r
1189 /*********************************** Sequence *******************************************/
\r
1191 typedef struct CvSeqBlock
\r
1193 struct CvSeqBlock* prev; /* Previous sequence block. */
\r
1194 struct CvSeqBlock* next; /* Next sequence block. */
\r
1195 int start_index; /* Index of the first element in the block + */
\r
1196 /* sequence->first->start_index. */
\r
1197 int count; /* Number of elements in the block. */
\r
1198 schar* data; /* Pointer to the first element of the block. */
\r
1203 #define CV_TREE_NODE_FIELDS(node_type) \
\r
1204 int flags; /* Miscellaneous flags. */ \
\r
1205 int header_size; /* Size of sequence header. */ \
\r
1206 struct node_type* h_prev; /* Previous sequence. */ \
\r
1207 struct node_type* h_next; /* Next sequence. */ \
\r
1208 struct node_type* v_prev; /* 2nd previous sequence. */ \
\r
1209 struct node_type* v_next /* 2nd next sequence. */
\r
1212 Read/Write sequence.
\r
1213 Elements can be dynamically inserted to or deleted from the sequence.
\r
1215 #define CV_SEQUENCE_FIELDS() \
\r
1216 CV_TREE_NODE_FIELDS(CvSeq); \
\r
1217 int total; /* Total number of elements. */ \
\r
1218 int elem_size; /* Size of sequence element in bytes. */ \
\r
1219 schar* block_max; /* Maximal bound of the last block. */ \
\r
1220 schar* ptr; /* Current write pointer. */ \
\r
1221 int delta_elems; /* Grow seq this many at a time. */ \
\r
1222 CvMemStorage* storage; /* Where the seq is stored. */ \
\r
1223 CvSeqBlock* free_blocks; /* Free blocks list. */ \
\r
1224 CvSeqBlock* first; /* Pointer to the first sequence block. */
\r
1226 typedef struct CvSeq
\r
1228 CV_SEQUENCE_FIELDS()
\r
1232 #define CV_TYPE_NAME_SEQ "opencv-sequence"
\r
1233 #define CV_TYPE_NAME_SEQ_TREE "opencv-sequence-tree"
\r
1235 /*************************************** Set ********************************************/
\r
1238 Order is not preserved. There can be gaps between sequence elements.
\r
1239 After the element has been inserted it stays in the same place all the time.
\r
1240 The MSB(most-significant or sign bit) of the first field (flags) is 0 iff the element exists.
\r
1242 #define CV_SET_ELEM_FIELDS(elem_type) \
\r
1244 struct elem_type* next_free;
\r
1246 typedef struct CvSetElem
\r
1248 CV_SET_ELEM_FIELDS(CvSetElem)
\r
1252 #define CV_SET_FIELDS() \
\r
1253 CV_SEQUENCE_FIELDS() \
\r
1254 CvSetElem* free_elems; \
\r
1257 typedef struct CvSet
\r
1264 #define CV_SET_ELEM_IDX_MASK ((1 << 26) - 1)
\r
1265 #define CV_SET_ELEM_FREE_FLAG (1 << (sizeof(int)*8-1))
\r
1267 /* Checks whether the element pointed by ptr belongs to a set or not */
\r
1268 #define CV_IS_SET_ELEM( ptr ) (((CvSetElem*)(ptr))->flags >= 0)
\r
1270 /************************************* Graph ********************************************/
\r
1273 We represent a graph as a set of vertices.
\r
1274 Vertices contain their adjacency lists (more exactly, pointers to first incoming or
\r
1275 outcoming edge (or 0 if isolated vertex)). Edges are stored in another set.
\r
1276 There is a singly-linked list of incoming/outcoming edges for each vertex.
\r
1278 Each edge consists of
\r
1280 o Two pointers to the starting and ending vertices
\r
1281 (vtx[0] and vtx[1] respectively).
\r
1283 A graph may be oriented or not. In the latter case, edges between
\r
1284 vertex i to vertex j are not distinguished during search operations.
\r
1286 o Two pointers to next edges for the starting and ending vertices, where
\r
1287 next[0] points to the next edge in the vtx[0] adjacency list and
\r
1288 next[1] points to the next edge in the vtx[1] adjacency list.
\r
1290 #define CV_GRAPH_EDGE_FIELDS() \
\r
1293 struct CvGraphEdge* next[2]; \
\r
1294 struct CvGraphVtx* vtx[2];
\r
1297 #define CV_GRAPH_VERTEX_FIELDS() \
\r
1299 struct CvGraphEdge* first;
\r
1302 typedef struct CvGraphEdge
\r
1304 CV_GRAPH_EDGE_FIELDS()
\r
1308 typedef struct CvGraphVtx
\r
1310 CV_GRAPH_VERTEX_FIELDS()
\r
1314 typedef struct CvGraphVtx2D
\r
1316 CV_GRAPH_VERTEX_FIELDS()
\r
1317 CvPoint2D32f* ptr;
\r
1322 Graph is "derived" from the set (this is set a of vertices)
\r
1323 and includes another set (edges)
\r
1325 #define CV_GRAPH_FIELDS() \
\r
1329 typedef struct CvGraph
\r
1335 #define CV_TYPE_NAME_GRAPH "opencv-graph"
\r
1337 /*********************************** Chain/Countour *************************************/
\r
1339 typedef struct CvChain
\r
1341 CV_SEQUENCE_FIELDS()
\r
1346 #define CV_CONTOUR_FIELDS() \
\r
1347 CV_SEQUENCE_FIELDS() \
\r
1352 typedef struct CvContour
\r
1354 CV_CONTOUR_FIELDS()
\r
1358 typedef CvContour CvPoint2DSeq;
\r
1360 /****************************************************************************************\
\r
1361 * Sequence types *
\r
1362 \****************************************************************************************/
\r
1364 #define CV_SEQ_MAGIC_VAL 0x42990000
\r
1366 #define CV_IS_SEQ(seq) \
\r
1367 ((seq) != NULL && (((CvSeq*)(seq))->flags & CV_MAGIC_MASK) == CV_SEQ_MAGIC_VAL)
\r
1369 #define CV_SET_MAGIC_VAL 0x42980000
\r
1370 #define CV_IS_SET(set) \
\r
1371 ((set) != NULL && (((CvSeq*)(set))->flags & CV_MAGIC_MASK) == CV_SET_MAGIC_VAL)
\r
1373 #define CV_SEQ_ELTYPE_BITS 9
\r
1374 #define CV_SEQ_ELTYPE_MASK ((1 << CV_SEQ_ELTYPE_BITS) - 1)
\r
1376 #define CV_SEQ_ELTYPE_POINT CV_32SC2 /* (x,y) */
\r
1377 #define CV_SEQ_ELTYPE_CODE CV_8UC1 /* freeman code: 0..7 */
\r
1378 #define CV_SEQ_ELTYPE_GENERIC 0
\r
1379 #define CV_SEQ_ELTYPE_PTR CV_USRTYPE1
\r
1380 #define CV_SEQ_ELTYPE_PPOINT CV_SEQ_ELTYPE_PTR /* &(x,y) */
\r
1381 #define CV_SEQ_ELTYPE_INDEX CV_32SC1 /* #(x,y) */
\r
1382 #define CV_SEQ_ELTYPE_GRAPH_EDGE 0 /* &next_o, &next_d, &vtx_o, &vtx_d */
\r
1383 #define CV_SEQ_ELTYPE_GRAPH_VERTEX 0 /* first_edge, &(x,y) */
\r
1384 #define CV_SEQ_ELTYPE_TRIAN_ATR 0 /* vertex of the binary tree */
\r
1385 #define CV_SEQ_ELTYPE_CONNECTED_COMP 0 /* connected component */
\r
1386 #define CV_SEQ_ELTYPE_POINT3D CV_32FC3 /* (x,y,z) */
\r
1388 #define CV_SEQ_KIND_BITS 3
\r
1389 #define CV_SEQ_KIND_MASK (((1 << CV_SEQ_KIND_BITS) - 1)<<CV_SEQ_ELTYPE_BITS)
\r
1391 /* types of sequences */
\r
1392 #define CV_SEQ_KIND_GENERIC (0 << CV_SEQ_ELTYPE_BITS)
\r
1393 #define CV_SEQ_KIND_CURVE (1 << CV_SEQ_ELTYPE_BITS)
\r
1394 #define CV_SEQ_KIND_BIN_TREE (2 << CV_SEQ_ELTYPE_BITS)
\r
1396 /* types of sparse sequences (sets) */
\r
1397 #define CV_SEQ_KIND_GRAPH (3 << CV_SEQ_ELTYPE_BITS)
\r
1398 #define CV_SEQ_KIND_SUBDIV2D (4 << CV_SEQ_ELTYPE_BITS)
\r
1400 #define CV_SEQ_FLAG_SHIFT (CV_SEQ_KIND_BITS + CV_SEQ_ELTYPE_BITS)
\r
1402 /* flags for curves */
\r
1403 #define CV_SEQ_FLAG_CLOSED (1 << CV_SEQ_FLAG_SHIFT)
\r
1404 #define CV_SEQ_FLAG_SIMPLE (2 << CV_SEQ_FLAG_SHIFT)
\r
1405 #define CV_SEQ_FLAG_CONVEX (4 << CV_SEQ_FLAG_SHIFT)
\r
1406 #define CV_SEQ_FLAG_HOLE (8 << CV_SEQ_FLAG_SHIFT)
\r
1408 /* flags for graphs */
\r
1409 #define CV_GRAPH_FLAG_ORIENTED (1 << CV_SEQ_FLAG_SHIFT)
\r
1411 #define CV_GRAPH CV_SEQ_KIND_GRAPH
\r
1412 #define CV_ORIENTED_GRAPH (CV_SEQ_KIND_GRAPH|CV_GRAPH_FLAG_ORIENTED)
\r
1415 #define CV_SEQ_POINT_SET (CV_SEQ_KIND_GENERIC| CV_SEQ_ELTYPE_POINT)
\r
1416 #define CV_SEQ_POINT3D_SET (CV_SEQ_KIND_GENERIC| CV_SEQ_ELTYPE_POINT3D)
\r
1417 #define CV_SEQ_POLYLINE (CV_SEQ_KIND_CURVE | CV_SEQ_ELTYPE_POINT)
\r
1418 #define CV_SEQ_POLYGON (CV_SEQ_FLAG_CLOSED | CV_SEQ_POLYLINE )
\r
1419 #define CV_SEQ_CONTOUR CV_SEQ_POLYGON
\r
1420 #define CV_SEQ_SIMPLE_POLYGON (CV_SEQ_FLAG_SIMPLE | CV_SEQ_POLYGON )
\r
1422 /* chain-coded curves */
\r
1423 #define CV_SEQ_CHAIN (CV_SEQ_KIND_CURVE | CV_SEQ_ELTYPE_CODE)
\r
1424 #define CV_SEQ_CHAIN_CONTOUR (CV_SEQ_FLAG_CLOSED | CV_SEQ_CHAIN)
\r
1426 /* binary tree for the contour */
\r
1427 #define CV_SEQ_POLYGON_TREE (CV_SEQ_KIND_BIN_TREE | CV_SEQ_ELTYPE_TRIAN_ATR)
\r
1429 /* sequence of the connected components */
\r
1430 #define CV_SEQ_CONNECTED_COMP (CV_SEQ_KIND_GENERIC | CV_SEQ_ELTYPE_CONNECTED_COMP)
\r
1432 /* sequence of the integer numbers */
\r
1433 #define CV_SEQ_INDEX (CV_SEQ_KIND_GENERIC | CV_SEQ_ELTYPE_INDEX)
\r
1435 #define CV_SEQ_ELTYPE( seq ) ((seq)->flags & CV_SEQ_ELTYPE_MASK)
\r
1436 #define CV_SEQ_KIND( seq ) ((seq)->flags & CV_SEQ_KIND_MASK )
\r
1438 /* flag checking */
\r
1439 #define CV_IS_SEQ_INDEX( seq ) ((CV_SEQ_ELTYPE(seq) == CV_SEQ_ELTYPE_INDEX) && \
\r
1440 (CV_SEQ_KIND(seq) == CV_SEQ_KIND_GENERIC))
\r
1442 #define CV_IS_SEQ_CURVE( seq ) (CV_SEQ_KIND(seq) == CV_SEQ_KIND_CURVE)
\r
1443 #define CV_IS_SEQ_CLOSED( seq ) (((seq)->flags & CV_SEQ_FLAG_CLOSED) != 0)
\r
1444 #define CV_IS_SEQ_CONVEX( seq ) (((seq)->flags & CV_SEQ_FLAG_CONVEX) != 0)
\r
1445 #define CV_IS_SEQ_HOLE( seq ) (((seq)->flags & CV_SEQ_FLAG_HOLE) != 0)
\r
1446 #define CV_IS_SEQ_SIMPLE( seq ) ((((seq)->flags & CV_SEQ_FLAG_SIMPLE) != 0) || \
\r
1447 CV_IS_SEQ_CONVEX(seq))
\r
1449 /* type checking macros */
\r
1450 #define CV_IS_SEQ_POINT_SET( seq ) \
\r
1451 ((CV_SEQ_ELTYPE(seq) == CV_32SC2 || CV_SEQ_ELTYPE(seq) == CV_32FC2))
\r
1453 #define CV_IS_SEQ_POINT_SUBSET( seq ) \
\r
1454 (CV_IS_SEQ_INDEX( seq ) || CV_SEQ_ELTYPE(seq) == CV_SEQ_ELTYPE_PPOINT)
\r
1456 #define CV_IS_SEQ_POLYLINE( seq ) \
\r
1457 (CV_SEQ_KIND(seq) == CV_SEQ_KIND_CURVE && CV_IS_SEQ_POINT_SET(seq))
\r
1459 #define CV_IS_SEQ_POLYGON( seq ) \
\r
1460 (CV_IS_SEQ_POLYLINE(seq) && CV_IS_SEQ_CLOSED(seq))
\r
1462 #define CV_IS_SEQ_CHAIN( seq ) \
\r
1463 (CV_SEQ_KIND(seq) == CV_SEQ_KIND_CURVE && (seq)->elem_size == 1)
\r
1465 #define CV_IS_SEQ_CONTOUR( seq ) \
\r
1466 (CV_IS_SEQ_CLOSED(seq) && (CV_IS_SEQ_POLYLINE(seq) || CV_IS_SEQ_CHAIN(seq)))
\r
1468 #define CV_IS_SEQ_CHAIN_CONTOUR( seq ) \
\r
1469 (CV_IS_SEQ_CHAIN( seq ) && CV_IS_SEQ_CLOSED( seq ))
\r
1471 #define CV_IS_SEQ_POLYGON_TREE( seq ) \
\r
1472 (CV_SEQ_ELTYPE (seq) == CV_SEQ_ELTYPE_TRIAN_ATR && \
\r
1473 CV_SEQ_KIND( seq ) == CV_SEQ_KIND_BIN_TREE )
\r
1475 #define CV_IS_GRAPH( seq ) \
\r
1476 (CV_IS_SET(seq) && CV_SEQ_KIND((CvSet*)(seq)) == CV_SEQ_KIND_GRAPH)
\r
1478 #define CV_IS_GRAPH_ORIENTED( seq ) \
\r
1479 (((seq)->flags & CV_GRAPH_FLAG_ORIENTED) != 0)
\r
1481 #define CV_IS_SUBDIV2D( seq ) \
\r
1482 (CV_IS_SET(seq) && CV_SEQ_KIND((CvSet*)(seq)) == CV_SEQ_KIND_SUBDIV2D)
\r
1484 /****************************************************************************************/
\r
1485 /* Sequence writer & reader */
\r
1486 /****************************************************************************************/
\r
1488 #define CV_SEQ_WRITER_FIELDS() \
\r
1489 int header_size; \
\r
1490 CvSeq* seq; /* the sequence written */ \
\r
1491 CvSeqBlock* block; /* current block */ \
\r
1492 schar* ptr; /* pointer to free space */ \
\r
1493 schar* block_min; /* pointer to the beginning of block*/\
\r
1494 schar* block_max; /* pointer to the end of block */
\r
1496 typedef struct CvSeqWriter
\r
1498 CV_SEQ_WRITER_FIELDS()
\r
1503 #define CV_SEQ_READER_FIELDS() \
\r
1504 int header_size; \
\r
1505 CvSeq* seq; /* sequence, beign read */ \
\r
1506 CvSeqBlock* block; /* current block */ \
\r
1507 schar* ptr; /* pointer to element be read next */ \
\r
1508 schar* block_min; /* pointer to the beginning of block */\
\r
1509 schar* block_max; /* pointer to the end of block */ \
\r
1510 int delta_index;/* = seq->first->start_index */ \
\r
1511 schar* prev_elem; /* pointer to previous element */
\r
1514 typedef struct CvSeqReader
\r
1516 CV_SEQ_READER_FIELDS()
\r
1520 /****************************************************************************************/
\r
1521 /* Operations on sequences */
\r
1522 /****************************************************************************************/
\r
1524 #define CV_SEQ_ELEM( seq, elem_type, index ) \
\r
1525 /* assert gives some guarantee that <seq> parameter is valid */ \
\r
1526 ( assert(sizeof((seq)->first[0]) == sizeof(CvSeqBlock) && \
\r
1527 (seq)->elem_size == sizeof(elem_type)), \
\r
1528 (elem_type*)((seq)->first && (unsigned)index < \
\r
1529 (unsigned)((seq)->first->count) ? \
\r
1530 (seq)->first->data + (index) * sizeof(elem_type) : \
\r
1531 cvGetSeqElem( (CvSeq*)(seq), (index) )))
\r
1532 #define CV_GET_SEQ_ELEM( elem_type, seq, index ) CV_SEQ_ELEM( (seq), elem_type, (index) )
\r
1534 /* Add element to sequence: */
\r
1535 #define CV_WRITE_SEQ_ELEM_VAR( elem_ptr, writer ) \
\r
1537 if( (writer).ptr >= (writer).block_max ) \
\r
1539 cvCreateSeqBlock( &writer); \
\r
1541 memcpy((writer).ptr, elem_ptr, (writer).seq->elem_size);\
\r
1542 (writer).ptr += (writer).seq->elem_size; \
\r
1545 #define CV_WRITE_SEQ_ELEM( elem, writer ) \
\r
1547 assert( (writer).seq->elem_size == sizeof(elem)); \
\r
1548 if( (writer).ptr >= (writer).block_max ) \
\r
1550 cvCreateSeqBlock( &writer); \
\r
1552 assert( (writer).ptr <= (writer).block_max - sizeof(elem));\
\r
1553 memcpy((writer).ptr, &(elem), sizeof(elem)); \
\r
1554 (writer).ptr += sizeof(elem); \
\r
1558 /* Move reader position forward: */
\r
1559 #define CV_NEXT_SEQ_ELEM( elem_size, reader ) \
\r
1561 if( ((reader).ptr += (elem_size)) >= (reader).block_max ) \
\r
1563 cvChangeSeqBlock( &(reader), 1 ); \
\r
1568 /* Move reader position backward: */
\r
1569 #define CV_PREV_SEQ_ELEM( elem_size, reader ) \
\r
1571 if( ((reader).ptr -= (elem_size)) < (reader).block_min ) \
\r
1573 cvChangeSeqBlock( &(reader), -1 ); \
\r
1577 /* Read element and move read position forward: */
\r
1578 #define CV_READ_SEQ_ELEM( elem, reader ) \
\r
1580 assert( (reader).seq->elem_size == sizeof(elem)); \
\r
1581 memcpy( &(elem), (reader).ptr, sizeof((elem))); \
\r
1582 CV_NEXT_SEQ_ELEM( sizeof(elem), reader ) \
\r
1585 /* Read element and move read position backward: */
\r
1586 #define CV_REV_READ_SEQ_ELEM( elem, reader ) \
\r
1588 assert( (reader).seq->elem_size == sizeof(elem)); \
\r
1589 memcpy(&(elem), (reader).ptr, sizeof((elem))); \
\r
1590 CV_PREV_SEQ_ELEM( sizeof(elem), reader ) \
\r
1594 #define CV_READ_CHAIN_POINT( _pt, reader ) \
\r
1596 (_pt) = (reader).pt; \
\r
1597 if( (reader).ptr ) \
\r
1599 CV_READ_SEQ_ELEM( (reader).code, (reader)); \
\r
1600 assert( ((reader).code & ~7) == 0 ); \
\r
1601 (reader).pt.x += (reader).deltas[(int)(reader).code][0]; \
\r
1602 (reader).pt.y += (reader).deltas[(int)(reader).code][1]; \
\r
1606 #define CV_CURRENT_POINT( reader ) (*((CvPoint*)((reader).ptr)))
\r
1607 #define CV_PREV_POINT( reader ) (*((CvPoint*)((reader).prev_elem)))
\r
1609 #define CV_READ_EDGE( pt1, pt2, reader ) \
\r
1611 assert( sizeof(pt1) == sizeof(CvPoint) && \
\r
1612 sizeof(pt2) == sizeof(CvPoint) && \
\r
1613 reader.seq->elem_size == sizeof(CvPoint)); \
\r
1614 (pt1) = CV_PREV_POINT( reader ); \
\r
1615 (pt2) = CV_CURRENT_POINT( reader ); \
\r
1616 (reader).prev_elem = (reader).ptr; \
\r
1617 CV_NEXT_SEQ_ELEM( sizeof(CvPoint), (reader)); \
\r
1620 /************ Graph macros ************/
\r
1622 /* Return next graph edge for given vertex: */
\r
1623 #define CV_NEXT_GRAPH_EDGE( edge, vertex ) \
\r
1624 (assert((edge)->vtx[0] == (vertex) || (edge)->vtx[1] == (vertex)), \
\r
1625 (edge)->next[(edge)->vtx[1] == (vertex)])
\r
1629 /****************************************************************************************\
\r
1630 * Data structures for persistence (a.k.a serialization) functionality *
\r
1631 \****************************************************************************************/
\r
1633 /* "black box" file storage */
\r
1634 typedef struct CvFileStorage CvFileStorage;
\r
1636 /* Storage flags: */
\r
1637 #define CV_STORAGE_READ 0
\r
1638 #define CV_STORAGE_WRITE 1
\r
1639 #define CV_STORAGE_WRITE_TEXT CV_STORAGE_WRITE
\r
1640 #define CV_STORAGE_WRITE_BINARY CV_STORAGE_WRITE
\r
1641 #define CV_STORAGE_APPEND 2
\r
1643 /* List of attributes: */
\r
1644 typedef struct CvAttrList
\r
1646 const char** attr; /* NULL-terminated array of (attribute_name,attribute_value) pairs. */
\r
1647 struct CvAttrList* next; /* Pointer to next chunk of the attributes list. */
\r
1651 CV_INLINE CvAttrList cvAttrList( const char** attr CV_DEFAULT(NULL),
\r
1652 CvAttrList* next CV_DEFAULT(NULL) )
\r
1661 struct CvTypeInfo;
\r
1663 #define CV_NODE_NONE 0
\r
1664 #define CV_NODE_INT 1
\r
1665 #define CV_NODE_INTEGER CV_NODE_INT
\r
1666 #define CV_NODE_REAL 2
\r
1667 #define CV_NODE_FLOAT CV_NODE_REAL
\r
1668 #define CV_NODE_STR 3
\r
1669 #define CV_NODE_STRING CV_NODE_STR
\r
1670 #define CV_NODE_REF 4 /* not used */
\r
1671 #define CV_NODE_SEQ 5
\r
1672 #define CV_NODE_MAP 6
\r
1673 #define CV_NODE_TYPE_MASK 7
\r
1675 #define CV_NODE_TYPE(flags) ((flags) & CV_NODE_TYPE_MASK)
\r
1677 /* file node flags */
\r
1678 #define CV_NODE_FLOW 8 /* Used only for writing structures in YAML format. */
\r
1679 #define CV_NODE_USER 16
\r
1680 #define CV_NODE_EMPTY 32
\r
1681 #define CV_NODE_NAMED 64
\r
1683 #define CV_NODE_IS_INT(flags) (CV_NODE_TYPE(flags) == CV_NODE_INT)
\r
1684 #define CV_NODE_IS_REAL(flags) (CV_NODE_TYPE(flags) == CV_NODE_REAL)
\r
1685 #define CV_NODE_IS_STRING(flags) (CV_NODE_TYPE(flags) == CV_NODE_STRING)
\r
1686 #define CV_NODE_IS_SEQ(flags) (CV_NODE_TYPE(flags) == CV_NODE_SEQ)
\r
1687 #define CV_NODE_IS_MAP(flags) (CV_NODE_TYPE(flags) == CV_NODE_MAP)
\r
1688 #define CV_NODE_IS_COLLECTION(flags) (CV_NODE_TYPE(flags) >= CV_NODE_SEQ)
\r
1689 #define CV_NODE_IS_FLOW(flags) (((flags) & CV_NODE_FLOW) != 0)
\r
1690 #define CV_NODE_IS_EMPTY(flags) (((flags) & CV_NODE_EMPTY) != 0)
\r
1691 #define CV_NODE_IS_USER(flags) (((flags) & CV_NODE_USER) != 0)
\r
1692 #define CV_NODE_HAS_NAME(flags) (((flags) & CV_NODE_NAMED) != 0)
\r
1694 #define CV_NODE_SEQ_SIMPLE 256
\r
1695 #define CV_NODE_SEQ_IS_SIMPLE(seq) (((seq)->flags & CV_NODE_SEQ_SIMPLE) != 0)
\r
1697 typedef struct CvString
\r
1704 /* All the keys (names) of elements in the readed file storage
\r
1705 are stored in the hash to speed up the lookup operations: */
\r
1706 typedef struct CvStringHashNode
\r
1710 struct CvStringHashNode* next;
\r
1714 typedef struct CvGenericHash CvFileNodeHash;
\r
1716 /* Basic element of the file storage - scalar or collection: */
\r
1717 typedef struct CvFileNode
\r
1720 struct CvTypeInfo* info; /* type information
\r
1721 (only for user-defined object, for others it is 0) */
\r
1724 double f; /* scalar floating-point number */
\r
1725 int i; /* scalar integer number */
\r
1726 CvString str; /* text string */
\r
1727 CvSeq* seq; /* sequence (ordered collection of file nodes) */
\r
1728 CvFileNodeHash* map; /* map (collection of named file nodes) */
\r
1733 #ifdef __cplusplus
\r
1736 typedef int (CV_CDECL *CvIsInstanceFunc)( const void* struct_ptr );
\r
1737 typedef void (CV_CDECL *CvReleaseFunc)( void** struct_dblptr );
\r
1738 typedef void* (CV_CDECL *CvReadFunc)( CvFileStorage* storage, CvFileNode* node );
\r
1739 typedef void (CV_CDECL *CvWriteFunc)( CvFileStorage* storage, const char* name,
\r
1740 const void* struct_ptr, CvAttrList attributes );
\r
1741 typedef void* (CV_CDECL *CvCloneFunc)( const void* struct_ptr );
\r
1742 #ifdef __cplusplus
\r
1746 typedef struct CvTypeInfo
\r
1750 struct CvTypeInfo* prev;
\r
1751 struct CvTypeInfo* next;
\r
1752 const char* type_name;
\r
1753 CvIsInstanceFunc is_instance;
\r
1754 CvReleaseFunc release;
\r
1756 CvWriteFunc write;
\r
1757 CvCloneFunc clone;
\r
1762 /**** System data types ******/
\r
1764 typedef struct CvPluginFuncInfo
\r
1767 void* default_func_addr;
\r
1768 const char* func_names;
\r
1769 int search_modules;
\r
1774 typedef struct CvModuleInfo
\r
1776 struct CvModuleInfo* next;
\r
1778 const char* version;
\r
1779 CvPluginFuncInfo* func_tab;
\r
1783 #endif /*_CXCORE_TYPES_H_*/
\r
1785 /* End of file. */
\r