| /external/e2fsprogs/lib/ext2fs/ |
| finddev.c | 43 * This function adds an entry to the directory list
45 static void add_to_dirlist(const char *name, struct dir_list **list)
58 dp->next = *list;
59 *list = dp;
63 * This function frees a directory list
65 static void free_dirlist(struct dir_list **list)
69 for (dp = *list; dp; dp = next) {
74 *list = 0;
77 static int scan_dir(char *dirname, dev_t device, struct dir_list **list,
101 add_to_dirlist(path, list);
127 struct dir_list *list = 0, *new_list = 0; local
[all...] |
| /hardware/qcom/display/msm8974/libhwcomposer/ |
| hwc.cpp | 93 hwc_display_contents_1_t *list = displays[i]; local
98 if (LIKELY(list && list->numHwLayers > 1)) {
99 for(uint32_t j = 0; j < list->numHwLayers; j++) {
100 if(list->hwLayers[j].compositionType != HWC_FRAMEBUFFER_TARGET)
101 list->hwLayers[j].compositionType = HWC_FRAMEBUFFER;
128 hwc_display_contents_1_t *list) {
129 if(list->flags & HWC_GEOMETRY_CHANGED) {
152 hwc_display_contents_1_t *list) {
156 if (LIKELY(list && list->numHwLayers > 1) &
267 hwc_display_contents_1_t *list = displays[i]; local
559 hwc_display_contents_1_t* list = displays[i]; local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| splice_pos_list.pass.cpp | 10 // <list>
12 // void splice(const_iterator position, list& x);
18 #include <list>
28 std::list<int> l1;
29 std::list<int> l2;
37 std::list<int> l1;
38 std::list<int> l2(a2, a2+1);
44 std::list<int>::const_iterator i = l1.begin();
48 std::list<int> l1;
49 std::list<int> l2(a2, a2+2)
[all...] |
| splice_pos_list_iter.pass.cpp | 10 // <list>
12 // void splice(const_iterator position, list<T,Allocator>& x, iterator i);
18 #include <list>
28 std::list<int> l1;
29 std::list<int> l2(a2, a2+1);
35 std::list<int>::const_iterator i = l1.begin();
39 std::list<int> l1;
40 std::list<int> l2(a2, a2+2);
46 std::list<int>::const_iterator i = l1.begin();
52 std::list<int> l1
[all...] |
| /external/antlr/antlr-3.4/gunit/src/main/java/org/antlr/gunit/swingui/ |
| RuleListController.java | 10 notice, this list of conditions and the following disclaimer.
12 notice, this list of conditions and the following disclaimer in the
39 import java.util.List;
54 private final JList list = new JList(); field in class:RuleListController
55 private final JScrollPane scroll = new JScrollPane( list,
74 list.setModel(model);
79 if(model.getSize() > 0) list.setSelectedIndex(0);
80 list.updateUI();
94 list.setOpaque(false);
95 list.setSelectionMode(ListSelectionModel.SINGLE_INTERVAL_SELECTION)
[all...] |
| /external/chromium/chrome/common/extensions/ |
| update_manifest_unittest.cc | 127 EXPECT_TRUE(parser.results().list.empty());
131 EXPECT_TRUE(parser.results().list.empty());
135 EXPECT_TRUE(parser.results().list.empty());
139 EXPECT_TRUE(parser.results().list.empty());
145 EXPECT_FALSE(parser.results().list.empty());
146 const UpdateManifest::Result* firstResult = &parser.results().list.at(0);
163 EXPECT_FALSE(parser.results().list.empty());
164 firstResult = &parser.results().list.at(0);
170 EXPECT_FALSE(parser.results().list.empty());
176 EXPECT_FALSE(parser.results().list.empty())
[all...] |
| /external/chromium_org/chrome/common/extensions/ |
| update_manifest_unittest.cc | 127 EXPECT_TRUE(parser.results().list.empty());
131 EXPECT_TRUE(parser.results().list.empty());
135 EXPECT_TRUE(parser.results().list.empty());
139 EXPECT_TRUE(parser.results().list.empty());
145 EXPECT_FALSE(parser.results().list.empty());
146 const UpdateManifest::Result* firstResult = &parser.results().list.at(0);
163 EXPECT_FALSE(parser.results().list.empty());
164 firstResult = &parser.results().list.at(0);
170 EXPECT_FALSE(parser.results().list.empty());
176 EXPECT_FALSE(parser.results().list.empty())
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| free_list.h | 9 // notice, this list of conditions and the following disclaimer.
11 // copyright notice, this list of conditions and the following disclaimer
69 // We only have time to do minimal checking. We don't traverse the list, but
72 Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next);
123 // Pops the top element off the linked list whose first element is at
124 // |*list|, and updates |*list| to point to the next element in the
125 // list. Returns the address of the element that was removed from the
126 // linked list. |list| must not be NULL
[all...] |
| /hardware/invensense/65xx/libsensors_iio/ |
| CompassSensor.AKM.cpp | 150 void CompassSensor::fillList(struct sensor_t *list)
158 list->maxRange = COMPASS_AKM8963_RANGE;
159 list->resolution = COMPASS_AKM8963_RESOLUTION;
160 list->power = COMPASS_AKM8963_POWER;
161 list->minDelay = COMPASS_AKM8963_MINDELAY;
165 list->maxRange = COMPASS_AKM8975_RANGE;
166 list->resolution = COMPASS_AKM8975_RESOLUTION;
167 list->power = COMPASS_AKM8975_POWER;
168 list->minDelay = COMPASS_AKM8975_MINDELAY;
175 list->maxRange = COMPASS_AKM8975_RANGE
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| assign_move.pass.cpp | 10 // <list>
12 // list& operator=(list&& c);
14 #include <list>
24 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
31 std::list<MoveOnly, test_allocator<MoveOnly> > l2(test_allocator<MoveOnly>(5));
38 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
39 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
45 std::list<MoveOnly, test_allocator<MoveOnly> > l2(test_allocator<MoveOnly>(6))
[all...] |
| move_alloc.pass.cpp | 10 // <list>
12 // list(list&& c, const allocator_type& a);
14 #include <list>
24 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
25 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
31 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(6));
37 std::list<MoveOnly, test_allocator<MoveOnly> > l(test_allocator<MoveOnly>(5));
38 std::list<MoveOnly, test_allocator<MoveOnly> > lo(test_allocator<MoveOnly>(5));
44 std::list<MoveOnly, test_allocator<MoveOnly> > l2(std::move(l), test_allocator<MoveOnly>(5))
[all...] |
| default.pass.cpp | 10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
22 std::list<int> l;
27 std::list<DefaultOnly> l;
32 std::list<int> l((std::allocator<int>()));
38 std::list<int, min_allocator<int>> l;
43 std::list<DefaultOnly, min_allocator<DefaultOnly>> l;
48 std::list<int, min_allocator<int>> l((min_allocator<int>()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| insert_iter_value.pass.cpp | 10 // <list>
18 #include <list>
47 std::list<int> l1(a1, a1+3);
48 std::list<int>::iterator i = l1.insert(next(l1.cbegin()), 4);
52 assert(l1 == std::list<int>(a2, a2+4));
65 assert(l1 == std::list<int>(a2, a2+4));
69 std::list<int> v1(3);
70 std::list<int> v2(3);
80 std::list<int, min_allocator<int>> l1(a1, a1+3);
81 std::list<int, min_allocator<int>>::iterator i = l1.insert(next(l1.cbegin()), 4)
[all...] |
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/preprocessor/list/ |
| for_each_i.hpp | 19 # include <boost/preprocessor/list/adt.hpp>
27 # define BOOST_PP_LIST_FOR_EACH_I(macro, data, list) BOOST_PP_FOR((macro, data, list, 0), BOOST_PP_LIST_FOR_EACH_I_P, BOOST_PP_LIST_FOR_EACH_I_O, BOOST_PP_LIST_FOR_EACH_I_M)
29 # define BOOST_PP_LIST_FOR_EACH_I(macro, data, list) BOOST_PP_LIST_FOR_EACH_I_I(macro, data, list)
30 # define BOOST_PP_LIST_FOR_EACH_I_I(macro, data, list) BOOST_PP_FOR((macro, data, list, 0), BOOST_PP_LIST_FOR_EACH_I_P, BOOST_PP_LIST_FOR_EACH_I_O, BOOST_PP_LIST_FOR_EACH_I_M)
59 # define BOOST_PP_LIST_FOR_EACH_I_R(r, macro, data, list) BOOST_PP_FOR_ ## r((macro, data, list, 0), BOOST_PP_LIST_FOR_EACH_I_P, BOOST_PP_LIST_FOR_EACH_I_O, BOOST_PP_LIST_FOR_EACH_I_M)
61 # define BOOST_PP_LIST_FOR_EACH_I_R(r, macro, data, list) BOOST_PP_LIST_FOR_EACH_I_R_I(r, macro, data, list
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| NodeRareData.h | 56 RefPtr<ChildNodeList> list = ChildNodeList::create(node);
57 m_childNodeList = list.get();
58 return list.release();
61 void removeChildNodeList(ChildNodeList* list)
63 ASSERT(m_childNodeList == list);
64 if (deleteThisAndUpdateNodeRareDataIfAboutToRemoveLastList(list->ownerNode()))
90 RefPtr<T> list = T::create(node, collectionType, name);
91 result.iterator->value = list.get();
92 return list.release();
103 RefPtr<T> list = T::create(node, collectionType)
186 LiveNodeListBase* list = it->value; local
193 LiveNodeListBase* list = it->value; local
200 LiveNodeListBase* list = it->value; local
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractListTest.java | 26 import java.util.List;
61 List list = new ArrayList(); local
62 list.add(new Integer(3));
63 list.add(new Integer(15));
64 list.add(new Integer(5));
65 list.add(new Integer(1));
66 list.add(new Integer(7));
68 Iterator i = list.iterator();
74 + " got: " + list.hashCode(), hashCode == list.hashCode())
81 SimpleList list = new SimpleList(); local
95 List list = new ArrayList(); local
214 ArrayList<E> list = new ArrayList<E>(); field in class:AbstractListTest.MockArrayList
438 AbstractList<Integer> list = new MockArrayList<Integer>(); local
457 AbstractList<Integer> list = new MockArrayList<Integer>(); local
478 private ArrayList<E> list; field in class:AbstractListTest.MockList
491 AbstractList<Integer> list = new MockList<Integer>(); local
[all...] |
| /external/chromium/base/ |
| observer_list_threadsafe.h | 24 // A thread-safe container for a list of observers.
33 // * Observers can remove themselves from the observer list inside
36 // removing itself from the observer list, the notifications will
39 // The drawback of the threadsafe observer list is that notifications
86 // Add an observer to the list.
88 ObserverList<ObserverType>* list = NULL; local
99 list = observer_lists_[loop];
101 list->AddObserver(obs);
104 // Remove an observer from the list.
110 ObserverList<ObserverType>* list = NULL local
172 ObserverList<ObserverType>* list = (*it).second; local
[all...] |
| /external/chromium/chrome/browser/resources/options/ |
| password_manager_list.css | 39 #saved-passwords-list .url {
44 #saved-passwords-list .name {
49 #saved-passwords-list .password {
54 #saved-passwords-list .password input[type="password"],
55 #saved-passwords-list .password input[type="text"] {
60 #password-exceptions-list .url {
64 #saved-passwords-list .url,
65 #saved-passwords-list .name,
66 #password-exceptions-list .url {
|
| /external/e2fsprogs/lib/blkid/ |
| devno.c | 60 * This function adds an entry to the directory list
62 static void add_to_dirlist(const char *name, struct dir_list **list)
74 dp->next = *list;
75 *list = dp;
79 * This function frees a directory list
81 static void free_dirlist(struct dir_list **list)
85 for (dp = *list; dp; dp = next) {
90 *list = NULL;
93 void blkid__scan_dir(char *dirname, dev_t devno, struct dir_list **list,
125 if (list && S_ISDIR(st.st_mode) && !lstat(path, &st) &
143 struct dir_list *list = NULL, *new_list = NULL; local
[all...] |
| /external/chromium_org/cc/test/ |
| layer_tree_json_parser.cc | 27 ListValue* list; local
28 success &= dict->GetList("Bounds", &list);
30 success &= list->GetInteger(0, &width);
31 success &= list->GetInteger(1, &height);
32 success &= dict->GetList("Position", &list);
34 success &= list->GetDouble(0, &position_x);
35 success &= list->GetDouble(1, &position_y);
46 success &= dict->GetList("ImageAperture", &list);
48 success &= list->GetInteger(0, &aperture_x);
49 success &= list->GetInteger(1, &aperture_y)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/accessibility/ |
| AXMenuList.cpp | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
61 AXObject* list = cache->getOrCreate(MenuListPopupRole); local
62 if (!list)
65 toAXMockObject(list)->setParent(this);
66 if (list->accessibilityIsIgnored()) {
67 cache->remove(list->axObjectID());
71 m_children.append(list);
73 list->addChildren();
|
| /external/chromium_org/third_party/icu/source/common/ |
| ulist.h | 19 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
21 U_CAPI void U_EXPORT2 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
23 U_CAPI UBool U_EXPORT2 ulist_containsString(const UList *list, const char *data, int32_t length);
25 U_CAPI void *U_EXPORT2 ulist_getNext(UList *list);
27 U_CAPI int32_t U_EXPORT2 ulist_getListSize(const UList *list);
29 U_CAPI void U_EXPORT2 ulist_resetList(UList *list);
31 U_CAPI void U_EXPORT2 ulist_deleteList(UList *list);
|
| /external/icu4c/common/ |
| ulist.h | 19 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
21 U_CAPI void U_EXPORT2 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
23 U_CAPI UBool U_EXPORT2 ulist_containsString(const UList *list, const char *data, int32_t length);
25 U_CAPI void *U_EXPORT2 ulist_getNext(UList *list);
27 U_CAPI int32_t U_EXPORT2 ulist_getListSize(const UList *list);
29 U_CAPI void U_EXPORT2 ulist_resetList(UList *list);
31 U_CAPI void U_EXPORT2 ulist_deleteList(UList *list);
|
| /frameworks/base/core/tests/coretests/src/android/widget/listview/ |
| ListViewHeightTest.java | 56 ListView list = (ListView) mActivity.findViewById(R.id.inner_list); local
57 assertEquals("Unexpected items in adapter", 0, list.getCount());
58 assertEquals("Unexpected children in list view", 0, list.getChildCount());
66 assertTrue("List not be visible after clicking button1", list.isShown());
67 assertTrue("List incorrect height", list.getHeight() == 200);
75 assertTrue("List not be visible after clicking button2", list.isShown())
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.capacity/ |
| resize_size_value.pass.cpp | 10 // <list>
14 #include <list>
22 std::list<double> l(5, 2);
26 assert(l == std::list<double>(2, 2));
29 std::list<double> l(5, 2);
38 std::list<double, min_allocator<double>> l(5, 2);
42 assert((l == std::list<double, min_allocator<double>>(2, 2)));
45 std::list<double, min_allocator<double>> l(5, 2);
|
