- Fix for recurring static variable (make it a member of the window group

structure)


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

mozilla/ef/Compiler/RegisterAllocator/BitSet.cpp

@@ -1,134 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "BitSet.h"
-
-// Return the next bit after index set to true or -1 if none.
-//
-Int32 BitSet::nextOne(Int32 pos) const
-{
-	++pos;
-
-	if (pos < 0 || Uint32(pos) >= universeSize)
-		return -1;
-
-	Uint32 offset = getWordOffset(pos);
-	Uint8 index = getBitOffset(pos);
-	Word* ptr = &word[offset];
-	Word currentWord = *ptr++ >> index;
-	
-	if (currentWord != Word(0)) {
-		while ((currentWord & Word(1)) == 0) {
-			++index;
-			currentWord >>= 1;
-		}
-		return (offset << nBitsInWordLog2) + index;
-	}
-
-	Word* limit = &word[getSizeInWords(universeSize)];
-	while (ptr < limit) {
-		++offset;
-		currentWord = *ptr++;
-		if (currentWord != Word(0)) {
-			index = 0;
-			while ((currentWord & Word(1)) == 0) {
-				++index;
-				currentWord >>= 1;
-			}
-			return (offset << nBitsInWordLog2) + index;
-		}
-	}
-	return -1;
-}
-
-// Return the next bit after index set to false or -1 if none.
-//
-Int32 BitSet::nextZero(Int32 pos) const
-{
-	++pos;
-
-	if (pos < 0 || Uint32(pos) >= universeSize)
-		return -1;
-
-	Uint32 offset = getWordOffset(pos);
-	Uint8 index = getBitOffset(pos);
-	Word* ptr = &word[offset];
-	Word currentWord = *ptr++ >> index;
-	
-	if (currentWord != Word(~0)) {
-		for (; index < nBitsInWord; ++index) {
-			if ((currentWord & Word(1)) == 0) {
-				Int32 ret = (offset << nBitsInWordLog2) + index;
-				return (Uint32(ret) < universeSize) ? ret : -1;
-			}
-			currentWord >>= 1;
-		}
-	}
-
-	Word* limit = &word[getSizeInWords(universeSize)];
-	while (ptr < limit) {
-		++offset;
-		currentWord = *ptr++;
-		if (currentWord != Word(~0)) {
-			for (index = 0; index < nBitsInWord; ++index) {
-				if ((currentWord & Word(1)) == 0) {
-					Int32 ret = (offset << nBitsInWordLog2) + index;
-					return (Uint32(ret) < universeSize) ? ret : -1;
-				}
-				currentWord >>= 1;
-			}
-		}
-	}
-	return -1;
-}
-
-#ifdef DEBUG_LOG
-
-// Print the set.
-//
-void BitSet::printPretty(LogModuleObject log)
-{
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("[ "));
-
-	for (Int32 i = firstOne(); i != -1; i = nextOne(i)) {
-		Int32 currentBit = i;
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("%d", currentBit));
-
-		Int32 nextBit = nextOne(currentBit);
-		if (nextBit != currentBit + 1) {
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, (" "));
-			continue;
-		}
-		  
-		while ((nextBit != -1) && (nextBit == (currentBit + 1))) {
-			currentBit = nextBit;
-			nextBit = nextOne(nextBit);
-		}
-
-		if (currentBit > (i+1))
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("-%d ", currentBit));
-		else
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, (" %d ", currentBit));
-
-		i = currentBit;
-	}
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("]\n"));
-}
-
-#endif // DEBUG_LOG

mozilla/ef/Compiler/RegisterAllocator/BitSet.h

@@ -1,195 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _BITSET_H_
-#define _BITSET_H_
-
-#include "Fundamentals.h"
-#include "LogModule.h"
-#include "Pool.h"
-#include <string.h>
-
-//------------------------------------------------------------------------------
-// BitSet -
-
-class BitSet
-{
-private:
-
-#if (PR_BITS_PER_WORD == 64)
-	typedef Uint64 Word;
-#elif (PR_BITS_PER_WORD == 32)
-	typedef Uint32 Word;
-#endif
-
-	static const nBitsInWord = 		PR_BITS_PER_WORD;
-	static const nBytesInWord = 	PR_BYTES_PER_WORD;
-	static const nBitsInWordLog2 =	PR_BITS_PER_WORD_LOG2;
-	static const nBytesInWordLog2 = PR_BYTES_PER_WORD_LOG2;
-
-	// Return the number of Word need to store the universe.
-	static Uint32 getSizeInWords(Uint32 sizeOfUniverse) {return (sizeOfUniverse + (nBitsInWord - 1)) >> nBitsInWordLog2;}
-	// Return the given element offset in its containing Word.
-	static Uint32 getBitOffset(Uint32 element) {return element & (nBitsInWord - 1);}
-	// Return the Word offset for the given element int the universe.
-	static Uint32 getWordOffset(Uint32 element) {return element >> nBitsInWordLog2;}
-	// Return the mask for the given bit index.
-	static Word getMask(Uint8 index) {return Word(1) << index;}
-	
-private:
-
-	Uint32							universeSize;			// Size of the universe
-	Word*							word;					// universe memory.
-
-private:
-
-	// No copy constructor.
-	BitSet(const BitSet&);
-
-	// Check if the given set's universe is of the same size than this universe.
-	void checkUniverseCompatibility(const BitSet& set) const {assert(set.universeSize == universeSize);}
-	// Check if pos is valid for this set's universe.
-	void checkMember(Int32 pos) const {assert(pos >=0 && Uint32(pos) < universeSize);}
-
-public:
-
-	// Create a bitset of universeSize bits.
-	BitSet(Pool& pool, Uint32 universeSize) : universeSize(universeSize) {word = new(pool) Word[getSizeInWords(universeSize)]; clear();}
-
-	// Return the size of this bitset.
-	Uint32 getSize() const {return universeSize;}
-
-	// Clear the bitset.
-	void clear() {memset(word, 0x00, getSizeInWords(universeSize) << nBytesInWordLog2);}
-	// Clear the bit at index.
-	void clear(Uint32 index) {checkMember(index); word[getWordOffset(index)] &= ~getMask(index);}
-	// Set the bitset.
-	void set() {memset(word, 0xFF, getSizeInWords(universeSize) << nBytesInWordLog2);}
-	// Set the bit at index.
-	void set(Uint32 index) {checkMember(index); word[getWordOffset(index)] |= getMask(index);}
-	// Return true if the bit at index is set.
-	bool test(Uint32 index) const {checkMember(index); return (word[getWordOffset(index)] & getMask(index)) != 0;}
-	// Union with the given bitset.
-	inline void or(const BitSet& set);
-	// Intersection with the given bitset.
-	inline void and(const BitSet& set);
-	// Difference with the given bitset.
-	inline void difference(const BitSet& set);
-	// Copy set.
-	inline BitSet& operator = (const BitSet& set);
-	// Return true if the bitset are identical.
-	friend bool operator == (const BitSet& set1, const BitSet& set2);
-	// Return true if the bitset are different.
-	friend bool operator != (const BitSet& set1, const BitSet& set2);
-
-	// Logical operators.
-	BitSet& operator |= (const BitSet& set) {or(set); return *this;}
-	BitSet& operator &= (const BitSet& set) {and(set); return *this;}
-	BitSet& operator -= (const BitSet& set) {difference(set); return *this;}
-
-	// Return the first bit at set to true or -1 if none.
-	Int32 firstOne() const {return nextOne(-1);}
-	// Return the next bit after index set to true or -1 if none.
-	Int32 nextOne(Int32 pos) const;
-	// Return the first bit at set to false or -1 if none.
-	Int32 firstZero() const {return nextZero(-1);}
-	// Return the next bit after index set to false or -1 if none.
-	Int32 nextZero(Int32 pos) const;
-
-	// Iterator to conform with the set API.
-	typedef Int32 iterator;
-	// Return true if the walk is ordered.
-	static bool isOrdered() {return true;}
-	// Return the iterator for the first element of this set.
-	iterator begin() const {return firstOne();}
-	// Return the next iterator.
-	iterator advance(iterator pos) const {return nextOne(pos);}
-	// Return true if the iterator is at the end of the set.
-	bool done(iterator pos) const {return pos == -1;}
-	// Return the element corresponding to the given iterator.
-	Uint32 get(iterator pos) const {return pos;}
-
-#ifdef DEBUG_LOG
-	// Print the set.
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-// Union with the given bitset.
-//
-inline void  BitSet::or(const BitSet& set)
-{
-	checkUniverseCompatibility(set);
-	Word* src = set.word;
-	Word* dst = word;
-	Word* limit = &src[getSizeInWords(universeSize)];
-
-	while (src < limit)
-		*dst++ |= *src++;
-}
-
-// Intersection with the given bitset.
-//
-inline void  BitSet::and(const BitSet& set)
-{
-	checkUniverseCompatibility(set);
-	Word* src = set.word;
-	Word* dst = word;
-	Word* limit = &src[getSizeInWords(universeSize)];
-
-	while (src < limit)
-		*dst++ &= *src++;
-}
-
-// Difference with the given bitset.
-//
-inline void BitSet::difference(const BitSet& set)
-{
-	checkUniverseCompatibility(set);
-	Word* src = set.word;
-	Word* dst = word;
-	Word* limit = &src[getSizeInWords(universeSize)];
-
-	while (src < limit)
-		*dst++ &= ~*src++;
-}
-
-// Copy the given set into this set.
-//
-inline BitSet& BitSet::operator = (const BitSet& set)
-{
-	checkUniverseCompatibility(set);
-	if (this != &set)
-		memcpy(word, set.word, getSizeInWords(universeSize) << nBytesInWordLog2);
-	return *this;
-}
-
-// Return true if the given set is identical to this set.
-inline bool operator == (const BitSet& set1, const BitSet& set2)
-{
-	set1.checkUniverseCompatibility(set2);
-
-	if (&set1 == &set2)
-		return true;
-
-	return memcmp(set1.word, set2.word, BitSet::getSizeInWords(set1.universeSize) << BitSet::nBytesInWordLog2) == 0;
-}
-
-inline bool operator != (const BitSet& set1, const BitSet& set2) {return !(set1 == set2);}
-
-#endif // _BITSET_H

mozilla/ef/Compiler/RegisterAllocator/Coalescing.h

@@ -1,159 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _COALESCING_H_
-#define _COALESCING_H_
-
-#include "Fundamentals.h"
-#include "Pool.h"
-#include "RegisterPressure.h"
-#include "InterferenceGraph.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "SparseSet.h"
-#include "RegisterAllocator.h"
-#include "RegisterAllocatorTools.h"
-
-#if 1
-// Performing an ultra conservative coalescing meens that when we look at
-// candidates (source,destination) for coalescing we need to make sure
-// that the combined interference of the source and destination register
-// will not exceed the total number of register available for the register
-// class. 
-#define ULTRA_CONSERVATIVE_COALESCING
-#else
-// If we are not doing an ultra conservative coalescing we have to make sure 
-// that the total number of neighbor whose degree is greater than the total 
-// number of register is not greater than the total number of register.
-#undef ULTRA_CONSERVATIVE_COALESCING
-#endif
-
-template <class RegisterPressure>
-struct Coalescing
-{
-	static bool coalesce(RegisterAllocator& registerAllocator);
-};
-
-template <class RegisterPressure>
-bool Coalescing<RegisterPressure>::coalesce(RegisterAllocator& registerAllocator)
-{
-	Pool& pool = registerAllocator.pool;
-
-   	// Initialize the lookup table
-	//
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	RegisterName* newRange = new RegisterName[2 * rangeCount];
-	RegisterName* coalescedRange = &newRange[rangeCount];
-	RegisterName* name2range = registerAllocator.name2range;
-
-	init(coalescedRange, rangeCount);
-
-	SparseSet interferences(pool, rangeCount);
-	InterferenceGraph<RegisterPressure>& iGraph = registerAllocator.iGraph;
-	bool removedInstructions = false;
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.lndList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-
-	// Walk the nodes in the loop nesting depth list.
-	for (Int32 n = nNodes - 1; n >= 0; n--) {
-		InstructionList& instructions = nodes[n]->getInstructions();
-
-		InstructionList::iterator it = instructions.begin();
-		while (!instructions.done(it)) {
-			Instruction& instruction = instructions.get(it);
-			it = instructions.advance(it);
-
-			if ((instruction.getFlags() & ifCopy) != 0) {
-				assert(instruction.getInstructionUseBegin() != instruction.getInstructionUseEnd() && instruction.getInstructionUseBegin()[0].isRegister());
-				assert(instruction.getInstructionDefineBegin() != instruction.getInstructionDefineEnd() && instruction.getInstructionDefineBegin()[0].isRegister());
-
-				RegisterName source = findRoot(name2range[instruction.getInstructionUseBegin()[0].getRegisterName()], coalescedRange);
-				RegisterName destination = findRoot(name2range[instruction.getInstructionDefineBegin()[0].getRegisterName()], coalescedRange);
-
-				if (source == destination) {
-					instruction.remove();
-				} else if (!iGraph.interfere(source, destination)) {
-					InterferenceVector* sourceVector = iGraph.getInterferenceVector(source);
-					InterferenceVector* destinationVector = iGraph.getInterferenceVector(destination);
-
-#ifdef ULTRA_CONSERVATIVE_COALESCING
-					interferences.clear();
-
-					InterferenceVector* vector;
-					for (vector = sourceVector; vector != NULL; vector = vector->next) {
-						RegisterName* neighbors = vector->neighbors;
-						for (Uint32 i = 0; i < vector->count; i++)
-							interferences.set(findRoot(neighbors[i], coalescedRange));
-					}
-					for (vector = destinationVector; vector != NULL; vector = vector->next) {
-						RegisterName* neighbors = vector->neighbors;
-						for (Uint32 i = 0; i < vector->count; i++)
-							interferences.set(findRoot(neighbors[i], coalescedRange));
-					}
-
-					Uint32 count = interferences.getSize();
-#else // ULTRA_CONSERVATIVE_COALESCING
-					trespass("not implemented");
-					Uint32 count = 0;
-#endif // ULTRA_CONSERVATIVE_COALESCING
-
-					if (count < 6 /* FIX: should get the number from the class */) {
-						// Update the interferences vector.
-						if (sourceVector == NULL) {
-							iGraph.setInterferenceVector(source, destinationVector);
-							sourceVector = destinationVector;
-						} else if (destinationVector == NULL)
-							iGraph.setInterferenceVector(destination, sourceVector);
-						else {
-							InterferenceVector* last = NULL;
-							for (InterferenceVector* v = sourceVector; v != NULL; v = v->next)
-								last = v;
-							assert(last);
-							last->next = destinationVector;
-							iGraph.setInterferenceVector(destination, sourceVector);
-						}
-						// Update the interference matrix.
-						for (InterferenceVector* v = sourceVector; v != NULL; v = v->next) {
-							RegisterName* neighbors = v->neighbors;
-							for (Uint32 i = 0; i < v->count; i++) {
-								RegisterName neighbor = findRoot(neighbors[i], coalescedRange);
-								iGraph.setInterference(neighbor, source);
-								iGraph.setInterference(neighbor, destination);
-							}
-						}
-
-						instruction.remove();
-						coalescedRange[source] = destination;
-						removedInstructions = true;
-					}
-				}
-			}
-		}
-	}
-
-	registerAllocator.rangeCount = compress(registerAllocator.name2range, coalescedRange, registerAllocator.nameCount, rangeCount);
-	delete newRange;
-
-	return removedInstructions;
-}
-
-#endif // _COALESCING_H_

mozilla/ef/Compiler/RegisterAllocator/Coloring.cpp

@@ -1,283 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 NEW_LAURENTM_CODE
-
-#include "Coloring.h"
-#include "VirtualRegister.h"
-#include "FastBitSet.h"
-#include "FastBitMatrix.h"
-#include "CpuInfo.h"
-
-bool Coloring::
-assignRegisters(FastBitMatrix& interferenceMatrix)
-{
-  PRUint32 *stackPtr = new(pool) PRUint32[vRegManager.count()];
-
-  return select(interferenceMatrix, stackPtr, simplify(interferenceMatrix, stackPtr));
-}
-
-PRInt32 Coloring::
-getLowestSpillCostRegister(FastBitSet& bitset)
-{
-  PRInt32 lowest = bitset.firstOne();
-  if (lowest != -1)
-	{
-	  Flt32 cost = vRegManager.getVirtualRegister(lowest).spillInfo.spillCost;
-	  for (PRInt32 r = bitset.nextOne(lowest); r != -1; r = bitset.nextOne(r))
-		{
-		  VirtualRegister& vReg = vRegManager.getVirtualRegister(r);
-		  if (!vReg.spillInfo.infiniteSpillCost && (vReg.spillInfo.spillCost < cost))
-			{
-			  cost = vReg.spillInfo.spillCost;
-			  lowest = r;
-			}
-		}
-	}
-  return lowest;
-}
-
-PRUint32* Coloring::
-simplify(FastBitMatrix interferenceMatrix, PRUint32* stackPtr)
-{
-  // first we construct the sets low and high. low contains all nodes of degree
-  // inferior to the number of register available on the processor. All the
-  // nodes with an high degree and a finite spill cost are placed in high.
-  // Nodes of high degree and infinite spill cost are not included in either sets.
-
-  PRUint32 nRegisters = vRegManager.count();
-  FastBitSet low(pool, nRegisters);
-  FastBitSet high(pool, nRegisters);
-  FastBitSet stack(pool, nRegisters);
-
-  for (VirtualRegisterManager::iterator i = vRegManager.begin(); !vRegManager.done(i); i = vRegManager.advance(i))
-	{
-	  VirtualRegister& vReg = vRegManager.getVirtualRegister(i);
-	  
-	  if (vReg.getClass() == vrcStackSlot)
-		{
-		  stack.set(i);
-		  vReg.colorRegister(nRegisters);
-		}
-	  else
-		{
-		  if (vReg.colorInfo.interferenceDegree < NUMBER_OF_REGISTERS)
-			low.set(i);
-		  else // if (!vReg.spillInfo.infiniteSpillCost)
-			high.set(i);
-
-		  // Set coloring info.
-		  vReg.spillInfo.willSpill = false;
-
-		  switch(vReg.getClass())
-			{
-			case vrcInteger:
-			  vReg.colorRegister(LAST_GREGISTER + 1);
-			  break;
-			case vrcFloatingPoint:
-			case vrcFixedPoint:
-			  vReg.colorRegister(LAST_FPREGISTER + 1);
-			  break;
-			default:
-			  PR_ASSERT(false); // Cannot happen.
-			}
-		}
-	}
-
-  // push the stack registers
-  PRInt32 j;
-  for (j = stack.firstOne(); j != -1; j = stack.nextOne(j))
-	*stackPtr++ = j;
-
-  // simplify
-  while (true)
-	{
-	  PRInt32 r;
-	  while ((r = getLowestSpillCostRegister(low)) != -1)
-		{
-		  VirtualRegister& vReg = vRegManager.getVirtualRegister(r);
-
-		  /* update low and high */
-		  FastBitSet inter(interferenceMatrix.getRow(r), nRegisters);
-		  for (j = inter.firstOne(); j != -1; j = inter.nextOne(j))
-			{
-			  VirtualRegister& neighbor = vRegManager.getVirtualRegister(j);
-			  // if the new interference degree of one of his neighbor becomes
-			  // NUMBER_OF_REGISTERS - 1 then it is added to the set 'low'.
-			  
-			  PRUint32 maxInterference = 0;
-			  switch (neighbor.getClass())
-				{
-				case vrcInteger:
-				  maxInterference = NUMBER_OF_GREGISTERS;
-				  break;
-				case vrcFloatingPoint:
-				case vrcFixedPoint:
-				  maxInterference = NUMBER_OF_FPREGISTERS;
-				  break;
-				default:
-				  PR_ASSERT(false);
-				}
-			  if ((vRegManager.getVirtualRegister(j).colorInfo.interferenceDegree-- == maxInterference))
-				{
-				  high.clear(j);
-				  low.set(j);
-				}
-			  vReg.colorInfo.interferenceDegree--;
-			  interferenceMatrix.clear(r, j);
-			  interferenceMatrix.clear(j, r);
-			}
-		  low.clear(r);
-
-		  // Push this register.
-		  *stackPtr++ = r;
-		}
-	  if ((r = getLowestSpillCostRegister(high)) != -1)
-		{
-		  high.clear(r);
-		  low.set(r);
-		}
-	  else
-		break;
-	}
-
-  return stackPtr;
-}
-
-bool Coloring::
-select(FastBitMatrix& interferenceMatrix, PRUint32* stackBase, PRUint32* stackPtr)
-{
-  PRUint32 nRegisters = vRegManager.count();
-  FastBitSet usedRegisters(NUMBER_OF_REGISTERS + 1); // usedRegisters if used for both GR & FPR.
-  FastBitSet preColoredRegisters(NUMBER_OF_REGISTERS + 1);
-  FastBitSet usedStack(nRegisters + 1);
-  bool success = true;
-  Int32 lastUsedSSR = -1;
-
-  // select
-  while (stackPtr != stackBase)
-	{
-	  // Pop one register.
-	  PRUint32 r = *--stackPtr;
-	  VirtualRegister& vReg = vRegManager.getVirtualRegister(r);
-
-	  FastBitSet neighbors(interferenceMatrix.getRow(r), nRegisters);
-		  
-	  if (vReg.getClass() == vrcStackSlot)
-		// Stack slots coloring.
-		{
-		  usedStack.clear();
-
-		  for (PRInt32 i = neighbors.firstOne(); i != -1; i = neighbors.nextOne(i))
-			usedStack.set(vRegManager.getVirtualRegister(i).getColor());
-
-		  Int32 color = usedStack.firstZero();
-		  vReg.colorRegister(color);
-		  if (color > lastUsedSSR)
-			  lastUsedSSR = color;
-		}
-	  else
-		// Integer & Floating point register coloring.
-		{
-		  usedRegisters.clear();
-		  preColoredRegisters.clear();
-		  
-		  for (PRInt32 i = neighbors.firstOne(); i != -1; i = neighbors.nextOne(i))
-			{
-			  VirtualRegister& nvReg = vRegManager.getVirtualRegister(i);
-			  usedRegisters.set(nvReg.getColor());
-			  if (nvReg.isPreColored())
-				preColoredRegisters.set(nvReg.getPreColor());
-			}
-		  if (vReg.hasSpecialInterference)
-			usedRegisters |= vReg.specialInterference;
-
-		  PRInt8 c = -1;
-		  PRInt8 maxColor = 0;
-		  PRInt8 firstColor = 0;
-		  switch (vReg.getClass())
-			{
-			case vrcInteger:
-			  firstColor = FIRST_GREGISTER;
-			  maxColor = LAST_GREGISTER;
-			  break;
-			case vrcFloatingPoint:
-			case vrcFixedPoint:
-			  firstColor = FIRST_FPREGISTER;
-			  maxColor = LAST_FPREGISTER;
-			  break;
-			default:
-			  PR_ASSERT(false);
-			}
-
-		  if (vReg.isPreColored())
-			{
-			  c = vReg.getPreColor();
-			  if (usedRegisters.test(c))
-				c = -1;
-			}
-		  else
-			{
-			  for (c = usedRegisters.nextZero(firstColor - 1); (c >= 0) && (c <= maxColor) && (preColoredRegisters.test(c)); 
-				   c = usedRegisters.nextZero(c)) {}
-			}
-
-		  if ((c >= 0) && (c <= maxColor))
-			{
-			  vReg.colorRegister(c);
-			}
-		  else
-			{
-			  VirtualRegister& stackRegister = vRegManager.newVirtualRegister(vrcStackSlot);
-			  vReg.equivalentRegister[vrcStackSlot] = &stackRegister;	  
-			  vReg.spillInfo.willSpill = true;
-			  success = false;
-			}
-		}
-	}
-  
-#ifdef DEBUG
-  if (success)
-	{
-	  for (VirtualRegisterManager::iterator i = vRegManager.begin(); !vRegManager.done(i); i = vRegManager.advance(i))
-		{
-		  VirtualRegister& vReg = vRegManager.getVirtualRegister(i);
-		  switch (vReg.getClass())
-			{
-			case vrcInteger:
-			  if (vReg.getColor() > LAST_GREGISTER)
-				PR_ASSERT(false);
-			  break;
-			case vrcFloatingPoint:
-			case vrcFixedPoint:
-#if NUMBER_OF_FPREGISTERS != 0
-			  if (vReg.getColor() > LAST_FPREGISTER)
-				PR_ASSERT(false);
-#endif
-			  break;
-			default:
-			  break;
-			}
-		}
-	}
-#endif
-
-  vRegManager.nUsedStackSlots = lastUsedSSR + 1;
-  return success;
-}
-#endif // NEW_LAURENTM_CODE

mozilla/ef/Compiler/RegisterAllocator/Coloring.h

@@ -1,284 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "RegisterAllocator.h"
-#include "VirtualRegister.h"
-#include "InterferenceGraph.h"
-#include "SparseSet.h"
-#include "Spilling.h"
-#include "Splits.h"
-
-UT_EXTERN_LOG_MODULE(RegAlloc);
-
-template <class RegisterPressure>
-class Coloring
-{
-private:
-	static RegisterName* simplify(RegisterAllocator& registerAllocator, RegisterName* coloringStack);
-	static bool select(RegisterAllocator& registerAllocator, RegisterName* coloringStack, RegisterName* coloringStackPtr);
-
-public:
-	static bool color(RegisterAllocator& registerAllocator);
-	static void finalColoring(RegisterAllocator& registerAllocator);
-};
-
-
-template <class RegisterPressure>
-void Coloring<RegisterPressure>::finalColoring(RegisterAllocator& registerAllocator)
-{
-	RegisterName* color = registerAllocator.color;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		InstructionList& instructions = nodes[n]->getInstructions();
-
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					usePtr->setRegisterName(color[name2range[usePtr->getRegisterName()]]);
-#ifdef DEBUG
-					RegisterID rid = usePtr->getRegisterID();
-					setColoredRegister(rid);
-					usePtr->setRegisterID(rid);
-#endif // DEBUG
-				}
-
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister()) {
-					definePtr->setRegisterName(color[name2range[definePtr->getRegisterName()]]);
-#ifdef DEBUG
-					RegisterID rid = definePtr->getRegisterID();
-					setColoredRegister(rid);
-					definePtr->setRegisterID(rid);
-#endif // DEBUG
-				}
-		}
-	}
-}
-
-template <class RegisterPressure>
-bool Coloring<RegisterPressure>::select(RegisterAllocator& registerAllocator, RegisterName* coloringStack, RegisterName* coloringStackPtr)
-{
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	RegisterName* color = new RegisterName[rangeCount];
-	registerAllocator.color = color;
-
-	for (Uint32 r = 1; r < rangeCount; r++)
-		color[r] = RegisterName(6); // FIX;
-
-	// Color the preColored registers.
-	//
-	VirtualRegisterManager& vrManager = registerAllocator.vrManager;
-	RegisterName* name2range = registerAllocator.name2range;
-	PreColoredRegister* machineEnd = vrManager.getMachineRegistersEnd();
-	for (PreColoredRegister* machinePtr = vrManager.getMachineRegistersBegin(); machinePtr < machineEnd; machinePtr++)
-		if (machinePtr->id != invalidID) {
-			color[name2range[getName(machinePtr->id)]] = machinePtr->color;
-			UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\twill preColor range %d as %d\n", name2range[getName(machinePtr->id)], machinePtr->color));
-		}
-
-	SpillCost* cost = registerAllocator.spillCost;
-	Pool& pool = registerAllocator.pool;
-	SparseSet& spill = *new(pool) SparseSet(pool, rangeCount);
-	registerAllocator.willSpill = &spill;
-	SparseSet neighborColors(pool, 6); // FIX
-	InterferenceGraph<RegisterPressure>& iGraph = registerAllocator.iGraph;
-
-	bool coloringFailed = false;
-	while (coloringStackPtr > coloringStack) {
-		RegisterName range = *--coloringStackPtr;
-
-		if (!cost[range].infinite && cost[range].cost < 0) {
-			coloringFailed = true;
-			spill.set(range);
-			UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\tfailed to color %d, will spill.\n", range));
-		} else {
-			neighborColors.clear();
-
-			for (InterferenceVector* vector = iGraph.getInterferenceVector(range); vector != NULL; vector = vector->next)
-				for (Int32 i = vector->count - 1; i >= 0; --i) {
-					RegisterName neighborColor = color[vector->neighbors[i]];
-					if (neighborColor < 6) // FIX
-						neighborColors.set(neighborColor);
-				}
-
-			if (neighborColors.getSize() == 6) { // FIX
-				coloringFailed = true;
-				UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\tfailed to color %d, ", range));
-
-				if (!Splits<RegisterPressure>::findSplit(registerAllocator, color, range)) {
-					UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("will spill.\n"));
-					spill.set(range);
-				} else
-					UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("will split.\n"));
-			} else {
-				for (Uint32 i = 0; i < 6; i++) // FIX
-					if (!neighborColors.test(i)) {
-						fprintf(stdout, "\twill color %d as %d\n", range, i);
-						color[range] = RegisterName(i);
-						break;
-					}
-			}
-		}
-	}
-
-#ifdef DEBUG_LOG
-	if (coloringFailed) {
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("Coloring failed:\n"));
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\twill spill: "));
-		spill.printPretty(UT_LOG_MODULE(RegAlloc));
-	} else {
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("Coloring succeeded:\n"));
-		for (Uint32 i = 1; i < rangeCount; i++)
-			UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\trange %d colored as %d\n", i, color[i]));
-	}
-#endif
-
-	return !coloringFailed;
-}
-
-template <class RegisterPressure>
-RegisterName* Coloring<RegisterPressure>::simplify(RegisterAllocator& registerAllocator, RegisterName* coloringStack)
-{
-	InterferenceGraph<RegisterPressure>& iGraph = registerAllocator.iGraph;
-	SpillCost* spillCost = registerAllocator.spillCost;
-	Uint32 rangeCount = registerAllocator.rangeCount;
-
-	Uint32* degree = new Uint32[rangeCount];
-	for (RegisterName i = RegisterName(1); i < rangeCount; i = RegisterName(i + 1)) {
-		InterferenceVector* vector = iGraph.getInterferenceVector(i);
-		degree[i] = (vector != NULL) ? vector->count : 0;
-	}
-
-	Pool& pool = registerAllocator.pool;
-	SparseSet low(pool, rangeCount);
-	SparseSet high(pool, rangeCount);
-	SparseSet highInfinite(pool, rangeCount);
-	SparseSet preColored(pool, rangeCount);
-
-	// Get the precolored registers.
-	//
-	VirtualRegisterManager& vrManager = registerAllocator.vrManager;
-	RegisterName* name2range = registerAllocator.name2range;
-	PreColoredRegister* machineEnd = vrManager.getMachineRegistersEnd();
-	for (PreColoredRegister* machinePtr = vrManager.getMachineRegistersBegin(); machinePtr < machineEnd; machinePtr++)
-		if (machinePtr->id != invalidID)
-			preColored.set(name2range[getName(machinePtr->id)]);
-
-	// Insert the live ranges in the sets.
-	//
-	for (Uint32 range = 1; range < rangeCount; range++)
-		if (!preColored.test(range))
-			if (degree[range] < 6) // FIX
-				low.set(range);
-			else if (!spillCost[range].infinite)
-				high.set(range);
-			else
-				highInfinite.set(range);
-
-#ifdef DEBUG_LOG
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("Coloring sets:\n\tlow = "));
-	low.printPretty(UT_LOG_MODULE(RegAlloc));
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\thigh = "));
-	high.printPretty(UT_LOG_MODULE(RegAlloc));
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\thighInfinite = "));
-	highInfinite.printPretty(UT_LOG_MODULE(RegAlloc));
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\tpreColored = "));
-	preColored.printPretty(UT_LOG_MODULE(RegAlloc));
-#endif // DEBUG_LOG
-
-	RegisterName* coloringStackPtr = coloringStack;
-
-	while (low.getSize() != 0 || high.getSize() != 0) {
-		while (low.getSize() != 0) {
-			RegisterName range = RegisterName(low.getOne());
-			low.clear(range);
-			*coloringStackPtr++ = range;
-
-			for (InterferenceVector* vector = iGraph.getInterferenceVector(range); vector != NULL; vector = vector->next)
-				for (Int32 i = (vector->count - 1); i >= 0; --i) {
-					RegisterName neighbor = vector->neighbors[i];
-					degree[neighbor]--;
-
-					if (degree[neighbor] < 6) // FIX
-						if (high.test(neighbor)) {
-							high.clear(neighbor);
-							low.set(neighbor);
-						} else if (highInfinite.test(neighbor)) {
-							highInfinite.clear(neighbor);
-							low.set(neighbor);
-						}
-				}
-		}
-
-		if (high.getSize() != 0) {
-			RegisterName best = RegisterName(high.getOne());
-			double bestCost = spillCost[best].cost;
-			double bestDegree = degree[best];
-
-			// Choose the next best candidate.
-			//
-			for (SparseSet::iterator i = high.begin(); !high.done(i); i = high.advance(i)) {
-				RegisterName range = RegisterName(high.get(i));
-				double thisCost = spillCost[range].cost;
-				double thisDegree = degree[range];
-
-				if (thisCost * bestDegree < bestCost * thisDegree) {
-					best = range;
-					bestCost = thisCost;
-					bestDegree = thisDegree;
-				}
-			}
-			
-			high.clear(best);
-			low.set(best);
-		}
- 	}
-	assert(highInfinite.getSize() == 0);
-
-	delete degree;
-
-#ifdef DEBUG_LOG
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("Coloring stack:\n\t"));
-	for (RegisterName* sp = coloringStack; sp < coloringStackPtr; ++sp)
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("%d ", *sp));
-	UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\n"));
-#endif // DEBUG_LOG
-
-	return coloringStackPtr;
-}
-
-
-template <class RegisterPressure>
-bool Coloring<RegisterPressure>::color(RegisterAllocator& registerAllocator)
-{
-	RegisterName* coloringStack = new RegisterName[registerAllocator.rangeCount];
-	return select(registerAllocator, coloringStack, simplify(registerAllocator, coloringStack));
-}

mozilla/ef/Compiler/RegisterAllocator/DominatorGraph.cpp

@@ -1,212 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include <string.h>
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-
-#include "DominatorGraph.h"
-
-DominatorGraph::DominatorGraph(ControlGraph& controlGraph) : controlGraph(controlGraph)
-{
-	Uint32 nNodes = controlGraph.nNodes;
-
-	GtoV = new Uint32[nNodes + 1];
-	VtoG = new Uint32[nNodes + 1];
-
-	Uint32 v = 1;
-	for (Uint32 n = 0; n < nNodes; n++) {
-		VtoG[v] = n;
-		GtoV[n] = v++;
-	}
-
-	// Initialize all the 1-based arrays.
-	//
-	parent =	new Uint32[v];
-	semi =		new Uint32[v];
-	vertex =	new Uint32[v];
-	label =		new Uint32[v];
-	size =		new Uint32[v];
-	ancestor =	new Uint32[v];
-	child =		new Uint32[v];
-	dom =		new Uint32[v];
-	bucket =	new DGLinkedList*[v];
-
-	memset(semi, '\0', v * sizeof(Uint32));
-	memset(bucket, '\0', v * sizeof(DGLinkedList*));
-
-	vCount = v;
-
-	build();
-
-	delete parent;
-	delete semi;
-	delete vertex;
-	delete label;
-	delete size;
-	delete ancestor;
-	delete child;
-	delete dom;
-	delete bucket;
-}
-
-Uint32 DominatorGraph::DFS(Uint32 vx, Uint32 n)
-{
-	semi[vx] = ++n;
-	vertex[n] = label[vx] = vx;
-	ancestor[vx] = child[vx] = 0;
-	size[vx] = 1;
-
-
-	ControlNode& node = *controlGraph.dfsList[VtoG[vx]];
-	ControlEdge* successorEnd = node.getSuccessorsEnd();
-	for (ControlEdge* successorPtr = node.getSuccessorsBegin(); successorPtr < successorEnd; successorPtr++) {
-		Uint32 w = GtoV[successorPtr->getTarget().dfsNum];
-		if (semi[w] == 0) {
-			parent[w] = vx;
-			n = DFS(w, n);
-		}
-	}
-	return n;
-}
-
-void DominatorGraph::LINK(Uint32 vx, Uint32 w)
-{
-    Uint32 s = w;
-
-	while (semi[label[w]] < semi[label[child[s]]]) {
-		if (size[s] + size[child[child[s]]] >= (size[child[s]] << 1)) {
-			ancestor[child[s]] = s;
-			child[s] = child[child[s]];
-		} else {
-			size[child[s]] = size[s];
-			s = ancestor[s] = child[s];
-		}
-	}
-	label[s] = label[w];
-	size[vx] += size[w];
-	if(size[vx] < (size[w] << 1)) {
-		Uint32 t = s;
-		s = child[vx]; 
-		child[vx] = t;
-	}
-	while( s != 0 ) {
-		ancestor[s] = vx;
-		s = child[s];
-	}
-}
-
-
-void DominatorGraph::COMPRESS(Uint32 vx)
-{
-	if(ancestor[ancestor[vx]] != 0) {
-		COMPRESS(ancestor[vx]);
-		if(semi[label[ancestor[vx]]] < semi[label[vx]])
-			label[vx] = label[ancestor[vx]];
-		ancestor[vx] = ancestor[ancestor[vx]];
-	}
-}
-
-Uint32 DominatorGraph::EVAL(Uint32 vx)
-{
-	if(ancestor[vx] == 0) 
-		return label[vx];
-	COMPRESS(vx);
-	return (semi[label[ancestor[vx]]] >= semi[label[vx]]) ? label[vx] : label[ancestor[vx]];
-}
-
-void DominatorGraph::build()
-{
-	Uint32 n = DFS(GtoV[0], 0);
-	size[0] = label[0] = semi[0];
-
-	for (Uint32 i = n; i >= 2; i--) {
-		Uint32 w = vertex[i];
-
-		ControlNode& node = *controlGraph.dfsList[VtoG[w]];
-		const DoublyLinkedList<ControlEdge>& predecessors = node.getPredecessors();
-		for (DoublyLinkedList<ControlEdge>::iterator p = predecessors.begin(); !predecessors.done(p); p = predecessors.advance(p)) {
-			Uint32 vx = GtoV[predecessors.get(p).getSource().dfsNum];
-			Uint32 u = EVAL(vx);
-
-			if(semi[u] < semi[w])
-				semi[w] = semi[u];
-		}
-
-		DGLinkedList* elem = new DGLinkedList();
-		elem->next = bucket[vertex[semi[w]]];
-		elem->index = w;
-		bucket[vertex[semi[w]]] = elem;
-
-		LINK(parent[w], w);
-
-		elem = bucket[parent[w]];
-		while(elem != NULL) {
-			Uint32 vx = elem->index;
-			Uint32 u = EVAL(vx);
-			dom[vx] = (semi[u] < semi[vx]) ? u : parent[w];
-			elem = elem->next;
-		}
-	}
-
-	memset(size, '\0', n * sizeof(Uint32));
-	Pool& pool = controlGraph.pool;
-	nodes = new(pool) DGNode[n];
-
-	for(Uint32 j = 2; j <= n; j++) {
-		Uint32 w = vertex[j];
-		Uint32 d = dom[w];
-		if(d != vertex[semi[w]]) {
-			d = dom[d];
-			dom[w] = d;
-		}
-		size[d]++;
-	}
-	dom[GtoV[0]] = 0;
-
-	for (Uint32 k = 1; k <= n; k++) {
-		DGNode& node = nodes[VtoG[k]];
-		Uint32 count = size[k];
-		node.successorsEnd = node.successorsBegin = (count) ? new(pool) Uint32[count] : (Uint32*) 0;
-	}
-
-	for (Uint32 l = 2; l <= n; l++)
-		*(nodes[VtoG[dom[l]]].successorsEnd)++ = VtoG[l];
-}
-
-#ifdef DEBUG_LOG
-void DominatorGraph::printPretty(LogModuleObject log)
-{
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Dominator Graph:\n"));
-	Uint32 nNodes = controlGraph.nNodes;
-	for (Uint32 i = 0; i < nNodes; i++) {
-		DGNode& node = nodes[i];
-		if (node.successorsBegin !=  node.successorsEnd) {
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\tN%d dominates ", i));
-			for (Uint32* successorsPtr = node.successorsBegin; successorsPtr < node.successorsEnd; successorsPtr++)
-				UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("N%d ", *successorsPtr));
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-		}
-	}
-}
-
-#endif // DEBUG_LOG
-
-
-

mozilla/ef/Compiler/RegisterAllocator/DominatorGraph.h

@@ -1,80 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _DOMINATOR_GRAPH_H_
-#define _DOMINATOR_GRAPH_H_
-
-#include "LogModule.h"
-
-class ControlGraph;
-
-struct DGNode
-{
-	Uint32* successorsBegin;
-	Uint32* successorsEnd;
-};
-
-struct DGLinkedList
-{
-	DGLinkedList* next;
-	Uint32 index;
-};
-
-class DominatorGraph
-{
-private:
-
-	ControlGraph&	controlGraph;
-
-	Uint32			vCount;
-
-	Uint32*			VtoG;
-	Uint32*			GtoV;
-	Uint32*			parent;
-	Uint32*			semi;
-	Uint32*			vertex;
-	Uint32*			label;
-	Uint32*			size;
-	Uint32*			ancestor;
-	Uint32*			child;
-	Uint32*			dom;
-	DGLinkedList**	bucket;
-	DGNode*			nodes;
-	
-private:
-
-	void build();
-
-	Uint32 DFS(Uint32 vx, Uint32 n);
-	void LINK(Uint32 vx, Uint32 w);
-	void COMPRESS(Uint32 vx);
-	Uint32 EVAL(Uint32 vx);
-
-public:
-
-	DominatorGraph(ControlGraph& controlGraph);
-
-	Uint32* getSuccessorsBegin(Uint32 n) const {return nodes[n].successorsBegin;}
-	Uint32* getSuccessorsEnd(Uint32 n) const {return nodes[n].successorsEnd;}
-
-#ifdef DEBUG_LOG
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-#endif // _DOMINATOR_GRAPH_H_

mozilla/ef/Compiler/RegisterAllocator/HashSet.cpp

@@ -1,20 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "HashSet.h"

mozilla/ef/Compiler/RegisterAllocator/HashSet.h

@@ -1,97 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _HASH_SET_H_
-#define _HASH_SET_H_
-
-#include "Fundamentals.h"
-#include "Pool.h"
-#include <string.h>
-
-struct HashSetElement
-{
-	Uint32 index;
-	HashSetElement* next;
-};
-
-class HashSet
-{
-private:
-
-	static const hashSize = 64;
-
-	// Return the hash code for the given element index.
-	static Uint32 getHashCode(Uint32 index) {return index & (hashSize - 1);} // Could be better !
-
-private:
-
-	Pool&					allocationPool;
-	HashSetElement**		bucket;
-	HashSetElement*			free;
-
-private:
-
-	// No copy constructor.
-	HashSet(const HashSet&);
-	// No copy operator.
-	void operator = (const HashSet&);
-
-public:
-
-	// Create a new HashSet.
-	inline HashSet(Pool& pool, Uint32 universeSize);
-
-	// Clear the hashset.
-	void clear();
-	// Clear the element for the given index.
-	void clear(Uint32 index);
-	// Set the element for the given index.
-	void set(Uint32 index);
-	// Return true if the element at index is a member.
-	bool test(Uint32 index) const;
-	// Union with the given hashset.
-	inline void or(const HashSet& set);
-	// Intersection with the given hashset.
-	inline void and(const HashSet& set);
-	// Difference with the given hashset.
-	inline void difference(const HashSet& set);
-
-	// Logical operators.
-	HashSet& operator |= (const HashSet& set) {or(set); return *this;}
-	HashSet& operator &= (const HashSet& set) {and(set); return *this;}
-	HashSet& operator -= (const HashSet& set) {difference(set); return *this;}
-
-	// Iterator to conform with the set API.
-	typedef HashSetElement* iterator;
-	// Return the iterator for the first element of this set.
-	iterator begin() const;
-	// Return the next iterator.
-	iterator advance(iterator pos) const;
-	// Return true if the iterator is at the end of the set.
-	bool done(iterator pos) const {return pos == NULL;}
-};
-
-
-inline HashSet::HashSet(Pool& pool, Uint32 /*universeSize*/)
-	: allocationPool(pool), free(NULL)
-{
-	bucket = new(pool) HashSetElement*[hashSize];
-	memset(bucket, '\0', sizeof(HashSetElement*));
-}
-
-#endif // _HASH_SET_H_

mozilla/ef/Compiler/RegisterAllocator/IndexedPool.h

@@ -1,213 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _INDEXED_POOL_H_
-#define _INDEXED_POOL_H_
-
-#include "Fundamentals.h"
-#include <string.h>
-#include <stdlib.h>
-
-//------------------------------------------------------------------------------
-// IndexedPool<IndexedObjectSubclass> is an indexed pool of objects. The
-// template parameter 'IndexedObjectSubclass' must be a subclass of the struct
-// IndexedObject.
-// 
-// When the indexed pool is ask to allocate and initialize a new object (using
-// the operator new(anIndexedPool) it will zero the memory used to store the
-// object and initialize the field 'index' of this object to its position in
-// the pool.
-//
-// An object allocated by the indexed pool can be freed by calling the method
-// IndexedPool::release(IndexedElement& objectIndex).
-//
-// example:
-//
-//   IndexedPool<IndexedElement> elementPool;
-//
-//   IndexedElement& element1 = *new(elementPool) IndexedElement();
-//   IndexedElement& element2 = *new(elementPool) IndexedElement();
-//
-//   indexedPool.release(element1);
-//   IndexedElement& element3 = *new(elementPool) IndexedElement();
-//
-//  At this point element1 is no longer a valid object, element2 is at
-//  index 2 and element3 is at index 1.
-//
-
-//------------------------------------------------------------------------------
-// IndexedObject -
-//
-
-template<class Object>
-struct IndexedObject
-{
-	Uint32			index;				// Index in the pool.
-	Object*			next;				// Used to link IndexedObject together.
-
-	Uint32 getIndex() {return index;}
-};
-
-//------------------------------------------------------------------------------
-// IndexedPool<IndexedObject> -
-//
-
-template <class IndexedObject>
-class IndexedPool
-{
-private:
-
-	static const	blockSize = 4;		// Size of one block.
-
-	Uint32			nBlocks;			// Number of blocks in the pool.
-	IndexedObject**	block;				// Array of block pointers.
-	IndexedObject*  freeObjects;		// Chained list of free IndexedObjects.
-	Uint32			nextIndex;			// Index of the next free object in the last block. 
-
-private:
-
-	void allocateAnotherBlock();
-	IndexedObject& newObject();
-
-public:
-
-	IndexedPool() : nBlocks(0), block(NULL), freeObjects(NULL), nextIndex(1) {}
-	~IndexedPool();
-
-	IndexedObject& get(Uint32 index) const;
-	void release(IndexedObject& object);
-
-	void setSize(Uint32 size) {assert(size < nextIndex); nextIndex = size;}
-
-	// Return the universe size.
-	Uint32 getSize() {return nextIndex;}
-
-	friend void* operator new(size_t, IndexedPool<IndexedObject>& pool); // Needs to call newObject().
-};
-
-// Free all the memory allocated for this object.
-//
-template <class IndexedObject>
-IndexedPool<IndexedObject>::~IndexedPool()
-{
-	for (Uint32 n = 0; n < nBlocks; n++)
-		free(&((IndexedObject **) &block[n][n*blockSize])[-(n + 1)]);
-}
-
-// Release the given. This object will be iserted in the chained
-// list of free IndexedObjects. To minimize the fragmentation the chained list 
-// is ordered by ascending indexes.
-//
-template <class IndexedObject>
-void IndexedPool<IndexedObject>::release(IndexedObject& object)
-{
-	Uint32 index = object.index;
-	IndexedObject* list = freeObjects;
-
-	assert(&object == &get(index)); // Make sure that object is owned by this pool.
-
-	if (list == NULL) { // The list is empty.
-		freeObjects = &object;
-		object.next = NULL;
-	} else { // The list contains at least 1 element.
-		if (index < list->index) { // insert as first element.
-			freeObjects = &object;
-			object.next = list;
-		} else { // Find this object's place.
-			while ((list->next) != NULL && (list->next->index < index))
-				list = list->next;
-
-			object.next = list->next;
-			list->next = &object;
-		}
-	}
-
-#ifdef DEBUG
-	// Sanity check to be sure that the list is correctly ordered.
-	for (IndexedObject* obj = freeObjects; obj != NULL; obj = obj->next)
-		if (obj->next != NULL)
-			assert(obj->index < obj->next->index);
-#endif
-}
-
-// Create a new block of IndexedObjects. We will allocate the memory to
-// store IndexedPool::blockSize IndexedObject and the new Array of block
-// pointers.
-// The newly created IndexedObjects will not be initialized.
-//
-template <class IndexedObject>
-void IndexedPool<IndexedObject>::allocateAnotherBlock()
-{
-	void* memory = (void *) malloc((nBlocks + 1) * sizeof(Uint32) + blockSize * sizeof(IndexedObject));
-
-	memcpy(memory, block, nBlocks * sizeof(Uint32));
-
-	block = (IndexedObject **) memory;
-	IndexedObject* objects = (IndexedObject *) &block[nBlocks + 1];
-
-	block[nBlocks] = &objects[-(nBlocks * blockSize)];
-	nBlocks++;
-}
-
-// Return the IndexedObject at the position 'index' in the pool.
-//
-template <class IndexedObject>
-IndexedObject& IndexedPool<IndexedObject>::get(Uint32 index) const
-{
-	Uint32 blockIndex = index / blockSize;
-	assert(blockIndex < nBlocks);
-
-	return block[blockIndex][index];
-}
-
-// Return the reference of an unused object in the pool.
-//
-template <class IndexedObject>
-IndexedObject& IndexedPool<IndexedObject>::newObject()
-{
-	if (freeObjects != NULL) {
-		IndexedObject& newObject = *freeObjects;
-		freeObjects = newObject.next;
-		return newObject;
-	}
-	
-	Uint32 nextIndex = this->nextIndex++;
-	Uint32 blockIndex = nextIndex / blockSize;
-
-	while (blockIndex >= nBlocks)
-		allocateAnotherBlock();
-	
-	IndexedObject& newObject = block[blockIndex][nextIndex];
-	newObject.index = nextIndex;
-
-	return newObject;
-}
-
-// Return the address of the next unsused object in the given
-// indexed pool. The field index of the newly allocated object
-// will be initialized to the corresponding index of this object
-// in the pool.
-//
-template <class IndexedObject>
-void* operator new(size_t size, IndexedPool<IndexedObject>& pool)
-{
-	assert(size == sizeof(IndexedObject));
-	return (void *) &pool.newObject();
-}
-
-#endif // _INDEXED_POOL_H_

mozilla/ef/Compiler/RegisterAllocator/InterferenceGraph.h

@@ -1,258 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _INTERFERENCE_GRAPH_H_
-#define _INTERFERENCE_GRAPH_H_
-
-#include "Fundamentals.h"
-#include "ControlGraph.h"
-#include "Primitives.h"
-#include "Instruction.h"
-#include "VirtualRegister.h"
-#include "RegisterPressure.h"
-#include "SparseSet.h"
-#include <string.h>
-
-struct InterferenceVector
-{
-	Uint32				count;
-	InterferenceVector*	next;
-	RegisterName*		neighbors;
-
-	InterferenceVector() : count(0), next(NULL) {}
-};
-
-class RegisterAllocator;
-
-template <class RegisterPressure>
-class InterferenceGraph
-{
-private:
-
-	RegisterAllocator&			registerAllocator;
-
-	RegisterPressure::Set*		interferences;
-	InterferenceVector**		vector;
-	Uint32*						offset;
-	Uint32 						rangeCount;
-
-private:
-
-	// No copy constructor.
-	InterferenceGraph(const InterferenceGraph&);
-	// No copy operator.
-	void operator = (const InterferenceGraph&);
-
-	// Check if reg is a member of the universe.
-	void checkMember(RegisterName name) {assert(name < rangeCount);}
-	// Return the edge index for the interference between name1 and name2.
-	Uint32 getEdgeIndex(RegisterName name1, RegisterName name2);
-
-public:
-	InterferenceGraph(RegisterAllocator& registerAllocator) : registerAllocator(registerAllocator) {}
-
-	// Calculate the interferences.
-	void build();
-	// Return true if reg1 and reg2 interfere.
-	bool interfere(RegisterName name1, RegisterName name2);
-	// Return the interference vector for the given register or NULL if there is none.
-	InterferenceVector* getInterferenceVector(RegisterName name) {return vector[name];}
-	// Set the interference between name1 and name2.
-	void setInterference(RegisterName name1, RegisterName name2);
-	// Set the interference vector for the given register.
-	void setInterferenceVector(RegisterName name, InterferenceVector* v) {vector[name] = v;}
-
-
-#ifdef DEBUG_LOG
-	// Print the interferences.
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-template <class RegisterPressure>
-void InterferenceGraph<RegisterPressure>::build()
-{
-	Pool& pool = registerAllocator.pool;
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	this->rangeCount = rangeCount;
-
-	// Initialize the structures.
-	//
-	offset = new(pool) Uint32[rangeCount + 1];
-	vector = new(pool) InterferenceVector*[rangeCount];
-	memset(vector, '\0', sizeof(InterferenceVector*) * rangeCount);
-
-	Uint32 o = 0;
-	offset[0] = 0;
-	for (Uint32 i = 1; i <= rangeCount; ++i) {
-		offset[i] = o;
-		o += i;
-	}
-	
-	interferences = new(pool) RegisterPressure::Set(pool, (rangeCount * rangeCount) / 2);
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	RegisterName* name2range = registerAllocator.name2range;
-	LivenessInfo<RegisterPressure> liveness = Liveness<RegisterPressure>::analysis(controlGraph, rangeCount, name2range);
-	registerAllocator.liveness = liveness;
-	SparseSet currentLive(pool, rangeCount);
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		ControlNode& node = *nodes[n];
-		currentLive = liveness.liveOut[n];
-
-		InstructionList& instructions = node.getInstructions();
-		for (InstructionList::iterator i = instructions.end(); !instructions.done(i); i = instructions.retreat(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useBegin = instruction.getInstructionUseBegin();
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			InstructionUse* usePtr;
-			InstructionDefine* defineBegin = instruction.getInstructionDefineBegin();
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			InstructionDefine* definePtr;
-
-			// Handle the copy instruction to avoid unnecessary interference between the 2 registers.
-			if ((instruction.getFlags() & ifCopy) != 0) {
-				assert(useBegin != useEnd && useBegin[0].isRegister());
-				currentLive.clear(name2range[useBegin[0].getRegisterName()]);
-			}
-
-			// Create the interferences.
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister()) {
-					RegisterName define = name2range[definePtr->getRegisterName()];
-
-					for (SparseSet::iterator e = currentLive.begin(); !currentLive.done(e); e = currentLive.advance(e)) {
-						RegisterName live = RegisterName(currentLive.get(e));
-
-						if ((live != define) && !interfere(live, define) && registerAllocator.canInterfere(live, define)) {
-
-							if (vector[define] == NULL)
-								vector[define] = new(pool) InterferenceVector();
-							vector[define]->count++;
-
-							if (vector[live] == NULL)
-								vector[live] = new(pool) InterferenceVector();
-							vector[live]->count++;
-
-							setInterference(live, define);
-						}
-					}
-				}
-
-			// Now update the liveness.
-			//
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					currentLive.clear(name2range[definePtr->getRegisterName()]);
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					currentLive.set(name2range[usePtr->getRegisterName()]);
-		}
-	}
-
-	// Allocate the memory to store the interferences.
-	//
-	for (Uint32 e = 0; e < rangeCount; e++)
-		if (vector[e] != NULL) {
-			InterferenceVector& v = *vector[e];
-			v.neighbors = new(pool) RegisterName[v.count];
-			v.count = 0;
-		}
-
-	// Initialize the edges.
-	//
-	if (RegisterPressure::Set::isOrdered()) {
-		RegisterName name1 = RegisterName(0);
-
-		for (RegisterPressure::Set::iterator i = interferences->begin(); !interferences->done(i); i = interferences->advance(i)) {
-			Uint32 interferenceIndex = interferences->get(i);
-
-			while(interferenceIndex >= offset[name1 + 1])
-				name1 = RegisterName(name1 + 1);
-
-			assert((interferenceIndex >= offset[name1]) && (interferenceIndex < offset[name1 + 1]));
-
-			RegisterName name2 = RegisterName(interferenceIndex - offset[name1]);
-
-			assert(interfere(name1, name2));
-
-			InterferenceVector& vector1 = *vector[name1];
-			vector1.neighbors[vector1.count++] = name2;
-		
-			InterferenceVector& vector2 = *vector[name2];
-			vector2.neighbors[vector2.count++] = name1;
-		}
-	} else {
-		trespass("not Implemented"); // FIX: need one more pass to initialize the vectors.
-	}
-}
-
-template <class RegisterPressure>
-Uint32 InterferenceGraph<RegisterPressure>::getEdgeIndex(RegisterName name1, RegisterName name2)
-{
-	checkMember(name1); checkMember(name2);
-	assert(name1 != name2); // This is not possible.
-	return (name1 < name2) ? offset[name2] + name1 : offset[name1] + name2;
-}
-
-template <class RegisterPressure>
-void InterferenceGraph<RegisterPressure>::setInterference(RegisterName name1, RegisterName name2)
-{
-	interferences->set(getEdgeIndex(name1, name2));
-}
-
-template <class RegisterPressure>
-bool InterferenceGraph<RegisterPressure>::interfere(RegisterName name1, RegisterName name2)
-{
-	return interferences->test(getEdgeIndex(name1, name2));
-}
-
-#ifdef DEBUG_LOG
-template <class RegisterPressure>
-void InterferenceGraph<RegisterPressure>::printPretty(LogModuleObject log)
-{
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Interference Vectors:\n"));
-	for (Uint32 i = 1; i < rangeCount; i++) {
-		if (vector[i] != NULL) {
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\tvr%d: (", i));
-			for (InterferenceVector* v = vector[i]; v != NULL; v = v->next)
-				for (Uint32 j = 0; j < v->count; j++) {
-					UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("%d", v->neighbors[j]));
-					if (v->next != NULL || j != (v->count - 1))
-						UT_OBJECTLOG(log, PR_LOG_ALWAYS, (","));
-				}
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, (")\n"));
-		}
-	}
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Interference Matrix:\n"));
-	for (RegisterName name1 = RegisterName(1); name1 < rangeCount; name1 = RegisterName(name1 + 1)) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\t%d:\t", name1));
-		for (RegisterName name2 = RegisterName(1); name2 < rangeCount; name2 = RegisterName(name2 + 1))
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("%c", ((name1 != name2) && interfere(name1, name2)) ? '1' : '0'));
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-	}
-}
-#endif // DEBUG_LOG
-
-#endif // _INTERFERENCE_GRAPH_H_

mozilla/ef/Compiler/RegisterAllocator/LiveRange.h

@@ -1,87 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _LIVE_RANGE_H_
-#define _LIVE_RANGE_H_
-
-#include "Fundamentals.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Primitives.h"
-#include "Instruction.h"
-#include "RegisterAllocator.h"
-#include "RegisterAllocatorTools.h"
-
-template <class RegisterPressure>
-struct LiveRange
-{
-	static void build(RegisterAllocator& registerAllocator);
-};
-
-template <class RegisterPressure>
-void LiveRange<RegisterPressure>::build(RegisterAllocator& registerAllocator)
-{
-	// Intialize the lookup table.
-	//
-	Uint32 nameCount = registerAllocator.nameCount;
-	RegisterName* nameTable = new(registerAllocator.pool) RegisterName[2*nameCount];
-	RegisterName* rangeName = &nameTable[nameCount];
-
-	init(rangeName, nameCount);
-
-	// Walk the graph.
-	//
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	SparseSet destination(registerAllocator.pool, nameCount);
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		InstructionList& phiNodes = nodes[n]->getPhiNodeInstructions();
-
-		destination.clear();
-		for (InstructionList::iterator i = phiNodes.begin(); !phiNodes.done(i); i = phiNodes.advance(i)) {
-			Instruction& phiNode = phiNodes.get(i);
-			assert(phiNode.getInstructionDefineBegin() != phiNode.getInstructionDefineEnd() && phiNode.getInstructionDefineBegin()[0].isRegister());
-			destination.set(findRoot(phiNode.getInstructionDefineBegin()[0].getRegisterName(), rangeName));
-		}
-
-		for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-			Instruction& phiNode = phiNodes.get(p);
-
-			assert(phiNode.getInstructionDefineBegin() != phiNode.getInstructionDefineEnd() && phiNode.getInstructionDefineBegin()[0].isRegister());
-			RegisterName destinationName = phiNode.getInstructionDefineBegin()[0].getRegisterName();
-			RegisterName destinationRoot = findRoot(destinationName, rangeName);
-
-			InstructionUse* useEnd = phiNode.getInstructionUseEnd();
-			for (InstructionUse* usePtr = phiNode.getInstructionUseBegin(); usePtr < useEnd; usePtr++) {
-				assert(usePtr->isRegister());
-				RegisterName sourceName = usePtr->getRegisterName();
-				RegisterName sourceRoot = findRoot(sourceName, rangeName);
-
-				if (sourceRoot != destinationRoot && !destination.test(sourceRoot))
-					rangeName[sourceRoot] = destinationRoot;
-			}
-		}
-	}
-
-	registerAllocator.rangeCount = compress(registerAllocator.name2range, rangeName, nameCount, nameCount);
-}
-
-#endif // _LIVE_RANGE_H_

mozilla/ef/Compiler/RegisterAllocator/LiveRangeGraph.h

@@ -1,163 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _LIVE_RANGE_GRAPH_
-#define _LIVE_RANGE_GRAPH_
-
-#include "Fundamentals.h"
-#include "Pool.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "RegisterTypes.h"
-
-class RegisterAllocator;
-
-template <class RegisterPressure>
-class LiveRangeGraph
-{
-private:
-
-	RegisterAllocator&		registerAllocator;
-
-	RegisterPressure::Set*	edges;
-	Uint32					rangeCount;
-
-public:
-	//
-	//
-	LiveRangeGraph(RegisterAllocator& registerAllocator) : registerAllocator(registerAllocator) {}
-
-	//
-	//
-	void build();
-
-	//
-	//
-	void addEdge(RegisterName name1, RegisterName name2);
-
-	//
-	//
-	bool haveEdge(RegisterName name1, RegisterName name2);
-
-#ifdef DEBUG_LOG
-	//
-	//
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-template <class RegisterPressure>
-void LiveRangeGraph<RegisterPressure>::build()
-{
-	Pool& pool = registerAllocator.pool;
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	this->rangeCount = rangeCount;
-
-	edges = new(pool) RegisterPressure::Set(pool, rangeCount * rangeCount);
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	RegisterName* name2range = registerAllocator.name2range;
-	LivenessInfo<RegisterPressure>& liveness = registerAllocator.liveness;
-	SparseSet currentLive(pool, rangeCount);
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		ControlNode& node = *nodes[n];
-		currentLive = liveness.liveOut[n];
-
-		InstructionList& instructions = node.getInstructions();
-		for (InstructionList::iterator i = instructions.end(); !instructions.done(i); i = instructions.retreat(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useBegin = instruction.getInstructionUseBegin();
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			InstructionUse* usePtr;
-			InstructionDefine* defineBegin = instruction.getInstructionDefineBegin();
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			InstructionDefine* definePtr;
-
-			if ((instruction.getFlags() & ifCopy) != 0) {
-				assert(useBegin != useEnd && useBegin[0].isRegister());
-				currentLive.clear(name2range[useBegin[0].getRegisterName()]);
-			}
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister()) {
-					RegisterName define = name2range[definePtr->getRegisterName()];
-
-					for (SparseSet::iterator l = currentLive.begin(); !currentLive.done(l); l = currentLive.advance(l)) {
-						RegisterName live = RegisterName(currentLive.get(l));
-						if (define != live && registerAllocator.canInterfere(define, live))
-							addEdge(define, live);
-					}
-				}
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					currentLive.clear(name2range[definePtr->getRegisterName()]);
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					currentLive.set(name2range[usePtr->getRegisterName()]);
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					RegisterName use = name2range[usePtr->getRegisterName()];
-
-					for (SparseSet::iterator l = currentLive.begin(); !currentLive.done(l); l = currentLive.advance(l)) {
-						RegisterName live = RegisterName(currentLive.get(l));
-						if (use != live && registerAllocator.canInterfere(use, live))
-							addEdge(use, live);
-					}
-				}
-		}
-	}
-}
-
-template <class RegisterPressure>
-void LiveRangeGraph<RegisterPressure>::addEdge(RegisterName name1, RegisterName name2)
-{
-	assert(name1 != name2);
-	edges->set(name1 * rangeCount + name2);
-}
-
-template <class RegisterPressure>
-bool LiveRangeGraph<RegisterPressure>::haveEdge(RegisterName name1, RegisterName name2)
-{
-	assert(name1 != name2);
-	return edges->test(name1 * rangeCount + name2);
-}
-
-#ifdef DEBUG_LOG
-template <class RegisterPressure>
-void LiveRangeGraph<RegisterPressure>::printPretty(LogModuleObject log)
-{
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Live ranges graph:\n"));
-	for (RegisterName name1 = RegisterName(1); name1 < rangeCount; name1 = RegisterName(name1 + 1)) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\t%d:\t", name1));
-		for (RegisterName name2 = RegisterName(1); name2 < rangeCount; name2 = RegisterName(name2 + 1))
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("%c", ((name1 != name2) && haveEdge(name1, name2)) ? '1' : '0'));
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-	}
-}
-#endif // DEBUG_LOG
-
-#endif // _LIVE_RANGE_GRAPH_

mozilla/ef/Compiler/RegisterAllocator/Liveness.cpp

@@ -1,21 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "Liveness.h"
-

mozilla/ef/Compiler/RegisterAllocator/Liveness.h

@@ -1,301 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _LIVENESS_H_
-#define _LIVENESS_H_
-
-#include "Fundamentals.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "RegisterTypes.h"
-
-// ----------------------------------------------------------------------------
-// LivenessInfo -
-
-template <class RegisterPressure>
-struct LivenessInfo
-{
-	RegisterPressure::Set*	liveIn;
-	RegisterPressure::Set*	liveOut;
-	DEBUG_LOG_ONLY(Uint32	size);
-
-#ifdef DEBUG_LOG
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-// ----------------------------------------------------------------------------
-// Liveness
-//
-// The liveness is defined by the following data-flow equations:
-//
-//		LiveIn(n) = LocalLive(n) U (LiveOut(n) - Killed(n)).
-//		LiveOut(n) = U LiveIn(s) (s a successor of n).
-//
-//	where LocalLive(n) is the set of used registers in the block n, Killed(n)
-//  is the set of defined registers in the block n, LiveIn(n) is the set of
-//  live registers at the begining of the block n and LiveOut(n) is the set
-//  of live registers at the end of the block n.
-//
-//
-// We will compute the liveness analysis in two stages:
-//
-//	1- Build LocalLive(n) (wich is an approximation of LiveIn(n)) and Killed(n) 
-//     for each block n.
-//  2- Perform a backward data-flow analysis to propagate the liveness information
-//     through the entire control-flow graph.
-//
-
-template <class RegisterPressure>
-struct Liveness
-{
-	static LivenessInfo<RegisterPressure> analysis(ControlGraph& controlGraph, Uint32 rangeCount, const RegisterName* name2range);
-	static LivenessInfo<RegisterPressure> analysis(ControlGraph& controlGraph, Uint32 nameCount);
-};
-
-template <class RegisterPressure>
-LivenessInfo<RegisterPressure> Liveness<RegisterPressure>::analysis(ControlGraph& controlGraph, Uint32 rangeCount, const RegisterName* name2range)
-{
-	Pool& pool = controlGraph.pool;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	// Allocate the temporary sets.
-	RegisterPressure::Set* killed = new(pool) RegisterPressure::Set[nNodes](pool, rangeCount);
-	
-	// Allocate the globals sets.
-	RegisterPressure::Set* liveIn = new(pool) RegisterPressure::Set[nNodes](pool, rangeCount);
-	RegisterPressure::Set* liveOut = new(pool) RegisterPressure::Set[nNodes](pool, rangeCount);
-
-	// First stage of the liveness analysis: Compute the sets LocalLive(stored in LiveIn) and Killed.
-	//
-	for (Uint32 n = 0; n < (nNodes - 1); n++) {
-		ControlNode& node = *nodes[n];
-
-		RegisterPressure::Set& currentLocalLive = liveIn[n];
-		RegisterPressure::Set& currentKilled = killed[n];
-		
-		// Find the instructions contributions to the sets LocalLive and Killed.
-		//
-		InstructionList& instructions = node.getInstructions();
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			// If a VirtualRegister is 'used' before being 'defined' then we add it to set LocalLive.
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					Uint32 index = name2range[usePtr->getRegisterName()];
-
-					if (!currentKilled.test(index))
-						currentLocalLive.set(index);
-				}
-
-			// If a Virtualregister is 'defined' then we add it to the set Killed.
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					currentKilled.set(name2range[definePtr->getRegisterName()]);
-		}
-	}
-
-	// Second stage of the liveness analysis: We propagate the LiveIn & LiveOut through the entire 
-	// control-flow graph.
-	//
-	RegisterPressure::Set temp(pool, rangeCount);
-
-	bool changed;
-	do {
-		changed = false;
-
-		// For all nodes is this graph except the endNode.
-		for (Int32 n = (nNodes - 2); n >= 0; n--) {
-			ControlNode& node = *nodes[n];
-
-			RegisterPressure::Set& currentLiveIn = liveIn[n];
-			RegisterPressure::Set& currentLiveOut = liveOut[n];
-
-			// Compute temp = Union of LiveIn(s) (s a successor of this node) | usedByPhiNodes(n).
-			// temp will be the new LiveOut(n).
-			Uint32 nSuccessors = node.nSuccessors();
-			if (nSuccessors != 0) {
-				temp = liveIn[node.nthSuccessor(0).getTarget().dfsNum];
-				for (Uint32 s = 1; s < nSuccessors; s++)
-					temp |= liveIn[node.nthSuccessor(s).getTarget().dfsNum];
-			} else 
-				temp.clear();
-
-			// If temp and LiveOut(n) differ then set LiveOut(n) = temp and recalculate the
-			// new LiveIn(n).
-			if (currentLiveOut != temp) {
-				currentLiveOut = temp;
-				temp -= killed[n]; // FIX: could be optimized with one call to unionDiff !
-				temp |= currentLiveIn;
-			
-				if (currentLiveIn != temp) {
-					currentLiveIn = temp;
-					changed = true;
-				}
-			}
-		}
-	} while(changed);
-
-	LivenessInfo<RegisterPressure> liveness;
-	liveness.liveIn = liveIn;
-	liveness.liveOut = liveOut;
-	DEBUG_LOG_ONLY(liveness.size = nNodes);
-	return liveness;
-}
-
-template <class RegisterPressure>
-LivenessInfo<RegisterPressure> Liveness<RegisterPressure>::analysis(ControlGraph& controlGraph, Uint32 nameCount)
-{
-	Pool& pool = controlGraph.pool;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	// Allocate the temporary sets.
-	RegisterPressure::Set* killed = new(pool) RegisterPressure::Set[nNodes](pool, nameCount);
-	RegisterPressure::Set* usedByPhiNodes = NULL;
-	
-	// Allocate the globals sets.
-	RegisterPressure::Set* liveIn = new(pool) RegisterPressure::Set[nNodes](pool, nameCount);
-	RegisterPressure::Set* liveOut = new(pool) RegisterPressure::Set[nNodes](pool, nameCount);
-
-	// First stage of the liveness analysis: Compute the sets LocalLive(stored in LiveIn) and Killed.
-	//
-	for (Uint32 n = 0; n < (nNodes - 1); n++) {
-		ControlNode& node = *nodes[n];
-
-		RegisterPressure::Set& currentLocalLive = liveIn[n];
-		RegisterPressure::Set& currentKilled = killed[n];
-		
-		InstructionList& phiNodes = node.getPhiNodeInstructions();
-
-		if ((usedByPhiNodes == NULL) && !phiNodes.empty())
-			usedByPhiNodes = new(pool) RegisterPressure::Set[nNodes](pool, nameCount);
-
-		for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-			Instruction& phiNode = phiNodes.get(p);
-
-			InstructionDefine& define = phiNode.getInstructionDefineBegin()[0];
-			currentKilled.set(define.getRegisterName());
-
-			typedef DoublyLinkedList<ControlEdge> ControlEdgeList;
-			const ControlEdgeList& predecessors = node.getPredecessors();
-			ControlEdgeList::iterator p = predecessors.begin();
-			InstructionUse* useEnd = phiNode.getInstructionUseEnd();
-			for (InstructionUse* usePtr = phiNode.getInstructionUseBegin(); usePtr < useEnd; usePtr++, p = predecessors.advance(p))
-				if (usePtr->isRegister())
-					usedByPhiNodes[predecessors.get(p).getSource().dfsNum].set(usePtr->getRegisterName());
-		}
-
-		// Find the instructions contributions to the sets LocalLive and Killed.
-		//
-		InstructionList& instructions = node.getInstructions();
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			// If a VirtualRegister is 'used' before being 'defined' then we add it to set LocalLive.
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					Uint32 index = usePtr->getRegisterName();
-
-					if (!currentKilled.test(index))
-						currentLocalLive.set(index);
-				}
-
-			// If a Virtualregister is 'defined' then we add it to the set Killed.
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					currentKilled.set(definePtr->getRegisterName());
-		}
-	}
-
-	// Second stage of the liveness analysis: We propagate the LiveIn & LiveOut through the entire 
-	// control-flow graph.
-	//
-	RegisterPressure::Set temp(pool, nameCount);
-
-	bool changed;
-	do {
-		changed = false;
-
-		// For all nodes is this graph except the endNode.
-		for (Int32 n = (nNodes - 2); n >= 0; n--) {
-			ControlNode& node = *nodes[n];
-
-			RegisterPressure::Set& currentLiveIn = liveIn[n];
-			RegisterPressure::Set& currentLiveOut = liveOut[n];
-
-			// Compute temp = Union of LiveIn(s) (s a successor of this node) | usedByPhiNodes(n).
-			// temp will be the new LiveOut(n).
-			Uint32 nSuccessors = node.nSuccessors();
-			if (nSuccessors != 0) {
-				temp = liveIn[node.nthSuccessor(0).getTarget().dfsNum];
-				for (Uint32 s = 1; s < nSuccessors; s++)
-					temp |= liveIn[node.nthSuccessor(s).getTarget().dfsNum];
-			} else 
-				temp.clear();
-
-			// Insert the phiNodes contribution.
-			if (usedByPhiNodes != NULL)
-				temp |= usedByPhiNodes[n];
-
-			// If temp and LiveOut(n) differ then set LiveOut(n) = temp and recalculate the
-			// new LiveIn(n).
-			if (currentLiveOut != temp) {
-				currentLiveOut = temp;
-				temp -= killed[n]; // FIX: could be optimized with one call to unionDiff !
-				temp |= currentLiveIn;
-			
-				if (currentLiveIn != temp) {
-					currentLiveIn = temp;
-					changed = true;
-				}
-			}
-		}
-	} while(changed);
-
-	LivenessInfo<RegisterPressure> liveness;
-	liveness.liveIn = liveIn;
-	liveness.liveOut = liveOut;
-	DEBUG_LOG_ONLY(liveness.size = nNodes);
-	return liveness;
-}
-
-#ifdef DEBUG_LOG
-template <class RegisterPressure>
-void LivenessInfo<RegisterPressure>::printPretty(LogModuleObject log)
-{
-	for (Uint32 n = 0; n < size; n++) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Node N%d:\n\tliveIn = ", n));
-		liveIn[n].printPretty(log);
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\tliveOut = "));
-		liveOut[n].printPretty(log);
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-	}
-}
-#endif // DEBUG_LOG
-
-#endif // _LIVENESS_H_

mozilla/ef/Compiler/RegisterAllocator/Makefile

@@ -1,40 +0,0 @@
-#! gmake
-
-DEPTH			= ../..
-
-MODULE_NAME		= RegisterAllocator
-
-include $(DEPTH)/config/config.mk
-
-INCLUDES		+=										\
-	-I$(DEPTH)/Utilities/General						\
-	-I$(DEPTH)/Utilities/zlib							\
-	-I$(DEPTH)/Runtime/ClassReader						\
-	-I$(DEPTH)/Runtime/NativeMethods					\
-	-I$(DEPTH)/Runtime/System							\
-	-I$(DEPTH)/Runtime/ClassInfo						\
-	-I$(DEPTH)/Runtime/FileReader						\
-	-I$(DEPTH)/Compiler/PrimitiveGraph					\
-	-I$(DEPTH)/Compiler/FrontEnd						\
-	-I$(DEPTH)/Compiler/Optimizer						\
-	-I$(DEPTH)/Compiler/CodeGenerator					\
-	-I$(DEPTH)/Compiler/CodeGenerator/md				\
-	-I$(DEPTH)/Compiler/CodeGenerator/md/$(CPU_ARCH)	\
-	-I$(DEPTH)/Compiler/RegisterAllocator				\
-	-I$(DEPTH)/Driver/StandAloneJava					\
-	-I$(DEPTH)/Debugger									\
-	$(NULL)
-
-CXXSRCS 		=										\
-	RegisterAllocator.cpp								\
-	RegisterAllocatorTools.cpp							\
-	DominatorGraph.cpp									\
-	VirtualRegister.cpp									\
-	BitSet.cpp											\
-	SparseSet.cpp										\
-	$(NULL)
-
-
-include $(DEPTH)/config/rules.mk
-
-libs:: $(MODULE)

mozilla/ef/Compiler/RegisterAllocator/PhiNodeRemover.h

@@ -1,392 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _PHI_NODE_REMOVER_H_
-#define _PHI_NODE_REMOVER_H_
-
-#include "Fundamentals.h"
-#include "Pool.h"
-#include "ControlGraph.h"
-#include "DominatorGraph.h"
-#include "VirtualRegister.h"
-#include "RegisterPressure.h"
-#include "Liveness.h"
-#include "Instruction.h"
-#include "InstructionEmitter.h"
-#include "SparseSet.h"
-#include <string.h>
-
-//------------------------------------------------------------------------------
-// RegisterNameNode -
-
-struct RegisterNameNode 
-{
-	RegisterNameNode*	next;
-	RegisterName		newName;
-	Uint32				nextPushed;
-};
-
-//------------------------------------------------------------------------------
-// CopyData -
-
-struct CopyData
-{
-	RegisterName		source;
-	RegisterClassKind	classKind;
-	Uint32				useCount;
-	bool				isLiveOut;
-	RegisterName		sourceNameToUse;
-	RegisterName		temporaryName;
-	RegisterNameNode*	newName;
-};
-
-//------------------------------------------------------------------------------
-// PhiNodeRemover<RegisterPressure> -
-
-template <class RegisterPressure>
-struct PhiNodeRemover
-{
-	// Replace the phi nodes by copy instructions.
-	static void replacePhiNodes(ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter);
-};
-
-// Split some of the critical edges and return true if there are still some
-// in the graph after that.
-//
-static bool splitCriticalEdges(ControlGraph& /*cg*/)
-{
-	// FIX: not implemented.
-	return true;
-}
-
-inline void pushName(Pool& pool, RegisterNameNode** stack, SparseSet& pushed, Uint32* nodeListPointer, RegisterName oldName, RegisterName newName)
-{
-	RegisterNameNode& newNode = *new(pool) RegisterNameNode();
-
-	if (pushed.test(oldName))
-		(*stack)->newName = newName;
-	else {
-		newNode.newName = newName;
-		newNode.nextPushed = *nodeListPointer;
-		*nodeListPointer = oldName;
-		newNode.next = *stack;
-		*stack = &newNode;
-		pushed.set(oldName);
-	}
-}
-
-template <class RegisterPressure>
-void PhiNodeRemover<RegisterPressure>::replacePhiNodes(ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter)
-{
-	Pool& pool = controlGraph.pool;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	// Initialize the local variables.
-	//
-
-	// When we insert the copies we will also need to create new VirtualRegisters for
-	// the insertion of temporaries. The maximum number of temporary register will not
-	// exceed the number of phiNodes in the primitive graph.
-	Uint32 nameCount = vrManager.getSize();
-	Uint32 maxNameCount = nameCount;
-	for (Uint32 n = 0; n < nNodes; n++)
-		maxNameCount += nodes[n]->getPhiNodes().length();
-
-	// If the CFG contains some critical edges (backward edge which source has more than one
-	// outgoing edge and destination has more than one incomimg edge) then we need the liveness
-	// information to be able to insert temporary copies.
-	RegisterPressure::Set* liveOut = NULL;
-	if (splitCriticalEdges(controlGraph))
-		liveOut = Liveness<LowRegisterPressure>::analysis(controlGraph, nameCount).liveOut;
-
-	DominatorGraph dGraph(controlGraph);
-
-	SparseSet pushed(pool, maxNameCount);
-	SparseSet destinationList(pool, maxNameCount);
-	SparseSet workList(pool, maxNameCount);
-
-	CopyData* copyStats = new(pool) CopyData[maxNameCount];
-	memset(copyStats, '\0', maxNameCount*sizeof(CopyData));
-
-	struct NodeStack {
-		Uint32* next;
-		Uint32* limit;
-		Uint32 pushedList;
-	};
-
-	// Allocate the node stack and initialize the node stack pointer.
-	NodeStack* nodeStack = new(pool) NodeStack[nNodes + 1];
-	NodeStack* nodeStackPtr = nodeStack;
-
-	// We start by the begin node. 
-	Uint32 startNode = 0;
-	Uint32* next = &startNode;
-	Uint32* limit = &startNode + 1;
-
-	while (true) {
-
-		if (next == limit) {
-			// If there are no more node in the sibling, we have to pop the current
-			// frame from the stack and update the copyStats of the pushed nodes.
-			//
-			if (nodeStackPtr == nodeStack)
-				// We are at the bottom of the stack and there are no more nodes
-				// to look at. We are done !
-				break;
-
-			--nodeStackPtr;
-			// We are done with all the children of this node in the dominator tree.
-			// We need to update the copy information of all the new names pushed
-			// during the walk over this node.
-			Uint32 pushedList = nodeStackPtr->pushedList;
-			while (pushedList != 0) {
-				Uint32 nextName = copyStats[pushedList].newName->nextPushed;
-				copyStats[pushedList].newName = copyStats[pushedList].newName->next;
-				pushedList = nextName;
-			}
-
-			// restore the previous frame.
-			next = nodeStackPtr->next;
-			limit = nodeStackPtr->limit;
-		} else {
-			Uint32 currentNode = *next++;
-			Uint32 pushedList = 0;
-
-
-			// Initialize the sets.
-			pushed.clear();
-			destinationList.clear();
-
-			// STEP1:
-			//  Walk the instruction list and to replace all the instruction uses with their new name. 
-			//  If the instruction is a phi node and its defined register is alive at the end of this 
-			//  block then we push the defined register into the stack.
-			//
-			ControlNode& node = *nodes[currentNode];
-			RegisterPressure::Set* currentLiveOut = (liveOut != NULL) ? &liveOut[currentNode] : (RegisterPressure::Set*) 0;
-
-			InstructionList& phiNodes = node.getPhiNodeInstructions();
-			for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-				Instruction& phiNode = phiNodes.get(p);
-
-				InstructionUse* useEnd = phiNode.getInstructionUseEnd();
-				for (InstructionUse* usePtr = phiNode.getInstructionUseBegin(); usePtr < useEnd; usePtr++) {
-					assert(usePtr->isRegister());
-					RegisterName name = usePtr->getRegisterName();
-
-					if (copyStats[name].newName != NULL && copyStats[name].newName->newName != name)
-						usePtr->setRegisterName(copyStats[name].newName->newName);
-				}
-
-				if (currentLiveOut != NULL) {
-					// This is a phi node and we have to push its defined name if it is live
-					// at the end of the node. We only need to do this if the CFG has critical edges.
-					assert(phiNode.getInstructionDefineBegin() != phiNode.getInstructionDefineEnd() && phiNode.getInstructionDefineBegin()[0].isRegister());
-					RegisterName name = phiNode.getInstructionDefineBegin()[0].getRegisterName();
-
-					if (currentLiveOut->test(name))
-						pushName(pool, &(copyStats[name].newName), pushed, &pushedList, name, name);
-				}
-				
-			}
-
-			InstructionList& instructions = node.getInstructions();
-			for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-				Instruction& instruction = instructions.get(i);
-
-				InstructionUse* useEnd = instruction.getInstructionUseEnd();
-				for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-					if (usePtr->isRegister()) {
-						RegisterName name = usePtr->getRegisterName();
-
-						if (copyStats[name].newName != NULL && copyStats[name].newName->newName != name)
-							usePtr->setRegisterName(copyStats[name].newName->newName);
-					}
-			}
-
-			// STEP2:
-			//  Look at this node's successors' phiNodes. We keep track of the number of time
-			//  a VR will be used by another copy instruction and insert each definition into the 
-			//  destinationList. This is the only pass over this node's successors as we will
-			//  get all the information we need in the CopyData structures.
-			//
-			ControlEdge* successorEdgeEnd = node.getSuccessorsEnd();
-			for (ControlEdge* successorEdgePtr = node.getSuccessorsBegin(); successorEdgePtr < successorEdgeEnd; successorEdgePtr++) {
-				Uint32 useIndex = successorEdgePtr->getIndex();
-				ControlNode& successor = successorEdgePtr->getTarget();
-
-				// Look at its phi nodes. The phi nodes are at the top of the instruction list. We exit
-				// as soon as we find an instruction which is not a phi node
-				InstructionList& phiNodes = successor.getPhiNodeInstructions();
-				for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-					Instruction& phiNode = phiNodes.get(p);
-					
-					assert((phiNode.getInstructionUseBegin() + useIndex) < phiNode.getInstructionUseEnd());
-					assert(phiNode.getInstructionDefineBegin() != phiNode.getInstructionDefineEnd());
-
-					InstructionUse& source = phiNode.getInstructionUseBegin()[useIndex];
-					InstructionDefine& destination = phiNode.getInstructionDefineBegin()[0];
-
-					assert(source.isRegister() && destination.isRegister());
-
-					RegisterName sourceName = source.getRegisterName();
-					RegisterName destinationName = destination.getRegisterName();
-
-					// Get the correct name for the source.
-					if (copyStats[sourceName].newName != NULL)
-						sourceName = copyStats[sourceName].newName->newName;
-
-					// Update the CopyData structures.
-					if ((sourceName != rnInvalid) && (sourceName != destinationName)) {
-						copyStats[destinationName].source = sourceName;
-						copyStats[destinationName].classKind = destination.getRegisterClass();
-						copyStats[destinationName].isLiveOut = (currentLiveOut != NULL) ? currentLiveOut->test(destinationName) : false;
-						copyStats[destinationName].sourceNameToUse = destinationName;
-						copyStats[sourceName].sourceNameToUse = sourceName;
-						copyStats[sourceName].useCount++;
-						destinationList.set(destinationName);
-					}
-				}
-			}
-
-			// STEP3:
-			//  Insert into the worklist only the destination registers that will be not used in 
-			//  another copy instruction in this block.
-			//
-			assert(workList.getSize() == 0);
-			for (SparseSet::iterator d = destinationList.begin(); !destinationList.done(d); d = destinationList.advance(d)) {
-				Uint32 dest = destinationList.get(d);
-				if (copyStats[dest].useCount == 0)
-					workList.set(dest);
-			}
-
-			// STEP4:
-			//  Insert the copy instructions.
-			//
-			Uint32 destinationListSize = destinationList.getSize();
-			InstructionList::iterator endOfTheNode = instructions.end();
-
-			// Find the right place to insert the copy instructions.
-			if (destinationListSize != 0)
-				while (instructions.get(endOfTheNode).getFlags() & ifControl)
-					endOfTheNode = instructions.retreat(endOfTheNode);
-
-			while (destinationListSize != 0) {
-				while(workList.getSize()) {
-					RegisterName destinationName = RegisterName(workList.getOne());
-					RegisterName sourceName = copyStats[destinationName].source;
-
-					workList.clear(destinationName);
-					if (copyStats[destinationName].isLiveOut && !copyStats[destinationName].temporaryName) {
-						// Lost copy problem.
-						copyStats[destinationName].isLiveOut = false;
-
-						RegisterName sourceName = destinationName;
-						RegisterClassKind classKind = copyStats[sourceName].classKind;
-						RegisterName destinationName = getName(vrManager.newVirtualRegister(classKind));
-						assert(destinationName < maxNameCount);
-
-						copyStats[destinationName].classKind = classKind;
-						copyStats[sourceName].useCount = 0;
-				
-						// We need to insert a copy to a temporary register to keep the
-						// source register valid at the end of the node defining it.
-						// This copy will be inserted right after the phi node defining it.
-						RegisterName from = copyStats[sourceName].sourceNameToUse;
-						Instruction* definingPhiNode = vrManager.getVirtualRegister(from).getDefiningInstruction();
-						assert(definingPhiNode && (definingPhiNode->getFlags() & ifPhiNode) != 0);
-
-						RegisterID fromID = buildRegisterID(from, classKind);
-						RegisterID toID = buildRegisterID(destinationName, classKind);
-						Instruction& copy = emitter.newCopy(*definingPhiNode->getPrimitive(), fromID, toID);
-						vrManager.getVirtualRegister(destinationName).setDefiningInstruction(copy);
-						definingPhiNode->getPrimitive()->getContainer()->getInstructions().addFirst(copy);
-
-						copyStats[sourceName].temporaryName = destinationName;
-						copyStats[sourceName].sourceNameToUse = destinationName;
-						pushName(pool, &(copyStats[sourceName].newName), pushed, &pushedList, sourceName, destinationName);
-					}
-
-					// Insert the copy instruction at the end of the current node.
-					RegisterName from = copyStats[sourceName].sourceNameToUse;
-
-					RegisterClassKind classKind = copyStats[destinationName].classKind;
-					RegisterID fromID = buildRegisterID(from, classKind);
-					RegisterID toID = buildRegisterID(destinationName, classKind);
-					Instruction& copy = emitter.newCopy(*vrManager.getVirtualRegister(from).getDefiningInstruction()->getPrimitive(), fromID, toID);
-					instructions.insertAfter(copy, endOfTheNode);
-					endOfTheNode = instructions.advance(endOfTheNode);
-
-					copyStats[sourceName].useCount = 0;
-					if (destinationList.test(sourceName) && copyStats[sourceName].isLiveOut)
-						pushName(pool, &(copyStats[sourceName].newName), pushed, &pushedList, sourceName, destinationName);
-					copyStats[sourceName].isLiveOut = false;
-					copyStats[sourceName].sourceNameToUse = destinationName;
-
-					if (destinationList.test(sourceName))
-						workList.set(sourceName);
-					destinationList.clear(destinationName);
-				}
-
-				destinationListSize = destinationList.getSize();
-				if (destinationListSize != 0) {
-					RegisterName sourceName = RegisterName(destinationList.getOne());
-					RegisterName destinationName;
-
-					if (!copyStats[sourceName].temporaryName) {
-						// Cycle problem.
-						RegisterClassKind classKind = copyStats[sourceName].classKind;
-						destinationName = getName(vrManager.newVirtualRegister(classKind));
-						assert(destinationName < maxNameCount);
-				
-						copyStats[destinationName].classKind = classKind;
-						copyStats[sourceName].temporaryName = destinationName;
-
-						// Insert the copy instruction at the end of the current node.
-						RegisterName from = copyStats[sourceName].sourceNameToUse;
-
-						RegisterID fromID = buildRegisterID(from, classKind);
-						RegisterID toID = buildRegisterID(destinationName, classKind);
-						Instruction& copy = emitter.newCopy(*vrManager.getVirtualRegister(from).getDefiningInstruction()->getPrimitive(), fromID, toID);
-						vrManager.getVirtualRegister(destinationName).setDefiningInstruction(copy);
-						instructions.insertAfter(copy, endOfTheNode);
-						endOfTheNode = instructions.advance(endOfTheNode);
-					} else 
-						destinationName = copyStats[sourceName].temporaryName;
-
-					copyStats[sourceName].useCount = 0;
-					copyStats[sourceName].isLiveOut = false;
-					copyStats[sourceName].sourceNameToUse = destinationName;
-					pushName(pool, &(copyStats[sourceName].newName), pushed, &pushedList, sourceName, destinationName);
-
-					workList.set(sourceName);
-				}
-			}
-
-			nodeStackPtr->pushedList = pushedList;
-			nodeStackPtr->next = next;
-			nodeStackPtr->limit = limit;
-			++nodeStackPtr;
-			next = dGraph.getSuccessorsBegin(currentNode);
-			limit = dGraph.getSuccessorsEnd(currentNode);
-		}
-	}
-}
-
-#endif // _PHI_NODE_REMOVER_H_

mozilla/ef/Compiler/RegisterAllocator/RegisterAllocator.cpp

@@ -1,155 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "LogModule.h"
-#include "RegisterAllocator.h"
-#include "RegisterPressure.h"
-#include "RegisterAllocatorTools.h"
-#include "PhiNodeRemover.h"
-#include "LiveRange.h"
-#include "Liveness.h"
-#include "InterferenceGraph.h"
-#include "LiveRangeGraph.h"
-#include "Coalescing.h"
-#include "Spilling.h"
-#include "Coloring.h"
-#include "Splits.h"
-
-class Pool;
-class ControlGraph;
-class VirtualRegisterManager;
-class InstructionEmitter;
-
-UT_DEFINE_LOG_MODULE(RegAlloc);
-
-void RegisterAllocator::allocateRegisters(Pool& pool, ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter)
-{
-	// Insert the phi node instructions. We want to do this to have a single defined register per instruction.
-	// If we keep the PhiNode (as a DataNode) and a PhiNode is of DoubleWordKind then we have to execute
-	// some special code for the high word annotation.
-	//
-	RegisterAllocatorTools::insertPhiNodeInstructions(controlGraph, emitter);
-
-	// Perform some tests on the instruction graph.
-	//
-	DEBUG_ONLY(RegisterAllocatorTools::testTheInstructionGraph(controlGraph, vrManager));
-
-	// Replace the phi node instructions by their equivalent copy instructions.
-	//
-	PhiNodeRemover<LowRegisterPressure>::replacePhiNodes(controlGraph, vrManager, emitter);
-
-	// Do the register allocation.
-	//
-	RegisterAllocator registerAllocator(pool, controlGraph, vrManager, emitter);
-	registerAllocator.doGraphColoring();
-}
-
-void RegisterAllocator::doGraphColoring()
-{
-	// Initialize the liverange map.
-	//
-	initLiveRanges();
-
-	// Build the live ranges. We do this to compress the number of RegisterNames 
-	// used in the insterference graph.
-	//
-	LiveRange<LowRegisterPressure>::build(*this);
-
-	// Remove unnecessary copies.
-	//
-	RegisterAllocatorTools::removeUnnecessaryCopies(*this);
-
-	for (Uint8 loop = 0; loop < 10; loop++) {
-
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("********* RegisterAllocator loop %d *********\n", loop));
-
-		while(true) {
-			// Build the interference graph.
-			//
-			iGraph.build();
-
-			// Coalesce the copy instructions.
-			//
-			if (!Coalescing<LowRegisterPressure>::coalesce(*this))
-				break;
-		}
-
-		// Print the interference graph.
-		//
-		DEBUG_LOG_ONLY(iGraph.printPretty(UT_LOG_MODULE(RegAlloc)));
-
-		// Calculate the spill costs.
-		//
-		Spilling<LowRegisterPressure>::calculateSpillCosts(*this);
-		DEBUG_LOG_ONLY(RegisterAllocatorTools::printSpillCosts(*this));
-
-		// Calculate the split costs.
-		//
-		Splits<LowRegisterPressure>::calculateSplitCosts(*this);
-		DEBUG_LOG_ONLY(RegisterAllocatorTools::printSplitCosts(*this));
-
-		// Build the live range graph.
-		//
-		lGraph.build();
-		DEBUG_LOG_ONLY(lGraph.printPretty(UT_LOG_MODULE(RegAlloc)));
-
-		// Color the graph. If it succeeds then we're done with the
-		// register allocation.
-		//
-		if (Coloring<LowRegisterPressure>::color(*this)) {
-			// Write the final colors in the instruction graph.
-			//
-			Coloring<LowRegisterPressure>::finalColoring(*this);
-
-			UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("********** RegisterAllocator  done **********\n"));
-			DEBUG_LOG_ONLY(RegisterAllocatorTools::printInstructions(*this));
-
-			return;
-		}
-
-		// We need to spill some registers.
-		//
-		Spilling<LowRegisterPressure>::insertSpillCode(*this);
-
-		// Insert the split instructions.
-		//
-		Splits<LowRegisterPressure>::insertSplitCode(*this);
-
-		// Update the live ranges.
-		// 
-		// FIX
-	}
-
-#ifdef DEBUG_LOG
-	RegisterAllocatorTools::updateInstructionGraph(*this);
-	RegisterAllocatorTools::printInstructions(*this);
-#endif
-	fprintf(stderr, "!!! Coloring failed after 10 loops !!!\n");
-	abort();
-}
-
-void RegisterAllocator::initLiveRanges()
-{
-	Uint32 count = this->nameCount;
-	RegisterName* name2range = new(pool) RegisterName[nameCount];
-	for (RegisterName r = RegisterName(1); r < count; r = RegisterName(r + 1))
-		name2range[r] = r;
-	this->name2range = name2range;
-	rangeCount = count;
-}

mozilla/ef/Compiler/RegisterAllocator/RegisterAllocator.h

@@ -1,88 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _REGISTER_ALLOCATOR_H_
-#define _REGISTER_ALLOCATOR_H_
-
-class Pool;
-class ControlGraph;
-class InstructionEmitter;
-struct SpillCost;
-struct SplitCost;
-
-#include "Liveness.h"
-#include "VirtualRegister.h"
-#include "RegisterPressure.h" // This should included by Backend.cpp
-#include "InterferenceGraph.h"
-#include "LiveRangeGraph.h"
-
-//template <class RegisterPressure>
-class RegisterAllocator
-{
-public:
-
-	Pool&									pool;			//
-	ControlGraph&							controlGraph;	//
-	VirtualRegisterManager&					vrManager;		//
-	InstructionEmitter&						emitter;		//
-
-	RegisterName*							name2range;		//
-	RegisterName*							color;			//
-	SpillCost*								spillCost;		//
-	SparseSet*								willSpill;		//
-	SplitCost*								splitCost;		//
-	NameLinkedList**						splitAround;	//
-	InterferenceGraph<LowRegisterPressure>	iGraph;			//
-	LiveRangeGraph<LowRegisterPressure>		lGraph;			//
-	LivenessInfo<LowRegisterPressure>		liveness;		//
-	Uint32									nameCount;		//
-	Uint32									rangeCount;		//
-	bool									splitFound;		//
-
-private:
-
-	//
-	//
-	void doGraphColoring();
-
-public:
-
-	//
-	//
-	inline RegisterAllocator(Pool& pool, ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter);
-
-	//
-	//
-	bool canInterfere(RegisterName /*name1*/, RegisterName /*name2*/) const {return true;}
-
-	//
-	//
-	void initLiveRanges();
-
-	//
-	//
-	static void allocateRegisters(Pool& pool, ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter);
-};
-
-//
-//
-inline RegisterAllocator::RegisterAllocator(Pool& pool, ControlGraph& controlGraph, VirtualRegisterManager& vrManager, InstructionEmitter& emitter)
-	: pool(pool), controlGraph(controlGraph), vrManager(vrManager), emitter(emitter), iGraph(*this), lGraph(*this), nameCount(vrManager.getSize()) {}
-
-#endif // _REGISTER_ALLOCATOR_H_
-

mozilla/ef/Compiler/RegisterAllocator/RegisterAllocatorTools.cpp

@@ -1,355 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "LogModule.h"
-#include "RegisterAllocatorTools.h"
-#include "Pool.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Primitives.h"
-#include "InstructionEmitter.h"
-#include "Instruction.h"
-#include "RegisterAllocator.h"
-#include "Spilling.h"
-#include "Splits.h"
-#include "BitSet.h"
-
-UT_EXTERN_LOG_MODULE(RegAlloc);
-
-#ifdef DEBUG
-void RegisterAllocatorTools::testTheInstructionGraph(ControlGraph& controlGraph, VirtualRegisterManager& vrManager)
-{
-	// Test the declared VirtualRegisters. The register allocator tries to condense the register universe.
-	// Any gap in the VirtualRegister names will be a loss of efficiency !!!!
-
-	Uint32 nameCount = vrManager.getSize();
-	BitSet registerSeen(controlGraph.pool, nameCount);
-
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-
-		InstructionList& instructions = nodes[n]->getInstructions();
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					registerSeen.set(usePtr->getRegisterName());
-
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					registerSeen.set(definePtr->getRegisterName());
-		}
-
-		InstructionList& phiNodes = nodes[n]->getPhiNodeInstructions();
-		for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-			Instruction& instruction = phiNodes.get(p);
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					registerSeen.set(usePtr->getRegisterName());
-
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					registerSeen.set(definePtr->getRegisterName());
-		}
-	}
-
-	bool renameRegisters = false;
-	for (BitSet::iterator i = registerSeen.nextZero(0); !registerSeen.done(i); i = registerSeen.nextZero(i)) {
-		renameRegisters = true;
-		fprintf(stderr, 
-				"WARNING: The VirtualRegister vr%d has been allocated during CodeGeneration but\n"
-				"         is never used nor defined by any instruction in the instruction graph\n"
-				"                                  PLEASE FIX                                  \n",
-				i);
-	}
-	if (renameRegisters) {
-		Instruction** definingInstruction = new Instruction*[nameCount];
-		memset(definingInstruction, '\0', nameCount * sizeof(Instruction*));
-		RegisterName* newName = new RegisterName[nameCount];
-		memset(newName, '\0', nameCount * sizeof(RegisterName));
-		RegisterName nextName = RegisterName(1);
-
-		for (Uint32 n = 0; n < nNodes; n++) {
-
-			InstructionList& instructions = nodes[n]->getInstructions();
-			for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-				Instruction& instruction = instructions.get(i);
-
-				InstructionUse* useEnd = instruction.getInstructionUseEnd();
-				for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-					if (usePtr->isRegister()) {
-						RegisterName name = usePtr->getRegisterName();
-						if (newName[name] == rnInvalid) {
-							newName[name] = nextName;
-							definingInstruction[nextName] = vrManager.getVirtualRegister(name).getDefiningInstruction();
-							nextName = RegisterName(nextName + 1);
-						}
-						usePtr->setRegisterName(newName[name]);
-					}
-
-				InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-				for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-					if (definePtr->isRegister()) {
-						RegisterName name = definePtr->getRegisterName();
-						if (newName[name] == rnInvalid) {
-							newName[name] = nextName;
-							definingInstruction[nextName] = vrManager.getVirtualRegister(name).getDefiningInstruction();
-							nextName = RegisterName(nextName + 1);
-						}
-						definePtr->setRegisterName(newName[name]);
-					}
-			}
-
-			InstructionList& phiNodes = nodes[n]->getPhiNodeInstructions();
-			for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-				Instruction& instruction = phiNodes.get(p);
-
-				InstructionUse* useEnd = instruction.getInstructionUseEnd();
-				for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-					if (usePtr->isRegister()) {
-						RegisterName name = usePtr->getRegisterName();
-						if (newName[name] == rnInvalid) {
-							newName[name] = nextName;
-							definingInstruction[nextName] = vrManager.getVirtualRegister(name).getDefiningInstruction();
-							nextName = RegisterName(nextName + 1);
-						}
-						usePtr->setRegisterName(newName[name]);
-					}
-
-				InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-				for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-					if (definePtr->isRegister()) {
-						RegisterName name = definePtr->getRegisterName();
-						if (newName[name] == rnInvalid) {
-							newName[name] = nextName;
-							definingInstruction[nextName] = vrManager.getVirtualRegister(name).getDefiningInstruction();
-							nextName = RegisterName(nextName + 1);
-						}
-						definePtr->setRegisterName(newName[name]);
-					}
-			}
-		}
-		
-		vrManager.setSize(nextName);
-
-		for (RegisterName r = RegisterName(1); r < nextName; r = RegisterName(r + 1))
-			vrManager.getVirtualRegister(r).definingInstruction = definingInstruction[r];
-
-		UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("RegisterMap:\n"));
-		for (Uint32 i = 1; i < nameCount; i++)
-			if (newName[i] != 0)
-				UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\tvr%d becomes vr%d.\n", i, newName[i]));
-			else
-				UT_OBJECTLOG(UT_LOG_MODULE(RegAlloc), PR_LOG_ALWAYS, ("\tvr%d is dead.\n", i));
-
-
-		delete newName;
-		delete definingInstruction;
-	}
-
-}
-#endif // DEBUG
-
-void RegisterAllocatorTools::removeUnnecessaryCopies(RegisterAllocator& registerAllocator)
-{
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		InstructionList& instructions = nodes[n]->getInstructions();
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i);) {
-			Instruction& instruction = instructions.get(i);
-			i = instructions.advance(i);
-
-			if (instruction.getFlags() & ifCopy) {
-				assert(instruction.getInstructionUseBegin() != instruction.getInstructionUseEnd() && instruction.getInstructionUseBegin()[0].isRegister());
-				assert(instruction.getInstructionDefineBegin() != instruction.getInstructionDefineEnd() && instruction.getInstructionDefineBegin()[0].isRegister());
-				
-				RegisterName source = name2range[instruction.getInstructionUseBegin()[0].getRegisterName()];
-				RegisterName destination = name2range[instruction.getInstructionDefineBegin()[0].getRegisterName()];
-
-				if (source == destination)
-					instruction.remove();
-			}
-		}
-	}
-}
-
-
-void RegisterAllocatorTools::updateInstructionGraph(RegisterAllocator& registerAllocator)
-{
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		InstructionList& instructions = nodes[n]->getInstructions();
-		for (InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					usePtr->setRegisterName(name2range[usePtr->getRegisterName()]);
-
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					definePtr->setRegisterName(name2range[definePtr->getRegisterName()]);
-		}
-
-		InstructionList& phiNodes = nodes[n]->getPhiNodeInstructions();
-		for (InstructionList::iterator p = phiNodes.begin(); !phiNodes.done(p); p = phiNodes.advance(p)) {
-			Instruction& instruction = phiNodes.get(p);
-
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			for (InstructionUse* usePtr = instruction.getInstructionUseBegin(); usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					usePtr->setRegisterName(name2range[usePtr->getRegisterName()]);
-
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			for (InstructionDefine* definePtr = instruction.getInstructionDefineBegin(); definePtr < defineEnd; definePtr++)
-				if (definePtr->isRegister())
-					definePtr->setRegisterName(name2range[definePtr->getRegisterName()]);
-		}
-	}
-}
-
-
-void RegisterAllocatorTools::insertPhiNodeInstructions(ControlGraph& controlGraph, InstructionEmitter& emitter)
-{
-	Pool& pool = controlGraph.pool;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-	
-	for (Uint32 n = 0; n < nNodes; n++) {
-		ControlNode& node = *nodes[n];
-		DoublyLinkedList<PhiNode>& phiNodes = node.getPhiNodes();
-
-		if (!phiNodes.empty()) {
-
-			// Set the index of the incoming edges.
-			Uint32 index = 0;
-			const DoublyLinkedList<ControlEdge>& predecessors = node.getPredecessors();
-			for (DoublyLinkedList<ControlEdge>::iterator p = predecessors.begin(); !predecessors.done(p); p = predecessors.advance(p))
-				predecessors.get(p).setIndex(index++);
-
-			// Insert the phi node instruction in the instruction list.
-			for (DoublyLinkedList<PhiNode>::iterator i = phiNodes.begin(); !phiNodes.done(i); i = phiNodes.advance(i)) {
-				PhiNode& phiNode = phiNodes.get(i);
-				ValueKind kind = phiNode.getKind();
-
-				if (!isStorableKind(kind))
-					continue;
-
-				RegisterClassKind classKind = rckGeneral; // FIX: get class kind from phi node kind.
-				Uint32 nInputs = phiNode.nInputs();
-
-				PhiNodeInstruction& phiNodeInstruction = *new(pool) PhiNodeInstruction(&phiNode, pool, nInputs);
-
-				emitter.defineProducer(phiNode, phiNodeInstruction, 0, classKind, drLow);
-				for (Uint32 whichInput = 0; whichInput < nInputs; whichInput++)
-					emitter.useProducer(phiNode.nthInputVariable(whichInput), phiNodeInstruction, whichInput, classKind, drLow);
-
-				node.addPhiNodeInstruction(phiNodeInstruction);
-
-				if (isDoublewordKind(kind)) {
-					PhiNodeInstruction& phiNodeInstruction = *new(pool) PhiNodeInstruction(&phiNode, pool, nInputs);
-
-					emitter.defineProducer(phiNode, phiNodeInstruction, 0, classKind, drHigh);
-					for (Uint32 whichInput = 0; whichInput < nInputs; whichInput++)
-						emitter.useProducer(phiNode.nthInputVariable(whichInput), phiNodeInstruction, whichInput, classKind, drHigh);
-
-					node.addPhiNodeInstruction(phiNodeInstruction);
-				}
-			}
-		}
-	}
-}
-
-#ifdef DEBUG_LOG
-
-void RegisterAllocatorTools::printSpillCosts(RegisterAllocator& registerAllocator)
-{
-	LogModuleObject log = UT_LOG_MODULE(RegAlloc);
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	SpillCost* cost = registerAllocator.spillCost;
-
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Spill costs:\n"));
-	for (Uint32 i = 1; i < rangeCount; i++) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\trange %d : ", i));
-		if (cost[i].infinite)
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("infinite\n"));
-		else
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("%f\n", cost[i].cost));
-	}
-}
-
-void RegisterAllocatorTools::printSplitCosts(RegisterAllocator& registerAllocator)
-{
-	LogModuleObject log = UT_LOG_MODULE(RegAlloc);
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	SplitCost* cost = registerAllocator.splitCost;
-
-	UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("Split costs:\n"));
-	for (Uint32 i = 1; i < rangeCount; i++) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\trange %d : loads = %f stores = %f\n", i, cost[i].loads, cost[i].stores));
-	}
-}
-
-void RegisterAllocatorTools::printInstructions(RegisterAllocator& registerAllocator)
-{
-	LogModuleObject log = UT_LOG_MODULE(RegAlloc);
-	ControlNode** nodes = registerAllocator.controlGraph.dfsList;
-	Uint32 nNodes = registerAllocator.controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("N%d:\n", n));
-
-		InstructionList& phiNodes = nodes[n]->getPhiNodeInstructions();
-		InstructionList& instructions = nodes[n]->getInstructions();
-
-		if (!phiNodes.empty()) {
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, (" PhiNodes:\n", n));
-			for(InstructionList::iterator i = phiNodes.begin(); !phiNodes.done(i); i = phiNodes.advance(i)) {
-				phiNodes.get(i).printPretty(log);
-				UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-			}
-			if (!instructions.empty())
-				UT_OBJECTLOG(log, PR_LOG_ALWAYS, (" Instructions:\n", n));
-		}
-
-		for(InstructionList::iterator i = instructions.begin(); !instructions.done(i); i = instructions.advance(i)) {
-			instructions.get(i).printPretty(log);
-			UT_OBJECTLOG(log, PR_LOG_ALWAYS, ("\n"));
-		}
-	}
-}
-#endif // DEBUG_LOG

mozilla/ef/Compiler/RegisterAllocator/RegisterAllocatorTools.h

@@ -1,117 +0,0 @@
-//	-*- mode:C++; tab-width:4; truncate-lines:t -*-
-//
-//           CONFIDENTIAL AND PROPRIETARY SOURCE CODE OF
-//              NETSCAPE COMMUNICATIONS CORPORATION
-// Copyright © 1996, 1997 Netscape Communications Corporation.  All Rights
-// Reserved.  Use of this Source Code is subject to the terms of the
-// applicable license agreement from Netscape Communications Corporation.
-// The copyright notice(s) in this Source Code does not indicate actual or
-// intended publication of this Source Code.
-//
-// $Id: RegisterAllocatorTools.h,v 1.1.2.1 1999-03-02 16:12:05 fur%netscape.com Exp $
-//
-
-#ifndef _REGISTER_ALLOCATOR_TOOLS_H_
-#define _REGISTER_ALLOCATOR_TOOLS_H_
-
-#include "LogModule.h"
-#include "RegisterTypes.h"
-#include <string.h>
-
-class RegisterAllocator;
-class ControlGraph;
-class InstructionEmitter;
-class VirtualRegisterManager;
-
-struct RegisterAllocatorTools
-{
-	//
-	//
-	static void insertPhiNodeInstructions(ControlGraph& controlGraph, InstructionEmitter& emitter);
-
-	//
-	//
-	static void updateInstructionGraph(RegisterAllocator& registerAllocator);
-
-	//
-	//
-	static void removeUnnecessaryCopies(RegisterAllocator& registerAllocator);
-
-#ifdef DEBUG
-	//
-	//
-	static void testTheInstructionGraph(ControlGraph& controlGraph, VirtualRegisterManager& vrManager);
-#endif // DEBUG
-
-#ifdef DEBUG_LOG
-	//
-	//
-	static void printInstructions(RegisterAllocator& registerAllocator);
-
-	//
-	//
-	static void printSpillCosts(RegisterAllocator& registerAllocator);
-
-	//
-	//
-	static void printSplitCosts(RegisterAllocator& registerAllocator);
-#endif // DEBUG_LOG
-};
-
-//
-// FIX: this should go in a class (LookupTable ?)
-//
-
-inline RegisterName findRoot(RegisterName name, RegisterName* table)
-{
-	RegisterName* stack = table;
-	RegisterName* stackPtr = stack;
-
-	RegisterName newName;
-	while((newName = table[name]) != name) {
-		*--stackPtr = name;
-		name = newName;
-	}
-
-	while (stackPtr != stack)
-		table[*stackPtr++] = name;
-
-	return name;
-}
-
-inline void init(RegisterName* table, Uint32 nameCount)
-{
-	for (RegisterName r = RegisterName(0); r < nameCount; r = RegisterName(r + 1))
-		table[r] = r;
-}
-
-inline Uint32 compress(RegisterName* name2range, RegisterName* table, Uint32 nameCount, Uint32 tableSize)
-{
-	RegisterName* liveRange = new RegisterName[tableSize];
-	memset(liveRange, '\0', tableSize * sizeof(RegisterName));
-
-	// Update the lookup table.
-	for (RegisterName r = RegisterName(1); r < tableSize; r = RegisterName(r + 1))
-		findRoot(r, table);
-
-	// Count the liveranges.
-	Uint32 liveRangeCount = 1;
-	for (RegisterName s = RegisterName(1); s < tableSize; s = RegisterName(s + 1))
-		if (table[s] == s)
-			liveRange[s] = RegisterName(liveRangeCount++);
-
-	for (RegisterName t = RegisterName(1); t < nameCount; t = RegisterName(t + 1))
-		name2range[t] = liveRange[table[name2range[t]]];
-
-	return liveRangeCount;
-}
-
-inline double doLog10(Uint32 power)
-{
-	double log = 1.0;
-	while (power--)
-		log *= 10.0;
-	return log;
-}
-
-#endif // _REGISTER_ALLOCATOR_TOOLS_H_

mozilla/ef/Compiler/RegisterAllocator/RegisterAssigner.h

@@ -1,38 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _REGISTER_ASSIGNER_H_
-#define _REGISTER_ASSIGNER_H_
-
-#include "Fundamentals.h"
-#include "VirtualRegister.h"
-
-class FastBitMatrix;
-
-class RegisterAssigner
-{
-protected:
-  VirtualRegisterManager& vRegManager;
-  
-public:
-  RegisterAssigner(VirtualRegisterManager& vrMan) : vRegManager(vrMan) {}
-  
-  virtual bool assignRegisters(FastBitMatrix& interferenceMatrix) = 0;
-};
-
-#endif /* _REGISTER_ASSIGNER_H_ */

mozilla/ef/Compiler/RegisterAllocator/RegisterClass.h

@@ -1,25 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _REGISTER_CLASS_H_
-#define _REGISTER_CLASS_H_
-
-#include "Fundamentals.h"
-#include "RegisterTypes.h"
-
-#endif // _REGISTER_CLASS_H_

mozilla/ef/Compiler/RegisterAllocator/RegisterPressure.h

@@ -1,37 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _REGISTER_PRESSURE_H_
-#define _REGISTER_PRESSURE_H_
-
-#include "BitSet.h"
-#include "HashSet.h"
-
-struct LowRegisterPressure
-{
-	typedef BitSet Set;
-	static const bool setIsOrdered = true;
-};
-
-struct HighRegisterPressure
-{
-	typedef HashSet Set;
-	static const bool setIsOrdered = false;
-};
-
-#endif // _REGISTER_PRESSURE_H_

mozilla/ef/Compiler/RegisterAllocator/RegisterTypes.h

@@ -1,104 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _REGISTER_TYPES_H_
-#define _REGISTER_TYPES_H_
-
-#include "Fundamentals.h"
-
-//------------------------------------------------------------------------------
-// RegisterName -
-//
-
-enum RegisterName {
-	rnInvalid = 0,
-};
-
-//------------------------------------------------------------------------------
-// RegisterClassKind -
-//
-
-enum RegisterClassKind {
-	rckInvalid = 0,
-	rckGeneral,
-	rckStackSlot,
-
-	nRegisterClassKind
-};
-
-//------------------------------------------------------------------------------
-// RegisterID -
-//
-
-enum RegisterID {
-	invalidID = 0
-};
-
-//------------------------------------------------------------------------------
-// RegisterKind -
-//
-
-enum RegisterKind {
-	rkCallerSave = 0,
-	rkCalleeSave,
-};
-
-struct NameLinkedList {
-	RegisterName name;
-	NameLinkedList* next;
-};
-
-#ifdef DEBUG
-
-const registerNameMask = 		0x03ffffff;
-const coloredRegisterMask = 	0x04000000;
-const machineRegisterMask = 	0x08000000;
-const registerClassMask = 		0xf0000000;
-
-const registerNameShift = 		0;
-const coloredRegisterShift = 	26;
-const machineRegisterShift = 	27;
-const registerClassShift = 		28;
-
-#else // DEBUG
-
-const registerNameMask = 		0x0fffffff;
-const registerClassMask = 		0xf0000000;
-
-const registerNameShift = 		0;
-const registerClassShift = 		28;
-
-#endif // DEBUG
-
-
-inline RegisterClassKind getClass(RegisterID registerID) {return RegisterClassKind((registerID & registerClassMask) >> registerClassShift);}
-inline RegisterName getName(RegisterID registerID) {return RegisterName((registerID & registerNameMask) >> registerNameShift);}
-inline void setClass(RegisterID& registerID, RegisterClassKind classKind) {registerID = RegisterID((registerID & ~registerClassMask) | ((classKind << registerClassShift) & registerClassMask));}
-inline void setName(RegisterID& registerID, RegisterName name) {assert((name & ~registerNameMask) == 0); registerID = RegisterID((registerID & ~registerNameMask) | ((name << registerNameShift) & registerNameMask));}
-inline RegisterID buildRegisterID(RegisterName name, RegisterClassKind classKind) {return RegisterID(((classKind << registerClassShift) & registerClassMask) | ((name << registerNameShift) & registerNameMask));}
-
-#ifdef DEBUG
-
-inline bool isMachineRegister(RegisterID rid) {return (rid & machineRegisterMask) != 0;}
-inline void setMachineRegister(RegisterID& rid) {rid = RegisterID(rid | machineRegisterMask);}
-inline bool isColoredRegister(RegisterID rid) {return (rid & coloredRegisterMask) != 0;}
-inline void setColoredRegister(RegisterID& rid) {rid = RegisterID(rid | coloredRegisterMask);}
-
-#endif // DEBUG
-
-#endif // _REGISTER_TYPES_H_

mozilla/ef/Compiler/RegisterAllocator/SSATools.cpp

@@ -1,32 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "SSATools.h"
-#include "ControlGraph.h"
-#include "VirtualRegister.h"
-#include "Liveness.h"
-
-void replacePhiNodes(ControlGraph& controlGraph, VirtualRegisterManager& vrManager)
-{
-	if (!controlGraph.hasBackEdges)
-		return;
-
-	Liveness liveness(controlGraph.pool);
-	liveness.buildLivenessAnalysis(controlGraph, vrManager);
-}

mozilla/ef/Compiler/RegisterAllocator/SSATools.h

@@ -1,29 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _SSA_TOOLS_H_
-#define _SSA_TOOLS_H_
-
-#include "Fundamentals.h"
-
-class ControlGraph;
-class VirtualRegisterManager;
-
-extern void replacePhiNodes(ControlGraph& controlGraph, VirtualRegisterManager& vrManager);
-
-#endif // _SSA_TOOLS_H_

mozilla/ef/Compiler/RegisterAllocator/SparseSet.cpp

@@ -1,37 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "SparseSet.h"
-#include "BitSet.h"
-#include "Pool.h"
-
-#ifdef DEBUG_LOG
-// Print the set.
-//
-void SparseSet::printPretty(LogModuleObject log)
-{
-	Pool pool;
-	BitSet set(pool, universeSize);
-
-	for (Uint32 i = 0; i < count; i++)
-	   set.set(node[i].element);
-
-	set.printPretty(log);
-}
-#endif // DEBUG_LOG

mozilla/ef/Compiler/RegisterAllocator/SparseSet.h

@@ -1,168 +0,0 @@
-//	-*- mode:C++; tab-width:4; truncate-lines:t -*-
-//
-//           CONFIDENTIAL AND PROPRIETARY SOURCE CODE OF
-//              NETSCAPE COMMUNICATIONS CORPORATION
-// Copyright © 1996, 1997 Netscape Communications Corporation.  All Rights
-// Reserved.  Use of this Source Code is subject to the terms of the
-// applicable license agreement from Netscape Communications Corporation.
-// The copyright notice(s) in this Source Code does not indicate actual or
-// intended publication of this Source Code.
-//
-// $Id: SparseSet.h,v 1.1.2.1 1999-03-02 16:12:07 fur%netscape.com Exp $
-//
-
-#ifndef _SPARSE_SET_H_
-#define _SPARSE_SET_H_
-
-#include "Fundamentals.h"
-#include "Pool.h"
-#include "LogModule.h"
-#include "BitSet.h"
-
-class SparseSet
-{
-private:
-
-	struct Node {
-		Uint32		element;
-		Uint32		stackIndex;
-	};
-
-	Node*			node;
-	Uint32			count;
-	Uint32			universeSize;
-
-private:
-
-	// No copy constructor.
-	SparseSet(const SparseSet&);
-
-	// Check if the given set's universe is of the same size than this universe.
-	void checkUniverseCompatibility(const SparseSet& set) const {assert(set.universeSize == universeSize);}
-	// Check if pos is valid for this set's universe.
-	void checkMember(Int32 pos) const {assert(pos >=0 && Uint32(pos) < universeSize);}
-
-public:
-
-	SparseSet(Pool& pool, Uint32 universeSize) : universeSize(universeSize) {node = new(pool) Node[universeSize]; clear();}
-
-	// Clear the sparse set.
-	void clear() {count = 0;}
-	// Clear the element at index.
-	inline void clear(Uint32 index);
-	// Set the element at index.
-	inline void set(Uint32 index);
-	// Return true if the element at index is set.
-	inline bool test(Uint32 index) const;
-	// Union with the given sparse set.
-	inline void or(const SparseSet& set);
-	// Intersection with the given sparse set.
-	inline void and(const SparseSet& set);
-	// Difference with the given sparse set.
-	inline void difference(const SparseSet& set);
-	// Copy set.
-	inline SparseSet& operator = (const SparseSet& set);
-	inline SparseSet& operator = (const BitSet& set);
-	// Return true if the sparse sets are identical.
-	friend bool operator == (const SparseSet& set1, const SparseSet& set2);
-	// Return true if the sparse sets are different.
-	friend bool operator != (const SparseSet& set1, const SparseSet& set2);
-
-	// Logical operators.
-	SparseSet& operator |= (const SparseSet& set) {or(set); return *this;}
-	SparseSet& operator &= (const SparseSet& set) {and(set); return *this;}
-	SparseSet& operator -= (const SparseSet& set) {difference(set); return *this;}
-
-	// Iterator to conform with the set API.
-	typedef Int32 iterator;
-	// Return the iterator for the first element of this set.
-	iterator begin() const {return count - 1;}
-	// Return the next iterator.
-	iterator advance(iterator pos) const {return --pos;}
-	// Return true if the iterator is at the end of the set.
-	bool done(iterator pos) const {return pos < 0;}
-	// Return the element for the given iterator;
-	Uint32 get(iterator pos) const {return node[pos].element;}
-	// Return one element of this set.
-	Uint32 getOne() const {assert(count > 0); return node[0].element;}
-	// Return the size of this set.
-	Uint32 getSize() const {return count;}
-
-#ifdef DEBUG_LOG
-	// Print the set.
-	void printPretty(LogModuleObject log);
-#endif // DEBUG_LOG
-};
-
-inline void SparseSet::clear(Uint32 element)
-{
-	checkMember(element);
-	Uint32 count = this->count;
-	Node* node = this->node;
-
-	Uint32 stackIndex = node[element].stackIndex;
-
-	if ((stackIndex < count) && (node[stackIndex].element == element)) {
-		Uint32 stackTop = node[count - 1].element;
-
-		node[stackIndex].element = stackTop;
-		node[stackTop].stackIndex = stackIndex;
-		this->count = count - 1;
-	}
-}
-
-inline void SparseSet::set(Uint32 element)
-{
-	checkMember(element);
-  	Uint32 count = this->count;
-	Node* node = this->node;
-
-	Uint32 stackIndex = node[element].stackIndex;
-
-	if ((stackIndex >= count) || (node[stackIndex].element != element)) {
-		node[count].element = element;
-		node[element].stackIndex = count;
-		this->count = count + 1;
-	}
-}
-
-inline bool SparseSet::test(Uint32 element) const
-{
-	checkMember(element);
-	Node* node = this->node;
-
-	Uint32 stackIndex = node[element].stackIndex;
-	return ((stackIndex < count) && (node[stackIndex].element == element));
-}
-
-inline SparseSet& SparseSet::operator = (const SparseSet& set)
-{
-	checkUniverseCompatibility(set);
-	Uint32 sourceCount = set.getSize();
-	Node* node = this->node;
-
-	memcpy(node, set.node, sourceCount * sizeof(Node));
-
-	for (Uint32 i = 0; i < sourceCount; i++) {
-		Uint32 element = node[i].element;
-		node[element].stackIndex = i;
-	}
-
-	count = sourceCount;
-
-	return *this;
-}
-
-
-inline SparseSet& SparseSet::operator = (const BitSet& set)
-{
-	// FIX: there's room for optimization here.
-	assert(universeSize == set.getSize());
-
-	clear();
-	for (Int32 i = set.firstOne(); i != -1; i = set.nextOne(i))
-		this->set(i);
-	return *this;
-}
-
-#endif // _SPARSE_SET_H_

mozilla/ef/Compiler/RegisterAllocator/Spilling.cpp

@@ -1,270 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 NEW_LAURENTM_CODE
-#define INCLUDE_EMITTER
-#include "CpuInfo.h"
-#include "Fundamentals.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "InstructionEmitter.h"
-#include "Spilling.h"
-
-
-void Spilling::
-insertSpillCode(ControlNode** dfsList, Uint32 nNodes)
-{
-  PRUint32 nVirtualRegisters = vRegManager.count();
-  FastBitSet currentLive(vRegManager.pool, nVirtualRegisters);
-  FastBitSet usedInThisInstruction(vRegManager.pool, nVirtualRegisters);
-  RegisterFifo grNeedLoad(nVirtualRegisters);
-  RegisterFifo fpNeedLoad(nVirtualRegisters);
-
-  for (PRInt32 n = nNodes - 1; n >= 0; n--)
-	{
-	  PR_ASSERT(grNeedLoad.empty() & fpNeedLoad.empty());
-	  ControlNode& node = *dfsList[n];
-
-	  currentLive = node.liveAtEnd;
-
-	  PRUint32 nGeneralAlive = 0;
-	  PRUint32 nFloatingPointAlive = 0;
-
-	  // Get the number of registers alive at the end of this node.
-	  for (PRInt32 j = currentLive.firstOne(); j != -1; j = currentLive.nextOne(j))
-		{
-		  VirtualRegister& vReg = vRegManager.getVirtualRegister(j);
-		  if (vReg.spillInfo.willSpill)
-			{
-			  currentLive.clear(j);
-			}
-		  else
-			{
-			  switch (vReg.getClass())
-				{
-				case vrcInteger:
-				  nGeneralAlive++;
-				  break;
-				case vrcFloatingPoint:
-				case vrcFixedPoint:
-				  nFloatingPointAlive++;
-				  break;
-				default:
-				  break;
-				}
-			}
-		}
-	  
-//		  if(node.dfsNum == 8) printf("\n________Begin Node %d________\n", node.dfsNum);
-
-		InstructionList& instructions = node.getInstructions();
-	  for (InstructionList::iterator i = instructions.end(); !instructions.done(i); i = instructions.retreat(i))
-		{
-		  Instruction&       instruction = instructions.get(i);
-		  InstructionUse*    useBegin    = instruction.getInstructionUseBegin();
-		  InstructionUse*    useEnd      = instruction.getInstructionUseEnd();
-		  InstructionUse*    usePtr;
-		  InstructionDefine* defBegin    = instruction.getInstructionDefineBegin();
-		  InstructionDefine* defEnd      = instruction.getInstructionDefineEnd();
-		  InstructionDefine* defPtr;
-
-//		if(node.dfsNum == 8)  { printf("\n");
-//		instruction.printPretty(stdout);
-//		printf("\n"); }
-
-		  // Handle definitions
-		  for (defPtr = defBegin; defPtr < defEnd; defPtr++)
-			if (defPtr->isVirtualRegister())
-			  {
-				VirtualRegister& vReg = defPtr->getVirtualRegister();
-				currentLive.clear(vReg.getRegisterIndex());
-				switch (vReg.getClass())
-				  {
-				  case vrcInteger:
-					nGeneralAlive--;
-					break;
-				  case vrcFloatingPoint:
-				  case vrcFixedPoint:
-					nFloatingPointAlive--;
-					break;
-				  default:
-					break;
-				  }
-			  }
-
-		  // Check for deaths
-		  for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-			if (usePtr->isVirtualRegister())
-			  {
-				VirtualRegister& vReg = usePtr->getVirtualRegister();
-				if (!currentLive.test(vReg.getRegisterIndex()))
-				  // This is the last use of this register.
-				  {
-					currentLive.set(vReg.getRegisterIndex());
-					switch (vReg.getClass())
-					  {
-					  case vrcInteger:
-						nGeneralAlive++;
-						while (/*(nGeneralAlive > NUMBER_OF_GREGISTERS) &&*/ !grNeedLoad.empty())
-						  {
-							PRUint32 toLoad = grNeedLoad.get();
-							currentLive.clear(toLoad);
-							nGeneralAlive--;
-							
-							VirtualRegister& nReg = vRegManager.getVirtualRegister(toLoad);
-							Instruction& lastUsingInstruction = *nReg.spillInfo.lastUsingInstruction;
-							emitter.emitLoadAfter(*lastUsingInstruction.getPrimitive(), lastUsingInstruction.getLinks().prev,
-												  nReg.getAlias(), *nReg.equivalentRegister[vrcStackSlot]);
-							nReg.releaseSelf();
-						  }
-						break;
-					  case vrcFloatingPoint:
-					  case vrcFixedPoint:
-						nFloatingPointAlive++;
-						while (/*(nFloatingPointAlive > NUMBER_OF_FPREGISTERS) &&*/ !fpNeedLoad.empty())
-						  {
-							PRUint32 toLoad = fpNeedLoad.get();
-							currentLive.clear(toLoad);
-							nFloatingPointAlive--;
-							
-							VirtualRegister& nReg = vRegManager.getVirtualRegister(toLoad);
-							Instruction& lastUsingInstruction = *nReg.spillInfo.lastUsingInstruction;
-							emitter.emitLoadAfter(*lastUsingInstruction.getPrimitive(), lastUsingInstruction.getLinks().prev,
-												  nReg.getAlias(), *nReg.equivalentRegister[vrcStackSlot]);
-							nReg.releaseSelf();
-						  }
-						break;
-					  default:
-						break;
-					  }
-				  }
-			  }
-
-		  // Handle uses
-		  for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-			if (usePtr->isVirtualRegister())
-			  {
-				VirtualRegister& vReg = usePtr->getVirtualRegister();
-				PRUint32 registerIndex = vReg.getRegisterIndex();
-
-				if (vReg.spillInfo.willSpill) {
-#if defined(GENERATE_FOR_X86)
-				  if (!instruction.switchUseToSpill((usePtr - useBegin), *vReg.equivalentRegister[vrcStackSlot]))
-#endif
-					{
-					  switch (vReg.getClass())
-						{
-						case vrcInteger:
-						  if (!grNeedLoad.test(registerIndex))
-							{
-							  grNeedLoad.put(registerIndex);
-							  VirtualRegister& alias = vRegManager.newVirtualRegister(vrcInteger);
-							  if (vReg.isPreColored())
-								  alias.preColorRegister(vReg.getPreColor());
-							  /* if (vReg.hasSpecialInterference) {
-								  alias.specialInterference.sizeTo(NUMBER_OF_REGISTERS);
-								  alias.specialInterference = vReg.specialInterference;
-								  alias.hasSpecialInterference = true;
-							  } */
-							  vReg.setAlias(alias);
-							  vReg.retainSelf();
-							}
-						  break;
-						case vrcFloatingPoint:
-						case vrcFixedPoint:
-						  if (!fpNeedLoad.test(registerIndex))
-							{
-							  fpNeedLoad.put(registerIndex);
-							  VirtualRegister& alias = vRegManager.newVirtualRegister(vReg.getClass());
-							  if (vReg.isPreColored())
-								  alias.preColorRegister(vReg.getPreColor());
-							  /*if (vReg.hasSpecialInterference) {
-								  alias.specialInterference.sizeTo(NUMBER_OF_REGISTERS);
-								  alias.specialInterference = vReg.specialInterference;
-								  alias.hasSpecialInterference = true;
-							  } */
-							  vReg.setAlias(alias);
-							  vReg.retainSelf();
-							}
-						  break;
-						default:
-						  break;
-						}
-					  usePtr->getVirtualRegisterPtr().initialize(vReg.getAlias());
-					  usedInThisInstruction.set(registerIndex);
-					  vReg.spillInfo.lastUsingInstruction = &instruction;
-					}
-				  currentLive.clear(registerIndex);
-				} else { // will not spill
-				  currentLive.set(registerIndex);
-				}
-			  }
-		  
-		  // Handle definitions
-		  for (defPtr = defBegin; defPtr < defEnd; defPtr++)
-			if (defPtr->isVirtualRegister())
-			  {
-				VirtualRegister& vReg = defPtr->getVirtualRegister();
-				
-				if (vReg.spillInfo.willSpill)
-#if defined(GENERATE_FOR_X86)
-				  if (!instruction.switchDefineToSpill((defPtr - defBegin), *vReg.equivalentRegister[vrcStackSlot]))
-#endif
-					{
-					  if (usedInThisInstruction.test(vReg.getRegisterIndex()))
-						// this virtualRegister was used in this instruction and is also defined. We need to move 
-						// this virtual register to its alias first and then save it to memory.
-						{
-						  emitter.emitStoreAfter(*instruction.getPrimitive(), &instruction.getLinks(), 
-												 vReg.getAlias(), *vReg.equivalentRegister[vrcStackSlot]);
-						  defPtr->getVirtualRegisterPtr().initialize(vReg.getAlias());
-						}
-					  else
-						{
-						  emitter.emitStoreAfter(*instruction.getPrimitive(), &instruction.getLinks(), 
-												 vReg, *vReg.equivalentRegister[vrcStackSlot]);
-						}
-					}
-			  }
-		}
-	  while (!grNeedLoad.empty())
-		{
-		  PRUint32 nl = grNeedLoad.get();
-		  VirtualRegister& nlReg = vRegManager.getVirtualRegister(nl);
-		  Instruction& lastUse = *nlReg.spillInfo.lastUsingInstruction;
-		  
-		  emitter.emitLoadAfter(*lastUse.getPrimitive(), lastUse.getLinks().prev, 
-								nlReg.getAlias(), *nlReg.equivalentRegister[vrcStackSlot]);
-		  nlReg.releaseSelf();
-		}
-	  while (!fpNeedLoad.empty())
-		{
-		  PRUint32 nl = fpNeedLoad.get();
-		  VirtualRegister& nlReg = vRegManager.getVirtualRegister(nl);
-		  Instruction& lastUse = *nlReg.spillInfo.lastUsingInstruction;
-
-		  emitter.emitLoadAfter(*lastUse.getPrimitive(), lastUse.getLinks().prev, 
-								nlReg.getAlias(), *nlReg.equivalentRegister[vrcStackSlot]);
-		  nlReg.releaseSelf();
-		}
-
-//	  if(node.dfsNum == 8) printf("\n________End Node %d________\n", node.dfsNum);
-
-	}
-}
-#endif

mozilla/ef/Compiler/RegisterAllocator/Spilling.h

@@ -1,269 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _SPILLING_H_
-#define _SPILLING_H_
-
-#include "Fundamentals.h"
-#include <string.h>
-#include "RegisterAllocator.h"
-#include "RegisterAllocatorTools.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "SparseSet.h"
-
-template <class RegisterPressure>
-class Spilling
-{
-private:
-	static void insertStoreAfter(Instruction& instruction, RegisterName name);
-	static void insertLoadBefore(Instruction& instruction, RegisterName name);
-
-public:
-	static void calculateSpillCosts(RegisterAllocator& registerAllocator);
-	static void insertSpillCode(RegisterAllocator& registerAllocator);
-};
-
-struct SpillCost
-{
-	double loads;
-	double stores;
-	double copies;
-	double cost;
-	bool infinite;
-};
-
-template <class RegisterPressure>
-void Spilling<RegisterPressure>::insertSpillCode(RegisterAllocator& registerAllocator)
-{
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	Pool& pool = registerAllocator.pool;
-	SparseSet currentLive(pool, rangeCount);
-	SparseSet needLoad(pool, rangeCount);
-	SparseSet mustSpill(pool, rangeCount);
-	SparseSet& willSpill = *registerAllocator.willSpill;
-	
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	RegisterPressure::Set* liveOut = registerAllocator.liveness.liveOut;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-
-		needLoad.clear();
-		currentLive = liveOut[n];
-		mustSpill = currentLive;
-
-		InstructionList& instructions = nodes[n]->getInstructions();
-		for (InstructionList::iterator i = instructions.end(); !instructions.done(i);) {
-			Instruction& instruction = instructions.get(i);
-			i = instructions.retreat(i);
-
-			InstructionUse* useBegin = instruction.getInstructionUseBegin();
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			InstructionUse* usePtr;
-			InstructionDefine* defineBegin = instruction.getInstructionDefineBegin();
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			InstructionDefine* definePtr;
-
-			bool foundLiveDefine = false;
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister()) {
-					if (currentLive.test(name2range[definePtr->getRegisterName()])) {
-						foundLiveDefine = true;
-						break;
-					}
-				} else {
-					foundLiveDefine = true;
-					break;
-				}
-			if (defineBegin != defineEnd && !foundLiveDefine) {
-				fprintf(stderr, "!!! Removed instruction because it was only defining unused registers !!!\n");
-				instruction.remove();
-			}
-
- 			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister()) {
-					RegisterName range = name2range[definePtr->getRegisterName()];
-#ifdef DEBUG
-					if (needLoad.test(range))
-						if (!mustSpill.test(range) && registerAllocator.spillCost[range].infinite && willSpill.test(range)) {
-							fprintf(stderr, "Tried to spill a register with infinite spill cost\n");
-							abort();
-						}
-#endif // DEBUG
-					if (willSpill.test(range))
-						insertStoreAfter(instruction, range);
-
-					needLoad.clear(range);
-				}
-
-			if (instruction.getFlags() & ifCopy)
-				for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-					if (usePtr->isRegister()) {
-						RegisterName range = name2range[usePtr->getRegisterName()];
-						if (!currentLive.test(range))
-							for (SparseSet::iterator r = needLoad.begin(); !needLoad.done(r); r = needLoad.advance(r)) {
-								RegisterName load = RegisterName(needLoad.get(r));
-								if (willSpill.test(load))
-									insertLoadBefore(instruction, load);
-								mustSpill.set(load);
-							}
-						needLoad.clear();
-					}
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister())
-					currentLive.clear(name2range[definePtr->getRegisterName()]);
-
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					RegisterName range = name2range[usePtr->getRegisterName()];
-					currentLive.set(range);
-					needLoad.set(range);
-				}
-		}
-
-		for (SparseSet::iterator l = needLoad.begin(); !needLoad.done(l); l = needLoad.advance(l)) {
-			RegisterName load = RegisterName(needLoad.get(l));
-			if (willSpill.test(load))
-				insertLoadBefore(instructions.first(), load);
-		}		
-	}
-}
-
-template <class RegisterPressure>
-void Spilling<RegisterPressure>::insertLoadBefore(Instruction& /*instruction*/, RegisterName name)
-{
-	fprintf(stdout, "will insert load for range %d\n", name);
-}
-
-template <class RegisterPressure>
-void Spilling<RegisterPressure>::insertStoreAfter(Instruction& /*instruction*/, RegisterName name)
-{
-	fprintf(stdout, "will insert store for range %d\n", name);
-}
-
-template <class RegisterPressure>
-void Spilling<RegisterPressure>::calculateSpillCosts(RegisterAllocator& registerAllocator)
-{
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	Pool& pool = registerAllocator.pool;
-	SparseSet live(pool, rangeCount);
-	SparseSet needLoad(pool, rangeCount);
-	SparseSet mustSpill(pool, rangeCount);
-
-	SparseSet alreadyStored(pool, rangeCount); // FIX: should get this from previous spilling.
-
-	SpillCost* cost = new SpillCost[rangeCount];
-	memset(cost, '\0', rangeCount * sizeof(SpillCost));
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	RegisterPressure::Set* liveOut = registerAllocator.liveness.liveOut;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		ControlNode& node = *nodes[n];
-
-		double weight = doLog10(node.loopDepth);
-
-		needLoad.clear();
-		live = liveOut[n];
-		mustSpill = live;
-
-		InstructionList& instructions = nodes[n]->getInstructions();
-		for (InstructionList::iterator i = instructions.end(); !instructions.done(i); i = instructions.retreat(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useBegin = instruction.getInstructionUseBegin();
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			InstructionUse* usePtr;
-			InstructionDefine* defineBegin = instruction.getInstructionDefineBegin();
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			InstructionDefine* definePtr;
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister()) {
-					RegisterName range = name2range[definePtr->getRegisterName()];
-
-					if (needLoad.test(range))
-						if (!mustSpill.test(range))
-							cost[range].infinite = true;
-
-					if ((false /* !rematerializable(range) */ || !needLoad.test(range)) && !alreadyStored.test(range))
-						cost[range].stores += weight;
-
-					needLoad.clear(range);
-				}
-
-			if (instruction.getFlags() & ifCopy)
-				for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-					if (usePtr->isRegister())
-						if (!live.test(name2range[usePtr->getRegisterName()])) {
-							for (SparseSet::iterator l = needLoad.begin(); !needLoad.done(l); l = needLoad.advance(l)) {
-								Uint32 range = needLoad.get(l);
-								cost[range].loads += weight;
-								mustSpill.set(range);
-							}
-							needLoad.clear();
-						}
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister())
-					live.clear(name2range[definePtr->getRegisterName()]);
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					RegisterName range = name2range[usePtr->getRegisterName()];
-
-					live.set(range);
-					needLoad.set(range);
-				}
-
-			if (instruction.getFlags() & ifCopy) {
-				assert(useBegin != useEnd && useBegin[0].isRegister());
-				assert(defineBegin != defineEnd && defineBegin[0].isRegister());
-
-				RegisterName source = name2range[useBegin[0].getRegisterName()];
-				RegisterName destination = name2range[defineBegin[0].getRegisterName()];
-
-				cost[source].copies += weight;
-				cost[destination].copies += weight;
-			}			
-		}
-
-		for (SparseSet::iterator s = needLoad.begin(); !needLoad.done(s); s = needLoad.advance(s))
-			cost[needLoad.get(s)].loads += weight;
-	}
-	
-	for (Uint32 r = 0; r < rangeCount; r++) {
-		SpillCost& c = cost[r];
-		c.cost = 2 * (c.loads + c.stores) - c.copies;
-	}
-
-	registerAllocator.spillCost = cost;
-}
-
-#endif // _SPILLING_H_

mozilla/ef/Compiler/RegisterAllocator/Splits.h

@@ -1,239 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _SPLITS_H_
-#define _SPLITS_H_
-
-#include "Fundamentals.h"
-#include <string.h>
-#include "Pool.h"
-#include "ControlGraph.h"
-#include "ControlNodes.h"
-#include "Instruction.h"
-#include "RegisterAllocator.h"
-#include "RegisterAllocatorTools.h"
-
-UT_EXTERN_LOG_MODULE(RegAlloc);
-
-template <class RegisterPressure>
-struct Splits
-{
-	static void calculateSplitCosts(RegisterAllocator& registerAllocator);
-	static bool findSplit(RegisterAllocator& registerAllocator, RegisterName* color, RegisterName range);
-	static void insertSplitCode(RegisterAllocator& registerAllocator);
-};
-
-struct SplitCost
-{
-	double loads;
-	double stores;
-};
-
-template <class RegisterPressure>
-void Splits<RegisterPressure>::insertSplitCode(RegisterAllocator& /*registerAllocator*/)
-{
-	// FIX
-}
-
-template <class RegisterPressure>
-bool Splits<RegisterPressure>::findSplit(RegisterAllocator& registerAllocator, RegisterName* color, RegisterName range)
-{
-	Pool& pool = registerAllocator.pool;
-	NameLinkedList** neighborsWithColor = new(pool) NameLinkedList*[6]; // FIX
-	memset(neighborsWithColor, '\0', 6 * sizeof(NameLinkedList*));
-
-	InterferenceGraph<RegisterPressure>& iGraph = registerAllocator.iGraph;
-
-	for (InterferenceVector* vector = iGraph.getInterferenceVector(range); vector != NULL; vector = vector->next)
-		for (Int32 i = vector->count - 1; i >=0; --i) {
-			RegisterName neighbor = vector->neighbors[i];
-			RegisterName c = color[neighbor];
-
-			if (c < 6) { // FIX
-				NameLinkedList* node = new(pool) NameLinkedList();
-				node->name = neighbor;
-				node->next = neighborsWithColor[c];
-				neighborsWithColor[c] = node;
-			}
-		}
-
-	bool splitAroundName = true;
-
-	LiveRangeGraph<RegisterPressure>& lGraph = registerAllocator.lGraph;
-	RegisterName bestColor = RegisterName(6); // FIX
-	double bestCost = registerAllocator.spillCost[range].cost;
-	SplitCost* splitCost = registerAllocator.splitCost;
-
-	for (RegisterName i = RegisterName(0); i < 6; i = RegisterName(i + 1)) { // FIX
-
-		double splitAroundNameCost = 0.0;
-		bool canSplitAroundName = true;
-
-		SplitCost& sCost = splitCost[range];
-		double addedCost = 2.0 * (sCost.stores + sCost.loads);
-
-		for (NameLinkedList* node = neighborsWithColor[i]; node != NULL; node = node->next) {
-			RegisterName neighbor = node->name;
-			if (lGraph.haveEdge(neighbor, range)) {
-				canSplitAroundName = false;
-				break;
-			} else
-				splitAroundNameCost += addedCost;
-		}
-		if (canSplitAroundName && splitAroundNameCost < bestCost) {
-			bestCost = splitAroundNameCost;
-			bestColor = i;
-			splitAroundName = true;
-		}
-
-		double splitAroundColorCost = 0.0;
-		bool canSplitAroundColor = true;
-
-		for (NameLinkedList* node = neighborsWithColor[i]; node != NULL; node = node->next) {
-			RegisterName neighbor = node->name;
-			if (lGraph.haveEdge(range, neighbor)) {
-				canSplitAroundColor = false;
-				break;
-			} else {
-				SplitCost& sCost = splitCost[neighbor];
-				double addedCost = 2.0 * (sCost.stores + sCost.loads);
-				splitAroundColorCost += addedCost;
-			}
-		}
-		if (canSplitAroundColor && splitAroundColorCost < bestCost) {
-			bestCost = splitAroundColorCost;
-			bestColor = i;
-			splitAroundName = false;
-		}
- 	}
-	if (bestColor < RegisterName(6)) {
-		color[range] = bestColor;
-		registerAllocator.splitFound = true;
-
-		NameLinkedList** splitAround = registerAllocator.splitAround;
-
-		if (splitAroundName)
-			for (NameLinkedList* node = neighborsWithColor[bestColor]; node != NULL; node = node->next) {
-				NameLinkedList* newNode = new(pool) NameLinkedList();
-				newNode->name = node->name;
-				newNode->next = splitAround[range];
-				splitAround[range] = newNode;
-			}
-		else
-			for (NameLinkedList* node = neighborsWithColor[bestColor]; node != NULL; node = node->next) {
-				NameLinkedList* newNode = new(pool) NameLinkedList();
-				RegisterName neighbor = node->name;
-				newNode->name = range;
-				newNode->next = splitAround[neighbor];
-				splitAround[neighbor] = newNode;
-			}
-
-		trespass("Found a split");
-		return true;
-	}
-
-	return false;
-}
-
-template <class RegisterPressure>
-void Splits<RegisterPressure>::calculateSplitCosts(RegisterAllocator& registerAllocator)
-{
-	Pool& pool = registerAllocator.pool;
-	Uint32 rangeCount = registerAllocator.rangeCount;
-	RegisterName* name2range = registerAllocator.name2range;
-
-	SplitCost* splitCost = new(pool) SplitCost[rangeCount];
-	memset(splitCost, '\0', rangeCount * sizeof(SplitCost));
-
-	SparseSet live(pool, rangeCount);
-	RegisterPressure::Set* liveIn = registerAllocator.liveness.liveIn;
-	RegisterPressure::Set* liveOut = registerAllocator.liveness.liveOut;
-
-	ControlGraph& controlGraph = registerAllocator.controlGraph;
-	ControlNode** nodes = controlGraph.dfsList;
-	Uint32 nNodes = controlGraph.nNodes;
-
-	for (Uint32 n = 0; n < nNodes; n++) {
-		ControlNode& node = *nodes[n];
-		double weight = doLog10(node.loopDepth);
-
-		live = liveOut[n];
-
-		ControlEdge* successorsEnd = node.getSuccessorsEnd();
-		for (ControlEdge* successorsPtr = node.getSuccessorsBegin(); successorsPtr < successorsEnd; successorsPtr++) {
-			ControlNode& successor = successorsPtr->getTarget();
-
-			if (successor.getControlKind() != ckEnd) {
-				RegisterPressure::Set& successorLiveIn = liveIn[successor.dfsNum];
-
-				for (SparseSet::iterator i = live.begin(); !live.done(i); i = live.advance(i)) {
-					RegisterName name = RegisterName(live.get(i));
-					if (!successorLiveIn.test(name))
-						splitCost[name].loads += doLog10(successor.loopDepth);
-				}
-			}
-		}
-
-		InstructionList& instructions = node.getInstructions();
-		for (InstructionList::iterator i = instructions.end(); !instructions.done(i); i = instructions.retreat(i)) {
-			Instruction& instruction = instructions.get(i);
-
-			InstructionUse* useBegin = instruction.getInstructionUseBegin();
-			InstructionUse* useEnd = instruction.getInstructionUseEnd();
-			InstructionUse* usePtr;
-			InstructionDefine* defineBegin = instruction.getInstructionDefineBegin();
-			InstructionDefine* defineEnd = instruction.getInstructionDefineEnd();
-			InstructionDefine* definePtr;
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister())
-					splitCost[name2range[definePtr->getRegisterName()]].stores += weight;
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister()) {
-					RegisterName range = name2range[usePtr->getRegisterName()];
-					if (!live.test(range)) {
-						if (&instruction != &instructions.last())
-							splitCost[range].loads += weight;
-						else {
-							ControlEdge* successorsEnd = node.getSuccessorsEnd();
-							for (ControlEdge* successorsPtr = node.getSuccessorsBegin(); successorsPtr < successorsEnd; successorsPtr++)
-								splitCost[range].loads += doLog10(successorsPtr->getTarget().loopDepth);
-						}
-					}
-				}
-
-			for (definePtr = defineBegin; definePtr < defineEnd; definePtr++) 
-				if (definePtr->isRegister())
-					live.clear(name2range[definePtr->getRegisterName()]);
-
-			for (usePtr = useBegin; usePtr < useEnd; usePtr++)
-				if (usePtr->isRegister())
-					live.set(name2range[usePtr->getRegisterName()]);
-		}
-	}
-
-	NameLinkedList** splitAround = new(pool) NameLinkedList*[rangeCount];
-	memset(splitAround, '\0', rangeCount * sizeof(NameLinkedList*));
-	registerAllocator.splitAround = splitAround;
-
-	registerAllocator.splitCost = splitCost;
-	registerAllocator.splitFound = false;
-}
-
-#endif // _SPLITS_H_

mozilla/ef/Compiler/RegisterAllocator/Timer.cpp

@@ -1,186 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "HashTable.h"
-#include "Timer.h"
-#include "Pool.h"
-
-static Pool pool;											// Pool for the Timer class.
-static HashTable<TimerEntry*> timerEntries(pool);			// Timers hashtable.
-
-const nTimersInABlock = 128;								// Number of timers in a block.
-static PRTime *timers = new(pool) PRTime[nTimersInABlock];	// A block of timers.
-static Uint8 nextTimer = 0;									// nextAvailableTimer.
-
-//
-// Calibrate the call to PR_Now().
-//
-static PRTime calibrate()
-{
-	PRTime t = PR_Now();
-	PRTime& a = *new(pool) PRTime();
-
-	// Call 10 times the PR_Now() function.
-	a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); 
-	a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); a = PR_Now(); 
-	t = (PR_Now() - t + 9) / 10;
-
-	return t;
-}
-
-static PRTime adjust = calibrate();
-
-//
-// Return the named timer..
-//
-TimerEntry& Timer::getTimerEntry(const char* name)
-{
-	if (!timerEntries.exists(name)) {
-		TimerEntry* newEntry = new(pool) TimerEntry();
-		newEntry->accumulator = 0;
-		newEntry->running = false;
-		timerEntries.add(name, newEntry);
-	}
-
-	return *timerEntries[name];
-}
-
-//
-// Return a reference to a new timer.
-//
-PRTime& Timer::getNewTimer()
-{
-	if (nextTimer >= nTimersInABlock) {
-		timers = new(pool) PRTime[nTimersInABlock];
-		nextTimer = 0;
-	}
-	return timers[nextTimer++];
-}
-
-static Uint32 timersAreFrozen = 0;
-
-//
-// Start the named timer.
-//
-void Timer::start(const char* name)
-{
-	if (timersAreFrozen)
-		return;
-
-	freezeTimers();
-
-	TimerEntry& timer = getTimerEntry(name);
-	PR_ASSERT(!timer.running);
-
-	timer.accumulator = 0;
-	timer.running = true;
-	timer.done = false;
-
-	unfreezeTimers();
-}
-
-//
-// Stop the named timer.
-//
-void Timer::stop(const char* name)
-{
-	if (timersAreFrozen)
-		return;
-
-	freezeTimers();
-
-	TimerEntry& timer = getTimerEntry(name);
-	PR_ASSERT(timer.running);
-	timer.running = false;
-	timer.done = true;
-
-	unfreezeTimers();
-}
-
-//
-// Freeze all the running timers.
-//
-void Timer::freezeTimers()
-{
-	PRTime when = PR_Now() - adjust;
-
-	if (timersAreFrozen == 0) {
-		Vector<TimerEntry*> entries = timerEntries;
-		Uint32 count = entries.size();
-
-		for (Uint32 i = 0; i < count; i++) {
-			TimerEntry& entry = *entries[i];
-			if (entry.running) {
-				entry.accumulator += (when - *entry.startTime);
-			}
-		}
-	}
-	timersAreFrozen++;
-}
- 
-//
-// Unfreeze all the running timers.
-//
-void Timer::unfreezeTimers()
-{
-	PR_ASSERT(timersAreFrozen != 0);
-	timersAreFrozen--;
-
-	if (timersAreFrozen == 0) {
-		Vector<TimerEntry *> entries = timerEntries;
-		Uint32 count = entries.size();
-		
-		PRTime& newStart = getNewTimer();
-		
-		for (Uint32 i = 0; i < count; i++) {
-			TimerEntry& entry = *entries[i];
-			if (entry.running) {
-				entry.startTime = &newStart;
-			}
-		}
-		
-		newStart = PR_Now();
-	}
-}
-
-//
-// Print the named timer in the file f.
-//
-void Timer::print(FILE* f, const char *name)
-{
-	if (timersAreFrozen)
-		return;
-
-	freezeTimers();
-
-	TimerEntry& timer = getTimerEntry(name);
-  
-	PR_ASSERT(timer.done);
-	PRTime elapsed = timer.accumulator;
-
-	if (elapsed >> 32) {
-		fprintf(f, "[timer %s out of range]\n", name);
-	} else {
-		fprintf(f, "[%dus in %s]\n", Uint32(elapsed), name);
-	}
-	fflush(f);
-
-	unfreezeTimers();
-}
-

mozilla/ef/Compiler/RegisterAllocator/Timer.h

@@ -1,80 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _TIMER_H_
-#define _TIMER_H_
-
-#include "Fundamentals.h"
-#include "HashTable.h"
-#include "prtime.h"
-
-//
-// Naming convention:
-//  As the class Timer contains only static methods, the timer's name should start with the 
-//  module name. Otherwise starting 2 timers with the same name will assert.
-//
-
-#ifndef NO_TIMER
-
-struct TimerEntry
-{
-	PRTime *startTime;					// Current time when we start the timer.
-	PRTime accumulator;					// Time spent in this timer.
-	bool running;						// True if the timer is running.
-	bool done;							// True if the timer was running and was stopped. 
-};
-
-class Timer
-{
-private:
-
-	// Return the named timer.
-	static TimerEntry& getTimerEntry(const char* name);
-	// Return a reference to a new Timer.
-	static PRTime& getNewTimer();
-
-public:
-
-	// Start the timer.
-	static void start(const char* name);
-	// Stop the timer.
-	static void stop(const char* name);
-	// Freeze all the running timers.
-	static void freezeTimers();
-	// Unfreeze all the running timers.
-	static void unfreezeTimers();
-	// Print the timer.
-	static void print(FILE* f, const char *name);
-};
-
-inline void startTimer(const char* name) 		{Timer::start(name);}
-inline void stopTimer(const char* name) 		{Timer::stop(name); Timer::print(stdout, name);}
-#define START_TIMER_SAFE						Timer::freezeTimers();
-#define END_TIMER_SAFE							Timer::unfreezeTimers();
-#define TIMER_SAFE(x)							START_TIMER_SAFE x; END_TIMER_SAFE
-
-#else /* NO_TIMER */
-
-inline void startTimer(const char* /*name*/) 	{} 
-inline void stopTimer(const char* /*name*/) 	{} 
-#define START_TIMER_SAFE
-#define END_TIMER_SAFE
-#define TIMER_SAFE(x)							x;
-
-#endif /* NO_TIMER */
-#endif /* _TIMER_H_ */

mozilla/ef/Compiler/RegisterAllocator/VirtualRegister.cpp

@@ -1,40 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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.
- */
-
-#include "Fundamentals.h"
-#include "VirtualRegister.h"
-#include "Instruction.h"
-
-//------------------------------------------------------------------------------
-// VirtualRegister -
-
-#ifdef MANUAL_TEMPLATES
-template class IndexedPool<VirtualRegister>;
-#endif
-
-// Set the defining instruction.
-//
-void VirtualRegister::setDefiningInstruction(Instruction& instruction)
-{
-	if (definingInstruction != NULL) {
-		if ((instruction.getFlags() & ifCopy) && (definingInstruction->getFlags() & ifPhiNode))
-			return;
-	}
-	definingInstruction = &instruction;
-}
-

mozilla/ef/Compiler/RegisterAllocator/VirtualRegister.h

@@ -1,116 +0,0 @@
-/* -*- Mode: C++; tab-width: 4; 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 _VIRTUAL_REGISTER_H_
-#define _VIRTUAL_REGISTER_H_
-
-#include "Fundamentals.h"
-#include "IndexedPool.h"
-#include <string.h>
-
-#include "RegisterTypes.h"
-#include "RegisterClass.h"
-
-
-//------------------------------------------------------------------------------
-// VirtualRegister - 24b
-
-class Instruction;
-
-class VirtualRegister : public IndexedObject<VirtualRegister>
-{
-public:
-
-	Instruction*					definingInstruction;	// Instruction defining this VR.
-
-	// Initialize a VR of the given classKind.
-	VirtualRegister(RegisterClassKind /*classKind*/) : definingInstruction(NULL) {}
-
-	// Return the defining instruction for this VR.
-	Instruction* getDefiningInstruction() const {return definingInstruction;}
-	// Set the defining instruction.
-	void setDefiningInstruction(Instruction& insn);
-};
-
-// Return true if the VirtualRegisters are equals. The only way 2 VRs can be equal is if
-// they have the same index. If they have the same index then they are at the same
-// address in the indexed pool.
-//
-inline bool operator == (const VirtualRegister& regA, const VirtualRegister& regB) {return &regA == &regB;}
-
-//------------------------------------------------------------------------------
-// VirtualRegisterManager -
-
-struct PreColoredRegister
-{
-	RegisterID id;
-	RegisterName color;
-};
-
-class VirtualRegisterManager
-{
-private:
-
-	IndexedPool<VirtualRegister> registerPool;
-	PreColoredRegister machineRegister[6];
-
-public:
-	VirtualRegisterManager()
-		{
-			for (Uint32 i = 0; i < 6; i++)
-				machineRegister[i].id = invalidID;
-		}
-
-	// Return the VirtualRegister at the given index.
-	VirtualRegister& getVirtualRegister(RegisterName name) const {return registerPool.get(name);}
-
-	// Return a new VirtualRegister.
-	RegisterID newVirtualRegister(RegisterClassKind classKind)
-		{
-			VirtualRegister& vReg = *new(registerPool) VirtualRegister(classKind);
-			RegisterID rid;
-
-			setName(rid, RegisterName(vReg.getIndex()));
-			setClass(rid, classKind);
-			return rid;
-		}
-
-	RegisterID newMachineRegister(RegisterName name, RegisterClassKind classKind)
-		{
-			RegisterID rid = machineRegister[name].id;
-
-			if (rid == invalidID) {
-				rid = newVirtualRegister(classKind);
-				DEBUG_ONLY(setMachineRegister(rid));
-				machineRegister[name].id = rid;
-				machineRegister[name].color = name;
-			}
-
-			return rid;
-		}
-
-	PreColoredRegister* getMachineRegistersBegin() const {return (PreColoredRegister*) machineRegister;} // FIX
-	PreColoredRegister* getMachineRegistersEnd() const {return (PreColoredRegister*) &machineRegister[6];} // FIX
-
-	// Return the VirtualRegister universe size.
-	Uint32 getSize() {return registerPool.getSize();}
-
-	void setSize(Uint32 size) {registerPool.setSize(size);}
-};
-
-#endif // _VIRTUAL_REGISTER_H_

mozilla/include/jscookie.h

@@ -0,0 +1,62 @@
+/* -*- 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.
+ */
+/*
+   jscookie.h -- javascript reflection of cookies for filters.
+   Created: Frederick G.M. Roeber <roeber@netscape.com>, 12-Jul-97.
+   Adopted: Judson Valeski, 1997
+ */
+
+#ifndef _JSCOOKIE_H_
+#define _JSCOOKIE_H_
+
+typedef enum {
+    JSCF_accept,
+    JSCF_reject,
+    JSCF_ask,
+    JSCF_whatever,
+    JSCF_error
+}
+    JSCFResult;
+
+typedef struct {
+    char *path_from_header;
+    char *host_from_header;
+    char *name_from_header;
+    char *cookie_from_header;
+    time_t expires;
+    char *url;
+    Bool secure;
+    Bool domain;
+    Bool prompt; /* the preference */
+    NET_CookieBehaviorEnum preference;
+}
+    JSCFCookieData;
+
+extern JSCFResult JSCF_Execute(
+                               MWContext *mwcontext,
+                               const char *script_name,
+                               JSCFCookieData *data,
+                               Bool *data_changed
+                               );
+
+/* runs the garbage collector on the filter context. Probably a good
+   idea to call on completion of NET_GetURL or something. */
+extern void JSCF_Cleanup(void);
+
+#endif /* _JSCOOKIE_H_ */
+

mozilla/include/libevent.h

@@ -0,0 +1,755 @@
+/* -*- 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.
+ */
+
+/*
+ * Header file for event passing between the mozilla thread and
+ *   the mocha thread
+ */
+
+#ifndef libevent_h___
+#define libevent_h___
+
+#include "libmocha.h"
+#include "prtypes.h"
+#ifndef NSPR20
+#include "prevent.h"
+#else
+#include "plevent.h"
+#endif
+#include "shist.h"
+#include "fe_proto.h"
+#include "lo_ele.h"
+#include "jscookie.h"
+
+NSPR_BEGIN_EXTERN_C
+
+extern PREventQueue * mozilla_event_queue;
+
+typedef struct WindowGroup LMWindowGroup;
+
+/* 
+ * XXX - should we use the same event values as layer events?
+ */
+
+/* Event bits stored in the low end of decoder->event_mask. */
+#define EVENT_MOUSEDOWN 0x00000001
+#define EVENT_MOUSEUP   0x00000002
+#define EVENT_MOUSEOVER 0x00000004      /* user is mousing over a link */
+#define EVENT_MOUSEOUT  0x00000008      /* user is mousing out of a link */
+#define EVENT_MOUSEMOVE 0x00000010  
+#define EVENT_MOUSEDRAG 0x00000020
+#define EVENT_CLICK     0x00000040      /* input element click in progress */
+#define EVENT_DBLCLICK  0x00000080
+#define EVENT_KEYDOWN   0x00000100
+#define EVENT_KEYUP     0x00000200
+#define EVENT_KEYPRESS	0x00000400
+#define EVENT_DRAGDROP  0x00000800      /* not yet implemented */
+#define EVENT_FOCUS     0x00001000      /* input focus event in progress */
+#define EVENT_BLUR      0x00002000      /* loss of focus event in progress */
+#define EVENT_SELECT    0x00004000      /* input field selection in progress */
+#define EVENT_CHANGE    0x00008000      /* field value change in progress */
+#define EVENT_RESET     0x00010000      /* form submit in progress */
+#define EVENT_SUBMIT    0x00020000      /* form submit in progress */
+#define EVENT_SCROLL    0x00040000      /* window is being scrolled */
+#define EVENT_LOAD      0x00080000      /* layout parsed a loaded document */
+#define EVENT_UNLOAD    0x00100000
+#define EVENT_XFER_DONE	0x00200000      /* document has loaded */
+#define EVENT_ABORT     0x00400000
+#define EVENT_ERROR     0x00800000
+#define EVENT_LOCATE	0x01000000
+#define EVENT_MOVE	0x02000000
+#define EVENT_RESIZE    0x04000000
+#define EVENT_FORWARD   0x08000000
+#define EVENT_HELP	0x10000000		/* for handling of help events */
+#define EVENT_BACK      0x20000000
+
+/* #define EVENT_PRINT     0x20000000	*//* To be removed per joki */
+
+#define STATUS_STOP      0x00000001      /* stop processing */
+#define STATUS_IGNORE    0x00000002      /* no new messages */
+
+#define	EVENT_ALT_MASK	    0x00000001
+#define	EVENT_CONTROL_MASK  0x00000002
+#define	EVENT_SHIFT_MASK    0x00000004
+#define	EVENT_META_MASK	    0x00000008
+
+#define ARGTYPE_NULL	0x00000001
+#define ARGTYPE_INT32	0x00000002
+#define ARGTYPE_BOOL	0x00000004
+#define ARGTYPE_STRING	0x00000008
+
+#define SIZE_MAX	0x00000001
+#define SIZE_MIN        0X00000002
+/*
+ * When the event has been processed by the backend, there will be
+ *   a front-end callback that gets called.  If the event processed
+ *   successfully, the callback will be passed EVENT_OK.  If the
+ *   event wasn't successful (i.e. the user canceled it) the return
+ *   status will be EVENT_CANCEL.  If something radical happened
+ *   and the front-end should do nothing (i.e. mocha changed the
+ *   underlying context) the status will be EVENT_PANIC and the
+ *   front end should treat the context and element passed to the
+ *   exit routine as bogus
+ */
+typedef enum {
+    EVENT_OK,
+    EVENT_CANCEL,
+    EVENT_PANIC
+} ETEventStatus;
+
+/*
+ * When a given event gets processed we may need to tell the front
+ *   end about it so that they can update the UI / continue the 
+ *   operation.  The context, lo_element, lType and whatever
+ *   field are all supplied by the original ET_SendEvent() call.
+ *   See ET_SendEvent() for a description of the values for
+ *   the status parameter
+ */
+typedef void
+(*ETClosureFunc)(MWContext * pContext, LO_Element * lo_element, 
+                 int32 lType, void * whatever, ETEventStatus status);
+
+/*
+ * Someone has initiated a call to LM_EvaluateBuffer().  This function
+ *   gets called back with the result
+ */
+ typedef void
+(*ETEvalAckFunc)(void * data, char * result_string, size_t result_length,
+		 char * wysiwyg_url, char * base_href, Bool valid);
+
+/*
+ * This function is called back after a layer's state has been restored
+ * in a resize_relayout.
+ */
+ typedef void
+ (*ETRestoreAckFunc)(void * data, LO_BlockInitializeStruct *param);
+
+/*
+ * Typedef for a function taking a void pointer and
+ *   returning nothing
+ */
+ typedef void
+(*ETVoidPtrFunc)(void * data);
+
+/*
+ * Typedef for a function taking a void pointer and
+ *   returning a bool
+ */
+ typedef PRBool
+(*ETBoolPtrFunc)(void * data);
+
+/*
+ * Typedef for a function taking a void pointer and
+ *   returning a int32
+ */
+ typedef int32
+(*ETIntPtrFunc)(void * data);
+
+/*
+ * Typedef for a function taking a void pointer and
+ *   returning a char *
+ */
+ typedef char *
+(*ETStringPtrFunc)(void * data);
+
+/*
+ * Struct for passing JS typed variable info through C interface calls
+ */
+typedef union ArgVal {
+    int32		intArg;
+    XP_Bool		boolArg;
+    char *		stringArg;
+} ArgVal;
+
+typedef struct {
+    uint8		type;	  /* arg type as defined at top of file */
+    ArgVal		value;		
+} JSCompArg;
+
+/*
+ * Typedef for a function used to verify installed components and 
+ *   get back components utility functions.
+ */
+ typedef PRBool
+(*ETVerifyComponentFunc)(void **active_callback, void **startup_callback);
+
+/*
+ * Generic function for JS setting values with native calls.
+ */
+ typedef void
+(*ETCompPropSetterFunc)(char *name, void *value);
+
+/*
+ * Generic function for JS getting values from native calls.
+ */
+ typedef void*
+(*ETCompPropGetterFunc)(char *name);
+
+/*
+ * Generic function for JS calling native methods.
+ */
+ typedef void*
+(*ETCompMethodFunc)(int32 argc, JSCompArg *argv);
+
+/* --------------------------------------------------------------------------
+ * Common prologue for talking between the mocha thread and the mozilla 
+ *   thread
+ */
+typedef struct {
+    PREvent		event;	  /* the PREvent structure */
+    MWContext*		context;  /* context */
+    int32		doc_id;   /* doc id of context when event launched */
+    PRPackedBool	handle_eagerly;
+} ETEvent;
+
+/*
+ * Struct to send back from front end in order to get additional 
+ *   event information without having to initialize event object 
+ *   until necessary.  Yow, there is a lot of junk in here now
+ *   can we make a union out of some of these or are they always
+ *   needed?
+ */
+typedef struct {
+    ETEvent	    ce;
+    MochaDecoder  * decoder;
+    JSObject	  * object;
+    int32	    type;
+    int32           layer_id;
+    int32	    id;
+    LO_Element	  * lo_element;
+    ETClosureFunc   fnClosure;    /* event sender closure           */
+    void          * whatever;     /* anything other state           */
+    int32	    x,y;
+    int32	    docx,docy;
+    int32	    screenx,screeny;
+    uint32	    which;
+    uint32	    modifiers;
+    void	  * data;
+    uint32	    dataSize;
+    PRPackedBool    saved;
+    PRPackedBool    event_handled;
+} JSEvent;
+
+/*
+ * Tell the backend about a new event.
+ * The event is placed onto an event queue, it is not processed
+ *   immediately.  If the event is the type that can be cancelled
+ *   by the backend (i.e. a button click or a submit) the front
+ *   end must wait until the callback routine gets called before
+ *   continuing with the operation.  The ETEventStatus will be
+ *   EVENT_OK if the operation is to continue or EVENT_CANCEL
+ *   if it got cancelled.
+ * 
+ * The processing of the event may cause the document to change 
+ *   or even the whole window to close.  In those cases the callback 
+ *   will still get called in case there is any front-end cleanup 
+ *   to do but the ETEventStatus will be set to EVENT_PANIC
+ *
+ */
+
+extern JSBool
+ET_SendEvent(MWContext * pContext, LO_Element *pElement, JSEvent *pEvent, 
+             ETClosureFunc fnClosure, void * whatever);
+
+/*
+ * Tell the backend about a new document load event.  We need a 
+ *   closure so that libparse/layout knows when its safe to discard
+ *   the old document when they were waiting for onunload events to
+ *   finish processing
+ */
+extern void
+ET_SendLoadEvent(MWContext * pContext, int32 type, ETVoidPtrFunc fnClosure,
+		 NET_StreamClass *stream, int32 layer_id, Bool resize_reload);
+
+/*
+ * Tell the backend about a new image event.  Async.  No closure
+ */
+extern void
+ET_SendImageEvent(MWContext * pContext, LO_ImageStruct *image_data,
+                  LM_ImageEvent event);
+
+/*
+ * Send an interrupt event to the current context
+ * Remove all pending events for the event queue of the given context.
+ */
+extern void
+ET_InterruptContext(MWContext * pContext);
+
+extern JSBool
+ET_ContinueProcessing(MWContext * pContext);
+
+/*
+ * Tell mocha to destroy the given context's data.  The callback 
+ *   function gets called when mocha is done with all of its data
+ *   that was associated with the context
+ */
+extern void
+ET_RemoveWindowContext(MWContext * context, ETVoidPtrFunc fn, 
+                       void * data);
+
+typedef struct {
+    uint	   len, line_no;
+    char	 * scope_to;
+    void	 * data;
+    JSVersion	   version;
+    JSPrincipals * principals;
+    JSBool         want_result;
+    JSBool	   unicode;
+} ETEvalStuff;
+
+/*
+ * Evaluate the mocha code in the given buffer
+ */
+extern void
+ET_EvaluateBuffer(MWContext * context, char * buffer, uint buflen,
+		  uint line_no, char * scope_to, JSBool want_result,
+		  ETEvalAckFunc fn, void * data,
+		  JSVersion ver, struct JSPrincipals *);
+
+extern void
+ET_EvaluateScript(MWContext * context, char * buffer, ETEvalStuff * stuff,
+		  ETEvalAckFunc fn);
+
+/*
+ * Ask Mocha to reflect the given object into JavaScript
+ */
+extern void
+ET_ReflectObject(MWContext * pContext, void * lo_ele, void * tag,
+		 int32 layer_id, uint index, ReflectedObject type);
+
+void
+ET_ReflectFormElement(MWContext * pContext, void * form,
+		      LO_FormElementStruct * form_element, PA_Tag * tag);
+
+extern void
+ET_ReflectWindow(MWContext * pContext, 
+		 PA_Block onLoad, PA_Block onUnload, 
+		 PA_Block onFocus, PA_Block onBlur, PA_Block onHelp,
+		 PA_Block onMouseOver, PA_Block onMouseOut, PA_Block onDragDrop,
+		 PA_Block onMove, PA_Block onResize,
+                 PA_Block id, char *all,
+		 Bool bDelete, int newline_count);
+
+/*
+ * Tell mocha we are processing a form
+ */
+extern void
+ET_SetActiveForm(MWContext * pContext, struct lo_FormData_struct * loElement);
+
+/*
+ * Tell mocha which layer we are processing
+ */
+void
+ET_SetActiveLayer(MWContext * pContext, int32 layer_id);
+
+/*
+** Tell mocha where to send its output
+*/
+extern void
+ET_ClearDecoderStream(MWContext * context, NET_StreamClass * old_stream);
+
+extern void
+ET_SetDecoderStream(MWContext * context, NET_StreamClass *stream,
+	            URL_Struct *url_struct, JSBool free_stream_on_close);
+
+/*
+** Remember the current nesting URL in the MochaDecoder
+*/
+extern void
+ET_SetNestingUrl(MWContext * context, char * szUrl);
+
+/*
+** Remember the current language version in the MochaDecoder
+*/
+extern void
+ET_SetVersion(MWContext * context, JSVersion version);
+
+/*
+ * Tell mocha to trash the current document.  around and around...
+ */
+extern void
+ET_ReleaseDocument(MWContext * pContext, JSBool resize_reload);
+
+/*
+ * Tell mocha to trash the layer's document.
+ */
+extern void
+ET_DestroyLayer(MWContext * pContext, JSObject *layer_obj);
+
+extern void
+ET_MochaStreamComplete(MWContext * context, void * buf, int len, 
+		       char * content_type, Bool isUnicode);
+
+extern void
+ET_MochaStreamAbort(MWContext * context, int status);
+			
+/*
+ * Called when a layer's contents are changing and we want to create
+ * a new layer document.
+ */
+extern void
+ET_NewLayerDocument(MWContext *pContext, int32 layer_id);
+
+extern void
+ET_DocWriteAck(MWContext *pContext, int status);
+
+extern void
+ET_RegisterComponent(char *name, void *active_callback, void *startup_callback);
+
+extern void
+ET_RegisterComponentProp(char *comp, char *name, uint8 retType, void *setter, 
+			 void *getter);
+
+extern void
+ET_RegisterComponentMethod(char *comp, char *name, uint8 retType, void *method, 
+			   int32 argc);
+
+/* =============================================================== */
+
+/*
+ * This event can be sent to both the mozilla thread and the moacha thread
+ */
+typedef struct {
+    ETEvent			ce;
+    TimeoutCallbackFunction	fnCallback;
+    void*			pClosure;
+    uint32			ulTime;
+    void*			pTimerId;
+} MozillaEvent_Timeout;
+
+
+/* =============================================================== */
+
+/*
+ * Busy loop waiting for events to come along
+ */
+extern void PR_CALLBACK
+lm_wait_for_events(void *);
+
+/* 
+ * global mocha event queues.  It would be nice to not have these
+ *   exported this globally
+ */
+extern PREventQueue *lm_InterpretQueue;
+extern PREventQueue *lm_PriorityQueue;
+
+/*
+ * Ways to send events to the front end
+ */
+extern JSBool
+ET_PostMessageBox(MWContext* context, char* szMessage, 
+		  JSBool bConfirm);
+
+extern void
+ET_PostProgress(MWContext* context, const char* szMessage);
+
+/* --- timeout routines --- */
+
+/*
+ * Set (or clear) a timeout to go off.  The timeout will go off in the
+ *   mozilla thread so we will use the routine ET_FireTimeoutCallBack()
+ *   to get back into our thread to actually run the closure
+ */
+extern void * 
+ET_PostSetTimeout(TimeoutCallbackFunction fnCallback, 
+		  void * pClosure, uint32 ulTime, int32 doc_id);
+
+extern void
+ET_PostClearTimeout(void * stuff);
+
+extern void
+ET_FireTimeoutCallBack(void *);
+
+/* --- end of timeout routines --- */
+
+extern void
+ET_PostDestroyWindow(MWContext * context);
+
+extern void
+ET_PostManipulateForm(MWContext * context, LO_Element * pForm, int32 action);
+
+extern void
+ET_PostClearView(MWContext * context);
+
+extern void
+ET_PostFreeImageElement(MWContext * context, void * stuff);
+
+extern void
+ET_PostFreeImageContext(MWContext *context, IL_GroupContext *img_cx);
+
+extern void
+ET_PostFreeAnonImages(MWContext *context, IL_GroupContext *img_cx);
+
+extern void
+ET_PostDisplayImage(MWContext *, int, LO_ImageStruct *);
+
+extern void
+ET_PostGetUrl(MWContext *, URL_Struct * pUrl);
+
+extern char *
+ET_PostPrompt(MWContext* context, const char* szMessage, 
+			  const char * szDefault);
+
+extern MWContext *
+ET_PostNewWindow(MWContext* context, URL_Struct * pUrl, 
+                 char * szName, Chrome * pChrome, LMWindowGroup *grp);
+
+extern void
+ET_PostUpdateChrome(MWContext* context, Chrome * pChrome);
+
+extern void
+ET_PostQueryChrome(MWContext* context, Chrome * pChrome);
+
+extern void
+ET_PostGetScreenSize(MWContext* context, int32 *pX, int32 *pY);
+
+extern void
+ET_PostGetAvailScreenRect(MWContext* context, int32 *pX, int32 *pY, 
+					    int32 *pLeft, int32 *pTop);
+
+extern void
+ET_PostGetColorDepth(MWContext* context, int32 *pPixel, int32 *pPallette);
+
+extern char *
+ET_PostGetSelectedText(MWContext* context);
+
+extern void
+ET_PostScrollDocTo(MWContext* context, int loc, int32 x, int32 y);
+
+extern void
+ET_PostScrollDocBy(MWContext* context, int loc, int32 x, int32 y);
+
+extern void
+ET_PostBackCommand(MWContext* context);
+
+extern void
+ET_PostForwardCommand(MWContext* context);
+
+extern void
+ET_PostHomeCommand(MWContext* context);
+
+extern JSBool
+ET_PostFindCommand(MWContext* context, char * szName, JSBool matchCase, 
+		   JSBool searchBackward);
+extern void
+ET_PostPrintCommand(MWContext* context);
+
+extern void
+ET_PostOpenFileCommand(MWContext* context);
+
+extern void 
+ET_MakeHTMLAlert(MWContext * context, const char * szString);
+
+/* respond to events sent to the mocha thread by the mozilla thread */
+
+extern void
+ET_PostJsEventAck(MWContext* context, LO_Element * pEle, int type, 
+                  ETClosureFunc fnClosure, void * pStuff, 
+                  ETEventStatus status);
+
+
+
+extern void
+ET_PostEvalAck(MWContext * context, int doc_id, void * data, 
+	       char * str, size_t len, char * wysiwyg_url, 
+	       char * base_href, Bool valid, ETEvalAckFunc fn);
+
+extern void
+ET_PostRestoreAck(void *data, LO_BlockInitializeStruct *param, 
+                  ETRestoreAckFunc fn);
+
+/* netlib events */
+
+extern char *
+ET_net_GetCookie(MWContext* context, int32 doc_id);
+
+extern char *
+ET_net_SetCookieString(MWContext* context, char * szCookie, int32 doc_id);
+
+extern NET_StreamClass *
+ET_net_CacheConverter(FO_Present_Types format, void * obj,
+                      URL_Struct *pUrl, MWContext * pContext);
+
+extern void
+ET_net_FindURLInCache(URL_Struct * pUrl, MWContext * pContext);
+
+extern NET_StreamClass	*
+ET_net_StreamBuilder(FO_Present_Types format, URL_Struct *pUrl, 
+		     MWContext * pContext);
+
+/* layout events */
+
+extern  void
+ET_lo_ResetForm(MWContext * pContext, LO_Element * ele);
+
+void
+ET_fe_SubmitInputElement(MWContext * pContext, LO_Element * ele);
+
+/*
+ * Synchronously shove the given text down the parser's processing
+ *   queue.  If the currently loaded document is not equal to 
+ *   doc_id, this message should be ignored since it arrived too
+ *   late for the intended document
+ */
+extern int
+ET_lo_DoDocWrite(JSContext *cx, MWContext * context, NET_StreamClass * stream, 
+                 char * str, size_t len, int32 doc_id);
+
+
+extern void
+ET_il_GetImage(const char * str, MWContext * pContext, IL_GroupContext *img_cx,
+               LO_ImageStruct * image_data, NET_ReloadMethod how);
+
+extern void
+ET_il_SetGroupObserver(MWContext * pContext, IL_GroupContext *pImgCX, void *pDpyCX,
+					   JSBool bAddObserver);
+			   
+extern void
+ET_InterruptImgCX(MWContext * pContext);
+
+/*
+ * Tell layout to trash the current document.
+ */
+extern void
+ET_lo_DiscardDocument(MWContext * pContext);
+
+/*
+ * Tell layout to prepare a layer for writing.
+ */
+extern Bool
+ET_lo_PrepareLayerForWriting(MWContext *context, int32 layer_id,
+			     const char *referer);
+
+/*
+ * Return a copy of the current history element.  Caller must free
+ */
+extern History_entry * 
+ET_shist_GetCurrent(MWContext * pContext);
+
+/*
+ * Return the current security status.
+ */
+extern int 
+ET_GetSecurityStatus(MWContext * pContext);
+
+/*
+ * Make sure Mocha/Java glue is ready.  Returns the same return code as
+ * LM_InitMoja.
+ */
+extern int
+ET_InitMoja(MWContext * pContext);
+
+/*
+ * Pack up toys and go home
+ */
+extern void
+ET_FinishMocha(void);
+
+/*
+ * Used to call a stream completion function in the mozilla
+ *   thread
+ */
+extern void
+ET_moz_CallFunction(ETVoidPtrFunc fn, void * data);
+
+extern void
+ET_moz_CallFunctionAsync(ETVoidPtrFunc fn, void * data);
+
+extern PRBool
+ET_moz_CallFunctionBool(ETBoolPtrFunc fn, void * data);
+
+extern int32
+ET_moz_CallFunctionInt(ETIntPtrFunc fn, void * data);
+
+extern char *
+ET_moz_CallFunctionString(ETStringPtrFunc fn, void * data);
+
+extern void
+ET_moz_CallAsyncAndSubEventLoop(ETVoidPtrFunc fn, void *data,
+				MWContext *context);
+
+extern void
+ET_moz_Abort(MKStreamAbortFunc fn, void * data, int status);
+
+extern void
+ET_moz_SetMochaWriteStream(MochaDecoder * decoder);
+
+extern NET_StreamClass *
+ET_moz_DocCacheConverter(MWContext * context, URL_Struct * pUrl, 
+			 char * wysiwyg_url, int32 layer_id);
+
+extern PRBool
+ET_moz_VerifyComponentFunction(ETVerifyComponentFunc fn, ETBoolPtrFunc *pActive_callback, 
+			       ETVoidPtrFunc *pStartup_callback);
+
+extern void
+ET_moz_CompSetterFunction(ETCompPropSetterFunc fn, char *name, void *data);
+
+extern void *
+ET_moz_CompGetterFunction(ETCompPropGetterFunc fn, char *name);
+
+extern void *
+ET_moz_CompMethodFunction(ETCompMethodFunc fn, int32 argc, JSCompArg *argv);
+
+typedef enum { 
+    CL_Move,
+    CL_MoveX,
+    CL_MoveY,
+    CL_Offset,
+    CL_Resize,
+    CL_SetBboxWidth,
+    CL_SetBboxHeight,
+    CL_SetBboxTop,
+    CL_SetBboxLeft,
+    CL_SetBboxBottom,
+    CL_SetBboxRight,
+    CL_SetHidden,
+    CL_MoveInZ,
+    CL_SetSrc,
+    CL_SetSrcWidth,
+    CL_SetZ,
+    CL_SetBgColor,
+    CL_SetBackdrop
+} ETLayerOp;
+
+extern int
+ET_TweakLayer(MWContext * context, CL_Layer * layer, int32 x, int32 y, 
+              void *param_ptr, int32 param_val, ETLayerOp op,
+	      const char *referer, int32 doc_id);
+
+extern void
+ET_RestoreLayerState(MWContext *context, int32 layer_id,
+                     LO_BlockInitializeStruct *param, ETRestoreAckFunc fn,
+                     void *data);
+
+extern int32
+ET_npl_RefreshPluginList(MWContext* context, XP_Bool refreshInstances);
+
+extern JSCFResult 
+ET_JSCFExecute(MWContext *context, const char *script_name,
+		JSCFCookieData *data, Bool *data_changed);
+
+extern JSBool
+ET_HandlePref(JSContext * cx, uint argc, jsval * argv, jsval * rval);
+
+extern void
+ET_SetPluginWindow(MWContext * pContext, void * app);
+
+NSPR_END_EXTERN_C
+
+#endif /* libevent_h___ */

mozilla/include/libmocha.h

@@ -0,0 +1,546 @@
+/* -*- 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.
+ */
+
+/*
+ * Header file for Mocha in the Navigator (libmocha).
+ */
+
+#ifndef libmocha_h___
+#define libmocha_h___
+
+#include "ntypes.h"
+#include "il_types.h"
+#include "prtypes.h"
+#include "plhash.h"
+#include "prthread.h"
+#include "jsapi.h"
+
+/* enable JavaScript Debugger support */
+#if defined (_WIN32) || defined(XP_UNIX) || defined(powerc) || defined(__powerc) || defined(XP_OS2)
+#ifdef JAVA
+#define JSDEBUGGER 1 
+#endif
+#endif
+
+NSPR_BEGIN_EXTERN_C
+
+typedef struct JSTimeout JSTimeout;
+typedef struct JSPrincipalsList JSPrincipalsList;
+typedef struct JSNestingUrl JSNestingUrl;
+
+/*
+ * There exists one MochaDecoder per top-level MWContext that decodes Mocha,
+ * either from an HTML page or from a "mocha:[expr]" URL.
+ */
+typedef struct MochaDecoder {
+    int32           forw_count;		    /* forward reference count */
+    int32           back_count;		    /* back (up the tree) count */
+    JSContext	    *js_context;
+    MWContext       *window_context;
+    JSObject	    *window_object;
+    NET_StreamClass *stream;
+    int32           stream_owner;   /* id of layer that's loading the stream */
+    URL_Struct      *url_struct;
+    JSTimeout	    *timeouts;
+    JSTimeout       *saved_timeouts;
+    uint16          signature_ordinal;
+    PRPackedBool    replace_location;
+    PRPackedBool    resize_reload;
+    PRPackedBool    load_event_sent;
+    PRPackedBool    visited;
+    PRPackedBool    writing_input;
+    PRPackedBool    free_stream_on_close;
+    PRPackedBool    in_window_quota;
+    PRPackedBool    called_win_close;
+    PRPackedBool    principals_compromised;
+    const char      *source_url;
+    JSNestingUrl    *nesting_url;
+    uint32          error_count;
+    uint32          event_mask;
+    int32           active_layer_id;
+    uint32          active_form_id;
+    uint32	    event_bit;
+    int32	    doc_id;
+
+    /*
+     * Class prototype objects, in alphabetical order.  Must be CLEARed (set
+     * to null) in LM_PutMochaDecoder, HELD (GC roots added) in lm_NewWindow,
+     * and DROPped (removed as GC roots) in lm_DestroyWindow.
+     * XXXbe clean up, clear via bzero, using a sub-structure.
+     */
+    JSObject	    *anchor_prototype;
+    JSObject	    *bar_prototype;
+    JSObject        *document_prototype;
+    JSObject	    *event_prototype;
+    JSObject	    *event_capturer_prototype;
+    JSObject	    *event_receiver_prototype;
+    JSObject	    *form_prototype;
+    JSObject	    *image_prototype;
+    JSObject	    *input_prototype;
+    JSObject	    *layer_prototype;
+    JSObject	    *option_prototype;
+    JSObject	    *rect_prototype;
+    JSObject	    *url_prototype;
+
+    /*
+     * Window sub-objects.  These must also follow the CLEAR/HOLD/DROP
+     * protocol mentioned above.
+     */
+    JSObject	    *document;
+    JSObject	    *history;
+    JSObject	    *location;
+    JSObject	    *navigator;
+    JSObject	    *components;
+    JSObject	    *screen;
+    JSObject	    *hardware;
+    JSObject	    *crypto;
+    JSObject        *pkcs11;
+
+    /*
+     * Ad-hoc GC roots.
+     */
+    JSObject	    *event_receiver;
+    JSObject	    *opener;
+
+    JSVersion	    firstVersion;   /* First JS script tag version. */
+
+    /*
+     * Security info for all of this decoder's scripts, except those
+     * contained in layers.
+     */
+    JSPrincipals    *principals;
+    JSPrincipalsList*early_access_list;
+
+    IL_GroupContext *image_context; /* Image context for anonymous images */
+
+    /* 
+     * Table that maintains an id to JS object mapping for reflected
+     * elements. This is used during resize to reestablish the connection
+     * between layout elements and their corresponding JS object. 
+     * Form elements are special, since they can't use the same keying
+     */
+    PRHashTable     *id_to_object_map;
+} MochaDecoder;
+
+/* 
+ * Number of buckets for the id-to-object hash table.
+ */
+#define LM_ID_TO_OBJ_MAP_SIZE 20
+#define LM_FORM_ELEMENT_MAP_SIZE 10
+
+/*
+ * Types of objects reflected into Mocha
+ */
+typedef enum {
+	LM_APPLETS = 0,
+	LM_FORMS,
+	LM_LINKS,
+	LM_NAMEDANCHORS,
+	LM_EMBEDS,
+	LM_IMAGES,
+	LM_FORMELEMENTS,
+	LM_LAYERS
+} ReflectedObject;
+
+/*
+ * Generates an id-to-object mapping key from the ReflectedObject
+ * type, the containing layer id and the id of the object itself.
+ * The key is 4 bits type, 14 bits layer_id and 14 bits id.
+ */
+#define LM_GET_MAPPING_KEY(obj_type, layer_id, id)    \
+     (void *)(((((uint32)obj_type) << 28) & 0xF0000000UL) |     \
+              ((((uint32)layer_id) << 14) & 0x0FFFC000UL) |     \
+              (((uint32)id) & 0x00003FFFUL))
+
+/*
+ * Public, well-known string constants.
+ */
+extern char js_language_name[];      /* "JavaScript" */
+extern char js_content_type[];       /* "application/x-javascript" */
+
+/*
+ * Initialize and finalize Mocha-in-the-client.
+ */
+extern void LM_InitMocha(void);
+extern void LM_FinishMocha(void);
+
+/*
+ * Force mocha on in the given context, even if the user pref is set to
+ * disable mocha.
+ */
+extern void LM_ForceJSEnabled(MWContext *cx);
+
+/*
+ * Initialize and finalize Mocha-Java connection
+ */
+#define LM_MOJA_UNINITIALIZED   0
+#define LM_MOJA_OK              1
+#define LM_MOJA_JAVA_FAILED     2
+#define LM_MOJA_OUT_OF_MEMORY   3
+extern int LM_InitMoja(void);
+extern void LM_FinishMoja(void);
+extern int LM_IsMojaInitialized(void);
+
+/*
+ * Enter or leave the big mocha lock.  Any thread which wants to
+ * preserve JavaScript run-to-completion semantics must bracket
+ * JavaScript evaluation with these calls.
+ */
+typedef void
+(PR_CALLBACK *JSLockReleaseFunc)(void * data);
+
+
+extern void PR_CALLBACK LM_LockJS(MWContext *mwc);
+extern void PR_CALLBACK LM_UnlockJS(MWContext *mwc);
+extern JSBool PR_CALLBACK LM_AttemptLockJS(MWContext *mwc, 
+                                           JSLockReleaseFunc fn, void * data);
+extern JSBool PR_CALLBACK LM_ClearAttemptLockJS(MWContext *mwc, 
+                                                JSLockReleaseFunc fn, 
+                                                void * data);
+extern PRBool PR_CALLBACK
+LM_HandOffJSLock(PRThread * oldOwner, PRThread *newOwner);
+
+/*
+ * For interruption purposes we will sometimes need to know the
+ *   context who is holding the JS lock
+ */
+extern void LM_JSLockSetContext(MWContext * context);
+extern MWContext * LM_JSLockGetContext(MWContext *mwc);
+
+/*
+ * Enable/disable for Mocha-in-the-client.
+ */
+#define LM_SwitchMocha(toggle)	LM_SetMochaEnabled(toggle)
+
+extern JSBool
+LM_GetMochaEnabled(void);
+
+/*
+ * Get (create if necessary) a MochaDecoder for context, adding a reference
+ * to its window_object.  Put drops the reference, destroying window_object
+ * when the count reaches zero.  These functions should only be called in
+ * the mocha thread or while holding the JS-lock
+ */
+extern MochaDecoder *
+LM_GetMochaDecoder(MWContext *context);
+
+extern void
+LM_PutMochaDecoder(MochaDecoder *decoder);
+
+/*
+ * Get the source URL for script being loaded by document.  This URL will be
+ * the document's URL for inline script, or the SRC= URL for included script.
+ * The returned pointer is safe only within the extent of the function that
+ * calls LM_GetSourceURL().
+ */
+extern const char *
+LM_GetSourceURL(MochaDecoder *decoder);
+
+/*
+ * Set the current layer and hence the current scope for script evaluation.
+ */
+extern void
+LM_SetActiveLayer(MWContext * context, int32 layer_id);
+
+/*
+ * Get the current layer and hence the current scope for script evaluation.
+ */
+extern int32
+LM_GetActiveLayer(MWContext * context);
+
+/*
+ * Evaluate the contents of a SCRIPT tag. You can specify the JSObject
+ * to use as the base scope. Pass NULL to use the default window_object
+ */
+extern JSBool
+LM_EvaluateBuffer(MochaDecoder *decoder, void *base, size_t length,
+		  uint lineno, char * scope_to, struct JSPrincipals *principals,
+		  JSBool unicode, jsval *result);
+
+/*
+ * Evaluate an expression entity in an HTML attribute (WIDTH="&{height/2};").
+ * Returns null on error, otherwise a pointer to the malloc'd string result.
+ * The caller is responsible for freeing the string result.
+ */
+extern char *
+LM_EvaluateAttribute(MWContext *context, char *expr, uint lineno);
+
+/*
+ * Remove any MochaDecoder window_context pointer to an MWContext that's
+ * being destroyed.
+ */
+extern void
+LM_RemoveWindowContext(MWContext *context, History_entry * he);
+
+extern void
+LM_DropSavedWindow(MWContext *context, void *window);
+
+/*
+ * Set and clear the HTML stream and URL for the MochaDecoder
+ *   associated with the given context
+ */
+extern JSBool
+LM_SetDecoderStream(MWContext * context, NET_StreamClass *stream,
+		            URL_Struct *url_struct, JSBool free_stream_on_close);
+
+/*
+ * Start caching HTML or plain text generated by document.write() where the
+ * script is running on mc, the document is being generated into decoder's
+ * window, and url_struct tells about the generator.
+ */
+extern NET_StreamClass *
+LM_WysiwygCacheConverter(MWContext *context, URL_Struct *url_struct,
+			 const char * wysiwyg_url, const char * base_href);
+
+/*
+ * Skip over the "wysiwyg://docid/" in url_string and return a pointer to the
+ * real URL hidden after the prefix.  If url_string is not of "wysiwyg:" type,
+ * just return url_string.  Never returns null.
+ */
+extern const char *
+LM_StripWysiwygURLPrefix(const char *url_string);
+
+/*
+ * This function works only on "wysiwyg:" type URLs -- don't call it unless
+ * you know that NET_URL_Type(url_string) is WYSIWYG_TYPE_URL.  It'll return
+ * null if url_string seems too short, or if it can't find the third slash.
+ */
+extern const char *
+LM_SkipWysiwygURLPrefix(const char *url_string);
+
+/*
+ * Return a pointer to a malloc'd string of the form "<BASE HREF=...>" where
+ * the "..." URL is the directory of cx's origin URL.  Such a base URL is the
+ * default base for relative URLs in generated HTML.
+ */
+extern char *
+LM_GetBaseHrefTag(JSContext *cx, JSPrincipals *principals);
+
+/*
+ * XXX Make these public LO_... typedefs in lo_ele.h/ntypes.h?
+ */
+struct lo_FormData_struct;
+struct lo_NameList_struct;
+
+extern struct lo_FormData_struct *
+LO_GetFormDataByID(MWContext *context, int32 layer_id, intn form_id);
+
+extern uint
+LO_EnumerateForms(MWContext *context, int32 layer_id);
+
+extern struct LO_ImageStruct_struct *
+LO_GetImageByIndex(MWContext *context, int32 layer_id, intn image_id);
+
+extern uint
+LO_EnumerateImages(MWContext *context, int32 layer_id);
+
+/*
+ * Reflect display layers into Mocha.
+ */
+extern JSObject *
+LM_ReflectLayer(MWContext *context, int32 layer_id, int32 parent_layer_id,
+                PA_Tag *tag);
+
+extern LO_FormElementStruct *
+LO_GetFormElementByIndex(struct lo_FormData_struct *form_data, int32 index);
+
+extern uint
+LO_EnumerateFormElements(MWContext *context,
+			 struct lo_FormData_struct *form_data);
+
+/*
+ * Layout helper function to find a named anchor by its index in the
+ * document.anchors[] array.
+ */
+extern struct lo_NameList_struct *
+LO_GetNamedAnchorByIndex(MWContext *context, int32 layer_id, uint index);
+
+extern uint
+LO_EnumerateNamedAnchors(MWContext *context, int32 layer_id);
+
+/*
+ * Layout Mocha helper function to find an HREF Anchor by its index in the
+ * document.links[] array.
+ */
+extern LO_AnchorData *
+LO_GetLinkByIndex(MWContext *context, int32 layer_id, uint index);
+
+extern uint
+LO_EnumerateLinks(MWContext *context, int32 layer_id);
+
+extern LO_JavaAppStruct *
+LO_GetAppletByIndex(MWContext *context, int32 layer_id, uint index);
+
+extern uint
+LO_EnumerateApplets(MWContext *context, int32 layer_id);
+
+extern LO_EmbedStruct *
+LO_GetEmbedByIndex(MWContext *context, int32 layer_id, uint index);
+
+extern uint
+LO_EnumerateEmbeds(MWContext *context, int32 layer_id);
+
+/*
+ * Get and set a color attribute in the current document state.
+ */
+extern void
+LO_GetDocumentColor(MWContext *context, int type, LO_Color *color);
+
+extern void
+LO_SetDocumentColor(MWContext *context, int type, LO_Color *color);
+
+/*
+ * Layout function to reallocate the lo_FormElementOptionData array pointed at
+ * by lo_FormElementSelectData's options member to include space for the number
+ * of options given by selectData->option_cnt.
+ */
+extern XP_Bool
+LO_ResizeSelectOptions(lo_FormElementSelectData *selectData);
+
+/*
+ * Discard the current document and all its subsidiary objects.
+ */
+extern void
+LM_ReleaseDocument(MWContext *context, JSBool resize_reload);
+
+/*
+ * Search if a the event is being captured in the frame hierarchy.
+ */
+extern XP_Bool
+LM_EventCaptureCheck(MWContext *context, uint32 current_event);
+
+/*
+ * Scroll a window to the given point.
+ */
+extern void LM_SendOnScroll(MWContext *context, int32 x, int32 y);
+
+/*
+ * Display a help topic.
+ */
+extern void LM_SendOnHelp(MWContext *context);
+
+/*
+ * Send a load or abort event for an image to a callback.
+ */
+typedef enum LM_ImageEvent {
+    LM_IMGUNBLOCK   = 0,
+    LM_IMGLOAD      = 1,
+    LM_IMGABORT     = 2,
+    LM_IMGERROR     = 3,
+    LM_LASTEVENT    = 3
+} LM_ImageEvent;
+
+extern void
+LM_ProcessImageEvent(MWContext *context, LO_ImageStruct *image_data,
+		  LM_ImageEvent event);
+
+/* This should be called when a named anchor is located. */
+extern JSBool
+LM_SendOnLocate(MWContext *context, struct lo_NameList_struct *name_rec);
+
+extern JSObject *
+LM_ReflectApplet(MWContext *context, LO_JavaAppStruct *applet_data,
+                 PA_Tag * tag, int32 layer_id, uint index);
+
+extern JSObject *
+LM_ReflectEmbed(MWContext *context, LO_EmbedStruct *lo_embed,
+                PA_Tag * tag, int32 layer_id, uint index);
+
+struct lo_FormData_struct;
+struct lo_NameList_struct;
+
+extern JSObject *
+LM_ReflectForm(MWContext *context, struct lo_FormData_struct *form_data, 
+	       PA_Tag * tag, int32 layer_id, uint index);
+
+extern JSObject *
+LM_ReflectFormElement(MWContext *context, int32 layer_id, int32 form_id, 
+                      int32 element_id, PA_Tag * tag);
+
+extern JSObject *
+LM_ReflectLink(MWContext *context, LO_AnchorData *anchor_data, PA_Tag * tag, 
+               int32 layer_id, uint index);
+
+extern JSObject *
+LM_ReflectNamedAnchor(MWContext *context, struct lo_NameList_struct *name_rec, 
+                      PA_Tag * tag, int32 layer_id, uint index);
+
+extern JSObject *
+LM_ReflectImage(MWContext *context, LO_ImageStruct *image_data, 
+			    PA_Tag * tag, int32 layer_id, uint index);
+
+extern JSBool
+LM_CanDoJS(MWContext *context);
+
+extern JSBool
+LM_IsActive(MWContext *context);
+
+/*
+ * Security.
+ */
+
+extern JSPrincipals *
+LM_NewJSPrincipals(URL_Struct *archive, char *name, const char *codebase);
+
+extern char *
+LM_ExtractFromPrincipalsArchive(JSPrincipals *principals, char *name, 
+                                uint *length);
+
+extern JSBool
+LM_SetUntransformedSource(JSPrincipals *principals, char *original, 
+                          char *transformed);
+
+extern JSPrincipals * PR_CALLBACK
+LM_GetJSPrincipalsFromJavaCaller(JSContext *cx, int callerDepth);
+
+/*
+ * LM_RegisterPrincipals will verify and register a set of principals 
+ * in the decoder, modifying decoder->principals in the process. It
+ * returns the modified decoder.
+ * 
+ * The "name" parameter may be NULL if "principals" was created with a name.
+ */
+
+extern JSPrincipals *
+LM_RegisterPrincipals(MochaDecoder *decoder, JSPrincipals *principals, 
+                      char *name, char *src);
+/*
+ * JavaScript Debugger support
+ */
+#ifdef JSDEBUGGER 
+
+extern NET_StreamClass*
+LM_StreamBuilder( int         format_out,
+                  void        *data_obj,
+                  URL_Struct  *URL_s,
+                  MWContext   *mwcontext );
+
+extern JSBool
+LM_GetJSDebugActive(void);
+
+extern void
+LM_JamSourceIntoJSDebug( const char *filename,
+                         const char *str, 
+                         int32      len,
+                         MWContext  *mwcontext );
+
+#endif
+
+NSPR_END_EXTERN_C
+
+#endif /* libmocha_h___ */

mozilla/lib/libmocha/Makefile

@@ -0,0 +1,95 @@
+#!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		= ../..
+
+MODULE		= mocha
+LIBRARY_NAME	= mocha
+
+REQUIRES	= lay net parse img js style layer applet dbm nspr security \
+		  htmldlgs util jtools pref java libreg softupdt jsdebug
+
+CSRCS		= et_mocha.c \
+		  et_moz.c \
+		  lm_applt.c \
+		  lm_bars.c \
+		  lm_cmpnt.c \
+		  lm_doc.c \
+		  lm_embed.c \
+		  lm_event.c \
+		  lm_form.c \
+		  lm_hardw.c \
+		  lm_hist.c \
+		  lm_href.c \
+		  lm_img.c \
+		  lm_init.c \
+		  lm_input.c \
+		  lm_nav.c \
+		  lm_plgin.c \
+		  lm_screen.c \
+		  lm_supdt.c \
+		  lm_taint.c \
+		  lm_trggr.c \
+		  lm_url.c \
+		  lm_win.c \
+		  lm_layer.c \
+		  lm_wngrp.c \
+		  $(NULL)
+
+
+ifdef MOZ_JAVA
+CSRCS +=             \
+		  lm_jsd.c \
+		  $(NULL)
+endif
+
+ifndef NO_SECURITY
+CSRCS		+= lm_crypt.c lm_pk11.c
+endif
+
+include $(DEPTH)/config/rules.mk
+
+DEFINES		+= -DDLL_SUFFIX=\"$(DLL_SUFFIX)\"
+
+ifdef JS_THREADSAFE
+DEFINES += -DJS_THREADSAFE
+endif
+
+EMBED_CFLAGS	= $(CFLAGS) -I$(DEPTH)/lib/plugin
+TAINT_CFLAGS	= $(CFLAGS) -I$(DEPTH)/lib/libjar -I$(DEPTH)/sun-java/netscape/security/_jri
+
+ifneq ($(OS_ARCH),OS2)
+$(OBJDIR)/lm_embed.o: lm_embed.c
+	@$(MAKE_OBJDIR)
+	$(CC) -o $@ -c $(EMBED_CFLAGS) $<
+
+$(OBJDIR)/lm_taint.o: lm_taint.c
+	@$(MAKE_OBJDIR)
+	$(CC) -o $@ -c $(TAINT_CFLAGS) $<
+
+else
+$(OBJDIR)/lm_embed.o: lm_embed.c
+	@$(MAKE_OBJDIR)
+	$(CC) -Fo$@ -c $(EMBED_CFLAGS) $<
+
+$(OBJDIR)/lm_taint.o: lm_taint.c
+	@$(MAKE_OBJDIR)
+	$(CC) -Fo$@ -c $(TAINT_CFLAGS) $<
+
+endif

mozilla/lib/libmocha/lm.h

@@ -0,0 +1,880 @@
+/* -*- 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 lm_h___
+#define lm_h___
+/*
+ * JS in the Navigator library-private interface.
+ */
+#include "xp.h"         /* for uint and PA_Block */
+#include "prlong.h"	/* for int64 time type used below */
+#include "libevent.h"	/* until its a stand-alone */
+#include "libmocha.h"
+
+/*
+ * Shared string constants for common property names.
+ */
+extern char lm_argc_err_str[];          /* "incorrect number of arguments" */
+
+extern char lm_unknown_origin_str[];    /* "[unknown origin]" */
+
+extern char lm_onLoad_str[];            /* "onLoad" */
+extern char lm_onUnload_str[];          /* "onUnload" */
+extern char lm_onAbort_str[];           /* "onAbort" */
+extern char lm_onError_str[];           /* "onError" */
+extern char lm_onScroll_str[];          /* "onScroll" */
+extern char lm_onFocus_str[];           /* "onFocus" */
+extern char lm_onBlur_str[];            /* "onBlur" */
+extern char lm_onSelect_str[];          /* "onSelect" */
+extern char lm_onChange_str[];          /* "onChange" */
+extern char lm_onReset_str[];           /* "onReset" */
+extern char lm_onSubmit_str[];          /* "onSubmit" */
+extern char lm_onClick_str[];           /* "onClick" */
+extern char lm_onMouseDown_str[];       /* "onMouseDown" */
+extern char lm_onMouseOver_str[];       /* "onMouseOver" */
+extern char lm_onMouseOut_str[];        /* "onMouseOut" */
+extern char lm_onMouseUp_str[];         /* "onMouseUp" */
+extern char lm_onLocate_str[];          /* "onLocate" */
+extern char lm_onHelp_str[];            /* "onHelp" [EA] */
+
+extern char lm_focus_str[];             /* "focus" */
+extern char lm_blur_str[];              /* "blur" */
+extern char lm_select_str[];            /* "select" */
+extern char lm_click_str[];             /* "click" */
+extern char lm_scroll_str[];            /* "scroll" */
+extern char lm_enable_str[];            /* "enable" */
+extern char lm_disable_str[];           /* "disable" */
+
+extern char lm_toString_str[];          /* "toString" */
+extern char lm_length_str[];            /* "length" */
+extern char lm_document_str[];          /* "document" */
+extern char lm_forms_str[];             /* "forms" */
+extern char lm_links_str[];             /* "links" */
+extern char lm_anchors_str[];           /* "anchors" */
+extern char lm_applets_str[];           /* "applets" */
+extern char lm_embeds_str[];            /* "embeds" */
+extern char lm_plugins_str[];           /* "plugins" */
+extern char lm_images_str[];            /* "images" */
+extern char lm_layers_str[];            /* "layers" */
+extern char lm_location_str[];          /* "location" */
+extern char lm_navigator_str[];         /* "navigator" */
+extern char lm_netcaster_str[];         /* "netcaster" */
+extern char lm_components_str[];        /* "components" */
+
+extern char lm_parentLayer_str[];       /* "parentLayer" */
+extern char lm_opener_str[];            /* "opener" */
+extern char lm_closed_str[];            /* "closed" */
+extern char lm_assign_str[];            /* "assign" */
+extern char lm_reload_str[];            /* "reload" */
+extern char lm_replace_str[];           /* "replace" */
+extern char lm_event_str[];             /* "event" */
+extern char lm_methodPrefix_str[];      /* "#method" */
+extern char lm_methodArgc_str[];      /* "#method" */
+extern char lm_methodArgv_str[];      /* "#method" */
+extern char lm_getPrefix_str[];         /* "#get_" */
+extern char lm_setPrefix_str[];         /* "#set_" */
+extern char lm_typePrefix_str[];        /* "#type_" */
+extern const char *lm_event_argv[];     /* {lm_event_str} */
+
+extern PRThread		    *lm_InterpretThread;
+extern PRThread		    *mozilla_thread;
+extern PRThread		    *lm_js_lock_previous_owner;
+
+extern JSContext *lm_writing_context;
+
+/*
+ * Timeout structure threaded on MochaDecoder.timeouts for cleanup.
+ */
+struct JSTimeout {
+    int32               ref_count;      /* reference count to shared usage */
+    char                *expr;          /* the JS expression to evaluate */
+    JSObject            *funobj;        /* or function to call, if !expr */
+    jsval               *argv;          /* function actual arguments */
+    void                *toid;          /* Identifier, used internally only */
+    uint32              public_id;      /* Returned as value of setTimeout() */
+    uint16              argc;           /* and argument count */
+    uint16              spare;          /* alignment padding */
+    int32		doc_id;       	/* document this is for */
+    int32               interval;       /* Non-zero if repetitive timeout */
+    int64               when;           /* nominal time to run this timeout */
+    JSVersion		version;	/* Version of JavaScript to execute */
+    JSPrincipals        *principals;    /* principals with which to execute */
+    char                *filename;      /* filename of setTimeout call */
+    uint32              lineno;         /* line number of setTimeout call */
+    JSTimeout           *next;          /* next timeout in list */
+};
+
+extern void             lm_ClearWindowTimeouts(MochaDecoder *decoder);
+
+struct JSNestingUrl {
+    JSNestingUrl 	*next;
+    char                *str;
+};
+
+/*
+ * Event queue stack madness to handle doc.write("<script>doc.write...").
+ */
+typedef struct QueueStackElement {
+    PREventQueue		* queue;
+    MWContext		        * context;
+    int32			  doc_id;
+    struct QueueStackElement	* up;
+    struct QueueStackElement	* down;
+    PRPackedBool		  done;
+    PRPackedBool		  discarding;
+    PRPackedBool		  inherit_parent;
+    void                        * retval;
+} QueueStackElement;
+
+extern void
+et_SubEventLoop(QueueStackElement * qse);
+
+/*
+ * Stack size per window context, plus one for the navigator.
+ */
+#define LM_STACK_SIZE   8192
+
+extern JSRuntime        *lm_runtime;
+extern JSClass		lm_window_class;
+extern JSClass		lm_layer_class;
+extern JSClass		lm_document_class;
+extern JSClass		lm_event_class;
+
+extern JSBool           lm_SaveParamString(JSContext *cx, PA_Block *bp,
+                                           const char *str);
+extern MochaDecoder     *lm_NewWindow(MWContext *context);
+extern void             lm_DestroyWindow(MochaDecoder *decoder);
+
+/*
+ * Hold and drop the reference count for tree back-edges that go from object
+ * private data to the containing decoder.  These refs do not keep the object
+ * tree under decoder alive from the GC, but they do keep decoder from being
+ * destroyed and some out of order finalizer tripping over its freed memory.
+ */
+#ifdef DEBUG
+extern MochaDecoder     *lm_HoldBackCount(MochaDecoder *decoder);
+extern void             lm_DropBackCount(MochaDecoder *decoder);
+
+#define HOLD_BACK_COUNT(decoder) lm_HoldBackCount(decoder)
+#define DROP_BACK_COUNT(decoder) lm_DropBackCount(decoder)
+#else
+#define HOLD_BACK_COUNT(decoder)                                             \
+    (((decoder) ? (decoder)->back_count++ : 0), (decoder))
+#define DROP_BACK_COUNT(decoder)                                             \
+    (((decoder) && --(decoder)->back_count <= 0 && !(decoder)->forw_count)   \
+     ? lm_DestroyWindow(decoder)					     \
+     : (void)0)
+#endif
+
+extern JSBool           lm_InitWindowContent(MochaDecoder *decoder);
+extern JSBool           lm_DefineWindowProps(JSContext *cx,
+                                             MochaDecoder *decoder);
+extern JSBool           lm_ResolveWindowProps(JSContext *cx,
+                                              MochaDecoder *decoder,
+                                              JSObject *obj,
+                                              jsval id);
+extern void             lm_FreeWindowContent(MochaDecoder *decoder,
+					     JSBool fromDiscard);
+extern JSBool           lm_SetInputStream(JSContext *cx,
+					  MochaDecoder *decoder,
+					  NET_StreamClass *stream,
+					  URL_Struct *url_struct,
+                                          JSBool free_stream_on_close);
+extern JSObject         *lm_DefineDocument(MochaDecoder *decoder,
+                                           int32 layer_id);
+extern JSObject         *lm_DefineHistory(MochaDecoder *decoder);
+extern JSObject         *lm_DefineLocation(MochaDecoder *decoder);
+extern JSObject         *lm_DefineNavigator(MochaDecoder *decoder);
+extern JSObject         *lm_DefineComponents(MochaDecoder *decoder);
+extern JSObject         *lm_DefineCrypto(MochaDecoder *decoder);
+extern JSObject         *lm_DefineScreen(MochaDecoder *decoder,
+                                         JSObject *parent);
+extern JSObject         *lm_DefineHardware(MochaDecoder *decoder,
+                                         JSObject *parent);
+extern JSBool           lm_DefinePluginClasses(MochaDecoder *decoder);
+extern JSBool           lm_DefineBarClasses(MochaDecoder *decoder);
+extern JSBool           lm_ResolveBar(JSContext *cx, MochaDecoder *decoder,
+				      const char *name);
+extern JSBool           lm_DefineTriggers(void);
+extern JSObject         *lm_NewPluginList(JSContext *cx, JSObject *parent_obj);
+extern JSObject         *lm_NewMIMETypeList(JSContext *cx);
+extern JSObject         *lm_GetDocumentFromLayerId(MochaDecoder *decoder,
+                                                   int32 layer_id);
+extern JSObject         *lm_DefinePkcs11(MochaDecoder *decoder);
+/*
+ * Get (create if needed) document's form, link, and named anchor arrays.
+ */
+extern JSObject         *lm_GetFormArray(MochaDecoder *decoder,
+                                         JSObject *document);
+extern JSObject         *lm_GetLinkArray(MochaDecoder *decoder,
+                                         JSObject *document);
+extern JSObject         *lm_GetNameArray(MochaDecoder *decoder,
+                                         JSObject *document);
+extern JSObject         *lm_GetAppletArray(MochaDecoder *decoder,
+                                           JSObject *document);
+extern JSObject         *lm_GetEmbedArray(MochaDecoder *decoder,
+                                          JSObject *document);
+extern JSObject         *lm_GetImageArray(MochaDecoder *decoder,
+                                          JSObject *document);
+extern JSObject         *lm_GetDocumentLayerArray(MochaDecoder *decoder,
+                                                  JSObject *document);
+
+
+/*
+ * dummy object for applets and embeds that can't be reflected
+ */
+extern JSObject *lm_DummyObject;
+extern void lm_InitDummyObject(JSContext *cx);
+
+/* bit vector for handlers */
+typedef enum  {
+	HANDLER_ONCLICK = 1 << 0,
+	HANDLER_ONFOCUS = 1 << 1,
+	HANDLER_ONBLUR = 1 << 2,
+	HANDLER_ONCHANGE = 1 << 3,
+	HANDLER_ONSELECT = 1 << 4,
+	HANDLER_ONSCROLL = 1 << 5,
+	HANDLER_ONMOUSEDOWN = 1 << 6,
+	HANDLER_ONMOUSEUP = 1 << 7,
+	HANDLER_ONKEYDOWN = 1 << 8,
+	HANDLER_ONKEYUP = 1 << 9,
+	HANDLER_ONKEYPRESS = 1 << 10,
+	HANDLER_ONDBLCLICK = 1 << 11
+} JSHandlersBitVector;
+
+/*
+ * Base class of all JS input private object data structures.
+ */
+typedef struct JSInputBase {
+    MochaDecoder        *decoder;       /* this window's JS decoder */
+    int32               type;           /* layout form element type */
+    JSHandlersBitVector	handlers;	/* bit vector for handlers */
+} JSInputBase;
+
+/*
+ * Base class of event-handling elements like layers and documents.
+ */
+typedef struct JSInputHandler {
+    JSInputBase     base;           /* decoder and type */
+    JSObject        *object;        /* this input handler's JS object */
+    uint32          event_mask;     /* mask of events in progress */
+} JSInputHandler;
+
+/*
+ * Base class of input event-capturing elements like layers and documents.
+ */
+typedef struct JSEventReceiver {
+    JSObject        *object;        /* this event receiver's JS object */
+    uint32          event_mask;     /* mask of events in progress */
+} JSEventReceiver;
+
+/*
+ * Base class of input event-handling elements like anchors and form inputs.
+ */
+typedef struct JSEventCapturer {
+    JSEventReceiver base;	    /* this event capturer's receiver base */
+    uint32          event_bit;	    /* mask of events being captured */
+} JSEventCapturer;
+
+#define base_decoder    base.decoder
+#define base_type       base.type
+#define base_handlers	base.handlers
+
+/*
+ * JS URL object.
+ *
+ * Location is a special URL: when you set one of its properties, your client
+ * window goes to the newly formed address.
+ */
+typedef struct JSURL {
+    JSInputHandler  handler;
+    int32           layer_id;
+    uint32          index;
+    JSString        *href;
+    JSString        *target;
+    JSString        *text;
+} JSURL;
+
+/* JS Document Object
+ * Documents exist per-window and per-layer
+ */
+typedef struct JSDocument {
+    JSEventCapturer	capturer;
+    MochaDecoder        *decoder;
+    JSObject            *object;
+    int32               layer_id;     /* The containing layer's id */
+    JSObject	        *forms;
+    JSObject	        *links;
+    JSObject	        *anchors;
+    JSObject	        *applets;
+    JSObject            *embeds;
+    JSObject	        *images;
+    JSObject	        *layers;
+} JSDocument;
+
+#define URL_NOT_INDEXED ((uint32)-1)
+
+#define url_decoder     handler.base_decoder
+#define url_type        handler.base_type
+#define url_object      handler.object
+#define url_event_mask  handler.event_mask
+
+extern JSURL *
+lm_NewURL(JSContext *cx, MochaDecoder *decoder,
+          LO_AnchorData *anchor_data, JSObject *document);
+
+extern void
+lm_ReplaceURL(MWContext *context, URL_Struct *url_struct);
+
+extern JSBool
+lm_GetURL(JSContext *cx, MochaDecoder *decoder, URL_Struct *url_struct);
+
+extern const char *
+lm_CheckURL(JSContext *cx, const char *url_string, JSBool checkFile);
+
+extern JSBool
+lm_CheckWindowName(JSContext *cx, const char *window_name);
+
+extern PRHashTable *
+lm_GetIdToObjectMap(MochaDecoder *decoder);
+
+extern JSBool PR_CALLBACK
+lm_BranchCallback(JSContext *cx, JSScript *script);
+
+extern void PR_CALLBACK
+lm_ErrorReporter(JSContext *cx, const char *message,
+                 JSErrorReport *report);
+
+extern JSObject *
+lm_GetFormObjectByID(MWContext *context, int32 layer_id, uint form_id);
+
+extern LO_FormElementStruct *
+lm_GetFormElementByIndex(JSContext * cx, JSObject *form_obj, int32 index);
+
+extern JSObject *
+lm_GetFormElementFromMapping(JSContext *cx, JSObject *form_obj, uint32 index);
+
+extern JSBool
+lm_AddFormElement(JSContext *cx, JSObject *form, JSObject *obj,
+                  char *name, uint index);
+
+extern JSBool
+lm_ReflectRadioButtonArray(MWContext *context, int32 layer_id, intn form_id,
+                           const char *name, PA_Tag * tag);
+
+extern JSBool
+lm_SendEvent(MWContext *context, JSObject *obj, JSEvent *event,
+             jsval *result);
+
+extern JSBool
+lm_HandleEvent(JSContext *cx, JSObject *obj, JSObject *eventObj,
+	       jsval funval, jsval *result);
+
+extern JSBool
+lm_FindEventHandler(MWContext *context, JSObject *obj, JSObject *eventObj,
+		     jsval funval, jsval *result);
+
+extern JSObject *
+lm_NewEventObject(MochaDecoder * decoder, JSEvent * pEvent);
+
+typedef struct JSEventNames {
+    const char *lowerName;
+    const char *mixedName;
+} JSEventNames;
+
+extern const char *
+lm_EventName(uint32 event_bit);
+
+extern JSEventNames *
+lm_GetEventNames(uint32 event_bit);
+
+/*
+ * Compile the given attribute and attach it to the JSObject
+ */
+extern JSBool
+lm_CompileEventHandler(MochaDecoder * decoder, PA_Block id, PA_Block data, 
+		       int newline_(cx, sizeof *option);
+		if (!option)
+		    goto bad;
+
+		option_obj =
+		    JS_NewObject(cx, &lm_option_class,
+				 input->input_decoder->option_prototype, obj);
+
+		if (!option_obj || !JS_SetPrivate(cx, option_obj, option)) {
+		    JS_free(cx, option);
+		    goto bad;
+		}
+		option->decoder = HOLD_BACK_COUNT(input->input_decoder);
+		option->object = option_obj;
+		option->index = (uint32)slot;
+		option->indexInForm = form_element->element_index;
+		option->data = NULL;
+		*vp = OBJECT_TO_JSVAL(option_obj);
+		goto good;
+	    }
+	}
+	break;
+
+      case FORM_TYPE_RADIO:
+      case FORM_TYPE_CHECKBOX:
+	{
+	    lo_FormElementToggleData *toggle;
+
+	    toggle = &form_element->element_data->ele_toggle;
+	    switch (input_slot) {
+	      case INPUT_NAME:
+		str = lm_LocalEncodingToStr(context, 
+					    (char *)toggle->name);
+		break;
+	      case INPUT_VALUE:
+		str = lm_LocalEncodingToStr(context, 
+					    (char *)toggle->value);
+		break;
+	      case INPUT_STATUS:
+		*vp = BOOLEAN_TO_JSVAL(toggle->toggled);
+		goto good;
+	      case INPUT_DEFAULT_STATUS:
+		*vp = BOOLEAN_TO_JSVAL(toggle->default_toggle);
+		goto good;
+
+#if DISABLED_READONLY_SUPPORT
+	      case INPUT_DISABLED:
+	        *vp = BOOLEAN_TO_JSVAL(toggle->disabled);
+		goto good;
+	      case INPUT_READONLY:
+		*vp = BOOLEAN_TO_JSVAL(FALSE);
+		goto good;
+#endif
+	      default:
+		/* Don't mess with a user-defined property. */
+		goto good;
+	    }
+	}
+	break;
+
+      default:
+	{
+	    lo_FormElementMinimalData *minimal;
+
+	    minimal = &form_element->element_data->ele_minimal;
+	    switch (input_slot) {
+	      case INPUT_NAME:
+		str = lm_LocalEncodingToStr(context, 
+					    (char *)minimal->name);
+		break;
+	      case INPUT_VALUE:
+		str = lm_LocalEncodingToStr(context, 
+					    (char *)minimal->value);
+		break;
+#if DISABLED_READONLY_SUPPORT
+	      case INPUT_DISABLED:
+	        *vp = BOOLEAN_TO_JSVAL(minimal->disabled);
+		goto good;
+	      case INPUT_READONLY:
+		*vp = BOOLEAN_TO_JSVAL(FALSE); /* minimal elements don't have the readonly attribute. */
+		goto good;
+#endif
+	      default:
+		/* Don't mess with a user-defined property. */
+		goto good;
+	    }
+	}
+	break;
+    }
+
+    if (!str)
+	goto bad;
+    *vp = STRING_TO_JSVAL(str);
+
+good:
+    LO_UnlockLayout();
+    return JS_TRUE;
+
+bad:
+    LO_UnlockLayout();
+    return JS_FALSE;
+
+}
+
+char *
+lm_FixNewlines(JSContext *cx, const char *value, JSBool formElement)
+{
+    size_t size;
+    const char *cp;
+    char *tp, *new_value;
+
+#if defined XP_PC
+    size = 1;
+    for (cp = value; *cp != '\0'; cp++) {
+	switch (*cp) {
+	  case '\r':
+	    if (cp[1] != '\n')
+		size++;
+	    break;
+	  case '\n':
+	    if (cp > value && cp[-1] != '\r')
+		size++;
+	    break;
+	}
+    }
+    size += cp - value;
+#else
+    size = XP_STRLEN(value) + 1;
+#endif
+    new_value = JS_malloc(cx, size);
+    if (!new_value)
+	return NULL;
+    for (cp = value, tp = new_value; *cp != '\0'; cp++) {
+#if defined XP_MAC
+	if (*cp == '\n') {
+	    if (cp > value && cp[-1] != '\r')
+		*tp++ = '\r';
+	} else {
+	    *tp++ = *cp;
+	}
+#elif defined XP_PC
+	switch (*cp) {
+	  case '\r':
+	    *tp++ = '\r';
+	    if (cp[1] != '\n' && formElement)
+		*tp++ = '\n';
+	    break;
+	  case '\n':
+	    if (cp > value && cp[-1] != '\r' && formElement)
+		*tp++ = '\r';
+	    *tp++ = '\n';
+	    break;
+	  default:
+	    *tp++ = *cp;
+	    break;
+	}
+#else /* XP_UNIX */
+	if (*cp == '\r') {
+	    if (cp[1] != '\n')
+		*tp++ = '\n';
+	} else {
+	    *tp++ = *cp;
+	}
+#endif
+    }
+    *tp = '\0';
+    return new_value;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+input_setProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSInput *input;
+    enum input_slot input_slot;
+    const char *prop_name;
+    char *value = NULL;
+    LO_FormElementStruct *form_element;
+    MochaDecoder *decoder;
+    MWContext *context;
+    int32 intval;
+    jsint slot;
+
+    input = JS_GetInstancePrivate(cx, obj, &lm_input_class, NULL);
+    if (!input)
+	return JS_TRUE;
+
+    /* If the property is seting a key handler we find out now so
+     * that we can tell the front end to send the event. */
+    if (JSVAL_IS_STRING(id)) {
+	prop_name = JS_GetStringBytes(JSVAL_TO_STRING(id));
+	/* XXX use lm_onKeyDown_str etc. initialized by PARAM_ONKEYDOWN */
+	if (XP_STRCASECMP(prop_name, "onkeydown") == 0 ||
+	    XP_STRCASECMP(prop_name, "onkeyup") == 0 ||
+	    XP_STRCASECMP(prop_name, "onkeypress") == 0) {
+	    form_element = lm_GetFormElementByIndex(cx, JS_GetParent(cx, obj),
+						    input->index);
+	    form_element->event_handler_present = TRUE;
+	}
+	return JS_TRUE;
+    }
+
+    XP_ASSERT(JSVAL_IS_INT(id));
+    slot = JSVAL_TO_INT(id);
+
+    decoder = input->input_decoder;
+    context = decoder->window_context;
+    input_slot = slot;
+    switch (input_slot) {
+      case INPUT_TYPE:
+      case INPUT_FORM:
+      case INPUT_OPTIONS:
+	/* These are immutable. */
+	break;
+      case INPUT_NAME:
+      case INPUT_VALUE:
+      case INPUT_DEFAULT_VALUE:
+	/* These are string-valued. */
+	if (!JSVAL_IS_STRING(*vp) &&
+	    !JS_ConvertValue(cx, *vp, JSTYPE_STRING, vp)) {
+	    return JS_FALSE;
+	}
+	value = lm_StrToLocalEncoding(context, JSVAL_TO_STRING(*vp));
+	break;
+      case INPUT_STATUS:
+      case INPUT_DEFAULT_STATUS:
+#if DISABLED_READONLY_SUPPORT
+      case INPUT_READONLY:
+      case INPUT_DISABLED:
+#endif
+	/* These must be Booleans. */
+	if (!JSVAL_IS_BOOLEAN(*vp) &&
+	    !JS_ConvertValue(cx, *vp, JSTYPE_BOOLEAN, vp)) {
+	    return JS_FALSE;
+	}
+	break;
+      case INPUT_LENGTH:
+      case INPUT_SELECTED_INDEX:
+	/* These should be integers. */
+	if (JSVAL_IS_INT(*vp))
+	    intval = JSVAL_TO_INT(*vp);
+	else if (!JS_ValueToInt32(cx, *vp, &intval)) {
+	    return JS_FALSE;
+	}
+	break;
+    }
+
+    LO_LockLayout();
+
+    form_element = lm_GetFormElementByIndex(cx, JS_GetParent(cx, obj),
+					    input->index);
+    if (!form_element)
+	goto good;
+
+    switch (form_element->element_data->type) {
+      case FORM_TYPE_FILE:
+	/* if we try to set a file upload widget we better be a signed script */
+	if (!lm_CanAccessTarget(cx, JSTARGET_UNIVERSAL_FILE_READ))
+	    break;
+	/* else fall through... */
+
+      case FORM_TYPE_TEXT:
+      case FORM_TYPE_TEXTAREA:	/* XXX we ASSUME common struct prefixes */
+      case FORM_TYPE_PASSWORD:
+	{
+	    lo_FormElementTextData *text;
+	    JSBool ok;
+	    char * fixed_string;
+
+	    text = &form_element->element_data->ele_text;
+	    switch (input_slot) {
+	      case INPUT_NAME:
+		if (!lm_SaveParamString(cx, &text->name, value))
+		    goto bad;
+		break;
+	      case INPUT_VALUE:
+	      case INPUT_DEFAULT_VALUE:
+		fixed_string = lm_FixNewlines(cx, value, JS_TRUE);
+		if (!fixed_string)
+		    goto bad;
+		ok = (input_slot == INPUT_VALUE)
+		     ? lm_SaveParamString(cx, &text->current_text, fixed_string)
+		     : lm_SaveParamString(cx, &text->default_text, fixed_string);
+
+		JS_free(cx, (char *)fixed_string);
+		if (!ok)
+		    goto bad;
+		if (input_slot == INPUT_VALUE && context) {
+		    ET_PostManipulateForm(context, (LO_Element *)form_element,
+                                  EVENT_CHANGE);
+		}
+		break;
+#if DISABLED_READONLY_SUPPORT
+	      case INPUT_DISABLED:
+		text->disabled = JSVAL_TO_BOOLEAN(*vp);
+		if (context) {
+		  ET_PostManipulateForm(context, (LO_Element *)form_element,
+					EVENT_CHANGE);
+		}
+		break;
+	      case INPUT_READONLY:
+		if (form_element->element_data->type == FORM_TYPE_FILE)
+		  break;
+		text->readonly = JSVAL_TO_BOOLEAN(*vp);
+		if (context) {
+		  ET_PostManipulateForm(context, (LO_Element *)form_element,
+					EVENT_CHANGE);
+		}
+		break;
+#endif
+	      default:
+		/* Don't mess with option or user-defined property. */
+		goto good;
+	    }
+	}
+	break;
+
+      case FORM_TYPE_SELECT_ONE:
+      case FORM_TYPE_SELECT_MULT:
+	{
+	    lo_FormElementSelectData *selectData;
+	    lo_FormElementOptionData *optionData;
+	    JSSelectOption *option;
+	    int32 i, new_option_cnt, old_option_cnt;
+
+	    selectData = &form_element->element_data->ele_select;
+	    switch (slot) {
+	      case INPUT_NAME:
+		if (!lm_SaveParamString(cx, &selectData->name, value))
+		    goto bad;
+		break;
+
+	      case INPUT_LENGTH:
+		new_option_cnt = intval;
+		old_option_cnt = selectData->option_cnt;
+		optionData = (lo_FormElementOptionData *) selectData->options;
+
+		/* Remove truncated slots, or clear extended element data. */
+		if (new_ayer(MWContext *context, int32 wrap_width, int32 parent_layer_id);
+
+extern void
+lm_RestoreLayerState(MWContext *context, int32 layer_id, 
+                     LO_BlockInitializeStruct *param);
+
+extern PRHashNumber 
+lm_KeyHash(const void *key);
+
+extern JSBool
+lm_jsval_to_rgb(JSContext *cx, jsval *vp, LO_Color **rgbp);
+
+extern JSBool
+layer_setBgColorProperty(JSContext *cx, JSObject *obj, jsval *vp);
+
+extern JSObject *
+lm_GetActiveContainer(MochaDecoder *decoder);
+
+extern JSBool
+lm_GetPrincipalsCompromise(JSContext *cx, JSObject *obj);
+
+extern char *
+lm_FixNewlines(JSContext *cx, const char *value, JSBool formElement);
+
+extern JSBool PR_CALLBACK
+win_open(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+
+
+/* defined in libmocha.h */
+#ifdef JSDEBUGGER   
+
+extern void
+lm_InitJSDebug(JSRuntime *jsruntime);
+
+extern void
+lm_ExitJSDebug(JSRuntime *jsruntime);
+
+#endif
+
+#define IS_MESSAGE_WINDOW(context)                                           \
+(((context)->type == MWContextMail)      ||                                  \
+ ((context)->type == MWContextNews)      ||                                  \
+ ((context)->type == MWContextMailMsg)   ||                                  \
+ ((context)->type == MWContextNewsMsg))
+
+/* INTL support */
+
+extern char *
+lm_StrToLocalEncoding(MWContext * context, JSString * str);
+
+extern JSString *
+lm_LocalEncodingToStr(MWContext * context, char * bytes);
+
+/* end INTL support */
+
+/* MLM */
+typedef struct lm_lock_waiter {
+    JSLockReleaseFunc       fn;
+    void                  * data;
+    struct lm_lock_waiter * next;
+} lm_lock_waiter;
+
+typedef struct ContextListStr ContextList;
+
+typedef struct WindowGroup LMWindowGroup;
+
+struct WindowGroup {
+    LMWindowGroup     *next;
+    LMWindowGroup     *prev;
+
+    /* XXXMLM - this entry is currently unused; it should eventually hold
+     *           a shared JSContext for the thread group. 
+     */
+    JSContext         *js_context;
+
+    PRBool            interruptCurrentOp;
+
+    PRMonitor         *owner_monitor;
+    PRThread          *thread;
+    PRThread          *owner;
+    lm_lock_waiter    *waiting_list;
+    int32             current_count;
+
+    PRBool            mozWantsLock;
+    PRBool            mozGotLock;
+    
+    PRBool            hasLock;
+    JSContext         *lock_context;
+
+    JSTimeout         **js_timeout_insertion_point;
+    JSTimeout         *js_timeout_running;
+
+    uint              inputRecurring;
+
+    PREventQueue      *interpret_queue;
+    QueueStackElement *queue_stack;
+    uint              queue_depth;
+    uint              queue_count;
+    PRMonitor         *queue_monitor;
+    ContextList       *mw_contexts;
+    MWContext         *current_context;
+    PRBool            done;
+};
+
+extern void lm_InitWindowGroups(void);
+extern LMWindowGroup *lm_NewWindowGroup(void);
+extern void lm_StartWindowGroup(LMWindowGroup *grp);
+extern void lm_DestroyWindowGroup(LMWindowGroup *grp);
+extern LMWindowGroup *LM_GetDefaultWindowGroup(MWContext *mwc);
+extern LMWindowGroup *lm_MWContextToGroup(MWContext *mwc);
+extern LMWindowGroup *lm_QueueStackToGroup(QueueStackElement *qse);
+extern PREventQueue *LM_MWContextToQueue(MWContext *mwc);
+extern PREventQueue *LM_WindowGroupToQueue(LMWindowGroup *lmg);
+extern ContextList *lm_GetEntryForContext(LMWindowGroup *grp, MWContext *cx);
+extern void LM_AddContextToGroup(LMWindowGroup *grp, MWContext *cx);
+extern void LM_RemoveContextFromGroup(MWContext *cx);
+extern PRBool LM_IsLocked(LMWindowGroup *grp);
+extern void LM_BeginRequest(LMWindowGroup *grp, JSContext *jsc);
+extern void LM_EndRequest(LMWindowGroup *grp, JSContext *jsc);
+
+extern void LM_LockJSByGroup(LMWindowGroup *grp);
+extern void LM_UnlockJSByGroup(LMWindowGroup *grp);
+
+extern JSBool lm_inited(void);
+
+extern JSContext *LM_GetCrippledContext(void);
+extern MochaDecoder *LM_GetCrippledDecoder(void);
+extern void LM_SetCrippledDecoder(MochaDecoder *md);
+extern JSBool LM_ShouldRunGC(JSContext *cx, JSGCStatus status);
+
+/* MLM */
+
+#endif /* lm_h___ */

mozilla/lib/libmocha/lm_cmpnt.c

@@ -0,0 +1,675 @@
+/* -*- 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.
+ */
+
+
+/*
+ * JS reflection of Navigator Components.
+ *
+ * Created: Tom Pixley, 4/22/97
+ *
+ */
+
+#include "lm.h"
+#include "prmem.h"
+#include "np.h"
+#include "net.h"
+#include "fe_proto.h"
+
+/*
+ * -----------------------------------------------------------------------
+ *
+ * Data types
+ *
+ * -----------------------------------------------------------------------
+ */
+
+typedef struct JSComponent
+{
+    MochaDecoder	*decoder;
+    JSObject		*obj;
+    JSString	        *name;
+    ETBoolPtrFunc	 active_callback;
+    ETVoidPtrFunc	 startup_callback;
+} JSComponent;
+
+typedef struct JSComponentArray
+{
+    MochaDecoder       *decoder;
+    JSObject	       *obj;
+    jsint		length;
+} JSComponentArray;
+
+typedef struct JSPreDefComponent
+{
+    const char *name;
+    ETVerifyComponentFunc func;
+} JSPreDefComponent;
+
+static JSPreDefComponent predef_components[] =
+{
+    {0}
+};
+
+/*
+ * -----------------------------------------------------------------------
+ *
+ * Reflection of an installed component.
+ *
+ * -----------------------------------------------------------------------
+ */
+
+enum component_slot
+{
+    COMPONENT_NAME        = -1,
+    COMPONENT_ACTIVE      = -2
+};
+
+
+static JSPropertySpec component_props[] =
+{
+    {"name",        COMPONENT_NAME,	JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"active",	    COMPONENT_ACTIVE,	JSPROP_ENUMERATE | JSPROP_READONLY},
+    {0}
+};
+
+extern JSClass lm_component_class;
+
+PR_STATIC_CALLBACK(JSBool)
+component_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSComponent *component;
+    JSString *str;
+    jsint slot;
+
+    if (!JSVAL_IS_INT(id))
+	return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    component = JS_GetInstancePrivate(cx, obj, &lm_component_class, NULL);
+    if (!component)
+	return JS_TRUE;
+
+    switch (slot) {
+      case COMPONENT_NAME:
+        str = component->name;
+	if (str)
+	    *vp = STRING_TO_JSVAL(str);
+	else
+	    *vp = JS_GetEmptyStringValue(cx);
+        break;
+
+      case COMPONENT_ACTIVE:
+	*vp = JSVAL_FALSE;
+	if (ET_moz_CallFunctionBool((ETBoolPtrFunc)component->active_callback, NULL))
+	    *vp = JSVAL_TRUE;
+        break;
+
+      default:
+	break;
+    }
+
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+component_mozilla_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    char *name, *type_str, *get_str;
+    jsval type, func;
+
+    if (!JSVAL_IS_STRING(id))
+	return JS_TRUE;
+
+    name = JS_GetStringBytes(JSVAL_TO_STRING(id));
+
+    type_str = JS_malloc(cx, XP_STRLEN(lm_typePrefix_str) + XP_STRLEN(name) + 1);
+    get_str = JS_malloc(cx, XP_STRLEN(lm_getPrefix_str) + XP_STRLEN(name) + 1);
+    if (!type_str || !get_str)
+	return JS_TRUE;
+
+    XP_STRCPY(type_str, lm_typePrefix_str);
+    XP_STRCAT(type_str, name);
+    XP_STRCPY(get_str, lm_getPrefix_str);
+    XP_STRCAT(get_str, name);
+
+    if (!JS_GetProperty(cx, obj, type_str, &type) ||
+	!JSVAL_IS_INT(type) ||
+	!JS_GetProperty(cx, obj, get_str, &func))
+	return JS_TRUE;
+
+    JS_free(cx, type_str);
+    JS_free(cx, get_str);
+
+    switch(JSVAL_TO_INT(type)) {
+    case ARGTYPE_INT32:
+	*vp = INT_TO_JSVAL((int32)ET_moz_CompGetterFunction((ETCompPropGetterFunc)JSVAL_TO_INT(func), name));
+	break;
+    case ARGTYPE_BOOL:
+	*vp = BOOLEAN_TO_JSVAL((JSBool)ET_moz_CompGetterFunction((ETCompPropGetterFunc)JSVAL_TO_INT(func), name));
+	break;
+    case ARGTYPE_STRING:
+	*vp = STRING_TO_JSVAL(JS_NewStringCopyZ(cx, 
+		(char*)ET_moz_CompGetterFunction((ETCompPropGetterFunc)JSVAL_TO_INT(func), name)));
+	break;
+    }
+
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+component_mozilla_setProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    char *name, *type_str, *set_str, *prop_val;
+    jsval type, func;
+
+    if (!JSVAL_IS_STRING(id))
+	return JS_TRUE;
+
+    name = JS_GetStringBytes(JSVAL_TO_STRING(id));
+
+    type_str = JS_malloc(cx, XP_STRLEN(lm_typePrefix_str) + XP_STRLEN(name) + 1);
+    set_str = JS_malloc(cx, XP_STRLEN(lm_setPrefix_str) + XP_STRLEN(name) + 1);
+    if (!type_str || !set_str)
+	return JS_TRUE;
+
+    XP_STRCPY(type_str, lm_typePrefix_str);
+    XP_STRCAT(type_str, name);
+    XP_STRCPY(set_str, lm_setPrefix_str);
+    XP_STRCAT(set_str, name);
+    if (!JS_GetProperty(cx, obj, type_str, &type) ||
+	!JSVAL_IS_INT(type) ||
+	!JS_GetProperty(cx, obj, set_str, &func))
+	return JS_TRUE;
+
+    JS_free(cx, type_str);
+    JS_free(cx, set_str);
+  
+    switch(JSVAL_TO_INT(type)) {
+    case ARGTYPE_INT32:
+	if (JSVAL_IS_INT(*vp))
+	    ET_moz_CompSetterFunction((ETCompPropSetterFunc)JSVAL_TO_INT(func), name, (void*)JSVAL_TO_INT(*vp));
+	break;
+    case ARGTYPE_BOOL:
+	if (JSVAL_IS_BOOLEAN(*vp))
+	    ET_moz_CompSetterFunction((ETCompPropSetterFunc)JSVAL_TO_INT(func), name, (void*)JSVAL_TO_BOOLEAN(*vp));
+	break;
+    case ARGTYPE_STRING:
+	if (JSVAL_IS_STRING(*vp)) {
+	    prop_val = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+	    ET_moz_CompSetterFunction((ETCompPropSetterFunc)JSVAL_TO_INT(func), name, (void*)prop_val);
+	}
+	break;
+    }
+
+    return JS_TRUE;
+}
+
+void
+lm_RegisterComponentProp(const char *comp, const char *targetName, 
+			 uint8 retType, ETCompPropSetterFunc setter, 
+			 ETCompPropGetterFunc getter)
+{
+    JSContext *cx;
+    JSObject *arrayObj, *obj;
+    jsval val;
+    char *type, *set, *get;
+    MochaDecoder *cd = LM_GetCrippledDecoder();
+    
+    if (!comp || !targetName || !(cx = cd->js_context))
+	return;
+
+    arrayObj = lm_DefineComponents(cd);
+    if (!arrayObj)
+	return;
+
+    if (!JS_GetProperty(cx, arrayObj, comp, &val) ||
+        !JSVAL_IS_OBJECT(val))
+	return;
+
+    obj = JSVAL_TO_OBJECT(val);
+
+    if (!JS_DefineProperty(cx, obj, targetName, JSVAL_VOID, component_mozilla_getProperty, 
+		       component_mozilla_setProperty, 0)) {
+    }
+
+    type = JS_malloc(cx, XP_STRLEN(lm_typePrefix_str) + XP_STRLEN(targetName) + 1);
+    if (type) {
+	XP_STRCPY(type, lm_typePrefix_str);
+	XP_STRCAT(type, targetName);
+	if (!JS_DefineProperty(cx, obj, type,
+			   INT_TO_JSVAL((int32)retType), 0, 0, JSPROP_READONLY)) {
+	}
+	JS_free(cx, type);
+    }
+
+    get = JS_malloc(cx, XP_STRLEN(lm_getPrefix_str) + XP_STRLEN(targetName) + 1);
+    if (get) {
+	XP_STRCPY(get, lm_getPrefix_str);
+	XP_STRCAT(get, targetName);
+	if (!JS_DefineProperty(cx, obj, get,
+			   INT_TO_JSVAL(getter), 0, 0, JSPROP_READONLY)) {
+	}
+	JS_free(cx, get);
+    }
+
+    set = JS_malloc(cx, XP_STRLEN(lm_setPrefix_str) + XP_STRLEN(targetName) + 1);
+    if (set) {
+	XP_STRCPY(set, lm_setPrefix_str);
+	XP_STRCAT(set, targetName);
+	if (!JS_DefineProperty(cx, obj, set,
+			   INT_TO_JSVAL(setter), 0, 0, JSPROP_READONLY)) {
+	}
+	JS_free(cx, set);
+    }
+}
+
+PR_STATIC_CALLBACK(JSBool)
+component_resolve_name(JSContext *cx, JSObject *obj, jsval id)
+{
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(void)
+component_finalize(JSContext *cx, JSObject *obj)
+{
+    JSComponent* component;
+
+    component = JS_GetPrivate(cx, obj);
+    if (!component)
+	return;
+    JS_UnlockGCThing(cx, component->name);
+    DROP_BACK_COUNT(component->decoder);
+    JS_free(cx, component);
+}
+
+JSClass lm_component_class =
+{
+    "Component", JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub, JS_PropertyStub,
+    component_getProperty, component_getProperty, JS_EnumerateStub,
+    component_resolve_name, JS_ConvertStub, component_finalize
+};
+
+PR_STATIC_CALLBACK(JSBool)
+component_activate(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+    JSComponent *component;
+
+    component = JS_GetInstancePrivate(cx, obj, &lm_component_class, argv);
+    if (!component)
+	return JS_FALSE;
+
+    ET_moz_CallFunctionAsync((ETVoidPtrFunc)component->startup_callback, NULL);
+
+    return JS_TRUE;
+}
+
+static JSFunctionSpec component_methods[] =
+{
+    {"activate", component_activate, 0},
+    {0}
+};
+
+PR_STATIC_CALLBACK(JSBool)
+component_mozilla_method_stub(JSContext *cx, JSObject *obj, uint argc, 
+			      jsval *argv, jsval *rval)
+{
+    JSFunction *func;
+    JSObject *func_obj;
+    jsval type, native;
+    uint i;
+    JSCompArg *comp_argv;
+
+    func = JS_ValueToFunction(cx, argv[-2]);
+    func_obj = JS_GetFunctionObject(func);
+
+    if (!JS_GetProperty(cx, func_obj, lm_typePrefix_str, &type) ||
+	!JSVAL_IS_INT(type) ||
+	!JS_GetProperty(cx, func_obj, lm_methodPrefix_str, &native) ||
+	!(comp_argv = JS_malloc(cx, argc * sizeof(JSCompArg))))
+	return JS_TRUE;
+  
+    for (i=0; i<argc; i++) {
+	if (JSVAL_IS_INT(argv[i])) {
+	    comp_argv[i].type = ARGTYPE_INT32;
+	    comp_argv[i].value.intArg = JSVAL_TO_INT(argv[i]);
+	}
+	else if (JSVAL_IS_BOOLEAN(argv[i])) {
+	    comp_argv[i].type = ARGTYPE_BOOL;
+	    comp_argv[i].value.boolArg = JSVAL_TO_BOOLEAN(argv[i]);
+	}
+	else if (JSVAL_IS_STRING(argv[i])) {
+	    comp_argv[i].type = ARGTYPE_STRING;
+	    comp_argv[i].value.stringArg = JS_GetStringBytes(JSVAL_TO_STRING(argv[i]));
+	}
+	else {
+	    comp_argv[i].type = ARGTYPE_NULL;
+	    comp_argv[i].value.intArg = 0;
+	}
+    }
+
+    switch(JSVAL_TO_INT(type)) {
+    case ARGTYPE_NULL:
+	ET_moz_CompMethodFunction((ETCompMethodFunc)JSVAL_TO_INT(native), argc, NULL);
+	*rval = 0;
+	break;
+    case ARGTYPE_INT32:
+	*rval = INT_TO_JSVAL((int32)ET_moz_CompMethodFunction((ETCompMethodFunc)JSVAL_TO_INT(native), argc, comp_argv));
+	break;
+    case ARGTYPE_BOOL:
+	*rval = BOOLEAN_TO_JSVAL((JSBool)ET_moz_CompMethodFunction((ETCompMethodFunc)JSVAL_TO_INT(native), argc, comp_argv));
+	break;
+    case ARGTYPE_STRING:
+	*rval = STRING_TO_JSVAL(JS_NewStringCopyZ(cx, 
+		(char*)ET_moz_CompMethodFunction((ETCompMethodFunc)JSVAL_TO_INT(native), argc, comp_argv)));
+	break;
+    }
+    return JS_TRUE;
+}
+
+void
+lm_RegisterComponentMethod(const char *comp, const char *targetName, 
+			   uint8 retType, ETCompMethodFunc method, int32 argc)
+{
+    JSContext *cx;
+    JSObject *arrayObj, *obj, *func_obj;
+    JSFunction *func;
+    jsval val;
+    MochaDecoder *cd = LM_GetCrippledDecoder();
+    
+    if (!comp || !targetName || !(cx = cd->js_context))
+	return;
+
+    arrayObj = lm_DefineComponents(cd);
+    if (!arrayObj)
+	return;
+
+    if (!JS_GetProperty(cx, arrayObj, comp, &val) ||
+        !JSVAL_IS_OBJECT(val))
+	return;
+
+    obj = JSVAL_TO_OBJECT(val);
+
+    if (!(func = JS_DefineFunction(cx, obj, targetName, component_mozilla_method_stub, argc, 0))){
+    }
+
+    func_obj = JS_GetFunctionObject(func);
+
+    if (!JS_DefineProperty(cx, func_obj, lm_typePrefix_str,
+		       INT_TO_JSVAL((int32)retType), 0, 0, JSPROP_READONLY))
+	return;
+    if (!JS_DefineProperty(cx, func_obj, lm_methodPrefix_str,
+		       INT_TO_JSVAL(method), 0, 0, JSPROP_READONLY))
+	return;
+    if (!JS_DefineProperty(cx, func_obj, lm_methodArgc_str,
+		       INT_TO_JSVAL(argc), 0, 0, JSPROP_READONLY))
+	return;
+}
+
+/* Constructor method for a JSComponent object */
+static JSComponent*
+component_create_self(JSContext *cx, MochaDecoder* decoder, JSComponent *component, const char *name)
+{
+    JSObject *obj;
+
+    /* JSComponent may be malloc'd previous to this to make it easier
+     * to fill in the struct with data from the Mozilla thread
+     */
+    if (!component) {
+	component = JS_malloc(cx, sizeof(JSComponent));
+	if (!component)
+	    return NULL;
+    }
+
+    obj = JS_NewObject(cx, &lm_component_class, NULL, NULL);
+    if (!obj || !JS_SetPrivate(cx, obj, component)) {
+	JS_free(cx, component);
+	return NULL;
+    }
+
+    if (!JS_DefineProperties(cx, obj, component_props))
+	return NULL;
+
+    if (!JS_DefineFunctions(cx, obj, component_methods))
+	return NULL;
+
+    /* Fill out static property fields */
+    component->decoder = HOLD_BACK_COUNT(decoder);
+    component->obj = obj;
+
+    component->name = JS_NewStringCopyZ(cx, name);
+    if (!component->name || !JS_LockGCThing(cx, component->name))
+	return NULL;
+
+    return component;
+}
+
+
+/*
+ * -----------------------------------------------------------------------
+ *
+ * Reflection of the list of installed components.
+ * The only static property is the array length;
+ * the array elements (JSComponents) are added
+ * lazily when referenced.
+ *
+ * -----------------------------------------------------------------------
+ */
+
+enum componentarray_slot
+{
+    COMPONENTLIST_ARRAY_LENGTH = -1
+};
+
+static JSPropertySpec componentarray_props[] =
+{
+    {"length",  COMPONENTLIST_ARRAY_LENGTH,    JSPROP_READONLY},
+    {0}
+};
+
+/* Look up the component for the specified slot of the plug-in list */
+static JSComponent*
+componentarray_create_component(JSContext *cx, JSComponentArray *array,
+				JSComponent *component, const char *targetName, jsint targetSlot)
+{
+    component = component_create_self(cx, array->decoder, component, targetName);
+    if (component) {
+	char *name;
+	jsval val;
+
+	name = JS_GetStringBytes(component->name);
+	val = OBJECT_TO_JSVAL(component->obj);
+	JS_DefineProperty(cx, array->obj, name, val, NULL, NULL,
+			  JSPROP_ENUMERATE);
+	JS_AliasElement(cx, array->obj, name, targetSlot);
+	array->length++;
+	return component;
+    }
+    return NULL;
+}
+
+extern JSClass lm_component_array_class;
+
+void
+lm_RegisterComponent(const char *targetName, ETBoolPtrFunc active_callback, 
+		     ETVoidPtrFunc startup_callback) 
+{
+    JSContext *cx;
+    JSObject *arrayObj;
+    JSComponentArray *array;
+    JSComponent *component;
+    jsval val;
+    MochaDecoder *cd = LM_GetCrippledDecoder();
+
+    if (!(cx = cd->js_context) || !targetName)
+	return;
+	
+    arrayObj = lm_DefineComponents(cd);
+    if (!arrayObj)
+	return;
+
+    array = JS_GetInstancePrivate(cx, arrayObj, &lm_component_array_class, NULL);
+    if (!array)
+	return;
+
+    if (JS_GetProperty(cx, arrayObj, targetName, &val) && JSVAL_IS_OBJECT(val)) {
+	/* We already have a component by this name.  Update the active and
+	 * startup callback funcs in case ours are out of date 
+	 */
+	component = JS_GetPrivate(cx, JSVAL_TO_OBJECT(val));
+	if (!component)
+	    return;
+
+	component->active_callback = active_callback;
+	component->startup_callback = startup_callback;
+
+	return;
+    }
+
+    component = JS_malloc(cx, sizeof(JSComponent));
+    if (!component)
+	return;
+
+    component->active_callback = active_callback;
+    component->startup_callback = startup_callback;
+
+    componentarray_create_component(cx, array, component, targetName, array->length);
+}
+
+
+PR_STATIC_CALLBACK(JSBool)
+componentarray_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSComponentArray *array;
+    jsint slot;
+
+    if (!JSVAL_IS_INT(id))
+	return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    array = JS_GetInstancePrivate(cx, obj, &lm_component_array_class, NULL);
+    if (!array)
+	return JS_TRUE;
+
+    switch (slot) {
+      case COMPONENTLIST_ARRAY_LENGTH:
+        *vp = INT_TO_JSVAL(array->length);
+        break;
+
+      default:
+        /* Don't mess with a user-defined property. */
+        if (slot >= 0 && slot < (jsint) array->length) {
+
+	    /* Search for an existing JSComponent for this slot */
+	    JSObject* componentObj = NULL;
+	    jsval val = *vp;
+
+	    if (JSVAL_IS_OBJECT(val)) {
+    		componentObj = JSVAL_TO_OBJECT(val);
+	    }
+	    else {
+		JSComponent* component;
+		component = componentarray_create_component(cx, array, NULL,
+		                                            NULL, slot);
+		if (component)
+    		    componentObj = component->obj;
+	    }
+
+	    *vp = OBJECT_TO_JSVAL(componentObj);
+	    break;
+	}
+    }
+
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(void)
+componentarray_finalize(JSContext *cx, JSObject *obj)
+{
+    JSComponentArray* array;
+
+    array = JS_GetPrivate(cx, obj);
+    if (!array)
+	return;
+    DROP_BACK_COUNT(array->decoder);
+    JS_free(cx, array);
+}
+
+JSClass lm_component_array_class =
+{
+    "ComponentArray", JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub, JS_PropertyStub,
+    componentarray_getProperty, componentarray_getProperty, JS_EnumerateStub,
+    JS_ResolveStub, JS_ConvertStub, componentarray_finalize
+};
+
+
+JSObject*
+lm_DefineComponents(MochaDecoder *decoder)
+{
+    JSObject *obj;
+    JSComponentArray *array;
+    JSContext *cx = decoder->js_context;
+    JSPreDefComponent def_comps;   
+    JSComponent *component;
+    jsint slot;
+
+    obj = decoder->components;
+    if (obj)
+        return obj;
+
+    array = JS_malloc(cx, sizeof(JSComponentArray));
+    if (!array)
+        return NULL;
+    XP_BZERO(array, sizeof *array);
+
+    obj = JS_NewObject(cx, &lm_component_array_class, NULL,
+		       decoder->window_object);
+    if (!obj || !JS_SetPrivate(cx, obj, array)) {
+        JS_free(cx, array);
+        return NULL;
+    }
+    if (!JS_DefineProperties(cx, obj, componentarray_props))
+	return NULL; 
+
+    array->decoder = HOLD_BACK_COUNT(decoder);
+    array->obj = obj;
+
+    /* Components can be added dynamically but some are predefined */
+    slot = 0;
+    array->length = 0;
+    def_comps = predef_components[slot];
+    while (def_comps.name) {
+	component = JS_malloc(cx, sizeof(JSComponent));
+	if (!component)
+	    return NULL;
+
+	if (ET_moz_VerifyComponentFunction(def_comps.func, &(component->active_callback), 
+					   &(component->startup_callback))) {
+	    componentarray_create_component(cx, array, component, def_comps.name, array->length);
+	}
+	else {
+	    /*Component call failed somewhere.*/
+	    JS_free(cx, component);
+	}
+	def_comps = predef_components[++slot];
+    }
+    return obj;
+}

mozilla/lib/libmocha/lm_img.c

@@ -0,0 +1,854 @@
+/* -*- 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.
+ */
+/*
+ * Image reflection and event notification
+ *
+ * Scott Furman, 3/30/96
+ */
+
+#include "lm.h"
+
+#include "lo_ele.h"
+#include "prtypes.h"
+#include "pa_tags.h"
+#include "layout.h"
+
+#define IL_CLIENT
+#include "libimg.h"             /* Image Library public API. */
+
+enum image_array_slot {
+    IMAGE_ARRAY_LENGTH = -1
+};
+
+static JSPropertySpec image_array_props[] = {
+    {lm_length_str, IMAGE_ARRAY_LENGTH,
+		    JSPROP_ENUMERATE | JSPROP_READONLY | JSPROP_PERMANENT},
+    {0}
+};
+
+extern JSClass lm_image_array_class;
+
+PR_STATIC_CALLBACK(JSBool)
+image_array_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSObjectArray *array;
+    MochaDecoder *decoder;
+    MWContext *context;
+    jsint count, slot;
+    LO_ImageStruct *image;
+    int32 active_layer_id;
+
+    if (!JSVAL_IS_INT(id))
+	return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    array = JS_GetInstancePrivate(cx, obj, &lm_image_array_class, NULL);
+    if (!array)
+	return JS_TRUE;
+    decoder = array->decoder;
+    context = decoder->window_context;
+    if (!context)
+	return JS_TRUE;
+
+    LO_LockLayout();
+    switch (slot) {
+      case IMAGE_ARRAY_LENGTH:
+	active_layer_id = LM_GetActiveLayer(context);
+	LM_SetActiveLayer(context, array->layer_id);
+	count = LO_EnumerateImages(context, array->layer_id);
+	LM_SetActiveLayer(context, active_layer_id);
+	if (count > array->length)
+	    array->length = count;
+	*vp = INT_TO_JSVAL(count);
+	break;
+
+      default:
+	if (slot < 0) {
+	    /* Don't mess with user-defined or method properties. */
+	    LO_UnlockLayout();
+	    return JS_TRUE;
+	}
+	if (slot >= array->length)
+	    array->length = slot + 1;
+	image = LO_GetImageByIndex(context, array->layer_id, (uint)slot);
+	if (image) {
+	    *vp = OBJECT_TO_JSVAL(LM_ReflectImage(context, image, NULL,
+						  array->layer_id, 
+                                                  (uint)slot));
+	}
+	break;
+    }
+    LO_UnlockLayout();
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(void)
+image_array_finalize(JSContext *cx, JSObject *obj)
+{
+    JSObjectArray *array;
+
+    array = JS_GetPrivate(cx, obj);
+    if (!array)
+        return;
+    DROP_BACK_COUNT(array->decoder);
+    JS_free(cx, array);
+}
+
+JSClass lm_image_array_class = {
+    "ImageArray", JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub, JS_PropertyStub,
+    image_array_getProperty, image_array_getProperty, JS_EnumerateStub,
+    JS_ResolveStub, JS_ConvertStub, image_array_finalize
+};
+
+enum image_slot {
+    IMAGE_NAME              = -2,
+    IMAGE_SRC               = -3,
+    IMAGE_LOWSRC            = -4,
+    IMAGE_X                 = -5,
+    IMAGE_Y                 = -6,
+    IMAGE_HEIGHT            = -7,
+    IMAGE_WIDTH             = -8,
+    IMAGE_BORDER            = -9,
+    IMAGE_VSPACE            = -10,
+    IMAGE_HSPACE            = -11,
+    IMAGE_COMPLETE          = -12
+};
+
+static JSPropertySpec image_props[] = {
+    {"name",                IMAGE_NAME,         JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"src",                 IMAGE_SRC,          JSPROP_ENUMERATE},
+    {"lowsrc",              IMAGE_LOWSRC,       JSPROP_ENUMERATE},
+    {"x",                   IMAGE_X,            JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"y",                   IMAGE_Y,            JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"height",              IMAGE_HEIGHT,       JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"width",               IMAGE_WIDTH,        JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"border",              IMAGE_BORDER,       JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"vspace",              IMAGE_VSPACE,       JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"hspace",              IMAGE_HSPACE,       JSPROP_ENUMERATE | JSPROP_READONLY},
+    {"complete",            IMAGE_COMPLETE,     JSPROP_ENUMERATE | JSPROP_READONLY},
+    {0}
+};
+
+/*
+ * Base image element type.
+ */
+typedef struct JSImage {
+    JSEventReceiver	    receiver;
+    MochaDecoder           *decoder;
+    LO_ImageStruct         *image_data;     /* 0 unless made by new Image() */
+    uint8                   pending_events;
+    int32                   layer_id;
+    uint                    index;
+    JSBool            complete;       /* Finished loading or aborted */
+    JSString        *name;
+} JSImage;
+
+#define GET_IMAGE_DATA(context, image)                                        \
+    ((image)->image_data ? (image)->image_data                                \
+     : LO_GetImageByIndex((context), (image)->layer_id, (image)->index))
+
+extern JSClass lm_image_class;
+
+/*
+ * Force the mozilla event queue to flush to make sure any image-set-src
+ *   events have been processed
+ */
+PR_STATIC_CALLBACK(void)
+lm_img_src_sync(void * data)
+{
+}
+
+
+PR_STATIC_CALLBACK(JSBool)
+image_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSImage *image;
+    LO_ImageStruct *image_data;
+    enum image_slot image_slot;
+    JSString *str;
+    jsint slot;
+
+    if (!JSVAL_IS_INT(id))
+	return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    image = JS_GetInstancePrivate(cx, obj, &lm_image_class, NULL);
+    if (!image)
+	return JS_TRUE;
+    image_data = GET_IMAGE_DATA(image->decoder->window_context, image);
+    if (!image_data)
+        return JS_TRUE;      /* Try to handle this case gracefully. */
+
+    image_slot = slot;
+    if (image_slot == IMAGE_SRC || image_slot == IMAGE_LOWSRC) {
+        if (!lm_CheckPermissions(cx, obj, JSTARGET_UNIVERSAL_BROWSER_READ))
+            return JS_FALSE;
+    }
+
+    switch (image_slot) {
+    case IMAGE_NAME:
+	if (image->name)
+	    *vp = STRING_TO_JSVAL(image->name);
+	else
+	    *vp = JSVAL_NULL;
+        break;
+
+    case IMAGE_SRC:
+	if (image_data->pending_mocha_event) {
+	    ET_moz_CallFunction(lm_img_src_sync, NULL);
+	    image_data->pending_mocha_event = PR_FALSE;
+	}
+	str = JS_NewStringCopyZ(cx, (char*)image_data->image_url);
+	if (!str)
+	    return JS_FALSE;
+	*vp = STRING_TO_JSVAL(str);
+	break;
+
+    case IMAGE_LOWSRC:
+	if (image_data->pending_mocha_event) {
+	    ET_moz_CallFunction(lm_img_src_sync, NULL);
+	    image_data->pending_mocha_event = PR_FALSE;
+	}
+	str = JS_NewStringCopyZ(cx, (char*)image_data->lowres_image_url);
+	if (!str)
+	    return JS_FALSE;
+	*vp = STRING_TO_JSVAL(str);
+	break;
+
+    case IMAGE_X:
+        *vp = INT_TO_JSVAL(image_data->x + image_data->x_offset);
+        break;
+
+    case IMAGE_Y:
+        *vp = INT_TO_JSVAL(image_data->y + image_data->y_offset);
+        break;
+
+    case IMAGE_HEIGHT:
+        *vp = INT_TO_JSVAL(image_data->height);
+        break;
+
+    case IMAGE_WIDTH:
+        *vp = INT_TO_JSVAL(image_data->width);
+        break;
+
+    case IMAGE_BORDER:
+        *vp = INT_TO_JSVAL(image_data->border_width);
+        break;
+
+    case IMAGE_HSPACE:
+        *vp = INT_TO_JSVAL(image_data->border_horiz_space);
+        break;
+
+    case IMAGE_VSPACE:
+        *vp = INT_TO_JSVAL(image_data->border_vert_space);
+        break;
+
+    case IMAGE_COMPLETE:
+        *vp = BOOLEAN_TO_JSVAL(image->complete);
+        break;
+
+    default:
+        /* Don't mess with a user-defined or method property. */
+        return JS_TRUE;
+    }
+
+    return JS_TRUE;
+}
+
+static JSBool
+image_set_src(JSImage *image, const char *str, LO_ImageStruct *image_data)
+{
+    MochaDecoder *decoder;
+    MWContext *context;
+    IL_GroupContext *img_cx;
+    
+    decoder = image->decoder;
+    context = decoder->window_context;
+    img_cx = decoder->image_context;
+
+    if (!context) return JS_TRUE;
+
+    image_data->pending_mocha_event = PR_TRUE;
+    image_data->image_attr->attrmask |= LO_ATTR_MOCHA_IMAGE;
+    
+    ET_il_GetImage(str, context, img_cx, image_data, NET_DONT_RELOAD);
+
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+image_setProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSBool ok;
+    JSImage *image;
+    MochaDecoder *decoder;
+    MWContext *context;
+    LO_ImageStruct *image_data;
+    enum image_slot image_slot;
+    const char *url;
+    jsint slot;
+
+    image = JS_GetInstancePrivate(cx, obj, &lm_image_class, NULL);
+    if (!image)
+	return JS_TRUE;
+    decoder = image->decoder;
+    context = decoder->window_context;
+    if (!context) 
+	return JS_TRUE;
+    
+    if (!JSVAL_IS_INT(id))
+	return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    image_data = GET_IMAGE_DATA(context, image);
+    if (!image_data)
+        return JS_TRUE;      /* Try to handle this case gracefully. */
+
+    image_slot = slot;
+    switch (image_slot) {
+    case IMAGE_SRC:
+    case IMAGE_LOWSRC:
+        if (!lm_CheckPermissions(cx, obj, JSTARGET_UNIVERSAL_BROWSER_WRITE))
+            return JS_FALSE;
+
+        if (JSVAL_IS_NULL(*vp)) {
+            url = NULL;
+        } else {
+            if (!JSVAL_IS_STRING(*vp) &&
+                !JS_ConvertValue(cx, *vp, JSTYPE_STRING, vp))
+                return JS_FALSE;
+                
+            url = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+            url = lm_CheckURL(cx, url, JS_TRUE);  /* will allocate new string */
+            if (!url)
+                return JS_FALSE;
+        }
+
+        if (image_slot == IMAGE_SRC) {
+            ok = image_set_src(image, url, image_data);
+        } else if (url) {
+	    ok = lm_SaveParamString(cx, &image_data->lowres_image_url, url);
+        }
+
+	if (url)
+	    XP_FREE((void *) url);
+
+        if (!ok)
+            return JS_FALSE;
+
+	/*
+	 * don't call image_getProperty so that we don't immediately
+	 *   turn around and block
+	 */
+	return JS_TRUE;
+        break;
+
+    case IMAGE_NAME:
+    case IMAGE_X:
+    case IMAGE_Y:
+    case IMAGE_HEIGHT:
+    case IMAGE_WIDTH:
+    case IMAGE_BORDER:
+    case IMAGE_VSPACE:
+    case IMAGE_HSPACE:
+    case IMAGE_COMPLETE:
+	/* These are immutable. */
+	break;
+    }
+
+    return image_getProperty(cx, obj, id, vp);
+}
+
+PR_STATIC_CALLBACK(void)
+image_finalize(JSContext *cx, JSObject *obj)
+{
+    JSImage *image;
+    LO_ImageStruct *image_data;
+    MochaDecoder *decoder;
+    MWContext *context;
+
+    image = JS_GetPrivate(cx, obj);
+    if (!image)
+	return;
+
+    image_data = image->image_data;
+    decoder = image->decoder;
+    context = decoder->window_context;
+    if (image_data) {
+        /* If this is a layer background image or a reflection of an
+           existing layout image, then layout will take care of
+           destroying the image.  For anonymous images, however, 
+           we need to handle destruction here. */
+        if (!image_data->layer) {
+            ET_PostFreeImageElement(context, image_data);
+            XP_FREE(image_data->image_attr);
+            XP_FREE(image_data);
+        }
+    } else {
+	if (context) {
+	    LO_LockLayout();
+	    image_data = LO_GetImageByIndex(context, image->layer_id,
+                                            image->index);
+	    if (image_data && image_data->mocha_object == obj)
+		image_data->mocha_object = NULL;
+	    LO_UnlockLayout();
+	}
+    }
+    DROP_BACK_COUNT(decoder);
+
+    JS_UnlockGCThing(cx, image->name);
+    JS_free(cx, image);
+}
+
+JSClass lm_image_class = {
+    "Image", JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub, JS_PropertyStub, image_getProperty, image_setProperty,
+    JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, image_finalize
+};
+
+/* Fill in native, private part of JS image */
+static JSImage *
+init_image_object(JSContext *cx, JSObject *obj, LO_ImageStruct *image_data)
+{
+    JSImage *image;
+    MochaDecoder *decoder;
+    
+    image = JS_malloc(cx, sizeof *image);
+    if (!image)
+        return NULL;
+    XP_BZERO(image, sizeof *image);
+
+    image->image_data = image_data;
+    decoder = JS_GetPrivate(cx, JS_GetGlobalObject(cx));
+    image->decoder = HOLD_BACK_COUNT(decoder);
+    image_data->mocha_object = obj;
+
+    /* Events are never blocked for anonymous images
+       since there is no associated layout. */
+    image->pending_events = PR_BIT(LM_IMGUNBLOCK);
+    if (!JS_SetPrivate(cx, obj, image))
+	return NULL;
+
+    return image;
+}
+
+JSObject *
+lm_NewImage(JSContext *cx,
+            LO_ImageStruct *image_data)
+{
+    JSObject *obj, *outer_obj;
+    MochaDecoder *decoder;
+    decoder = JS_GetPrivate(cx, JS_GetGlobalObject(cx));
+    outer_obj = lm_GetOuterObject(decoder);
+
+    obj = JS_NewObject(cx, &lm_image_class, decoder->image_prototype, 
+		       outer_obj);
+    if (!init_image_object(cx, obj, image_data))
+        return NULL;
+    
+    return obj;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+Image(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+    jsint width, height;
+    LO_ImageStruct *image_data;
+
+    XP_ASSERT(JS_InstanceOf(cx, obj, &lm_image_class, NULL));
+
+    height = width = 0;
+
+    if (argc > 0) {
+	if (argc != 2) {
+	    JS_ReportError(cx, lm_argc_err_str);
+	    return JS_FALSE;
+	}
+        if (!JSVAL_IS_INT(argv[0]) ||
+            !JSVAL_IS_INT(argv[1])) {
+            return JS_FALSE;
+        }
+	width = JSVAL_TO_INT(argv[0]);
+	height = JSVAL_TO_INT(argv[1]);
+    }
+
+    /* Allocate dummy layout structure.  This is not really
+       used by layout, but the front-ends and the imagelib
+       need it as a handle on an image instance. */
+    image_data = XP_NEW_ZAP(LO_ImageStruct);
+    if (!image_data) {
+	JS_ReportOutOfMemory(cx);
+        return JS_FALSE;
+    }
+    image_data->image_attr = XP_NEW_ZAP(LO_ImageAttr);
+    if (!image_data->image_attr) {
+        XP_FREE(image_data);
+	JS_ReportOutOfMemory(cx);
+        return JS_FALSE;
+    }
+
+    image_data->type = LO_IMAGE;
+
+    /* Fake layout ID, guaranteed not to match any real layout element */
+    image_data->ele_id = -1;
+
+    if (!init_image_object(cx, obj, image_data)) {
+	XP_FREE(image_data->image_attr);
+	XP_FREE(image_data);
+        return JS_FALSE;
+    }
+
+    /* Process arguments */
+
+    /* Width & Height */
+    if (argc == 2) {
+        image_data->width  = (int)width;
+        image_data->height = (int)height;
+    }
+
+    return JS_TRUE;
+}
+
+static JSObject *
+reflect_image_array(MochaDecoder *decoder, JSObject *document)
+{
+    JSContext *cx;
+    JSObjectArray *array;
+    JSObject *obj;
+    JSDocument *doc;
+
+    cx = decoder->js_context;
+    doc = JS_GetPrivate(cx, document);
+    if (!doc)
+	return NULL;
+
+    array = JS_malloc(cx, sizeof *array);
+    if (!array)
+	return NULL;
+    XP_BZERO(array, sizeof *array);
+
+    obj = JS_NewObject(cx, &lm_image_array_class, NULL, document);
+    if (!obj || !JS_SetPrivate(cx, obj, array)) {
+        LM_PutMochaDecoder(decoder);
+        return NULL;
+    }
+
+    if (!JS_DefineProperties(cx, obj, image_array_props))
+	return NULL;
+
+    array->decoder = HOLD_BACK_COUNT(decoder);
+    array->layer_id = doc->layer_id;
+    return obj;
+}
+
+JSObject *
+lm_GetImageArray(MochaDecoder *decoder, JSObject *document)
+{
+    JSObject *obj;
+    JSDocument *doc;
+
+    doc = JS_GetPrivate(decoder->js_context, document);
+    if (!doc)
+	return NULL;
+
+    obj = doc->images;
+    if (obj)
+	return obj;
+    obj = reflect_image_array(decoder, document);
+    doc->images = obj;
+    return obj;
+}
+
+JSObject *
+LM_ReflectImage(MWContext *context, LO_ImageStruct *image_data, 
+			    PA_Tag * tag, int32 layer_id, uint index)
+{
+    JSObject *obj, *array_obj, *outer_obj, *document;
+    MochaDecoder *decoder;
+    JSContext *cx;
+    JSImage *image;
+    PA_Block name = NULL;
+    lo_TopState *top_state;
+    PRHashTable *map;
+
+    image_data = LO_GetImageByIndex(context, layer_id, index);
+    XP_ASSERT(image_data);
+    if (! image_data)
+      return NULL;
+
+    obj = image_data->mocha_object;
+    if (obj)
+	return obj;
+
+    decoder = LM_GetMochaDecoder(context);
+    if (!decoder)
+	return NULL;
+    cx = decoder->js_context;
+
+    top_state = lo_GetMochaTopState(context);
+    if (top_state->resize_reload) {
+        map = lm_GetIdToObjectMap(decoder);
+        
+        if (map)
+            obj = (JSObject *)PR_HashTableLookup(map,
+                             LM_GET_MAPPING_KEY(LM_IMAGES, layer_id, index));
+        if (obj) {
+            image_data->mocha_object = obj;
+            goto done;
+        }
+    }
+
+    /* Get the document object that will hold this link */
+    document = lm_GetDocumentFromLayerId(decoder, layer_id);
+    if (!document)
+        goto done;
+
+    array_obj = lm_GetImageArray(decoder, document);
+    if (!array_obj)
+	goto done;
+
+    image = JS_malloc(cx, sizeof *image);
+    if (!image)
+	goto done;
+
+    XP_BZERO(image, sizeof *image);
+
+    /* if we got a tag passed in try to get the name out of there */
+    name = lo_FetchParamValue(context, tag, PARAM_NAME);
+
+    outer_obj = lm_GetOuterObject(decoder);
+
+    obj = JS_NewObject(cx, &lm_image_class, decoder->image_prototype,
+		       outer_obj);
+    if (!obj || !JS_SetPrivate(cx, obj, image)) {
+	JS_free(cx, image);
+	goto done;
+    }
+
+    if (name) {
+	JSObject *doc_obj;
+	extern JSClass lm_form_class;
+
+	if (!JS_DefineProperty(cx, outer_obj, (const char *) name, 
+			       OBJECT_TO_JSVAL(obj), NULL, NULL,
+			       JSPROP_ENUMERATE|JSPROP_READONLY)) {
+	    obj = NULL;
+	    goto done;
+	}
+	/* XXX backward compatibility with 3.0 bug: lo_BlockedImageLayout
+	       would eagerly reflect images outside of any active form, so
+	       they'd end up in document scope. */
+	if (JS_GetClass(cx, outer_obj) == &lm_form_class &&
+	    (doc_obj = JS_GetParent(cx, outer_obj)) != NULL &&
+	    !JS_DefineProperty(cx, doc_obj, (const char *) name, 
+			       OBJECT_TO_JSVAL(obj), NULL, NULL,
+			       JSPROP_ENUMERATE|JSPROP_READONLY)) {
+	    obj = NULL;
+	    goto done;
+	}
+    }
+
+    image->decoder = HOLD_BACK_COUNT(decoder);
+    image->index = index;
+    image->layer_id = layer_id;
+    image->name = JS_NewStringCopyZ(cx, (const char *) name);
+    if (!JS_LockGCThing(cx, image->name)) {
+	obj = NULL;
+	goto done;
+    }
+    image_data->mocha_object = obj;
+
+    if (!lm_AddObjectToArray(cx, array_obj, (const char *) name, 
+			     index, obj)) {
+	obj = NULL;
+	goto done;
+    }
+
+    /* Put it in the index to object hash table */
+    map = lm_GetIdToObjectMap(decoder);
+    if (map)
+        PR_HashTableAdd(map,
+                        LM_GET_MAPPING_KEY(LM_IMAGES, layer_id, index),
+                        obj);
+
+    /* OK, we've got our image, see if there are any event handlers
+     *   defined with it
+     */
+    if(tag) {
+	PA_Block onload   = lo_FetchParamValue(context, tag, PARAM_ONLOAD);
+	PA_Block onabort  = lo_FetchParamValue(context, tag, PARAM_ONABORT);
+	PA_Block onerror  = lo_FetchParamValue(context, tag, PARAM_ONERROR);
+	PA_Block onmousedown = lo_FetchParamValue(context, tag, PARAM_ONMOUSEDOWN);
+	PA_Block onmouseup = lo_FetchParamValue(context, tag, PARAM_ONMOUSEUP);
+	PA_Block id	  = lo_FetchParamValue(context, tag, PARAM_ID);
+
+	/* don't hold the layout lock across compiles */
+	LO_UnlockLayout();
+
+	if (onload != NULL) {
+	    (void) lm_CompileEventHandler(decoder, id, tag->data,
+					  tag->newline_count, obj,
+					  PARAM_ONLOAD, onload);
+	    PA_FREE(onload);
+	}
+
+	if (onabort != NULL) {
+	    (void) lm_CompileEventHandler(decoder, id, tag->data,
+					  tag->newline_count, obj,
+				          PARAM_ONABORT, onabort);
+	    PA_FREE(onabort);
+	}
+
+	if (onerror != NULL) {
+	    (void) lm_CompileEventHandler(decoder, id, tag->data,
+					  tag->newline_count, obj,
+					  PARAM_ONERROR, onerror);
+	    PA_FREE(onerror);
+	}
+	if (onmousedown != NULL) {
+	    (void) lm_CompileEventHandler(decoder, id, tag->data,
+					  tag->newline_count, obj,
+					  PARAM_ONMOUSEDOWN, onmousedown);
+	    PA_FREE(onmousedown);
+	}
+	if (onmouseup != NULL) {
+	    (void) lm_CompileEventHandler(decoder, id, tag->data,
+					  tag->newline_count, obj,
+					  PARAM_ONMOUSEUP, onmouseup);
+	    PA_FREE(onmouseup);
+	}
+
+	if (id)
+	    PA_FREE(id);
+
+	LO_LockLayout();
+    }
+
+done:
+
+    if(name)
+	PA_FREE(name);
+    LM_PutMochaDecoder(decoder);
+
+    return obj;
+}
+
+void
+lm_ProcessImageEvent(MWContext *context, JSObject *obj,
+                  LM_ImageEvent event)
+{
+    uint event_mask;
+    jsval result;
+    JSImage *image;
+
+    image = JS_GetPrivate(context->mocha_context, obj);
+    if (!image)
+        return;
+
+    image->pending_events |= PR_BIT(event);
+
+    /* Special event used to trigger deferred events */
+    if (! (image->pending_events & PR_BIT(LM_IMGUNBLOCK)))
+        return;
+
+    for (event = LM_IMGLOAD; event <= LM_LASTEVENT; event++) {
+        event_mask = PR_BIT(event);
+        if (image->pending_events & event_mask) {
+
+	    JSEvent *pEvent;
+	    pEvent=XP_NEW_ZAP(JSEvent);
+
+            image->pending_events &= ~event_mask;
+            switch (event) {
+            case LM_IMGLOAD:
+                pEvent->type = EVENT_LOAD;
+                image->complete = JS_TRUE;
+                break;
+            case LM_IMGABORT:
+                pEvent->type = EVENT_ABORT;
+                image->complete = JS_TRUE;
+                break;
+            case LM_IMGERROR:
+                pEvent->type = EVENT_ERROR;
+                image->complete = JS_TRUE;
+                break;
+            default:
+                XP_ABORT(("Unknown image event"));
+            }
+
+            lm_SendEvent(context, obj, pEvent, &result);
+        }
+    }
+}
+
+JSBool
+lm_InitImageClass(MochaDecoder *decoder)
+{
+    JSContext *cx;
+    JSObject *prototype;
+
+    cx = decoder->js_context;
+    prototype = JS_InitClass(cx, decoder->window_object, 
+			     decoder->event_receiver_prototype, &lm_image_class,
+			     Image, 0, image_props, NULL, NULL, NULL);
+    if (!prototype)
+	return JS_FALSE;
+    decoder->image_prototype = prototype;
+    return JS_TRUE;
+}
+
+/* Create an image context for anonymous images and attach it to the specified
+   mocha decoder. */
+JSBool
+lm_NewImageContext(MWContext *context, MochaDecoder *decoder)
+{
+    IL_GroupContext *img_cx;
+    IMGCB* img_cb;
+    JMCException *exc = NULL;
+    
+    if (!decoder->image_context) {
+        img_cb = IMGCBFactory_Create(&exc); /* JMC Module */
+        if (exc) {
+            JMC_DELETE_EXCEPTION(&exc); /* XXX Should really return
+                                           exception */
+            JS_ReportOutOfMemory(decoder->js_context);
+            return JS_FALSE;
+        }
+
+        /* Create an Image Group Context.  IL_NewGroupContext augments the
+           reference count for the JMC callback interface.  The opaque argument
+           to IL_NewGroupContext is the Front End's display context, which will
+           be passed back to all the Image Library's FE callbacks. */
+        img_cx = IL_NewGroupContext((void*)context, (IMGCBIF *)img_cb);
+        if (!img_cx) {
+            JS_ReportOutOfMemory(decoder->js_context);
+            return JS_FALSE;
+        }
+
+        /* Attach the IL_GroupContext to the mocha decoder. */
+        decoder->image_context = img_cx;
+
+		/* Allow the context to observe the decoder's image context. */
+		ET_il_SetGroupObserver(context, decoder->image_context, context, JS_TRUE);
+    }
+    return JS_TRUE;
+}

mozilla/lib/libmocha/lm_trggr.c

@@ -0,0 +1,287 @@
+/* -*- 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.
+ */
+/*
+ * lm_trggr.c
+ * 
+ * Reflects AutoInstall trigger methods
+ * into the global JavaScript config object.
+ *
+ * See Trigger.java for related functions.
+ */
+
+#include "lm.h"
+#include "prefapi.h"
+#include "VerReg.h"
+#include "softupdt.h"
+#include "gui.h"	/* XP_AppPlatform */
+
+JSBool PR_CALLBACK asd_Version(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+JSBool PR_CALLBACK asd_get_version(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+JSBool PR_CALLBACK asd_start_update(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+JSBool PR_CALLBACK asd_conditional_update(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+JSBool PR_CALLBACK asd_alert(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+JSBool PR_CALLBACK asd_platform(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval);
+
+PRIVATE JSFunctionSpec autoinstall_methods[] = {
+    { "getVersion",	asd_get_version,	2 },
+    { "startUpdate",	asd_start_update,	2 },
+    { "conditionalUpdate",	asd_conditional_update, 4 },
+    { "startUpdateComponent",	asd_conditional_update,	4 },	/* old name */
+    { NULL,	NULL,	0 }
+};
+
+PRIVATE JSFunctionSpec globalconfig_methods[] = {
+    { "alert",	asd_alert,	1 },
+    { "getPlatform", asd_platform, 0 },
+    { NULL,	NULL,	0 }
+};
+
+PRIVATE JSClass autoinstall_class = {
+    "AutoInstall", 0,
+    JS_PropertyStub, JS_PropertyStub, JS_PropertyStub, JS_PropertyStub,
+    JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, JS_FinalizeStub
+};
+
+PRIVATE JSClass version_class = {
+    "VersionInfo", 0,
+    JS_PropertyStub, JS_PropertyStub, JS_PropertyStub, JS_PropertyStub,
+    JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, JS_FinalizeStub
+};
+
+JSBool lm_DefineTriggers()
+{
+	JSContext	*globalContext = NULL;
+	JSObject	*globalObject = NULL;
+	JSObject	*autoInstallObject, *versionObject;
+	JSBool          ans;
+
+	/* get global mocha context and object */
+    PREF_GetConfigContext(&globalContext);
+    PREF_GetGlobalConfigObject(&globalObject);
+
+    if (globalContext == NULL || globalObject == NULL)	{
+        return JS_FALSE;
+    }
+
+    JS_BeginRequest(globalContext);
+	/* define AutoInstall object in global object */
+	autoInstallObject = JS_DefineObject(globalContext, globalObject, 
+					    "AutoInstall",
+					    &autoinstall_class, 
+					    NULL, 
+					    JSPROP_ENUMERATE|JSPROP_READONLY);
+					    
+	if (!autoInstallObject)  {
+		JS_EndRequest(globalContext);
+		return JS_FALSE;
+	}
+
+	
+	/* define Version class in AutoInstall */
+    versionObject = JS_InitClass(globalContext, autoInstallObject, NULL,
+		        		&version_class, asd_Version, 0, NULL, NULL, NULL, NULL);
+	
+	if (!versionObject)  {
+		JS_EndRequest(globalContext);
+		return JS_FALSE;
+	}
+    
+    /* define some global config utility functions */
+    JS_DefineFunctions(globalContext, globalObject, globalconfig_methods);
+    
+    ans = JS_DefineFunctions(globalContext, autoInstallObject, 
+			     autoinstall_methods);
+    JS_EndRequest(globalContext);
+    return ans;
+}
+
+/* Convert VERSION type to Version JS object */
+static void asd_versToObj(JSContext *cx, VERSION* vers, JSObject* versObj)
+{
+	jsval val = INT_TO_JSVAL(vers->major);
+	JS_SetProperty(cx, versObj, "major", &val);
+	val = INT_TO_JSVAL(vers->minor);
+	JS_SetProperty(cx, versObj, "minor", &val);
+	val = INT_TO_JSVAL(vers->release);
+	JS_SetProperty(cx, versObj, "release", &val);
+	val = INT_TO_JSVAL(vers->build);
+	JS_SetProperty(cx, versObj, "build", &val);
+}
+
+/* Convert Version JS object to VERSION type */
+static void asd_objToVers(JSContext *cx, JSObject* versObj, VERSION* vers)
+{
+	jsval val;
+	JS_GetProperty(cx, versObj, "major", &val);
+	vers->major = JSVAL_TO_INT(val);
+	JS_GetProperty(cx, versObj, "minor", &val);
+	vers->minor = JSVAL_TO_INT(val);
+	JS_GetProperty(cx, versObj, "release", &val);
+	vers->release = JSVAL_TO_INT(val);
+	JS_GetProperty(cx, versObj, "build", &val);
+	vers->build = JSVAL_TO_INT(val);
+}
+
+/*
+ * ?? -- move this to VR?
+ * Returns 0 if versions are equal; < 0 if vers2 is newer; > 0 if vers1 is newer
+ */
+static int asd_compareVersion(VERSION* vers1, VERSION* vers2)
+{
+	int diff;
+	if (vers1 == NULL)
+		diff = -4;
+	else if (vers2 == NULL)
+		diff = 4;
+	else if (vers1->major == vers2->major) {
+		if (vers1->minor == vers2->minor) {
+			if (vers1->release == vers2->release) {
+				if (vers1->build == vers2->build) 
+					diff = 0;
+				else diff = (vers1->build > vers2->build) ? 1 : -1;
+			}
+			else diff = (vers1->release > vers2->release) ? 2 : -2;
+		}
+		else diff = (vers1->minor > vers2->minor) ? 3 : -3;
+	}
+	else diff = (vers1->major > vers2->major) ? 4 : -4;
+	return diff;
+}
+
+/* Version constructor
+   (accepts up to four int params to initialize fields) */
+JSBool PR_CALLBACK asd_Version
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	VERSION vers;
+	vers.major = (argc >= 1 && JSVAL_IS_INT(argv[0])) ? JSVAL_TO_INT(argv[0]) : 0;
+	vers.minor = (argc >= 2 && JSVAL_IS_INT(argv[1])) ? JSVAL_TO_INT(argv[1]) : 0;
+	vers.release = (argc >= 3 && JSVAL_IS_INT(argv[2])) ? JSVAL_TO_INT(argv[2]) : 0;
+	vers.build = (argc >= 4 && JSVAL_IS_INT(argv[3])) ? JSVAL_TO_INT(argv[3]) : 0;
+
+	asd_versToObj(cx, &vers, obj);
+    return JS_TRUE;
+}
+
+/* arguments:
+   0. component name
+   1. version no. to fill in
+   return:
+      error status */
+JSBool PR_CALLBACK asd_get_version
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	REGERR status = 0;
+	if (argc >= 2 && JSVAL_IS_STRING(argv[0])
+		&& JSVAL_IS_OBJECT(argv[1]))
+	{		
+		VERSION vers;
+		char* component_path = JS_GetStringBytes(JSVAL_TO_STRING(argv[0]));
+		status = VR_GetVersion(component_path, &vers);
+
+		if (status == REGERR_OK) {
+			JSObject* versObj = JSVAL_TO_OBJECT(argv[1]);
+			asd_versToObj(cx, &vers, versObj);
+		}
+	}
+	*rval = INT_TO_JSVAL(status);
+	return JS_TRUE;
+}
+
+/* arguments:
+   0. url
+   1. flags
+   return:
+      true if no errors */
+JSBool PR_CALLBACK asd_start_update
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	if (argc >= 2 && JSVAL_IS_STRING(argv[0]) &&
+		JSVAL_IS_INT(argv[1])) {
+		char* url = JS_GetStringBytes(JSVAL_TO_STRING(argv[0]));
+		/* Bookmarks is a hack, you should really get some SmartUpdate context */
+		MWContext* cx = XP_FindContextOfType(NULL, MWContextBookmarks);
+		
+		XP_Bool result = SU_StartSoftwareUpdate( cx, url,
+			NULL, NULL, NULL, JSVAL_TO_INT(argv[1]) );
+		*rval = BOOLEAN_TO_JSVAL(result);
+		return JS_TRUE;
+	}
+	*rval = BOOLEAN_TO_JSVAL(JS_FALSE);
+	return JS_TRUE;
+}
+
+/* arguments:
+   0. url
+   1. component name
+   2. version no. to compare
+   3. flags
+   return:
+      true if update triggered and no errors */
+JSBool PR_CALLBACK asd_conditional_update
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	REGERR status = 0;
+	if (argc >= 4 && JSVAL_IS_STRING(argv[0]) &&
+		JSVAL_IS_STRING(argv[1]) &&
+		JSVAL_IS_OBJECT(argv[2]) &&
+		JSVAL_IS_INT(argv[3]))
+	{
+		VERSION curr_vers;
+		char* component_path = JS_GetStringBytes(JSVAL_TO_STRING(argv[1]));
+		status = VR_GetVersion(component_path, &curr_vers);
+
+		if (status == REGERR_OK) {
+			JSObject* versObj = JSVAL_TO_OBJECT(argv[2]);
+			VERSION req_vers;
+			asd_objToVers(cx, versObj, &req_vers);
+			if ( asd_compareVersion(&req_vers, &curr_vers) > 0 ) {
+				char* url = JS_GetStringBytes(JSVAL_TO_STRING(argv[0]));
+				MWContext* cx = XP_FindContextOfType(NULL, MWContextBookmarks);
+
+				XP_Bool result = SU_StartSoftwareUpdate( cx, url,
+					NULL, NULL, NULL, JSVAL_TO_INT(argv[3]) );
+				*rval = BOOLEAN_TO_JSVAL(result);
+				return JS_TRUE;
+			}
+		}
+	}
+	*rval = BOOLEAN_TO_JSVAL(JS_FALSE);	/*INT_TO_JSVAL(status);*/
+	return JS_TRUE;
+}
+
+JSBool PR_CALLBACK asd_alert
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	if (argc >= 1 && JSVAL_IS_STRING(argv[0])) {
+		char* msg = JS_GetStringBytes(JSVAL_TO_STRING(argv[0]));
+		MWContext* ctx = XP_FindSomeContext();
+		
+		if (ctx)
+			FE_Alert(ctx, msg);
+	}
+	return JS_TRUE;
+}
+
+JSBool PR_CALLBACK asd_platform
+	(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval *rval)
+{
+	*rval = STRING_TO_JSVAL( JS_NewStringCopyZ(cx, XP_AppPlatform) );
+	return JS_TRUE;
+}
+

mozilla/lib/libmocha/lm_wngrp.c

@@ -0,0 +1,425 @@
+/*
+ * lm_wngrp.c: Structures and functions to deal with new LM window groups
+ *              and multiple LM threads and what not.
+ * 
+ * All blame to Mike McCool (mlm@netscape.com) 2/17/98
+ */
+
+#include "lm.h"
+#include "xp.h"
+#include "prclist.h"
+#include "prthread.h"
+#include "prmon.h"
+
+#ifdef XP_MAC
+#include "pprthred.h"  /* for PR_CreateThreadGCAble */
+#else
+#include "private/pprthred.h"
+#endif
+
+/* 
+ * Notes to self
+ * 
+ * - lm_window_count: do we care that there's only one? 
+ * - do we need to add a limit to number of threads we spawn()?
+ * - JRIEnv: do we need multiple?
+ * - JSRuntime: do we need multiple?
+ * - Threading changes: impact on debugger?
+ * - JS_SetGlobalObject(JSContext) will be important
+ * - If the global structure is on the mozilla thread, can other threads
+ *    creating a new thread group access, or do I have to post an event?
+ *
+ * ? Rename "MochaDecoder" to "LMWindow"
+ * ? Change so that there is only one JSContext
+ */
+
+PRMonitor *wingroups_mon;
+LMWindowGroup *wingroups;
+PRMonitor *request_mon;
+
+struct ContextListStr  {
+    ContextList *next;
+    ContextList *prev;
+    MWContext   *context;
+};
+
+LMWindowGroup *_lm_NewWindowGroup(int priority);
+
+/* Initialize my globals, from the Mozilla thread 
+ */
+void lm_InitWindowGroups(void)
+{
+    int priority;
+
+    /* run at slightly lower priority than the mozilla thread */
+    priority = PR_GetThreadPriority(PR_CurrentThread());
+    PR_ASSERT(priority >= PR_PRIORITY_FIRST && priority <= PR_PRIORITY_LAST);
+ 
+    if (priority == PR_PRIORITY_NORMAL)
+        priority = PR_PRIORITY_LOW;
+    else if (priority == PR_PRIORITY_HIGH)
+        priority = PR_PRIORITY_NORMAL;
+    else if (priority == PR_PRIORITY_URGENT)
+        priority = PR_PRIORITY_HIGH;
+    else
+        priority = PR_PRIORITY_LOW;
+
+    wingroups_mon = PR_NewMonitor();
+    request_mon = PR_NewMonitor();
+    wingroups = NULL;
+    wingroups = _lm_NewWindowGroup(priority);
+    if(wingroups != NULL)  {
+        PR_INIT_CLIST(wingroups);
+	lm_StartWindowGroup(wingroups);
+    }  /* else huh?! */
+}
+
+/* Create a new window group.  Create new context, create new monitor, create
+ *  new thread, event queue, queue stack, empty context list. 
+ */
+LMWindowGroup *lm_NewWindowGroup(void)
+{
+    int priority;
+
+    /* Run at same priority as current thread (which should be a JS 
+     * thread. 
+     */
+    priority = PR_GetThreadPriority(PR_CurrentThread());
+    PR_ASSERT(priority>=PR_PRIORITY_FIRST && priority<=PR_PRIORITY_LAST);
+    return _lm_NewWindowGroup(priority);
+}
+
+LMWindowGroup *_lm_NewWindowGroup(int priority)
+{
+    LMWindowGroup *newgrp = XP_NEW_ZAP(LMWindowGroup);
+    if(newgrp != NULL)  {
+        newgrp->done = PR_FALSE;
+        newgrp->hasLock = PR_FALSE;
+
+        /* Create a new JS Context for this set of windows. 
+         * Note: Need to get global runtime lm_runtime from somewhere, 
+         *        and perhaps the LM_STACK_SIZE? 
+         */
+/**************************************************** MLM *
+        newgrp->js_context = JS_NewContext(lm_runtime, LM_STACK_SIZE);
+        if(newgrp->js_context == NULL)  {
+            XP_DELETE(newgrp);
+            return NULL;
+        }
+ **************************************************** MLM */
+	newgrp->js_context = NULL;
+	/* JS_SetGCCallback(newgrp->js_context, LM_ShouldRunGC); */
+
+        newgrp->mw_contexts = XP_NEW_ZAP(ContextList);
+        if(newgrp->mw_contexts == NULL)  {
+            JS_DestroyContext(newgrp->js_context);
+            XP_DELETE(newgrp);
+            return NULL;
+        }
+        PR_INIT_CLIST(newgrp->mw_contexts);
+        newgrp->mw_contexts->context = NULL;
+        newgrp->current_context = NULL;
+
+        newgrp->queue_stack = XP_NEW_ZAP(QueueStackElement);
+        if(!newgrp->queue_stack)  {
+            JS_DestroyContext(newgrp->js_context);
+            XP_DELETE(newgrp->mw_contexts);
+            XP_DELETE(newgrp);
+            return NULL;
+        }
+
+        /* Do this here so we don't race ourselves in lm_wait_for_events */
+        PR_EnterMonitor(wingroups_mon);
+        if(wingroups != NULL)  {
+            PR_APPEND_LINK(newgrp, wingroups);
+        }
+        PR_ExitMonitor(wingroups_mon);
+
+        newgrp->waiting_list = NULL;
+
+        newgrp->owner_monitor = PR_NewMonitor();
+        newgrp->queue_monitor = PR_NewMonitor();
+
+        PR_EnterMonitor(newgrp->owner_monitor);
+        newgrp->thread = PR_CreateThreadGCAble(PR_USER_THREAD,
+                                               lm_wait_for_events, newgrp,
+                                               priority, PR_LOCAL_THREAD,
+                                               PR_UNJOINABLE_THREAD, 0);
+        newgrp->owner              = newgrp->thread;
+        newgrp->current_count      = 0;
+        newgrp->mozWantsLock       = PR_FALSE;
+        newgrp->mozGotLock         = PR_FALSE;
+        newgrp->interruptCurrentOp = PR_FALSE;
+        newgrp->queue_depth        = 0;
+        newgrp->queue_count        = 0;
+
+        /* Note: Need a unique identifier for this queue?
+         */
+        newgrp->interpret_queue = PR_CreateEventQueue("new_event_queue",
+                                                      newgrp->thread);
+        newgrp->queue_stack->queue = newgrp->interpret_queue;
+
+	newgrp->lock_context = NULL;
+	newgrp->js_timeout_insertion_point = NULL;
+	newgrp->js_timeout_running = NULL;
+	newgrp->inputRecurring = 0;
+    }
+    return newgrp;
+}
+
+void lm_StartWindowGroup(LMWindowGroup *grp)
+{
+    PR_Notify(grp->owner_monitor);
+    PR_ExitMonitor(grp->owner_monitor);
+}
+
+void lm_DestroyWindowGroup(LMWindowGroup *grp)
+{
+    PR_EnterMonitor(wingroups_mon);
+    /* Note: Thread terminates when the thread's main function (in
+     *        this case, lm_wait_for_events) exits.
+     */
+    /************************************ MLM *
+     * JS_DestroyContext(grp->js_context);
+     ************************************ MLM */
+    PR_DestroyMonitor(grp->owner_monitor);
+    PR_DestroyMonitor(grp->queue_monitor);
+    
+    /* Note: How to destroy an event queue or two?
+     */
+
+    /* Note: Context list should already be null
+     */
+
+    PR_REMOVE_LINK(grp);
+    XP_DELETE(grp);
+    PR_ExitMonitor(wingroups_mon);
+}
+
+LMWindowGroup *LM_GetDefaultWindowGroup(MWContext *mwc)
+{
+    LMWindowGroup *ans;
+
+    /* Check to see if this is a frame context.  If so, check its parent. */
+    if((mwc != NULL) && (mwc->is_grid_cell))  {
+        MWContext *grid_parent, *grid_child;
+	grid_child = mwc;
+	grid_parent = mwc->grid_parent;
+	/* Find the root parent.  I wonder if I need to add cycle checking. */
+	while(grid_parent != NULL)  {
+	    grid_child = grid_parent;
+	    grid_parent = grid_child->grid_parent;
+	}
+	if( (ans = lm_MWContextToGroup(grid_child)) != NULL)  {
+	    /* The parent's been found, return its group. */
+	    return ans;
+	}  else  {  /* Else add the parent to the default group, 
+		     *  and return that. */
+    	    PR_EnterMonitor(wingroups_mon);
+	    LM_AddContextToGroup(wingroups, grid_child);
+	    ans = wingroups;
+    	    PR_ExitMonitor(wingroups_mon);
+	    return ans;
+	}
+    }
+    PR_EnterMonitor(wingroups_mon);
+    ans = wingroups;
+    PR_ExitMonitor(wingroups_mon);
+    return ans;
+}
+
+LMWindowGroup *lm_MWContextToGroup(MWContext *mwc)
+{
+    LMWindowGroup *ptr = NULL;
+    LMWindowGroup *ans = NULL;
+
+    PR_EnterMonitor(wingroups_mon);
+
+    ptr = wingroups;
+ 
+    if(lm_GetEntryForContext(wingroups, mwc) != NULL)  {
+        ans = wingroups;
+        PR_ExitMonitor(wingroups_mon);
+        return ans;
+    }
+ 
+    ptr = PR_NEXT_LINK(ptr);
+    while(ptr != wingroups)  {
+        if(lm_GetEntryForContext(ptr, mwc) != NULL)  {
+            ans = ptr;
+            PR_ExitMonitor(wingroups_mon);
+            return ans;
+        }
+        ptr = PR_NEXT_LINK(ptr);
+    }
+    PR_ExitMonitor(wingroups_mon);
+    return NULL;
+}
+
+LMWindowGroup *lm_QueueStackToGroup(QueueStackElement *qse)
+{
+    LMWindowGroup *ptr = NULL;
+    LMWindowGroup *ans = NULL;
+
+    PR_EnterMonitor(wingroups_mon);
+    ptr = wingroups;
+ 
+    if(wingroups->queue_stack == qse)  {
+        ans = wingroups;
+        PR_ExitMonitor(wingroups_mon);
+        return ans;
+    }
+ 
+    ptr = PR_NEXT_LINK(ptr);
+    while(ptr != wingroups)  {
+        if(ptr->queue_stack == qse)  {
+            ans = ptr;
+            PR_ExitMonitor(wingroups_mon);
+            return ans;
+        }
+        ptr = PR_NEXT_LINK(ptr);
+    }
+    PR_ExitMonitor(wingroups_mon);
+    return NULL;
+}
+
+PREventQueue *LM_MWContextToQueue(MWContext *mwc)
+{
+    /* Note: This gets the interpret queue, need to get top queue as well
+     */
+    LMWindowGroup *grp = lm_MWContextToGroup(mwc);
+    if(grp != NULL)  {
+        return LM_WindowGroupToQueue(grp);
+    }
+    return NULL;
+}
+
+PREventQueue *LM_WindowGroupToQueue(LMWindowGroup *lmg)
+{
+    return lmg->interpret_queue;
+}
+
+ContextList *lm_GetEntryForContext(LMWindowGroup *grp, MWContext *cx)
+{
+    ContextList *cxl = grp->mw_contexts;
+    ContextList *ans = NULL;
+
+    if(PR_CLIST_IS_EMPTY(cxl))  {
+        return NULL;
+    }  else  {
+        ContextList *ptr = PR_NEXT_LINK(cxl);
+        while(ptr != cxl)  {
+            if(ptr->context == cx)  {
+                ans = ptr;
+                break;
+            }
+            ptr = PR_NEXT_LINK(ptr);
+        }
+    }
+    return ans;
+}
+
+void LM_AddContextToGroup(LMWindowGroup *grp, MWContext *cx)
+{
+    ContextList *cxl;
+
+    if(lm_MWContextToGroup(cx) != NULL)  {
+        /* Hey, why are we adding this stuff twice? */
+        XP_ASSERT(0);
+    }
+
+    cxl = XP_NEW_ZAP(ContextList);
+    /* Note: failure?!?!?!
+     */
+    cxl->context = cx;
+
+    PR_APPEND_LINK(cxl, grp->mw_contexts);
+}
+
+void lm_RemoveContextFromGroup(LMWindowGroup *grp, MWContext *cx);
+
+void LM_RemoveContextFromGroup(MWContext *cx)
+{
+    LMWindowGroup *grp = lm_MWContextToGroup(cx);
+    if(grp)  {
+        lm_RemoveContextFromGroup(grp, cx);
+    }
+}
+
+void lm_RemoveContextFromGroup(LMWindowGroup *grp, MWContext *cx)
+{
+    if(!PR_CLIST_IS_EMPTY(grp->mw_contexts))  {
+        ContextList *entry = lm_GetEntryForContext(grp, cx);
+        if(entry != NULL)  {
+            PR_REMOVE_LINK(entry);
+            XP_DELETE(entry);
+        }
+    }
+    if(PR_CLIST_IS_EMPTY(grp->mw_contexts) && (grp != wingroups))  {
+        grp->done = PR_TRUE;
+    }
+}
+
+PRBool LM_IsLocked(LMWindowGroup *grp)
+{
+    PRBool ans;
+    PR_EnterMonitor(request_mon);
+    ans = grp->hasLock;
+    PR_ExitMonitor(request_mon);
+    return ans;
+}
+
+void LM_BeginRequest(LMWindowGroup *grp, JSContext *jsc)
+{
+    PR_EnterMonitor(request_mon);
+    grp->hasLock = PR_TRUE;
+    grp->lock_context = jsc;
+    if((JS_GetContextThread(jsc)) != ((intN) grp->thread))  {
+        JS_SetContextThread(jsc);
+    }
+    PR_ExitMonitor(request_mon);
+    JS_BeginRequest(jsc);
+}
+
+void LM_EndRequest(LMWindowGroup *grp, JSContext *jsc)
+{
+    JS_EndRequest(jsc);
+    PR_EnterMonitor(request_mon);
+    grp->lock_context = NULL;
+    grp->hasLock = PR_FALSE;
+    PR_ExitMonitor(request_mon);
+}
+
+JSBool LM_ShouldRunGC(JSContext *cx, JSGCStatus status)
+{
+    JSBool ans = JS_TRUE;
+    JSContext *active;
+    LMWindowGroup *ptr;
+
+    if(status != JSGC_BEGIN)  {
+        return JS_TRUE;
+    }
+
+    PR_EnterMonitor(request_mon);
+    if(wingroups->hasLock)  {
+        active = wingroups->lock_context;
+        if(active != cx)  {
+            ans=JS_FALSE;
+	    goto bye;
+        }
+    }
+    ptr = PR_NEXT_LINK(wingroups);
+    while(ptr != wingroups)  {
+        if(ptr->hasLock)  {
+            active = ptr->lock_context;
+            if(active != cx)  {
+                ans=JS_FALSE;
+		goto bye;
+            }
+	}
+        ptr = PR_NEXT_LINK(ptr);
+    }
+bye:
+    PR_ExitMonitor(request_mon);
+    return ans;
+}

mozilla/lib/libnet/jscookie.c

@@ -0,0 +1,617 @@
+/* -*- Mode: C++; tab-width: 8; 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.
+ */
+/*
+   jscookie.c -- javascript reflection of cookies for filters.
+   Created: Frederick G.M. Roeber <roeber@netscape.com>, 12-Jul-97.
+   Adopted: Judson Valeski, 1997.
+   Large chunks of this were stolen from jsmsg.c.
+ */
+
+#include "mkutils.h"
+#include "mkutils.h"
+#include "mkparse.h"
+#include "mkaccess.h"
+#include "prefapi.h"
+#include "jsapi.h"
+#include "xp_core.h"
+#include "xp_mcom.h"
+#include "jscookie.h"
+#include "ds.h"
+#include "htmldlgs.h"
+#include "xpgetstr.h"
+
+extern int MK_ACCESS_JAVASCRIPT_COOKIE_FILTER;
+
+static JSObject *filter_obj = NULL;
+static JSContext *filter_context = NULL;
+
+static JSBool error_reporter_installed = JS_FALSE;
+static JSErrorReporter previous_error_reporter;
+
+/* tells us when we should recompile the file. */
+static JSBool need_compile = JS_TRUE;
+
+/* This is the private instance data associated with a cookie */
+typedef struct JSCookieData {
+    JSContext *js_context;
+    JSObject *js_object;
+    JSCFCookieData *data;
+    PRPackedBool property_changed, rejected, accepted, ask, decision_made;
+} JSCookieData;
+
+/* The properties of a cookie that we reflect */
+enum cookie_slot {
+    COOKIE_PATH			= -1,
+    COOKIE_DOMAIN		= -2,
+    COOKIE_NAME			= -3,
+    COOKIE_VALUE		= -4,
+    COOKIE_EXPIRES		= -5,
+    COOKIE_URL			= -6,
+    COOKIE_IS_SECURE		= -7,
+    COOKIE_IS_DOMAIN		= -8,
+    COOKIE_PROMPT_PREF		= -9,
+    COOKIE_PREF			= -10
+};
+
+/* 
+ * Should more of these be readonly? What does it mean for a cookie
+ *   to de secure?  -chouck
+ */
+static JSPropertySpec cookie_props[] = {
+    { "path",       COOKIE_PATH,        JSPROP_ENUMERATE },
+    { "domain",     COOKIE_DOMAIN,      JSPROP_ENUMERATE },
+    { "name",       COOKIE_NAME,        JSPROP_ENUMERATE },
+    { "value",      COOKIE_VALUE,       JSPROP_ENUMERATE },
+    { "expires",    COOKIE_EXPIRES,     JSPROP_ENUMERATE },
+    { "url",        COOKIE_URL,         JSPROP_ENUMERATE|JSPROP_READONLY },
+    { "isSecure",   COOKIE_IS_SECURE,   JSPROP_ENUMERATE },
+    { "isDomain",   COOKIE_IS_DOMAIN,   JSPROP_ENUMERATE },
+    { "prompt",     COOKIE_PROMPT_PREF, JSPROP_ENUMERATE|JSPROP_READONLY },
+    { "preference", COOKIE_PREF,        JSPROP_ENUMERATE|JSPROP_READONLY },
+    { 0 }
+};
+
+PR_STATIC_CALLBACK(JSBool)
+cookie_getProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSCookieData *data;
+    JSString *str;
+    jsint slot;
+
+    data = (JSCookieData *)JS_GetPrivate(cx, obj);
+    if (!data)
+	return JS_TRUE;
+
+    if (!JSVAL_IS_INT(id))
+        return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+    switch (slot) {
+    case COOKIE_PATH:
+        str = JS_NewStringCopyZ(cx, (const char *)data->data->path_from_header);
+        if( (JSString *)0 == str )
+            return JS_FALSE;
+        *vp = STRING_TO_JSVAL(str);
+        break;
+    case COOKIE_DOMAIN:
+        str = JS_NewStringCopyZ(cx, (const char *)data->data->host_from_header);
+        if( (JSString *)0 == str )
+            return JS_FALSE;
+        *vp = STRING_TO_JSVAL(str);
+        break;
+    case COOKIE_NAME:
+        str = JS_NewStringCopyZ(cx, (const char *)data->data->name_from_header);
+        if( (JSString *)0 == str )
+            return JS_FALSE;
+        *vp = STRING_TO_JSVAL(str);
+        break;
+    case COOKIE_VALUE:
+        str = JS_NewStringCopyZ(cx, (const char *)data->data->cookie_from_header);
+        if( (JSString *)0 == str )
+            return JS_FALSE;
+        *vp = STRING_TO_JSVAL(str);
+        break;
+    case COOKIE_EXPIRES:
+        *vp = INT_TO_JSVAL(data->data->expires);
+        break;
+    case COOKIE_URL:
+        str = JS_NewStringCopyZ(cx, (const char *)data->data->url);
+        if( (JSString *)0 == str )
+            return JS_FALSE;
+        *vp = STRING_TO_JSVAL(str);
+        break;
+    case COOKIE_IS_SECURE:
+        *vp = BOOLEAN_TO_JSVAL(data->data->secure);
+        break;
+    case COOKIE_IS_DOMAIN:
+        *vp = BOOLEAN_TO_JSVAL(data->data->domain);
+        break;
+    case COOKIE_PROMPT_PREF:
+        *vp = BOOLEAN_TO_JSVAL(data->data->prompt);
+        break;
+    case COOKIE_PREF:
+        *vp = INT_TO_JSVAL(data->data->preference);
+        break;
+    }
+
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(JSBool)
+cookie_setProperty(JSContext *cx, JSObject *obj, jsval id, jsval *vp)
+{
+    JSCookieData *data;
+    jsint slot;
+    PRInt32 i;
+    JSBool b;
+
+    data = (JSCookieData *)JS_GetPrivate(cx, obj);
+    if (!data)
+		return JS_TRUE;
+
+    if (!JSVAL_IS_INT(id))
+        return JS_TRUE;
+
+    slot = JSVAL_TO_INT(id);
+
+	if (slot == COOKIE_PATH) {
+		data->data->path_from_header = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+	} 
+	else if (slot == COOKIE_DOMAIN) {
+		data->data->host_from_header = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+	}
+	else if (slot == COOKIE_NAME) {
+		data->data->name_from_header = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+	}
+	else if (slot == COOKIE_VALUE) {
+		data->data->cookie_from_header = JS_GetStringBytes(JSVAL_TO_STRING(*vp));
+	}
+	else if (slot == COOKIE_EXPIRES) {
+		if( !JS_ValueToInt32(cx, *vp, (long *)&i) )
+            return JS_FALSE;
+        data->data->expires = i;
+	}
+	else if (slot == COOKIE_IS_SECURE) {
+        if( !JS_ValueToBoolean(cx, *vp, &b) )
+            return JS_FALSE;
+        data->data->secure = b;		
+	}
+	else if (slot == COOKIE_IS_DOMAIN) {
+        if( !JS_ValueToBoolean(cx, *vp, &b) )
+            return JS_FALSE;
+        data->data->domain = b;		
+	}
+
+    data->property_changed = TRUE;
+    return JS_TRUE;
+}
+
+PR_STATIC_CALLBACK(void)
+cookie_finalize(JSContext *cx, JSObject *obj)
+{
+    JSCookieData *cookie;
+    cookie = JS_GetPrivate(cx, obj);
+    FREEIF(cookie);
+}
+
+/* So we can possibly add functions "global" to filters... */
+static JSClass global_class = {
+    "CookieFilters", 0 /* no private data */,
+    JS_PropertyStub, JS_PropertyStub, JS_PropertyStub, JS_PropertyStub,
+    JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, JS_FinalizeStub
+};
+
+static JSClass js_cookie_class = {
+    "Cookie", JSCLASS_HAS_PRIVATE,
+    JS_PropertyStub, JS_PropertyStub, cookie_getProperty, cookie_setProperty,
+    JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, cookie_finalize
+};
+
+/* cookie.accept() -- mark it okay */
+PR_STATIC_CALLBACK(JSBool)
+cookie_accept(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval * rval)
+{
+    JSCookieData *data;
+
+    if (!(data = (JSCookieData*)JS_GetInstancePrivate(cx, obj, &js_cookie_class, argv)))
+        return JS_FALSE;
+
+    data->accepted = TRUE;
+    data->rejected = FALSE;
+    data->ask = FALSE;
+    data->decision_made = TRUE;
+
+    return JS_TRUE;
+}
+
+/* cookie.reject() -- reject it out of hand */
+PR_STATIC_CALLBACK(JSBool)
+cookie_reject(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval * rval)
+{
+    JSCookieData *data;
+
+    if (!(data = (JSCookieData*)JS_GetInstancePrivate(cx, obj, &js_cookie_class, argv)))
+        return JS_FALSE;
+
+    data->accepted = FALSE;
+    data->rejected = TRUE;
+    data->ask = FALSE;
+    data->decision_made = TRUE;
+
+    return JS_TRUE;
+}
+
+/* cookie.ask() -- ask the luser, even if that pref is off */
+PR_STATIC_CALLBACK(JSBool)
+cookie_ask(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval * rval)
+{
+    JSCookieData *data;
+
+    if (!(data = (JSCookieData*)JS_GetInstancePrivate(cx, obj, &js_cookie_class, argv)))
+        return JS_FALSE;
+
+    data->accepted = FALSE;
+    data->rejected = FALSE;
+    data->ask = TRUE;
+    data->decision_made = TRUE;
+
+    return JS_TRUE;
+}
+
+/* cookie.confirm() -- pop up a confirmation box */
+PR_STATIC_CALLBACK(JSBool)
+cookie_confirm(JSContext *cx, JSObject *obj, uint argc, jsval *argv, jsval * rval)
+{
+    JSCookieData *data;
+    JSString *str;
+    char *msg = (char *)0;
+    Bool result;
+    MWContext * context = XP_FindSomeContext();
+
+    if (argc < 1 || !context)
+        return JS_FALSE;
+
+    if (!(data = (JSCookieData*)JS_GetInstancePrivate(cx, obj, &js_cookie_class, argv)))
+        return JS_FALSE;
+
+    str = JS_ValueToString(cx, argv[0]);
+    if (!str)
+        return JS_FALSE;
+
+    StrAllocCopy(msg, XP_GetString(MK_ACCESS_JAVASCRIPT_COOKIE_FILTER));
+    StrAllocCat(msg, JS_GetStringBytes(str));
+    if (!msg)
+        return JS_FALSE;
+
+    result = FE_Confirm(context, msg);
+    FREEIF(msg);
+
+    *rval = BOOLEAN_TO_JSVAL(result);
+
+    return JS_TRUE;
+}
+
+#if DEBUG
+/* trace() -- outputs spew to stderr.  Actually, this (or something like it
+   that perhaps outputs to the same file that the rest of the filter logging code
+   writes to) would probably be very useful in the normal course of writing filters. */
+PR_STATIC_CALLBACK(JSBool)
+cookie_filter_trace(JSContext *cx, JSObject * obj, uint argc, jsval *argv, jsval * rval)
+{
+
+        if (argc > 0)
+                {
+                        JSString *str;
+                        const char *trace_str;
+                        if (!(str = JS_ValueToString(cx, argv[0])))
+                                return JS_FALSE;
+
+                        trace_str = JS_GetStringBytes(str);
+                        if (*trace_str != '\0')
+                                {
+                                        fprintf (stderr, "cookie filter trace: %s\n", trace_str);
+                                }
+                        return JS_TRUE;
+                }
+
+        return JS_FALSE;
+}
+#endif
+
+static JSFunctionSpec cookie_methods[] = {
+    { "accept", cookie_accept, 0 },
+    { "reject", cookie_reject, 0 },
+    { "ask",    cookie_ask, 0 },
+    { "confirm", cookie_confirm, 1 },
+    { 0 }
+};
+
+static JSFunctionSpec filter_methods[] = {
+#ifdef DEBUG
+    { "trace", cookie_filter_trace, 1 },
+#endif
+    { 0 }
+};
+
+PRIVATE void
+destroyJSCookieFilterStuff(void)
+{
+        filter_obj = NULL;
+}
+
+/*
+ * This function used to take an MWContext and store it as the private data
+ *   of the filter object.  That is a no-no since the filter_obj is going to
+ *   be around until the end of time but there is no guarentee that the
+ *   context won't get free'd out from under us.  The solution is to not
+ *   hold onto any particular context but just call XP_FindSomeContext() or
+ *   some derivative of it when we need to.
+ */
+PRIVATE JSContext *
+initializeJSCookieFilterStuff()
+{
+
+    /* Only bother initializing once */
+    if (filter_obj)
+        return filter_context;
+
+    /* If we can't get the mozilla-thread global context just bail */
+    PREF_GetConfigContext(&filter_context);
+    if (!filter_context)
+        return NULL;
+
+    JS_BeginRequest(filter_context);
+    /* create our "global" object.  We make the message object a child of this */
+    filter_obj = JS_NewObject(filter_context, &global_class, NULL, NULL);
+    
+    /* MLM - don't do JS_InitStandardClasses() twice */
+    if (!filter_obj
+            || !JS_DefineFunctions(filter_context, filter_obj, filter_methods))
+            {
+                JS_EndRequest(filter_context);
+                destroyJSCookieFilterStuff();
+                return NULL;
+            }
+
+    JS_EndRequest(filter_context);
+    return filter_context;
+}
+
+PRIVATE JSObject *
+newCookieObject(void)
+{
+    JSObject *rv;
+    JSCookieData *cookie_data;
+
+    rv = JS_DefineObject(filter_context, filter_obj,
+                         "cookie", &js_cookie_class,
+                         NULL, JSPROP_ENUMERATE);
+
+    if( (JSObject *)0 == rv )
+        return (JSObject *)0;
+
+    cookie_data = XP_NEW_ZAP(JSCookieData);
+
+    if( (JSCookieData *)0 == cookie_data )
+        return (JSObject *)0;
+
+    if( !JS_SetPrivate(filter_context, rv, cookie_data)
+        || !JS_DefineProperties(filter_context, rv, cookie_props)
+        || !JS_DefineFunctions(filter_context, rv, cookie_methods)) {
+        return (JSObject *)0;
+    }
+
+    return rv;
+}
+
+PR_STATIC_CALLBACK(void)
+jscookie_ErrorReporter(JSContext *cx, const char *message, JSErrorReport *report)
+{
+    char *msg = NULL;
+    MWContext *context;
+    
+    context = XP_FindSomeContext();
+    if(!context || !report)
+        return;
+
+    /*XXX: i18n-ise this */
+    msg = PR_sprintf_append(NULL,
+                            "JavaScript Cookie Filter Error:\n"
+                            "You will be prompted manually to accept or reject this cookie.\n"
+                            "Filename: %s\n"
+                            "Line #: %u\n"
+                            "%s\n"
+                            "%.*s\n",
+                            report->filename, 
+                            report->lineno, 
+                            report->linebuf,
+                            (int)(report->tokenptr - report->linebuf) + 1,
+                            "^"
+                            );
+
+    if (!msg)
+        return;
+
+    FE_Alert(context, msg);
+    XP_FREE(msg);
+
+    return;
+}
+
+PRIVATE JSBool
+compileJSCookieFilters(void)
+{
+    static time_t m_time = 0; /* the last modification time of filters.js */
+    static JSBool ret_val = JS_FALSE;
+    char *filename;
+    XP_File fp;
+    XP_StatStruct stats;
+
+    if (!need_compile)
+        return ret_val;
+
+    filename = WH_FileName("", xpJSCookieFilters);
+
+    XP_Trace("+Filename for script filter is %s\n", filename);
+
+	/* If we can't get to the file, get the hell outa dodge. */
+    if(XP_Stat(filename, &stats, xpJSCookieFilters))
+		return ret_val;
+
+    if (stats.st_mtime > m_time || need_compile)
+        {
+            long fileLength;
+            char *buffer;
+            jsval rval;
+            
+            m_time = stats.st_mtime;
+            
+            fileLength = stats.st_size;
+            if (fileLength <= 1)
+                    {
+                            ret_val = JS_FALSE;
+                            return ret_val;
+                    }
+            
+            if( !(fp = XP_FileOpen(filename, xpJSCookieFilters, "r")) ) {
+					    ret_val = JS_FALSE;
+					    return ret_val;
+				    }
+            
+            buffer = (char*)malloc(fileLength);
+            if (!buffer) {
+                XP_FileClose(fp);
+                ret_val = JS_FALSE;
+                return ret_val;
+            }
+            
+            fileLength = XP_FileRead(buffer, fileLength, fp);
+
+            XP_FileClose(fp);
+
+            XP_Trace("+Compiling filters.js...\n");
+
+            ret_val = JS_EvaluateScript(filter_context, filter_obj, buffer, fileLength,
+                                                                    filename, 1, &rval);
+
+            XP_Trace("+Done.\n");
+            
+            XP_FREE(buffer);
+
+            need_compile = JS_FALSE;
+        }
+
+    return ret_val;
+}
+
+PUBLIC JSCFResult 
+JSCF_Execute(
+                               MWContext *mwcontext,
+                               const char *script_name,
+                               JSCFCookieData *data,
+                               Bool *data_changed
+                               )
+{
+    jsval result;
+    jsval filter_arg; /* we will this in with the message object we create. */
+    JSObject *cookie_obj;
+    JSCookieData *cookie_data;
+
+    if (!script_name)
+        return JSCF_error;
+
+	/* initialize the filter stuff, and bomb out early if it fails */
+    if (!initializeJSCookieFilterStuff())
+        return JSCF_error;
+
+    JS_BeginRequest(filter_context);
+
+    /* 
+	 * try loading (reloading if necessary) the filter file before bothering 
+	 *   to create any JS-objects
+	 */
+    if (!compileJSCookieFilters())  {
+	JS_EndRequest(filter_context);
+        return JSCF_error;
+    }
+
+    if (!error_reporter_installed)
+        {
+            error_reporter_installed = JS_TRUE;
+            previous_error_reporter = JS_SetErrorReporter(filter_context,
+                                                          jscookie_ErrorReporter);
+        }
+
+
+    cookie_obj = newCookieObject();
+    if( (JSObject *)0 == cookie_obj )  {
+	JS_EndRequest(filter_context);
+        return JSCF_error;
+    }
+
+    cookie_data = (JSCookieData *)JS_GetPrivate(filter_context, cookie_obj);
+    cookie_data->js_context = filter_context;
+    cookie_data->js_object = cookie_obj;
+    cookie_data->data = data;
+    cookie_data->property_changed = FALSE;
+    cookie_data->rejected = FALSE;
+    cookie_data->accepted = FALSE;
+    cookie_data->decision_made = FALSE;
+
+    filter_arg = OBJECT_TO_JSVAL(cookie_obj);
+    JS_CallFunctionName(filter_context, filter_obj, script_name, 1, 
+                        &filter_arg, &result);
+
+    JS_EndRequest(filter_context);
+
+    *data_changed = cookie_data->property_changed;
+    if( cookie_data->decision_made ) {
+        if( cookie_data->rejected )
+            return JSCF_reject;
+        else if( cookie_data->accepted )
+            return JSCF_accept;
+        else if( cookie_data->ask )
+            return JSCF_ask;
+    }
+
+    return JSCF_whatever;
+}
+
+PUBLIC void
+JSCF_Cleanup(void)
+{
+    TRACEMSG(("+Cleaning up JS Cookie Filters"));
+
+    need_compile = JS_TRUE;
+
+    if (filter_context)
+    {
+	JS_BeginRequest(filter_context);
+        if (error_reporter_installed)
+            {
+                error_reporter_installed = JS_FALSE;
+                JS_SetErrorReporter(filter_context, previous_error_reporter);
+            }
+
+        JS_GC(filter_context);
+
+        destroyJSCookieFilterStuff();
+	JS_EndRequest(filter_context);
+	}
+}

mozilla/lib/libnet/mkmocha.c

@@ -0,0 +1,751 @@
+/* -*- 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.
+ */
+
+/* Please leave at the top for windows precompiled headers */
+#include "mkutils.h"
+
+#include <stddef.h>
+#include <memory.h>
+#include <time.h>
+#include "net.h"
+#include "xp.h"
+#include "libmocha.h"
+#include "mkgeturl.h"
+#include "mkmocha.h"
+#include "libevent.h"
+#include "fe_proto.h"
+#include "pa_tags.h"	/* included via -I../libparse */
+#include "libi18n.h"    /* unicode */
+#include "layout.h"	/* for lo_ContextToCell only */
+
+extern char lm_unknown_origin_str[];
+
+extern int MK_OUT_OF_MEMORY;
+extern int MK_MALFORMED_URL_ERROR;
+
+typedef struct {
+    char *	  buffer;
+    size_t	  offset;
+    size_t  	  length;
+    MWContext	* context;
+    char	* content_type;
+    int16	  char_set;
+} MochaStream;
+
+typedef struct {
+    int32             ref_count;
+    ActiveEntry     * active_entry;
+    PRPackedBool      is_valid;
+    PRPackedBool      eval_what;
+    PRPackedBool      single_shot;
+    PRPackedBool      polling;
+    char            * str;
+    size_t            len;
+    MWContext       * context;
+    int               status;
+    char            * wysiwyg_url;
+    char	    * base_href;
+    NET_StreamClass * stream;
+} MochaConData;
+
+#define HOLD_CON_DATA(con_data) ((con_data)->ref_count++)
+#define DROP_CON_DATA(con_data) {                                             \
+    if (--(con_data)->ref_count == 0)                                         \
+	free_con_data(con_data);                                              \
+}
+
+static void
+free_con_data(MochaConData * con_data)
+{
+    XP_FREEIF(con_data->str);
+    XP_FREEIF(con_data->wysiwyg_url);
+    XP_FREEIF(con_data->base_href);
+    XP_FREE(con_data);
+}
+
+#define START_POLLING(ae, con_data) {                                         \
+    (con_data)->polling = TRUE;                                               \
+    NET_SetCallNetlibAllTheTime((ae)->window_id, "mkmocha");                              \
+}
+
+#define STOP_POLLING(ae, con_data) {                                          \
+	NET_ClearCallNetlibAllTheTime((ae)->window_id, "mkmocha");                        \
+    (con_data)->polling = FALSE;                                              \
+}
+
+/* forward decl */
+PRIVATE int32 net_ProcessMocha(ActiveEntry * ae);
+
+/*
+ * Add the new bits to our buffer
+ */
+PRIVATE int
+mocha_process(NET_StreamClass *stream, const char *str, int32 len)
+{
+    MochaStream * mocha_stream = (MochaStream *) stream->data_object;
+
+    mocha_stream->length += len;
+    if (!mocha_stream->buffer) {
+        mocha_stream->buffer = (char *)XP_ALLOC(mocha_stream->length);
+    } 
+    else {
+        mocha_stream->buffer = (char *)XP_REALLOC(mocha_stream->buffer, 
+						  mocha_stream->length);
+    }
+    if (!mocha_stream->buffer) {
+        return MK_OUT_OF_MEMORY;
+    }
+    memcpy(mocha_stream->buffer + mocha_stream->offset, str, len);
+    mocha_stream->offset += len;
+    return len;
+}
+
+PRIVATE unsigned int
+mocha_ready(NET_StreamClass *stream)
+{
+    return MAX_WRITE_READY;  /* always ready for writing */
+}
+
+
+/*
+ * All of the processing for this needs to be done in the mocha thread
+ */
+PRIVATE void 
+mocha_complete(NET_StreamClass *stream)
+{
+    void * data;
+    JSBool isUnicode = JS_FALSE;
+
+    MochaStream * mocha_stream = (MochaStream *) stream->data_object;
+
+    if (mocha_stream->char_set != CS_DEFAULT) {
+	uint32 len;
+	INTL_Unicode * unicode;
+
+	/* find out how many unicode characters we'll end up with */
+	len = INTL_TextToUnicodeLen(mocha_stream->char_set, 
+				    (unsigned char *) mocha_stream->buffer,
+				    mocha_stream->length);
+	unicode = XP_ALLOC(sizeof(INTL_Unicode) * len);
+	if (!unicode)
+	    return;
+
+	/* do the conversion */
+	mocha_stream->length = INTL_TextToUnicode(mocha_stream->char_set,
+						  (unsigned char *) mocha_stream->buffer,
+						  mocha_stream->length,
+						  unicode,
+						  len);
+
+	data = unicode;
+	isUnicode = JS_TRUE;
+
+	XP_FREE(mocha_stream->buffer);
+	mocha_stream->buffer = NULL;
+    }
+    else {
+	data = mocha_stream->buffer;
+    }
+
+    /* this will grab ownership of data */
+    ET_MochaStreamComplete(mocha_stream->context, data, 
+			   mocha_stream->length, 
+			   mocha_stream->content_type,
+			   isUnicode);
+
+    XP_FREEIF(mocha_stream->content_type);
+    XP_FREE(mocha_stream);
+
+}
+
+PRIVATE void 
+mocha_abort(NET_StreamClass *stream, int status)
+{
+    MochaStream * mocha_stream = (MochaStream *) stream->data_object;
+
+    ET_MochaStreamAbort(mocha_stream->context, status);
+    XP_FREE(mocha_stream->buffer);
+	XP_FREEIF(mocha_stream->content_type);
+    XP_FREE(mocha_stream);
+}
+
+int16
+net_check_for_charset(URL_Struct *url_struct)
+{
+    int i, max;
+    char *key, *value;
+    static char charset[] = "charset=";
+    int len = XP_STRLEN(charset);
+    
+    max = url_struct->all_headers.empty_index;
+
+    for (i = 0; i < max; i++) {
+	key = url_struct->all_headers.key[i];
+
+	/* keep looking until we find the content type one */
+	if (XP_STRCASECMP(key, "Content-type"))
+	    continue;
+
+	value = url_struct->all_headers.value[i];
+
+	/* don't bother unless this is a JS file to begin with */
+	if (!strcasestr(value, APPLICATION_JAVASCRIPT))
+	    return CS_DEFAULT;
+
+	value = XP_STRTOK(value, ";");
+	while (value) {
+	    value = XP_StripLine(value);
+
+	    if (!strncasecomp(value, charset, len)) {
+		value += len;
+		value = XP_StripLine(value);
+		return (INTL_CharSetNameToID(value));
+	    }
+
+	    /* move to next arg */
+	    value = XP_STRTOK(NULL, ";");
+
+	}
+
+	/* found content-type but no charset */
+	return CS_DEFAULT;
+
+    }
+
+    /* didn't find content-type */
+    return CS_DEFAULT;
+}
+
+static char *
+getOriginFromURLStruct(MWContext *context, URL_Struct *url_struct) 
+{
+    char *referer;
+    /*
+     * Look in url_struct->origin_url for this javascript: URL's
+     * original referrer.
+     *
+     * In the basis case, a javascript: or *.js URL targets a context
+     * from a (the same, or not) context loaded with a non-javascript URL.
+     * The referring document's URL is in url_struct->referer and we
+     * duplicate it as origin_url.  If we find a non-null origin_url
+     * later, we know by induction where it came from.
+     */
+    referer = url_struct->origin_url;
+    if (referer == NULL) {
+        /*
+         * url_struct->referer (sic) tells the URL of the page in
+         * which a javascript: or *.js link or form was clicked or submitted.
+         * If it's non-null, but the context is a frame cell that's
+         * being (re-)created for this load, don't use referer as the
+         * decoder's source URL for the evaluation, because the FE has
+         * arbitrarily set it to the top frameset's URL.  Instead, use
+         * the immediate parent frameset context's wysiwyg URL to get
+         * the origin of the generator (or the parent's address URL if
+         * not wysiwyg).
+         *
+         * If referer is null, the user typed this javascript: URL or
+         * its frameset's URL directly into the Location toolbar.
+         */
+        referer = url_struct->referer;
+        if (referer) {
+	    lo_GridRec *grid = NULL;
+
+	    if (context->is_grid_cell &&
+	        !lo_ContextToCell(context, FALSE, &grid)) {
+	        /*
+	         * Context is a frame being (re)created: veto referer.
+	         * The javascript: or *.js URL can't be a LAYER SRC= URL in a
+	         * frame because the frame's cell must point to its
+	         * context by the time the first tag (even LAYER) is
+	         * processed by layout.
+	         */
+	        referer = NULL;
+	    }
+        }
+        if (!referer) {
+	    History_entry *he;
+
+	    if (context->grid_parent) {
+	        /*
+	         * If grid parent, use its history entry to get the
+	         * wysiwyg or real URL, which tells the subject origin
+	         * of (any code in it that may have generated) this
+	         * javascript: or *.js URL open.  If no grid parent, this must
+	         * be a javascript: or *.js URL that was typed directly into
+	         * Location.
+	         */
+	        context = context->grid_parent;
+	    }
+	    he = SHIST_GetCurrent(&context->hist);
+	    if (!he) {
+	        referer = lm_unknown_origin_str;
+	    } else {
+	        referer = he->wysiwyg_url;
+	        if (!referer)
+		    referer = he->address;
+	    }
+        }
+    }
+
+    XP_ASSERT(referer);
+    referer = XP_STRDUP(referer);
+    if (!referer) {
+	return NULL;
+    }
+    url_struct->origin_url = referer;
+    return referer;
+}
+
+NET_StreamClass *
+NET_CreateMochaConverter(FO_Present_Types format_out,
+                         void             *data_object,
+                         URL_Struct       *url_struct,
+                         MWContext        *context)
+{
+    MochaStream * mocha_stream;
+    NET_StreamClass *stream;
+    char *origin;
+
+    mocha_stream = (MochaStream *) XP_NEW_ZAP(MochaStream);
+    if (!mocha_stream)
+	return NULL;
+
+    mocha_stream->context = context;
+    mocha_stream->content_type = XP_STRDUP(url_struct->content_type);
+    mocha_stream->char_set = net_check_for_charset(url_struct);
+
+    /* Get the origin from the URL struct. We don't have to free origin
+     * here because url_struct->origin_url owns it.
+     */
+    origin = getOriginFromURLStruct(context, url_struct);
+    if (origin == NULL)
+        return NULL;
+
+    if (NET_URL_Type(url_struct->address) == FILE_TYPE_URL &&
+        NET_URL_Type(origin) != FILE_TYPE_URL)
+    {
+        /*
+         * Don't allow loading a file: URL from a non-file URL to
+         * prevent privacy attacks against the local machine from
+         * web pages.
+         */
+        return NULL;
+    }
+
+    stream = NET_NewStream("mocha", mocha_process, mocha_complete, 
+			   mocha_abort, mocha_ready, mocha_stream, 
+			   context); 
+    return stream;
+}
+
+PRIVATE void
+mk_mocha_eval_exit_fn(void * data, char * str, size_t len, char * wysiwyg_url, 
+		      char * base_href, Bool valid)
+{
+    MochaConData * con_data = (MochaConData *) data;
+
+    if (!valid) {
+        con_data->status = MK_MALFORMED_URL_ERROR;
+        con_data->is_valid = TRUE;
+        return;
+    }
+    if (str == NULL) {
+        con_data->status = MK_DATA_LOADED;
+        con_data->is_valid = TRUE;
+        return;
+    }
+
+    con_data->base_href = base_href;
+    con_data->wysiwyg_url = wysiwyg_url;
+    con_data->str = str;
+    con_data->len = len;
+    con_data->is_valid = TRUE;
+
+}
+
+/*
+ * Handle both 'mocha:<stuff>' urls and the mocha type-in widget
+ */
+MODULE_PRIVATE int32
+net_MochaLoad(ActiveEntry *ae)
+{
+    MWContext *context;
+    URL_Struct *url_struct;
+    char *what;
+    Bool eval_what, single_shot;
+    MochaConData * con_data;
+
+    context = ae->window_id;
+    url_struct = ae->URL_s;
+    what = XP_STRCHR(url_struct->address, ':');
+    XP_ASSERT(what);
+    what++;
+    eval_what = FALSE;
+    single_shot = (*what != '?');
+
+    if (single_shot) {
+        /* Don't use an existing Mocha output window's stream. */
+        if (*what == '\0') {
+            /* Generate two grid cells, one for output and one for input. */
+            what = PR_smprintf("<frameset rows=\"75%%,25%%\">\n"
+                               "<frame name=MochaOutput src=about:blank>\n"
+                               "<frame name=MochaInput src=%.*s#input>\n"
+                               "</frameset>",
+                               what - url_struct->address,
+                               url_struct->address);
+        } else if (!XP_STRCMP(what, "#input")) {
+            /* The input cell contains a form with one magic isindex field. */
+            what = PR_smprintf("<b>%.*s typein</b>\n"
+                               "<form action=%.*s target=MochaOutput"
+                               " onsubmit='this.isindex.focus()'>\n"
+                               "<input name=isindex size=60>\n"
+                               "</form>",
+                               what - url_struct->address - 1,
+                               url_struct->address,
+                               what - url_struct->address,
+                               url_struct->address);
+            url_struct->internal_url = TRUE;
+        } else {
+            eval_what = TRUE;
+        }
+    } else {
+        /* Use the Mocha output window if it exists. */
+        url_struct->auto_scroll = 1000;
+
+        /* Skip the leading question-mark and clean up the string. */
+        what++;
+        NET_PlusToSpace(what);
+        NET_UnEscape(what);
+        eval_what = TRUE;
+    }
+
+    /* something got hosed.  bail */
+    if (!what) {
+        ae->status = MK_OUT_OF_MEMORY;
+	return -1;
+    }
+
+    /* make space for the connection data */
+    con_data = XP_NEW_ZAP(MochaConData);
+    if (!con_data) {
+        ae->status = MK_OUT_OF_MEMORY;
+        return -1;
+    }
+
+    /* remember for next time */
+    con_data->ref_count = 1;
+    con_data->active_entry = ae;
+    ae->con_data = con_data;
+
+    /* set up some state so we remember where we are */
+    con_data->eval_what = eval_what;
+    con_data->single_shot = single_shot;
+    con_data->context = context;
+
+    /* fake out netlib so we don't select on the socket id */
+    ae->socket = NULL;
+    ae->local_file = TRUE;
+
+    if (eval_what) {
+	char *referer;
+        JSPrincipals *principals;
+	ETEvalStuff *stuff;
+
+        referer = getOriginFromURLStruct(context, url_struct);
+	if (!referer) {
+	    ae->status = MK_OUT_OF_MEMORY;
+	    return -1;
+	}
+
+	principals = LM_NewJSPrincipals(NULL, NULL, referer);
+	if (!principals) {
+	    ae->status = MK_OUT_OF_MEMORY;
+	    return -1;
+	}
+
+        /* 
+         * send the buffer off to be evaluated 
+         */
+	stuff = (ETEvalStuff *) XP_NEW_ZAP(ETEvalStuff);
+	if (!stuff) {
+	    ae->status = MK_OUT_OF_MEMORY;
+	    return -1;
+	}
+
+	stuff->len = XP_STRLEN(what);
+	stuff->line_no = 0;
+	stuff->scope_to = NULL;
+	stuff->want_result = JS_TRUE;
+	stuff->data = con_data;
+	stuff->version = JSVERSION_UNKNOWN;
+	stuff->principals = principals;
+
+        ET_EvaluateScript(context, what, stuff, mk_mocha_eval_exit_fn);
+    
+    }
+    else {
+
+        /* allocated above, don't need to free */
+        con_data->str = what;
+	con_data->len = XP_STRLEN(what);
+        con_data->is_valid = TRUE;
+
+    }
+
+    /* make sure netlib gets called so we know when our data gets back */
+    START_POLLING(ae, con_data);
+
+    /* ya'll come back now, ya'hear? */
+    return net_ProcessMocha(ae);
+
+}
+
+PRIVATE int
+net_process_mocha(MochaConData * con_data)
+{
+    int32 ref_count;
+
+    ref_count = con_data->ref_count;
+    DROP_CON_DATA(con_data);
+    if (ref_count == 1 || !con_data->active_entry)
+	return -1;
+    return net_ProcessMocha(con_data->active_entry);
+}
+
+static char nscp_open_tag[] = "<" PT_NSCP_OPEN ">";
+
+/*
+ * If the mocha has finished evaluation shove the result
+ *   down the stream and continue else just wait
+ */
+PRIVATE int32
+net_ProcessMocha(ActiveEntry * ae)
+{
+    FO_Present_Types output_format;
+    Bool to_layout;
+    Bool first_time;
+    NET_StreamClass *stream = NULL;
+    MochaConData * con_data = (MochaConData *) ae->con_data;
+    MWContext * context;
+    int status;
+
+    /* if we haven't gotten our data yet just return and wait */
+    if (!con_data || !con_data->is_valid)
+        return 0;
+
+    context = ae->window_id;
+
+    /*
+     * Race with the mocha thread until we can grab the JSLock
+     */
+    if (!con_data->single_shot) {
+	MochaDecoder * decoder;
+
+	HOLD_CON_DATA(con_data);
+	if (!LM_AttemptLockJS(context, 
+                              (JSLockReleaseFunc)net_process_mocha, con_data))
+	    return 0;
+	DROP_CON_DATA(con_data);
+	decoder = LM_GetMochaDecoder(context);
+	if (!decoder) {
+	    LM_UnlockJS(context);
+	    ae->status = MK_OUT_OF_MEMORY;
+	    goto done;
+	}
+        stream = decoder->stream;
+        LM_PutMochaDecoder(decoder);
+	LM_UnlockJS(context);
+    }
+    else {
+	stream = con_data->stream;
+    }
+
+    /* we've gotten valid data, clear the callme all the time flag */
+    STOP_POLLING(ae, con_data);
+
+    /* see if there were any problems */
+    if (con_data->status < 0 || con_data->str == NULL) {
+	ET_SendLoadEvent(context, EVENT_LOAD, NULL, NULL, 
+                         LO_DOCUMENT_LAYER_ID, FALSE);
+        ae->status = con_data->status;
+	goto done;
+    }
+
+    /*
+     * If we don't already have a stream to take our output create one now
+     */
+    first_time = !stream;
+    if (first_time) {
+        StrAllocCopy(ae->URL_s->content_type, TEXT_HTML);
+        ae->format_out = CLEAR_CACHE_BIT(ae->format_out);
+
+        stream = NET_StreamBuilder(ae->format_out, ae->URL_s, ae->window_id);
+        if (!stream) {
+            ae->status = MK_UNABLE_TO_CONVERT;
+            goto done;
+        }
+    }
+
+    /*
+     * If the stream we just created isn't ready for writing just
+     *   hold onto the stream and try again later
+     */
+    if (!stream->is_write_ready(stream)) {
+	con_data->stream = stream;
+	START_POLLING(ae, con_data);
+	return 0;
+    }
+
+    /* XXX this condition is fairly bogus */
+    output_format = CLEAR_CACHE_BIT(ae->format_out);
+    to_layout = (output_format != FO_INTERNAL_IMAGE &&
+		 output_format != FO_MULTIPART_IMAGE &&
+		 output_format != FO_EMBED &&
+		 output_format != FO_PLUGIN);
+
+    if (to_layout) {
+	/* The string must end in a newline so the parser will flush it.  */
+	if (con_data->len != 0 && con_data->str[con_data->len-1] != '\n') {
+	    size_t new_len = con_data->len + 1;
+	    char * new_str = XP_ALLOC((new_len + 1) * sizeof(char));
+
+	    if (!new_str) {
+		ae->status = MK_OUT_OF_MEMORY;
+		goto done;
+	    }
+	    XP_MEMCPY(new_str, con_data->str, con_data->len);
+	    new_str[new_len-1] = '\n';
+	    new_str[new_len] = '\0';
+	    con_data->str = new_str;
+	    con_data->len = new_len;
+	}
+    }
+
+
+    /*
+     * If this is the first time do some initial setup.  We'll set
+     *   the window title and maybe shove out a <BASE> tag
+     */
+    status = 0;
+    if (to_layout && first_time && con_data->eval_what) {
+
+	/* Feed layout an internal tag so it will create a new top state. */
+	stream->put_block(stream, nscp_open_tag,
+			  sizeof nscp_open_tag - 1);
+
+        (void) LM_WysiwygCacheConverter(context, ae->URL_s, 
+					con_data->wysiwyg_url,
+					con_data->base_href);
+
+        if (*con_data->str != '<') {
+            char * prefix = NULL;
+            StrAllocCopy(prefix, "<TITLE>");
+            StrAllocCat(prefix, ae->URL_s->address);
+            StrAllocCat(prefix, "</TITLE><PLAINTEXT>");
+            if (!prefix) {
+		ae->status = MK_OUT_OF_MEMORY;
+		goto done;
+	    }
+            status = (*stream->put_block)(stream, prefix,
+                                          XP_STRLEN(prefix));
+            XP_FREE(prefix);
+        }
+	else {
+	    if (con_data->base_href) {
+		status = (*stream->put_block)(stream, 
+		    			      con_data->base_href,
+					      XP_STRLEN(con_data->base_href));
+	    }
+	}
+    }
+	 
+    if (status >= 0) {
+        status = (*stream->put_block)(stream, con_data->str,
+                                      (int32)con_data->len);
+    }
+
+    if (con_data->single_shot && status >= 0)
+        (*stream->complete)(stream);
+
+    if (!con_data->single_shot && status >= 0) {
+        if (first_time) {
+	    ET_SetDecoderStream(context, stream, ae->URL_s, JS_TRUE);
+	    goto done;
+        }
+    } else {
+        if (status < 0)
+            (*stream->abort)(stream, status);
+        if (first_time)
+            XP_DELETE(stream);
+    }
+
+    ae->status = MK_DATA_LOADED;
+
+done:
+    ae->con_data = NULL;
+    con_data->active_entry = NULL;
+    DROP_CON_DATA(con_data);
+    return -1;
+
+}
+
+PRIVATE int32
+net_InterruptMocha(ActiveEntry *ae)
+{
+    MochaConData * con_data = (MochaConData *) ae->con_data;
+
+    if (!con_data)
+	return MK_INTERRUPTED;
+
+    /* do we need to decrement the callme all the time flag? */
+    if (con_data->polling) {
+	STOP_POLLING(ae, con_data);
+    }
+
+    /* ae is about to go away, break its connection with con_data */
+    ae->con_data = NULL;
+    con_data->active_entry = NULL;
+
+    /* ae is about to go away, better get it off the JS lock waiters list */
+    if (LM_ClearAttemptLockJS(con_data->context,
+                              (JSLockReleaseFunc)net_process_mocha, con_data))
+	DROP_CON_DATA(con_data);
+
+    return ae->status = MK_INTERRUPTED;
+}
+
+PRIVATE void
+net_CleanupMocha(void)
+{
+    /* nothing so far needs freeing */
+    return;
+}
+
+MODULE_PRIVATE void
+NET_InitMochaProtocol(void)
+{
+        static NET_ProtoImpl mocha_proto_impl;
+
+        mocha_proto_impl.init = net_MochaLoad;
+        mocha_proto_impl.process = net_ProcessMocha;
+        mocha_proto_impl.interrupt = net_InterruptMocha;
+        mocha_proto_impl.cleanup = net_CleanupMocha;
+
+        NET_RegisterProtocolImplementation(&mocha_proto_impl, MOCHA_TYPE_URL);
+}
+

mozilla/modules/libhook/src/hk_hook.c

@@ -0,0 +1,187 @@
+/* -*- 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.
+ */
+#include "xp_core.h"
+#include "xp_mcom.h"
+#include "jsapi.h"
+#include "prefapi.h"
+#include "hk_funcs.h"
+
+#include "hk_private.h"
+
+
+static JSObject *HookObject = NULL;
+
+
+JSObject *
+hk_GetHookObject(void)
+{
+	return HookObject;
+}
+
+
+void
+hk_SetHookObject(JSObject *hook_obj)
+{
+	HookObject = hook_obj;
+}
+
+
+/*
+ * Some hooks have dynamic names and can't be in the
+ * fast hook array lookup, this covers looking up those
+ * hooks.  For example, if I invented a <BLURT> tag,
+ * this would look for a BLURT_hook function.
+ */
+intn
+hk_IsUnknownTagHook(void *extra)
+{
+	const char *hook_func;
+	jsval tmp_val;
+	JSContext *j_context;
+
+	hook_func = HK_GetFunctionName(HK_TAG, extra);
+	if (hook_func == NULL)
+	{
+		return 0;
+	}
+
+	if (!PREF_GetConfigContext(&j_context))
+	{
+		return 0;
+	}
+
+	if ((j_context == NULL)||(HookObject == NULL))
+	{
+		return 0;
+	}
+
+        JS_BeginRequest(j_context);
+	if ((JS_GetProperty(j_context, HookObject, hook_func, &tmp_val))&&
+		(JS_TypeOfValue(j_context, tmp_val) == JSTYPE_FUNCTION))
+	{
+        	JS_EndRequest(j_context);
+		return 1;
+	}
+        JS_EndRequest(j_context);
+
+	return 0;
+}
+
+
+/*
+ * There is no guarantee that someone has checked the existence of the
+ * hook before calling it, so we check again here.  We don't use the
+ * fast array lookup since it can't catch all hooks anyway, and we
+ * may well have to fall back to the slow method.
+ */
+intn
+HK_CallHook(int32 hook_id, void *extra, int32 window_id,
+		char *hook_str, char **hook_ret)
+{
+	const char *hook_func;
+	intn ok;
+	jsval tmp_val;
+	jsval argv[2];
+	JSContext *j_context;
+	JSString *str;
+	const char *result_str;
+	char *return_str;
+
+	*hook_ret = NULL;
+
+	if (hook_str == NULL)
+	{
+		return 0;
+	}
+
+	/*
+	 * Make a function name form the hook_is and possibly the PA_Tag
+	 * pointed to by extra.
+	 */
+	hook_func = HK_GetFunctionName(hook_id, extra);
+	if (hook_func == NULL)
+	{
+		return 0;
+	}
+
+	/*
+	 * Make sure you have a javascript context and object.
+	 */
+	if (!PREF_GetConfigContext(&j_context))
+	{
+		return 0;
+	}
+	if ((j_context == NULL)||(HookObject == NULL))
+	{
+		return 0;
+	}
+
+        JS_BeginRequest(j_context);
+	/*
+	 * Check that there is a function to call.
+	 */
+	if ((!JS_GetProperty(j_context, HookObject, hook_func, &tmp_val))||
+		(JS_TypeOfValue(j_context, tmp_val) != JSTYPE_FUNCTION))
+	{
+                JS_EndRequest(j_context);
+		return 0;
+	}
+
+	/*
+	 * Create the argument/parameter list, and call the function.
+	 */
+	str = JS_NewStringCopyZ(j_context, hook_str);
+	if (str == NULL)
+	{
+                JS_EndRequest(j_context);
+		return 0;
+	}
+	argv[0] = STRING_TO_JSVAL(str);
+	argv[1] = INT_TO_JSVAL(window_id);
+	if (!JS_CallFunctionName(j_context, HookObject,	hook_func, 2, argv,
+							 &tmp_val))
+	{
+                JS_EndRequest(j_context);
+		return 0;
+	}
+
+	/*
+	 * A false return from the function means leave the
+	 * passed string unchanged.
+	 */
+	if (tmp_val != JSVAL_FALSE)
+	{
+		str = JS_ValueToString(j_context, tmp_val);
+		if (str == NULL)
+		{
+                	JS_EndRequest(j_context);
+			return 0;
+		}
+		result_str = JS_GetStringBytes(str);
+		return_str = XP_STRDUP(result_str);
+		if (return_str == NULL)
+		{
+                	JS_EndRequest(j_context);
+			return 0;
+		}
+		*hook_ret = return_str;
+	}
+      	JS_EndRequest(j_context);
+
+	return 1;
+}

mozilla/modules/libhook/src/hk_init.c

@@ -0,0 +1,414 @@
+/* -*- 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.
+ */
+#include "xp_core.h"
+#include "xp_mcom.h"
+#include "hk_types.h"
+#include "jsapi.h"
+#include "prefapi.h"
+#include "ntypes.h"
+#include "structs.h"
+#include "pa_tags.h"
+
+#include "hk_private.h"
+
+#ifdef XP_MAC
+#include "hk_funcs.h"
+#endif
+
+
+static hk_FunctionRec **FunctionList = NULL;
+static int32 FunctionCount = 0;
+
+static char *hk_FunctionStrings[HK_MAX] = {
+	NULL,
+	"location_hook",
+	"_hook",
+	"document_start_hook"};
+
+static JSClass autoconf_class = {
+	"HookConfig", 0,
+	hk_HookObjectAddProperty, hk_HookObjectDeleteProperty,
+	JS_PropertyStub, hk_HookObjectSetProperty,
+	JS_EnumerateStub, JS_ResolveStub, JS_ConvertStub, JS_FinalizeStub
+};
+
+
+/*******************************************
+ * This function really bugs me!  It needs to
+ * be super fast since it will be called for every
+ * HTML tag ever processed.  This means it should be
+ * self-contained, and not call off to other functions.
+ * Making it do that means it can't call off into
+ * hk_tag.c to get inside the PA_Tag structure in extra,
+ * and thus makes me include ntypes.h, structs.h, and pa_tags.h.
+ ********************************************/
+/*
+ * A FAST function existence lookup, using an array set up in
+ * the initialization process.
+ */
+intn
+HK_IsHook(int32 hook_id, void *extra)
+{
+	int32 func_id;
+	hk_FunctionRec *rec_ptr;
+
+	/*
+	 * The no hook case never exists.
+	 */
+	if (hook_id == HK_NONE)
+	{
+		return 0;
+	}
+	/*
+	 * Tag hooks map to the tag types, or alternatly
+	 * unknown tags which are handled elsewhere.
+	 */
+	else if (hook_id == HK_TAG)
+	{
+		PA_Tag *tag;
+
+		tag = (PA_Tag *)extra;
+		if (tag->type != P_UNKNOWN)
+		{
+			func_id = HK_MAX - 1 + tag->type;
+		}
+		/*
+		 * P_UNKNOWN tags must be looked up the slow
+		 * dynamic way.
+		 */
+		else
+		{
+			return(hk_IsUnknownTagHook(extra));
+		}
+	}
+	else
+	{
+		func_id = hook_id - 1;
+	}
+
+	/*
+	 * If we are outside the known funtion array, fail.
+	 */
+	if ((func_id < 0)||(func_id >= FunctionCount))
+	{
+		return 0;
+	}
+
+	/*
+	 * If no function is registered, fail.
+	 */
+	rec_ptr = FunctionList[func_id];
+	if (rec_ptr == NULL)
+	{
+		return 0;
+	}
+
+	if (rec_ptr->func_exists == FALSE)
+	{
+		return 0;
+	}
+	else
+	{
+		return 1;
+	}
+}
+
+
+/*
+ * Set the existence state of a particular index in the array.
+ */
+static void
+hk_set_function_existence(int32 indx, XP_Bool exists)
+{
+	if ((indx < 0)||(indx >= FunctionCount))
+	{
+		return;
+	}
+
+	if (FunctionList[indx] != NULL)
+	{
+		FunctionList[indx]->func_exists = exists;
+	}
+}
+
+
+void
+hk_SetFunctionExistence(char *func_name, XP_Bool exists)
+{
+	int32 i, len;
+	char *tptr;
+	char *up_str;
+	char *ptr1, *ptr2;
+	int32 indx;
+
+	/*
+	 * A NULL function one too short for the hook suffix
+	 * cannot be a hook function.
+	 */
+	if (func_name == NULL)
+	{
+		return;
+	}
+	len = XP_STRLEN(func_name);
+	if (len < XP_STRLEN("_hook"))
+	{
+		return;
+	}
+
+	/*
+	 * If the function has no hook suffix we just don't care.
+	 */
+	tptr = func_name + len - XP_STRLEN("_hook");
+	if (XP_STRCMP(tptr, "_hook") != 0)
+	{
+		return;
+	}
+
+
+	/*
+	 * Make an all upper-case copy of the prefix.
+	 */
+	*tptr = '\0';
+	up_str = XP_ALLOC(XP_STRLEN(func_name) + 1);
+	/*
+	 * If allocation fails, restore original and return.
+	 */
+	if (up_str == NULL)
+	{
+		*tptr = '_';
+		return;
+	}
+	ptr1 = func_name;
+	ptr2 = up_str;
+	while (*ptr1 != '\0')
+	{
+		*ptr2 = (char)(XP_TO_UPPER(*ptr1));
+		ptr1++;
+		ptr2++;
+	}
+	*ptr2 = '\0';
+	*tptr = '_';
+
+	/*
+	 * Check if the prefix is a known TAG name.
+	 */
+	indx = hk_TagStringToIndex(up_str);
+	XP_FREE(up_str);
+	if (indx >= 0)
+	{
+		indx = HK_MAX - 1 + indx;
+		hk_set_function_existence(indx, exists);
+		return;
+	}
+
+	/*
+	 * Special check for the TEXT_hook which is a tag hook but
+	 * won't be caught by the hk_TagStringToIndex test.
+	 */
+	if (XP_STRCMP(func_name, "TEXT_hook") == 0)
+	{
+		indx = HK_MAX - 1 + 0;
+		hk_set_function_existence(indx, exists);
+		return;
+	}
+
+	/*
+	 * Finally, check the array of known tag hooks.
+	 */
+	for (i=1; i<HK_MAX; i++)
+	{
+		if ((hk_FunctionStrings[i] != NULL)&&
+			(XP_STRCMP(func_name, hk_FunctionStrings[i]) == 0))
+		{
+			indx = i - 1;
+			hk_set_function_existence(indx, exists);
+			return;
+		}
+	}
+}
+
+
+/*
+ * Free all members of the function list array up to
+ * the passed index.
+ */
+static void
+hk_free_function_list(int32 indx)
+{
+	int32 i;
+
+	for (i=0; i<indx; i++)
+	{
+		if (FunctionList[i] != NULL)
+		{
+			if (FunctionList[i]->func_name != NULL)
+			{
+				XP_FREE(FunctionList[i]->func_name);
+				FunctionList[i]->func_name = NULL;
+			}
+			XP_FREE(FunctionList[i]);
+			FunctionList[i] = NULL;
+		}
+	}
+	XP_FREE(FunctionList);
+	FunctionList = NULL;
+	FunctionCount = 0;
+}
+
+
+/*
+ * Initialize the function list array to contain all the known tags
+ * plus all the known special hook functions.
+ */
+static intn
+hk_initialize_function_list(void)
+{
+	int32 i, indx;
+	int32 tag_cnt;
+
+	/*
+	 * Subtract one from HK_MAX because it includes the unknown
+	 * at 0.  For the tag count, unknown is -1, so we can just
+	 * use it as is.
+	 */
+	tag_cnt = hk_NumKnownTags();
+	FunctionCount = HK_MAX - 1 + tag_cnt;
+	FunctionList = (hk_FunctionRec **)XP_ALLOC(FunctionCount *
+						sizeof(hk_FunctionRec *));
+	if (FunctionList == NULL)
+	{
+		return 0;
+	}
+
+	indx = 0;
+	/*
+	 * First allocate all the known special hooks.
+	 */
+	for (i=1; i < HK_MAX; i++)
+	{
+		hk_FunctionRec *rec_ptr;
+
+		rec_ptr = XP_NEW(hk_FunctionRec);
+		if (rec_ptr == NULL)
+		{
+			hk_free_function_list(indx);
+			return 0;
+		}
+		rec_ptr->func_exists = FALSE;
+		rec_ptr->func_name = hk_FunctionStrings[i];
+		FunctionList[indx] = rec_ptr;
+		indx++;
+	}
+
+	/*
+	 * Now do all known tags.
+	 */
+	for (i=0; i < tag_cnt; i++)
+	{
+		hk_FunctionRec *rec_ptr;
+
+		rec_ptr = XP_NEW(hk_FunctionRec);
+		if (rec_ptr == NULL)
+		{
+			hk_free_function_list(indx);
+			return 0;
+		}
+		rec_ptr->func_exists = FALSE;
+		rec_ptr->func_name = hk_TagIndexToFunctionString(i);
+		FunctionList[indx] = rec_ptr;
+		indx++;
+	}
+
+	return 1;
+}
+
+
+/*
+ * Initialize all the libhook stuff.  SHould only be called once.
+ * Usually just before reading hook.js.
+ */
+intn
+HK_Init(void)
+{
+	intn ret;
+	JSContext *j_context;
+	JSObject *j_object;
+	JSObject *hook_obj;
+
+	/*
+	 * If a hook object does not already exist, create
+	 * one.  If you cannot create one, then return failure.
+	 */
+	hook_obj = hk_GetHookObject();
+	if (hook_obj == NULL)
+	{
+		if ((!PREF_GetConfigContext(&j_context))||
+			(!PREF_GetGlobalConfigObject(&j_object)))
+		{
+			return 0;
+		}
+
+                JS_BeginRequest(j_context);
+		hook_obj = JS_DefineObject(j_context, j_object,
+			"HookConfig",
+			&autoconf_class,
+			NULL,
+			JSPROP_ENUMERATE|JSPROP_READONLY|JSPROP_PERMANENT);
+                JS_EndRequest(j_context);
+	}
+	if (hook_obj == NULL)
+	{
+		return 0;
+	}
+
+	hk_SetHookObject(hook_obj);
+
+	ret = hk_initialize_function_list();
+
+	return ret;
+}
+
+
+/*
+ * Get the hook know for the passed hook id.
+ */
+const char *
+HK_GetFunctionName(int32 hook_id, void *extra)
+{
+	if ((hook_id < 0)||(hook_id >= HK_MAX))
+	{
+		return NULL;
+	}
+
+	/*
+	 * Special name creation for tag hooks.
+	 */
+	if (hook_id == HK_TAG)
+	{
+		const char *ret_str;
+
+		ret_str = (const char *)hk_TagFunctionString(
+				hk_FunctionStrings[hook_id], extra);
+		return ret_str;
+	}
+	else
+	{
+		return hk_FunctionStrings[hook_id];
+	}
+}
+