| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
| BitSet.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| BufferedTokenStream.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| LegacyCommonTokenStream.cs | 15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
18 * notice, this list of conditions and the following disclaimer in the
20 * 3. The name of the author may not be used to endorse or promote products
25 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
28 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
30 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
| BitSet.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| BufferedTokenStream.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| LegacyCommonTokenStream.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| /external/llvm/test/tools/dsymutil/Inputs/scattered-reloc/ |
| 1.s | 7 # Then I edited the debug info bellow to change the DW_AT_location of the bar
80 .long 52 @ Length of Unit
105 .byte 0 @ End Of Children Mark
109 .byte 0 @ End Of Macro List Mark
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonBitTracker.cpp | 5 // This file is distributed under the University of Illinois Open Source
31 // Go over all the formal parameters of the function. If a given parameter
33 // parameter and create an entry in the VRX map indicating the type of ex-
44 // der the initial sequence of formal parameters that are known to be
117 // The main purpose of this operator is to assert with bad argument.
146 // call site, and we should take advantage of this knowledge. The MRI
147 // keeps a list of pairs of live-in physical and virtual registers,
166 // checking what kind of operand a given instruction has individually
204 // Extract RW low bits of the cell
[all...] |
| /external/llvm/test/DebugInfo/SystemZ/ |
| variable-loc.s | 7 # A couple of R_390_32s, both at 0 and elsewhere:
12 # A couple of R_390_64s similarly:
105 .long 155 # Length of Compilation Unit Info
173 .byte 0 # End Of Children Mark
174 .byte 0 # End Of Children Mark
175 .byte 0 # End Of Children Mark
|
| /external/v8/src/compiler/ |
| types.h | 2 // Use of this source code is governed by a BSD-style license that can be
52 // subtype of Range(n, n) (and therefore also a subtype of any larger range).
86 // especially with respect to the properties of the more exotic 'temporal'
201 * Some of the atomic numerical bitsets are internal only (see
204 * occur as part of PlainNumber.
426 // Superclass for types with variable number of type fields.
492 // - no field is a subtype of any other field
553 static Type* Of(double value, Zone* zone) {
556 static Type* Of(i::Object* value, Zone* zone)
[all...] |
| /prebuilts/go/darwin-x86/src/image/jpeg/ |
| reader.go | 2 // Use of this source code is governed by a BSD-style
18 // the name of the type or function that they annotate.
51 sof0Marker = 0xc0 // Start Of Frame (Baseline Sequential).
52 sof1Marker = 0xc1 // Start Of Frame (Extended Sequential).
53 sof2Marker = 0xc2 // Start Of Frame (Progressive).
57 soiMarker = 0xd8 // Start Of Image.
58 eoiMarker = 0xd9 // End Of Image.
59 sosMarker = 0xda // Start Of Scan.
63 // "APPlication specific" markers aren't part of the JPEG spec per se,
79 // unzig[3] is the column and row of the fourth element in zig-zag order. Th
[all...] |
| writer.go | 2 // Use of this source code is governed by a BSD-style
15 // min returns the minimum of two integers.
23 // div returns a/b rounded to the nearest integer, instead of rounded to zero.
31 // bitCount counts the number of bits needed to hold an integer.
100 // count[i] is the number of codes of length i bits.
102 // value[i] is the decoded value of the i'th codeword.
175 // huffmanLUT is a compiled look-up table representation of a huffmanSpec.
176 // Each value maps to a uint32 of which the 8 most significant bits hold the
201 // theHuffmanLUT are compiled representations of theHuffmanSpec
[all...] |
| /prebuilts/go/linux-x86/src/image/jpeg/ |
| reader.go | 2 // Use of this source code is governed by a BSD-style
18 // the name of the type or function that they annotate.
51 sof0Marker = 0xc0 // Start Of Frame (Baseline Sequential).
52 sof1Marker = 0xc1 // Start Of Frame (Extended Sequential).
53 sof2Marker = 0xc2 // Start Of Frame (Progressive).
57 soiMarker = 0xd8 // Start Of Image.
58 eoiMarker = 0xd9 // End Of Image.
59 sosMarker = 0xda // Start Of Scan.
63 // "APPlication specific" markers aren't part of the JPEG spec per se,
79 // unzig[3] is the column and row of the fourth element in zig-zag order. Th
[all...] |
| writer.go | 2 // Use of this source code is governed by a BSD-style
15 // min returns the minimum of two integers.
23 // div returns a/b rounded to the nearest integer, instead of rounded to zero.
31 // bitCount counts the number of bits needed to hold an integer.
100 // count[i] is the number of codes of length i bits.
102 // value[i] is the decoded value of the i'th codeword.
175 // huffmanLUT is a compiled look-up table representation of a huffmanSpec.
176 // Each value maps to a uint32 of which the 8 most significant bits hold the
201 // theHuffmanLUT are compiled representations of theHuffmanSpec
[all...] |
| /device/linaro/bootloader/arm-trusted-firmware/tools/fiptool/ |
| fip_create.sh | 3 # This script implements the old fip_create tool on top of
18 -d,--dump: Print contents of FIP after update
34 --rot-cert FILENAME Root Of Trust key certificate
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/SlimParsing/ |
| SlimTokenStream.cs | 13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
18 * 3. The name of the author may not be used to endorse or promote products
23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
[all...] |
| /external/autotest/client/common_lib/ |
| pxssh.py | 57 then this can lead to a lot of confusion. Many X display managers (xdm,
62 is configured to allow password logins. Example of using 'force_password'
83 #set command different we add a backslash in front of $. The $ doesn't
95 # Disabling X11 forwarding gets rid of the annoying SSH_ASKPASS from
129 # All of these timing pace values are magic.
167 strings such as the "Message Of The Day". On many systems you can
170 then this will not necessarily cause the login to fail. In the case of
|
| /external/v8/src/ast/ |
| ast-types.h | 2 // Use of this source code is governed by a BSD-style license that can be
24 // Types consist of two dimensions: semantic (value range) and representation.
61 // TODO(rossberg): the latter is not currently true for proxies, because of fix,
63 // However, we also define a 'temporal' variant of the subtyping relation that
102 // subtype of Range(n, n) (and therefore also a subtype of any larger range).
136 // especially with respect to the properties of the more exotic 'temporal'
261 * Some of the atomic numerical bitsets are internal only (see
264 * occur as part of PlainNumber.
568 // Superclass for types with variable number of type fields
[all...] |
| /external/ppp/pppd/plugins/radius/etc/ |
| dictionary.ascend | 132 ATTRIBUTE Ascend-Seconds-Of-History 238 integer
257 VALUE Ascend-PW-Warntime Days-Of-Warning 0
|
| /device/linaro/bootloader/edk2/DuetPkg/BootSector/ |
| Gpt.asm | 5 ;* are licensed and made available under the terms and conditions of the BSD License
6 ;* which accompanies this distribution. The full text of the license may be found at
10 ;* WITHOUT WARRANTIES OR REPRESENTATIONS OF ANY KIND, EITHER EXPRESS OR IMPLIED.
173 ; ReadBlocks - Reads a set of blocks from a block device
176 ; BX = Number of Blocks to Read (must < 127)
189 mov BYTE PTR ds:[si+2],bl ; 02 = Number Of Block transfered
206 db 10h ; Size of address packet
|
| /external/libunwind/doc/ |
| libunwind-ptrace.tex | 42 gain access to the machine-state and virtual memory of \emph{another}
43 process. With the right set of call-back routines, it is therefore
48 implementing this facility use a name-prefix of \Func{\_UPT}, which is
55 will simply want to pass the address of \Var{\_UPT\_accessors} as the
59 only portions of the \Prog{\_UPT}-facility. For this reason, the
62 use. Of course, the addresses of these routines could also be picked
72 \Const{PTRACE\_ATTACH}). Either way, once the process-ID (pid) of the
74 by calling \Func{\_UPT\_create}(), passing the pid of the target process
79 The \Func{\_UPT\_resume}() routine can be used to resume execution of
[all...] |
| /external/lzma/CS/7zip/Compress/LzmaAlone/ |
| LzmaAlone.cs | 88 " -fb{N}: set number of fast bytes - [5, 273], default: 128\n" +
89 " -lc{N}: set number of literal context bits - [0, 8], default: 3\n" +
90 " -lp{N}: set number of literal pos bits - [0, 4], default: 0\n" +
91 " -pb{N}: set number of pos bits - [0, 4], default: 2\n" +
93 " -eos: write End Of Stream marker\n"
|
| /prebuilts/go/darwin-x86/src/index/suffixarray/ |
| suffixarray_test.go | 2 // Use of this source code is governed by a BSD-style
17 name string // name of test case
91 "Now is the time for all good men to come to the aid of their country.",
96 "is the time for all good men to come to the aid of their",
108 // find all occurrences of s in source; report at most n occurrences
112 // find at most n occurrences of s in src
134 // if n >= 0 the number of results is limited --- unless n >= all results,
143 t.Errorf("test %q, lookup %q, result %d (n = %d): index %d out of range [0, %d[", tc.name, s, i, n, r, len(tc.source))
172 // if n >= 0 the number of results is limited --- unless n >= all results,
263 // Of all possible inputs, the random bytes have the least amount of substrin
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| malloc_test.go | 2 // Use of this source code is governed by a BSD-style
47 // Of the uint fields, HeapReleased, HeapIdle can be 0.
210 var n = flag.Int("n", 1000, "number of goroutines")
|
| /prebuilts/go/linux-x86/src/index/suffixarray/ |
| suffixarray_test.go | 2 // Use of this source code is governed by a BSD-style
17 name string // name of test case
91 "Now is the time for all good men to come to the aid of their country.",
96 "is the time for all good men to come to the aid of their",
108 // find all occurrences of s in source; report at most n occurrences
112 // find at most n occurrences of s in src
134 // if n >= 0 the number of results is limited --- unless n >= all results,
143 t.Errorf("test %q, lookup %q, result %d (n = %d): index %d out of range [0, %d[", tc.name, s, i, n, r, len(tc.source))
172 // if n >= 0 the number of results is limited --- unless n >= all results,
263 // Of all possible inputs, the random bytes have the least amount of substrin
[all...] |
