osfmk/ipc/ipc_space.c

   1 /*
   2  * Copyright (c) 2000-2004 Apple Computer, Inc. All rights reserved.
   3  *
   4  * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
   5  *
   6  * This file contains Original Code and/or Modifications of Original Code
   7  * as defined in and that are subject to the Apple Public Source License
   8  * Version 2.0 (the 'License'). You may not use this file except in
   9  * compliance with the License. The rights granted to you under the License
  10  * may not be used to create, or enable the creation or redistribution of,
  11  * unlawful or unlicensed copies of an Apple operating system, or to
  12  * circumvent, violate, or enable the circumvention or violation of, any
  13  * terms of an Apple operating system software license agreement.
  14  *
  15  * Please obtain a copy of the License at
  16  * http://www.opensource.apple.com/apsl/ and read it before using this file.
  17  *
  18  * The Original Code and all software distributed under the License are
  19  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
  20  * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
  21  * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
  22  * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
  23  * Please see the License for the specific language governing rights and
  24  * limitations under the License.
  25  *
  26  * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
  27  */
  28 /*
  29  * @OSF_COPYRIGHT@
  30  */
  31 /*
  32  * Mach Operating System
  33  * Copyright (c) 1991,1990,1989 Carnegie Mellon University
  34  * All Rights Reserved.
  35  *
  36  * Permission to use, copy, modify and distribute this software and its
  37  * documentation is hereby granted, provided that both the copyright
  38  * notice and this permission notice appear in all copies of the
  39  * software, derivative works or modified versions, and any portions
  40  * thereof, and that both notices appear in supporting documentation.
  41  *
  42  * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
  43  * CONDITION.  CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
  44  * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
  45  *
  46  * Carnegie Mellon requests users of this software to return to
  47  *
  48  *  Software Distribution Coordinator  or  Software.Distribution@CS.CMU.EDU
  49  *  School of Computer Science
  50  *  Carnegie Mellon University
  51  *  Pittsburgh PA 15213-3890
  52  *
  53  * any improvements or extensions that they make and grant Carnegie Mellon
  54  * the rights to redistribute these changes.
  55  */
  56 /*
  57  * NOTICE: This file was modified by McAfee Research in 2004 to introduce
  58  * support for mandatory and extensible security protections.  This notice
  59  * is included in support of clause 2.2 (b) of the Apple Public License,
  60  * Version 2.0.
  61  */
  62 /*
  63  */
  64 /*
  65  *      File:   ipc/ipc_space.c
  66  *      Author: Rich Draves
  67  *      Date:   1989
  68  *
  69  *      Functions to manipulate IPC capability spaces.
  70  */
  71
  72 #include <mach/boolean.h>
  73 #include <mach/kern_return.h>
  74 #include <mach/port.h>
  75 #include <kern/assert.h>
  76 #include <kern/sched_prim.h>
  77 #include <kern/zalloc.h>
  78 #include <ipc/port.h>
  79 #include <ipc/ipc_entry.h>
  80 #include <ipc/ipc_object.h>
  81 #include <ipc/ipc_hash.h>
  82 #include <ipc/ipc_table.h>
  83 #include <ipc/ipc_port.h>
  84 #include <ipc/ipc_space.h>
  85 #include <ipc/ipc_right.h>
  86 #include <prng/random.h>
  87 #include <string.h>
  88
  89 /* Remove this in the future so port names are less predictable. */
  90 #define CONFIG_SEMI_RANDOM_ENTRIES
  91 #ifdef CONFIG_SEMI_RANDOM_ENTRIES
  92 #define NUM_SEQ_ENTRIES 8
  93 #endif
  94
  95 zone_t ipc_space_zone;
  96 ipc_space_t ipc_space_kernel;
  97 ipc_space_t ipc_space_reply;
  98
  99 /*
 100  *      Routine:        ipc_space_reference
 101  *      Routine:        ipc_space_release
 102  *      Purpose:
 103  *              Function versions of the IPC space inline reference.
 104  */
 105
 106 void
 107 ipc_space_reference(
 108         ipc_space_t     space)
 109 {
 110         is_reference(space);
 111 }
 112
 113 void
 114 ipc_space_release(
 115         ipc_space_t     space)
 116 {
 117         is_release(space);
 118 }
 119
 120 /*      Routine:                ipc_space_get_rollpoint
 121  *      Purpose:
 122  *              Generate a new gencount rollover point from a space's entropy pool
 123  */
 124 ipc_entry_bits_t
 125 ipc_space_get_rollpoint(
 126         ipc_space_t     space)
 127 {
 128         return random_bool_gen_bits(
 129                         &space->bool_gen,
 130                         &space->is_entropy[0],
 131                         IS_ENTROPY_CNT,
 132                         IE_BITS_ROLL_BITS);
 133 }
 134
 135 /*
 136  *      Routine:        ipc_entry_rand_freelist
 137  *      Purpose:
 138  *              Pseudo-randomly permute the order of entries in an IPC space
 139  *      Arguments:
 140  *              space:  the ipc space to initialize.
 141  *              table:  the corresponding ipc table to initialize.
 142  *              bottom: the start of the range to initialize (inclusive).
 143  *              top:    the end of the range to initialize (noninclusive).
 144  */
 145 void
 146 ipc_space_rand_freelist(
 147         ipc_space_t             space,
 148         ipc_entry_t             table,
 149         mach_port_index_t       bottom,
 150         mach_port_index_t       top)
 151 {
 152 #ifdef CONFIG_SEMI_RANDOM_ENTRIES
 153         /*
 154          * Only make sequential entries at the start of the table, and not when
 155          * we're growing the space.
 156          */
 157         int at_start = (bottom == 0);
 158         ipc_entry_num_t total = 0;
 159 #endif
 160
 161         /* First entry in the free list is always free, and is the start of the free list. */
 162         mach_port_index_t curr = bottom;
 163         bottom++;
 164         top--;
 165
 166         /*
 167          *      Initialize the free list in the table.
 168          *      Add the entries in pseudo-random order and randomly set the generation
 169          *      number, in order to frustrate attacks involving port name reuse.
 170          */
 171         while (bottom <= top) {
 172                 ipc_entry_t entry = &table[curr];
 173                 int which;
 174 #ifdef CONFIG_SEMI_RANDOM_ENTRIES
 175                 /*
 176                  * XXX: This is a horrible hack to make sure that randomizing the port
 177                  * doesn't break programs that might have (sad) hard-coded values for
 178                  * certain port names.
 179                  */
 180                 if (at_start && total++ < NUM_SEQ_ENTRIES)
 181                         which = 0;
 182                 else
 183 #endif
 184                         which = random_bool_gen_bits(
 185                                                 &space->bool_gen,
 186                                                 &space->is_entropy[0],
 187                                                 IS_ENTROPY_CNT,
 188                                                 1);
 189
 190                 mach_port_index_t next;
 191                 if (which) {
 192                         next = top;
 193                         top--;
 194                 } else {
 195                         next = bottom;
 196                         bottom++;
 197                 }
 198
 199                 /*
 200                  * The entry's gencount will roll over on its first allocation, at which
 201                  * point a random rollover will be set for the entry.
 202                  */
 203                 entry->ie_bits = IE_BITS_GEN_MASK;
 204                 entry->ie_next   = next;
 205                 entry->ie_object = IO_NULL;
 206                 entry->ie_index  = 0;
 207                 curr = next;
 208         }
 209         table[curr].ie_next   = 0;
 210         table[curr].ie_object = IO_NULL;
 211         table[curr].ie_index  = 0;
 212         table[curr].ie_bits   = IE_BITS_GEN_MASK;
 213 }
 214
 215
 216 /*
 217  *      Routine:        ipc_space_create
 218  *      Purpose:
 219  *              Creates a new IPC space.
 220  *
 221  *              The new space has two references, one for the caller
 222  *              and one because it is active.
 223  *      Conditions:
 224  *              Nothing locked.  Allocates memory.
 225  *      Returns:
 226  *              KERN_SUCCESS            Created a space.
 227  *              KERN_RESOURCE_SHORTAGE  Couldn't allocate memory.
 228  */
 229
 230 kern_return_t
 231 ipc_space_create(
 232         ipc_table_size_t        initial,
 233         ipc_space_t             *spacep)
 234 {
 235         ipc_space_t space;
 236         ipc_entry_t table;
 237         ipc_entry_num_t new_size;
 238
 239         space = is_alloc();
 240         if (space == IS_NULL)
 241                 return KERN_RESOURCE_SHORTAGE;
 242
 243         table = it_entries_alloc(initial);
 244         if (table == IE_NULL) {
 245                 is_free(space);
 246                 return KERN_RESOURCE_SHORTAGE;
 247         }
 248
 249         new_size = initial->its_size;
 250         memset((void *) table, 0, new_size * sizeof(struct ipc_entry));
 251
 252         /* Set to 0 so entropy pool refills */
 253         memset((void *) space->is_entropy, 0, sizeof(space->is_entropy));
 254
 255         random_bool_init(&space->bool_gen);
 256         ipc_space_rand_freelist(space, table, 0, new_size);
 257
 258         is_lock_init(space);
 259         space->is_bits = 2; /* 2 refs, active, not growing */
 260         space->is_table_size = new_size;
 261         space->is_table_free = new_size - 1;
 262         space->is_table = table;
 263         space->is_table_next = initial+1;
 264         space->is_task = NULL;
 265         space->is_low_mod = new_size;
 266         space->is_high_mod = 0;
 267         space->is_node_id = HOST_LOCAL_NODE; /* HOST_LOCAL_NODE, except proxy spaces */
 268
 269         *spacep = space;
 270         return KERN_SUCCESS;
 271 }
 272
 273 /*
 274  *      Routine:        ipc_space_create_special
 275  *      Purpose:
 276  *              Create a special space.  A special space
 277  *              doesn't hold rights in the normal way.
 278  *              Instead it is place-holder for holding
 279  *              disembodied (naked) receive rights.
 280  *              See ipc_port_alloc_special/ipc_port_dealloc_special.
 281  *      Conditions:
 282  *              Nothing locked.
 283  *      Returns:
 284  *              KERN_SUCCESS            Created a space.
 285  *              KERN_RESOURCE_SHORTAGE  Couldn't allocate memory.
 286  */
 287
 288 kern_return_t
 289 ipc_space_create_special(
 290         ipc_space_t     *spacep)
 291 {
 292         ipc_space_t space;
 293
 294         space = is_alloc();
 295         if (space == IS_NULL)
 296                 return KERN_RESOURCE_SHORTAGE;
 297
 298         is_lock_init(space);
 299
 300         space->is_bits       = IS_INACTIVE | 1; /* 1 ref, not active, not growing */
 301         space->is_table      = IE_NULL;
 302         space->is_task       = TASK_NULL;
 303         space->is_table_next = 0;
 304         space->is_low_mod    = 0;
 305         space->is_high_mod   = 0;
 306         space->is_node_id = HOST_LOCAL_NODE; /* HOST_LOCAL_NODE, except proxy spaces */
 307
 308         *spacep = space;
 309         return KERN_SUCCESS;
 310 }
 311
 312 /*
 313  * ipc_space_clean - remove all port references from an ipc space.
 314  *
 315  * In order to follow the traditional semantic, ipc_space_destroy
 316  * will not destroy the entire port table of a shared space.  Instead
 317  * it will simply clear its own sub-space.
 318  */
 319 void
 320 ipc_space_clean(
 321         ipc_space_t space)
 322 {
 323         ipc_entry_t table;
 324         ipc_entry_num_t size;
 325         mach_port_index_t index;
 326
 327         /*
 328          *      If somebody is trying to grow the table,
 329          *      we must wait until they finish and figure
 330          *      out the space died.
 331          */
 332  retry:
 333         is_write_lock(space);
 334         while (is_growing(space))
 335                 is_write_sleep(space);
 336
 337         if (!is_active(space)) {
 338                 is_write_unlock(space);
 339                 return;
 340         }
 341
 342         /*
 343          *      Now we can futz with it since we have the write lock.
 344          */
 345
 346         table = space->is_table;
 347         size = space->is_table_size;
 348
 349         for (index = 0; index < size; index++) {
 350                 ipc_entry_t entry = &table[index];
 351                 mach_port_type_t type;
 352
 353                 type = IE_BITS_TYPE(entry->ie_bits);
 354                 if (type != MACH_PORT_TYPE_NONE) {
 355                         mach_port_name_t name = MACH_PORT_MAKE(index,
 356                                                 IE_BITS_GEN(entry->ie_bits));
 357                         ipc_right_destroy(space, name, entry, FALSE, 0); /* unlocks space */
 358                         goto retry;
 359                 }
 360         }
 361
 362         /*
 363          * JMM - Now the table is cleaned out.  We don't bother shrinking the
 364          * size of the table at this point, but we probably should if it is
 365          * really large.
 366          */
 367
 368         is_write_unlock(space);
 369 }
 370
 371
 372 /*
 373  *      Routine:        ipc_space_terminate
 374  *      Purpose:
 375  *              Marks the space as dead and cleans up the entries.
 376  *              Does nothing if the space is already dead.
 377  *      Conditions:
 378  *              Nothing locked.
 379  */
 380
 381 void
 382 ipc_space_terminate(
 383         ipc_space_t     space)
 384 {
 385         ipc_entry_t table;
 386         ipc_entry_num_t size;
 387         mach_port_index_t index;
 388
 389         assert(space != IS_NULL);
 390
 391         is_write_lock(space);
 392         if (!is_active(space)) {
 393                 is_write_unlock(space);
 394                 return;
 395         }
 396         is_mark_inactive(space);
 397
 398         /*
 399          *      If somebody is trying to grow the table,
 400          *      we must wait until they finish and figure
 401          *      out the space died.
 402          */
 403         while (is_growing(space))
 404                 is_write_sleep(space);
 405
 406         is_write_unlock(space);
 407
 408
 409         /*
 410          *      Now we can futz with it unlocked.
 411          */
 412
 413         table = space->is_table;
 414         size = space->is_table_size;
 415
 416         for (index = 0; index < size; index++) {
 417                 ipc_entry_t entry = &table[index];
 418                 mach_port_type_t type;
 419
 420                 type = IE_BITS_TYPE(entry->ie_bits);
 421                 if (type != MACH_PORT_TYPE_NONE) {
 422                         mach_port_name_t name;
 423
 424                         name = MACH_PORT_MAKE(index,
 425                                               IE_BITS_GEN(entry->ie_bits));
 426                         ipc_right_terminate(space, name, entry);
 427                 }
 428         }
 429
 430         it_entries_free(space->is_table_next-1, table);
 431         space->is_table_size = 0;
 432         space->is_table_free = 0;
 433
 434         /*
 435          *      Because the space is now dead,
 436          *      we must release the "active" reference for it.
 437          *      Our caller still has his reference.
 438          */
 439         is_release(space);
 440 }
 441
 442