/external/skia/src/core/ |
H A D | SkScan_Antihair.cpp | 878 // We want the inverse of B-T, since we're the inner-stroke 975 SkIRect inner; 976 // set inner to the inner rect of the middle section 977 inner.set(FDot8Floor(innerL), FDot8Floor(innerT), FDot8Ceil(innerR), FDot8Ceil(innerB)); 980 fillcheckrect(outer.fLeft, outer.fTop, outer.fRight, inner.fTop, 982 fillcheckrect(outer.fLeft, inner.fTop, inner.fLeft, inner.fBottom, 984 fillcheckrect(inner [all...] |
/external/jemalloc/test/src/ |
H A D | SFMT.c | 384 int inner = 0; local 390 inner ^= psfmt32[idxof(i)] & parity[i]; 392 inner ^= inner >> i; 393 inner &= 1; 395 if (inner == 1) {
|
/external/doclava/src/com/google/doclava/ |
H A D | AndroidAuxSource.java | 204 for (AnnotationInstanceInfo inner : annotation.type().annotations()) { 205 if (inner.type().qualifiedNameMatches("android", "annotation.IntDef")) { 210 for (AnnotationValueInfo val : inner.elementValues()) {
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseCompressedBase.h | 77 /** \returns a const pointer to the array of inner indices. 81 /** \returns a non-const pointer to the array of inner indices. 86 /** \returns a const pointer to the array of the starting positions of the inner vectors. 91 /** \returns a non-const pointer to the array of the starting positions of the inner vectors. 97 /** \returns a const pointer to the array of the number of non zeros of the inner vectors. 101 /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors. 323 const Index inner = Derived::IsRowMajor ? col : row; local 328 const Index p = std::lower_bound(m_matrix->innerIndexPtr()+start, m_matrix->innerIndexPtr()+end,inner) - m_matrix->innerIndexPtr(); 330 return ((p<end) && (m_matrix->innerIndexPtr()[p]==inner)) ? p : Dynamic;
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | SynchronizedMultimapTest.java | 54 TestMultimap<String, String> inner = new TestMultimap<String, String>(); 55 SetMultimap<String, String> outer = Synchronized.setMultimap(inner, inner.mutex);
|
H A D | SynchronizedNavigableMapTest.java | 49 TestMap<K, V> inner = new TestMap<K, V>(innermost, mutex); 50 NavigableMap<K, V> outer = Synchronized.navigableMap(inner, mutex); 242 TestMap<String, String> inner = 245 Synchronized.navigableMap(inner, mutex);
|
H A D | SynchronizedBiMapTest.java | 70 TestBiMap<K, V> inner = 72 BiMap<K, V> outer = Synchronized.biMap(inner, mutex);
|
H A D | SynchronizedMapTest.java | 42 TestMap<K, V> inner = new TestMap<K, V>(new HashMap<K, V>(), mutex); 43 Map<K, V> outer = Synchronized.map(inner, mutex);
|
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
H A D | IncrementalSAXSource_Filter.java | 648 Exception inner=ex.getException(); 649 if(inner instanceof StopException){ 658 System.out.println("Active IncrementalSAXSource_Filter UNEXPECTED SAX exception: "+inner); 659 inner.printStackTrace();
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | fixed-expansion.cpp | 103 using inner = M<B...>;
|
/external/eigen/Eigen/src/Core/ |
H A D | Map.h | 54 * inner and outer strides. 62 * Here's an example of mapping an array as a vector, specifying an inner stride, that is, the pointer 63 * increment between two consecutive coefficients. Here, we're specifying the inner stride as a compile-time 76 * For more details and for an example of specifying both an inner and an outer stride, see class Stride. 104 return StrideType::InnerStrideAtCompileTime != 0 ? m_stride.inner() : 1;
|
/external/libchrome/base/ |
H A D | values_unittest.cc | 708 std::unique_ptr<DictionaryValue> inner(new DictionaryValue); 709 inner->Set("empty_dict", WrapUnique(new DictionaryValue)); 710 inner->Set("empty_list", WrapUnique(new ListValue)); 711 root->Set("dict_with_empty_children", std::move(inner)); 716 std::unique_ptr<ListValue> inner(new ListValue); 717 inner->Append(WrapUnique(new DictionaryValue)); 718 inner->Append(WrapUnique(new ListValue)); 719 root->Set("list_with_empty_children", std::move(inner)); 726 std::unique_ptr<ListValue> inner(new ListValue()); 727 inner [all...] |
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
H A D | LayoutManager.java | 148 private void drawSpacing(Canvas canvas, RectF outer, RectF inner, Paint paint) {
argument 152 canvas.clipRect(inner, Region.Op.DIFFERENCE);
|
/external/clang/test/SemaCXX/ |
H A D | using-decl-1.cpp | 68 namespace inner { namespace in namespace:test0::ns 72 using inner::foo;
|
/external/clang/test/SemaTemplate/ |
H A D | friend-template.cpp | 118 namespace inner { namespace in namespace:PR6022 126 friend A<U1, U2, U3>& inner::f0(A<U1, U2, U3>&, T);
|
/external/skia/src/gpu/ |
H A D | SkGpuDevice.h | 74 void drawDRRect(const SkRRect& outer, const SkRRect& inner, 222 const SkRRect& inner, const SkPaint& paint);
|
/external/webrtc/webrtc/base/ |
H A D | sslidentity.cc | 94 // Find the inner body. We need this to fulfill the contract of 108 std::string inner = pem_string.substr(body + 1, trailer - (body + 1)); 110 *der = Base64::Decode(inner, Base64::DO_PARSE_WHITE |
|
/external/webrtc/webrtc/common_audio/signal_processing/ |
H A D | filter_ar_fast_q12_armv7.S | 30 @ r6: Calculated value for output data_out[]; interation counter for inner loop 58 subs r6, r3, #3 @ Iteration counter for inner loop. 118 subs r6, r3, #2 @ inner loop counter
|
/external/eigen/test/ |
H A D | sparse_block.cpp | 30 const Index inner = ref.innerSize(); local 159 m3.reserve(VectorXi::Constant(outer,int(inner/2))); 161 for(Index k=0; k<(std::min)(j,inner); ++k) 163 for(Index j=0; j<(std::min)(outer, inner); ++j) 170 for(Index j=0; j<(std::min)(outer, inner); ++j)
|
/external/skia/samplecode/ |
H A D | SampleFatBits.cpp | 188 SkPaint inner, outer; local 190 inner.setAntiAlias(true); 191 inner.setColor(SK_ColorBLACK); 192 inner.setStrokeWidth(PIXEL_CENTER_SIZE); 205 canvas->drawPoint(x, y, inner);
|
/external/skia/src/pathops/ |
H A D | SkPathOpsDebug.cpp | 893 if (span && span->segment() != opp && span->containsCoincidence(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted 896 if (spanBase->segment() != opp && spanBase->containsCoinEnd(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted 1901 const SkCoincidentSpans* inner = outer; local 1902 while ((inner = inner->next())) { 1905 const SkOpPtT* ics = inner->coinPtTStart(); 1909 const SkOpPtT* ios = inner->oppPtTStart(); 1920 const SkOpPtT* ice = inner->coinPtTEnd(); 1931 const SkOpPtT* ioe = inner->oppPtTEnd(); 1942 const SkOpPtT* ice = inner 2500 const SkOpPtT* inner = opp->ptT(); local [all...] |
/external/elfutils/src/ |
H A D | elflint.c | 565 for (size_t inner = 1; inner < data->d_size / sizeof (Elf32_Word); 566 ++inner) 567 if (grpdata[inner] == (Elf32_Word) idx) 1121 for (size_t inner = 0; 1122 inner < shdr->sh_size / shdr->sh_entsize; 1123 ++inner) 1126 GElf_Rel *rel = gelf_getrel (reldata, inner, 1135 if (inner >= dyn->d_un.d_val) 1141 else if (inner < dy 4485 unsigned int inner; local 4535 unsigned int inner; local [all...] |
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
H A D | radeon_optimize.c | 48 static struct rc_src_register chain_srcregs(struct rc_src_register outer, struct rc_src_register inner) argument 51 combine.File = inner.File; 52 combine.Index = inner.Index; 53 combine.RelAddr = inner.RelAddr; 58 combine.Abs = inner.Abs; 59 combine.Negate = swizzle_mask(outer.Swizzle, inner.Negate); 62 combine.Swizzle = combine_swizzles(inner.Swizzle, outer.Swizzle);
|
/external/clang/lib/ARCMigrate/ |
H A D | TransUnbridgedCasts.cpp | 134 Expr *inner = E->IgnoreParenCasts(); local 135 if (CallExpr *callE = dyn_cast<CallExpr>(inner)) { 182 Expr *base = inner->IgnoreParenImpCasts();
|
/external/skia/gm/ |
H A D | filterfastbounds.cpp | 48 SkRRect inner = outer; local 49 inner.inset(xRad, yRad); 50 canvas->drawDRRect(outer, inner, p);
|