| /external/clang/test/Analysis/ |
| unions.cpp | 14 void CloneParseTree(ParseNode *opn, ParseNode *pn, ParseNode *x) {
26 *pn = *opn;
27 x = pn->pn_u.lexdef->pn_u.lexdef;
47 void CloneParseTree(ParseNode *opn, ParseNode *pn, ParseNode *x) {
48 pn->pn_u = opn->pn_u;
49 x = pn->pn_u.name.lexdef->pn_u.name.lexdef;
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/smart_ptr/ |
| shared_array.hpp | 58 explicit shared_array(T * p = 0): px(p), pn(p, deleter())
68 template<class D> shared_array(T * p, D d): px(p), pn(p, d)
78 shared_array( shared_array const & r ): px( r.px ), pn( r.pn ) // never throws
120 return pn.unique();
125 return pn.use_count();
131 pn.swap(other.pn);
136 return pn.get_deleter( ti );
142 detail::shared_count pn; // reference counte member in class:boost::shared_array
[all...] |
| shared_ptr.hpp | 178 shared_ptr(): px(0), pn() // never throws in 1.30+
183 explicit shared_ptr( Y * p ): px( p ), pn( p ) // Y must be complete
194 template<class Y, class D> shared_ptr(Y * p, D d): px(p), pn(p, d)
201 template<class Y, class D, class A> shared_ptr( Y * p, D d, A a ): px( p ), pn( p, d, a )
212 shared_ptr( shared_ptr const & r ): px( r.px ), pn( r.pn ) // never throws
219 explicit shared_ptr(weak_ptr<Y> const & r): pn(r.pn) // may throw
221 // it is now safe to copy r.px, as pn(r.pn) did not thro
486 boost::detail::shared_count pn; \/\/ reference counter member in class:boost::shared_ptr
[all...] |
| /external/yaffs2/yaffs2/ |
| yaffs_qsort.c | 81 char *pa, *pb, *pc, *pd, *pl, *pm, *pn; local
97 pn = (char *)a + (n - 1) * es;
102 pn = med3(pn - 2 * d, pn - d, pn, cmp);
104 pm = med3(pl, pm, pn, cmp);
142 pn = (char *)a + n * es;
145 r = min((long)(pd - pc), (long)(pn - pd - es));
146 vecswap(pb, pn - r, r)
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| xalloc.h | 59 void *x2realloc (void *p, size_t *pn);
110 void *x2nrealloc (void *p, size_t *pn, size_t s);
139 /* If P is null, allocate a block of at least *PN such objects;
140 otherwise, reallocate P so that it contains more than *PN objects
141 each of S bytes. *PN must be nonzero unless P is null, and S must
142 be nonzero. Set *PN to the new number of objects, and return the
143 pointer to the new block. *PN is never set to zero, and the
172 To have finer-grained control over the initial size, set *PN to a
195 x2nrealloc (void *p, size_t *pn, size_t s)
197 size_t n = *pn;
[all...] |
| xmalloc.c | 63 /* If P is null, allocate a block of at least *PN bytes; otherwise,
64 reallocate P so that it contains more than *PN bytes. *PN must be
65 nonzero unless P is null. Set *PN to the new block's size, and
66 return the pointer to the new block. *PN is never set to zero, and
70 x2realloc (void *p, size_t *pn)
72 return x2nrealloc (p, pn, 1);
|
| /external/chromium_org/third_party/openssl/openssl/crypto/evp/ |
| evp_test.c | 138 const unsigned char *plaintext,int pn,
151 hexdump(stdout,"Plaintext",plaintext,pn);
171 if(!EVP_EncryptUpdate(&ctx,out,&outl,plaintext,pn))
223 if(outl+outl2 != pn)
226 outl+outl2,pn);
230 if(memcmp(out,plaintext,pn))
233 hexdump(stderr,"Got",out,pn);
234 hexdump(stderr,"Expected",plaintext,pn);
246 const unsigned char *plaintext,int pn,
256 test1(c,key,kn,iv,in,plaintext,pn,ciphertext,cn,encdec)
371 int kn,in,pn,cn; local
[all...] |
| /external/openssl/crypto/evp/ |
| evp_test.c | 138 const unsigned char *plaintext,int pn,
151 hexdump(stdout,"Plaintext",plaintext,pn);
171 if(!EVP_EncryptUpdate(&ctx,out,&outl,plaintext,pn))
223 if(outl+outl2 != pn)
226 outl+outl2,pn);
230 if(memcmp(out,plaintext,pn))
233 hexdump(stderr,"Got",out,pn);
234 hexdump(stderr,"Expected",plaintext,pn);
246 const unsigned char *plaintext,int pn,
256 test1(c,key,kn,iv,in,plaintext,pn,ciphertext,cn,encdec)
371 int kn,in,pn,cn; local
[all...] |
| /external/bison/lib/ |
| xalloc.h | 62 void *x2realloc (void *p, size_t *pn);
120 /* If P is null, allocate a block of at least *PN such objects;
121 otherwise, reallocate P so that it contains more than *PN objects
122 each of S bytes. *PN must be nonzero unless P is null, and S must
123 be nonzero. Set *PN to the new number of objects, and return the
124 pointer to the new block. *PN is never set to zero, and the
153 To have finer-grained control over the initial size, set *PN to a
176 x2nrealloc (void *p, size_t *pn, size_t s)
178 size_t n = *pn;
205 *pn = n
[all...] |
| xmalloc.c | 67 /* If P is null, allocate a block of at least *PN bytes; otherwise,
68 reallocate P so that it contains more than *PN bytes. *PN must be
69 nonzero unless P is null. Set *PN to the new block's size, and
70 return the pointer to the new block. *PN is never set to zero, and
74 x2realloc (void *p, size_t *pn)
76 return x2nrealloc (p, pn, 1);
|
| /packages/apps/Contacts/tests/src/com/android/contacts/tests/ |
| PhoneNumberTestService.java | 101 final PhoneNumber pn = util.parse(number, country); local
102 isValid = util.isValidNumber(pn);
103 formatted = util.format(pn, format);
104 util.truncateTooLongNumber(pn);
105 truncated = util.format(pn, format);
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| qsort.c | 113 char *pa, *pb, *pc, *pd, *pl, *pm, *pn; local
131 pn = (char *)a + (n - 1) * es;
136 pn = med3(pn - 2 * d, pn - d, pn, cmp, thunk);
138 pm = med3(pl, pm, pn, cmp, thunk);
177 pn = (char *)a + n * es;
180 r = min(pd - pc, pn - pd - es);
181 vecswap(pb, pn - r, r)
[all...] |
| /cts/suite/pts/deviceTests/simplecpu/jni/ |
| CpuNativeJni.cpp | 77 char *pa, *pb, *pc, *pd, *pl, *pm, *pn; local
93 pn = (char *)a + (n - 1) * es;
98 pn = med3(pn - 2 * d, pn - d, pn, cmp);
100 pm = med3(pl, pm, pn, cmp);
138 pn = (char *)a + n * es;
141 r = min(pd - pc, pn - pd - (int)es);
142 vecswap(pb, pn - r, r)
[all...] |
| /build/core/ |
| product.mk | 157 $(eval pn := $(strip $(PRODUCTS.$(p).PRODUCT_NAME))) \
158 $(if $(pn),,$(error $(p): PRODUCT_NAME must be defined.)) \
159 $(if $(filter $(pn),$(_cap_names)), \
160 $(error $(p): PRODUCT_NAME must be unique; "$(pn)" already used by $(strip \
163 $(if $(filter $(pn),$(PRODUCTS.$(pp).PRODUCT_NAME)), \
168 $(eval _cap_names += $(pn)) \
169 $(if $(call is-c-identifier,$(pn)),, \
170 $(error $(p): PRODUCT_NAME must be a valid C identifier, not "$(pn)") \
190 $(eval pn := $(strip $(1)))
193 $(if $(filter $(pn),$(PRODUCTS.$(p).PRODUCT_NAME)),
[all...] |
| /external/valgrind/main/coregrind/m_demangle/ |
| safe-ctype.c | 139 #define pn _sch_ispunct macro
152 #define P (const unsigned short) (pn |pr) /* punctuation */
153 #define _ (const unsigned short) (pn|is |pr) /* underscore */
|
| /external/clang/test/SemaCXX/ |
| nullptr.cpp | 61 nullptr_t *pn = &null; local
65 (void)reinterpret_cast<uintptr_t>(*pn);
70 int *ip = *pn;
71 if (*pn) { }
|
| /external/libffi/src/sparc/ |
| v9.S | 86 brz,pn %i4, done
94 be,a,pn %icc, done
98 be,a,pn %icc, done
102 be,pn %icc, dostruct
186 be,pn %icc, done1
189 be,pn %icc, integer
192 be,a,pn %icc, done1
196 be,a,pn %icc, done1
201 be,a,pn %icc, longdouble1
|
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/ |
| PKIXCertPathValidatorResultTest.java | 208 PolicyNode pn = TestUtils.getPolicyTree(); local
212 pn,
217 assertSame(pn, vr.getPolicyTree());
|
| /external/chromium_org/third_party/opus/src/celt/tests/ |
| test_unit_cwrs32.c | 57 static const int pn[NDIMS]={ variable
77 static const int pn[NDIMS]={ variable
96 n=pn[t];
|
| /libcore/luni/src/test/java/tests/security/cert/ |
| PKIXCertPathValidatorResultTest.java | 202 PolicyNode pn = TestUtils.getPolicyTree(); local
206 pn,
211 assertSame(pn, vr.getPolicyTree());
|
| /external/icu4c/tools/toolutil/ |
| ppucd.h | 102 void setPropertyNames(const PropertyNames *pn) { pnames=pn; }
|
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| sparcv9a-mont.pl | 132 bl,a,pn %icc,.Lret
135 bnz,a,pn %icc,.Lret
355 bz,pn %icc,.L1stskip
663 bz,pn %icc,.Linnerskip
|
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| fts3_tokenizer.c | 114 const char *sqlite3Fts3NextToken(const char *zStr, int *pn){
147 *pn = (int)(z2-z1);
|
| /external/openssl/crypto/bn/asm/ |
| sparcv9a-mont.pl | 132 bl,a,pn %icc,.Lret
135 bnz,a,pn %icc,.Lret
355 bz,pn %icc,.L1stskip
663 bz,pn %icc,.Linnerskip
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 101 ok, nel = 0, p, p1, p2, p3, p4, pj, pk, pk1, pk2, pn, q, t; local
285 pn = p1;
295 Ci[pn++] = e; /* keep e in Ei */
305 elen[i] = pn - p1 + 1; /* elen[i] = |Ei| */
306 p3 = pn;
313 Ci[pn++] = j; /* place j in node list of i */
329 Ci[pn] = Ci[p3]; /* move first node to end */
332 len[i] = pn - p1 + 1; /* new len of adj. list of node i */
|
