Home
last modified time | relevance | path

Searched refs:inner (Results 226 - 250 of 553) sorted by relevance

12345678910>>...23

/third_party/vk-gl-cts/external/openglcts/modules/glesext/tessellation_shader/
H A DesextcTessellationShaderUtils.cpp593 * @param inner_tessellation_level Two FP values that define inner tessellation levels.
646 * @param inner Two FP values defining inner tessellation values to be used for tessellation.
658 const float* inner, bool point_mode, _tessellation_primitive_mode primitive_mode, in getDataGeneratedByTessellator()
667 initTessellationVertexCounterProgram(inner, outer, test_n_patch_vertices, vertex_spacing, primitive_mode, in getDataGeneratedByTessellator()
1016 item_1.inner[0] = float(n_min_patch_vertices); in getTessellationLevelSetForPrimitiveMode()
1017 item_1.inner[1] = float(n_min_patch_vertices + 1); in getTessellationLevelSetForPrimitiveMode()
1023 item_2.inner[0] = float(n_half_max_patch_vertices_mul_min); in getTessellationLevelSetForPrimitiveMode()
1024 item_2.inner[1] = float(n_half_max_patch_vertices_mul_min - 1); in getTessellationLevelSetForPrimitiveMode()
1030 item_3.inner[ in getTessellationLevelSetForPrimitiveMode()
657 getDataGeneratedByTessellator( const float* inner, bool point_mode, _tessellation_primitive_mode primitive_mode, _tessellation_shader_vertex_ordering vertex_ordering, _tessellation_shader_vertex_spacing vertex_spacing, const float* outer) getDataGeneratedByTessellator() argument
[all...]
/kernel/linux/linux-5.10/crypto/
H A DMakefile110 CFLAGS_aegis128-neon-inner.o += -ffreestanding -march=armv8-a -mfloat-abi=softfp
111 CFLAGS_aegis128-neon-inner.o += -mfpu=crypto-neon-fp-armv8
112 aegis128-$(CONFIG_CRYPTO_AEGIS128_SIMD) += aegis128-neon.o aegis128-neon-inner.o
122 CFLAGS_aegis128-neon-inner.o += $(aegis128-cflags-y)
123 CFLAGS_REMOVE_aegis128-neon-inner.o += -mgeneral-regs-only
124 aegis128-$(CONFIG_CRYPTO_AEGIS128_SIMD) += aegis128-neon.o aegis128-neon-inner.o
/third_party/python/Tools/c-analyzer/cpython/
H A D_capi.py290 inner = getattr(item, _inner)
294 summary['totals']['bygroup'][outer][inner] += 1
305 for inner in inners:
306 if bygroup[outer][inner] == 0:
307 del bygroup[outer][inner]
647 for inner, count in bygroup[outer].items():
648 yield f' {inner + ":":9} {count}'
/third_party/skia/tests/
H A DPathOpsConicIntersectionTest.cpp330 static void oneOff(skiatest::Reporter* reporter, int outer, int inner) { in oneOff() argument
332 const ConicPts& c2 = testSet[inner]; in oneOff()
338 for (int inner = outer + 1; inner < testSetCount; ++inner) { in oneOffTests()
339 oneOff(reporter, outer, inner); in oneOffTests()
H A DRegionTest.cpp125 static bool slow_contains(const SkRegion& outer, const SkRegion& inner) { in slow_contains() argument
127 tmp.op(outer, inner, SkRegion::kUnion_Op); in slow_contains()
137 static bool slow_intersects(const SkRegion& outer, const SkRegion& inner) { in slow_intersects() argument
139 return tmp.op(outer, inner, SkRegion::kIntersect_Op); in slow_intersects()
199 SkRegion inner; in test_proc() local
200 randRgn(rand, &inner, 2); in test_proc()
201 proc(reporter, outer, inner); in test_proc()
/third_party/skia/src/pathops/
H A DSkOpCoincidence.cpp813 SkCoincidentSpans* inner = outer; in DEBUG_COIN_DECLARE_PARAMS() local
817 while ((inner = inner->next())) { in DEBUG_COIN_DECLARE_PARAMS()
825 const SkOpPtT* ics = inner->coinPtTStart(); in DEBUG_COIN_DECLARE_PARAMS()
829 const SkOpPtT* ios = inner->oppPtTStart(); in DEBUG_COIN_DECLARE_PARAMS()
840 const SkOpPtT* ice = inner->coinPtTEnd(); in DEBUG_COIN_DECLARE_PARAMS()
851 const SkOpPtT* ioe = inner->oppPtTEnd(); in DEBUG_COIN_DECLARE_PARAMS()
862 const SkOpPtT* ice = inner->coinPtTEnd(); in DEBUG_COIN_DECLARE_PARAMS()
874 const SkOpPtT* ioe = inner->oppPtTEnd(); in DEBUG_COIN_DECLARE_PARAMS()
1260 SkCoincidentSpans* inner in DEBUG_COIN_DECLARE_PARAMS() local
[all...]
H A DSkPathOpsDebug.cpp870 if (span && span->segment() != opp && span->containsCoincidence(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted in debugMissingCoincidence()
873 if (spanBase->segment() != opp && spanBase->containsCoinEnd(opp)) { // debug has additional condition since it may be called before inner duplicate points have been deleted in debugMissingCoincidence()
1886 const SkCoincidentSpans* inner = outer; in debugAddMissing() local
1887 while ((inner = inner->next())) { in debugAddMissing()
1890 const SkOpPtT* ics = inner->coinPtTStart(); in debugAddMissing()
1894 const SkOpPtT* ios = inner->oppPtTStart(); in debugAddMissing()
1905 const SkOpPtT* ice = inner->coinPtTEnd(); in debugAddMissing()
1916 const SkOpPtT* ioe = inner->oppPtTEnd(); in debugAddMissing()
1927 const SkOpPtT* ice = inner in debugAddMissing()
2490 const SkOpPtT* inner = opp->ptT(); debugMergeMatches() local
[all...]
H A DSkDCubicLineIntersection.cpp207 for (int inner = 0; inner < fIntersections->used(); ++inner) { in uniqueAnswer()
208 if (fIntersections->pt(inner) != pt) { in uniqueAnswer()
211 double existingCubicT = (*fIntersections)[0][inner]; in uniqueAnswer()
H A DSkDQuadLineIntersection.cpp221 for (int inner = 0; inner < fIntersections->used(); ++inner) { in uniqueAnswer()
222 if (fIntersections->pt(inner) != pt) { in uniqueAnswer()
225 double existingQuadT = (*fIntersections)[0][inner]; in uniqueAnswer()
/kernel/linux/linux-6.6/drivers/net/ethernet/mellanox/mlx5/core/en/
H A Drss.h30 bool inner);
34 bool inner, u32 *tirn);
/third_party/backends/include/sane/
H A Dsanei_ir.h348 * @param[in] inner crop within (!=0) or outside (==0) the image's edges
359 unsigned int * dist_map, int inner, int * edges);
362 * @brief Dilate clean image parts into dirty ones and smooth int inner,
371 * @param[in] inner find crop within or outside the image's edges
389 SANE_Bool smooth, int inner,
/third_party/python/Lib/test/test_zoneinfo/
H A D_support.py19 def inner(): function
23 return inner
/third_party/python/Lib/unittest/
H A Dsignals.py60 def inner(*args, **kwargs): function
67 return inner
/third_party/skia/modules/androidkit/src/
H A DColorFilters.cpp31 static jlong MakeCompose(JNIEnv*, jobject, jlong outer, jlong inner) { in MakeCompose() argument
33 sk_ref_sp(reinterpret_cast<SkColorFilter*>(inner))); in MakeCompose()
/third_party/skia/third_party/externals/tint/src/resolver/
H A Dvar_let_validation_test.cc189 auto* inner = Block(Decl(var_inner)); in TEST_F() local
190 auto* outer_body = Block(Decl(var_outer), inner); in TEST_F()
224 // inner: Inner; in TEST_F()
228 // let p : pointer<storage, i32, read_write> = &s.inner.arr[2]; in TEST_F()
230 auto* inner = Structure("Inner", {Member("arr", ty.array<i32, 4>())}); in TEST_F() local
231 auto* buf = Structure("S", {Member("inner", ty.Of(inner))}, in TEST_F()
240 IndexAccessor(MemberAccessor(MemberAccessor(storage, "inner"), "arr"), 4); in TEST_F()
/third_party/python/Lib/test/test_email/
H A Dtest_defect_handling.py59 inner = msg.get_payload(0)
60 self.assertTrue(hasattr(inner, 'defects'))
61 self.assertEqual(len(self.get_defects(inner)), 1)
62 self.assertIsInstance(self.get_defects(inner)[0],
/third_party/rust/crates/syn/src/
H A Dparse.rs120 //! an [`Attribute`] can be either "outer" like `#[...]` or "inner" like
173 //! // Parse zero or more outer attributes but not inner attributes.
266 let (inner, old_span) = inner_unexpected(self); in drop()
268 inner.set(Unexpected::Some(unexpected_span)); in drop()
444 while let Some((inner, _span, rest)) = cursor.group(Delimiter::None) { in span_of_unexpected_ignoring_nones()
445 if let Some(unexpected) = span_of_unexpected_ignoring_nones(inner) { in span_of_unexpected_ignoring_nones()
/third_party/skia/src/gpu/geometry/
H A DGrAATriangulator.cpp111 if (Vertex* inner = outer->fPartner) { in connectPartners()
112 if ((inner->fPrev || inner->fNext) && (outer->fPrev || outer->fNext)) { in connectPartners()
116 this->makeConnectingEdge(outer, inner, EdgeType::kConnector, c, 0); in connectPartners()
117 inner->fPartner = outer->fPartner = nullptr; in connectPartners()
361 // expected +/-1 for outer and +/-2 for inner that is used to fill properly during in collapseOverlapRegions()
434 Line inner(e->fLine); in strokeBoundary()
435 inner.fC -= radius; in strokeBoundary()
440 if (!prevEdge->fLine.nearParallel(e->fLine) && prevInner.intersect(inner, &innerPoint) && in strokeBoundary()
459 // Miter inner point in strokeBoundary()
[all...]
/kernel/linux/linux-5.10/net/sched/
H A Dsch_htb.c130 } inner; member
201 * filters in qdisc and in inner nodes (if higher filter points to the inner
228 /* Start with inner filter chain if a non-leaf class is selected */ in htb_classify()
258 /* we have got inner class; apply inner filter chain */ in htb_classify()
410 if (WARN_ON_ONCE(prio >= ARRAY_SIZE(p->inner.clprio))) in htb_activate_prios()
414 if (p->inner.clprio[prio].feed.rb_node) in htb_activate_prios()
420 htb_add_to_id_tree(&p->inner.clprio[prio].feed, cl, prio); in htb_activate_prios()
450 if (p->inner in htb_deactivate_prios()
[all...]
/kernel/linux/linux-6.6/net/sched/
H A Dsch_htb.c131 } inner; member
213 * filters in qdisc and in inner nodes (if higher filter points to the inner
238 /* Start with inner filter chain if a non-leaf class is selected */ in htb_classify()
268 /* we have got inner class; apply inner filter chain */ in htb_classify()
435 if (WARN_ON_ONCE(prio >= ARRAY_SIZE(p->inner.clprio))) in htb_activate_prios()
439 if (p->inner.clprio[prio].feed.rb_node) in htb_activate_prios()
445 htb_add_to_id_tree(&p->inner.clprio[prio].feed, cl, prio); in htb_activate_prios()
477 if (p->inner in htb_deactivate_prios()
[all...]
/third_party/rust/crates/rust-openssl/openssl/src/ssl/
H A Dmod.rs3403 /// Returns a shared reference to the inner stream.
3408 /// Returns a mutable reference to the inner stream.
3844 inner: SslStream<S>,
3855 inner: SslStream::new(ssl, stream).unwrap(), in new()
3875 match unsafe { ffi::SSL_stateless(self.inner.ssl.as_ptr()) } { in stateless()
3889 unsafe { ffi::SSL_set_connect_state(self.inner.ssl.as_ptr()) } in set_connect_state()
3898 unsafe { ffi::SSL_set_accept_state(self.inner.ssl.as_ptr()) } in set_accept_state()
3903 match self.inner.connect() { in connect()
3904 Ok(()) => Ok(self.inner), in connect()
3908 stream: self.inner, in connect()
[all...]
/third_party/node/deps/npm/node_modules/node-gyp/gyp/pylib/packaging/
H A Dmarkers.py87 inner = (_format_marker(m, first=False) for m in marker)
89 return " ".join(inner)
91 return "(" + " ".join(inner) + ")"
/third_party/rust/crates/clap/src/builder/
H A Dos_str.rs250 pub(crate) mod inner {
284 pub(crate) mod inner {
303 pub(crate) use inner::Inner;
/third_party/skia/samplecode/
H A DSampleSimpleStroker.cpp137 // Trace the inner and outer paths simultaneously. Inner will therefore be in getFillPath()
173 // Walk inner path in reverse, appending to result in getFillPath()
225 PathRecorder *outer = &fOuter, *inner = &fInner; in join()
227 std::swap(inner, outer); in join()
245 // where miterLength is the length of the miter from outer point to inner corner. in join()
258 // Check 2 cases to see we can directly connect to the inner miter point in join()
266 // line connecting the inner and outer corners of prev at t=0. If len is below in join()
268 // and we'll need the inner loop geometry. in join()
271 // This is the point at which the inner miter point will lie on the inner strok in join()
[all...]
H A DSampleFatBits.cpp199 SkPaint inner, outer; in drawFG() local
201 inner.setAntiAlias(true); in drawFG()
202 inner.setColor(SK_ColorBLACK); in drawFG()
203 inner.setStrokeWidth(PIXEL_CENTER_SIZE); in drawFG()
216 canvas->drawPoint(x, y, inner); in drawFG()

Completed in 29 milliseconds

12345678910>>...23