Searched refs:frees (Results 1 - 3 of 3) sorted by relevance
/macosx-10.10.1/Chess-310.6/sjeng/ |
H A D | proof.c | 47 int32_t frees; variable 940 frees += num_moves; 1321 frees = 0; 1367 printf("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d ", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters); 1418 printf ("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d MaxDepth: %d\n", root->proof, root->disproof, nodecount, (int)frees, (((nodecount) * sizeof (node_t) / (float) (1024 * 1024))), iters,maxply); 1569 frees = 0; 1605 // printf("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d\n", root->proof, root->disproof, nodecount, frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters); 1611 printf("P: %d D: %d N: %d S: %d Mem: %2.2fM Iters: %d\n", root->proof, root->disproof, nodecount, (int)frees, (((nodecount) * sizeof(node_t) / (float)(1024*1024))), iters);
|
/macosx-10.10.1/curl-83.1.2/curl/tests/ |
H A D | memanalyze.pl | 128 $frees++; 402 "Frees: $frees\n",
|
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/ |
H A D | bn.tex | 415 The function expects a pointer to a previously initialized mp\_int structure and frees the heap it uses. It sets the
|
Completed in 186 milliseconds