Searched refs:pa (Results 1 - 25 of 286) sorted by relevance

1234567891011>>

/external/clang/test/CodeGen/
H A Dinline-optim.c14 volatile int *pa = (int*) 0x1000; variable
22 pa[0] = inline_hint(pa[1],pa[2]);
26 pa[3] = inline_always(pa[4],pa[5]);
30 pa[6] = inline_no_hint(pa[7], pa[
[all...]
H A Dnoinline.c10 volatile int *pa = (int*) 0x1000; variable
15 pa[0] = dont_inline_me(pa[1],pa[2]);
17 pa[3] = inline_me(pa[4],pa[5]);
/external/deqp/framework/referencerenderer/
H A DrrPrimitiveTypes.hpp53 template <> struct PrimitiveTypeTraits<PRIMITIVETYPE_TRIANGLES> { typedef pa::Triangle Type; typedef pa::Triangle BaseType; typedef pa::Triangles Assembler; };
54 template <> struct PrimitiveTypeTraits<PRIMITIVETYPE_TRIANGLE_STRIP> { typedef pa::Triangle Type; typedef pa::Triangle BaseType; typedef pa::TriangleStrip Assembler; };
55 template <> struct PrimitiveTypeTraits<PRIMITIVETYPE_TRIANGLE_FAN> { typedef pa::Triangle Type; typedef pa::Triangle BaseType; typedef pa::TriangleFan Assembler; };
56 template <> struct PrimitiveTypeTraits<PRIMITIVETYPE_LINES> { typedef pa
[all...]
/external/valgrind/coregrind/
H A Dm_poolalloc.c57 PoolAlloc* pa; local
64 pa = alloc_fn(cc, sizeof(*pa));
65 VG_(memset)(pa, 0, sizeof(*pa));
66 pa->nrRef = 0;
67 pa->elemSzB = elemSzB;
68 pa->nPerPool = nPerPool;
69 pa->pools = NULL;
70 pa
79 deletePA( PoolAlloc* pa) argument
113 sizePA( PoolAlloc* pa) argument
119 allocEltPA( PoolAlloc* pa) argument
131 freeEltPA( PoolAlloc* pa, void* p) argument
139 addRefPA( PoolAlloc* pa) argument
144 releasePA(PoolAlloc* pa) argument
[all...]
/external/valgrind/include/
H A Dpub_tool_poolalloc.h65 extern void VG_(deletePA) ( PoolAlloc* pa);
67 /* Allocates an element from pa. The function never returns NULL. */
68 extern void* VG_(allocEltPA) ( PoolAlloc* pa);
70 /* Free element of pa. */
71 extern void VG_(freeEltPA) ( PoolAlloc* pa, void* p);
84 // VG_(addRefPA) indicates there is a new reference to pa.
85 extern void VG_(addRefPA) ( PoolAlloc* pa);
87 // VG_(releasePA) decrements the pa reference count and deletes the pa if that
90 extern UWord VG_(releasePA) ( PoolAlloc* pa);
[all...]
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/
H A Dp10.cpp13 A* pa = pb; local
14 pa->f(); // OK, calls pa->B::f(7)
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.pconst/
H A Dget_param.pass.cpp28 P pa(b, b+Np+1, p);
29 D d(pa);
30 assert(d.param() == pa);
H A Dset_param.pass.cpp27 P pa(b, b+4, p);
29 d.param(pa);
30 assert(d.param() == pa);
H A Dparam_ctor_default.pass.cpp25 P pa; local
26 std::vector<double> iv = pa.intervals();
30 std::vector<double> dn = pa.densities();
H A Dparam_ctor_init_func.pass.cpp31 P pa({}, f);
32 std::vector<double> iv = pa.intervals();
36 std::vector<double> dn = pa.densities();
43 P pa({12}, f);
44 std::vector<double> iv = pa.intervals();
48 std::vector<double> dn = pa.densities();
55 P pa({12, 14}, f);
56 std::vector<double> iv = pa.intervals();
60 std::vector<double> dn = pa.densities();
67 P pa({5.
[all...]
H A Dparam_ctor_func.pass.cpp32 P pa(0, 0, 1, fw);
33 std::vector<double> iv = pa.intervals();
37 std::vector<double> dn = pa.densities();
44 P pa(1, 10, 12, fw);
45 std::vector<double> iv = pa.intervals();
49 std::vector<double> dn = pa.densities();
56 P pa(2, 6, 14, fw);
57 std::vector<double> iv = pa.intervals();
62 std::vector<double> dn = pa.densities();
H A Dparam_ctor_iterator.pass.cpp29 P pa(b, b, p);
30 std::vector<double> iv = pa.intervals();
34 std::vector<double> dn = pa.densities();
43 P pa(b, b+1, p);
44 std::vector<double> iv = pa.intervals();
48 std::vector<double> dn = pa.densities();
57 P pa(b, b+2, p);
58 std::vector<double> iv = pa.intervals();
62 std::vector<double> dn = pa.densities();
71 P pa(
[all...]
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.plinear/
H A Dget_param.pass.cpp28 P pa(b, b+Np, p);
29 D d(pa);
30 assert(d.param() == pa);
H A Dset_param.pass.cpp27 P pa(b, b+4, p);
29 d.param(pa);
30 assert(d.param() == pa);
H A Dparam_ctor_default.pass.cpp25 P pa; local
26 std::vector<double> iv = pa.intervals();
30 std::vector<double> dn = pa.densities();
H A Dparam_ctor_init_func.pass.cpp31 P pa({}, f);
32 std::vector<double> iv = pa.intervals();
36 std::vector<double> dn = pa.densities();
44 P pa({12}, f);
45 std::vector<double> iv = pa.intervals();
49 std::vector<double> dn = pa.densities();
57 P pa({10, 12}, f);
58 std::vector<double> iv = pa.intervals();
62 std::vector<double> dn = pa.densities();
70 P pa({
[all...]
H A Dparam_ctor_func.pass.cpp32 P pa(0, 0, 1, fw);
33 std::vector<double> iv = pa.intervals();
37 std::vector<double> dn = pa.densities();
45 P pa(1, 10, 12, fw);
46 std::vector<double> iv = pa.intervals();
50 std::vector<double> dn = pa.densities();
58 P pa(2, 6, 14, fw);
59 std::vector<double> iv = pa.intervals();
64 std::vector<double> dn = pa.densities();
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mmap/
H A D7-1.c46 void *pa; local
64 pa = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
65 if (pa == MAP_FAILED) {
70 *(char *)pa = 'b';
73 if (msync(pa, size, MS_SYNC) != 0) {
78 munmap(pa, size);
81 pa = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
82 if (pa == MAP_FAILED) {
87 if (*(char *)pa == 'b') {
92 munmap(pa, siz
[all...]
H A D27-1.c38 void *pa; local
59 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
60 if (pa == MAP_FAILED) {
70 munmap(pa, len);
74 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
75 if (pa == MAP_FAILED) {
80 pa = mmap(pa, len / 2, PROT_READ, MAP_SHARED | MAP_FIXED, fd, 0);
82 if (pa == MAP_FAILED) {
91 munmap(pa, le
[all...]
H A D19-1.c30 void *pa; local
33 pa = mmap(NULL, 1024, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
35 if (pa == MAP_FAILED && errno == EBADF) {
40 if (pa == MAP_FAILED)
H A D7-2.c46 void *pa; local
64 pa = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
65 if (pa == MAP_FAILED) {
70 *(char *)pa = 'b';
73 if (msync(pa, size, MS_SYNC) != 0) {
78 munmap(pa, size);
81 pa = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd, 0);
82 if (pa == MAP_FAILED) {
87 if (*(char *)pa == 'b') {
H A D9-1.c42 void *pa; local
64 /* Map the file for the first time, to get a legal address, pa */
65 pa = mmap(NULL, size, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
67 if ((unsigned long)pa % page_size) {
68 printf("pa is not multiple of page_size\n");
69 illegal_addr = pa;
71 printf("pa is a multiple of page_size\n");
72 illegal_addr = pa + 1;
75 munmap(pa, size);
78 pa
[all...]
/external/libcxx/test/std/numerics/rand/rand.dis/rand.dist.samp/rand.dist.samp.discrete/
H A Dparam_ctor_init.pass.cpp26 P pa = {}; local
27 std::vector<double> p = pa.probabilities();
34 P pa = {10}; local
35 std::vector<double> p = pa.probabilities();
42 P pa = {10, 30}; local
43 std::vector<double> p = pa.probabilities();
51 P pa = {30, 10}; local
52 std::vector<double> p = pa.probabilities();
60 P pa = {30, 0, 10}; local
61 std::vector<double> p = pa
70 P pa = {0, 30, 10}; local
80 P pa = {0, 0, 10}; local
[all...]
H A Dparam_ctor_iterator.pass.cpp27 P pa(p0, p0);
28 std::vector<double> p = pa.probabilities();
36 P pa(p0, p0+1);
37 std::vector<double> p = pa.probabilities();
45 P pa(p0, p0+2);
46 std::vector<double> p = pa.probabilities();
55 P pa(p0, p0+2);
56 std::vector<double> p = pa.probabilities();
65 P pa(p0, p0+3);
66 std::vector<double> p = pa
[all...]
/external/skia/gm/
H A Dbug5252.cpp24 SkPaint pa; local
25 pa.setStyle(SkPaint::kStroke_Style);
26 pa.setAntiAlias(true);
27 pa.setStrokeWidth(1.0f);
35 canvas->drawRect(SkRect::MakeXYWH(5, 5, 10, 15),pa);
40 canvas->drawPath(path, pa);

Completed in 564 milliseconds

1234567891011>>