Searched refs:nPolys (Results 1 - 13 of 13) sorted by relevance

/inkscape/src/libuemf/
H A Duwmf_print.h38 void polypolygon_print(uint16_t nPolys, const uint16_t *aPolyCounts, const char *Points);
H A Duemf_safe.c211 int nPolys = pEmr->nPolys; local
213 if(IS_MEM_UNSAFE(pEmr->aPolyCounts, nPolys*4, blimit))return(0);
214 record += sizeof(U_EMRPOLYPOLYLINE) - 4 + sizeof(uint32_t)* nPolys;
269 int nPolys = pEmr->nPolys; local
271 if(IS_MEM_UNSAFE(pEmr->aPolyCounts, nPolys*4, blimit))return(0);
272 record += sizeof(U_EMRPOLYPOLYLINE16) - 4 + sizeof(uint32_t)* nPolys;
H A Duemf_endian.c552 int nPolys=0; local
557 nPolys = pEmr->nPolys;
562 U_swap4(&(pEmr->nPolys),2); // nPolys cptl
565 nPolys = pEmr->nPolys;
568 if(IS_MEM_UNSAFE((pEmr->aPolyCounts), nPolys*4, blimit))return(0);
569 U_swap4(pEmr->aPolyCounts,nPolys); // aPolyCounts[]
570 record += sizeof(U_EMRPOLYPOLYLINE) - 4 + sizeof(uint32_t)* nPolys;
653 int nPolys=0; local
[all...]
H A Duwmf_endian.c189 uint16_t nPolys; local
191 if(torev){ nPolys = *(uint16_t *)(pp + offsetof(U_POLYPOLYGON, nPolys)); }
192 U_swap2(pp + offsetof(U_POLYPOLYGON, nPolys),1);
193 if(!torev){ nPolys = *(uint16_t *)(pp + offsetof(U_POLYPOLYGON, nPolys)); }
196 for(totPoints=0,i=0;i<nPolys; i++){ totPoints += aPolyCounts[i]; }
198 U_swap2(aPolyCounts,nPolys);
200 for(totPoints=0,i=0;i<nPolys; i++){ totPoints += aPolyCounts[i]; }
202 U_swap2(&(aPolyCounts[nPolys]),
[all...]
H A Duemf.c2866 CORE2(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cptl, const U_POINTL *points){
2874 CORE10(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points){ (16bit form of CORE2)
2903 char *U_EMR_CORE2_set(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cptl, const U_POINTL *points){ argument
2909 cbPolys = sizeof(uint32_t)*nPolys;
2916 ((PU_EMRPOLYPOLYLINE) record)->nPolys = nPolys;
3076 char *U_EMR_CORE10_set(uint32_t iType, U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points){ argument
3081 cbPolys = sizeof(uint32_t)*nPolys;
3089 ((PU_EMRPOLYPOLYLINE16) record)->nPolys = nPolys;
3380 U_EMRPOLYPOLYLINE_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cptl, const U_POINTL *points ) argument
3400 U_EMRPOLYPOLYGON_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cptl, const U_POINTL *points ) argument
5080 U_EMRPOLYPOLYLINE16_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cpts, const U_POINT16 *points ) argument
5100 U_EMRPOLYPOLYGON16_set( const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts, const uint32_t cpts, const U_POINT16 *points ) argument
[all...]
H A Duemf_print.c692 printf(" nPolys: %d\n",pEmr->nPolys );
695 IF_MEM_UNSAFE_PRINT_AND_RETURN(pEmr->aPolyCounts, pEmr->nPolys*sizeof(U_POLYCOUNTS), blimit);
696 for(i=0;i<pEmr->nPolys; i++){
700 PU_POINTL paptl = (PU_POINTL)((char *)pEmr->aPolyCounts + sizeof(uint32_t)* pEmr->nPolys);
821 printf(" nPolys: %d\n",pEmr->nPolys );
824 IF_MEM_UNSAFE_PRINT_AND_RETURN(&(pEmr->aPolyCounts), pEmr->nPolys*sizeof(U_POLYCOUNTS), blimit);
825 for(i=0;i<pEmr->nPolys; i++){
830 PU_POINT16 papts = (PU_POINT16)((char *)pEmr->aPolyCounts + pEmr->nPolys*sizeo
[all...]
H A Duwmf_print.c284 \param nPolys Number of elements in aPolyCounts
289 uint16_t nPolys,
295 for(i=0; i<nPolys; i++, aPolyCounts++){
962 uint16_t nPolys; local
965 int size = U_WMRPOLYPOLYGON_get(contents, &nPolys, &aPolyCounts, &Points);
967 printf(" Polygons:"); polypolygon_print(nPolys, aPolyCounts, Points); printf("\n");
288 polypolygon_print( uint16_t nPolys, const uint16_t *aPolyCounts, const char *Points ) argument
H A Duemf.h2175 U_NUM_POLYCOUNTS nPolys; //!< Number of elements in aPolyCounts member in struct:__anon153
2968 U_NUM_POLYCOUNTS nPolys; //!< Number of elements in aPolyCounts member in struct:__anon203
3481 char *U_EMRPOLYPOLYLINE_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,
3483 char *U_EMRPOLYPOLYGON_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,
3587 char *U_EMRPOLYPOLYLINE16_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points);
3588 char *U_EMRPOLYPOLYGON16_set(const U_RECTL rclBounds, const uint32_t nPolys, const uint32_t *aPolyCounts,const uint32_t cpts, const U_POINT16 *points);
H A Duwmf.c3269 \param nPolys Number of elements in aPolyCounts
3274 const uint16_t nPolys,
3282 cbPolys = sizeof(uint16_t)*nPolys;
3283 for(i=cbPoints=0; i<nPolys; i++){ cbPoints += U_SIZE_POINT16*aPolyCounts[i]; }
3285 if(nPolys==0 || cbPoints==0)return(NULL);
3287 irecsize = U_SIZE_METARECORD + 2 + cbPolys + cbPoints; /* core WMR + nPolys + two array sizes in bytes */
3292 memcpy(record + off, &nPolys, 2); off+=2;
5913 \param nPolys Number of elements in aPolyCounts
5919 uint16_t *nPolys,
5926 memcpy(nPolys, content
3273 U_WMRPOLYPOLYGON_set( const uint16_t nPolys, const uint16_t *aPolyCounts, const U_POINT16 *Points ) argument
5917 U_WMRPOLYPOLYGON_get( const char *contents, uint16_t *nPolys, const uint16_t **aPolyCounts, const char **Points ) argument
[all...]
H A Duwmf.h1026 aPoints starts at aPolyCounts[nPolys]
1029 uint16_t nPolys; //!< Number of polygons member in struct:__anon350
2470 int U_WMRPOLYPOLYGON_get(const char *contents, uint16_t *nPolys, const uint16_t **aPolyCounts, const char **Points);
/inkscape/src/extension/internal/
H A Dwmf-print.cpp1194 int nPolys = 0; local
1199 nPolys++;
1201 nPolys = 0;
1206 if (nPolys > 1) { // a single polypolygon, a single polygon falls through to the else
1212 n16hold = n16ptr = (uint16_t *) malloc(nPolys * sizeof(uint16_t));
1242 rec = U_WMRPOLYPOLYGON_set(nPolys, n16hold, pt16hold);
H A Dwmf-inout.cpp2664 uint16_t nPolys; local
2668 nSize = U_WMRPOLYPOLYGON_get(contents, &nPolys, &aPolyCounts, &Points);
2674 for (n=cpts=0; n < nPolys; n++) { cpts += aPolyCounts[n]; }
2678 for (n=0; n < nPolys && i<cpts; n++) {
H A Demf-inout.cpp2010 U_POINTL *aptl = (PU_POINTL) &pEmr->aPolyCounts[pEmr->nPolys];
2013 for (n=0; n<pEmr->nPolys && i<pEmr->cptl; n++) {
3345 PU_POINT16 apts = (PU_POINT16) &pEmr->aPolyCounts[pEmr->nPolys];
3348 for (n=0; n<pEmr->nPolys && i<pEmr->cpts; n++) {

Completed in 914 milliseconds