| /external/blktrace/doc/ |
| blktrace.tex | 7 % it under the terms of the GNU General Public License as published by
39 you don't need to patch blktrace support as it is already included.
52 as part of the following git repository:
65 As noted above, the kernel patch along with the blktrace and blkparse utilities are stored in a git repository. One simple way to get going would be:
78 scope of this document, but the following may be used as a sample template.
81 As an example, bt/kernel contains blk-trace-2.6.14-rc1-git-G2, download
129 To build and install the tools, execute the following sequence (as root):
195 get that dumped as well.
200 can also show SCSI commands going in and out of the queue as submitted
355 \item As noted above, the events are passed up via a series of buffer
[all...] |
| /external/v8/include/ |
| v8.h | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
166 * behind the scenes and the same rules apply to these values as to
183 * constructor allows you to pass handles as arguments by value and
188 * Handle<String> to a variable declared as Handle<Value>, is legal
248 template <class S> inline Handle<S> As() {
286 template <class S> inline Local<S> As() {
300 * a Local handle only lives as long as the HandleScope in which it was
311 * persistent handle as an argument to a function you will not get two
324 * Creates a persistent handle for the same storage cell as th
[all...] |
| /external/webkit/Source/WebCore/bindings/v8/ |
| V8DOMWindowShell.cpp | 19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
84 // such as out-of-memory by crashing the renderer.
245 // use a shadow object as the global object and use the JS DOMWindow
246 // instance as the prototype for that shadow object. The JS DOMWindow
250 // The shadow object and the DOMWindow instance are seen as one object
404 // Create a new JS window object and use it as the prototype for the shadow global object.
418 // Insert the window instance as the prototype of the shadow object.
514 // case, we use the global object as the security token to avoid
523 // as the security token.
563 return prototype.As<v8::Object>()->Get(property)
[all...] |
| /ndk/build/core/ |
| build-binary.mk | 10 # distributed under the License is distributed on an "AS IS" BASIS,
147 # As a special case, the original Android build system
154 # to build source file $(LOCAL_PATH)/foo.c as ARM
159 # As a special extension, the NDK also supports the .neon extension suffix
|
| /external/libvorbis/doc/ |
| 05-comment.tex | 43 in the comment header is octet-aligned, they can simply be read as
46 The comment header is decoded as follows:
50 2) [vendor_string] = read a UTF-8 vector as [vendor_length] octets
54 6) this iteration's user comment = read a UTF-8 vector as [length] octets
56 7) [framing_bit] = read a single bit as boolean
117 The artist(s) who performed the work. In classical music this would be the conductor, orchestra, soloists. In an audio book it would be the actor who did the reading. In popular music this is typically the same as the ARTIST and is omitted.
124 Use Permitted', a URL to a license such as a Creative Commons license
180 comment header. As an example, assume a track was recorded by three
207 The comment header is encoded as follows (as per Ogg's standar
[all...] |
| 01-introduction.tex | 20 it is in the same league as MPEG-2 and MPC. Similarly, the 1.0
42 working memory as Vorbis has no static probability model; the vector
66 in accordance with these design assumptions, such as Ogg (for file
79 Vorbis' heritage is as a research CODEC and its current design
90 as it would be with MPEG audio layers, to embed a simple frame type
97 bitstream so long as the codec has been initialized/setup with the
102 relatively large as bitstream headers go. The header size is
108 causes some amount of complaint among engineers as this runs against
110 existing software/interface designs, such as Windows' ACM codec
137 internal component configuration, as well as arrangement of specifi
[all...] |
| 03-codebook.tex | 13 Huffman-equivalent representation for decoding compressed codewords as
14 well as an optional lookup table of output vector values to which a
15 decoded Huffman value is applied as an offset, generating the final
21 from a packet as a series of arbitrary-width values read from the
101 6) this entry is unused. mark it as such.
123 3) [number] = read \link{vorbis:spec:ilog}{ilog}([codebook_entries] - [current_entry]) bits as an unsigned integer
149 The lookup table type is read as a four bit unsigned integer:
151 1) [codebook_lookup_type] = read four bits as an unsigned integer
166 possible scalar values. Lookup decode proceeds as follows:
169 1) [codebook_minimum_value] = \link{vorbis:spec:float32:unpack}{float32_unpack}( read 32 bits as an unsigned integer
[all...] |
| 04-codec.tex | 9 This document serves as the top-level reference document for the
33 2) 0x76, 0x6f, 0x72, 0x62, 0x69, 0x73: the characters 'v','o','r','b','i','s' as six octets
38 (these types are all odd as a packet with a leading single bit of '0'
47 to declare the stream definitively as Vorbis, and provide a few externally
49 identification header is coded as follows:
52 1) [vorbis_version] = read 32 bits as unsigned integer
53 2) [audio_channels] = read 8 bit integer as unsigned
54 3) [audio_sample_rate] = read 32 bits as unsigned integer
55 4) [bitrate_maximum] = read 32 bits as signed integer
56 5) [bitrate_nominal] = read 32 bits as signed intege
[all...] |
| /external/skia/legacy/ |
| Android.mk | 7 # playback of webpages saved as SkPictures in older versions of the Android
8 # Browser. As such, all symbols are hidden with the exception of a few
|
| /external/v8/test/cctest/ |
| test-profile-generator.cc | 725 v8::CpuProfiler::StartProfiling(args[0].As<v8::String>());
735 v8::CpuProfiler::StopProfiling(args[0].As<v8::String>());
|
| /external/blktrace/btt/doc/ |
| btt.tex | 8 % it under the terms of the GNU General Public License as published by
33 tool called blktrace. As noted in its Users Guide, blktrace
55 section~\ref{sec:cmd-line}), as we felt that discussing some of the
116 This is denoted as \emph{Q2I} time.
121 will see these listed as \texttt{S2G} times.}:
139 Referred to as \emph{I2D} time\footnote{The \emph{issue} trace
148 This is referred to as the \emph{D2C} time\
155 in the system. This provides some idea as to how quickly IOs are
170 (which are all presented in seconds), and overall count. As an
171 example\footnote{As with this display, the author has taken some libert
[all...] |
| /external/dropbear/libtomcrypt/ |
| crypt.tex | 130 The library serves as a toolkit for developers who have to solve cryptographic problems. Out of the box LibTomCrypt
149 know how to use Safer+, RC6, or Serpent as well. With all of the core functions there are central descriptor tables
161 with \textit{cycles per byte} timings that are comparable (and often favourable) to other libraries such as OpenSSL and
181 you have to update the associated support code as well. In LibTomCrypt the associated code (\textit{chaining modes in this case})
188 The project is hereby released as public domain.
192 The author (Tom St Denis) is not a patent lawyer so this section is not to be treated as legal advice. To the best
219 There have been quite a few other people as well. Please check the change log to see who else has contributed from
296 There are 32 and 64-bit cyclic rotations as well:
319 Certain functions such as (for example) \textit{rsa\_export()} give an output that is variable length. To prevent buffer overflows you
355 As of v1.13, most functions will update your length on failure to indicate the size required by the f (…)
[all...] |
| /external/v8/test/mjsunit/harmony/ |
| proxies-example-membrane.js | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
68 // As long as obj is not frozen, the proxy won't allow itself to be fixed
122 print("wrap exit", str(obj), "as", str(x));
297 print("asDry exit", str(obj), "as", str(x));
364 print("asWet exit", str(obj), "as", str(x))
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| recognizers.rb | 22 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
96 # ^-- same as this --v
133 attribute declarations from the ANTLR grammar as parameters, and overrides
155 # If no defaults, leave the initialize method the same as
178 As the base class of all ANTLR-generated recognizers, Recognizer provides
249 # used as a hook to add additional default members
368 # As a result, all error tracking and error recovery
679 # tokens. For literals such as '{' and ',', the default
736 # runtime, however, we know precisely which context applies as
766 # as you can see by looking at the derivation of this specifi
[all...] |
| token.rb | 22 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
42 such as absolute character index, line number, and position within the line (or
57 == Token as an Interface
60 you may write your own token class as long as you provide methods that give
110 # @example Match against a token type name as a Symbol
218 The base class for the standard implementation of Token. It is implemented as a
219 simple Struct as tokens are basically simple data structures binding together a
340 that need to create token objects This module serves as a mixin that provides
375 TokenSchemes exist to handle the problem of defining token types as intege
[all...] |
| tree.rb | 22 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
194 As ANTLR is concerned, an Abstract Syntax Tree (AST) node is an object that
200 tree nodes as well as the methods trees need to implement.
214 [siblings] all other nodes sharing the same parent as some node
951 operates similarly to other streams. They are commonly used by tree parsers as
[all...] |
| /external/chromium/chrome/browser/resources/ |
| print_preview.js | 111 * invalid warning icon on the text box and sets the error message as the title
338 * Create the PDF plugin as needed.
594 * As the user types in the page range textfield, we need to reset this timer,
|
| /external/dropbear/libtommath/ |
| bn.tex | 85 As of the v0.25 the library source code has been placed in the public domain with every new release. As of the v0.28
87 release as well. This textbook is meant to compliment the project by providing a more solid walkthrough of the development
91 public domain everyone is entitled to do with them as they see fit.
95 LibTomMath is meant to be very ``GCC friendly'' as it comes with a makefile well suited for GCC. However, the library will
100 To build as a static library for GCC issue the following
115 To build as a shared library for GCC issue the following
119 This requires the ``libtool'' package (common on most Linux/BSD systems). It will build LibTomMath as both shared
120 and static then install (by default) into /usr/lib as well as install the header files in /usr/include. The shared
[all...] |
| /external/v8/src/ |
| ast.h | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
218 type* As##type() { return Is##type() ? reinterpret_cast<type*>(this) : NULL; }
323 // Symbols that cannot be parsed as array indices are considered property
324 // names. We do not treat symbols that can be array indexes as property
332 // True iff the expression is a literal represented as a smi.
1094 // NOTE: TargetCollectors are represented as nodes to fit in the target
[all...] |
| /external/v8/tools/ |
| profile.js | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
155 // As code and functions are in the same address space,
553 * Adds the specified call path, constructing nodes as necessary.
725 * Returns all node's children as an array.
|
| /external/iproute2/doc/ |
| ip-cref.tex | 62 As a rule, the information is statistics or some time values.
123 abbreviated form, f.e.\ \verb|address| is abbreviated as \verb|addr|
128 As a rule, it is possible to \verb|add|, \verb|delete| and
165 and exits. As a rule, the error message will contain information
177 prints the error message, as it is output with \verb|perror(3)|,
182 In this case \verb|ip| prints the error message, as it is output
195 syntax errors). However, as a rule, their meaning is clear
382 the maximal size of data which can be sent as a single packet over this interface.
419 that software {\em must not\/} interpret the absence of this flag as the inability
438 involved. As a rule, it indicates that the device needs no addres
[all...] |
| /external/ceres-solver/docs/ |
| solving.tex | 79 The factorization methods are based on computing an exact solution of~\eqref{eq:lsqr} using a Cholesky or a QR factorization and lead to an exact step Levenberg-Marquardt algorithm. But it is not clear if an exact solution of~\eqref{eq:lsqr} is necessary at each step of the LM algorithm to solve~\eqref{eq:nonlinsq}. In fact, we have already seen evidence that this may not be the case, as~\eqref{eq:lsqr} is itself a regularized version of~\eqref{eq:linearapprox}. Indeed, it is possible to construct non-linear optimization algorithms in which the linearized problem is solved approximately. These algorithms are known as inexact Newton or truncated Newton methods~\cite{nocedal2000numerical}.
85 Here, $k$ indicates the Levenberg-Marquardt iteration number and $0 < \eta_k <1$ is known as the forcing sequence. Wright \& Holt \cite{wright1985inexact} prove that a truncated Levenberg-Marquardt algorithm that uses an inexact Newton step based on~\eqref{eq:inexact} converges for any sequence $\eta_k \leq \eta_0 < 1$ and the rate of convergence depends on the choice of the forcing sequence $\eta_k$.
104 \texttt{TRADITIONAL\_DOGLEG} as described by Powell,
115 The key advantage of the Dogleg over Levenberg Marquardt is that if the step computation for a particular choice of $\mu$ does not result in sufficient decrease in the value of the objective function, Levenberg-Marquardt solves the linear approximation from scratch with a smaller value of $\mu$. Dogleg on the other hand, only needs to compute the interpolation between the Gauss-Newton and the Cauchy vectors, as neither of them depend on the value of $\mu$.
138 known as separable least squares problem and the most famous algorithm
144 known as Wiberg's algorithm~\cite{wiberg}.
148 squares problems and refer to {\em Variable Projection} as
166 and then use it as the starting point to further optimize just $a_1$
200 boulders'' as the method is not restricted to move into narro
[all...] |
| /build/core/ |
| main.mk | 2 # DO NOT use other shells such as zsh.
6 # Use bash, not whatever shell somebody has installed as /bin/sh
223 # such as core.jar, framework.jar, etc.
461 # modules as a side-effect. Do this after including ONE_SHOT_MAKEFILE
499 $(warning * As an alternative, use PRODUCT_COPY_FILES in)
542 # brought in as requirements of other modules.
689 # is as little code as possible in the tree that doesn't build.
810 # For uninstallable modules such as static Java library, we have to dist the built file,
811 # as <module_name>.<suffix
[all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
| Antlr.Runtime.Tree.pas | 24 THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
84 /// a list of element as the children. If you want a flat tree (a list)
143 /// child as the new root node.
155 /// node. If newRoot is ^(nil x) return x as newRoot.
168 /// as the setting of start/stop indexes relies on a single non-nil root
171 /// Flat trees such as for lists like "idlist : ID+ ;" are left alone
187 /// <item>Number the nodes as they are created?</item>
191 /// WARNING: This is usually implemented either as IL to make a
213 /// rewrite rule as IMAG[$tokenLabel].
219 /// <summary>Same as Create(tokenType,fromToken) except set the text too
[all...] |
| /external/v8/test/mjsunit/ |
| unicode-test.js | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
31 // source files as UTF-8, so they will fail on this test. If you want
[all...] |
