OpenCascade/occt
1
0
Fork 0
mirror of https://git.dev.opencascade.org/repos/occt.git synced 2025-08-14 13:30:48 +03:00
Code Activity

0024162: Eliminate CLang compiler warning

Browse Source 
Got rid from most cases of appearance '-Wunused-private-field' warning
This commit is contained in:
omy
2013-09-11 15:49:07 +04:00
committed by abv
parent eafb234bf1
commit 258ff83bb6
77 changed files with 151 additions and 334 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
src/AdvApp2Var/AdvApp2Var_ApproxF2var.cxx
View File

@@ -997,7 +997,7 @@ int mma1fer_(integer *,//ndimen,
/* 0 = constraints of passage to limits (i.e. C0), */
/* 1 = C0 + constraintes of 1st derivatives (i.e. C1), */
/* 2 = C1 + constraintes of 2nd derivatives (i.e. C2). */
/* NDGJAC: Degree of development in series to use for the calculation
/* NDGJAC: Degree of development in series to use for the calculation */
/* in the base of Jacobi. */
/* CRVJAC: Table of coeff. of the curve of approximation in the */
/* base of Jacobi. */
@@ -1022,7 +1022,7 @@ int mma1fer_(integer *,//ndimen,
/* =-1, warning, required tolerance can't be */
/* met with coefficients NFCLIM. */
/* = 1, order of constraints (IORDRE) is not within authorised values */
/*
/* COMMONS USED : */
/* ------------------ */
@@ -1204,7 +1204,7 @@ int AdvApp2Var_ApproxF2var::mma1her_(const integer *iordre,
/* DESCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
/* The part of HERMIT(*,2*i+j) table where j=1 or 2 and i=0 to IORDRE,
/* The part of HERMIT(*,2*i+j) table where j=1 or 2 and i=0 to IORDRE, */
/* contains the coefficients of the polynom of degree 2*IORDRE+1 */
/* such as ALL values in -1 and in +1 of this polynom and its */
/* derivatives till order of derivation IORDRE are NULL, */
@@ -1351,14 +1351,14 @@ int mma1jak_(integer *ndimen,
/* ------------------ */
/* NDIMEN: Total dimension of the space (sum of dimensions */
/* of sub-spaces) */
/* NBROOT: Nb of points of discretization of the iso, extremities not
/* NBROOT: Nb of points of discretization of the iso, extremities not */
/* included. */
/* IORDRE: Order of constraint at the extremities of the boundary */
/* -1 = no constraints, */
/* 0 = constraints of passage of limits (i.e. C0), */
/* 1 = C0 + constraints of 1st derivatives (i.e. C1), */
/* 2 = C1 + constraints of 2nd derivatives (i.e. C2). */
/* NDGJAC: Degree of development in series to be used for calculation in the
/* NDGJAC: Degree of development in series to be used for calculation in the */
/* base of Jacobi. */
/* OUTPUT ARGUMENTS : */
@@ -1908,7 +1908,7 @@ int AdvApp2Var_ApproxF2var::mma2ac2_(const integer *ndimen,
/* ------------------- */
/* PATJAC: Table of coefficients of the polynom P(u,v) by approximation */
/* of F(u,v) WITH taking into account of constraints. */
/* > *//*
/* > */
/* > */
@@ -2350,7 +2350,7 @@ int mma2cd1_(integer *ndimen,
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
/* VROOTL: Table of discretization parameters on (-1,1) by V.
/* VROOTL: Table of discretization parameters on (-1,1) by V. */
/* IORDRU: Order of constraint imposed at the extremities of iso-V */
/* = 0, calculate the extremities of iso-V */
/* = 1, calculate, additionally, the 1st derivative in the direction of iso-V */
@@ -2707,7 +2707,7 @@ int mma2cd2_(integer *ndimen,
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
/* VROOTL: Table of discretization parameters on (-1,1) by V.
/* VROOTL: Table of discretization parameters on (-1,1) by V. */
/* IORDRV: Order of constraint imposed at the extremities of iso-V */
/* = 0, calculate the extremities of iso-V */
/* = 1, calculate, additionally, the 1st derivative in the direction of iso-V */
@@ -3351,7 +3351,7 @@ int AdvApp2Var_ApproxF2var::mma2cdi_( integer *ndimen,
*/
/* NBPNTV: Nb of INTERNAL parameters of discretisation by V. */
/* This is also the nb of root of Legendre polynom where discretization is done. */
/* VROOTL: Table of parameters of discretisation ON (-1,1) by V.
/* VROOTL: Table of parameters of discretisation ON (-1,1) by V.*/
/* IORDRV: Order of constraint imposed at the extremities of iso-U */
/* = 0, calculate the extremities of iso-U */
@@ -4323,7 +4323,7 @@ L300:
/* L320: */
}
/* ----- Contribution of calculated terms to the approximation error
/* ----- Contribution of calculated terms to the approximation error */
/* for terms (I,J) with MINU <= I <= MAXU, MINV <= J <= MAXV. */
idim = 1;
@@ -4507,7 +4507,7 @@ L600:
/* L700: */
}
/* ----- Contribution of calculated terms to the approximation error
/* ----- Contribution of calculated terms to the approximation error */
/* for terms (I,J) with MINU <= I <= MAXU, MINV <= J <= MAXV */
idim = 1;
@@ -4690,7 +4690,7 @@ int mma2cfu_(integer *ndujac,
/* FUNCTION : */
/* ---------- */
/* Calculate the terms connected to degree NDUJAC by U of the polynomial approximation */
/* of function F(u,v), starting from its discretisation
/* of function F(u,v), starting from its discretisation */
/* on the roots of Legendre polynom of degree */
/* NBPNTU by U and NBPNTV by V. */
@@ -4820,7 +4820,7 @@ int mma2cfu_(integer *ndujac,
}
}
/* ------- Add terms connected to the supplementary root (0.D0) ------
/* ------- Add terms connected to the supplementary root (0.D0) ------ */
/* ----------- of Legendre polynom of uneven degree NBPNTU -----------
*/
/* --> Only even NDUJAC terms are modified as GSSUTB(0) = 0 */
@@ -4905,7 +4905,7 @@ int mma2cfv_(integer *ndvjac,
/* FUNCTION : */
/* ---------- */
/* Calculate the coefficients of polynomial approximation of F(u,v)
/* Calculate the coefficients of polynomial approximation of F(u,v) */
/* of degree NDVJAC by V and of degree by U varying from MINDGU to MAXDGU.
*/
@@ -4917,7 +4917,7 @@ int mma2cfv_(integer *ndvjac,
/* ------------------ */
/* NDVJAC: Degree of the polynom of approximation by V. */
/* The representation in the orthogonal base starts from degre 0.
/* The representation in the orthogonal base starts from degre 0. */
/* The polynomial base is the base of Jacobi of order -1 */
/* (Legendre), 0, 1 or 2 */
/* MINDGU: Degree minimum by U of coeff. to calculate. */
@@ -4927,9 +4927,9 @@ int mma2cfv_(integer *ndvjac,
/* by Gauss method. It is reqired that NBPNTV = 30, 40, 50 or 61 and NDVJAC < NBPNTV. */
/* GSSVTB: Table of coefficients of integration by Gauss method */
/* by V for NDVJAC fixed: j varies from 0 to NBPNTV/2. */
/* CHPAIR: Table of terms connected to degrees from MINDGU to MAXDGU by U to
/* CHPAIR: Table of terms connected to degrees from MINDGU to MAXDGU by U to */
/* calculate the coeff. of approximation of EVEN degree NDVJAC by V. */
/* CHIMPR: Table of terms connected to degrees from MINDGU to MAXDGU by U to
/* CHIMPR: Table of terms connected to degrees from MINDGU to MAXDGU by U to */
/* calculate the coeff. of approximation of UNEVEN degree NDVJAC by V. */
/* OUTPUT ARGUMENTS : */
@@ -6260,7 +6260,7 @@ int AdvApp2Var_ApproxF2var::mma2fnc_(integer *ndimen,
/* ERRMAX: Table of MAX errors (sub-space by sub-space) */
/* committed in the approximation of FONCNP by NBCRBE curves. */
/* ERRMOY: Table of AVERAGE errors (sub-space by sub-space) */
/* committed in the approximation of FONCNP by NBCRBE curves.
/* committed in the approximation of FONCNP by NBCRBE curves. */
/* IERCOD: Error code: */
/* -1 = ERRMAX > EPSAPR for at least one sub-space. */
/* (the resulting curves of at least mathematic degree NCFLIM-1 */
@@ -7784,7 +7784,7 @@ int AdvApp2Var_ApproxF2var::mmapptt_(const integer *ndgjac,
/* FUNCTION : */
/* ---------- */
/* Load the elements required for integration by */
/* Gauss method to obtain the coefficients in the base of
/* Gauss method to obtain the coefficients in the base of */
/* Legendre of the approximation by the least squares of a */
/* function. The elements are stored in commons MMAPGSS */
/* (case without constraint), MMAPGS0 (constraints C0), MMAPGS1 */
@@ -7797,7 +7797,7 @@ int AdvApp2Var_ApproxF2var::mmapptt_(const integer *ndgjac,
/* INPUT ARGUMENTS : */
/* ------------------ */
/* NDGJAC : Max degree of the polynom of approximation. */
/* The representation in orthogonal base goes from degree
/* The representation in orthogonal base goes from degree */
/* 0 to degree NDGJAC-2*(JORDRE+1). The polynomial base */
/* is the base of Jacobi of order -1 (Legendre), 0, 1 and 2 */
/* NBPNTS : Degree of the polynom of Legendre on the roots which of */

60
src/AdvApp2Var/AdvApp2Var_MathBase.cxx
View File

@@ -736,7 +736,7 @@ int mmaper2_(integer *ncofmx,
/* KEYWORDS : */
/* ----------- */
/* JACOBI, POLYGON, APPROXIMATION, ERROR. */
/*
/**/
/* INPUT ARGUMENTS : */
/* ------------------ */
/* NCOFMX : Max. degree of the curve. */
@@ -1793,7 +1793,7 @@ int mmatvec_(integer *nligne,
/* GNSTOC: Number of coefficients in the profile of matrix GMATRI */
/* GPOSIT: Table of positioning of terms of storage */
/* GPOSIT(1,I) contains the number of terms-1 on the line I
/* GPOSIT(1,I) contains the number of terms-1 on the line I */
/* in the profile of the matrix. */
/* GPOSIT(2,I) contains the index of storage of diagonal term*/
/* of line I */
@@ -1804,7 +1804,7 @@ int mmatvec_(integer *nligne,
/* GMATRI : Matrix of constraints in form of profile */
/* VECIN : Input vector */
/* DEBLIG : Line indexusing which the vector matrix is calculated */
/*
/**/
/* OUTPUT ARGUMENTS */
/* --------------------- */
/* VECOUT : VECTOR PRODUCT */
@@ -3322,7 +3322,7 @@ int mmdrvcb_(integer *ideriv,
integer ndeg, i__, j, nd, ndgcrb, iptpnt, ibb;
/* ***********************************************************************
/* *********************************************************************** */
/* FUNCTION : */
/* ---------- */
@@ -3731,7 +3731,7 @@ int AdvApp2Var_MathBase::mmeps1_(doublereal *epsilo)
/* DEMSCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
/* INITIALISATION : profile , **VIA MPRFTX** at input in stream
/* INITIALISATION : profile , **VIA MPRFTX** at input in stream */
/* loading of default values of the profile in MPRFTX at input */
/* in stream. They are preserved in local variables of MPRFTX */
@@ -3812,7 +3812,7 @@ int mmexthi_(integer *ndegre,
/* DESCRIPTION/NOTES/LIMITATIONS : */
/* ----------------------------------- */
/* ATTENTION: The condition on NDEGRE ( 2 <= NDEGRE <= 61) is not */
/* tested. The caller should make the test.
/* tested. The caller should make the test. */
/* Name of the routine */
@@ -4415,7 +4415,7 @@ int AdvApp2Var_MathBase::mmfmcar_(integer *ndimen,
/* ---> The max number of coeff by u and v of PATOLD is 61 */
/* ---> If NCOEFU < NCOFMX, the data is compressed by MMFMCA9 before
/* ---> If NCOEFU < NCOFMX, the data is compressed by MMFMCA9 before */
/* limitation by v to get time during the execution */
/* of MMARC41 that follows (the square is processed as a curve of
*/
@@ -4783,7 +4783,7 @@ int AdvApp2Var_MathBase::mmfmtb1_(integer *maxsz1,
/* OUTPUT ARGUMENTS : */
/* ------------------- */
/* TABLE2: Table of reals by two dimensions, containing the transposition
/* TABLE2: Table of reals by two dimensions, containing the transposition */
/* of the rectangular table TABLE1. */
/* ISIZE2: Nb of useful elements of TABLE2 on the 1st dimension */
/* JSIZE2: Nb of useful elements of TABLE2 on the 2nd dimension */
@@ -4922,7 +4922,7 @@ int AdvApp2Var_MathBase::mmgaus1_(integer *ndimf,
/* between limits XD and XF . */
/* The function should be calculated for any value */
/* of the variable in the given interval.. */
/* The method GAUSS-LEGENDRE is used.
/* The method GAUSS-LEGENDRE is used. */
/* For explications refer to the book : */
/* Complements de mathematiques a l'usage des Ingenieurs de */
/* l'electrotechnique et des telecommunications. */
@@ -4994,7 +4994,7 @@ int AdvApp2Var_MathBase::mmgaus1_(integer *ndimf,
/* If you wish to calculate the integral with a given precision, */
/* loop on k varying from 1 to 10 and test the difference of 2
*/
/* consecutive iterations. Stop the loop if this difference is less that
/* consecutive iterations. Stop the loop if this difference is less that */
/* an epsilon value set to 10E-6 for example. */
/* If S1 and S2 are 2 successive iterations, test following this example :
*/
@@ -5166,7 +5166,7 @@ int mmherm0_(doublereal *debfin,
/* FUNCTION : */
/* ---------- */
/* Used to STORE coefficients of Hermit interpolation polynoms
/* Used to STORE coefficients of Hermit interpolation polynoms */
/* KEYWORDS : */
/* ----------- */
@@ -5458,7 +5458,7 @@ int mmherm1_(doublereal *debfin,
/* there is no choice : ORDRMX should be equal to the value */
/* of PARAMETER IORDMX of INCLUDE MMCMHER, or 2 for the moment */
/* IORDRE (2) : Orders of constraints in each corresponding parameter DEBFIN(I)
/* IORDRE (2) : Orders of constraints in each corresponding parameter DEBFIN(I) */
/* should be between -1 (no constraints) and ORDRMX. */
@@ -5504,7 +5504,7 @@ int mmherm1_(doublereal *debfin,
/* FUNCTION : */
/* ---------- */
/* Serves to STORE the coefficients of Hermit interpolation polynoms
/* Serves to STORE the coefficients of Hermit interpolation polynoms */
/* KEYWORDS : */
/* ----------- */
@@ -5940,7 +5940,7 @@ L9999:
/* . Level of de debug = 3 */
/*
/**/
/* DECLARATIONS , CONTROL OF INPUT ARGUMENTS , INITIALIZATION */
/* ***********************************************************************
*/
@@ -6371,8 +6371,8 @@ int mmloncv_(integer *ndimax,
/* FUNCTION : Length of an arc of curve on a given interval */
/* ---------- for a function the mathematic representation */
/* which of is a multidimensional polynom. */
/* The polynom is a set of polynoms the coefficients which of are ranked
/* in a table with 2 indices, each line relative to 1 polynom. */
/* The polynom is a set of polynoms the coefficients which of are ranked */
/* in a table with 2 indices, each line relative to 1 polynom. */
/* The polynom is defined by its coefficients ordered by increasing
* power of the variable. */
/* All polynoms have the same number of coefficients (and the same degree). */
@@ -7358,9 +7358,9 @@ L9999:
/* NISTOC: NUMBER OF COEFFICIENTS IN THE PROFILE */
/* DIMMAT: NUMBER OF LINE OF THE SYMMETRIC SQUARE MATRIX */
/* APOSIT: TABLE OF POSITIONING OF STORAGE TERMS */
/* APOSIT(1,I) CONTAINS THE NUMBER OF TERMES-1 ON LINE
/* APOSIT(1,I) CONTAINS THE NUMBER OF TERMES-1 ON LINE */
/* I IN THE PROFILE OF THE MATRIX */
/* APOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF DIAGONAL TERM
/* APOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF DIAGONAL TERM */
/* OF LINE I */
@@ -7538,7 +7538,7 @@ L9999:
/* GNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX OF CONSTRAINTS */
/* MNSTOC: NOMBERS OF TERMS IN THE PROFILE OF THE MATRIX M= G H t(G) */
/* where H IS THE HESSIAN MATRIX AND G IS THE MATRIX OF CONSTRAINTS */
/* MATSYH: TRIANGULAR INFERIOR PART OF THE HESSIAN MATRIX
/* MATSYH: TRIANGULAR INFERIOR PART OF THE HESSIAN MATRIX */
/* IN FORM OF PROFILE */
/* MATSYG: MATRIX OF CONSTRAINTS IN FORM OF PROFILE */
/* VECSYH: VECTOR OF THE SECOND MEMBER ASSOCIATED TO MATSYH */
@@ -7557,11 +7557,11 @@ L9999:
/* GPOSIT: TABLE OF POSITIONING OF THE MATRIX OF CONSTRAINTS */
/* GPOSIT(1,I) CONTAINS THE NUMBER OF TERMS OF LINE I */
/* WHICH ARE IN THE PROFILE */
/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE LAST TERM
/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE LAST TERM */
/* OF LINE I WHICH IS IN THE PROFILE */
/* GPOSIT(3,I) CONTAINS THE NUMBER OF COLUMN CORRESPONDING */
/* TO THE FIRST TERM OF LINE I WHICH IS IN THE PROFILE */
/* MMPOSUI, MPOSIT: SAME STRUCTURE AS HPOSUI, BUT FOR MATRIX
/* MMPOSUI, MPOSIT: SAME STRUCTURE AS HPOSUI, BUT FOR MATRIX */
/* M=G H t(G) */
@@ -8207,7 +8207,7 @@ int mmrslw_(integer *normax,
}
goto L9999;
/* ------If the absolute value of a pivot is smaller than --------
/* ------If the absolute value of a pivot is smaller than -------- */
/* ---------- EPSPIV: return the code of error. ------------
*/
@@ -8620,7 +8620,7 @@ L1000:
goto L1000;
/* -------------- TEST IF TPARAM IS NOT A VALUE ---------
/* -------------- TEST IF TPARAM IS NOT A VALUE --------- */
/* ------------------------OF TABLEV UP TO EPSIL ----------------------
*/
@@ -8689,11 +8689,11 @@ int mmtmave_(integer *nligne,
/* NLIGNE : NUMBER OF LINE OF THE MATRIX */
/* NCOLON : NOMBER OF COLUMN OF THE MATRIX */
/* GPOSIT: TABLE OF POSITIONING OF TERMS OF STORAGE */
/* GPOSIT(1,I) CONTAINS THE NUMBER of TERMS-1 ON LINE
I IN THE PROFILE OF THE MATRIX */
/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE DIAGONAL TERM
/* GPOSIT(1,I) CONTAINS THE NUMBER of TERMS-1 ON LINE */
/* I IN THE PROFILE OF THE MATRIX */
/* GPOSIT(2,I) CONTAINS THE INDEX OF STORAGE OF THE DIAGONAL TERM*/
/* OF LINE I */
/* GPOSIT(3,I) CONTAINS THE INDEX COLUMN OF THE FIRST TERM OF
/* GPOSIT(3,I) CONTAINS THE INDEX COLUMN OF THE FIRST TERM OF */
/* PROFILE OF LINE I */
/* GNSTOC : NOMBER OF TERM IN THE PROFILE OF GMATRI */
/* GMATRI : MATRIX OF CONSTRAINTS IN FORM OF PROFILE */
@@ -9433,7 +9433,7 @@ int mmtrpj6_(integer *ncofmx,
/* OUTPUT ARGUMENTS : */
/* ------------------- */
/* YCVMAX : Auxiliary table (max error on each dimension).
/* YCVMAX : Auxiliary table (max error on each dimension). */
/* EPSTRC : Precision of the approximation. */
/* NCFNEW : Degree +1 of the resulting polynom. */
@@ -9685,7 +9685,7 @@ L9999:
/* ----------------------------------- */
/* VECTOR and VECNRM can be identic. */
/* The norm of vector is calculated and each component is divided by
/* The norm of vector is calculated and each component is divided by */
/* this norm. After this it is checked if all componentes of the */
/* vector except for one cost 0 with machine precision. In */
/* this case the quasi-null components are set to 0.D0. */
@@ -10727,7 +10727,7 @@ int mvgaus0_(integer *kindic,
/* to 40 directly (ATTENTION to overload - to avoid it, */
/* preview UROOTL and HILTAB dimensioned at least to 20). */
/* The value of coefficients was calculated with quadruple precision
/* The value of coefficients was calculated with quadruple precision */
/* by JJM with help of GD. */
/* Checking of roots was done by GD. */

4
src/AdvApp2Var/AdvApp2Var_SysBase.cxx
View File

@@ -1548,7 +1548,7 @@ int mamdlng_(char *,//cmdlng,
/* CHL10N*4 : LIST OF POSSIBLE VALUES OF THE LOCALIZATION : */
/* 'FRA ','DEU ','ENG ', 'JIS ' */
/* B) CHCOUR*4, CHPREC*4, CHSUIV*4 : CURRENT, PREVIOUS AND NEXT APPLICATION
/* B) CHCOUR*4, CHPREC*4, CHSUIV*4 : CURRENT, PREVIOUS AND NEXT APPLICATION */
/* C) CHMODE*4 : CURRENT MODE (NOT USED) */
@@ -1737,7 +1737,7 @@ int maoverf_(integer *nbentr,
/* The idea is to minimize the number of calls */
/* to the routine of transfer of numeric zones, */
/* ---------- for the reason of performance. */
/* ! buffer ! For this a table of NLONGR
/* ! buffer ! For this a table of NLONGR */
/* !__________! DOUBLE PRECISIONs is reserved. This buffer is initialized by */
/* <----------> the instruction DATA. The overflow is accessed in a */
/* NLONGR*8 specific COMMON not by a routine as */