Changeset 1235 for pjproject/trunk
- Timestamp:
- Apr 30, 2007 9:03:32 PM (18 years ago)
- Location:
- pjproject/trunk
- Files:
-
- 22 added
- 26 edited
Legend:
- Unmodified
- Added
- Removed
-
pjproject/trunk/pjlib/include/pj/compat/setjmp.h
r974 r1235 83 83 # endif /* _ASM */ 84 84 85 #elif defined(PJ_SYMBIAN) && PJ_SYMBIAN!=0 86 /* Symbian framework don't use setjmp/longjmp */ 87 85 88 #else 86 89 # warning "setjmp()/longjmp() is not implemented" -
pjproject/trunk/pjlib/include/pj/compat/socket.h
r974 r1235 88 88 # define OSERR_ECONNRESET WSAECONNRESET 89 89 # define OSERR_ENOTCONN WSAENOTCONN 90 #elif defined(PJ_SYMBIAN) && PJ_SYMBIAN!=0 91 # define OSERR_EWOULDBLOCK -1 92 # define OSERR_EINPROGRESS -1 93 # define OSERR_ECONNRESET -1 94 # define OSERR_ENOTCONN -1 90 95 #else 91 96 # define OSERR_EWOULDBLOCK EWOULDBLOCK -
pjproject/trunk/pjlib/include/pj/compat/string.h
r974 r1235 73 73 #define pj_ansi_strnicmp strncasecmp 74 74 #define pj_ansi_sprintf sprintf 75 76 #if defined(PJ_HAS_NO_SNPRINTF) && PJ_HAS_NO_SNPRINTF != 0 77 # include <pj/types.h> 78 # include <pj/compat/stdarg.h> 79 PJ_BEGIN_DECL 80 PJ_DECL(int) snprintf(char*s1, pj_size_t len, const char*s2, ...); 81 PJ_DECL(int) vsnprintf(char*s1, pj_size_t len, const char*s2, va_list arg); 82 PJ_END_DECL 83 #endif 84 75 85 #define pj_ansi_snprintf snprintf 76 86 #define pj_ansi_vsprintf vsprintf -
pjproject/trunk/pjlib/include/pj/config.h
r974 r1235 32 32 #elif defined(__GNUC__) 33 33 # include <pj/compat/cc_gcc.h> 34 #elif defined(__CW32__) 35 # include <pj/compat/cc_mwcc.h> 36 #elif defined(__MWERKS__) 37 # include <pj/compat/cc_codew.h> 34 38 #else 35 39 # error "Unknown compiler." … … 45 49 */ 46 50 # include <pj/compat/os_auto.h> 51 52 #elif defined(PJ_SYMBIAN) && PJ_SYMBIAN!=0 53 /* 54 * SymbianOS 55 */ 56 # include <pj/compat/os_symbian.h> 47 57 48 58 #elif defined(PJ_WIN32_WINCE) || defined(_WIN32_WCE) || defined(UNDER_CE) -
pjproject/trunk/pjlib/include/pj/config_site_sample.h
r826 r1235 66 66 # define PJ_DEBUG 0 67 67 # define PJSIP_SAFE_MODULE 0 68 # define PJ_HAS_STRICMP_ALNUM 168 # define PJ_HAS_STRICMP_ALNUM 0 69 69 # define PJ_HASH_USE_OWN_TOLOWER 1 70 70 # define PJSIP_UNESCAPE_IN_PLACE 1 -
pjproject/trunk/pjlib/include/pj/except.h
r974 r1235 238 238 #define PJ_GET_EXCEPTION() GetExceptionCode() 239 239 240 241 #elif defined(PJ_SYMBIAN) && PJ_SYMBIAN!=0 242 /***************************************************************************** 243 ** 244 ** IMPLEMENTATION OF EXCEPTION USING SYMBIAN LEAVE/TRAP FRAMEWORK 245 ** 246 ****************************************************************************/ 247 248 class TPjException 249 { 250 public: 251 int code_; 252 }; 253 254 #define PJ_USE_EXCEPTION 255 #define PJ_TRY try 256 //#define PJ_CATCH(id) 257 #define PJ_CATCH_ANY catch (const TPjException & pj_excp_) 258 #define PJ_END 259 #define PJ_THROW(x_id) do { TPjException e; e.code_=x_id; throw e;} \ 260 while (0) 261 #define PJ_GET_EXCEPTION() pj_excp_.code_ 262 240 263 #else 241 264 /***************************************************************************** -
pjproject/trunk/pjlib/include/pj/list_i.h
r974 r1235 129 129 while (node != list) { 130 130 ++count; 131 node = node->next;131 node = (pj_list*)node->next; 132 132 } 133 133 -
pjproject/trunk/pjlib/src/pj/array.c
r986 r1235 56 56 { 57 57 unsigned i; 58 const char *char_array = array;58 const char *char_array = (const char*)array; 59 59 for (i=0; i<count; ++i) { 60 60 if ( (*matching)(char_array) == PJ_SUCCESS) { -
pjproject/trunk/pjlib/src/pj/errno.c
r996 r1235 19 19 #include <pj/errno.h> 20 20 #include <pj/string.h> 21 #include <pj/compat/string.h> 21 22 #include <pj/assert.h> 22 23 … … 24 25 * in separate file. 25 26 */ 26 extern int platform_strerror( pj_os_err_type code, 27 char *buf, pj_size_t bufsize ); 27 PJ_BEGIN_DECL 28 29 PJ_DECL(int) platform_strerror(pj_os_err_type code, 30 char *buf, pj_size_t bufsize ); 31 PJ_END_DECL 28 32 29 33 #define PJLIB_MAX_ERR_MSG_HANDLER 8 -
pjproject/trunk/pjlib/src/pj/fifobuf.c
r974 r1235 35 35 fifobuf, buffer, size)); 36 36 37 fifobuf->first = buffer;37 fifobuf->first = (char*)buffer; 38 38 fifobuf->last = fifobuf->first + size; 39 39 fifobuf->ubegin = fifobuf->uend = fifobuf->first; … … 119 119 pj_fifobuf_unalloc (pj_fifobuf_t *fifobuf, void *buf) 120 120 { 121 char *ptr = buf;121 char *ptr = (char*)buf; 122 122 char *endptr; 123 123 unsigned sz; … … 150 150 pj_fifobuf_free (pj_fifobuf_t *fifobuf, void *buf) 151 151 { 152 char *ptr = buf;152 char *ptr = (char*)buf; 153 153 char *end; 154 154 unsigned sz; -
pjproject/trunk/pjlib/src/pj/guid.c
r974 r1235 22 22 PJ_DEF(void) pj_create_unique_string(pj_pool_t *pool, pj_str_t *str) 23 23 { 24 str->ptr = pj_pool_alloc(pool, PJ_GUID_STRING_LENGTH);24 str->ptr = (char*)pj_pool_alloc(pool, PJ_GUID_STRING_LENGTH); 25 25 pj_generate_unique_string(str); 26 26 } -
pjproject/trunk/pjlib/src/pj/hash.c
r1210 r1235 56 56 57 57 if (keylen==PJ_HASH_KEY_STRING) { 58 const unsigned char *p =key;58 const pj_uint8_t *p = (const pj_uint8_t*)key; 59 59 for ( ; *p; ++p ) { 60 60 hash = (hash * PJ_HASH_MULTIPLIER) + *p; 61 61 } 62 62 } else { 63 const unsigned char *p =key,64 *end = p + keylen;63 const pj_uint8_t *p = (const pj_uint8_t*)key, 64 *end = p + keylen; 65 65 for ( ; p!=end; ++p) { 66 66 hash = (hash * PJ_HASH_MULTIPLIER) + *p; … … 104 104 PJ_ASSERT_RETURN(sizeof(pj_hash_entry)==PJ_HASH_ENTRY_SIZE, NULL); 105 105 106 h = pj_pool_alloc(pool, sizeof(pj_hash_table_t));106 h = PJ_POOL_ALLOC_T(pool, pj_hash_table_t); 107 107 h->count = 0; 108 108 … … 120 120 121 121 h->rows = table_size; 122 h->table = pj_pool_calloc(pool, table_size+1, sizeof(pj_hash_entry*)); 122 h->table = (pj_hash_entry**) 123 pj_pool_calloc(pool, table_size+1, sizeof(pj_hash_entry*)); 123 124 return h; 124 125 } … … 143 144 hash=0; 144 145 if (keylen==PJ_HASH_KEY_STRING) { 145 const unsigned char *p =key;146 const pj_uint8_t *p = (const pj_uint8_t*)key; 146 147 for ( ; *p; ++p ) { 147 148 hash = hash * PJ_HASH_MULTIPLIER + *p; … … 149 150 keylen = p - (const unsigned char*)key; 150 151 } else { 151 const unsigned char *p =key,152 *end = p + keylen;152 const pj_uint8_t *p = (const pj_uint8_t*)key, 153 *end = p + keylen; 153 154 for ( ; p!=end; ++p) { 154 155 hash = hash * PJ_HASH_MULTIPLIER + *p; … … 180 181 */ 181 182 if (entry_buf) { 182 entry = entry_buf;183 entry = (pj_hash_entry*)entry_buf; 183 184 } else { 184 185 /* Pool must be specified! */ 185 186 PJ_ASSERT_RETURN(pool != NULL, NULL); 186 187 187 entry = pj_pool_alloc(pool, sizeof(pj_hash_entry));188 entry = PJ_POOL_ALLOC_T(pool, pj_hash_entry); 188 189 PJ_LOG(6, ("hashtbl", 189 190 "%p: New p_entry %p created, pool used=%u, cap=%u", -
pjproject/trunk/pjlib/src/pj/lock.c
r974 r1235 65 65 PJ_ASSERT_RETURN(pool && lock, PJ_EINVAL); 66 66 67 p_lock = pj_pool_alloc(pool, sizeof(pj_lock_t));67 p_lock = PJ_POOL_ALLOC_T(pool, pj_lock_t); 68 68 if (!p_lock) 69 69 return PJ_ENOMEM; … … 153 153 PJ_ASSERT_RETURN(pool && lock, PJ_EINVAL); 154 154 155 p_lock = pj_pool_alloc(pool, sizeof(pj_lock_t));155 p_lock = PJ_POOL_ALLOC_T(pool, pj_lock_t); 156 156 if (!p_lock) 157 157 return PJ_ENOMEM; -
pjproject/trunk/pjlib/src/pj/os_rwmutex.c
r974 r1235 57 57 58 58 *p_mutex = NULL; 59 rwmutex = pj_pool_alloc(pool, sizeof(struct pj_rwmutex_t));59 rwmutex = PJ_POOL_ALLOC_T(pool, pj_rwmutex_t); 60 60 61 61 status = pj_mutex_create_simple(pool, name, &rwmutex ->read_lock); -
pjproject/trunk/pjlib/src/pj/pool.c
r974 r1235 171 171 pj_pool_t *pool; 172 172 pj_pool_block *block; 173 unsigned char*buffer;173 pj_uint8_t *buffer; 174 174 175 175 PJ_CHECK_STACK(); … … 184 184 185 185 /* Allocate initial block */ 186 buffer = ( *f->policy.block_alloc)(f, initial_size);186 buffer = (pj_uint8_t*) (*f->policy.block_alloc)(f, initial_size); 187 187 if (!buffer) 188 188 return NULL; -
pjproject/trunk/pjlib/src/pj/pool_buf.c
r974 r1235 58 58 PJ_UNUSED_ARG(factory); 59 59 60 param = pj_thread_local_get(tls);60 param = (struct creation_param*) pj_thread_local_get(tls); 61 61 if (param == NULL) { 62 62 /* Don't assert(), this is normal no-memory situation */ -
pjproject/trunk/pjlib/src/pj/pool_caching.c
r1019 r1235 86 86 /* Delete all pool in free list */ 87 87 for (i=0; i < PJ_CACHING_POOL_ARRAY_SIZE; ++i) { 88 pj_pool_t *pool = cp->free_list[i].next;88 pj_pool_t *pool = (pj_pool_t*) cp->free_list[i].next; 89 89 pj_pool_t *next; 90 90 for (; pool != (void*)&cp->free_list[i]; pool = next) { … … 96 96 97 97 /* Delete all pools in used list */ 98 pool = cp->used_list.next;98 pool = (pj_pool_t*) cp->used_list.next; 99 99 while (pool != (pj_pool_t*) &cp->used_list) { 100 100 pj_pool_t *next = pool->next; … … 165 165 } else { 166 166 /* Get one pool from the list. */ 167 pool = cp->free_list[idx].next;167 pool = (pj_pool_t*) cp->free_list[idx].next; 168 168 pj_list_erase(pool); 169 169 … … 258 258 cp->capacity, cp->max_capacity, cp->used_count)); 259 259 if (detail) { 260 pj_pool_t *pool = cp->used_list.next;260 pj_pool_t *pool = (pj_pool_t*) cp->used_list.next; 261 261 pj_uint32_t total_used = 0, total_capacity = 0; 262 262 PJ_LOG(3,("cachpool", " Dumping all active pools:")); -
pjproject/trunk/pjlib/src/pj/timer.c
r669 r1235 256 256 pj_timer_entry **new_heap = 0; 257 257 258 new_heap = pj_pool_alloc(ht->pool, sizeof(pj_timer_entry*) * new_size); 258 new_heap = (pj_timer_entry**) 259 pj_pool_alloc(ht->pool, sizeof(pj_timer_entry*) * new_size); 259 260 memcpy(new_heap, ht->heap, ht->max_size * sizeof(pj_timer_entry*)); 260 261 //delete [] this->heap_; … … 264 265 265 266 new_timer_ids = 0; 266 new_timer_ids = pj_pool_alloc(ht->pool, new_size * sizeof(pj_timer_id_t)); 267 new_timer_ids = (pj_timer_id_t*) 268 pj_pool_alloc(ht->pool, new_size * sizeof(pj_timer_id_t)); 267 269 268 270 memcpy( new_timer_ids, ht->timer_ids, ht->max_size * sizeof(pj_timer_id_t)); … … 371 373 372 374 /* Allocate timer heap data structure from the pool */ 373 ht = pj_pool_alloc(pool, sizeof(pj_timer_heap_t));375 ht = PJ_POOL_ALLOC_T(pool, pj_timer_heap_t); 374 376 if (!ht) 375 377 return PJ_ENOMEM; … … 387 389 388 390 // Create the heap array. 389 ht->heap = pj_pool_alloc(pool, sizeof(pj_timer_entry*) * size); 391 ht->heap = (pj_timer_entry**) 392 pj_pool_alloc(pool, sizeof(pj_timer_entry*) * size); 390 393 if (!ht->heap) 391 394 return PJ_ENOMEM; 392 395 393 396 // Create the parallel 394 ht->timer_ids = pj_pool_alloc( pool, sizeof(pj_timer_id_t) * size); 397 ht->timer_ids = (pj_timer_id_t *) 398 pj_pool_alloc( pool, sizeof(pj_timer_id_t) * size); 395 399 if (!ht->timer_ids) 396 400 return PJ_ENOMEM; -
pjproject/trunk/pjlib/src/pjlib-test/ioq_perf.c
r974 r1235 73 73 pj_ssize_t bytes_read) 74 74 { 75 test_item *item = pj_ioqueue_get_user_data(key);75 test_item *item = (test_item*)pj_ioqueue_get_user_data(key); 76 76 pj_status_t rc; 77 77 int data_is_available = 1; … … 151 151 pj_ssize_t bytes_sent) 152 152 { 153 test_item *item = pj_ioqueue_get_user_data(key);153 test_item *item = (test_item*) pj_ioqueue_get_user_data(key); 154 154 155 155 //TRACE_((THIS_FILE, " write complete: sent = %d", bytes_sent)); … … 189 189 static int worker_thread(void *p) 190 190 { 191 struct thread_arg *arg = p;191 struct thread_arg *arg = (struct thread_arg*) p; 192 192 const pj_time_val timeout = {0, 100}; 193 193 int rc; … … 250 250 return -10; 251 251 252 items = pj_pool_alloc(pool, sockpair_cnt*sizeof(test_item)); 253 thread = pj_pool_alloc(pool, thread_cnt*sizeof(pj_thread_t*)); 252 items = (test_item*) pj_pool_alloc(pool, sockpair_cnt*sizeof(test_item)); 253 thread = (pj_thread_t**) 254 pj_pool_alloc(pool, thread_cnt*sizeof(pj_thread_t*)); 254 255 255 256 TRACE_((THIS_FILE, " creating ioqueue..")); … … 266 267 items[i].ioqueue = ioqueue; 267 268 items[i].buffer_size = buffer_size; 268 items[i].outgoing_buffer = pj_pool_alloc(pool, buffer_size);269 items[i].incoming_buffer = pj_pool_alloc(pool, buffer_size);269 items[i].outgoing_buffer = (char*) pj_pool_alloc(pool, buffer_size); 270 items[i].incoming_buffer = (char*) pj_pool_alloc(pool, buffer_size); 270 271 items[i].bytes_recv = items[i].bytes_sent = 0; 271 272 … … 332 333 struct thread_arg *arg; 333 334 334 arg = pj_pool_zalloc(pool, sizeof(*arg));335 arg = (thread_arg*) pj_pool_zalloc(pool, sizeof(*arg)); 335 336 arg->id = i; 336 337 arg->ioqueue = ioqueue; -
pjproject/trunk/pjlib/src/pjlib-test/ioq_udp.c
r974 r1235 329 329 pj_ssize_t bytes_read) 330 330 { 331 unsigned *p_packet_cnt = pj_ioqueue_get_user_data(key);331 unsigned *p_packet_cnt = (unsigned*) pj_ioqueue_get_user_data(key); 332 332 333 333 PJ_UNUSED_ARG(op_key); … … 511 511 return PJ_ENOMEM; 512 512 513 key = pj_pool_alloc(pool, MAX*sizeof(pj_ioqueue_key_t*)); 514 sock = pj_pool_alloc(pool, MAX*sizeof(pj_sock_t)); 513 key = (pj_ioqueue_key_t**) 514 pj_pool_alloc(pool, MAX*sizeof(pj_ioqueue_key_t*)); 515 sock = (pj_sock_t*) pj_pool_alloc(pool, MAX*sizeof(pj_sock_t)); 515 516 516 517 /* Create IOQueue */ -
pjproject/trunk/pjlib/src/pjlib-test/ioq_unreg.c
r974 r1235 124 124 static int worker_thread(void *arg) 125 125 { 126 pj_ioqueue_t *ioqueue = arg;126 pj_ioqueue_t *ioqueue = (pj_ioqueue_t*) arg; 127 127 128 128 while (!thread_quitting) { … … 211 211 /* Initialize test data */ 212 212 sock_data.pool = pj_pool_create(mem, "sd", 1000, 1000, NULL); 213 sock_data.buffer = pj_pool_alloc(sock_data.pool, 128);213 sock_data.buffer = (char*) pj_pool_alloc(sock_data.pool, 128); 214 214 sock_data.bufsize = 128; 215 sock_data.op_key = pj_pool_alloc(sock_data.pool, 215 sock_data.op_key = (pj_ioqueue_op_key_t*) 216 pj_pool_alloc(sock_data.pool, 216 217 sizeof(*sock_data.op_key)); 217 218 sock_data.received = 0; -
pjproject/trunk/pjlib/src/pjlib-test/sock.c
r1029 r1235 64 64 #define UDP_PORT 51234 65 65 #define TCP_PORT (UDP_PORT+10) 66 #define BIG_DATA_LEN 900066 #define BIG_DATA_LEN 8192 67 67 #define ADDRESS "127.0.0.1" 68 #define A0 12769 #define A1 070 #define A2 071 #define A3 172 73 68 74 69 static char bigdata[BIG_DATA_LEN]; … … 83 78 pj_sockaddr_in addr2; 84 79 const pj_str_t *hostname; 80 #if defined(PJ_SYMBIAN) && PJ_SYMBIAN!=0 81 /* Symbian IP address is saved in host order */ 82 unsigned char A[] = {1, 0, 0, 127}; 83 #else 84 unsigned char A[] = {127, 0, 0, 1}; 85 #endif 85 86 86 87 PJ_LOG(3,("test", "...format_test()")); … … 92 93 /* Check the result. */ 93 94 p = (unsigned char*)&addr; 94 if (p[0]!=A 0 || p[1]!=A1 || p[2]!=A2 || p[3]!=A3) {95 if (p[0]!=A[0] || p[1]!=A[1] || p[2]!=A[2] || p[3]!=A[3]) { 95 96 PJ_LOG(3,("test", " error: mismatched address. p0=%d, p1=%d, " 96 97 "p2=%d, p3=%d", p[0] & 0xFF, p[1] & 0xFF, … … 369 370 goto on_error; 370 371 372 // This test will fail on S60 3rd Edition MR2 373 #if 0 371 374 /* connect() the sockets. */ 372 375 rc = pj_sock_connect(cs, &dstaddr, sizeof(dstaddr)); … … 386 389 if (rc != 0) 387 390 goto on_error; 391 #endif 388 392 389 393 on_error: … … 460 464 } 461 465 466 #if 0 467 #include "../pj/os_symbian.h" 468 static int connect_test() 469 { 470 RSocketServ rSockServ; 471 RSocket rSock; 472 TInetAddr inetAddr; 473 TRequestStatus reqStatus; 474 char buffer[16]; 475 TPtrC8 data((const TUint8*)buffer, (TInt)sizeof(buffer)); 476 int rc; 477 478 rc = rSockServ.Connect(); 479 if (rc != KErrNone) 480 return rc; 481 482 rc = rSock.Open(rSockServ, KAfInet, KSockDatagram, KProtocolInetUdp); 483 if (rc != KErrNone) 484 { 485 rSockServ.Close(); 486 return rc; 487 } 488 489 inetAddr.Init(KAfInet); 490 inetAddr.Input(_L("127.0.0.1")); 491 inetAddr.SetPort(80); 492 493 rSock.Connect(inetAddr, reqStatus); 494 User::WaitForRequest(reqStatus); 495 496 if (reqStatus != KErrNone) { 497 rSock.Close(); 498 rSockServ.Close(); 499 return rc; 500 } 501 502 rSock.Send(data, 0, reqStatus); 503 User::WaitForRequest(reqStatus); 504 505 if (reqStatus!=KErrNone) { 506 rSock.Close(); 507 rSockServ.Close(); 508 return rc; 509 } 510 511 rSock.Close(); 512 rSockServ.Close(); 513 return KErrNone; 514 } 515 #endif 516 462 517 int sock_test() 463 518 { … … 466 521 pj_create_random_string(bigdata, BIG_DATA_LEN); 467 522 523 // Enable this to demonstrate the error witn S60 3rd Edition MR2 524 #if 0 525 rc = connect_test(); 526 if (rc != 0) 527 return rc; 528 #endif 529 468 530 rc = format_test(); 469 531 if (rc != 0) -
pjproject/trunk/pjlib/src/pjlib-test/sock_perf.c
r974 r1235 70 70 71 71 /* Create buffers. */ 72 outgoing_buffer = pj_pool_alloc(pool, buf_size);73 incoming_buffer = pj_pool_alloc(pool, buf_size);72 outgoing_buffer = (char*) pj_pool_alloc(pool, buf_size); 73 incoming_buffer = (char*) pj_pool_alloc(pool, buf_size); 74 74 75 75 /* Start loop. */ -
pjproject/trunk/pjlib/src/pjlib-test/string.c
r1210 r1235 237 237 } 238 238 239 /* Avoid division by zero */ 240 if (c2 == 0) c2=1; 241 239 242 PJ_LOG(3, ("", " time: stricmp=%u, stricmp_alnum=%u (speedup=%d.%02dx)", 240 243 c1, c2, … … 329 332 * pj_strcpy(), pj_strcat() 330 333 */ 331 s3.ptr = pj_pool_alloc(pool, 256);334 s3.ptr = (char*) pj_pool_alloc(pool, 256); 332 335 if (!s3.ptr) 333 336 return -200; … … 349 352 * pj_utoa() 350 353 */ 351 s5.ptr = pj_pool_alloc(pool, 16);354 s5.ptr = (char*) pj_pool_alloc(pool, 16); 352 355 if (!s5.ptr) 353 356 return -270; … … 393 396 int j; 394 397 395 random[i].ptr = pj_pool_alloc(pool, RLEN);398 random[i].ptr = (char*) pj_pool_alloc(pool, RLEN); 396 399 if (!random[i].ptr) 397 400 return -320; -
pjproject/trunk/pjlib/src/pjlib-test/test.h
r974 r1235 22 22 #include <pj/types.h> 23 23 24 #define GROUP_LIBC 125 #define GROUP_OS 126 #define GROUP_DATA_STRUCTURE 124 #define GROUP_LIBC 0 25 #define GROUP_OS 0 26 #define GROUP_DATA_STRUCTURE 0 27 27 #define GROUP_NETWORK 1 28 #define GROUP_FILE 1 28 #if defined(PJ_SYMBIAN) 29 # define GROUP_FILE 0 30 #else 31 # define GROUP_FILE 1 32 #endif 29 33 30 #define INCLUDE_ERRNO_TEST GROUP_LIBC 34 #if defined(PJ_SYMBIAN) 35 # define INCLUDE_ERRNO_TEST 0 36 #else 37 # define INCLUDE_ERRNO_TEST GROUP_LIBC 38 #endif 31 39 #define INCLUDE_TIMESTAMP_TEST GROUP_OS 32 40 #define INCLUDE_EXCEPTION_TEST GROUP_LIBC … … 40 48 #define INCLUDE_TIMER_TEST GROUP_DATA_STRUCTURE 41 49 #define INCLUDE_ATOMIC_TEST GROUP_OS 42 #define INCLUDE_MUTEX_TEST GROUP_OS50 #define INCLUDE_MUTEX_TEST (PJ_HAS_THREADS && GROUP_OS) 43 51 #define INCLUDE_SLEEP_TEST GROUP_OS 44 #define INCLUDE_THREAD_TEST GROUP_OS52 #define INCLUDE_THREAD_TEST (PJ_HAS_THREADS && GROUP_OS) 45 53 #define INCLUDE_SOCK_TEST GROUP_NETWORK 46 #define INCLUDE_SOCK_PERF_TEST GROUP_NETWORK 54 #if defined(PJ_SYMBIAN) 55 # define INCLUDE_SOCK_PERF_TEST 0 56 #else 57 # define INCLUDE_SOCK_PERF_TEST GROUP_NETWORK 58 #endif 47 59 #define INCLUDE_SELECT_TEST GROUP_NETWORK 48 60 #define INCLUDE_UDP_IOQUEUE_TEST GROUP_NETWORK 49 61 #define INCLUDE_TCP_IOQUEUE_TEST GROUP_NETWORK 50 #define INCLUDE_IOQUEUE_PERF_TEST GROUP_NETWORK51 #define INCLUDE_IOQUEUE_UNREG_TEST GROUP_NETWORK62 #define INCLUDE_IOQUEUE_PERF_TEST (PJ_HAS_THREADS && GROUP_NETWORK) 63 #define INCLUDE_IOQUEUE_UNREG_TEST (PJ_HAS_THREADS && GROUP_NETWORK) 52 64 #define INCLUDE_FILE_TEST GROUP_FILE 53 65 -
pjproject/trunk/pjlib/src/pjlib-test/udp_echo_srv_ioqueue.c
r974 r1235 118 118 static int worker_thread(void *arg) 119 119 { 120 pj_ioqueue_t *ioqueue = arg;120 pj_ioqueue_t *ioqueue = (pj_ioqueue_t*) arg; 121 121 struct op_key read_op, write_op; 122 122 char recv_buf[512], send_buf[512];
Note: See TracChangeset
for help on using the changeset viewer.