Searched refs:pos (Results 1 - 25 of 2848) sorted by relevance

1234567891011>>

/external/clang/test/CodeGen/
H A D2003-08-17-DeadCodeShortCircuit.c3 int test(_Bool pos, _Bool color) { argument
5 return (pos && color);
/external/icu/icu4c/source/common/
H A Dbytestrie.cpp30 BytesTrie::readValue(const uint8_t *pos, int32_t leadByte) { argument
35 value=((leadByte-kMinTwoByteValueLead)<<8)|*pos;
37 value=((leadByte-kMinThreeByteValueLead)<<16)|(pos[0]<<8)|pos[1];
39 value=(pos[0]<<16)|(pos[1]<<8)|pos[2];
41 value=(pos[0]<<24)|(pos[1]<<16)|(pos[
47 jumpByDelta(const uint8_t *pos) argument
68 const uint8_t *pos=pos_; local
79 branchNext(const uint8_t *pos, int32_t length, int32_t inByte) argument
149 nextImpl(const uint8_t *pos, int32_t inByte) argument
[all...]
H A Ducharstrie.cpp31 const UChar *pos=pos_; local
32 if(pos==NULL) {
36 return (remainingMatchLength_<0 && (node=*pos)>=kMinValueLead) ?
60 UCharsTrie::branchNext(const UChar *pos, int32_t length, int32_t uchar) { argument
63 length=*pos++;
69 if(uchar<*pos++) {
71 pos=jumpByDelta(pos);
74 pos=skipDelta(pos);
122 nextImpl(const UChar *pos, int32_t uchar) argument
154 const UChar *pos=pos_; local
181 const UChar *pos=pos_; local
283 findUniqueValueFromBranch(const UChar *pos, int32_t length, UBool haveUniqueValue, int32_t &uniqueValue) argument
321 findUniqueValue(const UChar *pos, UBool haveUniqueValue, int32_t &uniqueValue) argument
365 const UChar *pos=pos_; local
397 getNextBranchUChars(const UChar *pos, int32_t length, Appendable &out) argument
[all...]
H A Duchriter.cpp80 && pos == realThat.pos
87 return ustr_hashUCharsN(text, textLength) ^ pos ^ begin ^ end;
97 pos = begin;
98 if(pos < end) {
99 return text[pos];
107 pos = begin;
108 if(pos < end) {
109 return text[pos++];
117 pos
[all...]
/external/mockito/cglib-and-asm/src/org/mockito/asm/signature/
H A DSignatureReader.java74 int pos;
78 pos = 2;
80 int end = signature.indexOf(':', pos);
81 v.visitFormalTypeParameter(signature.substring(pos - 1, end));
82 pos = end + 1;
84 c = signature.charAt(pos);
86 pos = parseType(signature, pos, v.visitClassBound());
89 while ((c = signature.charAt(pos++)) == ':') {
90 pos
140 parseType( final String signature, int pos, final SignatureVisitor v) argument
[all...]
/external/wpa_supplicant_8/hostapd/src/utils/
H A Duuid.c16 const char *pos; local
19 pos = str;
22 if (hexstr2bin(pos, opos, 4))
24 pos += 8;
27 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
29 pos += 4;
32 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
34 pos
[all...]
/external/wpa_supplicant_8/src/utils/
H A Duuid.c16 const char *pos; local
19 pos = str;
22 if (hexstr2bin(pos, opos, 4))
24 pos += 8;
27 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
29 pos += 4;
32 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
34 pos
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Duuid.c16 const char *pos; local
19 pos = str;
22 if (hexstr2bin(pos, opos, 4))
24 pos += 8;
27 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
29 pos += 4;
32 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
34 pos
[all...]
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/
H A DCharCache.java25 private int pos; field in class:CharCache
33 int available = cache.length - pos;
35 System.arraycopy(chars, 0, cache, pos, toWrite);
36 pos += toWrite;
40 return new String(cache, 0, pos);
44 pos = 0;
48 if (pos < cache.length - 1) {
49 cache[pos] = c;
50 pos++;
55 return pos;
[all...]
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/http/
H A DHeaderParser.java21 * Returns the next index in {@code input} at or after {@code pos} that
25 public static int skipUntil(String input, int pos, String characters) { argument
26 for (; pos < input.length(); pos++) {
27 if (characters.indexOf(input.charAt(pos)) != -1) {
31 return pos;
38 public static int skipWhitespace(String input, int pos) { argument
39 for (; pos < input.length(); pos++) {
40 char c = input.charAt(pos);
[all...]
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/tls/
H A DDistinguishedNameParser.java29 private int pos; field in class:DistinguishedNameParser
51 for (; pos < length && chars[pos] == ' '; pos++) {
53 if (pos == length) {
58 beg = pos;
61 pos++;
62 for (; pos < length && chars[pos] != '=' && chars[pos] !
[all...]
/external/wpa_supplicant_8/hostapd/src/rsn_supp/
H A Dwpa_ie.c45 u8 *pos; local
57 pos = (u8 *) (hdr + 1);
65 RSN_SELECTOR_PUT(pos, suite);
66 pos += WPA_SELECTOR_LEN;
68 *pos++ = 1;
69 *pos++ = 0;
78 RSN_SELECTOR_PUT(pos, suite);
79 pos += WPA_SELECTOR_LEN;
81 *pos++ = 1;
82 *pos
113 u8 *pos; local
238 u8 *pos, *len; local
328 wpa_parse_vendor_specific(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
364 wpa_parse_generic(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
490 const u8 *pos, *end; local
[all...]
/external/wpa_supplicant_8/src/rsn_supp/
H A Dwpa_ie.c45 u8 *pos; local
57 pos = (u8 *) (hdr + 1);
65 RSN_SELECTOR_PUT(pos, suite);
66 pos += WPA_SELECTOR_LEN;
68 *pos++ = 1;
69 *pos++ = 0;
78 RSN_SELECTOR_PUT(pos, suite);
79 pos += WPA_SELECTOR_LEN;
81 *pos++ = 1;
82 *pos
113 u8 *pos; local
238 u8 *pos, *len; local
328 wpa_parse_vendor_specific(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
364 wpa_parse_generic(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
490 const u8 *pos, *end; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/rsn_supp/
H A Dwpa_ie.c45 u8 *pos; local
57 pos = (u8 *) (hdr + 1);
65 RSN_SELECTOR_PUT(pos, suite);
66 pos += WPA_SELECTOR_LEN;
68 *pos++ = 1;
69 *pos++ = 0;
78 RSN_SELECTOR_PUT(pos, suite);
79 pos += WPA_SELECTOR_LEN;
81 *pos++ = 1;
82 *pos
113 u8 *pos; local
238 u8 *pos, *len; local
328 wpa_parse_vendor_specific(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
364 wpa_parse_generic(const u8 *pos, const u8 *end, struct wpa_eapol_ie_parse *ie) argument
490 const u8 *pos, *end; local
[all...]
/external/iptables/libiptc/
H A Dlinux_list.h335 * @pos: the &struct list_head to use as a loop counter.
338 #define list_for_each(pos, head) \
339 for (pos = (head)->next, prefetch(pos->next); pos != (head); \
340 pos = pos->next, prefetch(pos->next))
344 * @pos: the &struct list_head to use as a loop counter.
352 #define __list_for_each(pos, hea
[all...]
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/xpath/
H A DXMPPathParser.java92 PathPosition pos = new PathPosition();
93 pos.path = path;
97 parseRootNode(schemaNS, pos, expandedXPath);
100 while (pos.stepEnd < path.length())
102 pos.stepBegin = pos.stepEnd;
104 skipPathDelimiter(path, pos);
106 pos.stepEnd = pos.stepBegin;
110 if (path.charAt(pos
172 skipPathDelimiter(String path, PathPosition pos) argument
206 parseStructSegment(PathPosition pos) argument
235 parseIndexSegment(PathPosition pos) argument
335 parseRootNode(String schemaNS, PathPosition pos, XMPPath expandedXPath) argument
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DUTF16CollationIterator.java31 pos = p;
40 return (pos - start) == (o.pos - o.start);
52 pos = start + newOffset;
57 return pos - start;
64 pos = p;
70 if(pos == limit) {
73 char c = seq.charAt(pos++);
75 if(Character.isHighSurrogate(c) && pos != limit &&
76 Character.isLowSurrogate(trail = seq.charAt(pos))) {
145 protected int pos; field in class:UTF16CollationIterator
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
H A DBytesTrie.java84 private int pos; field in class:BytesTrie.State
98 state.pos=pos_;
115 pos_=state.pos;
194 int pos=pos_;
195 if(pos<0) {
199 return (remainingMatchLength_<0 && (node=bytes_[pos]&0xff)>=kMinValueLead) ?
228 int pos=pos_;
229 if(pos<0) {
238 if(inByte==(bytes_[pos++]&0xff)) {
240 pos_=pos;
657 branchNext(int pos, int length) argument
709 readValue(byte[] bytes, int pos, int leadByte) argument
724 skipValue(int pos, int leadByte) argument
737 skipValue(byte[] bytes, int pos) argument
743 jumpByDelta(byte[] bytes, int pos) argument
762 skipDelta(byte[] bytes, int pos) argument
779 branchNext(int pos, int length, int inByte) argument
849 nextImpl(int pos, int inByte) argument
885 findUniqueValueFromBranch(byte[] bytes, int pos, int length, long uniqueValue) argument
925 findUniqueValue(byte[] bytes, int pos, long uniqueValue) argument
960 getNextBranchBytes(byte[] bytes, int pos, int length, Appendable out) argument
[all...]
H A DCharsTrie.java87 private int pos; field in class:CharsTrie.State
101 state.pos=pos_;
118 pos_=state.pos;
133 int pos=pos_;
134 if(pos<0) {
138 return (remainingMatchLength_<0 && (node=chars_.charAt(pos))>=kMinValueLead) ?
178 int pos=pos_;
179 if(pos<0) {
185 if(inUnit==chars_.charAt(pos++)) {
187 pos_=pos;
592 branchNext(int pos, int length) argument
647 readValue(CharSequence chars, int pos, int leadUnit) argument
658 skipValue(int pos, int leadUnit) argument
668 skipValue(CharSequence chars, int pos) argument
673 readNodeValue(CharSequence chars, int pos, int leadUnit) argument
685 skipNodeValue(int pos, int leadUnit) argument
697 jumpByDelta(CharSequence chars, int pos) argument
710 skipDelta(CharSequence chars, int pos) argument
725 branchNext(int pos, int length, int inUnit) argument
787 nextImpl(int pos, int inUnit) argument
822 findUniqueValueFromBranch(CharSequence chars, int pos, int length, long uniqueValue) argument
863 findUniqueValue(CharSequence chars, int pos, long uniqueValue) argument
906 getNextBranchChars(CharSequence chars, int pos, int length, Appendable out) argument
[all...]
/external/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDeclContext.cpp35 collection::const_reverse_iterator pos; local
38 for (pos = begin; pos != end; ++pos)
40 if (pos != begin)
42 if (pos->name == NULL)
44 if (pos->tag == DW_TAG_namespace)
46 else if (pos->tag == DW_TAG_class_type)
48 else if (pos->tag == DW_TAG_structure_type)
50 else if (pos
[all...]
/external/icu/icu4c/source/i18n/
H A Dutf8collationiterator.cpp34 pos = newOffset;
39 return pos;
44 if(pos == length) {
49 c = u8[pos++];
55 if(c < 0xe0 && pos != length && (t1 = (u8[pos] - 0x80)) <= 0x3f) {
59 ++pos;
62 ((pos + 1) < length || length < 0) &&
63 (t1 = (u8[pos] - 0x80)) <= 0x3f && (c != 0xe0 || t1 >= 0x20) &&
64 (t2 = (u8[pos
[all...]
/external/iproute2/lib/
H A Ddnet_ntop.c19 static __inline__ int do_digit(char *str, u_int16_t *addr, u_int16_t scale, size_t *pos, size_t len, int *started) argument
23 if (*pos == len)
29 (*pos)++;
40 size_t pos = 0; local
55 if (do_digit(str + pos, &area, 10, &pos, len, &started))
58 if (do_digit(str + pos, &area, 1, &pos, len, &started))
61 if (pos == len)
64 *(str + pos)
[all...]
/external/lldb/source/Symbol/
H A DVariableList.cpp93 iterator pos, end = m_variables.end(); local
94 for (pos = m_variables.begin(); pos != end; ++pos)
96 if (pos->get() == var_sp.get())
97 return std::distance (m_variables.begin(), pos);
106 iterator pos, end = m_variables.end(); local
107 for (pos = m_variables.begin(); pos != end; ++pos)
122 iterator pos, end = m_variables.end(); local
143 iterator pos, end = m_variables.end(); local
162 iterator pos; local
177 const_iterator pos, end = m_variables.end(); local
196 const_iterator pos, end = m_variables.end(); local
[all...]
/external/linux-tools-perf/src/tools/perf/util/include/linux/
H A Dlist.h24 * @pos: the &struct list_head to use as a loop cursor, from where to start
27 #define list_for_each_from(pos, head) \
28 for (; pos != (head); pos = pos->next)
/external/selinux/libsepol/cil/src/
H A Dcil_stack.c45 new_stack->pos = -1;
62 stack->pos = -1;
67 return (stack->pos == -1);
72 stack->pos++;
74 if (stack->pos == stack->size) {
79 stack->stack[stack->pos].flavor = flavor;
80 stack->stack[stack->pos].data = data;
85 if (stack->pos == -1) {
89 stack->pos--;
90 return &stack->stack[stack->pos
102 cil_stack_peek_at(struct cil_stack *stack, int pos) argument
[all...]

Completed in 2299 milliseconds

1234567891011>>