| /external/neven/Embedded/common/src/b_BasicEm/ |
| Context.h | 59 #define bbs_ERR_MEMORY_OVERFLOW 3 /* not enough memory in a segment or no segment */
185 /** adds a static memory segment to memory table of context */
188 uint32 sizeA, /* size of memory segment in 16 bit units */
189 flag sharedA, /* Indicates that this segment is to be shared among multiple objects */
190 uint32 idA ); /* ID of segment, id=0: unspecified */
192 /* adds a dynamic memory segment to memory table of context
198 flag sharedA, /* Indicates that this segment is to be shared among multiple objects */
199 uint32 idA ); /* ID of segment, id=0: unspecified */
202 /** Returns allocated memory in selected exclusive segment in units of 16bits *
[all...] |
| MemSeg.h | 36 /* Segment IDs */
48 #define bbs_SEG_DA 1 /* = internal RAM segment */
58 /** Descriptor of a coherent memory segment available for memory management.
72 * - Each segment contains an ID. The segment with the ID 0 is the default segment.
81 /** size of memory segment in 16 bit units */
90 /** ID of segment, id=0: unspecified */
115 /** returns available 16bit units of memeory in given segment; (allocation is always 32 bit aligned) */
119 /** returns currently allocated size in 16bit units of memeory in given segment */
[all...] |
| /frameworks/wilhelm/tools/permute/ |
| permute.c | 38 // mean length of each segment of the permutation, in seconds
40 // minimum length of each segment of the permutation, in seconds
44 /** Describes each contiguous segment generated */
50 } Segment;
61 Segment *mSegmentArray; // storage for the segments [max]
69 const Segment *x_ = (Segment *) x;
70 const Segment *y_ = (Segment *) y;
86 Segment *seg = &s->mSegmentArray[s->mSegmentCount++]
[all...] |
| /external/eigen/test/ |
| conservative_resize.cpp | 70 VERIFY_IS_APPROX(m, n.segment(0,1));
74 VERIFY_IS_APPROX(m, n.segment(0,50));
82 VERIFY_IS_APPROX(m, n.segment(0,size));
91 VERIFY_IS_APPROX(m.segment(0,50), n);
92 VERIFY( size<=50 || m.segment(50,size-50).sum() == Scalar(0) );
|
| block.cpp | 87 VERIFY_IS_EQUAL(v1.template head<2>(), v1.segment(0,2));
88 VERIFY_IS_EQUAL(v1.template head<2>(), v1.template segment<2>(0));
92 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.segment(i,2));
93 VERIFY_IS_EQUAL(v1.template tail<2>(), v1.template segment<2>(i));
95 VERIFY_IS_EQUAL(v1.segment(i,2), v1.template segment<2>(i));
109 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0)) , (m1.row(r1).segment(c1,c2-c1+1)) );
110 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).col(0)) , (m1.col(c1).segment(r1,r2-r1+1)) );
111 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() );
112 VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-c1+1)).transpose() )
[all...] |
| /external/grub/stage2/ |
| apm.S | 69 /* BIOS code segment */
73 /* BIOS 16 bit code segment */
75 /* BIOS data segment */
77 /* BIOS code segment length */
79 /* BIOS data segment length */
|
| /frameworks/base/core/java/android/content/ |
| ContentUris.java | 56 * segment in a path is often called a "twig"
73 * Converts the last path segment to a long.
76 * stored in the last segment.
79 * @throws NumberFormatException if the last segment isn't a number
81 * @return the long conversion of the last segment or -1 if the path is
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
| Match.java | 24 import com.android.ide.common.api.Segment;
29 public final Segment with;
32 public final Segment edge;
55 public Match(GuidelineHandler handler, Segment edge, Segment with,
|
| MoveHandler.java | 37 import com.android.ide.common.api.Segment;
49 * different segment types -- the left edge, the right edge, the baseline, the center
114 protected void snapVertical(Segment vEdge, int x, Rect newBounds) {
139 protected void snapHorizontal(Segment hEdge, int y, Rect newBounds) {
210 Segment edge = new Segment(b.y, b.x, b.x2(), null, null, TOP, NO_MARGIN);
212 edge = new Segment(b.y2(), b.x, b.x2(), null, null, BOTTOM, NO_MARGIN);
215 edge = new Segment(b.x, b.y, b.y2(), null, null, LEFT, NO_MARGIN);
217 edge = new Segment(b.x2(), b.y, b.y2(), null, null, RIGHT, NO_MARGIN);
221 edge = new Segment(b.centerX(), b.y, b.y2(), null, null, CENTER_VERTICAL, NO_MARGIN)
[all...] |
| ResizeHandler.java | 36 import com.android.ide.common.api.Segment;
107 protected void snapVertical(Segment vEdge, int x, Rect newBounds) {
130 protected void snapHorizontal(Segment hEdge, int y, Rect newBounds) {
188 Segment hEdge = null;
189 Segment vEdge = null;
196 hEdge = new Segment(b.y, b.x, b.x2(), child, childId, mHorizontalEdgeType, NO_MARGIN);
198 hEdge = new Segment(b.y2(), b.x, b.x2(), child, childId, mHorizontalEdgeType,
205 vEdge = new Segment(b.x, b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
207 vEdge = new Segment(b.x2(), b.y, b.y2(), child, childId, mVerticalEdgeType, NO_MARGIN);
|
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 99 * If a maximum size is specified, a best-effort bounding is performed per segment, using a
104 * ordering of writes to a segment is sequentially consistent. An update to the map and recording
110 * This implementation uses a per-segment queue to record a memento of the additions, removals,
116 * operates per-segment rather than globally for increased implementation simplicity. We expect
136 * Number of cache access operations that can be buffered per segment before the cache's recency
159 * the segment.
164 * Shift value for indexing within segments. Helps prevent entries that end up in the same segment
170 final Segment<K, V>[] segments;
289 // Ensure sum of segment max weights = overall max weights
376 Segment<K, V> segment, ReferenceEntry<K, V> entry, V value, int weight)
[all...] |
| /external/valgrind/main/coregrind/ |
| pub_core_aspacemgr.h | 55 segment list, and reading /proc/self/maps into it. This must
68 /* Finds the segment containing 'a'. Only returns file/anon/resvn
74 /* Find the next segment along from 'here', if it is a file/anon/resvn
75 segment. */
100 /* Show the segment array on the debug log, at given loglevel. */
103 /* Get the filename corresponding to this segment, if known and if it
155 free segment, otherwise returns False.
159 the next segment along. So make very sure that the proposed
166 The segment array is updated accordingly. If the returned Bool is
173 The segment array is updated accordingly. If the returned Bool i
[all...] |
| /external/chromium/base/ |
| shared_memory.h | 27 // the underlying OS handle to a shared memory segment.
32 // A SharedMemoryId is sufficient to identify a given shared memory segment on a
77 // Creates and maps an anonymous shared memory segment of size size.
81 // Creates an anonymous shared memory segment of size size.
85 // Creates or opens a shared memory segment based on a name.
93 // Deletes resources associated with a shared memory segment based on name.
97 // Opens a shared memory segment based on a name.
126 // Returns the underlying OS handle for this segment.
132 // Returns a unique identifier for this shared memory segment. Inode numbers
139 // Closes the open shared memory segment
[all...] |
| /external/icu4c/common/unicode/ |
| caniter.h | 184 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
185 UnicodeString *getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status); //private String[] getEquivalents(String segment)
187 //Set getEquivalents2(String segment);
188 Hashtable *getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status);
189 //Hashtable *getEquivalents2(const UnicodeString &segment, int32_t segLen, UErrorCode &status);
192 * See if the decomposition of cp2 is at segment starting at segmentPos
196 //Set extract(int comp, String segment, int segmentPos, StringBuffer buffer);
197 Hashtable *extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status);
198 //Hashtable *extract(UChar32 comp, const UnicodeString &segment, int32_t segLen, int32_t segmentPos, UErrorCode &status)
[all...] |
| /external/qemu-pc-bios/bochs/bios/ |
| apmbios.S | 194 mov ax, #0xf000 // 16 bit code segment base
195 mov si, #0xfff0 // 16 bit code segment size
196 mov cx, #0xf000 // data segment address
197 mov di, #0xfff0 // data segment length
205 mov ax, #0xf000 // 32 bit code segment base
207 mov cx, #0xf000 // 16 bit code segment base
208 // 32 bit code segment size (low 16 bits)
209 // 16 bit code segment size (high 16 bits)
211 mov dx, #0xf000 // data segment address
212 mov di, #0xfff0 // data segment lengt
[all...] |
| /external/elfutils/libdwfl/ |
| dwfl_segment_report_module.c | 64 This more than covers the phdrs and note segment in the average 64-bit
76 /* Return user segment index closest to ADDR but not above it. */
78 addr_segndx (Dwfl *dwfl, size_t segment, GElf_Addr addr)
80 int ndx = dwfl->lookup_segndx[segment];
83 if (dwfl->lookup_segndx[segment] >= 0)
84 ndx = dwfl->lookup_segndx[segment];
85 ++segment;
87 while (segment < dwfl->lookup_elts - 1
88 && dwfl->lookup_addr[segment] < addr);
90 while (dwfl->lookup_segndx[segment] <
107 size_t segment = ndx; local
[all...] |
| /external/sonivox/jet_tools/JetCreator/ |
| JetAudition.py | 212 for segment in self.jet_file.GetSegments():
213 info = MidiSegInfo(segment)
214 index = self.segList.InsertStringItem(sys.maxint, StrNoneChk(segment.segname))
228 """ Sets current segment name based on what's clicked """
234 """ Sets command to cancel the currently playing segment and queues another """
252 """ Sets a command to cancel the currently playing segment """
258 """ Queues a segment via the button """
263 segment = self.jet_file.GetSegment(self.currentSegmentName)
264 self.QueueOneSegment(segment, segNum)
267 """ Queues a segment """
[all...] |
| JetDefs.py | 81 MAIN_CONFIRM_SEG_DLT = "\n\nOkay to delete segment(s)?"
159 BUT_PLAYSEG = 'Play Segment'
172 MNU_ADD_SEG = "Add Segment"
173 MNU_UPDATE_SEG = "Revise Segment"
174 MNU_DELETE_SEG = "Delete Segment"
175 MNU_MOVE_SEG = "Move Segment(s)"
183 HLP_QUANTIZE = "The quantize element is optional and defaults to 0 if omitted.\nThis value sets a window size in ticks for the breaks in\n a segment when notes are extracted from a larger file. \nSee the section on Quantization for further detail \non the operation of this parameter."
191 SB_CUT = "Cuts the current segment or event to the clipboard"
192 SB_COPY = "Copies the current segment or event to the clipboard"
193 SB_PASTE = "Pastes the current segment or event from the clipboard"
[all...] |
| /external/skia/legacy/src/core/ |
| SkPathMeasure.cpp | 34 SkScalar SkPathMeasure::Segment::getScalarT() const {
38 const SkPathMeasure::Segment* SkPathMeasure::NextSegment(const Segment* seg) {
113 Segment* seg = fSegments.append();
137 Segment* seg = fSegments.append();
153 Segment* seg;
212 const Segment* seg = fSegments.begin();
213 const Segment* stop = fSegments.end();
222 const Segment* s = seg;
382 const SkPathMeasure::Segment* SkPathMeasure::distanceToSegment
[all...] |
| /external/skia/src/core/ |
| SkPathMeasure.cpp | 34 SkScalar SkPathMeasure::Segment::getScalarT() const {
38 const SkPathMeasure::Segment* SkPathMeasure::NextSegment(const Segment* seg) {
102 Segment* seg = fSegments.append();
126 Segment* seg = fSegments.append();
142 Segment* seg;
217 const Segment* seg = fSegments.begin();
218 const Segment* stop = fSegments.end();
227 const Segment* s = seg;
384 const SkPathMeasure::Segment* SkPathMeasure::distanceToSegment
[all...] |
| /bootable/recovery/minzip/ |
| SysUtil.c | 28 * Create an anonymous shared memory segment large enough to hold "length"
29 * bytes. The actual segment may be larger because mmap() operates on
77 * Pull the contents of a file into an new shared memory segment. We grab
80 * We need to know the length ahead of time so we can allocate a segment
113 * segment. The file offset must be a multiple of the page size.
144 * memory segment.
164 LOGW("bad segment: st=%d len=%ld flen=%d\n",
|
| /hardware/samsung_slsi/exynos5/mobicore/common/MobiCore/inc/ |
| mcLoadFormat.h | 84 * Descriptor for a memory segment.
88 uint32_t len; /**< Length of the segment in bytes. */
133 segmentDescriptor_t text; /**< Virtual text segment. */
134 segmentDescriptor_t data; /**< Virtual data segment. */
135 uint32_t bssLen; /**< Length of the BSS segment in bytes. MUST be at least 8 byte. */
143 * Version 2 MCLF text segment header.
157 segmentDescriptor_t mcLibData; /**< Segment for McLib data.
|
| /external/openssl/crypto/perlasm/ |
| x86masm.pl | 11 $segment="";
87 .text\$ SEGMENT PAGE 'CODE'
89 .text\$ SEGMENT ALIGN(64) 'CODE'
93 $segment = ".text\$";
131 push(@out,"$segment ENDS\n");
135 .bss SEGMENT 'BSS'
181 .CRT\$XCU SEGMENT DWORD PUBLIC 'DATA'
189 { push(@out,"$segment\tENDS\n_DATA\tSEGMENT\n"); $segment="_DATA"; }
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| fdjac1.h | 67 fjac.col(j).segment(start, length) = ( wa1.segment(start, length)-fvec.segment(start, length))/h;
|
| /external/iproute2/include/linux/can/ |
| netlink.h | 28 __u32 prop_seg; /* Propagation segment in TQs */
29 __u32 phase_seg1; /* Phase buffer segment 1 in TQs */
30 __u32 phase_seg2; /* Phase buffer segment 2 in TQs */
|
