| /third_party/musl/porting/liteos_a/user/src/misc/ |
| D | wordexp.c | 27 static int do_wordexp(const char *s, wordexp_t *we, int flags) in do_wordexp() argument
42 if (flags & WRDE_REUSE) wordfree(we); in do_wordexp()
87 wc = we->we_wordc; in do_wordexp()
88 wv = we->we_wordv; in do_wordexp()
93 if (we->we_offs > SIZE_MAX/sizeof(void *)/4) in do_wordexp()
95 i += we->we_offs; in do_wordexp()
97 we->we_offs = 0; in do_wordexp()
153 we->we_wordv = wv; in do_wordexp()
154 we->we_wordc = i; in do_wordexp()
157 if (wv) for (i=we->we_offs; i; i--) in do_wordexp()
[all …]
|
| /third_party/musl/src/misc/ |
| D | wordexp.c | 26 static int do_wordexp(const char *s, wordexp_t *we, int flags) in do_wordexp() argument
41 if (flags & WRDE_REUSE) wordfree(we); in do_wordexp()
86 wc = we->we_wordc; in do_wordexp()
87 wv = we->we_wordv; in do_wordexp()
92 if (we->we_offs > SIZE_MAX/sizeof(void *)/4) in do_wordexp()
94 i += we->we_offs; in do_wordexp()
96 we->we_offs = 0; in do_wordexp()
152 we->we_wordv = wv; in do_wordexp()
153 we->we_wordc = i; in do_wordexp()
156 if (wv) for (i=we->we_offs; i; i--) in do_wordexp()
[all …]
|
| /third_party/cJSON/tests/unity/docs/ |
| D | ThrowTheSwitchCodingStandard.md | 4 we try to follow these standards to unify our contributors' code into a cohesive
7 and we'll try to be polite when we notice yours.
15 our standard simple because we also believe that we can only expect someone to
21 Before we get into details on syntax, let's take a moment to talk about our
28 Our philosophy is "support every compiler we can". Most often, this means that
29 we aim for writing C code that is standards compliant (often C89... that seems
34 standard library functions. A lot of Unity is configurable and we have worked
40 compile to a particular location. It's just what we do, because we like
43 Speaking of having things Just Work™, that's our second philosophy. By that, we
44 mean that we do our best to have EVERY configuration option have a logical
[all …]
|
| /third_party/unity/docs/ |
| D | ThrowTheSwitchCodingStandard.md | 4 we try to follow these standards to unify our contributors' code into a cohesive
7 and we'll try to be polite when we notice yours.
15 our standard simple because we also believe that we can only expect someone to
21 Before we get into details on syntax, let's take a moment to talk about our
28 Our philosophy is "support every compiler we can". Most often, this means that
29 we aim for writing C code that is standards compliant (often C89... that seems
34 standard library functions. A lot of Unity is configurable and we have worked
40 compile to a particular location. It's just what we do, because we like
43 Speaking of having things Just Work™, that's our second philosophy. By that, we
44 mean that we do our best to have EVERY configuration option have a logical
[all …]
|
| /third_party/boost/libs/vmd/doc/ |
| D | vmd_identifier_subtyping.qbk | 11 use to pass preprocessing data most often. As we have seen VMD
47 When we do the above, it is best to put all the macros in a single
48 header file and always include that header file when we work generically
59 We will need distinct names for the identifiers in our library, so we will
61 deals in geometrical shapes so we will create a user-defined subtype which
81 we will use it for consistency but will append to it UDEF_SHAPES to
106 Doing a subset register of the actual udef v-type is fairly easy once we understand
115 Once we have added all of the above object-like macros for defining our user-defined
116 subtype to the udef_vmd_macros.hpp header file we have a new data type which we can
117 use generically just like we can use numbers or v-types generically. It is important
[all …]
|
| D | vmd_modifiers_return_type.qbk | 105 will always return BOOST_VMD_TYPE_EMPTY even if we add any return type modifiers
107 will always return BOOST_VMD_TYPE_SEQUENCE even if we add any return type modifiers
128 Using a return type modifier we can convert from a VMD sequence to a
137 we tell the conversion to preserve the type in the conversion output.
140 any return type modifier we use accomplishes nothing but is fine to use.
142 First we show how sequence conversion macros work with the BOOST_VMD_RETURN_TYPE
187 Lets look at how we might use other return type modifiers when doing conversions
188 to avoid UB if we want the type as part of the conversion but
231 In sequence conversion we will get UB whenever we use a return type
232 modifier that parses the data type of the invalid array as an array. But if we use
[all …]
|
| /third_party/python/Objects/stringlib/ |
| D | stringlib_find_two_way_notes.txt | 41 and if a mismatch occurs, we jump ahead by the amount matched plus 1.
55 Why are we allowed to do this? Because we cut the needle very
57 we have
66 cut, then the following alignments do not work, so we can skip them:
86 right, then we could run into something like this:
91 The same argument holds that we can skip ahead by 4, so long as
102 true, we need them to be true for all possible '?' values. We thus
108 Once we have ensured the right part matches, we scan the left part
109 (order doesn't matter, but traditionally right-to-left), and if we
110 find a mismatch, we jump ahead by
[all …]
|
| /third_party/boost/libs/dll/doc/ |
| D | mangled.qbk | 15 As a short example we can import the following functions quite easily:
51 In order to import all the methods in the following library, we will use the [classref smart_librar…
59 Alright, now we have the definition for the plugin, so we use it in the following full-fleshed exam…
63 At first we setup the smart library. Mind that the alias class is needed to provide a type-alias fo…
66 …class, we will need to allocate memory. That of course means, that we need to know the size; unfor…
68 So we import it, call it and allocate memory.
72 Now, we have the memory size and a reference with our alias type. In order to use it, we need to re…
76 …we of course need to initialize it, i.e. call the constructor. The Itanium ABI may also implement …
80 So since the class is now initialized, we can call the name method. If the function is const and/or…
92 Since we are finished, we call the destructor of the class.
[all …]
|
| /third_party/flutter/flutter/packages/flutter_tools/lib/src/commands/ |
| D | update_packages.dart | 132 // ensure we only get flutter/packages
152 // If the checksum is invalid or missing, we can just ask them run to run
169 // we need to run update-packages to recapture the transitive deps.
202 …irectory directory in packages) { // these are all the directories with pubspec.yamls we care about
213 // If we've seen the dependency before, make sure that we are
216 // pointing at the version of a package we get from the Dart SDK
217 // that we download with Flutter), by SDK (e.g. the "flutter"
220 // This makes sure that we don't import a package in two different
232 // Remember this dependency by name so we can look it up again.
234 // Normal dependencies are those we get from pub. The others we
[all …]
|
| /third_party/curl/tests/data/ |
| D | test1560 | 37 we got [fe80::20c:29ff:fe9c:409b]
38 we got https://[::1]/hello.html
39 we got https://example.com/hello.html
40 we got https://[fe80::20c:29ff:fe9c:409b%25eth0]/hello.html
41 we got [fe80::20c:29ff:fe9c:409b]
42 we got eth0
43 we got https://[fe80::20c:29ff:fe9c:409b%25clown]/hello.html
|
| /third_party/boost/libs/tti/doc/ |
| D | tti_function_templates.qbk | 25 C++ we can pass a template as a parameter to another template using what is called
29 class template. The fact that we can pass class templates as a template parameter but not
40 exist at the time introspection of a function template occurs. In plainer C++ terms we call the
46 templates are designed to accept any type(s) and avoid compile time failure. Also when we
47 introspect using a function template instantiation for a nested function template we are
60 Ideally what we would like to do is to be able to verify that the function template
62 exists within the `AType` type, but we can not do that in TTI. If we were to call `AFuncTemplate`
63 from within some functionality within the `AType` type, we would substitute some arguments
67 If we look at this in terms of compile time programming ( aka template metaprogramming )
68 what we are really interested in is whether there is a function template called `AFuncTemplate`
[all …]
|
| D | tti_nested_type.qbk | 24 As with our other macros we can use the alternative form of the macro
76 Now that we have explained the syntax of BOOST_TTI_MEMBER_TYPE
77 we can now answer the question of why this functionality to create
87 does not exist within 'T', the expression 'T::InnerType' will give a compiler error if we attempt
90 This is a problem if we want to be able to introspect for the existence of inner elements
91 to an enclosing type without producing compiler errors. Of course if we absolutely know what
92 types we have and that a nested type exists, and these declarations are within our scope, we can
98 which we know must exist, either because it is a top-level type we know about or
100 named 'InnerType' whose existence we would like ascertain, we can use a `BOOST_TTI_HAS_TYPE(InnerTy…
103 we can do compile-time selection to generate the correct template code.
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | functionsMissingReturnStatementsAndExpressions.types | 25 // Fine since we are typed void.
31 // Fine since we are typed void.
38 // Fine since we are typed void and return undefined
46 // Fine since we are typed void and return null
61 // Fine since we are typed any and return undefined
69 // Fine since we are typed any and return null
77 // Fine since we consist of a single throw statement.
85 // Fine since we consist of a single throw statement.
93 // Fine since we consist of a single throw statement.
101 // Not fine, since we can *only* consist of a single throw statement
[all …]
|
| D | functionsMissingReturnStatementsAndExpressions.errors.txt | 25 // Fine since we are typed void.
29 // Fine since we are typed void.
34 // Fine since we are typed void and return undefined
39 // Fine since we are typed void and return null
49 // Fine since we are typed any and return undefined
54 // Fine since we are typed any and return null
59 // Fine since we consist of a single throw statement.
64 // Fine since we consist of a single throw statement.
69 // Fine since we consist of a single throw statement.
74 // Not fine, since we can *only* consist of a single throw statement
[all …]
|
| D | functionsMissingReturnStatementsAndExpressions.symbols | 24 // Fine since we are typed void.
30 // Fine since we are typed void.
37 // Fine since we are typed void and return undefined
45 // Fine since we are typed void and return null
59 // Fine since we are typed any and return undefined
67 // Fine since we are typed any and return null
74 // Fine since we consist of a single throw statement.
82 // Fine since we consist of a single throw statement.
90 // Fine since we consist of a single throw statement.
98 // Not fine, since we can *only* consist of a single throw statement
[all …]
|
| /third_party/gstreamer/gstplugins_bad/gst/audiovisualizers/ |
| D | README | 14 * we have a couple of drawing helpers in gstdrawhelpers.h
15 (would be nice if we could use cairo)
18 * some more we could add:
24 - would be nice to use a generic 3x3 matrix operation, we don't run inplace
26 - this way we could also blur the background
27 - we need to handle visualizer that don't draw with alpha:
34 gst-plugins-good/gst/monoscope -> blend into what we have in wavescope
35 - it keeps an array of the values we just showed last[width]
49 - we could have a bouncing line as a base, like a quix:
53 - we would need to rotate, stretch and clip the waveform drawing to fit the
[all …]
|
| /third_party/skia/site/docs/user/ |
| D | color.md | 9 What we mean by color management
14 D50. And we can infer from that same description how to transform from that
33 in color management, and we need to divide it out if it's multiplied in
42 type called SkColorSpaceXformSteps. You'll see it as 5 steps there: we always
48 Whenever we're about to do some drawing we look at which of those steps we
49 really need to do. Any step that's a fundamental no-op we skip:
60 * if we've skipped 3 and 4 already, we can skip 2 and 5 any time the transfer
63 * if we've skipped all of 2-5, we can skip 1 and 6 if we were going to do
70 with that same color space, we'll notice we can skip all six steps. Sometimes
84 (Order matters there.) The gist is, we assume any untagged sources are sRGB.
[all …]
|
| /third_party/alsa-lib/src/ |
| D | userfile.c | 40 wordexp_t we; in snd_user_file() local
44 err = wordexp(file, &we, WRDE_NOCMD); in snd_user_file()
47 wordfree(&we); in snd_user_file()
50 if (we.we_wordc == 1) in snd_user_file()
52 wordfree(&we); in snd_user_file()
57 *result = strdup(we.we_wordv[0]); in snd_user_file()
58 wordfree(&we); in snd_user_file()
|
| /third_party/boost/libs/fiber/doc/ |
| D | when_any.qbk | 23 To that we would add: prefer to describe control flow using C++ native
95 For this we introduce a `Done` class to wrap a `bool` variable with a
100 The pattern we follow throughout this section is to pass a
135 first of the task functions to complete. Again, we assume that none will throw
139 first of the return values, rather than a simple `bool`. However, we choose
141 the first value, so we'll [member_link buffered_channel..close] it once we've
160 We may not be running in an environment in which we can guarantee no exception
168 either a return value or an exception. Therefore, we will change [link
172 Once we have a `future<>` in hand, all we need do is call [member_link
178 So far so good [mdash] but there's a timing issue. How should we obtain the
[all …]
|
| /third_party/boost/libs/icl/doc/ |
| D | projects.qbk | 41 form that exploits the fact, that we can switch on an off single
48 machine words. If we wanted to represent a set containing
49 two values {1, 1000000}, we would be much better off using
55 In project ['*Large Bitset*] we want to ['*combine the bit compression
60 As we will see, this can be achieved using only a small
61 amount of code because most of the properties we need
75 But we can also have individual ['nests] or ['clusters]
84 and we can span intervals of equal bit sequences that represent
110 we will use `nat`[^['k]] for unsigned integrals
119 . . . we are testing the limits. First we set all bits and
[all …]
|
| /third_party/mesa3d/src/intel/genxml/ |
| D | README | 11 other hand, most compiler recognize that the template struct we
17 2) For some types we need to have overlapping bit fields. For
27 flexibility in how we combine things. In the case of overlapping
28 fields (the u32 and float case), if we only set one of them in
38 Once we have the pack function it allows us to hook in various
39 transformations and validation as we go from template struct to dwords
43 overflowing values to the fields, but we've of course had lots of
44 cases where we make mistakes and write overflowing values. With
45 the pack function, we can actually assert on that and catch it at
49 float to a u32, but we also convert from bool to bits, from
[all …]
|
| /third_party/littlefs/ |
| D | DESIGN.md | 61 For ROM, this means we need to keep our design simple and reuse code paths
62 were possible. For RAM we have a stronger requirement, all RAM usage is
71 however they often share and borrow feature from each other. If we look at
72 power-loss resilience and wear leveling, we can narrow these down to a handful
75 1. First we have the non-resilient, block based filesystems, such as [FAT] and
109 2. In a completely different direction, we have logging filesystems, such as
126 Logging filesystem are beautifully elegant. With a checksum, we can easily
131 The main downside is performance. If we look at garbage collection, the
144 filesystem. [ext4] and [NTFS] are good examples. Here, we take a normal
145 block based filesystem and add a bounded log where we note every change
[all …]
|
| /third_party/boost/libs/spirit/doc/qi/ |
| D | mini_xml.qbk | 14 `struct employee`. If we changed the implementation to parse one or more
16 more hierarchy: teams, departments, corporations. Then we'll have an AST
19 In this example (actually two examples), we'll now explore how to create
23 Along the way, we'll see new features:
69 definition, we see some alternation going on here. An xml `node` is
86 But wait, to make sure that the `start_tag` does not parse `end_tag`s too, we
98 basically says: we should not have a `'/'` at this point.
106 Ohh! Now we see an inherited attribute there: `std::string`. The `end_tag` does
116 (we have only one, use `_r2`, `_r3`, etc. if you have more).
120 Check out how we used `lit` here, this time, not with a literal string, but with
[all …]
|
| /third_party/boost/libs/spirit/doc/x3/tutorial/ |
| D | minimal.qbk | 70 Here, we adapt the AST for Fusion, making it a first-class fusion citizen:
87 Here in the header file, instead of `BOOST_SPIRIT_DEFINE`, we use
89 happening is that we are declaring a `parse_rule` function in the client
100 BOOST_SPIRIT_DEFINE], you'll see why it is exactly what we need to use for
124 parser that we will use anywhere it is needed. X3 parser objects are very
126 of the rule (e.g. "employee"). Notice that we are passing this by value.
130 Here is where we place the actual rules that make up our grammar:
165 In the parser definition, we use [link __tutorial_spirit_define__
166 `BOOST_SPIRIT_DEFINE`] just like we did in the [tutorial_employee employee
171 below). We place this in an `.hpp` file for flexibility, so we have the
[all …]
|
| /third_party/flutter/flutter/dev/integration_tests/ios_add2app/ios_add2app/ |
| D | FullScreenViewController.m | 25 // Note that if we were doing things that might cause the VC
27 // we shouldn't do this. But in this case we know we're
29 // If we needed Flutter to tell us when we could actually go away,
30 // we'd need to communicate over a method channel with it.
|