| /external/checkpolicy/ |
| 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/ |
| scoped_vector.h | 107 // Lets the ScopedVector take ownership of elements in [first,last).
109 void insert(iterator position, InputIterator first, InputIterator last) {
110 v_.insert(position, first, last);
118 iterator erase(iterator first, iterator last) {
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) {
130 return v_.erase(first, last);
|
| /external/chromium_org/third_party/webrtc/system_wrappers/interface/ |
| scoped_vector.h | 117 // Lets the ScopedVector take ownership of elements in [first,last).
119 void insert(iterator position, InputIterator first, InputIterator last) {
120 v_.insert(position, first, last);
128 iterator erase(iterator first, iterator last) {
129 STLDeleteContainerPointers(first, last);
130 return v_.erase(first, last);
138 // Like |erase()|, but doesn't delete the elements in [first, last).
139 iterator weak_erase(iterator first, iterator last) {
140 return v_.erase(first, last);
|
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| 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...] |
| 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/ |
| 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 + 1
[all...] |
| 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...] |
| 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/test/api/ |
| 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, ==, HB_SET_VALUE_INVALID)
[all...] |
| /external/iproute2/netem/ |
| 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 = table[i]
[all...] |
| /external/chromium_org/chrome/browser/chromeos/drive/ |
| 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/chromium_org/third_party/freetype/src/base/ |
| 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 + 1
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/ |
| 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 + 1
546 FT_Int first, last; local
937 int last = outline->contours[c]; local
1059 FT_Int last = outline->contours[c]; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| 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->m_nextSibling = next
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| make_unicode_groups.py | 33 last = -100
35 if c == last+1:
39 last = c
|
| /external/e2fsprogs/lib/ext2fs/ |
| kernel-list.h | 92 struct list_head *last = list->prev; local
98 last->next = at;
99 at->prev = last;
|
| /external/fio/lib/ |
| prio_tree.c | 47 *heap = node->last;
78 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
93 last = first;
95 prev = last;
96 last = root->prio_tree_node;
98 INIT_PRIO_TREE_NODE(last);
99 prev->left = last;
100 last->parent = prev;
110 last = node;
113 last->left = root->prio_tree_node
[all...] |
| /external/libcxx/test/containers/sequences/vector/vector.cons/ |
| construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last);
23 test(Iterator first, Iterator last)
25 C c(first, last);
27 assert(c.size() == std::distance(first, last));
|
| construct_iter_iter_alloc.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last,
24 test(Iterator first, Iterator last, const A& a)
26 C c(first, last, a);
28 assert(c.size() == std::distance(first, last));
|
| /external/libcxx/test/containers/sequences/vector.bool/ |
| construct_iter_iter_alloc.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last,
24 test(Iterator first, Iterator last, const typename C::allocator_type& a)
26 C c(first, last, a);
28 assert(c.size() == std::distance(first, last));
|
| /external/oprofile/daemon/ |
| oprofiled.c | 304 char const * last = binary_name_filter; local
313 while ((cur = strchr(last, ',')) != NULL) {
314 char * tmp = op_xstrndup(last, cur - last);
317 last = cur + 1;
319 add_image_filter(last);
382 char const * last = verbose; local
388 while ((cur = strchr(last, ',')) != NULL) {
389 char * tmp = op_xstrndup(last, cur - last);
[all...] |
| /external/owasp/sanitizer/src/main/org/owasp/html/ |
| ElementPolicy.java | 70 ElementPolicy last = null; field in class:ElementPolicy.Util.PolicyJoiner
81 } else if (p != last) {
82 last = p;
|
| /external/chromium_org/chrome/browser/resources/options/ |
| autofill_options.css | 30 #autofill-options > div:last-child {
34 #autofill-options > div.settings-list > div:last-child {
|
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLTreeBuilderSimulator.h | 62 bool inForeignContent() const { return m_namespaceStack.last() != HTML; }
|
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| TracedValue.cpp | 131 ASSERT(m_stack.last()->type() == JSONValue::TypeObject);
132 return static_cast<JSONObject*>(m_stack.last().get());
138 ASSERT(m_stack.last()->type() == JSONValue::TypeArray);
139 return static_cast<JSONArray*>(m_stack.last().get());
|
