| /external/clang/test/CodeGenCXX/ |
| 2007-04-05-PackedBitFieldsOverlap-2.cpp | 10 unsigned long sorted : 1; member in struct:M_Packed
|
| /external/dhcpcd/ |
| if-pref.c | 79 struct interface *sorted, *ifp, *ifn, *ift; local
83 sorted = ifaces;
85 sorted->next = NULL;
88 if (ifcmp(ifp, sorted) == -1) {
89 ifp->next = sorted;
90 sorted = ifp;
94 for (ift = sorted; ift->next; ift = ift->next) {
107 ifaces = sorted;
|
| /external/openssl/crypto/stack/ |
| stack.h | 70 int sorted; member in struct:stack_st
|
| /external/openssl/include/openssl/ |
| stack.h | 70 int sorted; member in struct:stack_st
|
| /external/chromium/chrome/browser/extensions/ |
| extension_toolbar_model.cc | 168 // 1. Create a vector of extensions sorted by their pref values. This vector may
171 // 3. Remove holes from the sorted vector and append the unsorted vector.
178 ExtensionList sorted; local
179 sorted.resize(pref_order.size(), NULL);
195 sorted[index] = extension;
202 toolitems_.reserve(sorted.size() + unsorted.size());
203 for (ExtensionList::iterator iter = sorted.begin();
204 iter != sorted.end(); ++iter) {
|
| /sdk/emulator/qtools/ |
| bb2sym.cpp | 75 MyStaticRec **sorted = assign_inner_blocks(num_static_bb, blocks); local
91 if (sorted[ii]->bb.bb_addr == 0 || sorted[ii]->bb.num_insns == 0
92 || sorted[ii]->sym == NULL)
96 sorted[ii]->bb.bb_num, sorted[ii]->bb.num_insns,
97 sorted[ii]->bb.bb_addr, sorted[ii]->sym->region->path,
98 sorted[ii]->sym->name);
110 MyStaticRec **sorted = new MyStaticRec*[num_blocks] local
[all...] |
| bbprof.cpp | 93 MyStaticRec **sorted = assign_inner_blocks(num_static_bb, blocks); local
133 qsort(sorted, num_static_bb, sizeof(MyStaticRec*), cmp_dec_elapsed);
140 sorted[ii]->bb.bb_num, sorted[ii]->bb.bb_addr,
141 sorted[ii]->bb.num_insns, sorted[ii]->freq,
142 sorted[ii]->elapsed);
143 int num_insns = sorted[ii]->bb.num_insns;
144 uint32_t addr = sorted[ii]->bb.bb_addr;
146 uint32_t elapsed = sorted[ii]->cycles[jj]
192 MyStaticRec **sorted = new MyStaticRec*[num_blocks]; local
[all...] |
| /dalvik/tests/004-annotations/src/android/test/anno/ |
| TestAnnotations.java | 11 * Print the annotations in sorted order, so as to avoid
15 TreeMap<String, Annotation> sorted = local
19 sorted.put(a.annotationType().getName(), a);
22 for (Annotation a : sorted.values()) {
|
| /external/clang/utils/ |
| FindSpecRefs | 758 def sorted(l): function
790 children = sorted(map(flatten,children.values()))
791 return (key, children, sorted(data))
[all...] |
| /external/clang/utils/TableGen/ |
| ClangSACheckersEmitter.cpp | 266 std::map<int, const Record *> sorted; local
269 sorted[(*I)->getID()] = *I;
272 I = sorted.begin(), E = sorted.end(); I != E; ++I)
281 std::map<int, const Record *> sorted; local
284 sorted[(*I)->getID()] = *I;
287 I = sorted.begin(), E = sorted.end(); I != E; ++I) {
|
| /external/e2fsprogs/lib/ext2fs/ |
| ext2fsP.h | 40 int sorted; member in struct:ext2_struct_dblist
|
| /external/e2fsprogs/resize/ |
| extent.c | 31 int sorted; member in struct:_ext2_extent
50 extent->sorted = 1;
114 extent->sorted = 0;
148 if (!extent->sorted) {
151 extent->sorted = 1;
197 fprintf(out, _("#\tNum=%d, Size=%d, Cursor=%d, Sorted=%d\n"),
198 extent->num, extent->size, extent->cursor, extent->sorted);
|
| /hardware/invensense/mlsdk/mllite/ |
| compass.c | 107 float avg, sum, median, sorted[YAS_DEFAULT_FILTER_LEN]; local
129 memcpy(sorted, adap_filter->sequence, adap_filter->len * sizeof(float));
130 qsort(&sorted, adap_filter->len, sizeof(float), cmpfloat);
131 median = sorted[adap_filter->len/2];
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/animator/ |
| AnimationContentAssist.java | 143 List<AttributeDescriptor> sorted = local
145 sorted.addAll(matches.values());
146 Collections.sort(sorted);
151 new ArrayList<Pair<String, String>>(sorted.size());
152 for (AttributeDescriptor d : sorted) {
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/resources/ |
| ResourcesContentAssist.java | 120 List<AttributeDescriptor> sorted = local
122 sorted.addAll(matches.values());
123 Collections.sort(sorted);
125 addMatchingProposals(proposals, sorted.toArray(), offset, node, wordPrefix,
|
| /dalvik/dexgen/src/com/android/dexgen/util/ |
| IntList.java | 34 /** whether the values are currently sorted */
35 private boolean sorted; field in class:IntList
94 sorted = true;
122 if (sorted != otherList.sorted) {
199 sorted = false;
221 if (sorted && (size > 1)) {
222 sorted = (value >= values[size - 2]);
246 sorted = sorted
[all...] |
| /dalvik/dx/src/com/android/dx/util/ |
| IntList.java | 34 /** whether the values are currently sorted */
35 private boolean sorted; field in class:IntList
94 sorted = true;
122 if (sorted != otherList.sorted) {
199 sorted = false;
221 if (sorted && (size > 1)) {
222 sorted = (value >= values[size - 2]);
246 sorted = sorted
[all...] |
| /external/v8/test/mjsunit/ |
| array-sort.js | 340 var sorted = ["a2", "a3", "b1", "b2", "c1", "c2", "d1", "d2", "e3", variable
342 for (var i = 0; i < sorted.length; i++) {
344 assertEquals(sorted[i], x[i], name + i);
346 assertFalse(x.hasOwnProperty(sorted.length), name + "haspost");
347 assertFalse(sorted.length in x, name + "haspost2");
|
| /external/valgrind/main/coregrind/ |
| m_xarray.c | 49 Bool sorted; /* is it sorted? */ member in struct:_XArray
77 xa->sorted = False;
134 xa->sorted = False;
194 xa->sorted = False;
215 xa->sorted = False;
225 xa->sorted = True;
268 vg_assert(xa->sorted);
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ui/ |
| CorporaAdapter.java | 72 ArrayList<Corpus> sorted = new ArrayList<Corpus>(enabledCorpora.size()); local
75 sorted.add(corpus);
78 Collections.sort(sorted, new CorpusComparator());
79 mSortedCorpora = sorted;
|
| /sdk/lint/libs/lint_checks/src/com/android/tools/lint/checks/ |
| TranslationDetector.java | 224 List<String> sorted = new ArrayList<String>(difference); local
225 Collections.sort(sorted);
237 language, formatList(sorted, 4)));
|
| /external/llvm/lib/ExecutionEngine/JIT/ |
| JIT.cpp | 123 unsigned long sorted : 1; member in struct:__anon8198::LibgccObject::__anon8199::__anon8200
|
| /external/skia/src/core/ |
| SkConcaveToTriangles.cpp | 127 // The ActiveTrapezoids are a sorted list containing the currently active
139 // left and right edges, and insert it into the sorted list.
153 // Insert the specified Trapezoid into the sorted list.
156 // The sorted list of active trapezoids. This is O(n), and would benefit
224 // Classify the vertex, and return its sorted edges.
329 if (vt->fTrap1 < vt->fTrap0) { // Keep trapezoids sorted.
352 // SHOULD VERIFY THAT ALL TRAPEZOIDS ARE PROPERLY SORTED
382 // return false; // Outside all trapezoids, since they are sorted.
645 bool sorted; local
648 sorted = true
[all...] |
| /packages/apps/Calendar/tests/src/com/android/calendar/ |
| AsyncQueryServiceTest.java | 241 OperationInfo[] sorted = generateSortedWork(work, work.length); local
243 TestAsyncQueryService aqs = new TestAsyncQueryService(buildTestContext(sorted), sorted);
369 OperationInfo[] sorted = new OperationInfo[length]; local
370 System.arraycopy(work, 0, sorted, 0, length);
372 // Set the scheduled time so they get sorted properly
373 for (OperationInfo w : sorted) {
380 Arrays.sort(sorted);
388 Log.d(TAG, "Sorted work: " + sorted.length)
[all...] |
| /external/doclava/src/com/google/doclava/ |
| Doclava.java | 563 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>(); local
572 sorted.put(name, pkg);
576 for (String s : sorted.keySet()) {
577 PackageInfo pkg = sorted.get(s);
702 SortedMap<String, Object> sorted = new TreeMap<String, Object>(); local
707 sorted.put(cl.qualifiedName(), cl);
715 sorted.put(name, pkg);
719 for (String s : sorted.keySet()) {
723 Object o = sorted.get(s);
806 SortedMap<String, PackageInfo> sorted = new TreeMap<String, PackageInfo>() local
932 Sorter[] sorted = new Sorter[classes.length]; local
[all...] |
