Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 81) sorted by relevance

1234

/lvgl-latest/src/libs/thorvg/rapidjson/
Dfilewritestream.h47 void PutN(char c, size_t n) { in PutN() argument
49 while (n > avail) { in PutN()
53 n -= avail; in PutN()
57 if (n > 0) { in PutN()
58 std::memset(current_, c, n); in PutN()
59 current_ += n; in PutN()
94 inline void PutN(FileWriteStream& stream, char c, size_t n) { in PutN() argument
95 stream.PutN(c, n); in PutN()
Dmemorybuffer.h64 inline void PutN(MemoryBuffer& memoryBuffer, char c, size_t n) { in PutN() argument
65 std::memset(memoryBuffer.stack_.Push<char>(n), c, n * sizeof(c)); in PutN()
Dallocators.h442 inline T *Malloc(A& a, size_t n = 1)
444 return Realloc<T, A>(a, NULL, 0, n);
448 inline void Free(A& a, T *p, size_t n = 1)
450 static_cast<void>(Realloc<T, A>(a, p, n, 0));
580 U* allocate(size_type n = 1, const void* = 0)
582 return RAPIDJSON_NAMESPACE::Malloc<U>(baseAllocator_, n);
585 void deallocate(U* p, size_type n = 1)
587 RAPIDJSON_NAMESPACE::Free<U>(baseAllocator_, p, n);
590 pointer allocate(size_type n = 1, const void* = 0)
592 return allocate<value_type>(n);
[all …]
Dstringbuffer.h111 inline void PutN(GenericStringBuffer<UTF8<> >& stream, char c, size_t n) { in PutN() argument
112 std::memset(stream.stack_.Push<char>(n), c, n * sizeof(c)); in PutN()
/lvgl-latest/src/misc/
Dlv_utils.c38 void * lv_utils_bsearch(const void * key, const void * base, size_t n, size_t size, in lv_utils_bsearch() argument
44 for(middle = base; n != 0;) { in lv_utils_bsearch()
45 middle += (n / 2) * size; in lv_utils_bsearch()
47 n = (n / 2) - ((n & 1) == 0); in lv_utils_bsearch()
51 n /= 2; in lv_utils_bsearch()
Dlv_area.c123 lv_area_t n; in lv_area_diff() local
130 n.x1 = a1_p->x1; in lv_area_diff()
131 n.y1 = a1_p->y1; in lv_area_diff()
132 n.x2 = a1_p->x2; in lv_area_diff()
133 n.y2 = a1_p->y1 + th; in lv_area_diff()
134 res_p[res_c++] = n; in lv_area_diff()
140 n.x1 = a1_p->x1; in lv_area_diff()
141 n.y1 = a2_p->y2; in lv_area_diff()
142 n.x2 = a1_p->x2; in lv_area_diff()
143 n.y2 = a2_p->y2 + bh; in lv_area_diff()
[all …]
Dlv_tree.h22 #define LV_TREE_NODE(n) ((lv_tree_node_t*)(n)) argument
/lvgl-latest/src/libs/thorvg/rapidjson/internal/
Dpow10.h28 inline double Pow10(int n) { in Pow10() argument
48 RAPIDJSON_ASSERT(n >= 0 && n <= 308); in Pow10()
49 return e[n]; in Pow10()
Ddtoa.h44 inline int CountDecimalDigit32(uint32_t n) { in CountDecimalDigit32() argument
46 if (n < 10) return 1; in CountDecimalDigit32()
47 if (n < 100) return 2; in CountDecimalDigit32()
48 if (n < 1000) return 3; in CountDecimalDigit32()
49 if (n < 10000) return 4; in CountDecimalDigit32()
50 if (n < 100000) return 5; in CountDecimalDigit32()
51 if (n < 1000000) return 6; in CountDecimalDigit32()
52 if (n < 10000000) return 7; in CountDecimalDigit32()
53 if (n < 100000000) return 8; in CountDecimalDigit32()
/lvgl-latest/src/libs/thorvg/
DtvgStr.cpp213 char* strDuplicate(const char *str, size_t n) in strDuplicate() argument
216 if (len < n) n = len; in strDuplicate()
218 auto ret = (char *) malloc(n + 1); in strDuplicate()
220 ret[n] = '\0'; in strDuplicate()
222 return (char *) memcpy(ret, str, n); in strDuplicate()
225 char* strAppend(char* lhs, const char* rhs, size_t n) in strAppend() argument
228 if (!lhs) return strDuplicate(rhs, n); in strAppend()
229 lhs = (char*)realloc(lhs, strlen(lhs) + n + 1); in strAppend()
230 return strncat(lhs, rhs, n); in strAppend()
DtvgStr.h35 char* strDuplicate(const char *str, size_t n); //copy the string
36 char* strAppend(char* lhs, const char* rhs, size_t n); //append the rhs to the lhs
DtvgTaskScheduler.cpp166 for (uint32_t n = 0; n < threads.count; ++n) { in request() local
167 if (taskQueues[(i + n) % threads.count]->tryPush(task)) return; in request()
/lvgl-latest/demos/ebike/translations/
Dlv_i18n.c49 uint32_t n = op_n(num); in en_plural_fn() local
50 LV_UNUSED(n); in en_plural_fn()
51 uint32_t i = op_i(n); in en_plural_fn()
53 uint32_t v = op_v(n); in en_plural_fn()
93 uint32_t n = op_n(num); in ar_plural_fn() local
94 LV_UNUSED(n); in ar_plural_fn()
96 uint32_t n100 = n % 100; in ar_plural_fn()
97 if(n == 0) return LV_I18N_PLURAL_TYPE_ZERO; in ar_plural_fn()
98 if(n == 1) return LV_I18N_PLURAL_TYPE_ONE; in ar_plural_fn()
99 if(n == 2) return LV_I18N_PLURAL_TYPE_TWO; in ar_plural_fn()
/lvgl-latest/tests/makefile_uefi/
Dtest.c11 void * memcpy(void * s, const void * ct, size_t n) in memcpy() argument
16 while(n-- > 0) { in memcpy()
24 void * memset(void * s, int c, size_t n) in memset() argument
28 while(n-- > 0) { in memset()
/lvgl-latest/src/libs/expat/
Dxmltok_impl.c48 # define IS_INVALID_CHAR(enc, ptr, n) (0) argument
51 # define INVALID_LEAD_CASE(n, ptr, nextTokPtr) \ argument
52 case BT_LEAD##n: \
53 if (end - ptr < n) \
55 if (IS_INVALID_CHAR(enc, ptr, n)) { \
59 ptr += n; \
72 # define CHECK_NAME_CASE(n, enc, ptr, end, nextTokPtr) \ argument
73 case BT_LEAD##n: \
74 if (end - ptr < n) \
76 if (IS_INVALID_CHAR(enc, ptr, n) || ! IS_NAME_CHAR(enc, ptr, n)) { \
[all …]
Dxmltok.c274 #define IS_NAME_CHAR(enc, p, n) (AS_NORMAL_ENCODING(enc)->isName##n(enc, p)) argument
275 #define IS_NMSTRT_CHAR(enc, p, n) (AS_NORMAL_ENCODING(enc)->isNmstrt##n(enc, p)) argument
277 # define IS_INVALID_CHAR(enc, p, n) \ argument
278 (AS_NORMAL_ENCODING(enc)->isInvalid##n \
279 && AS_NORMAL_ENCODING(enc)->isInvalid##n(enc, p))
281 # define IS_INVALID_CHAR(enc, p, n) \ argument
282 (AS_NORMAL_ENCODING(enc)->isInvalid##n(enc, p))
434 unsigned long n; in utf8_toUtf16() local
443 n = ((from[0] & 0x7) << 18) | ((from[1] & 0x3f) << 12) in utf8_toUtf16()
445 n -= 0x10000; in utf8_toUtf16()
[all …]
/lvgl-latest/src/stdlib/builtin/
Dlv_tlsf.c57 …#define TLSF_FLS(n) ((n) & 0xffffffff00000000ull ? 32 + TLSF_FLS32((size_t)(n) >> 32) : TLSF_FLS32… argument
59 #define TLSF_FLS(n) TLSF_FLS32(n) argument
62 #define TLSF_FLS32(n) ((n) & 0xffff0000 ? 16 + TLSF_FLS16((n) >> 16) : TLSF_FLS16(n)) argument
63 #define TLSF_FLS16(n) ((n) & 0xff00 ? 8 + TLSF_FLS8 ((n) >> 8) : TLSF_FLS8 (n)) argument
64 #define TLSF_FLS8(n) ((n) & 0xf0 ? 4 + TLSF_FLS4 ((n) >> 4) : TLSF_FLS4 (n)) argument
65 #define TLSF_FLS4(n) ((n) & 0xc ? 2 + TLSF_FLS2 ((n) >> 2) : TLSF_FLS2 (n)) argument
66 #define TLSF_FLS2(n) ((n) & 0x2 ? 1 + TLSF_FLS1 ((n) >> 1) : TLSF_FLS1 (n)) argument
67 #define TLSF_FLS1(n) ((n) & 0x1 ? 1 : 0) argument
73 #define TLSF_LOG2_CEIL(n) ((n) & (n - 1) ? TLSF_FLS(n) : TLSF_FLS(n) - 1) argument
/lvgl-latest/
DKconfig191 default n
288 default n
295 default n
310 default n
366 default n
371 default n
388 default n
392 default n
402 default n
412 default n
[all …]
/lvgl-latest/src/display/
Dlv_display.h622 #define LV_DPX_CALC(dpi, n) ((n) == 0 ? 0 :LV_MAX((( (dpi) * (n) + 80) / 160), 1)) /*+80 for roun… argument
623 #define LV_DPX(n) LV_DPX_CALC(lv_display_get_dpi(NULL), n) argument
634 int32_t lv_dpx(int32_t n);
646 int32_t lv_display_dpx(const lv_display_t * disp, int32_t n);
/lvgl-latest/scripts/
Dupdate_version.py83 replaced, n = re.subn(pattern, repl, line)
84 return replaced if n > 0 else None
102 replaced, n = re.subn(pattern, repl, line)
103 if n > 0:
141 replaced, n = re.subn(pattern, repl, line)
142 if n > 0:
/lvgl-latest/tests/src/test_libs/rnd_unicodes/rnd_unicodes/
DREADME.md28 printf("LEN: %d\n%s\n", len, chars);
36 …馇貤m臨v夛砃xPD7CWQq堾j稄3YmFw7Z欠P8PCcu7鶚68韾7KGgTN2P793L雙hy壒TGb螿虊C6m弩呚YBt0骇fAtn恔雸餙営n共1MeH嘿刑步焒簡RejV援21q77r…
/lvgl-latest/src/libs/qrcode/
Dqrcodegen.h142 #define qrcodegen_BUFFER_LEN_FOR_VERSION(n) ((((n) * 4 + 17) * ((n) * 4 + 17) + 7) / 8 + 1) argument
/lvgl-latest/src/libs/svg/
Dlv_svg.h327 #define LV_SVG_NODE_CHILD(n, i) \ argument
328 ((lv_svg_node_t *)(LV_TREE_NODE((n))->children[i]))
330 #define LV_SVG_NODE(n) ((lv_svg_node_t*)(n)) argument
Dlv_svg_render.h27 #define LV_SVG_RENDER_OBJ(n) ((lv_svg_render_obj_t*)(n)) argument
/lvgl-latest/tests/src/test_cases/
Dtest_tree.c82 lv_test_node_t * n = (lv_test_node_t *)node; in test_walk_cb() local
85 ret->result[ret->num++] = n->data1; in test_walk_cb()
156 lv_test_node_t * n = (lv_test_node_t *)node; in test_search_cb() local
159 if(n->data1 == 3) { in test_search_cb()
163 ret->result[ret->num++] = n->data1; in test_search_cb()

1234