Update libsrtp to 1.5.2

srtp/test/rdbx_driver.c

 /*
  * rdbx_driver.c
  *
  * driver for the rdbx implementation (replay database with extended range)
  *
  * David A. McGrew
  * Cisco Systems, Inc.
  */
 
 /*
@@ skipping 224 matching lines @@
   status = rdbx_init(&rdbx, ws);
   if (status) {
     printf("replay_init failed with error code %d\n", status);
     exit(1);
   }
 
   /*
    *  test sequential insertion 
    */
   printf("\ttesting sequential insertion...");
-  for (idx=0; idx < num_trials; idx++) {
+  for (idx=0; (int) idx < num_trials; idx++) {
     status = rdbx_check_add(&rdbx, idx);
     if (status)
       return status;
   }
   printf("passed\n");
 
   /*
    *  test for false positives by checking all of the index
    *  values which we've just added
    *
    * note that we limit the number of trials here, since allowing the
    * rollover counter to roll over would defeat this test
    */
   num_fp_trials = num_trials % 0x10000;
   if (num_fp_trials == 0) {
     printf("warning: no false positive tests performed\n");
   }
   printf("\ttesting for false positives...");
-  for (idx=0; idx < num_fp_trials; idx++) {
+  for (idx=0; (int) idx < num_fp_trials; idx++) {
     status = rdbx_check_expect_failure(&rdbx, idx);
     if (status)
       return status;
   }
   printf("passed\n");
 
   /* re-initialize */
   rdbx_dealloc(&rdbx);
 
   if (rdbx_init(&rdbx, ws) != err_status_ok) {
     printf("replay_init failed\n");
     return err_status_init_fail;
   }
 
   /*
    * test non-sequential insertion 
    *
    * this test covers only fase negatives, since the values returned
    * by ut_next_index(...) are distinct
    */
   ut_init(&utc);
 
   printf("\ttesting non-sequential insertion...");  
-  for (idx=0; idx < num_trials; idx++) {
+  for (idx=0; (int) idx < num_trials; idx++) {
     ircvd = ut_next_index(&utc);
     status = rdbx_check_add_unordered(&rdbx, ircvd);
     if (status)
       return status;
         status = rdbx_check_expect_failure(&rdbx, ircvd);
         if (status)
                 return status;
   }
   printf("passed\n");
 
   /* re-initialize */
   rdbx_dealloc(&rdbx);
 
   if (rdbx_init(&rdbx, ws) != err_status_ok) {
     printf("replay_init failed\n");
     return err_status_init_fail;
   }
 
   /*
    * test insertion with large gaps.
    * check for false positives for each insertion.
    */
   printf("\ttesting insertion with large gaps...");  
-  for (idx=0, ircvd=0; idx < num_trials; idx++, ircvd += (1 << (rand() % 12))) {
+  for (idx=0, ircvd=0; (int) idx < num_trials; idx++, ircvd += (1 << (rand() % 12))) {
     status = rdbx_check_add(&rdbx, ircvd);
     if (status)
       return status;
     status = rdbx_check_expect_failure(&rdbx, ircvd);
     if (status)
       return status;
   }
   printf("passed\n");
 
   rdbx_dealloc(&rdbx);
@@ skipping 15 matching lines @@
   clock_t timer;
   int failures;                    /* count number of failures        */
   
   if (rdbx_init(&rdbx, ws) != err_status_ok) {
     printf("replay_init failed\n");
     exit(1);
   }  
 
   failures = 0;
   timer = clock();
-  for(i=0; i < num_trials; i++) {
+  for(i=0; (int) i < num_trials; i++) {
     
     delta = index_guess(&rdbx.index, &est, i);
     
     if (rdbx_check(&rdbx, delta) != err_status_ok) 
       ++failures;
     else
       if (rdbx_add_index(&rdbx, delta) != err_status_ok)
         ++failures;
   }
   timer = clock() - timer;
 
   printf("number of failures: %d \n", failures);
 
   rdbx_dealloc(&rdbx);
 
   return (double) CLOCKS_PER_SEC * num_trials / timer;
 }