Bug 1144366 - Switch SpiderMonkey and XPConnect style from |T *t| to |T* t|. r=jorendorff
This commit is contained in:
@@ -62,7 +62,7 @@ static const uint8_t dtoaModes[] = {
|
||||
2}; /* DTOSTR_PRECISION */
|
||||
|
||||
double
|
||||
js_strtod_harder(DtoaState *state, const char *s00, char **se, int *err)
|
||||
js_strtod_harder(DtoaState* state, const char* s00, char** se, int* err)
|
||||
{
|
||||
double retval;
|
||||
if (err)
|
||||
@@ -71,16 +71,16 @@ js_strtod_harder(DtoaState *state, const char *s00, char **se, int *err)
|
||||
return retval;
|
||||
}
|
||||
|
||||
char *
|
||||
js_dtostr(DtoaState *state, char *buffer, size_t bufferSize, JSDToStrMode mode, int precision,
|
||||
char*
|
||||
js_dtostr(DtoaState* state, char* buffer, size_t bufferSize, JSDToStrMode mode, int precision,
|
||||
double dinput)
|
||||
{
|
||||
U d;
|
||||
int decPt; /* Offset of decimal point from first digit */
|
||||
int sign; /* Nonzero if the sign bit was set in d */
|
||||
int nDigits; /* Number of significand digits returned by js_dtoa */
|
||||
char *numBegin; /* Pointer to the digits returned by js_dtoa */
|
||||
char *numEnd = 0; /* Pointer past the digits returned by js_dtoa */
|
||||
char* numBegin; /* Pointer to the digits returned by js_dtoa */
|
||||
char* numEnd = 0; /* Pointer past the digits returned by js_dtoa */
|
||||
|
||||
MOZ_ASSERT(bufferSize >= (size_t)(mode <= DTOSTR_STANDARD_EXPONENTIAL
|
||||
? DTOSTR_STANDARD_BUFFER_SIZE
|
||||
@@ -115,8 +115,8 @@ js_dtostr(DtoaState *state, char *buffer, size_t bufferSize, JSDToStrMode mode,
|
||||
if (decPt != 9999) {
|
||||
bool exponentialNotation = false;
|
||||
int minNDigits = 0; /* Min number of significant digits required */
|
||||
char *p;
|
||||
char *q;
|
||||
char* p;
|
||||
char* q;
|
||||
|
||||
switch (mode) {
|
||||
case DTOSTR_STANDARD:
|
||||
@@ -210,12 +210,12 @@ js_dtostr(DtoaState *state, char *buffer, size_t bufferSize, JSDToStrMode mode,
|
||||
* divisor must be between 1 and 65536.
|
||||
* This function cannot run out of memory. */
|
||||
static uint32_t
|
||||
divrem(Bigint *b, uint32_t divisor)
|
||||
divrem(Bigint* b, uint32_t divisor)
|
||||
{
|
||||
int32_t n = b->wds;
|
||||
uint32_t remainder = 0;
|
||||
ULong *bx;
|
||||
ULong *bp;
|
||||
ULong* bx;
|
||||
ULong* bp;
|
||||
|
||||
MOZ_ASSERT(divisor > 0 && divisor <= 65536);
|
||||
|
||||
@@ -244,11 +244,11 @@ divrem(Bigint *b, uint32_t divisor)
|
||||
}
|
||||
|
||||
/* Return floor(b/2^k) and set b to be the remainder. The returned quotient must be less than 2^32. */
|
||||
static uint32_t quorem2(Bigint *b, int32_t k)
|
||||
static uint32_t quorem2(Bigint* b, int32_t k)
|
||||
{
|
||||
ULong mask;
|
||||
ULong result;
|
||||
ULong *bx, *bxe;
|
||||
ULong* bx, *bxe;
|
||||
int32_t w;
|
||||
int32_t n = k >> 5;
|
||||
k &= 0x1F;
|
||||
@@ -283,14 +283,14 @@ static uint32_t quorem2(Bigint *b, int32_t k)
|
||||
#define DTOBASESTR_BUFFER_SIZE 1078
|
||||
#define BASEDIGIT(digit) ((char)(((digit) >= 10) ? 'a' - 10 + (digit) : '0' + (digit)))
|
||||
|
||||
char *
|
||||
js_dtobasestr(DtoaState *state, int base, double dinput)
|
||||
char*
|
||||
js_dtobasestr(DtoaState* state, int base, double dinput)
|
||||
{
|
||||
U d;
|
||||
char *buffer; /* The output string */
|
||||
char *p; /* Pointer to current position in the buffer */
|
||||
char *pInt; /* Pointer to the beginning of the integer part of the string */
|
||||
char *q;
|
||||
char* buffer; /* The output string */
|
||||
char* p; /* Pointer to current position in the buffer */
|
||||
char* pInt; /* Pointer to the beginning of the integer part of the string */
|
||||
char* q;
|
||||
uint32_t digit;
|
||||
U di; /* d truncated to an integer */
|
||||
U df; /* The fractional part of d */
|
||||
@@ -335,7 +335,7 @@ js_dtobasestr(DtoaState *state, int base, double dinput)
|
||||
} else {
|
||||
int e;
|
||||
int bits; /* Number of significant bits in di; not used. */
|
||||
Bigint *b = d2b(PASS_STATE di, &e, &bits);
|
||||
Bigint* b = d2b(PASS_STATE di, &e, &bits);
|
||||
if (!b)
|
||||
goto nomem1;
|
||||
b = lshift(PASS_STATE b, e);
|
||||
@@ -365,7 +365,7 @@ js_dtobasestr(DtoaState *state, int base, double dinput)
|
||||
/* We have a fraction. */
|
||||
int e, bbits;
|
||||
int32_t s2, done;
|
||||
Bigint *b, *s, *mlo, *mhi;
|
||||
Bigint* b, *s, *mlo, *mhi;
|
||||
|
||||
b = s = mlo = mhi = nullptr;
|
||||
|
||||
@@ -426,7 +426,7 @@ js_dtobasestr(DtoaState *state, int base, double dinput)
|
||||
done = false;
|
||||
do {
|
||||
int32_t j, j1;
|
||||
Bigint *delta;
|
||||
Bigint* delta;
|
||||
|
||||
b = multadd(PASS_STATE b, base, 0);
|
||||
if (!b)
|
||||
@@ -498,14 +498,14 @@ js_dtobasestr(DtoaState *state, int base, double dinput)
|
||||
return buffer;
|
||||
}
|
||||
|
||||
DtoaState *
|
||||
DtoaState*
|
||||
js::NewDtoaState()
|
||||
{
|
||||
return newdtoa();
|
||||
}
|
||||
|
||||
void
|
||||
js::DestroyDtoaState(DtoaState *state)
|
||||
js::DestroyDtoaState(DtoaState* state)
|
||||
{
|
||||
destroydtoa(state);
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user