/external/wpa_supplicant_8/wpa_supplicant/src/wps/ |
H A D | wps_upnp_event.c | 49 struct dl_list list; member in struct:wps_event_ 89 e = dl_list_first(&s->event_queue, struct wps_event_, list); 93 dl_list_del(&e->list); 140 dl_list_add(&s->event_queue, &e->list); 194 dl_list_del(&e->addr->list); 202 dl_list_del(&s->list); 290 dl_list_for_each(e->addr, &s->addr_list, struct subscr_addr, list) 323 list) { 408 dl_list_init(&e->list); 420 dl_list_add_tail(&s->event_queue, &e->list); [all...] |
/external/chromium/chrome/browser/prefs/ |
H A D | pref_member_unittest.cc | 22 const char kListPref[] = "list"; 185 // Test list 186 ListPrefMember list; local 187 list.Init(kListPref, &prefs, NULL); 194 ASSERT_TRUE(list.GetValue() != NULL); 195 EXPECT_EQ(0u, list.GetValue()->GetSize()); 196 EXPECT_TRUE(list.GetValue()->empty()); 197 ASSERT_TRUE(*list != NULL); 198 EXPECT_EQ(0u, (*list)->GetSize()); 199 EXPECT_TRUE((*list) [all...] |
/external/webkit/Source/WebCore/platform/gtk/ |
H A D | PasteboardHelper.cpp | 64 uriListAtom = gdk_atom_intern("text/uri-list", FALSE); 194 GtkTargetList* list = gtk_target_list_new(0, 0); local 197 gtk_target_list_add_text_targets(list, getIdForTargetType(TargetTypeText)); 200 gtk_target_list_add(list, markupAtom, 0, getIdForTargetType(TargetTypeMarkup)); 203 gtk_target_list_add_uri_targets(list, getIdForTargetType(TargetTypeURIList)); 204 gtk_target_list_add(list, netscapeURLAtom, 0, getIdForTargetType(TargetTypeNetscapeURL)); 208 gtk_target_list_add_image_targets(list, getIdForTargetType(TargetTypeImage), TRUE); 210 return list; 232 // Give preference to text/uri-list here, as it can hold more 251 GRefPtr<GtkTargetList> list(gtk_target_list_ne 292 GtkTargetList* list = targetListForDataObject(dataObject); local [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | icount.c | 34 * one, and then use a sorted list to store the counts for inodes 38 * in the sorted list, to speed up the use of this abstraction by 40 * so this extra bitmap avoids searching the sorted list to see if a 41 * particular inode is on the sorted list already. 57 struct ext2_icount_el *list; member in struct:ext2_icount 78 if (icount->list) 79 ext2fs_free_mem(&icount->list); 250 &icount->list); 253 memset(icount->list, 0, bytes); 259 * Populate the sorted list wit [all...] |
/external/kernel-headers/original/linux/ |
H A D | list.h | 12 * Simple doubly linked list implementation. 30 static inline void INIT_LIST_HEAD(struct list_head *list) argument 32 list->next = list; 33 list->prev = list; 39 * This is only for internal list manipulation where we know 55 * @head: list head to add it after 68 * @head: list head to add it before 81 * This is only for internal list manipulatio 249 list_move(struct list_head *list, struct list_head *head) argument 260 list_move_tail(struct list_head *list, struct list_head *head) argument 272 list_is_last(const struct list_head *list, const struct list_head *head) argument 306 __list_splice(struct list_head *list, struct list_head *head) argument 325 list_splice(struct list_head *list, struct list_head *head) argument 338 list_splice_init(struct list_head *list, struct list_head *head) argument [all...] |
/external/apache-harmony/auth/src/test/java/common/javax/security/auth/x500/ |
H A D | X500PrincipalTest.java | 1948 TestList list = new TestList(); 1950 list.add("", "", "", "", new byte[] { 0x30, 0x00 }); // empty RDN sequence 1953 list.add("CN=A,C=B", "CN=A,C=B", "CN=A, C=B", "cn=a,c=b"); 1954 list.add("C=B,CN=A", "C=B,CN=A", "C=B, CN=A", "c=b,cn=a"); 1955 list.add("CN=A,CN=A", "CN=A,CN=A", "CN=A, CN=A", "cn=a,cn=a"); // duplicate RDNs 1958 list.add("CN=A , C=B", "CN=A,C=B", "CN=A, C=B"); 1959 list.add("CN=A , C=B", "CN=A,C=B", "CN=A, C=B"); 1960 list.add("CN=A;C=B", "CN=A,C=B", "CN=A, C=B"); 1961 list.add("CN=A ; C=B", "CN=A,C=B", "CN=A, C=B"); 1962 //FIXME list [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | OrderingTest.java | 141 List<Integer> list = Arrays.asList(0, 3, 5, 6, 7, 8, 9); 142 Collections.sort(list, c); 143 ASSERT.that(list).hasContentsInOrder(8, 6, 7, 5, 3, 0, 9); 158 List<Object> list = Lists.newArrayList(); 160 list.add(new Object()); 164 Collections.sort(list, arbitrary); 166 // Now we don't care what order it's put the list in, only that 168 Helpers.testComparator(arbitrary, list); 174 List<Integer> list = Lists.newArrayList(); 176 list 683 testExhaustively( Ordering<? super T> ordering, List<T> list) argument [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_interface_ann.cc | 89 static void AddExpectRace(ExpectRace *list, argument 91 ExpectRace *race = list->next; 92 for (; race != list; race = race->next) { 109 race->prev = list; 110 race->next = list->next; 112 list->next = race; 115 static ExpectRace *FindRace(ExpectRace *list, uptr addr, uptr size) { argument 116 for (ExpectRace *race = list->next; race != list; race = race->next) { 125 static bool CheckContains(ExpectRace *list, upt argument 137 InitList(ExpectRace *list) argument [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | SortedMapInterfaceTest.java | 182 List<E> list, int fromIndex, int toIndex) { 185 subList.add(list.get(i)); 197 List<Entry<K, V>> list = toList(map.entrySet()); 198 for (int i = 0; i < list.size(); i++) { 199 List<Entry<K, V>> expected = subListSnapshot(list, 0, i); 200 SortedMap<K, V> headMap = map.headMap(list.get(i).getKey()); 212 List<Entry<K, V>> list = toList(map.entrySet()); 213 for (int i = 0; i < list.size(); i++) { 214 List<Entry<K, V>> expected = subListSnapshot(list, i, list 181 subListSnapshot( List<E> list, int fromIndex, int toIndex) argument [all...] |
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/io/ |
H A D | ObjectInputStream2Test.java | 76 assertTrue("should construct super", A.list.contains(b)); 77 assertFalse("should not construct self", B.list.contains(b)); 122 static final ArrayList<A> list = new ArrayList<A>(); field in class:ObjectInputStream2Test.A 128 list.add(this); 134 static final ArrayList<A> list = new ArrayList<A>(); field in class:ObjectInputStream2Test.B 139 list.add(this);
|
/external/bzip2/ |
H A D | bzip.css | 41 list-style: url("/images/li-blue.png"); 47 list-style-type: none; 48 list-style-image: none;
|
/external/icu4c/data/misc/ |
H A D | miscfiles.mk | 3 # A list of txt's to build 15 # * To add an additional file to the list: 19 # * To REPLACE the default list and only build a subset of files:
|
/external/icu4c/data/sprep/ |
H A D | sprepfiles.mk | 3 # A list of txt's to build 15 # * To add an additional locale to the list: 19 # * To REPLACE the default list and only build a subset of files:
|
/external/iproute2/testsuite/tests/ |
H A D | policer | 6 $TC qdisc list dev $DEV 7 $TC filter list dev $DEV parent 10:0 9 $TC qdisc list dev $DEV
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
H A D | ACallCommand.java | 78 public void setMacro(List<TWord> list) argument 81 this._macro_.addAll(list); 82 for(TWord e : list) 98 public void setArguments(List<PExpression> list) argument 101 this._arguments_.addAll(list); 102 for(PExpression e : list)
|
H A D | ADefCommand.java | 83 public void setMacro(List<TWord> list) argument 86 this._macro_.addAll(list); 87 for(TWord e : list) 103 public void setArguments(List<PVariable> list) argument 106 this._arguments_.addAll(list); 107 for(PVariable e : list)
|
/external/oprofile/daemon/ |
H A D | opd_cookie.c | 93 struct list_head list; member in struct:cookie_entry 143 entry = list_entry(pos, struct cookie_entry, list); 150 list_add(&entry->list, &hashes[hash]); 166 entry = list_entry(pos, struct cookie_entry, list); 172 list_add(&entry->list, &hashes[hash]); 191 entry = list_entry(pos, struct cookie_entry, list);
|
/external/protobuf/java/src/main/java/com/google/protobuf/ |
H A D | ByteString.java | 10 // notice, this list of conditions and the following disclaimer. 12 // copyright notice, this list of conditions and the following disclaimer 142 * Concatenates all byte strings in the list and returns the result. 145 * If the list is empty, the returned object is the singleton empty 146 * {@code ByteString}. If the list has only one element, that 149 public static ByteString copyFrom(List<ByteString> list) { argument 150 if (list.size() == 0) { 152 } else if (list.size() == 1) { 153 return list.get(0); 157 for (ByteString str : list) { [all...] |
/external/webkit/Source/WebCore/css/ |
H A D | MediaList.cpp | 179 Vector<String> list; local 180 value.split(',', list); 181 Vector<String>::const_iterator end = list.end(); 182 for (Vector<String>::const_iterator it = list.begin(); it != end; ++it) { 201 if (!m_fallback && list.begin() == list.end()) {
|
/external/webrtc/src/system_wrappers/source/ |
H A D | list_stl.cc | 55 // Remove all remaining list items. 125 std::list<ListItem*>::iterator item_iter = list_.begin(); 137 // std::list::end() addresses the last item + 1. Decrement so that the 139 std::list<ListItem*>::iterator item_iter = list_.end(); 152 std::list<ListItem*>::iterator item_iter = item->this_iter_; 169 std::list<ListItem*>::iterator item_iter = item->this_iter_; 183 // Allow existingPreviousItem to be NULL if the list is empty. 196 std::list<ListItem*>::iterator insert_location = list_.begin(); 213 // Allow existing_next_item to be NULL if the list is empty. 225 std::list<ListIte [all...] |
/external/wpa_supplicant_6/wpa_supplicant/src/drivers/ |
H A D | MobileApple80211.c | 39 static int (*__Apple80211GetIfListCopy)(Apple80211Ref handle, CFArrayRef *list) 42 int Apple80211GetIfListCopy(Apple80211Ref handle, CFArrayRef *list) argument 44 return __Apple80211GetIfListCopy(handle, list); 94 static int (*__Apple80211Scan)(Apple80211Ref handle, CFArrayRef *list, 97 int Apple80211Scan(Apple80211Ref handle, CFArrayRef *list, argument 100 return __Apple80211Scan(handle, list, parameters);
|
/external/stlport/stlport/stl/ |
H A D | _list.h | 220 # define list _STLP_PTR_IMPL_NAME(list) macro 222 # define list _STLP_NON_DBG_NAME(list) macro 228 class list; 230 #if !defined (list) 236 void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred); 239 void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred); 242 void _S_merge(list<_Tp, _Alloc>& __that, list<_T 253 class list : public _STLP_PRIV _List_base<_Tp, _Alloc> class in inherits:_STLP_PRIV_List_base,__stlport_class 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type), function in class:list 324 list(_InputIterator __first, _InputIterator __last, function in class:list 331 list(_InputIterator __first, _InputIterator __last) function in class:list 336 list(const value_type* __first, const value_type* __last, function in class:list 340 list(const_iterator __first, const_iterator __last, function in class:list 347 explicit list(const allocator_type& __a = allocator_type()) function in class:list 355 list(const _Self& __x) : _STLP_PRIV _List_base<_Tp, _Alloc>(__x.get_allocator()) function in class:list 359 list(__move_source<_Self> src) function in class:list 684 # undef list macro 706 operator ==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) argument [all...] |
/external/chromium/chrome/browser/policy/ |
H A D | user_policy_cache.cc | 254 ListValue* list = new ListValue; local 257 list->Append(Value::CreateBooleanValue(*i)); 258 return list; 261 ListValue* list = new ListValue; local 267 list->Append(int_value); 269 return list; 272 ListValue* list = new ListValue; local 276 list->Append(Value::CreateStringValue(*i)); 277 return list; 280 ListValue* list local [all...] |
/external/chromium/chrome/common/net/ |
H A D | test_url_fetcher_factory.h | 9 #include <list> 72 const std::list<std::string>& upload_chunks() const { return chunks_; } 80 std::list<std::string> chunks_;
|
/external/chromium/net/http/ |
H A D | http_auth_cache.h | 9 #include <list> 26 // - the list of paths which used this realm 64 // paths list. 71 // space; this will be added to the list of known paths. 106 typedef std::list<Entry> EntryList; 155 typedef std::list<std::string> PathList;
|