Changeset d101b1 in git for libpolys/polys


Ignore:
Timestamp:
Jan 10, 2013, 12:25:13 PM (11 years ago)
Author:
Oleksandr Motsak <http://goo.gl/mcpzY>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
8836a9f43c10a0aea1e3ab6a8d9ecf52fe6a9128
Parents:
5fdf7adfacd151eb7c448b03ce681f70b7211e79
git-author:
Oleksandr Motsak <http://goo.gl/mcpzY>2013-01-10 12:25:13+01:00
git-committer:
Oleksandr Motsak <http://goo.gl/mcpzY>2013-01-10 16:45:07+01:00
Message:
Silence some warnings about statements without effect

Insired by [039a51b3aa3c77c2b7bae73d24de8521df45aed2]
Location:
libpolys/polys
Files:
10 edited

Legend:

Unmodified
Added
Removed

  • libpolys/polys/ext_fields/algext.cc

    r5fdf7a rd101b1  
    6161BOOLEAN  naDBTest(number a, const char *f, const int l, const coeffs r);
    6262#else
    63 #define naTest(a) ((void)(TRUE))
     63#define naTest(a) do {} while (0)
    6464#endif
    6565

  • libpolys/polys/ext_fields/transext.cc

    r5fdf7a rd101b1  
    8484BOOLEAN  ntDBTest(number a, const char *f, const int l, const coeffs r);
    8585#else
    86 #define ntTest(a) ((void)(TRUE))
     86#define ntTest(a) do {} while (0)
    8787#endif
    8888

  • libpolys/polys/kbuckets.h

    r5fdf7a rd101b1  
    157157BOOLEAN kbTest(kBucket_pt bucket);
    158158#else
    159 #define kbTest(bucket)  ((void)0)
     159#define kbTest(bucket)  do {} while (0)
    160160#endif
    161161

  • libpolys/polys/monomials/monomials.h

    r5fdf7a rd101b1  
    150150//void p_SetRingOfLeftv(leftv l, ring r);
    151151#else
    152 #define p_SetRingOfLm(p, r) ((void)0)
    153 //#define p_SetRingOfLeftv(l, r) ((void)0)
     152#define p_SetRingOfLm(p, r) do {} while (0)
     153//#define p_SetRingOfLeftv(l, r) do {} while (0)
    154154#endif
    155155
    156156#else // ! defined(PDEBUG)
    157 #define pFalseReturn(cond)           ((void)0)
    158 #define pAssume(cond)                ((void)0)
    159 #define pPolyAssume(cond)            ((void)0)
    160 #define _pPolyAssume(cond, p,r)      ((void)0)
    161 #define pAssumeReturn(cond)          ((void)0)
    162 #define pPolyAssumeReturn(cond)      ((void)0)
    163 #define _pPolyAssumeReturn(cond,p,r) ((void)0)
    164 #define p_SetRingOfLm(p, r)          ((void)0)
    165 //#define p_SetRingOfLeftv(l, r)       ((void)0)
     157#define pFalseReturn(cond)           do {} while (0)
     158#define pAssume(cond)                do {} while (0)
     159#define pPolyAssume(cond)            do {} while (0)
     160#define _pPolyAssume(cond, p,r)      do {} while (0)
     161#define pAssumeReturn(cond)          do {} while (0)
     162#define pPolyAssumeReturn(cond)      do {} while (0)
     163#define _pPolyAssumeReturn(cond,p,r) do {} while (0)
     164#define p_SetRingOfLm(p, r)          do {} while (0)
     165//#define p_SetRingOfLeftv(l, r)       do {} while (0)
    166166#endif // defined(PDEBUG)
    167167
    … …  
    177177#define pIfThen1          pIfThen
    178178#else
    179 #define pAssume1(cond)               ((void)0)
    180 #define pPolyAssume1(cond)           ((void)0)
    181 #define _pPolyAssume1(cond,p,r)      ((void)0)
    182 #define pAssumeReturn1(cond)         ((void)0)
    183 #define pPolyAssumeReturn1(cond)     ((void)0)
    184 #define _pPolyAssumeReturn1(cond,p,r)((void)0)
    185 #define p_LmCheckPolyRing1(p,r)       ((void)0)
    186 #define p_CheckRing1(r)             ((void)0)
    187 #define pIfThen1(cond, check)     ((void)0)
     179#define pAssume1(cond)               do {} while (0)
     180#define pPolyAssume1(cond)           do {} while (0)
     181#define _pPolyAssume1(cond,p,r)      do {} while (0)
     182#define pAssumeReturn1(cond)         do {} while (0)
     183#define pPolyAssumeReturn1(cond)     do {} while (0)
     184#define _pPolyAssumeReturn1(cond,p,r)do {} while (0)
     185#define p_LmCheckPolyRing1(p,r)       do {} while (0)
     186#define p_CheckRing1(r)             do {} while (0)
     187#define pIfThen1(cond, check)     do {} while (0)
    188188#endif // PDEBUG >= 1
    189189
    … …  
    199199#define pIfThen2          pIfThen
    200200#else
    201 #define pAssume2(cond)               ((void)0)
    202 #define pPolyAssume2(cond)           ((void)0)
    203 #define _pPolyAssume2(cond,p,r)      ((void)0)
    204 #define pAssumeReturn2(cond)         ((void)0)
    205 #define pPolyAssumeReturn2(cond)     ((void)0)
    206 #define _pPolyAssumeReturn2(cond,p,r)((void)0)
    207 #define p_LmCheckPolyRing2(p,r)       ((void)0)
    208 #define p_CheckRing2(r)             ((void)0)
    209 #define pIfThen2(cond, check)     ((void)0)
     201#define pAssume2(cond)               do {} while (0)
     202#define pPolyAssume2(cond)           do {} while (0)
     203#define _pPolyAssume2(cond,p,r)      do {} while (0)
     204#define pAssumeReturn2(cond)         do {} while (0)
     205#define pPolyAssumeReturn2(cond)     do {} while (0)
     206#define _pPolyAssumeReturn2(cond,p,r)do {} while (0)
     207#define p_LmCheckPolyRing2(p,r)       do {} while (0)
     208#define p_CheckRing2(r)             do {} while (0)
     209#define pIfThen2(cond, check)     do {} while (0)
    210210#endif // PDEBUG >= 2
    211211

  • libpolys/polys/monomials/p_polys.cc

    r5fdf7a rd101b1  
    42414241#define p_Delete__T p_ShallowDelete
    42424242#undef n_Delete__T
    4243 #define n_Delete__T(n, r) ((void)0)
     4243#define n_Delete__T(n, r) do {} while (0)
    42444244
    42454245#include <polys/templates/p_Delete__T.cc>

  • libpolys/polys/monomials/p_polys.h

    r5fdf7a rd101b1  
    154154#define pIsMonomOf(p, q)        (TRUE)
    155155#define pHaveCommonMonoms(p, q) (TRUE)
    156 #define p_LmCheckIsFromRing(p,r)  ((void)0)
    157 #define p_LmCheckPolyRing(p,r)    ((void)0)
    158 #define p_CheckIsFromRing(p,r)  ((void)0)
    159 #define p_CheckPolyRing(p,r)    ((void)0)
    160 #define p_CheckRing(r)          ((void)0)
    161 #define P_CheckIf(cond, check)  ((void)0)
    162 
    163 #define p_Test(p,r)     ((void) 1)
    164 #define p_LmTest(p,r)   ((void) 1)
    165 #define pp_Test(p, lmRing, tailRing) ((void) 1)
     156#define p_LmCheckIsFromRing(p,r)  do {} while (0)
     157#define p_LmCheckPolyRing(p,r)    do {} while (0)
     158#define p_CheckIsFromRing(p,r)  do {} while (0)
     159#define p_CheckPolyRing(p,r)    do {} while (0)
     160#define p_CheckRing(r)          do {} while (0)
     161#define P_CheckIf(cond, check)  do {} while (0)
     162
     163#define p_Test(p,r)     do {} while (0)
     164#define p_LmTest(p,r)   do {} while (0)
     165#define pp_Test(p, lmRing, tailRing) do {} while (0)
    166166
    167167#endif
    … …  
    11921192#endif
    11931193
    1194 #define pDivAssume(x)   ((void)0)
     1194#define pDivAssume(x)   do {} while (0)
    11951195
    11961196

  • libpolys/polys/prCopyMacros.h

    r5fdf7a rd101b1  
    99while (0)
    1010#else
    11 #define PR_DELETE_MONOM(src, r_src) ((void)0)
     11#define PR_DELETE_MONOM(src, r_src) do {} while (0)
    1212#endif
    1313
    … …  
    1818#undef PR_NO_SORT
    1919#define PR_NO_SORT 1
    20 #define PR_INIT_EVECTOR_COPY(r_src, r_dest) ((void)0)
     20#define PR_INIT_EVECTOR_COPY(r_src, r_dest) do {} while (0)
    2121#define PR_CPY_EVECTOR(dest, dest_r, src, src_r) \
    2222  omMemcpyW(dest->exp, src->exp, dest_r->ExpL_Size)
    … …  
    3636#if PR_NUMBER_SIMPLE > 0
    3737#define PR_NCOPY(n, r) n
    38 #define PR_NDELETE(n, r) ((void)0)
     38#define PR_NDELETE(n, r) do {} while (0)
    3939#define PR_NUMBER_SIMPLE_NAME NSimple
    4040#else
    … …  
    4646#undef PR_SORT_POLY
    4747#if PR_NO_SORT > 0
    48 #define PR_SORT_POLY(p, d_r, s_r) ((void)0)
     48#define PR_SORT_POLY(p, d_r, s_r) do {} while (0)
    4949#else
    5050#define PR_SORT_POLY(p, d_r, s_r) p = p_SortMerge(p, d_r, d_r->OrdSgn == s_r->OrdSgn)

  • libpolys/polys/simpleideals.h

    r5fdf7a rd101b1  
    6767// #define id_Print(id, r) id_Show(id, r)
    6868#else
    69 #define id_Test(A, r)  ((void)(TRUE))
    70 // #define id_Print(A, r) ((void)0)
     69#define id_Test(A, r)  do {} while (0)
     70// #define id_Print(A, r) do {} while (0)
    7171#endif
    7272

  • libpolys/polys/templates/p_Numbers.h

    r5fdf7a rd101b1  
    6262#include <coeffs/modulop.h>
    6363#define n_Copy_FieldZp(n, r)        n
    64 #define n_Delete_FieldZp(n, r)      ((void)0)
     64#define n_Delete_FieldZp(n, r)      do {} while (0)
    6565#define n_Mult_FieldZp(n1, n2, r)   npMultM(n1,n2, r->cf)
    6666#define n_Add_FieldZp(n1, n2, r)    npAddM(n1, n2, r->cf)

  • libpolys/polys/templates/p_Procs_Generate.cc

    r5fdf7a rd101b1  
    151151  if (length != LengthGeneral)
    152152  {
    153     printf("#define DECLARE_LENGTH(what) ((void)0)\n");
    154     printf("#define p_MemAddAdjust__T(p, r) ((void)0)\n");
     153    printf("#define DECLARE_LENGTH(what) do {} while (0)\n");
     154    printf("#define p_MemAddAdjust__T(p, r) do {} while (0)\n");
    155155  }
    156156  else
    … …  
    160160      printf("#define p_MemAddAdjust__T(p, r) p_MemAdd_NegWeightAdjust(p, r)\n");
    161161    else
    162       printf("#define p_MemAddAdjust__T(p, r) ((void)0)\n");
     162      printf("#define p_MemAddAdjust__T(p, r) do {} while (0)\n");
    163163  }
    164164
    … …  
    166166  printf("#undef DECLARE_ORDSGN\n");
    167167  if (ord != OrdGeneral)
    168     printf("#define DECLARE_ORDSGN(what) ((void)0)\n");
     168    printf("#define DECLARE_ORDSGN(what) do {} while (0)\n");
    169169  else
    170170    printf("#define DECLARE_ORDSGN(what) what\n");
    … …  
    176176    if (length != LengthGeneral)
    177177    {
    178       printf("#define DECLARE_LENGTH_2(what) ((void)0)\n");
     178      printf("#define DECLARE_LENGTH_2(what) do {} while (0)\n");
    179179      if (length < LengthTwo)
    180180        printf("#define p_MemCmp_Bitmask_2 p_MemCmp_Bitmask_%s\n", p_LengthEnum_2_String((p_Length) ((int) length + 2)));
    … …  
    190190
    191191    printf("#undef p_MemAddAdjust__T\n");
    192     printf("#define p_MemAddAdjust__T(p, r) ((void)0)\n");
     192    printf("#define p_MemAddAdjust__T(p, r) do {} while (0)\n");
    193193  }
    194194
Note: See TracChangeset for help on using the changeset viewer.