Compare commits

..

No commits in common. "master" and "V1.0.84" have entirely different histories.

2 changed files with 36 additions and 73 deletions

View File

@ -297,7 +297,9 @@ char *base64_decode_auto(struct base64_context *context, const char *src, \
memcpy(pBuff, src, nSrcLen); memcpy(pBuff, src, nSrcLen);
memset(pBuff + nSrcLen, context->pad_ch, nPadLen); memset(pBuff + nSrcLen, context->pad_ch, nPadLen);
base64_decode(context, pBuff, nNewLen, dest, dest_len); base64_decode(context, pBuff, nNewLen, dest, dest_len);
if (pBuff != tmpBuff) if (pBuff != tmpBuff)
{ {
free(pBuff); free(pBuff);
@ -385,21 +387,14 @@ char *base64_decode(struct base64_context *context, const char *src, \
{ {
*dest = '\0'; *dest = '\0';
*dest_len = 0; *dest_len = 0;
fprintf(stderr, "Input to decode not an even multiple of " fprintf(stderr, "Input to decode not an even multiple of " \
"4 characters; pad with %c\n", context->pad_ch); "4 characters; pad with %c\n", context->pad_ch);
return dest; return dest;
} }
if (dummies > 2)
{
*dest = '\0';
*dest_len = 0;
fprintf(stderr, "pad char: %c count %d exceeds 2\n",
context->pad_ch, dummies);
return dest;
}
*dest_len = (pDest - dest) - dummies; *dest_len = (pDest - dest) - dummies;
*(dest + (*dest_len)) = '\0'; *(dest + (*dest_len)) = '\0';
return dest; return dest;
} }

View File

@ -28,68 +28,16 @@
#include "fastcommon/fast_allocator.h" #include "fastcommon/fast_allocator.h"
#define LOOP_COUNT (30 * 1000 * 1000) #define LOOP_COUNT (30 * 1000 * 1000)
#define THREAD_COUNT 2
#define barrier() __asm__ __volatile__("" ::: "memory") #define barrier() __asm__ __volatile__("" ::: "memory")
static volatile int64_t sum;
static pthread_mutex_t lock;
static void *atomic_thread_func(void *arg)
{
int k;
for (k=1; k<=LOOP_COUNT; k++) {
//__sync_synchronize();
//barrier();
__sync_add_and_fetch(&sum, k);
}
return NULL;
}
static void *mutex_thread_func(void *arg)
{
int k;
for (k=1; k<=LOOP_COUNT; k++) {
pthread_mutex_lock(&lock);
sum += k;
pthread_mutex_unlock(&lock);
}
return NULL;
}
typedef void *(*thread_func)(void *arg);
static int test(const char *caption, thread_func thread_run)
{
int64_t start_time;
char time_buff[32];
pthread_t tids[THREAD_COUNT];
int i;
int result;
start_time = get_current_time_ms();
sum = 0;
for (i=0; i<THREAD_COUNT; i++) {
if ((result=pthread_create(tids + i, NULL, thread_run, NULL)) != 0) {
return result;
}
}
for (i=0; i<THREAD_COUNT; i++) {
pthread_join(tids[i], NULL);
}
printf("%s add, LOOP_COUNT: %s, sum: %"PRId64", time used: "
"%"PRId64" ms\n", caption, int_to_comma_str(LOOP_COUNT, time_buff),
sum, get_current_time_ms() - start_time);
return 0;
}
int main(int argc, char *argv[]) int main(int argc, char *argv[])
{ {
int result; int result;
int k;
int64_t sum;
int64_t start_time;
char time_buff[32];
pthread_mutex_t lock;
log_init(); log_init();
srand(time(NULL)); srand(time(NULL));
@ -101,13 +49,33 @@ int main(int argc, char *argv[])
return result; return result;
} }
start_time = get_current_time_ms();
sum = 0;
for (k=1; k<=LOOP_COUNT; k++) {
//__sync_synchronize();
//barrier();
__sync_add_and_fetch(&sum, k);
}
printf("atom add, LOOP_COUNT: %s, sum: %"PRId64", time used: "
"%"PRId64" ms\n", int_to_comma_str(LOOP_COUNT, time_buff),
sum, get_current_time_ms() - start_time);
printf("lock 1: %d\n", pthread_mutex_lock(&lock)); printf("lock 1: %d\n", pthread_mutex_lock(&lock));
printf("lock 2: %d\n", pthread_mutex_lock(&lock)); printf("lock 2: %d\n", pthread_mutex_lock(&lock));
printf("unlock 1: %d\n", pthread_mutex_unlock(&lock)); printf("unlock 1: %d\n", pthread_mutex_unlock(&lock));
printf("unlock 2: %d\n", pthread_mutex_unlock(&lock)); printf("unlock 2: %d\n", pthread_mutex_unlock(&lock));
test("atom", atomic_thread_func); start_time = get_current_time_ms();
test("lock", mutex_thread_func); sum = 0;
for (k=1; k<=LOOP_COUNT; k++) {
pthread_mutex_lock(&lock);
sum += k;
pthread_mutex_unlock(&lock);
}
printf("locked add, LOOP_COUNT: %s, sum: %"PRId64", time used: "
"%"PRId64" ms\n", int_to_comma_str(LOOP_COUNT, time_buff),
sum, get_current_time_ms() - start_time);
return 0; return 0;
} }