DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Mercurial (53149ead55cf)

VCS Links

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#include "primpl.h"

/*
** We override malloc etc. on any platform which has preemption +
** nspr20 user level threads.  When we're debugging, we can make our
** version of malloc fail occasionally.
*/
#ifdef _PR_OVERRIDE_MALLOC

/*
** Thread safe version of malloc, calloc, realloc, free
*/
#include <stdarg.h>

#ifdef DEBUG
#define SANITY
#define EXTRA_SANITY
#else
#undef SANITY
#undef EXTRA_SANITY
#endif

/* Forward decls */
void *_PR_UnlockedMalloc(size_t size);
void _PR_UnlockedFree(void *ptr);
void *_PR_UnlockedRealloc(void *ptr, size_t size);
void *_PR_UnlockedCalloc(size_t n, size_t elsize);

/************************************************************************/

/*
 * ----------------------------------------------------------------------------
 * "THE BEER-WARE LICENSE" (Revision 42):
 * <phk@FreeBSD.ORG> wrote this file.  As long as you retain this notice you
 * can do whatever you want with this stuff. If we meet some day, and you think
 * this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
 * ----------------------------------------------------------------------------
 *
 */

/*
 * Defining SANITY will enable some checks which will tell you if the users
 * program did botch something
 */

/*
 * Defining EXTRA_SANITY will enable some checks which are mostly related
 * to internal conditions in malloc.c
 */

/*
 * Very verbose progress on stdout...
 */
#if 0
#  define TRACE(foo)    printf  foo
static int malloc_event;
#else
#  define TRACE(foo)
#endif

/* XXX Pick a number, any number */
#   define malloc_pagesize      4096UL
#   define malloc_pageshift     12UL

#ifdef XP_UNIX
#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <string.h>
#include <errno.h>
#include <sys/types.h>
#include <sys/mman.h>
#endif

/*
 * This structure describes a page's worth of chunks.
 */

struct pginfo {
    struct pginfo   *next;  /* next on the free list */
    char        *page;  /* Pointer to the page */
    u_short     size;   /* size of this page's chunks */
    u_short     shift;  /* How far to shift for this size chunks */
    u_short     free;   /* How many free chunks */
    u_short     total;  /* How many chunk */
    u_long      bits[1]; /* Which chunks are free */
};

struct pgfree {
    struct pgfree   *next;  /* next run of free pages */
    struct pgfree   *prev;  /* prev run of free pages */
    char        *page;  /* pointer to free pages */
    char        *end;   /* pointer to end of free pages */
    u_long      size;   /* number of bytes free */
};

/*
 * How many bits per u_long in the bitmap.
 * Change only if not 8 bits/byte
 */
#define MALLOC_BITS (8*sizeof(u_long))

/*
 * Magic values to put in the page_directory
 */
#define MALLOC_NOT_MINE ((struct pginfo*) 0)
#define MALLOC_FREE     ((struct pginfo*) 1)
#define MALLOC_FIRST    ((struct pginfo*) 2)
#define MALLOC_FOLLOW   ((struct pginfo*) 3)
#define MALLOC_MAGIC    ((struct pginfo*) 4)

/*
 * Set to one when malloc_init has been called
 */
static  unsigned    initialized;

/*
 * The size of a page.
 * Must be a integral multiplum of the granularity of mmap(2).
 * Your toes will curl if it isn't a power of two
 */
#define malloc_pagemask ((malloc_pagesize)-1)

/*
 * The size of the largest chunk.
 * Half a page.
 */
#define malloc_maxsize  ((malloc_pagesize)>>1)

/*
 * malloc_pagesize == 1 << malloc_pageshift
 */
#ifndef malloc_pageshift
static  unsigned    malloc_pageshift;
#endif /* malloc_pageshift */

/*
 * The smallest allocation we bother about.
 * Must be power of two
 */
#ifndef malloc_minsize
static  unsigned  malloc_minsize;
#endif /* malloc_minsize */

/*
 * The largest chunk we care about.
 * Must be smaller than pagesize
 * Must be power of two
 */
#ifndef malloc_maxsize
static  unsigned  malloc_maxsize;
#endif /* malloc_maxsize */

#ifndef malloc_cache
static  unsigned  malloc_cache;
#endif /* malloc_cache */

/*
 * The offset from pagenumber to index into the page directory
 */
static  u_long  malloc_origo;

/*
 * The last index in the page directory we care about
 */
static  u_long  last_index;

/*
 * Pointer to page directory.
 * Allocated "as if with" malloc
 */
static  struct  pginfo **page_dir;

/*
 * How many slots in the page directory
 */
static  unsigned    malloc_ninfo;

/*
 * Free pages line up here
 */
static struct pgfree    free_list;

/*
 * Abort() if we fail to get VM ?
 */
static int malloc_abort;

#ifdef SANITY
/*
 * Are we trying to die ?
 */
static int suicide;
#endif

/*
 * dump statistics
 */
static int malloc_stats;

/*
 * always realloc ?
 */
static int malloc_realloc;

/*
 * my last break.
 */
static void *malloc_brk;

/*
 * one location cache for free-list holders
 */
static struct pgfree *px;

static int set_pgdir(void *ptr, struct  pginfo *info);
static int extend_page_directory(u_long index);

#ifdef SANITY
void
malloc_dump(FILE *fd)
{
    struct pginfo **pd;
    struct pgfree *pf;
    int j;

    pd = page_dir;

    /* print out all the pages */
    for(j=0; j<=last_index; j++) {
        fprintf(fd,"%08lx %5d ",(j+malloc_origo) << malloc_pageshift,j);
        if (pd[j] == MALLOC_NOT_MINE) {
            for(j++; j<=last_index && pd[j] == MALLOC_NOT_MINE; j++)
                ;
            j--;
            fprintf(fd,".. %5d not mine\n", j);
        } else if (pd[j] == MALLOC_FREE) {
            for(j++; j<=last_index && pd[j] == MALLOC_FREE; j++)
                ;
            j--;
            fprintf(fd,".. %5d free\n", j);
        } else if (pd[j] == MALLOC_FIRST) {
            for(j++; j<=last_index && pd[j] == MALLOC_FOLLOW; j++)
                ;
            j--;
            fprintf(fd,".. %5d in use\n", j);
        } else if (pd[j] < MALLOC_MAGIC) {
            fprintf(fd,"(%p)\n", pd[j]);
        } else {
            fprintf(fd,"%p %d (of %d) x %d @ %p --> %p\n",
                    pd[j],pd[j]->free, pd[j]->total,
                    pd[j]->size, pd[j]->page, pd[j]->next);
        }
    }

    for(pf=free_list.next; pf; pf=pf->next) {
        fprintf(fd,"Free: @%p [%p...%p[ %ld ->%p <-%p\n",
                pf,pf->page,pf->end,pf->size,pf->prev,pf->next);
        if (pf == pf->next) {
            fprintf(fd,"Free_list loops.\n");
            break;
        }
    }

    /* print out various info */
    fprintf(fd,"Minsize\t%d\n",malloc_minsize);
    fprintf(fd,"Maxsize\t%ld\n",malloc_maxsize);
    fprintf(fd,"Pagesize\t%ld\n",malloc_pagesize);
    fprintf(fd,"Pageshift\t%ld\n",malloc_pageshift);
    fprintf(fd,"FirstPage\t%ld\n",malloc_origo);
    fprintf(fd,"LastPage\t%ld %lx\n",last_index+malloc_pageshift,
            (last_index + malloc_pageshift) << malloc_pageshift);
    fprintf(fd,"Break\t%ld\n",(u_long)sbrk(0) >> malloc_pageshift);
}

static void wrterror(char *fmt, ...)
{
    char *q = "malloc() error: ";
    char buf[100];
    va_list ap;

    suicide = 1;

    va_start(ap, fmt);
    PR_vsnprintf(buf, sizeof(buf), fmt, ap);
    va_end(ap);
    fputs(q, stderr);
    fputs(buf, stderr);

    malloc_dump(stderr);
    PR_Abort();
}

static void wrtwarning(char *fmt, ...)
{
    char *q = "malloc() warning: ";
    char buf[100];
    va_list ap;

    va_start(ap, fmt);
    PR_vsnprintf(buf, sizeof(buf), fmt, ap);
    va_end(ap);
    fputs(q, stderr);
    fputs(buf, stderr);
}
#endif /* SANITY */


/*
 * Allocate a number of pages from the OS
 */
static caddr_t
map_pages(int pages, int update)
{
    caddr_t result,tail;

    result = ((caddr_t)sbrk(0)) + malloc_pagemask - 1;
    result = (caddr_t) ((u_long)result & ~malloc_pagemask);
    tail = result + (pages << malloc_pageshift);
    if (!brk(tail)) {
        last_index = ((u_long)tail >> malloc_pageshift) - malloc_origo -1;
        malloc_brk = tail;
        TRACE(("%6d S %p .. %p\n",malloc_event++, result, tail));
        if (!update || last_index < malloc_ninfo ||
            extend_page_directory(last_index)) {
            return result;
        }
    }
    TRACE(("%6d s %d %p %d\n",malloc_event++,pages,sbrk(0),errno));
#ifdef EXTRA_SANITY
    wrterror("map_pages fails\n");
#endif
    return 0;
}

#define set_bit(_pi,_bit) \
    (_pi)->bits[(_bit)/MALLOC_BITS] |= 1L<<((_bit)%MALLOC_BITS)

#define clr_bit(_pi,_bit) \
    (_pi)->bits[(_bit)/MALLOC_BITS] &= ~(1L<<((_bit)%MALLOC_BITS));

#define tst_bit(_pi,_bit) \
    ((_pi)->bits[(_bit)/MALLOC_BITS] & (1L<<((_bit)%MALLOC_BITS)))

/*
 * Extend page directory
 */
static int
extend_page_directory(u_long index)
{
    struct  pginfo **young, **old;
    int i;

    TRACE(("%6d E %lu\n",malloc_event++,index));

    /* Make it this many pages */
    i = index * sizeof *page_dir;
    i /= malloc_pagesize;
    i += 2;

    /* Get new pages, if you used this much mem you don't care :-) */
    young = (struct pginfo**) map_pages(i,0);
    if (!young) {
        return 0;
    }

    /* Copy the old stuff */
    memset(young, 0, i * malloc_pagesize);
    memcpy(young, page_dir,
           malloc_ninfo * sizeof *page_dir);

    /* register the new size */
    malloc_ninfo = i * malloc_pagesize / sizeof *page_dir;

    /* swap the pointers */
    old = page_dir;
    page_dir = young;

    /* Mark the pages */
    index = ((u_long)young >> malloc_pageshift) - malloc_origo;
    page_dir[index] = MALLOC_FIRST;
    while (--i) {
        page_dir[++index] = MALLOC_FOLLOW;
    }

    /* Now free the old stuff */
    _PR_UnlockedFree(old);
    return 1;
}

/*
 * Set entry in page directory.
 * Extend page directory if need be.
 */
static int
set_pgdir(void *ptr, struct  pginfo *info)
{
    u_long index = ((u_long)ptr >> malloc_pageshift) - malloc_origo;

    if (index >= malloc_ninfo && !extend_page_directory(index)) {
        return 0;
    }
    page_dir[index] = info;
    return 1;
}

/*
 * Initialize the world
 */
static void
malloc_init (void)
{
    int i;
    char *p;

    TRACE(("%6d I\n",malloc_event++));
#ifdef DEBUG
    for (p=getenv("MALLOC_OPTIONS"); p && *p; p++) {
        switch (*p) {
            case 'a': malloc_abort = 0; break;
            case 'A': malloc_abort = 1; break;
            case 'd': malloc_stats = 0; break;
            case 'D': malloc_stats = 1; break;
            case 'r': malloc_realloc = 0; break;
            case 'R': malloc_realloc = 1; break;
            default:
                wrtwarning("Unknown chars in MALLOC_OPTIONS\n");
                break;
        }
    }
#endif

#ifndef malloc_pagesize
    /* determine our pagesize */
    malloc_pagesize = getpagesize();
#endif /* malloc_pagesize */

#ifndef malloc_pageshift
    /* determine how much we shift by to get there */
    for (i = malloc_pagesize; i > 1; i >>= 1) {
        malloc_pageshift++;
    }
#endif /* malloc_pageshift */

#ifndef malloc_cache
    malloc_cache = 50 << malloc_pageshift;
#endif /* malloc_cache */

#ifndef malloc_minsize
    /*
     * find the smallest size allocation we will bother about.
     * this is determined as the smallest allocation that can hold
     * it's own pginfo;
     */
    i = 2;
    for(;;) {
        int j;

        /* Figure out the size of the bits */
        j = malloc_pagesize/i;
        j /= 8;
        if (j < sizeof(u_long)) {
            j = sizeof (u_long);
        }
        if (sizeof(struct pginfo) + j - sizeof (u_long) <= i) {
            break;
        }
        i += i;
    }
    malloc_minsize = i;
#endif /* malloc_minsize */


    /* Allocate one page for the page directory */
    page_dir = (struct pginfo **) map_pages(1,0);
#ifdef SANITY
    if (!page_dir) {
        wrterror("fatal: my first mmap failed.  (check limits ?)\n");
    }
#endif

    /*
     * We need a maximum of malloc_pageshift buckets, steal these from the
     * front of the page_directory;
     */
    malloc_origo = (u_long) page_dir >> malloc_pageshift;
    malloc_origo -= malloc_pageshift;

    /* Clear it */
    memset(page_dir,0,malloc_pagesize);

    /* Find out how much it tells us */
    malloc_ninfo = malloc_pagesize / sizeof *page_dir;

    /* Plug the page directory into itself */
    i = set_pgdir(page_dir,MALLOC_FIRST);
#ifdef SANITY
    if (!i) {
        wrterror("fatal: couldn't set myself in the page directory\n");
    }
#endif

    /* Been here, done that */
    initialized++;
}

/*
 * Allocate a number of complete pages
 */
static void *malloc_pages(size_t size)
{
    void *p,*delay_free = 0;
    int i;
    struct pgfree *pf;
    u_long index;

    /* How many pages ? */
    size += (malloc_pagesize-1);
    size &= ~malloc_pagemask;

    p = 0;
    /* Look for free pages before asking for more */
    for(pf = free_list.next; pf; pf = pf->next) {
#ifdef EXTRA_SANITY
        if (pf->page == pf->end) {
            wrterror("zero entry on free_list\n");
        }
        if (pf->page > pf->end) {
            TRACE(("%6d !s %p %p %p <%d>\n",malloc_event++,
                   pf,pf->page,pf->end,__LINE__));
            wrterror("sick entry on free_list\n");
        }
        if ((void*)pf->page >= (void*)sbrk(0)) {
            wrterror("entry on free_list past brk\n");
        }
        if (page_dir[((u_long)pf->page >> malloc_pageshift) - malloc_origo]
            != MALLOC_FREE) {
            TRACE(("%6d !f %p %p %p <%d>\n",malloc_event++,
                   pf,pf->page,pf->end,__LINE__));
            wrterror("non-free first page on free-list\n");
        }
        if (page_dir[((u_long)pf->end >> malloc_pageshift) - 1 - malloc_origo]
            != MALLOC_FREE) {
            wrterror("non-free last page on free-list\n");
        }
#endif /* EXTRA_SANITY */
        if (pf->size < size) {
            continue;
        }
        else if (pf->size == size) {
            p = pf->page;
            if (pf->next) {
                pf->next->prev = pf->prev;
            }
            pf->prev->next = pf->next;
            delay_free = pf;
            break;
        } else {
            p = pf->page;
            pf->page += size;
            pf->size -= size;
            break;
        }
    }
#ifdef EXTRA_SANITY
    if (p && page_dir[((u_long)p >> malloc_pageshift) - malloc_origo]
        != MALLOC_FREE) {
        wrterror("allocated non-free page on free-list\n");
    }
#endif /* EXTRA_SANITY */

    size >>= malloc_pageshift;

    /* Map new pages */
    if (!p) {
        p = map_pages(size,1);
    }

    if (p) {
        /* Mark the pages in the directory */
        index = ((u_long)p >> malloc_pageshift) - malloc_origo;
        page_dir[index] = MALLOC_FIRST;
        for (i=1; i<size; i++) {
            page_dir[index+i] = MALLOC_FOLLOW;
        }
    }
    if (delay_free) {
        if (!px) {
            px = (struct pgfree*)delay_free;
        }
        else {
            _PR_UnlockedFree(delay_free);
        }
    }
    return p;
}

/*
 * Allocate a page of fragments
 */

static int
malloc_make_chunks(int bits)
{
    struct  pginfo *bp;
    void *pp;
    int i,k,l;

    /* Allocate a new bucket */
    pp = malloc_pages(malloc_pagesize);
    if (!pp) {
        return 0;
    }
    l = sizeof *bp - sizeof(u_long);
    l += sizeof(u_long) *
         (((malloc_pagesize >> bits)+MALLOC_BITS-1) / MALLOC_BITS);
    if ((1<<(bits)) <= l+l) {
        bp = (struct  pginfo *)pp;
    } else {
        bp = (struct  pginfo *)_PR_UnlockedMalloc(l);
    }
    if (!bp) {
        return 0;
    }
    bp->size = (1<<bits);
    bp->shift = bits;
    bp->total = bp->free = malloc_pagesize >> bits;
    bp->next = page_dir[bits];
    bp->page = (char*)pp;
    i = set_pgdir(pp,bp);
    if (!i) {
        return 0;
    }

    /* We can safely assume that there is nobody in this chain */
    page_dir[bits] = bp;

    /* set all valid bits in the bits */
    k = bp->total;
    i = 0;
    /*
        for(;k-i >= MALLOC_BITS; i += MALLOC_BITS)
        bp->bits[i / MALLOC_BITS] = ~0;
    */
    for(; i < k; i++) {
        set_bit(bp,i);
    }

    if (bp != pp) {
        return 1;
    }

    /* We may have used the first ones already */
    for(i=0; l > 0; i++) {
        clr_bit(bp,i);
        bp->free--;
        bp->total--;
        l -= (1 << bits);
    }
    return 1;
}

/*
 * Allocate a fragment
 */
static void *malloc_bytes(size_t size)
{
    size_t s;
    int j;
    struct  pginfo *bp;
    int k;
    u_long *lp, bf;

    /* Don't bother with anything less than this */
    if (size < malloc_minsize) {
        size = malloc_minsize;
    }

    /* Find the right bucket */
    j = 1;
    s = size - 1;
    while (s >>= 1) {
        j++;
    }

    /* If it's empty, make a page more of that size chunks */
    if (!page_dir[j] && !malloc_make_chunks(j)) {
        return 0;
    }

    /* Find first word of bitmap which isn't empty */
    bp = page_dir[j];
    for (lp = bp->bits; !*lp; lp++)
        ;

    /* Find that bit */
    bf = *lp;
    k = 0;
    while ((bf & 1) == 0) {
        bf >>= 1;
        k++;
    }

    *lp ^= 1L<<k;                       /* clear it */
    bp->free--;
    if (!bp->free) {
        page_dir[j] = bp->next;
        bp->next = 0;
    }
    k += (lp - bp->bits)*MALLOC_BITS;
    return bp->page + (k << bp->shift);
}

void *_PR_UnlockedMalloc(size_t size)
{
    void *result;

    /* Round up to a multiple of 8 bytes */
    if (size & 7) {
        size = size + 8 - (size & 7);
    }

    if (!initialized) {
        malloc_init();
    }

#ifdef SANITY
    if (suicide) {
        PR_Abort();
    }
#endif

    if (size <= malloc_maxsize) {
        result =  malloc_bytes(size);
    }
    else {
        result =  malloc_pages(size);
    }
#ifdef SANITY
    if (malloc_abort && !result) {
        wrterror("malloc() returns NULL\n");
    }
#endif
    TRACE(("%6d M %p %d\n",malloc_event++,result,size));

    return result;
}

void *_PR_UnlockedMemalign(size_t alignment, size_t size)
{
    void *result;

    /*
     * alignment has to be a power of 2
     */

    if ((size <= alignment) && (alignment <= malloc_maxsize)) {
        size = alignment;
    }
    else {
        size += alignment - 1;
    }

    /* Round up to a multiple of 8 bytes */
    if (size & 7) {
        size = size + 8 - (size & 7);
    }

    if (!initialized) {
        malloc_init();
    }

#ifdef SANITY
    if (suicide) {
        abort();
    }
#endif

    if (size <= malloc_maxsize) {
        result =  malloc_bytes(size);
    }
    else {
        result =  malloc_pages(size);
    }
#ifdef SANITY
    if (malloc_abort && !result) {
        wrterror("malloc() returns NULL\n");
    }
#endif
    TRACE(("%6d A %p %d\n",malloc_event++,result,size));

    if ((u_long)result & (alignment - 1)) {
        return ((void *)(((u_long)result + alignment)  & ~(alignment - 1)));
    }
    else {
        return result;
    }
}

void *_PR_UnlockedCalloc(size_t n, size_t nelem)
{
    void *p;

    /* Compute total size and then round up to a double word amount */
    n *= nelem;
    if (n & 7) {
        n = n + 8 - (n & 7);
    }

    /* Get the memory */
    p = _PR_UnlockedMalloc(n);
    if (p) {
        /* Zero it */
        memset(p, 0, n);
    }
    return p;
}

/*
 * Change an allocation's size
 */
void *_PR_UnlockedRealloc(void *ptr, size_t size)
{
    void *p;
    u_long osize,page,index,tmp_index;
    struct pginfo **mp;

    if (!initialized) {
        malloc_init();
    }

#ifdef SANITY
    if (suicide) {
        PR_Abort();
    }
#endif

    /* used as free() */
    TRACE(("%6d R %p %d\n",malloc_event++, ptr, size));
    if (ptr && !size) {
        _PR_UnlockedFree(ptr);
        return _PR_UnlockedMalloc (1);
    }

    /* used as malloc() */
    if (!ptr) {
        p = _PR_UnlockedMalloc(size);
        return p;
    }

    /* Find the page directory entry for the page in question */
    page = (u_long)ptr >> malloc_pageshift;
    index = page - malloc_origo;

    /*
     * check if memory was allocated by memalign
     */
    tmp_index = index;
    while (page_dir[tmp_index] == MALLOC_FOLLOW) {
        tmp_index--;
    }
    if (tmp_index != index) {
        /*
         * memalign-allocated memory
         */
        index = tmp_index;
        page = index + malloc_origo;
        ptr = (void *) (page << malloc_pageshift);
    }
    TRACE(("%6d R2 %p %d\n",malloc_event++, ptr, size));

    /* make sure it makes sense in some fashion */
    if (index < malloc_pageshift || index > last_index) {
#ifdef SANITY
        wrtwarning("junk pointer passed to realloc()\n");
#endif
        return 0;
    }

    /* find the size of that allocation, and see if we need to relocate */
    mp = &page_dir[index];
    if (*mp == MALLOC_FIRST) {
        osize = malloc_pagesize;
        while (mp[1] == MALLOC_FOLLOW) {
            osize += malloc_pagesize;
            mp++;
        }
        if (!malloc_realloc &&
            size < osize &&
            size > malloc_maxsize &&
            size > (osize - malloc_pagesize)) {
            return ptr;
        }
    } else if (*mp >= MALLOC_MAGIC) {
        osize = (*mp)->size;
        if (!malloc_realloc &&
            size < osize &&
            (size > (*mp)->size/2 || (*mp)->size == malloc_minsize)) {
            return ptr;
        }
    } else {
#ifdef SANITY
        wrterror("realloc() of wrong page.\n");
#endif
    }

    /* try to reallocate */
    p = _PR_UnlockedMalloc(size);

    if (p) {
        /* copy the lesser of the two sizes */
        if (osize < size) {
            memcpy(p,ptr,osize);
        }
        else {
            memcpy(p,ptr,size);
        }
        _PR_UnlockedFree(ptr);
    }
#ifdef DEBUG
    else if (malloc_abort) {
        wrterror("realloc() returns NULL\n");
    }
#endif

    return p;
}

/*
 * Free a sequence of pages
 */

static void
free_pages(char *ptr, u_long page, int index, struct pginfo *info)
{
    int i;
    struct pgfree *pf,*pt;
    u_long l;
    char *tail;

    TRACE(("%6d FP %p %d\n",malloc_event++, ptr, page));
    /* Is it free already ? */
    if (info == MALLOC_FREE) {
#ifdef SANITY
        wrtwarning("freeing free page at %p.\n", ptr);
#endif
        return;
    }

#ifdef SANITY
    /* Is it not the right place to begin ? */
    if (info != MALLOC_FIRST) {
        wrterror("freeing wrong page.\n");
    }

    /* Is this really a pointer to a page ? */
    if ((u_long)ptr & malloc_pagemask) {
        wrterror("freeing messed up page pointer.\n");
    }
#endif

    /* Count how many pages it is anyway */
    page_dir[index] = MALLOC_FREE;
    for (i = 1; page_dir[index+i] == MALLOC_FOLLOW; i++) {
        page_dir[index + i] = MALLOC_FREE;
    }

    l = i << malloc_pageshift;

    tail = ptr+l;

    /* add to free-list */
    if (!px) {
        px = (struct pgfree*)_PR_UnlockedMalloc(sizeof *pt);
    }
    /* XXX check success */
    px->page = ptr;
    px->end =  tail;
    px->size = l;
    if (!free_list.next) {
        px->next = free_list.next;
        px->prev = &free_list;
        free_list.next = px;
        pf = px;
        px = 0;
    } else {
        tail = ptr+l;
        for(pf = free_list.next; pf->next && pf->end < ptr; pf = pf->next)
            ;
        for(; pf; pf = pf->next) {
            if (pf->end == ptr ) {
                /* append to entry */
                pf->end += l;
                pf->size += l;
                if (pf->next && pf->end == pf->next->page ) {
                    pt = pf->next;
                    pf->end = pt->end;
                    pf->size += pt->size;
                    pf->next = pt->next;
                    if (pf->next) {
                        pf->next->prev = pf;
                    }
                    _PR_UnlockedFree(pt);
                }
            } else if (pf->page == tail) {
                /* prepend to entry */
                pf->size += l;
                pf->page = ptr;
            } else if (pf->page > ptr) {
                px->next = pf;
                px->prev = pf->prev;
                pf->prev = px;
                px->prev->next = px;
                pf = px;
                px = 0;
            } else if (!pf->next) {
                px->next = 0;
                px->prev = pf;
                pf->next = px;
                pf = px;
                px = 0;
            } else {
                continue;
            }
            break;
        }
    }
    if (!pf->next &&
        pf->size > malloc_cache &&
        pf->end == malloc_brk &&
        malloc_brk == (void*)sbrk(0)) {
        pf->end = pf->page + malloc_cache;
        pf->size = malloc_cache;
        TRACE(("%6d U %p %d\n",malloc_event++,pf->end,pf->end - pf->page));
        brk(pf->end);
        malloc_brk = pf->end;
        /* Find the page directory entry for the page in question */
        page = (u_long)pf->end >> malloc_pageshift;
        index = page - malloc_origo;
        /* Now update the directory */
        for(i=index; i <= last_index;) {
            page_dir[i++] = MALLOC_NOT_MINE;
        }
        last_index = index - 1;
    }
}

/*
 * Free a chunk, and possibly the page it's on, if the page becomes empty.
 */

static void
free_bytes(void *ptr, u_long page, int index, struct pginfo *info)
{
    int i;
    struct pginfo **mp;
    void *vp;

    /* Make sure that pointer is multiplum of chunk-size */
#ifdef SANITY
    if ((u_long)ptr & (info->size - 1)) {
        wrterror("freeing messed up chunk pointer\n");
    }
#endif

    /* Find the chunk number on the page */
    i = ((u_long)ptr & malloc_pagemask) >> info->shift;

    /* See if it's free already */
    if (tst_bit(info,i)) {
#ifdef SANITY
        wrtwarning("freeing free chunk at %p\n", ptr);
#endif
        return;
    }

    /* Mark it free */
    set_bit(info,i);
    info->free++;

    /* If the page was full before, we need to put it on the queue now */
    if (info->free == 1) {
        mp = page_dir + info->shift;
        while (*mp && (*mp)->next && (*mp)->next->page < info->page) {
            mp = &(*mp)->next;
        }
        info->next = *mp;
        *mp = info;
        return;
    }

    /* If this page isn't empty, don't do anything. */
    if (info->free != info->total) {
        return;
    }

    /* We may want to keep at least one page of each size chunks around.  */
    mp = page_dir + info->shift;
    if (0 && (*mp == info) && !info->next) {
        return;
    }

    /* Find & remove this page in the queue */
    while (*mp != info) {
        mp = &((*mp)->next);
#ifdef EXTRA_SANITY
        if (!*mp) {
            TRACE(("%6d !q %p\n",malloc_event++,info));
            wrterror("Not on queue\n");
        }
#endif
    }
    *mp = info->next;

    /* Free the page & the info structure if need be */
    set_pgdir(info->page,MALLOC_FIRST);
    if((void*)info->page == (void*)info) {
        _PR_UnlockedFree(info->page);
    } else {
        vp = info->page;
        _PR_UnlockedFree(info);
        _PR_UnlockedFree(vp);
    }
}

void _PR_UnlockedFree(void *ptr)
{
    u_long page;
    struct pginfo *info;
    int index, tmp_index;

    TRACE(("%6d F %p\n",malloc_event++,ptr));
    /* This is legal */
    if (!ptr) {
        return;
    }

#ifdef SANITY
    /* There wouldn't be anything to free */
    if (!initialized) {
        wrtwarning("free() called before malloc() ever got called\n");
        return;
    }
#endif

#ifdef SANITY
    if (suicide) {
        PR_Abort();
    }
#endif

    /* Find the page directory entry for the page in question */
    page = (u_long)ptr >> malloc_pageshift;
    index = page - malloc_origo;

    /*
     * check if memory was allocated by memalign
     */
    tmp_index = index;
    while (page_dir[tmp_index] == MALLOC_FOLLOW) {
        tmp_index--;
    }
    if (tmp_index != index) {
        /*
         * memalign-allocated memory
         */
        index = tmp_index;
        page = index + malloc_origo;
        ptr = (void *) (page << malloc_pageshift);
    }
    /* make sure it makes sense in some fashion */
    if (index < malloc_pageshift) {
#ifdef SANITY
        wrtwarning("junk pointer %p (low) passed to free()\n", ptr);
#endif
        return;
    }
    if (index > last_index) {
#ifdef SANITY
        wrtwarning("junk pointer %p (high) passed to free()\n", ptr);
#endif
        return;
    }

    /* handle as page-allocation or chunk allocation */
    info = page_dir[index];
    if (info < MALLOC_MAGIC) {
        free_pages((char*)ptr, page, index, info);
    }
    else {
        free_bytes(ptr,page,index,info);
    }
    return;
}
#endif /* _PR_OVERRIDE_MALLOC */