Searched refs:list (Results 476 - 500 of 4308) sorted by relevance

<<11121314151617181920>>

/external/oprofile/libpp/
H A Dpopulate.cpp34 list<profile_sample_files> const & files)
36 list<profile_sample_files>::const_iterator it = files.begin();
37 list<profile_sample_files>::const_iterator const end = files.end();
81 list<image_set>::const_iterator it
83 list<image_set>::const_iterator const end
H A Dpopulate_for_spu.cpp47 populate_spu_profile_from_files(list<profile_sample_files> const & files,
58 list<profile_sample_files>::const_iterator it = files.begin();
59 list<profile_sample_files>::const_iterator const end = files.end();
113 list < image_set >::const_iterator it=
115 list < image_set >::const_iterator const end
136 list<image_set>::const_iterator grp_it
138 list<image_set>::const_iterator const grp_end
142 list<profile_sample_files>::const_iterator sfiles_it =
144 list<profile_sample_files>::const_iterator sfiles_end =
/external/valgrind/main/drd/tests/
H A Dstd_list.cpp17 #include <list>
24 list<int *> ffList;
26 for (list<int*>::iterator ff = ffList.begin(); ff != ffList.end(); ff++) {
31 list<int *> ffList;
33 for (list<int*>::const_iterator ff = ffList.begin(); ff != ffList.end(); ff++) {
/external/qemu/distrib/ext4_utils/src/
H A Dallocate.c33 struct region_list list; member in struct:block_allocation
71 alloc->list.first = NULL;
72 alloc->list.last = NULL;
75 alloc->list.iter = NULL;
76 alloc->list.partial_iter = 0;
101 static void region_list_remove(struct region_list *list, struct region *reg) argument
109 if (list->first == reg)
110 list->first = reg->next;
112 if (list->last == reg)
113 list
119 region_list_append(struct region_list *list, struct region *reg) argument
609 advance_list_ptr(struct region_list *list, int blocks) argument
[all...]
/external/linux-tools-perf/perf-3.12.0/include/linux/
H A Dlist.h10 * Simple doubly linked list implementation.
24 static inline void INIT_LIST_HEAD(struct list_head *list) argument
26 list->next = list;
27 list->prev = list;
33 * This is only for internal list manipulation where we know
55 * @head: list head to add it after
69 * @head: list head to add it before
80 * Delete a list entr
153 list_move(struct list_head *list, struct list_head *head) argument
164 list_move_tail(struct list_head *list, struct list_head *head) argument
176 list_is_last(const struct list_head *list, const struct list_head *head) argument
233 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
259 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
273 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) argument
292 list_splice(const struct list_head *list, struct list_head *head) argument
304 list_splice_tail(struct list_head *list, struct list_head *head) argument
318 list_splice_init(struct list_head *list, struct list_head *head) argument
335 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/bison/src/
H A Dparse-gram.y117 symbol_list *list;
224 %type <list> symbols.1 symbols.prec generic_symlist generic_symlist_item
355 symbol_list *list;
356 for (list = $3; list; list = list->next)
357 symbol_list_destructor_set (list, &code);
367 symbol_list *list;
368 for (list
[all...]
/external/chromium_org/ui/file_manager/file_manager/foreground/css/
H A Dfile_types.css16 list:focus [selected] [file-type-icon],
17 list.autocomplete-suggestions [selected] [file-type-icon] {
30 list:focus [selected] [file-type-icon='archive'],
31 list.autocomplete-suggestions [selected] [file-type-icon='archive'] {
44 list:focus [selected] [file-type-icon='audio'],
45 list.autocomplete-suggestions [selected] [file-type-icon='audio'] {
58 list:focus [selected] [file-type-icon='excel'],
59 list.autocomplete-suggestions [selected] [file-type-icon='excel'] {
78 list:focus [selected] .shared[file-type-icon='folder'],
79 list
[all...]
/external/mesa3d/src/mesa/program/
H A Dprog_parameter.c76 * Free a parameter list and all its parameters
94 * Add a new parameter to a parameter list.
99 * \param paramList the list to add the parameter to
106 * \return index of new parameter in the list, or -1 if error (out of mem)
122 /* Need to grow the parameter list array (alloc some extra) */
185 * \return index of the new entry in the parameter list
198 * Add a new named constant to the parameter list.
202 * \param paramList the parameter list
205 * \return index/position of the new parameter in the parameter list
221 /* Same name and value is already in the param list
491 _mesa_lookup_parameter_constant(const struct gl_program_parameter_list *list, const gl_constant_value v[], GLuint vSize, GLint *posOut, GLuint *swizzleOut) argument
572 _mesa_clone_parameter_list(const struct gl_program_parameter_list *list) argument
617 struct gl_program_parameter_list *list; local
647 _mesa_num_parameters_of_type(const struct gl_program_parameter_list *list, gl_register_file type) argument
[all...]
/external/chromium_org/base/
H A Dobserver_list_threadsafe.h26 // A thread-safe container for a list of observers.
35 // * Observers can remove themselves from the observer list inside
38 // removing itself from the observer list, the notifications will
41 // The drawback of the threadsafe observer list is that notifications
106 // Add an observer to the list. An observer should not be added to
107 // the same list more than once.
114 ObserverList<ObserverType>* list = NULL;
120 list = &(observer_lists_[thread_id]->list);
122 list
132 ObserverList<ObserverType>* list = NULL; local
216 ObserverList<ObserverType> list; member in struct:ObserverListThreadSafe::ObserverListContext
[all...]
/external/chromium_org/tools/json_schema_compiler/
H A Dutil.h47 // Populates |out| with |list|. Returns false if there is no list at the
48 // specified key or if the list has anything other than |T|.
51 const base::ListValue& list, std::vector<T>* out) {
54 for (size_t i = 0; i < list.GetSize(); ++i) {
55 if (!GetItemFromList(list, i, &value))
63 // Populates |out| with |from|.|name|. Returns false if there is no list at
64 // the specified key or if the list has anything other than |T|.
70 const base::ListValue* list = NULL; local
71 if (!from.GetListWithoutPathExpansion(name, &list))
50 PopulateArrayFromList( const base::ListValue& list, std::vector<T>* out) argument
81 PopulateOptionalArrayFromList( const base::ListValue& list, scoped_ptr<std::vector<T> >* out) argument
105 const base::ListValue* list = NULL; local
163 base::ListValue* list = new base::ListValue(); local
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dtipc_config.h12 * notice, this list of conditions and the following disclaimer.
14 * notice, this list of conditions and the following disclaimer in the
298 * A TLV list descriptor simplifies processing of messages
304 __u32 tlv_space; /* # bytes from curr TLV to list end */
307 static inline void TLV_LIST_INIT(struct tlv_list_desc *list, argument
310 list->tlv_ptr = (struct tlv_desc *)data;
311 list->tlv_space = space;
314 static inline int TLV_LIST_EMPTY(struct tlv_list_desc *list) argument
316 return (list->tlv_space == 0);
319 static inline int TLV_LIST_CHECK(struct tlv_list_desc *list, __u1 argument
324 TLV_LIST_DATA(struct tlv_list_desc *list) argument
329 TLV_LIST_STEP(struct tlv_list_desc *list) argument
[all...]
/external/chromium_org/third_party/skia/src/core/
H A DSkTLList.h16 inline void* operator new(size_t, SkTLList<T>* list,
20 /** Doubly-linked list of objects. The objects' lifetimes are controlled by the list. I.e. the
21 the list creates the objects and they are deleted upon removal. This class block-allocates
24 Elements of the list can be constructed in place using the following macros:
25 SkNEW_INSERT_IN_LLIST_BEFORE(list, location, type_name, args)
26 SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args)
27 where list is a SkTLList<type_name>*, location is an iterator, and args is the paren-surrounded
105 /** Adds a new element to the list before the location indicated by the iterator. If the
111 /** Adds a new element to the list afte
201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) argument
205 init(const SkTLList& list, IterStart start = kHead_IterStart) argument
369 operator new(size_t, SkTLList<T>* list, typename SkTLList<T>::Placement placement, const typename SkTLList<T>::Iter& location) argument
[all...]
/external/skia/src/core/
H A DSkTLList.h16 inline void* operator new(size_t, SkTLList<T>* list,
20 /** Doubly-linked list of objects. The objects' lifetimes are controlled by the list. I.e. the
21 the list creates the objects and they are deleted upon removal. This class block-allocates
24 Elements of the list can be constructed in place using the following macros:
25 SkNEW_INSERT_IN_LLIST_BEFORE(list, location, type_name, args)
26 SkNEW_INSERT_IN_LLIST_AFTER(list, location, type_name, args)
27 where list is a SkTLList<type_name>*, location is an iterator, and args is the paren-surrounded
105 /** Adds a new element to the list before the location indicated by the iterator. If the
111 /** Adds a new element to the list afte
201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) argument
205 init(const SkTLList& list, IterStart start = kHead_IterStart) argument
369 operator new(size_t, SkTLList<T>* list, typename SkTLList<T>::Placement placement, const typename SkTLList<T>::Iter& location) argument
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/
H A DParser.java161 ArrayList list = new ArrayList();
162 list.add(this.lexer.next());
163 push(this.action[1], list);
171 ArrayList list = new0();
172 push(goTo(0), list);
177 ArrayList list = new1();
178 push(goTo(0), list);
183 ArrayList list = new2();
184 push(goTo(0), list);
189 ArrayList list
[all...]
/external/chromium_org/chrome/browser/profile_resetter/
H A Dresettable_settings_snapshot.cc47 void AddPair(base::ListValue* list, argument
53 list->Append(results);
168 base::ListValue* list = new base::ListValue; local
172 list->AppendString(i->spec());
173 dict.Set(kStartupURLPath, list);
187 base::ListValue* list = new base::ListValue; local
195 list->AppendString(i->first + ";" + ext_name);
197 dict.Set(kEnabledExtensions, list);
201 base::ListValue* list = new base::ListValue; local
209 list
[all...]
/external/chromium_org/net/base/
H A Daddress_list_unittest.cc67 AddressList list = AddressList::CreateFromAddrinfo(&ai[0]); local
69 ASSERT_EQ(kNumElements, list.size());
70 for (size_t i = 0; i < list.size(); ++i) {
71 EXPECT_EQ(ADDRESS_FAMILY_IPV4, list[i].GetFamily());
73 EXPECT_EQ(i, list[i].address()[0]);
74 EXPECT_EQ(static_cast<int>(i << 2), list[i].port());
79 copy = list;
85 EXPECT_EQ(1u, list[1].address()[0]);
86 EXPECT_EQ(1 << 2, list[1].port());
122 // Construct a list o
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/weborigin/
H A DSecurityPolicy.cpp9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
98 if (OriginAccessWhiteList* list = originAccessMap().get(activeOrigin->toString())) {
99 for (size_t i = 0; i < list->size(); ++i) {
100 if (list->at(i).matchesOrigin(*targetOrigin) != OriginAccessEntry::DoesNotMatchOrigin)
125 OriginAccessWhiteList* list = result.storedValue->value.get(); local
126 list->append(OriginAccessEntry(destinationProtocol, destinationDomain, allowDestinationSubdomains ? OriginAccessEntry::AllowSubdomains : OriginAccessEntry::DisallowSubdomains, OriginAccessEntry::TreatIPAddressAsIPAddress));
142 OriginAccessWhiteList* list = it->value.get();
143 size_t index = list->find(OriginAccessEntry(destinationProtocol, destinationDomain, allowDestinationSubdomains ? OriginAccessEntry::AllowSubdomains : OriginAccessEntry::DisallowSubdomains, OriginAccessEntry::TreatIPAddressAsIPAddress));
147 list
[all...]
/external/chromium_org/ui/events/
H A Devent_dispatcher.cc158 void EventDispatcher::DispatchEventToEventHandlers(EventHandlerList* list, argument
160 for (EventHandlerList::const_iterator it = list->begin(),
161 end = list->end(); it != end; ++it) {
165 while (!list->empty()) {
166 EventHandler* handler = (*list->begin());
170 if (!list->empty() && *list->begin() == handler) {
172 // have been removed from the list).
175 list->erase(list
[all...]
/external/nist-sip/java/gov/nist/core/
H A DMultiValueMapImpl.java64 ArrayList list = (ArrayList) (keyValuePair.getValue());
65 if (list.contains(value))
76 ArrayList list = (ArrayList) (keyValuePair.getValue());
77 list.clear();
89 ArrayList list = (ArrayList) (keyValuePair.getValue());
91 Object[] values = list.toArray();
126 ArrayList<V> list = this.map.get(key);
127 if (list == null) {
130 return list.remove(item);
/external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
H A Dsctp_auth.h10 * this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in
75 /* authentication chunks list */
81 /* hmac algos supported list */
105 #define sctp_auth_is_required_chunk(chunk, list) ((list == NULL) ? (0) : (list->chunks[chunk] != 0))
116 extern int sctp_auth_add_chunk(uint8_t chunk, sctp_auth_chklist_t *list);
117 extern int sctp_auth_delete_chunk(uint8_t chunk, sctp_auth_chklist_t *list);
118 extern size_t sctp_auth_get_chklist_size(const sctp_auth_chklist_t *list);
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DLists.java85 * @param elements the elements that the list should contain, in order
93 ArrayList<E> list = new ArrayList<E>(capacity);
94 Collections.addAll(list, elements);
95 return list;
112 * @param elements the elements that the list should contain, in order
131 * @param elements the elements that the list should contain, in order
137 ArrayList<E> list = newArrayList();
139 list.add(elements.next());
141 return list;
149 * <p><b>Note:</b> if you know the exact size your list wil
483 partition(List<T> list, int size) argument
492 final List<T> list; field in class:Lists.Partition
495 Partition(List<T> list, int size) argument
524 RandomAccessPartition(List<T> list, int size) argument
728 reverse(List<T> list) argument
891 hashCodeImpl(List<?> list) argument
902 equalsImpl(List<?> list, @Nullable Object object) argument
919 addAllImpl( List<E> list, int index, Iterable<? extends E> elements) argument
933 indexOfImpl(List<?> list, @Nullable Object element) argument
946 lastIndexOfImpl(List<?> list, @Nullable Object element) argument
959 listIteratorImpl(List<E> list, int index) argument
966 subListImpl( final List<E> list, int fromIndex, int toIndex) argument
[all...]
/external/guava/guava-tests/test/com/google/common/primitives/
H A DBytesTest.java181 List<Byte> list = Bytes.asList(VALUES).subList(0, i);
184 misleadingSize.addAll(list);
195 List<Byte> list = Arrays.asList((byte) 0, (byte) 1, null);
197 Bytes.toArray(list);
205 List<Byte> list = Bytes.asList(array);
206 list.set(0, (byte) 2);
209 assertEquals(Arrays.asList((byte) 2, (byte) 3), list);
214 List<Byte> list = Bytes.asList(array);
215 byte[] newArray = Bytes.toArray(list);
218 list
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Duniset.cpp146 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
155 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
156 if(list!=NULL){
157 list[0] = UNICODESET_HIGH;
173 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
182 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
183 if(list!=NULL){
184 list[0] = UNICODESET_HIGH;
198 len(0), capacity(o.isFrozen() ? o.len : o.len + GROW_EXTRA), list(0),
209 list
[all...]
/external/icu/icu4c/source/common/
H A Duniset.cpp146 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
155 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
156 if(list!=NULL){
157 list[0] = UNICODESET_HIGH;
173 len(1), capacity(1 + START_EXTRA), list(0), bmpSet(0), buffer(0),
182 list = (UChar32*) uprv_malloc(sizeof(UChar32) * capacity);
183 if(list!=NULL){
184 list[0] = UNICODESET_HIGH;
198 len(0), capacity(o.isFrozen() ? o.len : o.len + GROW_EXTRA), list(0),
209 list
[all...]
/external/chromium_org/chrome/browser/resources/about_sys/
H A Dabout_sys.css82 .list {
89 .list:not(.filtered) tr:nth-child(odd) td {
93 .list td {
101 .list tr td:nth-last-child(1),
102 .list tr th:nth-last-child(1) {
106 .list:not(.filtered) .tab .name {
110 .list .name {
114 .list .button-cell {
118 .list .name div {

Completed in 693 milliseconds

<<11121314151617181920>>