/external/clang/test/OpenMP/ |
task_firstprivate_codegen.cpp | 41 T vec[] = {1, 2}; local 44 #pragma omp task firstprivate(t_var, vec, s_arr, s_arr, var, var) 46 vec[0] = t_var; 154 int vec[] = {1, 2}; 157 #pragma omp task firstprivate(var, t_var, s_arr, vec, s_arr, var, sivar) 159 vec[0] = t_var; 235 // vec; 371 // vec;
|
/toolchain/binutils/binutils-2.25/bfd/ |
vms-lib.c | 806 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local 807 return vec->where; 816 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local 818 if (vec->blk_off == DATA__LENGTH) 823 if (bfd_seek (abfd->my_archive, vec->next_block, SEEK_SET) != 0) 827 vec->next_block = (bfd_getl32 (hdr + 2) - 1) * VMS_BLOCK_SIZE; 828 vec->blk_off = sizeof (hdr); 840 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local 853 l = DATA__LENGTH - vec->blk_off; 873 vec->blk_off += l 958 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local 1152 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local 1222 struct vms_lib_iovec *vec; local 1498 struct vms_lib_iovec *vec = (struct vms_lib_iovec *) abfd->iostream; local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
tst_badblocks.c | 68 static errcode_t create_test_list(blk_t *vec, badblocks_list *ret) 79 for (i=0; vec[i]; i++) { 80 retval = ext2fs_badblocks_list_add(bb, vec[i]); 121 static void validate_test_seq(badblocks_list bb, blk_t *vec) 125 for (i = 0; vec[i]; i += 2) { 126 match = ext2fs_badblocks_list_test(bb, vec[i]); 127 if (match == vec[i+1]) 133 printf("\tblock %u is %s --- %s\n", vec[i], 139 static void do_test_seq(badblocks_list bb, blk_t *vec) 143 for (i = 0; vec[i]; i += 2) [all...] |
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/com/badlogic/gdx/physics/box2d/ |
EdgeShape.java | 53 public void getVertex1 (Vector2 vec) { 55 vec.set(v1.x, v1.y); 58 public void getVertex2 (Vector2 vec) { 60 vec.set(v2.x, v2.y); 63 public void getVertex0 (Vector2 vec) { 65 vec.set(v0.x, v0.y); 68 public void getVertex3 (Vector2 vec) { 70 vec.set(v3.x, v3.y);
|
/external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/ |
btConvexShape.java | 61 public Vector3 localGetSupportingVertex(Vector3 vec) { 62 return CollisionJNI.btConvexShape_localGetSupportingVertex(swigCPtr, this, vec); 65 public Vector3 localGetSupportingVertexWithoutMargin(Vector3 vec) { 66 return CollisionJNI.btConvexShape_localGetSupportingVertexWithoutMargin(swigCPtr, this, vec); 69 public Vector3 localGetSupportVertexWithoutMarginNonVirtual(Vector3 vec) { 70 return CollisionJNI.btConvexShape_localGetSupportVertexWithoutMarginNonVirtual(swigCPtr, this, vec); 73 public Vector3 localGetSupportVertexNonVirtual(Vector3 vec) { 74 return CollisionJNI.btConvexShape_localGetSupportVertexNonVirtual(swigCPtr, this, vec);
|
/prebuilts/misc/common/swig/include/2.0.11/ruby/ |
std_vector.i | 10 static int asptr(VALUE obj, std::vector<T> **vec) { 11 return traits_asptr_stdseq<std::vector<T> >::asptr(obj, vec); 17 static VALUE from(const std::vector<T>& vec) { 18 return traits_from_stdseq<std::vector<T> >::from(vec);
|
/external/eigen/Eigen/src/SparseLU/ |
SparseLU_Memory.h | 56 * \param vec Valid pointer to the vector to allocate or expand 64 Index SparseLUImpl<Scalar,Index>::expand(VectorType& vec, Index& length, Index nbElts, Index keep_prev, Index& num_expansions) 77 old_vec = vec.segment(0,nbElts); 84 vec.resize(new_len); 89 if(!vec.size()) 115 vec.resize(new_len); 120 if (!vec.size()) 126 } while (!vec.size()); 131 vec.segment(0, nbElts) = old_vec; 201 * \param vec vector to expand [all...] |
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
btMultiSphereShape.cpp | 54 btVector3 vec = vec0; local 55 btScalar lenSqr = vec.length2(); 58 vec.setValue(1,0,0); 62 vec *= rlen; 78 temp[i] = (*pos) +vec*m_localScaling*(*rad) - vec * getMargin(); 82 long i = vec.maxDot( temp, inner_count, newDot); 101 const btVector3& vec = vectors[j]; local 116 temp[i] = (*pos) +vec*m_localScaling*(*rad) - vec * getMargin() [all...] |
btConvex2dShape.cpp | 30 btVector3 btConvex2dShape::localGetSupportingVertexWithoutMargin(const btVector3& vec)const 32 return m_childConvexShape->localGetSupportingVertexWithoutMargin(vec); 41 btVector3 btConvex2dShape::localGetSupportingVertex(const btVector3& vec)const 43 return m_childConvexShape->localGetSupportingVertex(vec);
|
btConvexShape.h | 43 virtual btVector3 localGetSupportingVertex(const btVector3& vec)const = 0; 47 virtual btVector3 localGetSupportingVertexWithoutMargin(const btVector3& vec) const=0; 50 btVector3 localGetSupportVertexWithoutMarginNonVirtual (const btVector3& vec) const; 51 btVector3 localGetSupportVertexNonVirtual (const btVector3& vec) const;
|
btConeShape.cpp | 106 btVector3 btConeShape::localGetSupportingVertexWithoutMargin(const btVector3& vec) const 108 return coneLocalSupport(vec); 115 const btVector3& vec = vectors[i]; local 116 supportVerticesOut[i] = coneLocalSupport(vec); 121 btVector3 btConeShape::localGetSupportingVertex(const btVector3& vec) const 123 btVector3 supVertex = coneLocalSupport(vec); 126 btVector3 vecnorm = vec;
|
btUniformScalingShape.cpp | 30 btVector3 btUniformScalingShape::localGetSupportingVertexWithoutMargin(const btVector3& vec)const 33 tmpVertex = m_childConvexShape->localGetSupportingVertexWithoutMargin(vec); 48 btVector3 btUniformScalingShape::localGetSupportingVertex(const btVector3& vec)const 51 tmpVertex = m_childConvexShape->localGetSupportingVertex(vec); 119 btVector3 vec(btScalar(0.),btScalar(0.),btScalar(0.)); 120 vec[i] = btScalar(1.); 121 btVector3 sv = localGetSupportingVertex(vec*t.getBasis()); 124 vec[i] = btScalar(-1.); 125 sv = localGetSupportingVertex(vec*t.getBasis());
|
/bionic/libc/bionic/ |
libc_logging.cpp | 440 iovec vec[4]; local 441 vec[0].iov_base = const_cast<char*>(tag); 442 vec[0].iov_len = strlen(tag); 443 vec[1].iov_base = const_cast<char*>(": "); 444 vec[1].iov_len = 2; 445 vec[2].iov_base = const_cast<char*>(msg); 446 vec[2].iov_len = strlen(msg); 447 vec[3].iov_base = const_cast<char*>("\n"); 448 vec[3].iov_len = 1; 450 int result = TEMP_FAILURE_RETRY(writev(fd, vec, 4)) 558 iovec vec[6]; local 601 iovec vec[6]; local [all...] |
/external/tcpdump/ |
print-mobile.c | 68 struct cksum_vec vec[1]; local 97 vec[0].ptr = (const uint8_t *)(void *)mob; 98 vec[0].len = osp ? 12 : 8; 99 if (in_cksum(vec, 1)!=0) {
|
/external/valgrind/memcheck/tests/solaris/ |
sendfilev.stderr.exp | 1 Syscall param sendfilev(vec[0].sfv_off points to unaddressable byte(s) 6 Syscall param sendfilev(vec) points to uninitialised byte(s)
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
ipa-utils.h | 45 vec<cgraph_node_ptr> ipa_get_nodes_in_cycle (struct cgraph_node *);
|
/prebuilts/misc/common/swig/include/2.0.11/octave/ |
std_list.i | 15 static octave_value *from(const std::list<T> & vec) { 16 return traits_from_stdseq<std::list<T> >::from(vec);
|
/prebuilts/misc/common/swig/include/2.0.11/python/ |
std_list.i | 17 static PyObject *from(const std::list<T> & vec) { 18 return traits_from_stdseq<std::list<T> >::from(vec);
|
/system/core/liblog/ |
pmsg_writer.c | 42 struct iovec *vec, size_t nr); 99 struct iovec *vec, size_t nr) 109 if (vec[0].iov_len < 4) { 113 if (SNET_EVENT_LOG_TAG != get4LE(vec[0].iov_base)) { 158 newVec[i].iov_base = vec[i - headerLength].iov_base; 159 payloadSize += newVec[i].iov_len = vec[i - headerLength].iov_len; 214 struct iovec vec[3]; local 254 vec[0].iov_base = &prio; 255 vec[0].iov_len = sizeof(char); 256 vec[1].iov_base = (unsigned char *)tag [all...] |
/external/boringssl/src/crypto/chacha/ |
chacha_vec.c | 35 typedef unsigned vec __attribute__((vector_size(16))); typedef 47 #define ONE (vec) vsetq_lane_u32(1, vdupq_n_u32(0), 0) 48 #define LOAD_ALIGNED(m) (vec)(*((vec *)(m))) 54 (*((vec *)(alignment_buffer))) = (r); \ 57 #define ROTV1(x) (vec) vextq_u32((uint32x4_t)x, (uint32x4_t)x, 1) 58 #define ROTV2(x) (vec) vextq_u32((uint32x4_t)x, (uint32x4_t)x, 2) 59 #define ROTV3(x) (vec) vextq_u32((uint32x4_t)x, (uint32x4_t)x, 3) 60 #define ROTW16(x) (vec) vrev32q_u16((uint16x8_t)x) 62 #define ROTW7(x) (x << ((vec) {7, 7, 7, 7})) ^ (x >> ((vec) {25, 25, 25, 25}) [all...] |
/libcore/support/src/test/java/org/apache/harmony/xnet/tests/support/ |
X509KeyManagerImpl.java | 123 Vector vec = new Vector(); local 126 vec.addElement(aliase.nextElement()); 129 String[] res = new String[vec.size()]; 130 for (i = 0; i < vec.size(); i++) { 131 res[i] = vec.elementAt(i).toString(); 167 Vector vec = new Vector(); local 170 vec.addElement(aliase.nextElement()); 173 String[] res = new String[vec.size()]; 174 for (i = 0; i < vec.size(); i++) { 175 res[i] = vec.elementAt(i).toString() [all...] |
/external/eigen/blas/ |
PackedSelfadjointProduct.h | 25 static void run(Index size, Scalar* mat, const Scalar* vec, RealScalar alpha) 33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))); 45 static void run(Index size, Scalar* mat, const Scalar* vec, RealScalar alpha) 47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
NodeSequence.java | 314 NodeVector vec = getVector(); local 315 if (null != vec) 318 if(m_next < vec.size()) 321 int next = vec.elementAt(m_next); 427 NodeVector vec = getVector(); local 428 if((currentIndex >= 0) && (currentIndex < vec.size())) 429 return vec.elementAt(currentIndex); 540 NodeVector vec = getVector(); local 541 if(null != vec) 543 int oldNode = vec.elementAt(index) 727 NodeVector vec = getVector(); local [all...] |
/external/freetype/src/smooth/ |
ftsmooth.c | 268 FT_Vector* vec; local 272 for ( vec = points; vec < points_end; vec++ ) 273 vec->x *= 3; 276 for ( vec = points; vec < points_end; vec++ ) 277 vec->y *= 3; 287 FT_Vector* vec; local [all...] |
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/smooth/ |
ftsmooth.c | 268 FT_Vector* vec; local 272 for ( vec = points; vec < points_end; vec++ ) 273 vec->x *= 3; 276 for ( vec = points; vec < points_end; vec++ ) 277 vec->y *= 3; 287 FT_Vector* vec; local [all...] |