HomeSort by relevance Sort by last modified time
    Searched refs:gap (Results 1 - 25 of 129) sorted by null

1 2 3 4 5 6

  /art/runtime/base/
hex_dump.cc 56 size_t gap = offset & 0x0f; local
71 size_t count = std::min(byte_count, 16 - gap);
73 // CHECK_LE(count + gap, 16U);
75 if (gap) {
77 hex += gap * 3;
78 asc += gap;
82 for (i = gap ; i < count + gap; i++) {
103 gap = 0;
  /external/chromium_org/v8/src/
json.js 50 function SerializeArray(value, replacer, stack, indent, gap) {
55 indent += gap;
60 indent, gap);
67 if (gap == "") {
80 function SerializeObject(value, replacer, stack, indent, gap) {
85 indent += gap;
92 var strP = JSONSerialize(p, value, replacer, stack, indent, gap);
95 if (gap != "") member += " ";
104 var strP = JSONSerialize(p, value, replacer, stack, indent, gap);
107 if (gap != "") member += " "
    [all...]
lithium.cc 318 LGap* gap = LGap::cast(cur); local
319 if (!gap->IsRedundant()) {
336 LInstructionGap* gap = new (zone()) LInstructionGap(block); local
337 gap->set_hydrogen_value(instr->hydrogen_value());
340 instructions_.Add(gap, zone());
346 instructions_.Add(gap, zone());
  /external/chromium_org/third_party/libjingle/source/talk/app/webrtc/
dtmfsender_unittest.cc 77 DtmfInfo(int code, int duration, int gap)
80 gap(gap) {}
83 int gap; member in struct:FakeDtmfProvider::DtmfInfo
99 int gap = 0; variable
103 gap = static_cast<int>(rtc::Time() - last_insert_dtmf_call_);
109 << " gap=" << gap << "."; variable
110 dtmf_info_queue_.push_back(DtmfInfo(code, duration, gap));
162 // DtmfInfo's gap field will be 0
    [all...]
  /external/bluetooth/bluedroid/stack/
Android.mk 13 $(LOCAL_PATH)/gap \
148 ./gap/gap_api.c \
149 ./gap/gap_ble.c \
150 ./gap/gap_conn.c \
151 ./gap/gap_utils.c \
  /external/chromium_org/third_party/skia/gm/
arithmode.cpp 104 SkScalar gap = SkIntToScalar(src.width() + 20); local
108 x += gap;
110 x += gap;
119 x += gap;
  /external/chromium_org/native_client_sdk/doc_generated/_static/css/
nacl.css 7 .small-gap {margin-top: 0.5em;}
8 .small-gap li, dt {margin-top: 1em;}
9 .no-gap {margin-bottom: 0;}
10 .no-gap-li li {margin-top: 0;}
112 li.gap, .gap li {margin-top: 1.5em;}
113 .gap li li {margin-top: 0.2em;}
  /external/chromium_org/native_client_sdk/src/doc/_static/css/
nacl.css 7 .small-gap {margin-top: 0.5em;}
8 .small-gap li, dt {margin-top: 1em;}
9 .no-gap {margin-bottom: 0;}
10 .no-gap-li li {margin-top: 0;}
112 li.gap, .gap li {margin-top: 1.5em;}
113 .gap li li {margin-top: 0.2em;}
  /external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
chromevox_json.js 69 gap,
109 mind = gap,
160 gap += indent;
179 gap ? '[\n' + gap +
180 partial.join(',\n' + gap) + '\n' +
183 gap = mind;
197 partial.push(quote(k) + (gap ? ': ' : ':') + v);
208 partial.push(quote(k) + (gap ? ': ' : ':') + v);
218 gap ? '{\n' + gap + partial.join(',\n' + gap) + '\n'
    [all...]
  /external/chromium_org/third_party/usrsctp/usrsctplib/netinet/
sctp_constants.h 334 * gap ack's to figure out if you need to stroke a chunk for FR.
919 #define SCTP_IS_TSN_PRESENT(arry, gap) ((arry[(gap >> 3)] >> (gap & 0x07)) & 0x01)
920 #define SCTP_SET_TSN_PRESENT(arry, gap) (arry[(gap >> 3)] |= (0x01 << ((gap & 0x07))))
921 #define SCTP_UNSET_TSN_PRESENT(arry, gap) (arry[(gap >> 3)] &= ((~(0x01 << ((gap & 0x07)))) & 0xff)
    [all...]
  /external/javassist/src/main/javassist/bytecode/
StackMapTable.java 796 private int where, gap; field in class:StackMapTable.Shifter
801 public Shifter(StackMapTable smt, int where, int gap, boolean exclusive) {
805 this.gap = gap;
835 int newDelta = offsetDelta + gap;
836 position += gap;
850 private static byte[] insertGap(byte[] info, int where, int gap) {
852 byte[] newinfo = new byte[len + gap];
854 newinfo[i + (i < where ? 0 : gap)] = info[i];
882 int newDelta = offsetDelta + gap;
    [all...]
CodeIterator.java 24 * same <code>Code_attribute</code>, then inserting a gap by one
308 * <p>An extra gap may be inserted at the end of the inserted
331 * <p>An extra gap may be inserted at the end of the inserted
356 * <p>An extra gap may be inserted at the end of the inserted
381 * <p>An extra gap may be inserted at the end of the inserted
404 * <p>An extra gap may be inserted at the end of the inserted
429 * <p>An extra gap may be inserted at the end of the inserted
466 * Inserts a gap
471 * The inserted gap is filled with NOP. The gap length may b
599 Gap gap = new Gap(); local
1448 int gap, defaultByte; field in class:CodeIterator.Switcher
    [all...]
StackMap.java 382 private int where, gap; field in class:StackMap.Shifter
385 public Shifter(StackMap smt, int where, int gap, boolean exclusive) {
388 this.gap = gap;
394 ByteArray.write16bit(offset + gap, info, pos - 4);
  /external/chromium_org/third_party/skia/tools/flags/
SkCommandLineFlags.cpp 173 int gap; local
177 gap = 0;
180 gap = 1;
183 currLine += spaceIndex + gap;
  /external/chromium_org/v8/test/webkit/resources/
json2-es5-compat.js 190 gap,
230 mind = gap,
288 gap += indent;
307 gap ? '[\n' + gap +
308 partial.join(',\n' + gap) + '\n' +
311 gap = mind;
324 partial.push(quote(k) + (gap ? ': ' : ':') + v);
336 partial.push(quote(k) + (gap ? ': ' : ':') + v);
346 gap ? '{\n' + gap + partial.join(',\n' + gap) + '\n'
    [all...]
  /external/iproute2/tc/
q_netem.c 41 " [ reorder PRECENT [CORRELATION] [ gap DISTANCE ]]\n" \
359 } else if (matches(*argv, "gap") == 0) {
361 if (get_u32(&opt.gap, *argv, 0)) {
362 explain1("gap");
432 if (opt.gap == 0)
433 opt.gap = 1;
434 } else if (opt.gap > 0) {
435 fprintf(stderr, "gap specified without reorder probability\n");
620 if (qopt.gap)
621 fprintf(f, " gap %lu", (unsigned long)qopt.gap)
    [all...]
  /external/chromium_org/v8/test/mjsunit/regress/
regress-234101.js 30 // Currently, the gap resolver doesn't handle moves from a ConstantOperand to a
33 // either enhance the gap resolver or make sure that such moves don't happen.
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/listfmts/nasm/
nasm-listfmt.c 209 int gap; local
214 bigbuf = yasm_bc_tobytes(bc, buf, &size, &gap, &info,
226 if (gap) {
227 fprintf(f, "%6lu %08lX <gap>%*s%s\n", listline++, offset,
  /external/javassist/src/main/javassist/convert/
TransformAccessArrayField.java 142 // The gap may include extra padding
145 CodeIterator.Gap gap local
147 pos = gap.position;
159 pos = updatePos(pos, gap.length);
  /external/javassist/src/main/javassist/expr/
Expr.java 293 int gap = code.length - size; local
297 if (gap > 0)
298 pos = iterator.insertGapAt(pos, gap, false).position;
  /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/test/testFec/
test_packet_masks_metrics.cc 69 // Maximum gap size for characterizing the consecutiveness of the loss.
72 // Number of gap levels written to file/output.
91 // Number of loss configurations, for a given loss number and gap number.
92 // The gap number refers to the maximum gap/hole of a loss configuration
145 // The residual loss, as a function of the loss number and the gap number of
146 // the loss configurations. The gap number refers to the maximum gap/hole of
168 // Measure of the gap of the loss for configuration given by |state|.
330 // Compute the residual loss per gap, by summing th
    [all...]
  /external/chromium_org/v8/src/compiler/
instruction.cc 264 const GapInstruction* gap = GapInstruction::cast(&instr); local
265 os << (instr.IsBlockStart() ? " block-start" : "gap ");
269 if (gap->parallel_moves_[i] != NULL) os << *gap->parallel_moves_[i];
342 GapInstruction* gap = GapInstruction::New(zone()); local
343 if (instr->IsControl()) instructions_.push_back(gap);
346 if (!instr->IsControl()) instructions_.push_back(gap);
code-generator.h 10 #include "src/compiler/gap-resolver.h"
55 void AssembleGap(GapInstruction* gap);
75 // ============== Architecture-specific gap resolver methods. ================
78 // Interface used by the gap resolver to emit moves and swaps.
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/
bytecode.c 302 /*@out@*/ int *gap, void *d,
323 *gap = 1;
326 *gap = 0;
  /external/chromium_org/courgette/third_party/
bsdiff_create.cc 388 int gap = (scan - lenb) - (lastscan + lenf); local
389 for (int i = 0; i < gap; i++) {
395 extra_bytes_length += gap;
398 uint32 extra_count = gap;

Completed in 1574 milliseconds

1 2 3 4 5 6