| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/asm/ |
| mman.h | 8 #define MAP_GROWSDOWN 0x0100 /* stack-like segment */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| mman.h | 8 #define MAP_GROWSDOWN 0x0100 /* stack-like segment */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/asm/ |
| mman.h | 8 #define MAP_GROWSDOWN 0x0100 /* stack-like segment */
|
| /external/icu4c/common/ |
| caniter.cpp | 228 // allocate the arrays, and find the strings that are CE to each segment
242 // for each segment, get all the combinations that can produce
245 //if (PROGRESS) printf("SEGMENT\n");
341 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
342 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) {
354 int32_t segLen = segment.extract(USeg, 256, status);
384 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
385 if (attempt==segment) {
430 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) {
436 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
[all...] |
| /external/srtp/doc/ |
| draft-irtf-cfrg-icm-00.txt | 44
Crypto Forum Research Group David A. McGrew
Internet Draft Cisco Systems, Inc.
Expires April, 2003 October, 2002
Integer Counter Mode
<draft-irtf-cfrg-icm-00.txt>
Status of this Memo
This document is an Internet Draft and is in full conformance with
all provisions of Section 10 of RFC-2026. Internet Drafts are working
documents of the Internet Engineering Task Force (IETF), its areas,
and working groups. Note that other groups may also distribute
working documents as Internet Drafts.
Internet Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet Drafts as reference
material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at
http://www.ietf.org/ietf/1id-abstracts.txt
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html.
1. Abstract
This document specifies Integer Counter Mode (ICM), a mode of
operation of a block cipher which defines an indexed keystream
generator (which generates a keystream segment given an index).
This mode is efficient, parallelizable, and has been proven secure
given realistic assumptions about the block cipher. Test vectors
are provided for AES.
Counter Mode admits many variations. The variant specified in
this document is secure and flexible, yet it enables a single
implementation of a keystream generator to suffice in different
application domains.
McGrew [Page 1]
Internet Draft Integer Counter Mode October, 2002
2. Notational Conventions
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in
this document are to be interpreted as described in RFC-2119 [B97].
3. Introduction
Counter Mode is a way to define a pseudorandom keystream generator
using a block cipher [CTR]. The keystream can be used for additive
encryption, key derivation, or any other application requiring
pseudorandom data.
In ICM, the keystream is logically broken into segments. Each
segment is identified with a segment index, and the segments have
equal lengths. This segmentation makes ICM especially appropriate
for securing packet-based protocols.
4. ICM
In this section, ICM keystream generation and encryption are
defined.
4.1. ICM Parameters
The following parameters are used in ICM. These parameters MUST
remain fixed for any given use of a key.
Parameter Meaning
-----------------------------------------------------------------
BLOCK_LENGTH the number of octets in the cipher block
KEY_LENGTH the number of octets in the cipher key
OFFSET_LENGTH the number of octets in the offset
SEGMENT_INDEX_LENGTH the number of octets in the segment index
BLOCK_INDEX_LENGTH the number of octets in the block index
4.2. Keystream Segments
Conceptually, ICM is a keystream generator that takes a secret key
and a segment index as an input and then outputs a keystream
segment. The segmentation lends itself to packet encryption, as
each keystream segment can be used to encrypt a distinct packet.
A counter is a value containing BLOCK_LENGTH octets which is
McGrew [Page 2]
Internet Draft Integer Counter Mode October, 2002
incremented using an increment function based on integer addition,
to produce a sequence of distinct values which are used as inputs to
the block cipher. (In the context of this specification, an integer
is an octet string, the most significant of which is the first.)
The output blocks of the cipher are concatenated to form the
keystream segment. The first octet of the segment is the first
octet of the first output block, and so on. A schematic of this
process is shown in Figure 1.
Figure 1. The generation of a keystream segment given a segment
index and a block cipher key K. Here C[i] and S[i] denote the ith
counter and (…)
[all...] |
| /external/valgrind/main/drd/tests/ |
| tc22_exit_w_lock.stderr.exp-32bit | 9 Other segment start (thread 2)
11 Other segment end (thread 2)
21 Other segment start (thread 2)
23 Other segment end (thread 2)
33 Other segment start (thread 2)
35 Other segment end (thread 2)
45 Other segment start (thread 2)
47 Other segment end (thread 2)
57 Other segment start (thread 2)
59 Other segment end (thread 2
[all...] |
| /external/eigen/Eigen/src/Core/ |
| VectorBlock.h | 25 * It is the return type of DenseBase::segment(Index,Index) and DenseBase::segment<int>(Index) and
44 * \sa class Block, DenseBase::segment(Index,Index,Index,Index), DenseBase::segment(Index,Index)
93 /** \returns a dynamic-size expression of a segment (i.e. a vector block) in *this.
97 * \param start the first coefficient in the segment
98 * \param size the number of coefficients in the segment
107 * \sa class Block, segment(Index)
111 DenseBase<Derived>::segment(Index start, Index size) function in class:Eigen::DenseBase
117 /** This is the const version of segment(Index,Index).*
120 DenseBase<Derived>::segment(Index start, Index size) const function in class:Eigen::DenseBase
206 DenseBase<Derived>::segment(Index start) function in class:Eigen::DenseBase
216 DenseBase<Derived>::segment(Index start) const function in class:Eigen::DenseBase
[all...] |
| /external/valgrind/main/drd/ |
| drd_semaphore.c | 50 /** Push a segment at the end of the queue 'p->last_sem_post_seg'. */
51 static void drd_segment_push(struct semaphore_info* p, Segment* sg)
61 tl_assert(*(Segment**)VG_(indexXA)(p->last_sem_post_seg, n) == sg);
64 /** Pop a segment from the beginning of the queue 'p->last_sem_post_seg'. */
65 static Segment* drd_segment_pop(struct semaphore_info* p)
68 Segment* sg;
78 sg = *(Segment**)VG_(indexXA)(p->last_sem_post_seg, sz - 1);
110 VG_(free), sizeof(Segment*));
119 Segment* sg;
174 Segment* sg
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentHashMap.java | 80 * well as elements of segment's table must use volatile access,
93 * that design (including forced construction of segment 0) exist
126 * The minimum capacity for per-segment tables. Must be a power
150 * key's hash code are used to choose the segment.
162 final Segment<K,V>[] segments;
237 // Spread bits to regularize both segment and index locations,
252 static final class Segment<K,V> extends ReentrantLock implements Serializable {
263 * per-segment versions of ConcurrentHashMap methods. (Other
284 * segment operation. On multiprocessors, using a bounded
292 * The per-segment table. Elements are accessed vi
847 Segment<K,V> segment = segmentAt(segments, i); local
860 Segment<K,V> segment = ensureSegment(i); local
948 Segment<K,V> segment; local
[all...] |
| /external/sonivox/jet_tools/JetCreator/ |
| JetCreator.py | 302 for segment in self.jet_file.GetSegments():
303 index = self.segList.InsertStringItem(sys.maxint, StrNoneChk(segment.segname))
304 self.segList.SetStringItem(index, 1, FileJustName(StrNoneChk(segment.filename)))
305 self.segList.SetStringItem(index, 2, FileJustName(StrNoneChk(segment.dlsfile)))
306 self.segList.SetStringItem(index, 3, mbtFct(segment.start, 1))
307 self.segList.SetStringItem(index, 4, mbtFct(segment.end, 1))
308 self.segList.SetStringItem(index, 5, StrNoneChk(segment.quantize))
309 self.segList.SetStringItem(index, 6, StrNoneChk(segment.transpose))
310 self.segList.SetStringItem(index, 7, StrNoneChk(segment.repeat))
311 self.segList.SetStringItem(index, 8, StrNoneChk(segment.mute_flags))
[all...] |
| /external/webkit/Tools/android/flex-2.5.4a/MISC/ |
| alloca.c | 233 /* The stack segment linkage control information occurs at
234 the high-address end of a stack segment. (The stack
236 part of the stack segment linkage control information is
243 long sssize:32; /* Number of words in this segment. */
247 segment of stack. */
295 long current_address; /* Current stack segment address. */
296 long current_size; /* Current stack segment size. This
299 long initial_address; /* Address of initial segment. */
300 long initial_size; /* Size of initial segment. */
304 any stack segment. I think that the description in 'asdef' i
[all...] |
| /ndk/sources/host-tools/make-3.81/ |
| alloca.c | 252 /* The stack segment linkage control information occurs at
253 the high-address end of a stack segment. (The stack
255 part of the stack segment linkage control information is
262 long sssize:32; /* Number of words in this segment. */
266 segment of stack. */
314 long current_address; /* Current stack segment address. */
315 long current_size; /* Current stack segment size. This
318 long initial_address; /* Address of initial segment. */
319 long initial_size; /* Size of initial segment. */
323 any stack segment. I think that the description in 'asdef' i
[all...] |
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| alloca.c | 240 /* The stack segment linkage control information occurs at
241 the high-address end of a stack segment. (The stack
243 part of the stack segment linkage control information is
250 long sssize:32; /* Number of words in this segment. */
254 segment of stack. */
302 long current_address; /* Current stack segment address. */
303 long current_size; /* Current stack segment size. This
306 long initial_address; /* Address of initial segment. */
307 long initial_size; /* Size of initial segment. */
311 any stack segment. I think that the description in 'asdef' i
[all...] |
| xstrndup.c | 1 /* Duplicate a bounded initial segment of a string, with out-of-memory
27 In other words, return a copy of the initial segment of length N of
|
| xstrndup.h | 1 /* Duplicate a bounded initial segment of a string, with out-of-memory
21 In other words, return a copy of the initial segment of length N of
|
| /external/bison/lib/ |
| xstrndup.c | 1 /* Duplicate a bounded initial segment of a string, with out-of-memory
27 In other words, return a copy of the initial segment of length N of
|
| xstrndup.h | 1 /* Duplicate a bounded initial segment of a string, with out-of-memory
21 In other words, return a copy of the initial segment of length N of
|
| /external/compiler-rt/lib/asan/lit_tests/Linux/ |
| asan_prelink_test.cc | 2 // It does not actually use prelink, but relies on ld's flag -Ttext-segment
7 // RUN: %clangxx_asan -m64 -DBUILD_SO=1 -fPIC -shared %s -o %t.so -Wl,-Ttext-segment=0x3600000000 ||\
|
| /external/valgrind/main/none/tests/linux/ |
| mremap3.c | 10 /* first find free segment of 40K, then unmap it */
20 /* remap the same segment, but with 4K size */
|
| /external/webkit/Source/WebCore/plugins/win/ |
| PaintHooks.asm | 24 _TEXT SEGMENT
39 _TEXT SEGMENT
|
| /frameworks/av/media/libstagefright/matroska/ |
| MatroskaExtractor.h | 26 struct Segment;
68 mkvparser::Segment *mSegment;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| virtio_blk.h | 10 #define VIRTIO_BLK_F_SIZE_MAX 1 /* Indicates maximum segment size */
17 /* The maximum segment size (if VIRTIO_BLK_F_SIZE_MAX) */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| virtio_blk.h | 10 #define VIRTIO_BLK_F_SIZE_MAX 1 /* Indicates maximum segment size */
17 /* The maximum segment size (if VIRTIO_BLK_F_SIZE_MAX) */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| virtio_blk.h | 10 #define VIRTIO_BLK_F_SIZE_MAX 1 /* Indicates maximum segment size */
17 /* The maximum segment size (if VIRTIO_BLK_F_SIZE_MAX) */
|
| /external/llvm/lib/MC/ |
| MCSectionMachO.cpp | 75 MCSectionMachO::MCSectionMachO(StringRef Segment, StringRef Section,
78 assert(Segment.size() <= 16 && Section.size() <= 16 &&
79 "Segment or section string too long");
81 if (i < Segment.size())
82 SegmentName[i] = Segment[i];
180 StringRef &Segment, // Out.
191 return "mach-o section specifier requires a segment and section "
194 // Capture segment, remove leading and trailing whitespace.
195 Segment = Comma.first;
196 StripSpaces(Segment);
[all...] |
