Searched refs:left (Results 276 - 300 of 1423) sorted by relevance

<<11121314151617181920>>

/external/wpa_supplicant_8/wpa_supplicant/src/eap_server/
H A Deap_server_tls_common.c326 const u8 **pos, size_t *left)
329 const u8 *end = *pos + *left;
332 if (*left < 4) {
341 *left -= 4;
343 if (*left > tls_msg_len) {
346 "bytes)", (int) tls_msg_len, (int) *left);
355 if (*left != 0) {
426 size_t left; local
432 &left);
436 &left);
325 eap_server_tls_reassemble(struct eap_ssl_data *data, u8 flags, const u8 **pos, size_t *left) argument
[all...]
H A Deap_server_psk.c219 size_t left, buflen; local
229 &left);
230 if (cpos == NULL || left < sizeof(*resp)) {
236 left -= sizeof(*resp);
239 data->id_p = os_malloc(left);
245 os_memcpy(data->id_p, cpos, left);
246 data->id_p_len = left;
335 size_t left; local
343 pos = eap_hdr_validate(EAP_VENDOR_IETF, EAP_TYPE_PSK, respData, &left);
344 if (pos == NULL || left < sizeo
[all...]
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/
H A DDynamicTableModel.java31 * an order of COLUMN_MAJOR are traversed left to right column by column until
99 * @return a RectF representing the first (top-left) element in
104 cellRect.left = tableRect.left;
109 cellRect.right = tableRect.left + calculateCellSize(tableRect, TableModel.Axis.COLUMN, numElements);
249 nextElementRect.offsetTo(tableRect.left, lastElementRect.bottom);
266 nextElementRect.offsetTo(lastElementRect.left, lastElementRect.bottom);
/external/clang/include/clang/Basic/
H A DObjCRuntime.h301 friend bool operator==(const ObjCRuntime &left, const ObjCRuntime &right) { argument
302 return left.getKind() == right.getKind() &&
303 left.getVersion() == right.getVersion();
306 friend bool operator!=(const ObjCRuntime &left, const ObjCRuntime &right) { argument
307 return !(left == right);
/external/guava/guava/src/com/google/common/primitives/
H A DUnsignedInts.java161 public int compare(int[] left, int[] right) { argument
162 int minLength = Math.min(left.length, right.length);
164 if (left[i] != right[i]) {
165 return UnsignedInts.compare(left[i], right[i]);
168 return left.length - right.length;
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DTreeTraverserTest.java49 final BinaryTree left; field in class:TreeTraverserTest.BinaryTree
53 private BinaryTree(char value, BinaryTree left, BinaryTree right) { argument
55 this.left = left;
72 return Optional.fromNullable(node.left);
/external/guava/guava-tests/test/com/google/common/collect/
H A DTreeTraverserTest.java51 final BinaryTree left; field in class:TreeTraverserTest.BinaryTree
55 private BinaryTree(char value, BinaryTree left, BinaryTree right) { argument
57 this.left = left;
74 return Optional.fromNullable(node.left);
/external/guava/guava-tests/test/com/google/common/primitives/
H A DByteArrayAsListTest.java117 private static Byte[] concat(Byte[] left, Byte[] right) { argument
118 Byte[] result = new Byte[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
H A DCharArrayAsListTest.java117 private static Character[] concat(Character[] left, Character[] right) { argument
118 Character[] result = new Character[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
H A DDoubleArrayAsListTest.java117 private static Double[] concat(Double[] left, Double[] right) { argument
118 Double[] result = new Double[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
H A DFloatArrayAsListTest.java117 private static Float[] concat(Float[] left, Float[] right) { argument
118 Float[] result = new Float[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
H A DIntArrayAsListTest.java118 private static Integer[] concat(Integer[] left, Integer[] right) { argument
119 Integer[] result = new Integer[left.length + right.length];
120 System.arraycopy(left, 0, result, 0, left.length);
121 System.arraycopy(right, 0, result, left.length, right.length);
H A DLongArrayAsListTest.java117 private static Long[] concat(Long[] left, Long[] right) { argument
118 Long[] result = new Long[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
H A DShortArrayAsListTest.java117 private static Short[] concat(Short[] left, Short[] right) { argument
118 Short[] result = new Short[left.length + right.length];
119 System.arraycopy(left, 0, result, 0, left.length);
120 System.arraycopy(right, 0, result, left.length, right.length);
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/stringprep/
H A DNFS4StringPrep.java102 int left, middle, right,rc;
104 left =0;
107 while(left <= right){
108 middle = (left+right)/2;
112 left = middle+1;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_string.h198 size_t left; member in struct:util_strbuf
208 sbuf->left = size;
215 if(sbuf->left > 1) {
219 written = util_vsnprintf(sbuf->ptr, sbuf->left, format, ap);
222 sbuf->left -= written;
/external/pdfium/fpdfsdk/src/pdfwindow/
H A DPWL_Caret.cpp52 FX_FLOAT fCaretX = rcRect.left + m_fWidth * 0.5f;
99 sCaret << rcClip.left << " " << rcClip.bottom + 2.5f << " "
100 << rcClip.right - rcClip.left << " " << rcClip.top - rcClip.bottom - 4.5f << " re W n\n";
103 sCaret << rcRect.left + m_fWidth/2 << " " << rcRect.bottom << " m\n";
104 sCaret << rcRect.left + m_fWidth/2 << " " << rcRect.top << " l S\nQ\n";
/external/skia/debugger/QT/
H A DSkListWidget.cpp27 QLinearGradient gradientSelected(r.left(),r.top(),r.left(),r.height()+r.top());
77 * x1,y1 act as a margin for the top and left. The target area will not
98 painter->drawText(r.left(), r.top(), r.width(), r.height(),
103 painter->drawText(r.left(), r.top(), r.width(), r.height(),
109 painter->drawText(r.left(), r.top(), r.width(), r.height(),
/external/skia/gm/
H A Dpatch.cpp31 SkPoint left[SkPatchUtils::kNumPtsCubic]; local
32 SkPatchUtils::getLeftCubic(cubics, left);
42 canvas->drawPoints(SkCanvas::kLines_PointMode, 4, left, paint);
46 canvas->drawPoints(SkCanvas::kLines_PointMode, 2, left + 1, paint);
61 canvas->drawPoints(SkCanvas::kPoints_PointMode, 2, left + 1, paint);
91 // The order of the colors and points is clockwise starting at upper-left corner.
99 //left points
/external/v8/src/compiler/
H A Dnode-matchers.h107 // For shorter pattern matching code, this struct matches both the left and
109 // if they appear on the left hand side of a commutative operation.
117 const Left& left() const { return left_; } function in struct:v8::internal::compiler::FINAL
120 bool IsFoldable() const { return left().HasValue() && right().HasValue(); }
121 bool LeftEqualsRight() const { return left().node() == right().node(); }
125 if (left().HasValue() && !right().HasValue()) {
127 node()->ReplaceInput(0, left().node());
/external/webp/src/dec/
H A Dtree.c285 uint8_t* const left = dec->intra_l_; local
308 memset(left, ymode, 4 * sizeof(*left));
313 int ymode = left[y];
340 left[y] = ymode;
/external/wpa_supplicant_8/hostapd/src/eap_server/
H A Deap_server_psk.c219 size_t left, buflen; local
229 &left);
230 if (cpos == NULL || left < sizeof(*resp)) {
236 left -= sizeof(*resp);
239 data->id_p = os_malloc(left);
245 os_memcpy(data->id_p, cpos, left);
246 data->id_p_len = left;
335 size_t left; local
343 pos = eap_hdr_validate(EAP_VENDOR_IETF, EAP_TYPE_PSK, respData, &left);
344 if (pos == NULL || left < sizeo
[all...]
/external/wpa_supplicant_8/src/eap_server/
H A Deap_server_psk.c219 size_t left, buflen; local
229 &left);
230 if (cpos == NULL || left < sizeof(*resp)) {
236 left -= sizeof(*resp);
239 data->id_p = os_malloc(left);
245 os_memcpy(data->id_p, cpos, left);
246 data->id_p_len = left;
335 size_t left; local
343 pos = eap_hdr_validate(EAP_VENDOR_IETF, EAP_TYPE_PSK, respData, &left);
344 if (pos == NULL || left < sizeo
[all...]
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dbezier.c43 static INLINE void split_left(struct bezier *bez, VGfloat t, struct bezier* left) argument
45 left->x1 = bez->x1;
46 left->y1 = bez->y1;
48 left->x2 = bez->x1 + t * (bez->x2 - bez->x1);
49 left->y2 = bez->y1 + t * (bez->y2 - bez->y1);
51 left->x3 = bez->x2 + t * (bez->x3 - bez->x2);
52 left->y3 = bez->y2 + t * (bez->y3 - bez->y2);
57 bez->x2 = left->x3 + t * (bez->x3 - left->x3);
58 bez->y2 = left
136 struct bezier left, right; /* bez poly splits */ local
660 struct bezier left; local
[all...]
/external/opencv/cxcore/include/
H A Dcxmisc.h445 T* left = stack[sp].lb; \
450 int i, n = (int)(right - left) + 1, m; \
457 for( ptr = left + 1; ptr <= right; ptr++ ) \
459 for( ptr2 = ptr; ptr2 > left && LT(ptr2[0],ptr2[-1]); ptr2--) \
476 left0 = left; \
478 pivot = left + (n/2); \
483 a = left, b = left + d, c = left + 2*d; \
484 left
[all...]

Completed in 3607 milliseconds

<<11121314151617181920>>