| /third_party/cJSON/tests/unity/docs/ |
| D | ThrowTheSwitchCodingStandard.md | 4 we try to follow these standards to unify our contributors' code into a cohesive
6 followed. We're not perfect. Please be polite where you notice these discrepancies
7 and we'll try to be polite when we notice yours.
14 Being consistent makes code easier to understand. We've made an attempt to keep
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
22 vision for these tools. We're C developers and embedded software developers.
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
[all …]
|
| /third_party/unity/docs/ |
| D | ThrowTheSwitchCodingStandard.md | 5 For the most part, we try to follow these standards to unify our contributors' code into a cohesive…
7 We're not perfect. Please be polite where you notice these discrepancies and we'll try to be polite…
14 We've tried to keep our standard simple because we also believe that we can only expect someone to …
19 Before we get into details on syntax, let's take a moment to talk about our vision for these tools.
20 We're C developers and embedded software developers.
25 Our philosophy is "support every compiler we can".
26 Most often, this means that we aim for writing C code that is standards compliant (often C89... tha…
31 A lot of Unity is configurable and we have worked hard to make it not TOO ugly in the process.
35 It's just what we do, because we like everything to Just Work™.
38 By that, we mean that we do our best to have EVERY configuration option have a logical default.
[all …]
|
| /third_party/ltp/testcases/kernel/controllers/freezer/ |
| D | 00_description.txt | 3 We initially try to freeze the cgroup but then try to cancel that.
4 After we cancel the sleep process should eventually reach the thawed
5 state. We expect the process to still be alive as we cleanup the test.
9 The sleep process is frozen. We then kill the sleep process.
10 Then we unfreeze the sleep process and see what happens. We expect the
16 The sleep process is frozen. We then move the sleep process to a THAWED
17 cgroup. We expect moving the sleep process to fail.
22 part of. We then thaw the subshell process. We expect the unthawed
28 The sleep process is frozen. We then wait until the sleep process should
29 have exited. Then we unfreeze the sleep process. We expect the
[all …]
|
| /third_party/node/deps/npm/node_modules/npm-packlist/lib/ |
| D | index.js | 56 // we ignore ENOENT errors completely because we don't care if the file doesn't exist
57 // but we throw everything else because failing to read a file that does exist is
59 // istanbul ignore next -- we do not need to test a thrown error
83 // we path.resolve() here because ignore-walk doesn't do it and we want full paths
106 // istanbul ignore else - this does nothing unless we need it to
109 // then we know path is a workspace directory. in order to not drop ignore rules
111 // (path) we need to find and read those now
115 // on the other hand, if the path and prefix are the same, then we ignore workspaces
116 // so that we don't pack a workspace as part of the root project. append them as
135 // overridden method: we intercept the reading of the package.json file here so that we can
[all …]
|
| /third_party/python/Objects/stringlib/ |
| D | stringlib_find_two_way_notes.txt | 39 We first scan the right part of the needle to check if it matches the
40 the aligned characters in the haystack. We scan left-to-right,
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
[all …]
|
| /third_party/node/deps/v8/tools/mb/docs/ |
| D | design_spec.md | 10 1. "bot toggling" - make it so that we can easily flip a given bot
18 we need to wrap both the `gyp_chromium` invocation to generate the
81 We start with the following requirements and observations:
83 * In an ideal (un-resource-constrained) world, we would build and test
85 necessarily mean that we would build 'all' on every patch (see below).
87 * In the real world, however, we do not have an infinite number of machines,
88 and try jobs are not infinitely fast, so we need to balance the desire
90 times, given the number of machines we have.
92 * Also, since we run most try jobs against tip-of-tree Chromium, by
98 affected for unrelated reasons. We want to rebuild and test only the
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyExceptionInfo.cpp | 54 auto *WE = new WebAssemblyException(EHPad); in recalculate() local
55 discoverAndMapException(WE, MDT, MDF); in recalculate()
56 Exceptions.push_back(WE); in recalculate()
62 WebAssemblyException *WE = getExceptionFor(MBB); in recalculate() local
63 for (; WE; WE = WE->getParentException()) in recalculate()
64 WE->addBlock(MBB); in recalculate()
68 for (auto *WE : Exceptions) { in recalculate() local
69 if (WE->getParentException()) in recalculate()
70 WE->getParentException()->getSubExceptions().push_back(WE); in recalculate()
72 addTopLevelException(WE); in recalculate()
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | functionsMissingReturnStatementsAndExpressions.js | 16 // Fine since we are typed void.
20 // Fine since we are typed void.
25 // Fine since we are typed void and return undefined
30 // Fine since we are typed void and return null
40 // Fine since we are typed any and return undefined
45 // Fine since we are typed any and return null
50 // Fine since we consist of a single throw statement.
55 // Fine since we consist of a single throw statement.
60 // Fine since we consist of a single throw statement.
65 // Not fine, since we can *only* consist of a single throw statement
[all …]
|
| /third_party/nghttp2/doc/sources/ |
| D | tutorial-server.rst | 4 In this tutorial, we are going to write a single-threaded, event-based
19 We use libevent in this tutorial to handle networking I/O. Please
27 example program, when creating the ``SSL_CTX`` object, we store the
29 allocated buffer. This is safe because we only create one ``SSL_CTX``
37 that OpenSSL >= 1.0.2 is required. We use macro to enable/disable
40 them. We provide the callback for it::
92 identifier. In this tutorial, we advertise the specific HTTP/2
96 OpenSSL implementation, we just assign the pointer to the NPN buffers
97 we filled in earlier. The NPN callback function is set to the
100 In ``alpn_select_proto_cb()``, we use `nghttp2_select_next_protocol()`
[all …]
|
| D | tutorial-client.rst | 4 In this tutorial, we are going to write a very primitive HTTP/2
16 We use libevent in this tutorial to handle networking I/O. Please
23 application protocol over TLS. In this tutorial, we use the
41 that OpenSSL >= 1.0.2 is required. We use macro to enable/disable
44 we have to instruct OpenSSL SSL_CTX to use ALPN, which we'll talk
70 Here we see ``SSL_CTX_get_alpn_protos()`` function call. We instructs
71 OpenSSL to notify the server that we support h2, ALPN identifier for
76 We define and use a ``http2_session_data`` structure to store data
86 Since this program only handles one URI, it uses only one stream. We
109 We create and initialize these structures in
[all …]
|
| /third_party/skia/third_party/externals/angle2/doc/ |
| D | Update20120704.md | 3 We haven't posted an update on the development status of ANGLE in quite some
4 time and we'd like to provide an update on some of the new features and
5 improvements that we've been working on.
17 We have recently completed the implementation of depth texture support
20 and earlier in the year we added support for instancing via attribute array
28 We have also made a number of improvements in the shader compiler.
30 * We addressed a number of defects related to scoping differences between HLSL and
31 GLSL and improved the scoping support in ANGLE's compiler front-end. We also
34 * We addressed a number of correctness issues in the GLSL to HLSL
35 translation process. We fixed some bugs related to constant propagation and
[all …]
|
| /third_party/mesa3d/src/intel/compiler/ |
| D | gfx6_gs_visitor.cpp | 51 * To achieve this we buffer the geometry shader outputs for each emitted in emit_prolog()
52 * vertex in vertex_output during operation. Then, when we have processed in emit_prolog()
53 * the last vertex (that is, at thread end time), we send the FF_SYNC in emit_prolog()
85 /* This will be used to know when we are processing the first vertex of in emit_prolog()
86 * a primitive. We will set this to URB_WRITE_PRIM_START only when we know in emit_prolog()
87 * that we are processing the first vertex in the primitive and to zero in emit_prolog()
88 * otherwise. This way we can use its value directly in the URB write in emit_prolog()
114 * needs it we have to move it to a separate register where we can map in emit_prolog()
117 * Notice that we cannot use a virtual register for this, because we need to in emit_prolog()
120 * We could work around that issue if we were able to compute the first in emit_prolog()
[all …]
|
| /third_party/musl/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/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/mesa3d/src/compiler/nir/ |
| D | nir_lower_shader_calls.c | 41 * preserved when moving to the continuation shader. We have to move in move_system_values_to_top()
105 /* Any SSA values which were added after we generated liveness information in src_is_in_bitset()
107 * which we could re-materialize, we don't need to because it's only used in src_is_in_bitset()
128 /* Set of all values which are trivially re-materializable and we shouldn't in can_remat_instr()
138 * into register writes, We can use "is it SSA?" to answer the question in can_remat_instr()
187 * TODO: There may be some system values we want to avoid in can_remat_instr()
188 * re-materializing as well but we have to be very careful in can_remat_instr()
301 /* TODO: If a SSA def is filled more than once, we probably want to just in spill_ssa_defs_and_lower_shader_calls()
302 * spill it at the LCM of the fill sites so we avoid unnecessary in spill_ssa_defs_and_lower_shader_calls()
306 * inside the loop, we probably want to spill outside the loop. We in spill_ssa_defs_and_lower_shader_calls()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/X86/ |
| D | X86SpeculativeLoadHardening.cpp | 142 // We mostly have one conditional branch, and in extremely rare cases have
233 // We have to insert the new block immediately after the current one as we in splitEdge()
234 // don't know what layout-successor relationships the successor has and we in splitEdge()
245 // we might have *broken* fallthrough and so need to inject a new in splitEdge()
255 // Update the unconditional branch now that we've added one. in splitEdge()
273 // If this is the only edge to the successor, we can just replace it in the in splitEdge()
274 // CFG. Otherwise we need to add a new entry in the CFG for the new in splitEdge()
322 /// FIXME: It's really frustrating that we have to do this, but SSA-form in MIR
323 /// isn't what you might expect. We may have multiple entries in PHI nodes for
324 /// a single predecessor. This makes CFG-updating extremely complex, so here we
[all …]
|
| /third_party/mbedtls/docs/architecture/testing/ |
| D | invasive-testing.md | 5 In Mbed TLS, we use black-box testing as much as possible: test the documented behavior of the prod…
16 * [“Solutions”](#solutions) explains how we currently solve, or intend to solve, specific problems.
67 … to be a system function (like `mbedtls_calloc` or `mbedtls_fopen`), which we replace to mock or w…
83 We need to balance the following goals, which are sometimes contradictory.
85 * Coverage: we need to test behaviors which are not easy to trigger by using the API or which canno…
86 * Correctness: we want to test the actual product, not a modified version, since conclusions drawn …
89 …k when the product's internal or implementation-specific behavior changes. We should also not give…
91 Where those goals conflict, we should at least mitigate the goals that cannot be fulfilled, and doc…
111 We also need to test resilience: if the system is reset during an operation, does it restart in a c…
115 When code should clean up resources, how do we know that they have truly been cleaned up?
[all …]
|
| /third_party/rust/crates/nom/examples/ |
| D | s_expression.rs | 1 //! In this example we build an [S-expression](https://en.wikipedia.org/wiki/S-expression)
18 /// We start by defining the types that define the shape of data that we want.
19 /// In this case, we want something tree-like
21 /// Starting from the most basic, we define some built-in functions that our lisp has
32 /// We now wrap this type and a few other primitives into our Atom type.
43 /// The remaining half is Lists. We implement these as recursive Expressions.
44 /// For a list of numbers, we have `'(1 2 3)`, which we'll parse to:
50 /// structure that we can deal with programmatically. Thus any valid expression
67 /// we start by creating a parser for the built-in operator functions.
69 // one_of matches one of the characters we give it in parse_builtin_op()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/GlobalISel/ |
| D | RegBankSelect.cpp | 101 // We could preserve the information from these two analysis but in getAnalysisUsage()
114 // By default we assume we will have to repair something. in assignmentMatch()
143 assert(!NewVRegs.empty() && "We should not have to repair"); in repairReg()
147 // Assume we are repairing a use and thus, the original reg will be in repairReg()
152 // If we repair a definition, swap the source and destination for in repairReg()
159 "We are about to create several defs for Dst"); in repairReg()
216 // Check if MI is legal. if not, we need to legalize all the in repairReg()
217 // instructions we are going to insert. in repairReg()
240 assert(MO.isReg() && "We should only repair register operand"); in getRepairCost()
245 // If MO does not have a register bank, we should have just been in getRepairCost()
[all …]
|
| /third_party/icu/docs/userguide/transforms/general/ |
| D | rules.md | 52 In this example, we start with a set of rules for Greek since they provide a
53 real example based on mathematics. We will use the rules that do not involve the
54 pronunciation of Modern Greek; instead, we will use rules that correspond to the
56 we will transliterate "Βιολογία-Φυσιολογία" as "Biología-Physiología", not as
57 "Violohía-Fisiolohía". To illustrate some of the trickier cases, we will also
67 We will also verify that every Latin letter maps to a Greek letter. This insures
68 that when we reverse the transliteration that the process can handle all the
81 In non-complex cases, we have a one-to-one relationship between letters in both
96 We will start by adding a whole batch of simple mappings. These mappings will
97 not work yet, but we will start with them. For now, we will not use the
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | SimpleLoopUnswitch.cpp | 129 // If not an instruction with the same opcode, nothing we can do. in collectHomogenousInstGraphLoopInvariants()
145 assert(!isa<Constant>(Invariant) && "Why are we unswitching on a constant?"); in replaceLoopInvariantUses()
149 // Grab the use and walk past it so we can clobber it in the use list. in replaceLoopInvariantUses()
203 // When the loop exit is directly unswitched we just need to update the in rewritePHINodesForUnswitchedExitBlock()
204 // incoming basic block. We loop to handle weird cases with repeated in rewritePHINodesForUnswitchedExitBlock()
234 // removing each one. We have to do this weird loop manually so that we in rewritePHINodesForExitAndUnswitchedBlocks()
235 // create the same number of new incoming edges in the new PHI as we expect in rewritePHINodesForExitAndUnswitchedBlocks()
263 /// Because we've removed an exit from the loop, we may have changed the set of
269 // If the loop is already at the top level, we can't hoist it anywhere. in hoistLoopToNewParent()
291 // because it isn't in this loop we also need to update the primary loop map. in hoistLoopToNewParent()
[all …]
|
| /third_party/openssl/util/ |
| D | add-depends.pl | 19 # When using stat() on Windows, we can get it to perform better by avoid some
20 # data. This doesn't affect the mtime field, so we're not losing anything...
59 # Convenient cache of absolute to relative map. We start with filling it
63 # generate entries in this map. We could of course deal with C header files
64 # only, but in case we decide to handle more than just C files in the future,
65 # we already have the mechanism in place here.
66 # NOTE2: we lower case the index to make it searchable without regard for
67 # character case. That could seem dangerous, but as long as we don't have
68 # files we depend on in the same directory that only differ by character case,
69 # we're fine.
[all …]
|
| /third_party/node/deps/openssl/openssl/util/ |
| D | add-depends.pl | 19 # When using stat() on Windows, we can get it to perform better by avoid some
20 # data. This doesn't affect the mtime field, so we're not losing anything...
59 # Convenient cache of absolute to relative map. We start with filling it
63 # generate entries in this map. We could of course deal with C header files
64 # only, but in case we decide to handle more than just C files in the future,
65 # we already have the mechanism in place here.
66 # NOTE2: we lower case the index to make it searchable without regard for
67 # character case. That could seem dangerous, but as long as we don't have
68 # files we depend on in the same directory that only differ by character case,
69 # we're fine.
[all …]
|
| /third_party/lwip/src/netif/ppp/ |
| D | PPPD_FOLLOWUP | 5 is getting low on their Git repository, meaning that we can follow what
8 So, here is the pppd follow up, so that we don't get away too far from pppd.
13 This has nothing to do with pppd, but we merged some good patch from
16 - LCP adaptive echo, so that we don't send LCP echo request if we
64 We can't fork processes in embedded, therefore all the pppd process run
65 feature is disabled in the port, so we don't care about the new
73 Again, we are not running as a heavy process, so all exit() or _exit() calls
81 We are not parsing config file, all the filesystem I/O stuff were disabled
88 Only concern changes on RP-PPPoE plugin, which we don't use.
106 Patch for sys-linux.c, which we don't use.
[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:
58 We can reason from those basic skips into some more advanced optimizations:
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
[all …]
|