Home
last modified time | relevance | path

Searched refs:amount (Results 1 – 8 of 8) sorted by relevance

/third_party/uapp/dash/src/
A Dmemalloc.h95 #define STADJUST(amount, p) (p += (amount)) argument
A Dshow.c240 indent(int amount, char *pfx, FILE *fp) in indent() argument
244 for (i = 0 ; i < amount ; i++) { in indent()
245 if (pfx && i == amount - 1) in indent()
A Dmknodes.c461 indent(int amount, FILE *fp) in indent() argument
463 while (amount >= 8) { in indent()
465 amount -= 8; in indent()
467 while (--amount >= 0) { in indent()
A Dexpand.c648 int amount; in subevalvar() local
663 amount = startp - expdest; in subevalvar()
664 STADJUST(amount, expdest); in subevalvar()
703 amount = loc - expdest; in subevalvar()
704 STADJUST(amount, expdest); in subevalvar()
810 int amount = expdest - ( in evalvar() local
813 STADJUST(-amount, expdest); in evalvar()
A DTOUR68 cluded that the optimal amount to indent is in the range of four
/third_party/ulib/uboringssl/include/openssl/
A Dthread.h128 int *num, int amount, int lock_num, const char *file, int line));
/third_party/ulib/jemalloc/
A DChangeLog127 - Fix the linear scan version of bitmap_sfu() to shift by the proper amount
256 This is a bugfix release that is somewhat high risk due to the amount of
915 limit the amount of memory consumed by heap profiling data structures.
/third_party/lib/acpica/
A Dchanges.txt2127 max. The original purpose of this constraint was to limit the amount of
14581 simplifying the source code and reducing the amount of generated
16185 parse tree and therefore reduces the amount of dynamic memory

Completed in 28 milliseconds