/external/zlib/src/ |
H A D | inftrees.c | 46 int left; /* number of prefix codes available */ local 131 left = 1; 133 left <<= 1; 134 left -= count[len]; 135 if (left < 0) return -1; /* over-subscribed */ 137 if (left > 0 && (type == CODES || max != 1)) 270 left = (int)(1 << curr); 272 left -= count[curr + drop]; 273 if (left <= 0) break; 275 left << [all...] |
/external/chromium_org/chrome/browser/resources/downloads/ |
H A D | downloads.css | 15 float: left; 25 float: left; 46 float: left; 80 left: -110px; 86 left: auto; 100 left: 9px; 107 left: auto; 121 background-position: left bottom; 131 left: 0; 138 left [all...] |
/external/chromium_org/ui/keyboard/resources/webui/ |
H A D | main.css | 34 margin-left: 3px; 42 left: 0; 44 padding-left: 10px; 76 left: 0; 87 kb-shift-key.padded-left-special, 88 kb-key.padded-left-special { 94 margin-left: 5px; 129 .left-more { 149 .left-more, 166 margin-left [all...] |
/external/dropbear/libtomcrypt/src/misc/pkcs5/ |
H A D | pkcs_5_2.c | 38 unsigned long stored, left, x, y; local 66 left = *outlen; 69 while (left != 0) { 104 for (y = 0; y < x && left != 0; ++y) { 106 --left;
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstNode.java | 46 * The key on which this binary search tree is ordered. All descendants of the left subtree of 52 * The left child of this node. A null value indicates that this node has no left child. 55 private final N left; field in class:BstNode 63 BstNode(@Nullable K key, @Nullable N left, @Nullable N right) { argument 65 this.left = left; 84 return left;
|
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
H A D | SDL_BView.h | 65 bounds.top = bounds.left = 0; 89 dest.left = updateRect.left + xoff; 102 dest.left = updateRect.left + xoff;
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/ |
H A D | DESEngine.java | 408 int work, right, left; 410 left = (in[inOff + 0] & 0xff) << 24; 411 left |= (in[inOff + 1] & 0xff) << 16; 412 left |= (in[inOff + 2] & 0xff) << 8; 413 left |= (in[inOff + 3] & 0xff); 420 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; 422 left ^= (work << 4); 423 work = ((left >>> 16) ^ right) & 0x0000ffff; 425 left ^= (work << 16); 426 work = ((right >>> 2) ^ left) [all...] |
/external/ganymed-ssh2/src/main/java/ch/ethz/ssh2/crypto/cipher/ |
H A D | DES.java | 285 int work, right, left; 287 left = (in[inOff + 0] & 0xff) << 24; 288 left |= (in[inOff + 1] & 0xff) << 16; 289 left |= (in[inOff + 2] & 0xff) << 8; 290 left |= (in[inOff + 3] & 0xff); 297 work = ((left >>> 4) ^ right) & 0x0f0f0f0f; 299 left ^= (work << 4); 300 work = ((left >>> 16) ^ right) & 0x0000ffff; 302 left ^= (work << 16); 303 work = ((right >>> 2) ^ left) [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument 14 if (left >= right || top >= bottom) { 20 this->set(left, top, right, bottom); 22 if (left < fLeft) fLeft = left; 133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, argument 135 if (left < right && top < bottom && !this->isEmpty() && // check for empties 136 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 138 if (fLeft < left) fLeft = left; 167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | BstTesting.java | 39 SimpleNode(Character key, @Nullable SimpleNode left, @Nullable SimpleNode right) { argument 40 super(key, left, right); 68 SimpleNode source, @Nullable SimpleNode left, @Nullable SimpleNode right) { 69 return new SimpleNode(source.getKey(), left, right); 76 @Nullable SimpleNode left, @Nullable SimpleNode right) { 77 return checkNotNull(nodeFactory).createNode(source, left, right); 82 public SimpleNode combine(BstNodeFactory<SimpleNode> nodeFactory, @Nullable SimpleNode left, 84 // Shove right into the rightmost position in the left tree. 85 if (left == null) { 88 return left; [all...] |
H A D | BstNodeTest.java | 73 SimpleNode left = new SimpleNode('a', null, null); 75 SimpleNode node = new SimpleNode('b', left, right); 76 testChildIs(node, LEFT, left); 95 for (SimpleNode left : GOOD_LEFTS) { 98 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural())); 104 for (SimpleNode left : BAD_LEFTS) { 107 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural())); 113 for (SimpleNode left : ALL_LEFTS) { 116 new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
|
/external/libvpx/mips-dspr2/ |
H A D | vp9_rtcd.h | 27 void vp9_d207_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 30 void vp9_d45_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 33 void vp9_d63_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 36 void vp9_h_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 37 void vp9_h_predictor_4x4_dspr2(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 40 void vp9_d117_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 43 void vp9_d135_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 46 void vp9_d153_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 49 void vp9_v_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); 52 void vp9_tm_predictor_4x4_c(uint8_t *dst, ptrdiff_t y_stride, const uint8_t *above, const uint8_t *left); [all...] |
/external/skia/src/core/ |
H A D | SkRect.cpp | 12 void SkIRect::join(int32_t left, int32_t top, int32_t right, int32_t bottom) { argument 14 if (left >= right || top >= bottom) { 20 this->set(left, top, right, bottom); 22 if (left < fLeft) fLeft = left; 133 bool SkRect::intersect(SkScalar left, SkScalar top, SkScalar right, argument 135 if (left < right && top < bottom && !this->isEmpty() && // check for empties 136 fLeft < right && left < fRight && fTop < bottom && top < fBottom) 138 if (fLeft < left) fLeft = left; 167 join(SkScalar left, SkScalar top, SkScalar right, SkScalar bottom) argument [all...] |
/external/zlib/src/examples/ |
H A D | gzappend.c | 122 /* rotate list[0..len-1] left by rot positions, in place */ 137 /* do simple left shift by one */ 163 *to = *from; /* shift left */ 173 unsigned left; /* bytes available at next */ member in struct:__anon28914 186 in->left = (unsigned)len; 198 #define read1(in) (in->left == 0 ? readmore(in) : 0, \ 199 in->left--, *(in->next)++) 206 if (n > in->left) { 207 n -= in->left; 215 if (n > in->left) 261 int ret, lastbit, left, full; local 391 unsigned left; local [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/cm/ |
H A D | closebrackets.js | 40 for (var i = 0; i < pairs.length; i += 2) (function(left, right) { 41 if (left != right) closingBrackets += right; 44 cm.replaceSelection(left + selection + right); 51 map["'" + left + "'"] = function(cm) { 52 if (left == "'" && cm.getTokenAt(cm.getCursor()).type == "comment") 55 if (left == right && maybeOverwrite(cm) != CodeMirror.Pass) return; 58 if (left == right && CodeMirror.isWordChar(curChar)) 61 cm.replaceSelection(left + right, {head: ahead, anchor: ahead}); 65 if (left != right) map["'" + right + "'"] = maybeOverwrite;
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | splitView.css | 33 left: 0; 55 left: 0; 67 left: 0; 71 left: 0; 96 border-left: 1px solid rgb(64%, 64%, 64%); 118 left: 0; 129 left: 0;
|
H A D | tabbedPane.css | 59 float: left; 63 float: left; 89 left: 1px; 90 margin-left: 2px; 101 float: left; 105 padding-left: 3px; 133 left: 0;
|
/external/elfutils/libebl/ |
H A D | eblstrtab.c | 77 struct Ebl_Strent *left; member in struct:Ebl_Strent 96 size_t left; member in struct:Ebl_Strtab 148 st->left = len - offsetof (struct memoryblock, memory); 180 if (st->left < align + sizeof (struct Ebl_Strent) + len) 193 newstr->left = NULL; 200 st->left -= align + sizeof (struct Ebl_Strent) + len; 226 return searchstring (&(*sep)->left, newstr); 266 st->left += st->backp - (char *) newstr; 275 st->left += newstr->len; 287 newstr->left [all...] |
/external/chromium/chrome/browser/resources/net_internals/ |
H A D | main.css | 50 border-left: 1px inset black; 63 text-align: left; 70 border-left: 1px solid #afafaf; 114 margin-left: 10px; 121 border-top-left-radius: 5px 5px; 123 padding-left: 4px; 127 margin-left: 30px; 188 padding-left: 4px; 206 text-align: left;
|
/external/chromium_org/chrome/browser/resources/chromeos/login/ |
H A D | network_dropdown.css | 15 -webkit-gradient(linear, left top, left bottom, 33 text-align: left; 42 background-position: center left; 47 -webkit-gradient(linear, left top, left bottom, 59 -webkit-gradient(linear, left top, left bottom, 141 left: 0;
|
/external/linux-tools-perf/util/ |
H A D | sort.c | 102 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) argument 104 return right->thread->pid - left->thread->pid; 144 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) argument 146 struct dso *dso_l = left->ms.map ? left->ms.map->dso : NULL; 179 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) argument 183 if (left->ms.sym == right->ms.sym) 186 ip_l = left->ms.sym ? left->ms.sym->start : left 217 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) argument 223 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) argument 237 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) argument 258 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) argument [all...] |
/external/chromium-trace/trace-viewer/src/ui/ |
H A D | quad_stack.css | 27 left: 0; 34 url('../images/chrome-left.png'), 37 background-position: left top, right top, left top;
|
/external/chromium_org/chrome/browser/resources/ |
H A D | about_version.css | 13 margin-left: auto; 39 margin-left: 40px; 61 padding-left: 5px;
|
/external/chromium_org/chrome/browser/resources/chromeos/ |
H A D | wrench_menu.css | 25 .left-button { 27 border-bottom-left-radius: 3px; 28 border-top-left-radius: 3px;
|
/external/chromium_org/chrome/browser/resources/uber/ |
H A D | uber.css | 17 left: 0; 23 /* This value is different from the left value to compensate for the scroll 42 left: 0; 59 left: 0;
|