14 typedef struct snumber * number;
43 #define pNext(p) ((p)->next)
44 #define pIter(p) (void)((p) = (p)->next)
57 #define p_GetCoeff(p,r) pGetCoeff(p)
66 #define pSetCoeff0(p,n) (p)->coef=(n)
67 #define p_SetCoeff0(p,n,r) pSetCoeff0(p,n)
70 #define __p_GetComp(p, r) (p)->exp[r->pCompIndex]
71 #define p_GetComp(p, r) ((long) (r->pCompIndex >= 0 ? __p_GetComp(p, r) : 0))
85 #define pAssumeReturn(cond) \
90 dPolyReportError(NULL, NULL, "pAssume violation of: %s", \
97 #define pAssume(cond) \
102 dPolyReportError(NULL, NULL, "pAssume violation of: %s", \
108 #define _pPolyAssumeReturn(cond, p, r) \
113 dPolyReportError(p, r, "pPolyAssume violation of: %s", \
120 #define _pPolyAssume(cond,p,r) \
125 dPolyReportError(p, r, "pPolyAssume violation of: %s", \
131 #define _pPolyAssumeReturnMsg(cond, msg, p, r) \
136 dPolyReportError(p, r, "%s ", msg); \
142 #define pPolyAssume(cond) _pPolyAssume(cond, p, r)
143 #define pPolyAssumeReturn(cond) _pPolyAssumeReturn(cond, p, r)
144 #define pPolyAssumeReturnMsg(cond, msg) _pPolyAssumeReturnMsg(cond, msg, p, r)
146 #define pFalseReturn(cond) do {if (! (cond)) return FALSE;} while (0)
147 #if (OM_TRACK > 2) && defined(OM_TRACK_CUSTOM)
148 #define p_SetRingOfLm(p, r) omSetCustomOfAddr(p, r)
151 #define p_SetRingOfLm(p, r) do {} while (0)
156 #define pFalseReturn(cond) do {} while (0)
157 #define pAssume(cond) do {} while (0)
158 #define pPolyAssume(cond) do {} while (0)
159 #define _pPolyAssume(cond, p,r) do {} while (0)
160 #define pAssumeReturn(cond) do {} while (0)
161 #define pPolyAssumeReturn(cond) do {} while (0)
162 #define _pPolyAssumeReturn(cond,p,r) do {} while (0)
163 #define p_SetRingOfLm(p, r) do {} while (0)
168 #define pAssume1 pAssume
169 #define pPolyAssume1 pPolyAssume
170 #define _pPolyAssume1 _pPolyAssume
171 #define pAssumeReturn1 pAssumeReturn
172 #define pPolyAssumeReturn1 pPolyAssumeReturn
173 #define _pPolyAssumeReturn1 _pPolyAssumeReturn
174 #define p_LmCheckPolyRing1 p_LmCheckPolyRing
175 #define p_CheckRing1 p_CheckRing
176 #define pIfThen1 pIfThen
178 #define pAssume1(cond) do {} while (0)
179 #define pPolyAssume1(cond) do {} while (0)
180 #define _pPolyAssume1(cond,p,r) do {} while (0)
181 #define pAssumeReturn1(cond) do {} while (0)
182 #define pPolyAssumeReturn1(cond) do {} while (0)
183 #define _pPolyAssumeReturn1(cond,p,r)do {} while (0)
184 #define p_LmCheckPolyRing1(p,r) do {} while (0)
185 #define p_CheckRing1(r) do {} while (0)
186 #define pIfThen1(cond, check) do {} while (0)
190 #define pAssume2 pAssume
191 #define pPolyAssume2 pPolyAssume
192 #define _pPolyAssume2 _pPolyAssume
193 #define pAssumeReturn2 pAssumeReturn
194 #define pPolyAssumeReturn2 pPolyAssumeReturn
195 #define _pPolyAssumeReturn2 _pPolyAssumeReturn
196 #define p_LmCheckPolyRing2 p_LmCheckPolyRing
197 #define p_CheckRing2 p_CheckRing
198 #define pIfThen2 pIfThen
200 #define pAssume2(cond) do {} while (0)
201 #define pPolyAssume2(cond) do {} while (0)
202 #define _pPolyAssume2(cond,p,r) do {} while (0)
203 #define pAssumeReturn2(cond) do {} while (0)
204 #define pPolyAssumeReturn2(cond) do {} while (0)
205 #define _pPolyAssumeReturn2(cond,p,r)do {} while (0)
206 #define p_LmCheckPolyRing2(p,r) do {} while (0)
207 #define p_CheckRing2(r) do {} while (0)
208 #define pIfThen2(cond, check) do {} while (0)
217 #define p_AllocBin(p, bin, r) \
220 omTypeAllocBin(poly, p, bin); \
221 p_SetRingOfLm(p, r); \
224 #define p_FreeBinAddr(p, r) p_LmFree(p, r)
226 #define p_AllocBin(p, bin, r) omTypeAllocBin(poly, p, bin)
227 #define p_FreeBinAddr(p, r) omFreeBinAddr(p)
240 #define POLYSIZE (sizeof(poly) + sizeof(number))
241 #define POLYSIZEW (POLYSIZE / sizeof(long))
243 #define POLY_NEGWEIGHT_OFFSET (((long)0x80000000) << 32)
245 #define POLY_NEGWEIGHT_OFFSET ((long)0x80000000)
255 #define p_AllocBin(p, bin, r) \
258 omTypeAllocBin(poly, p, bin); \
259 p_SetRingOfLm(p, r); \
262 #define p_FreeBinAddr(p, r) p_LmFree(p, r)
264 #define p_AllocBin(p, bin, r) omTypeAllocBin(poly, p, bin)
265 #define p_FreeBinAddr(p, r) omFreeBinAddr(p)
273 #define rRing_has_Comp(r) (r->pCompIndex >= 0)
'SR_INT' is the type of those integers small enough to fit into 29 bits.
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