This commit was manufactured by cvs2svn to create branch 'jsd'.

git-svn-id: svn://10.0.0.236/branches/jsd@10728 18797224-902f-48f8-a5cc-f745e15eee43

mozilla/directory/perldap/ChangeLog

@@ -1,84 +0,0 @@
-1998-08-13  Leif Hedstrom  <leif@netscape.com>
-
-	* Makefile.PL: Fixed so that automated installs works.
-
-	* Conn.pm (update): Fixed narly bug with ldap_modify()...
-
-	* All: Cleaned up some hash indexes, to make sure they are
-	properly quoted, and there are no conflicts to resolve.
-	
-	* Entry.pm (STORE): Fixed a bug with attribute names not being
-	properly added to _oc_order_.
-	(addValue): Dito, added the same code as for STORE.
-
-1998-08-06  Leif Hedstrom  <leif@netscape.com>
-
-	* Entry.pm (printLDIF): Copied/modified from the Utils.pm library.
-	(isModified): Added this function, thought it might be useful.
-
-1998-08-03  Leif Hedstrom  <leif@netscape.com>
-
-	* Conn.pm (modifyRDN): Fixed! It also has an option to take an
-	"external" DN as an argument, if supplied.
-
-1998-08-02  Leif Hedstrom  <leif@netscape.com>
-
-	* Conn.pm (getErrorCode): Now takes two optional arguments, to
-	return the match string, and extra error string. Note that these
-	two arguments are pointers to strings!
-
-	* API.xs(ldap_get_lderrno): Fixed this function, at least it seems
-	to work now...
-
-	* Conn.pm (getLD): Added this function, convenient way to get the
-	LD from the OO layer.
-
-1998-07-30  Leif Hedstrom  <leif@netscape.com>
-
-	* Conn.pm (modifyRDN): New method, to rename the RDN of the entry.
-
-	* Utils.pm (answer): New function, from LdapUtils.pm.
-
-	* Conn.pm (delete): Fixed references to normalizeDN.
-
-	* Utils.pm (userCredentials): Added this function, to make it easy
-	to get credentials when binding as a user.
-	(normalizeDN): Fixed bugs, because of calling convention...
-
-	* Conn.pm (getError): Fixed bug with passing read-only argument.
-
-1998-07-29  Leif Hedstrom  <leif@netscape.com>
-
-	* Utils.pm (unixCrypt): Moved from my LdapUtils.pm module.
-	Added askPassword to the export tag.
-
-	* Conn.pm (new): Added support for passing a hash array of all the
-	parameters, as returned by the ldapArgs() function.
-
-	* Utils.pm (str2Scope): New function, for converting strings
-	(subtree) to a numerical scope value (2).
-	(askPassword): Dito, ask for a password, interactively.
-	(ldapArgs): Dito, handle common LDAP command line arguments.
-
-	* Makefile.PL: Minor change, to do regex match on OS version for
-	MSWin.
-
-	* Entry.pm: Changed all _XXX hash values to also end with a _,
-	hence making it easier to isolate them (/^_.*_$/).
-
-	* Conn.pm (nextEntry): Changed to accept that the attributes are
-	now arrays, not pointers to arrays. We still consider them as
-	pointers internally though, it's cleaner API.
-
-	* API.pm: Changed to use the native Exporter function to export
-	tags into EXPORT_OK.
-
-1998-07-22  Leif Hedstrom  <leif@netscape.com>
-
-	* LDIF.pm (readEntry): Moved from my LdapUtils.pm package.
-
-	* Utils.pm (printEntry): Moved from the ::Connection class, and
-	marked it as "obsolete".
-	(encodeBase64): Moved from my LdapUtils.pm package.
-	(decodeBase64): Dito.
-

mozilla/directory/perldap/Conn.pm

@@ -1,998 +0,0 @@
-#############################################################################
-# $Id: Conn.pm,v 1.17 1998-08-13 21:32:06 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    This is the main object class for connecting to an LDAP server,
-#    and perform searches and updates. It depends on the ::Entry
-#    object class, which is the data type returned from a search
-#    operation for instance.
-#
-#############################################################################
-
-package Mozilla::LDAP::Conn;
-
-use Mozilla::LDAP::Utils;
-use Mozilla::LDAP::API qw(/.+/);
-use Mozilla::LDAP::Entry;
-
-
-#############################################################################
-# Creator, create and initialize a new LDAP object ("connection"). We support
-# either providing all parameters as a hash array, or as individual
-# arguments.
-#
-sub new
-{
-  my $class = shift;
-  my $self = {};
-  my $ref;
-
-  $ref = ref($_[$[]);
-  if (ref $_[$[] eq "HASH")
-    {
-      my $hash;
-
-      $hash = $_[$[];
-      $self->{"host"} = $hash->{"host"} if defined($hash->{"host"});
-      $self->{"port"} = $hash->{"port"} if defined($hash->{"port"});
-      $self->{"binddn"} = $hash->{"bind"} if defined($hash->{"bind"});
-      $self->{"bindpasswd"} = $hash->{"pswd"} if defined($hash->{"pswd"});
-      $self->{"certdb"} = $hash->{"cert"} if defined($hash->{"cert"});
-    }
-  else
-    {
-      my ($host, $port, $binddn, $bindpasswd, $certdb, $authmeth) = @_;
-
-      $self->{"host"} = $host;
-      $self->{"port"} = $port;
-      $self->{"binddn"} = $binddn;
-      $self->{"bindpasswd"} = $bindpasswd;
-      $self->{"certdb"} = $certdb;
-    }
-
-  if (!defined($self->{"port"}) || ($self->{"port"} eq ""))
-    {
-      $self->{"port"} = (($self->{"certdb"} ne "") ? LDAPS_PORT : LDAP_PORT);
-    }
-
-  bless $self, $class;
-
-  return unless $self->init();
-  return $self;
-}
-
-
-#############################################################################
-# Destructor, makes sure we close any open LDAP connections.
-#
-sub DESTROY
-{
-  my $self = shift;
-
-  return unless defined($self->{"ld"});
-
-  ldap_unbind_s($self->{"ld"});
-  ldap_msgfree($self->{"ldres"}) if defined($self->{"ldres"});
-
-  undef $self->{"ld"};
-}
-
-
-#############################################################################
-# Initialize a normal connection. This seems silly, why not just merge
-# this back into the creator method (new)...
-#
-sub init
-{
-  my $self = shift;
-  my $ret;
-  my $ld;
-
-  if ($self->{"certdb"} ne "")
-    {
-      $ret = ldapssl_client_init($self->{"certdb"}, "");
-      return 0 if ($ret < 0);
-
-      $ld = ldapssl_init($self->{"host"}, $self->{"port"}, 1);
-    }
-  else
-    {
-      $ld = ldap_init($self->{"host"}, $self->{"port"});
-    }
-  if (!$ld)
-    {
-      perror("ldap_init");
-
-      return 0;
-    }
-
-  $self->{"ld"} = $ld;
-  $ret = ldap_simple_bind_s($ld, $self->{"binddn"}, $self->{"bindpasswd"});
-
-  if ($ret)
-    {
-      ldap_perror($ld, "Authentication failed");
-
-      return 0;
-    }
-
-  return 1;
-}
-
-
-#############################################################################
-# Checks if a string is a properly formed LDAP URL.
-#
-sub isURL
-{
-  my ($self, $url) = @_;
-
-  return ldap_is_ldap_url($url);
-}
-
-
-#############################################################################
-# Return the actual low level LD connection structure, which is needed if
-# you want to call any of the API functions yourself...
-#
-sub getLD
-{
-  my ($self) = @_;
-
-  return $self->{"ld"} if $self->{"ld"};
-}
-
-
-#############################################################################
-# Return the Error code from the last LDAP api function call. The last two
-# optional arguments are pointers to strings, and will be set to the
-# match string and extra error string if appropriate.
-#
-sub getErrorCode
-{
-  my ($self, $match, $msg) = @_;
-  my $ret;
-
-  return ldap_get_lderrno($self->{"ld"}, $match, $msg);
-}
-*getError = \*getErrorCode;
-
-
-#############################################################################
-# Return the Error string from the last LDAP api function call.  
-#
-sub getErrorString 
-{
-  my ($self) = @_;
-  my ($err);
-  
-  $err = ldap_get_lderrno($self->{"ld"}, undef, undef);
-
-  return ldap_err2string($err);
-}
-
-
-#############################################################################
-# Print the last error code...
-#
-sub printError
-{
-  my ($self, $str) = @_;
-
-  $str = "LDAP error: " if ($str eq "");
-  ldap_perror($self->{"ld"}, $str);
-}
-
-
-#############################################################################
-# Normal LDAP search. Note that this will actually perform LDAP URL searches
-# if the filter string looks like a proper URL.
-#
-sub search
-{
-  my ($self, $basedn, $scope, $filter, $attrsonly, @attrs) = @_;
-  my $resv;
-  my $entry;
-  my $res = \$resv;
-
-  $scope = Mozilla::LDAP::Utils::str2Scope($scope);
-  $filter = "(objectclass=*)" if ($filter =~ /^ALL$/i);
-
-  ldap_msgfree($self->{"ldres"}) if defined($self->{"ldres"});
-  if (ldap_is_ldap_url($filter))
-    {
-      if (! ldap_url_search_s($self->{"ld"}, $filter, $attrsonly, $res))
-	{
-	  $self->{"ldres"} = $res;
-	  $self->{"ldfe"} = 1;
-	  $entry = $self->nextEntry();
-	}
-    }
-  else
-    {
-      if (! ldap_search_s($self->{"ld"}, $basedn, $scope, $filter, \@attrs,
-			  $attrsonly, $res))
-	{
-	  $self->{"ldres"} = $res;
-	  $self->{"ldfe"} = 1;
-	  $entry = $self->nextEntry();
-	}
-    }
-
-  return $entry;
-}
-
-
-#############################################################################
-# URL search, optimized for LDAP URL searches.
-#
-sub searchURL
-{
-  my ($self, $url, $attrsonly) = @_;
-  my $resv;
-  my $entry;
-  my $res = \$resv;
-
-  ldap_msgfree($self->{"ldres"}) if defined($self->{"ldres"});
-  if (! ldap_url_search_s($self->{"ld"}, $url, $attrsonly, $res))
-    {
-      $self->{"ldres"} = $res;
-      $self->{"ldfe"} = 1;
-      $entry = $self->nextEntry();
-    }
-
-  return $entry;
-}
-
-
-#############################################################################
-# Get an entry from the search, either the first entry, or the next entry,
-# depending on the call order.
-#
-sub nextEntry
-{
-  my $self = shift;
-  my %entry;
-  my @ocorder;
-  my ($attr, @vals, $obj, $ldentry, $berv, $dn);
-  my $ber = \$berv;
-
-  # I use the object directly, to avoid setting the "change" flags
-  $obj = tie %entry, Mozilla::LDAP::Entry;
-
-  $self->{"dn"} = "";
-  if ($self->{"ldfe"} == 1)
-    {
-      $self->{"ldfe"} = 0;
-      $ldentry = ldap_first_entry($self->{"ld"}, $self->{"ldres"}); 
-      $self->{"ldentry"} = $ldentry;
-    }
-  else
-    {
-      return "" unless $self->{"ldentry"};
-      $ldentry = ldap_next_entry($self->{"ld"}, $self->{"ldentry"}); 
-      $self->{"ldentry"} = $ldentry;
-    }
-  return "" unless $ldentry;
-
-  $dn = ldap_get_dn($self->{"ld"}, $self->{"ldentry"});
-  $obj->{"dn"} = $dn;
-  $self->{"dn"} = $dn;
-  $attr = ldap_first_attribute($self->{"ld"}, $self->{"ldentry"}, $ber);
-  return (bless \%entry, Mozilla::LDAP::Entry) unless $attr;
-
-  @vals = ldap_get_values_len($self->{"ld"}, $self->{"ldentry"}, $attr);
-  $obj->{$attr} = [@vals];
-  push(@ocorder, $attr);
-
-  while ($attr = ldap_next_attribute($self->{"ld"},
-				     $self->{"ldentry"}, $ber))
-    {
-      @vals = ldap_get_values_len($self->{"ld"}, $self->{"ldentry"}, $attr);
-      $obj->{$attr} = [@vals];
-      push(@ocorder, $attr);
-    }
-  $obj->{"_oc_order_"} = \@ocorder;
-  $obj->{"_self_obj_"} = $obj;
-
-  ldap_ber_free($ber, 0) if $ber;
-
-  return bless \%entry, Mozilla::LDAP::Entry;
-}
-
-# This is deprecated...
-*entry = \*nextEntry;
-
-
-#############################################################################
-# Close the connection to the LDAP server.
-#
-sub close
-{
-  my $self = shift;
-  my $ret = 1;
-
-  $ret = ldap_unbind_s($self->{"ld"}) if defined($self->{"ld"});
-  undef $self->{"ld"};
-
-  return ($ret == LDAP_SUCCESS);
-}
-
-
-#############################################################################
-# Delete an object.
-#
-sub delete
-{
-  my ($self, $dn) = @_;
-  my $ret = 1;
-
-  if ($dn ne "")
-    {
-      $dn = Mozilla::LDAP::Utils::normalizeDN($dn);
-    }
-  else
-    {
-      $dn = Mozilla::LDAP::Utils::normalizeDN($self->{"dn"});
-    }
-  $ret = ldap_delete_s($self->{"ld"}, $dn) if ($dn ne "");
-
-  return ($ret == LDAP_SUCCESS)
-}
-
-
-#############################################################################
-# Add an object.
-#
-sub add
-{
-  my ($self, $entry) = @_;
-  my ($ref, $key, $val, %ent);
-  my $ret = 1;
-  my $gotcha = 0;
-
-  $ref = ref($entry);
-  if (($ref eq "Mozilla::LDAP::Entry") || ($ref eq "HASH"))
-    {
-      foreach $key (keys %{$entry})
-	{
-	  next if (($key eq "dn") || ($key =~ /^_.+_$/));
-	  $ent{$key} = $entry->{$key};
-	  $gotcha++;
-	}
-
-      $ret = ldap_add_s($self->{"ld"}, $entry->{"dn"}, \%ent) if $gotcha;
-    }
-
-  return ($ret == LDAP_SUCCESS);
-}
-
-
-#############################################################################
-# Modify the RDN, and update the entry accordingly. Note that the last
-# two arguments (DN and "delete") are optional.
-#
-sub modifyRDN
-{
-  my ($self, $rdn, $dn, $del) = ($_[$[], lc $_[$[ + 1], $_[$[ + 2], $_[$[ + 3]);
-  my (@vals);
-  my $ret = 1;
-
-  $del = 1 if ($del eq "");
-  $dn = $self->{"dn"} if ($dn eq "");
-
-  @vals = ldap_explode_dn(lc $dn, 0);
-  if ($vals[$[] ne $rdn)
-    {
-      $ret = ldap_modrdn2_s($self->{"ld"}, $dn, $rdn, $del);
-      if ($ret == LDAP_SUCCESS)
-	{
-	  shift(@vals);
-	  unshift(@vals, ($rdn));
-	  $ld->{"dn"} = join(@vals);
-	}
-    }
-
-  return ($ret == LDAP_SUCCESS);
-}
-
-
-#############################################################################
-# Update an object. NOTE: I'd like to clean up my change tracking tags here,
-# so that we can call update() again with the same entry.
-#
-sub update
-{
-  my ($self, $entry) = @_;
-  my (@vals, %mod, %new, @arr);
-  my ($key, $val);
-  my $ret = 1;
-  local $_;
-
-  foreach $key (keys (%$entry))
-    {
-      next if (($key eq "dn") || ($key =~ /^_.+_/));
-
-      if ($entry->{"_${key}_modified_"})
-	{
-	  @vals = @{$entry->{$key}};
-	  if ($#vals == $[)
-	    {
-	      $mod{$key} = { "rb", [$vals[$[]] };
-	    }
-	  else
-	    {
-	      @arr = ();
-	      grep(($new{$_} = 1), @vals);
-	      foreach (@{$entry->{"_${key}_save_"}})
-		{
-		  if (! $new{$_})
-		    {
-		      push(@arr, $_);
-		    }
-		  $new{$_} = 0;
-		}
-	      $mod{$key}{"db"} = [@arr] if ($#arr >= $[);
-
-	      @arr = ();
-	      foreach (keys(%new))
-		{
-		  push(@arr, $_) if ($new{$_} == 1);
-		}
-	      $mod{$key}{"ab"} = [@arr] if ($#arr >= $[);
-	    }
-
-	  delete $entry->{"_self_obj_"}->{"_${key}_modified_"};
-	  undef @{$entry->{"_${key}_save_"}};
-	}
-      elsif ($entry->{"_${key}_deleted_"})
-	{
-	  $mod{$key} = { "db", [] };
-	  undef @{$entry->{"_${key}_save_"}};
-	  delete $entry->{"_self_obj_"}->{"_${key}_deleted_"};
-	}
-    }
-
-  @arr = keys %mod;
-  # This is here for debug purposes only...
-  if ($main::LDAP_DEBUG)
-    {
-      foreach $key (@arr)
-	{
-	  print "Working on $key\n";
-	  foreach $op (keys %{$mod{$key}})
-	    {
-	      print "\tDoing operation: $op\n";
-	      foreach $val (@{$mod{$key}{$op}})
-		{
-		  print "\t\t$val\n";
-		}
-	    }
-	}
-    }
-
-  $ret = ldap_modify_s($self->{"ld"}, $entry->{"dn"}, \%mod)
-    if ($#arr >= $[);
-
-  return ($ret == LDAP_SUCCESS);
-}
-
-
-#############################################################################
-# Set the rebind procedure. This is old and obsolete...
-#
-sub setRebindProc
-{
-  my ($self, $proc) = @_;
-
-  # Should we try to reinitialize the connection?
-  die "No LDAP connection" unless defined($self->{"ld"});
-
-  ldap_set_rebind_proc($self->{"ld"}, $proc);
-}
-
-
-#############################################################################
-# Mandatory TRUE return value.
-#
-1;
-
-
-#############################################################################
-# POD documentation...
-#
-__END__
-
-=head1 NAME
-
-  Mozilla::LDAP::Conn - Object Oriented API for the LDAP SDK.
-
-=head1 SYNOPSIS
-
-  use Mozilla::LDAP::Conn;
-  use Mozilla::LDAP::Utils;
-
-=head1 ABSTRACT
-
-This package is the main API for using our Perl Object Oriented LDAP
-module. Even though it's certainly possible, and sometimes even necessary,
-to call the native LDAP C SDK functions, we strongly recommend you use
-these object classes.
-
-It's not required to use our Mozilla::LDAP::Utils.pm package, but it's
-convenient and good for portability if you use as much as you can from
-that package as well. This implies using the LdapConf package as well,
-even though you usually don't need to use it directly.
-
-You should read this document in combination with the Mozilla::LDAP::Entry
-document. Both modules depend on each other heavily.
-
-=head1 DESCRIPTION
-
-First, this is not ment to be a crash course in how LDAP works, if you
-have no experience with LDAP, I suggest you read some of the literature
-that's available out there. The LDAP Deployment Book from Netscape, or the
-LDAP C SDK documentation are good starting points.
-
-This object class basically tracks and manages the LDAP connection, it's
-current status, and the current search operation (if any). Every time you
-call the B<search> method of an object instance, you'll reset it's
-internal state. It depends heavily on the ::Entry class, which are used to
-retrieve, modify and update a single entry.
-
-The B<search> and B<nextEntry> methods returns Mozilla::LDAP::Entry
-objects, naturally. You also have to instantiate (and modify) a new
-::Entry object when you want to add new entries to an LDAP
-server. Alternatively, the add() method will also take a hash array as
-argument, to make it easy to create new LDAP entries.
-
-To assure that changes to an entry are updated properly, we strongly
-recommend you use the native methods of the ::Entry object class. Even
-though you can modify certain elements directly, it could cause changes
-not to be committed to the LDAP server. If there's something missing from
-the API, please let us know, or even fix it yourself.
-
-=head1 SOME PERLDAP/OO BASICS
-
-An entry consist of a DN, and a hash array of pointers to attribute
-values. Each attribute value (except the DN) is an array, but you have to
-remember the hash array in the entry stores pointers to the array, not the
-array. So, to access the first CN value of an entry, you'd do
-
-    $cn = $entry->{cn}[0];
-
-To set the CN attribute to a completely new array of values, you'd do
-
-    $entry->{cn} = [ "Leif Hedstrom", "The Swede" ];
-
-As long as you remember this, and try to use native Mozilla::LDAP::Entry
-methods, this package will take care of most the work. Once you master
-this, working with LDAP in Perl is surprisingly easy.
-
-We already mentioned DN, which stands for Distinguished Name. Every entry
-on an LDAP server must have a DN, and it's always guaranteed to be unique
-within your database. Some typical DNs are
-
-    uid=leif,ou=people,o=netscape.com
-    cn=gene-staff,ou=mailGroup,o=netscape.com
-    dc=data,dc=netscape,dc=com
-
-There's also a term called RDN, which stands for Relative Distinguished
-Name. In the above examples, C<uid=leif>, C<cn=gene-staff> and C<dc=data>
-are all RDNs. One particular property for a RDN is that they must be
-unique within it's sub-tree. Hence, there can only be one user with
-C<uid=leif> within the ou=people tree, there can never be a name conflict.
-
-=head1 CREATING A NEW OBJECT INSTANCE
-
-Before you can do anything with PerLDAP, you'll need to instantiate at
-least one Mozilla::LDAP::Conn object, and connect it to an LDAP server. As
-you probably guessed already, this is done with the B<new> method:
-
-    $conn = new Mozilla::LDAP::Conn("ldap", "389", $bind, $pswd, $cert);
-    die "Couldn't connect to LDAP server ldap" unless  $conn;
-
-The arguments are: Host name, port number, and optionally a bind-DN, it's
-password, and a certificate. If there is no bind-DN, the connection will
-be bound as the anonymous user. If the certificate file is specified, the
-connection will be over SSL, and you should then probably connect to port
-636. You have to check that the object was created properly, and take
-proper actions if you couldn't get a connection.
-
-There's one convenient alternative call method to this function. Instead of
-providing each individual argument, you can provide one hash array
-(actually, a pointer to a hash). For example:
-
-    %ld = Mozilla::LDAP::Utils::ldapArgs();
-    $conn = new Mozilla::LDAP::Conn(\%ld);
-
-The components of the hash are:
-
-    $ld->{"host"}
-    $ld->{"port"}
-    $ld->{"root"}
-    $ld->{"bind"}
-    $ld->{"pswd"}
-    $ld->{"cert"}
-
-and (not used in the B<new> method)
-
-    $ld->{"scope"}
-
-Once a connection is established, the package will take care of the
-rest. If for some reason the connection is lost, the object should
-reconnect on it's own, automatically. [Note: This doesn't work
-now... ]. You can use the Mozilla::LDAP:Conn object for any number of
-operations, but since everything is currently done synchronously, you can
-only have one operation active at any single time. You can of course have
-multiple Mozilla::LDAP::Conn instanced active at the same time.
-
-=head1 PERFORMING LDAP SEARCHES
-
-We assume that you are familiar with the LDAP filter syntax already, all
-searches performed by this object class uses these filters. You should
-also be familiar with LDAP URLs, and LDAP object classes. There are some
-of the few things you actually must know about LDAP. Perhaps the simples
-filter is
-
-    (uid=leif)
-
-This matches all entries with the UID set to "leif". Normally that
-would only match one entry, but there is no guarantee for that. To find
-everyone with the name "leif", you'd instead do
-
-    (cn=*leif*)
-
-A more complicated search involves logic operators. To find all mail
-groups owned by "leif" (or actually his DN), you could do
-
-    (&(objectclass=mailGroup)(owner=uid=leif,ou=people,o=netscape))
-
-The I<owner> attribute is what's called a DN attribute, so to match on it
-we have to specify the entire DN in the filter above. We could of course
-also do a sub string "wild card" match, but it's less efficient, and
-requires indexes to perform reasonably well.
-
-Ok, now we are prepared to actually do a real search on the LDAP server:
-
-    $base = "o=netscape.com";
-    $conn = new Mozilla::LDAP::Conn("ldap", "389", "", ""); die "No LDAP
-    connection" unless $conn;
-
-    $entry = $conn->search($base, "subtree", "(uid=leif)");
-    if (! $entry)
-      { # handle this event, no entries found, dude!
-      }
-    else
-      {
-        while ($entry)
-          {
-            $entry->printLDIF();
-            $entry = $conn->nextEntry();
-          }
-      }
-
-This is in fact a poor mans implementation of the I<ldapsearch> command
-line utility. The B<search> method returns an Mozilla::LDAP::Entry object,
-which holds the first entry from the search, if any. To get the second and
-subsequent entries you call the B<entry> method, until there are no more
-entries. The B<printLDIF> method is a convenient function, requesting the
-entry to print itself on STDOUT, in LDIF format.
-
-The arguments to the B<search> methods are the I<LDAP Base-DN>, the
-I<scope> of the search ("base", "one" or "sub"), and the actual LDAP
-I<filter>. The entry return contains the DN, and all attribute values. To
-access a specific attribute value, you just have to use the hash array:
-
-    $cn = $entry->{cn}[0];
-
-Since many LDAP attributes can have more than one value, value of the hash
-array is another array (or actually a pointer to an array). In many cases
-you can just assume the value is in the first slot (indexed by [0]), but
-for some attributes you have to support multiple values. To find out how
-many values a specific attribute has, you'd call the B<size> method:
-
-    $numVals = $entry->size("objectclass");
-
-One caveat: Many LDAP attributes are case insensitive, but the methods in
-the Mozilla::LDAP::Entry package are not aware of this. Hence, if you
-compare values with case sensitivity, you can experience weird
-behavior. If you know an attribute is CIS (Case Insensitive), make sure
-you do case insensitive string comparisons.
-
-Unfortunately some methods in this package can't do this, and by default
-will do case sensitive comparisons. We are working on this, and in a
-future release some of the methods will handle this more gracefully. As an
-extension (for LDAP v3.0) we could also use schema discovery for handling
-this even better.
-
-There is an alternative search method, to use LDAP URLs instead of a
-filter string. This can be used to easily parse and process URLs, which is
-a compact way of storing a "link" to some specific LDAP information. To
-process such a search, you use the B<searchURL> method:
-
-    $entry->searchURL("ldap:///o=netscape.com??sub?(uid=leif");
-
-As it turns out, the B<search> method also supports LDAP URL searches. If
-the search filter looks like a proper URL, we will actually do an URL
-search instead. This is for backward compatibility, and for ease of use.
-
-To achieve better performance and use less memory, you can limit your
-search to only retrieve certain attributes. With the LDAP URLs you specify
-this as an optional parameter, and with the B<search> method you add two
-more options, like
-
-    $entry = $conn->search($base, "sub", $filter, 0, ("mail", "cn");
-
-The last argument specifies an array of attributes to retrieve, the fewer
-the attributes, the faster the search will be. The second to last argument
-is a boolean value indicating if we should retrieve only the attribute
-names (and no values). In most cases you want this to be FALSE, to
-retrieve both the attribute names, and all their values. To do this with
-the B<searchURL> method, add a second argument, which should be 0 or 1.
-
-=head1 MODIFYING AND CREATING NEW LDAP ENTRIES
-
-Once you have an LDAP entry, either from a search, or created directly to
-get a new empty object, you are ready to modify it. If you are creating a
-new entry, the first thing to set it it's DN:
-
-    $entry->setDN("uid=leif,ou=people,o=netscape.com");
-
-You should not do this for an existing LDAP entry, changing the RDN (or
-DN) for such an entry must be done with B<modifyRDN>. To populate (or
-modify) some other attributes, we can do
-
-    $entry->{objectclass} = [ "top", "person", "inetOrgPerson" ];
-    $entry->{cn} = [ "Leif Hedstrom" ];
-    $entry->{mail} = [ "leif@netscape.com" ];
-
-Once you are done modifying your LDAP entry, call the B<update> method
-from the Mozilla::LDAP::Conn object instance:
-
-    $conn->update($entry);
-
-Or, if you are creating an entirely new LDAP entry, you must call the
-B<add> method:
-
-    $conn->add($entry);
-
-If all comes to worse, and you have to remove an entry again from the LDAP
-server, just call the B<delete> method, like
-
-    $conn->delete($entry);
-
-You can't use native Perl functions like push() and splice() on attribute
-values, since they won't update the ::Entry instance state properly.
-Instead use one of the methods provided by the object class, for instance
-
-    $conn->addValue("cn", "The Swede");
-    $conn->removeValue("mailAlternateAddress", "leif@mcom.com");
-    $conn->remove("seeAlso");
-
-These methods return a TRUE or FALSE value, depending on the outcome
-of the operation. If there was no value to remove, or a value already
-exists, we return FALSE, otherwise TRUE. To check if an attribute has a
-certain value, use the B<hasValue> method, like
-
-    if ($conn->hasValue("mail", "leif@netscape.com")) {
-        # Do something
-    }
-
-There is a similar method, B<matchValue>, which takes a regular
-expression to match against, instead of the entire string. For more
-information this and other methods in the Entry class, see below.
-    
-=head1 OBJECT CLASS METHODS
-
-We have already described the fundamentals of this class earlier. This is
-a summary of all available methods which you can use. Be careful not to
-use any undocumented features or heaviour, since the internals in this
-module is likely to change.
-
-=head2 Searching and updating entries
-
-=over 13
-
-=item B<new>
-
-This creates and initialized a new LDAP connection and object. The
-required arguments are host name, port number, bind DN and the bind
-password. An optional argument is a certificate (public key), which causes
-the LDAP connection to be established over an SSL channel. Currently we do
-not support Client Authentication, so you still have to use the simple
-authentication method (i.e. with a password).
-
-A typical usage could be something like
-
-    %ld = Mozilla::LDAP::Utils::ldapArgs();
-    $conn = new Mozilla::LDAP::Conn(\%ld);
-
-Also, remember that if you use SSL, the port is (usually) 636.
-
-=item B<search>
-
-The B<search> method is the main entry point into this module. It requires
-at least three arguments: The Base DN, the scope, and the search
-strings. Two more optional arguments can be given, the first specifies if
-only attribute names should be returned (TRUE or FALSE). The second
-argument is a list (array) of attributes to return.
-
-The last option is very important for performance. If you are only
-interested in say the "mail" and "mailHost" attributes, specifying this in
-the search will signficantly reduce the search time. An example of an
-efficient search is
-
-    @attr = ("cn", "uid", "mail");
-    $filter = "(uid=*)";
-    $entry = $conn->search($root, $scope, $filter, 0, @attr);
-    while ($entry) {
-        # do something
-        $entry = $conn->nextEntry();
-    }
-
-=item B<searchURL>
-
-This is almost identical to B<search>, except this function takes only two
-arguments, an LDAP URL and an optional flag to specify if we only want the
-attribute names to be returned (and no values). This function isn't very
-useful, since the B<search> method will actually honor properly formed
-LDAP URL's, and use it if appropriate.
-
-=item B<nextEntry>
-
-This method will return the next entry from the search result, and can
-therefore only be called after a succesful search has been initiated. If
-there are no more entries to retrieve, it returns nothing (empty string).
-
-=item B<update>
-
-After modifying an Ldap::Entry entry (see below), use the B<update>
-method to commit changes to the LDAP server. Only attributes that has been
-changed will be updated, assuming you have used the appropriate methods in
-the Entry object. For instance, do not use B<push> or B<splice> to
-modify an entry, the B<update> will not recognize such changes.
-
-To change the CN value for an entry, you could do
-
-    $entry->{cn} = ["Leif Hedstrom"];
-    $conn->update($entry);
-
-=item B<delete>
-
-This will delete the current entry, or possibly an entry as specified with
-the optional argument. You can use this function to delete any entry you
-like, by passing it an explicit DN. If you don't pass it this argument,
-B<delete> defaults to delete the current entry, from the last call to
-B<search> or B<entry>.
-
-=item B<add>
-
-Add a new entry to the LDAP server. Make sure you use the B<new> method
-for the Mozilla::LDAP::Entry object, to create a proper entry.
-
-=item B<close>
-
-Close the LDAP connection, and clean up the object. If you don't call this
-directly, the destructor for the object instance will do the job for you.
-
-=item B<modifyRDN>
-
-This will rename the specified LDAP entry, by modifying it's RDN. For
-example:
-
-    $rdn = "uid=fiel, ou=people, dc=netscape, dc=com";
-    $conn->modifyRDN($rdn, $entry->getDN());
-
-=back
-
-=head2 Other methods
-
-=over 13
-
-=item B<isURL>
-
-Returns TRUE or FALSE if the given argument is a properly formed URL.
-
-=item B<getLD>
-
-Return the (internal) LDAP* connection handle, which you can use
-(carefully) to call the native LDAP API functions. You shouldn't have to
-use this in most cases, unless of course our OO layer is seriously flawed.
-
-=item B<getErrorCode>
-
-Return the error code (numeric) from the last LDAP API function
-call. Remember that this can only be called I<after> the successful
-creation of a new object instance. A typical usage could be
-
-    if (! $opt_n) {
-        $conn->modifyRDN($rdn, $entry->getDN());
-        $conn->printError() if $conn->getErrorCode();
-    }
-
-Which will report any error message as generated by the call to B<modifyRDN>.
-
-
-=item B<getErrorString>
-
-Very much like B<getError>, but return a string with a human readable
-error message. This can then be used to print a good error message on the
-console.
-
-=item B<printError>
-
-Print the last error message on standard output.
-
-=item B<setRebindProc>
-
-Tell the LDAP SDK to call the provided Perl function when it has to follow
-referrals. The Perl function should return an array of three elements, the
-new Bind DN, password and authentication method. A typical usage is
-
-    sub rebindProc {
-        return ("uid=ldapadmin", "secret", LDAP_AUTH_SIMPLE);
-    }
-
-    $ld->setRebindProc(\&rebindProc);
-
-=item B<setDefaultRebindProc>
-
-This is very much like the previous function, except instead of specifying
-the function to use, you give it the DN, password and Auth method. Then
-we'll use a default rebind procedure (internal in C) to handle the rebind
-credentials. This was a solution for the Windows/NT problem/bugs we have
-with rebind procedures written in Perl.
-
-=back
-
-=head1 EXAMPLES
-
-There are plenty of examples to look at, in the examples directory. We are
-adding more examples every day (almost).
-
-=head1 INSTALLATION
-
-Installing this package is part of the Makefile supplied in the
-package. See the installation procedures which are part of this package.
-
-=head1 AVAILABILITY
-
-This package can be retrieved from a number of places, including:
-
-    http://www.mozilla.org/directory/
-    Your local CPAN server
-
-=head1 CREDITS
-
-Most of this code was developed by Leif Hedstrom, Netscape Communications
-Corporation. 
-
-=head1 BUGS
-
-None. :)
-
-=head1 SEE ALSO
-
-L<Mozilla::LDAP::Entry>, L<LDAP::Mozilla:Utils> L<LDAP::Mozilla:API> and
-of course L<Perl>.
-
-=cut

mozilla/directory/perldap/Entry.pm

@@ -1,626 +0,0 @@
-#############################################################################
-# $Id: Entry.pm,v 1.9 1998-08-13 21:31:36 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    This package defines an object class to manage one single LDAP
-#    entry. This entry can either be a newly created one, or one
-#    retrieved from an LDAP server, using the Mozilla::LDAP::Conn class.
-#
-#############################################################################
-
-package Mozilla::LDAP::Entry;
-
-require Tie::Hash;
-@ISA = (Tie::StdHash);
-
-
-#############################################################################
-# Creator, make a new tie hash instance, which will keep track of all
-# changes made to the hash array. This is needed so we only update modified
-# attributes.
-#
-sub TIEHASH
-{
-  my $class = shift;
-  my $self = {};
-
-  return bless $self, $class;
-}
-
-
-#############################################################################
-# Destructor, does nothing really...
-#
-#sub DESTROY
-#{
-#}
-
-
-#############################################################################
-# Store method, to keep track of changes.
-#
-sub STORE
-{
-  my ($self, $attr, $val) = ($_[$[], lc $_[$[ + 1], $_[$[ + 2]);
-
-  return if (($val eq "") || ($attr eq ""));
-
-  if (defined($self->{$attr}))
-    {
-      @{$self->{"_${attr}_save_"}} = @{$self->{$attr}}
-        unless $self->{"_${attr}_save_"};
-    }
-  $self->{$attr} = $val;
-  $self->{"_${attr}_modified_"} = 1;
-
-  # Potentially add the attribute to the OC order list.
-  if (($attr ne "dn") && !grep(/^$attr$/i, @{$self->{"_oc_order_"}}))
-    {
-      push(@{$self->{"_oc_order_"}}, $attr);
-    }
-}
-
-
-#############################################################################
-# Fetch method, this is case insensitive (since LDAP is...).
-#
-sub FETCH
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return unless defined($self->{$attr});
-
-  return $self->{$attr};
-}
-
-
-#############################################################################
-# Delete method, to keep track of changes.
-#
-sub DELETE
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return if ($attr eq "");
-  return unless defined($self->{$attr});
-
-  $self->{"_${attr}_deleted_"} = 1;
-  undef $self->{$attr};
-}
-
-
-#############################################################################
-# Mark an attribute as changed. Normally you shouldn't have to use this,
-# unless you're doing something really weird...
-#
-sub attrModified
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return 0 if ($attr eq "");
-  return 0 unless defined($self->{$attr});
-
-  @{$self->{"_${attr}_save_"}} = @{$self->{$attr}}
-    unless $self->{"_${attr}_save_"};
-  $self->{"_self_obj_"}->{"_${attr}_modified_"} = 1;
-
-  return 1;
-}
-
-
-#############################################################################
-# Ask if a particular attribute has been modified already. Return True or
-# false depending on the internal status of the attribute.
-#
-sub isModified
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return 0 if ($attr eq ""); return 0 unless defined($self->{$attr});
-  return $self->{"_self_obj_"}->{"_${attr}_modified_"};
-}
-
-
-#############################################################################
-# Remove an attribute from the entry, basically the same as the DELETE
-# method. We also make an alias for "delete" here, just in case (and to be
-# somewhat backward compatible).
-#
-sub remove
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return 0 if ($attr eq "");
-  return 0 unless defined($self->{$attr});
-
-  $self->{"_self_obj_"}->{"_${attr}_deleted_"} = 1;
-  undef $self->{"_self_obj_"}->{$attr};
-
-  return 1;
-}
-*delete = \*remove;
-
-
-#############################################################################
-# Delete a value from an attribute, if it exists. NOTE: If it was the last
-# value, we'll actually remove the entire attribute! We should then also
-# remove it from the _oc_order_ list...
-#
-sub removeValue
-{
-  my ($self, $attr, $val) = ($_[$[], lc $_[$[ + 1], $_[$[ + 2]);
-  my $i = 0;
-  local $_;
-
-  return 0 if (($val eq "") || ($attr eq ""));
-  return 0 unless defined($self->{$attr});
-
-  @{$self->{"_${attr}_save_"}} = @{$self->{$attr}}
-    unless $self->{"_${attr}_save_"};
-  foreach (@{$self->{$attr}})
-    {
-      if ($_ eq $val)
-	{
-	  splice(@{$self->{$attr}}, $i, 1);
-	  if ($self->size($attr) > 0)
-	    {
-	      $self->{"_self_obj_"}->{"_${attr}_modified_"} = 1;
-	    }
-	  else
-	    {
-	      $self->{"_self_obj_"}->{"_${attr}_deleted_"} = 1;
-	      # TODO: Now remove it from _oc_order_ !
-	    }
-
-	  return 1;
-	}
-      $i++;
-    }
-
-  return 0;
-}
-*deleteValue = \*removeValue;
-
-
-#############################################################################
-# Add a value to an attribute. The optional third argument indicates that
-# we should not enforce the uniqueness on this attibute, thus bypassing
-# the test and always add the value.
-#
-sub addValue
-{
-  my $self = shift;
-  my ($attr, $val, $force) = (lc $_[$[], $_[$[ + 1], $_[$[ + 2]);
-  local $_;
-
-  return 0 if (($val eq "") || ($attr eq ""));
-  if (!$force)
-    {
-      foreach (@{$self->{$attr}})
-        {
-          return 0 if ($_ eq $val);
-        }
-    }
-
-  if (defined($self->{$attr}))
-    {
-      @{$self->{"_${attr}_save_"}} = @{$self->{$attr}}
-        unless $self->{"_${attr}_save_"};
-    }
-
-  $self->{"_self_obj_"}->{"_${attr}_modified_"} = 1;
-  push(@{$self->{$attr}}, $val);
-
-  # Potentially add the attribute to the OC order list.
-  if (($attr ne "dn") && !grep(/^$attr$/i, @{$self->{"_oc_order_"}}))
-    {
-      push(@{$self->{"_oc_order_"}}, $attr);
-    }
-
-  return 1;
-}
-
-
-#############################################################################
-# Return TRUE or FALSE, if the attribute has the specified value. The
-# optional third argument says we should do case insensitive search.
-#
-sub hasValue
-{
-  my($self, $attr, $val, $nocase) = @_;
-
-  return 0 if (($val eq "") || ($attr eq ""));
-  return 0 unless defined($self->{$attr});
-  return grep(/^\Q$val\E$/i, @{$self->{$attr}}) if $nocase;
-  return grep(/^\Q$val\E$/, @{$self->{$attr}});
-}
-
-
-#############################################################################
-# Return TRUE or FALSE, if the attribute matches the specified regexp. The
-# optional third argument says we should do case insensitive search.
-#
-sub matchValue
-{
-  my($self, $attr, $reg, $nocase) = @_;
-
-  return 0 if (($reg eq "") || ($attr eq ""));
-  return 0 unless defined($self->{$attr});
-  return grep(/$reg/i, @{$self->{$attr}}) if $nocase;
-  return grep(/$reg/, @{$self->{$attr}});
-}
-
-
-#############################################################################
-# Set the DN of this entry.
-#
-sub setDN
-{
-  my ($self, $val) = @_;
-
-  return 0 if ($val eq "");
-
-  $self->{"dn"} = $val;
-
-  return 1;
-}
-
-
-#############################################################################
-# Get the DN of this entry.
-#
-sub getDN
-{
-  my ($self) = @_;
-
-  return $self->{"dn"};
-}
-
-
-#############################################################################
-#
-# Return the number of elements in an attribute.
-#
-sub size
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-  my @val;
-
-  return 0 if ($attr eq "");
-  return 0 unless defined($self->{$attr});
-
-  @val = @{$self->{$attr}};
-  return $#val + 1;
-}
-
-
-#############################################################################
-#
-# Return TRUE if the attribute name is in the LDAP entry.
-#
-sub exists
-{
-  my ($self, $attr) = ($_[$[], lc $_[$[ + 1]);
-
-  return 0 if ($attr eq "");
-  return defined($self->{$attr});
-}
-
-
-#############################################################################
-# Print an entry, in LDIF format. This is idential to the Utils::printEntry
-# function, but this is sort of neat... Note that the support for Base64
-# encoding isn't finished.
-#
-sub printLDIF
-{
-  my ($self, $base64) = @_;
-  my $attr;
-
-  print "dn: ", $self->getDN(),"\n";
-  foreach $attr (@{$self->{"_oc_order_"}})
-    {
-      next if ($attr =~ /^_.+_$/);
-      next if $self->{"_${attr}_deleted_"};
-      grep((print "$attr: $_\n"), @{$self->{$attr}});
-    }
-
-  print "\n";
-}
-
-
-#############################################################################
-# Mandatory TRUE return value.
-#
-1;
-
-
-#############################################################################
-# POD documentation...
-#
-__END__
-
-=head1 NAME
-
-  Mozilla::LDAP::Entry.pm - Object class to hold one LDAP entry.
-
-=head1 SYNOPSIS
-
-  use Mozilla::LDAP::Conn;
-  use Mozilla::LDAP::Entry;
-
-=head1 ABSTRACT
-
-The LDAP::Conn object is used to perform LDAP searches, updates, adds and
-deletes. All such functions works on LDAP::Entry objects only. All
-modifications and additions you'll do to an LDAP entry, will be done
-through this object class.
-
-=head1 DESCRIPTION
-
-The LDAP::Entry object class is built on top of the Tie::Hash standard
-object class. This gives us several powerful features, the main one being
-to keep track of what is changing in the LDAP entry. This makes it very
-easy to write LDAP clients that needs to update/modify entries, since
-you'll just do the changes, and this object class will take care of the
-rest.
-
-We define local functions for STORE, FETCH and DELETE in this object
-class, and inherit the rest from the super class. Overloading these
-specific functions is how we can keep track of what is changing in the
-entry, which turns out to be very convenient.
-
-Most of the methods here either return the requested LDAP value, or a
-status code. The status code (either 0 or 1) indicates the failure or
-success of a certain operation. 0 (False) meaning the operation failed,
-and a return code of 1 (True) means complete success.
-
-One thing to remember is that in LDAP, attribute names are case
-insensitive. All methods in this class are aware of this, and will convert
-all attribute name arguments to lower case before performing any
-operations. This does not mean that the values are case insensitive. On
-the contrary, all values are considered case sensitive by this module,
-even if the LDAP server itself treats it as a CIS attribute.
-
-=head1 OBJECT CLASS METHODS
-
-The LDAP::Entry class implements many methods you can use to access and
-modify LDAP entries. It is strongly recommended that you use this API as
-much as possible, and avoid using the internals of the class
-directly. Failing to do so may actually break the functionality.
-
-=head2 Creating a new entry
-
-To create a completely new entry, use the B<new> method, for instance
-
-    $entry = new Mozilla::LDAP::Entry()
-    $entry->setDN("uid=leif,ou=people,dc=netscape,dc=com");
-    $entry->{objectclass} = [ "top", "person", "inetOrgPerson" ];
-    $entry->addValue("cn", "Leif Hedstrom");
-    $entry->addValue("sn", "Hedstrom");
-    $entry->addValue("givenName", "Leif");
-    $entry->addValue("mail", "leif@netscape.com);
-
-    $conn->add($entry);
-
-This is the minimum requirements for an LDAP entry. It must have a DN, and
-it must have at least one objectclass. As it turns out, by adding the
-I<person> and I<inetOrgPerson> classes, we also must provide some more
-attributes, like I<CN> and I<SN>. This is because the object classes have
-these attributes marked as "required", and we'd get a schema violation
-without those values.
-
-In the example above we use both native API methods to add values, and
-setting an attribute entire value set directly. Note that the value set is
-a pointer to an array, and not the array itself. In the example above, the
-object classes are set using an anonymous array, which the API handles
-properly. It's important to be aware that the attribute value list is
-indeed a pointer.
-
-Finally, as you can see there's only only one way to add new LDAP entries,
-and it's called add(). It normally takes an LDAP::Entry object instance as
-argument, but it can also be called with a regular hash array if so
-desired.
-
-=head2 Adding and removing attributes and values
-
-This is the main functionality of this module. Use these methods to do any
-modifications and updates to your LDAP entries.
-
-=over 13
-
-=item B<attrModified>
-
-This is an internal function, that can be used to force the API to
-consider an attribute (value) to have been modified. The only argument is
-the name of the attribute. In almost all situation, you never, ever,
-should call this. If you do, please contact the developers, and as us to
-fix the API. Example
-
-    $entry->attrModified("cn");
-
-=item B<isModified>
-
-This is a somewhat more useful method, which will return the internal
-modification status of a particular attribute. The argument is the name of
-the attribute, and the return value is True or False. If the attribute has
-been modified, in any way, we return True (1), otherwise we return False
-(0). For example:
-
-    if ($entry->isModified("cn")) { # do something }
-
-=item B<remove>
-
-This will remove the entire attribute, including all it's values, from the
-entry. The only argument is the name of the attribute to remove. Let's say
-you want to nuke all I<mailAlternateAddress> values (i.e. the entire
-attribute should be removed from the entry):
-
-    $entry->remove("mailAlternateAddress");
-
-=item B<removeValue>
-
-Remove a value from an attribute, if it exists. Of course, if the
-attribute has no such value, we won't try to remove it, and instead return
-a False (0) status code. The arguments are the name of the attribute, and
-the particular value to remove. Note that values are considered case
-sensitive, so make sure you preserve case properly. An example is:
-
-    $entry->removeValue("objectclass", "nscpPerson");
-
-=item B<addValue>
-
-Add a value to an attribute. If the attribute value already exists, or we
-couldn't add the value for any other reason, we'll return FALSE (0),
-otherwise we return TRUE (1). The first two arguments are the attribute
-name, and the value to add.
-
-The optional third argument is a flag, indicating that we want to add the
-attribute without checking for duplicates. This is useful if you know the
-values are unique already, or if you perhaps want to allow duplicates for
-a particular attribute. To add a CN to an existing entry/attribute, do:
-
-    $entry->addValue("cn", "Leif Hedstrom");
-
-=item B<hasValue>
-
-Return TRUE or FALSE if the attribute has the specified value. A typical
-usage is to see if an entry is of a certain object class, e.g.
-
-    if ($entry->hasValue("objectclass", "person", 1)) { # do something }
-
-The (optional) third argument indicates if the string comparison should be
-case insensitive or not. The first two arguments are the name and value of
-the attribute, as usual.
-
-=item B<matchValue>
-
-This is very similar to B<hasValue>, except it does a regular expression
-match instead of a full string match. It takes the same arguments,
-including the optional third argument to specify case insensitive
-matching. The usage is identical to the example for hasValue, e.g.
-
-    if ($entry->matchValue("objectclass", "pers", 1)) { # do something }
-
-
-=item B<setDN>
-
-Set the DN to the specified value. Only do this on new entries, it will
-not work well if you try to do this on an existing entry. If you wish to
-renamed an entry, use the Mozilla::Conn::modifyRDN method instead.
-Eventually we'll provide a complete "rename" method. To set the DN for a
-newly created entry, we can do
-
-    $entry->setDN("uid=leif,ou=people,dc=netscape,dc=com");
-
-=item B<getDN>
-
-Return the DN for the entry. For instance
-
-    print "The DN is: ", $entry->getDN(), "\n";
-
-=item B<size>
-
-Return the number of values for a particular attribute. For instance
-
-    $entry->{cn} = [ "Leif Hedstrom", "The Swede" ];
-    $numVals = $entry->size("cn");
-
-This will set C<$numVals> to two (2). The only argument is the name of the
-attribute, and the return value is the size of the value array.
-
-=item B<exists>
-
-Return TRUE if the specified attribute is defined in the LDAP entry. This
-is useful to know if an entry has a particular attribute, regardless of
-the value. For instance:
-
-    if ($entry->exists("jpegphoto")) { # do something special }
-
-=item B<printLDIF>
-
-Print the entry (on STDOUT) in a format called LDIF (LDAP Data Interchange
-Format, RFC xxxx). An example of an LDIF entry is:
-
-    dn: uid=leif,ou=people,dc=netscape,dc=com
-    objectclass: top
-    objectclass: person
-    objectclass: inetOrgPerson
-    uid: leif
-    cn: Leif Hedstrom
-    mail: leif@netscape.com
-
-The above would be the result of
-
-    $entry->printLDIF();
-
-If you need to write to a file, close STDOUT, and open up a file with that
-file handle instead. For more useful LDIF functionality, check out the
-Mozilla::LDAP::LDIF.pm module.
-
-=back
-
-=head2 Deleting entries
-
-To delete an LDAP entry from the LDAP server, you have to use the
-B<delete> method from the Mozilla::LDAP::Conn module. It will actually
-delete any entry, if you provide an legitimate DN.
-
-=head2 Renaming entries
-
-Again, there's no functionality in this object class to rename the entry
-(i.e. changing it's DN). For now, there is a way to modify the RDN
-component of a DN through the Mozilla::LDAP::Conn module, with
-B<modifyRDN>. Eventually we hope to have a complete B<rename> method,
-which should be capable of renaming any entry, in any way, including
-moving it to a different part of the DIT (Directory Information Tree).
-
-=head1 EXAMPLES
-
-There are plenty of examples to look at, in the examples directory. We are
-adding more examples every day (almost).
-
-=head1 INSTALLATION
-
-Installing this package is part of the Makefile supplied in the
-package. See the installation procedures which are part of this package.
-
-=head1 AVAILABILITY
-
-This package can be retrieved from a number of places, including:
-
-    http://www.mozilla.org/directory/
-    Your local CPAN server
-
-=head1 CREDITS
-
-Most of this code was developed by Leif Hedstrom, Netscape Communications
-Corporation. 
-
-=head1 BUGS
-
-None. :)
-
-=head1 SEE ALSO
-
-L<Mozilla::LDAP::Conn>, L<Mozilla::LDAP::API>, and of course L<Perl>.
-
-=cut

mozilla/directory/perldap/INSTALL

@@ -1,89 +0,0 @@
-PerLDAP installation instructions
-==================================
-
-Building this package is fairly straight forward, but requires some
-knowledge about using compilers and compiler tools on your system. If you
-are uncomfortable using these tools, we recommend you get one of the
-prebuilt binary distributions instead.
-
-
-Prerequisites
-=============
-
-In order to build the module, you'll need
-
-	- Perl, version 5.003 or later. We definitely recommend you to use
-          v5.004 or later.
-
-	- An ANSI-C compiler, e.g. gcc-2.x, or Visual C++ 5.0.
-
-	- The LDAP client libraries and include files, e.g. the SDK from
-	Netscape Communications. See the README file for information on
-	retrieving binaries.
-
-You can download (or CVS checkout) the Directory SDK source, see further
-information available on
-
-	http://www.mozilla.org/directory/
-
-
-Building
-========
-
-This package uses the normal Perl5 MakeMaker installation system. To
-generate a Makefile appropriate for your platform, run perl on the
-provided Makefile.PL script, e.g.
-
-	% perl Makefile.PL
-
-
-You might have to use the command `perl5' or `perl-5.004', depending on
-how you installed Perl-5. The script will now ask you a few questions to
-find the necessary library and include files. A typical configuration
-session is
-
-    data 195% perl5 Makefile.PL
-
-    PerLDAP - Perl 5 Module for LDAP
-    ================================
-
-    Directory containing 'include' and 'lib' directory of the Netscape
-    LDAP Software Developer Kit (default: /usr): /opt/ldapsdk3
-    Using LDAPv3 Developer Kit (default: yes)?  
-    Include SSL Support (default: yes)?  
-    Writing Makefile for Mozilla::LDAP::API
-
-
-The important question is where your LDAP SDK is installed, in the example
-above the base directory is /opt/ldapsdk3. This directory should have two
-subdirectories, named "lib" and "include". If you installed the SDK in the
-standard /usr hierarchy, use the default value as provided by the install
-script.
-
-Assuming you get no errors or warning, proceed with the build and install:
-
-	% make
-	% make install
-
-
-That should be it!
-
-
-Automated Configuration and Installs
-====================================
-
-The Makefile.PL script also honors a set of environment variables to make
-it possible to do configuration and installs non-interactively. The
-variables are
-
-        LDAPSDKDIR    - Full path to the C SDK base directory
-        LDAPSDKVER    - Either "11" (for v1.1) or "30" (for v3.x)
-        LDAPSDKSSL    - Set to "Y" to enable SSL
-
-
-With these variables set, you will not be asked any of the questions
-above. Just run the Makefile.PL script, and finish the build, e.g.
-
-        % perl5 Makefile.PL
-	% make
-	% make install

mozilla/directory/perldap/LDIF.pm

@@ -1,269 +0,0 @@
-#############################################################################
-# $Id: LDIF.pm,v 1.5 1998-08-13 21:32:50 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Simple routines to read and write LDIF style files. You should open
-#    the input/output file manually, or use STDIN/STDOUT.
-#
-#############################################################################
-
-package Mozilla::LDAP::LDIF;
-
-use Mozilla::LDAP::Entry;
-use Mozilla::LDAP::Utils(qw(decodeBase64));
-
-
-#############################################################################
-# Creator, the argument (optional) is the file handle.
-#
-sub new
-{
-  my ($class, $fh) = @_;
-  my $self = {};
-
-  if ($fh)
-    {
-      $self->{"_fh_"} = $fh;
-      $self->{"_canRead_"} = 1;
-      $self->{"_canWrite_"} = 1;
-    }
-  else
-    {
-      $self->{"_fh_"} = STDIN;
-      $self->{"_canRead_"} = 1;
-      $self->{"_canWrite_"} = 0;
-    }
-
-  return bless $self, $class;
-}
-
-
-#############################################################################
-# Destructor, close file descriptors etc. (???)
-#
-#sub DESTROY
-#{
-#  my $self = shift;
-#}
-
-
-#############################################################################
-# Read the next $entry from an ::LDIF object. No arguments
-#
-sub readOneEntry
-{
-  my ($self) = @_;
-  my ($attr, $val, $entry, $base64, $fh);
-  local $_;
-
-  return unless $self->{"_canRead_"};
-  return unless defined($self->{"_fh_"});
-
-  # Skip leading empty lines.
-  $fh = $self->{"_fh_"};
-  while (<$fh>)
-    {
-      chop;
-      last unless /^\s*$/;
-    }
-  return if /^$/;		# EOF
-
-  $self->{"_canWrite_"} = 0 if $self->{"_canWrite_"};
-
-  $entry = new Mozilla::LDAP::Entry();
-  do
-    {
-      # See if it's a continuation line.
-      if (/^ /o)
-	{
-	  $val .= substr($_, 1);
-	}
-      else
-	{
-	  if ($val && $attr)
-	    {
-	      if ($attr eq "dn")
-		{
-		  $entry->setDN($val);
-		}
-	      else
-		{
-		  $val = decodeBase64($val) if $base64;
-		  $entry->addValue($attr, "$val", 1);
-		}
-	    }
-	  ($attr, $val) = split(/:\s+/, $_, 2);
-	  $attr = lc $attr;
-
-	  # Handle base64'ed data.
-	  if ($attr =~ /:$/o)
-	    {
-	      $base64 = 1;
-	      chop($attr);
-	    }
-	  else
-	    {
-	      $base64 = 0;
-	    }
-	}
-
-      $_ = <$fh>;
-      chop;
-    } until /^\s*$/;
-
-  # Do the last attribute...
-  if ($attr && ($attr ne "dn"))
-    {
-      $val = decodeBase64($val) if $base64;
-      $entry->addValue($attr, "$val", 1);
-    }
-
-  return $entry;
-}
-*readEntry = \readOneEntry;
-
-
-#############################################################################
-# Print one entry, to the file handle. Note that we actually use some
-# internals from the ::Entry object here, which is a no-no... Also, we need
-# to support Base64 encoding of Binary attributes here.
-#
-sub writeOneEntry
-{
-  my ($self, $entry) = @_;
-  my ($fh, $attr);
-
-  return unless $self->{"_canWrite_"};
-  $self->{"_canRead_"} = 0 if $self->{"_canRead_"};
-
-  $fh = $self->{"_fh_"};
-  print $fh "dn: ", $entry->getDN(),"\n";
-  foreach $attr (@{$entry->{"_oc_order_"}})
-    {
-      next if ($attr =~ /^_.+_$/);
-      next if $entry->{"_${attr}_deleted_"};
-      # TODO: Add support for Binary attributes.
-      grep((print $fh "$attr: $_\n"), @{$entry->{$attr}});
-    }
-
-  print $fh "\n";
-}
-*writeEntry = \writeOneEntry;
-
-
-#############################################################################
-# Read multiple entries, and return an array of Entry objects. The argument
-# is the number to read, or read them all if not specified.
-#
-sub readEntries
-{
-  my ($self, $num) = @_;
-  my $entry;
-  my (@entries);
-
-  return if (($num ne "") && ($num <= 0));
-  $num = -1 unless $num;
-
-  do 
-    {
-      $entry = $self->readOneEntry();
-      push(@entries, $entry) if ($entry);
-      $num--;
-    } until (! $entry || $num == 0);
-      
-  return @entries;
-}
-
-
-#############################################################################
-# Write multiple entries, the argument is the array of Entry objects.
-#
-sub writeEntries
-{
-  my ($self, @entries) = @_;
-  local $_;
-  
-  foreach (@entries)
-    {
-      $self->writeOneEntry($_);
-    }
-}
-
-
-#############################################################################
-# Mandatory TRUE return value.
-#
-1;
-
-
-#############################################################################
-# POD documentation...
-#
-__END__
-
-=head1 NAME
-
-Mozilla::LDAP::LDIF - Read, write and modify LDIF files.
-
-=head1 SYNOPSIS
-
-  use Mozilla::LDAP::LDIF;
-
-=head1 ABSTRACT
-
-This package is used to read and write LDIF information from files (actually, file handles).
-
-=head1 DESCRIPTION
-
-LDIF rules...
-
-=head1 EXAMPLES
-
-There are plenty of examples to look at, in the examples directory. We are
-adding more examples every day (almost).
-
-=head1 INSTALLATION
-
-Installing this package is part of the Makefile supplied in the
-package. See the installation procedures which are part of this package.
-
-=head1 AVAILABILITY
-
-This package can be retrieved from a number of places, including:
-
-    http://www.mozilla.org/directory/
-    Your local CPAN server
-
-=head1 CREDITS
-
-Most of this code was developed by Leif Hedstrom, Netscape Communications
-Corporation. 
-
-=head1 BUGS
-
-None. :)
-
-=head1 SEE ALSO
-
-L<Mozilla::LDAP::Conn>, L<Mozilla::LDAP::Entry>, L<Mozilla::LDAP::API>,
-and of course L<Perl>.
-
-=cut

mozilla/directory/perldap/MANIFEST

@@ -1,24 +0,0 @@
-ChangeLog
-API.pm
-API.xs
-MANIFEST
-Makefile.PL
-constant.h
-test.pl
-typemap
-Entry.pm
-Conn.pm
-LDIF.pm
-README
-MPL-1.0.txt
-test_api/search.pl
-test_api/write.pl
-test_api/api.pl
-examples/ChangeLog
-examples/lfinger.pl
-examples/qsearch.pl
-examples/monitor.pl
-examples/ldappasswd.pl
-examples/rmentry.pl
-examples/tabdump.pl
-examples/modattr.pl

mozilla/directory/perldap/MPL-1.0.txt

@@ -1,360 +0,0 @@
-                           MOZILLA PUBLIC LICENSE
-                                Version 1.0
-
-                              ----------------
-
-1. Definitions.
-
-     1.1. ``Contributor'' means each entity that creates or contributes to
-     the creation of Modifications.
-
-     1.2. ``Contributor Version'' means the combination of the Original
-     Code, prior Modifications used by a Contributor, and the Modifications
-     made by that particular Contributor.
-
-     1.3. ``Covered Code'' means the Original Code or Modifications or the
-     combination of the Original Code and Modifications, in each case
-     including portions thereof.
-
-     1.4. ``Electronic Distribution Mechanism'' means a mechanism generally
-     accepted in the software development community for the electronic
-     transfer of data.
-
-     1.5. ``Executable'' means Covered Code in any form other than Source
-     Code.
-
-     1.6. ``Initial Developer'' means the individual or entity identified as
-     the Initial Developer in the Source Code notice required by Exhibit A.
-
-     1.7. ``Larger Work'' means a work which combines Covered Code or
-     portions thereof with code not governed by the terms of this License.
-
-     1.8. ``License'' means this document.
-
-     1.9. ``Modifications'' means any addition to or deletion from the
-     substance or structure of either the Original Code or any previous
-     Modifications. When Covered Code is released as a series of files, a
-     Modification is:
-
-          A. Any addition to or deletion from the contents of a file
-          containing Original Code or previous Modifications.
-
-          B. Any new file that contains any part of the Original Code or
-          previous Modifications.
-
-     1.10. ``Original Code'' means Source Code of computer software code
-     which is described in the Source Code notice required by Exhibit A as
-     Original Code, and which, at the time of its release under this License
-     is not already Covered Code governed by this License.
-
-     1.11. ``Source Code'' means the preferred form of the Covered Code for
-     making modifications to it, including all modules it contains, plus any
-     associated interface definition files, scripts used to control
-     compilation and installation of an Executable, or a list of source code
-     differential comparisons against either the Original Code or another
-     well known, available Covered Code of the Contributor's choice. The
-     Source Code can be in a compressed or archival form, provided the
-     appropriate decompression or de-archiving software is widely available
-     for no charge.
-
-     1.12. ``You'' means an individual or a legal entity exercising rights
-     under, and complying with all of the terms of, this License or a future
-     version of this License issued under Section 6.1. For legal entities,
-     ``You'' includes any entity which controls, is controlled by, or is
-     under common control with You. For purposes of this definition,
-     ``control'' means (a) the power, direct or indirect, to cause the
-     direction or management of such entity, whether by contract or
-     otherwise, or (b) ownership of fifty percent (50%) or more of the
-     outstanding shares or beneficial ownership of such entity.
-
-2. Source Code License.
-
-     2.1. The Initial Developer Grant.
-     The Initial Developer hereby grants You a world-wide, royalty-free,
-     non-exclusive license, subject to third party intellectual property
-     claims:
-
-          (a) to use, reproduce, modify, display, perform, sublicense and
-          distribute the Original Code (or portions thereof) with or without
-          Modifications, or as part of a Larger Work; and
-
-          (b) under patents now or hereafter owned or controlled by Initial
-          Developer, to make, have made, use and sell (``Utilize'') the
-          Original Code (or portions thereof), but solely to the extent that
-          any such patent is reasonably necessary to enable You to Utilize
-          the Original Code (or portions thereof) and not to any greater
-          extent that may be necessary to Utilize further Modifications or
-          combinations.
-
-     2.2. Contributor Grant.
-     Each Contributor hereby grants You a world-wide, royalty-free,
-     non-exclusive license, subject to third party intellectual property
-     claims:
-
-          (a) to use, reproduce, modify, display, perform, sublicense and
-          distribute the Modifications created by such Contributor (or
-          portions thereof) either on an unmodified basis, with other
-          Modifications, as Covered Code or as part of a Larger Work; and
-
-          (b) under patents now or hereafter owned or controlled by
-          Contributor, to Utilize the Contributor Version (or portions
-          thereof), but solely to the extent that any such patent is
-          reasonably necessary to enable You to Utilize the Contributor
-          Version (or portions thereof), and not to any greater extent that
-          may be necessary to Utilize further Modifications or combinations.
-
-3. Distribution Obligations.
-
-     3.1. Application of License.
-     The Modifications which You create or to which You contribute are
-     governed by the terms of this License, including without limitation
-     Section 2.2. The Source Code version of Covered Code may be distributed
-     only under the terms of this License or a future version of this
-     License released under Section 6.1, and You must include a copy of this
-     License with every copy of the Source Code You distribute. You may not
-     offer or impose any terms on any Source Code version that alters or
-     restricts the applicable version of this License or the recipients'
-     rights hereunder. However, You may include an additional document
-     offering the additional rights described in Section 3.5.
-
-     3.2. Availability of Source Code.
-     Any Modification which You create or to which You contribute must be
-     made available in Source Code form under the terms of this License
-     either on the same media as an Executable version or via an accepted
-     Electronic Distribution Mechanism to anyone to whom you made an
-     Executable version available; and if made available via Electronic
-     Distribution Mechanism, must remain available for at least twelve (12)
-     months after the date it initially became available, or at least six
-     (6) months after a subsequent version of that particular Modification
-     has been made available to such recipients. You are responsible for
-     ensuring that the Source Code version remains available even if the
-     Electronic Distribution Mechanism is maintained by a third party.
-
-     3.3. Description of Modifications.
-     You must cause all Covered Code to which you contribute to contain a
-     file documenting the changes You made to create that Covered Code and
-     the date of any change. You must include a prominent statement that the
-     Modification is derived, directly or indirectly, from Original Code
-     provided by the Initial Developer and including the name of the Initial
-     Developer in (a) the Source Code, and (b) in any notice in an
-     Executable version or related documentation in which You describe the
-     origin or ownership of the Covered Code.
-
-     3.4. Intellectual Property Matters
-
-          (a) Third Party Claims.
-          If You have knowledge that a party claims an intellectual property
-          right in particular functionality or code (or its utilization
-          under this License), you must include a text file with the source
-          code distribution titled ``LEGAL'' which describes the claim and
-          the party making the claim in sufficient detail that a recipient
-          will know whom to contact. If you obtain such knowledge after You
-          make Your Modification available as described in Section 3.2, You
-          shall promptly modify the LEGAL file in all copies You make
-          available thereafter and shall take other steps (such as notifying
-          appropriate mailing lists or newsgroups) reasonably calculated to
-          inform those who received the Covered Code that new knowledge has
-          been obtained.
-
-          (b) Contributor APIs.
-          If Your Modification is an application programming interface and
-          You own or control patents which are reasonably necessary to
-          implement that API, you must also include this information in the
-          LEGAL file.
-
-     3.5. Required Notices.
-     You must duplicate the notice in Exhibit A in each file of the Source
-     Code, and this License in any documentation for the Source Code, where
-     You describe recipients' rights relating to Covered Code. If You
-     created one or more Modification(s), You may add your name as a
-     Contributor to the notice described in Exhibit A. If it is not possible
-     to put such notice in a particular Source Code file due to its
-     structure, then you must include such notice in a location (such as a
-     relevant directory file) where a user would be likely to look for such
-     a notice. You may choose to offer, and to charge a fee for, warranty,
-     support, indemnity or liability obligations to one or more recipients
-     of Covered Code. However, You may do so only on Your own behalf, and
-     not on behalf of the Initial Developer or any Contributor. You must
-     make it absolutely clear than any such warranty, support, indemnity or
-     liability obligation is offered by You alone, and You hereby agree to
-     indemnify the Initial Developer and every Contributor for any liability
-     incurred by the Initial Developer or such Contributor as a result of
-     warranty, support, indemnity or liability terms You offer.
-
-     3.6. Distribution of Executable Versions.
-     You may distribute Covered Code in Executable form only if the
-     requirements of Section 3.1-3.5 have been met for that Covered Code,
-     and if You include a notice stating that the Source Code version of the
-     Covered Code is available under the terms of this License, including a
-     description of how and where You have fulfilled the obligations of
-     Section 3.2. The notice must be conspicuously included in any notice in
-     an Executable version, related documentation or collateral in which You
-     describe recipients' rights relating to the Covered Code. You may
-     distribute the Executable version of Covered Code under a license of
-     Your choice, which may contain terms different from this License,
-     provided that You are in compliance with the terms of this License and
-     that the license for the Executable version does not attempt to limit
-     or alter the recipient's rights in the Source Code version from the
-     rights set forth in this License. If You distribute the Executable
-     version under a different license You must make it absolutely clear
-     that any terms which differ from this License are offered by You alone,
-     not by the Initial Developer or any Contributor. You hereby agree to
-     indemnify the Initial Developer and every Contributor for any liability
-     incurred by the Initial Developer or such Contributor as a result of
-     any such terms You offer.
-
-     3.7. Larger Works.
-     You may create a Larger Work by combining Covered Code with other code
-     not governed by the terms of this License and distribute the Larger
-     Work as a single product. In such a case, You must make sure the
-     requirements of this License are fulfilled for the Covered Code.
-
-4. Inability to Comply Due to Statute or Regulation.
-
-     If it is impossible for You to comply with any of the terms of this
-     License with respect to some or all of the Covered Code due to statute
-     or regulation then You must: (a) comply with the terms of this License
-     to the maximum extent possible; and (b) describe the limitations and
-     the code they affect. Such description must be included in the LEGAL
-     file described in Section 3.4 and must be included with all
-     distributions of the Source Code. Except to the extent prohibited by
-     statute or regulation, such description must be sufficiently detailed
-     for a recipient of ordinary skill to be able to understand it.
-
-5. Application of this License.
-
-     This License applies to code to which the Initial Developer has
-     attached the notice in Exhibit A, and to related Covered Code.
-
-6. Versions of the License.
-
-     6.1. New Versions.
-     Netscape Communications Corporation (``Netscape'') may publish revised
-     and/or new versions of the License from time to time. Each version will
-     be given a distinguishing version number.
-
-     6.2. Effect of New Versions.
-     Once Covered Code has been published under a particular version of the
-     License, You may always continue to use it under the terms of that
-     version. You may also choose to use such Covered Code under the terms
-     of any subsequent version of the License published by Netscape. No one
-     other than Netscape has the right to modify the terms applicable to
-     Covered Code created under this License.
-
-     6.3. Derivative Works.
-     If you create or use a modified version of this License (which you may
-     only do in order to apply it to code which is not already Covered Code
-     governed by this License), you must (a) rename Your license so that the
-     phrases ``Mozilla'', ``MOZILLAPL'', ``MOZPL'', ``Netscape'', ``NPL'' or
-     any confusingly similar phrase do not appear anywhere in your license
-     and (b) otherwise make it clear that your version of the license
-     contains terms which differ from the Mozilla Public License and
-     Netscape Public License. (Filling in the name of the Initial Developer,
-     Original Code or Contributor in the notice described in Exhibit A shall
-     not of themselves be deemed to be modifications of this License.)
-
-7. DISCLAIMER OF WARRANTY.
-
-     COVERED CODE IS PROVIDED UNDER THIS LICENSE ON AN ``AS IS'' BASIS,
-     WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
-     WITHOUT LIMITATION, WARRANTIES THAT THE COVERED CODE IS FREE OF
-     DEFECTS, MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE OR NON-INFRINGING.
-     THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE COVERED CODE
-     IS WITH YOU. SHOULD ANY COVERED CODE PROVE DEFECTIVE IN ANY RESPECT,
-     YOU (NOT THE INITIAL DEVELOPER OR ANY OTHER CONTRIBUTOR) ASSUME THE
-     COST OF ANY NECESSARY SERVICING, REPAIR OR CORRECTION. THIS DISCLAIMER
-     OF WARRANTY CONSTITUTES AN ESSENTIAL PART OF THIS LICENSE. NO USE OF
-     ANY COVERED CODE IS AUTHORIZED HEREUNDER EXCEPT UNDER THIS DISCLAIMER.
-
-8. TERMINATION.
-
-     This License and the rights granted hereunder will terminate
-     automatically if You fail to comply with terms herein and fail to cure
-     such breach within 30 days of becoming aware of the breach. All
-     sublicenses to the Covered Code which are properly granted shall
-     survive any termination of this License. Provisions which, by their
-     nature, must remain in effect beyond the termination of this License
-     shall survive.
-
-9. LIMITATION OF LIABILITY.
-
-     UNDER NO CIRCUMSTANCES AND UNDER NO LEGAL THEORY, WHETHER TORT
-     (INCLUDING NEGLIGENCE), CONTRACT, OR OTHERWISE, SHALL THE INITIAL
-     DEVELOPER, ANY OTHER CONTRIBUTOR, OR ANY DISTRIBUTOR OF COVERED CODE,
-     OR ANY SUPPLIER OF ANY OF SUCH PARTIES, BE LIABLE TO YOU OR ANY OTHER
-     PERSON FOR ANY INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
-     OF ANY CHARACTER INCLUDING, WITHOUT LIMITATION, DAMAGES FOR LOSS OF
-     GOODWILL, WORK STOPPAGE, COMPUTER FAILURE OR MALFUNCTION, OR ANY AND
-     ALL OTHER COMMERCIAL DAMAGES OR LOSSES, EVEN IF SUCH PARTY SHALL HAVE
-     BEEN INFORMED OF THE POSSIBILITY OF SUCH DAMAGES. THIS LIMITATION OF
-     LIABILITY SHALL NOT APPLY TO LIABILITY FOR DEATH OR PERSONAL INJURY
-     RESULTING FROM SUCH PARTY'S NEGLIGENCE TO THE EXTENT APPLICABLE LAW
-     PROHIBITS SUCH LIMITATION. SOME JURISDICTIONS DO NOT ALLOW THE
-     EXCLUSION OR LIMITATION OF INCIDENTAL OR CONSEQUENTIAL DAMAGES, SO THAT
-     EXCLUSION AND LIMITATION MAY NOT APPLY TO YOU.
-
-10. U.S. GOVERNMENT END USERS.
-
-     The Covered Code is a ``commercial item,'' as that term is defined in
-     48 C.F.R. 2.101 (Oct. 1995), consisting of ``commercial computer
-     software'' and ``commercial computer software documentation,'' as such
-     terms are used in 48 C.F.R. 12.212 (Sept. 1995). Consistent with 48
-     C.F.R. 12.212 and 48 C.F.R. 227.7202-1 through 227.7202-4 (June 1995),
-     all U.S. Government End Users acquire Covered Code with only those
-     rights set forth herein.
-
-11. MISCELLANEOUS.
-
-     This License represents the complete agreement concerning subject
-     matter hereof. If any provision of this License is held to be
-     unenforceable, such provision shall be reformed only to the extent
-     necessary to make it enforceable. This License shall be governed by
-     California law provisions (except to the extent applicable law, if any,
-     provides otherwise), excluding its conflict-of-law provisions. With
-     respect to disputes in which at least one party is a citizen of, or an
-     entity chartered or registered to do business in, the United States of
-     America: (a) unless otherwise agreed in writing, all disputes relating
-     to this License (excepting any dispute relating to intellectual
-     property rights) shall be subject to final and binding arbitration,
-     with the losing party paying all costs of arbitration; (b) any
-     arbitration relating to this Agreement shall be held in Santa Clara
-     County, California, under the auspices of JAMS/EndDispute; and (c) any
-     litigation relating to this Agreement shall be subject to the
-     jurisdiction of the Federal Courts of the Northern District of
-     California, with venue lying in Santa Clara County, California, with
-     the losing party responsible for costs, including without limitation,
-     court costs and reasonable attorneys fees and expenses. The application
-     of the United Nations Convention on Contracts for the International
-     Sale of Goods is expressly excluded. Any law or regulation which
-     provides that the language of a contract shall be construed against the
-     drafter shall not apply to this License.
-
-12. RESPONSIBILITY FOR CLAIMS.
-
-     Except in cases where another Contributor has failed to comply with
-     Section 3.4, You are responsible for damages arising, directly or
-     indirectly, out of Your utilization of rights under this License, based
-     on the number of copies of Covered Code you made available, the
-     revenues you received from utilizing such rights, and other relevant
-     factors. You agree to work with affected parties to distribute
-     responsibility on an equitable basis.
-
-EXHIBIT A.
-
-     ``The contents of this file are subject to the Mozilla Public License
-     Version 1.0 (the "License"); you may not use this file except in
-     compliance with the License. You may obtain a copy of the License at
-     http://www.mozilla.org/MPL/
-
-     Software distributed under the License is distributed on an "AS IS"
-     basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-     License for the specific language governing rights and limitations
-     under the License.
-
-     The Original Code is ______________________________________.
-
-     The Initial Developer of the Original Code is ________________________.
-     Portions created by ______________________ are Copyright (C) ______
-     _______________________. All Rights Reserved.
-
-     Contributor(s): ______________________________________.''

mozilla/directory/perldap/Makefile.PL

@@ -1,134 +0,0 @@
-#############################################################################
-# $Id: Makefile.PL,v 1.13 1998-08-14 21:45:39 leif%netscape.com Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    The Makefile "source".
-#
-#############################################################################
-
-use ExtUtils::MakeMaker;
-use Config;
-
-$perlpath = $Config{'perlpath'};
-$osname   = $Config{'osname'};
-
-$ldapsdk_loc = $ENV{"LDAPSDKDIR"}; # Full Path to C SDK Top-Level
-$ldapsdk_ver = $ENV{"LDAPSDKVER"}; # 11 or 30
-$ldapsdk_ssl = $ENV{"LDAPSDKSSL"}; # Y to include SSL
-
-print "\nPerLDAP - Perl 5 Module for LDAP\n";
-print     "================================\n";
-
-if (!$ldapsdk_loc)
-{
-   print "Directory containing 'include' and 'lib' directory of the Netscape\n";
-   print "LDAP Software Developer Kit (default: /usr): ";
-   chomp ($ldapsdk_loc = <>);
-   $ldapsdk_loc = "/usr" unless $ldapsdk_loc =~ /\S/;
-}
-
-if ($osname =~ /mswin/i)
-{
-   $dir_sep = "\\";
-} else {
-   $dir_sep = "/";
-}
-
-$include_ldap = $ldapsdk_loc . $dir_sep . "include";
-$lib_ldap = $ldapsdk_loc . $dir_sep . "lib";
-
-if (!$ldapsdk_ver)
-{
-   print "Using LDAPv3 Developer Kit (default: yes)?  ";
-   chomp ($ver = <>);
-   if ($ver =~ /^n/i)
-   {
-      $ldapsdk_ver = "11";
-   } else {
-      $ldapsdk_ver = "30";
-   }
-}
-
-if ($ldapsdk_ver == "30")
-{
-   $v3def = "-DLDAPV3";
-}
-   
-if (!$ldapsdk_ssl)
-{
-   print "Include SSL Support (default: yes)?  ";
-   chomp ($ldapsdk_ssl = <>);
-}
-
-if ($ldapsdk_ssl =~ /^n/i)
-{
-   $ssl_def = "";
-} else {
-   $ssl_def = "-DUSE_SSL";
-}
-
-if ($osname =~ /mswin/i)
-{
-   if ($ssl_def)
-   {
-      if ($ldapsdk_ver == "30")
-      {
-         $ldap_lib = "nsldapssl32v30";
-      } else {
-         $ldap_lib = "nsldap32v11";
-      }
-   } else {
-      $ldap_lib = "nsldap32v" . $ldapsdk_ver;
-   }
-} else {
-   if ($ssl_def)
-   {
-      if ($ldapsdk_ver == "30")
-      {
-         $ldap_lib = "ldapssl30";
-      } else {
-         $ldap_lib = "ldap30";
-      }
-   } else {
-      $ldap_lib = "ldap" . $ldapsdk_ver;
-   }
-}
-
-if ($osname =~ /mswin/i)
-{
-   $myextlib = "$lib_ldap\\$ldap_lib.lib";
-} else {
-   $myextlib = "";
-}
-
-
-WriteMakefile(
-	'NAME'		=> 	'Mozilla::LDAP::API',
-	'VERSION_FROM'	=> 	'API.pm',
-	($include_ldap ne "/usr/include" ? (
-	'INC'		=> 	"-I$include_ldap",
-	) : (
-	'INC'		=> 	"",
-	)),
-	'LIBS'		=> 	["-L$lib_ldap -l$ldap_lib"],
-	'MYEXTLIB'	=>	$myextlib,
-	'DEFINE'	=> 	"$v3_def $ssl_def",
-);

mozilla/directory/perldap/README

@@ -1,165 +0,0 @@
-#############################################################################
-#                                                                           #
-#            PerLDAP v1.0 - A Perl Developers' Kit for LDAP                 #
-#                                                                           #
-#############################################################################
-
-
-What is PerLDAP?
-================
-
-PerLDAP is a set of modules written in Perl and C that allow developers to
-leverage their existing Perl knowledge to easily access and manage LDAP-
-enabled directories.  PerLDAP makes it very easy to search, add, delete,
-and modify directory entries.  For example, Perl developers can easily
-build web applications to access information stored in a directory or
-create directory sync tools between directories and other services.
-
-PerLDAP is an open source development project, the result of a joint effort
-between Netscape and Clayton Donley, an open source developer.  PerLDAP
-currently provides the basic functions to allow Perl users to access and
-manipulate directories easily.  Based on developer feedback and
-involvement, PerLDAP will continue to evolve to include additional
-functionality in future releases.
-
-
-Installing PerLDAP Binaries
-===========================
-
-You will first need version 3.0 Beta 1 of the LDAP C SDK from Netscape.  This
-is available from the DevEdge page at:
-
-    http://developer.netscape.com/tech/directory/
-
-You will also need Perl v5.004, available at http://www.perl.com/.  Earlier
-versions of Perl will NOT work with the binaries.  If you wish to use v5.004,
-you will need to compile PerLDAP from source.
-
-On Unix (Solaris Only...HPUX, IRIX, AIX to follow):
-  1. Be sure that the libraries from the C SDK are installed in locations
-     referenced by the environment variable LD_LIBRARY_PATH.
-  2. Save the file in a temporary location
-  3. Unzip the file by entering the command:
-      gunzip <filename>.tar.gz
-  4. Untar the resulting tar file by entering the command:
-      tar xvof <filename>.tar
-  5. Change to the extract directory:
-      cd PerLDAP-1.0
-  6. Execute the following command in as the super-user (root):
-      perl install-bin
-
-On Windows NT:
-  1. Be sure that the DLL from the C SDK is installed in your system32
-     directory. Or alternatively, put the SDK DLLs in the same directory
-     as your Perl-5 binary.
-  2. Save the file in a temporary location
-  3. Unzip the file by entering the command:
-      I don't have a tool for creating self-extracting archives...
-  4. Change to the extract directory:
-      cd PerLDAP-1.0
-  5. Execute the following command:
-      perl install-bin
-
-
-Compiling the PerLDAP Sources
-=============================
-
-The source to PerLDAP is available on the Mozilla site at:
-
-  http://www.mozilla.org/directory/
-
-You can either retrieve the .tar file with the source distribution, or use
-CVS to checkout the module directly. The name of the CVS module is
-PerLDAP, and it checks out the directory
-
-  mozilla/directory/perldap
-
-Further instructions for using CVS and Mozilla is available at
-
-  http://www.mozilla.org/cvs.html
-
-Instructions for building the source can be found in the INSTALL file
-in the source distribution.
-
-
-Getting Started
-===============
-
-Documentation for this module is in standard Perl 'pod' format.  HTML
-versions of this documentation can also be found on the Netscape DevEdge
-site at:  http://developer.netscape.com/tech/directory/.
-
-Additionally, many good examples can be found in the 'examples' directory.
-
-
-Modules and Examples Included
-=============================
-
-Mozilla::LDAP::API - Low level interface between Perl and the LDAP C API
-Mozilla::LDAP::Entry - Perl methods for manipulating entry objects
-Mozilla::LDAP::Conn - Perl methods for performing LDAP operations
-Mozilla::LDAP::LDIF - Perl methods for utilizing LDIF
-Mozilla::LDAP::Utils - Some convenient LDAP related utilities
-test_api/search.pl - Tests low level API search calls
-test_api/write.pl  - Tests low level API write calls
-test_api/api.pl - Tests ALL low level LDAPv2 calls
-examples/lfinger.pl - LDAP version of the regular Unix finger command.
-examples/qsearch.pl - Simple ldapsearch replacement.
-examples/monitor.pl - Retrieve status information from an LDAP server.
-examples/ldappasswd.pl - Change the LDAP password for a user.
-examples/rmentry.pl - Remove an entire entry from the database.
-examples/rename.pl - Rename (modRDN) an entry.
-examples/tabdump.pl - Dump LDAP information into a tab separated file.
-examples/psoftsync.pl - Synchronize LDAP with a PeopleSoft "dump" file.
-
-
-All examples support the "standard" LDAP command line options, which are
-
-        -h hostname     LDAP server name
-        -p port #       LDAP port, default is 389 (or 636 for SSL)
-        -b base DN      LDAP Base-DN
-        -D bind DN      LDAP bind DN (connect to server as this "user")
-        -w bind pswd    Password to bind to the server
-        -P certfile     Use SSL, with the publick keys from this file
-
-
-Note that the examples currently only support Simple Authentication
-(passwords), the Client Authentication features (using certificates) will
-be used in the next release. All examples also honors the environment
-variable LDAP_BASEDN, set it to your systems base DN, e.g.
-
-        % setenv LDAP_BASEDN 'dc=netscape,dc=com'
-
-or for Bourne shell
-
-        # LDAP_BASEDN='dc=netscape,dc=com'; export LDAP_BASEDN
-
-
-Reporting problems and bugs
-===========================
-
-Address all bug reports and comments to the Mozilla newsgroups at:
-
-   news://news.mozilla.org/netscape.public.mozilla.general
-
-
-License/Copyright
-=================
-
-Portions by Netscape (c) Copyright 1998 Netscape Communications Corp, Inc.
-Portions by Clayton Donley (c) Copyright 1998 Clayton Donley
-
-Please read the MPL-1.0.txt file included for information on the Mozilla
-Public License, which covers all files in this distribution.
-
-Known Bugs
-==========
-
-There are a number of issues still outstanding at the time of release.  Most
-of these are already in the process of being resolved.
-
- - There is a possible memory leak in the search routines. The OO layer
-   is also more memory than it should.
- - The Rebind operation on NT does NOT work properly when set to a Perl
-   function.  This is being investigated.
- - Some of the documentation is incomplete.

mozilla/directory/perldap/Utils.pm

@@ -1,360 +0,0 @@
-#############################################################################
-# $Id: Utils.pm,v 1.10 1998-08-13 21:32:29 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Lots of Useful Little Utilities, for LDAP related operations.
-#
-#############################################################################
-
-package Mozilla::LDAP::Utils;
-
-use Mozilla::LDAP::API qw(:constant);
-use Mozilla::LDAP::Conn;
-use vars qw(@ISA %EXPORT_TAGS);
-
-require Exporter;
-
-@ISA = qw(Exporter);
-%EXPORT_TAGS = (
-		all => [qw(normalizeDN
-			   isUrl
-			   printEntry
-			   printentry
-			   encodeBase64
-			   decodeBase64
-			   str2Scope
-			   askPassword
-			   ldapArgs
-			   unixCrypt
-			   userCredentials
-			   answer)]
-		);
-
-
-# Add Everything in %EXPORT_TAGS to @EXPORT_OK
-Exporter::export_ok_tags('all');
-
-
-#############################################################################
-# Normalize the DN string (first argument), and return the new, normalized,
-# string (DN). This is useful to make sure that two syntactically
-# identical DNs compare (eq) as the same string.
-#
-sub normalizeDN
-{
-  my ($dn) = @_;
-  my (@vals);
-
-  return "" if ($dn eq "");
-
-  @vals = Mozilla::LDAP::API::ldap_explode_dn(lc $dn, 0);
-
-  return join(",", @vals);
-}
-
-
-#############################################################################
-# Checks if a string is a properly formed LDAP URL.
-#
-sub isURL
-{
-  return ldap_is_ldap_url($_[0]);
-}
-
-
-#############################################################################
-# Print an entry, in LDIF format. This is sort of obsolete, we encourage
-# you to use the :;LDAP::LDIF class instead.
-#
-sub printEntry
-{
-  my $entry = $_[0];
-  my $attr;
-  local $_;
-
-  print "dn: ", $entry->{"dn"},"\n";
-  foreach $attr (@{$entry->{"_oc_order_"}})
-    {
-      next if ($attr =~ /^_.+_$/);
-      next if $entry->{"_${attr}_deleted_"};
-      foreach (@{$entry->{$attr}})
-	{
-	  print "$attr: $_\n";
-	}
-    }
-
-  print "\n";
-}
-*printentry = \*printEntry;
-
-
-#############################################################################
-# Perform Base64 encoding, this is based on MIME::Base64.pm, written
-# by Gisle Aas <gisle@aas.no>. If possible, use the MIME:: package instead.
-#
-sub encodeBase64
-{
-  my $res = "";
-  my $eol = "$_[1]";
-  my $padding;
-
-  pos($_[0]) = 0;                          # ensure start at the beginning
-  while ($_[0] =~ /(.{1,45})/gs) {
-    $res .= substr(pack('u', $1), 1);
-    chop($res);
-  }
-
-  $res =~ tr|` -_|AA-Za-z0-9+/|;               # `# help emacs
-  $padding = (3 - length($_[0]) % 3) % 3;
-  $res =~ s/.{$padding}$/'=' x $padding/e if $padding;
-
-  if (length $eol) {
-    $res =~ s/(.{1,76})/$1$eol/g;
-  }
-
-  return $res;
-}
- 
- 
-#############################################################################
-# Perform Base64 decoding, this is based on MIME::Base64.pm, written
-# by Gisle Aas <gisle@aas.no>. If possible, use the MIME:: package instead.
-#
-sub decodeBase64
-{
-  my $str = shift;
-  my $res = "";
-  my $len;
- 
-  $str =~ tr|A-Za-z0-9+=/||cd;
-  Carp::croak("Base64 decoder requires string length to be a multiple of 4")
-    if length($str) % 4;
-
-  $str =~ s/=+$//;                        # remove padding
-  $str =~ tr|A-Za-z0-9+/| -_|;            # convert to uuencoded format
-  while ($str =~ /(.{1,60})/gs)
-    {
-      $len = chr(32 + length($1)*3/4);
-      $res .= unpack("u", $len . $1 );    # uudecode
-    }
-
-  return $res;
-}
-
-
-#############################################################################
-# Convert a "human" readable string to an LDAP scope value
-#
-sub str2Scope
-{
-  my $str = $_[0];
-
-  return $str if ($str =~ /^[0-9]+$/);
-
-  if ($str =~ /^sub/i)
-    {
-      return LDAP_SCOPE_SUBTREE;
-    }
-  elsif ($str =~ /^base/i)
-    {
-      return LDAP_SCOPE_BASE;
-    }
-  elsif ($str =~ /^one/i)
-    {
-      return LDAP_SCOPE_ONELEVEL;
-    }
-
-  # Default...
-  return LDAP_SCOPE_SUBTREE;
-}
-
-
-#############################################################################
-# Ask for a password, without displaying it on the TTY. This is very non-
-# portable, we need a better solution (using the term package perhaps?).
-#
-sub askPassword
-{
-  system('/bin/stty -echo');
-  chop($_ = <STDIN>);
-  system('/bin/stty echo');
-  print "\n";
-
-  return $_;
-}
-
-
-#############################################################################
-# Handle some standard LDAP options, and construct a nice little structure
-# that we can use later on.
-#
-sub ldapArgs
-{
-  my ($bind, $base) = @_;
-  my %ld;
-
-  $main::opt_v = $main::opt_n if defined($main::opt_n);
-  $main::opt_p = LDAPS_PORT unless (defined($main::opt_p) ||
-				    ($main::opt_p eq ""));
-
-  $ld{"host"} = $main::opt_h || "ldap";
-  $ld{"port"} = $main::opt_p || LDAP_PORT;
-  $ld{"root"} = $main::opt_b || $base || $ENV{'LDAP_BASEDN'};
-  $ld{"bind"} = $main::opt_D || $bind || "";
-  $ld{"pswd"} = $main::opt_w || "";
-  $ld{"cert"} = $main::opt_P || "";
-  $ld{"scope"} = $main::opt_s || LDAP_SCOPE_SUBTREE;
-
-  if (($ld{"bind"} ne "") && ($ld{"pswd"} eq ""))
-    {
-      print "LDAP password: ";
-      $ld{pswd} = askPassword();
-    }
-
-  return %ld;
-}
-
-
-#############################################################################
-# Create a Unix-type password, using the "crypt" function. A random salt
-# is always generated, perhaps it should be an optional argument?
-#
-sub unixCrypt
-{
-   my $ascii =
-      "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
-   my $salt = substr($ascii, rand(62), 1) . substr($ascii, rand(62), 1);
-
-   srand(time ^ $$);
-   crypt($_[0], $salt);
-}
-
-
-#############################################################################
-# Try to find a user to bind as, and possibly ask for the password. Pass
-# a pointer to the hash array with parameters to this function.
-#
-sub userCredentials
-{
-  my ($ld) = @_;
-  my ($conn, $entry, $pswd);
-
-  if ($ld->{"bind"} eq "")
-    {
-      $conn = new Mozilla::LDAP::Conn($ld);
-      die "Could't connect to LDAP server " . $ld->{"host"} unless $conn;
-
-      $search = "(&(objectclass=inetOrgPerson)(uid=$ENV{USER}))";
-      $entry = $conn->search($ld->{"root"}, "subtree", $search, 0, ("uid"));
-      return 0 if (!$entry || $conn->nextEntry());
-
-      $conn->close();
-      $ld->{"bind"} = $entry->getDN();
-      print "Binding as ", $ld->{"bind"}, "\n\n" if $main::opt_v;
-    }
-
-  if ($ld->{"pswd"} eq "")
-    {
-      print "Enter bind password: ";
-      $ld->{"pswd"} = Mozilla::LDAP::Utils::askPassword();
-    }
-}
-
-
-#############################################################################
-# Ask a Y/N question, return "Y" or "N".
-#
-sub answer
-{
-  die "Default string must be Y or N."
-    unless (($_[0] eq "Y") || ($_[0] eq "N"));
-
-  chop($_ = <STDIN>);
-
-  return $_[0] if /^$/;
-  return "Y" if /^[yY]/;
-  return "N" if /^[nN]/;
-}
-
-
-#############################################################################
-# POD documentation...
-#
-__END__
-
-=head1 NAME
-
-  Mozilla::LDAP::Utils.pm - Collection of useful little utilities.
-
-=head1 SYNOPSIS
-
-  use Mozilla::LDAP::Utils;
-
-=head1 ABSTRACT
-
-
-=head1 DESCRIPTION
-
-
-=head1 OBJECT CLASS METHODS
-
-=over 13
-
-=item B<normalizeDN>
-
-This function will remove all extraneous white spaces in the DN, and also
-change all upper case characters to lower case. The only argument is the
-DN string to normalize, and the return value is the new, clean DN.
-
-=back
-
-=head1 EXAMPLES
-
-There are plenty of examples to look at, in the examples directory. We are
-adding more examples every day (almost).
-
-=head1 INSTALLATION
-
-Installing this package is part of the Makefile supplied in the
-package. See the installation procedures which are part of this package.
-
-=head1 AVAILABILITY
-
-This package can be retrieved from a number of places, including:
-
-    http://www.mozilla.org/directory/
-    Your local CPAN server
-
-=head1 CREDITS
-
-Most of this code was developed by Leif Hedstrom, Netscape Communications
-Corporation. 
-
-=head1 BUGS
-
-None. :)
-
-=head1 SEE ALSO
-
-L<Mozilla::LDAP::Conn>, L<Mozilla::LDAP::Entry>, L<Mozilla::LDAP::API>, and
-of course L<Perl>.
-
-=cut

mozilla/directory/perldap/constant.h

@@ -1,954 +0,0 @@
-/*
- *******************************************************************************
- * $Id: constant.h,v 1.7 1998-08-13 09:14:14 leif Exp $
- *
- * The contents of this file are subject to the Mozilla Public License
- * Version 1.0 (the "License"); you may not use this file except in
- * compliance with the License. You may obtain a copy of the License at
- * http://www.mozilla.org/MPL/
- *
- * Software distributed under the License is distributed on an "AS IS"
- * basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
- * License for the specific language governing rights and limitations
- * under the License.
- *
- * The Original Code is PerLDAP. The Initial Developer of the Original
- * Code is Netscape Communications Corp. and Clayton Donley. Portions
- * created by Netscape are Copyright (C) Netscape Communications
- * Corp., portions created by Clayton Donley are Copyright (C) Clayton
- * Donley. All Rights Reserved.
- *
- * Contributor(s):
- *
- * DESCRIPTION
- *    Constants.
- *
- *******************************************************************************/
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-#include "EXTERN.h"
-#include "perl.h"
-#include "XSUB.h"
-#ifdef __cplusplus
-}
-#endif
-
-#include <ldap.h>
-
-static int
-not_here(s)
-char *s;
-{
-    croak("%s not implemented on this architecture", s);
-    return -1;
-}
-
-double
-constant(name, arg)
-char *name;
-int arg;
-{
-    errno = 0;
-    if (name[0] == 'L' && name[1] == 'D' && name[2] == 'A' && name[3] == 'P'
-       && name[4] == '_')
-    {
-      switch (name[5]) {
-       case 'A':
-	if (strEQ(name, "LDAP_ADMINLIMIT_EXCEEDED"))
-#ifdef LDAP_ADMINLIMIT_EXCEEDED
-	    return LDAP_ADMINLIMIT_EXCEEDED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AFFECTS_MULTIPLE_DSAS"))
-#ifdef LDAP_AFFECTS_MULTIPLE_DSAS
-	    return LDAP_AFFECTS_MULTIPLE_DSAS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_ALIAS_DEREF_PROBLEM"))
-#ifdef LDAP_ALIAS_DEREF_PROBLEM
-	    return LDAP_ALIAS_DEREF_PROBLEM;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_ALIAS_PROBLEM"))
-#ifdef LDAP_ALIAS_PROBLEM
-	    return LDAP_ALIAS_PROBLEM;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_ALREADY_EXISTS"))
-#ifdef LDAP_ALREADY_EXISTS
-	    return LDAP_ALREADY_EXISTS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AUTH_METHOD_NOT_SUPPORTED"))
-#ifdef LDAP_AUTH_METHOD_NOT_SUPPORTED
-	    return LDAP_AUTH_METHOD_NOT_SUPPORTED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AUTH_NONE"))
-#ifdef LDAP_AUTH_NONE
-	    return LDAP_AUTH_NONE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AUTH_SASL"))
-#ifdef LDAP_AUTH_SASL
-	    return LDAP_AUTH_SASL;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AUTH_SIMPLE"))
-#ifdef LDAP_AUTH_SIMPLE
-	    return LDAP_AUTH_SIMPLE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_AUTH_UNKNOWN"))
-#ifdef LDAP_AUTH_UNKNOWN
-	    return LDAP_AUTH_UNKNOWN;
-#else
-	    goto not_there;
-#endif
-        break;
-      case 'B':
-	if (strEQ(name, "LDAP_BUSY"))
-#ifdef LDAP_BUSY
-	    return LDAP_BUSY;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'C':
-	if (strEQ(name, "LDAP_CACHE_CHECK"))
-#ifdef LDAP_CACHE_CHECK
-	    return LDAP_CACHE_CHECK;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CACHE_LOCALDB"))
-#ifdef LDAP_CACHE_LOCALDB
-	    return LDAP_CACHE_LOCALDB;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CACHE_POPULATE"))
-#ifdef LDAP_CACHE_POPULATE
-	    return LDAP_CACHE_POPULATE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CHANGETYPE_ADD"))
-#ifdef LDAP_CHANGETYPE_ADD
-	    return LDAP_CHANGETYPE_ADD;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CHANGETYPE_ANY"))
-#ifdef LDAP_CHANGETYPE_ANY
-	    return LDAP_CHANGETYPE_ANY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CHANGETYPE_DELETE"))
-#ifdef LDAP_CHANGETYPE_DELETE
-	    return LDAP_CHANGETYPE_DELETE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CHANGETYPE_MODDN"))
-#ifdef LDAP_CHANGETYPE_MODDN
-	    return LDAP_CHANGETYPE_MODDN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CHANGETYPE_MODIFY"))
-#ifdef LDAP_CHANGETYPE_MODIFY
-	    return LDAP_CHANGETYPE_MODIFY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CLIENT_LOOP"))
-#ifdef LDAP_CLIENT_LOOP
-	    return LDAP_CLIENT_LOOP;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_COMPARE_FALSE"))
-#ifdef LDAP_COMPARE_FALSE
-	    return LDAP_COMPARE_FALSE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_COMPARE_TRUE"))
-#ifdef LDAP_COMPARE_TRUE
-	    return LDAP_COMPARE_TRUE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CONFIDENTIALITY_REQUIRED"))
-#ifdef LDAP_CONFIDENTIALITY_REQUIRED
-	    return LDAP_CONFIDENTIALITY_REQUIRED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CONNECT_ERROR"))
-#ifdef LDAP_CONNECT_ERROR
-	    return LDAP_CONNECT_ERROR;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_CONSTRAINT_VIOLATION"))
-#ifdef LDAP_CONSTRAINT_VIOLATION
-	    return LDAP_CONSTRAINT_VIOLATION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_DECODING_ERROR"))
-#ifdef LDAP_DECODING_ERROR
-	    return LDAP_DECODING_ERROR;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'D':
-	if (strEQ(name, "LDAP_DEREF_ALWAYS"))
-#ifdef LDAP_DEREF_ALWAYS
-	    return LDAP_DEREF_ALWAYS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_DEREF_FINDING"))
-#ifdef LDAP_DEREF_FINDING
-	    return LDAP_DEREF_FINDING;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_DEREF_NEVER"))
-#ifdef LDAP_DEREF_NEVER
-	    return LDAP_DEREF_NEVER;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_DEREF_SEARCHING"))
-#ifdef LDAP_DEREF_SEARCHING
-	    return LDAP_DEREF_SEARCHING;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'E':
-	if (strEQ(name, "LDAP_ENCODING_ERROR"))
-#ifdef LDAP_ENCODING_ERROR
-	    return LDAP_ENCODING_ERROR;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'F':
-	if (strEQ(name, "LDAP_FILTER_ERROR"))
-#ifdef LDAP_FILTER_ERROR
-	    return LDAP_FILTER_ERROR;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_FILT_MAXSIZ"))
-#ifdef LDAP_FILT_MAXSIZ
-	    return LDAP_FILT_MAXSIZ;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'I':
-	if (strEQ(name, "LDAP_INAPPROPRIATE_AUTH"))
-#ifdef LDAP_INAPPROPRIATE_AUTH
-	    return LDAP_INAPPROPRIATE_AUTH;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_INAPPROPRIATE_MATCHING"))
-#ifdef LDAP_INAPPROPRIATE_MATCHING
-	    return LDAP_INAPPROPRIATE_MATCHING;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_INSUFFICIENT_ACCESS"))
-#ifdef LDAP_INSUFFICIENT_ACCESS
-	    return LDAP_INSUFFICIENT_ACCESS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_INVALID_CREDENTIALS"))
-#ifdef LDAP_INVALID_CREDENTIALS
-	    return LDAP_INVALID_CREDENTIALS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_INVALID_DN_SYNTAX"))
-#ifdef LDAP_INVALID_DN_SYNTAX
-	    return LDAP_INVALID_DN_SYNTAX;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_INVALID_SYNTAX"))
-#ifdef LDAP_INVALID_SYNTAX
-	    return LDAP_INVALID_SYNTAX;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_IS_LEAF"))
-#ifdef LDAP_IS_LEAF
-	    return LDAP_IS_LEAF;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'L':
-	if (strEQ(name, "LDAP_LOCAL_ERROR"))
-#ifdef LDAP_LOCAL_ERROR
-	    return LDAP_LOCAL_ERROR;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_LOOP_DETECT"))
-#ifdef LDAP_LOOP_DETECT
-	    return LDAP_LOOP_DETECT;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'M':
-	if (strEQ(name, "LDAP_MOD_ADD"))
-#ifdef LDAP_MOD_ADD
-	    return LDAP_MOD_ADD;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MOD_BVALUES"))
-#ifdef LDAP_MOD_BVALUES
-	    return LDAP_MOD_BVALUES;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MOD_DELETE"))
-#ifdef LDAP_MOD_DELETE
-	    return LDAP_MOD_DELETE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MOD_REPLACE"))
-#ifdef LDAP_MOD_REPLACE
-	    return LDAP_MOD_REPLACE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MORE_RESULTS_TO_RETURN"))
-#ifdef LDAP_MORE_RESULTS_TO_RETURN
-	    return LDAP_MORE_RESULTS_TO_RETURN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MSG_ALL"))
-#ifdef LDAP_MSG_ALL
-	    return LDAP_MSG_ALL;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MSG_ONE"))
-#ifdef LDAP_MSG_ONE
-	    return LDAP_MSG_ONE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_MSG_RECEIVED"))
-#ifdef LDAP_MSG_RECEIVED
-	    return LDAP_MSG_RECEIVED;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'N':
-	if (strEQ(name, "LDAP_NAMING_VIOLATION"))
-#ifdef LDAP_NAMING_VIOLATION
-	    return LDAP_NAMING_VIOLATION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NOT_ALLOWED_ON_NONLEAF"))
-#ifdef LDAP_NOT_ALLOWED_ON_NONLEAF
-	    return LDAP_NOT_ALLOWED_ON_NONLEAF;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NOT_ALLOWED_ON_RDN"))
-#ifdef LDAP_NOT_ALLOWED_ON_RDN
-	    return LDAP_NOT_ALLOWED_ON_RDN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NOT_SUPPORTED"))
-#ifdef LDAP_NOT_SUPPORTED
-	    return LDAP_NOT_SUPPORTED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_LIMIT"))
-#ifdef LDAP_NO_LIMIT
-	    return LDAP_NO_LIMIT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_MEMORY"))
-#ifdef LDAP_NO_MEMORY
-	    return LDAP_NO_MEMORY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_OBJECT_CLASS_MODS"))
-#ifdef LDAP_NO_OBJECT_CLASS_MODS
-	    return LDAP_NO_OBJECT_CLASS_MODS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_RESULTS_RETURNED"))
-#ifdef LDAP_NO_RESULTS_RETURNED
-	    return LDAP_NO_RESULTS_RETURNED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_SUCH_ATTRIBUTE"))
-#ifdef LDAP_NO_SUCH_ATTRIBUTE
-	    return LDAP_NO_SUCH_ATTRIBUTE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_NO_SUCH_OBJECT"))
-#ifdef LDAP_NO_SUCH_OBJECT
-	    return LDAP_NO_SUCH_OBJECT;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'O':
-	if (strEQ(name, "LDAP_OBJECT_CLASS_VIOLATION"))
-#ifdef LDAP_OBJECT_CLASS_VIOLATION
-	    return LDAP_OBJECT_CLASS_VIOLATION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPERATIONS_ERROR"))
-#ifdef LDAP_OPERATIONS_ERROR
-	    return LDAP_OPERATIONS_ERROR;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_CACHE_ENABLE"))
-#ifdef LDAP_OPT_CACHE_ENABLE
-	    return LDAP_OPT_CACHE_ENABLE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_CACHE_FN_PTRS"))
-#ifdef LDAP_OPT_CACHE_FN_PTRS
-	    return LDAP_OPT_CACHE_FN_PTRS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_CACHE_STRATEGY"))
-#ifdef LDAP_OPT_CACHE_STRATEGY
-	    return LDAP_OPT_CACHE_STRATEGY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_CLIENT_CONTROLS"))
-#ifdef LDAP_OPT_CLIENT_CONTROLS
-	    return LDAP_OPT_CLIENT_CONTROLS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_DEREF"))
-#ifdef LDAP_OPT_DEREF
-	    return LDAP_OPT_DEREF;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_DESC"))
-#ifdef LDAP_OPT_DESC
-	    return LDAP_OPT_DESC;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_DNS"))
-#ifdef LDAP_OPT_DNS
-	    return LDAP_OPT_DNS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_DNS_FN_PTRS"))
-#ifdef LDAP_OPT_DNS_FN_PTRS
-	    return LDAP_OPT_DNS_FN_PTRS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_ERROR_NUMBER"))
-#ifdef LDAP_OPT_ERROR_NUMBER
-	    return LDAP_OPT_ERROR_NUMBER;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_ERROR_STRING"))
-#ifdef LDAP_OPT_ERROR_STRING
-	    return LDAP_OPT_ERROR_STRING;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_HOST_NAME"))
-#ifdef LDAP_OPT_HOST_NAME
-	    return LDAP_OPT_HOST_NAME;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_IO_FN_PTRS"))
-#ifdef LDAP_OPT_IO_FN_PTRS
-	    return LDAP_OPT_IO_FN_PTRS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_MEMALLOC_FN_PTRS"))
-#ifdef LDAP_OPT_MEMALLOC_FN_PTRS
-	    return LDAP_OPT_MEMALLOC_FN_PTRS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_PREFERRED_LANGUAGE"))
-#ifdef LDAP_OPT_PREFERRED_LANGUAGE
-	    return LDAP_OPT_PREFERRED_LANGUAGE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_PROTOCOL_VERSION"))
-#ifdef LDAP_OPT_PROTOCOL_VERSION
-	    return LDAP_OPT_PROTOCOL_VERSION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_REBIND_ARG"))
-#ifdef LDAP_OPT_REBIND_ARG
-	    return LDAP_OPT_REBIND_ARG;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_REBIND_FN"))
-#ifdef LDAP_OPT_REBIND_FN
-	    return LDAP_OPT_REBIND_FN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_RECONNECT"))
-#ifdef LDAP_OPT_RECONNECT
-	    return LDAP_OPT_RECONNECT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_REFERRALS"))
-#ifdef LDAP_OPT_REFERRALS
-	    return LDAP_OPT_REFERRALS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_REFERRAL_HOP_LIMIT"))
-#ifdef LDAP_OPT_REFERRAL_HOP_LIMIT
-	    return LDAP_OPT_REFERRAL_HOP_LIMIT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_RESTART"))
-#ifdef LDAP_OPT_RESTART
-	    return LDAP_OPT_RESTART;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_RETURN_REFERRALS"))
-#ifdef LDAP_OPT_RETURN_REFERRALS
-	    return LDAP_OPT_RETURN_REFERRALS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_SERVER_CONTROLS"))
-#ifdef LDAP_OPT_SERVER_CONTROLS
-	    return LDAP_OPT_SERVER_CONTROLS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_SIZELIMIT"))
-#ifdef LDAP_OPT_SIZELIMIT
-	    return LDAP_OPT_SIZELIMIT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_SSL"))
-#ifdef LDAP_OPT_SSL
-	    return LDAP_OPT_SSL;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_THREAD_FN_PTRS"))
-#ifdef LDAP_OPT_THREAD_FN_PTRS
-	    return LDAP_OPT_THREAD_FN_PTRS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OPT_TIMELIMIT"))
-#ifdef LDAP_OPT_TIMELIMIT
-	    return LDAP_OPT_TIMELIMIT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_OTHER"))
-#ifdef LDAP_OTHER
-	    return LDAP_OTHER;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'P':
-	if (strEQ(name, "LDAP_PARAM_ERROR"))
-#ifdef LDAP_PARAM_ERROR
-	    return LDAP_PARAM_ERROR;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_PARTIAL_RESULTS"))
-#ifdef LDAP_PARTIAL_RESULTS
-	    return LDAP_PARTIAL_RESULTS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_PORT"))
-#ifdef LDAP_PORT
-	    return LDAP_PORT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_PORT_MAX"))
-#ifdef LDAP_PORT_MAX
-	    return LDAP_PORT_MAX;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_PROTOCOL_ERROR"))
-#ifdef LDAP_PROTOCOL_ERROR
-	    return LDAP_PROTOCOL_ERROR;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'R':
-	if (strEQ(name, "LDAP_REFERRAL"))
-#ifdef LDAP_REFERRAL
-	    return LDAP_REFERRAL;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_REFERRAL_LIMIT_EXCEEDED"))
-#ifdef LDAP_REFERRAL_LIMIT_EXCEEDED
-	    return LDAP_REFERRAL_LIMIT_EXCEEDED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RESULTS_TOO_LARGE"))
-#ifdef LDAP_RESULTS_TOO_LARGE
-	    return LDAP_RESULTS_TOO_LARGE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_ADD"))
-#ifdef LDAP_RES_ADD
-	    return LDAP_RES_ADD;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_ANY"))
-#ifdef LDAP_RES_ANY
-	    return LDAP_RES_ANY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_BIND"))
-#ifdef LDAP_RES_BIND
-	    return LDAP_RES_BIND;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_COMPARE"))
-#ifdef LDAP_RES_COMPARE
-	    return LDAP_RES_COMPARE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_DELETE"))
-#ifdef LDAP_RES_DELETE
-	    return LDAP_RES_DELETE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_EXTENDED"))
-#ifdef LDAP_RES_EXTENDED
-	    return LDAP_RES_EXTENDED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_MODIFY"))
-#ifdef LDAP_RES_MODIFY
-	    return LDAP_RES_MODIFY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_MODRDN"))
-#ifdef LDAP_RES_MODRDN
-	    return LDAP_RES_MODRDN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_RENAME"))
-#ifdef LDAP_RES_RENAME
-	    return LDAP_RES_RENAME;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_SEARCH_ENTRY"))
-#ifdef LDAP_RES_SEARCH_ENTRY
-	    return LDAP_RES_SEARCH_ENTRY;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_SEARCH_REFERENCE"))
-#ifdef LDAP_RES_SEARCH_REFERENCE
-	    return LDAP_RES_SEARCH_REFERENCE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_RES_SEARCH_RESULT"))
-#ifdef LDAP_RES_SEARCH_RESULT
-	    return LDAP_RES_SEARCH_RESULT;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'S':
-	if (strEQ(name, "LDAP_SASL_BIND_IN_PROGRESS"))
-#ifdef LDAP_SASL_BIND_IN_PROGRESS
-	    return LDAP_SASL_BIND_IN_PROGRESS;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SASL_SIMPLE"))
-#ifdef LDAP_SASL_SIMPLE
-	    return LDAP_SASL_SIMPLE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SCOPE_BASE"))
-#ifdef LDAP_SCOPE_BASE
-	    return LDAP_SCOPE_BASE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SCOPE_ONELEVEL"))
-#ifdef LDAP_SCOPE_ONELEVEL
-	    return LDAP_SCOPE_ONELEVEL;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SCOPE_SUBTREE"))
-#ifdef LDAP_SCOPE_SUBTREE
-	    return LDAP_SCOPE_SUBTREE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SECURITY_NONE"))
-#ifdef LDAP_SECURITY_NONE
-	    return LDAP_SECURITY_NONE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SERVER_DOWN"))
-#ifdef LDAP_SERVER_DOWN
-	    return LDAP_SERVER_DOWN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SIZELIMIT_EXCEEDED"))
-#ifdef LDAP_SIZELIMIT_EXCEEDED
-	    return LDAP_SIZELIMIT_EXCEEDED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SORT_CONTROL_MISSING"))
-#ifdef LDAP_SORT_CONTROL_MISSING
-	    return LDAP_SORT_CONTROL_MISSING;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_STRONG_AUTH_NOT_SUPPORTED"))
-#ifdef LDAP_STRONG_AUTH_NOT_SUPPORTED
-	    return LDAP_STRONG_AUTH_NOT_SUPPORTED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_STRONG_AUTH_REQUIRED"))
-#ifdef LDAP_STRONG_AUTH_REQUIRED
-	    return LDAP_STRONG_AUTH_REQUIRED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_SUCCESS"))
-#ifdef LDAP_SUCCESS
-	    return LDAP_SUCCESS;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'T':
-	if (strEQ(name, "LDAP_TIMELIMIT_EXCEEDED"))
-#ifdef LDAP_TIMELIMIT_EXCEEDED
-	    return LDAP_TIMELIMIT_EXCEEDED;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_TIMEOUT"))
-#ifdef LDAP_TIMEOUT
-	    return LDAP_TIMEOUT;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_TYPE_OR_VALUE_EXISTS"))
-#ifdef LDAP_TYPE_OR_VALUE_EXISTS
-	    return LDAP_TYPE_OR_VALUE_EXISTS;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'U':
-	if (strEQ(name, "LDAP_UNAVAILABLE"))
-#ifdef LDAP_UNAVAILABLE
-	    return LDAP_UNAVAILABLE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_UNAVAILABLE_CRITICAL_EXTENSION"))
-#ifdef LDAP_UNAVAILABLE_CRITICAL_EXTENSION
-	    return LDAP_UNAVAILABLE_CRITICAL_EXTENSION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_UNDEFINED_TYPE"))
-#ifdef LDAP_UNDEFINED_TYPE
-	    return LDAP_UNDEFINED_TYPE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_UNWILLING_TO_PERFORM"))
-#ifdef LDAP_UNWILLING_TO_PERFORM
-	    return LDAP_UNWILLING_TO_PERFORM;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_ERR_BADSCOPE"))
-#ifdef LDAP_URL_ERR_BADSCOPE
-	    return LDAP_URL_ERR_BADSCOPE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_ERR_MEM"))
-#ifdef LDAP_URL_ERR_MEM
-	    return LDAP_URL_ERR_MEM;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_ERR_NODN"))
-#ifdef LDAP_URL_ERR_NODN
-	    return LDAP_URL_ERR_NODN;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_ERR_NOTLDAP"))
-#ifdef LDAP_URL_ERR_NOTLDAP
-	    return LDAP_URL_ERR_NOTLDAP;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_ERR_PARAM"))
-#ifdef LDAP_URL_ERR_PARAM
-	    return LDAP_URL_ERR_PARAM;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_URL_OPT_SECURE"))
-#ifdef LDAP_URL_OPT_SECURE
-	    return LDAP_URL_OPT_SECURE;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_USER_CANCELLED"))
-#ifdef LDAP_USER_CANCELLED
-	    return LDAP_USER_CANCELLED;
-#else
-	    goto not_there;
-#endif
-	break;
-      case 'V':
-	if (strEQ(name, "LDAP_VERSION"))
-#ifdef LDAP_VERSION
-	    return LDAP_VERSION;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_VERSION1"))
-#ifdef LDAP_VERSION1
-	    return LDAP_VERSION1;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_VERSION2"))
-#ifdef LDAP_VERSION2
-	    return LDAP_VERSION2;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_VERSION3"))
-#ifdef LDAP_VERSION3
-	    return LDAP_VERSION3;
-#else
-	    goto not_there;
-#endif
-	if (strEQ(name, "LDAP_VERSION_MAX"))
-#ifdef LDAP_VERSION_MAX
-	    return LDAP_VERSION_MAX;
-#else
-	    goto not_there;
-#endif
-	break;
-      }
-    } else {
-	if (strEQ(name, "LDAPS_PORT"))
-#ifdef LDAPS_PORT
-	    return LDAPS_PORT;
-#else
-	    goto not_there;
-#endif
-    }
-
-    errno = EINVAL;
-    return 0;
-
-not_there:
-    errno = ENOENT;
-    return 0;
-}

mozilla/directory/perldap/examples/ChangeLog

@@ -1,17 +0,0 @@
-1998-08-03  Leif Hedstrom  <leif@netscape.com>
-
-	* psoftsync.pl: New file, also merged in some modules from
-	LdapUtils.pm, to make sure this works. NOTE: This script currently
-	doesn't work, since all "modify" operations are horked.
-
-1998-07-30  Leif Hedstrom  <leif@netscape.com>
-
-	* tabdump.pl: Actually works!
-
-	* ldappasswd.pl: Cleaned out some code, and moved it over to the
-	::Utils module.
-
-1998-07-29  Leif Hedstrom  <leif@netscape.com>
-
-	* qsearch.pl: First working version.
-

mozilla/directory/perldap/examples/ldappasswd.pl

@@ -1,104 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: ldappasswd.pl,v 1.6 1998-08-13 09:13:23 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    This is an LDAP version of the normal passwd/yppasswd command found
-#    on most Unix systems. Note that this will only use the {crypt}
-#    encryption/hash algorithm (at this point).
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#############################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "ldappasswd";
-$USAGE	= "$APPNAM [-nv] -b base -h host -D bind -w pswd -P cert search ...";
-
-@ATTRIBUTES = ("uid", "userpassword");
-
-
-#############################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('nvb:s:h:D:w:P:')) {
-   print "usage: $APPNAM $USAGE\n";
-   exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-Mozilla::LDAP::Utils::userCredentials(\%ld) unless $opt_n;
-
-
-#############################################################################
-# Ask for the new password, and confirm it's correct.
-#
-do
-{
-  print "New password: ";
-  $new = Mozilla::LDAP::Utils::askPassword();
-  print "New password (again): ";
-  $new2 = Mozilla::LDAP::Utils::askPassword();
-  print "Passwords didn't match, try again!\n\n" if ($new ne $new2);
-} until ($new eq $new2);
-print "\n";
-
-$crypted = Mozilla::LDAP::Utils::unixCrypt("$new");
-
-
-#############################################################################
-# Now do all the searches, one by one. If there are no search criteria, we
-# will change the password for the user running the script.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-foreach $search ($#ARGV >= $[ ? @ARGV : $ld{bind})
-{
-  $entry = $conn->search($search, "subtree", "ALL", 0, @ATTRIBUTES);
-  $entry = $conn->search($ld{root}, "subtree", $search, 0, @ATTRIBUTES)
-    unless $entry;
-  print "No such user: $search\n" unless $entry;
-
-  while ($entry)
-    {
-      $entry->{userpassword} = ["{crypt}" . $crypted];
-      print "Changing password for: $entry->{dn}\n" if $opt_v;
-
-      if (!$opt_n)
-	{
-	  $conn->update($entry);
-	  $conn->printError() if $conn->getErrorCode();
-	}
-
-      $entry = $conn->nextEntry();
-    }
-}
-
-
-#############################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/lfinger.pl

@@ -1,128 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: lfinger.pl,v 1.10 1998-08-13 09:13:08 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    "finger" version using LDAP information (using RFC 2307 objectclass).
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#############################################################################
-# Constants, shouldn't have to edit these... The HIDE mechanism is a very
-# Netscape internal specific feature. We use this objectclass to mark some
-# entries to be "hidden", and some of our applications will honor this. With
-# more recent versions of the Directory Server this can be accomplished more
-# effectively with appropriate ACI/ACLs.
-#
-$APPNAM	= "lfinger";
-$USAGE	= "$APPNAM -m -b base -h host -D bind -w pswd -P cert user_info";
-
-@ATTRIBUTES = ("uid", "cn", "homedirectory", "loginshell", "pager",
-	       "telephonenumber", "facsimiletelephonenumber", "mobile");
-$HIDE = "(objectclass=nscphidethis)";
-
-
-
-#############################################################################
-# Print a "finger" entry.
-#
-sub printIt
-{
-  my($entry) = @_;
-
-  print "Login name: $entry->{uid}[0]";
-  print " " x (39 - 11 - length($entry->{uid}[0]));
-  print "In real life: $entry->{cn}[0]\n";
-  if ($entry->{homedirectory}[0] || $entry->{loginshell}[0])
-    {
-      print "Directory: $entry->{homedirectory}[0]";
-      print " " x (39 - 10 - length($entry->{homedirectory}[0]));
-      print "Shell: $entry->{loginshell}[0]\n";
-    }
-
-  if ($entry->{telephonenumber}[0] || $entry->{pager}[0])
-    {
-      print "Phone: $entry->{telephonenumber}[0]";
-      print " " x (39 - 6 - length($entry->{telephonenumber}[0]));
-      print "Pager: $entry->{pager}[0]\n";
-    }
-
-  if ($entry->{mobile}[0] || $entry->{facsimiletelephonenumber}[0])
-    {
-      print "Mobile: $entry->{mobile}[0]";
-      print " " x (39 - 7 - length($entry->{mobile}[0]));
-      print "Fax: $entry->{facsimiletelephonenumber}[0]\n";
-    }
-
-  print "\n";
-}
-
-
-#############################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('mb:h:D:p:w:P:') || !defined($ARGV[$[]))
-{
-   print "usage: $APPNAM $USAGE\n";
-   exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-$user=$ARGV[$[];
-
-
-#############################################################################
-# Instantiate an LDAP object, which also binds to the LDAP server.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-
-#############################################################################
-# Ok, lets generate the filter, and do the search!
-#
-if ($opt_m)
-{
-  $search = "(&(uid=$user)(!$HIDE))";
-}
-else
-{
-  $search = "(&(|(cn=*$user*)(uid=*$user*)(telephonenumber=*$user*))(!$HIDE))";
-}
-
-$entry = $conn->search($ld{root}, "subtree", $search, 0, @ATTRIBUTES);
-$conn->printError() if $conn->getErrorCode();
-
-while($entry)
-{
-  printIt($entry);
-  $entry = $conn->nextEntry();
-}
-
-
-#############################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/modattr.pl

@@ -1,321 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: modattr.pl,v 1.7 1998-08-13 23:32:28 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    This script can be used to do a number of different modification
-#    operations on a script. Like adding/deleting values, or entire
-#    attributes.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#############################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "modattr";
-$USAGE	= "$APPNAM [-dnvW] -b base -h host -D bind -w pswd -P cert attr=value filter";
-
-
-#############################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('adnvWb:h:D:p:s:w:P:'))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-Mozilla::LDAP::Utils::userCredentials(\%ld) unless $opt_n;
-
-
-#############################################################################
-# Let's process the changes requested, and commit them unless the "-n"
-# option was given.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-#$conn->setDefaultRebindProc($ld{bind}, $ld{pswd}, 128);
-#$conn->setRebindProc(\&LdapUtils::rebindProc);
-
-($change, $search) = @ARGV;
-if (($change eq "") || ($search eq ""))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-($attr, $value) = split(/=/, $change, 2);
-
-$entry = $conn->search($ld{root}, $ld{scope}, $search);
-while ($entry)
-{
-  $changed = 0;
-
-  if ($opt_d && defined $entry->{$attr})
-    {
-      if ($value)
-	{
-	  $changed = $entry->removeValue($attr, $value);
-	  if ($changed && $opt_v)
-	    {
-	      print "Removed value from ", $entry->getDN(), "\n" if $opt_v;
-	    }
-	}
-      else
-	{
-	  delete $entry->{$attr};
-	  print "Deleted attribute $attr for ", $entry->getDN(), "\n" if $opt_v;
-	  $changed = 1;
-	}
-    }
-  else
-    {
-      if ($opt_a)
-	{
-	  $changed = $entry->addValue($attr, $value);
-	  if ($changed && $opt_v)
-	    {
-	      print "Added attribute to ", $entry->getDN(), "\n" if $opt_v;
-	    }
-	}
-      else
-	{
-	  if ($entry->{$attr}[0] ne $value)
-	    {
-	      $entry->{$attr} = [$value];
-	      $changed = 1;
-	      print "Set attribute for ", $entry->getDN(), "\n" if $opt_v;
-	    }
-	}
-    }
-  if ($changed && ! $opt_n)
-    {
-      $conn->update($entry);
-      $conn->printError() if $conn->getErrorCode();
-    }
-
-  $entry = $conn->nextEntry();
-}
-
-
-#############################################################################
-# Close the connection.
-#
-$conn->close if $conn;
-
-
-#############################################################################
-# POD documentation...
-#
-__END__
-
-=head1 NAME
-
-  modattr - Modify an attribute for one or more LDAP entries
-
-=head1 SYNOPSIS
-
-  modattr [-adnvW] -b base -h host -D bind DN -w pwd -P cert attr=value filter
-
-=head1 ABSTRACT
-
-This command line utility can be used to modify one attribute for one or
-more LDAP entries. As simple as this sounds, this turns out to be a very
-common operation. For instance, let's say you want to change "mailHost"
-for all users on a machine named I<dredd>, to be I<judge>. With this
-script all you have to do is
-
-    modattr mailHost=judge '(mailHost=dredd)'
-
-=head1 DESCRIPTION
-
-There are four primary operations that can be made with this utility:
-
-=over 4
-
-=item *
-
-Set an attribute to a (single) specified value.
-
-=item *
-
-Add a value to an attribute (for multi-value attributes).
-
-=item *
-
-Delete a value from an attribute. If it's the last value (or if it's a
-single value), this will remove the entire attribute.
-
-=item *
-
-Delete an entire attribute, even if it has multiple values.
-
-=back
-
-The first three requires an option of the form B<attr=value>, while the
-last one only takes the name of the attribute as the option. The last
-argument is always an LDAP search filter, specifying which entries the
-operation should be applied to.
-
-=head1 OPTIONS
-
-All but the first two command line options for this tool are standard LDAP
-options, to set parameters for the LDAP connection. The two new options
-are I<-a> and I<-d> to add and remove attribute values.
-
-Without either of these two options specified (they are both optional),
-the default action is to set the attribute to the specified value. That
-will effectively remove any existing values for this attribute.
-
-=over 12
-
-=item -a
-
-Specify that the operation is an I<add>, to add a value to the
-attribute. If there is no existing value for this attribute, we'll create
-a new attribute, otherwise we add the new value if it's not already there.
-
-=item -d
-
-Delete the attribute value, or the entire attribute if there's no value
-specified. As you can see this option has two forms, and it's function
-depends on the last arguments. Be careful here, if you forget to specify
-the value to delete, you will remove all of them.
-
-=item -h <host>
-
-Name of the LDAP server to connect to.
-
-=item -p <port>
-
-TCP port for the LDAP connection.
-
-=item -b <DN>
-
-Base DN for the search
-
-=item -D <bind>
-
-User (DN) to bind as. We support a few convenience shortcuts here, like
-I<root>, I<user> and I<repl>.
-
-=item -w <passwd>
-
-This specifies the password to use when connecting to the LDAP
-server. This is strongly discouraged, and without this option the script
-will ask for the password interactively.
-
-=item -s <scope>
-
-Search scope, default is I<sub>, the other possible values are I<base> and
-I<one>. You can also specify the numeric scopes, I<0>, I<1> or I<2>.
-
-=item -P
-
-Use SSL for the LDAP connection, using the specified cert.db file for
-certificate information.
-
-=item -n
-
-Don't do anything, only show the changes that would have been made. This
-is very convenient, and can save you from embarrassing mistakes.
-
-=item -v
-
-Verbose output.
-
-=back
-
-The last two arguments are special for this script. The first
-argument specifies the attribute (and possibly the value) to operate on,
-and the last argument is a properly formed LDAP search filter.
-
-=head1 EXAMPLES
-
-We'll give one example for each of the four operations this script can
-currently handle. Since the script itself is quite flexible, you'll
-probably find you can use this script for a lot of other applications, or
-call it from other scripts. Note that we don't specify any LDAP specific
-options here, we assume you have configured your defaults properly.
-
-To set the I<description> attribute for user "leif", you would do
-
-    modattr 'description=Company Swede' '(uid=leif)'
-
-The examples shows how to use this command without either of the I<-a> or
-the I<-d> argument. To add an e-mail alias (alternate address) to the same
-user, you would do
-
-    modattr -a 'mailAlternateAddress=theSwede@netscape.com' '(uid=leif)'
-
-To remove an object class from all entries which uses it, you could do
-
-    modattr -d 'objectclass=dummyClass' '(objectclass=dummyClass)'
-
-This example is not great, since unless you've assured that no entries
-uses any of the attributes in this class, you'll get schema
-violations. But don't despair, you can use this tool to clean up all
-entries first! To completely remove all usage of an attribute named
-I<dummyAttr>, you'd simply do
-
-    modattr -d dummyAttr '(dummyAttr=*)'
-
-This shows the final format of this command, notice how we don't specify a
-value, to assure that the entire attribute is removed. This is potentially
-dangerous, so again be careful.
-
-=head1 INSTALLATION
-
-In order to use this script, you'll need Perl version 5.004 or later, the
-LDAP SDK, and also the LDAP Perl module (aka PerLDAP). Once you've installed
-these packages, just copy this file to where you keep your admin binaries,
-e.g. /usr/local/bin.
-
-In order to get good performance, you should make sure you have indexes on
-the attributes you typically use with this script. Our experience has been
-that in most cases the standard indexes in the Directory Server are
-sufficient, e.g. I<CN>, I<UID> and I<MAIL>.
-
-=head1 AVAILABILITY
-
-This package can be retrieved from a number of places, including:
-
-    http://www.mozilla.org/directory/
-    Your local CPAN server
-
-=head1 CREDITS
-
-This little tool was developed internally at Netscape, by Leif Hedstrom.
-
-=head1 BUGS
-
-None, of course...
-
-=head1 SEE ALSO
-
-L<Mozilla::LDAP::API> and L<Perl>
-
-=cut

mozilla/directory/perldap/examples/monitor.pl

@@ -1,67 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: monitor.pl,v 1.2 1998-08-13 09:12:05 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Ask the directory server for it's monitor entry, to see some
-#    performance and usage stats.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#################################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "monitor";
-$USAGE	= "$APPNAM [-nv] -b base -h host -D bind -w pswd -P cert";
-
-
-#################################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('b:h:D:p:w:P:'))
-{
-   print "usage: $APPNAM $USAGE\n";
-   exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs("", "cn=monitor");
-
-
-#################################################################################
-# Instantiate an LDAP object, which also binds to the LDAP server, and then
-# do the simple search.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-$entry = $conn->search($ld{root}, "base", "objectclass=*");
-Mozilla::LDAP::Utils::printEntry($entry)
-  if ($entry);
-
-
-#################################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/psoftsync.pl

@@ -1,616 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: psoftsync.pl,v 1.4 1998-08-13 09:27:53 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Synchronise some LDAP info with a PeopleSoft "dump". This "dump" file
-#    is a "tab" separated file, as generated by an SQL utility on the
-#    Oracle server.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#############################################################################
-# Local configurations, check these out . Note that SYNCS and ORDER has to
-# have the same fields, this is because the hash array doesn't preserve
-# the order of it's entries... :-( The "codes" are bit fields, where the
-# three LSB are used as
-#
-#	 1  Force the update, even if attribute is empty (i.e. delete it)
-#	 2  The attribute is the base for a DN (e.g. "manager").
-#	 4  The attribute should be deleted if the user is not in PeopleSoft.
-#	 8  Don't warn if the attribute is missing in the Psoft file (-W option).
-#	16  Always delete this attribute in the PeopleSoft entry.
-#	32  Delete this attribute if the account has "expired".
-#
-%SYNCS = (
-	  "nscpharold" => 1 + 4,
-	  "uid" => 0,
-	  "" => 0,
-	  "" => 0,
-	  "employeenumber" => 1 + 4 + 32,
-	  "departmentnumber" => 1 + 4,
-	  "" => 0,
-	  "" => 0,
-	  "" => 0,
-	  "manager" => 1 + 2,
-	  "title" => 1 + 4 + 16 + 32,
-	  "ou" =>  1 + 4 + 32,
-	  "businesscategory" => 1 + 4 + 32,
-	  "employeetype" => 0,
-	  "nscppersonexpdate" => 1 + 8
-	  );
-
-@ORDER = (
-	  "nscpharold",
-	  "uid",
-	  "",
-	  "",
-	  "employeenumber",
-	  "departmentnumber",
-	  "",
-	  "",
-	  "",
-	  "manager",
-	  "title",
-	  "ou",
-	  "businesscategory",
-	  "employeetype",
-	  "nscppersonexpdate"
-	  );
-
-# This is used for mapping the employeeType attribute into a readable format.
-%EMPCODES = (
-	     "A" => "Applicant",
-	     "C" => "Contractor",
-	     "E" => "Employee",
-	     "O" => "OEM Partner",
-	     "T" => "Interim",
-	     "V" => "Vendor"
-	     );
-
-# Expiration policy for other attributes, the EXPDELAY is a convenience
-# default setting.
-$EXPDELAY = 24 * 7;
-%EXPIRES = (
-	    "carlicense"		=> $EXPDELAY,
-	    "mailautoreplymode"		=> $EXPDELAY,
-	    "mailautoreplytext"		=> $EXPDELAY,
-	    "mailforwardingaddress"	=> $EXPDELAY,
-	    "facsimiletelephonenumber"	=> $EXPDELAY
-	    );
-	    
-
-$NOTYPE = "Unknown";
-$DELIMITER = "%%";
-$SENDMAIL = "/usr/lib/sendmail";
-
-$SEARCH = "(&(uid=*)(!(objectclass=pseudoAccount)))";
-$MAILTO = "leif\@netscape.com";
-
-#$LDAP_DEBUG = 1;
-
-
-#############################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "psoftsync";
-$USAGE	= "$APPNAM [-nvW] -b base -h host -D bind -w passwd -P cert PS_file";
-
-@ATTRIBUTES = uniq(@ORDER);
-push(@ATTRIBUTES, "objectclass");
-
-$TODAY = `/usr/bin/date '+%Y%m%d'`;
-chop($TODAY);
-
-
-#############################################################################
-# Print an error for the PeopleSoft data. Note that we use the "__XXX__" fields
-# here, to avoid the problem when an attribute is "expired" or modified.
-#
-sub psoftError
-{
-  my($str, $entry) = @_;
-
-  print "Error: $str: ";
-  print $entry->key(), " (";
-  print $entry->{__employeenumber__}, ", ";
-  print $entry->{__employeetype__}, ", ";
-  print $entry->{__departmentnumber__}, ")\n";
-}
-
-
-#############################################################################
-# Read in a PeopleSoft file, and create all the entries.
-#
-sub readDump
-{
-  my($file) = @_;
-  my(@info);
-  my(%entries);
-  my($val);
-
-  if (!open(PSOFT, $file))
-    {
-      print "Error: Can't read file $file\n";
-
-      exit(1);
-    }
-
-  while (<PSOFT>)
-    {
-      next unless /$DELIMITER/;
-
-      @info = split(/\s*%%\s*/);
-      $entry = new PsoftEntry($info[$[]);
-      foreach $attr (@ORDER)
-	{
-	  $val = shift(@info);
-	  next if ($attr eq "");
-
-	  $entry->add($attr, $val, $SYNCS{$attr});
-	}
-      #
-      # Perhaps we should do some sanity checks here on the PeopleSoft data?
-      #
-
-      # Clean up some data if the user has expired ("best before...")
-      if ($entry->expired($entry->{nscppersonexpdate}))
-	{
-	  foreach $attr (@ORDER)
-	    {
-	      next unless $attr;
-
-	      delete($entry->{$attr}) if ($SYNCS{$attr} & 32);
-	    }
-	}
-
-      if ($entry->{uid})
-	{
-	  $entries{$entry->{uid}} = $entry;
-	}
-      elsif ($opt_W)
-	{
-	  psoftError("No UID", $entry);
-	}
-    }
-  close(PSOFT);
-
-  return %entries;
-}
-
-
-#############################################################################
-# Make a list "uniq", just like the Unix command.
-#
-sub uniq {				# uniq(elements[])
-   my(%tmp);
-   
-   grep($tmp{$_}++, @_);
-   return sort(keys(%tmp));
-}
-
-
-#############################################################################
-# Delete an attribute from an entry.
-#
-sub delAttr {				# delAttr(ENTRY, ATTR)
-  ($entry, $attr) = @_;
-
-  if (defined($entry->{$attr}))
-    {
-      $out->write("Deleted $attr for user: $entry->{uid}[0]") if $opt_v;
-      delete($entry->{$attr});
-
-      return 1;
-    }
-
-  return 0;
-}
-
-
-#############################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('nvMWb:h:D:p:s:w:P:'))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-Mozilla::LDAP::Utils::userCredentials(\%ld) unless $opt_n;
-
-$out = new Mail();
-if ($opt_M)
-{
-  $out->set("to", $MAILTO);
-  $out->set("subject", "Hoth: PeopleSoft synchronization report");
-}
-else
-{
-  $out->echo();
-  $out->nomail();
-}
-
-
-#############################################################################
-# Read in all the PeopleSoft entries, and then instantiate an LDAP object,
-# which also binds to the LDAP server.
-#
-%psoft = readDump(@ARGV[$[]);
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-
-#############################################################################
-# Now process all the users, one by one.
-#
-$entry = $conn->search($ld{root}, "subtree", $SEARCH, 0, @ATTRIBUTES);
-
-while ($entry)
-{
-  $uid = $entry->{"uid"}[0];
-  $changed = 0;
-
-  $psent = $psoft{$uid};
-  if (!$psent)
-    {
-      print "Error: LDAP user $uid: No entry in PeopleSoft\n" if $opt_W;
-      foreach $attr (@ORDER)
-	{
-	  next unless $attr;
-	  $changed += delAttr($entry, $attr) if ($SYNCS{$attr} & 4);
-	}
-      if ($entry->{employeetype}[0] ne "$NOTYPE")
-	{
-	  $entry->{employeetype} = ["$NOTYPE"];
-	  $changed = 1;
-	  $out->write("Set employeeType to $NOTYPE for user: $uid") if $opt_v;
-	}
-	  
-    }
-  else
-    {
-      $psent->handled(1);
-      foreach $attr (@ORDER)
-	{
-	  next unless $attr;
-
-	  if (!defined($psent->{$attr}) || ($psent->{$attr} eq ""))
-	    {
-	      $changed += delAttr($entry, $attr) if ($SYNCS{$attr} & 1);
-	    }
-	  elsif ($entry->{$attr}[0] ne $psent->{$attr})
-	    {
-	      $entry->{$attr} = [$psent->{$attr}];
-	      $changed = 1;
-	      $out->write("Set $attr to $psent->{$attr} for user: $uid") if $opt_v;
-	    }
-	}
-      # Now handle the Expire date special case...
-      if ($psent->expired() ne "")
-	{
-	  if ($entry->addValue("objectclass", "nscphidethis"))
-	    {
-	      $changed = 1;
-	      $out->write("Expiring the user: $uid") if $opt_v;
-	    }
-
-	  # Expire other attributes, IFF the expire is over a certain
-	  # treshhold (e.g. a week).
-	}
-      elsif ($entry->removeValue("objectclass", "nscphidethis"))
-	{
-	  $changed = 1;
-	  $out->write("Enabling the user: $uid") if $opt_v;
-	}
-    }
-
-  $conn->update($entry) if ($changed && ! $opt_n);
-  $entry = $conn->nextEntry();
-}
-
-
-#############################################################################
-# Close the LDAP connection.
-#
-$conn->close if $conn;
-
-
-#############################################################################
-# Post process, figure out which PSoft entries have no entry in LDAP.
-#
-if ($opt_W)
-{
-  foreach (keys(%psoft))
-    {
-      $ent=$psoft{$_};
-      
-      psoftError("No LDAP entry", $ent) unless $ent->handled();
-    }
-}
-
-
-
-#############################################################################
-# Package to an entry from the PeopleSoft database.
-#
-package PsoftEntry;
-
-
-#############################################################################
-# Creator.
-#
-sub new
-{
-  my($class, $key) = @_;
-  my $self = {};
-  
-  bless $self, ref $class || $class;
-  $self->{__key__} = $key;
-
-  return $self;
-}
-
-
-#############################################################################
-# Add an attribute/field to the entry.
-#
-sub add
-{
-  my($self, $attr, $val, $lev) = @_;
-
-  return if ($lev & 16);
-
-  $attr = lc $attr;
-  if ($attr eq "employeetype")
-    {
-      if (defined($main::EMPCODES{$val}))
-	{
-	  $self->{$attr} = $main::EMPCODES{$val};
-	}
-      else
-	{
-	  $self->{$attr} = $main::NOTYPE;
-	}
-      $self->{__employeetype__} = $val;
-    }
-  elsif ($val eq "")
-    {
-      main::psoftError("No attribute $attr", $self)
-	if ($main::opt_W && ($lev & 1) && !($lev & 8));
-    }
-  else
-    {
-      $self->{$attr} = ($lev & 2) ? "uid=$val,$main::ld{root}" : $val;
-      $self->{"__${attr}__"} = $val;
-    }
-}
-
-
-#############################################################################
-# Return the value for an attribute/field.
-#
-sub get
-{
-  my($self, $attr) = @_;
-
-  return $self->{$attr};
-}
-
-
-#############################################################################
-# Mark the entry as "expired". If there is no "date" argument, we'll return
-# the current entries expire status.
-#
-sub expired
-{
-  my($self, $date) = @_;
-
-  if ($date)
-    {
-      # Only expire entries with reasonable expire dates...
-      if (length($date) != 8)
-	{
-	  main::psoftError("Bad expire date", $self) if $main::opt_W;
-
-	  return 0;
-	}
-
-      if ($date lt $main::TODAY)
-	{
-	  $self->{employeetype} = "$NOTYPE";
-	  $self->{__expired__} = 1;
-
-	  return 1;
-	}
-    }
-
-  return $self->{__expired__};
-}
-
-
-#############################################################################
-# Mark the entry as "handled", i.e. it exists in LDAP.
-#
-sub handled
-{
-  my($self, $flag) = @_;
-
-  $self->{__handled__} = 1 if $flag;
-
-  return $self->{__handled__};
-}
-
-
-#############################################################################
-# Return the "key" of this entry, typically the name field.
-#
-sub key
-{
-  my($self) = @_;
-
-  return $self->{__key__};
-}
-
-
-#################################################################################
-# This sub-package will send mail to some recipients, IFF there is anything to
-# send, or your force it to send. Note that the Subject doesn't qualify it to
-# send a message (force it to send if you have to).
-#
-package Mail;
-
-
-#################################################################################
-# The constructor, which optionally takes the TO, FROM and SUBJECT.
-#
-sub new
-{
-  my($class, $to, $from, $subject) = @_;
-  my $self = {};
-
-  bless $self, ref $class || $class;
-
-  $self->{to} = $to || "root";
-  $self->{from} = $from || "ldap";
-  $self->{subject} = $subject || "Output from LDAP script\n";
-  @{$self->{message}} = ();
-  $self->{send} = 0;
-  $self->{nomail} = 0;
-  $self->{echo} = 0;
-
-  return $self;
-}
-
-
-#################################################################################
-# Destructor, which will also send the message, if appropriate.
-#
-sub DESTROY
-{
-  my($self) = @_;
-
-  if ($self->{send} && !$self->{nomail})
-    {
-      $self->send();
-      $self->{send} = 0;
-    }
-}
-
-
-#################################################################################
-# Set a field for this entry, e.g. From:, To: etc.
-#
-sub set
-{
-  my($self, $field, $string) = @_;
-
-  if ($field && $string)
-    {
-      $field = lc $field;
-      $self->{$field} = $string;
-    }
-}
-
-
-#################################################################################
-# Add a line to the message, the argument is the string.
-#
-sub write
-{
-  my($self, $string) = @_;
-
-  if ($string ne "")
-    {
-      push(@{$self->{message}}, $string);
-      print "$string\n" if $self->{echo};
-
-      $self->{send}++;
-    }
-}
-
-
-#################################################################################
-# Force the object to send the message, no matter if there's anything in the
-# body or not.
-#
-sub force
-{
-  my($self) = @_;
-
-  $self->{send} = 1;
-  $self->{nomail} = 0;
-}
-
-
-#################################################################################
-# Don't send the mail, this is the oppositte to "force...
-#
-sub nomail
-{
-  my($self) = @_;
-
-  $self->{send} = 0;
-  $self->{nomail} = 1;
-}
-
-
-#################################################################################
-# Enable echo-mode, where we will also print everything to STDOUT.
-#
-sub echo
-{
-  my($self) = @_;
-
-  $self->{echo} = 1;
-}
-
-
-#################################################################################
-# Actually send the message. This is automatically done by the DESTROY method,
-# but we can force it to do it this way.
-#
-sub send
-{
-  my($self) = @_;
-
-  if ($self->{send} && !$self->{nomail})
-    {
-      open(MAILER, "|$main::SENDMAIL -t");
-      print MAILER "From: $self->{from}\n";
-      print MAILER "To: $self->{to}\n";
-      print MAILER "Subject: $self->{subject}\n\n";
-
-      foreach (@{$self->{message}})
-	{
-	  print MAILER "$_\n";
-	}
-      print MAILER ".\n";
-
-      close(MAILER);
-      $self->{send} = 0;
-    }
-}

mozilla/directory/perldap/examples/qsearch.pl

@@ -1,95 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: qsearch.pl,v 1.7 1998-08-13 09:28:05 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Quick Search, like ldapsearch, but in Perl. Look how simple it is.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#################################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "qsearch";
-$USAGE	= "$APPNAM -b base -h host -D bind -w pswd -P cert filter [attr...]";
-
-
-#################################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('b:h:D:p:s:w:P:'))
-{
-   print "usage: $APPNAM $USAGE\n";
-   exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-
-
-#################################################################################
-# Now do all the searches, one by one.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-foreach (@ARGV)
-{
-  if (/\=/)
-    {
-      push(@srch, $_);
-    }
-  else
-    {
-      push(@attr, $_);
-    }
-}
-
-foreach $search (@srch)
-{
-  if ($#attr >= $[)
-    {
-      $entry = $conn->search($ld{root}, $ld{scope}, $search, 0, @attr);
-    }
-  else
-    {
-      $entry = $conn->search($ld{root}, $ld{scope}, "$search");
-    }
-
-  print "Searched for `$search':\n\n";
-  $conn->printError() if $conn->getErrorCode();
-
-  while($entry)
-    {
-      $entry->printLDIF();
-      $entry = $conn->nextEntry;
-    }
-  print "\n";
-}
-
-
-#################################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/rename.pl

@@ -1,100 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: rename.pl,v 1.3 1998-08-13 09:56:03 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Rename an LDAP entry, changing it's DN. Note that currently this only
-#    works with RDNs.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#############################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "rename";
-$USAGE	= "$APPNAM [-nvI] -b base -h host -D bind -w pswd -P cert filter new_rdn";
-
-@ATTRIBUTES = ("objectclass");
-
-
-#############################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('nvIb:h:D:w:P:'))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-Mozilla::LDAP::Utils::userCredentials(\%ld) unless $opt_n;
-
-($search, $rdn) = @ARGV;
-if (($search eq "") || ($rdn eq ""))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-
-
-#############################################################################
-# Instantiate an LDAP object, which also binds to the LDAP server.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-$key = "Y" if $opt_I;
-$entry = $conn->search($ld{root}, $ld{scope}, $search, 0, @ATTRIBUTES);
-$conn->printError() if $conn->getErrorCode();
-
-if (! $entry || $conn->nextEntry())
-{
-  print "Error: The search did not return exactly one match, abort!\n";
-  exit;
-}
-
-if (! $opt_I)
-{
-  print "Rename ", $entry->getDN(), " with $rdn [N]? ";
-  $key = Mozilla::LDAP::Utils::answer("N") unless $opt_I;
-}
-
-if ($key eq "Y")
-{
-  # Note: I have to explicitly specify the original DN below, since the call
-  # to nextEntry() above blows the DN away from the ::Conn object.
-  if (! $opt_n)
-    {
-      $conn->modifyRDN($rdn, $entry->getDN());
-      $conn->printError() if $conn->getErrorCode();
-    }
-  print "Renamed $entry->{dn}\n" if $opt_v;
-}
-
-
-#################################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/rmentry.pl

@@ -1,94 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: rmentry.pl,v 1.3 1998-08-13 09:10:57 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Remove one or several LDAP objects. By default this tool is
-#    interactive, which can be disabled with the "-I" option (but
-#    please be careful...).
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#################################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "rmentry";
-$USAGE	= "$APPNAM [-nvI] -b base -h host -D bind -w pswd -P cert filter ...";
-
-@ATTRIBUTES = ("uid");
-
-
-#################################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('nvIb:h:D:w:P:'))
-{
-  print "usage: $APPNAM $USAGE\n";
-  exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-Mozilla::LDAP::Utils::userCredentials(\%ld) unless $opt_n;
-
-
-#################################################################################
-# Do the search, and process all the entries.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-$key = "Y" if $opt_I;
-foreach $search (@ARGV)
-{
-  $entry = $conn->search($ld{root}, $ld{scope}, $search, 0, @ATTRIBUTES);
-  $conn->printError() if $conn->getErrorCode();
-
-  while ($entry)
-    {
-      if (! $opt_I)
-	{
-	  print "Delete $entry->{dn} [N]? ";
-	  $key = Mozilla::LDAP::Utils::answer("N") unless $opt_I;
-	}
-
-      if ($key eq "Y")
-	{
-	  if (! $opt_n)
-	    {
-	      $conn->delete($entry->{dn});
-	      $conn->printError() if $conn->getErrorCode();
-	    }
-	  print "Deleted $entry->{dn}\n" if $opt_v;
-	}
-
-      $entry = $conn->nextEntry();
-    }
-}
-
-
-#################################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/examples/tabdump.pl

@@ -1,81 +0,0 @@
-#!/usr/bin/perl5
-#############################################################################
-# $Id: tabdump.pl,v 1.3 1998-08-13 09:11:10 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Generate a TAB separate "dump" of entries matching the search criteria,
-#    using the list of attributes specified.
-#
-#############################################################################
-
-use Getopt::Std;			# To parse command line arguments.
-use Mozilla::LDAP::Conn;		# Main "OO" layer for LDAP
-use Mozilla::LDAP::Utils;		# LULU, utilities.
-
-
-#################################################################################
-# Constants, shouldn't have to edit these...
-#
-$APPNAM	= "tabdump";
-$USAGE	= "$APPNAM [-nv] -b base -h host -D bind -w pswd -P cert attr1,attr2,.. srch";
-
-
-#################################################################################
-# Check arguments, and configure some parameters accordingly..
-#
-if (!getopts('nvb:h:D:p:s:w:P:'))
-{
-   print "usage: $APPNAM $USAGE\n";
-   exit;
-}
-%ld = Mozilla::LDAP::Utils::ldapArgs();
-
-$attributes = $ARGV[$[];
-$search = $ARGV[$[ + 1];
-die "Need to specify a list of attributes and the search filter.\n"
-  unless ($attributes && $search);
-
-
-#################################################################################
-# Do the searches, and produce the output.
-#
-$conn = new Mozilla::LDAP::Conn(\%ld);
-die "Could't connect to LDAP server $ld{host}" unless $conn;
-
-@attr = split(/,/, $attributes);
-$entry = $conn->search($ld{root}, $ld{scope}, $search, 0, @attr);
-$conn->printError() if $conn->getErrorCode();
-
-while ($entry)
-{
-  foreach (@attr)
-    {
-      print $entry->{$_}[0], "\t";
-    }
-  print "\n";
-  $entry = $conn->nextEntry;
-}
-
-
-#################################################################################
-# Close the connection.
-#
-$conn->close if $conn;

mozilla/directory/perldap/install-bin

@@ -1,59 +0,0 @@
-#!/usr/bin/perl -w
-#############################################################################
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Perl Script to Install PerLDAP Binaries without a Makefile.
-#    For use with the binary distribution of PerLDAP.
-#
-#############################################################################
-
-use File::Path;
-use File::Copy;
-use Config;
-
-print "\n##############################################\n";
-print "#       Installing Netscape PerLDAP v1.0     #\n";
-print "##############################################\n\n";
-
-$ARCH_LIB = $Config{'sitearchexp'} . "/auto/Mozilla/LDAP/API";
-$PERL_LIB = $Config{'sitelibexp'};
-
-print "Creating Directory '$ARCH_LIB'...\n";
-File::Path::mkpath "$ARCH_LIB";
-print "Creating Directory '$PERL_LIB/Mozilla/LDAP'...\n";
-File::Path::mkpath "$PERL_LIB/Mozilla/LDAP";
-
-print "Copying Architecture Dependent Files...\n";
-
-foreach $file (glob "blib/arch/auto/Mozilla/LDAP/API/*")
-{
-   copy($file,"$ARCH_LIB");
-}
-
-print "Copying Module Components...\n";
-
-foreach $file (glob "blib/lib/Mozilla/LDAP/*")
-{
-   copy($file,"$PERL_LIB/Mozilla/LDAP");
-}
-
-print "Finished!\n\n";
-exit 0;

mozilla/directory/perldap/test.pl

@@ -1,162 +0,0 @@
-#############################################################################
-# $Id: test.pl,v 1.6 1998-08-13 09:14:44 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Before `make install' is performed this script should be runnable with
-#    `make test'. After `make install' it should work as `perl test.pl'
-#
-#############################################################################
-
-######################### We start with some black magic to print on failure.
-
-# Change 1..1 below to 1..last_test_to_print .
-# (It may become useful if the test is moved to ./t subdirectory.)
-
-BEGIN { $| = 1; print "1..8\n"; }
-END {print "modinit  - not ok\n" unless $loaded;}
-use Mozilla::LDAP::API qw(:constant :api :ssl);
-$loaded = 1;
-print "modinit  - ok\n";
-
-######################### End of black magic.
-
-
-$attrs = [];
-
-$ldap_host = $ENV{"LDAPHOST"};
-$filter = $ENV{"TESTFILTER"};
-$BASEDN = $ENV{"LDAPBASE"};
-
-if (!$ldap_host)
-{
-   print "\nEnter LDAP Server: ";
-   chomp($ldap_host = <>);
-}
-
-if (!$filter)
-{
-   print "Enter Search Filter (ex. uid=abc123): ";
-   chomp($filter = <>);
-}
-
-if (!$BASEDN)
-{
-   print "Enter LDAP Search Base (ex. o=Org, c=US): ";
-   chomp($BASEDN = <>);
-}
-
-print "\n";
-
-
-##
-##  Initialize LDAP Connection
-##
-
-if (($ld = ldap_init($ldap_host,LDAP_PORT)) == -1)
-{
-   print "open     - not ok\n";
-   exit -1; 
-}
-print "open     - ok\n";
-
-##
-##  Bind as DN, PASSWORD (NULL,NULL) on LDAP connection $ld
-##
-
-if (ldap_simple_bind_s($ld,"","") != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"bind_s");
-   print "bind     - not ok\n";
-   exit -1;
-}
-print "bind     - ok\n";
-
-##
-## ldap_search_s - Synchronous Search
-##
-
-if (ldap_search_s($ld,$BASEDN,LDAP_SCOPE_SUBTREE,$filter,$attrs,0,$result) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"search_s");
-   print  "search   - not ok\n";
-}
-print "search   - ok\n";
-
-##
-## ldap_count_entries - Count Matched Entries
-##
-
-if (($count = ldap_count_entries($ld,$result)) == -1)
-{
-   ldap_perror($ld,"count_entry");
-   print "count    - not ok\n";
-}
-print "count    - ok	- $count\n";
-
-##
-## first_entry - Get First Matched Entry
-## next_entry  - Get Next Matched Entry
-##
-
-   for ($ent = ldap_first_entry($ld,$result); $ent; $ent = ldap_next_entry($ld,$ent))
-   {
-      
-##
-## ldap_get_dn  -  Get DN for Matched Entries
-##
-
-      if (($dn = ldap_get_dn($ld,$ent)) ne "")
-      {
-         print "getdn    - ok	- $dn\n";
-      } else {
-         ldap_perror($ld,"get_dn");
-         print "getdn    - not ok\n";
-      }
-
-      for ($attr = ldap_first_attribute($ld,$ent,$ber); $attr; $attr = ldap_next_attribute($ld,$ent,$ber))
-      {
-         print "firstatt - ok	- $attr\n";
-
-##
-## ldap_get_values
-##
-
-         @vals = ldap_get_values($ld,$ent,$attr);
-         if ($#vals >= 0)
-         {
-            foreach $val (@vals)
-            {
-               print "getvals  - ok	- $val\n";
-            }
-         } else {
-            print "getvals  - not ok\n";
-         }
-      }
-
-
-   }
-
-##
-##  Unbind LDAP Connection
-##
-
-ldap_unbind($ld);
-

mozilla/directory/perldap/test_api/api.pl

@@ -1,275 +0,0 @@
-#!/usr/bin/perl -w
-#############################################################################
-# $Id: api.pl,v 1.6 1998-08-13 04:40:00 clayton Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerlDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#   api.pl - Test all LDAPv2 API function
-#   Author:  Clayton Donley <donley@wwa.com>
-#
-#   Performs all API calls directly in order to test for possible issues
-#   on a particular platform.
-#
-#############################################################################
-
-use Mozilla::LDAP::API qw(:api :constant);
-use strict;
-
-my $BASE = "ou=Test,o=Test,c=US";
-my $DN = "cn=Directory Manager";
-my $PASS = "abcd1234";
-my $HOST = "";
-my $PORT = 389;
-
-if (!$HOST)
-{
-   print "Please edit the variables at the top of this file.\n";
-   exit -1;
-}
-
-my $howmany = 10;
-
-# Initialize the Connection
-{
-my $ld = ldap_init($HOST,$PORT);
-if ($ld <0)
-{
-   print "init			- Failed!\n";
-   die;
-}
-print "init		- OK\n";
-
-# Set an LDAP Session Option
-if (ldap_set_option($ld,LDAP_OPT_PROTOCOL_VERSION,LDAP_VERSION3)
-      != LDAP_SUCCESS)
-{
-   print "set_option	- Failed!\n";
-} else {
-   print "set_option	- OK\n";
-}
-
-# Get an LDAP Session Option
-my $option;
-ldap_get_option($ld,LDAP_OPT_REFERRALS,$option);
-
-if ($option != 1)
-{
-   print "get_option	- Failed!\n";
-} else {
-   print "get_option	- OK\n";
-}
-
-# Anonymous Bind
-if (ldap_simple_bind_s($ld,"","") != LDAP_SUCCESS)
-{
-   print "anon_bind	- Failed!\n";
-} else {
-   print "anon_bind	- OK\n";
-}
-
-# Authenticated Simple Bind
-if (ldap_simple_bind_s($ld,$DN,$PASS) != LDAP_SUCCESS)
-{
-   print "simple_bind	- Failed!\n";
-} else {
-   print "simple_bind	- OK\n";
-}
-
-# Set Rebind Process
-my $rebindproc = sub { return($DN,$PASS,LDAP_AUTH_SIMPLE); };
-ldap_set_rebind_proc($ld,$rebindproc);
-print "set_rebind	- OK\n";
-
-# Add an OrgUnit Entry
-my $entry = {
-	"objectclass" => ["top","organizationalUnit"],
-	"ou" => "Test",
-};
-
-if (ldap_add_s($ld,$BASE,$entry) != LDAP_SUCCESS)
-{
-   print "add_org		- Failed!\n";
-} else {
-   print "add_org		- OK\n";
-}
-
-
-# Add People
-foreach my $number (1..$howmany)
-{
-   $entry = {
-	"objectclass" => ["top","person"],
-	"cn" => "Mozilla $number",
-	"sn" => ["$number"],
-   };
-   if (ldap_add_s($ld,"cn=Mozilla $number,$BASE",$entry)
-	 != LDAP_SUCCESS)
-   {
-      print "add_user_$number	- Failed!\n";
-   } else {
-      print "add_user_$number	- OK\n";
-   }
-}
-
-# Modify People
-foreach my $number (1..$howmany)
-{
-   $entry = {
-	"sn" => {"a",["Test"]},
-	"telephoneNumber" => "800-555-111$number",
-   };
-   if (ldap_modify_s($ld,"cn=Mozilla $number,$BASE",$entry)
-	  != LDAP_SUCCESS)
-   {
-      print "mod_user_$number	- Failed!\n";
-   } else {
-      print "mod_user_$number	- OK\n";
-   }
-}
-
-
-# Search People
-my $filter = "(sn=Test)";
-my $attrs = ["cn","sn"];
-my $res;
-if (ldap_search_s($ld,$BASE,LDAP_SCOPE_SUBTREE,$filter,$attrs,0,$res)
-     != LDAP_SUCCESS)
-{
-   print "search_user	- Failed!\n";
-} else {
-   print "search_user	- OK\n";
-}
-
-# Count Results
-if (ldap_count_entries($ld,$res) != $howmany)
-{
-   print "count_res	- Failed!\n";
-} else {
-   print "count_res	- OK\n";
-}
-
-# Sort Results
-if (ldap_sort_entries($ld,$res,"sn") != LDAP_SUCCESS)
-{
-   print "sort_ent	- Failed!\n";
-} else {
-   print "sort_ent	- OK\n";
-}
-
-# Multisort Results
-if (ldap_multisort_entries($ld,$res,["sn","telephoneNumber"]) != LDAP_SUCCESS)
-{
-   print "multisort	- Failed!\n";
-} else {
-   print "multisort	- OK\n";
-}
-
-# Get First Entry
-my $ent = ldap_first_entry($ld,$res);
-if (!$ent)
-{
-   print "first_entry	- Failed!\n";
-} else {
-   print "first_entry	- OK\n";
-}
-
-# Get Next Entry
-$ent = ldap_next_entry($ld,$ent);
-if (!$ent)
-{
-   print "next_entry	- Failed!\n";
-} else {
-   print "next_entry	- OK\n";
-}
-
-# Get DN
-my $dn = ldap_get_dn($ld,$ent);
-if (!$dn)
-{
-   print "get_dn		- Failed!\n";
-} else {
-   print "get_dn		- OK\n";
-}
-
-# Get First Attribute
-my $ber;
-my $attr = ldap_first_attribute($ld,$ent,$ber);
-if (!$attr)
-{
-   print "first_attr	- Failed!\n";
-} else {
-   print "first_attr	- OK\n";
-}
-
-# Get Next Attribute
-$attr = ldap_next_attribute($ld,$ent,$ber);
-if (!$attr)
-{
-   print "next_attr	- Failed!\n";
-} else {
-   print "next_attr	- OK\n";
-}
-
-# Get Attribute Values
-my @vals = ldap_get_values($ld,$ent,$attr);
-if ($#vals < 0)
-{
-   print "get_values	- Failed!\n";
-} else {
-   print "get_values	- OK\n";
-}
-
-# Free structures pointed to by $ber and $res to prevent memory leak
-ldap_ber_free($ber,1);
-ldap_msgfree($res);
-
-# Compare Attribute Values
-foreach my $number (1..$howmany)
-{
-   if(ldap_compare_s($ld,"cn=Mozilla $number,$BASE","sn",$number)
-	 != LDAP_COMPARE_TRUE)
-   {
-      print "comp_user_$number	- Failed!\n";
-   } else {
-      print "comp_user_$number	- OK\n";
-   }
-}
-
-# Delete Users
-foreach my $number (1..$howmany)
-{
-   if (ldap_delete_s($ld,"cn=Mozilla $number,$BASE") != LDAP_SUCCESS)
-   {
-      print "del_user_$number	- Failed!\n";
-   } else {
-      print "del_user_$number	- OK\n";
-   }
-}
-
-if (ldap_delete_s($ld,"$BASE") != LDAP_SUCCESS)
-{
-   print "del_org		- Failed!\n";
-} else {
-   print "del_org		- OK\n";
-}
-
-# Unbind
-ldap_unbind($ld);
-}

mozilla/directory/perldap/test_api/search.pl

@@ -1,131 +0,0 @@
-#!/usr/bin/perl
-#############################################################################
-# $Id: search.pl,v 1.4 1998-08-13 04:40:01 clayton Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerlDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Test the search capabilities of the API, similar to write.pl.
-#
-#############################################################################
-
-use Mozilla::LDAP::API qw(:api :constant);
-use strict;
-
-
-my $ldap_host = "";
-my $BASEDN = "o=Org,c=US";
-my $filter = $ARGV[0];
-
-if (!$ldap_host)
-{
-   print "Edit the top portion of this file before continuing.\n";
-   exit -1;
-}
-
-my $attrs = [];
-
-my ($ld,$result,$count);
-
-##
-##  Initialize LDAP Connection
-##
-
-if (($ld = ldap_init($ldap_host,LDAP_PORT)) == -1)
-{
-   die "Can not open LDAP connection to $ldap_host";
-}
-
-##
-##  Bind as DN, PASSWORD (NULL,NULL) on LDAP connection $ld
-##
-
-if (ldap_simple_bind_s($ld,"","") != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"bind_s");
-   die;
-}
-
-##
-## ldap_search_s - Synchronous Search
-##
-
-if (ldap_search_s($ld,$BASEDN,LDAP_SCOPE_SUBTREE,$filter,$attrs,0,$result) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"search_s");
-   die;
-}
-
-##
-## ldap_count_entries - Count Matched Entries
-##
-
-if (($count = ldap_count_entries($ld,$result)) == -1)
-{
-   ldap_perror($ld,"count_entry");
-   die;
-}
-
-##
-## first_entry - Get First Matched Entry
-## next_entry  - Get Next Matched Entry
-##
-
-for (my $ent = ldap_first_entry($ld,$result); $ent; $ent = ldap_next_entry($ld,$ent))
-{
-      
-##
-## ldap_get_dn  -  Get DN for Matched Entries
-##
-
-   my ($dn,$attr,@vals,$val,$ber);
-   if (($dn = ldap_get_dn($ld,$ent)) ne "")
-   {
-      print "dn: $dn\n";
-   } else {
-      ldap_perror($ld,"get_dn");
-      die;
-   }
-
-   for ($attr = ldap_first_attribute($ld,$ent,$ber); $attr; $attr = ldap_next_attribute($ld,$ent,$ber))
-   {
-
-##
-## ldap_get_values
-##
-
-      @vals = ldap_get_values($ld,$ent,$attr);
-      if ($#vals >= 0)
-      {
-         foreach $val (@vals)
-         {
-            print "$attr: $val\n";
-         }
-      }
-   }
-   ldap_ber_free($ber,0);
-}
-ldap_msgfree($result);
-
-##
-##  Unbind LDAP Connection
-##
-
-ldap_unbind($ld);
-

mozilla/directory/perldap/test_api/write.pl

@@ -1,110 +0,0 @@
-#!/usr/bin/perl -w
-#############################################################################
-# $Id: write.pl,v 1.4 1998-08-13 04:40:02 clayton Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerlDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#   write.pl - Test of LDAP Modify Operations in Perl5
-#   Author:  Clayton Donley <donley@wwa.com>
-#
-#   This utility is mostly to demonstrate all the write operations
-#   that can be done with LDAP through this PERL5 module.
-#
-#############################################################################
-
-use strict;
-use Mozilla::LDAP::API qw(:constant :api);
-
-
-# This is the entry we will be adding.  Do not use a pre-existing entry.
-my $ENTRYDN = "cn=Test Guy, o=Org, c=US";
-
-# This is the DN and password for an Administrator
-my $ROOTDN = "cn=DSManager,o=Org,c=US";
-my $ROOTPW = "";
-
-my $ldap_server = "";
-
-if (!$ldap_server)
-{
-   print "Edit the top portion of this file before continuing.\n";
-   exit -1;
-}
-
-my $ld = ldap_init($ldap_server,LDAP_PORT);
-
-if ($ld == -1)
-{
-   die "Connection to LDAP Server Failed";
-}
-
-if (ldap_simple_bind_s($ld,$ROOTDN,$ROOTPW) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"bind_s");
-   die;
-}
-
-my %testwrite = (
-	"cn" => "Test User",
-	"sn" => "User",
-        "givenName" => "Test",
-	"telephoneNumber" => "8475551212",
-	"objectClass" => ["top","person","organizationalPerson",
-           "inetOrgPerson"],
-        "mail" => "tuser\@my.org",
-);
-
-if (ldap_add_s($ld,$ENTRYDN,\%testwrite) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"add_s");
-   die;
-}
-
-print "Entry Added.\n";
-
-
-%testwrite = (
-	"telephoneNumber" => "7085551212",
-        "mail" => {"a",["Test_User\@my.org"]},
-);
-
-if (ldap_modify_s($ld,$ENTRYDN,\%testwrite) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"modify_s");
-   die;
-}
-
-print "Entry Modified.\n";
-
-#
-# Delete the entry for $ENTRYDN
-#
-if (ldap_delete_s($ld,$ENTRYDN) != LDAP_SUCCESS)
-{
-   ldap_perror($ld,"delete_s");
-   die;
-}
-
-print "Entry Deleted.\n";
-
-# Unbind to LDAP server
-ldap_unbind($ld);
-
-exit;

mozilla/directory/perldap/typemap

@@ -1,70 +0,0 @@
-#############################################################################
-# $Id: typemap,v 1.4 1998-08-13 09:15:00 leif Exp $
-#
-# The contents of this file are subject to the Mozilla Public License
-# Version 1.0 (the "License"); you may not use this file except in
-# compliance with the License. You may obtain a copy of the License at
-# http://www.mozilla.org/MPL/
-#
-# Software distributed under the License is distributed on an "AS IS"
-# basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See the
-# License for the specific language governing rights and limitations
-# under the License.
-#
-# The Original Code is PerLDAP. The Initial Developer of the Original
-# Code is Netscape Communications Corp. and Clayton Donley. Portions
-# created by Netscape are Copyright (C) Netscape Communications
-# Corp., portions created by Clayton Donley are Copyright (C) Clayton
-# Donley. All Rights Reserved.
-#
-# Contributor(s):
-#
-# DESCRIPTION
-#    Typemap to declare XSUB data types.
-#
-#############################################################################
-
-const int		T_IV
-char *			T_PV
-const char *		T_PV
-char **			T_charptrptr
-LDAP *			T_PTR
-LDAPMessage *		T_PTR
-LDAPMessage **		T_PTR
-BerElement *		T_PTR
-LDAPControl *		T_PTR
-LDAPVersion *		T_PTR
-struct berval 		T_berval
-struct berval **	T_bervalptrptr
-FriendlyMap *		T_PTR
-LDAPsortkey **		T_PTR
-LDAPVirtualList *	T_PTR
-LDAPURLDesc *		T_PTR
-LDAPControl **		T_PTR
-LDAPFiltDesc *		T_PTR
-LDAPFiltInfo *		T_PTR
-LDAPMemCache *		T_PTR
-LDAPMemCache **		T_PTR
-struct ldap_thread_fns *	T_PTR
-LDAPMod **		T_PTR
-LDAP_CMP_CALLBACK *	T_PTR
-LDAP_REBINDPROC_CALLBACK *	T_PTR
-struct timeval		T_timeval
-
-#########
-INPUT
-T_timeval
-	$var.tv_sec = atof((char *)SvPV($arg,na));
-	$var.tv_usec = 0
-T_berval
-	$var.bv_val = (char *)SvPV($arg,na);
-	$var.bv_len = na
-T_charptrptr
-        $var = (char **)avref2charptrptr($arg)
-T_bervalptrptr
-	$var = (struct berval **)avref2berptrptr($arg)
-OUTPUT
-T_charptrptr
-	$arg = charptrptr2avref($var);
-T_bervalptrptr
-	$arg = berptrptr2avref((struct berval **)$var);

mozilla/js/src/MANIFEST

@@ -0,0 +1,31 @@
+# This is a list of local files which get copied to the mozilla:dist directory
+#
+
+jsapi.h
+jspubtd.h
+jsarray.h
+jsatom.h
+jsbool.h
+jscntxt.h
+jscompat.h
+jsconfig.h
+jsdate.h
+jsdbgapi.h
+jsemit.h
+jsfun.h
+jsgc.h
+jsinterp.h
+jslock.h
+jsmath.h
+jsnum.h
+jsobj.h
+jsopcode.def
+jsopcode.h
+jsparse.h
+jsprvtd.h
+jspubtd.h
+jsregexp.h
+jsscan.h
+jsscope.h
+jsscript.h
+jsstr.h

mozilla/js/src/Makefile

@@ -0,0 +1,236 @@
+#! gmake
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+
+DEPTH		= ../..
+
+include $(DEPTH)/config/config.mk
+
+ifdef MOZ_OJI
+DIRS = liveconnect
+endif
+
+LIBRARY_NAME	= js
+
+ifeq ($(subst /,_,$(shell uname -s)),OS2)
+ifndef XCFLAGS
+OS2_IMPLIB=1
+LIBRARY	= js$(MOZ_BITS)$(VERSION_NUMBER).$(LIB_SUFFIX)
+DEF_FILE	= jsos2$(VERSION_NUMBER).def
+EXTRA_LIBS	= $(LIBNSPR) $(LIBNSJAVA)
+else
+EXTRA_LIBS	= $(LIBNSPR) $(LIBNSJAVA) $(OBJDIR)/libjs.lib
+endif
+endif
+
+MODULE		= js
+
+CSRCS		= jsapi.c \
+		  jsarray.c \
+		  jsatom.c \
+		  jsbool.c \
+		  jscntxt.c \
+		  jsdate.c \
+		  jsdbgapi.c \
+		  jsemit.c \
+		  jsfun.c \
+		  jsgc.c \
+		  jsinterp.c \
+		  jsmath.c \
+		  jsnum.c \
+		  jsobj.c \
+		  jsopcode.c \
+		  jsparse.c \
+		  jsregexp.c \
+		  jsscan.c \
+		  jsscope.c \
+		  jsscript.c \
+		  jsstr.c \
+		  jslock.c \
+		  jsxdrapi.c \
+		  prmjtime.c \
+		  $(NULL)
+
+EXPORTS		= jsapi.h \
+		  jsarray.h \
+		  jsatom.h \
+		  jsbool.h \
+		  jscntxt.h \
+		  jscompat.h \
+		  jsconfig.h \
+		  jsdate.h \
+		  jsdbgapi.h \
+		  jsemit.h \
+		  jsfun.h \
+		  jsgc.h \
+		  jsinterp.h \
+		  jslock.h \
+		  jsmath.h \
+		  jsnum.h \
+		  jsobj.h \
+		  jsopcode.def \
+		  jsopcode.h \
+		  jsparse.h \
+		  jsprvtd.h \
+		  jspubtd.h \
+		  jsregexp.h \
+		  jsscan.h \
+		  jsscope.h \
+		  jsscript.h \
+		  jsstr.h \
+		  jsxdrapi.h \
+		  $(NULL)
+
+# when using gcc the assembly is inlined in the C-file (see jslock.c)
+ifdef NS_USE_NATIVE
+ASFILES = $(wildcard *_$(OS_ARCH).s)
+endif
+
+JS_SAFE_ARENA = 1
+
+ifdef JS_SAFE_ARENA
+DEFINES += -DJS_USE_SAFE_ARENA
+CSRCS += prarena.c
+endif
+
+include $(DEPTH)/config/rules.mk
+
+ifndef BUILD_OPT
+MOCHAFILE	= 1
+endif
+
+ifdef JSFILE
+DEFINES		+= -DJSFILE
+endif
+
+ifdef JS_THREADSAFE
+DEFINES += -DJS_THREADSAFE
+endif
+
+ifdef JS_NO_THIN_LOCKS
+DEFINES += -DJS_USE_ONLY_NSPR_LOCKS
+endif
+
+ifdef JS_VERSION
+DEFINES += -DJS_VERSION=$(JS_VERSION)
+endif
+
+ifeq ($(CPU_ARCH),sparc)
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus,-DULTRA_SPARC
+ULTRA_OPTIONSCC := -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+ULTRA_OPTIONSCC :=
+endif
+
+ifeq ($(shell uname -m),sun4u)
+ASFLAGS	+= -Wa,$(ULTRA_OPTIONS),-P,-L,-D_ASM,-D__STDC__=0 $(ULTRA_OPTIONSCC)
+else
+ASFLAGS	+= -Wa,-xarch=v8,-P,-L,-D_ASM,-D__STDC__=0
+endif
+
+endif # sparc
+
+INCLUDES	+= -I. 
+
+ifdef NSPR20
+INCLUDES	+= -I$(DIST)/include/nspr20/pr
+else
+INCLUDES	+= -I$(XPDIST)/public/nspr
+endif
+
+ifndef NSBUILDROOT
+JSJAVA_STUBHEADERS = -I$(DEPTH)/sun-java/include/_gen \
+		     -I$(DEPTH)/sun-java/netscape/javascript/_jri \
+		     -I$(DEPTH)/sun-java/netscape/security/_jri
+else
+JSJAVA_STUBHEADERS = -I$(JRI_GEN_DIR) -I$(JDK_GEN_DIR)
+endif
+
+JSJAVA_CFLAGS	= -I$(DEPTH)/sun-java/md-include \
+		  -I$(DEPTH)/sun-java/include \
+		  $(JSJAVA_STUBHEADERS)
+
+# LIBNSPR includes unneeded libmsgc21.a, but abstracts nspr version,
+# etc. nicely.
+LDFLAGS 	= $(LIBNSPR) -lm
+
+ifeq ($(OS_ARCH), OSF1)
+LDFLAGS += -lc_r
+endif
+ifeq ($(OS_ARCH), SunOS)
+LDFLAGS += -lposix4 -ldl -lnsl -lsocket
+endif
+ifeq ($(OS_ARCH), Linux)
+LDFLAGS += -ldl
+endif
+
+# this requires clobbering and recompiling with XCFLAGS=-DJSFILE
+js:
+	$(MAKE) clobber
+	$(MAKE) XCFLAGS=-DJSFILE $(OBJDIR)/js$(BIN_SUFFIX)
+
+.PHONY: js$(BIN_SUFFIX)
+
+ifneq ($(OS_ARCH),OS2)
+$(OBJDIR)/js$(BIN_SUFFIX): $(OBJDIR)/js.o $(LIBRARY)
+	    @$(MAKE_OBJDIR)
+	    $(CC) -o $@ $(OBJDIR)/js.o $(LIBRARY) $(LDFLAGS)
+else
+OS_CFLAGS += -tm-
+$(OBJDIR)/js$(BIN_SUFFIX): $(OBJDIR)/js.o $(LIBRARY)
+	    @$(MAKE_OBJDIR)
+	    $(LINK_EXE) -OUT:$@ $(OBJDIR)/js.o  $(LIBRARIES) $(EXTRA_LIBS)
+endif
+
+# hardwire dependencies on jsopcode.def
+jsopcode.h jsopcode.c: jsopcode.def
+
+# this section was put in the merged by danda into the
+# JAVA_*_MERGE section and normally would have
+# been removed.  However it looks like it shouldn't have
+# been put there in the first place, so we're leaving it
+# here until danda can confirm (we don't have OS/2 machines
+# to build on) - hshaw/sudu
+#
+ifeq ($(OS_ARCH),OS2)
+$(OBJDIR)/js.o: js.c
+	@$(MAKE_OBJDIR)
+	$(CC) -Fo$@ -c $(CFLAGS) $(JSJAVA_CFLAGS) js.c
+endif
+
+
+refdiff:
+	@for f in `cat commfiles`; do                                         \
+	    t=/tmp/refdiff.$$$$;                                              \
+	    trap 'rm -f $$t' 0 1 2 15;                                        \
+	    sed -f prconv.sed ../ref/$$f > $$t;                               \
+	    cmp -s $$t $$f;                                                   \
+	    if test $$? -ne 0; then                                           \
+		echo "=== $$f";                                               \
+		diff $$f $$t;                                                 \
+	    fi;                                                               \
+	    rm -f $$t;                                                        \
+	done
+
+refconv:
+	@for f in `cat commfiles`; do                                         \
+	    echo "=== $$f";                                                   \
+	    sed -f prconv.sed ../ref/$$f > $$f;                               \
+	done
+
+.PHONY: refdiff refconv

mozilla/js/src/Makefile.in

@@ -0,0 +1,241 @@
+#! gmake
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+
+DEPTH		= ../..
+topsrcdir	= @top_srcdir@
+VPATH		= @srcdir@
+srcdir		= @srcdir@
+
+include $(DEPTH)/config/autoconf.mk
+
+ifdef MOZ_OJI
+DIRS = liveconnect
+endif
+
+LIBRARY_NAME	= js
+
+ifeq ($(subst /,_,$(shell uname -s)),OS2)
+ifndef XCFLAGS
+OS2_IMPLIB=1
+LIBRARY	= js$(MOZ_BITS)$(VERSION_NUMBER).$(LIB_SUFFIX)
+DEF_FILE	= jsos2$(VERSION_NUMBER).def
+EXTRA_LIBS	= $(LIBNSPR) $(LIBNSJAVA)
+else
+EXTRA_LIBS	= $(LIBNSPR) $(LIBNSJAVA) $(OBJDIR)/libjs.lib
+endif
+endif
+
+MODULE		= js
+
+CSRCS		= jsapi.c \
+		  jsarray.c \
+		  jsatom.c \
+		  jsbool.c \
+		  jscntxt.c \
+		  jsdate.c \
+		  jsdbgapi.c \
+		  jsemit.c \
+		  jsfun.c \
+		  jsgc.c \
+		  jsinterp.c \
+		  jsmath.c \
+		  jsnum.c \
+		  jsobj.c \
+		  jsopcode.c \
+		  jsparse.c \
+		  jsregexp.c \
+		  jsscan.c \
+		  jsscope.c \
+		  jsscript.c \
+		  jsstr.c \
+		  jslock.c \
+		  jsxdrapi.c \
+		  prmjtime.c \
+		  $(NULL)
+
+EXPORTS		= jsapi.h \
+		  jsarray.h \
+		  jsatom.h \
+		  jsbool.h \
+		  jscntxt.h \
+		  jscompat.h \
+		  jsconfig.h \
+		  jsdate.h \
+		  jsdbgapi.h \
+		  jsemit.h \
+		  jsfun.h \
+		  jsgc.h \
+		  jsinterp.h \
+		  jslock.h \
+		  jsmath.h \
+		  jsnum.h \
+		  jsobj.h \
+		  jsopcode.def \
+		  jsopcode.h \
+		  jsparse.h \
+		  jsprvtd.h \
+		  jspubtd.h \
+		  jsregexp.h \
+		  jsscan.h \
+		  jsscope.h \
+		  jsscript.h \
+		  jsstr.h \
+		  jsxdrapi.h \
+		  $(NULL)
+
+EXPORTS		:= $(addprefix $(srcdir)/, $(EXPORTS))
+
+# when using gcc the assembly is inlined in the C-file (see jslock.c)
+ifdef NS_USE_NATIVE
+ASFILES = $(wildcard $(srcdir)/*_$(OS_ARCH).s)
+endif
+
+JS_SAFE_ARENA = 1
+
+ifdef JS_SAFE_ARENA
+DEFINES += -DJS_USE_SAFE_ARENA
+CSRCS += prarena.c
+endif
+
+include $(topsrcdir)/config/rules.mk
+
+ifndef BUILD_OPT
+MOCHAFILE	= 1
+endif
+
+ifdef JSFILE
+DEFINES		+= -DJSFILE
+endif
+
+ifdef JS_THREADSAFE
+DEFINES += -DJS_THREADSAFE
+endif
+
+ifdef JS_NO_THIN_LOCKS
+DEFINES += -DJS_USE_ONLY_NSPR_LOCKS
+endif
+
+ifdef JS_VERSION
+DEFINES += -DJS_VERSION=$(JS_VERSION)
+endif
+
+ifeq ($(CPU_ARCH),sparc)
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus,-DULTRA_SPARC
+ULTRA_OPTIONSCC := -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+ULTRA_OPTIONSCC :=
+endif
+
+ifeq ($(shell uname -m),sun4u)
+ASFLAGS	+= -Wa,$(ULTRA_OPTIONS),-P,-L,-D_ASM,-D__STDC__=0 $(ULTRA_OPTIONSCC)
+else
+ASFLAGS	+= -Wa,-xarch=v8,-P,-L,-D_ASM,-D__STDC__=0
+endif
+
+endif # sparc
+
+INCLUDES	+= -I$(srcdir)
+
+ifdef NSPR20
+INCLUDES	+= -I$(DIST)/include/nspr20/pr
+else
+INCLUDES	+= -I$(XPDIST)/public/nspr
+endif
+
+ifndef NSBUILDROOT
+JSJAVA_STUBHEADERS = -I$(topsrcdir)/sun-java/include/_gen \
+		     -I$(topsrcdir)/sun-java/netscape/javascript/_jri \
+		     -I$(topsrcdir)/sun-java/netscape/security/_jri
+else
+JSJAVA_STUBHEADERS = -I$(JRI_GEN_DIR) -I$(JDK_GEN_DIR)
+endif
+
+JSJAVA_CFLAGS	= -I$(topsrcdir)/sun-java/md-include \
+		  -I$(topsrcdir)/sun-java/include \
+		  $(JSJAVA_STUBHEADERS)
+
+# LIBNSPR includes unneeded libmsgc21.a, but abstracts nspr version,
+# etc. nicely.
+LDFLAGS 	= $(LIBNSPR) -lm
+
+ifeq ($(OS_ARCH), OSF1)
+LDFLAGS += -lc_r
+endif
+ifeq ($(OS_ARCH), SunOS)
+LDFLAGS += -lposix4 -ldl -lnsl -lsocket
+endif
+ifeq ($(OS_ARCH), Linux)
+LDFLAGS += -ldl
+endif
+
+# this requires clobbering and recompiling with XCFLAGS=-DJSFILE
+js:
+	$(MAKE) clobber
+	$(MAKE) XCFLAGS=-DJSFILE $(OBJDIR)/js$(BIN_SUFFIX)
+
+.PHONY: js$(BIN_SUFFIX)
+
+ifneq ($(OS_ARCH),OS2)
+$(OBJDIR)/js$(BIN_SUFFIX): $(OBJDIR)/js.o $(LIBRARY)
+	    @$(MAKE_OBJDIR)
+	    $(CC) -o $@ $(OBJDIR)/js.o $(LIBRARY) $(LDFLAGS)
+else
+OS_CFLAGS += -tm-
+$(OBJDIR)/js$(BIN_SUFFIX): $(OBJDIR)/js.o $(LIBRARY)
+	    @$(MAKE_OBJDIR)
+	    $(LINK_EXE) -OUT:$@ $(OBJDIR)/js.o  $(LIBRARIES) $(EXTRA_LIBS)
+endif
+
+# hardwire dependencies on jsopcode.def
+jsopcode.h jsopcode.c: jsopcode.def
+
+# this section was put in the merged by danda into the
+# JAVA_*_MERGE section and normally would have
+# been removed.  However it looks like it shouldn't have
+# been put there in the first place, so we're leaving it
+# here until danda can confirm (we don't have OS/2 machines
+# to build on) - hshaw/sudu
+#
+ifeq ($(OS_ARCH),OS2)
+$(OBJDIR)/js.o: js.c
+	@$(MAKE_OBJDIR)
+	$(CC) -Fo$@ -c $(CFLAGS) $(JSJAVA_CFLAGS) js.c
+endif
+
+
+refdiff:
+	@for f in `cat commfiles`; do                                         \
+	    t=/tmp/refdiff.$$$$;                                              \
+	    trap 'rm -f $$t' 0 1 2 15;                                        \
+	    sed -f prconv.sed ../ref/$$f > $$t;                               \
+	    cmp -s $$t $$f;                                                   \
+	    if test $$? -ne 0; then                                           \
+		echo "=== $$f";                                               \
+		diff $$f $$t;                                                 \
+	    fi;                                                               \
+	    rm -f $$t;                                                        \
+	done
+
+refconv:
+	@for f in `cat commfiles`; do                                         \
+	    echo "=== $$f";                                                   \
+	    sed -f prconv.sed ../ref/$$f > $$f;                               \
+	done
+
+.PHONY: refdiff refconv

mozilla/js/src/Makefile.ref

@@ -0,0 +1,316 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+
+#
+# JSRef GNUmake makefile.
+#
+
+# Set os+release dependent make variables
+OS_ARCH         := $(subst /,_,$(shell uname -s))
+
+# Attempt to differentiate between SunOS 5.4 and x86 5.4
+OS_CPUARCH      := $(shell uname -m)
+ifeq ($(OS_CPUARCH),i86pc)
+OS_RELEASE      := $(shell uname -r)_$(OS_CPUARCH)
+else
+ifeq ($(OS_ARCH),AIX)
+OS_RELEASE      := $(shell uname -v).$(shell uname -r)
+else
+OS_RELEASE      := $(shell uname -r)
+endif
+endif
+
+# Virtually all Linux versions are identical.
+# Any distinctions are handled in linux.h
+ifeq ($(OS_ARCH),Linux)
+OS_CONFIG      := Linux_All
+else
+ifeq ($(OS_ARCH),dgux)
+OS_CONFIG      := dgux
+else
+OS_CONFIG       := $(OS_ARCH)$(OS_OBJTYPE)$(OS_RELEASE)
+endif
+endif
+
+ASFLAGS         =
+DEFINES         =
+
+#NS_USE_NATIVE = 1
+
+include config/$(OS_CONFIG).mk
+
+ifdef BUILD_OPT
+OPTIMIZER  += -O
+DEFINES    += -UDEBUG -DNDEBUG -UDEBUG_$(shell whoami)
+OBJDIR_TAG = _OPT
+else
+ifdef USE_MSVC
+OPTIMIZER  = -Zi
+else
+OPTIMIZER  = -g
+endif
+DEFINES    += -DDEBUG -DDEBUG_$(shell whoami)
+OBJDIR_TAG = _DBG
+endif
+
+#DEFINES += -DJS_THREADSAFE
+
+ifdef JS_NO_THIN_LOCKS
+DEFINES += -DJS_USE_ONLY_NSPR_LOCKS
+endif
+
+# Name of the binary code directories
+OBJDIR          = $(OS_CONFIG)$(OBJDIR_TAG).OBJ
+VPATH           = $(OBJDIR)
+
+# Automatic make dependencies file
+DEPENDENCIES    = $(OBJDIR)/.md
+
+define MAKE_OBJDIR
+if test ! -d $(@D); then rm -rf $(@D); mkdir $(@D); fi
+endef
+
+# Look in OBJDIR to find prcpucfg.h
+INCLUDES   = -I$(OBJDIR)
+
+#
+# XCFLAGS may be set in the environment or on the gmake command line
+#
+CFLAGS          = $(OPTIMIZER) $(OS_CFLAGS) $(DEFINES) $(INCLUDES) \
+                  -DJSFILE $(XCFLAGS)
+LDFLAGS		= -lm $(XLDFLAGS)
+
+#
+# Ask perl what flags it was built with, so we can build js with similar flags
+# and link properly.  Viva gmake.
+#
+ifdef PERLCONNECT
+DEFINES += -DPERLCONNECT
+
+PERLCFLAGS := $(shell perl -MExtUtils::Embed -e ccopts)
+PERLLDFLAGS := $(shell perl -MExtUtils::Embed -e ldopts)
+
+CFLAGS += $(PERLCFLAGS)
+LDFLAGS += $(PERLLDFLAGS)
+endif
+
+# For purify
+PURE_CFLAGS     = -DXP_UNIX $(OPTIMIZER) $(PURE_OS_CFLAGS) $(DEFINES) \
+                  $(INCLUDES) $(XCFLAGS)
+
+#
+# JS file lists
+#
+JS_HFILES =		\
+	jsarray.h	\
+	jsatom.h	\
+	jsbool.h	\
+	jsconfig.h	\
+	jscntxt.h	\
+	jsdate.h	\
+	jsemit.h	\
+	jsexn.h		\
+	jsfun.h		\
+	jsgc.h		\
+	jsinterp.h	\
+	jslock.h	\
+	jsmath.h	\
+	jsnum.h		\
+	jsobj.h		\
+	jsopcode.h      \
+	jsparse.h	\
+	jsarena.h	\
+	jsclist.h	\
+	jsdtoa.h	\
+	jshash.h	\
+	jslong.h	\
+	jsmacos.h	\
+	jsosdep.h	\
+	jspcos.h	\
+	jsprintf.h	\
+	jstime.h	\
+	jstypes.h	\
+	jsprvtd.h	\
+	jspubtd.h	\
+	jsregexp.h	\
+	jsscan.h	\
+	jsscope.h	\
+	jsscript.h	\
+	jsstr.h		\
+	jsxdrapi.h	\
+	$(NULL)
+
+API_HFILES =		\
+	jsapi.h		\
+	jsdbgapi.h	\
+	$(NULL)
+
+HFILES = $(JS_HFILES) $(API_HFILES)
+
+JS_CFILES =		\
+	jsapi.c		\
+	jsarray.c	\
+	jsatom.c	\
+	jsbool.c	\
+	jscntxt.c	\
+	jsdate.c	\
+	jsdbgapi.c	\
+	jsemit.c	\
+	jsexn.c		\
+	jsfun.c		\
+	jsgc.c		\
+	jsinterp.c	\
+	jslock.c	\
+	jsmath.c	\
+	jsnum.c		\
+	jsobj.c		\
+	jsopcode.c      \
+	jsparse.c	\
+	jsarena.c	\
+	jsdtoa.c	\
+	jshash.c	\
+	jslog2.c	\
+	jslong.c	\
+	jsprf.c		\
+	jsregexp.c	\
+	jsscan.c	\
+	jsscope.c	\
+	jsscript.c	\
+	jsstr.c		\
+	jsutil.c        \
+	jsxdrapi.c	\
+	prmjtime.c	\
+	$(NULL)
+
+ifdef PERLCONNECT
+JS_CFILES += jsperl.c
+endif
+
+LIB_CFILES  = $(JS_CFILES)
+LIB_ASFILES := $(wildcard *_$(OS_ARCH).s)
+PROG_CFILES = js.c
+
+ifdef USE_MSVC
+LIB_OBJS  = $(addprefix $(OBJDIR)/, $(LIB_CFILES:.c=.obj))
+PROG_OBJS = $(addprefix $(OBJDIR)/, $(PROG_CFILES:.c=.obj))
+else
+LIB_OBJS  = $(addprefix $(OBJDIR)/, $(LIB_CFILES:.c=.o))
+LIB_OBJS  += $(addprefix $(OBJDIR)/, $(LIB_ASFILES:.s=.o))
+PROG_OBJS = $(addprefix $(OBJDIR)/, $(PROG_CFILES:.c=.o))
+endif
+
+CFILES = $(LIB_CFILES) $(PROG_CFILES)
+OBJS   = $(LIB_OBJS) $(PROG_OBJS)
+
+ifdef USE_MSVC
+LIBRARY = $(OBJDIR)/js32.dll
+PROGRAM = $(OBJDIR)/js
+else
+LIBRARY = $(OBJDIR)/libjs.a
+PROGRAM = $(OBJDIR)/js
+endif
+
+ifdef USE_MSVC
+TARGETS = $(LIBRARY)   # $(PROGRAM) not supported for MSVC yet
+else
+TARGETS = $(LIBRARY) $(PROGRAM)
+endif
+
+all: $(TARGETS)
+
+clean:
+	rm -rf $(OBJS)
+
+clobber:
+	rm -rf $(OBJS) $(TARGETS) $(DEPENDENCIES)
+
+depend:
+	gcc -MM $(CFLAGS) $(JS_CFILES)
+
+$(OBJDIR)/%: %.c
+	@$(MAKE_OBJDIR)
+	$(CC) -o $@ $(CFLAGS) $*.c $(LDFLAGS)
+
+$(OBJDIR)/%.o: %.c
+	@$(MAKE_OBJDIR)
+	$(CC) -o $@ -c $(CFLAGS) $*.c
+
+$(OBJDIR)/%.o: %.s
+	@$(MAKE_OBJDIR)
+	$(AS) -o $@ $(ASFLAGS) $*.s
+
+# windows only
+$(OBJDIR)/%.obj: %.c
+	@$(MAKE_OBJDIR)
+	$(CC) -Fo$(OBJDIR)/ -c $(CFLAGS) $*.c
+
+ifeq ($(OS_ARCH),OS2)
+$(LIBRARY): $(LIB_OBJS)
+	$(AR) $@ $? $(AR_OS2_SUFFIX)
+	$(RANLIB) $@
+else
+ifdef USE_MSVC
+$(LIBRARY): $(LIB_OBJS)
+	link.exe $(LIB_LINK_FLAGS) /base:0x61000000 \
+	    /out:"$@" /pdb:"$(OBJDIR)/js32.pdb" /implib:"$(OBJDIR)/js32.lib" $?
+else
+$(LIBRARY): $(LIB_OBJS)
+	$(AR) rv $@ $?
+	$(RANLIB) $@
+endif
+endif
+
+#NSPR_LIBRARY = ../../dist/$(OBJDIR)/lib/libnspr21.so
+NSPR_LIBRARY =
+
+$(PROGRAM): $(PROG_OBJS) $(LIBRARY)
+	$(CC) -o $@ $(CFLAGS) $(PROG_OBJS) $(LIBRARY) $(NSPR_LIBRARY) $(LDFLAGS)
+
+$(PROGRAM).pure: $(PROG_OBJS) $(LIBRARY)
+	purify $(PUREFLAGS) \
+	    $(CC) -o $@ $(PURE_OS_CFLAGS) $(PROG_OBJS) $(LIBRARY) $(LDFLAGS)
+
+$(HFILES) $(CFILES): $(OBJDIR)/jscpucfg.h
+
+ifdef PREBUILT_CPUCFG
+$(OBJDIR)/jscpucfg.h: jscpucfg.h
+	cp jscpucfg.h $(OBJDIR)
+else
+$(OBJDIR)/jscpucfg.h: $(OBJDIR)/jscpucfg
+	rm -f $@
+	$(OBJDIR)/jscpucfg > $@
+
+$(OBJDIR)/jscpucfg: $(OBJDIR)/jscpucfg.o
+	$(CC) -o $@ $(OBJDIR)/jscpucfg.o
+endif
+
+#
+# Hardwire dependencies on jsopcode.tbl
+#
+jsopcode.h jsopcode.c: jsopcode.tbl
+
+-include $(DEPENDENCIES)
+
+TARNAME = jsref.tar
+TARFILES = files `cat files`
+
+tar:
+	tar cvf $(TARNAME) $(TARFILES)
+	gzip $(TARNAME)
+
+SUFFIXES: .i
+%.i: %.c
+	$(CC) -C -E $(CFLAGS) $< > $*.i

mozilla/js/src/README

@@ -0,0 +1,17 @@
+The js/ref directory contains standalone ANSI-C source for the Netscape
+JavaScript Reference implementation, JSRef, which was licensed to over 180
+companies as part of Netscape ONE, starting in fall 1996.  Now, JSRef is
+available under NPL from http://www.mozilla.org.
+
+The js/src directory contains source files listed in the file "commfiles",
+that are derived via prconv.sed from counterparts in the js/ref directory.
+It also contains files such as jscompat.h that are not needed in js/ref.
+The Makefile in js/src has refconv and refdiff targets to help keep js/ref
+and js/src in synch.
+
+If you think you need to change a file listed in commfiles here, please
+make the change in js/ref first and then use prconv.sed or gmake refconv to
+get it into js/src.  If you have trouble, please let us know by mailing the
+JS owner and peers listed in http://www.mozilla.org/owners.html#JavaScript.
+
+Brendan Eich (brendan@mozilla.org), 15-May-98

mozilla/js/src/actra.mk

@@ -0,0 +1,100 @@
+#! gmake
+
+#
+# Since everyone seems to need to have their own build configuration
+#   system these days, this is yet another makefile to build JavaScript.
+#   This makefile conforms to the NSPR20 build rules.  If you have built
+#   NSPR20 this will build JS and stick the lib and bin files over in 
+#   the dist area created by NSPR (which is different from the dist 
+#   expected by the client and also the dist expected by LiveWire, but
+#   don't get me started).
+#
+# I don't currently know enough about what sort of JS-engine the Actra
+#   projects are going to expect so I don't know if we need to add
+#   to CFLAGS for -DJS_THREADSAFE or -DJSFILE 
+#
+
+MOD_DEPTH = ../../nspr20
+
+include $(MOD_DEPTH)/config/config.mk
+
+INCLUDES = -I$(DIST)/include
+CFLAGS += -DNSPR20
+
+CSRCS = prmjtime.c \
+		  jsapi.c \
+		  jsarray.c \
+		  jsatom.c \
+		  jsbool.c \
+		  jscntxt.c \
+		  jsdate.c \
+		  jsdbgapi.c \
+		  jsemit.c \
+		  jsfun.c \
+		  jsgc.c \
+		  jsinterp.c \
+		  jsmath.c \
+		  jsnum.c \
+		  jsobj.c \
+		  jsopcode.c \
+		  jsparse.c \
+		  jsregexp.c \
+		  jsscan.c \
+		  jsscope.c \
+		  jsscript.c \
+		  jsstr.c \
+		  jslock.c \
+		  $(NULL)
+
+HEADERS = jsapi.h \
+		  jsarray.h \
+		  jsatom.h \
+		  jsbool.h \
+		  jscntxt.h \
+		  jscompat.h \
+		  jsconfig.h \
+		  jsdate.h \
+		  jsdbgapi.h \
+		  jsemit.h \
+		  jsfun.h \
+		  jsgc.h \
+		  jsinterp.h \
+		  jslock.h \
+		  jsmath.h \
+		  jsnum.h \
+		  jsobj.h \
+		  jsopcode.def \
+		  jsopcode.h \
+		  jsparse.h \
+		  jsprvtd.h \
+		  jspubtd.h \
+		  jsregexp.h \
+		  jsscan.h \
+		  jsscope.h \
+		  jsscript.h \
+		  jsstr.h \
+		  $(NULL)
+
+ifeq ($(OS_ARCH), WINNT)
+EXTRA_LIBS += $(DIST)/lib/libnspr$(MOD_VERSION).lib
+EXTRA_LIBS += $(DIST)/lib/libplds$(MOD_VERSION).lib
+else
+EXTRA_LIBS += -L$(DIST)/lib -lnspr$(MOD_VERSION) -lnplds$(MOD_VERSION)
+endif
+
+LIBRARY_NAME	= js
+LIBRARY_VERSION	= $(MOD_VERSION)
+
+RELEASE_HEADERS = $(HEADERS)
+RELEASE_HEADERS_DEST = $(RELEASE_INCLUDE_DIR)
+RELEASE_LIBS	= $(TARGETS)
+
+include $(MOD_DEPTH)/config/rules.mk
+
+export:: $(TARGETS)
+	$(INSTALL) -m 444 $(HEADERS) $(MOD_DEPTH)/../dist/public/$(LIBRARY_NAME)
+	$(INSTALL) -m 444 $(TARGETS) $(DIST)/lib
+	$(INSTALL) -m 444 $(SHARED_LIBRARY) $(DIST)/bin
+
+install:: export
+

mozilla/js/src/commfiles

@@ -0,0 +1,51 @@
+js.c
+jsapi.c
+jsapi.h
+jsarray.c
+jsarray.h
+jsatom.c
+jsatom.h
+jsbool.c
+jsbool.h
+jscntxt.c
+jscntxt.h
+jsconfig.h
+jsdate.c
+jsdate.h
+jsdbgapi.c
+jsdbgapi.h
+jsemit.c
+jsemit.h
+jsfun.c
+jsfun.h
+jsgc.c
+jsgc.h
+jsinterp.c
+jsinterp.h
+jslock.h
+jslock.c
+jsmath.c
+jsmath.h
+jsnum.c
+jsnum.h
+jsobj.c
+jsobj.h
+jsopcode.c
+jsopcode.def
+jsopcode.h
+jsparse.c
+jsparse.h
+jsprvtd.h
+jspubtd.h
+jsregexp.c
+jsregexp.h
+jsscan.c
+jsscan.h
+jsscope.c
+jsscope.h
+jsscript.c
+jsscript.h
+jsstr.c
+jsstr.h
+jsxdrapi.h
+jsxdrapi.c

mozilla/js/src/config/AIX4.1.mk

@@ -0,0 +1,37 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for AIX
+#
+
+CC = xlC_r
+CCC = xlC_r
+
+RANLIB = ranlib
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+ARCH := aix
+CPU_ARCH = rs6000
+GFX_ARCH = x
+INLINES = js_compare_and_swap:js_fast_lock1:js_fast_unlock1:js_lock_get_slot:js_lock_set_slot:js_lock_scope1
+
+OS_CFLAGS = -qarch=com -qinline+$(INLINES) -DXP_UNIX -DAIX -DAIXV3 -DSYSV
+OS_LIBS = -lbsd -lsvld -lm
+#-lpthreads -lc_r
+

mozilla/js/src/config/AIX4.2.mk

@@ -0,0 +1,37 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for AIX
+#
+
+CC = xlC_r
+CCC = xlC_r
+
+RANLIB = ranlib
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+ARCH := aix
+CPU_ARCH = rs6000
+GFX_ARCH = x
+INLINES = js_compare_and_swap:js_fast_lock1:js_fast_unlock1:js_lock_get_slot:js_lock_set_slot:js_lock_scope1
+
+OS_CFLAGS = -qarch=com -qinline+$(INLINES) -DXP_UNIX -DAIX -DAIXV3 -DSYSV
+OS_LIBS = -lbsd -lsvld -lm
+#-lpthreads -lc_r
+

mozilla/js/src/config/HP-UXB.10.10.mk

@@ -0,0 +1,48 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for HPUX
+#
+
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+
+RANLIB = echo
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = hppa
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DHPUX -DSYSV -D_SVID_GETTOD
+OS_LIBS = -ldld
+
+ifeq ($(OS_RELEASE),B.10)
+PLATFORM_FLAGS		+= -DHPUX10 -Dhpux10
+PORT_FLAGS		+= -DRW_NO_OVERLOAD_SCHAR -DHAVE_MODEL_H
+ifeq ($(OS_VERSION),.10)
+PLATFORM_FLAGS		+= -DHPUX10_10
+endif
+ifeq ($(OS_VERSION),.20)
+PLATFORM_FLAGS		+= -DHPUX10_20
+endif
+ifeq ($(OS_VERSION),.30)
+PLATFORM_FLAGS		+= -DHPUX10_30
+endif
+endif

mozilla/js/src/config/HP-UXB.11.00.mk

@@ -0,0 +1,48 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for HPUX
+#
+
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+
+RANLIB = echo
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = hppa
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DHPUX -DSYSV -D_SVID_GETTOD
+OS_LIBS = -ldld
+
+ifeq ($(OS_RELEASE),B.10)
+PLATFORM_FLAGS		+= -DHPUX10 -Dhpux10
+PORT_FLAGS		+= -DRW_NO_OVERLOAD_SCHAR -DHAVE_MODEL_H
+ifeq ($(OS_VERSION),.10)
+PLATFORM_FLAGS		+= -DHPUX10_10
+endif
+ifeq ($(OS_VERSION),.20)
+PLATFORM_FLAGS		+= -DHPUX10_20
+endif
+ifeq ($(OS_VERSION),.30)
+PLATFORM_FLAGS		+= -DHPUX10_30
+endif
+endif

mozilla/js/src/config/IRIX.mk

@@ -0,0 +1,58 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for IRIX
+#
+
+CPU_ARCH = mips
+GFX_ARCH = x
+
+RANLIB = /bin/true
+
+#NS_USE_GCC = 1
+
+ifdef NS_USE_GCC
+CC = gcc
+CCC = g++
+AS = $(CC) -x assembler-with-cpp
+ODD_CFLAGS = -Wall -Wno-format
+ifdef BUILD_OPT
+OPTIMIZER = -O6
+endif
+else
+ifeq ($(OS_RELEASE),6.2)
+CC	= cc -32 -DIRIX6_2
+endif
+ifeq ($(OS_RELEASE),6.3)
+CC	= cc -32 -DIRIX6_3
+endif
+CCC = CC
+ODD_CFLAGS = -fullwarn -xansi
+ifdef BUILD_OPT
+OPTIMIZER += -Olimit 4000
+endif
+endif
+
+# For purify
+HAVE_PURIFY = 1
+PURE_OS_CFLAGS = $(ODD_CFLAGS) -DXP_UNIX -DSVR4 -DSW_THREADS -DIRIX
+
+OS_CFLAGS = $(PURE_OS_CFLAGS) -MDupdate $(DEPENDENCIES)
+
+BSDECHO	= echo
+MKSHLIB = $(LD) -shared

mozilla/js/src/config/IRIX5.3.mk

@@ -0,0 +1,22 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for IRIX5.3
+#
+
+include config/IRIX.mk

mozilla/js/src/config/IRIX6.1.mk

@@ -0,0 +1,22 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for IRIX6.3
+#
+
+include config/IRIX.mk

mozilla/js/src/config/IRIX6.2.mk

@@ -0,0 +1,22 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for IRIX6.2
+#
+
+include config/IRIX.mk

mozilla/js/src/config/IRIX6.3.mk

@@ -0,0 +1,22 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for IRIX6.3
+#
+
+include config/IRIX.mk

mozilla/js/src/config/Linux_All.mk

@@ -0,0 +1,47 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config for all versions of Linux
+#
+
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+
+RANLIB = echo
+
+#.c.o:
+#      $(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = $(shell uname -m)
+ifeq (86,$(findstring 86,$(CPU_ARCH)))
+CPU_ARCH = x86
+endif
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -D_BSD_SOURCE -DPOSIX_SOURCE -DLINUX
+OS_LIBS = -lm -lc
+
+ASFLAGS += -x assembler-with-cpp
+
+ifeq ($(CPU_ARCH),alpha)
+
+# Ask the C compiler on alpha linux to let us work with denormalized
+# double values, which are required by the ECMA spec.
+
+OS_CFLAGS += -mieee
+endif

mozilla/js/src/config/SunOS4.1.4.mk

@@ -0,0 +1,79 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for SunOS4.1
+#
+
+CC = gcc
+CCC = g++
+RANLIB = ranlib
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = sparc
+GFX_ARCH = x
+
+# A pile of -D's to build xfe on sunos
+MOZ_CFLAGS = -DSTRINGS_ALIGNED -DNO_REGEX -DNO_ISDIR -DUSE_RE_COMP \
+	     -DNO_REGCOMP -DUSE_GETWD -DNO_MEMMOVE -DNO_ALLOCA \
+	     -DBOGUS_MB_MAX -DNO_CONST
+
+# Purify doesn't like -MDupdate
+NOMD_OS_CFLAGS = -DXP_UNIX -Wall -Wno-format -DSW_THREADS -DSUNOS4 -DNEED_SYSCALL \
+		 $(MOZ_CFLAGS)
+
+OS_CFLAGS = $(NOMD_OS_CFLAGS) -MDupdate $(DEPENDENCIES)
+OS_LIBS = -ldl -lm
+
+MKSHLIB = $(LD) -L$(MOTIF)/lib
+
+HAVE_PURIFY = 1
+MOTIF = /home/motif/usr
+MOTIFLIB = -L$(MOTIF)/lib -lXm
+INCLUDES += -I/usr/X11R5/include -I$(MOTIF)/include
+
+NOSUCHFILE = /solaris-rm-f-sucks
+
+LOCALE_MAP = $(DEPTH)/cmd/xfe/intl/sunos.lm
+
+EN_LOCALE = en_US
+DE_LOCALE = de
+FR_LOCALE = fr
+JP_LOCALE = ja
+SJIS_LOCALE = ja_JP.SJIS
+KR_LOCALE = ko
+CN_LOCALE = zh
+TW_LOCALE = zh_TW
+I2_LOCALE = i2
+IT_LOCALE = it
+SV_LOCALE = sv
+ES_LOCALE = es
+NL_LOCALE = nl
+PT_LOCALE = pt
+
+LOC_LIB_DIR = /usr/openwin/lib/locale
+
+BSDECHO	= echo
+
+#
+# These defines are for building unix plugins
+#
+BUILD_UNIX_PLUGINS = 1
+DSO_LDOPTS =
+DSO_LDFLAGS =

mozilla/js/src/config/SunOS5.3.mk

@@ -0,0 +1,66 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for SunOS5.3
+#
+
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+
+#CC = /opt/SUNWspro/SC3.0.1/bin/cc
+RANLIB = echo
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = sparc
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -DSOLARIS
+OS_LIBS = -lsocket -lnsl -ldl
+
+ASFLAGS	        += -P -L -K PIC -D_ASM -D__STDC__=0
+
+HAVE_PURIFY = 1
+
+NOSUCHFILE = /solaris-rm-f-sucks
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus
+ULTRA_OPTIONSD := -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+ULTRA_OPTIONSD :=
+endif
+
+ifeq ($(OS_CPUARCH),sun4u)
+DEFINES 	+= $(ULTRA_OPTIONSD)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,$(ULTRA_OPTIONS),$(ULTRA_OPTIONSD)
+else
+ASFLAGS         += $(ULTRA_OPTIONS) $(ULTRA_OPTIONSD)
+endif
+endif
+
+ifeq ($(OS_CPUARCH),sun4m)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,-xarch=v8
+else
+ASFLAGS         += -xarch=v8
+endif
+endif

mozilla/js/src/config/SunOS5.4.mk

@@ -0,0 +1,67 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for SunOS5.4
+#
+
+ifdef NS_USE_NATIVE
+CC = cc
+CCC = CC
+else
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+endif
+
+RANLIB = echo
+
+CPU_ARCH = sparc
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -D__svr4 -DSOLARIS
+OS_LIBS = -lsocket -lnsl -ldl
+
+ASFLAGS	        += -P -L -K PIC -D_ASM -D__STDC__=0
+
+HAVE_PURIFY = 1
+
+NOSUCHFILE = /solaris-rm-f-sucks
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus
+ULTRA_OPTIONSD := -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+ULTRA_OPTIONSD :=
+endif
+
+ifeq ($(OS_CPUARCH),sun4u)
+DEFINES 	+= $(ULTRA_OPTIONSD)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,$(ULTRA_OPTIONS),$(ULTRA_OPTIONSD)
+else
+ASFLAGS         += $(ULTRA_OPTIONS) $(ULTRA_OPTIONSD)
+endif
+endif
+
+ifeq ($(OS_CPUARCH),sun4m)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,-xarch=v8
+else
+ASFLAGS         += -xarch=v8
+endif
+endif

mozilla/js/src/config/SunOS5.5.1.mk

@@ -0,0 +1,71 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for SunOS5.5
+#
+
+AS = as
+ifndef NS_USE_NATIVE
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall
+else
+CC = cc
+CCC = CC
+endif
+
+RANLIB = echo
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = sparc
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -DSOLARIS -D_SVID_GETTOD
+OS_LIBS = -lsocket -lnsl -ldl
+
+ASFLAGS	        += -P -L -K PIC -D_ASM -D__STDC__=0
+
+HAVE_PURIFY = 1
+
+NOSUCHFILE = /solaris-rm-f-sucks
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus
+ULTRA_OPTIONSD := -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+ULTRA_OPTIONSD :=
+endif
+
+ifeq ($(OS_CPUARCH),sun4u)
+DEFINES 	+= $(ULTRA_OPTIONSD)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,$(ULTRA_OPTIONS),$(ULTRA_OPTIONSD)
+else
+ASFLAGS         += $(ULTRA_OPTIONS) $(ULTRA_OPTIONSD)
+endif
+endif
+
+ifeq ($(OS_CPUARCH),sun4m)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,-xarch=v8
+else
+ASFLAGS         += -xarch=v8
+endif
+endif

mozilla/js/src/config/SunOS5.5.mk

@@ -0,0 +1,62 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for SunOS5.5
+#
+
+AS = as
+CC = gcc -Wall -Wno-format
+CCC = g++ -Wall -Wno-format
+
+#CC = /opt/SUNWspro/SC3.0.1/bin/cc
+RANLIB = echo
+
+#.c.o:
+#	$(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = sparc
+GFX_ARCH = x
+
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -DSOLARIS -D_SVID_GETTOD
+OS_LIBS = -lsocket -lnsl -ldl
+
+ASFLAGS	        += -P -L -K PIC -D_ASM -D__STDC__=0
+
+HAVE_PURIFY = 1
+
+NOSUCHFILE = /solaris-rm-f-sucks
+
+ifndef JS_NO_ULTRA
+ULTRA_OPTIONS := -xarch=v8plus -DULTRA_SPARC
+else
+ULTRA_OPTIONS := -xarch=v8
+endif
+
+ifeq ($(OS_CPUARCH),sun4u)
+ASFLAGS         += $(ULTRA_OPTIONS)
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,$(ULTRA_OPTIONS)
+endif
+else
+ifeq ($(OS_CPUARCH),sun4m)
+ASFLAGS         += -xarch=v8
+ifeq ($(findstring gcc,$(CC)),gcc)
+DEFINES         += -Wa,-xarch=v8
+endif
+endif
+endif

mozilla/js/src/config/WINNT4.0.mk

@@ -0,0 +1,46 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+
+#
+# Config for Windows NT using MS Visual C++ (version?)
+#
+
+CC = cl
+
+RANLIB = echo
+
+#.c.o:
+#      $(CC) -c -MD $*.d $(CFLAGS) $<
+
+CPU_ARCH = x86 # XXX fixme
+GFX_ARCH = win32
+
+OS_CFLAGS = -DXP_PC -DWIN32 -D_WINDOWS -D_WIN32
+OS_LIBS = -lm -lc
+
+PREBUILT_CPUCFG = 1
+USE_MSVC = 1
+
+LIB_LINK_FLAGS=kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib\
+ advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib oldnames.lib /nologo\
+ /subsystem:windows /dll /incremental:yes /debug\
+ /machine:I386
+
+CAFEDIR = t:/cafe
+JCLASSPATH = $(CAFEDIR)/Java/Lib/classes.zip
+JAVAC = $(CAFEDIR)/Bin/sj.exe
+JAVAH = $(CAFEDIR)/Java/Bin/javah.exe
+JCFLAGS = -I$(CAFEDIR)/Java/Include -I$(CAFEDIR)/Java/Include/win32

mozilla/js/src/config/dgux.mk

@@ -0,0 +1,42 @@
+#
+# The contents of this file are subject to the Netscape Public License
+# Version 1.0 (the "NPL"); you may not use this file except in
+# compliance with the NPL.  You may obtain a copy of the NPL at
+# http://www.mozilla.org/NPL/
+#
+# Software distributed under the NPL is distributed on an "AS IS" basis,
+# WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+# for the specific language governing rights and limitations under the
+# NPL.
+#
+# The Initial Developer of this code under the NPL is Netscape
+# Communications Corporation.  Portions created by Netscape are
+# Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+# Reserved.
+#
+
+#
+# Config stuff for Data General DG/UX
+#
+
+#
+#  Initial DG/UX port by Marc Fraioli (fraioli@dg-rtp.dg.com)
+#
+
+AS = as
+CC = gcc 
+CCC = g++ 
+
+RANLIB = echo
+
+#
+#  _DGUX_SOURCE is needed to turn on a lot of stuff in the headers if 
+#      you're not using DG's compiler.  It shouldn't hurt if you are.
+#
+#  _POSIX4A_DRAFT10_SOURCE is needed to pick up localtime_r, used in
+#      prtime.c
+#
+OS_CFLAGS = -DXP_UNIX -DSVR4 -DSYSV -DDGUX -D_DGUX_SOURCE -D_POSIX4A_DRAFT10_SOURCE
+OS_LIBS = -lsocket -lnsl 
+
+NOSUCHFILE = /no-such-file

mozilla/js/src/export.mac

@@ -0,0 +1,30 @@
+# This is a list of local files which get copied to the mozilla:dist directory
+#
+
+jsapi.h
+jsarray.h
+jsatom.h
+jsbool.h
+jscntxt.h
+jscompat.h
+jsconfig.h
+jsdate.h
+jsdbgapi.h
+jsemit.h
+jsfun.h
+jsgc.h
+jsinterp.h
+jslock.h
+jsmath.h
+jsnum.h
+jsobj.h
+jsopcode.def
+jsopcode.h
+jsparse.h
+jsprvtd.h
+jspubtd.h
+jsregexp.h
+jsscan.h
+jsscope.h
+jsscript.h
+jsstr.h

mozilla/js/src/js.dsp

@@ -0,0 +1,184 @@
+# Microsoft Developer Studio Project File - Name="jsshell" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=jsshell - Win32 Release
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "js.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "js.mak" CFG="jsshell - Win32 Release"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "jsshell - Win32 Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "jsshell - Win32 Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "jsshell - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir ".\jsshell_"
+# PROP BASE Intermediate_Dir ".\jsshell_"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir ".\Release"
+# PROP Intermediate_Dir ".\Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /YX /c
+# ADD CPP /nologo /MD /W3 /GX /O2 /I "mininspr" /D "NDEBUG" /D "_CONSOLE" /D "_WIN32" /D "WIN32" /D "XP_PC" /D "_WINDOWS" /D "JSFILE" /D "MINI_NSPR" /YX /FD /c
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /out:".\Release\jsshell.exe"
+
+!ELSEIF  "$(CFG)" == "jsshell - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir ".\jsshell0"
+# PROP BASE Intermediate_Dir ".\jsshell0"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir ".\Debug"
+# PROP Intermediate_Dir ".\Debug"
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /YX /c
+# ADD CPP /nologo /MDd /W3 /Gm /GX /Zi /Od /I "mininspr" /D "_DEBUG" /D "DEBUG" /D "_CONSOLE" /D "_WIN32" /D "WIN32" /D "XP_PC" /D "_WINDOWS" /D "JSFILE" /D "MINI_NSPR" /YX /FD /c
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /out:".\Debug\jsshell.exe"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "jsshell - Win32 Release"
+# Name "jsshell - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90"
+# Begin Source File
+
+SOURCE=.\js.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl;fi;fd"
+# Begin Source File
+
+SOURCE=.\jsapi.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsatom.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jscntxt.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsdbgapi.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsemit.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsfun.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsgc.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsinterp.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jslock.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsobj.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsopcode.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsparse.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsprvtd.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jspubtd.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsregexp.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscan.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscope.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscript.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsstddef.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsstr.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\prarena.h
+# End Source File
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;cnt;rtf;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project

mozilla/js/src/js.dsw

@@ -0,0 +1,56 @@
+Microsoft Developer Studio Workspace File, Format Version 5.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "js32"=.\js32.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "jsshell"=.\js.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name js32
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "miniNSPR"=.\miniNSPR.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+

mozilla/js/src/js.msg

@@ -0,0 +1,194 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+	This is the JavaScript error message file.
+
+	The format for each JS error message is:
+
+MSG_DEF(<SYMBOLIC_NAME>, <ERROR_NUMBER>, <ARGUMENT_COUNT>, <EXCEPTION_NAME>,
+	<FORMAT_STRING>)
+
+	where ;
+	<SYMBOLIC_NAME> is a legal C identifer that will be used in the
+	JS engine source.
+
+	<ERROR_NUMBER> is an unique integral value identifying this error.
+
+	<ARGUMENT_COUNT> is an integer literal specifying the total number of
+	replaceable arguments in the following format string.
+
+	<EXCEPTION_NAME> is an exception index from the enum in jsexn.c;
+	JSEXN_NONE for none.  The given exception index will be raised by the
+	engine when the corresponding error occurs.
+
+	<FORMAT_STRING> is a string literal, optionally containing sequences
+	{X} where X  is an integer representing the argument number that will
+	be replaced with a string value when the error is reported.
+
+	e.g.
+
+	MSG_DEF(JSMSG_NOT_A_SUBSPECIES, 73, JSEXN_NONE, 2,
+		"{0} is not a member of the {1} family")
+
+	can be used :
+
+	JS_ReportErrorNumber(JSMSG_NOT_A_SUBSPECIES, "Rhino", "Monkey");
+
+	to report :
+
+	"Rhino is not a member of the Monkey family"
+
+*/
+
+MSG_DEF(JSMSG_NOT_AN_ERROR,             0, 0, JSEXN_NONE, "<Error #0 is reserved>")
+MSG_DEF(JSMSG_NOT_DEFINED,              1, 1, JSEXN_REFERENCEERR, "{0} is not defined")
+MSG_DEF(JSMSG_NO_REG_EXPS,              2, 1, JSEXN_INTERNALERR, "sorry, regular expression are not supported")
+MSG_DEF(JSMSG_MORE_ARGS_NEEDED,         3, 3, JSEXN_NONE, "{0} requires more than {1} argument{2}")
+MSG_DEF(JSMSG_BAD_CHAR,                 4, 1, JSEXN_NONE, "invalid format character {0}")
+MSG_DEF(JSMSG_BAD_TYPE,                 5, 1, JSEXN_NONE, "unknown type {0}")
+MSG_DEF(JSMSG_CANT_LOCK,                6, 0, JSEXN_NONE, "can't lock memory")
+MSG_DEF(JSMSG_CANT_UNLOCK,              7, 0, JSEXN_NONE, "can't unlock memory")
+MSG_DEF(JSMSG_INCOMPATIBLE_PROTO,       8, 3, JSEXN_TARGETERR, "{0}.prototype.{1} called on incompatible {2}")
+MSG_DEF(JSMSG_NO_CONSTRUCTOR,           9, 1, JSEXN_NONE, "{0} has no constructor")
+MSG_DEF(JSMSG_CANT_ALIAS,              10, 3, JSEXN_NONE, "can't alias {0} to {1} in class {2}")
+MSG_DEF(JSMSG_NO_PROTO,                11, 1, JSEXN_INTERNALERR, "sorry, Array.prototype.{0} is not yet implemented")
+MSG_DEF(JSMSG_BAD_SORT_ARG,            12, 0, JSEXN_ARRAYERR, "invalid Array.prototype.sort argument")
+MSG_DEF(JSMSG_BAD_ATOMIC_NUMBER,       13, 1, JSEXN_INTERNALERR, "internal error: no index for atom {0}")
+MSG_DEF(JSMSG_TOO_MANY_LITERALS,       14, 0, JSEXN_INTERNALERR, "too many literals")
+MSG_DEF(JSMSG_CANT_WATCH,              15, 1, JSEXN_NONE, "can't watch non-native objects of class {0}")
+MSG_DEF(JSMSG_STACK_UNDERFLOW,         16, 2, JSEXN_INTERNALERR, "internal error compiling {0}: stack underflow at pc {1}")
+MSG_DEF(JSMSG_NEED_DIET,               17, 1, JSEXN_SYNTAXERR, "{0} too large")
+MSG_DEF(JSMSG_BAD_CASE,                18, 2, JSEXN_SYNTAXERR, "{0}, line {1}: invalid case expression")
+MSG_DEF(JSMSG_READ_ONLY,               19, 1, JSEXN_ERR, "{0} is read-only")
+MSG_DEF(JSMSG_BAD_FORMAL,              20, 0, JSEXN_SYNTAXERR, "malformed formal parameter")
+MSG_DEF(JSMSG_SAME_FORMAL,             21, 1, JSEXN_NONE, "duplicate formal argument {0}")
+MSG_DEF(JSMSG_NOT_FUNCTION,            22, 1, JSEXN_CALLERR, "{0} is not a function")
+MSG_DEF(JSMSG_NOT_CONSTRUCTOR,         23, 1, JSEXN_CONSTRUCTORERR, "{0} is not a constructor")
+MSG_DEF(JSMSG_STACK_OVERFLOW,          24, 1, JSEXN_NONE, "stack overflow in {0}")
+MSG_DEF(JSMSG_NOT_EXPORTED,            25, 1, JSEXN_NONE, "{0} is not exported")
+MSG_DEF(JSMSG_OVER_RECURSED,           26, 0, JSEXN_NONE, "too much recursion")
+MSG_DEF(JSMSG_IN_NOT_OBJECT,           27, 0, JSEXN_ERR, "target of 'in' operator must be an object")
+MSG_DEF(JSMSG_BAD_NEW_RESULT,          28, 1, JSEXN_NONE, "invalid new expression result {0}")
+MSG_DEF(JSMSG_BAD_SHARP_DEF,           29, 1, JSEXN_ERR, "invalid sharp variable definition #{0}=")
+MSG_DEF(JSMSG_BAD_SHARP_USE,           30, 1, JSEXN_ERR, "invalid sharp variable use #{0}#")
+MSG_DEF(JSMSG_BAD_INSTANCEOF_RHS,      31, 1, JSEXN_ERR, "invalid instanceof operand {0}")
+MSG_DEF(JSMSG_BAD_BYTECODE,            32, 1, JSEXN_INTERNALERR, "unimplemented JavaScript bytecode {0}")
+MSG_DEF(JSMSG_BAD_RADIX,               33, 1, JSEXN_ERR, "illegal radix {0}")
+MSG_DEF(JSMSG_NAN,                     34, 1, JSEXN_ERR, "{0} is not a number")
+MSG_DEF(JSMSG_CANT_CONVERT,            35, 1, JSEXN_TOPRIMITIVEERR, "can't convert {0} to an integer")
+MSG_DEF(JSMSG_CYCLIC_VALUE,            36, 1, JSEXN_ERR, "cyclic {0} value")
+MSG_DEF(JSMSG_PERMANENT,               37, 1, JSEXN_ERR, "{0} is permanent")
+MSG_DEF(JSMSG_CANT_CONVERT_TO,         38, 2, JSEXN_DEFAULTVALUEERR, "can't convert {0} to {1}")
+MSG_DEF(JSMSG_NO_PROPERTIES,           39, 1, JSEXN_TOOBJECTERR, "{0} has no properties")
+MSG_DEF(JSMSG_CANT_FIND_CLASS,         40, 1, JSEXN_NONE, "can't find class id {0}")
+MSG_DEF(JSMSG_CANT_XDR_CLASS,          41, 1, JSEXN_NONE, "can't XDR class {0}")
+MSG_DEF(JSMSG_BYTECODE_TOO_BIG,        42, 2, JSEXN_INTERNALERR, "bytecode {0} too large (limit {1})")
+MSG_DEF(JSMSG_UNKNOWN_FORMAT,          43, 1, JSEXN_INTERNALERR, "unknown bytecode format {0}")
+MSG_DEF(JSMSG_TOO_MANY_CON_ARGS,       44, 0, JSEXN_SYNTAXERR, "too many constructor arguments")
+MSG_DEF(JSMSG_TOO_MANY_FUN_ARGS,       45, 0, JSEXN_SYNTAXERR, "too many function arguments")
+MSG_DEF(JSMSG_BAD_QUANTIFIER,          46, 1, JSEXN_SYNTAXERR, "invalid quantifier {0}")
+MSG_DEF(JSMSG_MIN_TOO_BIG,             47, 1, JSEXN_SYNTAXERR, "overlarge minimum {0}")
+MSG_DEF(JSMSG_MAX_TOO_BIG,             48, 1, JSEXN_SYNTAXERR, "overlarge maximum {0}")
+MSG_DEF(JSMSG_OUT_OF_ORDER,            49, 1, JSEXN_SYNTAXERR, "maximum {0} less than minimum")
+MSG_DEF(JSMSG_ZERO_QUANTIFIER,         50, 1, JSEXN_SYNTAXERR, "zero quantifier {0}")
+MSG_DEF(JSMSG_UNTERM_QUANTIFIER,       51, 1, JSEXN_SYNTAXERR, "unterminated quantifier {0}")
+MSG_DEF(JSMSG_EMPTY_BEFORE_STAR,       52, 0, JSEXN_SYNTAXERR, "regular expression before * could be empty")
+MSG_DEF(JSMSG_EMPTY_BEFORE_PLUS,       53, 0, JSEXN_SYNTAXERR, "regular expression before + could be empty")
+MSG_DEF(JSMSG_MISSING_PAREN,           54, 1, JSEXN_SYNTAXERR, "unterminated parenthetical {0}")
+MSG_DEF(JSMSG_UNTERM_CLASS,            55, 1, JSEXN_SYNTAXERR, "unterminated character class {0}")
+MSG_DEF(JSMSG_TRAILING_SLASH,          56, 0, JSEXN_SYNTAXERR, "trailing \\ in regular expression")
+MSG_DEF(JSMSG_BAD_CLASS_RANGE,         57, 0, JSEXN_SYNTAXERR, "invalid range in character class")
+MSG_DEF(JSMSG_BAD_FLAG,                58, 1, JSEXN_SYNTAXERR, "invalid regular expression flag {0}")
+MSG_DEF(JSMSG_NO_INPUT,                59, 3, JSEXN_SYNTAXERR, "no input for /{0}/{1}{2}")
+MSG_DEF(JSMSG_CANT_OPEN,               60, 2, JSEXN_NONE, "can't open {0}: {1}")
+MSG_DEF(JSMSG_BAD_STRING_MASK,         61, 1, JSEXN_ERR, "invalid string escape mask {0}")
+MSG_DEF(JSMSG_NO_STRING_PROTO,         62, 1, JSEXN_INTERNALERR, "sorry, String.prototype.{0} is not yet implemented")
+MSG_DEF(JSMSG_END_OF_DATA,             63, 0, JSEXN_NONE, "unexpected end of data")
+MSG_DEF(JSMSG_SEEK_BEYOND_START,       64, 0, JSEXN_NONE, "illegal seek beyond start")
+MSG_DEF(JSMSG_SEEK_BEYOND_END,         65, 0, JSEXN_NONE, "illegal seek beyond end")
+MSG_DEF(JSMSG_END_SEEK,                66, 0, JSEXN_NONE, "illegal end-based seek")
+MSG_DEF(JSMSG_WHITHER_WHENCE,          67, 1, JSEXN_NONE, "unknown seek whence: {0}")
+MSG_DEF(JSMSG_BAD_JVAL_TYPE,           68, 1, JSEXN_NONE, "unknown jsval type {0} for XDR")
+MSG_DEF(JSMSG_PAREN_BEFORE_FORMAL,     69, 0, JSEXN_SYNTAXERR, "missing ( before formal parameters")
+MSG_DEF(JSMSG_MISSING_FORMAL,          70, 0, JSEXN_SYNTAXERR, "missing formal parameter")
+MSG_DEF(JSMSG_PAREN_AFTER_FORMAL,      71, 0, JSEXN_SYNTAXERR, "missing ) after formal parameters")
+MSG_DEF(JSMSG_CURLY_BEFORE_BODY,       72, 0, JSEXN_SYNTAXERR, "missing { before function body")
+MSG_DEF(JSMSG_CURLY_AFTER_BODY,        73, 0, JSEXN_SYNTAXERR, "missing } after function body")
+MSG_DEF(JSMSG_PAREN_BEFORE_COND,       74, 0, JSEXN_SYNTAXERR, "missing ( before condition")
+MSG_DEF(JSMSG_PAREN_AFTER_COND,        75, 0, JSEXN_SYNTAXERR, "missing ) after condition")
+MSG_DEF(JSMSG_NO_IMPORT_NAME,          76, 0, JSEXN_SYNTAXERR, "missing name in import statement")
+MSG_DEF(JSMSG_NAME_AFTER_DOT,          77, 0, JSEXN_SYNTAXERR, "missing name after . operator")
+MSG_DEF(JSMSG_BRACKET_IN_INDEX,        78, 0, JSEXN_SYNTAXERR, "missing ] in index expression")
+MSG_DEF(JSMSG_NO_EXPORT_NAME,          79, 0, JSEXN_SYNTAXERR, "missing name in export statement")
+MSG_DEF(JSMSG_PAREN_BEFORE_SWITCH,     80, 0, JSEXN_SYNTAXERR, "missing ( before switch expression")
+MSG_DEF(JSMSG_PAREN_AFTER_SWITCH,      81, 0, JSEXN_SYNTAXERR, "missing ) after switch expression")
+MSG_DEF(JSMSG_CURLY_BEFORE_SWITCH,     82, 0, JSEXN_SYNTAXERR, "missing { before switch body")
+MSG_DEF(JSMSG_COLON_AFTER_CASE,        83, 0, JSEXN_SYNTAXERR, "missing : after case label")
+MSG_DEF(JSMSG_WHILE_AFTER_DO,          84, 0, JSEXN_SYNTAXERR, "missing while after do-loop body")
+MSG_DEF(JSMSG_PAREN_AFTER_FOR,         85, 0, JSEXN_SYNTAXERR, "missing ( after for")
+MSG_DEF(JSMSG_SEMI_AFTER_FOR_INIT,     86, 0, JSEXN_SYNTAXERR, "missing ; after for-loop initializer")
+MSG_DEF(JSMSG_SEMI_AFTER_FOR_COND,     87, 0, JSEXN_SYNTAXERR, "missing ; after for-loop condition")
+MSG_DEF(JSMSG_PAREN_AFTER_FOR_CTRL,    88, 0, JSEXN_SYNTAXERR, "missing ) after for-loop control")
+MSG_DEF(JSMSG_CURLY_BEFORE_TRY,        89, 0, JSEXN_SYNTAXERR, "missing { before try block")
+MSG_DEF(JSMSG_CURLY_AFTER_TRY,         90, 0, JSEXN_SYNTAXERR, "missing } after try block")
+MSG_DEF(JSMSG_PAREN_BEFORE_CATCH,      91, 0, JSEXN_SYNTAXERR, "missing ( before catch")
+MSG_DEF(JSMSG_CATCH_IDENTIFIER,        92, 0, JSEXN_SYNTAXERR, "missing identifier in catch")
+MSG_DEF(JSMSG_PAREN_AFTER_CATCH,       93, 0, JSEXN_SYNTAXERR, "missing ) after catch")
+MSG_DEF(JSMSG_CURLY_BEFORE_CATCH,      94, 0, JSEXN_SYNTAXERR, "missing { before catch block")
+MSG_DEF(JSMSG_CURLY_AFTER_CATCH,       95, 0, JSEXN_SYNTAXERR, "missing } after catch block")
+MSG_DEF(JSMSG_CURLY_BEFORE_FINALLY,    96, 0, JSEXN_SYNTAXERR, "missing { before finally block")
+MSG_DEF(JSMSG_CURLY_AFTER_FINALLY,     97, 0, JSEXN_SYNTAXERR, "missing } after finally block")
+MSG_DEF(JSMSG_CATCH_OR_FINALLY,        98, 0, JSEXN_SYNTAXERR, "missing catch or finally after try")
+MSG_DEF(JSMSG_PAREN_BEFORE_WITH,       99, 0, JSEXN_SYNTAXERR, "missing ( before with-statement object")
+MSG_DEF(JSMSG_PAREN_AFTER_WITH,       100, 0, JSEXN_SYNTAXERR, "missing ) after with-statement object")
+MSG_DEF(JSMSG_CURLY_IN_COMPOUND,      101, 0, JSEXN_SYNTAXERR, "missing } in compound statement")
+MSG_DEF(JSMSG_NO_VARIABLE_NAME,       102, 0, JSEXN_SYNTAXERR, "missing variable name")
+MSG_DEF(JSMSG_COLON_IN_COND,          103, 0, JSEXN_SYNTAXERR, "missing : in conditional expression")
+MSG_DEF(JSMSG_PAREN_AFTER_ARGS,       104, 0, JSEXN_SYNTAXERR, "missing ) after argument list")
+MSG_DEF(JSMSG_BRACKET_AFTER_LIST,     105, 0, JSEXN_SYNTAXERR, "missing ] after element list")
+MSG_DEF(JSMSG_COLON_AFTER_ID,         106, 0, JSEXN_SYNTAXERR, "missing : after property id")
+MSG_DEF(JSMSG_CURLY_AFTER_LIST,       107, 0, JSEXN_SYNTAXERR, "missing } after property list")
+MSG_DEF(JSMSG_PAREN_IN_PAREN,         108, 0, JSEXN_SYNTAXERR, "missing ) in parenthetical")
+MSG_DEF(JSMSG_SEMI_BEFORE_STMNT,      109, 0, JSEXN_SYNTAXERR, "missing ; before statement")
+MSG_DEF(JSMSG_NO_RETURN_VALUE,        110, 0, JSEXN_NONE, "function does not always return a value")
+MSG_DEF(JSMSG_DUPLICATE_FORMAL,       111, 1, JSEXN_NONE, "duplicate formal argument {0}")
+MSG_DEF(JSMSG_EQUAL_AS_ASSIGN,        112, 1, JSEXN_NONE, "test for equality (==) mistyped as assignment (=)?{0}")
+MSG_DEF(JSMSG_BAD_IMPORT,             113, 0, JSEXN_SYNTAXERR, "invalid import expression")
+MSG_DEF(JSMSG_TOO_MANY_DEFAULTS,      114, 0, JSEXN_SYNTAXERR, "more than one switch default")
+MSG_DEF(JSMSG_TOO_MANY_CASES,         115, 0, JSEXN_INTERNALERR, "too many switch cases")
+MSG_DEF(JSMSG_BAD_SWITCH,             116, 0, JSEXN_SYNTAXERR, "invalid switch statement")
+MSG_DEF(JSMSG_BAD_FOR_LEFTSIDE,       117, 0, JSEXN_SYNTAXERR, "invalid for/in left-hand side")
+MSG_DEF(JSMSG_CATCH_AFTER_GENERAL,    118, 0, JSEXN_NONE, "catch clause after general catch")
+MSG_DEF(JSMSG_CATCH_WITHOUT_TRY,      119, 0, JSEXN_SYNTAXERR, "catch without try")
+MSG_DEF(JSMSG_FINALLY_WITHOUT_TRY,    120, 0, JSEXN_SYNTAXERR, "finally without try")
+MSG_DEF(JSMSG_LABEL_NOT_FOUND,        121, 0, JSEXN_SYNTAXERR, "label not found")
+MSG_DEF(JSMSG_TOUGH_BREAK,            122, 0, JSEXN_SYNTAXERR, "invalid break")
+MSG_DEF(JSMSG_BAD_CONTINUE,           123, 0, JSEXN_SYNTAXERR, "invalid continue")
+MSG_DEF(JSMSG_BAD_RETURN,             124, 0, JSEXN_SYNTAXERR, "invalid return")
+MSG_DEF(JSMSG_BAD_LABEL,              125, 0, JSEXN_SYNTAXERR, "invalid label")
+MSG_DEF(JSMSG_DUPLICATE_LABEL,        126, 0, JSEXN_SYNTAXERR, "duplicate label")
+MSG_DEF(JSMSG_VAR_HIDES_ARG,          127, 1, JSEXN_NONE, "variable {0} hides argument")
+MSG_DEF(JSMSG_BAD_VAR_INIT,           128, 0, JSEXN_SYNTAXERR, "invalid variable initialization")
+MSG_DEF(JSMSG_BAD_LEFTSIDE_OF_ASS,    129, 0, JSEXN_SYNTAXERR, "invalid assignment left-hand side")
+MSG_DEF(JSMSG_BAD_OPERAND,            130, 1, JSEXN_SYNTAXERR, "invalid {0} operand")
+MSG_DEF(JSMSG_BAD_PROP_ID,            131, 0, JSEXN_SYNTAXERR, "invalid property id")
+MSG_DEF(JSMSG_RESERVED_ID,            132, 1, JSEXN_SYNTAXERR, "{0} is a reserved identifier")
+MSG_DEF(JSMSG_SYNTAX_ERROR,           133, 0, JSEXN_SYNTAXERR, "syntax error")
+MSG_DEF(JSMSG_BAD_SHARP_VAR_DEF,      134, 0, JSEXN_SYNTAXERR, "invalid sharp variable definition")
+MSG_DEF(JSMSG_BAD_PROTOTYPE,          135, 1, JSEXN_ERR, "'prototype' property of {0} is not an object")

mozilla/js/src/js11640.def

@@ -0,0 +1,130 @@
+; The contents of this file are subject to the Netscape Public License
+; Version 1.0 (the "NPL"); you may not use this file except in
+; compliance with the NPL.  You may obtain a copy of the NPL at
+; http://www.mozilla.org/NPL/
+;
+; Software distributed under the NPL is distributed on an "AS IS" basis,
+; WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+; for the specific language governing rights and limitations under the
+; NPL.
+;
+; The Initial Developer of this code under the NPL is Netscape
+; Communications Corporation.  Portions created by Netscape are
+; Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+; Reserved.
+LIBRARY JS1640.DLL
+EXETYPE WINDOWS
+PROTMODE
+
+DESCRIPTION 'Netscape 16-bit JavaScript Library'
+
+CODE    LOADONCALL MOVEABLE DISCARDABLE
+DATA	PRELOAD MOVEABLE SINGLE
+
+HEAPSIZE    8192
+
+EXPORTS
+	WEP															@1 RESIDENTNAME	NONAME
+	_JS_Init						= _JS_Init					@2
+	_JS_Finish						= _JS_Finish				@3
+	_JS_GetNaNValue
+	_JS_GetNegativeInfinityValue
+	_JS_GetPositiveInfinityValue
+	_JS_GetEmptyStringValue
+	_JS_ConvertValue
+	_JS_ValueToObject
+	_JS_ValueToFunction
+	_JS_ValueToString
+	_JS_ValueToNumber
+	_JS_ValueToBoolean
+	_JS_TypeOfValue
+	_JS_GetTypeName
+	_JS_Lock
+	_JS_Unlock
+	_JS_NewContext
+	_JS_DestroyContext
+	_JS_ContextIterator
+	_JS_GetGlobalObject
+	_JS_SetGlobalObject
+	_JS_InitStandardClasses
+;	_JS_GetStaticLink
+	_JS_malloc
+	_JS_realloc
+	_JS_free
+	_JS_strdup
+	_JS_NewDouble
+	_JS_NewDoubleValue
+	_JS_AddRoot
+	_JS_RemoveRoot
+	_JS_LockGCThing
+	_JS_UnlockGCThing
+	_JS_GC
+	_JS_PropertyStub
+	_JS_EnumerateStub
+	_JS_ResolveStub
+	_JS_ConvertStub
+	_JS_FinalizeStub
+	_JS_InitClass
+	_JS_GetClass
+	_JS_InstanceOf
+	_JS_GetPrivate
+	_JS_SetPrivate
+	_JS_GetInstancePrivate
+	_JS_GetPrototype
+	_JS_GetParent
+	_JS_SetParent
+	_JS_GetConstructor
+	_JS_NewObject
+	_JS_DefineObject
+	_JS_DefineConstDoubles
+	_JS_DefineProperties
+	_JS_DefineProperty
+	_JS_DefinePropertyWithTinyId
+	_JS_AliasProperty
+	_JS_LookupProperty
+	_JS_GetProperty
+	_JS_SetProperty
+	_JS_DeleteProperty
+	_JS_NewArrayObject
+	_JS_DefineElement
+	_JS_AliasElement
+	_JS_LookupElement
+	_JS_GetElement
+	_JS_SetElement
+	_JS_DeleteElement
+	_JS_ClearScope
+	_JS_NewFunction
+	_JS_GetFunctionObject
+	_JS_GetFunctionName
+	_JS_DefineFunctions
+	_JS_DefineFunction
+	_JS_CompileScript
+	_JS_DestroyScript
+	_JS_CompileFunction
+	_JS_DecompileScript
+	_JS_DecompileFunction
+	_JS_DecompileFunctionBody
+	_JS_ExecuteScript
+	_JS_EvaluateScript
+	_JS_CallFunction
+	_JS_CallFunctionName
+	_JS_CallFunctionValue
+	_JS_SetBranchCallback
+	_JS_IsRunning
+	_JS_NewString
+	_JS_NewStringCopyN
+	_JS_NewStringCopyZ
+	_JS_InternString
+	_JS_GetStringBytes
+	_JS_GetStringLength
+	_JS_CompareStrings
+	_JS_ReportError
+	_JS_ReportOutOfMemory
+	_JS_SetErrorReporter
+	_JS_NewRegExpObject
+	_JS_SetRegExpInput
+	_JS_ClearRegExpStatics
+	
+IMPORTS
+	_printf		= nspr21.11
+	_strftime	= nspr21.13

mozilla/js/src/js1640.def

@@ -0,0 +1,137 @@
+LIBRARY JS1640.DLL
+EXETYPE WINDOWS
+PROTMODE
+
+DESCRIPTION 'Netscape 16-bit JavaScript Library'
+
+CODE    LOADONCALL MOVEABLE DISCARDABLE
+DATA	PRELOAD MOVEABLE SINGLE
+
+HEAPSIZE    8192
+
+EXPORTS
+	WEP															@1 RESIDENTNAME	NONAME
+	_JS_Init						= _JS_Init					@2
+	_JS_Finish						= _JS_Finish				@3
+	_JS_GetNaNValue
+	_JS_GetNegativeInfinityValue
+	_JS_GetPositiveInfinityValue
+	_JS_GetEmptyStringValue
+	_JS_ConvertValue
+	_JS_ValueToObject
+	_JS_ValueToFunction
+	_JS_ValueToString
+	_JS_ValueToNumber
+	_JS_ValueToBoolean
+	_JS_TypeOfValue
+	_JS_GetTypeName
+	_JS_Lock
+	_JS_Unlock
+	_JS_NewContext
+	_JS_DestroyContext
+	_JS_ContextIterator
+	_JS_GetGlobalObject
+	_JS_SetGlobalObject
+	_JS_InitStandardClasses
+;	_JS_GetStaticLink
+	_JS_malloc
+	_JS_realloc
+	_JS_free
+	_JS_strdup
+	_JS_NewDouble
+	_JS_NewDoubleValue
+	_JS_AddRoot
+	_JS_RemoveRoot
+	_JS_LockGCThing
+	_JS_UnlockGCThing
+	_JS_GC
+	_JS_PropertyStub
+	_JS_EnumerateStub
+	_JS_ResolveStub
+	_JS_ConvertStub
+	_JS_FinalizeStub
+	_JS_InitClass
+	_JS_GetClass
+	_JS_InstanceOf
+	_JS_GetPrivate
+	_JS_SetPrivate
+	_JS_GetInstancePrivate
+	_JS_GetPrototype
+	_JS_GetParent
+	_JS_SetParent
+	_JS_GetConstructor
+	_JS_NewObject
+	_JS_DefineObject
+	_JS_DefineConstDoubles
+	_JS_DefineProperties
+	_JS_DefineProperty
+	_JS_DefinePropertyWithTinyId
+	_JS_AliasProperty
+	_JS_LookupProperty
+	_JS_GetProperty
+	_JS_SetProperty
+	_JS_DeleteProperty
+	_JS_NewArrayObject
+	_JS_DefineElement
+	_JS_AliasElement
+	_JS_LookupElement
+	_JS_GetElement
+	_JS_SetElement
+	_JS_DeleteElement
+	_JS_ClearScope
+	_JS_NewFunction
+	_JS_GetFunctionObject
+	_JS_GetFunctionName
+	_JS_DefineFunctions
+	_JS_DefineFunction
+	_JS_CompileScript
+	_JS_DestroyScript
+	_JS_CompileFunction
+	_JS_DecompileScript
+	_JS_DecompileFunction
+	_JS_DecompileFunctionBody
+	_JS_ExecuteScript
+	_JS_EvaluateScript
+	_JS_CallFunction
+	_JS_CallFunctionName
+	_JS_CallFunctionValue
+	_JS_SetBranchCallback
+	_JS_IsRunning
+	_JS_NewString
+	_JS_NewStringCopyN
+	_JS_NewStringCopyZ
+	_JS_InternString
+	_JS_GetStringBytes
+	_JS_GetStringLength
+	_JS_CompareStrings
+	_JS_ReportError
+	_JS_ReportOutOfMemory
+	_JS_SetErrorReporter
+	_JS_NewRegExpObject
+	_JS_SetRegExpInput
+	_JS_ClearRegExpStatics
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+

mozilla/js/src/js1640.rc

@@ -0,0 +1,60 @@
+/////////////////////////////////////////////////////////////////////////////
+
+// Version stamp for this .DLL
+
+#include <windows.h>
+
+#include <ver.h>
+
+
+
+VS_VERSION_INFO     VERSIONINFO
+
+  FILEVERSION       4 // major, minor, release (alpha 1), build #
+
+  PRODUCTVERSION    4
+
+  FILEFLAGSMASK     0
+
+  FILEFLAGS         0 // final version
+
+  FILEOS            VOS_DOS_WINDOWS16
+
+  FILETYPE          VFT_DLL
+
+  FILESUBTYPE       0   // not used
+
+BEGIN
+
+    BLOCK "StringFileInfo"
+
+    BEGIN
+
+        BLOCK "040904E4" // Lang=US English, CharSet=Windows Multilingual
+
+        BEGIN
+
+            VALUE "CompanyName",     "Netscape Communications Corporation\0"
+
+            VALUE "FileDescription", "Netscape 16-bit JavaScript Module\0"
+
+            VALUE "FileVersion",     "4.0\0"
+
+            VALUE "InternalName",    "JS1640\0"
+
+            VALUE "LegalCopyright",  "Copyright Netscape Communications. 1994-96\0"
+
+            VALUE "LegalTrademarks", "Netscape, Mozilla\0"
+
+            VALUE "OriginalFilename","JS1640.DLL\0"
+
+            VALUE "ProductName",     "NETSCAPE\0"
+
+            VALUE "ProductVersion",  "4.0\0"
+
+        END
+
+    END
+
+END
+

mozilla/js/src/js32.dsp

@@ -0,0 +1,318 @@
+# Microsoft Developer Studio Project File - Name="js32" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=js32 - Win32 Release
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "js32.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "js32.mak" CFG="js32 - Win32 Release"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "js32 - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "js32 - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "js32 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir ".\js32\Release"
+# PROP BASE Intermediate_Dir ".\js32\Release"
+# PROP BASE Target_Dir ".\js32"
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir ".\Release"
+# PROP Intermediate_Dir ".\Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ".\js32"
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MD /W3 /GX /O2 /I "mininspr" /D "NDEBUG" /D "_WINDOWS" /D "_WIN32" /D "WIN32" /D "XP_PC" /D "JSFILE" /D "EXPORT_JS_API" /D "MINI_NSPR" /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386
+# ADD LINK32 H:\ns\dist\WINNT4.0_OPT.OBJ\lib\libnspr21_s.lib H:\ns\dist\WINNT4.0_OPT.OBJ\lib\libplds21_s.lib winmm.lib mswsock.lib ws2_32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386
+
+!ELSEIF  "$(CFG)" == "js32 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir ".\js32\Debug"
+# PROP BASE Intermediate_Dir ".\js32\Debug"
+# PROP BASE Target_Dir ".\js32"
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir ".\Debug"
+# PROP Intermediate_Dir ".\Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ".\js32"
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MDd /W3 /Gm /GX /Zi /Od /I "mininspr" /D "_DEBUG" /D "DEBUG" /D "_WINDOWS" /D "_WIN32" /D "WIN32" /D "XP_PC" /D "JSFILE" /D "EXPORT_JS_API" /D "MINI_NSPR" /YX /FD /c
+# ADD BASE MTL /nologo /D "_DEBUG" /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386
+# ADD LINK32 H:\ns\dist\WINNT4.0_DBG.OBJ\lib\libnspr21_s.lib H:\ns\dist\WINNT4.0_DBG.OBJ\lib\libplds21_s.lib winmm.lib mswsock.lib ws2_32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386
+
+!ENDIF 
+
+# Begin Target
+
+# Name "js32 - Win32 Release"
+# Name "js32 - Win32 Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90"
+# Begin Source File
+
+SOURCE=.\jsapi.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsarray.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsatom.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsbool.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jscntxt.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsdate.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsdbgapi.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsemit.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsfun.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsgc.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsinterp.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jslock.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsmath.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsnum.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsobj.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsopcode.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsparse.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsregexp.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscan.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscope.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscript.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsstr.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsxdrapi.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\prarena.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\prmjtime.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl;fi;fd"
+# Begin Source File
+
+SOURCE=.\jsapi.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsarray.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsatom.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsbool.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jscntxt.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsconfig.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsdate.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsdbgapi.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsemit.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsfun.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsgc.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsinterp.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jslock.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsmath.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsnum.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsobj.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsopcode.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsparse.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsprvtd.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jspubtd.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsregexp.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscan.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscope.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsscript.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsstddef.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsstr.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\jsxdrapi.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\prarena.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\prdtoa.h
+# End Source File
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;cnt;rtf;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project

mozilla/js/src/js3240.rc

@@ -0,0 +1,79 @@
+//Microsoft Developer Studio generated resource script.
+//
+#include "resource.h"
+
+#define APSTUDIO_READONLY_SYMBOLS
+/////////////////////////////////////////////////////////////////////////////
+//
+// Generated from the TEXTINCLUDE 2 resource.
+//
+#include "winver.h"
+
+/////////////////////////////////////////////////////////////////////////////
+#undef APSTUDIO_READONLY_SYMBOLS
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// Version
+//
+
+VS_VERSION_INFO VERSIONINFO
+ FILEVERSION 4,0,0,0
+ PRODUCTVERSION 4,0,0,0
+ FILEFLAGSMASK 0x3fL
+#ifdef _DEBUG
+ FILEFLAGS 0x1L
+#else
+ FILEFLAGS 0x0L
+#endif
+ FILEOS 0x10004L
+ FILETYPE 0x2L
+ FILESUBTYPE 0x0L
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "040904e4"
+        BEGIN
+            VALUE "CompanyName", "Netscape Communications Corporation\0"
+            VALUE "FileDescription", "Netscape 32-bit JavaScript Module\0"
+            VALUE "FileVersion", "4.0\0"
+            VALUE "InternalName", "JS3240\0"
+            VALUE "LegalCopyright", "Copyright Netscape Communications. 1994-96\0"
+            VALUE "LegalTrademarks", "Netscape, Mozilla\0"
+            VALUE "OriginalFilename", "js3240.dll\0"
+            VALUE "ProductName", "NETSCAPE\0"
+            VALUE "ProductVersion", "4.0\0"
+        END
+    END
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x409, 1252
+    END
+END
+
+#ifdef APSTUDIO_INVOKED
+/////////////////////////////////////////////////////////////////////////////
+//
+// TEXTINCLUDE
+//
+
+1 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "resource.h\0"
+END
+
+2 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "#include ""winver.h""\r\n"
+    "\0"
+END
+
+3 TEXTINCLUDE DISCARDABLE 
+BEGIN
+    "\r\n"
+    "\0"
+END
+
+#endif    // APSTUDIO_INVOKED
+
+/////////////////////////////////////////////////////////////////////////////

mozilla/js/src/jsOS240.def

@@ -0,0 +1,623 @@
+; The contents of this file are subject to the Netscape Public License
+; Version 1.0 (the "NPL"); you may not use this file except in
+; compliance with the NPL.  You may obtain a copy of the NPL at
+; http://www.mozilla.org/NPL/
+;
+; Software distributed under the NPL is distributed on an "AS IS" basis,
+; WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+; for the specific language governing rights and limitations under the
+; NPL.
+;
+; The Initial Developer of this code under the NPL is Netscape
+; Communications Corporation.  Portions created by Netscape are
+; Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+; Reserved.
+
+LIBRARY JS3240 INITINSTANCE TERMINSTANCE
+PROTMODE
+
+DESCRIPTION 'Netscape OS/2 JavaScript Library'
+
+
+CODE    LOADONCALL MOVEABLE DISCARDABLE
+DATA    PRELOAD MOVEABLE MULTIPLE NONSHARED
+
+
+EXPORTS
+;====================== win16 exports these at least... ===========
+;	JS_Init				= JS_Init		@2
+;	JS_Finish			= JS_Finish		@3
+;	JS_GetNaNValue
+;	JS_GetNegativeInfinityValue
+;	JS_GetPositiveInfinityValue
+;	JS_GetEmptyStringValue
+;	JS_ConvertValue
+;	JS_ValueToObject
+;	JS_ValueToFunction
+;	JS_ValueToString
+;	JS_ValueToNumber
+;	JS_ValueToBoolean
+;	JS_TypeOfValue
+;	JS_GetTypeName
+;	JS_Lock
+;	JS_Unlock
+;	JS_NewContext
+;	JS_DestroyContext
+;	JS_ContextIterator
+;	JS_GetGlobalObject
+;	JS_SetGlobalObject
+;	JS_InitStandardClasses
+;;	JS_GetStaticLink
+;	JS_malloc
+;	JS_realloc
+;	JS_free
+;	JS_strdup
+;	JS_NewDouble
+;	JS_NewDoubleValue
+;	JS_AddRoot
+;	JS_RemoveRoot
+;	JS_LockGCThing
+;	JS_UnlockGCThing
+;	JS_GC
+;	JS_PropertyStub
+;	JS_EnumerateStub
+;	JS_ResolveStub
+;	JS_ConvertStub
+;	JS_FinalizeStub
+;	JS_InitClass
+;	JS_GetClass
+;	JS_InstanceOf
+;	JS_GetPrivate
+;	JS_SetPrivate
+;	JS_GetInstancePrivate
+;	JS_GetPrototype
+;	JS_GetParent
+;	JS_SetParent
+;	JS_GetConstructor
+;	JS_NewObject
+;	JS_DefineObject
+;	JS_DefineConstDoubles
+;	JS_DefineProperties
+;	JS_DefineProperty
+;	JS_DefinePropertyWithTinyId
+;	JS_AliasProperty
+;	JS_LookupProperty
+;	JS_GetProperty
+;	JS_SetProperty
+;	JS_DeleteProperty
+;	JS_NewArrayObject
+;	JS_DefineElement
+;	JS_AliasElement
+;	JS_LookupElement
+;	JS_GetElement
+;	JS_SetElement
+;	JS_DeleteElement
+;	JS_ClearScope
+;	JS_NewFunction
+;	JS_GetFunctionObject
+;	JS_GetFunctionName
+;	JS_DefineFunctions
+;	JS_DefineFunction
+;	JS_CompileScript
+;	JS_DestroyScript
+;	JS_CompileFunction
+;	JS_DecompileScript
+;	JS_DecompileFunction
+;	JS_DecompileFunctionBody
+;	JS_ExecuteScript
+;	JS_EvaluateScript
+;	JS_CallFunction
+;	JS_CallFunctionName
+;	JS_CallFunctionValue
+;	JS_SetBranchCallback
+;	JS_IsRunning
+;	JS_NewString
+;	JS_NewStringCopyN
+;	JS_NewStringCopyZ
+;	JS_InternString
+;	JS_GetStringBytes
+;	JS_GetStringLength
+;	JS_CompareStrings
+;	JS_ReportError
+;	JS_ReportOutOfMemory
+;	JS_SetErrorReporter
+;	JS_NewRegExpObject
+;	JS_SetRegExpInput
+;	JS_ClearRegExpStatics
+;=================================================
+
+
+;00001:jsstr (OFFSET:0x00002e17, SIZE:0x0000ae17):
+; - Public Definitions:
+;     js_EmptySubString
+;     js_CompareStrings
+;     js_HashString
+;     js_ValueToString
+;     js_StringToObject
+;     js_FinalizeString
+;     js_NewStringCopyZ
+;     js_NewString
+;     js_InitStringClass
+;     js_NewStringCopyN
+;     js_BoyerMooreHorspool
+;
+;
+;00002:jsscript (OFFSET:0x0000dc2e, SIZE:0x00003abb):
+; - Public Definitions:
+;     js_LineNumberToPC
+;     js_PCToLineNumber
+;     js_GetSrcNote
+;     js_DestroyScript
+;     js_NewScript
+;
+;
+;00003:jsscope (OFFSET:0x000116e9, SIZE:0x00004f82):
+; - Public Definitions:
+;     js_hash_scope_ops
+;     js_list_scope_ops
+;     js_DestroyProperty
+;     js_NewProperty
+;     js_IdToValue
+;     js_HashValue
+;     js_DestroyScope
+;     js_MutateScope
+;     js_DropScope
+;     js_HoldScope
+;     js_NewScope
+;     js_GetMutableScope
+;     js_HoldProperty
+;     js_DropProperty
+;
+;
+;00004:jsscan (OFFSET:0x0001666b, SIZE:0x00008890):
+; - Public Definitions:
+;     js_MatchToken
+;     js_FlushNewlines
+;     js_PeekTokenSameLine
+;     js_UngetToken
+;     js_GetToken
+;     js_PeekToken
+;     js_ReportCompileError
+      js_CloseTokenStream
+      js_NewBufferTokenStream
+;     js_NewTokenStream
+;     js_InitScanner
+;
+;
+;00005:jsregexp (OFFSET:0x0001eefb, SIZE:0x0000eee4):
+; - Public Definitions:
+;     js_RegExpClass
+;     reopsize
+;     js_NewRegExpObject
+;     js_InitRegExpClass
+;     js_FreeRegExpStatics
+;     js_InitRegExpStatics
+;     js_ExecuteRegExp
+;     js_NewRegExpOpt
+;     js_DestroyRegExp
+;     js_NewRegExp
+;
+;
+;00006:jsparse (OFFSET:0x0002dddf, SIZE:0x00010b71):
+; - Public Definitions:
+;     js_ParseFunctionBody
+      js_Parse
+;
+;
+;00007:jsopcode (OFFSET:0x0003e950, SIZE:0x0000d362):
+; - Public Definitions:
+;     js_EscapeMap
+;     js_NumCodeSpecs
+;     js_CodeSpec
+;     js_incop_str
+;     js_true_str
+;     js_false_str
+;     js_this_str
+;     js_null_str
+;     js_void_str
+;     js_typeof_str
+;     js_delete_str
+;     js_new_str
+;     js_ValueToSource
+;     js_DecompileScript
+;     js_DecompileCode
+;     js_DecompileFunction
+;     js_puts
+;     js_printf
+;     js_GetPrinterOutput
+;     js_DestroyPrinter
+;     js_NewPrinter
+;     js_EscapeString
+;     js_Disassemble1
+;     js_Disassemble
+;
+;00008:jsobj (OFFSET:0x0004bcb2, SIZE:0x000090a4):
+; - Public Definitions:
+;     js_WithClass
+;     js_ObjectClass
+;     js_TryValueOf
+;     js_ValueToNonNullObject
+;     js_TryMethod
+;     js_ObjectToString
+;     js_SetClassPrototype
+;     js_DeleteProperty2
+;     js_DeleteProperty
+;     js_SetProperty
+;     js_GetProperty
+;     js_FindVariableScope
+;     js_FindVariable
+;     js_FindProperty
+;     js_LookupProperty
+;     js_DefineProperty
+;     js_FreeSlot
+;     js_AllocSlot
+;     js_FinalizeObject
+;     js_GetClassPrototype
+;     js_NewObject
+;     js_InitObjectClass
+;     js_ValueToObject
+;     js_obj_toString
+;     js_SetSlot
+;     js_GetSlot
+;
+;
+;00009:jsnum (OFFSET:0x00054d56, SIZE:0x00004f29):
+; - Public Definitions:
+;     js_ValueToInt32
+;     js_NumberToObject
+;     js_FinalizeDouble
+;     js_InitNumberClass
+;     js_NumberToString
+;     js_NewDoubleValue
+;     js_NewDouble
+;     js_ValueToNumber
+;
+;
+;00010:jsmath (OFFSET:0x00059c7f, SIZE:0x000054b6):
+; - Public Definitions:
+;     js_InitMathClass
+;
+;
+;00011:jsjava (OFFSET:0x0005f135, SIZE:0x00022aad):
+; - Public Definitions:
+;     js_Hooks
+;     MojaSrcLog
+;     finalizeTask
+      JSJ_FindCurrentJSContext
+;     JSJ_GetPrincipals
+      JSJ_IsSafeMethod
+      JSJ_InitContext
+      JSJ_Init
+      js_JSErrorToJException
+      js_JavaErrorReporter
+      js_RemoveReflection
+      js_ReflectJObjectToJSObject
+      js_convertJObjectToJSValue
+      js_convertJSValueToJObject
+      js_ReflectJSObjectToJObject
+;     js_ReflectJClassToJSObject
+      JSJ_ExitJS
+      JSJ_EnterJS
+      JSJ_CurrentContext
+      JSJ_IsEnabled
+;added in GA code - DSR70297
+      JSJ_Finish
+      JSJ_IsCalledFromJava
+      js_GetJSPrincipalsFromJavaCaller
+
+;
+;
+;00012:jsinterp (OFFSET:0x00081be2, SIZE:0x00012274):
+; - Public Definitions:
+;     js_Call
+;     js_Interpret
+;     js_SetLocalVariable
+;     js_GetLocalVariable
+;     js_SetArgument
+;     js_GetArgument
+;     js_FlushPropertyCacheByProp
+;     js_FlushPropertyCache
+;
+;
+;00013:jsgc (OFFSET:0x00093e56, SIZE:0x00004f8d):
+; - Public Definitions:
+;     js_ForceGC
+;     js_UnlockGCThing
+;     js_LockGCThing
+;     js_GC
+;     js_AllocGCThing
+;     js_RemoveRoot
+;     js_AddRoot
+;     js_FinishGC
+;     js_InitGC
+;
+;
+;00014:jsfun (OFFSET:0x00098de3, SIZE:0x0000977c):
+; - Public Definitions:
+;     js_FunctionClass
+;     js_ClosureClass
+;     js_CallClass
+;     js_DefineFunction
+;     js_NewFunction
+;     js_InitCallAndClosureClasses
+;     js_InitFunctionClass
+;     js_ValueToFunction
+;     js_SetCallVariable
+;     js_GetCallVariable
+;     js_PutCallObject
+;     js_GetCallObject
+;
+;
+;00015:jsemit (OFFSET:0x000a255f, SIZE:0x000077be):
+; - Public Definitions:
+;     js_SrcNoteName
+;     js_SrcNoteArity
+      js_FinishTakingSrcNotes
+;     js_MoveSrcNotes
+;     js_GetSrcNoteOffset
+;     js_BumpSrcNoteDelta
+;     js_NewSrcNote3
+;     js_NewSrcNote2
+;     js_PopStatement
+;     js_EmitContinue
+;     js_EmitBreak
+;     js_SetSrcNoteOffset
+;     js_NewSrcNote
+;     js_PushStatement
+;     js_MoveCode
+;     js_SetJumpOffset
+;     js_Emit3
+;     js_Emit2
+;     js_Emit1
+;     js_UpdateDepth
+;     js_SrcNoteLength
+;     js_CancelLastOpcode
+      js_InitCodeGenerator
+;
+;
+;00016:jsdbgapi (OFFSET:0x000a9d1d, SIZE:0x000057db):
+; - Public Definitions:
+;     js_watchpoint_list
+;     js_trap_list
+;     JS_SetAnnotationInFrame
+;     JS_GetAnnotationFromFrame
+;     JS_GetJSPrincipalArrayFromFrame
+;     JS_NextJSFrame
+;     JS_InitJSFrameIterator
+      JS_LineNumberToPC
+      JS_PCToLineNumber
+      JS_ClearAllWatchPoints
+      JS_ClearWatchPoint
+      JS_SetWatchPoint
+      JS_HandleTrap
+      JS_ClearAllTraps
+      JS_ClearScriptTraps
+      JS_ClearTrap
+      JS_GetTrapOpcode
+      JS_SetTrap
+;DSR070297 - added in GA code
+      JS_FrameIterator
+      JS_GetFrameAnnotation
+      JS_GetFramePrincipalArray
+      JS_GetFrameScript
+      JS_GetScriptFilename
+      JS_SetFrameAnnotation
+      JS_GetFramePC
+      JS_GetFunctionScript
+
+;
+;
+;00017:jsdate (OFFSET:0x000af4f8, SIZE:0x00009a8e):
+; - Public Definitions:
+      js_DateGetSeconds
+      js_DateGetMinutes
+      js_DateGetHours
+      js_DateGetDate
+      js_DateGetMonth
+      js_DateGetYear
+      js_NewDateObject
+;     js_InitDateClass
+;
+;
+;00018:jscntxt (OFFSET:0x000b8f86, SIZE:0x00003732):
+; - Public Definitions:
+;     js_InterpreterHooks
+;     js_ReportIsNotDefined
+;     js_ReportErrorAgain
+;     js_ReportErrorVA
+;     js_ContextIterator
+;     js_DestroyContext
+;     js_NewContext
+;     js_SetInterpreterHooks
+;
+;
+;00019:jsbool (OFFSET:0x000bc6b8, SIZE:0x00003375):
+; - Public Definitions:
+;     js_BooleanToString
+;     js_BooleanToObject
+;     js_InitBooleanClass
+;     js_ValueToBoolean
+;
+;
+;00020:jsatom (OFFSET:0x000bfa2d, SIZE:0x000058d0):
+; - Public Definitions:
+;     js_valueOf_str
+;     js_toString_str
+;     js_length_str
+;     js_eval_str
+;     js_constructor_str
+;     js_class_prototype_str
+;     js_assign_str
+;     js_anonymous_str
+;     js_Object_str
+;     js_Array_str
+;     js_type_str
+;     js_DropUnmappedAtoms
+      js_FreeAtomMap
+      js_InitAtomMap
+;     js_GetAtom
+;     js_DropAtom
+;     js_IndexAtom
+;     js_ValueToStringAtom
+;     js_AtomizeString
+;     js_AtomizeDouble
+;     js_AtomizeInt
+;     js_AtomizeBoolean
+;     js_AtomizeObject
+;     js_HoldAtom
+;     js_MarkAtomState
+;     js_FreeAtomState
+;     js_Atomize
+;     js_InitAtomState
+;
+;
+;00021:jsarray (OFFSET:0x000c52fd, SIZE:0x00007c86):
+; - Public Definitions:
+;     js_ArrayClass
+;     js_SetArrayLength
+;     js_GetArrayLength
+;     js_InitArrayClass
+;     js_NewArrayObject
+;     PR_qsort
+;
+;
+;00022:jsapi (OFFSET:0x000ccf83, SIZE:0x0000de8c):
+; - Public Definitions:
+      JS_ClearRegExpStatics
+      JS_SetRegExpInput
+      JS_NewRegExpObject
+      JS_SetErrorReporter
+      JS_CompareStrings
+      JS_GetStringLength
+      JS_GetStringBytes
+      JS_InternString
+      JS_NewStringCopyZ
+      JS_NewStringCopyN
+      JS_NewString
+      JS_IsRunning
+      JS_SetBranchCallback
+      JS_CallFunctionValue
+      JS_CallFunctionName
+      JS_CallFunction
+      JS_EvaluateScriptForPrincipals
+      JS_EvaluateScript
+      JS_ExecuteScript
+      JS_DecompileFunctionBody
+      JS_DecompileFunction
+      JS_DecompileScript
+      JS_CompileFunctionForPrincipals
+      JS_CompileFunction
+      JS_DestroyScript
+      JS_CompileScriptForPrincipals
+      JS_CompileScript
+      JS_DefineFunction
+      JS_GetFunctionName
+      JS_GetFunctionObject
+      JS_NewFunction
+      JS_ClearScope
+      JS_DeleteElement
+      JS_SetElement
+      JS_GetElement
+      JS_LookupElement
+      JS_AliasElement
+      JS_DefineElement
+      JS_SetArrayLength
+      JS_GetArrayLength
+      JS_NewArrayObject
+      JS_DeleteProperty
+      JS_SetProperty
+      JS_GetProperty
+      JS_LookupProperty
+      JS_AliasProperty
+      JS_DefinePropertyWithTinyId
+      JS_DefineProperty
+      JS_DefineConstDoubles
+      JS_DefineObject
+      JS_NewObject
+      JS_GetConstructor
+      JS_SetParent
+      JS_GetParent
+      JS_SetPrototype
+      JS_GetPrototype
+      JS_GetInstancePrivate
+      JS_SetPrivate
+      JS_GetPrivate
+      JS_InstanceOf
+      JS_GetClass
+      JS_DefineFunctions
+      JS_DefineProperties
+      JS_InitClass
+      JS_FinalizeStub
+      JS_ConvertStub
+      JS_ResolveStub
+      JS_EnumerateStub
+      JS_PropertyStub
+      JS_GC
+      JS_UnlockGCThing
+      JS_LockGCThing
+      JS_RemoveRoot
+      JS_AddRoot
+      JS_NewDoubleValue
+      JS_NewDouble
+      JS_strdup
+      JS_free
+      JS_realloc
+      JS_ReportOutOfMemory
+      JS_malloc
+      JS_GetScopeChain
+      JS_InitStandardClasses
+      JS_SetGlobalObject
+      JS_GetGlobalObject
+      JS_SetVersion
+      JS_GetVersion
+      JS_ContextIterator
+      JS_GetTaskState
+      JS_DestroyContext
+      JS_NewContext
+      JS_Unlock
+      JS_Lock
+      JS_Finish
+      JS_Init
+      JS_GetTypeName
+      JS_TypeOfValue
+      JS_ValueToBoolean
+      JS_ValueToInt32
+      JS_ValueToNumber
+      JS_ValueToString
+      JS_ValueToFunction
+      JS_ValueToObject
+      JS_ReportError
+      JS_ConvertValue
+      JS_GetEmptyStringValue
+      JS_GetPositiveInfinityValue
+      JS_GetNegativeInfinityValue
+      JS_GetNaNValue
+;DSR062897 - added for GA code
+      JS_MaybeGC
+      JS_GetScriptPrincipals
+      JS_IsAssigning
+      JS_SetCharSetInfo
+;
+;
+;00023:prmjtime (OFFSET:0x000dae0f, SIZE:0x00008986):
+; - Public Definitions:
+      PRMJ_FormatTimeUSEnglish
+      PRMJ_gmtime
+      PRMJ_FormatTime
+      PRMJ_mktime
+      PRMJ_ComputeTime
+      PRMJ_localtime
+      PRMJ_ExplodeTime
+      PRMJ_ToLocal
+      PRMJ_ToGMT
+      PRMJ_NowLocal
+      PRMJ_DSTOffset
+      PRMJ_NowS
+      PRMJ_NowMS
+      PRMJ_Now
+      PRMJ_ToExtendedTime
+      PRMJ_ToBaseTime
+      PRMJ_setDST
+      PRMJ_LocalGMTDifference
+
+

mozilla/js/src/jsaddr.c

@@ -0,0 +1,42 @@
+/* -*- Mode: C; tab-width: 8 -*-
+ * Copyright © 1996 Netscape Communications Corporation, All Rights Reserved.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "jsapi.h"
+#include "jsinterp.h"
+
+/* These functions are needed to get the addresses of certain functions
+ * in the JS module. On WIN32 especially, these symbols have a different
+ * address from the actual address of these functions in the JS module.
+ * This is because on WIN32, import function address fixups are done only
+ * at load time and function calls are made by indirection - that is by
+ * using a couple extra instructions to lookup the actual function address
+ * in the importing module's import address table.
+ */
+
+IMPLEMENT(JSPropertyOp)
+js_GetArgumentAddress()
+{
+	return ((void *)js_GetArgument);
+}
+
+IMPLEMENT(JSPropertyOp)
+js_SetArgumentAddress()
+{
+	return ((void *)js_SetArgument);
+}
+
+IMPLEMENT(JSPropertyOp)
+js_GetLocalVariableAddress()
+{
+	return ((void *)js_GetLocalVariable);
+}
+
+IMPLEMENT(JSPropertyOp)
+js_SetLocalVariableAddress()
+{
+	return ((void *)js_SetLocalVariable);
+}

mozilla/js/src/jsaddr.h

@@ -0,0 +1,20 @@
+/* -*- Mode: C; tab-width: 8 -*-
+ * Copyright © 1996 Netscape Communications Corporation, All Rights Reserved.
+ */
+
+#ifndef jsaddr_h___
+#define jsaddr_h___
+
+EXTERN(JSPropertyOp)
+js_GetArgumentAddress();
+
+EXTERN(JSPropertyOp)
+js_SetArgumentAddress();
+
+EXTERN(JSPropertyOp)
+js_GetLocalVariableAddress();
+
+EXTERN(JSPropertyOp)
+js_SetLocalVariableAddress();
+
+#endif /* jsaddr_h___ */

mozilla/js/src/jsarena.c

@@ -0,0 +1,343 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * Lifetime-based fast allocation, inspired by much prior art, including
+ * "Fast Allocation and Deallocation of Memory Based on Object Lifetimes"
+ * David R. Hanson, Software -- Practice and Experience, Vol. 20(1).
+ */
+#include "jsstddef.h"
+#include <stdlib.h>
+#include <string.h>
+#include "jstypes.h"
+#include "jsbit.h"
+#ifndef NSPR20
+#include "jsarena.h"
+#else
+/* Removed by JSIFY: #include "plarena.h"
+ */
+#include "jsarena.h" /* Added by JSIFY */
+#endif
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+
+#ifdef JS_THREADSAFE
+extern js_CompareAndSwap(jsword *, jsword, jsword);
+#endif
+
+static JSArena *arena_freelist;
+
+#ifdef JS_ARENAMETER
+static JSArenaStats *arena_stats_list;
+
+#define COUNT(pool,what)  (pool)->stats.what++
+#else
+#define COUNT(pool,what)  /* nothing */
+#endif
+
+#define JS_ARENA_DEFAULT_ALIGN  sizeof(double)
+
+IMPLEMENT(void)
+JS_InitArenaPool(JSArenaPool *pool, const char *name, JSUint32 size, JSUint32 align)
+{
+    if (align == 0)
+	align = JS_ARENA_DEFAULT_ALIGN;
+    pool->mask = JS_BITMASK(JS_CeilingLog2(align));
+    pool->first.next = NULL;
+    pool->first.base = pool->first.avail = pool->first.limit =
+	(jsuword)JS_ARENA_ALIGN(pool, &pool->first + 1);
+    pool->current = &pool->first;
+    pool->arenasize = size;
+#ifdef JS_ARENAMETER
+    memset(&pool->stats, 0, sizeof pool->stats);
+    pool->stats.name = strdup(name);
+    pool->stats.next = arena_stats_list;
+    arena_stats_list = &pool->stats;
+#endif
+}
+
+IMPLEMENT(void *)
+JS_ArenaAllocate(JSArenaPool *pool, JSUint32 nb)
+{
+    JSArena **ap, *a, *b;
+#ifdef JS_THREADSAFE
+    JSArena *c;
+#endif
+    JSUint32 sz;
+    void *p;
+
+    JS_ASSERT((nb & pool->mask) == 0);
+#if defined(XP_PC) && !defined(_WIN32)
+    if (nb >= 60000U)
+	return 0;
+#endif  /* WIN16 */
+    ap = &arena_freelist;
+    for (a = pool->current; a->avail + nb > a->limit; pool->current = a) {
+        if (a->next) {                          /* move to next arena */
+            a = a->next;
+	    continue;
+        }
+	while ((b = *ap) != NULL) {		/* reclaim a free arena */
+	    if (b->limit - b->base == pool->arenasize) {
+#ifdef JS_THREADSAFE
+		do {
+                    b = *ap;
+		    c = b->next;
+		} while (!js_CompareAndSwap((jsword *)ap,(jsword)b,(jsword)c));
+#else
+		*ap = b->next;
+#endif
+		b->next = NULL;
+		a = a->next = b;
+		COUNT(pool, nreclaims);
+		goto claim;
+	    }
+	    ap = &b->next;
+	}
+	sz = JS_MAX(pool->arenasize, nb);	/* allocate a new arena */
+	sz += sizeof *a + pool->mask;           /* header and alignment slop */
+	b = malloc(sz);
+	if (!b)
+	    return 0;
+	a = a->next = b;
+	a->next = NULL;
+	a->limit = (jsuword)a + sz;
+	JS_COUNT_ARENA(pool,++);
+	COUNT(pool, nmallocs);
+    claim:
+	a->base = a->avail = (jsuword)JS_ARENA_ALIGN(pool, a + 1);
+    }
+    p = (void *)a->avail;
+    a->avail += nb;
+    return p;
+}
+
+IMPLEMENT(void *)
+JS_ArenaGrow(JSArenaPool *pool, void *p, JSUint32 size, JSUint32 incr)
+{
+    void *newp;
+
+    JS_ARENA_ALLOCATE(newp, pool, size + incr);
+    memcpy(newp, p, size);
+    return newp;
+}
+
+/*
+ * Free tail arenas linked after head, which may not be the true list head.
+ * Reset pool->current to point to head in case it pointed at a tail arena.
+ */
+static void
+FreeArenaList(JSArenaPool *pool, JSArena *head, JSBool reallyFree)
+{
+    JSArena **ap, *a;
+#ifdef JS_THREADSAFE
+    JSArena *b;
+#endif
+
+    ap = &head->next;
+    a = *ap;
+    if (!a)
+	return;
+
+#ifdef DEBUG
+    do {
+	JS_ASSERT(a->base <= a->avail && a->avail <= a->limit);
+	a->avail = a->base;
+	JS_CLEAR_UNUSED(a);
+    } while ((a = a->next) != NULL);
+    a = *ap;
+#endif
+
+    if (reallyFree) {
+	do {
+	    *ap = a->next;
+	    JS_CLEAR_ARENA(a);
+	    JS_COUNT_ARENA(pool,--);
+	    free(a);
+	} while ((a = *ap) != NULL);
+    } else {
+	/* Insert the whole arena chain at the front of the freelist. */
+	do {
+	    ap = &(*ap)->next;
+	} while (*ap);
+#ifdef JS_THREADSAFE
+	do {
+	    *ap = b = arena_freelist;
+	} while (!js_CompareAndSwap((jsword*)&arena_freelist,(jsword)b,(jsword)a));
+#else
+	*ap = arena_freelist;
+	arena_freelist = a;
+#endif
+	head->next = NULL;
+    }
+
+    pool->current = head;
+}
+
+IMPLEMENT(void)
+JS_ArenaRelease(JSArenaPool *pool, char *mark)
+{
+    JSArena *a;
+
+    for (a = pool->first.next; a; a = a->next) {
+	if (JS_UPTRDIFF(mark, a) < JS_UPTRDIFF(a->avail, a)) {
+	    a->avail = (jsuword)JS_ARENA_ALIGN(pool, mark);
+	    FreeArenaList(pool, a, JS_TRUE);
+	    return;
+	}
+    }
+}
+
+IMPLEMENT(void)
+JS_FreeArenaPool(JSArenaPool *pool)
+{
+    FreeArenaList(pool, &pool->first, JS_FALSE);
+    COUNT(pool, ndeallocs);
+}
+
+IMPLEMENT(void)
+JS_FinishArenaPool(JSArenaPool *pool)
+{
+    FreeArenaList(pool, &pool->first, JS_TRUE);
+#ifdef JS_ARENAMETER
+    {
+	JSArenaStats *stats, **statsp;
+
+	if (pool->stats.name)
+	    free(pool->stats.name);
+	for (statsp = &arena_stats_list; (stats = *statsp) != 0;
+	     statsp = &stats->next) {
+	    if (stats == &pool->stats) {
+		*statsp = stats->next;
+		return;
+	    }
+	}
+    }
+#endif
+}
+
+IMPLEMENT(void)
+JS_CompactArenaPool(JSArenaPool *pool)
+{
+#if 0 /* XP_MAC */
+    JSArena *a = pool->first.next;
+
+    while (a) {
+        reallocSmaller(a, a->avail - (jsuword)a);
+        a->limit = a->avail;
+        a = a->next;
+    }
+#endif
+}
+
+IMPLEMENT(void)
+JS_ArenaFinish()
+{
+    JSArena *a, *next;
+
+#ifdef JS_THREADSAFE
+    while (arena_freelist) {
+	a = arena_freelist;
+	next = a->next;
+	if (js_CompareAndSwap((jsword*)&arena_freelist,(jsword)a,(jsword)next))
+	    free(a);
+    }
+#else
+    for (a = arena_freelist; a; a = next) {
+        next = a->next;
+        free(a);
+    }
+    arena_freelist = NULL;
+#endif
+}
+
+#ifdef JS_ARENAMETER
+IMPLEMENT(void)
+JS_ArenaCountAllocation(JSArenaPool *pool, JSUint32 nb)
+{
+    pool->stats.nallocs++;
+    pool->stats.nbytes += nb;
+    if (nb > pool->stats.maxalloc)
+        pool->stats.maxalloc = nb;
+    pool->stats.variance += nb * nb;
+}
+
+IMPLEMENT(void)
+JS_ArenaCountInplaceGrowth(JSArenaPool *pool, JSUint32 size, JSUint32 incr)
+{
+    pool->stats.ninplace++;
+}
+
+IMPLEMENT(void)
+JS_ArenaCountGrowth(JSArenaPool *pool, JSUint32 size, JSUint32 incr)
+{
+    pool->stats.ngrows++;
+    pool->stats.nbytes += incr;
+    pool->stats.variance -= size * size;
+    size += incr;
+    if (size > pool->stats.maxalloc)
+        pool->stats.maxalloc = size;
+    pool->stats.variance += size * size;
+}
+
+IMPLEMENT(void)
+JS_ArenaCountRelease(JSArenaPool *pool, char *mark)
+{
+    pool->stats.nreleases++;
+}
+
+IMPLEMENT(void)
+JS_ArenaCountRetract(JSArenaPool *pool, char *mark)
+{
+    pool->stats.nfastrels++;
+}
+
+#include <math.h>
+#include <stdio.h>
+
+IMPLEMENT(void)
+JS_DumpArenaStats(FILE *fp)
+{
+    JSArenaStats *stats;
+    double mean, variance;
+
+    for (stats = arena_stats_list; stats; stats = stats->next) {
+        if (stats->nallocs != 0) {
+	    mean = (double)stats->nbytes / stats->nallocs;
+	    variance = fabs(stats->variance / stats->nallocs - mean * mean);
+	} else {
+	    mean = variance = 0;
+	}
+
+        fprintf(fp, "\n%s allocation statistics:\n", stats->name);
+        fprintf(fp, "              number of arenas: %u\n", stats->narenas);
+        fprintf(fp, "         number of allocations: %u\n", stats->nallocs);
+        fprintf(fp, " number of free arena reclaims: %u\n", stats->nreclaims);
+        fprintf(fp, "        number of malloc calls: %u\n", stats->nmallocs);
+        fprintf(fp, "       number of deallocations: %u\n", stats->ndeallocs);
+        fprintf(fp, "  number of allocation growths: %u\n", stats->ngrows);
+        fprintf(fp, "    number of in-place growths: %u\n", stats->ninplace);
+        fprintf(fp, "number of released allocations: %u\n", stats->nreleases);
+        fprintf(fp, "       number of fast releases: %u\n", stats->nfastrels);
+        fprintf(fp, "         total bytes allocated: %u\n", stats->nbytes);
+        fprintf(fp, "          mean allocation size: %g\n", mean);
+        fprintf(fp, "            standard deviation: %g\n", sqrt(variance));
+        fprintf(fp, "       maximum allocation size: %u\n", stats->maxalloc);
+    }
+}
+#endif /* JS_ARENAMETER */

mozilla/js/src/jsarena.h

@@ -0,0 +1,246 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsarena_h___
+#define jsarena_h___
+/*
+ * Lifetime-based fast allocation, inspired by much prior art, including
+ * "Fast Allocation and Deallocation of Memory Based on Object Lifetimes"
+ * David R. Hanson, Software -- Practice and Experience, Vol. 20(1).
+ *
+ * Also supports LIFO allocation (JS_ARENA_MARK/JS_ARENA_RELEASE).
+ */
+#include <stdlib.h>
+#include <string.h>
+#include "jstypes.h"
+#include "jscompat.h"
+
+JS_BEGIN_EXTERN_C
+
+typedef struct JSArena JSArena;
+typedef struct JSArenaPool JSArenaPool;
+
+struct JSArena {
+    JSArena     *next;          /* next arena for this lifetime */
+    jsuword     base;           /* aligned base address, follows this header */
+    jsuword     limit;          /* one beyond last byte in arena */
+    jsuword     avail;          /* points to next available byte */
+};
+
+#ifdef JS_ARENAMETER
+typedef struct JSArenaStats JSArenaStats;
+
+struct JSArenaStats {
+    JSArenaStats *next;         /* next in arenaStats list */
+    char        *name;          /* name for debugging */
+    uint32      narenas;        /* number of arenas in pool */
+    uint32      nallocs;        /* number of JS_ARENA_ALLOCATE() calls */
+    uint32      nreclaims;      /* number of reclaims from freeArenas */
+    uint32      nmallocs;       /* number of malloc() calls */
+    uint32      ndeallocs;      /* number of lifetime deallocations */
+    uint32      ngrows;         /* number of JS_ARENA_GROW() calls */
+    uint32      ninplace;       /* number of in-place growths */
+    uint32      nreleases;      /* number of JS_ARENA_RELEASE() calls */
+    uint32      nfastrels;      /* number of "fast path" releases */
+    size_t      nbytes;         /* total bytes allocated */
+    size_t      maxalloc;       /* maximum allocation size in bytes */
+    double      variance;       /* size variance accumulator */
+};
+#endif
+
+struct JSArenaPool {
+    JSArena     first;          /* first arena in pool list */
+    JSArena     *current;       /* arena from which to allocate space */
+    size_t      arenasize;      /* net exact size of a new arena */
+    jsuword     mask;           /* alignment mask (power-of-2 - 1) */
+#ifdef JS_ARENAMETER
+    JSArenaStats stats;
+#endif
+};
+
+/*
+ * If the including .c file uses only one power-of-2 alignment, it may define
+ * JS_ARENA_CONST_ALIGN_MASK to the alignment mask and save a few instructions
+ * per ALLOCATE and GROW.
+ */
+#ifdef JS_ARENA_CONST_ALIGN_MASK
+#define JS_ARENA_ALIGN(pool, n)	(((jsuword)(n) + JS_ARENA_CONST_ALIGN_MASK) \
+				 & ~JS_ARENA_CONST_ALIGN_MASK)
+
+#define JS_INIT_ARENA_POOL(pool, name, size) \
+	JS_InitArenaPool(pool, name, size, JS_ARENA_CONST_ALIGN_MASK + 1)
+#else
+#define JS_ARENA_ALIGN(pool, n) (((jsuword)(n) + (pool)->mask) & ~(pool)->mask)
+#endif
+
+#define JS_ARENA_ALLOCATE(p, pool, nb)                                        \
+    JS_BEGIN_MACRO                                                            \
+	JSArena *_a = (pool)->current;                                        \
+	size_t _nb = JS_ARENA_ALIGN(pool, nb);                                \
+	jsuword _p = _a->avail;                                               \
+	jsuword _q = _p + _nb;                                                \
+	if (_q > _a->limit)                                                   \
+	    _p = (jsuword)JS_ArenaAllocate(pool, _nb);                        \
+	else                                                                  \
+	    _a->avail = _q;                                                   \
+	p = (void *)_p;                                                       \
+	JS_ArenaCountAllocation(pool, nb);                                    \
+    JS_END_MACRO
+
+#define JS_ARENA_GROW(p, pool, size, incr)                                    \
+    JS_BEGIN_MACRO                                                            \
+	JSArena *_a = (pool)->current;                                        \
+	size_t _incr = JS_ARENA_ALIGN(pool, incr);                            \
+	jsuword _p = _a->avail;                                               \
+	jsuword _q = _p + _incr;                                              \
+	if (_p == (jsuword)(p) + JS_ARENA_ALIGN(pool, size) &&                \
+	    _q <= _a->limit) {                                                \
+	    _a->avail = _q;                                                   \
+	    JS_ArenaCountInplaceGrowth(pool, size, incr);                     \
+	} else {                                                              \
+	    p = JS_ArenaGrow(pool, p, size, incr);                            \
+	}                                                                     \
+	JS_ArenaCountGrowth(pool, size, incr);                                \
+    JS_END_MACRO
+
+#define JS_ARENA_MARK(pool)     ((void *) (pool)->current->avail)
+#define JS_UPTRDIFF(p,q)	((jsuword)(p) - (jsuword)(q))
+
+#ifdef DEBUG
+#define free_PATTERN         0xDA
+#define JS_CLEAR_UNUSED(a)	(JS_ASSERT((a)->avail <= (a)->limit),         \
+				 memset((void*)(a)->avail, free_PATTERN,   \
+					(a)->limit - (a)->avail))
+#define JS_CLEAR_ARENA(a)       memset((void*)(a), free_PATTERN,           \
+				       (a)->limit - (jsuword)(a))
+#else
+#define JS_CLEAR_UNUSED(a)	/* nothing */
+#define JS_CLEAR_ARENA(a)       /* nothing */
+#endif
+
+#define JS_ARENA_RELEASE(pool, mark)                                          \
+    JS_BEGIN_MACRO                                                            \
+	char *_m = (char *)(mark);                                            \
+	JSArena *_a = (pool)->current;                                        \
+	if (JS_UPTRDIFF(_m, _a) <= JS_UPTRDIFF(_a->avail, _a)) {              \
+	    _a->avail = (jsuword)JS_ARENA_ALIGN(pool, _m);                    \
+	    JS_CLEAR_UNUSED(_a);                                              \
+	    JS_ArenaCountRetract(pool, _m);                                   \
+	} else {                                                              \
+	    JS_ArenaRelease(pool, _m);                                        \
+	}                                                                     \
+	JS_ArenaCountRelease(pool, _m);                                       \
+    JS_END_MACRO
+
+#ifdef JS_ARENAMETER
+#define JS_COUNT_ARENA(pool,op) ((pool)->stats.narenas op)
+#else
+#define JS_COUNT_ARENA(pool,op)
+#endif
+
+#define JS_ARENA_DESTROY(pool, a, pnext)                                      \
+    JS_BEGIN_MACRO                                                            \
+	JS_COUNT_ARENA(pool,--);                                              \
+	if ((pool)->current == (a)) (pool)->current = &(pool)->first;         \
+	*(pnext) = (a)->next;                                                 \
+	JS_CLEAR_ARENA(a);                                                    \
+	free(a);                                                              \
+	(a) = NULL;                                                           \
+    JS_END_MACRO
+
+/*
+ * Initialize an arena pool with the given name for debugging and metering,
+ * with a minimum size per arena of size bytes.
+ */
+EXTERN(void)
+JS_InitArenaPool(JSArenaPool *pool, const char *name, JSUint32 size,
+		 JSUint32 align);
+
+/*
+ * Free the arenas in pool.  The user may continue to allocate from pool
+ * after calling this function.  There is no need to call JS_InitArenaPool()
+ * again unless JS_FinishArenaPool(pool) has been called.
+ */
+EXTERN(void)
+JS_FreeArenaPool(JSArenaPool *pool);
+
+/*
+ * Free the arenas in pool and finish using it altogether.
+ */
+EXTERN(void)
+JS_FinishArenaPool(JSArenaPool *pool);
+
+/*
+ * Compact all of the arenas in a pool so that no space is wasted.
+ */
+EXTERN(void)
+JS_CompactArenaPool(JSArenaPool *pool);
+
+/*
+ * Finish using arenas, freeing all memory associated with them.
+ */
+EXTERN(void)
+JS_ArenaFinish(void);
+
+/*
+ * Friend functions used by the JS_ARENA_*() macros.
+ */
+EXTERN(void *)
+JS_ArenaAllocate(JSArenaPool *pool, JSUint32 nb);
+
+EXTERN(void *)
+JS_ArenaGrow(JSArenaPool *pool, void *p, JSUint32 size, JSUint32 incr);
+
+EXTERN(void)
+JS_ArenaRelease(JSArenaPool *pool, char *mark);
+
+#ifdef JS_ARENAMETER
+
+#include <stdio.h>
+
+EXTERN(void)
+JS_ArenaCountAllocation(JSArenaPool *pool, JSUint32 nb);
+
+EXTERN(void)
+JS_ArenaCountInplaceGrowth(JSArenaPool *pool, JSUint32 size, JSUint32 incr);
+
+EXTERN(void)
+JS_ArenaCountGrowth(JSArenaPool *pool, JSUint32 size, JSUint32incr);
+
+EXTERN(void)
+JS_ArenaCountRelease(JSArenaPool *pool, char *mark);
+
+EXTERN(void)
+JS_ArenaCountRetract(JSArenaPool *pool, char *mark);
+
+EXTERN(void)
+JS_DumpArenaStats(FILE *fp);
+
+#else  /* !JS_ARENAMETER */
+
+#define JS_ArenaCountAllocation(ap, nb)                 /* nothing */
+#define JS_ArenaCountInplaceGrowth(ap, size, incr)      /* nothing */
+#define JS_ArenaCountGrowth(ap, size, incr)             /* nothing */
+#define JS_ArenaCountRelease(ap, mark)                  /* nothing */
+#define JS_ArenaCountRetract(ap, mark)                  /* nothing */
+
+#endif /* !JS_ARENAMETER */
+
+JS_END_EXTERN_C
+
+#endif /* jsarena_h___ */

mozilla/js/src/jsarray.h

@@ -0,0 +1,56 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsarray_h___
+#define jsarray_h___
+/*
+ * JS Array interface.
+ */
+#include "jsprvtd.h"
+#include "jspubtd.h"
+
+JS_BEGIN_EXTERN_C
+
+extern JSClass js_ArrayClass;
+
+extern JSObject *
+js_InitArrayClass(JSContext *cx, JSObject *obj);
+
+extern JSObject *
+js_NewArrayObject(JSContext *cx, jsuint length, jsval *vector);
+
+extern JSBool
+js_GetLengthProperty(JSContext *cx, JSObject *obj, jsuint *lengthp);
+
+extern JSBool
+js_SetLengthProperty(JSContext *cx, JSObject *obj, jsuint length);
+
+extern JSBool
+js_HasLengthProperty(JSContext *cx, JSObject *obj, jsuint *lengthp);
+
+/*
+ * JS-specific qsort function.
+ */
+typedef int (*JSComparator)(const void *a, const void *b, void *arg);
+
+extern JSBool
+js_qsort(void *vec, size_t nel, size_t elsize, JSComparator cmp, void *arg);
+
+JS_END_EXTERN_C
+
+#endif /* jsarray_h___ */

mozilla/js/src/jsatom.c

@@ -0,0 +1,672 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS atom table.
+ */
+#include "jsstddef.h"
+#include <stdlib.h>
+#include <string.h>
+#include "jstypes.h"
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#ifndef NSPR20
+#include "jshash.h"
+#else
+/* Removed by JSIFY: #include "JShash.h"
+ */
+#include "jshash.h" /* Added by JSIFY */
+#endif
+#include "jsprf.h"
+#include "jsapi.h"
+#include "jsatom.h"
+#include "jscntxt.h"
+#include "jsgc.h"
+#include "jslock.h"
+#include "jsnum.h"
+#include "jsopcode.h"
+#include "jsstr.h"
+
+/*
+ * Keep this in sync with jspubtd.h -- an assertion below will insist that
+ * its length match the JSType enum's JSTYPE_LIMIT limit value.
+ */
+char *js_type_str[] = {
+    "undefined",
+    "object",
+    "function",
+    "string",
+    "number",
+    "boolean",
+};
+
+char *js_boolean_str[] = {
+    js_false_str,
+    js_true_str
+};
+
+char   js_Array_str[]             = "Array";
+char   js_Math_str[]              = "Math";
+char   js_Object_str[]            = "Object";
+char   js_anonymous_str[]         = "anonymous";
+char   js_arguments_str[]         = "arguments";
+char   js_arity_str[]             = "arity";
+char   js_assign_str[]            = "assign";
+char   js_callee_str[]            = "callee";
+char   js_caller_str[]            = "caller";
+char   js_class_prototype_str[]   = "prototype";
+char   js_constructor_str[]       = "constructor";
+char   js_count_str[]             = "__count__";
+char   js_eval_str[]              = "eval";
+char   js_index_str[]             = "index";
+char   js_input_str[]             = "input";
+char   js_length_str[]            = "length";
+char   js_name_str[]              = "name";
+char   js_parent_str[]            = "__parent__";
+char   js_proto_str[]             = "__proto__";
+char   js_toSource_str[]          = "toSource";
+char   js_toString_str[]          = "toString";
+char   js_valueOf_str[]           = "valueOf";
+
+#define HASH_OBJECT(o)  ((JSHashNumber)(o) >> JSVAL_TAGBITS)
+#define HASH_INT(i)     ((JSHashNumber)(i))
+#define HASH_DOUBLE(dp) ((JSHashNumber)(((uint32*)(dp))[0] ^ ((uint32*)(dp))[1]))
+#define HASH_BOOLEAN(b) ((JSHashNumber)(b))
+
+STATIC_DLL_CALLBACK(JSHashNumber)
+js_hash_atom_key(const void *key)
+{
+    jsval v;
+    jsdouble *dp;
+
+    /* Order JSVAL_IS_* tests by likelihood of success. */
+    v = (jsval)key;
+    if (JSVAL_IS_STRING(v))
+	return js_HashString(JSVAL_TO_STRING(v));
+    if (JSVAL_IS_INT(v))
+	return HASH_INT(JSVAL_TO_INT(v));
+    if (JSVAL_IS_DOUBLE(v)) {
+	dp = JSVAL_TO_DOUBLE(v);
+	return HASH_DOUBLE(dp);
+    }
+    if (JSVAL_IS_OBJECT(v))
+	return HASH_OBJECT(JSVAL_TO_OBJECT(v));
+    if (JSVAL_IS_BOOLEAN(v))
+	return HASH_BOOLEAN(JSVAL_TO_BOOLEAN(v));
+    return (JSHashNumber)v;
+}
+
+STATIC_DLL_CALLBACK(intN)
+js_compare_atom_keys(const void *k1, const void *k2)
+{
+    jsval v1, v2;
+
+    v1 = (jsval)k1, v2 = (jsval)k2;
+    if (JSVAL_IS_STRING(v1) && JSVAL_IS_STRING(v2))
+	return !js_CompareStrings(JSVAL_TO_STRING(v1), JSVAL_TO_STRING(v2));
+    if (JSVAL_IS_DOUBLE(v1) && JSVAL_IS_DOUBLE(v2)) {
+	double d1 = *JSVAL_TO_DOUBLE(v1);
+	double d2 = *JSVAL_TO_DOUBLE(v2);
+	if (JSDOUBLE_IS_NaN(d1))
+	    return JSDOUBLE_IS_NaN(d2);
+#ifdef XP_PC
+	/* XXX MSVC miscompiles such that (NaN == 0) */
+	if (JSDOUBLE_IS_NaN(d2))
+	    return JS_FALSE;
+#endif
+	return d1 == d2;
+    }
+    return v1 == v2;
+}
+
+STATIC_DLL_CALLBACK(int)
+js_compare_stub(const void *v1, const void *v2)
+{
+    return 1;
+}
+
+STATIC_DLL_CALLBACK(void *)
+js_alloc_atom_space(void *priv, size_t size)
+{
+    return malloc(size);
+}
+
+STATIC_DLL_CALLBACK(void)
+js_free_atom_space(void *priv, void *item)
+{
+    free(item);
+}
+
+STATIC_DLL_CALLBACK(JSHashEntry *)
+js_alloc_atom(void *priv, const void *key)
+{
+    JSAtomState *state = priv;
+    JSAtom *atom;
+
+    atom = malloc(sizeof(JSAtom));
+    if (!atom)
+	return NULL;
+#ifdef JS_THREADSAFE
+    state->tablegen++;
+#endif
+    atom->entry.key = key;
+    atom->entry.value = NULL;
+    atom->flags = 0;
+    atom->kwindex = -1;
+    atom->number = state->number++;
+    return &atom->entry;
+}
+
+STATIC_DLL_CALLBACK(void)
+js_free_atom(void *priv, JSHashEntry *he, uintN flag)
+{
+    if (flag != HT_FREE_ENTRY)
+	return;
+#ifdef JS_THREADSAFE
+    ((JSAtomState *)priv)->tablegen++;
+#endif
+    free(he);
+}
+
+static JSHashAllocOps atom_alloc_ops = {
+    js_alloc_atom_space,    js_free_atom_space,
+    js_alloc_atom,          js_free_atom
+};
+
+#define JS_ATOM_HASH_SIZE   1024
+
+JSBool
+js_InitAtomState(JSContext *cx, JSAtomState *state)
+{
+    uintN i;
+
+    state->runtime = cx->runtime;
+    state->number = 0;
+    state->table = JS_NewHashTable(JS_ATOM_HASH_SIZE, js_hash_atom_key,
+				   js_compare_atom_keys, js_compare_stub,
+				   &atom_alloc_ops, state);
+    if (!state->table) {
+	JS_ReportOutOfMemory(cx);
+	return JS_FALSE;
+    }
+#ifdef JS_THREADSAFE
+    js_NewLock(&state->lock);
+    state->tablegen = 0;
+#endif
+
+#define FROB(lval,str) {                                                      \
+    if (!(state->lval = js_Atomize(cx, str, strlen(str), ATOM_PINNED))) {     \
+	js_FreeAtomState(cx, state);                                          \
+	return JS_FALSE;                                                      \
+    }                                                                         \
+}
+
+    JS_ASSERT(sizeof js_type_str / sizeof js_type_str[0] == JSTYPE_LIMIT);
+    for (i = 0; i < JSTYPE_LIMIT; i++)
+	FROB(typeAtoms[i],        js_type_str[i]);
+
+    FROB(booleanAtoms[0],         js_false_str);
+    FROB(booleanAtoms[1],         js_true_str);
+    FROB(nullAtom,                js_null_str);
+
+    FROB(ArrayAtom,               js_Array_str);
+    FROB(MathAtom,                js_Math_str);
+    FROB(ObjectAtom,              js_Object_str);
+    FROB(anonymousAtom,           js_anonymous_str);
+    FROB(argumentsAtom,           js_arguments_str);
+    FROB(arityAtom,               js_arity_str);
+    FROB(assignAtom,              js_assign_str);
+    FROB(calleeAtom,              js_callee_str);
+    FROB(callerAtom,              js_caller_str);
+    FROB(classPrototypeAtom,      js_class_prototype_str);
+    FROB(constructorAtom,         js_constructor_str);
+    FROB(countAtom,               js_count_str);
+    FROB(indexAtom,               js_index_str);
+    FROB(inputAtom,               js_input_str);
+    FROB(lengthAtom,              js_length_str);
+    FROB(nameAtom,                js_name_str);
+    FROB(parentAtom,              js_parent_str);
+    FROB(protoAtom,               js_proto_str);
+    FROB(toSourceAtom,            js_toSource_str);
+    FROB(toStringAtom,            js_toString_str);
+    FROB(valueOfAtom,             js_valueOf_str);
+
+#undef FROB
+
+    return JS_TRUE;
+}
+
+void
+js_FreeAtomState(JSContext *cx, JSAtomState *state)
+{
+    state->runtime = NULL;
+    JS_HashTableDestroy(state->table);
+    state->table = NULL;
+    state->number = 0;
+#ifdef JS_THREADSAFE
+    js_DestroyLock(&state->lock);
+#endif
+}
+
+typedef struct MarkArgs {
+    JSRuntime       *runtime;
+    JSGCThingMarker mark;
+} MarkArgs;
+
+STATIC_DLL_CALLBACK(intN)
+js_atom_marker(JSHashEntry *he, intN i, void *arg)
+{
+    JSAtom *atom;
+    jsval key;
+    MarkArgs *args;
+
+    atom = (JSAtom *)he;
+    if (atom->flags & ATOM_PINNED) {
+	atom->flags |= ATOM_MARK;
+	key = ATOM_KEY(atom);
+	if (JSVAL_IS_GCTHING(key)) {
+	    args = arg;
+	    args->mark(args->runtime, JSVAL_TO_GCTHING(key));
+	}
+    }
+    return HT_ENUMERATE_NEXT;
+}
+
+void
+js_MarkAtomState(JSAtomState *state, JSGCThingMarker mark)
+{
+    MarkArgs args;
+
+    args.runtime = state->runtime;
+    args.mark = mark;
+    JS_HashTableEnumerateEntries(state->table, js_atom_marker, &args);
+}
+
+STATIC_DLL_CALLBACK(intN)
+js_atom_sweeper(JSHashEntry *he, intN i, void *arg)
+{
+    JSAtom *atom;
+
+    atom = (JSAtom *)he;
+    if (atom->flags & ATOM_MARK) {
+	atom->flags &= ~ATOM_MARK;
+	return HT_ENUMERATE_NEXT;
+    }
+    JS_ASSERT((atom->flags & ATOM_PINNED) == 0);
+    atom->entry.key = NULL;
+    atom->flags = 0;
+    return HT_ENUMERATE_REMOVE;
+}
+
+void
+js_SweepAtomState(JSAtomState *state)
+{
+    JS_HashTableEnumerateEntries(state->table, js_atom_sweeper, NULL);
+}
+
+STATIC_DLL_CALLBACK(intN)
+js_atom_unpinner(JSHashEntry *he, intN i, void *arg)
+{
+    JSAtom *atom;
+
+    atom = (JSAtom *)he;
+    atom->flags &= ~ATOM_PINNED;
+    return HT_ENUMERATE_NEXT;
+}
+
+void
+js_UnpinPinnedAtoms(JSAtomState *state)
+{
+    JS_HashTableEnumerateEntries(state->table, js_atom_unpinner, NULL);
+}
+
+static JSAtom *
+js_AtomizeHashedKey(JSContext *cx, jsval key, JSHashNumber keyHash, uintN flags)
+{
+    JSAtomState *state;
+    JSHashTable *table;
+    JSHashEntry *he, **hep;
+    JSAtom *atom;
+
+    state = &cx->runtime->atomState;
+    JS_LOCK(&state->lock,cx);
+    table = state->table;
+    hep = JS_HashTableRawLookup(table, keyHash, (void *)key);
+    if ((he = *hep) == NULL) {
+	he = JS_HashTableRawAdd(table, hep, keyHash, (void *)key, NULL);
+	if (!he) {
+	    JS_ReportOutOfMemory(cx);
+	    atom = NULL;
+	    goto out;
+	}
+    }
+
+    atom = (JSAtom *)he;
+    atom->flags |= flags;
+out:
+    JS_UNLOCK(&state->lock,cx);
+    return atom;
+}
+
+JSAtom *
+js_AtomizeObject(JSContext *cx, JSObject *obj, uintN flags)
+{
+    jsval key;
+    JSHashNumber keyHash;
+
+    /* XXX must be set in the following order or MSVC1.52 will crash */
+    keyHash = HASH_OBJECT(obj);
+    key = OBJECT_TO_JSVAL(obj);
+    return js_AtomizeHashedKey(cx, key, keyHash, flags);
+}
+
+JSAtom *
+js_AtomizeBoolean(JSContext *cx, JSBool b, uintN flags)
+{
+    jsval key;
+    JSHashNumber keyHash;
+
+    key = BOOLEAN_TO_JSVAL(b);
+    keyHash = HASH_BOOLEAN(b);
+    return js_AtomizeHashedKey(cx, key, keyHash, flags);
+}
+
+JSAtom *
+js_AtomizeInt(JSContext *cx, jsint i, uintN flags)
+{
+    jsval key;
+    JSHashNumber keyHash;
+
+    key = INT_TO_JSVAL(i);
+    keyHash = HASH_INT(i);
+    return js_AtomizeHashedKey(cx, key, keyHash, flags);
+}
+
+JSAtom *
+js_AtomizeDouble(JSContext *cx, jsdouble d, uintN flags)
+{
+    jsdouble *dp;
+    JSHashNumber keyHash;
+    jsval key;
+    JSAtomState *state;
+    JSHashTable *table;
+    JSHashEntry *he, **hep;
+    JSAtom *atom;
+
+#if JS_ALIGN_OF_DOUBLE == 8
+    dp = &d;
+#else
+    char alignbuf[16];
+
+    dp = (jsdouble *)&alignbuf[8 - ((jsuword)&alignbuf & 7)];
+    *dp = d;
+#endif
+
+    keyHash = HASH_DOUBLE(dp);
+    key = DOUBLE_TO_JSVAL(dp);
+    state = &cx->runtime->atomState;
+    JS_LOCK(&state->lock,cx);
+    table = state->table;
+    hep = JS_HashTableRawLookup(table, keyHash, (void *)key);
+    if ((he = *hep) == NULL) {
+#ifdef JS_THREADSAFE
+	uint32 gen = state->tablegen;
+#endif
+	JS_UNLOCK(&state->lock,cx);
+	if (!js_NewDoubleValue(cx, d, &key))
+	    return NULL;
+	JS_LOCK(&state->lock,cx);
+#ifdef JS_THREADSAFE
+	if (state->tablegen != gen) {
+	    hep = JS_HashTableRawLookup(table, keyHash, (void *)key);
+	    if ((he = *hep) != NULL) {
+		atom = (JSAtom *)he;
+		goto out;
+	    }
+	}
+#endif
+	he = JS_HashTableRawAdd(table, hep, keyHash, (void *)key, NULL);
+	if (!he) {
+	    JS_ReportOutOfMemory(cx);
+	    atom = NULL;
+	    goto out;
+	}
+    }
+
+    atom = (JSAtom *)he;
+    atom->flags |= flags;
+out:
+    JS_UNLOCK(&state->lock,cx);
+    return atom;
+}
+
+JSAtom *
+js_AtomizeString(JSContext *cx, JSString *str, uintN flags)
+{
+    JSHashNumber keyHash;
+    jsval key;
+    JSAtomState *state;
+    JSHashTable *table;
+    JSHashEntry *he, **hep;
+    JSAtom *atom;
+
+    keyHash = js_HashString(str);
+    key = STRING_TO_JSVAL(str);
+    state = &cx->runtime->atomState;
+    JS_LOCK(&state->lock,cx);
+    table = state->table;
+    hep = JS_HashTableRawLookup(table, keyHash, (void *)key);
+    if ((he = *hep) == NULL) {
+	if (flags & ATOM_TMPSTR) {
+#ifdef JS_THREADSAFE
+	    uint32 gen = state->tablegen;
+#endif
+	    JS_UNLOCK(&state->lock,cx);
+	    flags &= ~ATOM_TMPSTR;
+	    if (flags & ATOM_NOCOPY) {
+		flags &= ~ATOM_NOCOPY;
+		str = js_NewString(cx, str->chars, str->length, 0);
+	    } else {
+		str = js_NewStringCopyN(cx, str->chars, str->length, 0);
+	    }
+	    if (!str)
+		return NULL;
+	    key = STRING_TO_JSVAL(str);
+	    JS_LOCK(&state->lock,cx);
+#ifdef JS_THREADSAFE
+	    if (state->tablegen != gen) {
+		hep = JS_HashTableRawLookup(table, keyHash, (void *)key);
+		if ((he = *hep) != NULL) {
+		    atom = (JSAtom *)he;
+		    goto out;
+		}
+	    }
+#endif
+	}
+	he = JS_HashTableRawAdd(table, hep, keyHash, (void *)key, NULL);
+	if (!he) {
+	    JS_ReportOutOfMemory(cx);
+	    atom = NULL;
+	    goto out;
+	}
+    }
+
+    atom = (JSAtom *)he;
+    atom->flags |= flags;
+out:
+    JS_UNLOCK(&state->lock,cx);
+    return atom;
+}
+
+JS_FRIEND_API(JSAtom *)
+js_Atomize(JSContext *cx, const char *bytes, size_t length, uintN flags)
+{
+    jschar *chars;
+    JSString *str;
+    JSAtom *atom;
+#if JS_ALIGN_OF_DOUBLE == 8
+    union { jsdouble d; JSString s; } u;
+
+    str = &u.s;
+#else
+    char alignbuf[16];
+
+    str = (JSString *)&alignbuf[8 - ((jsuword)&alignbuf & 7)];
+#endif
+
+    chars = js_InflateString(cx, bytes, length);
+    if (!chars)
+	return NULL;
+    str->chars = chars;
+    str->length = length;
+    atom = js_AtomizeString(cx, str, ATOM_TMPSTR | ATOM_NOCOPY | flags);
+    if (!atom || ATOM_TO_STRING(atom)->chars != chars)
+	JS_free(cx, chars);
+    return atom;
+}
+
+JS_FRIEND_API(JSAtom *)
+js_AtomizeChars(JSContext *cx, const jschar *chars, size_t length, uintN flags)
+{
+    JSString *str;
+#if JS_ALIGN_OF_DOUBLE == 8
+    union { jsdouble d; JSString s; } u;
+
+    str = &u.s;
+#else
+    char alignbuf[16];
+
+    str = (JSString *)&alignbuf[8 - ((jsuword)&alignbuf & 7)];
+#endif
+
+    str->chars = (jschar *)chars;
+    str->length = length;
+    return js_AtomizeString(cx, str, ATOM_TMPSTR | flags);
+}
+
+JSAtom *
+js_AtomizeValue(JSContext *cx, jsval value, uintN flags)
+{
+    if (JSVAL_IS_STRING(value))
+	return js_AtomizeString(cx, JSVAL_TO_STRING(value), flags);
+    if (JSVAL_IS_INT(value))
+	return js_AtomizeInt(cx, JSVAL_TO_INT(value), flags);
+    if (JSVAL_IS_DOUBLE(value))
+	return js_AtomizeDouble(cx, *JSVAL_TO_DOUBLE(value), flags);
+    if (JSVAL_IS_OBJECT(value))
+	return js_AtomizeObject(cx, JSVAL_TO_OBJECT(value), flags);
+    if (JSVAL_IS_BOOLEAN(value))
+	return js_AtomizeBoolean(cx, JSVAL_TO_BOOLEAN(value), flags);
+    return js_AtomizeHashedKey(cx, value, (JSHashNumber)value, flags);
+}
+
+JSAtom *
+js_ValueToStringAtom(JSContext *cx, jsval v)
+{
+    JSString *str;
+
+    str = js_ValueToString(cx, v);
+    if (!str)
+	return NULL;
+    return js_AtomizeString(cx, str, 0);
+}
+
+JSAtomListElement *
+js_IndexAtom(JSContext *cx, JSAtom *atom, JSAtomList *al)
+{
+    JSAtomListElement *ale;
+
+    ATOM_LIST_SEARCH(ale, al, atom);
+    if (!ale) {
+	JS_ARENA_ALLOCATE(ale, &cx->tempPool, sizeof(JSAtomListElement));
+	if (!ale) {
+	    JS_ReportOutOfMemory(cx);
+	    return NULL;
+	}
+	ale->atom = atom;
+	ale->index = (jsatomid) al->count++;
+	ale->next = al->list;
+	al->list = ale;
+    }
+    return ale;
+}
+
+JS_FRIEND_API(JSAtom *)
+js_GetAtom(JSContext *cx, JSAtomMap *map, jsatomid i)
+{
+    JSAtom *atom;
+
+    JS_ASSERT(map->vector && i < map->length);
+    if (!map->vector || i >= map->length) {
+	char numBuf[12];
+	JS_snprintf(numBuf, sizeof numBuf, "%lu", (unsigned long)i);
+	JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
+			     JSMSG_BAD_ATOMIC_NUMBER, numBuf);
+	return NULL;
+    }
+    atom = map->vector[i];
+    JS_ASSERT(atom);
+    return atom;
+}
+
+JS_FRIEND_API(JSBool)
+js_InitAtomMap(JSContext *cx, JSAtomMap *map, JSAtomList *al)
+{
+    JSAtom **vector;
+    JSAtomListElement *ale, *next;
+    uint32 count;
+
+    ale = al->list;
+    if (!ale) {
+	map->vector = NULL;
+	map->length = 0;
+	return JS_TRUE;
+    }
+
+    count = al->count;
+    if (count >= ATOM_INDEX_LIMIT) {
+	JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL,
+			     JSMSG_TOO_MANY_LITERALS);
+	return JS_FALSE;
+    }
+    vector = JS_malloc(cx, (size_t) count * sizeof *vector);
+    if (!vector)
+	return JS_FALSE;
+
+    do {
+	vector[ale->index] = ale->atom;
+	next = ale->next;
+	ale->next = NULL;
+    } while ((ale = next) != NULL);
+    al->list = NULL;
+    al->count = 0;
+
+    map->vector = vector;
+    map->length = (jsatomid)count;
+    return JS_TRUE;
+}
+
+JS_FRIEND_API(void)
+js_FreeAtomMap(JSContext *cx, JSAtomMap *map)
+{
+    if (map->vector) {
+	free(map->vector);
+	map->vector = NULL;
+    }
+    map->length = 0;
+}

mozilla/js/src/jsatom.h

@@ -0,0 +1,278 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsatom_h___
+#define jsatom_h___
+/*
+ * JS atom table.
+ */
+#include <stddef.h>
+#include "jstypes.h"
+#ifndef NSPR20
+#include "jshash.h"
+#else
+/* Removed by JSIFY: #include "JShash.h"
+ */
+#include "jshash.h" /* Added by JSIFY */
+#endif
+#include "jsapi.h"
+#include "jsprvtd.h"
+#include "jspubtd.h"
+
+#ifdef JS_THREADSAFE
+#include "jslock.h"
+#endif
+
+JS_BEGIN_EXTERN_C
+
+#define ATOM_NOCOPY     0x01            /* don't copy atom string bytes */
+#define ATOM_TMPSTR     0x02            /* internal, to avoid extra string */
+#define ATOM_MARK       0x04            /* atom is reachable via GC */
+#define ATOM_PINNED     0x08            /* atom is pinned against GC */
+
+struct JSAtom {
+    JSHashEntry         entry;          /* key is jsval, value keyword info */
+    uint8               flags;          /* flags, PINNED and/or MARK for now */
+    int8                kwindex;        /* keyword index, -1 if not keyword */
+    jsatomid            number;         /* atom serial number and hash code */
+};
+
+#define ATOM_KEY(atom)           ((jsval)(atom)->entry.key)
+#define ATOM_IS_OBJECT(atom)     JSVAL_IS_OBJECT(ATOM_KEY(atom))
+#define ATOM_TO_OBJECT(atom)     JSVAL_TO_OBJECT(ATOM_KEY(atom))
+#define ATOM_IS_INT(atom)        JSVAL_IS_INT(ATOM_KEY(atom))
+#define ATOM_TO_INT(atom)        JSVAL_TO_INT(ATOM_KEY(atom))
+#define ATOM_IS_DOUBLE(atom)     JSVAL_IS_DOUBLE(ATOM_KEY(atom))
+#define ATOM_TO_DOUBLE(atom)     JSVAL_TO_DOUBLE(ATOM_KEY(atom))
+#define ATOM_IS_STRING(atom)     JSVAL_IS_STRING(ATOM_KEY(atom))
+#define ATOM_TO_STRING(atom)     JSVAL_TO_STRING(ATOM_KEY(atom))
+#define ATOM_IS_BOOLEAN(atom)    JSVAL_IS_BOOLEAN(ATOM_KEY(atom))
+#define ATOM_TO_BOOLEAN(atom)    JSVAL_TO_BOOLEAN(ATOM_KEY(atom))
+#define ATOM_BYTES(atom)         JS_GetStringBytes(ATOM_TO_STRING(atom))
+
+struct JSAtomListElement {
+    JSAtomListElement   *next;
+    jsatomid            index;          /* index in script-specific atom map */
+    JSAtom		*atom;
+};
+
+struct JSAtomList {
+    JSAtomListElement   *list;          /* literals indexed for mapping */
+    jsuint              count;          /* count of indexed literals */
+};
+
+#define ATOM_LIST_INIT(al)  ((al)->list = NULL, (al)->count = 0)
+
+#define ATOM_LIST_SEARCH(_ale,_al,_atom)                                      \
+    JS_BEGIN_MACRO                                                            \
+	JSAtomListElement **_alep = &(_al)->list;                             \
+	while ((_ale = *_alep) != NULL) {                                     \
+	    if (_ale->atom == (_atom)) {                                      \
+		/* Hit, move atom's element to the front of the list. */      \
+		*_alep = _ale->next;                                          \
+		_ale->next = (_al)->list;                                     \
+		(_al)->list = _ale;                                           \
+		break;                                                        \
+	    }                                                                 \
+	    _alep = &_ale->next;                                              \
+	}                                                                     \
+    JS_END_MACRO
+
+struct JSAtomMap {
+    JSAtom              **vector;       /* array of ptrs to indexed atoms */
+    jsatomid            length;         /* count of (to-be-)indexed atoms */
+};
+
+struct JSAtomState {
+    JSRuntime           *runtime;       /* runtime that owns us */
+    JSHashTable         *table;         /* hash table containing all atoms */
+    jsatomid            number;         /* one beyond greatest atom number */
+
+    /* Type names and value literals. */
+    JSAtom              *typeAtoms[JSTYPE_LIMIT];
+    JSAtom              *booleanAtoms[2];
+    JSAtom              *nullAtom;
+
+    /* Various built-in or commonly-used atoms. */
+    JSAtom              *ArrayAtom;
+    JSAtom              *MathAtom;
+    JSAtom              *ObjectAtom;
+    JSAtom              *anonymousAtom;
+    JSAtom              *argumentsAtom;
+    JSAtom              *arityAtom;
+    JSAtom              *assignAtom;
+    JSAtom              *calleeAtom;
+    JSAtom              *callerAtom;
+    JSAtom              *classPrototypeAtom;
+    JSAtom              *constructorAtom;
+    JSAtom              *countAtom;
+    JSAtom              *indexAtom;
+    JSAtom              *inputAtom;
+    JSAtom              *lengthAtom;
+    JSAtom              *nameAtom;
+    JSAtom              *parentAtom;
+    JSAtom              *protoAtom;
+    JSAtom              *toSourceAtom;
+    JSAtom              *toStringAtom;
+    JSAtom              *valueOfAtom;
+
+#ifdef JS_THREADSAFE
+    JSThinLock          lock;
+    volatile uint32     tablegen;
+#endif
+};
+
+/* Well-known predefined strings and their atoms. */
+extern char   *js_type_str[];
+extern char   *js_boolean_str[];
+
+extern char   js_Array_str[];
+extern char   js_Math_str[];
+extern char   js_Object_str[];
+extern char   js_anonymous_str[];
+extern char   js_arguments_str[];
+extern char   js_arity_str[];
+extern char   js_assign_str[];
+extern char   js_callee_str[];
+extern char   js_caller_str[];
+extern char   js_class_prototype_str[];
+extern char   js_constructor_str[];
+extern char   js_count_str[];
+extern char   js_eval_str[];
+extern char   js_index_str[];
+extern char   js_input_str[];
+extern char   js_length_str[];
+extern char   js_name_str[];
+extern char   js_parent_str[];
+extern char   js_proto_str[];
+extern char   js_toSource_str[];
+extern char   js_toString_str[];
+extern char   js_valueOf_str[];
+
+/*
+ * Initialize atom state.  Return true on success, false with an out of
+ * memory error report on failure.
+ */
+extern JSBool
+js_InitAtomState(JSContext *cx, JSAtomState *state);
+
+/*
+ * Free and clear atom state.
+ */
+extern void
+js_FreeAtomState(JSContext *cx, JSAtomState *state);
+
+/*
+ * Atom garbage collection hooks.
+ */
+typedef void
+(*JSGCThingMarker)(JSRuntime *rt, void *thing);
+
+extern void
+js_MarkAtomState(JSAtomState *state, JSGCThingMarker mark);
+
+extern void
+js_SweepAtomState(JSAtomState *state);
+
+extern void
+js_UnpinPinnedAtoms(JSAtomState *state);
+
+/*
+ * Find or create the atom for an object.  If we create a new atom, give it the
+ * type indicated in flags.  Return 0 on failure to allocate memory.
+ */
+extern JSAtom *
+js_AtomizeObject(JSContext *cx, JSObject *obj, uintN flags);
+
+/*
+ * Find or create the atom for a Boolean value.  If we create a new atom, give
+ * it the type indicated in flags.  Return 0 on failure to allocate memory.
+ */
+extern JSAtom *
+js_AtomizeBoolean(JSContext *cx, JSBool b, uintN flags);
+
+/*
+ * Find or create the atom for an integer value.  If we create a new atom, give
+ * it the type indicated in flags.  Return 0 on failure to allocate memory.
+ */
+extern JSAtom *
+js_AtomizeInt(JSContext *cx, jsint i, uintN flags);
+
+/*
+ * Find or create the atom for a double value.  If we create a new atom, give
+ * it the type indicated in flags.  Return 0 on failure to allocate memory.
+ */
+extern JSAtom *
+js_AtomizeDouble(JSContext *cx, jsdouble d, uintN flags);
+
+/*
+ * Find or create the atom for a string.  If we create a new atom, give it the
+ * type indicated in flags.  Return 0 on failure to allocate memory.
+ */
+extern JSAtom *
+js_AtomizeString(JSContext *cx, JSString *str, uintN flags);
+
+extern JS_FRIEND_API(JSAtom *)
+js_Atomize(JSContext *cx, const char *bytes, size_t length, uintN flags);
+
+extern JS_FRIEND_API(JSAtom *)
+js_AtomizeChars(JSContext *cx, const jschar *chars, size_t length, uintN flags);
+
+/*
+ * This variant handles all value tag types.
+ */
+extern JSAtom *
+js_AtomizeValue(JSContext *cx, jsval value, uintN flags);
+
+/*
+ * Convert v to an atomized string.
+ */
+extern JSAtom *
+js_ValueToStringAtom(JSContext *cx, jsval v);
+
+/*
+ * Assign atom an index and insert it on al.
+ */
+extern JSAtomListElement *
+js_IndexAtom(JSContext *cx, JSAtom *atom, JSAtomList *al);
+
+/*
+ * Get the atom with index i from map.
+ */
+extern JS_FRIEND_API(JSAtom *)
+js_GetAtom(JSContext *cx, JSAtomMap *map, jsatomid i);
+
+/*
+ * For all unmapped atoms recorded in al, add a mapping from the atom's index
+ * to its address.  The GC must not run until all indexed atoms in atomLists
+ * have been mapped by scripts connected to live objects (Function and Script
+ * class objects have scripts as/in their private data -- the GC knows about
+ * these two classes).
+ */
+extern JS_FRIEND_API(JSBool)
+js_InitAtomMap(JSContext *cx, JSAtomMap *map, JSAtomList *al);
+
+/*
+ * Free map->vector and clear map.
+ */
+extern JS_FRIEND_API(void)
+js_FreeAtomMap(JSContext *cx, JSAtomMap *map);
+
+JS_END_EXTERN_C
+
+#endif /* jsatom_h___ */

mozilla/js/src/jsbit.h

@@ -0,0 +1,92 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
+/*
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ * 
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ * 
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsbit_h___
+#define jsbit_h___
+
+#include "jstypes.h"
+JS_BEGIN_EXTERN_C
+
+/*
+** A jsbitmap_t is a long integer that can be used for bitmaps
+*/
+typedef unsigned long jsbitmap_t;
+
+#define JS_TEST_BIT(_map,_bit) \
+    ((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] & (1L << ((_bit) & (JS_BITS_PER_LONG-1))))
+#define JS_SET_BIT(_map,_bit) \
+    ((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] |= (1L << ((_bit) & (JS_BITS_PER_LONG-1))))
+#define JS_CLEAR_BIT(_map,_bit) \
+    ((_map)[(_bit)>>JS_BITS_PER_LONG_LOG2] &= ~(1L << ((_bit) & (JS_BITS_PER_LONG-1))))
+
+/*
+** Compute the log of the least power of 2 greater than or equal to n
+*/
+EXTERN(JSIntn) JS_CeilingLog2(JSUint32 i); 
+
+/*
+** Compute the log of the greatest power of 2 less than or equal to n
+*/
+EXTERN(JSIntn) JS_FloorLog2(JSUint32 i); 
+
+/*
+** Macro version of JS_CeilingLog2: Compute the log of the least power of
+** 2 greater than or equal to _n. The result is returned in _log2.
+*/
+#define JS_CEILING_LOG2(_log2,_n)   \
+  JS_BEGIN_MACRO                    \
+    JSUint32 j_ = (JSUint32)(_n); 	\
+    (_log2) = 0;                    \
+    if ((j_) & ((j_)-1))            \
+	(_log2) += 1;               \
+    if ((j_) >> 16)                 \
+	(_log2) += 16, (j_) >>= 16; \
+    if ((j_) >> 8)                  \
+	(_log2) += 8, (j_) >>= 8;   \
+    if ((j_) >> 4)                  \
+	(_log2) += 4, (j_) >>= 4;   \
+    if ((j_) >> 2)                  \
+	(_log2) += 2, (j_) >>= 2;   \
+    if ((j_) >> 1)                  \
+	(_log2) += 1;               \
+  JS_END_MACRO
+
+/*
+** Macro version of JS_FloorLog2: Compute the log of the greatest power of
+** 2 less than or equal to _n. The result is returned in _log2.
+**
+** This is equivalent to finding the highest set bit in the word.
+*/
+#define JS_FLOOR_LOG2(_log2,_n)   \
+  JS_BEGIN_MACRO                    \
+    JSUint32 j_ = (JSUint32)(_n); 	\
+    (_log2) = 0;                    \
+    if ((j_) >> 16)                 \
+	(_log2) += 16, (j_) >>= 16; \
+    if ((j_) >> 8)                  \
+	(_log2) += 8, (j_) >>= 8;   \
+    if ((j_) >> 4)                  \
+	(_log2) += 4, (j_) >>= 4;   \
+    if ((j_) >> 2)                  \
+	(_log2) += 2, (j_) >>= 2;   \
+    if ((j_) >> 1)                  \
+	(_log2) += 1;               \
+  JS_END_MACRO
+
+JS_END_EXTERN_C
+#endif /* jsbit_h___ */

mozilla/js/src/jsbool.c

@@ -0,0 +1,211 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS boolean implementation.
+ */
+#include "jsstddef.h"
+#include "jstypes.h"
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#include "jsapi.h"
+#include "jsatom.h"
+#include "jsbool.h"
+#include "jscntxt.h"
+#include "jsconfig.h"
+#include "jsinterp.h"
+#include "jslock.h"
+#include "jsnum.h"
+#include "jsobj.h"
+#include "jsstr.h"
+
+static JSClass boolean_class = {
+    "Boolean",
+    JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+    JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   JS_FinalizeStub
+};
+
+#if JS_HAS_TOSOURCE
+#include "jsprf.h"
+
+static JSBool
+bool_toSource(JSContext *cx, JSObject *obj, uintN argc, jsval *argv,
+	      jsval *rval)
+{
+    jsval v;
+    char buf[32];
+    JSString *str;
+
+    if (!JS_InstanceOf(cx, obj, &boolean_class, argv))
+	return JS_FALSE;
+    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
+    if (!JSVAL_IS_BOOLEAN(v))
+	return js_obj_toSource(cx, obj, argc, argv, rval);
+    JS_snprintf(buf, sizeof buf, "(new %s(%s))",
+		boolean_class.name,
+		js_boolean_str[JSVAL_TO_BOOLEAN(v) ? 1 : 0]);
+    str = JS_NewStringCopyZ(cx, buf);
+    if (!str)
+	return JS_FALSE;
+    *rval = STRING_TO_JSVAL(str);
+    return JS_TRUE;
+}
+#endif
+
+static JSBool
+bool_toString(JSContext *cx, JSObject *obj, uintN argc, jsval *argv,
+	      jsval *rval)
+{
+    jsval v;
+    JSAtom *atom;
+    JSString *str;
+
+    if (!JS_InstanceOf(cx, obj, &boolean_class, argv))
+	return JS_FALSE;
+    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
+    if (!JSVAL_IS_BOOLEAN(v))
+	return js_obj_toString(cx, obj, argc, argv, rval);
+    atom = cx->runtime->atomState.booleanAtoms[JSVAL_TO_BOOLEAN(v) ? 1 : 0];
+    str = ATOM_TO_STRING(atom);
+    if (!str)
+	return JS_FALSE;
+    *rval = STRING_TO_JSVAL(str);
+    return JS_TRUE;
+}
+
+static JSBool
+bool_valueOf(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
+{
+    if (!JS_InstanceOf(cx, obj, &boolean_class, argv))
+	return JS_FALSE;
+    *rval = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
+    return JS_TRUE;
+}
+
+static JSFunctionSpec boolean_methods[] = {
+#if JS_HAS_TOSOURCE
+    {js_toSource_str,   bool_toSource,          0},
+#endif
+    {js_toString_str,	bool_toString,		0},
+    {js_valueOf_str,	bool_valueOf,		0},
+    {0}
+};
+
+#ifdef XP_MAC
+#undef Boolean
+#define Boolean js_Boolean
+#endif
+
+static JSBool
+Boolean(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
+{
+    JSBool b;
+    jsval bval;
+
+    if (argc != 0) {
+	if (!js_ValueToBoolean(cx, argv[0], &b))
+	    return JS_FALSE;
+	bval = BOOLEAN_TO_JSVAL(b);
+    } else {
+	bval = JSVAL_FALSE;
+    }
+    if (!cx->fp->constructing) {
+	*rval = bval;
+	return JS_TRUE;
+    }
+    OBJ_SET_SLOT(cx, obj, JSSLOT_PRIVATE, bval);
+    return JS_TRUE;
+}
+
+JSObject *
+js_InitBooleanClass(JSContext *cx, JSObject *obj)
+{
+    JSObject *proto;
+
+    proto = JS_InitClass(cx, obj, NULL, &boolean_class, Boolean, 1,
+			NULL, boolean_methods, NULL, NULL);
+    if (!proto)
+	return NULL;
+    OBJ_SET_SLOT(cx, proto, JSSLOT_PRIVATE, JSVAL_FALSE);
+    return proto;
+}
+
+JSObject *
+js_BooleanToObject(JSContext *cx, JSBool b)
+{
+    JSObject *obj;
+
+    obj = js_NewObject(cx, &boolean_class, NULL, NULL);
+    if (!obj)
+	return NULL;
+    OBJ_SET_SLOT(cx, obj, JSSLOT_PRIVATE, BOOLEAN_TO_JSVAL(b));
+    return obj;
+}
+
+JSString *
+js_BooleanToString(JSContext *cx, JSBool b)
+{
+    return ATOM_TO_STRING(cx->runtime->atomState.booleanAtoms[b ? 1 : 0]);
+}
+
+JSBool
+js_ValueToBoolean(JSContext *cx, jsval v, JSBool *bp)
+{
+    JSBool b;
+    jsdouble d;
+
+#if defined XP_PC && defined _MSC_VER &&_MSC_VER <= 800
+    /* MSVC1.5 coredumps */
+    if (!bp)
+	return JS_TRUE;
+#endif
+
+    /* XXX this should be an if-else chain, but MSVC1.5 crashes if it is. */
+    if (JSVAL_IS_NULL(v) || JSVAL_IS_VOID(v)) {
+	/* Must return early to avoid falling thru to JSVAL_IS_OBJECT case. */
+	*bp = JS_FALSE;
+	return JS_TRUE;
+    }
+    if (JSVAL_IS_OBJECT(v)) {
+	if (!JSVERSION_IS_ECMA(cx->version)) {
+	    if (!OBJ_DEFAULT_VALUE(cx, JSVAL_TO_OBJECT(v), JSTYPE_BOOLEAN, &v))
+		return JS_FALSE;
+	    if (!JSVAL_IS_BOOLEAN(v))
+		v = JSVAL_TRUE;		/* non-null object is true */
+	    b = JSVAL_TO_BOOLEAN(v);
+	} else {
+	    b = JS_TRUE;
+	}
+    }
+    if (JSVAL_IS_STRING(v)) {
+	b = JSVAL_TO_STRING(v)->length ? JS_TRUE : JS_FALSE;
+    }
+    if (JSVAL_IS_INT(v)) {
+	b = JSVAL_TO_INT(v) ? JS_TRUE : JS_FALSE;
+    }
+    if (JSVAL_IS_DOUBLE(v)) {
+	d = *JSVAL_TO_DOUBLE(v);
+	b = (!JSDOUBLE_IS_NaN(d) && d != 0) ? JS_TRUE : JS_FALSE;
+    }
+    if (JSVAL_IS_BOOLEAN(v)) {
+	b = JSVAL_TO_BOOLEAN(v);
+    }
+    *bp = b;
+    return JS_TRUE;
+}

mozilla/js/src/jsbool.h

@@ -0,0 +1,41 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsbool_h___
+#define jsbool_h___
+/*
+ * JS boolean interface.
+ */
+
+JS_BEGIN_EXTERN_C
+
+extern JSObject *
+js_InitBooleanClass(JSContext *cx, JSObject *obj);
+
+extern JSObject *
+js_BooleanToObject(JSContext *cx, JSBool b);
+
+extern JSString *
+js_BooleanToString(JSContext *cx, JSBool b);
+
+extern JSBool
+js_ValueToBoolean(JSContext *cx, jsval v, JSBool *bp);
+
+JS_END_EXTERN_C
+
+#endif /* jsbool_h___ */

mozilla/js/src/jsclist.h

@@ -0,0 +1,121 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
+/*
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ * 
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ * 
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsclist_h___
+#define jsclist_h___
+
+#include "jstypes.h"
+
+typedef struct JSCListStr JSCList;
+
+/*
+** Circular linked list
+*/
+struct JSCListStr {
+    JSCList	*next;
+    JSCList	*prev;
+};
+
+/*
+** Insert element "_e" into the list, before "_l".
+*/
+#define JS_INSERT_BEFORE(_e,_l)	 \
+    JS_BEGIN_MACRO		 \
+	(_e)->next = (_l);	 \
+	(_e)->prev = (_l)->prev; \
+	(_l)->prev->next = (_e); \
+	(_l)->prev = (_e);	 \
+    JS_END_MACRO
+
+/*
+** Insert element "_e" into the list, after "_l".
+*/
+#define JS_INSERT_AFTER(_e,_l)	 \
+    JS_BEGIN_MACRO		 \
+	(_e)->next = (_l)->next; \
+	(_e)->prev = (_l);	 \
+	(_l)->next->prev = (_e); \
+	(_l)->next = (_e);	 \
+    JS_END_MACRO
+
+/*
+** Return the element following element "_e"
+*/
+#define JS_NEXT_LINK(_e)	 \
+    	((_e)->next)
+/*
+** Return the element preceding element "_e"
+*/
+#define JS_PREV_LINK(_e)	 \
+    	((_e)->prev)
+
+/*
+** Append an element "_e" to the end of the list "_l"
+*/
+#define JS_APPEND_LINK(_e,_l) JS_INSERT_BEFORE(_e,_l)
+
+/*
+** Insert an element "_e" at the head of the list "_l"
+*/
+#define JS_INSERT_LINK(_e,_l) JS_INSERT_AFTER(_e,_l)
+
+/* Return the head/tail of the list */
+#define JS_LIST_HEAD(_l) (_l)->next
+#define JS_LIST_TAIL(_l) (_l)->prev
+
+/*
+** Remove the element "_e" from it's circular list.
+*/
+#define JS_REMOVE_LINK(_e)	       \
+    JS_BEGIN_MACRO		       \
+	(_e)->prev->next = (_e)->next; \
+	(_e)->next->prev = (_e)->prev; \
+    JS_END_MACRO
+
+/*
+** Remove the element "_e" from it's circular list. Also initializes the
+** linkage.
+*/
+#define JS_REMOVE_AND_INIT_LINK(_e)    \
+    JS_BEGIN_MACRO		       \
+	(_e)->prev->next = (_e)->next; \
+	(_e)->next->prev = (_e)->prev; \
+	(_e)->next = (_e);	       \
+	(_e)->prev = (_e);	       \
+    JS_END_MACRO
+
+/*
+** Return non-zero if the given circular list "_l" is empty, zero if the
+** circular list is not empty
+*/
+#define JS_CLIST_IS_EMPTY(_l) \
+    ((_l)->next == (_l))
+
+/*
+** Initialize a circular list
+*/
+#define JS_INIT_CLIST(_l)  \
+    JS_BEGIN_MACRO	   \
+	(_l)->next = (_l); \
+	(_l)->prev = (_l); \
+    JS_END_MACRO
+
+#define JS_INIT_STATIC_CLIST(_l) \
+    {(_l), (_l)}
+
+#endif /* jsclist_h___ */

mozilla/js/src/jscntxt.c

@@ -0,0 +1,400 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS execution context.
+ */
+#include "jsstddef.h"
+#include <stdarg.h>
+#include <stdlib.h>
+#include <string.h>
+#include "jstypes.h"
+#ifndef NSPR20
+#include "jsarena.h"
+#else
+/* Removed by JSIFY: #include "plarena.h"
+ */
+#include "jsarena.h" /* Added by JSIFY */
+#endif
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#include "jsclist.h"
+#include "jsprf.h"
+#include "jsatom.h"
+#include "jscntxt.h"
+#include "jsconfig.h"
+#include "jsdbgapi.h"
+#include "jsexn.h"
+#include "jsgc.h"
+#include "jslock.h"
+#include "jsobj.h"
+#include "jsopcode.h"
+#include "jsscan.h"
+#include "jsscript.h"
+
+JSContext *
+js_NewContext(JSRuntime *rt, size_t stacksize)
+{
+    JSContext *cx;
+
+    cx = malloc(sizeof *cx);
+    if (!cx)
+	return NULL;
+    memset(cx, 0, sizeof *cx);
+
+    cx->runtime = rt;
+#ifdef JS_THREADSAFE
+    js_InitContextForLocking(cx);
+#endif
+    if (rt->contextList.next == (JSCList *)&rt->contextList) {
+	/* First context on this runtime: initialize atoms and keywords. */
+	if (!js_InitAtomState(cx, &rt->atomState) ||
+	    !js_InitScanner(cx)) {
+	    free(cx);
+	    return NULL;
+	}
+    }
+    /* Atomicly append cx to rt's context list. */
+    JS_LOCK_RUNTIME_VOID(rt, JS_APPEND_LINK(&cx->links, &rt->contextList));
+
+    cx->version = JSVERSION_DEFAULT;
+    cx->jsop_eq = JSOP_EQ;
+    cx->jsop_ne = JSOP_NE;
+    JS_InitArenaPool(&cx->stackPool, "stack", stacksize, sizeof(jsval));
+    JS_InitArenaPool(&cx->codePool, "code", 1024, sizeof(jsbytecode));
+    JS_InitArenaPool(&cx->tempPool, "temp", 1024, sizeof(jsdouble));
+
+#if JS_HAS_REGEXPS
+    if (!js_InitRegExpStatics(cx, &cx->regExpStatics)) {
+	js_DestroyContext(cx);
+	return NULL;
+    }
+#endif
+    return cx;
+}
+
+void
+js_DestroyContext(JSContext *cx)
+{
+    JSRuntime *rt;
+    JSBool rtempty;
+
+    rt = cx->runtime;
+
+    /* Remove cx from context list first. */
+    JS_LOCK_RUNTIME(rt);
+    JS_REMOVE_LINK(&cx->links);
+    rtempty = (rt->contextList.next == (JSCList *)&rt->contextList);
+    JS_UNLOCK_RUNTIME(rt);
+
+    if (rtempty) {
+	/* Unpin all pinned atoms before final GC. */
+	js_UnpinPinnedAtoms(&rt->atomState);
+
+	/* Unlock GC things held by runtime pointers. */
+	js_UnlockGCThing(cx, rt->jsNaN);
+	js_UnlockGCThing(cx, rt->jsNegativeInfinity);
+	js_UnlockGCThing(cx, rt->jsPositiveInfinity);
+	js_UnlockGCThing(cx, rt->emptyString);
+
+	/*
+	 * Clear these so they get recreated if the standard classes are
+	 * initialized again.
+	 */
+	rt->jsNaN = NULL;
+	rt->jsNegativeInfinity = NULL;
+	rt->jsPositiveInfinity = NULL;
+	rt->emptyString = NULL;
+
+	/* Clear debugging state to remove GC roots. */
+	JS_ClearAllTraps(cx);
+	JS_ClearAllWatchPoints(cx);
+    }
+
+    /* Remove more GC roots in regExpStatics, then collect garbage. */
+#if JS_HAS_REGEXPS
+    js_FreeRegExpStatics(cx, &cx->regExpStatics);
+#endif
+    js_ForceGC(cx);
+
+    if (rtempty) {
+	/* Free atom state now that we've run the GC. */
+	js_FreeAtomState(cx, &rt->atomState);
+    }
+
+    /* Free the stuff hanging off of cx. */
+    JS_FinishArenaPool(&cx->stackPool);
+    JS_FinishArenaPool(&cx->codePool);
+    JS_FinishArenaPool(&cx->tempPool);
+    if (cx->lastMessage)
+	free(cx->lastMessage);
+    free(cx);
+}
+
+JSContext *
+js_ContextIterator(JSRuntime *rt, JSContext **iterp)
+{
+    JSContext *cx = *iterp;
+
+    JS_LOCK_RUNTIME(rt);
+    if (!cx)
+	cx = (JSContext *)rt->contextList.next;
+    if ((void *)cx == &rt->contextList)
+	cx = NULL;
+    else
+	*iterp = (JSContext *)cx->links.next;
+    JS_UNLOCK_RUNTIME(rt);
+    return cx;
+}
+
+void
+js_ReportErrorVA(JSContext *cx, uintN flags, const char *format, va_list ap)
+{
+    JSStackFrame *fp;
+    JSErrorReport report, *reportp;
+    char *last;
+
+    fp = cx->fp;
+    if (fp && fp->script && fp->pc) {
+	report.filename = fp->script->filename;
+	report.lineno = js_PCToLineNumber(fp->script, fp->pc);
+	/* XXX should fetch line somehow */
+	report.linebuf = NULL;
+	report.tokenptr = NULL;
+	report.flags = flags;
+	reportp = &report;
+    } else {
+	/* XXXshaver still fill out report here for flags? */
+	reportp = NULL;
+    }
+    last = JS_vsmprintf(format, ap);
+    if (!last)
+	return;
+
+    js_ReportErrorAgain(cx, last, reportp);
+    free(last);
+}
+
+/*
+ * The arguments from ap need to be packaged up into an array and stored
+ * into the report struct.
+ *
+ * The format string addressed by the error number may contain operands
+ * identified by the format {N}, where N is a decimal digit. Each of these
+ * is to be replaced by the Nth argument from the va_list. The complete
+ * message is placed into reportp->ucmessage converted to a JSString.
+ *
+ * returns true/false if the expansion succeeds (can fail for memory errors)
+ */
+JSBool
+js_ExpandErrorArguments(JSContext *cx, JSErrorCallback callback,
+			void *userRef, const uintN errorNumber,
+			char **messagep, JSErrorReport *reportp, va_list ap)
+{
+    const JSErrorFormatString *fmtData;
+    int i;
+    int argCount;
+
+    *messagep = NULL;
+    if (callback) {
+	fmtData = (*callback)(userRef, "Mountain View", errorNumber);
+	if (fmtData != NULL) {
+	    argCount = fmtData->argCount;
+	    if (argCount > 0) {
+		/*
+		 * Gather the arguments into a char * array, the
+		 * messageArgs field is supposed to be an array of
+		 * JSString's and we'll convert them later.
+		 */
+		reportp->messageArgs = malloc(sizeof(char *) * argCount);
+		if (!reportp->messageArgs)
+		    return JS_FALSE;
+		for (i = 0; i < argCount; i++)
+		    reportp->messageArgs[i] = (JSString *) va_arg(ap, char *);
+	    }
+	    /*
+	     * Parse the error format, substituting the argument X
+	     * for {X} in the format.
+	     */
+	    if (argCount > 0) {
+		if (fmtData->format) {
+		    const char *fmt, *arg;
+		    char *out;
+		    int expandedArgs = 0;
+		    int expandedLength
+			= strlen(fmtData->format)
+			  - (3 * argCount); /* exclude the {n} */
+
+		    for (i = 0; i < argCount; i++) {
+			expandedLength
+			    += strlen((char *)reportp->messageArgs[i]);
+		    }
+		    *messagep = out = malloc(expandedLength + 1);
+		    if (!out) {
+			if (reportp->messageArgs) {
+			    free(reportp->messageArgs);
+			    reportp->messageArgs = NULL;
+			}
+			return JS_FALSE;
+		    }
+		    fmt = fmtData->format;
+		    while (*fmt) {
+			if (*fmt == '{') {	/* balance} */
+			    if (isdigit(fmt[1])) {
+				int d = JS7_UNDEC(fmt[1]);
+				JS_ASSERT(expandedArgs < argCount);
+				arg = (char *)reportp->messageArgs[d];
+				strcpy(out, arg);
+				out += strlen(arg);
+				fmt += 3;
+				expandedArgs++;
+				continue;
+			    }
+			}
+			*out++ = *fmt++;
+		    }
+		    JS_ASSERT(expandedArgs == argCount);
+		    *out = '\0';
+		}
+		/*
+		 * Now convert all the arguments to JSStrings.
+		 */
+		for (i = 0; i < argCount; i++) {
+		    reportp->messageArgs[i] =
+			JS_NewStringCopyZ(cx, (char *)reportp->messageArgs[i]);
+		}
+	    } else {
+		*messagep = JS_strdup(cx, fmtData->format);
+	    }
+	    /*
+	     * And finally convert the message.
+	     */
+	    reportp->ucmessage = JS_NewStringCopyZ(cx, *messagep);
+	}
+    }
+    if (*messagep == NULL) {
+	/* where's the right place for this ??? */
+	const char *defaultErrorMessage
+	    = "No error message available for error number %d";
+	size_t nbytes = strlen(defaultErrorMessage) + 16;
+	*messagep = (char *)malloc(nbytes);
+	JS_snprintf(*messagep, nbytes, defaultErrorMessage, errorNumber);
+    }
+    return JS_TRUE;
+}
+
+void
+js_ReportErrorNumberVA(JSContext *cx, uintN flags, JSErrorCallback callback,
+			void *userRef, const uintN errorNumber, va_list ap)
+{
+    JSStackFrame *fp;
+    JSErrorReport report;
+    char *message;
+
+    report.messageArgs = NULL;
+    report.ucmessage = NULL;
+    message = NULL;
+
+    fp = cx->fp;
+    if (fp && fp->script && fp->pc) {
+	report.filename = fp->script->filename;
+	report.lineno = js_PCToLineNumber(fp->script, fp->pc);
+    } else {
+	report.filename = NULL;
+	report.lineno = 0;
+    }
+
+    /* XXX should fetch line somehow */
+    report.linebuf = NULL;
+    report.tokenptr = NULL;
+    report.flags = flags;
+    report.errorNumber = errorNumber;
+
+    if (!js_ExpandErrorArguments(cx, callback, userRef, errorNumber,
+				 &message, &report, ap))
+	return;
+
+#if JS_HAS_ERROR_EXCEPTIONS
+    /*
+     * Check the error report, and set a JavaScript-catchable exception
+     * if the error is defined to have an associated exception.  If an
+     * exception is thrown, then the JSREPORT_EXCEPTION flag will be set
+     * on the error report, and exception-aware hosts should ignore it.
+     */
+    js_ErrorToException(cx, &report, message);
+#endif
+
+    js_ReportErrorAgain(cx, message, &report);
+
+    if (message)
+	free(message);
+    if (report.messageArgs)
+	free(report.messageArgs);
+}
+
+JS_FRIEND_API(void)
+js_ReportErrorAgain(JSContext *cx, const char *message, JSErrorReport *reportp)
+{
+    JSErrorReporter onError;
+
+    if (!message)
+	return;
+    if (cx->lastMessage)
+	free(cx->lastMessage);
+    cx->lastMessage = JS_strdup(cx, message);
+    if (!cx->lastMessage)
+	return;
+    onError = cx->errorReporter;
+    if (onError)
+	(*onError)(cx, cx->lastMessage, reportp);
+}
+
+void
+js_ReportIsNotDefined(JSContext *cx, const char *name)
+{
+    JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_NOT_DEFINED, name);
+}
+
+#if defined DEBUG && defined XP_UNIX
+/* For gdb usage. */
+void js_traceon(JSContext *cx)  { cx->tracefp = stderr; }
+void js_traceoff(JSContext *cx) { cx->tracefp = NULL; }
+#endif
+
+
+JSErrorFormatString js_ErrorFormatString[JSErr_Limit] = {
+#if JS_HAS_DFLT_MSG_STRINGS
+#define MSG_DEF(name, number, count, exception, format) \
+    { format, count } ,
+#else
+#define MSG_DEF(name, number, count, exception, format) \
+    { NULL, count } ,
+#endif
+#include "js.msg"
+#undef MSG_DEF
+};
+
+const JSErrorFormatString *
+js_GetErrorMessage(void *userRef, const char *locale, const uintN errorNumber)
+{
+    if ((errorNumber > 0) && (errorNumber < JSErr_Limit))
+	    return &js_ErrorFormatString[errorNumber];
+	else
+	    return NULL;
+}
+

mozilla/js/src/jscntxt.h

@@ -0,0 +1,230 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jscntxt_h___
+#define jscntxt_h___
+/*
+ * JS execution context.
+ */
+#ifndef NSPR20
+#include "jsarena.h"
+#else
+/* Removed by JSIFY: #include "plarena.h"
+ */
+#include "jsarena.h" /* Added by JSIFY */
+#endif
+#include "jsclist.h"
+#include "jslong.h"
+#include "jsatom.h"
+#include "jsgc.h"
+#include "jsinterp.h"
+#include "jsobj.h"
+#include "jsprvtd.h"
+#include "jspubtd.h"
+#include "jsregexp.h"
+
+JS_BEGIN_EXTERN_C
+
+struct JSRuntime {
+    /* Garbage collector state, used by jsgc.c. */
+    JSArenaPool         gcArenaPool;
+    JSArenaPool         gcFlagsPool;
+    JSHashTable         *gcRootsHash;
+    JSGCThing           *gcFreeList;
+    uint32              gcBytes;
+    uint32              gcLastBytes;
+    uint32              gcMaxBytes;
+    uint32              gcLevel;
+    uint32              gcNumber;
+    JSBool              gcPoke;
+    JSGCCallback        gcCallback;
+#ifdef JS_GCMETER
+    JSGCStats           gcStats;
+#endif
+
+    /* Literal table maintained by jsatom.c functions. */
+    JSAtomState         atomState;
+
+    /* Random number generator state, used by jsmath.c. */
+    JSBool              rngInitialized;
+    int64               rngMultiplier;
+    int64               rngAddend;
+    int64               rngMask;
+    int64               rngSeed;
+    jsdouble            rngDscale;
+
+    /* Well-known numbers held for use by this runtime's contexts. */
+    jsdouble            *jsNaN;
+    jsdouble            *jsNegativeInfinity;
+    jsdouble            *jsPositiveInfinity;
+
+    /* Empty string held for use by this runtime's contexts. */
+    JSString            *emptyString;
+
+    /* List of active contexts sharing this runtime. */
+    JSCList             contextList;
+
+    /* These are used for debugging -- see jsprvtd.h and jsdbgapi.h. */
+    JSTrapHandler       interruptHandler;
+    void                *interruptHandlerData;
+    JSNewScriptHook     newScriptHook;
+    void                *newScriptHookData;
+    JSDestroyScriptHook destroyScriptHook;
+    void                *destroyScriptHookData;
+    JSTrapHandler       debuggerHandler;
+    void                *debuggerHandlerData;
+    JSSourceHandler     sourceHandler;
+    void                *sourceHandlerData;
+    JSInterpreterHook   executeHook;
+    void                *executeHookData;
+    JSInterpreterHook   callHook;
+    void                *callHookData;
+
+    /* More debugging state, see jsdbgapi.c. */
+    JSCList             trapList;
+    JSCList             watchPointList;
+
+    /* Weak links to properties, indexed by quickened get/set opcodes. */
+    /* XXX must come after JSCLists or MSVC alignment bug bites empty lists */
+    JSPropertyCache     propertyCache;
+
+#ifdef JS_THREADSAFE
+    /* These combine to interlock the GC and new requests. */
+    PRLock              *gcLock;
+    PRCondVar           *gcDone;
+    PRCondVar           *requestDone;
+    uint32              requestCount;
+
+    /* Lock and owning thread pointer for JS_LOCK_RUNTIME. */
+    JSThinLock          rtLock;
+#endif
+};
+
+struct JSContext {
+    JSCList             links;
+
+    /* Interpreter activation count. */
+    uintN               interpLevel;
+
+    /* Runtime version control identifier and equality operators. */
+    JSVersion           version;
+    jsbytecode          jsop_eq;
+    jsbytecode          jsop_ne;
+
+    /* Data shared by threads in an address space. */
+    JSRuntime           *runtime;
+
+    /* Stack arena pool and frame pointer register. */
+    JSArenaPool         stackPool;
+    JSStackFrame        *fp;
+
+    /* Temporary arena pools used while compiling and decompiling. */
+    JSArenaPool         codePool;
+    JSArenaPool         tempPool;
+
+    /* Top-level object and pointer to top stack frame's scope chain. */
+    JSObject            *globalObject;
+
+    /* Most recently created things by type, members of the GC's root set. */
+    JSGCThing           *newborn[GCX_NTYPES];
+
+    /* Regular expression class statics (XXX not shared globally). */
+    JSRegExpStatics     regExpStatics;
+
+    /* State for object and array toSource conversion. */
+    JSSharpObjectMap    sharpObjectMap;
+
+    /* Last message string and trace file for debugging. */
+    char                *lastMessage;
+#ifdef DEBUG
+    void                *tracefp;
+#endif
+
+    /* Per-context optional user callbacks. */
+    JSBranchCallback    branchCallback;
+    JSErrorReporter     errorReporter;
+
+    /* Client opaque pointer */
+    void                *data;
+
+    /* GC and thread-safe state. */
+    JSStackFrame        *dormantFrameChain; /* dormant stack frame to scan */
+    uint32              gcDisabled;         /* XXX for pre-ECMAv2 switch */
+#ifdef JS_THREADSAFE
+    jsword              thread;
+    jsrefcount          requestDepth;
+    JSPackedBool        gcActive;
+#endif
+
+    /* Exception state (NB: throwing is packed with gcActive above). */
+    JSPackedBool        throwing;           /* is there a pending exception? */
+    jsval               exception;          /* most-recently-thrown exceptin */
+};
+
+extern JSContext *
+js_NewContext(JSRuntime *rt, size_t stacksize);
+
+extern void
+js_DestroyContext(JSContext *cx);
+
+extern JSContext *
+js_ContextIterator(JSRuntime *rt, JSContext **iterp);
+
+/*
+ * Report an exception, which is currently realized as a printf-style format
+ * string and its arguments.
+ */
+typedef enum JSErrNum {
+#define MSG_DEF(name, number, count, exception, format) \
+    name = number,
+#include "js.msg"
+#undef MSG_DEF
+    JSErr_Limit
+} JSErrNum;
+
+extern const JSErrorFormatString *
+js_GetErrorMessage(void *userRef, const char *locale, const uintN errorNumber);
+
+#ifdef va_start
+extern void
+js_ReportErrorVA(JSContext *cx, uintN flags, const char *format, va_list ap);
+extern void
+js_ReportErrorNumberVA(JSContext *cx, uintN flags, JSErrorCallback callback,
+		       void *userRef, const uintN errorNumber, va_list ap);
+
+extern JSBool
+js_ExpandErrorArguments(JSContext *cx, JSErrorCallback callback,
+			void *userRef, const uintN errorNumber,
+			char **message, JSErrorReport *reportp,
+			va_list ap);
+#endif
+
+/*
+ * Report an exception using a previously composed JSErrorReport.
+ */
+extern JS_FRIEND_API(void)
+js_ReportErrorAgain(JSContext *cx, const char *message, JSErrorReport *report);
+
+extern void
+js_ReportIsNotDefined(JSContext *cx, const char *name);
+
+extern JSErrorFormatString js_ErrorFormatString[JSErr_Limit];
+
+JS_END_EXTERN_C
+
+#endif /* jscntxt_h___ */

mozilla/js/src/jscompat.h

@@ -0,0 +1,20 @@
+/* -*- Mode: C; tab-width: 8 -*-
+ * Copyright © 1996 Netscape Communications Corporation, All Rights Reserved.
+ */
+#ifndef jscompat_h___
+#define jscompat_h___
+/*
+ * Compatibility glue for various NSPR versions.  We must always define int8,
+ * int16, jsword, and so on to minimize differences with js/ref, no matter what
+ * the NSPR typedef names may be.
+ */
+#include "jstypes.h"
+#include "jslong.h"
+
+typedef JSIntn intN;
+typedef JSUintn uintN;
+typedef JSUword jsuword;
+typedef JSWord jsword;
+typedef float float32;
+#define allocPriv allocPool
+#endif /* jscompat_h___ */

mozilla/js/src/jsconfig.h

@@ -0,0 +1,267 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS configuration macros.
+ */
+#ifndef JS_VERSION
+#define JS_VERSION 140
+#endif
+
+#if JS_VERSION == 100
+
+#define JS_BUG_AUTO_INDEX_PROPS 1       /* new object o: o.p = v sets o[0] */
+#define JS_BUG_NULL_INDEX_PROPS 1       /* o[0] defaults to null, not void */
+#define JS_BUG_EMPTY_INDEX_ZERO 1       /* o[""] is equivalent to o[0] */
+#define JS_BUG_SHORT_CIRCUIT    1       /* 1 && 1 => true, 1 && 0 => 0 bug */
+#define JS_BUG_EAGER_TOSTRING   1       /* o.toString() trumps o.valueOf() */
+#define JS_BUG_VOID_TOSTRING    0       /* void 0 + 0 == "undefined0" */
+#define JS_BUG_EVAL_THIS_FUN    0       /* eval('this') in function f is f */
+#define JS_BUG_EVAL_THIS_SCOPE  0       /* Math.eval('sin(x)') vs. local x */
+#define JS_BUG_FALLIBLE_EQOPS   1       /* fallible/intransitive equality ops */
+#define JS_BUG_FALLIBLE_TONUM   1       /* fallible ValueToNumber primitive */
+#define JS_BUG_WITH_CLOSURE     0       /* with(o)function f(){} sets o.f */
+#define JS_BUG_SET_ENUMERATE    1       /* o.p=q flags o.p JSPROP_ENUMERATE */
+
+#define JS_HAS_PROP_DELETE      0       /* delete o.p removes p from o */
+#define JS_HAS_CALL_OBJECT      0       /* fun.caller is stack frame obj */
+#define JS_HAS_LABEL_STATEMENT  0       /* has break/continue to label: */
+#define JS_HAS_DO_WHILE_LOOP    0       /* has do {...} while (b) */
+#define JS_HAS_SWITCH_STATEMENT 0       /* has switch (v) {case c: ...} */
+#define JS_HAS_SOME_PERL_FUN    0       /* has array.join/reverse/sort */
+#define JS_HAS_MORE_PERL_FUN    0       /* has array.push, str.substr, etc */
+#define JS_HAS_VALUEOF_HINT     0       /* valueOf(hint) where hint is typeof */
+#define JS_HAS_LEXICAL_CLOSURE  0       /* nested functions, lexically closed */
+#define JS_HAS_APPLY_FUNCTION   0       /* has fun.apply(obj, argArray) */
+#define JS_HAS_CALL_FUNCTION    0       /* has fun.call(obj, arg1, ... argN) */
+#define JS_HAS_OBJ_PROTO_PROP   0       /* has o.__proto__ etc. */
+#define JS_HAS_REGEXPS          0       /* has perl r.e.s via RegExp, /pat/ */
+#define JS_HAS_SEQUENCE_OPS     0       /* has array.slice, string.concat */
+#define JS_HAS_INITIALIZERS     0       /* has var o = {'foo': 42, 'bar':3} */
+#define JS_HAS_OBJ_WATCHPOINT   0       /* has o.watch and o.unwatch */
+#define JS_HAS_EXPORT_IMPORT    0       /* has export fun; import obj.fun */
+#define JS_HAS_EVAL_THIS_SCOPE  0       /* Math.eval is same as with (Math) */
+#define JS_HAS_TRIPLE_EQOPS     0       /* has === and !== identity eqops */
+#define JS_HAS_SHARP_VARS       0       /* has #n=, #n# for object literals */
+#define JS_HAS_REPLACE_LAMBDA   0       /* has string.replace(re, lambda) */
+#define JS_HAS_SCRIPT_OBJECT    0       /* has (new Script("x++")).exec() */
+#define JS_HAS_XDR		0	/* has XDR API and object methods */
+#define JS_HAS_EXCEPTIONS	0	/* has exception handling */
+#define JS_HAS_UNDEFINED        0       /* has global "undefined" property */
+#define JS_HAS_TOSOURCE         0       /* has Object/Array toSource method */
+#define JS_HAS_IN_OPERATOR      0       /* has in operator ('p' in {p:1}) */
+#define JS_HAS_INSTANCEOF       0       /* has {p:1} instanceof Object */
+#define JS_HAS_ARGS_OBJECT      0       /* has minimal ECMA arguments object */
+#define JS_HAS_DEBUGGER_KEYWORD 0       /* has hook for debugger keyword */
+#define JS_HAS_ERROR_EXCEPTIONS 0       /* has error object hierarchy */
+
+#elif JS_VERSION == 110
+
+#define JS_BUG_AUTO_INDEX_PROPS 0       /* new object o: o.p = v sets o[0] */
+#define JS_BUG_NULL_INDEX_PROPS 1       /* o[0] defaults to null, not void */
+#define JS_BUG_EMPTY_INDEX_ZERO 1       /* o[""] is equivalent to o[0] */
+#define JS_BUG_SHORT_CIRCUIT    1       /* 1 && 1 => true, 1 && 0 => 0 bug */
+#define JS_BUG_EAGER_TOSTRING   1       /* o.toString() trumps o.valueOf() */
+#define JS_BUG_VOID_TOSTRING    0       /* void 0 + 0 == "undefined0" */
+#define JS_BUG_EVAL_THIS_FUN    1       /* eval('this') in function f is f */
+#define JS_BUG_EVAL_THIS_SCOPE  1       /* Math.eval('sin(x)') vs. local x */
+#define JS_BUG_FALLIBLE_EQOPS   1       /* fallible/intransitive equality ops */
+#define JS_BUG_FALLIBLE_TONUM   1       /* fallible ValueToNumber primitive */
+#define JS_BUG_WITH_CLOSURE     0       /* with(o)function f(){} sets o.f */
+#define JS_BUG_SET_ENUMERATE    1       /* o.p=q flags o.p JSPROP_ENUMERATE */
+
+#define JS_HAS_PROP_DELETE      0       /* delete o.p removes p from o */
+#define JS_HAS_CALL_OBJECT      0       /* fun.caller is stack frame obj */
+#define JS_HAS_LABEL_STATEMENT  0       /* has break/continue to label: */
+#define JS_HAS_DO_WHILE_LOOP    0       /* has do {...} while (b) */
+#define JS_HAS_SWITCH_STATEMENT 0       /* has switch (v) {case c: ...} */
+#define JS_HAS_SOME_PERL_FUN    1       /* has array.join/reverse/sort */
+#define JS_HAS_MORE_PERL_FUN    0       /* has array.push, str.substr, etc */
+#define JS_HAS_VALUEOF_HINT     0       /* valueOf(hint) where hint is typeof */
+#define JS_HAS_LEXICAL_CLOSURE  0       /* nested functions, lexically closed */
+#define JS_HAS_APPLY_FUNCTION   0       /* has apply(fun, arg1, ... argN) */
+#define JS_HAS_CALL_FUNCTION    0       /* has fun.call(obj, arg1, ... argN) */
+#define JS_HAS_OBJ_PROTO_PROP   0       /* has o.__proto__ etc. */
+#define JS_HAS_REGEXPS          0       /* has perl r.e.s via RegExp, /pat/ */
+#define JS_HAS_SEQUENCE_OPS     0       /* has array.slice, string.concat */
+#define JS_HAS_INITIALIZERS     0       /* has var o = {'foo': 42, 'bar':3} */
+#define JS_HAS_OBJ_WATCHPOINT   0       /* has o.watch and o.unwatch */
+#define JS_HAS_EXPORT_IMPORT    0       /* has export fun; import obj.fun */
+#define JS_HAS_EVAL_THIS_SCOPE  0       /* Math.eval is same as with (Math) */
+#define JS_HAS_TRIPLE_EQOPS     0       /* has === and !== identity eqops */
+#define JS_HAS_SHARP_VARS       0       /* has #n=, #n# for object literals */
+#define JS_HAS_REPLACE_LAMBDA   0       /* has string.replace(re, lambda) */
+#define JS_HAS_SCRIPT_OBJECT    0       /* has (new Script("x++")).exec() */
+#define JS_HAS_XDR		0	/* has XDR API and object methods */
+#define JS_HAS_EXCEPTIONS	0	/* has exception handling */
+#define JS_HAS_UNDEFINED        0       /* has global "undefined" property */
+#define JS_HAS_TOSOURCE         0       /* has Object/Array toSource method */
+#define JS_HAS_IN_OPERATOR      0       /* has in operator ('p' in {p:1}) */
+#define JS_HAS_INSTANCEOF       0       /* has {p:1} instanceof Object */
+#define JS_HAS_ARGS_OBJECT      0       /* has minimal ECMA arguments object */
+#define JS_HAS_DEBUGGER_KEYWORD 0       /* has hook for debugger keyword */
+#define JS_HAS_ERROR_EXCEPTIONS 0       /* has error object hierarchy */
+
+#elif JS_VERSION == 120
+
+#define JS_BUG_AUTO_INDEX_PROPS 0       /* new object o: o.p = v sets o[0] */
+#define JS_BUG_NULL_INDEX_PROPS 0       /* o[0] defaults to null, not void */
+#define JS_BUG_EMPTY_INDEX_ZERO 0       /* o[""] is equivalent to o[0] */
+#define JS_BUG_SHORT_CIRCUIT    0       /* 1 && 1 => true, 1 && 0 => 0 bug */
+#define JS_BUG_EAGER_TOSTRING   0       /* o.toString() trumps o.valueOf() */
+#define JS_BUG_VOID_TOSTRING    1       /* void 0 + 0 == "undefined0" */
+#define JS_BUG_EVAL_THIS_FUN    0       /* eval('this') in function f is f */
+#define JS_BUG_EVAL_THIS_SCOPE  0       /* Math.eval('sin(x)') vs. local x */
+#define JS_BUG_FALLIBLE_EQOPS   0       /* fallible/intransitive equality ops */
+#define JS_BUG_FALLIBLE_TONUM   0       /* fallible ValueToNumber primitive */
+#define JS_BUG_WITH_CLOSURE     1       /* with(o)function f(){} sets o.f */
+#define JS_BUG_SET_ENUMERATE    1       /* o.p=q flags o.p JSPROP_ENUMERATE */
+
+#define JS_HAS_PROP_DELETE      1       /* delete o.p removes p from o */
+#define JS_HAS_CALL_OBJECT      1       /* fun.caller is stack frame obj */
+#define JS_HAS_LABEL_STATEMENT  1       /* has break/continue to label: */
+#define JS_HAS_DO_WHILE_LOOP    1       /* has do {...} while (b) */
+#define JS_HAS_SWITCH_STATEMENT 1       /* has switch (v) {case c: ...} */
+#define JS_HAS_SOME_PERL_FUN    1       /* has array.join/reverse/sort */
+#define JS_HAS_MORE_PERL_FUN    1       /* has array.push, str.substr, etc */
+#define JS_HAS_VALUEOF_HINT     1       /* valueOf(hint) where hint is typeof */
+#define JS_HAS_LEXICAL_CLOSURE  1       /* nested functions, lexically closed */
+#define JS_HAS_APPLY_FUNCTION   1       /* has apply(fun, arg1, ... argN) */
+#define JS_HAS_CALL_FUNCTION    0       /* has fun.call(obj, arg1, ... argN) */
+#define JS_HAS_OBJ_PROTO_PROP   1       /* has o.__proto__ etc. */
+#define JS_HAS_REGEXPS          1       /* has perl r.e.s via RegExp, /pat/ */
+#define JS_HAS_SEQUENCE_OPS     1       /* has array.slice, string.concat */
+#define JS_HAS_INITIALIZERS     1       /* has var o = {'foo': 42, 'bar':3} */
+#define JS_HAS_OBJ_WATCHPOINT   1       /* has o.watch and o.unwatch */
+#define JS_HAS_EXPORT_IMPORT    1       /* has export fun; import obj.fun */
+#define JS_HAS_EVAL_THIS_SCOPE  1       /* Math.eval is same as with (Math) */
+#define JS_HAS_TRIPLE_EQOPS     0       /* has === and !== identity eqops */
+#define JS_HAS_SHARP_VARS       0       /* has #n=, #n# for object literals */
+#define JS_HAS_REPLACE_LAMBDA   0       /* has string.replace(re, lambda) */
+#define JS_HAS_SCRIPT_OBJECT    0       /* has (new Script("x++")).exec() */
+#define JS_HAS_XDR		0	/* has XDR API and object methods */
+#define JS_HAS_EXCEPTIONS	0	/* has exception handling */
+#define JS_HAS_UNDEFINED        0       /* has global "undefined" property */
+#define JS_HAS_TOSOURCE         0       /* has Object/Array toSource method */
+#define JS_HAS_IN_OPERATOR      0       /* has in operator ('p' in {p:1}) */
+#define JS_HAS_INSTANCEOF       0       /* has {p:1} instanceof Object */
+#define JS_HAS_ARGS_OBJECT      0       /* has minimal ECMA arguments object */
+#define JS_HAS_DEBUGGER_KEYWORD 0       /* has hook for debugger keyword */
+#define JS_HAS_ERROR_EXCEPTIONS 0       /* has error object hierarchy */
+
+#elif JS_VERSION == 130
+
+#define JS_BUG_AUTO_INDEX_PROPS 0       /* new object o: o.p = v sets o[0] */
+#define JS_BUG_NULL_INDEX_PROPS 0       /* o[0] defaults to null, not void */
+#define JS_BUG_EMPTY_INDEX_ZERO 0       /* o[""] is equivalent to o[0] */
+#define JS_BUG_SHORT_CIRCUIT    0       /* 1 && 1 => true, 1 && 0 => 0 bug */
+#define JS_BUG_EAGER_TOSTRING   0       /* o.toString() trumps o.valueOf() */
+#define JS_BUG_VOID_TOSTRING    0       /* void 0 + 0 == "undefined0" */
+#define JS_BUG_EVAL_THIS_FUN    0       /* eval('this') in function f is f */
+#define JS_BUG_EVAL_THIS_SCOPE  0       /* Math.eval('sin(x)') vs. local x */
+#define JS_BUG_FALLIBLE_EQOPS   0       /* fallible/intransitive equality ops */
+#define JS_BUG_FALLIBLE_TONUM   0       /* fallible ValueToNumber primitive */
+#define JS_BUG_WITH_CLOSURE     1       /* with(o)function f(){} sets o.f */
+#define JS_BUG_SET_ENUMERATE    0       /* o.p=q flags o.p JSPROP_ENUMERATE */
+
+#define JS_HAS_PROP_DELETE      1       /* delete o.p removes p from o */
+#define JS_HAS_CALL_OBJECT      1       /* fun.caller is stack frame obj */
+#define JS_HAS_LABEL_STATEMENT  1       /* has break/continue to label: */
+#define JS_HAS_DO_WHILE_LOOP    1       /* has do {...} while (b) */
+#define JS_HAS_SWITCH_STATEMENT 1       /* has switch (v) {case c: ...} */
+#define JS_HAS_SOME_PERL_FUN    1       /* has array.join/reverse/sort */
+#define JS_HAS_MORE_PERL_FUN    1       /* has array.push, str.substr, etc */
+#define JS_HAS_VALUEOF_HINT     1       /* valueOf(hint) where hint is typeof */
+#define JS_HAS_LEXICAL_CLOSURE  1       /* nested functions, lexically closed */
+#define JS_HAS_APPLY_FUNCTION   1       /* has apply(fun, arg1, ... argN) */
+#define JS_HAS_CALL_FUNCTION    1       /* has fun.call(obj, arg1, ... argN) */
+#define JS_HAS_OBJ_PROTO_PROP   1       /* has o.__proto__ etc. */
+#define JS_HAS_REGEXPS          1       /* has perl r.e.s via RegExp, /pat/ */
+#define JS_HAS_SEQUENCE_OPS     1       /* has array.slice, string.concat */
+#define JS_HAS_INITIALIZERS     1       /* has var o = {'foo': 42, 'bar':3} */
+#define JS_HAS_OBJ_WATCHPOINT   1       /* has o.watch and o.unwatch */
+#define JS_HAS_EXPORT_IMPORT    1       /* has export fun; import obj.fun */
+#define JS_HAS_EVAL_THIS_SCOPE  1       /* Math.eval is same as with (Math) */
+#define JS_HAS_TRIPLE_EQOPS     1       /* has === and !== identity eqops */
+#define JS_HAS_SHARP_VARS       1       /* has #n=, #n# for object literals */
+#define JS_HAS_REPLACE_LAMBDA   1       /* has string.replace(re, lambda) */
+#define JS_HAS_SCRIPT_OBJECT    1       /* has (new Script("x++")).exec() */
+#define JS_HAS_XDR		1	/* has XDR API and object methods */
+#define JS_HAS_EXCEPTIONS	0	/* has exception handling */
+#define JS_HAS_UNDEFINED        1       /* has global "undefined" property */
+#define JS_HAS_TOSOURCE         1       /* has Object/Array toSource method */
+#define JS_HAS_IN_OPERATOR      0       /* has in operator ('p' in {p:1}) */
+#define JS_HAS_INSTANCEOF       0       /* has {p:1} instanceof Object */
+#define JS_HAS_ARGS_OBJECT      1       /* has minimal ECMA arguments object */
+#define JS_HAS_DEBUGGER_KEYWORD 1       /* has hook for debugger keyword */
+#define JS_HAS_ERROR_EXCEPTIONS 0       /* has error object hierarchy */
+
+#elif JS_VERSION == 140
+
+#define JS_BUG_AUTO_INDEX_PROPS 0       /* new object o: o.p = v sets o[0] */
+#define JS_BUG_NULL_INDEX_PROPS 0       /* o[0] defaults to null, not void */
+#define JS_BUG_EMPTY_INDEX_ZERO 0       /* o[""] is equivalent to o[0] */
+#define JS_BUG_SHORT_CIRCUIT    0       /* 1 && 1 => true, 1 && 0 => 0 bug */
+#define JS_BUG_EAGER_TOSTRING   0       /* o.toString() trumps o.valueOf() */
+#define JS_BUG_VOID_TOSTRING    0       /* void 0 + 0 == "undefined0" */
+#define JS_BUG_EVAL_THIS_FUN    0       /* eval('this') in function f is f */
+#define JS_BUG_EVAL_THIS_SCOPE  0       /* Math.eval('sin(x)') vs. local x */
+#define JS_BUG_FALLIBLE_EQOPS   0       /* fallible/intransitive equality ops */
+#define JS_BUG_FALLIBLE_TONUM   0       /* fallible ValueToNumber primitive */
+#define JS_BUG_WITH_CLOSURE     1       /* with(o)function f(){} sets o.f */
+#define JS_BUG_SET_ENUMERATE    0       /* o.p=q flags o.p JSPROP_ENUMERATE */
+
+#define JS_HAS_PROP_DELETE      1       /* delete o.p removes p from o */
+#define JS_HAS_CALL_OBJECT      1       /* fun.caller is stack frame obj */
+#define JS_HAS_LABEL_STATEMENT  1       /* has break/continue to label: */
+#define JS_HAS_DO_WHILE_LOOP    1       /* has do {...} while (b) */
+#define JS_HAS_SWITCH_STATEMENT 1       /* has switch (v) {case c: ...} */
+#define JS_HAS_SOME_PERL_FUN    1       /* has array.join/reverse/sort */
+#define JS_HAS_MORE_PERL_FUN    1       /* has array.push, str.substr, etc */
+#define JS_HAS_VALUEOF_HINT     1       /* valueOf(hint) where hint is typeof */
+#define JS_HAS_LEXICAL_CLOSURE  1       /* nested functions, lexically closed */
+#define JS_HAS_APPLY_FUNCTION   1       /* has apply(fun, arg1, ... argN) */
+#define JS_HAS_CALL_FUNCTION    1       /* has fun.call(obj, arg1, ... argN) */
+#define JS_HAS_OBJ_PROTO_PROP   1       /* has o.__proto__ etc. */
+#define JS_HAS_REGEXPS          1       /* has perl r.e.s via RegExp, /pat/ */
+#define JS_HAS_SEQUENCE_OPS     1       /* has array.slice, string.concat */
+#define JS_HAS_INITIALIZERS     1       /* has var o = {'foo': 42, 'bar':3} */
+#define JS_HAS_OBJ_WATCHPOINT   1       /* has o.watch and o.unwatch */
+#define JS_HAS_EXPORT_IMPORT    1       /* has export fun; import obj.fun */
+#define JS_HAS_EVAL_THIS_SCOPE  1       /* Math.eval is same as with (Math) */
+#define JS_HAS_TRIPLE_EQOPS     1       /* has === and !== identity eqops */
+#define JS_HAS_SHARP_VARS       1       /* has #n=, #n# for object literals */
+#define JS_HAS_REPLACE_LAMBDA   1       /* has string.replace(re, lambda) */
+#define JS_HAS_SCRIPT_OBJECT    1       /* has (new Script("x++")).exec() */
+#define JS_HAS_XDR		1	/* has XDR API and object methods */
+#define JS_HAS_EXCEPTIONS	1	/* has exception handling */
+#define JS_HAS_UNDEFINED        1       /* has global "undefined" property */
+#define JS_HAS_TOSOURCE         1       /* has Object/Array toSource method */
+#define JS_HAS_IN_OPERATOR      1       /* has in operator ('p' in {p:1}) */
+#define JS_HAS_INSTANCEOF       1       /* has {p:1} instanceof Object */
+#define JS_HAS_ARGS_OBJECT      1       /* has minimal ECMA arguments object */
+#define JS_HAS_DEBUGGER_KEYWORD 1       /* has hook for debugger keyword */
+#define JS_HAS_ERROR_EXCEPTIONS 1       /* rt errors reflected as exceptions */
+
+#define JS_HAS_DFLT_MSG_STRINGS 1       /* provides English error messages */
+
+#else
+
+#error "unknown JS_VERSION"
+
+#endif

mozilla/js/src/jscpucfg.c

@@ -0,0 +1,288 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * Generate CPU-specific bit-size and similar #defines.
+ */
+#include <stdio.h>
+
+#if defined(sgi)
+#ifndef IRIX
+# error "IRIX is not defined"
+#endif
+#endif
+
+#if defined(__sun)
+#if defined(__svr4) || defined(__svr4__)
+#ifndef SOLARIS
+# error "SOLARIS is not defined"
+#endif
+#else
+#ifndef SUNOS4
+# error "SUNOS4 is not defined"
+#endif
+#endif
+#endif
+
+#if defined(__hpux)
+#ifndef HPUX
+# error "HPUX is not defined"
+#endif
+#endif
+
+#if defined(__osf__)
+#ifndef OSF1
+# error "OSF1 is not defined"
+#endif
+#endif
+
+#if defined(_IBMR2)
+#ifndef AIX
+# error "AIX is not defined"
+#endif
+#endif
+
+#if defined(linux)
+#ifndef LINUX
+# error "LINUX is not defined"
+#endif
+#endif
+
+#if defined(bsdi)
+#ifndef BSDI
+# error "BSDI is not defined"
+#endif
+#endif
+
+#if defined(M_UNIX)
+#ifndef SCO
+# error "SCO is not defined"
+#endif
+#endif
+
+#if !defined(M_UNIX) && defined(_USLC_)
+#ifndef UNIXWARE
+# error "UNIXWARE is not defined"
+#endif
+#endif
+
+#ifdef __MWERKS__
+#define XP_MAC 1
+#endif
+
+/************************************************************************/
+
+/* Generate cpucfg.h */
+#ifdef XP_MAC
+#include <Types.h>
+#define INT64	UnsignedWide
+#else
+#ifdef XP_PC
+#ifdef WIN32
+#define INT64	_int64
+#else
+#define INT64	long
+#endif
+#else
+#if defined(HPUX) || defined(SCO) || defined(UNIXWARE)
+#define INT64	long
+#else
+#define INT64	long long
+#endif
+#endif
+#endif
+
+typedef void *prword;
+
+struct align_short {
+    char c;
+    short a;
+};
+struct align_int {
+    char c;
+    int a;
+};
+struct align_long {
+    char c;
+    long a;
+};
+struct align_int64 {
+    char c;
+    INT64 a;
+};
+struct align_fakelonglong {
+    char c;
+    struct {
+	long hi, lo;
+    } a;
+};
+struct align_float {
+    char c;
+    float a;
+};
+struct align_double {
+    char c;
+    double a;
+};
+struct align_pointer {
+    char c;
+    void *a;
+};
+struct align_prword {
+    char c;
+    prword a;
+};
+
+#define ALIGN_OF(type) \
+    (((char*)&(((struct align_##type *)0)->a)) - ((char*)0))
+
+int bpb;
+
+static int Log2(int n)
+{
+    int log2 = 0;
+
+    if (n & (n-1))
+	log2++;
+    if (n >> 16)
+	log2 += 16, n >>= 16;
+    if (n >> 8)
+	log2 += 8, n >>= 8;
+    if (n >> 4)
+	log2 += 4, n >>= 4;
+    if (n >> 2)
+	log2 += 2, n >>= 2;
+    if (n >> 1)
+	log2++;
+    return log2;
+}
+
+/* We assume that int's are 32 bits */
+static void do64(void)
+{
+    union {
+	long i;
+	char c[4];
+    } u;
+
+    u.i = 0x01020304;
+    if (u.c[0] == 0x01) {
+	printf("#undef  IS_LITTLE_ENDIAN\n");
+	printf("#define IS_BIG_ENDIAN 1\n\n");
+    } else {
+	printf("#define IS_LITTLE_ENDIAN 1\n");
+	printf("#undef  IS_BIG_ENDIAN\n\n");
+    }
+}
+
+static void do32(void)
+{
+    union {
+	long i;
+	char c[4];
+    } u;
+
+    u.i = 0x01020304;
+    if (u.c[0] == 0x01) {
+	printf("#undef  IS_LITTLE_ENDIAN\n");
+	printf("#define IS_BIG_ENDIAN 1\n\n");
+    } else {
+	printf("#define IS_LITTLE_ENDIAN 1\n");
+	printf("#undef  IS_BIG_ENDIAN\n\n");
+    }
+}
+
+/*
+ * Conceivably this could actually be used, but there is lots of code out
+ * there with ands and shifts in it that assumes a byte is exactly 8 bits,
+ * so forget about porting THIS code to all those non 8 bit byte machines.
+ */
+static void BitsPerByte(void)
+{
+    bpb = 8;
+}
+
+int main(int argc, char **argv)
+{
+    BitsPerByte();
+
+    printf("#ifndef js_cpucfg___\n");
+    printf("#define js_cpucfg___\n\n");
+
+    printf("/* AUTOMATICALLY GENERATED - DO NOT EDIT */\n\n");
+
+    if (sizeof(long) == 8) {
+	do64();
+    } else {
+	do32();
+    }
+    printf("#define JS_BYTES_PER_BYTE   %dL\n", sizeof(char));
+    printf("#define JS_BYTES_PER_SHORT  %dL\n", sizeof(short));
+    printf("#define JS_BYTES_PER_INT    %dL\n", sizeof(int));
+    printf("#define JS_BYTES_PER_INT64  %dL\n", 8);
+    printf("#define JS_BYTES_PER_LONG   %dL\n", sizeof(long));
+    printf("#define JS_BYTES_PER_FLOAT  %dL\n", sizeof(float));
+    printf("#define JS_BYTES_PER_DOUBLE %dL\n", sizeof(double));
+    printf("#define JS_BYTES_PER_WORD   %dL\n", sizeof(prword));
+    printf("#define JS_BYTES_PER_DWORD  %dL\n", 8);
+    printf("\n");
+
+    printf("#define JS_BITS_PER_BYTE    %dL\n", bpb);
+    printf("#define JS_BITS_PER_SHORT   %dL\n", bpb * sizeof(short));
+    printf("#define JS_BITS_PER_INT     %dL\n", bpb * sizeof(int));
+    printf("#define JS_BITS_PER_INT64   %dL\n", bpb * 8);
+    printf("#define JS_BITS_PER_LONG    %dL\n", bpb * sizeof(long));
+    printf("#define JS_BITS_PER_FLOAT   %dL\n", bpb * sizeof(float));
+    printf("#define JS_BITS_PER_DOUBLE  %dL\n", bpb * sizeof(double));
+    printf("#define JS_BITS_PER_WORD    %dL\n", bpb * sizeof(prword));
+    printf("\n");
+
+    printf("#define JS_BITS_PER_BYTE_LOG2   %dL\n", Log2(bpb));
+    printf("#define JS_BITS_PER_SHORT_LOG2  %dL\n", Log2(bpb * sizeof(short)));
+    printf("#define JS_BITS_PER_INT_LOG2    %dL\n", Log2(bpb * sizeof(int)));
+    printf("#define JS_BITS_PER_INT64_LOG2  %dL\n", 6);
+    printf("#define JS_BITS_PER_LONG_LOG2   %dL\n", Log2(bpb * sizeof(long)));
+    printf("#define JS_BITS_PER_FLOAT_LOG2  %dL\n", Log2(bpb * sizeof(float)));
+    printf("#define JS_BITS_PER_DOUBLE_LOG2 %dL\n", Log2(bpb * sizeof(double)));
+    printf("#define JS_BITS_PER_WORD_LOG2   %dL\n", Log2(bpb * sizeof(prword)));
+    printf("\n");
+
+    printf("#define JS_ALIGN_OF_SHORT   %dL\n", ALIGN_OF(short));
+    printf("#define JS_ALIGN_OF_INT     %dL\n", ALIGN_OF(int));
+    printf("#define JS_ALIGN_OF_LONG    %dL\n", ALIGN_OF(long));
+    if (sizeof(INT64) < 8) {
+	/* this machine doesn't actually support int64's */
+	printf("#define JS_ALIGN_OF_INT64   %dL\n", ALIGN_OF(fakelonglong));
+    } else {
+	printf("#define JS_ALIGN_OF_INT64   %dL\n", ALIGN_OF(int64));
+    }
+    printf("#define JS_ALIGN_OF_FLOAT   %dL\n", ALIGN_OF(float));
+    printf("#define JS_ALIGN_OF_DOUBLE  %dL\n", ALIGN_OF(double));
+    printf("#define JS_ALIGN_OF_POINTER %dL\n", ALIGN_OF(pointer));
+    printf("#define JS_ALIGN_OF_WORD    %dL\n", ALIGN_OF(prword));
+    printf("\n");
+
+    printf("#define JS_BYTES_PER_WORD_LOG2   %dL\n", Log2(sizeof(prword)));
+    printf("#define JS_BYTES_PER_DWORD_LOG2  %dL\n", Log2(8));
+    printf("#define JS_WORDS_PER_DWORD_LOG2  %dL\n", Log2(8/sizeof(prword)));
+    printf("\n");
+
+    printf("#endif /* js_cpucfg___ */\n");
+
+    return 0;
+}

mozilla/js/src/jscpucfg.h

@@ -0,0 +1,702 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef js_cpucfg___
+#define js_cpucfg___
+
+#include "jsosdep.h"
+
+#ifdef XP_MAC
+#include "jsmacos.h"
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   2L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+#endif /* XP_MAC */
+
+#ifdef _WIN32
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+#endif /* _WIN32 */
+
+#if defined(_WINDOWS) && !defined(_WIN32) /* WIN16 */
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    2L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     16L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    4L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     2L
+#define JS_ALIGN_OF_LONG    2L
+#define JS_ALIGN_OF_INT64   2L
+#define JS_ALIGN_OF_FLOAT   2L
+#define JS_ALIGN_OF_DOUBLE  2L
+#define JS_ALIGN_OF_POINTER 2L
+#define JS_ALIGN_OF_WORD    2L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+#endif /* defined(_WINDOWS) && !defined(_WIN32) */
+
+#ifdef XP_UNIX
+
+#ifdef AIXV3
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(BSDI)
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(HPUX)
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(IRIX)
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(LINUX)
+
+#ifdef __powerpc__
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN    1
+#elif __i386__
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+#else
+#error "linux cpu architecture not supported by jscpucfg.h"
+#endif
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(OSF1)
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   8L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   8L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    64L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    64L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   6L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   6L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    8L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 8L
+#define JS_ALIGN_OF_WORD    8L
+
+#define JS_BYTES_PER_WORD_LOG2   3L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  0L
+
+
+#elif defined(SOLARIS)
+
+#ifdef i386
+/* PC-based */
+#undef  IS_BIG_ENDIAN
+#define IS_LITTLE_ENDIAN 1
+#else
+/* Sparc-based */
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+#endif
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#ifdef i386
+#undef JS_ALIGN_OF_INT64
+#undef JS_ALIGN_OF_DOUBLE
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#endif
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(SUNOS4)
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(SNI)
+#undef  IS_LITTLE_ENDIAN
+#define IS_BIG_ENDIAN 1
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   8L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  8L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(SONY)
+/* Don't have it */
+
+#elif defined(NECSVR4)
+/* Don't have it */
+
+#elif defined(SCO)
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+
+#elif defined(UNIXWARE)
+#define IS_LITTLE_ENDIAN 1
+#undef  IS_BIG_ENDIAN
+
+#define JS_BYTES_PER_BYTE   1L
+#define JS_BYTES_PER_SHORT  2L
+#define JS_BYTES_PER_INT    4L
+#define JS_BYTES_PER_INT64  8L
+#define JS_BYTES_PER_LONG   4L
+#define JS_BYTES_PER_FLOAT  4L
+#define JS_BYTES_PER_DOUBLE 8L
+#define JS_BYTES_PER_WORD   4L
+#define JS_BYTES_PER_DWORD  8L
+
+#define JS_BITS_PER_BYTE    8L
+#define JS_BITS_PER_SHORT   16L
+#define JS_BITS_PER_INT     32L
+#define JS_BITS_PER_INT64   64L
+#define JS_BITS_PER_LONG    32L
+#define JS_BITS_PER_FLOAT   32L
+#define JS_BITS_PER_DOUBLE  64L
+#define JS_BITS_PER_WORD    32L
+
+#define JS_BITS_PER_BYTE_LOG2   3L
+#define JS_BITS_PER_SHORT_LOG2  4L
+#define JS_BITS_PER_INT_LOG2    5L
+#define JS_BITS_PER_INT64_LOG2  6L
+#define JS_BITS_PER_LONG_LOG2   5L
+#define JS_BITS_PER_FLOAT_LOG2  5L
+#define JS_BITS_PER_DOUBLE_LOG2 6L
+#define JS_BITS_PER_WORD_LOG2   5L
+
+#define JS_ALIGN_OF_SHORT   2L
+#define JS_ALIGN_OF_INT     4L
+#define JS_ALIGN_OF_LONG    4L
+#define JS_ALIGN_OF_INT64   4L
+#define JS_ALIGN_OF_FLOAT   4L
+#define JS_ALIGN_OF_DOUBLE  4L
+#define JS_ALIGN_OF_POINTER 4L
+#define JS_ALIGN_OF_WORD    4L
+
+#define JS_BYTES_PER_WORD_LOG2   2L
+#define JS_BYTES_PER_DWORD_LOG2  3L
+#define PR_WORDS_PER_DWORD_LOG2  1L
+
+#endif
+#endif /* XP_UNIX */
+
+#endif /* js_cpucfg___ */

mozilla/js/src/jsdate.h

@@ -0,0 +1,76 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsdate_h___
+#define jsdate_h___
+/*
+ * JS Date class interface.
+ */
+
+JS_BEGIN_EXTERN_C
+
+extern JSObject *
+js_InitDateClass(JSContext *cx, JSObject *obj);
+
+/*
+ *  These functions provide a C interface to the date/time object
+ */
+extern JS_FRIEND_API(JSObject*)
+js_NewDateObject(JSContext* cx, int year, int mon, int mday,
+				int hour, int min, int sec);
+
+extern JS_FRIEND_API(int)
+js_DateGetYear(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(int)
+js_DateGetMonth(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(int)
+js_DateGetDate(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(int)
+js_DateGetHours(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(int)
+js_DateGetMinutes(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(int)
+js_DateGetSeconds(JSContext *cx, JSObject* obj);
+
+extern JS_FRIEND_API(void)
+js_DateSetYear(JSContext *cx, JSObject *obj, int year);
+
+extern JS_FRIEND_API(void)
+js_DateSetMonth(JSContext *cx, JSObject *obj, int year);
+
+extern JS_FRIEND_API(void)
+js_DateSetDate(JSContext *cx, JSObject *obj, int date);
+
+extern JS_FRIEND_API(void)
+js_DateSetHours(JSContext *cx, JSObject *obj, int hours);
+
+extern JS_FRIEND_API(void)
+js_DateSetMinutes(JSContext *cx, JSObject *obj, int minutes);
+
+extern JS_FRIEND_API(void)
+js_DateSetSeconds(JSContext *cx, JSObject *obj, int seconds);
+
+
+JS_END_EXTERN_C
+
+#endif /* jsdate_h___ */

mozilla/js/src/jsdbgapi.c

@@ -0,0 +1,859 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS debugging API.
+ */
+#include "jsstddef.h"
+#include <string.h>
+#include "jstypes.h"
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#include "jsclist.h"
+#include "jsapi.h"
+#include "jscntxt.h"
+#include "jsconfig.h"
+#include "jsdbgapi.h"
+#include "jsfun.h"
+#include "jsgc.h"
+#include "jsinterp.h"
+#include "jslock.h"
+#include "jsobj.h"
+#include "jsopcode.h"
+#include "jsscope.h"
+#include "jsscript.h"
+#include "jsstr.h"
+
+typedef struct JSTrap {
+    JSCList         links;
+    JSScript        *script;
+    jsbytecode      *pc;
+    JSOp            op;
+    JSTrapHandler   handler;
+    void            *closure;
+} JSTrap;
+
+static JSTrap *
+FindTrap(JSRuntime *rt, JSScript *script, jsbytecode *pc)
+{
+    JSTrap *trap;
+
+    for (trap = (JSTrap *)rt->trapList.next;
+	 trap != (JSTrap *)&rt->trapList;
+	 trap = (JSTrap *)trap->links.next) {
+	if (trap->script == script && trap->pc == pc)
+	    return trap;
+    }
+    return NULL;
+}
+
+void
+js_PatchOpcode(JSContext *cx, JSScript *script, jsbytecode *pc, JSOp op)
+{
+    JSTrap *trap;
+
+    trap = FindTrap(cx->runtime, script, pc);
+    if (trap)
+	trap->op = op;
+    else
+	*pc = (jsbytecode)op;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_SetTrap(JSContext *cx, JSScript *script, jsbytecode *pc,
+	   JSTrapHandler handler, void *closure)
+{
+    JSRuntime *rt;
+    JSTrap *trap;
+
+    rt = cx->runtime;
+    trap = FindTrap(rt, script, pc);
+    if (trap) {
+	/* Restore opcode at pc so it can be saved again. */
+	*pc = (jsbytecode)trap->op;
+    } else {
+	trap = JS_malloc(cx, sizeof *trap);
+	if (!trap || !js_AddRoot(cx, &trap->closure, "trap->closure")) {
+	    if (trap)
+		JS_free(cx, trap);
+	    return JS_FALSE;
+	}
+    }
+    JS_APPEND_LINK(&trap->links, &rt->trapList);
+    trap->script = script;
+    trap->pc = pc;
+    trap->op = (JSOp)*pc;
+    trap->handler = handler;
+    trap->closure = closure;
+    *pc = JSOP_TRAP;
+    return JS_TRUE;
+}
+
+JS_PUBLIC_API(JSOp)
+JS_GetTrapOpcode(JSContext *cx, JSScript *script, jsbytecode *pc)
+{
+    JSTrap *trap;
+
+    trap = FindTrap(cx->runtime, script, pc);
+    if (!trap) {
+	JS_ASSERT(0);	/* XXX can't happen */
+	return JSOP_LIMIT;
+    }
+    return trap->op;
+}
+
+static void
+DestroyTrap(JSContext *cx, JSTrap *trap)
+{
+    JS_REMOVE_LINK(&trap->links);
+    *trap->pc = (jsbytecode)trap->op;
+    js_RemoveRoot(cx, &trap->closure);
+    JS_free(cx, trap);
+}
+
+JS_PUBLIC_API(void)
+JS_ClearTrap(JSContext *cx, JSScript *script, jsbytecode *pc,
+	     JSTrapHandler *handlerp, void **closurep)
+{
+    JSTrap *trap;
+
+    trap = FindTrap(cx->runtime, script, pc);
+    if (handlerp)
+	*handlerp = trap ? trap->handler : NULL;
+    if (closurep)
+	*closurep = trap ? trap->closure : NULL;
+    if (trap)
+	DestroyTrap(cx, trap);
+}
+
+JS_PUBLIC_API(void)
+JS_ClearScriptTraps(JSContext *cx, JSScript *script)
+{
+    JSRuntime *rt;
+    JSTrap *trap, *next;
+
+    rt = cx->runtime;
+    for (trap = (JSTrap *)rt->trapList.next;
+	 trap != (JSTrap *)&rt->trapList;
+	 trap = next) {
+	next = (JSTrap *)trap->links.next;
+	if (trap->script == script)
+	    DestroyTrap(cx, trap);
+    }
+}
+
+JS_PUBLIC_API(void)
+JS_ClearAllTraps(JSContext *cx)
+{
+    JSRuntime *rt;
+    JSTrap *trap, *next;
+
+    rt = cx->runtime;
+    for (trap = (JSTrap *)rt->trapList.next;
+	 trap != (JSTrap *)&rt->trapList;
+	 trap = next) {
+	next = (JSTrap *)trap->links.next;
+	DestroyTrap(cx, trap);
+    }
+}
+
+JS_PUBLIC_API(JSTrapStatus)
+JS_HandleTrap(JSContext *cx, JSScript *script, jsbytecode *pc, jsval *rval)
+{
+    JSTrap *trap;
+    JSTrapStatus status;
+    jsint op;
+
+    trap = FindTrap(cx->runtime, script, pc);
+    if (!trap) {
+	JS_ASSERT(0);	/* XXX can't happen */
+	return JSTRAP_ERROR;
+    }
+    /*
+     * It's important that we not use 'trap->' after calling the callback --
+     * the callback might remove the trap!
+     */
+    op = (jsint)trap->op;
+    status = trap->handler(cx, script, pc, rval, trap->closure);
+    if (status == JSTRAP_CONTINUE) {
+	/* By convention, return the true op to the interpreter in rval. */
+	*rval = INT_TO_JSVAL(op);
+    }
+    return status;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_SetInterrupt(JSRuntime *rt, JSTrapHandler handler, void *closure)
+{
+    rt->interruptHandler = handler;
+    rt->interruptHandlerData = closure;
+    return JS_TRUE;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_ClearInterrupt(JSRuntime *rt, JSTrapHandler *handlerp, void **closurep)
+{
+    if (handlerp)
+	*handlerp = (JSTrapHandler)rt->interruptHandler;
+    if (closurep)
+	*closurep = rt->interruptHandlerData;
+    rt->interruptHandler = 0;
+    rt->interruptHandlerData = 0;
+    return JS_TRUE;
+}
+
+
+typedef struct JSWatchPoint {
+    JSCList             links;
+    JSObject            *object;	/* weak link, see js_FinalizeObject */
+    jsval               userid;
+    JSScopeProperty     *sprop;
+    JSPropertyOp        setter;
+    JSWatchPointHandler handler;
+    void                *closure;
+    jsrefcount          nrefs;
+} JSWatchPoint;
+
+#define HoldWatchPoint(wp) ((wp)->nrefs++)
+
+static void
+DropWatchPoint(JSContext *cx, JSWatchPoint *wp)
+{
+    if (--wp->nrefs != 0)
+	return;
+    wp->sprop->setter = wp->setter;
+    JS_LOCK_OBJ_VOID(cx, wp->object,
+		     js_DropScopeProperty(cx, (JSScope *)wp->object->map,
+					  wp->sprop));
+    JS_REMOVE_LINK(&wp->links);
+    js_RemoveRoot(cx, &wp->closure);
+    JS_free(cx, wp);
+}
+
+static JSWatchPoint *
+FindWatchPoint(JSRuntime *rt, JSObject *obj, jsval userid)
+{
+    JSWatchPoint *wp;
+
+    for (wp = (JSWatchPoint *)rt->watchPointList.next;
+	 wp != (JSWatchPoint *)&rt->watchPointList;
+	 wp = (JSWatchPoint *)wp->links.next) {
+	if (wp->object == obj && wp->userid == userid)
+	    return wp;
+    }
+    return NULL;
+}
+
+JSScopeProperty *
+js_FindWatchPoint(JSRuntime *rt, JSObject *obj, jsval userid)
+{
+    JSWatchPoint *wp;
+
+    wp = FindWatchPoint(rt, obj, userid);
+    if (!wp)
+	return NULL;
+    return wp->sprop;
+}
+
+JSBool DLL_CALLBACK
+js_watch_set(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSRuntime *rt;
+    JSWatchPoint *wp;
+    JSScopeProperty *sprop;
+    JSSymbol *sym;
+    jsval userid, value;
+    jsid symid;
+    JSScope *scope;
+    JSAtom *atom;
+    JSBool ok;
+
+    rt = cx->runtime;
+    for (wp = (JSWatchPoint *)rt->watchPointList.next;
+	 wp != (JSWatchPoint *)&rt->watchPointList;
+	 wp = (JSWatchPoint *)wp->links.next) {
+	sprop = wp->sprop;
+	if (wp->object == obj && sprop->id == id) {
+	    JS_LOCK_OBJ(cx, obj);
+	    sym = sprop->symbols;
+	    if (!sym) {
+		userid = wp->userid;
+		atom = NULL;
+		if (JSVAL_IS_INT(userid)) {
+		    symid = (jsid)userid;
+		} else {
+		    atom = js_ValueToStringAtom(cx, userid);
+		    if (!atom) {
+			JS_UNLOCK_OBJ(cx, obj);
+			return JS_FALSE;
+		    }
+		    symid = (jsid)atom;
+		}
+		scope = (JSScope *) obj->map;
+		JS_ASSERT(scope->props);
+		ok = LOCKED_OBJ_GET_CLASS(obj)->addProperty(cx, obj, sprop->id,
+							    &value);
+		if (!ok) {
+		    JS_UNLOCK_OBJ(cx, obj);
+		    return JS_FALSE;
+		}
+		ok = (scope->ops->add(cx, scope, symid, sprop) != NULL);
+		if (!ok) {
+		    JS_UNLOCK_OBJ(cx, obj);
+		    return JS_FALSE;
+		}
+		sym = sprop->symbols;
+	    }
+	    JS_UNLOCK_OBJ(cx, obj);
+	    HoldWatchPoint(wp);
+	    ok = wp->handler(cx, obj, js_IdToValue(sym_id(sym)),
+			     OBJ_GET_SLOT(cx, obj, wp->sprop->slot), vp,
+			     wp->closure);
+	    if (ok)
+		ok = wp->setter(cx, obj, id, vp);
+	    DropWatchPoint(cx, wp);
+	    return ok;
+	}
+    }
+    JS_ASSERT(0);	/* XXX can't happen */
+    return JS_FALSE;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_SetWatchPoint(JSContext *cx, JSObject *obj, jsval id,
+		 JSWatchPointHandler handler, void *closure)
+{
+    JSAtom *atom;
+    jsid symid;
+    JSObject *pobj;
+    JSScopeProperty *sprop;
+    JSRuntime *rt;
+    JSWatchPoint *wp;
+
+    if (!OBJ_IS_NATIVE(obj)) {
+	JS_ReportErrorNumber(cx, js_GetErrorMessage, NULL, JSMSG_CANT_WATCH,
+			     OBJ_GET_CLASS(cx, obj)->name);
+	return JS_FALSE;
+    }
+
+    if (JSVAL_IS_INT(id)) {
+	symid = (jsid)id;
+	atom = NULL;
+    } else {
+	atom = js_ValueToStringAtom(cx, id);
+	if (!atom)
+	    return JS_FALSE;
+	symid = (jsid)atom;
+    }
+
+    if (!js_LookupProperty(cx, obj, symid, &pobj, (JSProperty **)&sprop))
+	return JS_FALSE;
+    rt = cx->runtime;
+    if (!sprop) {
+	/* Check for a deleted symbol watchpoint, which holds its property. */
+	sprop = js_FindWatchPoint(rt, obj, id);
+	if (sprop) {
+#ifdef JS_THREADSAFE
+	    /* Emulate js_LookupProperty if thread-safe. */
+	    JS_LOCK_OBJ(cx, obj);
+	    sprop->nrefs++;
+#endif
+	} else {
+	    /* Make a new property in obj so we can watch for the first set. */
+	    if (!js_DefineProperty(cx, obj, symid, JSVAL_VOID, NULL, NULL, 0,
+				   (JSProperty **)&sprop)) {
+		sprop = NULL;
+	    }
+	}
+    } else if (pobj != obj) {
+	/* Clone the prototype property so we can watch the right object. */
+	jsval value;
+	JSPropertyOp getter, setter;
+	uintN attrs;
+
+	if (OBJ_IS_NATIVE(pobj)) {
+	    value = LOCKED_OBJ_GET_SLOT(pobj, sprop->slot);
+	} else {
+	    if (!OBJ_GET_PROPERTY(cx, pobj, id, &value)) {
+		OBJ_DROP_PROPERTY(cx, pobj, (JSProperty *)sprop);
+		return JS_FALSE;
+	    }
+	}
+	getter = sprop->getter;
+	setter = sprop->setter;
+	attrs = sprop->attrs;
+	OBJ_DROP_PROPERTY(cx, pobj, (JSProperty *)sprop);
+
+	if (!js_DefineProperty(cx, obj, symid, value, getter, setter, attrs,
+			       (JSProperty **)&sprop)) {
+	    sprop = NULL;
+	}
+    }
+    if (!sprop)
+	return JS_FALSE;
+
+    wp = FindWatchPoint(rt, obj, id);
+    if (!wp) {
+	wp = JS_malloc(cx, sizeof *wp);
+	if (!wp)
+	    return JS_FALSE;
+	if (!js_AddRoot(cx, &wp->closure, "wp->closure")) {
+	    JS_free(cx, wp);
+	    return JS_FALSE;
+	}
+	JS_APPEND_LINK(&wp->links, &rt->watchPointList);
+	wp->object = obj;
+	wp->userid = id;
+	wp->sprop = js_HoldScopeProperty(cx, (JSScope *)obj->map, sprop);
+	wp->setter = sprop->setter;
+	sprop->setter = js_watch_set;
+	wp->nrefs = 1;
+    }
+    wp->handler = handler;
+    wp->closure = closure;
+    OBJ_DROP_PROPERTY(cx, obj, (JSProperty *)sprop);
+    return JS_TRUE;
+}
+
+JS_PUBLIC_API(void)
+JS_ClearWatchPoint(JSContext *cx, JSObject *obj, jsval id,
+		   JSWatchPointHandler *handlerp, void **closurep)
+{
+    JSRuntime *rt;
+    JSWatchPoint *wp;
+
+    rt = cx->runtime;
+    for (wp = (JSWatchPoint *)rt->watchPointList.next;
+	 wp != (JSWatchPoint *)&rt->watchPointList;
+	 wp = (JSWatchPoint *)wp->links.next) {
+	if (wp->object == obj && wp->userid == id) {
+	    if (handlerp)
+		*handlerp = wp->handler;
+	    if (closurep)
+		*closurep = wp->closure;
+	    DropWatchPoint(cx, wp);
+	    return;
+	}
+    }
+    if (handlerp)
+	*handlerp = NULL;
+    if (closurep)
+	*closurep = NULL;
+}
+
+JS_PUBLIC_API(void)
+JS_ClearWatchPointsForObject(JSContext *cx, JSObject *obj)
+{
+    JSRuntime *rt;
+    JSWatchPoint *wp, *next;
+
+    rt = cx->runtime;
+    for (wp = (JSWatchPoint *)rt->watchPointList.next;
+	 wp != (JSWatchPoint *)&rt->watchPointList;
+	 wp = next) {
+	next = (JSWatchPoint *)wp->links.next;
+	if (wp->object == obj)
+	    DropWatchPoint(cx, wp);
+    }
+}
+
+JS_PUBLIC_API(void)
+JS_ClearAllWatchPoints(JSContext *cx)
+{
+    JSRuntime *rt;
+    JSWatchPoint *wp, *next;
+
+    rt = cx->runtime;
+    for (wp = (JSWatchPoint *)rt->watchPointList.next;
+	 wp != (JSWatchPoint *)&rt->watchPointList;
+	 wp = next) {
+	next = (JSWatchPoint *)wp->links.next;
+	DropWatchPoint(cx, wp);
+    }
+}
+
+JS_PUBLIC_API(uintN)
+JS_PCToLineNumber(JSContext *cx, JSScript *script, jsbytecode *pc)
+{
+    return js_PCToLineNumber(script, pc);
+}
+
+JS_PUBLIC_API(jsbytecode *)
+JS_LineNumberToPC(JSContext *cx, JSScript *script, uintN lineno)
+{
+    return js_LineNumberToPC(script, lineno);
+}
+
+JS_PUBLIC_API(JSScript *)
+JS_GetFunctionScript(JSContext *cx, JSFunction *fun)
+{
+    return fun->script;
+}
+
+JS_PUBLIC_API(JSPrincipals *)
+JS_GetScriptPrincipals(JSContext *cx, JSScript *script)
+{
+    return script->principals;
+}
+
+
+/*
+ *  Stack Frame Iterator
+ */
+JS_PUBLIC_API(JSStackFrame *)
+JS_FrameIterator(JSContext *cx, JSStackFrame **iteratorp)
+{
+    *iteratorp = (*iteratorp == NULL) ? cx->fp : (*iteratorp)->down;
+    return *iteratorp;
+}
+
+JS_PUBLIC_API(JSScript *)
+JS_GetFrameScript(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->script;
+}
+
+JS_PUBLIC_API(jsbytecode *)
+JS_GetFramePC(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->pc;
+}
+
+JS_PUBLIC_API(void *)
+JS_GetFrameAnnotation(JSContext *cx, JSStackFrame *fp)
+{
+    if (fp->annotation) {
+	JSPrincipals *principals = fp->script
+	    ? fp->script->principals
+	    : NULL;
+
+	if (principals == NULL)
+	    return NULL;
+
+	if (principals->globalPrivilegesEnabled(cx, principals)) {
+	    /*
+	     * Only give out an annotation if privileges have not
+	     * been revoked globally.
+	     */
+	    return fp->annotation;
+	}
+    }
+
+    return NULL;
+}
+
+JS_PUBLIC_API(void)
+JS_SetFrameAnnotation(JSContext *cx, JSStackFrame *fp, void *annotation)
+{
+    fp->annotation = annotation;
+}
+
+JS_PUBLIC_API(void *)
+JS_GetFramePrincipalArray(JSContext *cx, JSStackFrame *fp)
+{
+    JSPrincipals *principals = fp->script
+	? fp->script->principals
+	: NULL;
+
+    return principals
+	? principals->getPrincipalArray(cx, principals)
+	: NULL;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_IsNativeFrame(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->fun && fp->fun->call;
+}
+
+/* this is deprecated, use JS_GetFrameScopeChain instead */
+JS_PUBLIC_API(JSObject *)
+JS_GetFrameObject(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->scopeChain;
+}
+
+JS_PUBLIC_API(JSObject *)
+JS_GetFrameScopeChain(JSContext *cx, JSStackFrame *fp)
+{
+    /* Force creation of argument and call objects if not yet created */
+    JS_GetFrameCallObject(cx, fp);
+    return fp->scopeChain;
+}
+
+JS_PUBLIC_API(JSObject *)
+JS_GetFrameCallObject(JSContext *cx, JSStackFrame *fp)
+{
+    if (! fp->fun)
+	return NULL;
+    /* Force creation of argument object if not yet created */
+     js_GetArgsObject(cx, fp);
+#if JS_HAS_CALL_OBJECT
+    return js_GetCallObject(cx, fp, NULL, NULL);
+#else
+    return NULL;
+#endif /* JS_HAS_CALL_OBJECT */
+}
+
+
+JS_PUBLIC_API(JSObject *)
+JS_GetFrameThis(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->thisp;
+}
+
+JS_PUBLIC_API(JSFunction *)
+JS_GetFrameFunction(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->fun;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_IsContructorFrame(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->constructing;
+}        
+
+JS_PUBLIC_API(JSBool)
+JS_IsDebuggerFrame(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->debugging;
+}        
+
+JS_PUBLIC_API(jsval)
+JS_GetFrameReturnValue(JSContext *cx, JSStackFrame *fp)
+{
+    return fp->rval;
+}        
+
+JS_PUBLIC_API(void)
+JS_SetFrameReturnValue(JSContext *cx, JSStackFrame *fp, jsval rval)
+{
+    fp->rval = rval;
+}        
+
+/************************************************************************/
+
+JS_PUBLIC_API(const char *)
+JS_GetScriptFilename(JSContext *cx, JSScript *script)
+{
+    return script->filename;
+}
+
+JS_PUBLIC_API(uintN)
+JS_GetScriptBaseLineNumber(JSContext *cx, JSScript *script)
+{
+    return script->lineno;
+}
+
+JS_PUBLIC_API(uintN)
+JS_GetScriptLineExtent(JSContext *cx, JSScript *script)
+{
+    return js_GetScriptLineExtent(script);
+}
+
+/***************************************************************************/
+
+JS_PUBLIC_API(void)
+JS_SetNewScriptHook(JSRuntime *rt, JSNewScriptHook hook, void *callerdata)
+{
+    rt->newScriptHook = hook;
+    rt->newScriptHookData = callerdata;
+}
+
+JS_PUBLIC_API(void)
+JS_SetDestroyScriptHook(JSRuntime *rt, JSDestroyScriptHook hook,
+			void *callerdata)
+{
+    rt->destroyScriptHook = hook;
+    rt->destroyScriptHookData = callerdata;
+}
+
+/***************************************************************************/
+
+JS_PUBLIC_API(JSBool)
+JS_EvaluateInStackFrame(JSContext *cx, JSStackFrame *fp,
+			const char *bytes, uintN length,
+			const char *filename, uintN lineno,
+			jsval *rval)
+{
+    JSScript *script;
+    JSBool ok;
+
+    script = JS_CompileScriptForPrincipals(cx, fp->scopeChain,
+					   fp->script ? fp->script->principals
+						      : NULL,
+					   bytes, length, filename, lineno);
+    if (!script)
+	return JS_FALSE;
+    ok = js_Execute(cx, fp->scopeChain, script, fp->fun, fp, JS_TRUE, rval);
+    js_DestroyScript(cx, script);
+    return ok;
+}
+
+/************************************************************************/
+
+JS_PUBLIC_API(JSScopeProperty *)
+JS_PropertyIterator(JSObject *obj, JSScopeProperty **iteratorp)
+{
+    JSScopeProperty *sprop;
+    JSScope *scope;
+
+    sprop = *iteratorp;
+    scope = (JSScope *) obj->map;
+    sprop = (sprop == NULL) ? scope->props : sprop->next;
+    *iteratorp = sprop;
+    return sprop;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_GetPropertyDesc(JSContext *cx, JSObject *obj, JSScopeProperty *sprop,
+		   JSPropertyDesc *pd)
+{
+    JSSymbol *sym;
+
+    sym = sprop->symbols;
+    pd->id = sym ? js_IdToValue(sym_id(sym)) : JSVAL_VOID;
+    if (!sym || !js_GetProperty(cx, obj, sym_id(sym), &pd->value))
+	pd->value = OBJ_GET_SLOT(cx, obj, sprop->slot);
+    pd->flags = ((sprop->attrs & JSPROP_ENUMERATE)      ? JSPD_ENUMERATE : 0)
+	      | ((sprop->attrs & JSPROP_READONLY)       ? JSPD_READONLY  : 0)
+	      | ((sprop->attrs & JSPROP_PERMANENT)      ? JSPD_PERMANENT : 0)
+#if JS_HAS_CALL_OBJECT
+	      | ((sprop->getter == js_GetCallVariable)  ? JSPD_VARIABLE  : 0)
+#endif /* JS_HAS_CALL_OBJECT */
+	      | ((sprop->getter == js_GetArgument)      ? JSPD_ARGUMENT  : 0)
+	      | ((sprop->getter == js_GetLocalVariable) ? JSPD_VARIABLE  : 0);
+#if JS_HAS_CALL_OBJECT
+    /* for Call Object 'real' getter isn't passed in to us */
+    if (OBJ_GET_CLASS(cx, obj) == &js_CallClass &&
+	OBJ_GET_CLASS(cx, obj)->getProperty == sprop->getter)
+	pd->flags |= JSPD_ARGUMENT;
+#endif /* JS_HAS_CALL_OBJECT */
+    pd->spare = 0;
+    pd->slot = (pd->flags & (JSPD_ARGUMENT | JSPD_VARIABLE))
+	       ? JSVAL_TO_INT(sprop->id)
+	       : 0;
+    if (!sym || !sym->next || (pd->flags & (JSPD_ARGUMENT | JSPD_VARIABLE))) {
+	pd->alias = JSVAL_VOID;
+    } else {
+	pd->alias = js_IdToValue(sym_id(sym->next));
+	pd->flags |= JSPD_ALIAS;
+    }
+    return JS_TRUE;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_GetPropertyDescArray(JSContext *cx, JSObject *obj, JSPropertyDescArray *pda)
+{
+    JSScope *scope;
+    uint32 i, n;
+    JSPropertyDesc *pd;
+    JSScopeProperty *sprop;
+    jsval state;
+    jsid  num_prop;
+
+    if (!OBJ_ENUMERATE(cx, obj, JSENUMERATE_INIT, &state, &num_prop))
+	return JS_FALSE;
+    scope = (JSScope *)obj->map;
+    /* have no props, or object's scope has not mutated from that of proto */
+    if (!scope->props ||
+	(OBJ_GET_PROTO(cx,obj) &&
+	 scope == (JSScope *)(OBJ_GET_PROTO(cx,obj)->map))) {
+	pda->length = 0;
+	pda->array = NULL;
+	return JS_TRUE;
+    }
+    n = scope->map.freeslot;
+    pd = JS_malloc(cx, (size_t)n * sizeof(JSPropertyDesc));
+    if (!pd)
+	return JS_FALSE;
+    i = 0;
+    for (sprop = scope->props; sprop; sprop = sprop->next) {
+	if (!js_AddRoot(cx, &pd[i].id, NULL))
+	    goto bad;
+	if (!js_AddRoot(cx, &pd[i].value, NULL))
+	    goto bad;
+	JS_GetPropertyDesc(cx, obj, sprop, &pd[i]);
+	if ((pd[i].flags & JSPD_ALIAS) && !js_AddRoot(cx, &pd[i].alias, NULL))
+	    goto bad;
+	if (++i == n)
+	    break;
+    }
+    pda->length = i;
+    pda->array = pd;
+    return JS_TRUE;
+
+bad:
+    pda->length = i + 1;
+    pda->array = pd;
+    JS_PutPropertyDescArray(cx, pda);
+    return JS_FALSE;
+}
+
+JS_PUBLIC_API(void)
+JS_PutPropertyDescArray(JSContext *cx, JSPropertyDescArray *pda)
+{
+    JSPropertyDesc *pd;
+    uint32 i;
+
+    pd = pda->array;
+    for (i = 0; i < pda->length; i++) {
+	js_RemoveRoot(cx, &pd[i].id);
+	js_RemoveRoot(cx, &pd[i].value);
+	if (pd[i].flags & JSPD_ALIAS)
+	    js_RemoveRoot(cx, &pd[i].alias);
+    }
+    JS_free(cx, pd);
+}
+
+/************************************************************************/
+
+JS_PUBLIC_API(JSBool)
+JS_SetDebuggerHandler(JSRuntime *rt, JSTrapHandler handler, void *closure)
+{
+    rt->debuggerHandler = handler;
+    rt->debuggerHandlerData = closure;
+    return JS_TRUE;
+}
+
+JS_PUBLIC_API(JSBool)
+JS_SetSourceHandler(JSRuntime *rt, JSSourceHandler handler, void *closure)
+{
+    rt->sourceHandler = handler;
+    rt->sourceHandlerData = closure;
+    return JS_TRUE;
+}        
+
+JS_PUBLIC_API(JSBool)
+JS_SetExecuteHook(JSRuntime *rt, JSInterpreterHook hook, void *closure)
+{
+    rt->executeHook = hook;
+    rt->executeHookData = closure;
+    return JS_TRUE;
+}        
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetCallHook(JSRuntime *rt, JSInterpreterHook hook, void *closure)
+{
+    rt->callHook = hook;
+    rt->callHookData = closure;
+    return JS_TRUE;
+}        
+
+

mozilla/js/src/jsdbgapi.h

@@ -0,0 +1,245 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsdbgapi_h___
+#define jsdbgapi_h___
+/*
+ * JS debugger API.
+ */
+#include "jsapi.h"
+#include "jsopcode.h"
+#include "jsprvtd.h"
+
+JS_BEGIN_EXTERN_C
+
+extern void
+js_PatchOpcode(JSContext *cx, JSScript *script, jsbytecode *pc, JSOp op);
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetTrap(JSContext *cx, JSScript *script, jsbytecode *pc,
+	   JSTrapHandler handler, void *closure);
+
+extern JS_PUBLIC_API(JSOp)
+JS_GetTrapOpcode(JSContext *cx, JSScript *script, jsbytecode *pc);
+
+extern JS_PUBLIC_API(void)
+JS_ClearTrap(JSContext *cx, JSScript *script, jsbytecode *pc,
+	     JSTrapHandler *handlerp, void **closurep);
+
+extern JS_PUBLIC_API(void)
+JS_ClearScriptTraps(JSContext *cx, JSScript *script);
+
+extern JS_PUBLIC_API(void)
+JS_ClearAllTraps(JSContext *cx);
+
+extern JS_PUBLIC_API(JSTrapStatus)
+JS_HandleTrap(JSContext *cx, JSScript *script, jsbytecode *pc, jsval *rval);
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetInterrupt(JSRuntime *rt, JSTrapHandler handler, void *closure);
+
+extern JS_PUBLIC_API(JSBool)
+JS_ClearInterrupt(JSRuntime *rt, JSTrapHandler *handlerp, void **closurep);
+
+/************************************************************************/
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetWatchPoint(JSContext *cx, JSObject *obj, jsval id,
+		 JSWatchPointHandler handler, void *closure);
+
+extern JS_PUBLIC_API(void)
+JS_ClearWatchPoint(JSContext *cx, JSObject *obj, jsval id,
+		   JSWatchPointHandler *handlerp, void **closurep);
+
+extern JS_PUBLIC_API(void)
+JS_ClearWatchPointsForObject(JSContext *cx, JSObject *obj);
+
+extern JS_PUBLIC_API(void)
+JS_ClearAllWatchPoints(JSContext *cx);
+
+#ifdef JS_HAS_OBJ_WATCHPOINT
+/*
+ * Hide these non-API function prototypes by testing whether the internal
+ * header file "jsconfig.h" has been included.
+ */
+extern JSScopeProperty *
+js_FindWatchPoint(JSRuntime *rt, JSObject *obj, jsval userid);
+
+extern JSBool DLL_CALLBACK
+js_watch_set(JSContext *cx, JSObject *obj, jsval id, jsval *vp);
+#endif
+
+/************************************************************************/
+
+extern JS_PUBLIC_API(uintN)
+JS_PCToLineNumber(JSContext *cx, JSScript *script, jsbytecode *pc);
+
+extern JS_PUBLIC_API(jsbytecode *)
+JS_LineNumberToPC(JSContext *cx, JSScript *script, uintN lineno);
+
+extern JS_PUBLIC_API(JSScript *)
+JS_GetFunctionScript(JSContext *cx, JSFunction *fun);
+
+extern JS_PUBLIC_API(JSPrincipals *)
+JS_GetScriptPrincipals(JSContext *cx, JSScript *script);
+
+/*
+ * Stack Frame Iterator
+ *
+ * Used to iterate through the JS stack frames to extract
+ * information from the frames.
+ */
+
+extern JS_PUBLIC_API(JSStackFrame *)
+JS_FrameIterator(JSContext *cx, JSStackFrame **iteratorp);
+
+extern JS_PUBLIC_API(JSScript *)
+JS_GetFrameScript(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(jsbytecode *)
+JS_GetFramePC(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSBool)
+JS_IsNativeFrame(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(void *)
+JS_GetFrameAnnotation(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(void)
+JS_SetFrameAnnotation(JSContext *cx, JSStackFrame *fp, void *annotation);
+
+extern JS_PUBLIC_API(void *)
+JS_GetFramePrincipalArray(JSContext *cx, JSStackFrame *fp);
+
+/* this is deprecated, use JS_GetFrameScopeChain instead */
+extern JS_PUBLIC_API(JSObject *)
+JS_GetFrameObject(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSObject *)
+JS_GetFrameScopeChain(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSObject *)
+JS_GetFrameCallObject(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSObject *)
+JS_GetFrameThis(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSFunction *)
+JS_GetFrameFunction(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSBool)
+JS_IsContructorFrame(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(JSBool)
+JS_IsDebuggerFrame(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(jsval)
+JS_GetFrameReturnValue(JSContext *cx, JSStackFrame *fp);
+
+extern JS_PUBLIC_API(void)
+JS_SetFrameReturnValue(JSContext *cx, JSStackFrame *fp, jsval rval);
+
+/************************************************************************/
+
+extern JS_PUBLIC_API(const char *)
+JS_GetScriptFilename(JSContext *cx, JSScript *script);
+
+extern JS_PUBLIC_API(uintN)
+JS_GetScriptBaseLineNumber(JSContext *cx, JSScript *script);
+
+extern JS_PUBLIC_API(uintN)
+JS_GetScriptLineExtent(JSContext *cx, JSScript *script);
+
+/************************************************************************/
+
+/*
+ * Hook setters for script creation and destruction, see jsprvtd.h for the
+ * typedefs.  These macros provide binary compatibility and newer, shorter
+ * synonyms.
+ */
+#define JS_SetNewScriptHook     JS_SetNewScriptHookProc
+#define JS_SetDestroyScriptHook JS_SetDestroyScriptHookProc
+
+extern JS_PUBLIC_API(void)
+JS_SetNewScriptHook(JSRuntime *rt, JSNewScriptHook hook, void *callerdata);
+
+extern JS_PUBLIC_API(void)
+JS_SetDestroyScriptHook(JSRuntime *rt, JSDestroyScriptHook hook,
+			void *callerdata);
+
+/************************************************************************/
+
+extern JS_PUBLIC_API(JSBool)
+JS_EvaluateInStackFrame(JSContext *cx, JSStackFrame *fp,
+			const char *bytes, uintN length,
+			const char *filename, uintN lineno,
+			jsval *rval);
+
+/************************************************************************/
+
+typedef struct JSPropertyDesc {
+    jsval           id;         /* primary id, a string or int */
+    jsval           value;      /* property value */
+    uint8           flags;      /* flags, see below */
+    uint8           spare;      /* unused */
+    uint16          slot;       /* argument/variable slot */
+    jsval           alias;      /* alias id if JSPD_ALIAS flag */
+} JSPropertyDesc;
+
+#define JSPD_ENUMERATE  0x01    /* visible to for/in loop */
+#define JSPD_READONLY   0x02    /* assignment is error */
+#define JSPD_PERMANENT  0x04    /* property cannot be deleted */
+#define JSPD_ALIAS      0x08    /* property has an alias id */
+#define JSPD_ARGUMENT   0x10    /* argument to function */
+#define JSPD_VARIABLE   0x20    /* local variable in function */
+
+typedef struct JSPropertyDescArray {
+    uint32          length;     /* number of elements in array */
+    JSPropertyDesc  *array;     /* alloc'd by Get, freed by Put */
+} JSPropertyDescArray;
+
+extern JS_PUBLIC_API(JSScopeProperty *)
+JS_PropertyIterator(JSObject *obj, JSScopeProperty **iteratorp);
+
+extern JS_PUBLIC_API(JSBool)
+JS_GetPropertyDesc(JSContext *cx, JSObject *obj, JSScopeProperty *sprop,
+		   JSPropertyDesc *pd);
+
+extern JS_PUBLIC_API(JSBool)
+JS_GetPropertyDescArray(JSContext *cx, JSObject *obj, JSPropertyDescArray *pda);
+
+extern JS_PUBLIC_API(void)
+JS_PutPropertyDescArray(JSContext *cx, JSPropertyDescArray *pda);
+
+/************************************************************************/
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetDebuggerHandler(JSRuntime *rt, JSTrapHandler handler, void *closure);
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetSourceHandler(JSRuntime *rt, JSSourceHandler handler, void *closure);
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetExecuteHook(JSRuntime *rt, JSInterpreterHook hook, void *closure);
+
+extern JS_PUBLIC_API(JSBool)
+JS_SetCallHook(JSRuntime *rt, JSInterpreterHook hook, void *closure);
+
+JS_END_EXTERN_C
+
+#endif /* jsdbgapi_h___ */

mozilla/js/src/jsdtoa.h

@@ -0,0 +1,54 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsdtoa_h___
+#define jsdtoa_h___
+/*
+ * Public interface to portable double-precision floating point to string
+ * and back conversion package.
+ */
+
+#include "jscompat.h"
+
+JS_BEGIN_EXTERN_C
+
+/*
+ * PR_strtod() returns as a double-precision floating-point number
+ * the  value represented by the character string pointed to by
+ * s00.  The string is scanned up to  the  first  unrecognized
+ * character.
+ * If the value of se is not (char **)NULL,  a  pointer  to
+ * the  character terminating the scan is returned in the location pointed
+ * to by se.  If no number can be  formed, se is set to s00r, and
+ * zero is returned.
+ */
+extern PUBLIC_API(double)
+PR_strtod(const char *s00, char **se);
+
+/*
+ * PR_cnvtf()
+ * conversion routines for floating point
+ * prcsn - number of digits of precision to generate floating
+ * point value.
+ */
+extern PUBLIC_API(void)
+PR_cnvtf(char *buf, intN bufsz, intN prcsn, double dval);
+
+JS_END_EXTERN_C
+
+#endif /* jsdtoa_h___ */

mozilla/js/src/jsemit.h

@@ -0,0 +1,366 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsemit_h___
+#define jsemit_h___
+/*
+ * JS bytecode generation.
+ */
+
+#include "jsstddef.h"
+#include "jstypes.h"
+#include "jsatom.h"
+#include "jsopcode.h"
+#include "jsprvtd.h"
+#include "jspubtd.h"
+
+JS_BEGIN_EXTERN_C
+
+typedef enum JSStmtType {
+    STMT_BLOCK        = 0,      /* compound statement: { s1[;... sN] } */
+    STMT_LABEL        = 1,      /* labeled statement:  l: s */
+    STMT_IF           = 2,      /* if (then) statement */
+    STMT_ELSE         = 3,      /* else statement */
+    STMT_SWITCH       = 4,      /* switch statement */
+    STMT_WITH         = 5,      /* with statement */
+    STMT_TRY	      = 6,	/* try statement */
+    STMT_CATCH	      = 7,	/* catch block */
+    STMT_FINALLY      = 8,	/* finally statement */
+    STMT_DO_LOOP      = 9,      /* do/while loop statement */
+    STMT_FOR_LOOP     = 10,     /* for loop statement */
+    STMT_FOR_IN_LOOP  = 11,     /* for/in loop statement */
+    STMT_WHILE_LOOP   = 12      /* while loop statement */
+} JSStmtType;
+
+#define STMT_IS_LOOP(stmt)      ((stmt)->type >= STMT_DO_LOOP)
+
+typedef struct JSStmtInfo JSStmtInfo;
+
+struct JSStmtInfo {
+    JSStmtType      type;           /* statement type */
+    ptrdiff_t       top;            /* offset of loop top from cg base */
+    ptrdiff_t       update;         /* loop update offset (top if none) */
+    ptrdiff_t       breaks;         /* offset of last break in loop */
+    ptrdiff_t       continues;      /* offset of last continue in loop */
+    JSAtom          *label;         /* label name if type is STMT_LABEL */
+    JSStmtInfo      *down;          /* info for enclosing statement */
+};
+
+#define SET_STATEMENT_TOP(stmt, top) \
+    ((stmt)->top = (stmt)->update = (top), (stmt)->breaks = (stmt)->continues = (-1))
+
+struct JSTreeContext {              /* tree context for semantic checks */
+    uint32          flags;          /* statement state flags, see below */
+    uint32          tryCount;       /* total count of try statements parsed */
+    JSStmtInfo      *topStmt;       /* top of statement info stack */
+};
+
+#define TCF_IN_FUNCTION 0x01        /* parsing inside function body */
+#define TCF_RETURN_EXPR 0x02        /* function has 'return expr;' */
+#define TCF_RETURN_VOID 0x04        /* function has 'return;' */
+#define TCF_IN_FOR_INIT 0x08        /* parsing init expr of for; exclude 'in' */
+
+#define TREE_CONTEXT_INIT(tc) \
+    ((tc)->flags = 0, (tc)->tryCount = 0, (tc)->topStmt = NULL)
+
+struct JSCodeGenerator {
+    void            *codeMark;      /* low watermark in cx->codePool */
+    void            *tempMark;      /* low watermark in cx->tempPool */
+    jsbytecode      *base;          /* base of JS bytecode vector */
+    jsbytecode      *limit;         /* one byte beyond end of bytecode */
+    jsbytecode      *next;          /* pointer to next free bytecode */
+    const char      *filename;      /* null or weak link to source filename */
+    uintN           firstLine;      /* first line, for js_NewScriptFromCG */
+    uintN           currentLine;    /* line number for tree-based srcnote gen */
+    JSPrincipals    *principals;    /* principals for constant folding eval */
+    JSTreeContext   treeContext;    /* for break/continue code generation */
+    JSAtomList      atomList;       /* literals indexed for mapping */
+    intN            stackDepth;     /* current stack depth in basic block */
+    uintN           maxStackDepth;  /* maximum stack depth so far */
+    jssrcnote       *notes;         /* source notes, see below */
+    uintN           noteCount;      /* number of source notes so far */
+    ptrdiff_t       lastNoteOffset; /* code offset for last source note */
+    JSTryNote       *tryBase;       /* first exception handling note */
+    JSTryNote       *tryNext;       /* next available note */
+    size_t          tryNoteSpace;   /* # of bytes allocated at tryBase */
+};
+
+#define CG_CODE(cg,offset)  ((cg)->base + (offset))
+#define CG_OFFSET(cg)       PTRDIFF((cg)->next, (cg)->base, jsbytecode)
+
+/*
+ * Initialize cg to allocate bytecode space from cx->codePool, and srcnote
+ * space from cx->tempPool.  Return true on success.  Report an error and
+ * return false if the initial code segment can't be allocated.
+ */
+extern JS_FRIEND_API(JSBool)
+js_InitCodeGenerator(JSContext *cx, JSCodeGenerator *cg,
+		     const char *filename, uintN lineno,
+		     JSPrincipals *principals);
+
+/*
+ * Release cx->codePool and cx->tempPool to marks set by js_InitCodeGenerator.
+ */
+extern JS_FRIEND_API(void)
+js_ResetCodeGenerator(JSContext *cx, JSCodeGenerator *cg);
+
+/*
+ * Emit one bytecode.
+ */
+extern ptrdiff_t
+js_Emit1(JSContext *cx, JSCodeGenerator *cg, JSOp op);
+
+/*
+ * Emit two bytecodes, an opcode (op) with a byte of immediate operand (op1).
+ */
+extern ptrdiff_t
+js_Emit2(JSContext *cx, JSCodeGenerator *cg, JSOp op, jsbytecode op1);
+
+/*
+ * Emit three bytecodes, an opcode with two bytes of immediate operands.
+ */
+extern ptrdiff_t
+js_Emit3(JSContext *cx, JSCodeGenerator *cg, JSOp op, jsbytecode op1,
+	 jsbytecode op2);
+
+/*
+ * Emit (1 + extra) bytecodes, for N bytes of op and its immediate operand.
+ */
+extern ptrdiff_t
+js_EmitN(JSContext *cx, JSCodeGenerator *cg, JSOp op, size_t extra);
+
+/*
+ * Unsafe macro to call js_SetJumpOffset and return false if it does.
+ */
+#define CHECK_AND_SET_JUMP_OFFSET(cx,cg,pc,off)                               \
+    JS_BEGIN_MACRO                                                            \
+	if (!js_SetJumpOffset(cx, cg, pc, off))                               \
+	    return JS_FALSE;                                                  \
+    JS_END_MACRO
+
+#define CHECK_AND_SET_JUMP_OFFSET_AT(cx,cg,off)                               \
+    CHECK_AND_SET_JUMP_OFFSET(cx, cg, CG_CODE(cg,off), CG_OFFSET(cg) - (off))
+
+extern JSBool
+js_SetJumpOffset(JSContext *cx, JSCodeGenerator *cg, jsbytecode *pc,
+		 ptrdiff_t off);
+
+/*
+ * Push the C-stack-allocated struct at stmt onto the stmtInfo stack.
+ */
+extern void
+js_PushStatement(JSTreeContext *tc, JSStmtInfo *stmt, JSStmtType type,
+		 ptrdiff_t top);
+
+/*
+ * Emit a break instruction, recording it for backpatching.
+ */
+extern ptrdiff_t
+js_EmitBreak(JSContext *cx, JSCodeGenerator *cg, JSStmtInfo *stmt,
+	     JSAtomListElement *label);
+
+/*
+ * Emit a continue instruction, recording it for backpatching.
+ */
+extern ptrdiff_t
+js_EmitContinue(JSContext *cx, JSCodeGenerator *cg, JSStmtInfo *stmt,
+		JSAtomListElement *label);
+
+/*
+ * Pop tc->topStmt.  If the top JSStmtInfo struct is not stack-allocated, it
+ * is up to the caller to free it.
+ */
+extern void
+js_PopStatement(JSTreeContext *tc);
+
+/*
+ * Like js_PopStatement(&cg->treeContext), also patch breaks and continues.
+ * May fail if a jump offset overflows.
+ */
+extern JSBool
+js_PopStatementCG(JSContext *cx, JSCodeGenerator *cg);
+
+/*
+ * Emit code into cg for the tree rooted at pn.
+ */
+extern JSBool
+js_EmitTree(JSContext *cx, JSCodeGenerator *cg, JSParseNode *pn);
+
+/*
+ * Emit code into cg for the tree rooted at body, then create a persistent
+ * script for fun from cg.
+ */
+extern JSBool
+js_EmitFunctionBody(JSContext *cx, JSCodeGenerator *cg, JSParseNode *body,
+		    JSFunction *fun);
+
+/*
+ * Source notes generated along with bytecode for decompiling and debugging.
+ * A source note is a uint8 with 5 bits of type and 3 of offset from the pc of
+ * the previous note.  If 3 bits of offset aren't enough, extended delta notes
+ * (SRC_XDELTA) consisting of 2 set high order bits followed by 6 offset bits
+ * are emitted before the next note.  Some notes have operand offsets encoded
+ * immediately after them, in note bytes or byte-triples.
+ *
+ * At most one "gettable" note (i.e., a note of type other than SRC_NEWLINE,
+ * SRC_SETLINE, and SRC_XDELTA) applies to a given bytecode.
+ *
+ * NB: the js_SrcNoteName and js_SrcNoteArity arrays in jsemit.c are indexed
+ * by this enum, so their initializers need to match the order here.
+ */
+typedef enum JSSrcNoteType {
+    SRC_NULL        = 0,        /* terminates a note vector */
+    SRC_IF          = 1,        /* JSOP_IFEQ bytecode is from an if-then */
+    SRC_IF_ELSE     = 2,        /* JSOP_IFEQ bytecode is from an if-then-else */
+    SRC_WHILE       = 3,        /* JSOP_IFEQ is from a while loop */
+    SRC_FOR         = 4,        /* JSOP_NOP or JSOP_POP in for loop head */
+    SRC_CONTINUE    = 5,        /* JSOP_GOTO is a continue, not a break;
+                                   also used on JSOP_ENDINIT if extra comma
+                                   at end of array literal: [1,2,,] */
+    SRC_VAR         = 6,        /* JSOP_NAME/FORNAME with a var declaration */
+    SRC_PCDELTA     = 7,        /* offset from comma-operator to next POP,
+				   or from CONDSWITCH to first CASE opcode */
+    SRC_ASSIGNOP    = 8,        /* += or another assign-op follows */
+    SRC_COND        = 9,        /* JSOP_IFEQ is from conditional ?: operator */
+    SRC_PAREN       = 10,       /* JSOP_NOP generated to mark user parens */
+    SRC_HIDDEN      = 11,       /* opcode shouldn't be decompiled */
+    SRC_PCBASE      = 12,       /* offset of first obj.prop.subprop bytecode */
+    SRC_LABEL       = 13,       /* JSOP_NOP for label: with atomid immediate */
+    SRC_LABELBRACE  = 14,       /* JSOP_NOP for label: {...} begin brace */
+    SRC_ENDBRACE    = 15,       /* JSOP_NOP for label: {...} end brace */
+    SRC_BREAK2LABEL = 16,       /* JSOP_GOTO for 'break label' with atomid */
+    SRC_CONT2LABEL  = 17,       /* JSOP_GOTO for 'continue label' with atomid */
+    SRC_SWITCH      = 18,       /* JSOP_*SWITCH with offset to end of switch,
+				   2nd off to first JSOP_CASE if condswitch */
+    SRC_FUNCDEF     = 19,       /* JSOP_NOP for function f() with atomid */
+    SRC_TRYFIN	    = 20,       /* JSOP_NOP for try or finally section */
+    SRC_CATCH       = 21,       /* catch block has guard */
+    SRC_NEWLINE     = 22,       /* bytecode follows a source newline */
+    SRC_SETLINE     = 23,       /* a file-absolute source line number note */
+    SRC_XDELTA      = 24        /* 24-31 are for extended delta notes */
+} JSSrcNoteType;
+
+#define SN_TYPE_BITS            5
+#define SN_DELTA_BITS           3
+#define SN_XDELTA_BITS          6
+#define SN_TYPE_MASK            (JS_BITMASK(SN_TYPE_BITS) << SN_DELTA_BITS)
+#define SN_DELTA_MASK           ((ptrdiff_t)JS_BITMASK(SN_DELTA_BITS))
+#define SN_XDELTA_MASK          ((ptrdiff_t)JS_BITMASK(SN_XDELTA_BITS))
+
+#define SN_MAKE_NOTE(sn,t,d)    (*(sn) = (jssrcnote)                          \
+					  (((t) << SN_DELTA_BITS)             \
+					   | ((d) & SN_DELTA_MASK)))
+#define SN_MAKE_XDELTA(sn,d)    (*(sn) = (jssrcnote)                          \
+					  ((SRC_XDELTA << SN_DELTA_BITS)      \
+					   | ((d) & SN_XDELTA_MASK)))
+
+#define SN_IS_XDELTA(sn)        ((*(sn) >> SN_DELTA_BITS) >= SRC_XDELTA)
+#define SN_TYPE(sn)             (SN_IS_XDELTA(sn) ? SRC_XDELTA                \
+						  : *(sn) >> SN_DELTA_BITS)
+#define SN_SET_TYPE(sn,type)    SN_MAKE_NOTE(sn, type, SN_DELTA(sn))
+#define SN_IS_GETTABLE(sn)      (SN_TYPE(sn) < SRC_NEWLINE)
+
+#define SN_DELTA(sn)            ((ptrdiff_t)(SN_IS_XDELTA(sn)                 \
+					     ? *(sn) & SN_XDELTA_MASK         \
+					     : *(sn) & SN_DELTA_MASK))
+#define SN_SET_DELTA(sn,delta)  (SN_IS_XDELTA(sn)                             \
+				 ? SN_MAKE_XDELTA(sn, delta)                  \
+				 : SN_MAKE_NOTE(sn, SN_TYPE(sn), delta))
+
+#define SN_DELTA_LIMIT          ((ptrdiff_t)JS_BIT(SN_DELTA_BITS))
+#define SN_XDELTA_LIMIT         ((ptrdiff_t)JS_BIT(SN_XDELTA_BITS))
+
+/*
+ * Offset fields follow certain notes and are frequency-encoded: an offset in
+ * [0,0x7f] consumes one byte, an offset in [0x80,0x7fffff] takes three, and
+ * the high bit of the first byte is set.
+ */
+#define SN_3BYTE_OFFSET_FLAG    0x80
+#define SN_3BYTE_OFFSET_MASK    0x7f
+
+extern JS_FRIEND_DATA(const char *) js_SrcNoteName[];
+extern JS_FRIEND_DATA(uint8) js_SrcNoteArity[];
+extern JS_FRIEND_DATA(uintN) js_SrcNoteLength(jssrcnote *sn);
+
+#define SN_LENGTH(sn)           ((js_SrcNoteArity[SN_TYPE(sn)] == 0) ? 1      \
+				 : js_SrcNoteLength(sn))
+#define SN_NEXT(sn)             ((sn) + SN_LENGTH(sn))
+
+/* A source note array is terminated by an all-zero element. */
+#define SN_MAKE_TERMINATOR(sn)  (*(sn) = SRC_NULL)
+#define SN_IS_TERMINATOR(sn)    (*(sn) == SRC_NULL)
+
+/*
+ * Append a new source note of the given type (and therefore size) to cg's
+ * notes dynamic array, updating cg->noteCount.  Return the new note's index
+ * within the array pointed at by cg->notes.  Return -1 if out of memory.
+ */
+extern intN
+js_NewSrcNote(JSContext *cx, JSCodeGenerator *cg, JSSrcNoteType type);
+
+extern intN
+js_NewSrcNote2(JSContext *cx, JSCodeGenerator *cg, JSSrcNoteType type,
+	       ptrdiff_t offset);
+
+extern intN
+js_NewSrcNote3(JSContext *cx, JSCodeGenerator *cg, JSSrcNoteType type,
+	       ptrdiff_t offset1, ptrdiff_t offset2);
+
+/*
+ * Get and set the offset operand identified by which (0 for the first, etc.).
+ */
+extern JS_FRIEND_API(ptrdiff_t)
+js_GetSrcNoteOffset(jssrcnote *sn, uintN which);
+
+extern JSBool
+js_SetSrcNoteOffset(JSContext *cx, JSCodeGenerator *cg, uintN index,
+		    uintN which, ptrdiff_t offset);
+
+/*
+ * Finish taking source notes in cx's tempPool by copying them to new
+ * stable store allocated via JS_malloc.  Return null on malloc failure,
+ * which means this function reported an error.
+ */
+extern jssrcnote *
+js_FinishTakingSrcNotes(JSContext *cx, JSCodeGenerator *cg);
+
+/*
+ * Allocate cg->treeContext.tryCount notes (plus one for the end sentinel)
+ * from cx->tempPool and set up cg->tryBase/tryNext for exactly tryCount
+ * js_NewTryNote calls.  The storage is freed by js_ResetCodeGenerator.
+ */
+extern JSBool
+js_AllocTryNotes(JSContext *cx, JSCodeGenerator *cg);
+
+/*
+ * Grab the next trynote slot in cg, filling it in appropriately.
+ */
+extern JSTryNote *
+js_NewTryNote(JSContext *cx, JSCodeGenerator *cg, ptrdiff_t start,
+	      ptrdiff_t end, ptrdiff_t catchStart);
+
+/*
+ * Finish generating exception information, and copy it to JS_malloc
+ * storage.
+ */
+extern JSBool
+js_FinishTakingTryNotes(JSContext *cx, JSCodeGenerator *cg, JSTryNote **tryp);
+
+JS_END_EXTERN_C
+
+#endif /* jsemit_h___ */

mozilla/js/src/jsexn.c

@@ -0,0 +1,477 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS standard exception implementation.
+ */
+
+
+/*
+ * This is currently very messy, and in flux.  Don't anybody think
+ * I'm going to leave it like this.  No no.
+ */
+
+
+#include "jsstddef.h"
+#include "jstypes.h"
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#include "jsprf.h"
+#include "jsapi.h"
+#include "jscntxt.h"
+#include "jsconfig.h"
+#include "jsexn.h"
+
+#if JS_HAS_ERROR_EXCEPTIONS
+#if !JS_HAS_EXCEPTIONS
+# error "JS_HAS_EXCEPTIONS must be defined to use JS_HAS_ERROR_EXCEPTIONS"
+#endif
+
+JSObject *tlobj;
+
+/*
+ * This could end up just being the error report, but I
+ * want to learn how to support random garbage here.
+ *
+ * If I go with it, a rambling comment mentioning GC, memory management etc. is
+ * needed.
+ *
+ * I'd rather have the errorReport inline, to avoid the extra malloc'd object
+ * dangle.  But I'll figure that out later, if I still need it.
+ */
+typedef struct JSExnPrivate {
+    JSErrorReport *errorReport;
+    const char *message;
+} JSExnPrivate;
+
+
+/*
+ * Copy everything interesting about an error into allocated memory.
+ */
+static JSExnPrivate *
+exn_initPrivate(JSContext *cx, JSErrorReport *report, const char *message)
+{
+    JSExnPrivate *newPrivate;
+    JSErrorReport * newReport;
+    char *newMessage;
+
+    newPrivate = (JSExnPrivate *)JS_malloc(cx, sizeof (JSExnPrivate));
+
+    JS_ASSERT(message);
+    newMessage = (char *)JS_malloc(cx, strlen(message)+1);
+    strcpy(newMessage, message);
+    newPrivate->message = newMessage;
+
+    /* Copy the error report */
+    newReport = (JSErrorReport *)JS_malloc(cx, sizeof (JSErrorReport));
+
+    if (report->filename) {
+	newReport->filename =
+	    (const char *)JS_malloc(cx, strlen(report->filename)+1);
+	/* Ack.  Const! */
+	strcpy((char *)newReport->filename, report->filename);
+    } else {
+	newReport->filename = NULL;
+    }
+
+    newReport->lineno = report->lineno;
+
+    /*
+     * We don't need to copy linebuf and tokenptr, because they
+     * point into the deflated string cache.  (currently?)
+     */
+    newReport->linebuf = report->linebuf;
+    newReport->tokenptr = report->tokenptr;
+
+    /*
+     * But we do need to copy uclinebuf, uctokenptr, because they're
+     * pointers into internal tokenstream structs, and may go away.
+     * But only if they're non-null...
+     *
+     * NOTE nothing uses this and I'm not really maintaining it until
+     * I know it's the desired API.
+     *
+     * Temporarily disabled, because uclinebuf is 0x10 when I evaluate 'Math()'!
+     */
+
+#if 0
+    if (report->uclinebuf) {
+	size_t len = js_strlen(report->uclinebuf)+1;
+	newReport->uclinebuf =
+	    (const jschar *)JS_malloc(cx, len);
+	js_strncpy(newReport->uclinebuf, report->uclinebuf, len);
+	newReport->uctokenptr = newReport->uclinebuf + (report->uctokenptr -
+							report->uclinebuf);
+    } else
+#endif
+	newReport->uclinebuf = newReport->uctokenptr = NULL;
+
+    /* Note that this is before it gets flagged with JSREPORT_EXCEPTION */
+    newReport->flags = report->flags;
+
+    /* Skipping *ucmessage, **messageArgs for now.  My guess is that it'll just
+     * mean copying the pointers, and adding another GC root.  Then de-rooting
+     * them in the finalizer.  Dunno if they're rooted in the first place -
+     * maybe it's only relevant for an exception that goes where it pleases,
+     * and not for the formerly stack-bound use of the error report.
+     */
+
+    newPrivate->errorReport = newReport;
+
+    return newPrivate;
+}
+
+/*
+ * Undo all the damage done by exn_initPrivate.
+ */
+static void
+exn_destroyPrivate(JSContext *cx, JSExnPrivate *privateData)
+{
+    JS_ASSERT(privateData->message);
+    /* ! what does const do? */
+    JS_free(cx, (void *)privateData->message);
+
+    JS_ASSERT(privateData->errorReport);
+    if (privateData->errorReport->uclinebuf)
+	JS_free(cx, (void *)privateData->errorReport->uclinebuf);
+
+    if (privateData->errorReport->filename)
+	JS_free(cx, (void *)privateData->errorReport->filename);
+
+    JS_free(cx, privateData->errorReport);
+
+    JS_free(cx, privateData);
+}
+
+/* Destroy associated data... */
+static void
+exn_finalize(JSContext *cx, JSObject *obj)
+{
+    JSExnPrivate *privateData;
+
+    privateData = (JSExnPrivate *)
+	JSVAL_TO_PRIVATE(OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE));
+
+    if (privateData) {
+	exn_destroyPrivate(cx, privateData);
+    }
+}
+
+/* This must be kept in synch with the exceptions array below. */
+typedef enum JSExnType {
+    JSEXN_NONE = -1,
+    JSEXN_EXCEPTION,
+      JSEXN_ERR,
+	JSEXN_INTERNALERR,
+	JSEXN_SYNTAXERR,
+	JSEXN_REFERENCEERR,
+	JSEXN_CALLERR,
+	  JSEXN_TARGETERR,
+	JSEXN_CONSTRUCTORERR,
+	JSEXN_CONVERSIONERR,
+	  JSEXN_TOOBJECTERR,
+	  JSEXN_TOPRIMITIVEERR,
+	  JSEXN_DEFAULTVALUEERR,
+	JSEXN_ARRAYERR,
+	JSEXN_LIMIT
+} JSExnType;
+
+#define FLAGS JSCLASS_HAS_PRIVATE
+
+/* Maybe #define RANDOM_CLASS(name, prototype) 4 here? */
+struct JSExnSpec {
+    int protoIndex;
+    JSClass theclass;
+};
+
+/*
+ * I want to replace all of these with just one class.  All we really care
+ * about is the prototypes, and the constructor names.
+ */
+static struct JSExnSpec exceptions[] = {
+    { JSEXN_NONE, /* No proto? */ {
+	"Exception", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_EXCEPTION, {
+	"Error", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"InternalError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"SyntaxError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"ReferenceError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"CallError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_CALLERR, {
+	"TargetError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"ConstructorError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"ConversionError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_CONVERSIONERR, {
+	"ToObjectError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_CONVERSIONERR, {
+	"ToPrimitiveError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_CONVERSIONERR, {
+	"DefaultValueError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    { JSEXN_ERR, {
+	"ArrayError", FLAGS,
+	JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,  JS_PropertyStub,
+	JS_EnumerateStub, JS_ResolveStub,   JS_ConvertStub,   exn_finalize
+    } },
+    {0}
+};
+
+static JSBool
+Exception(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
+{
+    if (!cx->fp->constructing) {
+	return JS_TRUE;
+    }
+
+    /* gotta null out that private data */
+    OBJ_SET_SLOT(cx, obj, JSSLOT_PRIVATE, JSVAL_NULL);
+    return JS_TRUE;
+}
+
+/*
+ * Convert to string.  Much of this is taken from js.c.
+ *
+ * I should rewrite this to use message, line, file etc. from
+ * javascript-modifiable properties (which might be lazily created
+ * from the encapsulated error report.)
+ */
+static JSBool
+exn_toString(JSContext *cx, JSObject *obj, uintN argc, jsval *argv, jsval *rval)
+{
+    JSString *str;
+    JSExnPrivate *privateData;
+    JSErrorReport *report;
+    jsval v;
+    char *name;
+    JSClass *theclass;
+
+    /* Check needed against incompatible target... */
+
+    /* Try to include the exception name in the error message. */
+    theclass = OBJ_GET_CLASS(cx, obj);
+    name = theclass->name;
+
+    v = OBJ_GET_SLOT(cx, obj, JSSLOT_PRIVATE);
+
+    if (!JSVAL_IS_NULL(v)) {
+	char *msgbuf, *tmp;
+
+	privateData = JSVAL_TO_PRIVATE(v);
+	report = privateData->errorReport;
+
+	msgbuf = JS_smprintf("%s:", name);
+
+	if (report->filename) {
+	    tmp = msgbuf;
+	    msgbuf = JS_smprintf("%s%s:", tmp, report->filename);
+	    JS_free(cx, tmp);
+	}
+	if (report->lineno) {
+	    tmp = msgbuf;
+	    msgbuf = JS_smprintf("%s%u: ", tmp ? tmp : "", report->lineno);
+	    if (tmp)
+		JS_free(cx, tmp);
+	}
+	JS_ASSERT(privateData->message);
+	tmp = msgbuf;
+	msgbuf = JS_smprintf("%s%s", tmp ? tmp : "", privateData->message);
+	if(tmp)
+	    JS_free(cx, tmp);
+
+	str = JS_NewStringCopyZ(cx, msgbuf);
+    } else {
+	str = JS_NewStringCopyZ(cx, "some non-engine-thrown exception");
+    }
+    if (!str)
+	return JS_FALSE;
+    *rval = STRING_TO_JSVAL(str);
+    return JS_TRUE;
+}
+
+static JSFunctionSpec exception_methods[] = {
+    {js_toString_str,   exn_toString,           0},
+    {0}
+};
+
+JSObject *
+js_InitExceptionClasses(JSContext *cx, JSObject *obj)
+{
+
+    JSObject *protos[JSEXN_LIMIT];
+    int i;
+
+    for (i = 0; exceptions[i].theclass.name != 0; i++) {
+	int protoidx = exceptions[i].protoIndex;
+	protos[i] = JS_InitClass(cx, obj,
+				 ((protoidx >= 0) ? protos[protoidx] : NULL),
+				 &(exceptions[i].theclass),
+				 Exception, 1,
+				 NULL,
+				 exception_methods,
+				 NULL,
+				 NULL);
+
+	/* So finalize knows whether to. */
+	OBJ_SET_SLOT(cx, protos[i], JSSLOT_PRIVATE, JSVAL_NULL);
+    }
+
+    /*
+     * JS_InitClass magically replaces a null prototype with Object.prototype,
+     * so we need to explicitly assign to the proto slot to get null.
+     *
+     * Temporarily disabled until I do toString for Exception.
+     */
+
+/*     protos[0]->slots[JSSLOT_PROTO] = JSVAL_NULL; */
+
+    return protos[0];
+}
+
+static JSErrorReport *
+js_GetErrorFromException(JSContext *cx, JSObject *errobj)
+{
+    JSExnPrivate *privateData;
+#if 0
+    {
+	JSClass *errobjclass;
+	/* Assert that we have an Exception object */
+	/* This assert does the right thing, but we can't use it yet, because
+	 * we're throwing lots of different exception classes. */
+	errobjclass = OBJ_GET_CLASS(cx, errobj);
+	JS_ASSERT(errobjclass == &(exceptions[JSEXN_CALLERR].theclass));
+    }
+#endif
+    privateData = JSVAL_TO_PRIVATE(OBJ_GET_SLOT(cx, errobj, JSSLOT_PRIVATE));
+
+    /* Still OK to return NULL, tho. */
+    return privateData->errorReport;
+}
+
+static JSExnType errorToException[] = {
+#define MSG_DEF(name, number, count, exception, format) \
+    exception,
+#include "js.msg"
+#undef MSG_DEF
+};
+
+#if defined ( DEBUG_mccabe ) && defined ( PRINTNAMES )
+/* For use below... get character strings for error name and exception name */
+static struct exnname { char *name; char *exception; } errortoexnname[] = {
+#define MSG_DEF(name, number, count, exception, format) \
+    {#name, #exception},
+#include "js.msg"
+#undef MSG_DEF
+};
+#endif /* DEBUG */
+
+JSBool
+js_ErrorToException(JSContext *cx, JSErrorReport *reportp, const char *message)
+{
+    JSErrNum errorNumber;
+    JSObject *errobj;
+    JSExnType exn;
+    JSExnPrivate *privateData;
+
+    JS_ASSERT(reportp);
+    errorNumber = reportp->errorNumber;
+    exn = errorToException[errorNumber];
+    JS_ASSERT(exn < JSEXN_LIMIT);
+
+#if defined( DEBUG_mccabe ) && defined ( PRINTNAMES )
+    /* Print the error name and the associated exception name to stderr */
+    fprintf(stderr, "%s\t%s\n",
+	    errortoexnname[errorNumber].name,
+	    errortoexnname[errorNumber].exception);
+#endif
+
+    /*
+     * Return false (no exception raised) if no exception is associated
+     * with the given error number.
+     */
+    if (exn == JSEXN_NONE)
+	return JS_FALSE;
+
+    /*
+     * Should (?) be js_ConstructObject... switching to NewObject
+     * in the speculation that it won't require a frame.  DefaultValue trouble.
+     * And it seems to work????  For the record, the trouble was that
+     * cx->fp was null when trying to construct the object...
+     */
+    errobj = js_NewObject(cx,
+			  &(exceptions[exn].theclass),
+			  NULL, NULL);
+
+    /*
+     * Construct a new copy of the error report, and store it in the
+     * exception objects' private data.  We can't use the error report
+     * handed in, because it's stack-allocated, and may point to transient
+     * data in the JSTokenStream.
+     */
+
+    /* XXX report failure? */
+    privateData = exn_initPrivate(cx, reportp, message);
+    OBJ_SET_SLOT(cx, errobj, JSSLOT_PRIVATE, PRIVATE_TO_JSVAL(privateData));
+
+    JS_SetPendingException(cx, OBJECT_TO_JSVAL(errobj));
+    reportp->flags |= JSREPORT_EXCEPTION;
+    return JS_TRUE;
+}
+
+#endif /* JS_HAS_ERROR_EXCEPTIONS */
+

mozilla/js/src/jsexn.h

@@ -0,0 +1,47 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS runtime exception classes.
+ */
+
+#ifndef jsexn_h___
+#define jsexn_h___
+
+JS_BEGIN_EXTERN_C
+
+/*
+ * Initialize exception object hierarchy.
+ */
+extern JSObject *
+js_InitExceptionClasses(JSContext *cx, JSObject *obj);
+
+/*
+ * Given a JSErrorReport, check to see if there is an exception associated
+ * with the error number.  If there is, then create an appropriate exception
+ * object, set it as the pending exception, and set the JSREPORT_EXCEPTION
+ * flag on the error report.  Exception-aware host error reporters will
+ * know to ignore error reports so flagged.  Returns JS_TRUE if an associated
+ * exception is found, JS_FALSE if none.
+ */
+extern JSBool
+js_ErrorToException(JSContext *cx, JSErrorReport *reportp, const char *message);
+
+JS_END_EXTERN_C
+
+#endif /* jsexn_h___ */

mozilla/js/src/jsfun.h

@@ -0,0 +1,106 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsfun_h___
+#define jsfun_h___
+/*
+ * JS function definitions.
+ */
+#include "jsprvtd.h"
+#include "jspubtd.h"
+
+JS_BEGIN_EXTERN_C
+
+struct JSFunction {
+    jsrefcount	 nrefs;		/* number of referencing objects */
+    JSObject     *object;       /* back-pointer to GC'ed object header */
+    JSNative     call;          /* native method pointer or null */
+    uint16       nargs;         /* minimum number of actual arguments */
+    uint16       extra;         /* number of arg slots for local GC roots */
+    uint16       nvars;         /* number of local variables */
+    uint8        flags;         /* bound method and other flags, see jsapi.h */
+    uint8        spare;         /* reserved for future use */
+    JSAtom       *atom;         /* name for diagnostics and decompiling */
+    JSScript     *script;       /* interpreted bytecode descriptor or null */
+};
+
+extern JSClass js_ArgumentsClass;
+extern JSClass js_CallClass;
+extern JSClass js_ClosureClass;
+/* JS_FRIEND_DATA so that JSVAL_IS_FUNCTION is callable from outside */
+extern JS_FRIEND_DATA(JSClass) js_FunctionClass;
+
+/*
+ * NB: jsapi.h and jsobj.h must be included before any call to this macro.
+ */
+#define JSVAL_IS_FUNCTION(cx, v)                                              \
+    (JSVAL_IS_OBJECT(v) && JSVAL_TO_OBJECT(v) &&                              \
+     OBJ_GET_CLASS(cx, JSVAL_TO_OBJECT(v)) == &js_FunctionClass)
+
+extern JSBool
+js_IsIdentifier(JSString *str);
+
+extern JSObject *
+js_InitFunctionClass(JSContext *cx, JSObject *obj);
+
+extern JSBool
+js_InitArgsCallClosureClasses(JSContext *cx, JSObject *obj,
+			      JSObject *arrayProto);
+
+extern JSFunction *
+js_NewFunction(JSContext *cx, JSObject *funobj, JSNative call, uintN nargs,
+	       uintN flags, JSObject *parent, JSAtom *atom);
+
+extern JSBool
+js_LinkFunctionObject(JSContext *cx, JSFunction *fun, JSObject *object);
+
+extern JSFunction *
+js_DefineFunction(JSContext *cx, JSObject *obj, JSAtom *atom, JSNative call,
+		  uintN nargs, uintN flags);
+
+extern JSFunction *
+js_ValueToFunction(JSContext *cx, jsval *vp, JSBool constructing);
+
+extern void
+js_ReportIsNotFunction(JSContext *cx, jsval *vp, JSBool constructing);
+
+extern JSObject *
+js_GetCallObject(JSContext *cx, JSStackFrame *fp, JSObject *parent,
+		 JSObject *withobj);
+
+extern JSBool
+js_PutCallObject(JSContext *cx, JSStackFrame *fp);
+
+extern JSBool
+js_GetCallVariable(JSContext *cx, JSObject *obj, jsval id, jsval *vp);
+
+extern JSBool
+js_SetCallVariable(JSContext *cx, JSObject *obj, jsval id, jsval *vp);
+
+extern JSObject *
+js_GetArgsObject(JSContext *cx, JSStackFrame *fp);
+
+extern JSBool
+js_PutArgsObject(JSContext *cx, JSStackFrame *fp);
+
+extern JSBool
+js_XDRFunction(JSXDRState *xdr, JSObject **objp);
+
+JS_END_EXTERN_C
+
+#endif /* jsfun_h___ */

mozilla/js/src/jsgc.c

@@ -0,0 +1,925 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+/*
+ * JS Mark-and-Sweep Garbage Collector.
+ *
+ * This GC allocates only fixed-sized things big enough to contain two words
+ * (pointers) on any host architecture.  It allocates from an arena pool (see
+ * jsarena.h).  It uses a parallel arena-pool array of flag bytes to hold the
+ * mark bit, finalizer type index, etc.
+ *
+ * XXX swizzle page to freelist for better locality of reference
+ */
+#include "jsstddef.h"
+#include <stdlib.h>     /* for free, called by JS_ARENA_DESTROY */
+#include <string.h>	/* for memset, called by jsarena.h macros if DEBUG */
+#include "jstypes.h"
+#ifndef NSPR20
+#include "jsarena.h"
+#else
+/* Removed by JSIFY: #include "plarena.h"
+ */
+#include "jsarena.h" /* Added by JSIFY */
+#endif
+/* Removed by JSIFY: #include "prlog.h" */
+#include "jsutil.h" /* Added by JSIFY */
+#ifndef NSPR20
+#include "jshash.h"
+#else
+/* Removed by JSIFY: #include "JShash.h"
+ */
+#include "jshash.h" /* Added by JSIFY */
+#endif
+#include "jsapi.h"
+#include "jsatom.h"
+#include "jscntxt.h"
+#include "jsfun.h"
+#include "jsgc.h"
+#include "jsinterp.h"
+#include "jslock.h"
+#include "jsnum.h"
+#include "jsobj.h"
+#include "jsscope.h"
+#include "jsscript.h"
+#include "jsstr.h"
+
+/*
+ * Arena sizes, the first must be a multiple of the second so the two arena
+ * pools can be maintained (in particular, arenas may be destroyed from the
+ * middle of each pool) in parallel.
+ */
+#define GC_ARENA_SIZE	8192		/* 1024 (512 on Alpha) objects */
+#define GC_FLAGS_SIZE	(GC_ARENA_SIZE / sizeof(JSGCThing))
+#define GC_ROOTS_SIZE	256		/* SWAG, small enough to amortize */
+
+static JSHashNumber   gc_hash_root(const void *key);
+
+struct JSGCThing {
+    JSGCThing       *next;
+    uint8           *flagp;
+};
+
+typedef void (*GCFinalizeOp)(JSContext *cx, JSGCThing *thing);
+
+static GCFinalizeOp gc_finalizers[GCX_NTYPES];
+
+#ifdef JS_GCMETER
+#define METER(x) x
+#else
+#define METER(x) /* nothing */
+#endif
+
+JSBool
+js_InitGC(JSRuntime *rt, uint32 maxbytes)
+{
+    if (!gc_finalizers[GCX_OBJECT]) {
+	gc_finalizers[GCX_OBJECT] = (GCFinalizeOp)js_FinalizeObject;
+	gc_finalizers[GCX_STRING] = (GCFinalizeOp)js_FinalizeString;
+	gc_finalizers[GCX_DOUBLE] = (GCFinalizeOp)js_FinalizeDouble;
+    }
+
+    JS_InitArenaPool(&rt->gcArenaPool, "gc-arena", GC_ARENA_SIZE,
+		     sizeof(JSGCThing));
+    JS_InitArenaPool(&rt->gcFlagsPool, "gc-flags", GC_FLAGS_SIZE,
+		     sizeof(uint8));
+    rt->gcRootsHash = JS_NewHashTable(GC_ROOTS_SIZE, gc_hash_root,
+				      JS_CompareValues, JS_CompareValues,
+				      NULL, NULL);
+    if (!rt->gcRootsHash)
+	return JS_FALSE;
+    rt->gcMaxBytes = maxbytes;
+    return JS_TRUE;
+}
+
+#ifdef JS_GCMETER
+void
+js_DumpGCStats(JSRuntime *rt, FILE *fp)
+{
+    fprintf(fp, "\nGC allocation statistics:\n");
+    fprintf(fp, "     bytes currently allocated: %lu\n", rt->gcBytes);
+    fprintf(fp, "                alloc attempts: %lu\n", rt->gcStats.alloc);
+    fprintf(fp, "            GC freelist length: %lu\n", rt->gcStats.freelen);
+    fprintf(fp, "  recycles through GC freelist: %lu\n", rt->gcStats.recycle);
+    fprintf(fp, "alloc retries after running GC: %lu\n", rt->gcStats.retry);
+    fprintf(fp, "           allocation failures: %lu\n", rt->gcStats.fail);
+    fprintf(fp, "              valid lock calls: %lu\n", rt->gcStats.lock);
+    fprintf(fp, "            valid unlock calls: %lu\n", rt->gcStats.unlock);
+    fprintf(fp, "   locks that hit stuck counts: %lu\n", rt->gcStats.stuck);
+    fprintf(fp, " unlocks that saw stuck counts: %lu\n", rt->gcStats.unstuck);
+    fprintf(fp, "          mark recursion depth: %lu\n", rt->gcStats.depth);
+    fprintf(fp, "  maximum mark recursion depth: %lu\n", rt->gcStats.maxdepth);
+    fprintf(fp, "      maximum GC nesting level: %lu\n", rt->gcStats.maxlevel);
+    fprintf(fp, "   potentially useful GC calls: %lu\n", rt->gcStats.poke);
+    fprintf(fp, "              useless GC calls: %lu\n", rt->gcStats.nopoke);
+    fprintf(fp, "        thing arena corruption: %lu\n", rt->gcStats.badarena);
+    fprintf(fp, "        flags arena corruption: %lu\n", rt->gcStats.badflag);
+    fprintf(fp, "     thing arenas freed so far: %lu\n", rt->gcStats.afree);
+    fprintf(fp, "     flags arenas freed so far: %lu\n", rt->gcStats.fafree);
+#ifdef JS_ARENAMETER
+    JS_DumpArenaStats(fp);
+#endif
+}
+#endif
+
+void
+js_FinishGC(JSRuntime *rt)
+{
+#ifdef JS_ARENAMETER
+    JS_DumpArenaStats(stdout);
+#endif
+#ifdef JS_GCMETER
+    js_DumpGCStats(rt, stdout);
+#endif
+    JS_FinishArenaPool(&rt->gcArenaPool);
+    JS_FinishArenaPool(&rt->gcFlagsPool);
+    JS_ArenaFinish();
+    JS_HashTableDestroy(rt->gcRootsHash);
+    rt->gcRootsHash = NULL;
+    rt->gcFreeList = NULL;
+}
+
+JSBool
+js_AddRoot(JSContext *cx, void *rp, const char *name)
+{
+    JSRuntime *rt;
+    JSBool ok;
+
+    rt = cx->runtime;
+    JS_LOCK_GC_VOID(rt,
+	ok = (JS_HashTableAdd(rt->gcRootsHash, rp, (void *)name) != NULL));
+    if (!ok)
+	JS_ReportOutOfMemory(cx);
+    return ok;
+}
+
+JSBool
+js_RemoveRoot(JSContext *cx, void *rp)
+{
+    JSRuntime *rt;
+
+    rt = cx->runtime;
+    JS_LOCK_GC_VOID(rt, JS_HashTableRemove(rt->gcRootsHash, rp));
+    return JS_TRUE;
+}
+
+void *
+js_AllocGCThing(JSContext *cx, uintN flags)
+{
+    JSRuntime *rt;
+    JSGCThing *thing;
+    uint8 *flagp;
+#ifdef TOO_MUCH_GC
+    JSBool tried_gc = JS_TRUE;
+    js_GC(cx);
+#else
+    JSBool tried_gc = JS_FALSE;
+#endif
+
+    rt = cx->runtime;
+    JS_LOCK_GC(rt);
+    METER(rt->gcStats.alloc++);
+retry:
+    thing = rt->gcFreeList;
+    if (thing) {
+	rt->gcFreeList = thing->next;
+	flagp = thing->flagp;
+	METER(rt->gcStats.freelen--);
+	METER(rt->gcStats.recycle++);
+    } else {
+	if (rt->gcBytes < rt->gcMaxBytes) {
+	    JS_ARENA_ALLOCATE(thing, &rt->gcArenaPool, sizeof(JSGCThing));
+	    JS_ARENA_ALLOCATE(flagp, &rt->gcFlagsPool, sizeof(uint8));
+	}
+	if (!thing || !flagp) {
+	    if (thing)
+		JS_ARENA_RELEASE(&rt->gcArenaPool, thing);
+	    if (!tried_gc) {
+		JS_UNLOCK_GC(rt);
+		js_GC(cx);
+		tried_gc = JS_TRUE;
+		JS_LOCK_GC(rt);
+		METER(rt->gcStats.retry++);
+		goto retry;
+	    }
+	    METER(rt->gcStats.fail++);
+	    JS_UNLOCK_GC(rt);
+	    JS_ReportOutOfMemory(cx);
+	    return NULL;
+	}
+    }
+    *flagp = (uint8)flags;
+    rt->gcBytes += sizeof(JSGCThing) + sizeof(uint8);
+    cx->newborn[flags & GCF_TYPEMASK] = thing;
+
+    /*
+     * Clear thing before unlocking in case a GC run is about to scan it,
+     * finding it via cx->newborn[].
+     */
+    thing->next = NULL;
+    thing->flagp = NULL;
+    JS_UNLOCK_GC(rt);
+    return thing;
+}
+
+static uint8 *
+gc_find_flags(JSRuntime *rt, void *thing)
+{
+    jsuword index, offset, length;
+    JSArena *a, *fa;
+
+    index = 0;
+    for (a = rt->gcArenaPool.first.next; a; a = a->next) {
+	offset = JS_UPTRDIFF(thing, a->base);
+	length = a->avail - a->base;
+	if (offset < length) {
+	    index += offset / sizeof(JSGCThing);
+	    for (fa = rt->gcFlagsPool.first.next; fa; fa = fa->next) {
+		offset = fa->avail - fa->base;
+		if (index < offset)
+		    return (uint8 *)fa->base + index;
+		index -= offset;
+	    }
+	    return NULL;
+	}
+	index += length / sizeof(JSGCThing);
+    }
+    return NULL;
+}
+
+JSBool
+js_LockGCThing(JSContext *cx, void *thing)
+{
+    uint8 *flagp, flags;
+
+    if (!thing)
+	return JS_TRUE;
+    flagp = gc_find_flags(cx->runtime, thing);
+    if (!flagp)
+	return JS_FALSE;
+    flags = *flagp;
+    if ((flags & GCF_LOCKMASK) != GCF_LOCKMASK) {
+	*flagp = (uint8)(flags + GCF_LOCK);
+    } else {
+	METER(cx->runtime->gcStats.stuck++);
+    }
+    METER(cx->runtime->gcStats.lock++);
+    return JS_TRUE;
+}
+
+JSBool
+js_UnlockGCThing(JSContext *cx, void *thing)
+{
+    uint8 *flagp, flags;
+
+    if (!thing)
+	return JS_TRUE;
+    flagp = gc_find_flags(cx->runtime, thing);
+    if (!flagp)
+	return JS_FALSE;
+    flags = *flagp;
+    if ((flags & GCF_LOCKMASK) != GCF_LOCKMASK) {
+	*flagp = (uint8)(flags - GCF_LOCK);
+    } else {
+	METER(cx->runtime->gcStats.unstuck++);
+    }
+    METER(cx->runtime->gcStats.unlock++);
+    return JS_TRUE;
+}
+
+#ifdef GC_MARK_DEBUG
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "jsprf.h"
+
+JS_FRIEND_DATA(FILE *) js_DumpGCHeap;
+JS_FRIEND_DATA(void *) js_LiveThingToFind;
+
+typedef struct GCMarkNode GCMarkNode;
+
+struct GCMarkNode {
+    void        *thing;
+    char        *name;
+    GCMarkNode  *next;
+    GCMarkNode  *prev;
+};
+
+static void
+gc_dump_thing(JSGCThing *thing, uint8 flags, GCMarkNode *prev, FILE *fp)
+{
+    GCMarkNode *next = NULL;
+    char *path = NULL;
+    JSObject *obj;
+    JSClass *clasp;
+
+    while (prev) {
+	next = prev;
+	prev = prev->prev;
+    }
+    while (next) {
+	path = JS_sprintf_append(path, "%s.", next->name);
+	next = next->next;
+    }
+    if (!path)
+	return;
+
+    fprintf(fp, "%08lx ", (long)thing);
+    switch (flags & GCF_TYPEMASK) {
+      case GCX_OBJECT:
+	obj = (JSObject *)thing;
+	clasp = JSVAL_TO_PRIVATE(obj->slots[JSSLOT_CLASS]);
+	fprintf(fp, "object %s", clasp->name);
+	break;
+      case GCX_STRING:
+	fprintf(fp, "string %s", JS_GetStringBytes((JSString *)thing));
+	break;
+      case GCX_DOUBLE:
+	fprintf(fp, "double %g", *(jsdouble *)thing);
+	break;
+      case GCX_DECIMAL:
+	break;
+    }
+    fprintf(fp, " via %s\n", path);
+    free(path);
+}
+
+static void
+gc_mark_node(JSRuntime *rt, void *thing, GCMarkNode *prev);
+
+#define GC_MARK(_rt, _thing, _name, _prev)                                    \
+    JS_BEGIN_MACRO                                                            \
+	GCMarkNode _node;                                                     \
+	_node.thing = _thing;                                                 \
+	_node.name  = _name;                                                  \
+	_node.next  = NULL;                                                   \
+	_node.prev  = _prev;                                                  \
+	if (_prev) ((GCMarkNode *)(_prev))->next = &_node;                    \
+	gc_mark_node(_rt, _thing, &_node);                                    \
+    JS_END_MACRO
+
+static void
+gc_mark(JSRuntime *rt, void *thing)
+{
+    GC_MARK(rt, thing, "atom", NULL);
+}
+
+#define GC_MARK_ATOM(rt, atom, prev)     gc_mark_atom(rt, atom, prev)
+#define GC_MARK_SCRIPT(rt, script, prev) gc_mark_script(rt, script, prev)
+
+#else  /* !GC_MARK_DEBUG */
+
+#define GC_MARK(rt, thing, name, prev)   gc_mark(rt, thing)
+#define GC_MARK_ATOM(rt, atom, prev)     gc_mark_atom(rt, atom)
+#define GC_MARK_SCRIPT(rt, script, prev) gc_mark_script(rt, script)
+
+static void
+gc_mark(JSRuntime *rt, void *thing);
+
+#endif /* !GC_MARK_DEBUG */
+
+static void
+gc_mark_atom(JSRuntime *rt, JSAtom *atom
+#ifdef GC_MARK_DEBUG
+  , GCMarkNode *prev
+#endif
+)
+{
+    jsval key;
+
+    if (!atom || atom->flags & ATOM_MARK)
+	return;
+    atom->flags |= ATOM_MARK;
+    key = ATOM_KEY(atom);
+    if (JSVAL_IS_GCTHING(key)) {
+#ifdef GC_MARK_DEBUG
+	char name[32];
+
+	if (JSVAL_IS_STRING(key)) {
+	    JS_snprintf(name, sizeof name, "'%s'",
+			JS_GetStringBytes(JSVAL_TO_STRING(key)));
+	} else {
+	    JS_snprintf(name, sizeof name, "<%x>", key);
+	}
+#endif
+	GC_MARK(rt, JSVAL_TO_GCTHING(key), name, prev);
+    }
+}
+
+static void
+gc_mark_script(JSRuntime *rt, JSScript *script
+#ifdef GC_MARK_DEBUG
+  , GCMarkNode *prev
+#endif
+)
+{
+    JSAtomMap *map;
+    uintN i, length;
+    JSAtom **vector;
+
+    map = &script->atomMap;
+    length = map->length;
+    vector = map->vector;
+    for (i = 0; i < length; i++)
+	GC_MARK_ATOM(rt, vector[i], prev);
+}
+
+static void
+#ifdef GC_MARK_DEBUG
+gc_mark_node(JSRuntime *rt, void *thing, GCMarkNode *prev)
+#else
+gc_mark(JSRuntime *rt, void *thing)
+#endif
+{
+    uint8 flags, *flagp;
+    JSObject *obj;
+    jsval v, *vp, *end;
+    JSScope *scope;
+    JSClass *clasp;
+    JSScript *script;
+    JSFunction *fun;
+    JSScopeProperty *sprop;
+    JSSymbol *sym;
+
+    if (!thing)
+	return;
+    flagp = gc_find_flags(rt, thing);
+    if (!flagp)
+	return;
+
+    /* Check for something on the GC freelist to handle recycled stack. */
+    flags = *flagp;
+    if (flags == GCF_FINAL)
+	return;
+
+#ifdef GC_MARK_DEBUG
+    if (js_LiveThingToFind == thing)
+	gc_dump_thing(thing, flags, prev, stderr);
+#endif
+
+    if (flags & GCF_MARK)
+	return;
+    *flagp |= GCF_MARK;
+    METER(if (++rt->gcStats.depth > rt->gcStats.maxdepth)
+	      rt->gcStats.maxdepth = rt->gcStats.depth);
+
+#ifdef GC_MARK_DEBUG
+    if (js_DumpGCHeap)
+	gc_dump_thing(thing, flags, prev, js_DumpGCHeap);
+#endif
+
+    if ((flags & GCF_TYPEMASK) == GCX_OBJECT) {
+	obj = thing;
+	vp = obj->slots;
+	if (vp) {
+	    scope = OBJ_IS_NATIVE(obj) ? (JSScope *) obj->map : NULL;
+	    if (scope) {
+		clasp = JSVAL_TO_PRIVATE(obj->slots[JSSLOT_CLASS]);
+
+		if (clasp == &js_ScriptClass) {
+		    v = vp[JSSLOT_PRIVATE];
+		    if (!JSVAL_IS_VOID(v)) {
+			script = JSVAL_TO_PRIVATE(v);
+			if (script)
+			    GC_MARK_SCRIPT(rt, script, prev);
+		    }
+		}
+
+		if (clasp == &js_FunctionClass) {
+		    v = vp[JSSLOT_PRIVATE];
+		    if (!JSVAL_IS_VOID(v)) {
+			fun = JSVAL_TO_PRIVATE(v);
+			if (fun) {
+			    if (fun->atom)
+				GC_MARK_ATOM(rt, fun->atom, prev);
+			    if (fun->script)
+				GC_MARK_SCRIPT(rt, fun->script, prev);
+			}
+		    }
+		}
+
+		for (sprop = scope->props; sprop; sprop = sprop->next) {
+		    for (sym = sprop->symbols; sym; sym = sym->next) {
+			if (JSVAL_IS_INT(sym_id(sym)))
+			    continue;
+			GC_MARK_ATOM(rt, sym_atom(sym), prev);
+		    }
+		}
+	    }
+	    if (!scope || scope->object == obj)
+		end = vp + obj->map->freeslot;
+	    else
+		end = vp + JS_INITIAL_NSLOTS;
+	    for (; vp < end; vp++) {
+		v = *vp;
+		if (JSVAL_IS_GCTHING(v)) {
+#ifdef GC_MARK_DEBUG
+		    char name[32];
+
+		    if (scope) {
+			uint32 slot;
+			jsval nval;
+
+			slot = vp - obj->slots;
+			for (sprop = scope->props; ; sprop = sprop->next) {
+			    if (!sprop) {
+				switch (slot) {
+				  case JSSLOT_PROTO:
+				    strcpy(name, "__proto__");
+				    break;
+				  case JSSLOT_PARENT:
+				    strcpy(name, "__parent__");
+				    break;
+				  case JSSLOT_PRIVATE:
+				    strcpy(name, "__private__");
+				    break;
+				  default:
+				    JS_snprintf(name, sizeof name,
+						"**UNKNOWN SLOT %ld**",
+						(long)slot);
+				    break;
+				}
+				break;
+			    }
+			    if (sprop->slot == slot) {
+				nval = sprop->symbols
+				       ? js_IdToValue(sym_id(sprop->symbols))
+				       : sprop->id;
+				if (JSVAL_IS_INT(nval)) {
+				    JS_snprintf(name, sizeof name, "%ld",
+						(long)JSVAL_TO_INT(nval));
+				} else if (JSVAL_IS_STRING(nval)) {
+				    JS_snprintf(name, sizeof name, "%s",
+				      JS_GetStringBytes(JSVAL_TO_STRING(nval)));
+				} else {
+				    strcpy(name, "**FINALIZED ATOM KEY**");
+				}
+				break;
+			    }
+			}
+		    }
+#endif
+		    GC_MARK(rt, JSVAL_TO_GCTHING(v), name, prev);
+		}
+	    }
+	}
+    }
+
+    METER(rt->gcStats.depth--);
+}
+
+static JSHashNumber
+gc_hash_root(const void *key)
+{
+    JSHashNumber num = (JSHashNumber) key;	/* help lame MSVC1.5 on Win16 */
+
+    return num >> 2;
+}
+
+STATIC_DLL_CALLBACK(intN)
+gc_root_marker(JSHashEntry *he, intN i, void *arg)
+{
+    void **rp = (void **)he->key;
+
+    if (*rp) {
+#ifdef DEBUG
+	JSArena *a;
+	JSRuntime *rt = (JSRuntime *)arg;
+
+	for (a = rt->gcArenaPool.first.next; a; a = a->next) {
+	    JS_ASSERT(!rp ||
+		      (*rp >= (void *)a->base && *rp <= (void *)a->avail));
+	}
+#endif
+	GC_MARK(arg, *rp, he->value ? he->value : "root", NULL);
+    }
+    return HT_ENUMERATE_NEXT;
+}
+
+JS_FRIEND_API(void)
+js_ForceGC(JSContext *cx)
+{
+    cx->newborn[GCX_OBJECT] = NULL;
+    cx->newborn[GCX_STRING] = NULL;
+    cx->newborn[GCX_DOUBLE] = NULL;
+    cx->runtime->gcPoke = JS_TRUE;
+    js_GC(cx);
+    JS_ArenaFinish();
+}
+
+void
+js_GC(JSContext *cx)
+{
+    JSRuntime *rt;
+    JSContext *iter, *acx;
+    JSArena *a, *ma, *fa, **ap, **fap;
+    jsval v, *vp, *sp;
+    jsuword begin, end;
+    JSStackFrame *fp, *chain;
+    void *mark;
+    uint8 flags, *flagp;
+    JSGCThing *thing, *final, **flp, **oflp;
+    GCFinalizeOp finalizer;
+    JSBool a_all_clear, f_all_clear;
+
+    /*
+     * XXX kludge for pre-ECMAv2 compile-time switch case expr eval, see
+     * jsemit.c:js_EmitTree, under case TOK_SWITCH: (look for XXX).
+     */
+    if (cx->gcDisabled)
+	return;
+
+    rt = cx->runtime;
+#ifdef JS_THREADSAFE
+    /* Avoid deadlock. */
+    JS_ASSERT(!JS_IS_RUNTIME_LOCKED(rt));
+#endif
+
+    /* Let the API user decide to defer a GC if it wants to. */
+    if (rt->gcCallback && !rt->gcCallback(cx, JSGC_BEGIN))
+	return;
+
+    /* Lock out other GC allocator and collector invocations. */
+    JS_LOCK_GC(rt);
+
+    /* Do nothing if no assignment has executed since the last GC. */
+    if (!rt->gcPoke) {
+	METER(rt->gcStats.nopoke++);
+	JS_UNLOCK_GC(rt);
+	return;
+    }
+    rt->gcPoke = JS_FALSE;
+    METER(rt->gcStats.poke++);
+
+#ifdef JS_THREADSAFE
+    /* Bump gcLevel and return rather than nest on this context. */
+    if (cx->gcActive) {
+	rt->gcLevel++;
+	METER(if (rt->gcLevel > rt->gcStats.maxlevel)
+		  rt->gcStats.maxlevel = rt->gcLevel);
+	if (rt->gcLevel > 1) {
+	    JS_UNLOCK_GC(rt);
+	    return;
+	}
+    }
+
+    /* If we're in a request, indicate, temporarily, that we're inactive. */
+    if (cx->requestDepth) {
+	rt->requestCount--;
+	JS_NOTIFY_REQUEST_DONE(rt);
+    }
+
+    /* If another thread is already in GC, don't attempt GC; wait instead. */
+    if (rt->gcLevel > 0) {
+	while (rt->gcLevel > 0)
+	    JS_AWAIT_GC_DONE(rt);
+	if (cx->requestDepth)
+	    rt->requestCount++;
+	JS_UNLOCK_GC(rt);
+	return;
+    }
+
+    /* No other thread is in GC, so indicate that we're now in GC. */
+    rt->gcLevel = 1;
+
+    /* Also indicate that GC is active on this context. */
+    cx->gcActive = JS_TRUE;
+
+    /* Wait for all other requests to finish. */
+    while (rt->requestCount > 0)
+	JS_AWAIT_REQUEST_DONE(rt);
+
+#else  /* !JS_THREADSAFE */
+
+    /* Bump gcLevel and return rather than nest; the outer gc will restart. */
+    rt->gcLevel++;
+    METER(if (rt->gcLevel > rt->gcStats.maxlevel)
+	      rt->gcStats.maxlevel = rt->gcLevel);
+    if (rt->gcLevel > 1)
+	return;
+
+#endif /* !JS_THREADSAFE */
+
+    /* Drop atoms held by the property cache, and clear property weak links. */
+    js_FlushPropertyCache(cx);
+restart:
+    rt->gcNumber++;
+
+    /* Mark phase. */
+    JS_HashTableEnumerateEntries(rt->gcRootsHash, gc_root_marker, rt);
+    js_MarkAtomState(&rt->atomState, gc_mark);
+    iter = NULL;
+    while ((acx = js_ContextIterator(rt, &iter)) != NULL) {
+	/*
+	 * Iterate frame chain and dormant chains. Temporarily tack current
+	 * frame onto the head of the dormant list to ease iteration.
+	 *
+	 * (NOTE: see comment on this whole 'dormant' thing in js_Execute)
+	 */
+	chain = acx->fp;
+	if (chain) {
+	    JS_ASSERT(!chain->dormantNext);
+	    chain->dormantNext = acx->dormantFrameChain;
+	} else {
+	    chain = acx->dormantFrameChain;
+	}
+	for (fp=chain; fp; fp = chain = chain->dormantNext) {
+	    sp = fp->sp;
+	    if (sp) {
+		for (a = acx->stackPool.first.next; a; a = a->next) {
+		    begin = a->base;
+		    end = a->avail;
+		    if (JS_UPTRDIFF(sp, begin) < JS_UPTRDIFF(end, begin))
+			end = (jsuword)sp;
+		    for (vp = (jsval *)begin; vp < (jsval *)end; vp++) {
+			v = *vp;
+			if (JSVAL_IS_GCTHING(v))
+			    GC_MARK(rt, JSVAL_TO_GCTHING(v), "stack", NULL);
+		    }
+		    if (end == (jsuword)sp)
+			break;
+		}
+	    }
+	    do {
+		GC_MARK(rt, fp->scopeChain, "scope chain", NULL);
+		GC_MARK(rt, fp->thisp, "this", NULL);
+		if (JSVAL_IS_GCTHING(fp->rval))
+		    GC_MARK(rt, JSVAL_TO_GCTHING(fp->rval), "rval", NULL);
+		if (fp->callobj)
+		    GC_MARK(rt, fp->callobj, "call object", NULL);
+		if (fp->argsobj)
+		    GC_MARK(rt, fp->argsobj, "arguments object", NULL);
+		if (fp->script)
+		    GC_MARK_SCRIPT(rt, fp->script, NULL);
+		if (fp->sharpArray)
+		    GC_MARK(rt, fp->sharpArray, "sharp array", NULL);
+	    } while ((fp = fp->down) != NULL);
+	}
+	/* cleanup temporary link */
+	if (acx->fp)
+	    acx->fp->dormantNext = NULL;
+	GC_MARK(rt, acx->globalObject, "global object", NULL);
+	GC_MARK(rt, acx->newborn[GCX_OBJECT], "newborn object", NULL);
+	GC_MARK(rt, acx->newborn[GCX_STRING], "newborn string", NULL);
+	GC_MARK(rt, acx->newborn[GCX_DOUBLE], "newborn double", NULL);
+#if JS_HAS_EXCEPTIONS
+	if (acx->throwing)
+	    GC_MARK(rt, acx->exception, "exception", NULL);
+#endif
+    }
+
+    /* Sweep phase.  Mark in tempPool for release at label out:. */
+    ma = cx->tempPool.current;
+    mark = JS_ARENA_MARK(&cx->tempPool);
+    js_SweepAtomState(&rt->atomState);
+    fa = rt->gcFlagsPool.first.next;
+    flagp = (uint8 *)fa->base;
+    for (a = rt->gcArenaPool.first.next; a; a = a->next) {
+	for (thing = (JSGCThing *)a->base; thing < (JSGCThing *)a->avail;
+	     thing++) {
+	    if (flagp >= (uint8 *)fa->avail) {
+		fa = fa->next;
+		JS_ASSERT(fa);
+		if (!fa) {
+		    METER(rt->gcStats.badflag++);
+		    goto out;
+		}
+		flagp = (uint8 *)fa->base;
+	    }
+	    flags = *flagp;
+	    if (flags & GCF_MARK) {
+		*flagp &= ~GCF_MARK;
+	    } else if (!(flags & (GCF_LOCKMASK | GCF_FINAL))) {
+		JS_ARENA_ALLOCATE(final, &cx->tempPool, sizeof(JSGCThing));
+		if (!final)
+		    goto out;
+		final->next = thing;
+		final->flagp = flagp;
+		JS_ASSERT(rt->gcBytes >= sizeof(JSGCThing) + sizeof(uint8));
+		rt->gcBytes -= sizeof(JSGCThing) + sizeof(uint8);
+	    }
+	    flagp++;
+	}
+    }
+
+    /* Finalize phase.  Don't hold the GC lock while running finalizers! */
+    JS_UNLOCK_GC(rt);
+    for (final = mark; ; final++) {
+	if ((jsuword)final >= ma->avail) {
+	    ma = ma->next;
+	    if (!ma)
+		break;
+	    final = (JSGCThing *)ma->base;
+	}
+	thing = final->next;
+	flagp = final->flagp;
+	flags = *flagp;
+	finalizer = gc_finalizers[flags & GCF_TYPEMASK];
+	if (finalizer) {
+	    *flagp |= GCF_FINAL;
+	    finalizer(cx, thing);
+	}
+
+	/*
+	 * Set flags to GCF_FINAL, signifying that thing is free, but don't
+	 * thread thing onto rt->gcFreeList.  We need the GC lock to rebuild
+	 * the freelist below while also looking for free-able arenas.
+	 */
+	*flagp = GCF_FINAL;
+    }
+    JS_LOCK_GC(rt);
+
+    /* Free unused arenas and rebuild the freelist. */
+    ap = &rt->gcArenaPool.first.next;
+    a = *ap;
+    if (!a)
+	goto out;
+    thing = (JSGCThing *)a->base;
+    a_all_clear = f_all_clear = JS_TRUE;
+    flp = oflp = &rt->gcFreeList;
+    *flp = NULL;
+    METER(rt->gcStats.freelen = 0);
+
+    fap = &rt->gcFlagsPool.first.next;
+    while ((fa = *fap) != NULL) {
+	/* XXX optimize by unrolling to use word loads */
+	for (flagp = (uint8 *)fa->base; ; flagp++) {
+	    JS_ASSERT(a);
+	    if (!a) {
+		METER(rt->gcStats.badarena++);
+		goto out;
+	    }
+	    if (thing >= (JSGCThing *)a->avail) {
+		if (a_all_clear) {
+		    JS_ARENA_DESTROY(&rt->gcArenaPool, a, ap);
+		    flp = oflp;
+		    METER(rt->gcStats.afree++);
+		} else {
+		    ap = &a->next;
+		    a_all_clear = JS_TRUE;
+		    oflp = flp;
+		}
+		a = *ap;
+		if (!a)
+		    break;
+		thing = (JSGCThing *)a->base;
+	    }
+	    if (flagp >= (uint8 *)fa->avail)
+		break;
+	    if (*flagp != GCF_FINAL) {
+		a_all_clear = f_all_clear = JS_FALSE;
+	    } else {
+		thing->flagp = flagp;
+		*flp = thing;
+		flp = &thing->next;
+		METER(rt->gcStats.freelen++);
+	    }
+	    thing++;
+	}
+	if (f_all_clear) {
+	    JS_ARENA_DESTROY(&rt->gcFlagsPool, fa, fap);
+	    METER(rt->gcStats.fafree++);
+	} else {
+	    fap = &fa->next;
+	    f_all_clear = JS_TRUE;
+	}
+    }
+
+    /* Terminate the new freelist. */
+    *flp = NULL;
+
+out:
+    JS_ARENA_RELEASE(&cx->tempPool, mark);
+    if (rt->gcLevel > 1) {
+	rt->gcLevel = 1;
+	goto restart;
+    }
+    rt->gcLevel = 0;
+    rt->gcLastBytes = rt->gcBytes;
+
+#ifdef JS_THREADSAFE
+    /* If we were invoked during a request, undo the temporary decrement. */
+    if (cx->requestDepth)
+	rt->requestCount++;
+    cx->gcActive = JS_FALSE;
+    JS_NOTIFY_GC_DONE(rt);
+    JS_UNLOCK_GC(rt);
+#endif
+    if (rt->gcCallback)
+	(void) rt->gcCallback(cx, JSGC_END);
+}

mozilla/js/src/jsgc.h

@@ -0,0 +1,110 @@
+/* -*- Mode: C; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
+ *
+ * The contents of this file are subject to the Netscape Public License
+ * Version 1.0 (the "NPL"); you may not use this file except in
+ * compliance with the NPL.  You may obtain a copy of the NPL at
+ * http://www.mozilla.org/NPL/
+ *
+ * Software distributed under the NPL is distributed on an "AS IS" basis,
+ * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the NPL
+ * for the specific language governing rights and limitations under the
+ * NPL.
+ *
+ * The Initial Developer of this code under the NPL is Netscape
+ * Communications Corporation.  Portions created by Netscape are
+ * Copyright (C) 1998 Netscape Communications Corporation.  All Rights
+ * Reserved.
+ */
+
+#ifndef jsgc_h___
+#define jsgc_h___
+/*
+ * JS Garbage Collector.
+ */
+#include "jspubtd.h"
+
+JS_BEGIN_EXTERN_C
+
+/* GC thing type indexes. */
+#define GCX_OBJECT	0			/* JSObject */
+#define GCX_STRING	1			/* JSString */
+#define GCX_DOUBLE	2			/* jsdouble */
+#define GCX_DECIMAL     3                       /* JSDecimal */
+#define GCX_NTYPES      4
+
+/* GC flag definitions (type index goes in low bits). */
+#define GCF_TYPEMASK	JS_BITMASK(2)		/* use low bits for type */
+#define GCF_MARK	JS_BIT(2)		/* mark bit */
+#define GCF_FINAL	JS_BIT(3)		/* in finalization bit */
+#define GCF_LOCKBIT	4			/* lock bit shift and mask */
+#define GCF_LOCKMASK	(JS_BITMASK(4) << GCF_LOCKBIT)
+#define GCF_LOCK	JS_BIT(GCF_LOCKBIT)	/* lock request bit in API */
+
+#if 1
+/*
+ * Since we're forcing a GC from JS_GC anyway, don't bother wasting cycles
+ * loading oldval.  XXX remove implied force, poke in addroot/removeroot, &c
+ */
+#define GC_POKE(cx, oldval) ((cx)->runtime->gcPoke = JS_TRUE)
+#else
+#define GC_POKE(cx, oldval) ((cx)->runtime->gcPoke = JSVAL_IS_GCTHING(oldval))
+#endif
+
+extern JSBool
+js_InitGC(JSRuntime *rt, uint32 maxbytes);
+
+extern void
+js_FinishGC(JSRuntime *rt);
+
+extern JSBool
+js_AddRoot(JSContext *cx, void *rp, const char *name);
+
+extern JSBool
+js_RemoveRoot(JSContext *cx, void *rp);
+
+extern void *
+js_AllocGCThing(JSContext *cx, uintN flags);
+
+extern JSBool
+js_LockGCThing(JSContext *cx, void *thing);
+
+extern JSBool
+js_UnlockGCThing(JSContext *cx, void *thing);
+
+extern JS_FRIEND_API(void)
+js_ForceGC(JSContext *cx);
+
+extern void
+js_GC(JSContext *cx);
+
+#ifdef JS_GCMETER
+
+typedef struct JSGCStats {
+    uint32  alloc;      /* number of allocation attempts */
+    uint32  freelen;    /* gcFreeList length */
+    uint32  recycle;    /* number of things recycled through gcFreeList */
+    uint32  retry;      /* allocation attempt retries after running the GC */
+    uint32  fail;       /* allocation failures */
+    uint32  lock;       /* valid lock calls */
+    uint32  unlock;     /* valid unlock calls */
+    uint32  stuck;      /* stuck reference counts seen by lock calls */
+    uint32  unstuck;    /* unlock calls that saw a stuck lock count */
+    uint32  depth;      /* mark recursion depth */
+    uint32  maxdepth;   /* maximum mark recursion depth */
+    uint32  maxlevel;   /* maximum GC nesting (indirect recursion) level */
+    uint32  poke;       /* number of potentially useful GC calls */
+    uint32  nopoke;     /* useless GC calls where js_PokeGC was not set */
+    uint32  badarena;   /* thing arena corruption */
+    uint32  badflag;    /* flags arena corruption */
+    uint32  afree;      /* thing arenas freed so far */
+    uint32  fafree;     /* flags arenas freed so far */
+} JSGCStats;
+
+extern void
+js_DumpGCStats(JSRuntime *rt, FILE *fp);
+
+#endif /* JS_GCMETER */
+
+JS_END_EXTERN_C
+
+#endif /* jsgc_h___ */