summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
c6940f1)
*/
static void sftp_pkt_ensure(struct sftp_packet *pkt, int length)
{
*/
static void sftp_pkt_ensure(struct sftp_packet *pkt, int length)
{
- if (pkt->maxlen < length) {
+ if ((int)pkt->maxlen < length) {
pkt->maxlen = length + 256;
pkt->data = sresize(pkt->data, pkt->maxlen, char);
}
pkt->maxlen = length + 256;
pkt->data = sresize(pkt->data, pkt->maxlen, char);
}
return 0;
*length = GET_32BIT(pkt->data + pkt->savedpos);
pkt->savedpos += 4;
return 0;
*length = GET_32BIT(pkt->data + pkt->savedpos);
pkt->savedpos += 4;
- if (pkt->length - pkt->savedpos < *length || *length < 0) {
+ if ((int)(pkt->length - pkt->savedpos) < *length || *length < 0) {
ret = snew(struct fxp_names);
ret->nnames = i;
ret->names = snewn(ret->nnames, struct fxp_name);
ret = snew(struct fxp_names);
ret->nnames = i;
ret->names = snewn(ret->nnames, struct fxp_name);
- for (i = 0; i < ret->nnames; i++) {
+ for (i = 0; i < (unsigned long)ret->nnames; i++) {
char *str1, *str2;
int len1, len2;
if (!sftp_pkt_getstring(pktin, &str1, &len1) ||
char *str1, *str2;
int len1, len2;
if (!sftp_pkt_getstring(pktin, &str1, &len1) ||
/* Data for an agent message. Buffer it. */
while (len > 0) {
if (c->u.a.lensofar < 4) {
/* Data for an agent message. Buffer it. */
while (len > 0) {
if (c->u.a.lensofar < 4) {
- unsigned int l = min(4 - c->u.a.lensofar, len);
+ unsigned int l = min(4 - c->u.a.lensofar, (unsigned)len);
memcpy(c->u.a.msglen + c->u.a.lensofar, p,
l);
p += l;
memcpy(c->u.a.msglen + c->u.a.lensofar, p,
l);
p += l;
if (c->u.a.lensofar >= 4 && len > 0) {
unsigned int l =
min(c->u.a.totallen - c->u.a.lensofar,
if (c->u.a.lensofar >= 4 && len > 0) {
unsigned int l =
min(c->u.a.totallen - c->u.a.lensofar,
memcpy(c->u.a.message + c->u.a.lensofar, p,
l);
p += l;
memcpy(c->u.a.message + c->u.a.lensofar, p,
l);
p += l;
case CHAN_AGENT:
while (length > 0) {
if (c->u.a.lensofar < 4) {
case CHAN_AGENT:
while (length > 0) {
if (c->u.a.lensofar < 4) {
- unsigned int l = min(4 - c->u.a.lensofar, length);
+ unsigned int l = min(4 - c->u.a.lensofar,
+ (unsigned)length);
memcpy(c->u.a.msglen + c->u.a.lensofar,
data, l);
data += l;
memcpy(c->u.a.msglen + c->u.a.lensofar,
data, l);
data += l;
if (c->u.a.lensofar >= 4 && length > 0) {
unsigned int l =
min(c->u.a.totallen - c->u.a.lensofar,
if (c->u.a.lensofar >= 4 && length > 0) {
unsigned int l =
min(c->u.a.totallen - c->u.a.lensofar,
memcpy(c->u.a.message + c->u.a.lensofar,
data, l);
data += l;
memcpy(c->u.a.message + c->u.a.lensofar,
data, l);
data += l;
s = ctx->s;
i = ctx->i; j = ctx->j;
s = ctx->s;
i = ctx->i; j = ctx->j;
- for (k = 0; k < len; k++) {
+ for (k = 0; (int)k < len; k++) {
i = (i + 1) & 0xff;
j = (j + s[i]) & 0xff;
tmp = s[i]; s[i] = s[j]; s[j] = tmp;
i = (i + 1) & 0xff;
j = (j + s[i]) & 0xff;
tmp = s[i]; s[i] = s[j]; s[j] = tmp;
for (k = mlen - 1; k >= 0; k--) {
t = MUL_WORD(q, m[k]);
t += c;
for (k = mlen - 1; k >= 0; k--) {
t = MUL_WORD(q, m[k]);
t += c;
- c = t >> BIGNUM_INT_BITS;
+ c = (unsigned)(t >> BIGNUM_INT_BITS);
if ((BignumInt) t > a[i + k])
c++;
a[i + k] -= (BignumInt) t;
if ((BignumInt) t > a[i + k])
c++;
a[i + k] -= (BignumInt) t;
i = mlen - base[0];
for (j = 0; j < i; j++)
n[j] = 0;
i = mlen - base[0];
for (j = 0; j < i; j++)
n[j] = 0;
- for (j = 0; j < base[0]; j++)
+ for (j = 0; j < (int)base[0]; j++)
n[i + j] = base[base[0] - j];
/* Allocate a and b of size 2*mlen. Set a = 1 */
n[i + j] = base[base[0] - j];
/* Allocate a and b of size 2*mlen. Set a = 1 */
/* Skip leading zero bits of exp. */
i = 0;
j = BIGNUM_INT_BITS-1;
/* Skip leading zero bits of exp. */
i = 0;
j = BIGNUM_INT_BITS-1;
- while (i < exp[0] && (exp[exp[0] - i] & (1 << j)) == 0) {
+ while (i < (int)exp[0] && (exp[exp[0] - i] & (1 << j)) == 0) {
+ while (i < (int)exp[0]) {
while (j >= 0) {
internal_mul(a + mlen, a + mlen, b, mlen);
internal_mod(b, mlen * 2, m, mlen, NULL, 0);
while (j >= 0) {
internal_mul(a + mlen, a + mlen, b, mlen);
internal_mod(b, mlen * 2, m, mlen, NULL, 0);
i = pqlen - p[0];
for (j = 0; j < i; j++)
n[j] = 0;
i = pqlen - p[0];
for (j = 0; j < i; j++)
n[j] = 0;
- for (j = 0; j < p[0]; j++)
+ for (j = 0; j < (int)p[0]; j++)
n[i + j] = p[p[0] - j];
/* Allocate o of size pqlen, copy q to o */
n[i + j] = p[p[0] - j];
/* Allocate o of size pqlen, copy q to o */
i = pqlen - q[0];
for (j = 0; j < i; j++)
o[j] = 0;
i = pqlen - q[0];
for (j = 0; j < i; j++)
o[j] = 0;
- for (j = 0; j < q[0]; j++)
+ for (j = 0; j < (int)q[0]; j++)
o[i + j] = q[q[0] - j];
/* Allocate a of size 2*pqlen for result */
o[i + j] = q[q[0] - j];
/* Allocate a of size 2*pqlen for result */
n = snewn(plen, BignumInt);
for (j = 0; j < plen; j++)
n[j] = 0;
n = snewn(plen, BignumInt);
for (j = 0; j < plen; j++)
n[j] = 0;
- for (j = 1; j <= p[0]; j++)
+ for (j = 1; j <= (int)p[0]; j++)
n[plen - j] = p[j];
/* Main computation */
n[plen - j] = p[j];
/* Main computation */
/* Copy result to buffer */
if (result) {
/* Copy result to buffer */
if (result) {
- for (i = 1; i <= result[0]; i++) {
+ for (i = 1; i <= (int)result[0]; i++) {
int j = plen - i;
result[i] = j >= 0 ? n[j] : 0;
}
int j = plen - i;
result[i] = j >= 0 ? n[j] : 0;
}
void decbn(Bignum bn)
{
int i = 1;
void decbn(Bignum bn)
{
int i = 1;
- while (i < bn[0] && bn[i] == 0)
+ while (i < (int)bn[0] && bn[i] == 0)
bn[i++] = BIGNUM_INT_MASK;
bn[i]--;
}
bn[i++] = BIGNUM_INT_MASK;
bn[i]--;
}
*/
int bignum_byte(Bignum bn, int i)
{
*/
int bignum_byte(Bignum bn, int i)
{
- if (i >= BIGNUM_INT_BYTES * bn[0])
+ if (i >= (int)(BIGNUM_INT_BYTES * bn[0]))
return 0; /* beyond the end */
else
return (bn[i / BIGNUM_INT_BYTES + 1] >>
return 0; /* beyond the end */
else
return (bn[i / BIGNUM_INT_BYTES + 1] >>
*/
int bignum_bit(Bignum bn, int i)
{
*/
int bignum_bit(Bignum bn, int i)
{
- if (i >= BIGNUM_INT_BITS * bn[0])
+ if (i >= (int)(BIGNUM_INT_BITS * bn[0]))
return 0; /* beyond the end */
else
return (bn[i / BIGNUM_INT_BITS + 1] >> (i % BIGNUM_INT_BITS)) & 1;
return 0; /* beyond the end */
else
return (bn[i / BIGNUM_INT_BITS + 1] >> (i % BIGNUM_INT_BITS)) & 1;
*/
void bignum_set_bit(Bignum bn, int bitnum, int value)
{
*/
void bignum_set_bit(Bignum bn, int bitnum, int value)
{
- if (bitnum >= BIGNUM_INT_BITS * bn[0])
+ if (bitnum >= (int)(BIGNUM_INT_BITS * bn[0]))
abort(); /* beyond the end */
else {
int v = bitnum / BIGNUM_INT_BITS + 1;
abort(); /* beyond the end */
else {
int v = bitnum / BIGNUM_INT_BITS + 1;
shiftbb = BIGNUM_INT_BITS - shiftb;
ai1 = a[shiftw + 1];
shiftbb = BIGNUM_INT_BITS - shiftb;
ai1 = a[shiftw + 1];
- for (i = 1; i <= ret[0]; i++) {
+ for (i = 1; i <= (int)ret[0]; i++) {
- ai1 = (i + shiftw + 1 <= a[0] ? a[i + shiftw + 1] : 0);
+ ai1 = (i + shiftw + 1 <= (int)a[0] ? a[i + shiftw + 1] : 0);
ret[i] = ((ai >> shiftb) | (ai1 << shiftbb)) & BIGNUM_INT_MASK;
}
}
ret[i] = ((ai >> shiftb) | (ai1 << shiftbb)) & BIGNUM_INT_MASK;
}
}
/* mlen space for a, mlen space for b, 2*mlen for result */
workspace = snewn(mlen * 4, BignumInt);
for (i = 0; i < mlen; i++) {
/* mlen space for a, mlen space for b, 2*mlen for result */
workspace = snewn(mlen * 4, BignumInt);
for (i = 0; i < mlen; i++) {
- workspace[0 * mlen + i] = (mlen - i <= a[0] ? a[mlen - i] : 0);
- workspace[1 * mlen + i] = (mlen - i <= b[0] ? b[mlen - i] : 0);
+ workspace[0 * mlen + i] = (mlen - i <= (int)a[0] ? a[mlen - i] : 0);
+ workspace[1 * mlen + i] = (mlen - i <= (int)b[0] ? b[mlen - i] : 0);
}
internal_mul(workspace + 0 * mlen, workspace + 1 * mlen,
}
internal_mul(workspace + 0 * mlen, workspace + 1 * mlen,
/* now just copy the result back */
rlen = alen + blen + 1;
/* now just copy the result back */
rlen = alen + blen + 1;
- if (addend && rlen <= addend[0])
+ if (addend && rlen <= (int)addend[0])
rlen = addend[0] + 1;
ret = newbn(rlen);
maxspot = 0;
rlen = addend[0] + 1;
ret = newbn(rlen);
maxspot = 0;
- for (i = 1; i <= ret[0]; i++) {
+ for (i = 1; i <= (int)ret[0]; i++) {
ret[i] = (i <= 2 * mlen ? workspace[4 * mlen - i] : 0);
if (ret[i] != 0)
maxspot = i;
ret[i] = (i <= 2 * mlen ? workspace[4 * mlen - i] : 0);
if (ret[i] != 0)
maxspot = i;
if (addend) {
BignumDblInt carry = 0;
for (i = 1; i <= rlen; i++) {
if (addend) {
BignumDblInt carry = 0;
for (i = 1; i <= rlen; i++) {
- carry += (i <= ret[0] ? ret[i] : 0);
- carry += (i <= addend[0] ? addend[i] : 0);
+ carry += (i <= (int)ret[0] ? ret[i] : 0);
+ carry += (i <= (int)addend[0] ? addend[i] : 0);
ret[i] = (BignumInt) carry & BIGNUM_INT_MASK;
carry >>= BIGNUM_INT_BITS;
if (ret[i] != 0 && i > maxspot)
ret[i] = (BignumInt) carry & BIGNUM_INT_MASK;
carry >>= BIGNUM_INT_BITS;
if (ret[i] != 0 && i > maxspot)
int i, maxspot = 0;
BignumDblInt carry = 0, addend = addendx;
int i, maxspot = 0;
BignumDblInt carry = 0, addend = addendx;
- for (i = 1; i <= ret[0]; i++) {
+ for (i = 1; i <= (int)ret[0]; i++) {
carry += addend & BIGNUM_INT_MASK;
carry += addend & BIGNUM_INT_MASK;
- carry += (i <= number[0] ? number[i] : 0);
+ carry += (i <= (int)number[0] ? number[i] : 0);
addend >>= BIGNUM_INT_BITS;
ret[i] = (BignumInt) carry & BIGNUM_INT_MASK;
carry >>= BIGNUM_INT_BITS;
addend >>= BIGNUM_INT_BITS;
ret[i] = (BignumInt) carry & BIGNUM_INT_MASK;
carry >>= BIGNUM_INT_BITS;
- for (i = 1; i <= newx[0]; i++) {
- BignumInt aword = (i <= modulus[0] ? modulus[i] : 0);
- BignumInt bword = (i <= x[0] ? x[i] : 0);
+ for (i = 1; i <= (int)newx[0]; i++) {
+ BignumInt aword = (i <= (int)modulus[0] ? modulus[i] : 0);
+ BignumInt bword = (i <= (int)x[0] ? x[i] : 0);
newx[i] = aword - bword - carry;
bword = ~bword;
carry = carry ? (newx[i] >= bword) : (newx[i] > bword);
newx[i] = aword - bword - carry;
bword = ~bword;
carry = carry ? (newx[i] >= bword) : (newx[i] > bword);
* big-endian form of the number.
*/
workspace = snewn(x[0], BignumInt);
* big-endian form of the number.
*/
workspace = snewn(x[0], BignumInt);
- for (i = 0; i < x[0]; i++)
+ for (i = 0; i < (int)x[0]; i++)
workspace[i] = x[x[0] - i];
/*
workspace[i] = x[x[0] - i];
/*
do {
iszero = 1;
carry = 0;
do {
iszero = 1;
carry = 0;
- for (i = 0; i < x[0]; i++) {
+ for (i = 0; i < (int)x[0]; i++) {
carry = (carry << BIGNUM_INT_BITS) + workspace[i];
workspace[i] = (BignumInt) (carry / 10);
if (workspace[i])
carry = (carry << BIGNUM_INT_BITS) + workspace[i];
workspace[i] = (BignumInt) (carry / 10);
if (workspace[i])
- for (i = 0; i < p->n_prompts; i++)
+ for (i = 0; i < (int)p->n_prompts; i++)
memset(p->prompts[i]->result, 0, p->prompts[i]->result_len);
}
}
memset(p->prompts[i]->result, 0, p->prompts[i]->result_len);
}
}
- for (i = 0; i < p->n_prompts; i++)
+ for (i = 0; i < (int)p->n_prompts; i++)
memset(p->prompts[i]->result, 0, p->prompts[i]->result_len);
}
memset(p->prompts[i]->result, 0, p->prompts[i]->result_len);
}
{
int i;
struct winctrl *c;
{
int i;
struct winctrl *c;
/*
* Look up the control ID in our data.
/*
* Look up the control ID in our data.
for (j = 0; j < lenof(popup_menus); j++) {
if (specials_menu) {
/* XXX does this free up all submenus? */
for (j = 0; j < lenof(popup_menus); j++) {
if (specials_menu) {
/* XXX does this free up all submenus? */
- DeleteMenu(popup_menus[j].menu, specials_menu, MF_BYCOMMAND);
+ DeleteMenu(popup_menus[j].menu, (UINT)specials_menu, MF_BYCOMMAND);
DeleteMenu(popup_menus[j].menu, IDM_SPECIALSEP, MF_BYCOMMAND);
}
if (new_menu) {
DeleteMenu(popup_menus[j].menu, IDM_SPECIALSEP, MF_BYCOMMAND);
}
if (new_menu) {
- for (i = 0; i < cbCount ;) {
+ for (i = 0; i < (int)cbCount ;) {
int rtl = is_rtl(lpString[i]);
xn += lpDx[i];
int rtl = is_rtl(lpString[i]);
xn += lpDx[i];
- for (j = i+1; j < cbCount; j++) {
+ for (j = i+1; j < (int)cbCount; j++) {
if (rtl != is_rtl(lpString[j]))
break;
xn += lpDx[j];
if (rtl != is_rtl(lpString[j]))
break;
xn += lpDx[j];
} else if (wParam == IDM_SAVEDSESS) {
unsigned int sessno = ((lParam - IDM_SAVED_MIN)
/ MENU_SAVED_STEP) + 1;
} else if (wParam == IDM_SAVEDSESS) {
unsigned int sessno = ((lParam - IDM_SAVED_MIN)
/ MENU_SAVED_STEP) + 1;
- if (sessno < sesslist.nsessions) {
+ if (sessno < (unsigned)sesslist.nsessions) {
char *session = sesslist.sessions[sessno];
/* XXX spaces? quotes? "-load"? */
cl = dupprintf("putty @%s", session);
char *session = sesslist.sessions[sessno];
/* XXX spaces? quotes? "-load"? */
cl = dupprintf("putty @%s", session);
char realauthdata[64];
int realauthlen = 0;
int authstrlen = strlen(x11_authnames[pr->auth->realproto]);
char realauthdata[64];
int realauthlen = 0;
int authstrlen = strlen(x11_authnames[pr->auth->realproto]);
+ int buflen = 0; /* initialise to placate optimiser */
static const char zeroes[4] = { 0,0,0,0 };
void *buf;
static const char zeroes[4] = { 0,0,0,0 };
void *buf;