| /external/libxml2/result/ |
| D | ent9 | 7 <p> WE need lot of garbage now to trigger the problem</p>
8 <p> WE need lot of garbage now to trigger the problem</p>
9 <p> WE need lot of garbage now to trigger the problem</p>
10 <p> WE need lot of garbage now to trigger the problem</p>
11 <p> WE need lot of garbage now to trigger the problem</p>
12 <p> WE need lot of garbage now to trigger the problem</p>
13 <p> WE need lot of garbage now to trigger the problem</p>
14 <p> WE need lot of garbage now to trigger the problem</p>
15 <p> WE need lot of garbage now to trigger the problem</p>
16 <p> WE need lot of garbage now to trigger the problem</p>
[all …]
|
| D | ent9.rdr | 11 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
16 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
21 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
26 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
31 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
36 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
41 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
46 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
51 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
56 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
[all …]
|
| D | ent9.rde | 21 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
26 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
31 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
36 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
41 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
46 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
51 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
56 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
61 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
66 2 3 #text 0 1 WE need lot of garbage now to trigger the problem
[all …]
|
| D | ent9.sax | 28 SAX.characters( WE need lot of garbage now to, 50)
33 SAX.characters( WE need lot of garbage now to, 50)
38 SAX.characters( WE need lot of garbage now to, 50)
43 SAX.characters( WE need lot of garbage now to, 50)
48 SAX.characters( WE need lot of garbage now to, 50)
53 SAX.characters( WE need lot of garbage now to, 50)
58 SAX.characters( WE need lot of garbage now to, 50)
63 SAX.characters( WE need lot of garbage now to, 50)
68 SAX.characters( WE need lot of garbage now to, 50)
73 SAX.characters( WE need lot of garbage now to, 50)
[all …]
|
| D | ent9.sax2 | 28 SAX.characters( WE need lot of garbage now to, 50)
33 SAX.characters( WE need lot of garbage now to, 50)
38 SAX.characters( WE need lot of garbage now to, 50)
43 SAX.characters( WE need lot of garbage now to, 50)
48 SAX.characters( WE need lot of garbage now to, 50)
53 SAX.characters( WE need lot of garbage now to, 50)
58 SAX.characters( WE need lot of garbage now to, 50)
63 SAX.characters( WE need lot of garbage now to, 50)
68 SAX.characters( WE need lot of garbage now to, 50)
73 SAX.characters( WE need lot of garbage now to, 50)
[all …]
|
| /external/libxml2/test/ |
| D | ent9 | 6 <p> WE need lot of garbage now to trigger the problem</p>
7 <p> WE need lot of garbage now to trigger the problem</p>
8 <p> WE need lot of garbage now to trigger the problem</p>
9 <p> WE need lot of garbage now to trigger the problem</p>
10 <p> WE need lot of garbage now to trigger the problem</p>
11 <p> WE need lot of garbage now to trigger the problem</p>
12 <p> WE need lot of garbage now to trigger the problem</p>
13 <p> WE need lot of garbage now to trigger the problem</p>
14 <p> WE need lot of garbage now to trigger the problem</p>
15 <p> WE need lot of garbage now to trigger the problem</p>
[all …]
|
| /external/libxml2/result/noent/ |
| D | ent9 | 7 <p> WE need lot of garbage now to trigger the problem</p>
8 <p> WE need lot of garbage now to trigger the problem</p>
9 <p> WE need lot of garbage now to trigger the problem</p>
10 <p> WE need lot of garbage now to trigger the problem</p>
11 <p> WE need lot of garbage now to trigger the problem</p>
12 <p> WE need lot of garbage now to trigger the problem</p>
13 <p> WE need lot of garbage now to trigger the problem</p>
14 <p> WE need lot of garbage now to trigger the problem</p>
15 <p> WE need lot of garbage now to trigger the problem</p>
16 <p> WE need lot of garbage now to trigger the problem</p>
[all …]
|
| D | ent9.sax2 | 27 SAX.characters( WE need lot of garbage now to, 50)
32 SAX.characters( WE need lot of garbage now to, 50)
37 SAX.characters( WE need lot of garbage now to, 50)
42 SAX.characters( WE need lot of garbage now to, 50)
47 SAX.characters( WE need lot of garbage now to, 50)
52 SAX.characters( WE need lot of garbage now to, 50)
57 SAX.characters( WE need lot of garbage now to, 50)
62 SAX.characters( WE need lot of garbage now to, 50)
67 SAX.characters( WE need lot of garbage now to, 50)
72 SAX.characters( WE need lot of garbage now to, 50)
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 6 We use opt to do Bytecode-to-bytecode instrumentation. Look at
14 exceeds a threshold, we identify a hot loop and perform second-level
16 target of the back-edge and the branch that causes the back-edge). We
23 We remove the first-level instrumentation by overwriting the CALL to
27 LLVM BasicBlock*s. We only keep track of paths that start at the
30 How do we keep track of which edges to instrument, and which edges are
41 3) Mark BBs which end in edges that exit the hot region; we need to
44 Assume that there is 1 free register. On SPARC we use %g1, which LLC
46 edge which corresponds to a conditional branch, we shift 0 for not
48 through the hot region. Silently fail if we need more than 64 bits.
[all …]
|
| /external/llvm/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 6 We use opt to do Bytecode-to-bytecode instrumentation. Look at
14 exceeds a threshold, we identify a hot loop and perform second-level
16 target of the back-edge and the branch that causes the back-edge). We
23 We remove the first-level instrumentation by overwriting the CALL to
27 LLVM BasicBlock*s. We only keep track of paths that start at the
30 How do we keep track of which edges to instrument, and which edges are
41 3) Mark BBs which end in edges that exit the hot region; we need to
44 Assume that there is 1 free register. On SPARC we use %g1, which LLC
46 edge which corresponds to a conditional branch, we shift 0 for not
48 through the hot region. Silently fail if we need more than 64 bits.
[all …]
|
| /external/swiftshader/third_party/LLVM/docs/HistoricalNotes/ |
| D | 2003-06-25-Reoptimizer1.txt | 6 We use opt to do Bytecode-to-bytecode instrumentation. Look at
14 exceeds a threshold, we identify a hot loop and perform second-level
16 target of the back-edge and the branch that causes the back-edge). We
23 We remove the first-level instrumentation by overwriting the CALL to
27 LLVM BasicBlock*s. We only keep track of paths that start at the
30 How do we keep track of which edges to instrument, and which edges are
41 3) Mark BBs which end in edges that exit the hot region; we need to
44 Assume that there is 1 free register. On SPARC we use %g1, which LLC
46 edge which corresponds to a conditional branch, we shift 0 for not
48 through the hot region. Silently fail if we need more than 64 bits.
[all …]
|
| /external/llvm/docs/tutorial/ |
| D | LangImpl09.rst | 12 LLVM <index.html>`_" tutorial. In chapters 1 through 8, we've built a
19 source that the programmer wrote. In LLVM we generally use a format
23 The short summary of this chapter is that we'll go through the
27 Caveat: For now we can't debug via the JIT, so we'll need to compile
29 we'll make a few modifications to the running of the language and
30 how programs are compiled. This means that we'll have a source file
32 interactive JIT. It does involve a limitation that we can only
36 Here's the sample program we'll be compiling:
54 locations more difficult. In LLVM IR we keep the original source location
61 tutorial we're going to avoid optimization (as you'll see with one of the
[all …]
|
| D | LangImpl04.rst | 60 Well, that was easy :). In practice, we recommend always using
84 We'd really like to see this generate "``tmp = x+3; result = tmp*tmp;``"
113 For Kaleidoscope, we are currently generating functions on the fly, one
114 at a time, as the user types them in. We aren't shooting for the
115 ultimate optimization experience in this setting, but we also want to
116 catch the easy and quick stuff where possible. As such, we will choose
118 in. If we wanted to make a "static Kaleidoscope compiler", we would use
119 exactly the code we have now, except that we would defer running the
122 In order to get per-function optimizations going, we need to set up a
124 and organize the LLVM optimizations that we want to run. Once we have
[all …]
|
| /external/antlr/runtime/Cpp/include/ |
| D | antlr3collections.inl | 138 /* Now we need to allocate the root node. This makes it easier
139 * to use the tree as we don't have to do anything special
144 /* Now we seed the root node with the index being the
145 * highest left most bit we want to test, which limits the
151 /* And as we have nothing in here yet, we set both child pointers
159 * we use calloc() to initialise it.
172 /* the nodes are all gone now, so we need only free the memory
189 * then by definition (as the bit index decreases as we descent the trie)
190 * we have reached a 'backward' pointer. A backward pointer means we
192 * and it must either be the key we are looking for, or if not then it
[all …]
|
| /external/antlr/runtime/C/src/ |
| D | antlr3collections.c | 128 // All we have to do is create the hashtable tracking structure in antlr3HashTableNew()
212 /* Allow sparse tables, though we don't create them as such at present in antlr3HashFree()
222 /* Save next entry - we do not want to access memory in entry after we in antlr3HashFree()
236 /* Free the key memory - we know that we allocated this in antlr3HashFree()
246 entry = nextEntry; /* Load next pointer to see if we shoud free it */ in antlr3HashFree()
254 /* Now we can free the bucket memory in antlr3HashFree()
259 /* Now we free teh memory for the table itself in antlr3HashFree()
281 /* First we need to know the hash of the provided key in antlr3HashRemoveI()
285 /* Knowing the hash, we can find the bucket in antlr3HashRemoveI()
289 /* Now, we traverse the entries in the bucket until in antlr3HashRemoveI()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/tutorial/ |
| D | LangImpl09.rst | 12 LLVM <index.html>`_" tutorial. In chapters 1 through 8, we've built a
19 source that the programmer wrote. In LLVM we generally use a format
23 The short summary of this chapter is that we'll go through the
27 Caveat: For now we can't debug via the JIT, so we'll need to compile
29 we'll make a few modifications to the running of the language and
30 how programs are compiled. This means that we'll have a source file
32 interactive JIT. It does involve a limitation that we can only
36 Here's the sample program we'll be compiling:
54 locations more difficult. In LLVM IR we keep the original source location
61 tutorial we're going to avoid optimization (as you'll see with one of the
[all …]
|
| /external/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 …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyExceptionInfo.cpp | 51 // We group catch & catch-all terminate pads together, so skip the second in recalculate()
55 auto *WE = new WebAssemblyException(EHPad); in recalculate() local
56 discoverAndMapException(WE, MDT, MDF); in recalculate()
57 Exceptions.push_back(WE); in recalculate()
63 WebAssemblyException *WE = getExceptionFor(MBB); in recalculate() local
64 for (; WE; WE = WE->getParentException()) in recalculate()
65 WE->addBlock(MBB); in recalculate()
69 for (auto *WE : Exceptions) { in recalculate() local
70 if (WE->getParentException()) in recalculate()
71 WE->getParentException()->getSubExceptions().push_back(WE); in recalculate()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/docs/ |
| D | MergeFunctions.rst | 22 explains how we could combine equal functions correctly, keeping module valid.
31 cover only common cases, and thus avoid cases when after minor code changes we
39 code fundamentals. In this article we suppose reader is familiar with
45 We will use such terms as
77 again and again, and yet you don't understand why we implemented it that way.
79 We hope that after this article reader could easily debug and improve
98 Do we need to merge functions? Obvious thing is: yes that's a quite possible
99 case, since usually we *do* have duplicates. And it would be good to get rid of
100 them. But how to detect such a duplicates? The idea is next: we split functions
101 onto small bricks (parts), then we compare "bricks" amount, and if it equal,
[all …]
|
| /external/llvm/docs/ |
| D | MergeFunctions.rst | 22 explains how we could combine equal functions correctly, keeping module valid.
31 cover only common cases, and thus avoid cases when after minor code changes we
39 code fundamentals. In this article we suppose reader is familiar with
45 We will use such terms as
77 again and again, and yet you don't understand why we implemented it that way.
79 We hope that after this article reader could easily debug and improve
98 Do we need to merge functions? Obvious thing is: yes that's a quite possible
99 case, since usually we *do* have duplicates. And it would be good to get rid of
100 them. But how to detect such a duplicates? The idea is next: we split functions
101 onto small bricks (parts), then we compare "bricks" amount, and if it equal,
[all …]
|
| /external/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 …]
|
| /external/libchrome/base/message_loop/ |
| D | message_pump_glib.cc | 28 // Be careful here. TimeDelta has a precision of microseconds, but we want a in GetTimeIntervalMilliseconds()
34 // If this value is negative, then we need to run delayed work soon. in GetTimeIntervalMilliseconds()
50 // making Check a second chance to tell GLib we are ready for Dispatch.
74 // Thus it is important to only return true from prepare or check if we
75 // actually have events or work to do. We also need to make sure we keep
80 // For the GLib pump we try to follow the Windows UI pump model:
81 // - Whenever we receive a wakeup event or the timer for delayed work expires,
82 // we run DoWork and/or DoDelayedWork. That part will also run in the other
84 // - We also run DoWork, DoDelayedWork, and possibly DoIdleWork in the main
94 // We always return FALSE, so that our timeout is honored. If we were in WorkSourcePrepare()
[all …]
|
| /external/libxkbcommon/xkbcommon/doc/ |
| D | quick-guide.md | 6 the library. We will employ a few use-cases to lead the examples:
30 Before we can do anything interesting, we need a library context. So
45 Next we need to create a keymap, xkb_keymap. This is an immutable object
49 If we are an evdev client, we have nothing to go by, so we need to ask
53 by the X server. With it, we can fill a struct called xkb_rule_names;
72 If we are a Wayland client, the compositor gives us a string complete
73 with a keymap. In this case, we can create the keymap object like this:
85 If we are an X11 client, we are better off getting the keymap from the
86 X server directly. For this we need to choose the XInput device; here
87 we will use the core keyboard device:
[all …]
|
| /external/libjpeg-turbo/ |
| D | example.txt | 11 * We present these routines in the same coding style used in the JPEG code
54 * We present a minimal version that does not worry about refinements such
69 * For this example, we'll assume that this data structure matches the way
70 * our application has stored the image in memory, so we can just pass a
81 * Sample routine for JPEG compression. We assume that the target file name
91 * compression/decompression processes, in existence at once. We refer
97 * (see the second half of this file for an example). But here we just
111 /* We have to set up the error handler first, in case the initialization
114 * address which we place into the link field in cinfo.
117 /* Now we can initialize the JPEG compression object. */
[all …]
|
| /external/llvm/lib/CodeGen/GlobalISel/ |
| D | RegBankSelect.cpp | 75 // We could preserve the information from these two analysis but in getAnalysisUsage()
86 // By default we assume we will have to repair something. in assignmentMatch()
112 assert(NewVRegs.begin() != NewVRegs.end() && "We should not have to repair"); in repairReg()
114 // Assume we are repairing a use and thus, the original reg will be in repairReg()
119 // If we repair a definition, swap the source and destination for in repairReg()
126 "We are about to create several defs for Dst"); in repairReg()
134 // Check if MI is legal. if not, we need to legalize all the in repairReg()
135 // instructions we are going to insert. in repairReg()
157 assert(MO.isReg() && "We should only repair register operand"); in getRepairCost()
162 // If MO does not have a register bank, we should have just been in getRepairCost()
[all …]
|