text:
<TITLE>Review for Sunday (1997)</TITLE>
<LINK REL="STYLESHEET" TYPE="text/css" HREF="/ramr.css">

Sunday (1997)

reviewed by
Dennis Schwartz

SUNDAY (director: Jonathan Nossiter; cast: David Suchet (Oliver/Matthew
Delacorta), Lisa Harrow (Madeleine Vesey), Jared Harris (Ray), Larry
Pine (Ben Vesey), 1997)

One blistery cold winter morning in Queens, New York, a middle-aged man,
Oliver (David), dressed in a rumpled brown suit, who was cut by IBM as
they downsized, leaves a homeless shelter to spend the day walking
around that part of town, knowing that he has to return before
7 p.m. or he gets locked out of the shelter. Suddenly, a woman, probably
in her early fifties, Madeleine (Lisa), with a British accent, shouts
out at him, as he is staring at her, "Aren't you Matthew Delacorta, the
director? I tried out for a part in your film in London." Oliver goes
along with the mistaken identity and goes with this has-been actress,
who can't get respectable parts in films anymore because of her age, to
a Greek diner. They spend the day together, becoming lovers out of a
sheer desire to overcome their loneliness and the dissatisfaction and
fear that life has brought them. This is a one- day fling, where after
the deception becomes unravelled by Madeleine and her anger subsides,
these two lonely souls, at least, find one day of gentleness with each
other, before their life goes on, to who knows what.

This could have been a great picture, it had everything in place to be
great, a great idea for a story, two of the finest acting performances
you can ever want, and a very compassionate story line that is without
any need for contrivances, and could touch the heart of any mature
audience.

So what went wrong and what went right with the film ?

What is right about this film, is that the story of the lovers, if we
can really call them that, is meaningful, therefore it stays with you,
its power goes beyond the time you spend watching it unfold on screen. I
thought about them for days afterwards, wondering how easy it is to lose
track of things and find out that all your desires and dreams fell
through and that you are left in a hopeless state, unable to relate to
anyone what is wrong with you. And getting older in a society that is
youth oriented, finding yourself tossed aside as unwanted scrap heap, is
a very difficult psychological thing for one to reconcile, and
obviously, some do it better than others. Oliver had no outside support,
which might be the reason he hit the bottom financially, winding up in a
spot he will have a great deal of trouble adjusting to, as he tries to
find himself, hoping for a way out... And Madeleine is also stuck,
separated from a husband (Larry Pine) she does not love, who is always
snooping around, trying to win her back with his obsessively manic
behavior, leaving a bad taste in her mouth. Her self-esteem is at a very
low level, as she can't find a way to support her need to be truly
wanted, to find love and happiness, and to be an actress with viable
parts. The problem of getting older and not being appealing anymore
gnaws at her, as she blames everything around her for her troubles,
hating being stuck in a God forsaken place like Queens, living in this
culturally desolate vacuum, where she can't escape from, not satisfied
that she lives with her sweet adopted Korean daughter in a private house
and seems to be materially provided for. This part of the film is very
emotionally moving and well presented.

What starts to go wrong with the film, is that the direction of the film
tries to do too many things, and even though, those things it attempts
might work on their own terms, they don't fit into the theme of this
film, ruining its rhythm. For instance, it offers us a vibrant look at a
homeless shelter, those who are in it, their routines, their
psychological make-up, and it even brings one of the homeless men to
life, Ray (Jared), giving his character a certain appeal that an entire
film could be based on, but to make the homelessness subplot so much a
part to this film, does not do justice to the more essential story line.
Its pace of story is different than David's odyssey, and therefore fills
the screen with too many useless images that do not enhance this
beautifully shot short film with the impact it needs. Instead, what
could have been done, was to keep the main focus on Oliver and
Madeleine's relationship, this would have added more insight into the
reasons for their demise, and give us more of a hint of how they will
act as the picture concludes. It would have served the film better if it
didn't become so arty and give us so many unimportant shots of lobsters
and Queens. This is a very human and emotional story, a story that is
very well conceived, and almost completely overshadowed by the
director's bad instincts that almost surplant so much of the good
unstincts he incorporated in the film. But, surprisingly enough, even if
the film had an air of phoniness about it, the two character's exquisite
performance stuck with me long after seeing the film. I thought their
relationship was genuine, that the film offers contrasting perceptions
of what is real and what is illusionary, as it bolsters the sense of
misfortune that ultimately prevails for both of them. Ah ! If only...
what a film this could have been.

REVIEWED ON 3/12/99                                             GRADE:
B-

http:www.sover.net/~ozus

Dennis Schwartz: "Movie Reviews"                      ozus@sover.net

 © ALL RIGHTS RESERVED   DENNIS SCHWARTZ

The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).

The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.

Please direct comments/criticisms of the review to relevant newsgroups.

Broken URLs inthe reviews are the responsibility of the author.

The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.

Related links: index of all rec.arts.movies.reviews reviews


text:
package com.github.mygreen.supercsv.expression;

import java.util.Arrays;
import java.util.Collection;
import java.util.Objects;
import java.util.stream.Collectors;

import com.github.mygreen.supercsv.cellprocessor.format.TextPrinter;

/**
 * EL式中で利用可なユーティリティ関数。
 *
 * @since 2.0
 * @author T.TSUCHIE
 *
 */
public class CustomFunctions {

    /**
     * 文字列がnullの場合に空文字に変換する。
     *

     *     CustomFunctions.defaultString(null) = ""
     *     CustomFunctions.defaultString("") = ""
     *     CustomFunctions.defaultString("abc") = "abc"
     *

     *
     * @param text 判定対象の文字列
     * @return 非nullの場合は、引数の値をそのまま返す。
     */
    public static String defaultString(final String text) {
        if(text == null) {
            return "";
        }

        return text;
    }

    /**
     * int型の配列の値を結合する。
     * @param array 結合対象の配列
     * @param delimiter 区切り文字
     * @return 結合した文字列を返す。結合の対象の配列がnulの場合、空文字を返す。
     */
    public static String join(final int[] array, final String delimiter) {

        if(array == null || array.length == 0) {
            return "";
        }

        String value = Arrays.stream(array)
                .boxed()
                .map(String::valueOf)
                .collect(Collectors.joining(defaultString(delimiter)));

        return value;
    }

    /**
     * 配列の値を結合する。
     * @param array 結合対象の配列
     * @param delimiter 区切り文字
     * @return 結合した文字列を返す。結合の対象の配列がnulの場合、空文字を返す。
     */
    public static String join(final Object[] array, final String delimiter) {

        if(array == null || array.length == 0) {
            return "";
        }

        String value = Arrays.stream(array)
                .map(v -> v.toString())
                .collect(Collectors.joining(defaultString(delimiter)));

        return value;
    }

    /**
     * 配列の値を結合する。
     * @param array 結合対象の配列
     * @param delimiter 区切り文字
     * @param printer 配列の要素の値のフォーマッタ
     * @return 結合した文字列を返す。結合の対象の配列がnulの場合、空文字を返す。
     * @throws NullPointerException {@literal printer is null.}
     */
    @SuppressWarnings({"rawtypes", "unchecked"})
    public static String join(final Object[] array, final String delimiter, final TextPrinter printer) {

        Objects.requireNonNull(printer);

        if(array == null || array.length == 0) {
            return "";
        }

        String value = Arrays.stream(array)
                .map(v -> printer.print(v))
                .collect(Collectors.joining(defaultString(delimiter)));

        return value;
    }

    /**
     * コレクションの値を結合する。
     * @param collection 結合対象のコレクション
     * @param delimiter 区切り文字
     * @return 結合した文字列を返す。結合の対象のコレクションがnulの場合、空文字を返す。
     */
    public static String join(final Collection<?> collection, final String delimiter) {

        if(collection == null || collection.isEmpty()) {
            return "";
        }

        String value = collection.stream()
                .map(v -> v.toString())
                .collect(Collectors.joining(defaultString(delimiter)));

        return value;
    }

    /**
     * コレクションの値を結合する。
     * @param collection 結合対象のコレクション
     * @param delimiter 区切り文字
     * @param printer コレクションの要素の値のフォーマッタ
     * @return 結合した文字列を返す。結合の対象のコレクションがnulの場合、空文字を返す。
     * @throws NullPointerException {@literal printer is null.}
     */
    @SuppressWarnings({"rawtypes", "unchecked"})
    public static String join(final Collection<?> collection, final String delimiter, final TextPrinter printer) {

        Objects.requireNonNull(printer);

        if(collection == null || collection.isEmpty()) {
            return "";
        }

        String value = collection.stream()
                .map(v -> printer.print(v))
                .collect(Collectors.joining(defaultString(delimiter)));

        return value;
    }

}

redpajama_set_name: RedPajamaGithub


text:
package com.communote.common.util;

/**
 * Helper class for numbers
 *
 * @author Communote GmbH - http://www.communote.com/
 */
public final class NumberHelper {

    /**
     * Compare the two numbers and taking care of null values
     *
     * @param n1
     *            number one
     * @param n2
     *            number two
     * @return if the number are equals
     */
    public static boolean equals(Number n1, Number n2) {
        if (n1 == n2) {
            return true;
        }
        if (n1 != null) {
            return n1.equals(n2);
        }
        return false;
    }

    /**
     * Returns an array containing the start and the end of the range the provided number is in. All
     * ranges have a size of rangeSize and the first starts with 0.
     *
     * @param number
     *            the number whose range is searched
     * @param rangeSize
     *            the size of the ranges
     * @return an array whose first member is the start of the range and the 2nd is the end
     */
    public static long[] getRangeOfNumber(long number, long rangeSize) {
        long rangeStart = (number / rangeSize) * rangeSize;
        return new long[] { rangeStart, rangeStart + rangeSize - 1 };
    }

    /**
     * do not use me
     */
    private NumberHelper() {

    }
}


text:
"""Symbolic inner product."""

from __future__ import print_function, division

from sympy import Expr, conjugate
from sympy.printing.latex import latex
from sympy.printing.pretty.stringpict import prettyForm
from sympsi.dagger import Dagger
from sympsi.state import KetBase, BraBase

__all__ = [
    'InnerProduct'
]

# InnerProduct is not an QExpr because it is really just a regular commutative
# number. We have gone back and forth about this, but we gain a lot by having
# it subclass Expr. The main challenges were getting Dagger to work
# (we use _eval_conjugate) and represent (we can use atoms and subs). Having
# it be an Expr, mean that there are no commutative QExpr subclasses,
# which simplifies the design of everything.

class InnerProduct(Expr):
    """An unevaluated inner product between a Bra and a Ket [1].

    Parameters
    ==========

    bra : BraBase or subclass
        The bra on the left side of the inner product.
    ket : KetBase or subclass
        The ket on the right side of the inner product.

    Examples
    ========

    Create an InnerProduct and check its properties:

        >>> from sympsi import Bra, Ket, InnerProduct
        >>> b = Bra('b')
        >>> k = Ket('k')
        >>> ip = b*k
        >>> ip
        <b|k>
        >>> ip.bra
        <b|
        >>> ip.ket
        |k>

    In simple products of kets and bras inner products will be automatically
    identified and created::

        >>> b*k
        <b|k>

    But in more complex expressions, there is ambiguity in whether inner or
    outer products should be created::

        >>> k*b*k*b
        |k><b|*|k>*<b|

    A user can force the creation of a inner products in a complex expression
    by using parentheses to group the bra and ket::

        >>> k*(b*k)*b
        <b|k>*|k>*<b|

    Notice how the inner product <b|k> moved to the left of the expression
    because inner products are commutative complex numbers.

    References
    ==========

    .. [1] http://en.wikipedia.org/wiki/Inner_product
    """
    is_complex = True

    def __new__(cls, bra, ket):
        if not isinstance(ket, KetBase):
            raise TypeError('KetBase subclass expected, got: %r' % ket)
        if not isinstance(bra, BraBase):
            raise TypeError('BraBase subclass expected, got: %r' % ket)
        obj = Expr.__new__(cls, bra, ket)
        return obj

    @property
    def bra(self):
        return self.args[0]

    @property
    def ket(self):
        return self.args[1]

    def _eval_conjugate(self):
        return InnerProduct(Dagger(self.ket), Dagger(self.bra))

    def _sympyrepr(self, printer, *args):
        return '%s(%s,%s)' % (self.__class__.__name__,
            printer._print(self.bra, *args), printer._print(self.ket, *args))

    def _sympystr(self, printer, *args):
        sbra = str(self.bra)
        sket = str(self.ket)
        return '%s|%s' % (sbra[:-1], sket[1:])

    def _pretty(self, printer, *args):
        # Print state contents
        bra = self.bra._print_contents_pretty(printer, *args)
        ket = self.ket._print_contents_pretty(printer, *args)
        # Print brackets
        height = max(bra.height(), ket.height())
        use_unicode = printer._use_unicode
        lbracket, _ = self.bra._pretty_brackets(height, use_unicode)
        cbracket, rbracket = self.ket._pretty_brackets(height, use_unicode)
        # Build innerproduct
        pform = prettyForm(*bra.left(lbracket))
        pform = prettyForm(*pform.right(cbracket))
        pform = prettyForm(*pform.right(ket))
        pform = prettyForm(*pform.right(rbracket))
        return pform

    def _latex(self, printer, *args):
        bra_str = latex(self.bra)
        rvert = r'\right|'
        ket_str = latex(self.ket)

        bra_str_without_vert = (bra_str[:bra_str.find(rvert)] + r'\right.'
                             + bra_str[bra_str.find(rvert) + len(rvert):])

        return r'%s %s' % (bra_str_without_vert, ket_str)

    def doit(self, **hints):
        try:
            r = self.ket._eval_innerproduct(self.bra, **hints)
        except NotImplementedError:
            try:
                r = conjugate(
                    self.bra.dual._eval_innerproduct(self.ket.dual, **hints)
                )
            except NotImplementedError:
                r = None
        if r is not None:
            return r
        return self


text:
<?php

namespace Rithis\BECRussiaBundle\Admin;

use Sonata\AdminBundle\Datagrid\ListMapper,
    Sonata\AdminBundle\Form\FormMapper,
    Sonata\AdminBundle\Admin\Admin;

class TestQuestionAdmin extends Admin
{
    protected function configureListFields(ListMapper $mapper)
    {
        $mapper->addIdentifier('question');
    }

    protected function configureFormFields(FormMapper $mapper)
    {
        $mapper->add('question');
        $mapper->add('answers', 'sonata_type_collection', array('by_reference' => false), array(
            'edit' => 'inline',
            'inline' => 'table'
        ));
    }
}


text:
<vector android:height="32dp" android:viewportHeight="24.0"
    android:viewportWidth="24.0" android:width="32dp" xmlns:android="http://schemas.android.com/apk/res/android">
    <path android:fillColor="#000000" android:pathData="M10,20v-6h4v6h5v-8h3L12,3 2,12h3v8z"/>
</vector>


text:
module HealthSeven::V2_3
class MfnM07 < ::HealthSeven::Message
  attribute :msh, Msh, position: "MSH", require: true
  attribute :mfi, Mfi, position: "MFI", require: true
  class MfClinStudy < ::HealthSeven::SegmentGroup
    attribute :mfe, Mfe, position: "MFE", require: true
    attribute :cm0, Cm0, position: "CM0", require: true
    class MfPhaseSchedDetail < ::HealthSeven::SegmentGroup
      attribute :cm1, Cm1, position: "CM1", require: true
      attribute :cm2s, Array[Cm2], position: "CM2", multiple: true
    end
    attribute :mf_phase_sched_details, Array[MfPhaseSchedDetail], position: "MFN_M07.MF_PHASE_SCHED_DETAIL", multiple: true
  end
  attribute :mf_clin_studies, Array[MfClinStudy], position: "MFN_M07.MF_CLIN_STUDY", require: true, multiple: true
end
end


text:
ACCEPTED

#### According to
Index Fungorum

#### Published in
in Chi, [Fungal Diseases of Cultivated Medicinal Plants in Guangdong Province] (Guangdong) 148 (1994)

#### Original name
Leptosphaeria desmodii J.F. Lue & P.K. Chi

### Remarks
null


text:
<?php

namespace Test\Phpatterns\Structural\Adapter;

use Phpatterns\Structural\Adapter;
use Phpatterns\Structural\Adapter\FirstWeatherApi;
use Phpatterns\Structural\Adapter\SecondWeatherApi;

class AdapterTest extends \PHPUnit_Framework_TestCase
{
    /**
     * Testing the adapter mechanism
     * @param Adapter\WeatherInterface $weather
     * @dataProvider adapterProvider
     */
    public function testAdapterMechanism(Adapter\WeatherInterface $weather)
    {
        $this->assertInstanceOf(
            Adapter\Weather::class,
            $weather->getWeather('Paris')
        );
    }

    public function adapterProvider()
    {
        return [
            [
                new FirstWeatherApi\FirstWeatherApiAdapter(
                    new FirstWeatherApi\FirstWeatherApi()
                )
            ],
            [
                new SecondWeatherApi\SecondWeatherApiAdapter(
                    new SecondWeatherApi\SecondWeatherApi()
                )
            ]
        ];
    }
}


text:
<resources>
    <string name="app_name">Ear Training</string>

    <string name="action_settings">Settings</string>

    <string name="play">Play</string>
    <string name="ok">OK</string>

    <string-array name="options_array">
        <item>Options</item>
        <item>Note View</item>
    </string-array>

    <string name="drawer_open">Open navigation drawer</string>
    <string name="drawer_close">Close navigation drawer</string>

    <string name="action_websearch">Web search</string>

    <string name="earTrainingBtn">Ear training</string>
    <string name="generate">Generate</string>
    <string name="submit">Submit</string>
    <string name="record">Record</string>
    <string name="recordText">Record</string>
    <string name="whole">Whole</string>
    <string name="half">Half</string>
    <string name="quarter">Quarter</string>
    <string name="halfNote">Half note</string>
    <string name="whole_note">Whole note</string>
    <string name="quarter_note">Quarter note</string>

</resources>


text:
`FoxxModel#forClient()`

Return a copy of the model which you can send to the client.


text:
        <?php
        if (!empty($_SESSION['drugsafe_user_message'])) {
            if (trim($_SESSION['drugsafe_user_message']['type']) == "success") {
                ?>

                    <?php echo $_SESSION['drugsafe_user_message']['content']; ?>

            <?php }
            if (trim($_SESSION['drugsafe_user_message']['type']) == "error") {
                ?>

                    <?php echo $_SESSION['drugsafe_user_message']['content']; ?>

            <?php }
            $this->session->unset_userdata('drugsafe_user_message');
        }
        ?>

                         <a href="<?php echo __BASE_URL__; ?>">Home

                            Select Franchisee

                            Plese select a Franchisee to display their related clients.

                              <form class="form-horizontal" id="szSearchClientRecord" action="<?=__BASE_URL__?>/formManagement/viewForm" name="szSearchClientRecord" method="post">

                                      <select class="form-control custom-select" name="szSearchFrRecord" id="szSearchname" onfocus="remove_formError(this.id,'true')">
                                          <option value="">Franchisee Name</option>
                                          <?php

                                            foreach($searchOptionArr as $searchOptionList)
                                            {
                                                $selected = ($searchOptionList['id'] == $_POST['szSearchFrRecord'] ? 'selected="selected"' : '');
                                                echo '<option value="'.$searchOptionList['id'].'"' . $selected . ' >'.$searchOptionList['szName'].'</option>';
                                            }
                                          ?>
                                      </select>

                                      <button class="btn green-meadow" type="submit" ></button>

                           </form>

                            <?php echo $notfound;?>


text:
package control

import (
	"bufio"
	"fmt"
	"io/ioutil"
	"os"
	"sort"
	"strings"

	"golang.org/x/net/context"

	log "github.com/Sirupsen/logrus"
	"github.com/codegangsta/cli"
	composeConfig "github.com/docker/libcompose/config"
	"github.com/docker/libcompose/project/options"
	"github.com/rancher/os/compose"
	"github.com/rancher/os/config"
	"github.com/rancher/os/util/network"
)

func consoleSubcommands() []cli.Command {
	return []cli.Command{
		{
			Name:   "switch",
			Usage:  "switch console without a reboot",
			Action: consoleSwitch,
			Flags: []cli.Flag{
				cli.BoolFlag{
					Name:  "force, f",
					Usage: "do not prompt for input",
				},
				cli.BoolFlag{
					Name:  "no-pull",
					Usage: "don't pull console image",
				},
			},
		},
		{
			Name:   "enable",
			Usage:  "set console to be switched on next reboot",
			Action: consoleEnable,
		},
		{
			Name:   "list",
			Usage:  "list available consoles",
			Action: consoleList,
		},
	}
}

func consoleSwitch(c *cli.Context) error {
	if len(c.Args()) != 1 {
		log.Fatal("Must specify exactly one console to switch to")
	}
	newConsole := c.Args()[0]

	cfg := config.LoadConfig()
	if newConsole == currentConsole() {
		log.Warnf("Console is already set to %s", newConsole)
	}

	if !c.Bool("force") {
		in := bufio.NewReader(os.Stdin)
		fmt.Println(`Switching consoles will
1. destroy the current console container
2. log you out
3. restart Docker`)
		if !yes(in, "Continue") {
			return nil
		}
	}

	if !c.Bool("no-pull") && newConsole != "default" {
		if err := compose.StageServices(cfg, newConsole); err != nil {
			return err
		}
	}

	service, err := compose.CreateService(nil, "switch-console", &composeConfig.ServiceConfigV1{
		LogDriver:  "json-file",
		Privileged: true,
		Net:        "host",
		Pid:        "host",
		Image:      config.OS_BASE,
		Labels: map[string]string{
			config.SCOPE: config.SYSTEM,
		},
		Command:     []string{"/usr/bin/switch-console", newConsole},
		VolumesFrom: []string{"all-volumes"},
	})
	if err != nil {
		return err
	}

	if err = service.Delete(context.Background(), options.Delete{}); err != nil {
		return err
	}
	if err = service.Up(context.Background(), options.Up{}); err != nil {
		return err
	}
	return service.Log(context.Background(), true)
}

func consoleEnable(c *cli.Context) error {
	if len(c.Args()) != 1 {
		log.Fatal("Must specify exactly one console to enable")
	}
	newConsole := c.Args()[0]

	cfg := config.LoadConfig()

	if newConsole != "default" {
		if err := compose.StageServices(cfg, newConsole); err != nil {
			return err
		}
	}

	if err := config.Set("rancher.console", newConsole); err != nil {
		log.Errorf("Failed to update 'rancher.console': %v", err)
	}

	return nil
}

func consoleList(c *cli.Context) error {
	cfg := config.LoadConfig()

	consoles, err := network.GetConsoles(cfg.Rancher.Repositories.ToArray())
	if err != nil {
		return err
	}
	consoles = append(consoles, "default")
	sort.Strings(consoles)

	currentConsole := currentConsole()

	for _, console := range consoles {
		if console == currentConsole {
			fmt.Printf("current  %s\n", console)
		} else if console == cfg.Rancher.Console {
			fmt.Printf("enabled  %s\n", console)
		} else {
			fmt.Printf("disabled %s\n", console)
		}
	}

	return nil
}

func currentConsole() (console string) {
	consoleBytes, err := ioutil.ReadFile("/run/console-done")
	if err == nil {
		console = strings.TrimSpace(string(consoleBytes))
	} else {
		log.Warnf("Failed to detect current console: %v", err)
	}
	return
}


text:
var X_OFFSET = 50;
var Y_OFFSET = 450;
var MULT = 100;

function draw_grid(context){
  var canvas = document.getElementById("canvas_a");
  var context = canvas.getContext("2d");

  canvas.width = canvas.width;

  var first_x = true;
  for (var x = 0; x < 500; x += 50) {
    context.moveTo(x, 0);
    context.lineTo(x, 500);
    var label = (x / 100) - 0.5;
    if (label >= 0){
      context.fillText(label.toString(), x, 500);
    }
  }
  var first_y = true;
  for (var y = 0; y < 500; y += 50) {
    context.moveTo(0, y);
    context.lineTo(500, y);
    var label = 4.5 - (y /100);
    if(label >= 0) {
      context.fillText(label.toString(), 0, y);
    }
  }
  context.strokeStyle = "#eee";
  context.stroke();
}

function draw_path(path, context, canvas) {
  var canvas = document.getElementById("canvas_a");
  var context = canvas.getContext("2d");

  for (var i = 0; i < path.length; i++){
    var x = path[i][0] * MULT + X_OFFSET;
    var y = path[i][1] * MULT * -1 + Y_OFFSET;
    context.beginPath();
    context.arc(x, y, 3, 0, 2 * Math.PI, false);
    context.fillStyle = 'black';
    context.fill();
    context.lineWidth = 5;
    context.strokeStyle = '#000000';
    context.stroke();

    context.font = "bold 12px sans-serif";
    var label = path[i][0] + "," + path[i][1];
    context.fillText(label, x - 10, y + 20);
  }
}

function draw_path_segment(co_1,co_2){
  var canvas = document.getElementById("canvas_a");
  var context = canvas.getContext("2d");

  var x_1 = co_1[0] * MULT + X_OFFSET;
  var y_1 = co_1[1] * MULT * -1 + Y_OFFSET;
  var x_2 = co_2[0] * MULT + X_OFFSET;
  var y_2 = co_2[1] * MULT * -1 + Y_OFFSET;

  context.moveTo(x_1,y_1);
  context.lineTo(x_2,y_2);
  context.strokeStyle = "#333";
  context.stroke();
}

function clear_path_segments(path){
  var canvas = document.getElementById("canvas_a");
  var context = canvas.getContext("2d");

  draw_grid(context);
  draw_path(path, context, canvas);
}

// global variable for output log
var LOG = $(".output-log");

// Determine which use of \n or \r for newline in file
function getNewlineType(points_string){
  var newline;
    if (points_string.indexOf("\r\n") > 0){
      newline = "\r\n";
    }
    else if (points_string.indexOf("\r") > 0){
      newline = "\r";
    }
    else if (points_string.indexOf("\n") > 0){
      newline = "\n";
    }
    else{
      console.log("Invalid input. Should contain two lines.");
    }
    return newline;
}

// Convert String to an array
function inputStringToArray(split_points){

  x_points = split_points[0].split(" ");
  y_points = split_points[1].split(" ");

  var points = [];
  for (var i = 0; i < x_points.length; i++){
    points[i] = [];
    points[i][0] = parseInt(x_points[i]);
    points[i][1] = parseInt(y_points[i]);
  }
  return points;
}

function getCoordinatesFromPage(){
  // Read file synchronously
  var split_points = [];
  split_points[0] = $(".x-coordinates input").val();
  split_points[1] = $(".y-coordinates input").val();

  console.log(split_points);
  return inputStringToArray(split_points);
}

function printPath(path){
  clear_path_segments(path);
  for(var i in path){
    LOG.append(path[i][0].toFixed(1) + "  ");
    var next_point = (parseInt(i) + 1);
    if (next_point === path.length){
      next_point = 0;
    }
    console.log("index: " + i + " next: " +  next_point + " : " + path[next_point]);
    draw_path_segment(path[i], path[next_point]);
  }
  LOG.append("
");
  for(var i in path){
    LOG.append(path[i][1].toFixed(1) + "  ");
  }
  LOG.append("
");
}

// Get distance between two point pairs
function getPointsDistance(a, b){
  var sum = Math.pow((b[0] - a[0]),2) + Math.pow((b[1] - a[1]),2);
  return Math.sqrt(sum);
}

// Get total distance between points in path
function getTotalDistance(path){
  var total_distance = 0;
  for (var i = 0; i < path.length - 1; i++){
    total_distance += getPointsDistance(path[i], path[i + 1]);
  }
  // get distance from the last point back to the origin
  total_distance += getPointsDistance(path[path.length - 1], path[0]);

  return total_distance;
}

function swap_x_y(path, a, b){
  var tmp = path[a];
  path[a] = path[b];
  path[b] = tmp;
  return path;
}

function printPathIteration(path, swap, distance){
  LOG.html("");
  if (swap[0] !== undefined){
    var swap_x = parseFloat(swap[0]) + 1;
    var swap_y = parseFloat(swap[1]) + 1;
    LOG.append("Swap " + swap_x + " and " + swap_y);
    LOG.append("
");
  }
  printPath(path);
  LOG.append("
");
  LOG.append("Length = " + distance.toFixed(4));
  LOG.append("
");
}

// Primary algorithm function
function simpleTravellingSalesman(path){
  var best_distance = getTotalDistance(path);

  var new_distance;
  var new_best_distance = best_distance;
  var best_swap = [];

  // Print out the initial path state
  LOG.append("Path:");
  printPathIteration(path,best_swap,best_distance);

  while(true){
    for(var U in path){
      for (var V in path){
        swap_x_y(path,U,V);
        // calculate new distance
        new_distance = getTotalDistance(path);
        if(new_distance < new_best_distance){
          new_best_distance = new_distance;
          best_swap[0] = U;
          best_swap[1] = V;
        }
        // undo the swap for future iterations
        swap_x_y(path,U,V);
      }
    }

    if (new_best_distance === best_distance){
      LOG("End of hill climbing");
      return path;
    }
    best_distance = new_best_distance;
    path = swap_x_y(path,best_swap[0],best_swap[1]);

    // Print out this iteration
    printPathIteration(path,best_swap,best_distance);
  }
}

function getWrappedIndex(length,index){
  if (index === -1){
    return length - 1;
  }
  if (index === length){
    return 0;
  }
  return index;
}

function calculateLengthChange(path,U,V){
  V = parseInt(V);
  U = parseInt(U);
  if(U === V) return 0;

  var difference = 0;
  var length = path.length;
  var index_abs_difference = Math.abs(U - V);

  // Swap U and V to ensure V > U except when index-
  // wrapping is necessary
  if ((index_abs_difference === length-1) && (V > U)){
    var tmp = U;
    U = V;
    V = tmp;
  }
  else if ((index_abs_difference !== length-1) && (V < U)){
    var tmp = U;
    U = V;
    V = tmp;
  }

  var U_minus_1 = path[getWrappedIndex(length, (U-1))];
  var V_minus_1 = path[getWrappedIndex(length, (V-1))];
  var U_plus_1 = path[getWrappedIndex(length, (Number(U)+1))];
  var V_plus_1 = path[getWrappedIndex(length, (Number(V)+1))];

  var U_val = U;
  var V_val = V;

  U = path[U];
  V = path[V];

  var distance;

  // If locations in sequence
  if(index_abs_difference === 1 || index_abs_difference === length-1){
    difference -= getPointsDistance(U_minus_1, U);
    difference -= getPointsDistance(V, V_plus_1);
    difference += getPointsDistance(U_minus_1,V);
    difference += getPointsDistance(U,V_plus_1);
  }
  else{
    difference -= getPointsDistance(U_minus_1, U);
    difference -= getPointsDistance(U, U_plus_1);
    difference -= getPointsDistance(V_minus_1,V);
    difference -= getPointsDistance(V, V_plus_1);

    difference += getPointsDistance(U_minus_1, V);
    difference += getPointsDistance(V, U_plus_1);
    difference += getPointsDistance(V_minus_1, U);
    difference += getPointsDistance(U, V_plus_1);
  }
  return parseFloat(difference.toFixed(12));
}

function improvedTravellingSalesman(path, steps){
  var best_distance = getTotalDistance(path);

  var difference;
  var best_difference;
  var best_swap = [];

  // Print out the initial path state
  console.log("Path:");
  printPathIteration(path,best_swap,best_distance);

  while(true){
    best_difference = 0;
    for(var U = 0; U < path.length; U++){
      for(var V = 0; V < path.length; V++){
        difference = calculateLengthChange(path,U,V);
        if (difference < best_difference){
          best_difference = difference;
          best_swap[0] = U;
          best_swap[1] = V;
        }
      }
    }

    if(best_difference === 0){
      console.log("End of hill climbing");
      return path;
    }
    path = swap_x_y(path,best_swap[0],best_swap[1]);
    best_distance += best_difference;

    // Print out this iteration after waiting
    if (steps > 0){
      printPathIteration(path,best_swap,best_distance);
      steps--;
    }
    if (best_distance < 0) break;
  }
}

//simpleTravellingSalesman(path);
//improvedTravellingSalesman(path);

$( document ).ready(function() {

  draw_grid();
  var path = getCoordinatesFromPage();
  draw_path(path);
  console.log(getTotalDistance(path));
  printPathIteration(path,0,getTotalDistance(path));

  var steps = 1;

  $(".draw-button").click(function(){
    draw_grid();
    var path = getCoordinatesFromPage();
    LOG.empty();
    draw_path(path);
    printPathIteration(path,0,getTotalDistance(path));
    steps = 1;
  });

  $(".step-button").click(function(){
    var path = getCoordinatesFromPage();
    LOG.empty();

    improvedTravellingSalesman(path,steps);
    steps++;
  });

});


text:
action-token: Using Action Token to Incorporate External App Call into Authentication Flow
==========================================================================================

Level: Intermediate
Technologies: JavaEE
Summary: Example of cooperation of Action Tokens and Required Actions
Target Product: Keycloak
Source: <https://github.com/keycloak/keycloak-quickstarts>

What is it?
-----------

This example shows how to invoke external application within the authentication
flow. It is implemented by cooperation of required action and action token:

1. During authentication, a required action that mandates cooperation with
   external application is invoked.

2. This required action prepares an action token for the current authentication
   session and redirects to the application, passing the action token along.

3. The application does whatever it is suited for (in this example, lets the
   user set values of two attributes).

4. Application uses the action token obtained in Step 2. to return back to
   authentication flow, providing the required action with its own signed token
   containing values entered by the user.

5. The handler handling that action token takes values of the fields and sets
   the attributes of authenticating user accordingly.

System Requirements
-------------------

You need to have Keycloak 3.2.0.Final running.

All you need to build this project is Java 8.0 (Java SDK 1.8) or later and Maven 3.3.3 or later.

Build and Deploy the Quickstart
-------------------------------

If you open the pom.xml file you'll see that the add-spi-configurations execution creates
a configuration of two custom SPIs implemented in this example:

 *  `external-app-notification` action token handler is given a secret key that
    is used in step 5 to verify that the invocation comes from the correct app.

 *  `redirect-to-external-application` required action is provided with a URL
    where it should redirect the requests to when invoked as part of authentication
    flow. This URL contains special string `{TOKEN}` that is replaced with
    URL with action token. That URL is used by the external application to
    redirect back to Keycloak once its own flow is completed.

To deploy the provider to Keycloak server, run the following maven command (optionally
specifying Keycloak management port with `-Dwildfly.port=_port_`):

    ````
    mvn -Pwildfly-managed clean wildfly:deploy
    ````

If you want to play with and modify the example, simply rerun the maven deploy
command above and the new version will be hot deployed.

Note that you need to deploy the responder application into WildFly. A sample responder
application is part of the tests and after running the above command will be located in
`target/deployments/wildfly_action-token-responder-example_action-token-responder-example.war`.

Enable the Provider for a Realm
-------------------------------
Login to the Keycloak Admin Console and go to the Authentication section,
Required Actions tab. You should now see your deployed required action once you
click `Register` button. Add the required action, save it. This will now enable
the provider for the 'master' realm. Now you can set the required actions as
a default action (mandatory for any new user) or mandate user to execute this
action via admin interface.

If you logout and login as a new user or a user you mandated to execute that
action (depending on the option you choose above, you would be redirected to
the external application requiring you to fill a form, whose values will be sent
back to Keycloak upon completion. There they will be stored as user attributes
and authentication flow will continue.

Integration test of the Quickstart
----------------------------------

1. Make sure you have an Keycloak server running with an admin user in the `master` realm or use the provided docker image
2. You need to have Chrome browser installed and updated to the latest version
3. Run `mvn test -Pwildfly-managed`

More Information
----------------
The Action Token SPI and how you can use Java EE to implement it is covered in detail in our server developer guide.


text:
Vacatures

Vacatures

           Terug naar vacatures zoekscherm

          <button class="btn btn-primary pull-left col-xs-3" ng-disabled="currentPage == 0" ng-click="currentPage=currentPage-1">< vorige</button>
          {{currentPage+1}}/{{numberOfPages()}}
          <button class="btn btn-primary pull-right col-xs-4" ng-disabled="currentPage >= getData().length/pageSize - 1" ng-click="currentPage=currentPage+1">volgende ></button>

                    Dienstverband:  | Locatie:  | Aantal uur:  | Werk-/denkniveau:

Functie-omschrijving:

          <button class="btn btn-primary pull-left col-xs-3" ng-disabled="currentPage == 0" ng-click="currentPage=currentPage-1">< vorige</button>
          {{currentPage+1}}/{{numberOfPages()}}
          <button class="btn btn-primary pull-right col-xs-4" ng-disabled="currentPage >= getData().length/pageSize - 1" ng-click="currentPage=currentPage+1">volgende ></button>


text:
OPEN_RDO_RUNTIME_NAMESPACE
class RDOCalc;
CLOSE_RDO_RUNTIME_NAMESPACE

OPEN_RDO_PARSER_NAMESPACE

// --------------------------------------------------------------------------------
// -------------------- RDOSMR
// --------------------------------------------------------------------------------
PREDECLARE_POINTER(RDOSMR);
class RDOSMR: public rdo::counter_reference
{
DECLARE_FACTORY(RDOSMR);
public:
    typedef std::map<std::string, std::string> StringTable;

    void setExternalModelName(const std::string& alias, const std::string& modelID)
    {
        m_extModelList[alias] = modelID;
    }
    std::string getExternalModelName(const std::string& alias) const
    {
        StringTable::const_iterator it = m_extModelList.find(alias);
        return it != m_extModelList.end() ? it->second : "";
    }
    const StringTable& getExternalModelList() const
    {
        return m_extModelList;
    }

    rdo::service::simulation::ShowMode getShowMode      () const { return m_showMode;       }
    int                                getFrameNumber   () const { return m_frameNumber;    }
    double                             getShowRate      () const { return m_showRate;       }
    double                             getRunStartTime  () const { return m_runStartTime;   }
    double                             getTraceStartTime() const { return m_traceStartTime; }
    double                             getTraceEndTime  () const { return m_traceEndTime;   }

    void setShowMode      (rdo::service::simulation::ShowMode showMode);
    void setFrameNumber   (int value,    const YYLTYPE& pos);
    void setShowRate      (double value, const YYLTYPE& pos);
    void setRunStartTime  (double value, const YYLTYPE& pos);
    void setTraceStartTime(double value, const YYLTYPE& pos);
    void setTraceEndTime  (double value, const YYLTYPE& pos);

    void setTerminateIf  (LPRDOFUNLogic& pLogic);
    void setConstValue   (const RDOParserSrcInfo& const_info, LPRDOFUNArithm& pArithm);
    void setResParValue  (const RDOParserSrcInfo& res_info, const RDOParserSrcInfo& par_info, LPRDOFUNArithm& pArithm);
    void setSeed         (const RDOParserSrcInfo& seq_info, int base);
    void insertBreakPoint(const RDOParserSrcInfo& src_info, LPRDOFUNLogic& pLogic);

    std::vector<rdo::runtime::LPRDOCalc> getCalcList() const { return m_SMRCalcList; }

private:
    RDOSMR();

    PREDECLARE_POINTER(BreakPoint);
    class BreakPoint
        : public rdo::counter_reference
        , public RDOParserSrcInfo
    {
    DECLARE_FACTORY(BreakPoint);
    private:
        BreakPoint(const RDOParserSrcInfo& src_info, LPRDOFUNLogic pLogic);
    };
    typedef std::vector<LPBreakPoint> BreakPointList;

    StringTable                         m_extModelList;
    rdo::service::simulation::ShowMode  m_showMode;
    int                                 m_frameNumber;
    double                              m_showRate;
    double                              m_runStartTime;
    double                              m_traceStartTime;
    double                              m_traceEndTime;
    YYLTYPE                             m_traceStartTime_pos;
    YYLTYPE                             m_traceEndTime_pos;
    LPRDOFUNLogic                       m_pTerminateIf;
    BreakPointList                      m_breakPointList;

    void addCalc(const rdo::runtime::LPRDOCalc pCalc) { m_SMRCalcList.push_back(pCalc); }

    std::vector<rdo::runtime::LPRDOCalc> m_SMRCalcList;
};

CLOSE_RDO_PARSER_NAMESPACE


text:
<?xml version="1.0"?>
<InterchangeStudentAttendance xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://ed-fi.org/0100" xsi:schemaLocation="http://ed-fi.org/0100 ../../sli/edfi-schema/src/main/resources/edfiXsd-SLI/SLI-Interchange-StudentAttendance.xsd">
  <Action ActionType="DELETE" Cascade="false" Force="true">
    <AttendanceEvent>
      <SchoolYear>2001-2002</SchoolYear>
      <EventDate>2001-09-13</EventDate>
      <AttendanceEventCategory>Excused Absence</AttendanceEventCategory>
      <AttendanceEventReason>Excused: sick</AttendanceEventReason>
      <EducationalEnvironment>Classroom</EducationalEnvironment>
      <StudentReference>
        <StudentIdentity>
          <StudentUniqueStateId>1</StudentUniqueStateId>
        </StudentIdentity>
      </StudentReference>
      <SchoolReference>
        <EducationalOrgIdentity>
          <StateOrganizationId>Daybreak Central High</StateOrganizationId>
        </EducationalOrgIdentity>
      </SchoolReference>
      <SectionReference>
        <SectionIdentity>
          <EducationalOrgReference>
            <EducationalOrgIdentity>
              <StateOrganizationId>Daybreak Central High</StateOrganizationId>
            </EducationalOrgIdentity>
          </EducationalOrgReference>
          <UniqueSectionCode>3</UniqueSectionCode>
        </SectionIdentity>
      </SectionReference>
    </AttendanceEvent>
  </Action>
</InterchangeStudentAttendance>


text:
package org.elasticsearch.search.aggregations.bucket.significant;

import org.elasticsearch.common.io.stream.StreamInput;
import org.elasticsearch.common.io.stream.StreamOutput;
import org.elasticsearch.common.xcontent.XContentBuilder;
import org.elasticsearch.search.DocValueFormat;
import org.elasticsearch.search.aggregations.Aggregations;
import org.elasticsearch.search.aggregations.InternalAggregation;
import org.elasticsearch.search.aggregations.InternalAggregations;
import org.elasticsearch.search.aggregations.InternalMultiBucketAggregation;
import org.elasticsearch.search.aggregations.bucket.significant.heuristics.SignificanceHeuristic;
import org.elasticsearch.search.aggregations.pipeline.PipelineAggregator;

import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Objects;

/**
 * Result of the significant terms aggregation.
 */
public abstract class InternalSignificantTerms<A extends InternalSignificantTerms<A, B>, B extends InternalSignificantTerms.Bucket<B>>
        extends InternalMultiBucketAggregation<A, B> implements SignificantTerms {

    public static final String SCORE = "score";
    public static final String BG_COUNT = "bg_count";

    @SuppressWarnings("PMD.ConstructorCallsOverridableMethod")
    public abstract static class Bucket<B extends Bucket<B>> extends InternalMultiBucketAggregation.InternalBucket
            implements SignificantTerms.Bucket {
        /**
         * Reads a bucket. Should be a constructor reference.
         */
        @FunctionalInterface
        public interface Reader<B extends Bucket<B>> {
            B read(StreamInput in, long subsetSize, long supersetSize, DocValueFormat format) throws IOException;
        }

        long subsetDf;
        long subsetSize;
        long supersetDf;
        long supersetSize;
        long bucketOrd;
        double score;
        protected InternalAggregations aggregations;
        final transient DocValueFormat format;

        protected Bucket(long subsetDf, long subsetSize, long supersetDf, long supersetSize,
                InternalAggregations aggregations, DocValueFormat format) {
            this.subsetSize = subsetSize;
            this.supersetSize = supersetSize;
            this.subsetDf = subsetDf;
            this.supersetDf = supersetDf;
            this.aggregations = aggregations;
            this.format = format;
        }

        /**
         * Read from a stream.
         */
        protected Bucket(StreamInput in, long subsetSize, long supersetSize, DocValueFormat format) {
            this.subsetSize = subsetSize;
            this.supersetSize = supersetSize;
            this.format = format;
        }

        @Override
        public long getSubsetDf() {
            return subsetDf;
        }

        @Override
        public long getSupersetDf() {
            return supersetDf;
        }

        @Override
        public long getSupersetSize() {
            return supersetSize;
        }

        @Override
        public long getSubsetSize() {
            return subsetSize;
        }

        void updateScore(SignificanceHeuristic significanceHeuristic) {
            score = significanceHeuristic.getScore(subsetDf, subsetSize, supersetDf, supersetSize);
        }

        @Override
        public long getDocCount() {
            return subsetDf;
        }

        @Override
        public Aggregations getAggregations() {
            return aggregations;
        }

        public B reduce(List<B> buckets, ReduceContext context) {
            long subsetDf = 0;
            long supersetDf = 0;
            List<InternalAggregations> aggregationsList = new ArrayList<>(buckets.size());
            for (B bucket : buckets) {
                subsetDf += bucket.subsetDf;
                supersetDf += bucket.supersetDf;
                aggregationsList.add(bucket.aggregations);
            }
            InternalAggregations aggs = InternalAggregations.reduce(aggregationsList, context);
            return newBucket(subsetDf, subsetSize, supersetDf, supersetSize, aggs);
        }

        abstract B newBucket(long subsetDf, long subsetSize, long supersetDf, long supersetSize, InternalAggregations aggregations);

        @Override
        public double getSignificanceScore() {
            return score;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null || getClass() != o.getClass()) {
                return false;
            }

            Bucket<?> that = (Bucket<?>) o;
            return bucketOrd == that.bucketOrd &&
                    Double.compare(that.score, score) == 0 &&
                    Objects.equals(aggregations, that.aggregations) &&
                    Objects.equals(format, that.format);
        }

        @Override
        public int hashCode() {
            return Objects.hash(getClass(), bucketOrd, aggregations, score, format);
        }

        @Override
        public final XContentBuilder toXContent(XContentBuilder builder, Params params) throws IOException {
            builder.startObject();
            keyToXContent(builder);
            builder.field(CommonFields.DOC_COUNT.getPreferredName(), getDocCount());
            builder.field(SCORE, score);
            builder.field(BG_COUNT, supersetDf);
            aggregations.toXContentInternal(builder, params);
            builder.endObject();
            return builder;
        }

        protected abstract XContentBuilder keyToXContent(XContentBuilder builder) throws IOException;
    }

    protected final int requiredSize;
    protected final long minDocCount;

    protected InternalSignificantTerms(String name, int requiredSize, long minDocCount, List<PipelineAggregator> pipelineAggregators,
            Map<String, Object> metaData) {
        super(name, pipelineAggregators, metaData);
        this.requiredSize = requiredSize;
        this.minDocCount = minDocCount;
    }

    /**
     * Read from a stream.
     */
    protected InternalSignificantTerms(StreamInput in) throws IOException {
        super(in);
        requiredSize = readSize(in);
        minDocCount = in.readVLong();
    }

    protected final void doWriteTo(StreamOutput out) throws IOException {
        writeSize(requiredSize, out);
        out.writeVLong(minDocCount);
        writeTermTypeInfoTo(out);
    }

    protected abstract void writeTermTypeInfoTo(StreamOutput out) throws IOException;

    @Override
    public abstract List<B> getBuckets();

    @Override
    public InternalAggregation doReduce(List<InternalAggregation> aggregations, ReduceContext reduceContext) {
        long globalSubsetSize = 0;
        long globalSupersetSize = 0;
        // Compute the overall result set size and the corpus size using the
        // top-level Aggregations from each shard
        for (InternalAggregation aggregation : aggregations) {
            @SuppressWarnings("unchecked")
            InternalSignificantTerms<A, B> terms = (InternalSignificantTerms<A, B>) aggregation;
            globalSubsetSize += terms.getSubsetSize();
            globalSupersetSize += terms.getSupersetSize();
        }
        Map<String, List<B>> buckets = new HashMap<>();
        for (InternalAggregation aggregation : aggregations) {
            @SuppressWarnings("unchecked")
            InternalSignificantTerms<A, B> terms = (InternalSignificantTerms<A, B>) aggregation;
            for (B bucket : terms.getBuckets()) {
                List<B> existingBuckets = buckets.get(bucket.getKeyAsString());
                if (existingBuckets == null) {
                    existingBuckets = new ArrayList<>(aggregations.size());
                    buckets.put(bucket.getKeyAsString(), existingBuckets);
                }
                // Adjust the buckets with the global stats representing the
                // total size of the pots from which the stats are drawn
                existingBuckets.add(bucket.newBucket(bucket.getSubsetDf(), globalSubsetSize, bucket.getSupersetDf(), globalSupersetSize,
                        bucket.aggregations));
            }
        }
        SignificanceHeuristic heuristic = getSignificanceHeuristic().rewrite(reduceContext);
        final int size = reduceContext.isFinalReduce() == false ? buckets.size() : Math.min(requiredSize, buckets.size());
        BucketSignificancePriorityQueue<B> ordered = new BucketSignificancePriorityQueue<>(size);
        for (Map.Entry<String, List<B>> entry : buckets.entrySet()) {
            List<B> sameTermBuckets = entry.getValue();
            final B b = sameTermBuckets.get(0).reduce(sameTermBuckets, reduceContext);
            b.updateScore(heuristic);
            if (((b.score > 0) && (b.subsetDf >= minDocCount)) || reduceContext.isFinalReduce() == false) {
                ordered.insertWithOverflow(b);
            }
        }
        B[] list = createBucketsArray(ordered.size());
        for (int i = ordered.size() - 1; i >= 0; i--) {
            list[i] = ordered.pop();
        }
        return create(globalSubsetSize, globalSupersetSize, Arrays.asList(list));
    }

    protected abstract A create(long subsetSize, long supersetSize, List<B> buckets);

    /**
     * Create an array to hold some buckets. Used in collecting the results.
     */
    protected abstract B[] createBucketsArray(int size);

    protected abstract long getSubsetSize();

    protected abstract long getSupersetSize();

    protected abstract SignificanceHeuristic getSignificanceHeuristic();

    @Override
    protected int doHashCode() {
        return Objects.hash(minDocCount, requiredSize);
    }

    @Override
    protected boolean doEquals(Object obj) {
        InternalSignificantTerms<?, ?> that = (InternalSignificantTerms<?, ?>) obj;
        return Objects.equals(minDocCount, that.minDocCount)
                && Objects.equals(requiredSize, that.requiredSize);
    }
}


text:
module Main where

import qualified EFA.Application.Plot as PlotIO

import qualified EFA.Flow.Topology.Index as XIdx

import qualified EFA.Signal.Signal as S
import qualified EFA.Signal.Chop as Chop
import qualified EFA.Signal.Sequence as Sequ

import EFA.Signal.Record (PowerRecord, Record(Record))
import EFA.Signal.Signal (PSignal, (.++))

import qualified Data.Map as Map
import Data.Map (Map)

import qualified Graphics.Gnuplot.Terminal.Default as DefaultTerm

mkSig :: Int -> [Double] -> PSignal [] Double
mkSig m = S.fromList . concat . replicate m

mkSigEnd :: Int -> [Double] -> PSignal [] Double
mkSigEnd m s = mkSig m s  .++  S.fromList [head s]

time :: [Double]
time = take 13 [0 ..]

s01, s10, s12, s21, s13, s31 :: [Double]
s01 = [0, 2, 2, 0, 0, 0]
s10 = [0, 0.8, 0.8, 0, 0, 0]
s12 = [0.3, 0.3, 0.3, 0.3, 0.3, 0.3]
s21 = [0.2, 0.2, 0.2, 0.2, 0.2, 0.2]
s13 = [0, 0.5, 0.5, -0.3, -0.3, -0.3]
s31 = [0, 0.25, 0.25, 0, -0.6, -0.6]

n :: Int
n = 2

pMap :: Map (XIdx.Position Int) (PSignal [] Double)
pMap =
   Map.fromListWith (error "duplicate keys") $
      (XIdx.ppos 0 1, mkSigEnd n s01) :
      (XIdx.ppos 1 0, mkSigEnd n s10) :
      (XIdx.ppos 1 2, mkSigEnd n s12) :
      (XIdx.ppos 2 1, mkSigEnd n s21) :
      (XIdx.ppos 1 3, mkSigEnd n s13) :
      (XIdx.ppos 3 1, mkSigEnd n s31) :
      []

pRec, pRec0 :: (PowerRecord Int [] Double)
pRec = Record (S.fromList time) pMap
pRec0 = Chop.addZeroCrossings pRec

sequRecA, sequRecB :: Sequ.List (PowerRecord Int [] Double)
sequRecA = Chop.genSequ pRec0

sequRecB = Chop.chopAtZeroCrossingsPowerRecord True pRec

main :: IO ()
main = do
  print time
  print pRec
  print pRec0

  PlotIO.record "PowerRecord" DefaultTerm.cons show id pRec
  PlotIO.sequence "SequA" DefaultTerm.cons show id sequRecA
  PlotIO.sequence "SequB" DefaultTerm.cons show id sequRecB

{-
  {-
  The result looks awful, because many parts overlap.
  -}
  void $ Plot.plot (PS.cons "sequence.eps") $
     (\xs ->
        MultiPlot.simpleFromPartArray $
        let width = 3
        in  Array.listArray ((1,1), (divUp (length xs) width, width)) $
            map MultiPlot.partFromFrame xs ++
            repeat (MultiPlot.partFromFrame Frame.empty)) $
     rPlotCore "Sequ" sequRecB
-}


text:
class ADESK_NO_VTABLE AcDbDoubleClickEdit : public AcRxObject
{
public:
  ACRX_DECLARE_MEMBERS(AcDbDoubleClickEdit);
  virtual void startEdit(AcDbEntity* pEnt, AcGePoint3d pt) = 0;
  virtual void finishEdit(void) = 0;
};
#  pragma  pack (pop)
#endif


text:
layout: default
title: Content Creation and Perceived Performance
permalink: /events/2013/content-performance/
---

{% assign currentEvent = page.title %}

<div class="event-container">
    {% include partial-event-large.html %}
</div>


text:
using FEE.Domain.InstantArticles;
using FEE.Web.App_Code.Controllers;
using Microsoft.VisualStudio.TestTools.UnitTesting;
using Moq;
using Umbraco.Core.Models;

namespace FEE.StaticTests.InstantArticleTests
{
    [TestClass]
    public class InstantArticleTest
    {
        public void GenerateInstantArticle()
        {
            var article = new Mock<IPublishedContent>() {};
            article.SetupGet(a => a.Name).Returns("TEST");
            article.SetupGet(a => a.Url).Returns("/test/");
            InstantArticleFeedItemModel content = new InstantArticleFeedItemModel(article.Object);
            string html = InstantArticleBuilder.GetArticleBody(content);
        }

        [TestMethod]
        public void ConvertImgToFigure()
        {
            string src = "<img src='hello.jpg'>";

            var wrapped = Html5Utils.WrapImagesInFigure(src);

            Assert.AreEqual(wrapped, "");
        }

    }
}


text:
/* $FreeBSD$ */
/*-
 *  Copyright (c) 1997-2009 by Matthew Jacob
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *
 *  1. Redistributions of source code must retain the above copyright
 *     notice, this list of conditions and the following disclaimer.
 *  2. Redistributions in binary form must reproduce the above copyright
 *     notice, this list of conditions and the following disclaimer in the
 *     documentation and/or other materials provided with the distribution.
 *
 *  THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
 *  ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 *  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 *  ARE DISCLAIMED.  IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
 *  FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 *  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 *  OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 *  HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 *  LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 *  OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 *  SUCH DAMAGE.
 *
 */
/*
 * Soft Definitions for for Qlogic ISP SCSI adapters.
 */

#ifndef	_ISPVAR_H
#define	_ISPVAR_H

#if defined(__NetBSD__) || defined(__OpenBSD__)
#include <dev/ic/isp_stds.h>
#include <dev/ic/ispmbox.h>
#endif
#ifdef	__FreeBSD__
#include <dev/isp/isp_stds.h>
#include <dev/isp/ispmbox.h>
#endif
#ifdef	__linux__
#include "isp_stds.h"
#include "ispmbox.h"
#endif
#ifdef	__svr4__
#include "isp_stds.h"
#include "ispmbox.h"
#endif

#define	ISP_CORE_VERSION_MAJOR	7
#define	ISP_CORE_VERSION_MINOR	0

/*
 * Vector for bus specific code to provide specific services.
 */
typedef struct ispsoftc ispsoftc_t;
struct ispmdvec {
	int		(*dv_rd_isr) (ispsoftc_t *, uint32_t *, uint16_t *, uint16_t *);
	uint32_t	(*dv_rd_reg) (ispsoftc_t *, int);
	void		(*dv_wr_reg) (ispsoftc_t *, int, uint32_t);
	int		(*dv_mbxdma) (ispsoftc_t *);
	int		(*dv_dmaset) (ispsoftc_t *, XS_T *, void *);
	void		(*dv_dmaclr) (ispsoftc_t *, XS_T *, uint32_t);
	void		(*dv_reset0) (ispsoftc_t *);
	void		(*dv_reset1) (ispsoftc_t *);
	void		(*dv_dregs) (ispsoftc_t *, const char *);
	const void *	dv_ispfw;	/* ptr to f/w */
	uint16_t	dv_conf1;
	uint16_t	dv_clock;	/* clock frequency */
};

/*
 * Overall parameters
 */
#define	MAX_TARGETS		16
#ifndef	MAX_FC_TARG
#define	MAX_FC_TARG		256
#endif
#define	ISP_MAX_TARGETS(isp)	(IS_FC(isp)? MAX_FC_TARG : MAX_TARGETS)
#define	ISP_MAX_LUNS(isp)	(isp)->isp_maxluns

/*
 * Macros to access ISP registers through bus specific layers-
 * mostly wrappers to vector through the mdvec structure.
 */
#define	ISP_READ_ISR(isp, isrp, semap, mbox0p)	\
	(*(isp)->isp_mdvec->dv_rd_isr)(isp, isrp, semap, mbox0p)

#define	ISP_READ(isp, reg)	\
	(*(isp)->isp_mdvec->dv_rd_reg)((isp), (reg))

#define	ISP_WRITE(isp, reg, val)	\
	(*(isp)->isp_mdvec->dv_wr_reg)((isp), (reg), (val))

#define	ISP_MBOXDMASETUP(isp)	\
	(*(isp)->isp_mdvec->dv_mbxdma)((isp))

#define	ISP_DMASETUP(isp, xs, req)	\
	(*(isp)->isp_mdvec->dv_dmaset)((isp), (xs), (req))

#define	ISP_DMAFREE(isp, xs, hndl)		\
	if ((isp)->isp_mdvec->dv_dmaclr)	\
	    (*(isp)->isp_mdvec->dv_dmaclr)((isp), (xs), (hndl))

#define	ISP_RESET0(isp)	\
	if ((isp)->isp_mdvec->dv_reset0) (*(isp)->isp_mdvec->dv_reset0)((isp))
#define	ISP_RESET1(isp)	\
	if ((isp)->isp_mdvec->dv_reset1) (*(isp)->isp_mdvec->dv_reset1)((isp))
#define	ISP_DUMPREGS(isp, m)	\
	if ((isp)->isp_mdvec->dv_dregs) (*(isp)->isp_mdvec->dv_dregs)((isp),(m))

#define	ISP_SETBITS(isp, reg, val)	\
 (*(isp)->isp_mdvec->dv_wr_reg)((isp), (reg), ISP_READ((isp), (reg)) | (val))

#define	ISP_CLRBITS(isp, reg, val)	\
 (*(isp)->isp_mdvec->dv_wr_reg)((isp), (reg), ISP_READ((isp), (reg)) & ~(val))

/*
 * The MEMORYBARRIER macro is defined per platform (to provide synchronization
 * on Request and Response Queues, Scratch DMA areas, and Registers)
 *
 * Defined Memory Barrier Synchronization Types
 */
#define	SYNC_REQUEST	0	/* request queue synchronization */
#define	SYNC_RESULT	1	/* result queue synchronization */
#define	SYNC_SFORDEV	2	/* scratch, sync for ISP */
#define	SYNC_SFORCPU	3	/* scratch, sync for CPU */
#define	SYNC_REG	4	/* for registers */
#define	SYNC_ATIOQ	5	/* atio result queue (24xx) */

/*
 * Request/Response Queue defines and macros.
 * The maximum is defined per platform (and can be based on board type).
 */
/* This is the size of a queue entry (request and response) */
#define	QENTRY_LEN			64
/* Both request and result queue length must be a power of two */
#define	RQUEST_QUEUE_LEN(x)		MAXISPREQUEST(x)
#ifdef	ISP_TARGET_MODE
#define	RESULT_QUEUE_LEN(x)		MAXISPREQUEST(x)
#else
#define	RESULT_QUEUE_LEN(x)		\
	(((MAXISPREQUEST(x) >> 2) < 64)? 64 : MAXISPREQUEST(x) >> 2)
#endif
#define	ISP_QUEUE_ENTRY(q, idx)		(((uint8_t *)q) + ((idx) * QENTRY_LEN))
#define	ISP_QUEUE_SIZE(n)		((n) * QENTRY_LEN)
#define	ISP_NXT_QENTRY(idx, qlen)	(((idx) + 1) & ((qlen)-1))
#define	ISP_QFREE(in, out, qlen)	\
	((in == out)? (qlen - 1) : ((in > out)? \
	((qlen - 1) - (in - out)) : (out - in - 1)))
#define	ISP_QAVAIL(isp)	\
	ISP_QFREE(isp->isp_reqidx, isp->isp_reqodx, RQUEST_QUEUE_LEN(isp))

#define	ISP_ADD_REQUEST(isp, nxti)						\
	MEMORYBARRIER(isp, SYNC_REQUEST, isp->isp_reqidx, QENTRY_LEN, -1);	\
	ISP_WRITE(isp, isp->isp_rqstinrp, nxti);				\
	isp->isp_reqidx = nxti

#define	ISP_SYNC_REQUEST(isp)								\
	MEMORYBARRIER(isp, SYNC_REQUEST, isp->isp_reqidx, QENTRY_LEN, -1);		\
	isp->isp_reqidx = ISP_NXT_QENTRY(isp->isp_reqidx, RQUEST_QUEUE_LEN(isp));	\
	ISP_WRITE(isp, isp->isp_rqstinrp, isp->isp_reqidx)

/*
 * SCSI Specific Host Adapter Parameters- per bus, per target
 */
typedef struct {
	uint32_t 				: 8,
			update			: 1,
			sendmarker		: 1,
			role			: 2,
			isp_req_ack_active_neg	: 1,
			isp_data_line_active_neg: 1,
			isp_cmd_dma_burst_enable: 1,
			isp_data_dma_burst_enabl: 1,
			isp_fifo_threshold	: 3,
			isp_ptisp		: 1,
			isp_ultramode		: 1,
			isp_diffmode		: 1,
			isp_lvdmode		: 1,
			isp_fast_mttr		: 1,	/* fast sram */
			isp_initiator_id	: 4,
			isp_async_data_setup	: 4;
	uint16_t	isp_selection_timeout;
	uint16_t	isp_max_queue_depth;
	uint8_t		isp_tag_aging;
	uint8_t		isp_bus_reset_delay;
	uint8_t		isp_retry_count;
	uint8_t		isp_retry_delay;
	struct {
		uint32_t
			exc_throttle	:	8,
					:	1,
			dev_enable	:	1,	/* ignored */
			dev_update	:	1,
			dev_refresh	:	1,
			actv_offset	:	4,
			goal_offset	:	4,
			nvrm_offset	:	4;
		uint8_t		actv_period;	/* current sync period */
		uint8_t		goal_period;	/* goal sync period */
		uint8_t		nvrm_period;	/* nvram sync period */
		uint16_t	actv_flags;	/* current device flags */
		uint16_t	goal_flags;	/* goal device flags */
		uint16_t	nvrm_flags;	/* nvram device flags */
	} isp_devparam[MAX_TARGETS];
} sdparam;

/*
 * Device Flags
 */
#define	DPARM_DISC	0x8000
#define	DPARM_PARITY	0x4000
#define	DPARM_WIDE	0x2000
#define	DPARM_SYNC	0x1000
#define	DPARM_TQING	0x0800
#define	DPARM_ARQ	0x0400
#define	DPARM_QFRZ	0x0200
#define	DPARM_RENEG	0x0100
#define	DPARM_NARROW	0x0080
#define	DPARM_ASYNC	0x0040
#define	DPARM_PPR	0x0020
#define	DPARM_DEFAULT	(0xFF00 & ~DPARM_QFRZ)
#define	DPARM_SAFE_DFLT	(DPARM_DEFAULT & ~(DPARM_WIDE|DPARM_SYNC|DPARM_TQING))

/* technically, not really correct, as they need to be rated based upon clock */
#define	ISP_80M_SYNCPARMS	0x0c09
#define	ISP_40M_SYNCPARMS	0x0c0a
#define	ISP_20M_SYNCPARMS	0x0c0c
#define	ISP_20M_SYNCPARMS_1040	0x080c
#define	ISP_10M_SYNCPARMS	0x0c19
#define	ISP_08M_SYNCPARMS	0x0c25
#define	ISP_05M_SYNCPARMS	0x0c32
#define	ISP_04M_SYNCPARMS	0x0c41

/*
 * Fibre Channel Specifics
 */
/* These are for non-2K Login Firmware cards */
#define	FL_ID			0x7e	/* FL_Port Special ID */
#define	SNS_ID			0x80	/* SNS Server Special ID */
#define	NPH_MAX			0xfe

/* Use this handle for the base for multi-id firmware SNS logins */
#define	NPH_SNS_HDLBASE		0x400

/* These are for 2K Login Firmware cards */
#define	NPH_RESERVED		0x7F0	/* begin of reserved N-port handles */
#define	NPH_MGT_ID		0x7FA	/* Management Server Special ID */
#define	NPH_SNS_ID		0x7FC	/* SNS Server Special ID */
#define	NPH_FABRIC_CTLR		0x7FD	/* Fabric Controller (0xFFFFFD) */
#define	NPH_FL_ID		0x7FE	/* F Port Special ID (0xFFFFFE) */
#define	NPH_IP_BCST		0x7ff	/* IP Broadcast Special ID (0xFFFFFF) */
#define	NPH_MAX_2K		0x800

/*
 * "Unassigned" handle to be used internally
 */
#define	NIL_HANDLE		0xffff

/*
 * Limit for devices on an arbitrated loop.
 */
#define	LOCAL_LOOP_LIM		126

/*
 * Limit for (2K login) N-port handle amounts
 */
#define	MAX_NPORT_HANDLE	2048

/*
 * Special Constants
 */
#define	INI_NONE    		((uint64_t) 0)
#define	ISP_NOCHAN		0xff

/*
 * Special Port IDs
 */
#define	MANAGEMENT_PORT_ID	0xFFFFFA
#define	SNS_PORT_ID		0xFFFFFC
#define	FABRIC_PORT_ID		0xFFFFFE
#define	PORT_ANY		0xFFFFFF
#define	PORT_NONE		0
#define	DOMAIN_CONTROLLER_BASE	0xFFFC00
#define	DOMAIN_CONTROLLER_END	0xFFFCFF

/*
 * Command Handles
 *
 * Most QLogic initiator or target have 32 bit handles associated with them.
 * We want to have a quick way to index back and forth between a local SCSI
 * command context and what the firmware is passing back to us. We also
 * want to avoid working on stale information. This structure handles both
 * at the expense of some local memory.
 *
 * The handle is architected thusly:
 *
 *	0 means "free handle"
 *	bits  0..12 index commands
 *	bits 13..15 bits index usage
 *	bits 16..31 contain a rolling sequence
 *
 *
 */
typedef struct {
	void *		cmd;	/* associated command context */
	uint32_t	handle;	/* handle associated with this command */
} isp_hdl_t;
#define	ISP_HANDLE_FREE		0x00000000
#define	ISP_HANDLE_CMD_MASK	0x00001fff
#define	ISP_HANDLE_USAGE_MASK	0x0000e000
#define	ISP_HANDLE_USAGE_SHIFT	13
#define	ISP_H2HT(hdl)	((hdl & ISP_HANDLE_USAGE_MASK) >> ISP_HANDLE_USAGE_SHIFT)
#	define	ISP_HANDLE_NONE		0
#	define	ISP_HANDLE_INITIATOR	1
#	define	ISP_HANDLE_TARGET	2
#define	ISP_HANDLE_SEQ_MASK	0xffff0000
#define	ISP_HANDLE_SEQ_SHIFT	16
#define	ISP_H2SEQ(hdl)	((hdl & ISP_HANDLE_SEQ_MASK) >> ISP_HANDLE_SEQ_SHIFT)
#define	ISP_VALID_INI_HANDLE(c, hdl)	\
	(ISP_H2HT(hdl) == ISP_HANDLE_INITIATOR && (hdl & ISP_HANDLE_CMD_MASK) < (c)->isp_maxcmds && \
	 ISP_H2SEQ(hdl) == ISP_H2SEQ((c)->isp_xflist[hdl & ISP_HANDLE_CMD_MASK].handle))
#ifdef	ISP_TARGET_MODE
#define	ISP_VALID_TGT_HANDLE(c, hdl)	\
	(ISP_H2HT(hdl) == ISP_HANDLE_TARGET && (hdl & ISP_HANDLE_CMD_MASK) < (c)->isp_maxcmds && \
	 ISP_H2SEQ(hdl) == ISP_H2SEQ((c)->isp_tgtlist[hdl & ISP_HANDLE_CMD_MASK].handle))
#define	ISP_VALID_HANDLE(c, hdl)	\
	(ISP_VALID_INI_HANDLE((c), hdl) || ISP_VALID_TGT_HANDLE((c), hdl))
#else
#define	ISP_VALID_HANDLE	ISP_VALID_INI_HANDLE
#endif
#define	ISP_BAD_HANDLE_INDEX	0xffffffff

/*
 * FC Port Database entry.
 *
 * It has a handle that the f/w uses to address commands to a device.
 * This handle's value may be assigned by the firmware (e.g., for local loop
 * devices) or by the driver (e.g., for fabric devices).
 *
 * It has a state. If the state if VALID, that means that we've logged into
 * the device. We also *may* have a initiator map index entry. This is a value
 * from 0..MAX_FC_TARG that is used to index into the isp_dev_map array. If
 * the value therein is non-zero, then that value minus one is used to index
 * into the Port Database to find the handle for forming commands. There is
 * back-index minus one value within to Port Database entry that tells us
 * which entry in isp_dev_map points to us (to avoid searching).
 *
 * Local loop devices the firmware automatically performs PLOGI on for us
 * (which is why that handle is imposed upon us). Fabric devices we assign
 * a handle to and perform the PLOGI on.
 *
 * When a PORT DATABASE CHANGED asynchronous event occurs, we mark all VALID
 * entries as PROBATIONAL. This allows us, if policy says to, just keep track
 * of devices whose handles change but are otherwise the same device (and
 * thus keep 'target' constant).
 *
 * In any case, we search all possible local loop handles. For each one that
 * has a port database entity returned, we search for any PROBATIONAL entry
 * that matches it and update as appropriate. Otherwise, as a new entry, we
 * find room for it in the Port Database. We *try* and use the handle as the
 * index to put it into the Database, but that's just an optimization. We mark
 * the entry VALID and make sure that the target index is updated and correct.
 *
 * When we get done searching the local loop, we then search similarily for
 * a list of devices we've gotten from the fabric name controller (if we're
 * on a fabric). VALID marking is also done similarily.
 *
 * When all of this is done, we can march through the database and clean up
 * any entry that is still PROBATIONAL (these represent devices which have
 * departed). Then we're done and can resume normal operations.
 *
 * Negative invariants that we try and test for are:
 *
 *  + There can never be two non-NIL entries with the same { Port, Node } WWN
 *    duples.
 *
 *  + There can never be two non-NIL entries with the same handle.
 *
 *  + There can never be two non-NIL entries which have the same dev_map_idx
 *    value.
 */
typedef struct {
	/*
	 * This is the handle that the firmware needs in order for us to
	 * send commands to the device. For pre-24XX cards, this would be
	 * the 'loopid'.
	 */
	uint16_t	handle;

	/*
	 * The dev_map_idx, if nonzero, is the system virtual target ID (+1)
	 * as a cross-reference with the isp_dev_map.
	 *
	 * A device is 'autologin' if the firmware automatically logs into
	 * it (re-logins as needed). Basically, local private loop devices.
	 *
	 * PRLI word 3 parameters contains role as well as other things.
	 *
	 * The state is the current state of this entry.
	 *
	 * Portid is obvious, as are node && port WWNs. The new_role and
	 * new_portid is for when we are pending a change.
	 *
	 * The 'target_mode' tag means that this entry arrived via a
	 * target mode command and is immune from normal flushing rules.
	 * You should also never see anything with an initiator role
	 * with this set.
	 */
	uint16_t	prli_word3;		/* PRLI parameters */
	uint16_t	new_prli_word3;		/* Incoming new PRLI parameters */
	uint16_t	dev_map_idx	: 12,
			autologin	: 1,	/* F/W does PLOGI/PLOGO */
			state		: 3;
	uint32_t			: 7,
			target_mode	: 1,
			portid		: 24;
	uint32_t
					: 5,
			reported_gone	: 1,
			announced	: 1,
			dirty		: 1,	/* commands have been run */
			new_portid	: 24;
	uint64_t	node_wwn;
	uint64_t	port_wwn;
	uint32_t	gone_timer;
} fcportdb_t;

#define	FC_PORTDB_STATE_NIL		0
#define	FC_PORTDB_STATE_PROBATIONAL	1
#define	FC_PORTDB_STATE_DEAD		2
#define	FC_PORTDB_STATE_CHANGED		3
#define	FC_PORTDB_STATE_NEW		4
#define	FC_PORTDB_STATE_PENDING_VALID	5
#define	FC_PORTDB_STATE_ZOMBIE		6
#define	FC_PORTDB_STATE_VALID		7

/*
 * FC card specific information
 *
 * This structure is replicated across multiple channels for multi-id
 * capapble chipsets, with some entities different on a per-channel basis.
 */

typedef struct {
	uint32_t
				fctape_enabled	: 1,
				link_active	: 1,
				sendmarker	: 1,
				role		: 2,
				isp_gbspeed	: 4,
				isp_loopstate	: 4,	/* Current Loop State */
				isp_fwstate	: 4,	/* ISP F/W state */
				isp_topo	: 3,	/* Connection Type */
				loop_seen_once	: 1;

	uint32_t				: 8,
				isp_portid	: 24;	/* S_ID */

	uint16_t		isp_fwoptions;
	uint16_t		isp_xfwoptions;
	uint16_t		isp_zfwoptions;
	uint16_t		isp_loopid;		/* hard loop id */
	uint16_t		isp_sns_hdl;		/* N-port handle for SNS */
	uint16_t		isp_lasthdl;		/* only valid for channel 0 */
	uint16_t		isp_maxalloc;
	uint16_t		isp_fabric_params;
	uint8_t			isp_retry_delay;
	uint8_t			isp_retry_count;

	/*
	 * Current active WWNN/WWPN
	 */
	uint64_t		isp_wwnn;
	uint64_t		isp_wwpn;

	/*
	 * NVRAM WWNN/WWPN
	 */
	uint64_t		isp_wwnn_nvram;
	uint64_t		isp_wwpn_nvram;

	/*
	 * Our Port Data Base
	 */
	fcportdb_t		portdb[MAX_FC_TARG];

	/*
	 * This maps system virtual 'target' id to a portdb entry.
	 *
	 * The mapping function is to take any non-zero entry and
	 * subtract one to get the portdb index. This means that
	 * entries which are zero are unmapped (i.e., don't exist).
	 */
	uint16_t		isp_dev_map[MAX_FC_TARG];

#ifdef	ISP_TARGET_MODE
	/*
	 * This maps N-Port Handle to portdb entry so we
	 * don't have to search for every incoming command.
	 *
	 * The mapping function is to take any non-zero entry and
	 * subtract one to get the portdb index. This means that
	 * entries which are zero are unmapped (i.e., don't exist).
	 */
	uint16_t		isp_tgt_map[MAX_NPORT_HANDLE];
#endif

	/*
	 * Scratch DMA mapped in area to fetch Port Database stuff, etc.
	 */
	void *			isp_scratch;
	XS_DMA_ADDR_T		isp_scdma;
} fcparam;

#define	FW_CONFIG_WAIT		0
#define	FW_WAIT_AL_PA		1
#define	FW_WAIT_LOGIN		2
#define	FW_READY		3
#define	FW_LOSS_OF_SYNC		4
#define	FW_ERROR		5
#define	FW_REINIT		6
#define	FW_NON_PART		7

#define	LOOP_NIL		0
#define	LOOP_LIP_RCVD		1
#define	LOOP_PDB_RCVD		2
#define	LOOP_SCANNING_LOOP	3
#define	LOOP_LSCAN_DONE		4
#define	LOOP_SCANNING_FABRIC	5
#define	LOOP_FSCAN_DONE		6
#define	LOOP_SYNCING_PDB	7
#define	LOOP_READY		8

#define	TOPO_NL_PORT		0
#define	TOPO_FL_PORT		1
#define	TOPO_N_PORT		2
#define	TOPO_F_PORT		3
#define	TOPO_PTP_STUB		4

/*
 * Soft Structure per host adapter
 */
struct ispsoftc {
	/*
	 * Platform (OS) specific data
	 */
	struct isposinfo	isp_osinfo;

	/*
	 * Pointer to bus specific functions and data
	 */
	struct ispmdvec *	isp_mdvec;

	/*
	 * (Mostly) nonvolatile state. Board specific parameters
	 * may contain some volatile state (e.g., current loop state).
	 */

	void * 			isp_param;	/* type specific */
	uint64_t		isp_fwattr;	/* firmware attributes */
	uint16_t		isp_fwrev[3];	/* Loaded F/W revision */
	uint16_t		isp_maxcmds;	/* max possible I/O cmds */
	uint8_t			isp_type;	/* HBA Chip Type */
	uint8_t			isp_revision;	/* HBA Chip H/W Revision */
	uint16_t		isp_nchan;	/* number of channels */
	uint32_t		isp_maxluns;	/* maximum luns supported */

	uint32_t		isp_clock	: 8,	/* input clock */
						: 4,
				isp_port	: 1,	/* 23XX/24XX only */
				isp_open	: 1,	/* opened (ioctl) */
				isp_bustype	: 1,	/* SBus or PCI */
				isp_loaded_fw	: 1,	/* loaded firmware */
				isp_dblev	: 16;	/* debug log mask */

	uint32_t		isp_confopts;	/* config options */

	uint32_t		isp_rqstinrp;	/* register for REQINP */
	uint32_t		isp_rqstoutrp;	/* register for REQOUTP */
	uint32_t		isp_respinrp;	/* register for RESINP */
	uint32_t		isp_respoutrp;	/* register for RESOUTP */

	/*
	 * Instrumentation
	 */
	uint64_t		isp_intcnt;		/* total int count */
	uint64_t		isp_intbogus;		/* spurious int count */
	uint64_t		isp_intmboxc;		/* mbox completions */
	uint64_t		isp_intoasync;		/* other async */
	uint64_t		isp_rsltccmplt;		/* CMDs on result q */
	uint64_t		isp_fphccmplt;		/* CMDs via fastpost */
	uint16_t		isp_rscchiwater;
	uint16_t		isp_fpcchiwater;
	NANOTIME_T		isp_init_time;		/* time were last initialized */

	/*
	 * Volatile state
	 */

	volatile uint32_t	:	8,
				:	2,
		isp_dead	:	1,
				:	1,
		isp_mboxbsy	:	1,	/* mailbox command active */
		isp_state	:	3,
		isp_nactive	:	16;	/* how many commands active */
	volatile mbreg_t	isp_curmbx;	/* currently active mailbox command */
	volatile uint32_t	isp_reqodx;	/* index of last ISP pickup */
	volatile uint32_t	isp_reqidx;	/* index of next request */
	volatile uint32_t	isp_residx;	/* index of last ISP write */
	volatile uint32_t	isp_resodx;	/* index of next result */
	volatile uint32_t	isp_atioodx;	/* index of next ATIO */
	volatile uint32_t	isp_obits;	/* mailbox command output */
	volatile uint32_t	isp_serno;	/* rolling serial number */
	volatile uint16_t	isp_mboxtmp[MAX_MAILBOX];
	volatile uint16_t	isp_lastmbxcmd;	/* last mbox command sent */
	volatile uint16_t	isp_mbxwrk0;
	volatile uint16_t	isp_mbxwrk1;
	volatile uint16_t	isp_mbxwrk2;
	volatile uint16_t	isp_mbxwrk8;
	volatile uint16_t	isp_seqno;	/* running sequence number */
	void *			isp_mbxworkp;

	/*
	 * Active commands are stored here, indexed by handle functions.
	 */
	isp_hdl_t		*isp_xflist;
	isp_hdl_t		*isp_xffree;

#ifdef	ISP_TARGET_MODE
	/*
	 * Active target commands are stored here, indexed by handle functions.
	 */
	isp_hdl_t		*isp_tgtlist;
	isp_hdl_t		*isp_tgtfree;
#endif

	/*
	 * request/result queue pointers and DMA handles for them.
	 */
	void *			isp_rquest;
	void *			isp_result;
	XS_DMA_ADDR_T		isp_rquest_dma;
	XS_DMA_ADDR_T		isp_result_dma;
#ifdef	ISP_TARGET_MODE
	/* for 24XX only */
	void *			isp_atioq;
	XS_DMA_ADDR_T		isp_atioq_dma;
#endif
};

#define	SDPARAM(isp, chan)	(&((sdparam *)(isp)->isp_param)[(chan)])
#define	FCPARAM(isp, chan)	(&((fcparam *)(isp)->isp_param)[(chan)])

#define	ISP_SET_SENDMARKER(isp, chan, val)	\
    if (IS_FC(isp)) {				\
	FCPARAM(isp, chan)->sendmarker = val;	\
    } else {					\
	SDPARAM(isp, chan)->sendmarker = val;	\
    }

#define	ISP_TST_SENDMARKER(isp, chan)		\
    (IS_FC(isp)?				\
	FCPARAM(isp, chan)->sendmarker != 0 :	\
	SDPARAM(isp, chan)->sendmarker != 0)

/*
 * ISP Driver Run States
 */
#define	ISP_NILSTATE	0
#define	ISP_CRASHED	1
#define	ISP_RESETSTATE	2
#define	ISP_INITSTATE	3
#define	ISP_RUNSTATE	4

/*
 * ISP Runtime Configuration Options
 */
#define	ISP_CFG_FULL_DUPLEX	0x01	/* Full Duplex (Fibre Channel only) */
#define	ISP_CFG_PORT_PREF	0x0c	/* Mask for Port Prefs (all FC except 2100) */
#define	ISP_CFG_LPORT		0x00	/* prefer {N/F}L-Port connection */
#define	ISP_CFG_NPORT		0x04	/* prefer {N/F}-Port connection */
#define	ISP_CFG_NPORT_ONLY	0x08	/* insist on {N/F}-Port connection */
#define	ISP_CFG_LPORT_ONLY	0x0c	/* insist on {N/F}L-Port connection */
#define	ISP_CFG_ONEGB		0x10	/* force 1GB connection (23XX only) */
#define	ISP_CFG_TWOGB		0x20	/* force 2GB connection (23XX only) */
#define	ISP_CFG_NORELOAD	0x80	/* don't download f/w */
#define	ISP_CFG_NONVRAM		0x40	/* ignore NVRAM */
#define	ISP_CFG_NOFCTAPE	0x100	/* disable FC-Tape */
#define	ISP_CFG_FCTAPE		0x200	/* enable FC-Tape */
#define	ISP_CFG_OWNFSZ		0x400	/* override NVRAM frame size */
#define	ISP_CFG_OWNLOOPID	0x800	/* override NVRAM loopid */
#define	ISP_CFG_OWNEXCTHROTTLE	0x1000	/* override NVRAM execution throttle */
#define	ISP_CFG_FOURGB		0x2000	/* force 4GB connection (24XX only) */
#define	ISP_CFG_EIGHTGB		0x4000	/* force 8GB connection (25XX only) */
#define	ISP_CFG_SIXTEENGB	0x8000	/* force 16GB connection (82XX only) */

/*
 * For each channel, the outer layers should know what role that channel
 * will take: ISP_ROLE_NONE, ISP_ROLE_INITIATOR, ISP_ROLE_TARGET,
 * ISP_ROLE_BOTH.
 *
 * If you set ISP_ROLE_NONE, the cards will be reset, new firmware loaded,
 * NVRAM read, and defaults set, but any further initialization (e.g.
 * INITIALIZE CONTROL BLOCK commands for 2X00 cards) won't be done.
 *
 * If INITIATOR MODE isn't set, attempts to run commands will be stopped
 * at isp_start and completed with the equivalent of SELECTION TIMEOUT.
 *
 * If TARGET MODE is set, it doesn't mean that the rest of target mode support
 * needs to be enabled, or will even work. What happens with the 2X00 cards
 * here is that if you have enabled it with TARGET MODE as part of the ICB
 * options, but you haven't given the f/w any ram resources for ATIOs or
 * Immediate Notifies, the f/w just handles what it can and you never see
 * anything. Basically, it sends a single byte of data (the first byte,
 * which you can set as part of the INITIALIZE CONTROL BLOCK command) for
 * INQUIRY, and sends back QUEUE FULL status for any other command.
 *
 */
#define	ISP_ROLE_NONE		0x0
#define	ISP_ROLE_TARGET		0x1
#define	ISP_ROLE_INITIATOR	0x2
#define	ISP_ROLE_BOTH		(ISP_ROLE_TARGET|ISP_ROLE_INITIATOR)
#define	ISP_ROLE_EITHER		ISP_ROLE_BOTH
#ifndef	ISP_DEFAULT_ROLES
/*
 * Counterintuitively, we prefer to default to role 'none'
 * if we are enable target mode support. This gives us the
 * maximum flexibility as to which port will do what.
 */
#ifdef	ISP_TARGET_MODE
#define	ISP_DEFAULT_ROLES	ISP_ROLE_NONE
#else
#define	ISP_DEFAULT_ROLES	ISP_ROLE_INITIATOR
#endif
#endif

/*
 * Firmware related defines
 */
#define	ISP_CODE_ORG			0x1000	/* default f/w code start */
#define	ISP_CODE_ORG_2300		0x0800	/* ..except for 2300s */
#define	ISP_CODE_ORG_2400		0x100000 /* ..and 2400s */
#define	ISP_FW_REV(maj, min, mic)	((maj << 24) | (min << 16) | mic)
#define	ISP_FW_MAJOR(code)		((code >> 24) & 0xff)
#define	ISP_FW_MINOR(code)		((code >> 16) & 0xff)
#define	ISP_FW_MICRO(code)		((code >>  8) & 0xff)
#define	ISP_FW_REVX(xp)			((xp[0]<<24) | (xp[1] << 16) | xp[2])
#define	ISP_FW_MAJORX(xp)		(xp[0])
#define	ISP_FW_MINORX(xp)		(xp[1])
#define	ISP_FW_MICROX(xp)		(xp[2])
#define	ISP_FW_NEWER_THAN(i, major, minor, micro)		\
 (ISP_FW_REVX((i)->isp_fwrev) > ISP_FW_REV(major, minor, micro))
#define	ISP_FW_OLDER_THAN(i, major, minor, micro)		\
 (ISP_FW_REVX((i)->isp_fwrev) < ISP_FW_REV(major, minor, micro))

/*
 * Bus (implementation) types
 */
#define	ISP_BT_PCI		0	/* PCI Implementations */
#define	ISP_BT_SBUS		1	/* SBus Implementations */

/*
 * If we have not otherwise defined SBus support away make sure
 * it is defined here such that the code is included as default
 */
#ifndef	ISP_SBUS_SUPPORTED
#define	ISP_SBUS_SUPPORTED	1
#endif

/*
 * Chip Types
 */
#define	ISP_HA_SCSI		0xf
#define	ISP_HA_SCSI_UNKNOWN	0x1
#define	ISP_HA_SCSI_1020	0x2
#define	ISP_HA_SCSI_1020A	0x3
#define	ISP_HA_SCSI_1040	0x4
#define	ISP_HA_SCSI_1040A	0x5
#define	ISP_HA_SCSI_1040B	0x6
#define	ISP_HA_SCSI_1040C	0x7
#define	ISP_HA_SCSI_1240	0x8
#define	ISP_HA_SCSI_1080	0x9
#define	ISP_HA_SCSI_1280	0xa
#define	ISP_HA_SCSI_10160	0xb
#define	ISP_HA_SCSI_12160	0xc
#define	ISP_HA_FC		0xf0
#define	ISP_HA_FC_2100		0x10
#define	ISP_HA_FC_2200		0x20
#define	ISP_HA_FC_2300		0x30
#define	ISP_HA_FC_2312		0x40
#define	ISP_HA_FC_2322		0x50
#define	ISP_HA_FC_2400		0x60
#define	ISP_HA_FC_2500		0x70

#define	IS_SCSI(isp)	(isp->isp_type & ISP_HA_SCSI)
#define	IS_1020(isp)	(isp->isp_type < ISP_HA_SCSI_1240)
#define	IS_1240(isp)	(isp->isp_type == ISP_HA_SCSI_1240)
#define	IS_1080(isp)	(isp->isp_type == ISP_HA_SCSI_1080)
#define	IS_1280(isp)	(isp->isp_type == ISP_HA_SCSI_1280)
#define	IS_10160(isp)	(isp->isp_type == ISP_HA_SCSI_10160)
#define	IS_12160(isp)	(isp->isp_type == ISP_HA_SCSI_12160)

#define	IS_12X0(isp)	(IS_1240(isp) || IS_1280(isp))
#define	IS_1X160(isp)	(IS_10160(isp) || IS_12160(isp))
#define	IS_DUALBUS(isp)	(IS_12X0(isp) || IS_12160(isp))
#define	IS_ULTRA2(isp)	(IS_1080(isp) || IS_1280(isp) || IS_1X160(isp))
#define	IS_ULTRA3(isp)	(IS_1X160(isp))

#define	IS_FC(isp)	((isp)->isp_type & ISP_HA_FC)
#define	IS_2100(isp)	((isp)->isp_type == ISP_HA_FC_2100)
#define	IS_2200(isp)	((isp)->isp_type == ISP_HA_FC_2200)
#define	IS_23XX(isp)	((isp)->isp_type >= ISP_HA_FC_2300 && \
				(isp)->isp_type < ISP_HA_FC_2400)
#define	IS_2300(isp)	((isp)->isp_type == ISP_HA_FC_2300)
#define	IS_2312(isp)	((isp)->isp_type == ISP_HA_FC_2312)
#define	IS_2322(isp)	((isp)->isp_type == ISP_HA_FC_2322)
#define	IS_24XX(isp)	((isp)->isp_type >= ISP_HA_FC_2400)
#define	IS_25XX(isp)	((isp)->isp_type >= ISP_HA_FC_2500)

/*
 * DMA related macros
 */
#define	DMA_WD3(x)	(((uint16_t)(((uint64_t)x) >> 48)) & 0xffff)
#define	DMA_WD2(x)	(((uint16_t)(((uint64_t)x) >> 32)) & 0xffff)
#define	DMA_WD1(x)	((uint16_t)((x) >> 16) & 0xffff)
#define	DMA_WD0(x)	((uint16_t)((x) & 0xffff))

#define	DMA_LO32(x)	((uint32_t) (x))
#define	DMA_HI32(x)	((uint32_t)(((uint64_t)x) >> 32))

/*
 * Core System Function Prototypes
 */

/*
 * Reset Hardware. Totally. Assumes that you'll follow this with a call to isp_init.
 */
void isp_reset(ispsoftc_t *, int);

/*
 * Initialize Hardware to known state
 */
void isp_init(ispsoftc_t *);

/*
 * Reset the ISP and call completion for any orphaned commands.
 */
void isp_reinit(ispsoftc_t *, int);

/*
 * Internal Interrupt Service Routine
 *
 * The outer layers do the spade work to get the appropriate status register,
 * semaphore register and first mailbox register (if appropriate). This also
 * means that most spurious/bogus interrupts not for us can be filtered first.
 */
void isp_intr(ispsoftc_t *, uint32_t, uint16_t, uint16_t);

/*
 * Command Entry Point- Platform Dependent layers call into this
 */
int isp_start(XS_T *);

/* these values are what isp_start returns */
#define	CMD_COMPLETE	101	/* command completed */
#define	CMD_EAGAIN	102	/* busy- maybe retry later */
#define	CMD_QUEUED	103	/* command has been queued for execution */
#define	CMD_RQLATER 	104	/* requeue this command later */

/*
 * Command Completion Point- Core layers call out from this with completed cmds
 */
void isp_done(XS_T *);

/*
 * Platform Dependent to External to Internal Control Function
 *
 * Assumes locks are held on entry. You should note that with many of
 * these commands locks may be released while this function is called.
 *
 * ... ISPCTL_RESET_BUS, int channel);
 *        Reset BUS on this channel
 * ... ISPCTL_RESET_DEV, int channel, int target);
 *        Reset Device on this channel at this target.
 * ... ISPCTL_ABORT_CMD, XS_T *xs);
 *        Abort active transaction described by xs.
 * ... IPCTL_UPDATE_PARAMS);
 *        Update any operating parameters (speed, etc.)
 * ... ISPCTL_FCLINK_TEST, int channel);
 *        Test FC link status on this channel
 * ... ISPCTL_SCAN_FABRIC, int channel);
 *        Scan fabric on this channel
 * ... ISPCTL_SCAN_LOOP, int channel);
 *        Scan local loop on this channel
 * ... ISPCTL_PDB_SYNC, int channel);
 *        Synchronize port database on this channel
 * ... ISPCTL_SEND_LIP, int channel);
 *        Send a LIP on this channel
 * ... ISPCTL_GET_NAMES, int channel, int np, uint64_t *wwnn, uint64_t *wwpn)
 *        Get a WWNN/WWPN for this N-port handle on this channel
 * ... ISPCTL_RUN_MBOXCMD, mbreg_t *mbp)
 *        Run this mailbox command
 * ... ISPCTL_GET_PDB, int channel, int nphandle, isp_pdb_t *pdb)
 *        Get PDB on this channel for this N-port handle
 * ... ISPCTL_PLOGX, isp_plcmd_t *)
 *        Performa a port login/logout
 *
 * ISPCTL_PDB_SYNC is somewhat misnamed. It actually is the final step, in
 * order, of ISPCTL_FCLINK_TEST, ISPCTL_SCAN_FABRIC, and ISPCTL_SCAN_LOOP.
 * The main purpose of ISPCTL_PDB_SYNC is to complete management of logging
 * and logging out of fabric devices (if one is on a fabric) and then marking
 * the 'loop state' as being ready to now be used for sending commands to
 * devices. Originally fabric name server and local loop scanning were
 * part of this function. It's now been separated to allow for finer control.
 */
typedef enum {
	ISPCTL_RESET_BUS,
	ISPCTL_RESET_DEV,
	ISPCTL_ABORT_CMD,
	ISPCTL_UPDATE_PARAMS,
	ISPCTL_FCLINK_TEST,
	ISPCTL_SCAN_FABRIC,
	ISPCTL_SCAN_LOOP,
	ISPCTL_PDB_SYNC,
	ISPCTL_SEND_LIP,
	ISPCTL_GET_NAMES,
	ISPCTL_RUN_MBOXCMD,
	ISPCTL_GET_PDB,
	ISPCTL_PLOGX
} ispctl_t;
int isp_control(ispsoftc_t *, ispctl_t, ...);

/*
 * Platform Dependent to Internal to External Control Function
 */

typedef enum {
	ISPASYNC_NEW_TGT_PARAMS,	/* SPI New Target Parameters */
	ISPASYNC_BUS_RESET,		/* All Bus Was Reset */
	ISPASYNC_LOOP_DOWN,		/* FC Loop Down */
	ISPASYNC_LOOP_UP,		/* FC Loop Up */
	ISPASYNC_LIP,			/* FC LIP Received */
	ISPASYNC_LOOP_RESET,		/* FC Loop Reset Received */
	ISPASYNC_CHANGE_NOTIFY,		/* FC Change Notification */
	ISPASYNC_DEV_ARRIVED,		/* FC Device Arrived */
	ISPASYNC_DEV_CHANGED,		/* FC Device Changed */
	ISPASYNC_DEV_STAYED,		/* FC Device Stayed */
	ISPASYNC_DEV_GONE,		/* FC Device Departure */
	ISPASYNC_TARGET_NOTIFY,		/* All target async notification */
	ISPASYNC_TARGET_NOTIFY_ACK,	/* All target notify ack required */
	ISPASYNC_TARGET_ACTION,		/* All target action requested */
	ISPASYNC_FW_CRASH,		/* All Firmware has crashed */
	ISPASYNC_FW_RESTARTED		/* All Firmware has been restarted */
} ispasync_t;
void isp_async(ispsoftc_t *, ispasync_t, ...);

#define	ISPASYNC_CHANGE_PDB	0
#define	ISPASYNC_CHANGE_SNS	1
#define	ISPASYNC_CHANGE_OTHER	2

/*
 * Platform Independent Error Prinout
 */
void isp_prt_endcmd(ispsoftc_t *, XS_T *);

/*
 * Platform Dependent Error and Debug Printout
 *
 * Two required functions for each platform must be provided:
 *
 *    void isp_prt(ispsoftc_t *, int level, const char *, ...)
 *    void isp_xs_prt(ispsoftc_t *, XS_T *, int level, const char *, ...)
 *
 * but due to compiler differences on different platforms this won't be
 * formally defined here. Instead, they go in each platform definition file.
 */

#define	ISP_LOGALL	0x0	/* log always */
#define	ISP_LOGCONFIG	0x1	/* log configuration messages */
#define	ISP_LOGINFO	0x2	/* log informational messages */
#define	ISP_LOGWARN	0x4	/* log warning messages */
#define	ISP_LOGERR	0x8	/* log error messages */
#define	ISP_LOGDEBUG0	0x10	/* log simple debug messages */
#define	ISP_LOGDEBUG1	0x20	/* log intermediate debug messages */
#define	ISP_LOGDEBUG2	0x40	/* log most debug messages */
#define	ISP_LOGDEBUG3	0x80	/* log high frequency debug messages */
#define	ISP_LOG_SANCFG	0x100	/* log SAN configuration */
#define	ISP_LOG_CWARN	0x200	/* log SCSI command "warnings" (e.g., check conditions) */
#define	ISP_LOG_WARN1	0x400	/* log WARNS we might be interested at some time */
#define	ISP_LOGTINFO	0x1000	/* log informational messages (target mode) */
#define	ISP_LOGTDEBUG0	0x2000	/* log simple debug messages (target mode) */
#define	ISP_LOGTDEBUG1	0x4000	/* log intermediate debug messages (target) */
#define	ISP_LOGTDEBUG2	0x8000	/* log all debug messages (target) */

/*
 * Each Platform provides it's own isposinfo substructure of the ispsoftc
 * defined above.
 *
 * Each platform must also provide the following macros/defines:
 *
 *
 *	ISP_FC_SCRLEN				FC scratch area DMA length
 *
 *	ISP_MEMZERO(dst, src)			platform zeroing function
 *	ISP_MEMCPY(dst, src, count)		platform copying function
 *	ISP_SNPRINTF(buf, bufsize, fmt, ...)	snprintf
 *	ISP_DELAY(usecs)			microsecond spindelay function
 *	ISP_SLEEP(isp, usecs)			microsecond sleep function
 *
 *	ISP_INLINE				___inline or not- depending on how
 *						good your debugger is
 *	ISP_MIN					shorthand for ((a) < (b))? (a) : (b)
 *
 *	NANOTIME_T				nanosecond time type
 *
 *	GET_NANOTIME(NANOTIME_T *)		get current nanotime.
 *
 *	GET_NANOSEC(NANOTIME_T *)		get uint64_t from NANOTIME_T
 *
 *	NANOTIME_SUB(NANOTIME_T *, NANOTIME_T *)
 *						subtract two NANOTIME_T values
 *
 *	MAXISPREQUEST(ispsoftc_t *)		maximum request queue size
 *						for this particular board type
 *
 *	MEMORYBARRIER(ispsoftc_t *, barrier_type, offset, size, chan)
 *
 *		Function/Macro the provides memory synchronization on
 *		various objects so that the ISP's and the system's view
 *		of the same object is consistent.
 *
 *	MBOX_ACQUIRE(ispsoftc_t *)		acquire lock on mailbox regs
 *	MBOX_WAIT_COMPLETE(ispsoftc_t *, mbreg_t *) wait for cmd to be done
 *	MBOX_NOTIFY_COMPLETE(ispsoftc_t *)	notification of mbox cmd donee
 *	MBOX_RELEASE(ispsoftc_t *)		release lock on mailbox regs
 *
 *	FC_SCRATCH_ACQUIRE(ispsoftc_t *, chan)	acquire lock on FC scratch area
 *						return -1 if you cannot
 *	FC_SCRATCH_RELEASE(ispsoftc_t *, chan)	acquire lock on FC scratch area
 *
 *	FCP_NEXT_CRN(ispsoftc_t *, XS_T *, rslt, channel, target, lun)	generate the next command reference number. XS_T * may be null.
 *
 *	SCSI_GOOD	SCSI 'Good' Status
 *	SCSI_CHECK	SCSI 'Check Condition' Status
 *	SCSI_BUSY	SCSI 'Busy' Status
 *	SCSI_QFULL	SCSI 'Queue Full' Status
 *
 *	XS_T			Platform SCSI transaction type (i.e., command for HBA)
 *	XS_DMA_ADDR_T		Platform PCI DMA Address Type
 *	XS_GET_DMA_SEG(..)	Get 32 bit dma segment list value
 *	XS_GET_DMA64_SEG(..)	Get 64 bit dma segment list value
 *	XS_ISP(xs)		gets an instance out of an XS_T
 *	XS_CHANNEL(xs)		gets the channel (bus # for DUALBUS cards) ""
 *	XS_TGT(xs)		gets the target ""
 *	XS_LUN(xs)		gets the lun ""
 *	XS_CDBP(xs)		gets a pointer to the scsi CDB ""
 *	XS_CDBLEN(xs)		gets the CDB's length ""
 *	XS_XFRLEN(xs)		gets the associated data transfer length ""
 *	XS_TIME(xs)		gets the time (in milliseconds) for this command
 *	XS_GET_RESID(xs)	gets the current residual count
 *	XS_GET_RESID(xs, resid)	sets the current residual count
 *	XS_STSP(xs)		gets a pointer to the SCSI status byte ""
 *	XS_SNSP(xs)		gets a pointer to the associate sense data
 *	XS_TOT_SNSLEN(xs)	gets the total length of sense data storage
 *	XS_CUR_SNSLEN(xs)	gets the currently used lenght of sense data storage
 *	XS_SNSKEY(xs)		dereferences XS_SNSP to get the current stored Sense Key
 *	XS_SNSASC(xs)		dereferences XS_SNSP to get the current stored Additional Sense Code
 *	XS_SNSASCQ(xs)		dereferences XS_SNSP to get the current stored Additional Sense Code Qualifier
 *	XS_TAG_P(xs)		predicate of whether this command should be tagged
 *	XS_TAG_TYPE(xs)		which type of tag to use
 *	XS_SETERR(xs)		set error state
 *
 *		HBA_NOERROR	command has no erros
 *		HBA_BOTCH	hba botched something
 *		HBA_CMDTIMEOUT	command timed out
 *		HBA_SELTIMEOUT	selection timed out (also port logouts for FC)
 *		HBA_TGTBSY	target returned a BUSY status
 *		HBA_BUSRESET	bus reset destroyed command
 *		HBA_ABORTED	command was aborted (by request)
 *		HBA_DATAOVR	a data overrun was detected
 *		HBA_ARQFAIL	Automatic Request Sense failed
 *
 *	XS_ERR(xs)	return current error state
 *	XS_NOERR(xs)	there is no error currently set
 *	XS_INITERR(xs)	initialize error state
 *
 *	XS_SAVE_SENSE(xs, sp, total_len, this_len)	save sense data (total and current amount)
 *
 *	XS_APPEND_SENSE(xs, sp, len)	append more sense data
 *
 *	XS_SENSE_VALID(xs)		indicates whether sense is valid
 *
 *	DEFAULT_FRAMESIZE(ispsoftc_t *)		Default Frame Size
 *	DEFAULT_EXEC_THROTTLE(ispsoftc_t *)	Default Execution Throttle
 *
 *	GET_DEFAULT_ROLE(ispsoftc_t *, int)	Get Default Role for a channel
 *	SET_DEFAULT_ROLE(ispsoftc_t *, int, int) Set Default Role for a channel
 *	DEFAULT_IID(ispsoftc_t *, int)		Default SCSI initiator ID
 *	DEFAULT_LOOPID(ispsoftc_t *, int)	Default FC Loop ID
 *
 *		These establish reasonable defaults for each platform.
 * 		These must be available independent of card NVRAM and are
 *		to be used should NVRAM not be readable.
 *
 *	DEFAULT_NODEWWN(ispsoftc_t *, chan)	Default FC Node WWN to use
 *	DEFAULT_PORTWWN(ispsoftc_t *, chan)	Default FC Port WWN to use
 *
 *		These defines are hooks to allow the setting of node and
 *		port WWNs when NVRAM cannot be read or is to be overriden.
 *
 *	ACTIVE_NODEWWN(ispsoftc_t *, chan)	FC Node WWN to use
 *	ACTIVE_PORTWWN(ispsoftc_t *, chan)	FC Port WWN to use
 *
 *		After NVRAM is read, these will be invoked to get the
 *		node and port WWNs that will actually be used for this
 *		channel.
 *
 *
 *	ISP_IOXPUT_8(ispsoftc_t *, uint8_t srcval, uint8_t *dstptr)
 *	ISP_IOXPUT_16(ispsoftc_t *, uint16_t srcval, uint16_t *dstptr)
 *	ISP_IOXPUT_32(ispsoftc_t *, uint32_t srcval, uint32_t *dstptr)
 *
 *	ISP_IOXGET_8(ispsoftc_t *, uint8_t *srcptr, uint8_t dstrval)
 *	ISP_IOXGET_16(ispsoftc_t *, uint16_t *srcptr, uint16_t dstrval)
 *	ISP_IOXGET_32(ispsoftc_t *, uint32_t *srcptr, uint32_t dstrval)
 *
 *	ISP_SWIZZLE_NVRAM_WORD(ispsoftc_t *, uint16_t *)
 *	ISP_SWIZZLE_NVRAM_LONG(ispsoftc_t *, uint32_t *)
 *	ISP_SWAP16(ispsoftc_t *, uint16_t srcval)
 *	ISP_SWAP32(ispsoftc_t *, uint32_t srcval)
 */

#ifdef	ISP_TARGET_MODE
/*
 * The functions below are for the publicly available
 * target mode functions that are internal to the Qlogic driver.
 */

/*
 * This function handles new response queue entry appropriate for target mode.
 */
int isp_target_notify(ispsoftc_t *, void *, uint32_t *);

/*
 * This function externalizes the ability to acknowledge an Immediate Notify request.
 */
int isp_notify_ack(ispsoftc_t *, void *);

/*
 * This function externalized acknowledging (success/fail) an ABTS frame
 */
int isp_acknak_abts(ispsoftc_t *, void *, int);

/*
 * Enable/Disable/Modify a logical unit.
 * (softc, cmd, bus, tgt, lun, cmd_cnt, inotify_cnt)
 */
#define	DFLT_CMND_CNT	0xff	/* unmonitored */
#define	DFLT_INOT_CNT	0xff	/* unmonitored */
int isp_lun_cmd(ispsoftc_t *, int, int, int, int, int);

/*
 * General request queue 'put' routine for target mode entries.
 */
int isp_target_put_entry(ispsoftc_t *isp, void *);

/*
 * General routine to put back an ATIO entry-
 * used for replenishing f/w resource counts.
 * The argument is a pointer to a source ATIO
 * or ATIO2.
 */
int isp_target_put_atio(ispsoftc_t *, void *);

/*
 * General routine to send a final CTIO for a command- used mostly for
 * local responses.
 */
int isp_endcmd(ispsoftc_t *, ...);
#define	ECMD_SVALID	0x100
#define	ECMD_TERMINATE	0x200

/*
 * Handle an asynchronous event
 *
 * Return nonzero if the interrupt that generated this event has been dismissed.
 */
int isp_target_async(ispsoftc_t *, int, int);
#endif
#endif	/* _ISPVAR_H */