| /frameworks/compile/mclinker/lib/LD/ |
| GNUArchiveReader.cpp | 266 // read the number of symbols
267 uint32_t number = 0; local
269 number = mcld::bswap32(*data);
271 number = *data;
275 const char* name = reinterpret_cast<const char*>(data + number);
278 for (uint32_t i = 0; i < number; ++i) {
|
| /external/harfbuzz_ng/src/ |
| hb-private.hh | 211 /* Return the number of 1 bits in mask. */
226 /* Returns the number of bits needed to store number */
228 _hb_bit_storage (unsigned int number)
231 return likely (number) ? (sizeof (unsigned int) * 8 - __builtin_clz (number)) : 0;
234 while (number) {
236 number >>= 1;
242 /* Returns the number of zero bits in the least significant side of number */
[all...] |
| /packages/apps/Dialer/src/com/android/dialer/ |
| CallDetailActivity.java | 134 /** Whether we should show "edit number before call" in the options menu. */
145 * The action mode used when the phone number is selected. This will be non-null only when the
146 * phone number is selected.
207 CallLog.Calls.NUMBER,
420 // We know that all calls are from the same number and the same contact, so pick the
423 mNumber = firstDetails.number.toString();
430 // Cache the details about the phone number.
436 // contact from this number.
445 nameOrNumber = firstDetails.number;
467 // the current number is a SIP addres
601 String number = callCursor.getString(NUMBER_COLUMN_INDEX); local
[all...] |
| /external/icu4c/test/perf/dicttrieperf/ |
| dicttrieperf.cpp | 119 int32_t number=(start+limit)/2; local
120 if(lastNumber==number) { // have we moved?
123 lastNumber=number;
124 int32_t cmp=strcmp(s, names+toc[number].nameOffset);
126 limit=number;
128 start=number;
130 return number;
391 // after the longest prefix match and returns the number of characters
|
| /external/qemu/distrib/sdl-1.2.15/src/joystick/darwin/ |
| SDL_sysjoystick.c | 85 long axes; /* number of axis (calculated, not reported by device) */
86 long buttons; /* number of buttons (calculated, not reported by device) */
87 long hats; /* number of hat switches (calculated, not reported by device) */
88 long elements; /* number of total elements (shouldbe total of above) (calculated, not reported by device) */
236 long number; local
240 if (refType && CFNumberGetValue (refType, kCFNumberLongType, &number))
241 pElement->cookie = (IOHIDElementCookie) number;
243 if (refType && CFNumberGetValue (refType, kCFNumberLongType, &number))
244 pElement->minReport = pElement->min = number;
246 if (refType && CFNumberGetValue (refType, kCFNumberLongType, &number))
[all...] |
| /external/libphonenumber/java/test/com/android/i18n/phonenumbers/ |
| PhoneNumberUtilTest.java | 56 // Note that this is the same as the example number for DE in the metadata.
85 // A too-long and hence invalid US number.
212 assertFalse(phoneUtil.isNumberGeographical(BS_MOBILE)); // Bahamas, mobile phone number.
213 assertTrue(phoneUtil.isNumberGeographical(AU_NUMBER)); // Australian fixed line number.
215 // free number.
231 // A North America toll-free number, which has no area code.
252 // An invalid US number (1 digit shorter), which has no area code.
255 // An international toll free number, which has no area code.
263 // A North America toll-free number, which has NDC "800".
284 // An invalid US number (1 digit shorter), which has no NDC
288 PhoneNumber number = new PhoneNumber().setCountryCode(123).setNationalNumber(6502530000L); local
1219 PhoneNumber number = new PhoneNumber(); local
1254 PhoneNumber number = new PhoneNumber(); local
1481 PhoneNumber number = new PhoneNumber(); local
[all...] |
| /external/protobuf/java/src/main/java/com/google/protobuf/ |
| Descriptors.java | 204 * descriptor. This can occur for a number of reasons, e.g.
477 /** Determines if the given field number is an extension. */
478 public boolean isExtensionNumber(final int number) {
481 if (range.getStart() <= number && number < range.getEnd()) {
504 * Finds a field by field number.
505 * @param number The field number within this message type.
508 public FieldDescriptor findFieldByNumber(final int number) {
510 new DescriptorPool.DescriptorIntPair(this, number));
1789 private final int number; field in class:Descriptors.DescriptorPool.DescriptorIntPair
[all...] |
| /external/iptables/iptables/ |
| ip6tables.c | 255 "[!] --proto -p proto protocol: by number or name, eg. `tcp'\n"
398 "Invalid rule number `%s'", rule);
446 print_num(uint64_t number, unsigned int format)
449 if (number > 99999) {
450 number = (number + 500) / 1000;
451 if (number > 9999) {
452 number = (number + 500) / 1000;
453 if (number > 9999)
[all...] |
| iptables.c | 268 "[!] --proto -p proto protocol: by number or name, eg. `tcp'\n"
403 "Invalid rule number `%s'", rule);
451 print_num(uint64_t number, unsigned int format)
454 if (number > 99999) {
455 number = (number + 500) / 1000;
456 if (number > 9999) {
457 number = (number + 500) / 1000;
458 if (number > 9999)
[all...] |
| /external/v8/src/ |
| debug-debugger.js | 28 // Default number of frames to include in the response to backtrace request.
142 BreakPoint.prototype.number = function() {
292 ScriptBreakPoint.prototype.number = function() {
593 // Returns the character position in a script based on a line number and an
604 if (break_points[i].number() == break_point_number) {
622 if (script_break_points[i].number() == break_point_number) {
627 if (break_points[i].number() == break_point_number) {
672 return break_point.number();
766 if (script_break_points[i].number() == break_point_number) {
790 // Assign number to the new script break point and add it
[all...] |
| mirror-debugger.js | 65 typeof value == 'number' && isNaN(value)) {
105 * @param {number} handle the handle to find the mirror for
150 var NUMBER_TYPE = 'number';
273 * Check whether the mirror reflects a number value.
274 * @returns {boolean} True if the mirror reflects a number value
456 type === 'number' ||
520 * Mirror object for number values.
521 * @param {number} value The number value reflected by this mirror
615 * @param {number} kind Indicate whether named, indexed or both kinds o
[all...] |
| math.js | 100 // It's more common to call this with a positive number that's out
129 // a Smi or a heap number.
146 // a Smi or heap number.
162 // a Smi or a heap number.
179 // Smi or a heap number.
|
| v8natives.js | 33 // var $Number = global.Number;
96 function GlobalIsNaN(number) {
97 if (!IS_NUMBER(number)) number = NonNumberToNumber(number);
98 return NUMBER_IS_NAN(number);
103 function GlobalIsFinite(number) {
104 if (!IS_NUMBER(number)) number = NonNumberToNumber(number)
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/hfp/ |
| HeadsetStateMachine.java | 1557 String number = mPhoneProxy.getSubscriberNumber(); local
[all...] |
| /external/zlib/src/contrib/delphi/ |
| ZLib.pas | 25 avail_in: Integer; // number of bytes available at next_in
69 The Position property returns the number of uncompressed bytes of
108 The Position property returns the number of bytes of uncompressed data that
130 InBytes = number of bytes in InBuf
132 OutBytes = number of bytes in OutBuf }
139 InBytes = number of bytes in InBuf
142 OutBytes = number of bytes in OutBuf }
148 InBytes = number of bytes in InBuf
150 BufSize = number of bytes in OutBuf }
|
| /bionic/libc/netbsd/resolv/ |
| res_debug.c | 509 return (syms->number);
514 return (syms->number); /* The default value. */
518 sym_ntos(const struct res_sym *syms, int number, int *success) {
522 if (number == syms->number) {
529 sprintf(unname, "%d", number); /* XXX nonreentrant */
536 sym_ntop(const struct res_sym *syms, int number, int *success) {
540 if (number == syms->number) {
546 sprintf(unname, "%d", number); /* XXX nonreentrant *
[all...] |
| /external/chromium/chrome/browser/autofill/ |
| autofill_manager.cc | 137 // evening phone number. Our phone and fax number detection is also
442 // The first time we show suggestions on this page, log the number of
[all...] |
| /external/llvm/examples/OCaml-Kaleidoscope/Chapter7/ |
| parser.ml | 20 (* numberexpr ::= number *)
21 | [< 'Token.Number n >] -> Ast.Number n
165 * ::= binary LETTER number? (id, id)
166 * ::= unary LETTER number? (id) *)
177 | [< 'Token.Number n >] -> int_of_float n
197 (* Verify right number of arguments for operator. *)
199 then raise (Stream.Error "invalid number of operands for operator")
|
| /external/quake/quake/src/QW/client/ |
| cl_ents.c | 167 to->number = bits & 511;
326 //Con_Printf ("copy %i\n", oldp->entities[oldindex].number);
336 oldnum = oldindex >= oldp->num_entities ? 9999 : oldp->entities[oldindex].number;
354 oldnum = oldindex >= oldp->num_entities ? 9999 : oldp->entities[oldindex].number;
434 CL_NewDlight (s1->number, s1->origin[0], s1->origin[1], s1->origin[2], 200 + (rand()&31), 0.1, 3);
436 CL_NewDlight (s1->number, s1->origin[0], s1->origin[1], s1->origin[2], 200 + (rand()&31), 0.1, 1);
438 CL_NewDlight (s1->number, s1->origin[0], s1->origin[1], s1->origin[2], 200 + (rand()&31), 0.1, 2);
440 CL_NewDlight (s1->number, s1->origin[0], s1->origin[1], s1->origin[2] + 16, 400 + (rand()&31), 0.1, 0);
442 CL_NewDlight (s1->number, s1->origin[0], s1->origin[1], s1->origin[2], 200 + (rand()&31), 0.1, 0);
455 ent->keynum = s1->number;
[all...] |
| /external/icu4c/i18n/ |
| plurrule.cpp | 181 PluralRules::select(int32_t number) const {
186 return mRules->select(number);
191 PluralRules::select(double number) const {
196 return mRules->select(number);
792 AndConstraint::isFulfilled(double number) {
794 double value=number;
797 if ((rangeHigh == -1 || integerOnly) && number != uprv_floor(number)) {
916 OrConstraint::isFulfilled(double number) {
924 result = andRule->isFulfilled(number);
[all...] |
| rbnf.cpp | 1031 RuleBasedNumberFormat::format(int32_t number,
1035 if (defaultRuleSet) defaultRuleSet->format((int64_t)number, toAppendTo, toAppendTo.length());
1041 RuleBasedNumberFormat::format(int64_t number,
1045 if (defaultRuleSet) defaultRuleSet->format(number, toAppendTo, toAppendTo.length());
1051 RuleBasedNumberFormat::format(double number,
1055 // Special case for NaN; adapted from what DecimalFormat::_format( double number,...) does.
1056 if (uprv_isNaN(number)) {
1062 defaultRuleSet->format(number, toAppendTo, toAppendTo.length());
1069 RuleBasedNumberFormat::format(int32_t number,
1075 // return format((int64_t)number, ruleSetName, toAppendTo, pos, status)
[all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| StylesSidebarPane.js | [all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dfa.rb | 51 Conceptually, these state machines are defined by a number of states, each state
52 represented by an integer indexed upward from zero. State number +0+ is the
56 either moves to a new state number to repeat the process or decides that the
75 A list that defines the next state number based upon
89 transitions, this is the alternative number
93 this is the alternative number that has been predicted.
|
| /external/icu4c/test/cintltst/ |
| bocu1tst.c | 75 /* number of lead bytes */
82 /* number of trail bytes */
86 * number of positive and negative single-byte codes
91 /* number of lead bytes for positive and negative 2/3/4-byte sequences */
210 * @param n Number to be split into quotient and rest.
567 * with the number of trail bytes.
606 * @return number of bytes
673 * @return p advanced by number of bytes output
706 * @param length number of UChar code units in s
708 * @return number of bytes outpu
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| FastMath.java | 74 * Returns true if the number is a power of 2 (2,4,8,16...)
76 * A good implementation found on the Java boards. note: a number is a power
77 * of two if and only if it is the smallest number with that number of
79 * number will have fewer bits, so ANDing the original number with anything
82 * @param number
83 * The number to test.
86 public static boolean isPowerOfTwo(int number) {
87 return (number > 0) && (number & (number - 1)) == 0
[all...] |
