37 #define pNext(p) ((p)->next)
38 #define pIter(p) (void)((p) = (p)->next)
51 #define p_GetCoeff(p,r) pGetCoeff(p)
60 #define pSetCoeff0(p,n) (p)->coef=(n)
61 #define p_SetCoeff0(p,n,r) pSetCoeff0(p,n)
64 #define __p_GetComp(p, r) (p)->exp[r->pCompIndex]
65 #define p_GetComp(p, r) ((long) (r->pCompIndex >= 0 ? __p_GetComp(p, r) : 0))
79 #define pAssumeReturn(cond) \
84 dPolyReportError(NULL, NULL, "pAssume violation of: %s", \
91 #define pAssume(cond) \
96 dPolyReportError(NULL, NULL, "pAssume violation of: %s", \
102 #define _pPolyAssumeReturn(cond, p, r) \
107 dPolyReportError(p, r, "pPolyAssume violation of: %s", \
114 #define _pPolyAssume(cond,p,r) \
119 dPolyReportError(p, r, "pPolyAssume violation of: %s", \
125 #define _pPolyAssumeReturnMsg(cond, msg, p, r) \
130 dPolyReportError(p, r, "%s ", msg); \
136 #define pPolyAssume(cond) _pPolyAssume(cond, p, r)
137 #define pPolyAssumeReturn(cond) _pPolyAssumeReturn(cond, p, r)
138 #define pPolyAssumeReturnMsg(cond, msg) _pPolyAssumeReturnMsg(cond, msg, p, r)
140 #define pFalseReturn(cond) do {if (! (cond)) return FALSE;} while (0)
141 #if (OM_TRACK > 2) && defined(OM_TRACK_CUSTOM)
142 #define p_SetRingOfLm(p, r) omSetCustomOfAddr(p, r)
145 #define p_SetRingOfLm(p, r) do {} while (0)
150 #define pFalseReturn(cond) do {} while (0)
151 #define pAssume(cond) do {} while (0)
152 #define pPolyAssume(cond) do {} while (0)
153 #define _pPolyAssume(cond, p,r) do {} while (0)
154 #define pAssumeReturn(cond) do {} while (0)
155 #define pPolyAssumeReturn(cond) do {} while (0)
156 #define _pPolyAssumeReturn(cond,p,r) do {} while (0)
157 #define p_SetRingOfLm(p, r) do {} while (0)
162 #define pAssume1 pAssume
163 #define pPolyAssume1 pPolyAssume
164 #define _pPolyAssume1 _pPolyAssume
165 #define pAssumeReturn1 pAssumeReturn
166 #define pPolyAssumeReturn1 pPolyAssumeReturn
167 #define _pPolyAssumeReturn1 _pPolyAssumeReturn
168 #define p_LmCheckPolyRing1 p_LmCheckPolyRing
169 #define p_CheckRing1 p_CheckRing
170 #define pIfThen1 pIfThen
172 #define pAssume1(cond) do {} while (0)
173 #define pPolyAssume1(cond) do {} while (0)
174 #define _pPolyAssume1(cond,p,r) do {} while (0)
175 #define pAssumeReturn1(cond) do {} while (0)
176 #define pPolyAssumeReturn1(cond) do {} while (0)
177 #define _pPolyAssumeReturn1(cond,p,r)do {} while (0)
178 #define p_LmCheckPolyRing1(p,r) do {} while (0)
179 #define p_CheckRing1(r) do {} while (0)
180 #define pIfThen1(cond, check) do {} while (0)
184 #define pAssume2 pAssume
185 #define pPolyAssume2 pPolyAssume
186 #define _pPolyAssume2 _pPolyAssume
187 #define pAssumeReturn2 pAssumeReturn
188 #define pPolyAssumeReturn2 pPolyAssumeReturn
189 #define _pPolyAssumeReturn2 _pPolyAssumeReturn
190 #define p_LmCheckPolyRing2 p_LmCheckPolyRing
191 #define p_CheckRing2 p_CheckRing
192 #define pIfThen2 pIfThen
194 #define pAssume2(cond) do {} while (0)
195 #define pPolyAssume2(cond) do {} while (0)
196 #define _pPolyAssume2(cond,p,r) do {} while (0)
197 #define pAssumeReturn2(cond) do {} while (0)
198 #define pPolyAssumeReturn2(cond) do {} while (0)
199 #define _pPolyAssumeReturn2(cond,p,r)do {} while (0)
200 #define p_LmCheckPolyRing2(p,r) do {} while (0)
201 #define p_CheckRing2(r) do {} while (0)
202 #define pIfThen2(cond, check) do {} while (0)
211 #define p_AllocBin(p, bin, r) \
214 omTypeAllocBin(poly, p, bin); \
215 p_SetRingOfLm(p, r); \
218 #define p_FreeBinAddr(p, r) p_LmFree(p, r)
220 #define p_AllocBin(p, bin, r) omTypeAllocBin(poly, p, bin)
221 #define p_FreeBinAddr(p, r) omFreeBinAddr(p)
234 #define POLYSIZE (sizeof(poly) + sizeof(number))
235 #define POLYSIZEW (POLYSIZE / sizeof(long))
237 #define POLY_NEGWEIGHT_OFFSET (((long)0x80000000) << 32)
239 #define POLY_NEGWEIGHT_OFFSET ((long)0x80000000)
249 #define p_AllocBin(p, bin, r) \
252 omTypeAllocBin(poly, p, bin); \
253 p_SetRingOfLm(p, r); \
256 #define p_FreeBinAddr(p, r) p_LmFree(p, r)
258 #define p_AllocBin(p, bin, r) omTypeAllocBin(poly, p, bin)
259 #define p_FreeBinAddr(p, r) omFreeBinAddr(p)
267 #define rRing_has_Comp(r) (r->pCompIndex >= 0)
Coefficient rings, fields and other domains suitable for Singular polynomials.
BOOLEAN dPolyReportError(poly p, ring r, const char *fmt,...)
static number & pGetCoeff(poly p)
return an alias to the leading coefficient of p assumes that p != NULL NOTE: not copy