Home
last modified time | relevance | path

Searched full:just (Results 551 - 575 of 17155) sorted by relevance

1...<<21222324252627282930>>...687

/third_party/mesa3d/src/util/
H A Dralloc.h114 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
129 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
182 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
203 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
243 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
265 * memory. Instead, it resizes it to a 0-byte ralloc context, just like
312 * Set a callback to occur just before an object is freed.
/third_party/mesa3d/src/gallium/drivers/vc4/
H A Dvc4_simulator.c125 /* A marker placed just after each BO, then checked after rendering to make
449 * Making a VC4 BO is just a matter of making a corresponding BO on the host.
474 * In simulation we defer shader validation until exec time. Just make a host
518 * We just pass this straight through to dumb mmap.
594 /* We do all of the vc4 rendering synchronously, so we just in vc4_simulator_ioctl()
602 /* This is just debug information, nothing to do. */ in vc4_simulator_ioctl()
650 * hardware, but for simulation we just get one shot to set up enough in vc4_simulator_init_global()
/third_party/pcre2/pcre2/src/
H A Dpcre2demo.c48 that just changing 8 to 16 (for example) is not sufficient to convert this
160 * pattern match against the subject string. This does just ONE match. If * in main()
304 * If the previous match was NOT for an empty string, we can just start * in main()
316 * succeed, we still stay in the loop, advancing by just one character. * in main()
400 is zero, it just means we have found all possible matches, so the loop ends. in main()
408 the current position is just before it, advance by an extra byte. (b) in main()
454 demonstration program, we just detect this case and give up. */ in main()
/third_party/pcre2/pcre2/doc/
H A Dpcre2demo.368 that just changing 8 to 16 (for example) is not sufficient to convert this
180 * pattern match against the subject string. This does just ONE match. If *
324 * If the previous match was NOT for an empty string, we can just start *
336 * succeed, we still stay in the loop, advancing by just one character. *
420 is zero, it just means we have found all possible matches, so the loop ends.
428 the current position is just before it, advance by an extra byte. (b)
474 demonstration program, we just detect this case and give up. */
/third_party/protobuf/csharp/src/Google.Protobuf.Test/WellKnownTypes/
H A DWrappersTest.cs148 // Just to test a single value for sanity... in RepeatedWrappersSerializeDeserialize()
160 // This test is just to prove that we use the right format. in RepeatedWrappersBinaryFormat()
204 // Just to test a single value for sanity... in MapWrappersSerializeDeserialize()
249 // Just a single example... note that we can't have a null value here in Reflection_RepeatedFields()
259 // Just a single example... note that we can't have a null value here despite the value type being int? in Reflection_MapFields()
405 // Wrapper message is just long enough - 6 bytes - to use the wrapper fast-path. in UnknownFieldInWrapperInt32FastPath()
459 // Wrapper message is just long enough - 10 bytes - to use the wrapper fast-path. in UnknownFieldInWrapperInt64FastPath()
/third_party/vk-gl-cts/external/vulkan-docs/src/scripts/
H A Dcgenerator.py337 # OpenXR: this section was not under 'else:' previously, just fell through
339 # If the type is an alias, just emit a typedef declaration
407 C type declarations. The <member> tags are just like <param>
412 If alias is not None, then this struct aliases another; just
459 which aliases this type; just generate that alias."""
471 # If the group name is aliased, just emit a typedef declaration
485 just integers."""
/third_party/skia/src/core/
H A DSkEdgeClipper.cpp112 // so we just clamp against the top in chop_quad_in_Y()
133 // so we just clamp against the bottom in chop_quad_in_Y()
193 // so we just clamp against the left in clipMonoQuad()
211 // so we just clamp against the right in clipMonoQuad()
294 * If just the first or first 2 Y values are above the fTop, we can just smash them in chop_cubic_in_Y()
411 // Current value chosen just by experiment. Larger (and still succeeds) is always better. in too_big_for_reliable_float_math()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dfold.cpp84 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
91 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
102 // Remainder when dividing with 0 is undefined, so we will just pick 0. in BinaryOperate()
113 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
121 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
130 // will be 0, so just return that value. in BinaryOperate()
153 // will be 0, so just return that value. in BinaryOperate()
H A Dscalar_analysis_simplification.cpp41 // just that node) with each of the like terms (or multiplication node) as a
281 // If we can't work out how to fold the expression just add it back into in GatherAccumulatorsFromChildNodes()
336 // If the count is -1 we can just add a negative version of that node, in SimplifyPolynomial()
360 // If there is only one term in the addition left just return that term. in SimplifyPolynomial()
365 // If there are no terms left in the addition just return 0. in SimplifyPolynomial()
451 // If we only have one child in the add just return that. in FoldRecurrentAddExpressions()
469 // entirely and just return the offset as the recurrent expression is in EliminateZeroCoefficientRecurrents()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dfold.cpp84 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
91 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
102 // Remainder when dividing with 0 is undefined, so we will just pick 0. in BinaryOperate()
113 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
121 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
130 // will be 0, so just return that value. in BinaryOperate()
153 // will be 0, so just return that value. in BinaryOperate()
H A Dscalar_analysis_simplification.cpp41 // just that node) with each of the like terms (or multiplication node) as a
281 // If we can't work out how to fold the expression just add it back into in GatherAccumulatorsFromChildNodes()
336 // If the count is -1 we can just add a negative version of that node, in SimplifyPolynomial()
360 // If there is only one term in the addition left just return that term. in SimplifyPolynomial()
365 // If there are no terms left in the addition just return 0. in SimplifyPolynomial()
451 // If we only have one child in the add just return that. in FoldRecurrentAddExpressions()
469 // entirely and just return the offset as the recurrent expression is in EliminateZeroCoefficientRecurrents()
/third_party/skia/tests/
H A DSkBlockAllocatorTest.cpp128 // between "start" and "aligned offset," which is just padding and is left poisoned) in DEF_TEST()
269 // start of the block (i.e. unwinds the entire stack, and not just the last cursor position) in DEF_TEST()
389 // Since we're back to just the head block, if we add a new block, the growth policy should in DEF_TEST()
428 // pool should have just the head block, but was reset in DEF_TEST()
445 // pool should have just the head block, but was reset in DEF_TEST()
536 // This steal should move B's 2 heap blocks to A, bringing A to 6 and B to just its head in DEF_TEST()
547 // Redoing the steal now that B is just a head block should be a no-op in DEF_TEST()
/third_party/pcre2/pcre2/doc/html/
H A Dpcre2demo.html65 that just changing 8 to 16 (for example) is not sufficient to convert this
177 * pattern match against the subject string. This does just ONE match. If *
321 * If the previous match was NOT for an empty string, we can just start *
333 * succeed, we still stay in the loop, advancing by just one character. *
417 is zero, it just means we have found all possible matches, so the loop ends.
425 the current position is just before it, advance by an extra byte. (b)
471 demonstration program, we just detect this case and give up. */
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Utils/
H A DLoopRotationUtils.cpp86 /// RewriteUsesOfClonedInstructions - We just cloned the instructions from the
203 /// \param SimplifiedLatch is true if the latch was just folded into the final
235 // latch was just simplified. Or if we think it will be profitable. in rotateLoop()
269 // indirectbr in it, just give up. in rotateLoop()
307 // For PHI nodes, the value available in OldPreHeader is just the in rotateLoop()
392 // Along with all the other instructions, we just cloned OrigHeader's in rotateLoop()
513 // connected by an unconditional branch. This is just a cleanup so the in rotateLoop()
H A DSSAUpdater.cpp100 // If there is no definition of the renamed variable in this block, just use in GetValueInMiddleOfBlock()
141 // If there are no predecessors, just return undef. in GetValueInMiddleOfBlock()
145 // Otherwise, if all the merged values are the same, just use it. in GetValueInMiddleOfBlock()
303 /// operands, i.e., it was just added.
374 // Okay, this is the first use in the block. If this block just has a in run()
399 // scan large blocks, so just add all loads as live ins. in run()
407 // Otherwise, we have mixed loads and stores (or just a bunch of stores). in run()
/third_party/unity/docs/
H A DUnityHelperScriptsGuide.md6 The Unity project includes a couple of Ruby scripts for making your life just a tad easier.
9 Just install whatever the latest version is, and it is likely to work. You can find Ruby at [ruby-lang.org][].
74 If you would like to force your generated test runner to include one or more header files, you can just include those at the command line too.
75 Just make sure these are _after_ the YAML file, if you are using one:
136 You can normally just return `num_failures`.
178 You can just use the same array here.
180 This script will just ignore the plugins that don't require additional support.
/third_party/typescript/src/services/
H A DgoToDefinition.ts98 // Don't go to the component constructor definition for a JSX element, just go to the component definition.
101 // For a function, if this is the original function definition, return just sigInfo.
133 // If the node is the name of a BindingElement within an ObjectBindingPattern instead of just returning the
269 // If a function returns 'void' or some other type with no definition, just return the function definition.
282 // If the type is just a function's inferred type,
367 * declaration contribute to the symbol for `f`?" If the answer is just `Namespace` and the
423 const symbolName = checker.symbolToString(symbol); // Do not get scoped name, just the name of the symbol
/third_party/spirv-tools/source/opt/
H A Dfold.cpp84 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
91 // Dividing by 0 is undefined, so we will just pick 0. in BinaryOperate()
102 // Remainder when dividing with 0 is undefined, so we will just pick 0. in BinaryOperate()
113 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
121 // Mod with 0 is undefined, so we will just pick 0. in BinaryOperate()
130 // will be 0, so just return that value. in BinaryOperate()
153 // will be 0, so just return that value. in BinaryOperate()
H A Dscalar_analysis_simplification.cpp40 // just that node) with each of the like terms (or multiplication node) as a
280 // If we can't work out how to fold the expression just add it back into in GatherAccumulatorsFromChildNodes()
335 // If the count is -1 we can just add a negative version of that node, in SimplifyPolynomial()
359 // If there is only one term in the addition left just return that term. in SimplifyPolynomial()
364 // If there are no terms left in the addition just return 0. in SimplifyPolynomial()
450 // If we only have one child in the add just return that. in FoldRecurrentAddExpressions()
468 // entirely and just return the offset as the recurrent expression is in EliminateZeroCoefficientRecurrents()
/third_party/vulkan-headers/registry/
H A Dcgenerator.py337 # OpenXR: this section was not under 'else:' previously, just fell through
339 # If the type is an alias, just emit a typedef declaration
407 C type declarations. The <member> tags are just like <param>
412 If alias is not None, then this struct aliases another; just
459 which aliases this type; just generate that alias."""
471 # If the group name is aliased, just emit a typedef declaration
485 just integers."""
/third_party/skia/third_party/externals/libjpeg-turbo/
H A Dlibjpeg.txt218 if you process just one scanline at a time, you must make a one-element
258 application doesn't control those directly.) This struct can be just a local
267 "Error handling". For now we'll assume you are just using the default error
388 just one or a few scanlines at a time. The expected format for the passed
400 in the next_scanline field of the JPEG object. Usually you can just use
420 ignore the return value. It is different in just two cases:
492 * If you don't need the JPEG object any more, just call
519 This is just like initialization for compression, as discussed above,
572 Typical code for this step is just
589 It is permissible to stop at this point if you just wante
[all...]
/third_party/python/Doc/library/
H A Dwsgiref.rst21 of WSGI just to install a WSGI application or to write a web application using
35 .. XXX If you're just trying to write a web application...
100 When ``PATH_INFO`` is just a "/", this routine returns an empty string and
214 nonexistent header just returns ``None``, and deleting a nonexistent header does
222 fact, the :meth:`items` method just returns a copy of the wrapped header list.
371 implementation just returns ``sys.stderr``.
556 method actually transmits the data; :class:`BaseHandler` just separates write
681 The default implementation just uses the :attr:`error_status`,
701 default list just sets the content type to ``text/plain``.
728 method just return
[all...]
/third_party/skia/third_party/externals/libpng/
H A Dexample.c30 * requires just two function calls, as in the following complete program.
31 * Writing a file needs just one function call, so long as the data has an
85 * PNG_IMAGE_ROW_STRIDE, but if you just allocate space for the
142 * just converting them all to 32-bit RGBA PNG files; you can do that between
153 * per pixel (red, green and blue); if not set, the image will just have one
196 * is unavoidable - the 8-bit format just doesn't have enough resolution.
243 * of the image to determine the file type, so it would be easiest just
375 * Use accurate scaling if it's available, otherwise just chop off the
709 * NULL rows (it will just return) and for non-interlaced images
710 * (it just doe
[all...]
/third_party/python/Doc/howto/
H A Dclinic.rst197 When you're done you should have just the text, based at the left
241 the top. (In our sample code we'll just show the two blocks next to
470 Let's reiterate, just because it's kind of weird. Your code should now
479 Argument Clinic generated the checksum line and the function prototype just
582 used for the C functions. Just add the keyword ``"as"``
666 cannot have accurate signatures in Python, because Python just
808 to the impl function, just after the string parameter, as a parameter named
884 negative numbers. You just can't do that with a legacy converter!
889 Just run ``Tools/clinic/clinic.py --converters`` to see the full list.
963 value called ``NULL`` for just thi
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dnfrule.cpp254 // it's omitted, just set the base value to 0.
279 // just build up the value as we encounter the digits.
399 // return the description with all the stuff we've just waded through
400 // stripped off the front. It now contains just the rule body.
1144 * this function just matches against this substitution and updates
1171 // instance of "delimiter" we just found.
1235 // for "delimiter". Instead, just use "sub" to parse as much of
1276 * is off, this just calls startsWith(). If lenient parse mode is on,
1292 // zero characters. Just go ahead and return 0.
1336 // This was not pretty, especially since the string "fifty-7" parsed just fin
[all...]

Completed in 26 milliseconds

1...<<21222324252627282930>>...687