/external/v8/test/webkit/ |
H A D | char-at.js | 116 var item = cases[i]; 118 if (item[1] == "omitted") { 119 shouldBe('"' + item[0] + '".charAt()', result[0]); 121 shouldBeNaN('"' + item[0] + '".charCodeAt()'); 123 shouldBe('"' + item[0] + '".charCodeAt()', result[1]); 125 shouldBe('"' + item[0] + '".charAt(' + item[1] + ')', result[0]); 127 shouldBeNaN('"' + item[0] + '".charCodeAt(' + item[1] + ')'); 129 shouldBe('"' + item[ [all...] |
/external/clang/test/CodeGen/ |
H A D | 2003-11-19-AddressOfRegister.c | 3 struct item { struct 8 register struct item *aa;
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Misc/ |
H A D | ListStack`1.cs | 47 T item; 48 if (!TryPeek(depth, out item)) 51 return item; 54 public bool TryPeek(out T item) argument 56 return TryPeek(0, out item); 59 public bool TryPeek(int depth, out T item) argument 63 item = default(T); 67 item = this[Count - depth - 1]; 80 public bool TryPop(out T item) argument 84 item 93 Push(T item) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | list.h | 28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 30 item->next = list->next; 31 item->prev = list; 32 list->next->prev = item; 33 list->next = item; 36 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 38 dl_list_add(list->prev, item); 41 static inline void dl_list_del(struct dl_list *item) argument 43 item->next->prev = item 56 struct dl_list *item; local [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | list.h | 28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 30 item->next = list->next; 31 item->prev = list; 32 list->next->prev = item; 33 list->next = item; 36 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 38 dl_list_add(list->prev, item); 41 static inline void dl_list_del(struct dl_list *item) argument 43 item->next->prev = item 56 struct dl_list *item; local [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | list.h | 28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 30 item->next = list->next; 31 item->prev = list; 32 list->next->prev = item; 33 list->next = item; 36 static inline void dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 38 dl_list_add(list->prev, item); 41 static inline void dl_list_del(struct dl_list *item) argument 43 item->next->prev = item 56 struct dl_list *item; local [all...] |
/external/google-breakpad/src/processor/ |
H A D | simple_serializer.h | 51 // Calculate and return the size of the 'item'. 52 static size_t SizeOf(const Type &item) { return sizeof(item); } argument 53 // Write 'item' to memory location 'dest', and return to the "end" address of 55 static char *Write(const Type &item, char *dest) { argument 56 new (dest) Type(item); 57 return dest + SizeOf(item);
|
/external/boringssl/src/ssl/pqueue/ |
H A D | pqueue.c | 72 pitem *item = (pitem *)OPENSSL_malloc(sizeof(pitem)); local 73 if (item == NULL) { 77 memcpy(item->priority, prio64be, sizeof(item->priority)); 79 item->data = data; 80 item->next = NULL; 82 return item; 85 void pitem_free(pitem *item) { argument 86 if (item == NULL) { 90 OPENSSL_free(item); 128 pitem *item = pq->items; local 140 pqueue_next(piterator *item) argument 153 pqueue_insert(pqueue_s *pq, pitem *item) argument 190 pitem *item = pq->items; local [all...] |
H A D | pqueue_test.c | 25 pitem *item = pqueue_pop(q); local 26 if (item == NULL) { 29 pitem_free(item); 41 pitem *item = pitem_new(priority, &data); local 42 if (item == NULL || 43 pqueue_insert(q, item) != item || 45 pqueue_peek(q) != item || 46 pqueue_pop(q) != item || 51 pitem_free(item); 66 pitem *curr, *item; local [all...] |
/external/v8/test/mjsunit/regress/ |
H A D | regress-145201.js | 35 function item(operator) { 77 item('^'); 78 item('~'); 79 item('<<'); 80 item('<'); 81 item('=='); 82 item('>>>'); 83 item('>>'); 84 item('|'); 85 item(' [all...] |
H A D | regress-2568.js | 29 return a.map(function(item) { return item[key]; }); 35 return a.map(function(item) { return item[key]; }); 41 return a.map(function(item) { return item[key]; });
|
/external/emma/core/java12/com/vladium/emma/report/ |
H A D | AbstractItemVisitor.java | 20 public Object visit (final AllItem item, final Object ctx) argument 25 public Object visit (final PackageItem item, final Object ctx) argument 30 public Object visit (final SrcFileItem item, final Object ctx) argument 35 public Object visit (final ClassItem item, final Object ctx) argument 40 public Object visit (final MethodItem item, final Object ctx) argument
|
H A D | IItemVisitor.java | 19 Object visit (AllItem item, Object ctx); argument 20 Object visit (PackageItem item, Object ctx); argument 21 Object visit (SrcFileItem item, Object ctx); argument 22 Object visit (ClassItem item, Object ctx); argument 23 Object visit (MethodItem item, Object ctx); argument
|
/external/openfst/src/include/fst/ |
H A D | union-find.h | 43 // Finds the representative of the set 'item' belongs to. 45 T FindSet(T item) { argument 46 if (item >= parent_.size() 47 || item == fail_ 48 || parent_[item] == fail_) return fail_; 50 T *p = &parent_[item]; 51 for (; *p != item; item = *p, p = &parent_[item]) { 66 // 'item' 67 MakeSet(T item) argument [all...] |
/external/selinux/libsepol/cil/src/ |
H A D | cil_list.c | 62 struct cil_list_item *item = (*list)->head; local 64 while (item != NULL) 66 next = item->next; 67 if (item->flavor == CIL_LIST) { 68 cil_list_destroy((struct cil_list**)&(item->data), destroy_data); 69 free(item); 71 cil_list_item_destroy(&item, destroy_data); 73 item = next; 79 void cil_list_item_init(struct cil_list_item **item) argument 86 *item 89 cil_list_item_destroy(struct cil_list_item **item, unsigned destroy_data) argument 100 struct cil_list_item *item; local 122 struct cil_list_item *item; local 144 struct cil_list_item *item; local 171 cil_list_append_item(struct cil_list *list, struct cil_list_item *item) argument 198 cil_list_prepend_item(struct cil_list *list, struct cil_list_item *item) argument 226 struct cil_list_item *item; local [all...] |
/external/mesa3d/src/gallium/drivers/r600/ |
H A D | compute_memory_pool.c | 129 struct compute_memory_item *item; local 136 for (item = pool->item_list; item; item = item->next) { 137 if (item->start_in_dw > -1) { 138 if (item->start_in_dw-last_end > size_in_dw) { 142 last_end = item->start_in_dw + item->size_in_dw; 161 struct compute_memory_item* item; local 251 struct compute_memory_item *item, *next; local 353 struct compute_memory_item *item, *next; local [all...] |
/external/libdrm/amdgpu/ |
H A D | util_hash_table.c | 102 struct util_hash_table_item *item; local 106 item = (struct util_hash_table_item *)util_hash_iter_data(iter); 107 if (!ht->compare(item->key, key)) 120 struct util_hash_table_item *item; local 124 item = (struct util_hash_table_item *)util_hash_iter_data(iter); 125 if (!ht->compare(item->key, key)) 126 return item; 137 struct util_hash_table_item *item; local 146 item = util_hash_table_find_item(ht, key, key_hash); 147 if(item) { 170 struct util_hash_table_item *item; local 189 struct util_hash_table_item *item; local 211 struct util_hash_table_item *item; local 230 struct util_hash_table_item *item; local 247 struct util_hash_table_item *item; local [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_hash_table.c | 107 struct util_hash_table_item *item; local 111 item = (struct util_hash_table_item *)cso_hash_iter_data(iter); 112 if (!ht->compare(item->key, key)) 127 struct util_hash_table_item *item; local 131 item = (struct util_hash_table_item *)cso_hash_iter_data(iter); 132 if (!ht->compare(item->key, key)) 133 return item; 147 struct util_hash_table_item *item; local 156 item = util_hash_table_find_item(ht, key, key_hash); 157 if(item) { 185 struct util_hash_table_item *item; local 207 struct util_hash_table_item *item; local 231 struct util_hash_table_item *item; local 253 struct util_hash_table_item *item; local 277 struct util_hash_table_item *item; local [all...] |
/external/esd/include/ |
H A D | aupvlist.h | 50 int AUpvsetparam (AUpvlist, int item, int param); 51 int AUpvsetvaltype (AUpvlist, int item, int type); 52 int AUpvsetval (AUpvlist, int item, void *val); 53 int AUpvgetparam (AUpvlist, int item, int *param); 54 int AUpvgetvaltype (AUpvlist, int item, int *type); 55 int AUpvgetval (AUpvlist, int item, void *val);
|
/external/chromium-trace/catapult/third_party/gsutil/third_party/crcmod/docs/source/ |
H A D | make_predefined_table.py | 34 item = "%s" % (defn[key],) variable 36 item = "0x%0*X" % (hex_width, defn[key]) variable 38 item = "``%s``" % (defn[key]) variable 40 item = ' '.join([item, '[#ccitt]_']) variable 41 item = "%-*s" % (width, item) variable 42 defn_data_list.append(item)
|
/external/lzma/CPP/Windows/Control/ |
H A D | ListView.cpp | 25 LVITEM item;
local 26 item.iItem = index;
27 item.iSubItem = 0;
28 item.mask = LVIF_PARAM;
29 bool aResult = GetItem(&item);
30 param = item.lParam;
46 LVITEM item;
local 47 item.mask = LVIF_TEXT | LVIF_PARAM;
48 item.iItem = index;
49 item 57 LVITEM item; local 79 LVITEMW item; local 90 LVITEMW item; local [all...] |
/external/autotest/client/common_lib/cros/ |
H A D | tpm_utils.py | 35 for item in lines: 36 item = item.split(':') 37 if not item[0]: 39 if len(item) == 1: 40 item.append('') 41 item = map(lambda x : x.strip(), item) 42 item[1] = True if item[ [all...] |
/external/emma/ |
H A D | build.gradle | 23 item('lib/emma.jar') { 26 item('lib/emma_ant.jar') {
|
/external/hamcrest/src/org/hamcrest/ |
H A D | Matcher.java | 24 * Evaluates the matcher for argument <var>item</var>. 31 * @param item the object against which the matcher is evaluated. 32 * @return <code>true</code> if <var>item</var> matches, otherwise <code>false</code>. 36 boolean matches(Object item); argument
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/util/ |
H A D | Visitor.java | 19 public void doAt(Object item) { argument 20 if (item instanceof Collection) { 21 doAt((Collection) item); 22 } else if (item instanceof Map) { 23 doAt((Map) item); 24 } else if (item instanceof Object[]) { 25 doAt((Object[]) item); 26 } else if (item instanceof UnicodeSet) { 27 doAt((UnicodeSet) item); 29 doSimpleAt(item); 33 count(Object item) argument 129 doBefore(Object container, Object item) argument 131 doAfter(Object container, Object item) argument [all...] |