HomeSort by relevance Sort by last modified time
    Searched refs:pos1 (Results 1 - 25 of 187) sorted by null

1 2 3 4 5 6 7 8

  /external/google-breakpad/src/common/linux/
linux_libc_support.cc 199 size_t pos1 = 0; local
203 if (pos1 + 1 < len) {
204 s1[pos1] = s2[pos2];
205 pos1++;
210 s1[pos1] = '\0';
216 size_t pos1 = 0; local
218 while (pos1 < len && s1[pos1] != '\0')
219 pos1++;
221 if (pos1 == len
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrwbenc/inc/
q_pulse.h 35 Word16 pos1, /* (i) position of the pulse 1 */
40 Word16 pos1, /* (i) position of the pulse 1 */
46 Word16 pos1, /* (i) position of the pulse 1 */
  /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/
d1035pf.cpp 134 Word16 i, j, pos1, pos2, sign, tmp;
152 pos1 = add (i, j); // position of pulse "j"
164 cod[pos1] = sign;
174 if (sub (pos2, pos1) < 0)
212 Word16 i, j, pos1, pos2; local
231 pos1 = i + j; /* position of pulse "j" */
244 *(cod + pos1) = sign;
255 if (pos2 < pos1)
d8_31pf.cpp 566 Word16 pos1; local
589 pos1 = (linear_codewords[j] << 2) + j;
601 if (pos1 < L_SUBFR)
603 cod[pos1] = sign; /* avoid buffer overflow */
612 if (pos2 < pos1)
  /external/bison/examples/calc++/
position.hh 139 operator== (const position& pos1, const position& pos2)
141 return (pos1.line == pos2.line
142 && pos1.column == pos2.column
143 && (pos1.filename == pos2.filename
144 || (pos1.filename && pos2.filename
145 && *pos1.filename == *pos2.filename)));
150 operator!= (const position& pos1, const position& pos2)
152 return !(pos1 == pos2);
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/
lpc_analysis.c 212 int k, n, j, pos1, pos2; local
247 for (pos1 = 0; pos1 < QLOOKAHEAD; pos1++)
248 maskdata->DataBufferLo[pos1 + WINLEN - QLOOKAHEAD] = inLo[pos1];
253 for (pos1 = 0; pos1 < WINLEN - UPDATE/2; pos1++) {
254 maskdata->DataBufferLo[pos1] = maskdata->DataBufferLo[pos1 + UPDATE/2]
393 int frameCntr, activeFrameCntr, n, pos1, pos2; local
    [all...]
  /external/v8/test/cctest/
test-liveedit.cc 65 : pos1(pos1_param), pos2(pos2_param),
67 int pos1; member in class:__anon25268::DiffChunkStruct
82 void AddChunk(int pos1, int pos2, int len1, int len2) {
83 current_chunk_ = new(zone_) DiffChunkStruct(pos1, pos2, len1, len2);
108 int pos1 = 0; local
116 int diff_pos1 = chunk->pos1;
117 int similar_part_length = diff_pos1 - pos1;
123 CHECK(pos1 + j < len1);
125 CHECK_EQ(s1[pos1 + j], s2[pos2 + j]);
128 pos1 = diff_pos1 + chunk->len1
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrwbenc/src/
q_pulse.c 52 Word16 pos1, /* (i) position of the pulse 1 */
62 if (((pos2 ^ pos1) & NB_POS) == 0)
65 if(pos1 <= pos2) /* ((pos1 - pos2) <= 0) */
67 /* index = ((pos1 & mask) << N) + (pos2 & mask); */
68 index = L_deposit_l(add1((((Word16) (pos1 & mask)) << N), ((Word16) (pos2 & mask))));
71 /* ((pos2 & mask) << N) + (pos1 & mask); */
72 index = L_deposit_l(add1((((Word16) (pos2 & mask)) << N), ((Word16) (pos1 & mask))));
74 if ((pos1 & NB_POS) != 0)
82 if (vo_sub((Word16) (pos1 & mask), (Word16) (pos2 & mask)) <= 0
    [all...]
  /external/v8/test/mjsunit/
debug-liveedit-diff.js 36 var pos1 = 0;
44 var similar_length = diff_array[i] - pos1;
45 assertEquals(s1.substring(pos1, pos1 + similar_length),
48 print(s1.substring(pos1, pos1 + similar_length));
49 pos1 += similar_length;
51 print("<<< " + pos1 + " " + diff_array[i + 1]);
52 print(s1.substring(pos1, diff_array[i + 1]));
56 pos1 = diff_array[i + 1]
    [all...]
  /external/icu/icu4c/source/samples/uciter8/
uciter8.c 45 int32_t i, pos1, pos2, middle, length; local
59 pos1=iter1->move(iter1, middle, UITER_ZERO);
60 if(pos1!=middle) {
61 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
100 pos1=iter1->move(iter1, 0, UITER_START);
101 if(pos1<0) {
139 pos1=iter1->move(iter1, middle, UITER_ZERO);
140 if(pos1!=middle) {
141 log_err("%s->move(from end to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
152 pos1=iter1->move(iter1, 1, UITER_ZERO)
    [all...]
  /frameworks/av/media/libstagefright/codecs/amrwb/src/
dec_alg_codebook.cpp 120 int16 pos1; local
127 pos1 = ((index & mask) + offset);
133 pos1 += NB_POS;
135 pos[0] = pos1;
147 int16 pos1, pos2, tmp; local
154 /* pos1 = (((index >> N) & mask) + offset); */
155 pos1 = (int16)(add_int32((shr_int32(index, N) & mask), (int32)(offset)));
160 if (pos2 < pos1) /* ((pos2 - pos1) < 0) */
164 pos1 += NB_POS; /* pos1 += NB_POS; *
    [all...]
  /external/freetype/src/truetype/
ttpload.c 177 FT_ULong pos1, pos2; local
182 pos1 = pos2 = 0;
191 pos1 = FT_NEXT_ULONG( p );
192 pos2 = pos1;
202 pos1 = FT_NEXT_USHORT( p );
203 pos2 = pos1;
208 pos1 <<= 1;
214 if ( pos1 > face->glyf_len )
219 pos1, gindex, face->glyf_len ));
241 if ( pos2 >= pos1 )
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/truetype/
ttpload.c 189 FT_ULong pos1, pos2; local
194 pos1 = pos2 = 0;
203 pos1 = FT_NEXT_ULONG( p );
204 pos2 = pos1;
214 pos1 = FT_NEXT_USHORT( p );
215 pos2 = pos1;
220 pos1 <<= 1;
226 if ( pos1 > face->glyf_len )
232 pos1, gindex, face->glyf_len ));
255 if ( pos2 >= pos1 )
    [all...]
  /external/pdfium/third_party/freetype/src/truetype/
ttpload.c 185 FT_ULong pos1, pos2; local
190 pos1 = pos2 = 0;
199 pos1 = FT_NEXT_ULONG( p );
200 pos2 = pos1;
210 pos1 = FT_NEXT_USHORT( p );
211 pos2 = pos1;
216 pos1 <<= 1;
222 if ( pos1 > face->glyf_len )
227 pos1, gindex, face->glyf_len ));
249 if ( pos2 >= pos1 )
    [all...]
  /external/mesa3d/src/gallium/auxiliary/draw/
draw_pipe_wide_line.c 73 float *pos1 = v1->data[pos]; local
95 pos1[1] = pos1[1] + half_width - bias;
102 pos1[0] -= 0.5f;
109 pos1[0] += 0.5f;
118 pos1[0] = pos1[0] + half_width + bias;
125 pos1[1] -= 0.5f;
132 pos1[1] += 0.5f;
  /frameworks/support/samples/Support7Demos/src/com/example/android/supportv7/widget/adapter/
SimpleStringAdapter.java 66 public void swap(int pos1, int pos2) {
67 String tmp = mValues.get(pos1);
68 mValues.set(pos1, mValues.get(pos2));
70 notifyItemRemoved(pos1);
  /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
lpc_masking_model.c 539 int pos1, pos2; local
606 for (pos1 = 0; pos1 < QLOOKAHEAD; pos1++) {
607 maskdata->DataBufferLoQ0[pos1 + WINLEN - QLOOKAHEAD] = inLoQ0[pos1];
613 for (pos1 = 0; pos1 < WINLEN - UPDATE/2; pos1++) {
614 maskdata->DataBufferLoQ0[pos1] = maskdata->DataBufferLoQ0[pos1 + UPDATE/2]
    [all...]
  /external/bison/data/
location.cc 119 operator== (const position& pos1, const position& pos2)
121 return (pos1.line == pos2.line
122 && pos1.column == pos2.column
123 && (pos1.filename == pos2.filename
124 || (pos1.filename && pos2.filename
125 && *pos1.filename == *pos2.filename)));
130 operator!= (const position& pos1, const position& pos2)
132 return !(pos1 == pos2);
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/ConstraintSolver/
btContactConstraint.h 65 void resolveSingleBilateral(btRigidBody& body1, const btVector3& pos1,
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/
btSphereSphereCollisionAlgorithm.cpp 84 btVector3 pos1 = col1Wrap->getWorldTransform().getOrigin() + radius1* normalOnSurfaceB; local
89 resultOut->addContactPoint(normalOnSurfaceB,pos1,dist);
  /external/libcxx/test/std/experimental/string.view/string.view.ops/
compare.size_size_sv.pass.cpp 13 // constexpr int compare(size_type pos1, size_type n1, basic_string_view str) const;
23 void test1 ( std::experimental::basic_string_view<CharT> sv1, size_t pos1, size_t n1,
28 assert ( sign( sv1.compare(pos1, n1, sv2)) == sign(expected));
29 assert(pos1 <= sv1.size());
31 catch (const std::out_of_range&) { assert(pos1 > sv1.size()); }
36 void test ( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected ) {
41 test1(sv1, pos1, n1, sv2, expected);
compare.pointer_size.pass.cpp 12 // constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
23 size_t pos1, size_t n1, const CharT *s, int expected ) {
25 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
26 assert(pos1 <= sv1.size());
28 catch (const std::out_of_range&) { assert(pos1 > sv1.size()); }
33 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected)
37 test1 ( sv1, pos1, n1, s2, expected );
  /cts/hostsidetests/net/app/src/com/android/cts/net/hostside/
PacketReflector.java 64 private static void swapBytes(byte[] buf, int pos1, int pos2, int len) {
66 byte b = buf[pos1 + i];
67 buf[pos1 + i] = buf[pos2 + i];
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/dynamics/com/badlogic/gdx/physics/bullet/dynamics/
Dynamics.java 92 public static void resolveSingleBilateral(btRigidBody body1, Vector3 pos1, btRigidBody body2, Vector3 pos2, float distance, Vector3 normal, SWIGTYPE_p_float impulse, float timeStep) {
93 DynamicsJNI.resolveSingleBilateral(btRigidBody.getCPtr(body1), body1, pos1, btRigidBody.getCPtr(body2), body2, pos2, distance, normal, SWIGTYPE_p_float.getCPtr(impulse), timeStep); local
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/linearmath/com/badlogic/gdx/physics/bullet/linearmath/
btTransformUtil.java 64 public static void calculateVelocityQuaternion(Vector3 pos0, Vector3 pos1, Quaternion orn0, Quaternion orn1, float timeStep, Vector3 linVel, Vector3 angVel) {
65 LinearMathJNI.btTransformUtil_calculateVelocityQuaternion(pos0, pos1, orn0, orn1, timeStep, linVel, angVel);

Completed in 911 milliseconds

1 2 3 4 5 6 7 8