Home
last modified time | relevance | path

Searched refs:chunks (Results 1 – 4 of 4) sorted by relevance

/rk3399_rockchip-uboot/common/
H A Ddlmalloc.src183 very small chunks.
266 Because freed chunks may be overwritten with link fields, this
595 int ordblks; /* number of non-inuse chunks */
634 afterward allocate more large chunks) the value should be high
654 program undergoes phases where several large chunks are
657 chunks at all. And in well-behaved long-lived programs,
721 Using mmap segregates relatively large chunks of memory so that
731 other chunks, as can happen with normally allocated chunks, which
737 used to service later requests, as happens with normal chunks.
1153 survey of such techniques.) Sizes of free chunks are stored both
[all …]
H A Dandroid_bootloader.c355 static char *strjoin(const char **chunks, char separator) in strjoin() argument
361 for (p = chunks; *p; p++) in strjoin()
376 for (p = chunks; *p; p++) { in strjoin()
/rk3399_rockchip-uboot/scripts/
H A Dcheckpatch.pl1451 my (@chunks);
1457 push(@chunks, [ $condition, $statement ]);
1459 return ($level, $linenr, @chunks);
1470 push(@chunks, [ $condition, $statement ]);
1473 return ($level, $linenr, @chunks);
5050 my ($level, $endln, @chunks) =
5054 if ($#chunks > 0 && $level == 0) {
5060 for my $chunk (@chunks) {
5121 my ($level, $endln, @chunks) =
5125 my ($cond, $block) = @{$chunks[0]};
[all …]
/rk3399_rockchip-uboot/fs/zfs/
H A Dzfs.c694 int i, chunks; in mzap_lookup() local
697 chunks = objsize / MZAP_ENT_LEN - 1; in mzap_lookup()
698 for (i = 0; i < chunks; i++) { in mzap_lookup()
716 int i, chunks; in mzap_iterate() local
719 chunks = objsize / MZAP_ENT_LEN - 1; in mzap_iterate()
720 for (i = 0; i < chunks; i++) { in mzap_iterate()