P 63 extra_lib/include/freetype/freetype/internal/ftmemory.h void* *P, P 71 extra_lib/include/freetype/freetype/internal/ftmemory.h void* *P, P 109 extra_lib/include/freetype/freetype/internal/ftmemory.h void* *P ); P 144 extra_lib/include/freetype/freetype/internal/ftmemory.h void* *P ); P 169 extra_lib/include/freetype/freetype/internal/ftmemory.h void* *P ); P 100 extra_lib/include/platinum/NptArray.h template <typename X, typename P> P 101 extra_lib/include/platinum/NptArray.h NPT_Result ApplyUntil(const X& function, const P& predicate, bool* match = NULL) const P 69 extra_lib/include/platinum/NptCommon.h template <typename T, typename P> P 71 extra_lib/include/platinum/NptCommon.h const P& predicate, P 87 extra_lib/include/platinum/NptCommon.h template <typename T, typename P> P 89 extra_lib/include/platinum/NptCommon.h const P& predicate, P 154 extra_lib/include/platinum/NptList.h template <typename X, typename P> P 155 extra_lib/include/platinum/NptList.h NPT_Result ApplyUntil(const X& function, const P& predicate, bool* match = NULL) const P 171 extra_lib/include/platinum/NptList.h template <typename P> P 172 extra_lib/include/platinum/NptList.h Iterator Find(const P& predicate, NPT_Ordinal n=0) const P 2661 src/utils/dlmalloc.c #define check_free_chunk(M,P) P 2662 src/utils/dlmalloc.c #define check_inuse_chunk(M,P) P 2663 src/utils/dlmalloc.c #define check_malloced_chunk(M,P,N) P 2664 src/utils/dlmalloc.c #define check_mmapped_chunk(M,P) P 2666 src/utils/dlmalloc.c #define check_top_chunk(M,P) P 2669 src/utils/dlmalloc.c #define check_free_chunk(M,P) do_check_free_chunk(M,P) P 2670 src/utils/dlmalloc.c #define check_inuse_chunk(M,P) do_check_inuse_chunk(M,P) P 2671 src/utils/dlmalloc.c #define check_top_chunk(M,P) do_check_top_chunk(M,P) P 2672 src/utils/dlmalloc.c #define check_malloced_chunk(M,P,N) do_check_malloced_chunk(M,P,N) P 2673 src/utils/dlmalloc.c #define check_mmapped_chunk(M,P) do_check_mmapped_chunk(M,P) P 3425 src/utils/dlmalloc.c #define insert_small_chunk(M, P, S) {\ P 3437 src/utils/dlmalloc.c B->fd = P;\ P 3438 src/utils/dlmalloc.c F->bk = P;\ P 3439 src/utils/dlmalloc.c P->fd = F;\ P 3440 src/utils/dlmalloc.c P->bk = B;\ P 3444 src/utils/dlmalloc.c #define unlink_small_chunk(M, P, S) {\ P 3445 src/utils/dlmalloc.c mchunkptr F = P->fd;\ P 3446 src/utils/dlmalloc.c mchunkptr B = P->bk;\ P 3448 src/utils/dlmalloc.c assert(P != B);\ P 3449 src/utils/dlmalloc.c assert(P != F);\ P 3450 src/utils/dlmalloc.c assert(chunksize(P) == small_index2size(I));\ P 3464 src/utils/dlmalloc.c #define unlink_first_small_chunk(M, B, P, I) {\ P 3465 src/utils/dlmalloc.c mchunkptr F = P->fd;\ P 3466 src/utils/dlmalloc.c assert(P != B);\ P 3467 src/utils/dlmalloc.c assert(P != F);\ P 3468 src/utils/dlmalloc.c assert(chunksize(P) == small_index2size(I));\ P 3484 src/utils/dlmalloc.c #define replace_dv(M, P, S) {\ P 3492 src/utils/dlmalloc.c M->dv = P;\ P 3639 src/utils/dlmalloc.c #define insert_chunk(M, P, S)\ P 3640 src/utils/dlmalloc.c if (is_small(S)) insert_small_chunk(M, P, S)\ P 3641 src/utils/dlmalloc.c else { tchunkptr TP = (tchunkptr)(P); insert_large_chunk(M, TP, S); } P 3644 src/utils/dlmalloc.c #define unlink_chunk(M, P, S)\ P 3645 src/utils/dlmalloc.c if (is_small(S)) unlink_small_chunk(M, P, S)\ P 3646 src/utils/dlmalloc.c else { tchunkptr TP = (tchunkptr)(P); unlink_large_chunk(M, TP); } P 128 src/utils/sha1.c P( A, B, C, D, E, W[0] ); P 129 src/utils/sha1.c P( E, A, B, C, D, W[1] ); P 130 src/utils/sha1.c P( D, E, A, B, C, W[2] ); P 131 src/utils/sha1.c P( C, D, E, A, B, W[3] ); P 132 src/utils/sha1.c P( B, C, D, E, A, W[4] ); P 133 src/utils/sha1.c P( A, B, C, D, E, W[5] ); P 134 src/utils/sha1.c P( E, A, B, C, D, W[6] ); P 135 src/utils/sha1.c P( D, E, A, B, C, W[7] ); P 136 src/utils/sha1.c P( C, D, E, A, B, W[8] ); P 137 src/utils/sha1.c P( B, C, D, E, A, W[9] ); P 138 src/utils/sha1.c P( A, B, C, D, E, W[10] ); P 139 src/utils/sha1.c P( E, A, B, C, D, W[11] ); P 140 src/utils/sha1.c P( D, E, A, B, C, W[12] ); P 141 src/utils/sha1.c P( C, D, E, A, B, W[13] ); P 142 src/utils/sha1.c P( B, C, D, E, A, W[14] ); P 143 src/utils/sha1.c P( A, B, C, D, E, W[15] ); P 144 src/utils/sha1.c P( E, A, B, C, D, R(16) ); P 145 src/utils/sha1.c P( D, E, A, B, C, R(17) ); P 146 src/utils/sha1.c P( C, D, E, A, B, R(18) ); P 147 src/utils/sha1.c P( B, C, D, E, A, R(19) ); P 155 src/utils/sha1.c P( A, B, C, D, E, R(20) ); P 156 src/utils/sha1.c P( E, A, B, C, D, R(21) ); P 157 src/utils/sha1.c P( D, E, A, B, C, R(22) ); P 158 src/utils/sha1.c P( C, D, E, A, B, R(23) ); P 159 src/utils/sha1.c P( B, C, D, E, A, R(24) ); P 160 src/utils/sha1.c P( A, B, C, D, E, R(25) ); P 161 src/utils/sha1.c P( E, A, B, C, D, R(26) ); P 162 src/utils/sha1.c P( D, E, A, B, C, R(27) ); P 163 src/utils/sha1.c P( C, D, E, A, B, R(28) ); P 164 src/utils/sha1.c P( B, C, D, E, A, R(29) ); P 165 src/utils/sha1.c P( A, B, C, D, E, R(30) ); P 166 src/utils/sha1.c P( E, A, B, C, D, R(31) ); P 167 src/utils/sha1.c P( D, E, A, B, C, R(32) ); P 168 src/utils/sha1.c P( C, D, E, A, B, R(33) ); P 169 src/utils/sha1.c P( B, C, D, E, A, R(34) ); P 170 src/utils/sha1.c P( A, B, C, D, E, R(35) ); P 171 src/utils/sha1.c P( E, A, B, C, D, R(36) ); P 172 src/utils/sha1.c P( D, E, A, B, C, R(37) ); P 173 src/utils/sha1.c P( C, D, E, A, B, R(38) ); P 174 src/utils/sha1.c P( B, C, D, E, A, R(39) ); P 182 src/utils/sha1.c P( A, B, C, D, E, R(40) ); P 183 src/utils/sha1.c P( E, A, B, C, D, R(41) ); P 184 src/utils/sha1.c P( D, E, A, B, C, R(42) ); P 185 src/utils/sha1.c P( C, D, E, A, B, R(43) ); P 186 src/utils/sha1.c P( B, C, D, E, A, R(44) ); P 187 src/utils/sha1.c P( A, B, C, D, E, R(45) ); P 188 src/utils/sha1.c P( E, A, B, C, D, R(46) ); P 189 src/utils/sha1.c P( D, E, A, B, C, R(47) ); P 190 src/utils/sha1.c P( C, D, E, A, B, R(48) ); P 191 src/utils/sha1.c P( B, C, D, E, A, R(49) ); P 192 src/utils/sha1.c P( A, B, C, D, E, R(50) ); P 193 src/utils/sha1.c P( E, A, B, C, D, R(51) ); P 194 src/utils/sha1.c P( D, E, A, B, C, R(52) ); P 195 src/utils/sha1.c P( C, D, E, A, B, R(53) ); P 196 src/utils/sha1.c P( B, C, D, E, A, R(54) ); P 197 src/utils/sha1.c P( A, B, C, D, E, R(55) ); P 198 src/utils/sha1.c P( E, A, B, C, D, R(56) ); P 199 src/utils/sha1.c P( D, E, A, B, C, R(57) ); P 200 src/utils/sha1.c P( C, D, E, A, B, R(58) ); P 201 src/utils/sha1.c P( B, C, D, E, A, R(59) ); P 209 src/utils/sha1.c P( A, B, C, D, E, R(60) ); P 210 src/utils/sha1.c P( E, A, B, C, D, R(61) ); P 211 src/utils/sha1.c P( D, E, A, B, C, R(62) ); P 212 src/utils/sha1.c P( C, D, E, A, B, R(63) ); P 213 src/utils/sha1.c P( B, C, D, E, A, R(64) ); P 214 src/utils/sha1.c P( A, B, C, D, E, R(65) ); P 215 src/utils/sha1.c P( E, A, B, C, D, R(66) ); P 216 src/utils/sha1.c P( D, E, A, B, C, R(67) ); P 217 src/utils/sha1.c P( C, D, E, A, B, R(68) ); P 218 src/utils/sha1.c P( B, C, D, E, A, R(69) ); P 219 src/utils/sha1.c P( A, B, C, D, E, R(70) ); P 220 src/utils/sha1.c P( E, A, B, C, D, R(71) ); P 221 src/utils/sha1.c P( D, E, A, B, C, R(72) ); P 222 src/utils/sha1.c P( C, D, E, A, B, R(73) ); P 223 src/utils/sha1.c P( B, C, D, E, A, R(74) ); P 224 src/utils/sha1.c P( A, B, C, D, E, R(75) ); P 225 src/utils/sha1.c P( E, A, B, C, D, R(76) ); P 226 src/utils/sha1.c P( D, E, A, B, C, R(77) ); P 227 src/utils/sha1.c P( C, D, E, A, B, R(78) ); P 228 src/utils/sha1.c P( B, C, D, E, A, R(79) );