/external/wpa_supplicant_8/src/utils/ |
H A D | edit.c | 178 struct edit_history *h, *match = NULL, *last = NULL; local 189 last = h; 200 if (count >= HISTORY_MAX && last) { 201 dl_list_del(&last->list); 202 os_free(last); 561 static enum edit_key_code esc_seq_to_key1_no(char last) argument 563 switch (last) { 578 static enum edit_key_code esc_seq_to_key1_shift(char last) argument 580 switch (last) { 595 static enum edit_key_code esc_seq_to_key1_alt(char last) argument 612 esc_seq_to_key1_alt_shift(char last) argument 629 esc_seq_to_key1_ctrl(char last) argument 646 esc_seq_to_key1(int param1, int param2, char last) argument 700 esc_seq_to_key2(int param1, int param2, char last) argument 728 char last, *pos; local [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | edit.c | 178 struct edit_history *h, *match = NULL, *last = NULL; local 189 last = h; 200 if (count >= HISTORY_MAX && last) { 201 dl_list_del(&last->list); 202 os_free(last); 561 static enum edit_key_code esc_seq_to_key1_no(char last) argument 563 switch (last) { 578 static enum edit_key_code esc_seq_to_key1_shift(char last) argument 580 switch (last) { 595 static enum edit_key_code esc_seq_to_key1_alt(char last) argument 612 esc_seq_to_key1_alt_shift(char last) argument 629 esc_seq_to_key1_ctrl(char last) argument 646 esc_seq_to_key1(int param1, int param2, char last) argument 700 esc_seq_to_key2(int param1, int param2, char last) argument 728 char last, *pos; local [all...] |
/external/libcap-ng/libcap-ng-0.7/src/test/ |
H A D | lib_test.c | 32 int rc, i, len, last = CAP_LAST_CAP; local 52 if (len < 80 && last > 30) // The kernel & headers are mismatched 53 last = 30; 60 printf("Doing advanced bit tests for %d capabilities...\n", last); 61 for (i=0; i<=last; i++) {
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkPathOpsSimplify.cpp | 79 SkOpSpan* last = current->markAndChaseDoneUnary(index, endIndex); local 80 if (last && !last->fChased && !last->fLoop) { 81 last->fChased = true; 82 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last)); 83 // assert that last isn't already in array 84 *chase.append() = last; 87 last->fOther->span(last [all...] |
/external/skia/src/pathops/ |
H A D | SkPathOpsSimplify.cpp | 79 SkOpSpan* last = current->markAndChaseDoneUnary(index, endIndex); local 80 if (last && !last->fChased && !last->fLoop) { 81 last->fChased = true; 82 SkASSERT(!SkPathOpsDebug::ChaseContains(chase, last)); 83 // assert that last isn't already in array 84 *chase.append() = last; 87 last->fOther->span(last [all...] |
/external/checkpolicy/ |
H A D | queue.c | 146 queue_node_ptr_t p, last, temp; local 152 last = NULL; 157 if (last) { 158 last->next = p->next; 159 if (last->next == NULL) 160 q->tail = last; 172 last = p;
|
/external/chromium_org/base/memory/ |
H A D | scoped_vector.h | 107 // Lets the ScopedVector take ownership of elements in [first,last). 109 void insert(iterator position, InputIterator first, InputIterator last) { argument 110 v_.insert(position, first, last); 118 iterator erase(iterator first, iterator last) { argument 119 STLDeleteContainerPointers(first, last); 120 return v_.erase(first, last); 128 // Like |erase()|, but doesn't delete the elements in [first, last). 129 iterator weak_erase(iterator first, iterator last) { argument 130 return v_.erase(first, last);
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | unicodelctest-no-optimization.js | 74 function rc(last) { 86 if (rand() & 1) c = last + (rand() & 15) - 8; 98 var last = rand(); 100 ranges.push(last); 101 last = rc(last); 111 var negated = (last & 2) != 0;
|
H A D | unicodelctest.js | 73 function rc(last) { 85 if (rand() & 1) c = last + (rand() & 15) - 8; 96 var last = rand(); 98 ranges.push(last); 99 last = rc(last); 109 var negated = (last & 2) != 0;
|
/external/qemu/hw/android/goldfish/ |
H A D | events_device.c | 62 unsigned last; member in struct:__anon29646 101 QFIELD_INT32(last), 124 int enqueued = s->last - s->first; 134 if(s->first == s->last) { 144 s->events[s->last] = type; 145 s->last = (s->last + 1) & (MAX_EVENTS-1); 146 s->events[s->last] = code; 147 s->last = (s->last [all...] |
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-set-private.hh | 203 hb_codepoint_t last) const 206 if (unlikely (last > MAX_G)) last = MAX_G; 207 unsigned int end = last + 1; 276 inline bool next_range (hb_codepoint_t *first, hb_codepoint_t *last) const 280 i = *last; 283 *last = *first = INVALID; 287 *last = *first = i; 288 while (next (&i) && i == *last + 1) 289 (*last) [all...] |
H A D | hb-set.h | 91 hb_codepoint_t last); 100 hb_codepoint_t last); 145 /* Pass -1 for first and last to get started. */ 149 hb_codepoint_t *last);
|
/external/harfbuzz_ng/src/ |
H A D | gen-indic-table.py | 161 last = -100000 variable 168 if u <= last: 178 if start != last + 1: 179 if start - last <= 1+16*3: 180 print_block (None, last+1, start-1, data) 181 last = start-1 variable 183 if last >= 0: 184 ends.append (last + 1) 192 last = end variable 193 ends.append (last [all...] |
H A D | hb-set-private.hh | 203 hb_codepoint_t last) const 206 if (unlikely (last > MAX_G)) last = MAX_G; 207 unsigned int end = last + 1; 276 inline bool next_range (hb_codepoint_t *first, hb_codepoint_t *last) const 280 i = *last; 283 *last = *first = INVALID; 287 *last = *first = i; 288 while (next (&i) && i == *last + 1) 289 (*last) [all...] |
/external/harfbuzz_ng/test/api/ |
H A D | test-set.c | 164 hb_codepoint_t next, first, last; local 191 first = last = HB_SET_VALUE_INVALID; 192 g_assert (hb_set_next_range (s, &first, &last)); 194 g_assert_cmpint (last, ==, 6); 195 g_assert (hb_set_next_range (s, &first, &last)); 197 g_assert_cmpint (last, ==, 15); 198 g_assert (hb_set_next_range (s, &first, &last)); 200 g_assert_cmpint (last, ==, 20005); 201 g_assert (!hb_set_next_range (s, &first, &last)); 203 g_assert_cmpint (last, [all...] |
/external/iproute2/netem/ |
H A D | maketable.c | 96 int i, index, first=DISTTABLESIZE, last=0; local 113 if (index > last) 114 last = index +1; 162 int i, j, last, lasti = -1; local 164 last = MINSHORT; 171 table[i] = last + (i-lasti)*(table[j]-last)/(j-lasti); 173 table[i] = last + (i-lasti)*(MAXSHORT-last)/(limit-lasti); 176 last [all...] |
/external/qemu/distrib/sdl-1.2.15/src/video/ |
H A D | SDL_stretch.c | 77 } last; local 85 if ( (src_w == last.src_w) && 86 (dst_w == last.dst_w) && (bpp == last.bpp) ) { 87 return(last.status); 89 last.bpp = bpp; 90 last.src_w = src_w; 91 last.dst_w = dst_w; 92 last.status = -1; 148 last [all...] |
/external/chromium_org/chrome/browser/chromeos/drive/ |
H A D | file_change.cc | 55 Change& last = list_.back(); local 56 if (last.IsFile() != new_change.IsFile()) { 61 if (last.change() == new_change.change()) 65 if (!last.IsFile() && last.IsAddOrUpdate() && new_change.IsDelete()) { 72 last = new_change;
|
/external/srec/srec/crec/ |
H A D | comp_stats.c | 120 c->last = kernelCPU.dwLowDateTime + ((__int64)kernelCPU.dwHighDateTime << 32) + 130 c->last = tickGet(); 132 c->last = clock(); 156 c->total_time += curr - c->last; 157 c->last = curr; 168 c->last = 0;
|
/external/chromium_org/third_party/freetype/src/base/ |
H A D | ftoutln.c | 85 FT_Int last; /* index of last point in contour */ local 90 last = outline->contours[n]; 91 if ( last < 0 ) 93 limit = outline->points + last; 99 v_last = outline->points[last]; 117 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) 119 /* start at last point if it is on the curve */ 125 /* if both first and last points are conic, */ 279 first = last 546 FT_Int first, last; local 934 int last = outline->contours[c]; local 1056 FT_Int last = outline->contours[c]; local [all...] |
/external/freetype/src/base/ |
H A D | ftoutln.c | 85 FT_Int last; /* index of last point in contour */ local 90 last = outline->contours[n]; 91 if ( last < 0 ) 93 limit = outline->points + last; 99 v_last = outline->points[last]; 117 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) 119 /* start at last point if it is on the curve */ 125 /* if both first and last points are conic, */ 279 first = last 546 FT_Int first, last; local 937 int last = outline->contours[c]; local 1059 FT_Int last = outline->contours[c]; local [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
H A D | ftoutln.c | 85 FT_Int last; /* index of last point in contour */ local 90 last = outline->contours[n]; 91 if ( last < 0 ) 93 limit = outline->points + last; 99 v_last = outline->points[last]; 117 if ( FT_CURVE_TAG( outline->tags[last] ) == FT_CURVE_TAG_ON ) 119 /* start at last point if it is on the curve */ 125 /* if both first and last points are conic, */ 279 first = last 546 FT_Int first, last; local 934 int last = outline->contours[c]; local 1056 FT_Int last = outline->contours[c]; local [all...] |
/external/chromium_org/chrome/browser/resources/ |
H A D | certificate_viewer.js | 119 // Select the last item in the hierarchy (really we have a list here - each 122 var last = root; 123 while (last.detail.children && last.detail.children[0]) 124 last = last.detail.children[0]; 125 last.selected = true;
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | CounterNode.cpp | 125 CounterNode* last = m_lastChild; local 126 if (!last) 129 while (CounterNode* lastChild = last->m_lastChild) 130 last = lastChild; 132 return last; 285 CounterNode* last = newChild->m_lastChild; local 289 ASSERT(last); 292 m_lastChild = last; 300 // counter node being created, it will be inserted as the last child so next is null. 305 last [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | kernel-list.h | 92 struct list_head *last = list->prev; local 98 last->next = at; 99 at->prev = last;
|